|
Matcom Online Grader
Faculty of Mathematics and Computer Science of University of Havana
ℹ️ We've recently migrated MOG to a new server with a different grader. As a result, some features—especially those related to submission evaluation—might not work correctly. If you encounter any issues, please report them by clicking the exclamation icon in the bottom right corner of the website.
MOG Training #1Ended |
F - 3D Printed Statues
Languages: C, C++, Java, Haskell, Pascal, Python, JavaScript, Tiger, C#
Time & Memory limits: (details)
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).
(Picture by Ariosvaldo Gonzáfoles, cc-by)
What is the minimum possible number of days needed to print at least $n$ statues?
Input
The input contains a single integer $n$ ($1 \le n \le 10\,000$), the number of statues you need to print.
Output
Output a single integer, the minimum number of days needed to print at least $n$ statues.
Sample test(s)
Input
1
Output
1
Input
5
Output
4