HDU1398 Square Coins(母函数，无限制的)

最新推荐文章于 2021-04-12 17:35:09 发布

riba2534

最新推荐文章于 2021-04-12 17:35:09 发布

阅读量468

点赞数

分类专栏：【组合数学|母函数】文章标签：母函数

本文链接：https://blog.csdn.net/riba2534/article/details/79225240

版权

【组合数学|母函数】专栏收录该内容

8 篇文章 0 订阅

订阅专栏

Problem Description

People in Silverland use square coins. Not only they have square
shapes but also their values are square numbers. Coins with values of
all square numbers up to 289 (=17^2), i.e., 1-credit coins, 4-credit
coins, 9-credit coins, …, and 289-credit coins, are available in
Silverland. There are four combinations of coins to pay ten credits:

ten 1-credit coins, one 4-credit coin and six 1-credit coins, two
4-credit coins and two 1-credit coins, and one 9-credit coin and one
1-credit coin.

Your mission is to count the number of ways to pay a given amount
using coins of Silverland.

Input

The input consists of lines each containing an integer meaning an
amount to be paid, followed by a line containing a zero. You may
assume that all the amounts are positive and less than 300.

Output

For each of the given amount, one line containing a single integer
representing the number of combinations of coins should be output. No
other characters should appear in the output.

Sample Input

Sample Output

1
4
27

思路

有面值为 $1^2,2^2,3^2,...,17^2$ 的硬币无限个，然后给出一个n，问有多少种组成方法可以组成n.

无限制的母函数问题， $(1+x+x^2+...+x^k)*(1+x^2+x^4+...+x^{2k})*...*(1+x^{17}+x^{34}+...+x^{17k})$ 展开后 $x^n$ 次方项的系数就是答案

代码

#include <cstdio>
#include <cstring>
#include <cctype>
#include <stdlib.h>
#include <string>
#include <map>
#include <iostream>
#include <stack>
#include <cmath>
#include <queue>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long ll;
#define inf 1000000
#define mem(a,b) memset(a,b,sizeof(a))
const int N=1000+7;
int a[N],b[N];
int v[N];
int main()
{
    int n;
    while(~scanf("%d",&n)&&n)
    {
        for(int i=1; i<=17; i++)
            v[i]=i*i;
        mem(a,0);
        a[0]=1;
        for (int i=1; i<=17; i++)
        {
            mem(b,0);
            for (int j=0; j*v[i]<=n; j++) //循环每个因子的每一项
                for (int k=0; k+j*v[i]<=n; k++) //循环a的每个项
                    b[k+j*v[i]]+=a[k];//把结果加到对应位
            memcpy(a,b,sizeof(b));//b赋值给a
        }
        printf("%d\n",a[n]);
    }
    return 0;
}