Codeforces Round #315 (Div. 2)569A Music(模拟)

Description

Little Lesha loves listening to music via his smartphone. But the smartphone doesn’t have much memory, so Lesha listens to his favorite songs in a well-known social network InTalk.

Unfortunately, internet is not that fast in the city of Ekaterinozavodsk and the song takes a lot of time to download. But Lesha is quite impatient. The song’s duration is T seconds. Lesha downloads the first S seconds of the song and plays it. When the playback reaches the point that has not yet been downloaded, Lesha immediately plays the song from the start (the loaded part of the song stays in his phone, and the download is continued from the same place), and it happens until the song is downloaded completely and Lesha listens to it to the end. For q seconds of real time the Internet allows you to download q - 1 seconds of the track.

Tell Lesha, for how many times he will start the song, including the very first start.

Input

The single line contains three integers T, S, q (2 ≤ q ≤ 104, 1 ≤ S < T ≤ 105).

Output

Print a single integer — the number of times the song will be restarted.

Sample Input

Input

5 2 2

Output

2

Input

5 4 7

Output

1

Input

6 2 3

Output

1

Hint

In the first test, the song is played twice faster than it is downloaded, which means that during four first seconds Lesha reaches the moment that has not been downloaded, and starts the song again. After another two seconds, the song is downloaded completely, and thus, Lesha starts the song twice.

In the second test, the song is almost downloaded, and Lesha will start it only once.

In the third sample test the download finishes and Lesha finishes listening at the same moment. Note that song isn’t restarted in this case.

题目大意
T 表示歌曲的长度(s)、S 表示下载了歌曲的S后开始第一次播放(也就是说S秒的歌曲是事先下载好的)、q 表示下载速度(每秒下载歌曲(q-1)/q秒)。问题就是播放的速度比下载的速度慢，每当播放到没下载的位置，就会重新从头播放，输出的就是从头播放的次数(包括第一次)。

代码实现

#include<iostream>
#include<cstdio>
using namespace std;

int main()
{
    int T,S,q;
    int ans=0;
    scanf("%d%d%d",&T,&S,&q);
    while(S<T)
    {
        ans++;
        S*=q;
    }
    printf("%d\n",ans);
    return 0;
}