POJ-1953-World Cup Noise

递推后就变成熟悉的斐波那切数列

代码：

#include<cstdio>#include<cstring>#include<iostream>using namespace std;const int maxn=51;int dp[maxn];void Init(){    dp[1]=2;    dp[2]=3;    for(int i=3;i<50;i++)dp[i]=dp[i-1]+dp[i-2];}int main(){    int T,cas=1;    Init();    scanf("%d",&T);    while(T--)    { int n;scanf("%d",&n);printf("Scenario #%d:\n",cas++);printf("%d\n\n",dp[n]);    }    return 0;}