题意:
给一个数n(120),求有多少个加法等式,使得和为n。
比如n = 4的时候:
4 = 4;
4 = 3 + 1;
4 = 2 + 2;
4 = 2 + 1 + 1;
4 = 1 + 1 + 1 + 1;
总共有5种情况。
解析:
太晚了 明天再来补题解。
我跟着这篇东西学母函数:
这题就是一个母函数的简单入门。
代码:
#pragma comment(linker, "/STACK:1677721600")
#include <map>
#include <set>
#include <cmath>
#include <queue>
#include <stack>
#include <vector>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <cassert>
#include <iostream>
#include <algorithm>
#define pb push_back
#define mp make_pair
#define LL long long
#define lson lo,mi,rt<<1
#define rson mi+1,hi,rt<<1|1
#define Min(a,b) ((a)<(b)?(a):(b))
#define Max(a,b) ((a)>(b)?(a):(b))
#define mem0(a) memset(a,0,sizeof(a))
#define mem1(a) memset(a,-1,sizeof(a))
#define mem(a,b) memset(a,b,sizeof(a))
#define FIN freopen("in.txt", "r", stdin)
#define FOUT freopen("out.txt", "w", stdout)
using namespace std;
const double eps = 1e-8;
const double ee = exp(1.0);
const int inf = 0x3f3f3f3f;
const int maxn = 120 + 10;
const double pi = acos(-1.0);
const LL iinf = 0x3f3f3f3f3f3f3f3f;
int readT()
{
char c;
int ret = 0,flg = 0;
while(c = getchar(), (c < '0' || c > '9') && c != '-');
if(c == '-') flg = 1;
else ret = c ^ 48;
while( c = getchar(), c >= '0' && c <= '9') ret = ret * 10 + (c ^ 48);
return flg ? - ret : ret;
}
int c1[maxn];
int c2[maxn];
void fun()
{
mem0(c2);
for (int i = 0; i < maxn; i++)
c1[i] = 1;
for (int i = 2; i < maxn; i++)
{
for (int j = 0; j < maxn; j++)
{
for (int k = 0; k + j < maxn; k += i)
{
c2[j + k] += c1[j];
}
}
for (int j = 0; j < maxn; j++)
{
c1[j] = c2[j];
c2[j] = 0;
}
}
}
int main()
{
#ifdef LOCAL
FIN;
#endif // LOCAL
fun();
int n;
while (~scanf("%d", &n))
{
printf("%d\n", c1[n]);
}
return 0;
}