ACM-二分贪心T-20

（欢迎阅读我的博客，如发现错误或有建议请评论留言，谢谢。）

题目如下：

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 

题目思路：

装箱问题，每一个6*6 5*5 4*4 的都要用一个箱子，四个3*3的用一个箱子，剩下的3*3再用一个箱子，然后用2*2 1*1的去填空，填完之后如果还有剩下的再用别的箱子装。

代码如下：

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