ProEuler_P11

package problems;

import java.util.*;
import java.io.*;
import java.lang.*;

public class Problem_011 {

    /**
     * @param args
     */

    /*
     *  Find the largest product of four numbers in this clusterfuck, horizontal, vertical or diagonal.
     *
     *  20x20 = 2x10x2x10 = 2x2x10x10 = 4x100 = 400
     *
     *  08 02 22 97 38 15 00 40 00 75 04 05 07 78 52 12 50 77 91 08
        49 49 99 40 17 81 18 57 60 87 17 40 98 43 69 48 04 56 62 00
        81 49 31 73 55 79 14 29 93 71 40 67 53 88 30 03 49 13 36 65
        52 70 95 23 04 60 11 42 69 24 68 56 01 32 56 71 37 02 36 91
        22 31 16 71 51 67 63 89 41 92 36 54 22 40 40 28 66 33 13 80
        24 47 32 60 99 03 45 02 44 75 33 53 78 36 84 20 35 17 12 50
        32 98 81 28 64 23 67 10 26 38 40 67 59 54 70 66 18 38 64 70
        67 26 20 68 02 62 12 20 95 63 94 39 63 08 40 91 66 49 94 21
        24 55 58 05 66 73 99 26 97 17 78 78 96 83 14 88 34 89 63 72
        21 36 23 09 75 00 76 44 20 45 35 14 00 61 33 97 34 31 33 95
        78 17 53 28 22 75 31 67 15 94 03 80 04 62 16 14 09 53 56 92
        16 39 05 42 96 35 31 47 55 58 88 24 00 17 54 24 36 29 85 57
        86 56 00 48 35 71 89 07 05 44 44 37 44 60 21 58 51 54 17 58
        19 80 81 68 05 94 47 69 28 73 92 13 86 52 17 77 04 89 55 40
        04 52 08 83 97 35 99 16 07 97 57 32 16 26 26 79 33 27 98 66
        88 36 68 87 57 62 20 72 03 46 33 67 46 55 12 32 63 93 53 69
        04 42 16 73 38 25 39 11 24 94 72 18 08 46 29 32 40 62 76 36
        20 69 36 41 72 30 23 88 34 62 99 69 82 67 59 85 74 04 36 16
        20 73 35 29 78 31 90 01 74 31 49 71 48 86 81 16 23 57 05 54
        01 70 54 71 83 51 54 69 16 92 33 48 61 43 52 01 89 19 67 48
     */
    public static void main(String[] args) {
        // TODO Auto-generated method stub

        numberFuck();
    }

    public static void numberFuck() {

        File numberCluster = new File ("Problem_011_data.txt");

        int numCheck1 = 0;
        int numCheck2 = 0;
        int numCheck3 = 0;
        int numCheck4 = 0;

        int currentProd = 0;
        int maxFact1 = 0;
        int maxFact2 = 0;
        int maxFact3 = 0;
        int maxFact4 = 0;

        int maxProd = 0 ;
        int maxProdHorizontal = 0;
        int maxProdVertical = 0;
        int maxProdDiagRight = 0;
        int maxProdDiagLeft = 0;



        try {

            int[][] numberArray =  new int[20][20];
            Scanner fileInput = new Scanner(numberCluster);


            for(int i = 0; i<20; i++){  /* Inject numbers into array.*/

                for(int j = 0; j<20; j++){
                    numberArray[i][j] = fileInput.nextInt();

                }
            }

            // Look for big number horizontally.

            for(int i = 0; i < 20; i++){

                for(int j = 0; j < 17; j++){

                    numCheck1 = numberArray[i][j];
                    numCheck2 = numberArray[i][j+1];
                    numCheck3 = numberArray[i][j+2];
                    numCheck4 = numberArray[i][j+3];

                    currentProd = numCheck1 * numCheck2 * numCheck3 * numCheck4;

                    if( currentProd > maxProd){
                        maxProd = currentProd;
                        maxFact1 = numCheck1;
                        maxFact2 = numCheck2;
                        maxFact3 = numCheck3;
                        maxFact4 = numCheck4;
                    }

                }

            }

            maxProdHorizontal = maxProd;

            System.out.printf("%-17s %9d %9s %2d %2d %2d %2d","Max horizontal:", maxProdHorizontal, "Factors: ", maxFact1, maxFact2, maxFact3, maxFact4 );
            System.out.println();

            maxProd = 0;

            // Look for big number vertically.

            for(int i = 0; i < 20; i++){

                for(int j = 0; j < 17; j++){

                    numCheck1 = numberArray[j][i];
                    numCheck2 = numberArray[j+1][i];
                    numCheck3 = numberArray[j+2][i];
                    numCheck4 = numberArray[j+3][i];

                    currentProd = numCheck1 * numCheck2 * numCheck3 * numCheck4;

                    if( currentProd > maxProd){

                        maxProd = currentProd;
                        maxFact1 = numCheck1;
                        maxFact2 = numCheck2;
                        maxFact3 = numCheck3;
                        maxFact4 = numCheck4;
                    }

                }

            }

            maxProdVertical = maxProd;

            System.out.printf("%-17s %9d %9s %2d %2d %2d %2d","Max verticalt:", maxProdVertical, "Factors: ", maxFact1, maxFact2, maxFact3, maxFact4 );
            System.out.println();

            maxProd = 0;

            // Look for big number diagonally, leftwards. Like this: --> \

            for(int i = 0; i < 17; i++){

                for(int j = 0; j < 17; j++){

                    numCheck1 = numberArray[i][j];
                    numCheck2 = numberArray[i+1][j+1];
                    numCheck3 = numberArray[i+2][j+2];
                    numCheck4 = numberArray[i+3][j+3];

                    currentProd = numCheck1 * numCheck2 * numCheck3 * numCheck4;

                    if( currentProd > maxProd){

                        maxProd = currentProd;
                        maxFact1 = numCheck1;
                        maxFact2 = numCheck2;
                        maxFact3 = numCheck3;
                        maxFact4 = numCheck4;
                    }

                }

            }

            maxProdDiagRight = maxProd;

            System.out.printf("%-17s %9d %9s %2d %2d %2d %2d","Max diag, right:", maxProdDiagRight, "Factors: ", maxFact1, maxFact2, maxFact3, maxFact4 );
            System.out.println();

            maxProd = 0;

            // Look for big number diagonally, leftwards. \

            for(int i = 0; i < 17; i++){

                for(int j = 0; j < 17; j++){

                    numCheck1 = numberArray[j][i+3];
                    numCheck2 = numberArray[j+1][i+2];
                    numCheck3 = numberArray[j+2][i+1];
                    numCheck4 = numberArray[j+3][i];

                    currentProd = numCheck1 * numCheck2 * numCheck3 * numCheck4;

                    if( currentProd > maxProd){

                        maxProd = currentProd;
                        maxFact1 = numCheck1;
                        maxFact2 = numCheck2;
                        maxFact3 = numCheck3;
                        maxFact4 = numCheck4;
                    }

                }

            }

            maxProdDiagLeft = maxProd;

            System.out.printf("%-17s %9d %9s %2d %2d %2d %2d","Max diag, left:", maxProdDiagLeft, "Factors: ", maxFact1, maxFact2, maxFact3, maxFact4 );
            System.out.println();

            maxProd = 0;

        } catch (FileNotFoundException e) {
            // TODO Auto-generated catch block
            e.printStackTrace();
        }



    }


}