pku 1017源程序

 #include <iostream>
using namespace std;
int main()
{
    int in[6];
    int box_number=0;
    int available1=0;
    int available2=0;
    while((cin>>in[0]>>in[1]>>in[2]>>in[3]>>in[4]>>in[5]) &&in[0]+in[1]+in[2]+in[3]+in[4]+in[5]!=0)
    {
       box_number=in[5];
       if(in[4]!=0)
       {
         box_number+=in[4];
         available1+=(11*in[4]);
       }
       if(in[3]!=0)
       {
         box_number+=in[3];
         available2+=(5*in[3]);
       }
       if(in[2]!=0)
       {
         switch(in[2]%4){
                  case 0:
                       box_number+=(in[2]/4);
                       break;
                  case 1:
                       box_number+=(in[2]/4+1);
                       available1+=7;
                       available2+=5;
                       break;
                  case 2:
                       box_number+=(in[2]/4+1);
                       available1+=6;
                       available2+=3;
                       break;
                  case 3:
                       box_number+=(in[2]/4+1);
                       available1+=5;
                       available2+=1;
                       break;
                  }
         }
         if(in[1]!=0)
         {
            if(in[1]<=available2)
              available1+=((available2-in[1])*4);
            else
            {
                if((in[1]-available2)%9==0)
                  box_number+=((in[1]-available2)/9);
                else
                {
                    box_number+=((in[1]-available2)/9+1);
                    available1+=(((in[1]-available2)%9)*4);
                }
            }
         }
         if(in[0]>available1)
         {
           if((in[0]-available1)%36==0)
             box_number+=((in[0]-available1)%36);
           else
             box_number+=((in[0]-available1)/36+1);
         }
         cout<<box_number<<endl;
       }
}