ProjectEuler#53 Combinatoric selections

#There are exactly ten ways of selecting three from five, 12345:

#123, 124, 125, 134, 135, 145, 234, 235, 245, and 345

#In combinatorics, we use the notation, 5C3 = 10.

#In general, nCr = n!/(r!(n-r)!), where r <= n

#It is not until n = 23, that a value exceeds one-million: 23C10 = 1144066.

#How many, not necessarily distinct, values of  nCr, for 1 <= n <= 100,
#are greater than one-million?

def fact(n):
    if n == 1 or n == 0:
        return 1
    return n*fact(n-1)

def nCr(n,r):
    return fact(n)/(fact(r)*fact(n-r))

count = 0
for n in range(1,101):
    for r in range(1,n+1):
        if nCr(n,r) > 1000000:
            count += 1
print count