Project Euler Problem #53 Solution

euler-53.py

import operator

def factorial(n):
    return 1 if n == 0 else reduce(operator.mul, range(1, n + 1))

def combo(n, r):
    return factorial(n) / (factorial(r) * factorial(n - r))

count = 0

for (n, r) in [(n, r) for n in range(1, 101) for r in range(1, n)]:
    if combo(n, r) > 1000000:
        count += 1

print count