Package net.n1da.dev.euler
Class PE0062
- java.lang.Object
-
- net.n1da.dev.euler.core.Problem
-
- net.n1da.dev.euler.PE0062
-
- All Implemented Interfaces:
Solvable
public class PE0062 extends Problem
Solution for problem 62 "Cubic permutations" completed on Fri, 29 Mar 2019, 21:58.- Since:
- 29.03.2019 21:18:22
- Author:
- Nico Danneberg
- See Also:
- Problem @ Project Euler, Solution @ Ni-Da-Net
-
-
Field Summary
Fields Modifier and Type Field Description private java.util.Hashtable<LargeNumber,java.lang.Integer>
FoundCount
Stores the count how often the ordered digits of a cubic were foundprivate java.util.Hashtable<LargeNumber,LargeNumber>
FoundFirst
Stores the very first cubic for every found ordered digits
-
Method Summary
-
Methods inherited from class net.n1da.dev.euler.core.Problem
finish, getResult, getRuntime, toString
-
-
-
-
Field Detail
-
FoundCount
private java.util.Hashtable<LargeNumber,java.lang.Integer> FoundCount
Stores the count how often the ordered digits of a cubic were found
-
FoundFirst
private java.util.Hashtable<LargeNumber,LargeNumber> FoundFirst
Stores the very first cubic for every found ordered digits
-
-
Method Detail
-
prepare
public void prepare()
-
solve
public java.lang.String solve()
This method solves the problem by checking every cubic's ordered digits if they were found before. If a combination of ordered digits is found five times the very first found cubic is returned.- Returns:
- the first found cubic with 5 permutations
-
-