[SWEA 1209] Sum

출처 : https://www.swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AV13_BWKACUCFAYh

#include <iostream>

#include <algorithm>

#include <memory.h>

using namespace std;

int result;

int arr[101][101], a, b;

int main()

{

int T; int t;

T = 10;

while (T--)

{

cin >> t; result = 0; memset(arr, 0, sizeof(arr)); a = 0; b = 0;

for (int i = 0; i < 100; i++)

{

for (int j = 0; j < 100; j++)

{

cin >> arr[i][j];

if (i == j) a += arr[i][j];

if ((i + j + 1) == 100) b += arr[i][j];

arr[100][j] += arr[i][j];

arr[i][100] += arr[i][j];

}

}

int z = 100; int i = 0;

while (z--)

{

result = max(result, arr[100][i]);

result = max(result, arr[i][100]);

i++;

}

result = max(result, a);

result = max(result, b);

cout << "#" << t << " " << result << endl;

}

return 0;

}