hdu 1398 Square Coins 完全背包变形

#include <cstdio>
#include <cstring>
#include <cmath>
#include <map>
#include <queue>
#include <stack>
#include <iostream>
#include <algorithm>
using namespace std;
const int maxn=303;
const int INF=1e8;
int f[maxn];
int a[maxn];
int e[maxn];
int main()
{
    int i,j,k,n;
    for(i=1;i<=17;i++)
        a[i]=i*i;
    while(cin>>n)
    {
        if(n==0)break;
        memset(f,0,sizeof(f));
        f[0]=1;
        for(i=1;i<=17;i++)
        {
            for(j=a[i];j<=n;j++)
                f[j]+=f[j-a[i]];
        }
        cout<<f[n]<<endl;
    }
    return 0;
}