mirror of
https://github.com/Kiritow/OJ-Problems-Source.git
synced 2024-03-22 13:11:29 +08:00
45 lines
1.1 KiB
C++
45 lines
1.1 KiB
C++
|
#include <stdio.h>
|
||
|
#include <string.h>
|
||
|
int main(void)
|
||
|
{
|
||
|
int n, m;
|
||
|
int i, j;
|
||
|
int t, d;
|
||
|
int s[50];
|
||
|
int c[5];
|
||
|
int sc[50][5];
|
||
|
while (scanf("%d%d", &n, &m) != EOF)
|
||
|
{
|
||
|
memset(s, 0, sizeof(s));
|
||
|
memset(c, 0, sizeof(c));
|
||
|
memset(sc, 0, sizeof(sc));
|
||
|
for (i = 0 ; i < n ; i++)
|
||
|
{
|
||
|
for (j = 0 ; j < m ; j++)
|
||
|
{
|
||
|
scanf("%d", &sc[i][j]);
|
||
|
c[j] += sc[i][j];
|
||
|
s[i] += sc[i][j];
|
||
|
}
|
||
|
}
|
||
|
for (i = 0 ; i < n ; i++)
|
||
|
printf("%.2lf%c", s[i] * 1.0 / m, i < n - 1 ? ' ' : ' \n');
|
||
|
for (i = 0 ; i < m ; i++)
|
||
|
printf("%.2lf%c", c[i] * 1.0 / n, i < m - 1 ? ' ' : ' \n');
|
||
|
for (t = i = 0 ; i < n ; i++)
|
||
|
{
|
||
|
for (d = 1, j = 0 ; j < m ; j++)
|
||
|
{
|
||
|
if (sc[i][j] < 1.0 * c[j] / n)
|
||
|
{
|
||
|
d = 0;
|
||
|
break;
|
||
|
}
|
||
|
}
|
||
|
if (d) t++;
|
||
|
}
|
||
|
printf("%d\n\n", t);
|
||
|
}
|
||
|
return 0;
|
||
|
}
|