Esempio n. 1
0
def main(n, k):
	return sum(choose(n - c * (s - 1), c) for s in range(2, k + 1) for c in range(1, n // s + 1))
Esempio n. 2
0
def main(w, h):
    # trick: we are computing the pascal triangle
    return choose(w + h, w)
Esempio n. 3
0
import lib

coeffs = (lib.choose(n, k) for n in range(1,101) for k in range(1, n+1))
print sum(1 for n in coeffs if n >= 1000000)
Esempio n. 4
0
def main(w, h):
	# trick: we are computing the pascal triangle
	return choose(w + h, w)
Esempio n. 5
0
def main(limit, target):
    return sum(
        choose(n, k) > target for n in range(1, limit + 1)
        for k in range(1, n))
Esempio n. 6
0
def main(limit, target):
	return sum(choose(n, k) > target for n in range(1, limit + 1) for k in range(1, n))
Esempio n. 7
0
def main(n, k):
    return sum(
        choose(n - c * (s - 1), c) for s in range(2, k + 1)
        for c in range(1, n // s + 1))
Esempio n. 8
0
#!/usr/bin/env python3

from lib import choose

count = 0

for n in range(1, 101):
	for r in range(1,n + 1):
		if choose(r,n) > 10**6:
			count += 1

print(count)