-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathArr66.java
33 lines (32 loc) · 1 KB
/
Arr66.java
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
26
27
28
29
30
31
32
33
import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;
public class Arr66 {
public static void main(String[] args) throws IOException{
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
int[][] ar= new int[6][6];
int[] sumnum=new int[8];
int i, j, sum,max;
for (i = 0; i < 6; i++) {
String s[]=br.readLine().split(" ");
for (j = 0; j < 6; j++) {
ar[i][j]=Integer.parseInt(s[j]);
}
}
for (i = 0; i <= 4; i++) {
for (j = 0; j<= 4; j++) {
sum = ar[i][j]+ar[i][j+1]+ar[i][j+2]+ar[i+1][j+1]+ar[i+2][j]+ar[i+2][j+1]+ar[i+2][j+2];
sumnum[i+j]=sum;
sum=0;
}
}
max=sumnum[0];
for(i=0;i<8;i++){
if(sumnum[i]>max)
max=sumnum[i];
}
System.out.println(max);
}
}