Compare commits
4 commits
57a2d60dc0
...
b7362b4889
Author | SHA1 | Date | |
---|---|---|---|
Bruno BELANYI | b7362b4889 | ||
Bruno BELANYI | 78ae52c9c5 | ||
Bruno BELANYI | 571136b6df | ||
Bruno BELANYI | b87458688a |
30
2021/d03/ex1/ex1.py
Executable file
30
2021/d03/ex1/ex1.py
Executable file
|
@ -0,0 +1,30 @@
|
||||||
|
#!/usr/bin/env python
|
||||||
|
|
||||||
|
import itertools
|
||||||
|
import sys
|
||||||
|
from typing import List
|
||||||
|
|
||||||
|
|
||||||
|
def solve(input: List[int]) -> int:
|
||||||
|
gamma, epsilon = 0, 0
|
||||||
|
bit = 1
|
||||||
|
|
||||||
|
while any(map(bool, input)):
|
||||||
|
num_bits = sum(n % 2 for n in input)
|
||||||
|
if num_bits >= len(input) / 2:
|
||||||
|
gamma += bit
|
||||||
|
else:
|
||||||
|
epsilon += bit
|
||||||
|
input = [n // 2 for n in input]
|
||||||
|
bit *= 2
|
||||||
|
|
||||||
|
return gamma * epsilon
|
||||||
|
|
||||||
|
|
||||||
|
def main() -> None:
|
||||||
|
input = [int(line, 2) for line in sys.stdin.readlines()]
|
||||||
|
print(solve(input))
|
||||||
|
|
||||||
|
|
||||||
|
if __name__ == "__main__":
|
||||||
|
main()
|
1000
2021/d03/ex1/input
Normal file
1000
2021/d03/ex1/input
Normal file
File diff suppressed because it is too large
Load diff
68
2021/d03/ex2/ex2.py
Executable file
68
2021/d03/ex2/ex2.py
Executable file
|
@ -0,0 +1,68 @@
|
||||||
|
#!/usr/bin/env python
|
||||||
|
|
||||||
|
import itertools
|
||||||
|
import sys
|
||||||
|
from copy import deepcopy
|
||||||
|
from typing import List
|
||||||
|
|
||||||
|
|
||||||
|
def solve(input: List[int]) -> int:
|
||||||
|
def highest_pow2(n: int) -> int:
|
||||||
|
return len(bin(n)) - 2 - 1 # '0b' prefix, and off-by-one
|
||||||
|
|
||||||
|
def count_bits_at(input: List[int], bit: int) -> int:
|
||||||
|
return sum((n & pow(2, bit)) != 0 for n in input)
|
||||||
|
|
||||||
|
def filter_by_bit_value(input: List[int], bit: int, value: int) -> List[int]:
|
||||||
|
# Simplify the filter by mapping the value to the actual power of 2
|
||||||
|
if value != 0:
|
||||||
|
value = pow(2, bit)
|
||||||
|
return list(filter(lambda n: (n & pow(2, bit)) == value, input))
|
||||||
|
|
||||||
|
def filter_oxygen(input: List[int], bit: int) -> List[int]:
|
||||||
|
# No further processing needed
|
||||||
|
if len(input) <= 1:
|
||||||
|
return input
|
||||||
|
|
||||||
|
num_bits = count_bits_at(input, bit)
|
||||||
|
# Keep 1s on equality
|
||||||
|
if num_bits >= len(input) / 2:
|
||||||
|
return filter_by_bit_value(input, bit, 1)
|
||||||
|
else:
|
||||||
|
return filter_by_bit_value(input, bit, 0)
|
||||||
|
|
||||||
|
def filter_co2(input: List[int], bit: int) -> List[int]:
|
||||||
|
# No further processing needed
|
||||||
|
if len(input) <= 1:
|
||||||
|
return input
|
||||||
|
|
||||||
|
num_bits = count_bits_at(input, bit)
|
||||||
|
# Keep 0s on equality
|
||||||
|
if num_bits < len(input) / 2:
|
||||||
|
return filter_by_bit_value(input, bit, 1)
|
||||||
|
else:
|
||||||
|
return filter_by_bit_value(input, bit, 0)
|
||||||
|
|
||||||
|
oxygen, co2 = 0, 0
|
||||||
|
max_bit = max(highest_pow2(n) for n in input)
|
||||||
|
oxygen_input, co2_input = deepcopy(input), deepcopy(input)
|
||||||
|
|
||||||
|
for bit in range(max_bit, -1, -1):
|
||||||
|
oxygen_input = filter_oxygen(oxygen_input, bit)
|
||||||
|
co2_input = filter_co2(co2_input, bit)
|
||||||
|
|
||||||
|
if len(oxygen_input) == 1:
|
||||||
|
oxygen = oxygen_input[0]
|
||||||
|
if len(co2_input) == 1:
|
||||||
|
co2 = co2_input[0]
|
||||||
|
|
||||||
|
return oxygen * co2
|
||||||
|
|
||||||
|
|
||||||
|
def main() -> None:
|
||||||
|
input = [int(line, 2) for line in sys.stdin.readlines()]
|
||||||
|
print(solve(input))
|
||||||
|
|
||||||
|
|
||||||
|
if __name__ == "__main__":
|
||||||
|
main()
|
1000
2021/d03/ex2/input
Normal file
1000
2021/d03/ex2/input
Normal file
File diff suppressed because it is too large
Load diff
Loading…
Reference in a new issue