Run ID | Author | Problem | Lang | Verdict | Time | Memory | Code Length | Submit Time |
---|---|---|---|---|---|---|---|---|
63521 | teacher_wang | 菲波那契数列 | C++ | Accepted | 6 MS | 4156 KB | 327 | 2025-03-29 16:42:26 |
#include<bits/stdc++.h> using namespace std; int main() { int fib[1000010] = {1,1}; int n,a; cin>>n; for(int j = 2; j < 1000000; j ++) { fib[j] = fib[j-1] + fib[j-2]; fib[j] %= 1000; } for(int i = 1; i <= n; i ++) { cin>>a; cout<<fib[a-1]%1000<<endl; } return 0; }