HDU ACM 11 2023 求平均成绩

最新推荐文章于 2022-01-27 16:21:53 发布

lunaArcher

最新推荐文章于 2022-01-27 16:21:53 发布

阅读量557

点赞数

本文链接：https://blog.csdn.net/lunaArcher/article/details/52792936

版权

#include <iostream>
using namespace std;
int main()
{
	double Lu[100][100];
	int n, m, x, j = 0, Yi = 0, Zheng = 0;
	double sum = 0, averange;
	double Hui[100];
	double w[100];
	while (cin >> n >> m && n)
	{
		for (int i = 0; i < n; i++)
			for (x = 0; x < m; x++)
				cin >> Lu[i][x];
		for (int i = 0; i < n; i++)
		{
			for (x = 0; x < m; x++)
				sum += Lu[i][x];
			averange = sum/m;
			w[i] = averange;
			averange = 0;
			sum = 0;
		}
		cout << fixed;
		cout.precision(2);
		cout << w[0];
		for (int i = 1; i < n; i++)
			cout << ' ' << w[i];
		cout << endl;

		for (int i = 0; i < m; i++)
		{
			for (x = 0; x < n; x++)
				sum += Lu[x][i];
			averange = sum/n;
			Hui[i] = averange;
			cout << fixed;
			cout.precision(2);
			averange = 0;
			sum = 0;
		}
		cout << Hui[0];
		for (int i = 1; i < m; i++)
			cout << ' ' << Hui[i];
		cout << endl;
		for (int i = 0; i < n; i++)
		{
			for (x = 0; x < m; x++)
			{
				if (Lu[i][x] >= Hui[x])
					Yi++;
			}
			if (Yi == m)
				Zheng++;
			Yi = 0;
		}
		cout << Zheng << endl << endl;
		Zheng = 0;
		j = 0;
	}
	return 0;
}