Halloween '14 P1 - Rabbit Girls - DMOJ: Modern Online Judge

Halloween '14 P1 - Rabbit Girls

View as PDF

Submit solution

All submissions

Best submissions

Points: 3 (partial)

Time limit: 1.0s

Memory limit: 256M

Author:

FatalEagle

Problem type

This morning, you woke up and realized that some rabbits have turned into girls! In light of this exciting event, you have decided to play with them (play card games, that is). Before you can do that, you have to put the $N$ ~N~ $(1 \le N \le 2 \times 10^9)$ ~(1 \le N \le 2 \times 10^9)~ rabbit-girls into groups of size $K$ ~K~ $(1 \le K \le 2 \times 10^9)$ ~(1 \le K \le 2 \times 10^9)~. However, it's possible that you can't divide the rabbit-girls evenly — in that case, you can either look for more rabbit-girls (finding them at a rate of 1 per second) or apologize to an existing one and then let her play on one of your virtually unlimited computers instead of participating in the group activity. Each of these actions will cost you 1 second to perform, and you can perform the first action an unlimited number of times and the second action as many times as there are currently rabbit-girls. Determine the minimum amount of time you need before you can divide the rabbit-girls (which may have increased or decreased) evenly into groups of size $K$ ~K~ (of which there must be at least one).

Input Specification

The first line of input will have $N$ ~N~.

The second line of input will have $K$ ~K~.

At least 50% of the test cases will have $1 \le N, K \le 100$ ~1 \le N, K \le 100~.

Output Specification

The first and only line of output should be the minimum number of seconds you need to split the rabbit-girls into groups of size $K$ ~K~ in accordance with the conditions listed above.