| 시간 제한 | 메모리 제한 | 제출 | 정답 | 맞힌 사람 | 정답 비율 |
|---|---|---|---|---|---|
| 1 초 | 2048 MB | 149 | 99 | 89 | 66.917% |
Christopher loves the number one. In fact, he loves it so much that if he ever has more than one of something, he makes sure to get rid of all but one of his items. Christopher has one pencil, one notebook, one sweatshirt, and so on.
However, Christopher has gotten bored of just giving away all but one of his possessions of each type. Instead, he has come up with a new strategy, which depends on the number of items he has already. If he has an even number of something, then he will give away half of what he has. If he has an odd number of things, then he will buy some more of that item: he will add twice as many items as he currently has, plus one more item, to his collection. He does this until he has just one item left.
For example, if he has 5ドル$ phone chargers, then to get rid of them he would first buy 11ドル$ more (for a total of 16ドル$), then give away 8ドル,ドル then give away 4ドル,ドル then give away 2ドル,ドル then give away 1ドル$.
Christopher wants to know how long it will take to get rid of his items using this technique.
Given a number, you must tell Christopher how many steps the technique takes to convert the number to one. For example, for the number 5ドル$ above, the number of steps needed would be 5ドル$.
The input consists of one integer, $N$ (1ドル \leq N \leq 100\ 000$).
Output the number of steps it takes for the input number to be converted to one.
5
5
8
3
School > CS@Mines > CS@Mines HSPC 2019 B번