HDU ACM 1 1085 Holding Bin-Laden Captive!

#include <iostream>
using namespace std;
int main()
{
    int Lu[10000], Hui[10000], Yi[4];
    while (cin >> Yi[1] >> Yi[2] >> Yi[3] && (Yi[1] || Yi[2] || Yi[3]))
    {
        int Max = Yi[1] + 2 * Yi[2] + 5 * Yi[3];
        for (int i = 0; i <= Max; i++)
        {
            Lu[i] = 0;
            Hui[i] = 0;
        }
        for (int i = 0; i <= Yi[1]; i++)
            Lu[i] = 1;
        for (int i = 0; i <= Yi[1]; i++)
            for (int j = 0; j <= Yi[2] * 2; j += 2)
                Hui[j + i] += Lu[i];
        for (int i = 0; i <= Yi[1] + Yi[2] * 2; i++)
        {
            Lu[i] = Hui[i];
            Hui[i] = 0;
        }
        for (int i = 0; i <= Yi[1] + Yi[2] * 2; i++)
            for (int j = 0; j <= Yi[3] * 5; j += 5)
                Hui[j + i] += Lu[i];
        for (int i = 0; i <= Yi[1] + Yi[2] * 2 + Yi[3] * 5; i++)
            Lu[i] = Hui[i];
        int i = 0;
        for (i = 0; i <= Max; i++)
            if (Lu[i] == 0)
            {
                cout << i << endl;
                break;
            }
        if (i == Max + 1)
            cout << i << endl;
    }
    return 0;
}