I’ve been working on this for a while. I’m nearly done, but I’m having a little trouble. There’s something wrong with the code. I intellection it was right, but I’ve done some investigating with quaternary numbers in a article and there are answers large than the one I’m effort with the code.
That’s my main concern right now, but if you conceive you would like to help, I’m having trouble doing the for wrap for the adjacent diagonal numbers. thanks!

Program:
Write a java program to feature in the aggregation from the enter “numbers.txt” and to determine the
greatest creation of quaternary adjacent numbers in any direction (up, down, left, right, or diagonally)in the 20 by 20 grid. Note: the program should work for any installation 5×5 15×5 etc, but doesn’t hit to

Code:
import java.io.*;
import java.util.*;

public class Grid2{

public static vacuum main(String[] args)throws java.io.IOException {
int array[][] = new int[20][20];

Scanner s = new Scanner(new FileReader(“numbers.txt”));

for(int x = 0; x < 20; x++){
for(int y = 0; y < 20; y++){
array[x][y]= s.nextInt();}}

int i, j;
int maxSum = 0;
int tempSum = 0;

// Checks row
for(i = 0; i < 20; i++){
tempSum = 1;
for(j = 0; j < 20; j++){
tempSum *= array[i][j];
if(j % 4 == 0){
if(tempSum > maxSum){
maxSum = tempSum;}
tempSum = 1;
}}
}

// Checks column
for(i = 0; i < 20; i++){
tempSum = 1;
for(j = 0; j < 20; j++){
tempSum *= array[j][i];
if(j % 4 == 0){
if(tempSum > maxSum){
maxSum = tempSum;}
tempSum = 1;
}}
}
System.out.println(“Greatest Sum: ” + maxSum);
}}