/*
 * Tyler Young
 * Independent Project 1: Project Euler Q8
 * ICS4U1-2
 * October 19, 2014
 */

package eulerProblems;

import java.util.ArrayList;

public class Young_Tyler_Project1_Q8 {

	public static void main(String[] args) {

		// Creates an array list called myArray
		ArrayList<Integer> myArray = new ArrayList<>();

		// Sets Variables
		int counter = 0;
		int currentDig = 0;
		long product = 1;
		long max = 0;

		// 1000 digit number stored as a string
		String num = "73167176531330624919225119674426574742355349194934"
				+ "96983520312774506326239578318016984801869478851843"
				+ "85861560789112949495459501737958331952853208805511"
				+ "12540698747158523863050715693290963295227443043557"
				+ "66896648950445244523161731856403098711121722383113"
				+ "62229893423380308135336276614282806444486645238749"
				+ "30358907296290491560440772390713810515859307960866"
				+ "70172427121883998797908792274921901699720888093776"
				+ "65727333001053367881220235421809751254540594752243"
				+ "52584907711670556013604839586446706324415722155397"
				+ "53697817977846174064955149290862569321978468622482"
				+ "83972241375657056057490261407972968652414535100474"
				+ "82166370484403199890008895243450658541227588666881"
				+ "16427171479924442928230863465674813919123162824586"
				+ "17866458359124566529476545682848912883142607690042"
				+ "24219022671055626321111109370544217506941658960408"
				+ "07198403850962455444362981230987879927244284909188"
				+ "84580156166097919133875499200524063689912560717606"
				+ "05886116467109405077541002256983155200055935729725"
				+ "71636269561882670428252483600823257530420752963450";

		// Loops through the 1000 digit number
		for (int i = 0; i < num.length(); i++) {

			// Gets the current digit through converting it into an integer
			currentDig = Integer.parseInt("" + num.charAt(i));

			// Adds the current digit to the array list
			myArray.add(currentDig);

			// increments the counter by one
			counter++;

			// Once the counter reaches 13, it will multiply and set the largest
			// product to the variable max
			if (counter == 13) {

				// For each loop for my array list will get the product of the 13 digits
				// for everything in the set, going through each term
				for (int j : myArray) {

					product = j * product;
				}

				// Compares the current product to the max
				// will set to the max if the current product is larger
				if (product > max) {

					max = product;

				}

				// Removes the first digit in the array list
				myArray.remove(0);

				// Resets the product
				product = 1;
			}

			// Sets the counter to max out at 13 digits (Arrays start at 0)
			counter = myArray.size();


		}

		// Prints out the maximum product
		System.out.println(max);

	}
}