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.
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)
"""
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Project Euler #53: Combinatoric selections
You are viewing a single comment's thread. Return to all comments →
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) """