1209. [S/W 문제해결 기본] 2일차 - Sum C++

https://swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AV13_BWKACUCFAYh&categoryId=AV13_BWKACUCFAYh&categoryType=CODE&problemTitle=1209&orderBy=FIRST_REG_DATETIME&selectCodeLang=ALL&select-1=&pageSize=10&pageIndex=1 

SW Expert Academy

#include<iostream>
#include<vector>
#include<algorithm>
 
using namespace std;
 
int arr[100][100];
 
int mmax;
 
void run() {
    int sum;
    int max = 0;
 
    for (int i = 0; i < 100; i++) { //입력
        for (int j = 0; j < 100; j++) {
            cin >> arr[i][j];
        }
    }
 
    for (int i = 0; i < 100; i++) { //가로줄
        sum = 0;
        for (int j = 0; j < 100; j++) {
            sum += arr[i][j];
        }
        if (sum > max) max = sum;
    }
 
    for (int i = 0; i < 100; i++) { //세로줄
        sum = 0;
        for (int j = 0; j < 100; j++) {
            sum += arr[j][i];
        }
        if (sum > max) max = sum;
    }
 
    sum = 0;
    for (int i = 0; i < 100; i++) { //대각선1
        sum += arr[i][i];
    }
    if (sum > max) max = sum;
 
 
    sum = 0;
    for (int i = 0; i < 100; i++) { //대각선2
        sum += arr[i][99-i];
    }
    if (sum > max) max = sum;
 
    mmax = max;
 
}
 
int main() {
    int sun;
 
    for (int i = 0; i < 10; i++)
    {
        cin >> sun;
        run();
        cout << "#" << sun << " " <<mmax << endl;
    }
     
    return 0;
}