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 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 

暑假做的一个贪心题,前几天比赛的时候碰到了,直接A了。

贪心的思想。

#include<iostream>
#include<stdio.h>
using namespace std;
int a[7],c[7];
int b[4]={0,5,3,1};
int main()
{
    while(1)
    {
        int flag=0;
        for(int i=1;i<=6;i++)
        {
            scanf("%d",&a[i]);
            c[i]=a[i];
            if(a[i]!=0)
                flag=1;
        }
        if(flag==0)
            break;
        int res=a[6]+a[5]+a[4]+a[3]/4;
        a[3]=a[3]%4;
        a[2]-=a[4]*5;
        if(a[3])
        {
            res++;
            if(a[2])
                a[2]-=b[a[3]];
        }
        if(a[2]<=0)//解释一下为什么不用管a[2],最后我们求剩下多少空间可以装a[1]时可以借助数组c[7],这样少了很多过程,简便了许多
        a[2]=0;
        else
            res+=a[2]/9;
        a[2]=a[2]%9;
        if(a[2])
            res++;
        int last=res*36-c[6]*36-c[5]*25-c[4]*16-c[3]*9-c[2]*4;
        if(a[1]<=last)
            cout<<res<<endl;
        else
        {
            a[1]-=last;
            res+=a[1]/36;
            a[1]=a[1]%36;
            if(a[1])
                res++;
            cout<<res<<endl;
        }
    }
    return 0;
}


阅读更多
个人分类: 贪心
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

不良信息举报

Packets

最多只允许输入30个字

加入CSDN,享受更精准的内容推荐,与500万程序员共同成长!
关闭
关闭