Run ID | Author | Problem | Lang | Verdict | Time | Memory | Code Length | Submit Time |
---|---|---|---|---|---|---|---|---|
30349 | lmz120809 | 菲波那契数列-递归 | C++ | Accepted | 0 MS | 256 KB | 290 | 2023-11-07 20:27:15 |
#include<iostream> using namespace std; int fib[510]; int fibo(int n){ if(fib[n]!=0) return fib[n]; if(n<=2) fib[n]=1; else fib[n]=fibo(n-1)+fibo(n-2); return fib[n]; } int main() { int m; cin>>m; while(m--){ int a; cin>>a; cout<<fibo(a)<<endl; } return 0; }