Last active
April 21, 2017 23:31
-
-
Save LuxXx/e257f960623ac63fbd4acc2ff08d9bce to your computer and use it in GitHub Desktop.
Project Euler - Problem 52
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
package euler; | |
import java.util.Arrays; | |
public class SameDigits { | |
public static String sort(String s) { | |
char[] array = s.toCharArray(); | |
Arrays.sort(array); | |
return new String(array); | |
} | |
public static void main(String[] args) { | |
for (int i = 1; i < 1_000_000_000; i++) { | |
String n = String.valueOf(i); | |
String n2 = String.valueOf(2*i); | |
String n3 = String.valueOf(3*i); | |
String n4 = String.valueOf(4*i); | |
String n5 = String.valueOf(5*i); | |
String n6 = String.valueOf(6*i); | |
n = sort(n); | |
n2 = sort(n2); | |
n3 = sort(n3); | |
n4 = sort(n4); | |
n5 = sort(n5); | |
n6 = sort(n6); | |
if (n.equals(n2) && n2.equals(n3) && n3.equals(n4) && n4.equals(n5) && n5.equals(n6)) { | |
System.out.println(i); | |
break; | |
} | |
} | |
} | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment