zoukankan      html  css  js  c++  java
  • 状态问题吗?水题错四次了…………

    #include<stdio.h>
    main()
    {
    int n,i,sum;
    int x[10];
    while(scanf("%d %d %d %d %d %d",&x[1],&x[2],&x[3],&x[4],&x[5],&x[6])!=EOF)
    {if(x[1]==0&&x[2]==0&&x[3]==0&&x[4]==0&&x[5]==0&&x[6]==0)
    break;
    sum=0;
    sum=sum+x[6];
    if(x[5]>0)
    {
    sum=sum+x[5];
    n=11*x[5];
    x[1]=x[1]-n;
    }
    if(x[4]>0)
    {
    sum=sum+x[4];
    n=5*x[4];
    if(x[2]>n)
    x[2]=x[2]-n;
    else
    {x[2]=0;
    n=n-x[2];
    n=n*4;
    x[1]=x[1]-n;
    }
    }
    if(x[3]>0)
    {
    sum=sum+(x[3]-0.5)/4+1;
    n=x[3]%4;
    if(n==1)
    {
    if(x[2]>5)
    x[2]=x[2]-5;
    else
    {

    x[1]=x[1]-27+4*x[2]; x[2]=0;
    }
    }
    if(n==2)
    {
    if(x[2]>3)
    x[2]=x[2]-3;
    else
    {

    x[1]=x[1]-18+4*x[2];
    x[2]=0;
    }
    }
    if(n==3)
    {
    if(x[2]>1)
    x[2]=x[2]-1;
    else
    {

    x[1]=x[1]-9;
    x[2]=0;
    }
    }
    }
    if(x[2]>0)
    {
    sum=sum+(x[2]-0.5)/9+1;
    n=x[2]%9;
    x[1]=x[1]-36+4*n;
    }
    if(x[1]>0)
    {
    sum=sum+(x[1]-0.5)/36+1;
    }
    printf("%d ",sum);
    }
    }

    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 
    不知道那里的问题啊啊》》》》》》

  • 相关阅读:
    HTML5的页面资源预加载技术(Link prefetch)加速页面加载
    正则表达式入门教程
    SQL 查询分析器操作(修改、添加、删除)表及字段等
    linux终端相关概念解释及描述
    linux系统编程--守护进程,会话,进程组,终端
    linux系统编程--信号
    linux系统编程--进程间通信
    linux系统编程--进程
    Python GUI编程(Tkinter)(一)
    C++中时间转换
  • 原文地址:https://www.cnblogs.com/alexanderone/p/3859804.html
Copyright © 2011-2022 走看看