POJ Packets

Packets

Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 20000/10000K (Java/Other)

Total Submission(s) : 1   Accepted Submission(s) : 1

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

 

Source

PKU

 

 

題目大意： 所有的箱子都是6*6尺寸的，但是物品有1*1，2*2，3*3，4*4，5*5以及6*6尺寸的，要求把所有的物品放進箱子中，求最少需要多少箱子。

題目思路，對於6*6，5*5以及4*4尺寸的物品每個物品需要占有一個箱子，對於3*3的物品一個箱子可以放4個，2*2的物品箱子可以放9個，1*1的可以放36個。采用面積統計1*1箱子的空位，采用向上去整的方法統計箱子。

 

 

#include<iostream>
#include<cstdio>
#include<cstring>

int num[4]={0,5,3,1};
int box[7];

int main(){

    //freopen("input.txt","r",stdin);

    while(1){
        int tmp=0;
        for(int i=1;i<=6;i++){
            scanf("%d",&box[i]);    // 讀入每個物品的數目
            tmp+=box[i];
        }
        if(tmp==0)
            break;
        int ans=box[6]+box[5]+box[4]+(box[3]+3)/4;  //a6,a5,a4,每個物品占有一個箱子(a3 + 3 ) / 4 代表a3的物品需要占
        int a2=box[4]*5+num[box[3]%4];  //統計所有的大物品放進箱子中后a2物品的空位子有多少
        if(box[2]>a2)
            ans+=(box[2]-a2+8)/9;
        int a1=ans*36-box[6]*36-box[5]*25-box[4]*16-box[3]*9-box[2]*4;
        if(box[1]>a1)   //求a1的空位子，只需要統計剩余的面積即可
            ans+=(box[1]-a1+35)/36;
        printf("%d\n",ans);
    }
    return 0;
}