HDU1028(母函数)

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
#define maxn 1111
#define maxm 1111111

long long a[122], b[122];
int n, num;

int main () {
    //freopen ("data.txt", "r", stdin);
    while (cin >> n) {
        memset (a, 0, sizeof a);
        for (int i = 0; i <= n; i++)
            a[i] = 1;
        for (int i = 2; i <= n; i++) {
            memset (b, 0, sizeof b);
            for (int j = 0; j <= n; j += i) {
                for (int k = 0; k <= n; k++) {
                    if (j+k <= n)
                        b[j+k] += a[k];
                }
            }
            for (int j = 0; j <= n; j++)
                a[j] = b[j];
        }
        cout << a
 << endl;
    }
    return 0;
}