-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathp061.java
More file actions
66 lines (56 loc) · 2.08 KB
/
p061.java
File metadata and controls
66 lines (56 loc) · 2.08 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
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
package level03;
import java.util.List;
import java.util.Set;
import java.util.function.Consumer;
import org.junit.Test;
import com.google.common.collect.Multimap;
import lib.EulerTest;
public class p061 extends EulerTest {
final int K = 2;
final int B = 10;
final int[] SIDES = { 3, 4, 5, 6, 7, 8 };
final int C = ipow(B, K);
Multimap<List<?>, Long> allFigurates = mmap();
/**
* Find cyclic figurate 2K-digit numbers, one triangular, one square, etc., as specified by
* SIDES,, such that each number shares its first K digits with the last K digits of its
* predecessor; e.g. 8128, 2882, 8281 is a set of 3 cyclic figurate numbers.
*/
@Test
public void test() {
for (int numSides : SIDES) {
long figurate;
for (int j = 1; (figurate = figurate(j, numSides)) < sq(C); j++) {
long startDigits = figurate / C;
if (startDigits >= C / B)
allFigurates.put(list(numSides, startDigits), figurate);
}
}
helper(list(), set(), 0);
check(28684);
}
void helper(List<Long> figurates, Set<Integer> usedSides, long sum) {
if (figurates.size() == SIDES.length) {
if (last(figurates) % C == figurates.get(0) / C)
ans = sum;
return;
}
for (int numSides : SIDES)
if (!usedSides.contains(numSides)) {
usedSides.add(numSides);
Consumer<Long> recurse = startDigits -> {
for (long figurate : allFigurates.get(list(numSides, startDigits))) {
figurates.add(figurate);
helper(figurates, usedSides, sum + figurate);
removeLast(figurates);
}
};
if (figurates.isEmpty())
for (long startDigits : range(C))
recurse.accept(startDigits);
else
recurse.accept(last(figurates) % C);
usedSides.remove(numSides);
}
}
}