- 菲波那契数列(2)
最烦的TLE来了，求解
-
(Congratulations!)国贸王沐阳 LV 8 (47/47) @ 2025-3-12 21:42:09
#include<bits/stdc++.h>
using namespace std;
long long a[10000000];
long long fib(long long s){
a[1]=1,a[2]=1;
for(int i=3;i<=s;i++){
a[i]=a[i-2]+a[i-1];
}
==return a[s]%1000;==
}
int main(){
long long b,x;
cin>>b;
for(long long i=0;i<b;i++){
cin>>x;
cout<<fib(x)<<endl;
}
}
2 条评论
-
(Congratulations!)国贸王沐阳 LV 8 (47/47) @ 2025-3-13 21:06:04
Your eyes are a few not good.
-
@ 2025-3-13 19:23:49
不是WA吗
#include <bits/stdc++.h> using namespace std; int b[1000001]={1,1}; int main() { int n; cin>>n; int a[n]; for(int i=0; i<n; i++) { cin>>a[i]; } for(int i=2; i<=1000000; i++) { b[i]=(b[i-1]+b[i-2])%1000; } for(int i=0; i<n; i++) { cout<<b[a[i]-1]<<endl; } }
- 1
