骨牌铺方格变形计H - Tiling_easy version(15) HDU - 2501


#include<stdio.h>
#include<stdlib.h>
#include<math.h>
int main()
{
    int n;
    int t;
    long long int f[55];
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d",&n);
        int i;
        f[1]=1;
        f[2]=3;
        for(i=3;i<=n;i++)
        {
            f[i]=f[i-1]+f[i-2]+f[i-2];
        }
        printf("%lld\n",f[n]);
    }
    return 0;
}

猜你喜欢

转载自blog.csdn.net/rangran/article/details/81748647