R

Problem Description

A factory produces products packed in square packets of the same height h and of the sizes 1*1, 2*2, 3*3, 4*4, 5*5, 6*6. These products are always delivered to customers in the square parcels of the same height h as the products have and of the size 6*6. Because of the expenses it is the interest of the factory as well as of the customer to minimize the number of parcels necessary to deliver the ordered products from the factory to the customer. A good program solving the problem of finding the minimal number of parcels necessary to deliver the given products according to an order would save a lot of money. You are asked to make such a program.

 

Input

The input file consists of several lines specifying orders. Each line specifies one order. Orders are described by six integers separated by one space representing successively the number of packets of individual size from the smallest size 1*1 to the biggest size 6*6. The end of the input file is indicated by the line containing six zeros.

 

Output

The output file contains one line for each line in the input file. This line contains the minimal number of parcels into which the order from the corresponding line of the input file can be packed. There is no line in the output file corresponding to the last ``null'' line of the input file.

 

Sample Input

0 0 4 0 0 1 7 5 1 0 0 0 0 0 0 0 0 0 

 

Sample Output

2 1 

看他写1*1等等脑子里反映是是平面，但是把题目说的是盒子，这就及其 的郁闷，后来觉得应该是盒子三维的但是放的是几个1*1的这样感觉矛盾感稍微小点。

首先6*6的只能放一个盒子，5*5的放一个盒子还能放11个1*1，4*4的要单独放一个盒子剩下的可以放五个完整的2*2或者20个1*1；

3*3可以放四个

代码：

#include<cmath>
#include<iostream>
using namespace std;
int main()
{

    int a,b,c,d,e,f;
    while(cin>>a>>b>>c>>d>>e>>f&&(a+b+c+d+e+f))
{

      int sum=0;
      sum=f;
      sum+=e;
      if(a!=0)
       a=max(0,a-11*e);
        sum+=d;
     if(b>=d*5)
       b=b-d*5;
       else{
a=max(0,a-4*(d*5-b));
           b=0;
}
    sum+=(c+3)/4;
     c%=4;
     if(c){
            if(b>=7-2*c){
                 b-=7-2*c;
       a=max(0,a-(8-c));}
     else{
     a=max(0,a-(36-4*b-9*c));
      b=0;}}
sum+=(b+8)/9;
b%=9;
if(b)
{
a=max(0,a-(36-b*4));
b=0;
}
sum+=(a+35)/36;
cout<<sum<<endl;

}
return 0;

}