1022. Packets
来源:互联网 发布:一楼土木人淘宝网 编辑:程序博客网 时间:2024/05/21 10:04
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 17 5 1 0 0 00 0 0 0 0 0
Sample Output
21
#include<iostream>using namespace std;int main(){int s1,s2,s3,s4,s5,s6;int ans;while(cin>>s1>>s2>>s3>>s4>>s5>>s6&&(s1||s2||s3||s4||s5||s6)){ans=0;ans=ans+s5+s6+s4;s1=s1-s5*11;s2=s2-s4*5;ans=ans+s3/4;s3=s3%4;if(s3!=0)ans++;if(s3==1){s2=s2-5;s1=s1-7;}if(s3==2){s2=s2-3;s1=s1-6;}if(s3==3){s2=s2-1;s1=s1-5;}if(s2>0){ans=ans+s2/9;s2=s2%9;if(s2!=0){ans++;s1=s1-(36-4*s2);}}if(s2<0){s1=s1+s2*4;}if(s1>0){ans=ans+s1/36;if(s1%36!=0)ans++;}cout<<ans<<endl;}}
0 0
- 1022. Packets
- packets
- Packets
- Packets
- Packets
- Packets
- Packets
- Packets
- Packets
- PKUOJ1017 Packets
- 1017 Packets
- poj1017 packets
- Radius packets
- 311Packets
- 311 - Packets
- POJ1017-Packets
- uva311 - Packets
- POJ1017 Packets
- cocos2d-x 3.2 |飞机大战:敌机与爆炸
- 今天查资料的时候 看到的一句话 ~~~
- 分类方法
- Codeforces 463D. Gargari and Permutations (dp,distinct下的LCS问题)
- [cocos2d-x][游戏开发]通过cocos2d-x实现简易飞机大战 04.游戏界面 主角飞机的添加
- 1022. Packets
- 先记下学习 —— 他山之石
- 内存管理(1)
- 复变函数及应用 第三章学习感受
- MyEclipse常用设置图解之二
- 内存管理(2)
- 开通
- 制作本地的yum源
- 内存管理(3)