mirror of
https://bitbucket.org/Mattrixwv/projecteulerjava.git
synced 2025-12-06 17:13:58 -05:00
Updated runtimes because of changes
This commit is contained in:
@@ -234,5 +234,5 @@ public class Problem18 extends Problem{
|
||||
|
||||
/* Results:
|
||||
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
|
||||
*/
|
||||
|
||||
@@ -352,10 +352,9 @@ public class Problem67 extends Problem{
|
||||
//Stop the timer
|
||||
timer.stop();
|
||||
|
||||
//Print the results
|
||||
//Get the correct total which will be the inversion of the current one
|
||||
int actualTotal = ((100 * NUM_ROWS) - foundPoints.get(foundPoints.size() - 1).total);
|
||||
|
||||
//Save the results
|
||||
result = "The value of the longest path is " + actualTotal;
|
||||
|
||||
//Throw a flag to show the problem is solved
|
||||
@@ -411,5 +410,5 @@ public class Problem67 extends Problem{
|
||||
|
||||
/* Results:
|
||||
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
|
||||
*/
|
||||
|
||||
Reference in New Issue
Block a user