zoukankan      html  css  js  c++  java
  • ZOJ Problem Set–1755 Clay Bully

    Time Limit: 2 Seconds      Memory Limit: 65536 KB


    Ms. Terry is a pre-school art teacher who likes to have her students work with clay. One of her assignments is to form a lump of clay into a block and then measure the dimensions of the block. However, in every class, there is always one child who insists on taking some clay from some other child. Since Ms. Terry always gives every child in a class the same amount of clay to begin with, you can write a program that helps Ms. Terry find the bully and victim after she measures each child's finished block.

    Input

    There are one or more classes of students, followed by a final line containing only the value -1. Each class starts with a line containing an integer, n, which is the number of students in the class, followed by n lines of student information. Each line of student information consists of three positive integers, representing the dimensions of the clay block, followed by the student's first name. There can never be more than 9 students nor less than 2 students in any class. Each student's name is at most 8 characters. Ms. Terry always gives each student at most 250 cubic units of clay. There is exactly one bully and one victim in each class.

    Output

    For each class print a single line exactly as shown in the sample output.

    Sample Input

    3
    10 10 2 Jill
    5 3 10 Will
    5 5 10 Bill
    4
    2 4 10 Cam
    4 3 7 Sam
    8 11 1 Graham
    6 2 7 Pam
    -1

    Sample Output

    Bill took clay from Will.
    Graham took clay from Cam.


    Source: Mid-Central USA 2003

    #include<iostream>
    
    #include<string>
    
    using namespace std;
    
    int main()
    
    {
    
      int students;
    
      while(cin>>students && students != -1)
    
      {
    
        int max = -1,
    
          min = 250,
    
          crt_x, crt_y, crt_z;
    
        string max_name, min_name, crt_name;
    
        while(students-- && cin>>crt_x>>crt_y>>crt_z>>crt_name)
    
        {
    
          int crt = crt_x*crt_y*crt_z;
    
          if(crt> max)
    
          {
    
            max_name = crt_name;
    
            max = crt;
    
          }
    
          if(crt < min)
    
          {
    
            min_name = crt_name;
    
            min = crt;
    
          }
    
        }
    
        cout<<max_name<<" took clay from "<<min_name<<"."<<endl;
    
      }
    
      return 0;
    
    }
  • 相关阅读:
    【转】依赖注入那些事儿
    【转】Visual Studio單元測試小應用-測執行時間
    【转】 代码设计敏捷开发三部曲
    【转】 c#中两个DateTimePicker,一个时间设置为0:0:0,另一个设置为23:59:59
    【转】 C#获取当前程序运行路径的方法集合
    CSVHelper读出乱码 解决方案
    CvsHelper 使用指南
    【转】 C# ListView实例:文件图标显示
    【转】C# winform 加载网页 模拟键盘输入自动接入访问网络
    基于MHA的MySQL高可用
  • 原文地址:https://www.cnblogs.com/malloc/p/2482957.html
Copyright © 2011-2022 走看看