Add solution for day 6

day6/input

@@ -0,0 +1 @@
+5	1	10	0	1	7	13	14	3	12	8	10	7	12	0	6

day6/solution.py

@@ -0,0 +1,30 @@
+#!/usr/bin/python3
+
+# http://adventofcode.com/2017/day/6
+
+with open("input") as inputfile:
+	lines =  inputfile.read().splitlines()
+	blocks = [int(x) for x in lines[0].split("\t")]
+
+	seen_blocks = []
+
+	n = len(blocks)
+
+	while blocks not in seen_blocks:	
+		# Important: Convert to list in order to force a copy instead of a reference
+		seen_blocks.append(list(blocks))
+
+		v = max(blocks)
+		i = blocks.index(v)		
+
+		# Redistribute block value
+		blocks[i] = 0
+		for j in range(v):			
+			blocks[(i+j+1) % n] += 1
+
+
+	cycles = len(seen_blocks)	
+	firstcycle = seen_blocks.index(blocks)
+
+	print("part 1", cycles)
+	print("part 2", cycles-firstcycle)