My Advent of Code solutions in Python.
kevinyap.ca/2019/12/going-fast-in-advent-of-code/
advent-of-code
python
Add 2017/02
+35
+17
2017/day02.py
+17
2017/day02.py
···
1
+
import fileinput
2
+
3
+
checksum = 0
4
+
result = 0
5
+
6
+
for line in fileinput.input():
7
+
nums = sorted((int(x) for x in line.split()), reverse=True)
8
+
9
+
checksum += nums[0] - nums[-1]
10
+
11
+
for i in range(len(nums)):
12
+
for j in range(i + 1, len(nums)):
13
+
if nums[i] % nums[j] == 0:
14
+
result += nums[i] // nums[j]
15
+
16
+
print "Spreadsheet checksum:", checksum
17
+
print "Spreadsheet result:", result
+16
2017/inputs/02.txt
+16
2017/inputs/02.txt
···
1
+
626 2424 2593 139 2136 163 1689 367 2235 125 2365 924 135 2583 1425 2502
2
+
183 149 3794 5221 5520 162 5430 4395 2466 1888 3999 3595 195 181 6188 4863
3
+
163 195 512 309 102 175 343 134 401 372 368 321 350 354 183 490
4
+
2441 228 250 2710 200 1166 231 2772 1473 2898 2528 2719 1736 249 1796 903
5
+
3999 820 3277 3322 2997 1219 1014 170 179 2413 183 3759 3585 2136 3700 188
6
+
132 108 262 203 228 104 205 126 69 208 235 311 313 258 110 117
7
+
963 1112 1106 50 186 45 154 60 1288 1150 986 232 872 433 48 319
8
+
111 1459 98 1624 2234 2528 93 1182 97 583 2813 3139 1792 1512 1326 3227
9
+
371 374 459 83 407 460 59 40 42 90 74 163 494 250 488 444
10
+
1405 2497 2079 2350 747 1792 2412 2615 89 2332 1363 102 81 2346 122 1356
11
+
1496 2782 2257 2258 961 214 219 2998 400 230 2676 3003 2955 254 2250 2707
12
+
694 669 951 455 2752 216 1576 3336 251 236 222 2967 3131 3456 1586 1509
13
+
170 2453 1707 2017 2230 157 2798 225 1891 945 943 2746 186 206 2678 2156
14
+
3632 3786 125 2650 1765 1129 3675 3445 1812 3206 99 105 1922 112 1136 3242
15
+
6070 6670 1885 1994 178 230 5857 241 253 5972 7219 252 806 6116 4425 3944
16
+
2257 155 734 228 204 2180 175 2277 180 2275 2239 2331 2278 1763 112 2054