牛牛学数列6

int main()
{
    int n,b[20],t;
    scanf("%d",&n);
    b[0]=0,b[1]=1,b[2]=1;
    for(int i=3;i<=n;i++)
    {
        if(i%2==0)
        {
            t=i/2;
            b[i]=b[i-3]+2*b[t]+b[i-1];
        }
        else
        {
            t=(i+1)/2;
            b[i]=b[i-3]+2*b[t]+b[i-1];
        }
    }
    printf("%d",b[n-1]);
    return 0;
}