HDU ACM 1 1028 Ignatius and the Princess III（母函数）

#include <iostream>
using namespace std;
int main()
{
    int n;
    int Lu[10000], Hui[10000];
    while (cin >> n && n)
    {
        for (int i = 0; i <= n; i++)
        {
            Lu[i] = 1;
            Hui[i] = 0;
        }
        for (int i = 2; i <= n; i++)
        {
            for (int j = 0; j <= n; j++)
                for (int k = 0; j + k <= n; k += i)
                    Hui[j + k] += Lu[j];
            for (int j = 0; j <= n; j++)
            {
                Lu[j] = Hui[j];
                Hui[j] = 0;
            }
        }
        cout << Lu[n] << endl;
    }
    return 0;
}