UVA 12709 Falling Ants(简单的比较大小)
来源:互联网 发布:我知女人心评价 编辑:程序博客网 时间:2024/05/25 19:58
Input
The input file contains at most 500 test cases. The description of each test case is given below:
First line of each test case contains an integer T (T ≤ 100) which denotes the total number of ants
to consider. Each of the next T lines contains three integers which denote the value of L, W and H
(1 ≤ L,W,H ≤ 50) of an ant respectively.
Input is terminated by a line containing a single zero.
Output
For each set of input produce one line of output. This line contains the volume of the ant that has the
highest downward acceleration. If there is a tie report the ant with the highest volume.
Sample Input
3
3 4 5
12 1 5
20 10 4
3
3 4 5
20 30 5
1 2 4
0
Sample Output
60
3000
AC代码:
#include <stdio.h>//author:XXYYint main(){int T,l,w,h,maxh,t,max;while(~scanf("%d",&T),T){t=1;maxh=max=0;while(T--){scanf("%d%d%d",&l,&w,&h);if(t){maxh=h;max=l*w*h;t=0;}else{if(maxh<h){maxh=h;max=l*w*h;}else if(maxh==h)if(l*w*h>max)max=l*w*h;}}printf("%d\n",max);}return 0;}
0 0
- UVA 12709 Falling Ants(简单的比较大小)
- UVA12709 Falling Ants(数学题)
- Falling Ants
- Uva live 4043 Ants( KM+简单的计算几何)
- UVALive 6650 Falling Ants
- UVA Ants(水题)
- UVA 10714 Ants (贪心)
- uva 10714 Ants(贪心)
- UVA - 10714 Ants(贪心)
- uva 10714 Ants(贪心)
- uva 699 The Falling Leaves(建树)
- HDU 3402 Ants run!(比较好的贪心)
- 简单的js比较时间的大小
- The Falling Leaves 简单的遍历+建树
- ACMer第7天Falling Ants
- JS 日期比较大小的简单实例
- The Falling Leaves 下落的树叶 UVA 699(二叉树)
- 例题6-10 下落的树叶(The Falling Leaves, UVa 699)
- ubuntu显卡好用,但是分辨率不高问题的解决方法
- UserManage.cpp
- 字符转义
- 机器学习算法汇总:人工神经网络、深度学习及其它
- 单词排序
- UVA 12709 Falling Ants(简单的比较大小)
- STL源码学习----内存管理
- jsmart 前端绑定案例
- 给myeclipse 添加自动注释 作者 日期
- Spring MVC静态资源处理
- MySQL常用的日期加减函数与实例教程
- 厣裂擦涂诺染潜谑竿说逼竿竿壹橙
- makefile中的shell语法
- 季傻殖刹蓟闯赐阜肯邢滴婆咀衔婆