2 shunfurh shunfurh 于 2017.09.08 22:43 提问

Packets

A factory produces products packed in square packets of the same height h and of the sizes 1x1, 2x2, 3x3, 4x4, 5x5, 6x6. These products are always delivered to customers in the square parcels of the same height h as the products have and of the size 6x6. 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 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 to the biggest size . The end of the input is indicated by the line containing six zeros.

Output

The output contains one line for each line in the input. 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 corresponding to the last ``null'' line of the input.

Sample Input

0 0 4 0 0 1
7 5 1 0 0 0
0 0 0 0 0 0

Sample Output

2
1

1个回答

caozhy
caozhy   Ds   Rxr 2017.09.24 08:33
已采纳
Csdn user default icon
上传中...
上传图片
插入图片
准确详细的回答,更有利于被提问者采纳,从而获得C币。复制、灌水、广告等回答会被删除,是时候展现真正的技术了!
其他相关推荐
packets
packets   时间限制(普通/Java):1000MS/10000MS     运行内存限制:65536KByte 总提交: 27            测试通过: 14 描述 A factory produces products packed in square packets of the same height h and of the sizes 1*1
Packets
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 p
1004 Packets
一道贪心题,思路好想,不过细节有点多 自行百度题解 附上一个dalao代码 #include int main() { int n,a,b,c,d,e,f,x,y; int u[4]={0,5,3,1}; while(1) { scanf("%d%d%d%d%d%d",&a,&b,&c,&d,&e,&f); if(a==0&&b==0&&c==0&&d==0&&e==0&
POJ1017 Packets
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 par
POJ1017 Packets
POJ1017 PacketsDescription 一个工厂制造的产品都是高度为h,长和宽相等的长方体,一共有六个型号,他们的长宽分别为 1*1, 2*2, 3*3, 4*4, 5*5, 6*6。这些产品通常使用一个6*6*h的长方体包裹包装然后邮寄给客户。因为邮费很贵,所以工厂要想方设法的减小每个订单运送时的包裹数量。
poj--1017——Packets
PacketsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 59032 Accepted: 20049DescriptionA factory produces products packed in square packets of the same height h and of the sizes 1*1, 2*2, 3*...
311 - Packets
描述:一种简单的讨论而已,我是从6*6一直讨论到1*1的,没有其他办法,只能这样 #include #include using namespace std; int dfs(int *p,int count) { int flag=0; if(p[5]>=1) { count+=p[5]; p[5]=0; } if(p
贪心算法之Packets
Packets Description A factory producesproducts 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 inthe squa
311 Packets
#include #include #include #include #include #include #define N 7 using namespace std; int n; int a[N]; int temp[5]= {0,1,3,5,9}; int l[3]; int main() { // int t; // scanf("%d",&t);
贪心?——Packets
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 s...