<? echo $row['title']." - ".$MSG_PROBLEM."

Problem2285--Slimes

2285: Slimes

_{[Creator : ]}

Time Limit : 1.000 sec Memory Limit : 128 MB

Submit Solved: 1 Submit Num: 2 Statistics

Description

Time Limit: 2 sec / Memory Limit: 1024 MB

Score :

200

points

Problem Statement

There are

A

slimes.
Each time Snuke shouts, the slimes multiply by

K

times.
In order to have

B

or more slimes, at least how many times does Snuke need to shout?

Constraints

$\leq A \leq B \leq 10^9$
$\leq K \leq 10^9$
All values in input are integers.

Input

Input is given from Standard Input in the following format:

 $A$  $B$  $K$

Output

Print the answer.

Sample Input Copy

1 4 2

Sample Output Copy

HINT

We start with one slime. After Snuke's first shout, we have two slimes; after his second shout, we have four slimes. Thus, he needs to shout at least twice to have four or more slimes.

Source/Category

AtCoder

Submit