Packets

Packets

Time Limit:1000MS     Memory Limit:10000KB     64bit IO Format:%I64d & %I64u

Submit   Status   Practice   POJ 1017

Appoint description:   System Crawler  (2015-04-23)

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*6，5*5,4*4都只能单独放一个盒子，5*5放完之后可以放11个1*1盒子,4*4放完后的箱子里可以放2*2也可以放1*1，应该先放2*2，因为1*1更容易安排。3*3的先打包放入，然后mod4的余数来分类，最后根据剩下的1,2规格的盒子再讨论。

 

#include
#include
using namespace std;
int max(int a, int b)
{
 return a > b ? a : b;
}
int main()
{
 int a1, a2, a3, a4, a5, a6, ans, pre, space, temp;
 while (cin >> a1 >> a2 >> a3 >> a4 >> a5 >> a6)
 {
  if (a1 == 0 && a2 == 0 && a3 == 0 && a4 == 0 && a5 == 0 && a6 == 0)break;
  ans = 0;
  ans += a6 + a5;
  a1 = max(0, a1 - 11 * a5);

  ans += a4;
  temp = max(0, a2 - 5 * a4);
  if (temp == 0)
   a1 = max(0, a1 - 4 * (a4 * 5 - a2));
  a2 = temp;

  ans += (a3 + 3) / 4;
  pre = a3 % 4;
  if (pre)
  {
   if (a2 >= 7 - 2 * pre)
   {
    a2 -= 7 - 2 * pre;
    a1 = max(0, a1 - (8 - pre));
   }
   else
   {
    a1 = max(0, a1 - (36 - 9 * pre - 4 * a2));
    a2 = 0;
   }
  }
  if (a2 == 0)
  {
   if (a1 != 0)
    ans += (a1 + 35) / 36;
  }
  else
  {
   if (a1 == 0)
    ans += (a2 + 8) / 9;
   else
   {
    ans += (a2 + 8) / 9;
    pre = a2 % 9;
    if (pre != 0)
    {
     a1 = max(0, a1 - 36 + pre * 4);
     ans += (a1 + 35) / 36;
    }
    else
    {
     ans += (a1 + 35) / 36;
    }
   }
  }
  
  
  cout << ans << endl;
 }
 return 0;
}