Run ID | Author | Problem | Lang | Verdict | Time | Memory | Code Length | Submit Time |
---|---|---|---|---|---|---|---|---|
41509 | liusiyu | 上台阶_记忆化递归 | C++ | Wrong Answer | 1 MS | 256 KB | 330 | 2024-02-21 11:16:12 |
#include<bits/stdc++.h> using namespace std; int main() { int n,cnt=0; int a[35]={},b[35]={}; while(cin>>n){ if(n==0) break; a[1]=1; a[2]=2; a[3]=4; for(int i=4;i<=n;i++){ a[i]=a[i-1]+a[i-2]+a[i-3]; } b[cnt]=a[n]; cnt++; } for(int i=0;i<cnt;i++){ cout<<b[i]<<endl; } return 0; }