zoukankan      html  css  js  c++  java
  • Codeforces Round #315 (Div. 2) A. 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 ≤ 1041 ≤ 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.

    分析:基本就是个数学题好吗,用数学公式推导出一些边界条件

    编程有时候就是用程序解决一些数学问题啊。。

    代码:

    #include<iostream>
    #include<cstdio>
    #include<algorithm>
    using namespace std;
    
    const int N = 200000+10;
    int s, q, t;
    
    
    int main()
    {
        int  cnt;
        cin >> t >> s >> q;
    
        double ti = q*t / (double)(q - 1);
        double ans = s*q;
        for (int i = 2; i < N; i++)
        {
            ans = ans + ans*q;
            if (ans >= ti)
            {
                cnt = i;
                break;
            }
        }
        cout << cnt << endl;
        return 0;
    }
  • 相关阅读:
    ora12514
    telnet到虚拟机上的red hat linux失败——解决办法
    linux下监听的配置
    本机win7系统与虚拟机中的linux系统实现通讯
    ORA01078: failure in processing system parameters LRM00109: could not open parameter file '/oradata/oracle/112/dbs/in
    Xmanager无法登录Red Hat Linux——解决方法
    几种常见算法的介绍及复杂度分析(转)
    Linux学习笔记18cal显示日历
    Linux学习笔记14架设Apache http服务器
    Installing Oracle Database 10g on Linux
  • 原文地址:https://www.cnblogs.com/shawn-ji/p/4749005.html
Copyright © 2011-2022 走看看