From af89d5619e520a94947bc54881004e2d64d210eb Mon Sep 17 00:00:00 2001 From: Mattrixwv Date: Fri, 30 Oct 2020 16:19:12 -0400 Subject: [PATCH] Updated problem 27 algorithm --- src/main/java/mattrixwv/ProjectEuler/Benchmark.java | 2 +- src/main/java/mattrixwv/ProjectEuler/Problems/Problem27.java | 4 ++-- 2 files changed, 3 insertions(+), 3 deletions(-) diff --git a/src/main/java/mattrixwv/ProjectEuler/Benchmark.java b/src/main/java/mattrixwv/ProjectEuler/Benchmark.java index 0344922..f89849b 100644 --- a/src/main/java/mattrixwv/ProjectEuler/Benchmark.java +++ b/src/main/java/mattrixwv/ProjectEuler/Benchmark.java @@ -34,7 +34,7 @@ import mattrixwv.exceptions.InvalidResult; public class Benchmark{ private static final Scanner input = new Scanner(System.in); private static enum BenchmarkOptions{runSpecific, runAllShort, runAll, exit, size}; - private static final ArrayList tooLong = new ArrayList(Arrays.asList(15, 23, 24, 27)); + private static final ArrayList tooLong = new ArrayList(Arrays.asList(15, 23, 24)); //The driver function for the benchmark selection public static void benchmarkMenu() throws InvalidResult{ BenchmarkOptions selection = BenchmarkOptions.size; diff --git a/src/main/java/mattrixwv/ProjectEuler/Problems/Problem27.java b/src/main/java/mattrixwv/ProjectEuler/Problems/Problem27.java index acea19a..16ac4f0 100644 --- a/src/main/java/mattrixwv/ProjectEuler/Problems/Problem27.java +++ b/src/main/java/mattrixwv/ProjectEuler/Problems/Problem27.java @@ -62,7 +62,7 @@ public class Problem27 extends Problem{ timer.start(); //Get the primes - primes = Algorithms.getPrimes(12000); + //primes = Algorithms.getPrimes(12000); //Start with the lowest possible A and check all possibilities after that for(int a = -LARGEST_POSSIBLE_A;a <= LARGEST_POSSIBLE_A;++a){ @@ -71,7 +71,7 @@ public class Problem27 extends Problem{ //Start with n=0 and check the formula to see how many primes you can get with concecutive n's int n = 0; int quadratic = (n * n) + (a * n) + b; - while(Algorithms.isFound(primes, quadratic)){ + while(Algorithms.isPrime(quadratic)){ ++n; quadratic = (n * n) + (a * n) + b; }