练习一1017
来源:互联网 发布:豹风网络 编辑:程序博客网 时间:2024/06/11 02:32
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
Statistic | Submit | Back
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
Statistic | Submit | Back
思路:先从大的包裹开始,面积为6,5,4的包裹占用一个盒子,5剩余的面积放1,4剩余的面积放2,3剩余的面积放1和2,2剩余的面积放1.这道题由于一点小错误折磨了我好几天,今天终于豁然开朗,以后再用if是一定加上else。
代码:
#include<iostream>
using namespace std;
int main()
{
int a1,a2,a3,a4,a5,a6;
while(cin>>a1>>a2>>a3>>a4>>a5>>
a6)
{
if(a1==0&&a2==0&&a3==0&&a4==0
&&a5==0&&a6==0) break;
int b1,b2,c=a6+a5+a4;
b1=a5*11;
b2=a4*5;
if(a3<4) {a3+=4;c--;}
if(a3%4==0) c+=a3/4;
else if(a3%4==1)
{b1+=7;b2+=5;c+=a3/4+1;}
else if(a3%4==2)
{b1+=6;b2+=3;c+=a3/4+1;}
else if(a3%4==3)
{b1+=5;b2+=1;c+=a3/4+1;}
if(a2>b2)
{
a2-=b2;
if(a2>=9&&a2%9==0) c+=a2/9;
if(a2<9){c++;b1+=36-4*a2;}
if(a2>9&&a2%9!=0)
{c+=a2/9+1;b1+=36-4*(a2%9);}
}
else if(a2<b2)
b1+=(b2-a2)*4;
if(a1>b1)
{
a1-=b1;
if(a1<36) c++;
if(a1>=36&&a1%36==0)
c+=a1/36;
if(a1>36&&a1%36!=0)
c+=a1/36+1;
}
cout<<c<<endl;
}
return 0;
}
using namespace std;
int main()
{
int a1,a2,a3,a4,a5,a6;
while(cin>>a1>>a2>>a3>>a4>>a5>>
a6)
{
if(a1==0&&a2==0&&a3==0&&a4==0
&&a5==0&&a6==0) break;
int b1,b2,c=a6+a5+a4;
b1=a5*11;
b2=a4*5;
if(a3<4) {a3+=4;c--;}
if(a3%4==0) c+=a3/4;
else if(a3%4==1)
{b1+=7;b2+=5;c+=a3/4+1;}
else if(a3%4==2)
{b1+=6;b2+=3;c+=a3/4+1;}
else if(a3%4==3)
{b1+=5;b2+=1;c+=a3/4+1;}
if(a2>b2)
{
a2-=b2;
if(a2>=9&&a2%9==0) c+=a2/9;
if(a2<9){c++;b1+=36-4*a2;}
if(a2>9&&a2%9!=0)
{c+=a2/9+1;b1+=36-4*(a2%9);}
}
else if(a2<b2)
b1+=(b2-a2)*4;
if(a1>b1)
{
a1-=b1;
if(a1<36) c++;
if(a1>=36&&a1%36==0)
c+=a1/36;
if(a1>36&&a1%36!=0)
c+=a1/36+1;
}
cout<<c<<endl;
}
return 0;
}
0 0
- 练习一1017
- 练习一
- 练习一
- 练习一
- 练习一
- 2016SDAU课程练习一1017
- 2016SDAU课程练习一1017
- access+asp 练习一
- 数据库练习一答案
- C++基础练习一
- XML练习(一)
- javascript练习(一)
- jQuery练习(一)
- 软件测试练习一
- 听力练习一
- c++练习一
- OpenGL小练习一
- 练习程序一
- Java 中 == 与 equals() 方法的区别
- Spring MVC整合Mybatis实例
- (OK) 编译cBPM-android—CentOS 7—NDK8—androideabi-4.7— API14
- 堆排序与堆向上调整与向下调整的C++实现
- Android 代码实现按钮 按下弹起事件
- 练习一1017
- 内存泄露
- 循环语句中continue使用(JAVA)
- Atitit.android jsbridge v1新特性
- [引用区别] c++中引用与java中引用区别
- apt-get update 和 upgrade 的区别
- 对inetd、xinetd与TCP_Wrapper的基本了解
- Struts2 Hello World 实例
- Android 动画之RotateAnimation应用详解(旋转动画效果 )(转载)