九度OJ 题目1191：矩阵最大值

/*************************************************
* @Date    : 2017-09-16 19:36:19
* @Author  : Lewis Tian (chasetichlewis@gmail.com)
* @GitHub    : https://github.com/LewisTian 
* Copyright (c) 2017 Tich. All rights reserved.
**************************************************/

#include <stdio.h>

int ma[101][101];

int main(int argc, char const *argv[]){
int i, j, m, n, max;
int sum, pos;
while(scanf("%d %d", &m, &n) != EOF) {
for (i = 0; i < m; ++i) {
pos = sum = 0;
for (j = 0; j < n; ++j){
scanf("%d", &ma[i][j]);
sum += ma[i][j];
if (j == 0) {
max = ma[i][j];
}
else if (ma[i][j] > max) {
max = ma[i][j];
pos = i;
}
}
ma[i][pos] = sum;
}
for (i = 0; i < m; ++i){
for (j = 0; j < n; ++j){
printf("%d ", ma[i][j]);
}
printf("\n");
}
}
return 0;
}