解题思路:
注意事项:
参考代码:
#include<stdio.h>
int main()
{
int n, m, a[100][100];
while (scanf("%d %d", &m, &n) != EOF)
{
int i, j,sum=0,max,max_sign_j;
for (i = 0; i < m; i++)
{
for (j = 0; j < n; j++)
scanf("%d", &a[i][j]);
}
for (i = 0; i < m; i++)
{
max = a[i][0];
max_sign_j = 0;
sum = 0;
for (j = 0; j < n; j++)
{
sum += a[i][j];
if (max < a[i][j])
{
max = a[i][j];
max_sign_j = j;
}
}
for (j = 0; j < n; j++)
{
if (max == a[i][j])
{
max_sign_j = j;
break;
}
}
a[i][max_sign_j] = sum;
}
for (i = 0; i < m; i++)
{
for (j = 0; j < n; j++)
printf("%d ", a[i][j]);
printf("\n");
}
}
return 0;
}
0.0分
0 人评分