hdu 1085 Holding Bin-Laden Captive!（生成函数）

http://www.wutianqi.com/?p=596
还是这个博客里给的题目，是第三个题目，和给的第一个差不多，确定好指数的范围就好了。

#include <bits/stdc++.h>
using namespace std;

const int MAXN = 10000;
int C1[MAXN];
int C2[MAXN];
int num[3];
int maxn;

int main()
{
    ios::sync_with_stdio(false);
    while(cin >> num[0] >> num[1] >> num[2] && num[0]+num[1]+num[2])
    {
        maxn = 1*num[0]+2*num[1]+5*num[2];
        memset(C1,0,sizeof(C1));
        memset(C2,0,sizeof(C2));
        for(int i = 0; i <= num[0]; ++i)
            C1[i] = 1;
        for(int j = 0; j <= num[0]; ++j)
            for(int k = 0; k <= num[1]*2; k += 2)
                C2[k+j] += C1[j];

        for(int i = 0; i <= num[0]+2*num[1]; ++i)
        {
            C1[i] = C2[i];
            C2[i] = 0;
        }
        for(int j = 0; j <= num[0]+2*num[1]; ++j)
            for(int k = 0; k <= num[2]*5; k += 5)
                C2[k+j] += C1[j];
        for(int i = 0; i <= num[0]+2*num[1]+num[2]*5; ++i)
        {
            C1[i] = C2[i];
            C2[i] = 0;
        }
        bool flag = true;
        for(int i = 0; i<= num[0]+num[1]*2+num[2]*5; ++i)
        {
            if(C1[i] == 0)
            {
                flag = false;
                cout << i <<endl;
                break;
            }
        }
        if(flag)
            cout << maxn+1 << endl;
    }
    return 0;
}