This repository was archived by the owner on Jun 7, 2021. It is now read-only.

Commit 087fd75

committed

Solve day six

1 parent 1bf7fd9 commit 087fd75Copy full SHA for 087fd75

File tree

+56

-0

lines changed

+56

-0

lines changed

Lines changed: 27 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,27 @@`
	`1`	`+def redistribute(banks):`
	`2`	`+ banks = list(banks)`
	`3`	`+ val = max(banks)`
	`4`	`+ idx = banks.index(val)`
	`5`	`+ banks[idx] = 0`
	`6`	`+`
	`7`	`+ while val > 0:`
	`8`	`+ idx = (idx + 1) % len(banks)`
	`9`	`+ banks[idx] = banks[idx] + 1`
	`10`	`+ val = val - 1`
	`11`	`+ return tuple(banks)`
	`12`	`+`
	`13`	`+def solve(banks):`
	`14`	`+ states = []`
	`15`	`+ count = 0`
	`16`	`+`
	`17`	`+ while True:`
	`18`	`+ states.append(banks)`
	`19`	`+ banks = redistribute(banks)`
	`20`	`+ count = count + 1`
	`21`	`+`
	`22`	`+ if banks in states:`
	`23`	`+ return count`
	`24`	`+`
	`25`	`+def main():`
	`26`	`+ inp = inp('[?] The puzzle input: ')`
	`27`	`+ print('[*] The answer is: {}'.format(solve(inp)))`

Lines changed: 29 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,29 @@`
	`1`	`+def redistribute(banks):`
	`2`	`+ banks = list(banks)`
	`3`	`+ val = max(banks)`
	`4`	`+ idx = banks.index(val)`
	`5`	`+ banks[idx] = 0`
	`6`	`+`
	`7`	`+ while val > 0:`
	`8`	`+ idx = (idx + 1) % len(banks)`
	`9`	`+ banks[idx] = banks[idx] + 1`
	`10`	`+ val = val - 1`
	`11`	`+ return tuple(banks)`
	`12`	`+`
	`13`	`+def solve(banks):`
	`14`	`+ states = []`
	`15`	`+ count = 0`
	`16`	`+`
	`17`	`+ while True:`
	`18`	`+ states.append(banks)`
	`19`	`+ banks = redistribute(banks)`
	`20`	`+ count = count + 1`
	`21`	`+`
	`22`	`+ if banks in states:`
	`23`	`+ break`
	`24`	`+ return (len(states) - states.index(banks))`
	`25`	`+`
	`26`	`+`
	`27`	`+def main():`
	`28`	`+ inp = inp('[?] The puzzle input: ')`
	`29`	`+ print('[*] The answer is: {}'.format(solve(inp)))`

Comments

(0)