some image

Codes and Tags

Solucionando Problem 8 – Project Euler

Etiquetas: , Blog, Challenges No comments

Este problema ha sido muy interesante, pues consistia en hallar el mayor producto de 1000 digitos, los cuales tenian que ser 5 numeros multiplicados consecutivamente. La solucion que se presenta a continuacion permite variar la cantidad de digitos que se multiplican, dado tal caso en que pueda ser util para proximas soluciones :) .

Problema

 Find the greatest product of five consecutive digits in the 
 1000-digit number.

Solución

/**
 * Find the greatest product of five consecutive digits in the 1000-digit
 * number.
 * 
 * @author codesandtags
 * 
 */

public class Problem8 {

	public static void main(String[] args) {

		String digits = "73167176531330624919225119674426574742355349194934"
				+ "96983520312774506326239578318016984801869478851843"
				+ "85861560789112949495459501737958331952853208805511"
				+ "12540698747158523863050715693290963295227443043557"
				+ "66896648950445244523161731856403098711121722383113"
				+ "62229893423380308135336276614282806444486645238749"
				+ "30358907296290491560440772390713810515859307960866"
				+ "70172427121883998797908792274921901699720888093776"
				+ "65727333001053367881220235421809751254540594752243"
				+ "52584907711670556013604839586446706324415722155397"
				+ "53697817977846174064955149290862569321978468622482"
				+ "83972241375657056057490261407972968652414535100474"
				+ "82166370484403199890008895243450658541227588666881"
				+ "16427171479924442928230863465674813919123162824586"
				+ "17866458359124566529476545682848912883142607690042"
				+ "24219022671055626321111109370544217506941658960408"
				+ "07198403850962455444362981230987879927244284909188"
				+ "84580156166097919133875499200524063689912560717606"
				+ "05886116467109405077541002256983155200055935729725"
				+ "71636269561882670428252483600823257530420752963450";

		Problem8 solve = new Problem8();
		System.out
				.println("The greatest product of five consecutive digits in the 1000-digit number : "
						+ solve.greatestProduct(digits, 5));

	}

	/**
	 * Obtiene el mayor producto de N consecutivos datos en un grupo de X
	 * digitos. Los digitos multiplicados consecutivamente pueden ser variables.
	 * 
	 * @param digits
	 * @return
	 */
	public long greatestProduct(String digits, int consecutives) {
		// Almacena el producto mayor
		long greatesProduct = 0;
		for (int i = 0; i < digits.length() - consecutives; i++) {
			// Tomo una parte de digitos consecutivos
			String portion = digits.substring(i, i + consecutives);
			long product = 1;
			// Se obtiene el producto de la porcion sacada
			for (int k = 0; k < portion.length(); k++) {
				// Obtengo el producto de los numeros
				product *= Integer.parseInt("" + portion.charAt(k));
			}
			// Evaluo el mayor producto
			if (product > greatesProduct) {
				greatesProduct = product;
			}
		}
		// Hakuna Matata
		return greatesProduct;
	}

}

About Edwin Torres

Related Posts

  • Logo Java
  • Logo Java
  • Logo Java
  • Project Euler Logo

Add your comment