View Code of Problem 60

#include<stdio.h>
int main()
{
    int a[40],i,n,j=1,t;
    a[0]=2;a[1]=3;
    for(i=2;i<40;i++)                             //斐波拉契数列 
    {
        a[i] = a[i-1] + a[i-2];
    }
    scanf("%d",&n);
    for(int k=1;k<=n;k++)
    {
        scanf("%d",&t);
        if(t==0)
           printf("Scenario #%d:\n0\n\n",k);
        else
           printf("Scenario #%d:\n%d\n\n",k,a[t-1]);
    }
}