首页 > 其他 > 详细

Max Num---hdu2071

时间:2015-07-23 21:33:49      阅读:136      评论:0      收藏:0      [点我收藏+]

Max Num

Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 16818    Accepted Submission(s): 10381


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
2
3 170.00 165.00 180.00
4 165.00 182.00 172.00 160.00
 

 

Sample Output
180.00
182.00
 1 #include<stdio.h>
 2 int main()
 3 {
 4     int n,a,i,j;
 5     double s[101],max;
 6     scanf("%d",&n);
 7     while(n--)
 8     {
 9         scanf("%d",&a);
10         for(i=0;i<a;i++)
11         scanf("%lf",&s[i]);
12         max=s[0];
13         for(i=1;i<a;i++)
14         max=max>s[i]?max:s[i]; 
15         printf("%.2lf\n",max);
16     }
17     return 0;
18 }

 

Max Num---hdu2071

原文:http://www.cnblogs.com/Eric-keke/p/4671756.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!