forked from nayuki/Project-Euler-solutions
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathp070.java
More file actions
46 lines (36 loc) · 1.11 KB
/
p070.java
File metadata and controls
46 lines (36 loc) · 1.11 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
/*
* Solution to Project Euler problem 70
* Copyright (c) Project Nayuki. All rights reserved.
*
* https://www.nayuki.io/page/project-euler-solutions
* https://github.com/nayuki/Project-Euler-solutions
*/
import java.util.Arrays;
public final class p070 implements EulerSolution {
public static void main(String[] args) {
System.out.println(new p070().run());
}
private static final int LIMIT = Library.pow(10, 7);
public String run() {
int minNumer = 1; // Initially infinity
int minDenom = 0;
int[] totients = Library.listTotients(LIMIT - 1);
for (int n = 2; n < totients.length; n++) {
int tot = totients[n];
if ((long)n * minDenom < (long)minNumer * tot && hasSameDigits(n, tot)) {
minNumer = n;
minDenom = tot;
}
}
if (minDenom == 0)
throw new RuntimeException("Not found");
return Integer.toString(minNumer);
}
private static boolean hasSameDigits(int x, int y) {
char[] xdigits = Integer.toString(x).toCharArray();
char[] ydigits = Integer.toString(y).toCharArray();
Arrays.sort(xdigits);
Arrays.sort(ydigits);
return Arrays.equals(xdigits, ydigits);
}
}