Run ID | Author | Problem | Lang | Verdict | Time | Memory | Code Length | Submit Time |
---|---|---|---|---|---|---|---|---|
41639 | jiabokai | 上台阶_记忆化递归 | C++ | Time Limit Exceeded | 1000 MS | 248 KB | 346 | 2024-02-22 20:40:47 |
#include<bits/stdc++.h> using namespace std; int a[80]; int step(int n){ if(n==1){ return a[1]; }else if(n==2){ return a[2]; }else if(n==3){ return a[3]; }else{ return step(n-1)+step(n-2)+step(n-3); } } int main() { int n; a[1]=1; a[2]=2; a[3]=4; while(cin>>n&&n){ cout<<step(n)<<endl; } return 0; }