[CodeForces - 614A] A - Link/Cut Tree
A - Link/Cut Tree
Programmer Rostislav got seriously interested in the Link/Cut Tree data structure, which is based on Splay trees. Specifically, he is now studying the exposeprocedure.
Unfortunately, Rostislav is unable to understand the definition of this procedure, so he decided to ask programmer Serezha to help him. Serezha agreed to help if Rostislav solves a simple task (and if he doesn't, then why would he need Splay trees anyway?)
Given integers l, r and k, you need to print all powers of number k within range from l to r inclusive. However, Rostislav doesn't want to spent time doing this, as he got interested in playing a network game called Agar with Gleb. Help him!
Input
The first line of the input contains three space-separated integers l, r and k (1 ≤ l ≤ r ≤ 1018, 2 ≤ k ≤ 109).
Output
Print all powers of number k, that lie within range from l to r in the increasing order. If there are no such numbers, print "-1" (without the quotes).
Example
1 10 2
1 2 4 8
2 4 5
-1
Note
Note to the first sample: numbers 20 = 1, 21 = 2, 22 = 4, 23 = 8 lie within the specified range. The number 24 = 16 is greater then 10, thus it shouldn't be printed.
题目意思是,给你一个区间和一个数,求有几个这个数的正整数次幂在这个区间内.
由于数据很大,在判断是否超出R的时候可能会爆long long.所以在判断时不能用乘,而应该用除,这样就不会爆了.
#include<cstdio> #include<algorithm> using namespace std; long long L,R,K; int main(){ scanf("%lld%lld%lld",&L,&R,&K); ; ; ;} ; R/x>=K; i++){ x*=K; ;} } ) puts("-1"); ; }
最新文章
- Redis/HBase/Tair比较
- jdk8-日期
- 下载站运行广告合作exe文件然后再运行程序文件的bat
- PHP 对字符串进行十六进制替换 invalid character in attribute value
- bzoj2395
- MyBatis的两个配置文件
- 异常(Exception)
- eclipse中 com.sun.image.codec.jpeg.JPEGCodec 无法编译通过问题
- NodeJs简单七行爬虫--爬取自己Qzone的说说并存入数据库
- linux下python多版本共存
- oschina 手机/移动开发
- 开始使用Filebeat
- swift protocol 见证容器 虚函数表 与 动态派发
- tiled卷积神经网络(tiled CNN)
- swift是强类型语言
- Redis创建高可用集群教程【Windows环境】
- ComBSTR的使用
- 用shell实现bat批处理的pause命令-追加改进
- P3320 [SDOI2015]寻宝游戏 解题报告
- 读书笔记 effective c++ Item 28 不要返回指向对象内部数据(internals)的句柄(handles)