Logo
(追記) (追記ここまで)

15228번 - 3D Printed Statues 다국어

시간 제한메모리 제한제출정답맞힌 사람정답 비율
2 초 512 MB1831169762.987%

문제

You have a single 3D printer, and would like to use it to produce n statues. However, printing the statues one by one on the 3D printer takes a long time, so it may be more time-efficient to first use the 3D printer to print a new printer. That new printer may then in turn be used to print statues or even more printers. Print jobs take a full day, and every day you can choose for each printer in your possession to have it print a statue, or to have it 3D print a new printer (which becomes available for use the next day).

What is the minimum possible number of days needed to print at least n statues?

입력

The input contains a single integer n (1 ≤ n ≤ 10 000), the number of statues you need to print.

출력

Output a single integer, the minimum number of days needed to print at least n statues.

제한

예제 입력 1

1

예제 출력 1

1

예제 입력 2

5

예제 출력 2

4

힌트

출처

Contest > KTH Challenge > KTH Challenge 2017 F번

  • 문제를 만든 사람: Unnar Freyr Erlendsson
(追記) (追記ここまで)

출처

대학교 대회

  • 사업자 등록 번호: 541-88-00682
  • 대표자명: 최백준
  • 주소: 서울시 서초구 서초대로74길 29 서초파라곤 412호
  • 전화번호: 02-521-0487 (이메일로 연락 주세요)
  • 이메일: contacts@startlink.io
  • 통신판매신고번호: 제 2017-서울서초-2193 호

AltStyle によって変換されたページ (->オリジナル) /