母函数例题.docVIP

母函数模板 Problem 求用1、2、3的邮票贴出不同数值的方案数。因邮票允许重复，故母函数为：以展开后的x4为例，其系数为4，即4拆分成1、2、3之和的拆分数为4；即 4=1+1+1+1=1+1+2=1+3=2+2 #include iostream using namespace std; const int max=10001; int c1[max]; // c1是保存int c2[max]; // c2是保存一次中间量 int main() int n; int i,j,k; while(cinn) { for(i=0;i=n;i++) { c1[i]=1; //第1个多项式的各项系数 c2[i]=0; } for(i=2;i=n;i++) //第1个多项式乘以第2、3、…多项式 { for(j=0;j=n;j++) for(k=0; k+j=n; k+=i) // k=0、i、2*i、3*i、… { c2[j+k]+=c1[j]; //合并同类项 } for(j=0;j=n;j++) { c1[j]=c2[j]; //保存中间结果 c2[j]=0; } } coutc1[n]endl; return 0; } HDOJ 1389 Square Coins 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 2 10 30 0 Sample Output 1 4 27 分析 G(x)=(1+x+x2+x3+x4+…)(1+x4+x8+x12+…)(1+x9+x18+x27+…)… 其中(1+x+x2+x3+x4+…)代表Value为1的硬币的零个、一个、两个、三个 (1+x4+x8+x12+…) 代表Value为4的硬币的零个、一个、两个，三个 #include iostream using namespace std; const int max=301; int c1[max],c2[max]; int main() { int n,i,j,k; while(cinn n!=0) { for(i=0;i=n;i++) { c1[i]=1;