| Run ID | Author | Problem | Lang | Verdict | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|
| 58101 | 王一涵(吃土豆长大的马铃薯) | 菲波那契数列 | C++ | Accepted | 6 MS | 4156 KB | 262 | 2024-12-04 16:47:23 |
#include<iostream> using namespace std; int a[1000100]; int main() { int n,x,i; a[1]=1; a[2]=1; for(i=3;i<=1000000;i++){ a[i]=(a[i-1]+a[i-2])%1000; } cin>>n; for(i=1;i<=n;i++){ cin>>x; cout<<a[x]<<endl; } return 0; }