动态对斐波那契数列进行扩展
#include <iostream>
using namespace std;
int main(){
int t, n;
long long fibo[60] {0, 1, };
cin >> t;
int cur = 1;
while(cin >> n, t--){
if( n > cur ){
for (int i = cur + 1; i <= n; i++)
fibo[i] = fibo[i-2] + fibo[i-1];
cur = n;
}
printf("Fib(%d) = %lld\n", n, fibo[n]);
}
return 0;
}