1.题目链接。意思很明确了,就是给你一些硬币和一个值,求用这些硬币组成这个值的方案数量。典型的母函数,把我们前边的模版参数改一下就A了。代码如下:
#include<bits/stdc++.h>
#include<iostream>
#include<algorithm>
using namespace std;
const int MAX = 1e4 + 10;
int v[MAX];//权值
int a[MAX], b[MAX];
#pragma warning(disable:4996)
int main()
{
for (int i = 1; i <=17; i++)
{
v[i] = i * i;
}
int n;
while (scanf("%d", &n) && n)
{
memset(a, 0, sizeof(a));
a[0] = 1;
for (int i = 1; i <= 17; i++)
{
memset(b, 0, sizeof(b));
for (int j = 0; j*v[i] <= n; j++)
for (int k = 0; k + j * v[i] <= n; k++)
b[k + j * v[i]] += a[k];
memcpy(a, b, sizeof(b));
}
printf("%d\n", a[n]);
}
return 0;
}