POJ 2663 Tri Tiling dp 画图找规律

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

int d[50];

int main()
{
int n;
d[0]=1;
d[2]=3;
int sum=d[0]+d[2];
for(int i=4;i<=30;i+=2)
{
d[i]=d[i-2]+2*sum;
sum+=d[i];
}
while(cin>>n,n!=-1)
{
cout<<d
<<endl;
}
return 0;
}