forked from nayuki/Project-Euler-solutions
-
Notifications
You must be signed in to change notification settings - Fork 0
/
p043.java
42 lines (32 loc) · 988 Bytes
/
p043.java
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
/*
* Solution to Project Euler problem 43
* By Nayuki Minase
*
* http://nayuki.eigenstate.org/page/project-euler-solutions
* https://github.com/nayuki/Project-Euler-solutions
*/
public final class p043 implements EulerSolution {
public static void main(String[] args) {
System.out.println(new p043().run());
}
private static int[] DIVISIBILITY_TESTS = {2, 3, 5, 7, 11, 13, 17}; // First 7 primes
public String run() {
long sum = 0;
int[] digits = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9};
outer:
do {
for (int i = 0; i < DIVISIBILITY_TESTS.length; i++) {
if (toInteger(digits, i + 1, 3) % DIVISIBILITY_TESTS[i] != 0)
continue outer;
}
sum += toInteger(digits, 0, digits.length);
} while (Library.nextPermutation(digits));
return Long.toString(sum);
}
private static long toInteger(int[] digits, int off, int len) {
long result = 0;
for (int i = off; i < off + len; i++)
result = result * 10 + digits[i];
return result;
}
}