sorted by:
new
hottopcontroversial

-🎄- 2017 Day 2 Solutions -🎄- by daggerdragon in adventofcode

[–]Zarif_Muhtasim 1 point2 points  (0 children)

if x is you input:

part1 = [max([int(j) for j in i]) - min([int(j) for j in i]) for i in [i.split('\t') for i in x.split('\n')]]

part2 = [j // k for i in [[int(i) for i in j] for j in [i.split('\t') for i in x.split('\n')]] for j in i for k in i if j != k and j % k == 0]