hdu1398 Square Coins（母函数模板题）

#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<iomanip>
#include<set>
#include<stack>
#include<ctime>
#include<queue>
#define LOCAL
#define pi 3.1415926
#define e 2.718281828459
#define mst(a,b) memset(a,b,sizeof(a))
const int  INF = 0x3f3f3f3f;
using namespace std;

int main(){
int n;int c1[400], c2[400];
while(~scanf("%d",&n)){
if(n == 0) break;
for(int i = 0; i <= n; i++){
c1[i] = 1;
c2[i] = 0;
}
for(int i = 2; i*i <= n; i++){//这里修改一下 价值是原来的平方，判断标准也要改变
for(int j = 0; j <= n; j++)
for(int k = 0; k+j <= n; k += i*i)//这里也修改一下 k要向前迈一大步~~
c2[k+j] += c1[j];
for(int j = 0; j <= n; j++){
c1[j] = c2[j];
c2[j] = 0;
}
}
printf("%d\n",c1
);
}
return 0;
}