Hdu1085-Holding Bin-Laden Captive!

[Cpp]
# Include <iostream>
# Include <cstdio>
# Include <algorithm>
 
Using namespace std;
Int num [10];
Int c1 [100000], c2 [100000];
 
Int main ()
{
Int I, j, k;
While (cin> num [1]> num [2]> num [5])
{
If (num [1] = 0 & num [2] = 0 & num [5] = 0)
Break;
Int MAX = num [1] + num [2] * 2 + num [5] * 5;
For (I = 0; I <= MAX; ++ I)
{
C1 [I] = 0;
C2 [I] = 0;
}
For (I = 0; I <= num [1]; ++ I)
C1 [I] = 1;
For (I = 0; I <= num [1]; ++ I)
{
For (j = 0; j <= num [2] * 2; j + = 2)
C2 [j + I] + = c1 [I];
}
For (I = 0; I <= num [1] + num [2] * 2; ++ I)
{
C1 [I] = c2 [I];
C2 [I] = 0;
}
For (I = 0; I <= num [1] + num [2] * 2; ++ I)
For (j = 0; j <= num [5] * 5; j + = 5)
{
C2 [I + j] + = c1 [I];
}
For (I = 0; I <= MAX; ++ I)
{
C1 [I] = c2 [I];
C2 [I] = 0;
}
For (I = 0; I <= MAX; ++ I)
If (! C1 [I])
{
Printf ("% d \ n", I );
Break;
}
If (I = MAX + 1)
Printf ("% d \ n", I );
}
Return 0;
}

# Include <iostream>
# Include <cstdio>
# Include <algorithm>

Using namespace std;
Int num [10];
Int c1 [100000], c2 [100000];

Int main ()
{
Int I, j, k;
While (cin> num [1]> num [2]> num [5])
{
If (num [1] = 0 & num [2] = 0 & num [5] = 0)
Break;
Int MAX = num [1] + num [2] * 2 + num [5] * 5;
For (I = 0; I <= MAX; ++ I)
{
C1 [I] = 0;
C2 [I] = 0;
}
For (I = 0; I <= num [1]; ++ I)
C1 [I] = 1;
For (I = 0; I <= num [1]; ++ I)
{
For (j = 0; j <= num [2] * 2; j + = 2)
C2 [j + I] + = c1 [I];
}
For (I = 0; I <= num [1] + num [2] * 2; ++ I)
{
C1 [I] = c2 [I];
C2 [I] = 0;
}
For (I = 0; I <= num [1] + num [2] * 2; ++ I)
For (j = 0; j <= num [5] * 5; j + = 5)
{
C2 [I + j] + = c1 [I];
}
For (I = 0; I <= MAX; ++ I)
{
C1 [I] = c2 [I];
C2 [I] = 0;
}
For (I = 0; I <= MAX; ++ I)
If (! C1 [I])
{
Printf ("% d \ n", I );
Break;
}
If (I = MAX + 1)
Printf ("% d \ n", I );
}
Return 0;
}