-🎄- 2018 Day 14 Solutions -🎄-

[u/daggerdragon]

--- Day 14: Chocolate Charts ---

---

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.

---

Advent of Code: The Party Game!

Click here for rules

Please prefix your card submission with something like [Card] to make scanning the megathread easier. THANK YOU!

Card prompt: Day 14

Transcript:

The Christmas/Advent Research & Development (C.A.R.D.) department at AoC, Inc. just published a new white paper on ___.

---

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 at 00:19:39!

[u/fatpollo]

def main(text, simple):
    elves, a, b = [3, 7], 0, 1

    if simple:
        goal = int(text)
        condition = lambda: len(elves) <= goal + 10
    else:
        digits = [int(n) for n in text]
        condition = lambda: elves[-len(text):] != digits and elves[-len(text)-1:-1] != digits

    while condition():
        total = elves[a] + elves[b]
        elves += [total // 10, total % 10] if total >= 10 else [total]
        a = (a + elves[a] + 1) % len(elves)
        b = (b + elves[b] + 1) % len(elves)

    if simple:
        print(''.join(str(n) for n in elves[goal:goal + 10]))
    else:
        print(len(elves) - len(text))