POJ 1017 Packets（贪心）

Packets

Time Limit: 1000MS

Memory Limit: 10000KB

64bit IO Format:

Submit Status

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种标准，1*1,2*2,3*3,4*4,5*5,6*6；

对于每一种木箱，遵循一种原则，大的木箱可以嵌套小木箱，注意题意描述，所有的木箱高度都是相同，所以忽略垂直高度，只需要考虑底面积，举例为证，一个6*6的木箱需要36个1*1的木箱填充，或者是9个2*2的填充。

如何写代码：

想了好久不知道怎么用一个完整的公式一步到位，所以分步来实现，由箱子种类可知，6*6的箱子不需要填充，只需要考虑下面的5种，下面是代码

   
   

    
    #include<stdio.h>
int main()
{
    int s1,s2,s3,s4,s5,s6;
    while(~scanf("%d%d%d%d%d%d",&s1,&s2,&s3,&s4,&s5,&s6)&&s1+s2+s3+s4+s5+s6)
    {
   
   
   
   

    
            int sum=0;
        int a1=0,a2=0;
        sum+=s6+s5+s4+(s3+3)/4;
        a1 += s5*11;//定义a1和a2，用这两个数来统计填充时用到的1*1和2*2的数量
        a2 += s4*5;
        if(s3%4==3)//3*3的多种情况，注意分析
        {
            a2+=1;
            a1+=5;
        }
        else if(s3%4==2)
        {
            a2+=3;
            a1+=6;
        }
        else if(s3%4==1)
        {
            a2+=5;
            a1+=7;
        }
        if(s2<a2)//注意如果2*2的数量不足的时候，要用1*1的去转换
        {
            a1+=(a2-s2)*4;
        }
        else if(s2>a2)//若是充足，则2*2的仍然可以用1*1的填充
        {
            sum+=(s2-a2+8)/9;
            if((s2-a2)%9)
                a1+=36-((s2-a2)%9*4);
        }
        if(s1<=a1)
            printf("%d\n",sum);
        else
        {
            sum+=(s1-a1+35)/36;
            printf("%d\n",sum);
        }
    }
    return 0;
}