杭电 2023 ( 求平均成绩 ) java

import java.util.*;

public class Main {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        while (sc.hasNext()) {
            int n = sc.nextInt();
            int m = sc.nextInt();
            double ave = 0;
            double ave2 = 0;
            int count = 0;
            int count2 = 0;
            int t = 0;
            double save[] = new double[m];
            double save1[] = new double[n];
            int arr[][] = new int[50][5];
            for (int i = 0; i < n; i++) {
                for (int j = 0; j < m; j++) {
                    arr[i][j] = sc.nextInt();
                }
            }

            for (int i = 0; i < n; i++) {
                for (int j = 0; j < m; j++) {
                    ave += arr[i][j];
                    count++;
                    if (count == m) {
                        save1[i] = ave / m;
                        if (i == 0) {
                            System.out.printf("%.2f", save1[i]);
                        } else {
                            System.out.printf(" " + "%.2f", save1[i]);
                        }
                        ave = 0;
                        count = 0;
                    }
                }
            }
            System.out.println();

            for (int i = 0; i < m; i++) {
                for (int j = 0; j < n; j++) {
                    ave2 += arr[j][i];
                    count2++;
                    if (count2 == n) {
                        save[i] = ave2 / n;
                        if (i == 0) {
                            System.out.printf("%.2f", save[i]);
                        } else {
                            System.out.printf(" " + "%.2f", save[i]);
                        }

                        ave2 = 0;
                        count2 = 0;
                    }
                }
            }

            System.out.println();

            int count3 = 0;
            int q = 0;
            for (int i = 0; i < n; i++) {
                for (int j = 0; j < m; j++) {
                    
                    if (arr[i][j] >= save[j]) {
                        count3++;
                    }
                }

                if (count3 == m) {
                    q++;
                }
                count3 = 0;
            }
            System.out.println(q);
            System.out.println("");

        }

    }
}

评论 1
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包

打赏作者

bruce_suxin

你的鼓励将是我创作的最大动力

¥1 ¥2 ¥4 ¥6 ¥10 ¥20
扫码支付:¥1
获取中
扫码支付

您的余额不足,请更换扫码支付或充值

打赏作者

实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值