We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
Project Euler #53: Combinatoric selections
Project Euler #53: Combinatoric selections
Contest ends in
Sort by
recency
|
18 Discussions
|
Please Login in order to post a comment
Easy.
100 points/- python3
Hint: one does not have to compute all nCr but rather consider how nCr changes as n and r changes.
Hint: Actually solution
n, k = [ int(i) for i in input().split()] n += 1
ans = 0 pascal = [ [0 for j in range(n)] for i in range(n)] for i in range(n): pascal[i][0] = 1 pascal[i][i] = 1 for j in range(1, i): pascal[i][j] = pascal[i-1][j-1] + pascal[i-1][j] if(pascal[i][j] > k): ans += 1
print(ans)
""" for i in range(n):
Thanks me later s = "" for j in range(n): s += " "+str(pascal[i][j]) print(s) """