【递归与分治】 poj 1017

递归与分治经典例题    要点在于对3*3箱子的讨论

#include <iostream>
#include <cstdio>
using namespace std;
int main()
{
//    freopen("in.txt","r",stdin);
    int s1[]={,,,};
    int s2[]={,,,};
    int n1,n2,n3,n4,n5,n6,t1,t2,sum;
    while(cin >> n1 >> n2 >> n3 >> n4 >> n5 >> n6,!(n1==&&n2==&&n3==&&n4==&&n5==&&n6==))
    {
        sum=n6+n5+n4+n3/;
        if(n3%)
        {
            sum++;
        }
        t1=n5*+s1[n3%];
        t2=n4*+s2[n3%];
        n2=n2-t2;
        if(n2>)
        {
            sum=sum+n2/;
            if(n2%)
            {
                sum++;
            }
            t1=t1+-(n2%)*;
        }
        else
        {
            t1=t1-*n2;
        }
        n1=n1-t1;
        if(n1>)
        {
            sum=sum+n1/;
            if(n16>)
            sum++;
        }
        cout << sum << endl;
    }
    return ;
}