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 runtimes because of changes

Browse Source
This commit is contained in:
Mattrixwv
2020-07-20 00:54:00 -04:00
parent b1f2c4cbf7
commit 1d1b7676aa
2 changed files with 3 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
src/main/java/mattrixwv/ProjectEuler/Problems/Problem18.java
View File

@@ -234,5 +234,5 @@ public class Problem18 extends Problem{
/* Results: /* Results:
The value of the longest path is 1074 The value of the longest path is 1074
It took an average of 252.472 microseconds to run this problem through 100 iterations It took an average of 198.418 microseconds to run this problem through 100 iterations
*/ */

5
src/main/java/mattrixwv/ProjectEuler/Problems/Problem67.java
View File

@@ -352,10 +352,9 @@ public class Problem67 extends Problem{
//Stop the timer //Stop the timer
timer.stop(); timer.stop();
//Print the results
//Get the correct total which will be the inversion of the current one //Get the correct total which will be the inversion of the current one
int actualTotal = ((100 * NUM_ROWS) - foundPoints.get(foundPoints.size() - 1).total); int actualTotal = ((100 * NUM_ROWS) - foundPoints.get(foundPoints.size() - 1).total);
//Save the results
result = "The value of the longest path is " + actualTotal; result = "The value of the longest path is " + actualTotal;
//Throw a flag to show the problem is solved //Throw a flag to show the problem is solved
@@ -411,5 +410,5 @@ public class Problem67 extends Problem{
/* Results: /* Results:
The value of the longest path is 7273 The value of the longest path is 7273
It took an average of 182.482 milliseconds to run this problem through 100 iterations It took an average of 187.077 milliseconds to run this problem through 100 iterations
*/ */