2017 11

Author: rileythomp

2015/20/main.py

@@ -0,0 +1,40 @@
+
+import sys
+
+data = open(sys.argv[1]).read()
+lines = data.split("\n")
+
+def sum_factors(n):
+    res = 0
+    for i in range(1, int(n**0.5) + 1):
+        if n % i == 0:
+            res += i
+            if i != n // i:
+                res += n // i
+    return res 
+
+cur = 1
+while True:
+    if sum_factors(cur) * 10 >= 33100000:
+        print(cur)
+        break
+    cur += 1
+
+def sum_factors2(n):
+    first = n//50 + 1
+    sqrt = int(n**0.5) + 1
+    res = 0
+    for i in range(min(first, sqrt), max(first, sqrt)):
+        if n % i == 0:
+            res += i
+            if i != n // i:
+                res += n // i
+    return res 
+
+cur = 1
+while True:
+    if sum_factors2(cur) * 11 >= 33100000:
+        print('ans', cur)
+        break
+    cur += 1
+

2015/23/main.py

@@ -0,0 +1,60 @@
+import sys 
+from itertools import permutations
+
+data = open(sys.argv[1]).read()
+
+lines = data.split("\n")
+
+instructions = [line.split() for line in lines]
+
+regs = {'a': 0, 'b': 0}
+
+i = 0 
+while i < len(instructions): 
+    instr = instructions[i][0]
+    if instr in ('hlf', 'tpl', 'inc'):
+        reg = instructions[i][1]
+        match instr:
+            case 'hlf': regs[reg] //= 2
+            case 'tpl': regs[reg] *= 3
+            case 'inc': regs[reg] += 1
+        i += 1
+    elif instr == 'jmp':
+        i += int(instructions[i][1])
+    elif instr in ('jie', 'jio'):
+        reg_val = regs[instructions[i][1][0]]
+        jmp = int(instructions[i][2])
+        if instr == 'jie' and reg_val % 2 == 0:
+            i += jmp 
+        elif instr == 'jio' and reg_val == 1:
+            i += jmp 
+        else:
+            i += 1
+
+print(regs['b'])
+
+regs = {'a': 1, 'b': 0}
+
+i = 0 
+while i < len(instructions): 
+    instr = instructions[i][0]
+    if instr in ('hlf', 'tpl', 'inc'):
+        reg = instructions[i][1]
+        match instr:
+            case 'hlf': regs[reg] //= 2
+            case 'tpl': regs[reg] *= 3
+            case 'inc': regs[reg] += 1
+        i += 1
+    elif instr == 'jmp':
+        i += int(instructions[i][1])
+    elif instr in ('jie', 'jio'):
+        reg_val = regs[instructions[i][1][0]]
+        jmp = int(instructions[i][2])
+        if instr == 'jie' and reg_val % 2 == 0:
+            i += jmp 
+        elif instr == 'jio' and reg_val == 1:
+            i += jmp 
+        else:
+            i += 1
+
+print(regs['b'])

2015/25/main.py

@@ -0,0 +1,19 @@
+def get_num(c, r):
+    return (c*(c+1))//2 + (r-1)*c + ((r-1)*(r-2))//2
+
+cache = {
+    1: 20151125
+}
+
+def f(n):
+    if n in cache:
+        return cache[n]
+    fn = (cache[n-1]*252533)%33_554_393
+    cache[n] = fn
+    return fn
+
+ans = 0
+for i in range(1, get_num(3029, 2947)+1):
+    ans = f(i) 
+print(ans)
+    

2017/11/main.clj

@@ -0,0 +1,30 @@
+(require '[clojure.string :as str])
+
+(def data (slurp "in.txt"))
+
+(def lines (str/split-lines data))
+
+(def moves (str/split (first lines) #","))
+
+(def dirs {"n" [1 -1 0]
+           "s" [-1 1 0]
+           "ne" [1 0 -1]
+           "sw" [-1 0 1]
+           "nw" [0 -1 1]
+           "se" [0 1 -1]})
+
+(defn hex-dist [coords] (apply max (map Math/abs coords)))
+
+(def ans
+  (loop [moves moves
+         coords [0 0 0]
+         max-dist 0]
+    (if (empty? moves)
+      [(hex-dist coords) max-dist]
+      (let [move (first moves)
+            coords' (mapv + coords (dirs move))
+            max-dist' (max max-dist (hex-dist coords'))]
+        (recur (rest moves) coords' max-dist')))))
+
+(println (first ans))
+(println (second ans))

2017/11/main.py

@@ -5,3 +5,23 @@
 lines = data.split('\n')
 
 moves = lines[0].split(',')
+
+dirs = {
+    'n':  (1, -1, 0),
+    's':  (-1, 1, 0),
+    'ne': (1, 0, -1),
+    'sw': (-1, 0, 1),
+    'nw': (0, 1, -1),
+    'se': (0, -1, 1)
+}
+
+coords = [0, 0, 0]
+
+ans, ans2 = 0, 0
+for move in moves:
+    coords = [coords[i] + dirs[move][i] for i in range(3)]
+    ans = max([abs(c) for c in coords])
+    ans2 = max(ans2, ans)
+
+print(ans)
+print(ans2)

2020/25/main.py

@@ -0,0 +1,71 @@
+card_pub_key = 5764801
+
+door_pub_key = 17807724
+
+
+cache = {
+    7: {
+        0: 1
+    }
+}
+
+def transform(subject_num, loop_size):
+    if subject_num not in cache: 
+        cache[subject_num] = {0: 1}
+    if loop_size in cache[subject_num]:
+        return cache[subject_num][loop_size]
+    v = cache[subject_num][loop_size-1]
+    v *= subject_num
+    v %= 20201227
+    cache[subject_num][loop_size] = v
+    return v
+
+door_loop_size = 11
+for i in range(1, door_loop_size+1):
+    print(transform(7, i)) 
+print()
+
+card_loop_size = 8
+for i in range(1, card_loop_size+1):
+    print(transform(7, i))
+print()
+
+# exit()
+
+
+for i in range(1, card_loop_size+1):
+    print(transform(door_pub_key, i))
+print()
+
+for i in range(1, door_loop_size+1):
+    print(transform(card_pub_key, i))
+print()
+
+######
+
+card_pub_key = 5290733
+door_pub_key = 15231938
+
+card_loop_size = None
+for i in range(1, 10_000_000):
+    if transform(7, i) == card_pub_key:
+        card_loop_size = i
+        break
+print('card loop', card_loop_size)
+
+door_loop_size = None
+for i in range(1, 10_000_000):
+    if transform(7, i) == door_pub_key:
+        door_loop_size = i
+        break
+print('door loop', door_loop_size)
+
+ans = 0
+for i in range(1, card_loop_size+1):
+    ans = transform(door_pub_key, i)
+print(ans)
+
+ans = 0
+for i in range(1, door_loop_size+1):
+    ans = transform(card_pub_key, i)
+print(ans)