生成函数裸用比较简单,结合卷积出组合题目较为困难.
学习
https://blog.csdn.net/qq_41357771/article/details/83449481
http://blog.csdn.net/xiaofei_it/article/details/17042651
https://blog.csdn.net/qq_40379678/article/details/88879204
板子题
hdu1028
#include <iostream>
#include <cstdio>
using namespace std;
int c1[130], c2[130];
int main(){
int nNum;
while(cin >> nNum)
{
for(int i = 0; i <= nNum; i++)
{
c1[i] = 1; c2[i] = 0;
}
for(int i = 2; i <= nNum; i++)
{
for(int j = 0; j <= nNum; j++)
for(int k = 0; k+j <= nNum; k+=i)
c2[k+j] += c1[j];
for(int j = 0; j <= nNum; j++)
{
c1[j] = c2[j];
c2[j] = 0;
}
}
cout << c1[nNum] << endl;
}
return 0;
}