Codeforces Round #315 (Div. 2) A. Music
来源:互联网 发布:php 抓取 天猫 商品 编辑:程序博客网 时间:2024/06/05 06:58
A. Music
time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output
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
题意
下载一首歌,首先加载
题解
就是循环解一个一元一次方程
AC代码
#include <cstdio>using namespace std;int T,s,q;int ans=1;int main(){ scanf("%d%d%d",&T,&s,&q); while(q*s<T) (ans++)&(s*=q); printf("%d",ans); return 0;}
- A. Music-Codeforces Round #315 (Div. 2)
- Codeforces Round #315 (Div. 2) A. Music
- Codeforces Round #315 (Div. 2) A. Music
- Codeforces Round #315 (Div. 2)A. Music
- Codeforces Round #315 (Div. 2)569A Music(模拟)
- Codeforces Round #315 (Div. 2) A. Music (模拟)
- Codeforces Round #315 (Div. 2)569A Music(模拟)
- A Amr and Music( Codeforces Round #287 (Div. 2))
- Codeforces Round #287 (Div. 2) A. Amr and Music
- A. Music(Codeforces Round #315 (Div. 2) 求最大的容纳量)
- Codeforces Round #315 (Div. 2)(A,B)
- Codeforces Round #315 (Div. 2) A
- Codeforces Round #315 (Div. 2) A. Exam
- Codeforces Round #315 div2 A--Music 水题可结合数学推导
- Codeforce round #315 A music
- Codeforces Round #131 (Div. 2) A B
- Codeforces Round #174 (Div. 2) Problem A
- Codeforces Round #173 (Div. 2) A.Bit++
- php5.4和apache2.4.9不在同一台服务器的配置注意事项
- 自学编程从哪开始
- python正则表达式 re (二)escape
- 求大于200的最小质数,java
- 21-IO流-08-IO流(字符流-练习-复制文本文件_1)
- Codeforces Round #315 (Div. 2) A. Music
- nfs挂载和取消挂载命令
- 《Spring 2.0技术手册》 读书笔记七-Spring的DAO框架(3)-JDBC事务管理
- hdu 4109(拓扑排序 关键路径)
- NSString 查找指定字符串出现的次数
- 文章标题
- SDUTOJ懒虫小鑫
- Leetcode#5||Longest Palindromic Substring
- 21-IO流-09-IO流(字符流-练习-复制文本文件_2)