Package net.n1da.dev.euler
Class PE0036
- java.lang.Object
-
- net.n1da.dev.euler.core.Problem
-
- net.n1da.dev.euler.PE0036
-
- All Implemented Interfaces:
Solvable
public class PE0036 extends Problem
Solution for problem 36 "Double-base palindromes" completed on Sat, 12 Mar 2016, 07:12.- Since:
- 12.03.2016 06:23:12
- Author:
- Nico Danneberg
- See Also:
- Problem @ Project Euler, Solution @ Ni-Da-Net
-
-
Method Summary
Modifier and Type Method Description java.lang.String
solve()
This method solves the given problem by checking every number less than 1,000,000 to be a palindrome in both bases, decimal and binary.
-
-
-
Method Detail
-
solve
public java.lang.String solve()
This method solves the given problem by checking every number less than 1,000,000 to be a palindrome in both bases, decimal and binary. If a number is found the decimal value is summed.- Returns:
- the sum of all numbers that are a palindrome in base 2 and 10
- See Also:
Mathe.isPalindrome(int)
,Mathe.isPalindrome(String)
-
-