HDU1028——I gnatius and the Princess III

母函数，不解释……

#include <stdio.h>
#define N 10001

int c1[N], c2[N];

int main()
{
    int n,i,j,k;
    while (scanf("%d", &n) != EOF )
    {
        for (i=0;i<=n;i++)
        {
            c1[i]=0;
            c2[i]=0;
        }
        for (i=0;i<=n;i++)
        {
           c1[i]=1;
        }
        for (i=2;i<=n;i++)
        {
           for (j=0;j<=n;j++)
           {
               for (k=0;k+j<=n;k+=i)
               {
                   c2[j+k] += c1[j];
               }
           }
           for (j=0;j<=n;j++)
           {
               c1[j]=c2[j];
               c2[j]=0;
           }
        }
       printf("%d\n", c1[n]);
    }
    return 0;
}