Package net.n1da.dev.euler
Class PE0063
- java.lang.Object
-
- net.n1da.dev.euler.core.Problem
-
- net.n1da.dev.euler.PE0063
-
- All Implemented Interfaces:
Solvable
public class PE0063 extends Problem
Solution for problem 63 "Powerful digit counts" completed on Fri, 29 Mar 2019, 23:43.- Since:
- 29.03.2019 23:19:43
- Author:
- Nico Danneberg
- See Also:
- Problem @ Project Euler, Solution @ Ni-Da-Net
-
-
Method Detail
-
solve
public java.lang.String solve()
This method solves the given problem by calculation every power between 1 and 10 with an incrementing exponent. It counts all found n-powers with n digits and stops if no power is found for a specific exponent.- Returns:
- the count of all found powers
-
-