hdu 2501 Tiling_easy version （水题）

#include <iostream>
#include <cstring>
#include <cstdio>
using namespace std;

const int MAX_ = 50;

int dp[MAX_];

int dfs(int n){
if(dp
)return dp
;
if(n == 1)return dp
= 1;
if(n == 2)return dp
= 3;
int cnt = 0;
cnt +=  2*dfs(n-2) + dfs(n-1);
return dp
= cnt;
}

int main()
{
memset(dp,0,sizeof(dp));
dfs(30);
int n, Case;
scanf("%d",&Case);
while(Case--){
scanf("%d",&n);
printf("%d\n",dp
);
}
return 0;
}