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