- 菲波那契数列(2)
美味的递推使我脑干旋转
- @ 2026-11-21 11:11:19
#include <bits/stdc++.h>
using namespace std;
int main() {
int f[1000005];
f[1]=1;
f[2]=1;
for( int i =3; i <= 1000000; i++)
{
f[i]=(f[i-1]+f[i-2]) % 1000;
}
int num;
cin >> num;
vector<long long>v;
for( int i =1; i <= num; i++)
{
int m;
cin >> m;
v.push_back(m);
}
for( int i =0; i < num; i++)
{
cout << f[v[i]] << endl;
}
return 0;
}
0 comments
No comments so far...
Information
- ID
- 684
- Time
- 1000ms
- Memory
- 256MiB
- Difficulty
- 7
- Tags
- (None)
- # Submissions
- 236
- Accepted
- 51
- Uploaded By