peter/advent-of-code-2020
1
0
Fork 0
mirror of https://github.com/peter-tanner/advent-of-code-2020.git synced 2024-11-30 10:50:17 +08:00
Code Issues Packages Projects Releases Wiki Activity

p2 solver gen update

Browse Source
This commit is contained in:
Peter 2020-12-13 15:13:24 +08:00
parent 4b22a656b8
commit 01e154ff0c
1 changed files with 4 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
13/a.py
View File

@ -12,13 +12,13 @@ def a(d): #To be honest, I could've done this way quicker manually and got on
print(a(d)) print(a(d))
def b(d): def b(d):
d = [ [-y,int(d[y])] for y in {i:d[i] for i in range(len(d))} if d[y] != 'x'] d = [ ',(t+'+str(y)+')mod'+str(d[y])+'=0' for y in {i:d[i] for i in range(len(d))} if d[y] != 'x']
[ print(x) for x in d ] # generate numbers return ''.join(d)[1:]
# I'm a math noob, so I just saw what everyone else is talking about and found this chinese remainder theorem. # I'm a math noob, so I just saw what everyone else is talking about and found this chinese remainder theorem.
# Why does this work? I DONT KNOW. # Why does this work? I DONT KNOW.
# I'll probably learn this when I get some formal CS education. # I'll probably learn this when I get some formal CS education, so for now I'm just giving myself a rest for this part.
# Used a solver for that. # Used a solver for that.
# x = 760171380521445 # x = 760171380521445
@ -32,4 +32,4 @@ def b(d):
# x ≡ −54 mod 37 # x ≡ −54 mod 37
# x ≡ −67 mod 19 # x ≡ −67 mod 19
b(d[1]) print(b(d[1]))