Clay Bully
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 4252 | Accepted: 2580 |
Description
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.
一定要注意最后面的那个“.”
import java.util.*; class Clay { private int l = 0; private int w = 0; private int h = 0; private String name; private int size = 0; public Clay(String l, String w, String h, String name) { this.l = Integer.valueOf(l).intValue(); this.w = Integer.valueOf(w).intValue(); this.h = Integer.valueOf(h).intValue(); this.name = name; this.size = this.l * this.w * this.h; } public int getSize() { return size; } public String getName() { return name; } } public class Main { public static void main(String[] args) { Scanner cin = new Scanner(System.in); while(true) { int num = Integer.valueOf(cin.nextLine()).intValue(); if(num == -1) break; List list = new ArrayList(); for(int i = 0; i < num; i++) { String[] str = cin.nextLine().split(" "); Clay clay = new Clay(str[0], str[1], str[2], str[3]); list.add(clay); } Iterator iter = list.iterator(); int max = 0; int min = 250; String maxName = null; String minName = null; while(iter.hasNext()) { Clay theone = (Clay)iter.next(); if(theone.getSize() > max) { max = theone.getSize(); maxName = theone.getName(); } if(theone.getSize() < min) { min = theone.getSize(); minName = theone.getName(); } } System.out.println(maxName + " took clay from " + minName + "."); } } }
发表评论
-
POJ ACM习题【No.2328】
2009-07-05 19:43 895Guessing Game Time ... -
POJ ACM习题【No.3157】
2009-04-26 23:54 1633Java vs C++ Time Lim ... -
POJ ACM习题【No.2924】
2009-04-26 11:52 919Gauß in Elementary School ... -
POJ ACM习题【No.3176】
2009-04-26 10:53 1042Cow Bowling Time Lim ... -
POJ ACM习题【No.3173】
2009-04-25 23:30 899Parkside's Triangle ... -
POJ ACM习题【No.2845】
2009-04-25 22:25 120801000001 Time Limit: ... -
POJ ACM习题【No.2140】
2009-04-25 21:26 931Herd Sums Time Limit ... -
POJ ACM习题【No.1969】
2009-04-25 20:59 857Count on Canton Time ... -
POJ ACM习题【No.2840】
2009-04-25 19:24 1002Big Clock Time Limit ... -
POJ ACM习题【No.2521】
2009-04-24 22:41 846How much did the businessman l ... -
POJ ACM习题【No.1326】
2009-04-24 22:14 1007Mileage Bank Time Li ... -
POJ ACM习题【No.3325】
2009-04-24 21:15 1087ICPC Score Totalizer Software ... -
POJ ACM习题【No.2756】
2009-04-24 20:28 770Autumn is a Genius T ... -
POJ ACM习题【No.3062】
2009-04-24 20:10 804Celebrity jeopardy ... -
POJ ACM习题【No.1552】
2009-04-23 19:39 747Doubles Time Limit: ... -
POJ ACM习题【No.1007】
2009-04-23 19:24 845DNA Sorting Time Lim ... -
POJ ACM习题【No.1565】
2009-04-22 22:40 839Skew Binary Time Lim ... -
POJ ACM习题【No.2403】
2009-04-22 22:18 857Hay Points Time Limi ... -
POJ ACM习题【No.1862】
2009-04-22 20:12 694Stripies Time Limit: ... -
POJ ACM习题【No.3224】
2009-04-22 19:57 740Lab杯 Time Limit: 1 ...
相关推荐
方便大家有针对性地联系 祝大家AC愉快~
pojACM题目分类,便于各类型同学分别做题有所参考
相信大家在做poj上的题目的时候如果没有分类的话很迷茫吧....这里有一份目前比较全面的poj题目分类..
02.北大POJ题库使用指南.docx02.北大POJ题库使用指南.docx02.北大POJ题库使用指南.docx02.北大POJ题库使用指南.docx02.北大POJ题库使用指南.docx02.北大POJ题库使用指南.docx02.北大POJ题库使用指南.docx02.北大POJ...
acm数据结构总结.doc acm数据结构总结.doc
poj acm题解,包括绝大部分poj题目的题解,可以供acm爱好者学习研究
本文件是ACM里的一些题目的源码、原题和习题的分析及详细解答。欢迎各位下载
http://acm.pku.edu.cn/JudgeOnline/ acm的AC解题报告
POJ ACM 1015 Jury Compromise 两种解法 解题报告
西工大C语言POJ习题答案.docx
PKU 、POJ ACM/ICPC300多题的代码,还有各种典型问题的分类代码
poj 2007 Scrambled Polygon.md
poj 3183 Stump Removal.md
poj 2430 Lazy Cows.md
poj 2900 Griddy Hobby.md
poj 3435 Sudoku Checker.md
poj 1984 Navigation Nightmare.md
poj 2174 Decoding Task.md
poj 2386 Lake Counting.md
poj 3585 Accumulation Degree.md