알고리즘(종합)/Lv.3
1209 - sum
ch.0
2022. 11. 18. 00:46
package test;
import java.io.IOException;
import java.util.Scanner;
public class Solution {
public static void main(String[] args) throws IOException {
Scanner sc = new Scanner(System.in);
int test = 10;
for (int k = 0; k < test; k++) {
int testcase = sc.nextInt();
int[][] array = new int[100][100];
int sum = 0;
int max = 0;
for (int i = 0; i < 100; i++) {
for (int j = 0; j < 100; j++) {
array[i][j] = sc.nextInt();
}
}
for (int i = 0; i < 100; i++) {
for (int j = 0; j < 100; j++) {
// 가로
sum += array[i][j];
if (max < sum) {
max = sum;
}
}
sum = 0;
}
for (int i = 0; i < 100; i++) {
for (int j = 0; j < 100; j++) {
// 세로
sum += array[j][i];
if (max < sum) {
max = sum;
}
}
sum = 0;
}
for (int i = 0; i < 100; i++) {
// 대각선(\)
sum += array[i][i];
if (max < sum) {
max = sum;
}
}
sum = 0;
for (int i = 0; i < 100; i++) {
// 대각선(/)
sum += array[i][99 - i];
if (max < sum) {
max = sum;
}
}
sum = 0;
System.out.println("#" + (k + 1) + " " + max);
}
}
}