Skip to content

frenki/refactor-intcode #141

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
cedrictalbot wants to merge 1 commit into
base: master
Choose a base branch
from
Open

frenki/refactor-intcode #141

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
65 changes: 30 additions & 35 deletions day-05/part-1/frenki.py
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,49 +1,44 @@
from tool.runners.python import SubmissionPy

def get_optcode_param(n):
L = list(str(n))
c = (L[-1], L[:-2][::-1])
while len(c[1]) < 3:
c[1].append('0')
return c
return (n%100, [(n//100)%10, (n//1000)%10, n//10000])

class FrenkiSubmission(SubmissionPy):
def __init__(self):
self.l = []
class IntCode(object):
def __init__(self, l):
self.l = l

def choose(self, v, m):
if m == '0':
if m == 0:
return self.l[v]
return v

def run(self, s):
self.l = list(map(int, s.split(',')))
def add(self, args):
self.l[args[2]] = self.l[args[1]] + self.l[args[0]]

def mul(self, args):
self.l[args[2]] = self.l[args[1]] * self.l[args[0]]

def ins(self, args):
self.l[args[0]] = 1

def ret(self, args):
return self.l[args[0]]

def run(self):
i = 0
opcodes = [0,(self.add, 3), (self.mul, 3), (self.ins,1), (self.ret, 1)]
while self.l[i] != 99:
c = get_optcode_param(self.l[i])
if c[0] == '1':
index1 = self.choose(i+1, c[1][0])
index2 = self.choose(i+2, c[1][1])
index3 = self.choose(i+3, c[1][2])
self.l[index3] = self.l[index1] + self.l[index2]
i+= 4
elif c[0] == '2':
index1 = self.choose(i+1, c[1][0])
index2 = self.choose(i+2, c[1][1])
index3 = self.choose(i+3, c[1][2])
self.l[index3] = self.l[index1] * self.l[index2]
i += 4
elif c[0] == '3':
index1 = self.l[i+1]
self.l[index1] = 1
i+= 2
elif c[0] == '4':
index1 = self.choose(i+1, c[1][0])
if self.l[index1] != 0 :
return(self.l[index1])
i+= 2


opcode, params = get_optcode_param(self.l[i])
f,r = opcodes[opcode]
l = [self.choose(i+k+1,params[k]) for k in range(r)]
res = f(l)
i += r+1
if res:
return res


class FrenkiSubmission(SubmissionPy):
def run(self, s):
ic = IntCode([int(i) for i in s.split(',')])
return ic.run()

115 changes: 50 additions & 65 deletions day-05/part-2/frenki.py
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,76 +1,61 @@
from tool.runners.python import SubmissionPy

def get_optcode_param(n):
L = list(str(n))
c = (L[-1], L[:-2][::-1])
while len(c[1]) < 3:
c[1].append('0')
return c
return (n%100, [(n//100)%10, (n//1000)%10, n//10000])

class FrenkiSubmission(SubmissionPy):
def __init__(self):
self.l = []
class IntCode(object):
def __init__(self, l):
self.l = l
self.out = None

def choose(self, v, m):
if m == '0':
if m == 0:
return self.l[v]
return v

def run(self, s):
self.l = list(map(int, s.split(',')))
def add(self, args, i):
self.l[args[2]] = self.l[args[1]] + self.l[args[0]]
return i+4

def mul(self, args, i):
self.l[args[2]] = self.l[args[1]] * self.l[args[0]]
return i+4

def ins(self, args, i):
self.l[args[0]] = 5
return i+2

def ret(self, args, i):
self.out = self.l[args[0]]
return i+2

def jump_true(self, args, i):
return self.l[args[1]] if self.l[args[0]] else i+3

def jump_false(self, args, i):
return self.l[args[1]] if not self.l[args[0]] else i+3

def less_than(self, args, i):
self.l[args[2]] = 1 if self.l[args[0]] < self.l[args[1]] else 0
return i+4

def equals(self, args, i):
self.l[args[2]] = 1 if self.l[args[0]] == self.l[args[1]] else 0
return i+4

def run(self):
i = 0
opcodes = [0,(self.add, 3), (self.mul, 3), (self.ins,1), (self.ret, 1), (self.jump_true, 2), (self.jump_false, 2), (self.less_than, 3), (self.equals, 3)]
while self.l[i] != 99:
c = get_optcode_param(self.l[i])
if c[0] == '1':
index1 = self.choose(i+1, c[1][0])
index2 = self.choose(i+2, c[1][1])
index3 = self.choose(i+3, c[1][2])
self.l[index3] = self.l[index1] + self.l[index2]
i+= 4
elif c[0] == '2':
index1 = self.choose(i+1, c[1][0])
index2 = self.choose(i+2, c[1][1])
index3 = self.choose(i+3, c[1][2])
self.l[index3] = self.l[index1] * self.l[index2]
i += 4
elif c[0] == '3':
index1 = self.l[i+1]
self.l[index1] = 5
i+= 2
elif c[0] == '4':
index1 = self.choose(i+1, c[1][0])
if self.l[index1] != 0 :
return(self.l[index1])
i+= 2
elif c[0] == '5':
index1 = self.choose(i+1, c[1][0])
index2 = self.choose(i+2, c[1][1])
if self.l[index1]:
i = self.l[index2]
else :
i += 3
elif c[0] == '6':
index1 = self.choose(i+1, c[1][0])
index2 = self.choose(i+2, c[1][1])
if not self.l[index1]:
i = self.l[index2]
else :
i += 3
elif c[0] == '7':
index1 = self.choose(i+1, c[1][0])
index2 = self.choose(i+2, c[1][1])
index3 = self.choose(i+3, c[1][2])
if self.l[index1] < self.l[index2]:
self.l[index3] = 1
else :
self.l[index3] = 0
i += 4
elif c[0] == '8':
index1 = self.choose(i+1, c[1][0])
index2 = self.choose(i+2, c[1][1])
index3 = self.choose(i+3, c[1][2])
if self.l[index1] == self.l[index2]:
self.l[index3] = 1
else :
self.l[index3] = 0
i += 4
opcode, params = get_optcode_param(self.l[i])
f,r = opcodes[opcode]
l = [self.choose(i+k+1,params[k]) for k in range(r)]
i = f(l, i)
if self.out:
return self.out


class FrenkiSubmission(SubmissionPy):
def run(self, s):
ic = IntCode([int(i) for i in s.split(',')])
return ic.run()
132 changes: 54 additions & 78 deletions day-07/part-1/frenki.py
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,92 +2,68 @@
from itertools import permutations

def get_optcode_param(n):
L = list(str(n))
c = (L[-1], L[:-2][::-1])
while len(c[1]) < 3:
c[1].append('0')
return c
return (n%100, [(n//100)%10, (n//1000)%10, n//10000])

class FrenkiSubmission(SubmissionPy):
def __init__(self):
self.l = []
class IntCode(object):
def __init__(self, l, inp):
self.l = l
self.out = None
self.inp = inp

def choose(self, v, m):
if m == '0':
if m == 0:
return self.l[v]
return v

def add(self, args, i):
self.l[args[2]] = self.l[args[1]] + self.l[args[0]]
return i+4

def mul(self, args, i):
self.l[args[2]] = self.l[args[1]] * self.l[args[0]]
return i+4

def ins(self, args, i):
self.l[args[0]] = self.inp.pop()
return i+2

def ret(self, args, i):
self.out = self.l[args[0]]
return i+2

def jump_true(self, args, i):
return self.l[args[1]] if self.l[args[0]] else i+3

def jump_false(self, args, i):
return self.l[args[1]] if not self.l[args[0]] else i+3

def less_than(self, args, i):
self.l[args[2]] = 1 if self.l[args[0]] < self.l[args[1]] else 0
return i+4

def equals(self, args, i):
self.l[args[2]] = 1 if self.l[args[0]] == self.l[args[1]] else 0
return i+4

def run(self):
i = 0
opcodes = [0,(self.add, 3), (self.mul, 3), (self.ins,1), (self.ret, 1), (self.jump_true, 2), (self.jump_false, 2), (self.less_than, 3), (self.equals, 3)]
while self.l[i] != 99:
opcode, params = get_optcode_param(self.l[i])
f,r = opcodes[opcode]
l = [self.choose(i+k+1,params[k]) for k in range(r)]
i = f(l, i)
if self.out != None:
return self.out

class FrenkiSubmission(SubmissionPy):
def run(self, s):
l = [int(i) for i in s.split(',')]
res = 0
dic = {}
for i in list(permutations([0,1,2,3,4])):
input_value = 0
inp = 0
for k in range(5):
self.l = list(map(int, s.split(',')))
if (i[k], input_value) in dic.keys():
input_value = dic[(i[k], input_value)]
else :
v = input_value
input_value = self.run_intcode(i[k], input_value)
dic[(i[k], v)] = input_value
if input_value > res:
res = input_value
c = IntCode(l, [inp, i[k]])
inp = c.run()
res = max(res, inp)
return res


def run_intcode(self, index, input_value):
l = [input_value, index]
i = 0
while self.l[i] != 99:
c = get_optcode_param(self.l[i])
if c[0] == '1':
index1 = self.choose(i+1, c[1][0])
index2 = self.choose(i+2, c[1][1])
index3 = self.choose(i+3, c[1][2])
self.l[index3] = self.l[index1] + self.l[index2]
i+= 4
elif c[0] == '2':
index1 = self.choose(i+1, c[1][0])
index2 = self.choose(i+2, c[1][1])
index3 = self.choose(i+3, c[1][2])
self.l[index3] = self.l[index1] * self.l[index2]
i += 4
elif c[0] == '3':
index1 = self.l[i+1]
self.l[index1] = l.pop()
i+= 2
elif c[0] == '4':
index1 = self.choose(i+1, c[1][0])
return(self.l[index1])
elif c[0] == '5':
index1 = self.choose(i+1, c[1][0])
index2 = self.choose(i+2, c[1][1])
if self.l[index1]:
i = self.l[index2]
else :
i += 3
elif c[0] == '6':
index1 = self.choose(i+1, c[1][0])
index2 = self.choose(i+2, c[1][1])
if not self.l[index1]:
i = self.l[index2]
else :
i += 3
elif c[0] == '7':
index1 = self.choose(i+1, c[1][0])
index2 = self.choose(i+2, c[1][1])
index3 = self.choose(i+3, c[1][2])
if self.l[index1] < self.l[index2]:
self.l[index3] = 1
else :
self.l[index3] = 0
i += 4
elif c[0] == '8':
index1 = self.choose(i+1, c[1][0])
index2 = self.choose(i+2, c[1][1])
index3 = self.choose(i+3, c[1][2])
if self.l[index1] == self.l[index2]:
self.l[index3] = 1
else :
self.l[index3] = 0
i += 4
Loading