Postdef solve(N):

def solve(N): sum_needed = (N * (N + 1)) // 2 k = ((N + 1) * (N + 2)) // 2 count = 0 total = 0 for i in range(N + 1, 0, -1): if total >= sum_needed: break total += i count += 1 return count #Get_Ribbon #BNY