ProjectEuler/ProjectEulerJava
1
0
Fork 0
mirror of https://bitbucket.org/Mattrixwv/projecteulerjava.git synced 2026-02-03 19:02:28 -05:00
Code Issues Packages Projects Releases Wiki Activity

Updated some results to be neater

Browse Source
This commit is contained in:
Mattrixwv
2020-08-28 11:05:09 -04:00
parent c40e1be88d
commit ea67dd3364
4 changed files with 4 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -106,7 +106,7 @@ public class Problem14 extends Problem{
if(!solved){ if(!solved){
throw new Unsolved(); throw new Unsolved();
} }
return String.format("The number %d produced a chain of %d steps\n", maxNum, maxLength); return String.format("The number %d produced a chain of %d steps", maxNum, maxLength);
} }
//Returns the length of the requested chain //Returns the length of the requested chain
public long getLength(){ public long getLength(){

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

@@ -85,7 +85,7 @@ public class Problem16 extends Problem{
if(!solved){ if(!solved){
throw new Unsolved(); throw new Unsolved();
} }
return String.format("%d^%d = %s\nThe sum of the elements is %d\n", NUM_TO_POWER, POWER, num.toString(), sumOfElements); return String.format("%d^%d = %s\nThe sum of the elements is %d", NUM_TO_POWER, POWER, num.toString(), sumOfElements);
} }
//Returns the number that was calculated //Returns the number that was calculated
public BigInteger getNumber(){ public BigInteger getNumber(){

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

@@ -184,7 +184,7 @@ public class Problem17 extends Problem{
if(!solved){ if(!solved){
throw new Unsolved(); throw new Unsolved();
} }
return String.format("The sum of all the letters in all the numbers %d-%d is %d\n", START_NUM, STOP_NUM, letterCount); return String.format("The sum of all the letters in all the numbers %d-%d is %d", START_NUM, STOP_NUM, letterCount);
} }
//Returns the number of letters asked for //Returns the number of letters asked for
public long getLetterCount(){ public long getLetterCount(){

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

@@ -105,7 +105,7 @@ public class Problem8 extends Problem{
if(!solved){ if(!solved){
throw new Unsolved(); throw new Unsolved();
} }
return String.format("The greatest product is %d\nThe numbers are %d", maxProduct, maxNums); return String.format("The greatest product is %d\nThe numbers are %s", maxProduct, maxNums);
} }
//Returns the string of numbers that produces the largest product //Returns the string of numbers that produces the largest product
public String getLargestNums(){ public String getLargestNums(){