Codeforces Round #315 (Div. 2) A. Music

最新推荐文章于 2024-02-21 16:39:59 发布

相知无悔

最新推荐文章于 2024-02-21 16:39:59 发布

阅读量1.3k

点赞数

分类专栏： cf 思考题

本文链接：https://blog.youkuaiyun.com/mengzhengnan/article/details/47412667

版权

cf 同时被 2 个专栏收录

110 篇文章

订阅专栏

思考题

18 篇文章

订阅专栏

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 test(s) 
      
          input 
        
5 2 2

          output 
        
2

          input 
        
5 4 7

          output 
        
1

          input 
        
6 2 3

          output 
        
1

Note

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.

题意给出，下载一首歌，刚开始下载s,然后，当听的时候有q,同步下载的为q -1 ,当听到没有下载的时候，就会回退到刚开始，要求，返回头的次

数。

列方程听到t的时候，刚好听到没下载的位置。得 s + (q -1 ) * t = q * t;所以t = s;听到q * s的时候，就要回退开始，统计一下就可以了。

#define N 205
#define M 100005
#define maxn 205
#define MOD 1000000000000000007
int t,s,q;
int main()
{
    //freopen("in.txt", "r", stdin);
    //freopen("out.txt", "w", stdout);
     while(S2(t,s)!=EOF)
    {
        S(q);
        int ans = 0;
        while(s < t){
            s = s * q;
            ans++;
        }
        printf("%d\n",ans);
    }
    //fclose(stdin);
    //fclose(stdout);
    return 0;
}