题目大意/解题策略: 简单DP+斐波那契数列
/*
UVA 10450 World Cup Noise
AC by J.Dark
ON 2013/2/28
Time 0.012s
*/
#include <iostream>
using namespace std;
const int maxn = 100000;
int main(){
long long int ans[maxn];
ans[1] = 2;
ans[2] = 3;
for(int i=3; i<maxn; i++){
ans[i] = ans[i-1] + ans[i-2];
}
int N, key;
while(cin >> N)
{
for(int j=0; j<N; j++){
cin >> key;
cout << "Scenario #" << j+1 << ":" << endl;
cout << ans[key] << endl << endl;
}
}
return 0;
}