NOI.AC
answer
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll Mod = 1e9 + 7, n, dp[100005];
int main(){
cin >> n;
dp[0] = 1;
dp[1] = 1;
for(int i = 2; i <= n; i ++) dp[i] = (dp[i - 1] + dp[i - 2]) % Mod;
cout << dp[n] << endl;
}
详细
小提示：点击横条可展开更详细的信息
Test #1:
score: 10
Accepted
time: 0ms
memory: 1196kb
input:
36
output:
24157817
result:
ok 1 number(s): "24157817"
Test #2:
score: 10
Accepted
time: 0ms
memory: 1200kb
input:
30
output:
1346269
result:
ok 1 number(s): "1346269"
Test #3:
score: 10
Accepted
time: 0ms
memory: 1196kb
input:
29
output:
832040
result:
ok 1 number(s): "832040"
Test #4:
score: 10
Accepted
time: 0ms
memory: 1200kb
input:
21
output:
17711
result:
ok 1 number(s): "17711"
Test #5:
score: 10
Accepted
time: 0ms
memory: 1200kb
input:
16
output:
1597
result:
ok 1 number(s): "1597"
Test #6:
score: 10
Accepted
time: 0ms
memory: 1200kb
input:
12
output:
233
result:
ok 1 number(s): "233"
Test #7:
score: 10
Accepted
time: 0ms
memory: 1196kb
input:
9
output:
55
result:
ok 1 number(s): "55"
Test #8:
score: 10
Accepted
time: 0ms
memory: 1196kb
input:
5
output:
8
result:
ok 1 number(s): "8"
Test #9:
score: 10
Accepted
time: 0ms
memory: 1200kb
input:
4
output:
5
result:
ok 1 number(s): "5"
Test #10:
score: 10
Accepted
time: 0ms
memory: 1196kb
input:
1
output:
1
result:
ok 1 number(s): "1"
