Advent of Code

1.py

s = open('inputs/1.in').read()

midp = 1
print sum(int(e[0]) for e in zip(s,s[midp:]+s[:midp]) if e[0] == e[1])

midp = len(s)/2
print sum(int(e[0]) for e in zip(s,s[midp:]+s[:midp]) if e[0] == e[1])

2.py

import sys, itertools
l = [map(int, line.split()) for line in open('inputs/2.in').readlines()]

def f(row):
  return max(row)-min(row)
print sum(map(f,l))

def f(row):
    for i, j in itertools.combinations(sorted(row), 2):
        if j % i == 0:
            return j / i
print sum(map(f, l))