zoukankan      html  css  js  c++  java
  • proj1017

    Packets
    Time Limit: 1000MS   Memory Limit: 10000K
    Total Submissions: 40681   Accepted: 13645

    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 

    Source

     
     
    #include<iostream>
    
    using namespace std;
    
    void print(int *a){
    	for(int i = 0; i < 6; ++i){
    		cout<<a[i]<<" ";
    	}
    	cout<<endl;
    }
    
    int parcels(int *a){
    	int count = 0;
    	count += a[5] + a[4];
    	if(a[0] <= a[4]*11){
    		a[0] = 0;
    	}else{
    		a[0] -= a[4]*11;
    	}
    	a[5] = 0;
    	a[4] = 0;
    	count += a[3];
    	if(a[1] <= a[3]*5){
    		if(a[0] <= (a[3]*5 - a[1])*4){
    			a[0] = 0;
    		}else{
    			a[0] -= (a[3]*5 - a[1])*4;
    		}
    		a[1] = 0;
    	}else{
    		a[1] -= a[3]*5;
    	}
    	a[3] = 0;
    	if(a[2]%4 == 0){
    		count += a[2]/4;
    	}else{
    		count += a[2]/4 + 1;
    
    		if(a[1] <= (7 - (a[2]%4)*2)){
    			if(a[0] <= 8 - (a[2]%4) + (7 - (a[2]%4)*2 - a[1])*4){
    				a[0] = 0;
    			}else{
    				a[0] -= 8 - (a[2]%4) + (7 - (a[2]%4)*2 - a[1])*4;
    			}
    			a[1] = 0;
    		}else{
    			a[1] -= (7 - (a[2]%4)*2);
    			if(a[0] <= 8 - (a[2]%4)){
    				a[0] = 0;
    			}else{
    				a[0] -= 8 - (a[2]%4);
    			}
    		}
    	}
    	a[2] = 0;
    	if(a[1] != 0){
    		if(a[1]%9 == 0){
    			count += a[1]/9;
    		}else{
    			count += a[1]/9 + 1;
    			if(a[0] <= (9 - (a[1]%9))*4){
    				a[0] = 0;
    			}else{
    				a[0] -= (9 - (a[1]%9))*4;
    			}
    		}
    	}
    	a[1] = 0;
    	count += (35 + a[0])/36;
    	a[0] = 0;
    	return count;
    }
    
    int main()
    {
    
    
    	int a[6];
    	for(int i = 0; i < 6; ++i){
    		cin>>a[i];
    	}
    	while(!(a[0] == 0&&a[1] == 0&&a[2] == 0&&a[3] == 0&&a[4] == 0&&a[5] == 0)){
    		cout<<parcels(a)<<endl;
    		for(int i = 0; i < 6; ++i){
    			cin>>a[i];
    		}
    	}
    
    	return 0;
    }
     
  • 相关阅读:
    js node 节点 原生遍历 createNodeIterator
    nodejs fs copy本地文件src dst
    axios 请求常用组件,及其错误
    【IntelliJ IDEA学习之三】IntelliJ IDEA常用快捷键
    【IntelliJ IDEA学习之二】IntelliJ IDEA常用配置
    【IntelliJ IDEA学习之一】IntelliJ IDEA安装激活、VM参数
    【python学习案例】python判断自身是否正在运行
    【Linux脚本学习案例】shell脚本多通道并发执行存储过程
    【Activiti学习之四】Activiti API(三)
    【Activiti学习之三】Activiti API(二)
  • 原文地址:https://www.cnblogs.com/candycloud/p/3404735.html
Copyright © 2011-2022 走看看