ZOJ 1755 Clay Bully
来源:互联网 发布:风云万象 厦门网游网络 编辑:程序博客网 时间:2024/05/20 07:50
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.
题意:找到最大和最小的就输出
代码:
#include <stdio.h>
int main()
{
int N;
char a[50][50];
int sum[50];
while(scanf("%d",&N))
{
if(N==-1)
break;
int i,j,k;
int t=0,m=0;
int min,max,max_i=0,min_i=0;
while(N--)
{
scanf("%d%d%d",&i,&j,&k);
sum[t++]=i*j*k;
getchar();
gets(a[m++]);
}
max=sum[0];
min=sum[0];
for(i=0;i<t;i++)
{
if(sum[i]>max)
{
max=sum[i];
max_i=i;
}
if(sum[i]<min)
{
min=sum[i];
min_i=i;
}
}
printf("%s took clay from %s.\n",a[max_i],a[min_i]);
}
return 0;
}
- ZOJ 1755 Clay Bully
- zoj 1755 Clay Bully
- ZOJ 1755 Clay Bully
- zoj 1755 Clay Bully
- zoj 1755 Clay Bully(水~)
- ZOJ Problem Set - 1755 Clay Bully
- ZOJ 1755 && POJ 1547 Clay Bully(简单排序+map容器)
- pku_1547 Clay Bully
- POJ 1547 Clay Bully
- POJ 1547:Clay Bully
- Clay Bully-1547
- 北大ACM poj1547 Clay Bully
- POJ 1547 Clay Bully G++
- POJ 1547 Clay Bully 结构体数组使用题意理解
- 1755_Clay Bully
- 网霸 cyber-bully
- 狱霸 jailhouse bully
- ZOJ-1755
- 数据结构笔记二(20120825)
- 黑马程序员09-网络编程自我提问
- OpenSSH
- Meta-Character and regexp
- Android抽屉实现
- ZOJ 1755 Clay Bully
- linux 系统 查看mysql、apache是否安装,并卸载
- [笔记] rpm安装包相关命令
- poj1001
- linux之dd命令
- 空间分析之多元分析
- 黑马程序员--对于C#中几种循环的简单总结
- 坑爹的VS2008内存泄露报告
- JMX : MXBean