ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#213047 | #4. 爬楼梯 | walle2012 | Judgement Failed | / | / | C++ | 234b | 2024-11-04 22:19:09 | 2024-11-04 22:19:10 |
answer
#include <bits/stdc++.h>
using namespace std;
long long ret[100];
int main()
{
int n;
scanf("%d",&n);
ret[1]=1;
ret[2]=2;
for(int i=3;i<=n;i++)
{
ret[i]=ret[i-1]+ret[i-2];
}
printf("%lld",ret[n]);
return 0;
}
Details
Failed to show details