zoukankan      html  css  js  c++  java
  • CodeForces

    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.

    Examples

    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.

    思路:这道题原来考得是我的数学,而不是编程。

    首先找出每次能播放的极限sum = s + s*(q-1)/q + s*(q-1)/q*(q-1)/q+……+s*[(q-1)/q]^n = s*q*[1-(1-1/q)^n+1],然后发现当n->+∞,(1-1/q)^n+1无限趋于0,所以等式可化为sum = sq;

    #include <cstdio>
    #include <iostream>
    #include <cmath>
    #include <string>
    #include <cstring>
    #include <algorithm>
    #include <queue>
    using namespace std;
    int main()
    {
        int T, s, q;
        scanf("%d%d%d", &T, &s, &q);
        int sum = s, number = 0;
        while(sum<T)
        {
            sum *= q;//在这里求极限
            number++;
        }
        printf("%d
    ", number);
        return 0;
    }
  • 相关阅读:
    HDU 4738——Caocao's Bridges——————【求割边/桥的最小权值】
    POJ 3177——Redundant Paths——————【加边形成边双连通图】
    亲历:IT 从业者避免猝死攻略 v1.0
    Linux如何统计进程的CPU利用率
    gcp – 源于CP的高级命令行文件拷贝工具
    丰田栽了的原因,嵌入式软件工程师都该看看
    四件在我步入职业软件开发生涯那天起就该知道的事情
    浅谈自底向上的Shell脚本编程及效率优化
    实用硬件产品集锦
    [置顶] openHAB 体系结构与编程模型 (1) --- 术语
  • 原文地址:https://www.cnblogs.com/RootVount/p/10467878.html
Copyright © 2011-2022 走看看