Add Day10 solution

Author: simonvbrae

day10/day10.py

@@ -0,0 +1,33 @@
+def count_possibilities_dp(adapters):
+    dp_array = [1] + [0 for _ in range(adapters[-1])]
+    print(len(dp_array))
+    for i, e in enumerate(adapters):
+        for i in range(max(0 ,e-3), e):
+            dp_array[e] += dp_array[i]
+    print(dp_array)
+
+
+def main():
+    f=open("input", "r")
+    lines = sorted([0] + [int(line.strip()) for line in f.readlines()])
+    lines.append(lines[-1]+3)
+    print(lines)
+
+    ones=0
+    threes=1
+    for ind, i in enumerate(lines[:-1]):
+        if lines[ind+1] - i == 1:
+            # print("one: {} {}".format(i, lines[ind+1]))
+            ones+=1
+        elif lines[ind+1] - i == 3:
+            # print("threes " + str())
+            threes+=1
+    print(ones)
+    print(threes)
+    print(ones*threes)
+
+    print(count_possibilities_dp(lines))
+
+
+
+main()

day10/input

@@ -0,0 +1,94 @@
+38
+23
+31
+16
+141
+2
+124
+25
+37
+147
+86
+150
+99
+75
+81
+121
+93
+120
+96
+55
+48
+58
+108
+22
+132
+62
+107
+54
+69
+51
+7
+134
+143
+122
+28
+60
+123
+82
+95
+14
+6
+106
+41
+131
+109
+90
+112
+1
+103
+44
+127
+9
+83
+59
+117
+8
+140
+151
+89
+35
+148
+76
+100
+114
+130
+19
+72
+36
+133
+12
+34
+46
+15
+45
+87
+144
+80
+13
+142
+149
+88
+94
+61
+154
+24
+66
+113
+5
+73
+79
+74
+65
+137
+47