NOI.AC
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #170610 | #4. 爬楼梯 | one_zero_two_zero | 100 | 2ms | 1192kb | C++ | 280b | 2023-06-03 17:35:39 | 2023-06-03 17:35:41 |
answer
#include<bits/stdc++.h>
using namespace std;
int n;
long long ans[55] = {0};
int main(){
scanf("%d",&n);
ans[1] = 1,ans[2] = 2;
for(int i = 3;i <= n;i ++){
ans[i] = ans[i - 1] + ans[i - 2];
}
printf("%lld\n",ans[n]);
return 0;
}
详细
小提示：点击横条可展开更详细的信息
Test #1:
score: 10
Accepted
time: 1ms
memory: 1192kb
input:
36
output:
24157817
result:
ok 1 number(s): "24157817"
Test #2:
score: 10
Accepted
time: 1ms
memory: 1188kb
input:
30
output:
1346269
result:
ok 1 number(s): "1346269"
Test #3:
score: 10
Accepted
time: 0ms
memory: 1188kb
input:
29
output:
832040
result:
ok 1 number(s): "832040"
Test #4:
score: 10
Accepted
time: 0ms
memory: 1192kb
input:
21
output:
17711
result:
ok 1 number(s): "17711"
Test #5:
score: 10
Accepted
time: 0ms
memory: 1188kb
input:
16
output:
1597
result:
ok 1 number(s): "1597"
Test #6:
score: 10
Accepted
time: 0ms
memory: 1188kb
input:
12
output:
233
result:
ok 1 number(s): "233"
Test #7:
score: 10
Accepted
time: 0ms
memory: 1192kb
input:
9
output:
55
result:
ok 1 number(s): "55"
Test #8:
score: 10
Accepted
time: 0ms
memory: 1188kb
input:
5
output:
8
result:
ok 1 number(s): "8"
Test #9:
score: 10
Accepted
time: 0ms
memory: 1188kb
input:
4
output:
5
result:
ok 1 number(s): "5"
Test #10:
score: 10
Accepted
time: 0ms
memory: 1188kb
input:
1
output:
1
result:
ok 1 number(s): "1"
