ACM-problem R

problem：

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

6*6,5*5,4*4都至少占用一个箱子，一个箱子1*1可以放36个，2*2放9个，3*3放4个。统计大块物品所剩余的空隙，用向上取整计算箱子。

代码：

#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
int num[4]={0,5,3,1};
int box[7];
int main(){
while(1){
int t=0;
for(int i=1;i<=6;i++){
cin>>box[i];  
t+=box[i];}
if(t==0)
break;
int a=box[6]+box[5]+box[4]+(box[3]+3)/4;  
int a2=box[4]*5+num[box[3]%4];  
if(box[2]>a2)
a+=(box[2]-a2+8)/9;
int a1=a*36-box[6]*36-box[5]*25-box[4]*16-box[3]*9-box[2]*4;
if(box[1]>a1)   
a+=(box[1]-a1+35)/36;
cout<<a;
   }
    return 0;
}