HDOJ2071 Max Num
来源:互联网 发布:js 图片跟随鼠标移动 编辑:程序博客网 时间:2024/06/04 00:58
Max Num
Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 26706 Accepted Submission(s): 15224
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
import java.util.Scanner;public class P2071 {private static Scanner scanner;public static void main(String[] args) {scanner = new Scanner(System.in);//while(scanner.hasNext()){int n = scanner.nextInt();while(n-->0){int m = scanner.nextInt();double max = Double.MIN_VALUE;while(m-->0){double h = scanner.nextDouble();if(h>max){max = h;}}System.out.printf("%.2f",max);System.out.println();}}//}}
阅读全文
0 0
- HDOJ2071 Max Num(水题)
- HDOJ2071 Max Num
- max num
- Max Num
- Max Num
- Max Num
- HDOJ 1003 - Max Num
- 2071 Max Num
- HDU 2071 Max Num
- HDU_2071 Max Num
- Max Num 2071
- nefu 650 max num
- 2071 Max Num
- HDUJ 2071 Max Num
- HDU 2071 Max Num
- hdu-2071-Max Num
- hd 2071 Max Num
- hdu 2071 Max Num
- 3、调度的基本准则与方式
- iOS中的MVP模式初探
- Java常用类介绍
- android模拟数据实现全选反选批量删除
- FT,FS,DTFT,DFS,DFT,FFT的区分
- HDOJ2071 Max Num
- RSA AES 前端JS与后台JAVA的加密解密的是实现
- springMVC 的工作原理和机制
- 75. Sort Colors
- VIP视频解析
- Android 透明状态栏
- Collection接口和迭代器
- CS231n学习笔记--14. Reinforcement Learning
- 约瑟夫问题