Run ID | Author | Problem | Lang | Verdict | Time | Memory | Code Length | Submit Time |
---|---|---|---|---|---|---|---|---|
53575 | littletwleve | 斐波那契数列_记忆化递归 | C++ | Wrong Answer | 1 MS | 260 KB | 321 | 2024-10-24 09:49:39 |
#include<iostream> using namespace std; int a[101];//这里将数组a全部赋值为0 int fib(int n) { if(a[n]!=0) return a[n]; if(n==1||n==2) { a[n]=1; return 1; } else{ a[n]=fib(n-1)+fib(n-2); return a[n]; } } int main() { int n; cin>>n; cout<<fib(n); return 0; }