HDUOJ 2071 Max Num

〆琦怪〆

于 2022-03-10 10:44:42 发布

阅读量108

点赞数

分类专栏： HDUOJ刷题记录文章标签：算法 c语言排序算法

本文链接：https://blog.csdn.net/qq_45114168/article/details/123395347

版权

HDUOJ刷题记录专栏收录该内容

72 篇文章 3 订阅

订阅专栏

HDUOJ 2071 Max Num

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

大水题，没啥说的

#include<stdio.h>

int main() {
    int n,m;
    double score,max;
    scanf("%d",&n);
    while(n--) {
        scanf("%d",&m);
        max = 0;
        for(int i=0; i<m; i++) {
            scanf("%lf",&score);
            if(score>max)
                max = score;
        }
        printf("%.2lf\n",max);
    }

    return 0;
}

〆琦怪〆

关注

0
点赞
踩
0

收藏

觉得还不错? 一键收藏
0
评论
HDUOJ 2071 Max Num

HDUOJ 2071 Max NumProblem DescriptionThere are some students in a class, Can you help teacher find the highest student .InputThere are some cases. The first line contains an integer t, indicate the cases; Each case have an integer n ( 1 ≤ n ≤ 100 ) , f
复制链接

扫一扫