hdoj.2071 Max Num 20140801
来源:互联网 发布:迅雷赚钱宝 监控软件 编辑:程序博客网 时间:2024/04/27 22:50
Max Num
Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 13656 Accepted Submission(s): 8648
Problem Description
There are some students in a class, Can you help teacher find the highest student .
Input
There are some cases. The first line contains an integer t, indicate the cases; Each case have an integer n ( 1 ≤ n ≤ 100 ) , followed n students’ height.
Output
For each case output the highest height, the height to two decimal plases;
Sample Input
23 170.00 165.00 180.004 165.00 182.00 172.00 160.00
Sample Output
180.00182.00#include<stdio.h>int main(){ int n,m; float a,t; scanf("%d",&n); while(n--){ scanf("%d",&m); t=0.00; while(m--){ scanf("%f",&a); if(t<a) t=a; } printf("%.2f\n",t); } return 0;}
0 0
- hdoj.2071 Max Num 20140801
- HDOJ 2071 Max Num
- HDOJ 2071 Max Num
- HDOJ 2071 Max Num
- HDOJ 1003 - Max Num
- hdoj 2701 Max Num
- [数学][第二阶段-简单数学题][HDOJ-2071]Max Num
- 2071 Max Num
- HDU 2071 Max Num
- Max Num 2071
- 2071 Max Num
- HDUJ 2071 Max Num
- HDU 2071 Max Num
- hdu-2071-Max Num
- hd 2071 Max Num
- hdu 2071 Max Num
- HDU 2071 Max Num
- HDU 2071 Max Num
- Unix中init的工作__处女篇博客
- vlc-android源码编译
- 生抽和老抽的区别
- poj-3321 Apple Tree(树状数组)
- 杭电ACM2052Picture(画图)----20140801
- hdoj.2071 Max Num 20140801
- toj1050Courses
- 二分查找
- ios设备唯一标识获取策略
- WINDOWs
- 院士大牛们一年N篇7点以上SCI的诀窍
- Machine Learning 资料推荐
- 生产者消费者问题(Linux多线程下两种实现)
- 让UICollectionView滚到顶部