杭电1398

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1398

题目大意：条件：有无限个1^2,  2^2, 3^2,  4^2......17^2    输入：n   输出：由条件有多少种组成方法使和为n

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cstdlib>
#include <cmath>
#include <set>
#include <map>
#include <vector>
using namespace std;

int main()
{
    int n, i, j, k, a[400], b[400];
    while(~scanf("%d", &n))
    {
        if(n == 0)
            break;
        for(i = 0; i <= n; i++)
        {
            a[i] = 1;
            b[i] = 0;
        }
        for(i = 2; i <= 17; i++)
        {
            for(j = 0; j <= n; j++)
            {
                for(k = 0; k + j <= n; k += i * i)
                {
                    b[k + j] += a[j];
                }
            }    
            for(j = 0; j <= n; j++)
            {
                a[j] = b[j];
                b[j] = 0;
            }
        }
        printf("%d
", a[n]);
    }
    return 0;
}