-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathDay 11
25 lines (22 loc) · 756 Bytes
/
Day 11
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
import java.util.Scanner;
public class Solution {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int arr[][] = new int[6][6];
for (int i = 0; i < 6; i++) {
for (int j = 0; j < 6; j++) {
arr[i][j] = in.nextInt();
}
}
int max = -9 * 7;
for (int i = 0; i < 6; i++) {
for (int j = 0; j < 6; j++) {
if (j + 2 < 6 && i + 2 < 6) {
int sum = arr[i][j] + arr[i][j + 1] + arr[i][j + 2] + arr[i + 1][j + 1] + arr[i + 2][j] + arr[i + 2][j + 1] + arr[i + 2][j + 2];
if (sum > max) max = sum;
}
}
}
System.out.println(max);
}
}