1568번: 새 (탐색) - Fastcampus

www.acmicpc.net/problem/1568

1568번: 새

O(sqrt(N))

 

# 모든 새가 날아가기까지 걸리는 시간 => 새 감소시키며 반복횟수 카운팅
def search(bird):
    sec, song = 0, 0
    while bird:
        sec += 1
        song += 1
        if song > bird:
            song = 1
        bird -= song
    return sec


bird = int(input())
print(search(bird))