CodeForce 569A
2015-08-21 20:31
465 查看
Time Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u
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
Output
Input
Output
Input
Output
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.
程序分析:题意给出,下载一首歌,刚开始下载s,然后,当听的时候有q,同步下载的为q -1 ,当听到没有下载的时候,就会回退到刚开始,要求,返回头的次
数。
列方程听到t的时候,刚好听到没下载的位置。得 s + (q -1 ) * t = q * t;所以t = s;听到q * s的时候,就要回退开始,统计一下就可以了。
程序代码:
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.
程序分析:题意给出,下载一首歌,刚开始下载s,然后,当听的时候有q,同步下载的为q -1 ,当听到没有下载的时候,就会回退到刚开始,要求,返回头的次
数。
列方程听到t的时候,刚好听到没下载的位置。得 s + (q -1 ) * t = q * t;所以t = s;听到q * s的时候,就要回退开始,统计一下就可以了。
程序代码:
#include<iostream> using namespace std; int main() { int t,s,q,k=1; cin>>t>>s>>q; int x=s*q; while(x<t) { k++; x=x*q; } cout<<k<<endl; return 0; }
相关文章推荐
- 深入理解JavaScript系列(41):设计模式之模板方法
- UIView 中常见的方法总结
- UIBezierPath
- Hibernate 如果 hibernate.cfg.xml 没有放在 src 下,则使用以下配置方式
- 思路题 codeforces div2 C Replacement
- hdu 2544 最短路(Dijkstra Or Floyd Or dfs)
- Spring EL hello world example
- Hibernate Hibernate配置信息+启动session工厂工具包
- 算法题:矩阵旋转90度
- Java中常见概念
- c/c++常见关键字
- 表视图常用属性和方法
- CodeForces 478B 第六周比赛B题
- 导航控制器的基本概念
- HDU 4831 Scenic Popularity (段树)
- 神呐
- 深入理解JavaScript系列(39):设计模式之适配器模式
- 简单的加密解密算法
- Sliding Window Maximum
- Proxy 时空隧道