1209. [S/W 문제해결 기본] 2일차 - Sum(D3)

#include <stdio.h>
#include <algorithm>
using namespace std;
int main(void) {
    int test_case=10;
//    scanf("%d\n", &test_case);
    for (int z = 1; z <= test_case; z++) {
        int n;
        scanf("%d", &n);
        int arr[100][100] = { { 0, }, };
        int max = 0;
        for (int i = 0; i < 100; i++)
        {
            int sum = 0;
            for (int j = 0; j < 100; j++) {
                scanf("%d", &arr[i][j]);
                sum += arr[i][j];
            }
            if (sum > max)
                max = sum;
        }
        int sum2 = 0;
        int sum3 = 0;
        for (int j = 0; j < 100; j++) {
            int sum = 0;
            for (int i = 0; i < 100; i++) {
                sum += arr[i][j];
            }
            if (sum > max)
                max = sum;
            sum2 += arr[j][j];
            sum3 += arr[j][100 - j-1];
        }
        if (sum2 > max)
            max = sum2;
        if (sum3 > max)
            max = sum3;
 
        printf("#%d %d\n", z,max);
    }
    return 0;
}