1755_Clay Bully
来源:互联网 发布:dota2 永恒矩阵 编辑:程序博客网 时间:2024/05/31 00:39
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
××××××××××××××××××××××××××××××××××××××××××××××××××××××××××××××××××××××××××××××××××××××××××××××××××
//给出长宽高,找出体积最大的和最小的,最大的抢最小的(每个同学初始时泥巴量相同,最多为250),主要考虑数据存储格式
#include<iostream>
#include<string>
using namespace std;
struct clas
{
int a,b,c;
string s;
};
int main()
{
clas stu[9];//每个班最多有9个同学
int dio[9];
int num;
int i;
int max,min;
int ma,mi;
while(cin>>num&&num!=-1)
{
max=1;
min=250;//初始化很重要
for(i=0;i!=num;i++)
{
cin>>stu[i].a>>stu[i].b>>stu[i].c>>stu[i].s;
dio[i]=stu[i].a*stu[i].b*stu[i].c;
}
for(i=0;i!=num;i++)
{
if(dio[i]>max)
{
max=dio[i];
ma=i;
}
if(dio[i]<min)
{
min=dio[i];
mi=i;
}
}
cout<<stu[ma].s<<" took clay from "<<stu[mi].s<<"."<<endl;
}
return 0;
}
- 1755_Clay Bully
- 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容器)
- 网霸 cyber-bully
- pku_1547 Clay Bully
- 狱霸 jailhouse bully
- POJ 1547 Clay Bully
- POJ 1547:Clay Bully
- Clay Bully-1547
- 北大ACM poj1547 Clay Bully
- POJ 1547 Clay Bully G++
- FW: Yudan ,a big bully and monster ?
- 【MongoDB】复制集 相关 (bully算法)
- c++ primier 第十章文本查询实例
- Matlab曲线拟合
- 黑马程序员-- Java多线程编程总结
- opensuse死机
- ISE综合出错的问题解决
- 1755_Clay Bully
- makefile文件的编写
- java 中汉字的转化成Unicode编码 的方法 JDK自带的native2ascii工具
- ice 性能
- 创新源于模仿之一:TabActivity的美化
- Android BroadcastReceiver(一)
- rtsp rtmp http流媒体客户端开发
- centos 修改系统时间
- 关于jvm调优