-
Notifications
You must be signed in to change notification settings - Fork 20
/
Copy pathDay20.java
63 lines (53 loc) · 1.74 KB
/
Day20.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
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
package com.sbaars.adventofcode.year15.days;
import com.sbaars.adventofcode.year15.Day2015;
import java.util.*;
import java.util.stream.IntStream;
public class Day20 extends Day2015 {
private static final int TARGET_PRESENTS = 36000000;
private static final int PRESENTS_PER_ELF = 10;
public Day20() {
super(20);
}
public static void main(String[] args) {
Day20 day = new Day20();
day.printParts();
new com.sbaars.adventofcode.network.Submit().submit(day.part2(), 2015, 20, 2);
}
@Override
public Object part1() {
int houseNumber = 1;
while (getPresentsForHouse(houseNumber) < TARGET_PRESENTS) {
houseNumber++;
}
return houseNumber;
}
@Override
public Object part2() {
int houseNumber = 1;
while (getPresentsForHousePart2(houseNumber) < TARGET_PRESENTS) {
houseNumber++;
}
return houseNumber;
}
private int getPresentsForHousePart2(int houseNumber) {
return getDivisors(houseNumber).stream()
.filter(elf -> houseNumber / elf <= 50) // Each Elf only visits 50 houses
.mapToInt(elf -> elf * 11) // Each Elf delivers 11 presents
.sum();
}
private int getPresentsForHouse(int houseNumber) {
return getDivisors(houseNumber).stream()
.mapToInt(divisor -> divisor * PRESENTS_PER_ELF)
.sum();
}
private Set<Integer> getDivisors(int number) {
Set<Integer> divisors = new HashSet<>();
for (int i = 1; i <= Math.sqrt(number); i++) {
if (number % i == 0) {
divisors.add(i);
divisors.add(number / i);
}
}
return divisors;
}
}