zoukankan      html  css  js  c++  java
  • Packets(模拟 POJ1017)

    Packets
    Time Limit: 1000MS Memory Limit: 10000K
    Total Submissions: 47750 Accepted: 16182

    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
    一个简单的模拟WA了好几发,看来不够仔细啊!

    #include <iostream>
    #include <cstdio>
    #include <cstring>
    #include <cmath>
    #include <cstdlib>
    #include <algorithm>
    
    using namespace std;
    
    int a[7];
    int sum;
    int main()
    {
        while(1)
        {
            sum=0;
            for(int i=1;i<=6;i++)
            {
                scanf("%d",&a[i]);
                sum+=a[i];
            }
            if(sum==0)
            {
                break;
            }
            int ans=a[6];
            if(a[5]>0)//处理大的物体
            {
                ans+=a[5];
                int ant=a[5]*11;
                if(a[1]>=ant)
                {
                    a[1]-=ant;
                }
                else
                {
                    a[1]=0;
                }
            }
            if(a[4]>0)
            {
                ans+=a[4];
                int ant=a[4]*5;
                if(a[2]>=ant)
                {
                    a[2]-=ant;
                    ant=0;
                }
                else
                {
                    ant-=a[2];
                    a[2]=0;
                    ant*=4;
                }
                if(a[1]>=ant)
                {
                    a[1]-=ant;
                }
                else
                {
                    a[1]=0;
                }
            }
            if(a[3]>0)
            {
                ans+=((a[3]+3)/4);
                int ant=a[3]%4;
                int s;
                if(ant==1)
                {
                    ant=5;
                    s=27;
                }
                else if(ant==2)
                {
                    ant=3;
                    s=18;
                }
                else if(ant==3)
                {
                    ant=1;
                    s=9;
                }
                else if(ant==0)
                {
                    s=0;
                }
                if(a[2]>=ant)
                {
                    a[2]-=ant;
                    s-=(ant*4);
                }
                else
                {
                    s-=(a[2]*4);
                    a[2]=0;
                }
                if(a[1]>=s)
                {
                    a[1]-=s;
                }
                else
                {
                    a[1]=0;
                }
            }
            if(a[2]>0)
            {
                ans+=((a[2]+8)/9);
                int ant=a[2]%9;
                if(ant!=0)
                {
                    ant=(9-ant)*4;
                }
                if(a[1]>=ant)
                {
                    a[1]-=ant;
                }
                else
                {
                    a[1]=0;
                }
            }
            if(a[1]>0)
            {
                ans+=((a[1]+35)/36);
            }
            printf("%d
    ",ans);
    
        }
        return 0;
    }
    
  • 相关阅读:
    ibmmq 性能测试
    zabbix-agent 安装
    关于dubbo接口性能测试
    关于vyos 防火墙配置
    appium自动化的工作原理(1)
    unittest如何在循环遍历一条用例时生成多个测试结果
    在Linux中#!/usr/bin/python之后把后面的代码当成程序来执行。 但是在windows中用IDLE编程的话#后面的都是注释,之后的代码都被当成文本了。 该怎么样才能解决这个问题呢?
    Cookie和Session的区别详解
    点单登录原理和java实现简单的单点登录
    new一个JAVA对象的时候,内存是怎么分配的?
  • 原文地址:https://www.cnblogs.com/juechen/p/5255925.html
Copyright © 2011-2022 走看看