Submission

Status:

[P][P][P][P][P][P][P][P][PP][P]

Score: 100

User: Pera

Problemset: กองส้ม

Language: python

Time: 0.021 second

Submitted On: 2025-04-09 21:23:20

def main():
    l, n = map(int, input().split())
    
    # sum of oranges at each height
    prefsum = []
    prefsum.append(0) # 0 oranges at 0 height
    
    for i in range(1, l + 1):
        prefsum.append(prefsum[i - 1] + (i * i))
        
    
    # l + 1 so it counts zero
    layers_sold = 0
    for i in range(l + 1):
        if n >= prefsum[i]:
            layers_sold = i
        else:
            break
        
    result = l - layers_sold
    print(result)
        
main()