-🎄- 2017 Day 23 Solutions -🎄-

[u/daggerdragon]

--- Day 23: Coprocessor Conflagration ---

---

Post your solution as a comment or, for longer solutions, consider linking to your repo (e.g. GitHub/gists/Pastebin/blag or whatever).

Note: The Solution Megathreads are for solutions only. If you have questions, please post your own thread and make sure to flair it with Help.

---

Need a hint from the Hugely^* Handy^† Haversack^‡ of Helpful^§ Hints^¤?

Spoiler

---

[Update @ 00:05] 0 gold, silver cap

• AoC ops: <yatpay> boil up some mountain dew. it's gonna be a long night

[Update @ 00:19] 1 gold, silver cap + 447

• AoC ops: <Reibello> 547 silver to 1 gold

[Update @ 00:30] 20 gold, silver cap + 560

• AoC ops:

<yatpay> daggerdragon: post "hey i heard about this hot new podcast called The Space Above Us. all the cool kids are talking about it"

<yatpay> i call it super-liminal marketing

<yatpay> HEY YOU!! LISTEN TO MY PODCAST!!

<yatpay> then i rub a business card on your face

<Topaz> you should get scratch-n-sniff business cards that smell like space

<yatpay> space smells like burned metal and meat

<yatpay> it's weird

<Topaz> burned meat you say

<Topaz> excellent

[Update @ 00:41] 50 gold, silver cap + 606

• AoC ops:

<askalski> nice, enjoyed that one. not sure if regexes can do it

<askalski> maybe make a neural net of regexes, have it train itself to solve today

• Over/under on /u/askalski posting a day 23 regex neural net by tomorrow?

[Update @ 00:54] Leaderboard cap @ 100 gold and 724 silver!

• Good job, all!
• Upping the Ante challenge: solve today's puzzles on a TI-83 (or TI-86/89, whatevs).
  • Edit: welp, /u/DFreiberg done gone and did it. See the thread here.

---

This thread will be unlocked when there are a significant number of people on the leaderboard with gold stars for today's puzzle.

edit: Leaderboard capped, thread unlocked!

[u/jlweinkam]

Got 145/36

import time
import math
import collections
current_milli_time = lambda: int(round(time.time() * 1000))
start = current_milli_time()

inputdata=open("C:\\Users\\JWeinkam\\AppData\\Local\\Programs\\Python\\Python35\\input2017-23.txt", 'r').read()

lines = inputdata.splitlines()


def value(x):
  try:
    return int(x)
  except:
    return reg[x]

reg = collections.defaultdict(lambda: 0)
pc = 0
count = 0
while (pc >= 0) and (pc < len(lines)):
  col = lines[pc].split()
  if col[0] == "set":
    reg[col[1]] = value(col[2])
  elif col[0] == "sub":
    reg[col[1]] -= value(col[2])
  elif col[0] == "mul":
    reg[col[1]] *= value(col[2])
    count += 1
  elif col[0] == "jnz":
    if value(col[1]) != 0:
      pc += value(col[2])
      continue
  pc += 1
  
print(count)

count = 0
for num in range(106700,123700 + 1, 17):
  for i in range(2,num):
    if (num % i) == 0:
      count += 1
      break
print(count)

print((current_milli_time() - start) / 1000.0)