杭电1085--Holding Bin-Laden Captive!

万变不离其中，只是我最后少考虑一种情况，如果i==num+1的情况！！！！！！！

http://acm.hdu.edu.cn/showproblem.php?pid=1085

 

#include<stdio.h>

#define max 80001

int main( )
{
    int i;
    int j;
    int c1[max];
    int c2[max];
    int num_1;
    int num_2;
    int num_3;
    int num;
    while( scanf("%d %d %d",&num_1,&num_2,&num_3),num_1,num_2,num_3 )
    {

        num = num_1+num_2*2+num_3*5;

        for( i = 0;i <= num; i++ )
        {
            if( i <= num_1 )
                c1[i] = 1;
            else
            {
                c1[i] = 0;
                c2[i] = 0;
            }
        }

        for( i = 0; i <= num_1; i++ )
        {
            for ( j = 0; j <= num_2; j++ )
            {
                c2[i+j*2] += 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_3; j++ )
            {
                c2[j*5+i] = c1[i];
            }
        }
        for( i = 0; i <= num; i++ )
        {
            c1[i] = c2[i];
            c2[i] = 0;
        }

        for( i = 0;i <= num; i++ )
        {
            if( c1[i] == 0 )
            {
                printf("%d\n",i);
                break;
            }
        }
        if( i == num+1 )
            printf("%d\n",i);
    }
    return 0;
}