Run ID | Author | Problem | Lang | Verdict | Time | Memory | Code Length | Submit Time |
---|---|---|---|---|---|---|---|---|
41656 | jiabokai | 上台阶_记忆化递归 | C++ | Wrong Answer | 0 MS | 252 KB | 375 | 2024-02-22 21:00:06 |
#include<bits/stdc++.h> using namespace std; long long a[100]; long long step(int n){ if(n==1){ return a[1]; } if(n==2){ return a[2]; } if(n==3){ return a[3]; } if(a[n]!=0){ return a[n]; } a[n]=step(n-1)+step(n-2)+step(n-3); return a[n]; } int main() { int n; a[1]=1; a[2]=2; a[3]=4; while(cin>>n&&n){ cout<<step(n); } }