ProjectEuler/ProjectEulerJava
1
0
Fork 0
mirror of https://bitbucket.org/Mattrixwv/projecteulerjava.git synced 2025-12-06 17:13:58 -05:00
Code Issues Packages Projects Releases Wiki Activity

Updated for performance

Browse Source
This commit is contained in:
Mattrixwv
2020-06-16 01:22:08 -04:00
parent 3b6e5e32ce
commit c3798c6907
1 changed files with 3 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
src/main/java/mattrixwv/ProjectEuler/Problems/Problem10.java
View File

@@ -28,7 +28,7 @@ import mattrixwv.Algorithms;
public class Problem10 extends Problem{ public class Problem10 extends Problem{
//The largest number to check for primes //The largest number to check for primes
private static final Long GOAL_NUMBER = 2000000L; private static final long GOAL_NUMBER = 2000000L;
public Problem10(){ public Problem10(){
super("Find the sum of all the primes below two million"); super("Find the sum of all the primes below two million");
@@ -38,7 +38,7 @@ public class Problem10 extends Problem{
timer.start(); timer.start();
//Get the sum of all prime numbers < GOAL_NUMBER //Get the sum of all prime numbers < GOAL_NUMBER
Long sum = Algorithms.getLongSum(Algorithms.getPrimes(GOAL_NUMBER - 1L)); //Subtract 1 from the number so that it is < the number long sum = Algorithms.getLongSum(Algorithms.getPrimes(GOAL_NUMBER - 1L)); //Subtract 1 from the number so that it is < the number
//Stop the timer //Stop the timer
timer.stop(); timer.stop();
@@ -50,5 +50,5 @@ public class Problem10 extends Problem{
/* Results: /* Results:
The sum of all the primes < 2000000 is 142913828922 The sum of all the primes < 2000000 is 142913828922
It took 201.347 milliseconds to solve this problem. It took 159.610 milliseconds to solve this problem.
*/ */