POJ1017 Packets

POJ1017 Packets

Description

A factory produces products packed in square packets of the same height h and of the sizes 11, 22, 33, 44, 55, 66. 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 11 to the biggest size 66. 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

1
2
3
0 0 4 0 0 1 
7 5 1 0 0 0
0 0 0 0 0 0

Sample Output

1
2
2 
1

Answer

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
#include <cstdio>
#include <iostream>
#include <sstream>
#include <string>
using namespace std;

int main() {
string s;
int i, ans, a[7];
int t[4] = {0 ,5, 3, 1};
while (true) {
i = 1;
getline(cin, s);
stringstream ss(s);
while (ss >> a[i++]);
if (!a[6] && !a[1] && !a[2] && !a[3] && !a[4] && !a[5])
break;
ans = a[6] + a[5] + a[4] + (a[3] + 3) / 4;
int two = 5 * a[4] + t[a[3] % 4];
if (a[2] > two)
ans += (a[2] - two + 8) / 9;
int one = ans * 36 - a[6] * 36 - a[5] * 25 - a[4] * 16 - a[3] * 9 - a[2] * 4;
if (a[1] > one) {
ans += (a[1] - one + 35) / 36;
}
printf("%d\n", ans);
}
return 0;
}

Analysis

  1. 给出边长为1~6的正方形若干,求用最少的边长为6的正常形装下他们。
  2. 从变长大到小计算即可。
# POJ

Comments

Your browser is out-of-date!

Update your browser to view this website correctly. Update my browser now

×