CF #614A(查找指定范围内的幂乘数)
2016-03-03 23:59
176 查看
A. Link/Cut Tree
time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output
Programmer Rostislav got seriously interested in the Link/Cut Tree data structure, which is based on Splay trees. Specifically, he is now studying the expose procedure.
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).
Examples
input
1 10 2
output
1 2 4 8
input
2 4 5
output
-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.
暴力查找即可:
time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output
Programmer Rostislav got seriously interested in the Link/Cut Tree data structure, which is based on Splay trees. Specifically, he is now studying the expose procedure.
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).
Examples
input
1 10 2
output
1 2 4 8
input
2 4 5
output
-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.
暴力查找即可:
#include<bits/stdc++.h> using namespace std; int main() { __int64 l,r,k,t=1,num=0; cin>>l>>r>>k; int flag=0; while(t<=r) { if(t>=l){ printf("%I64d ",t); flag=1; } if(r/t<k)//即当t再乘以一个k便大于r时,这时便可直接退出,不用再来循环了 break; t*=k; } if(!flag) printf("-1\n"); return 0; }
相关文章推荐
- android listview每个item定义动画呈现
- centos7下安装openstack juno
- 使用负margin
- JavaEE6 CDI与Spring DI的比较
- iOS uitableview中cell的分割线紧贴左边
- springMVC自定义json序列化格式,将Date格式化为字符串
- LeetCode : Tow Sum [java]
- 安卓第五天笔记--对话框
- J2EE 第二阶段项目之分析业务
- 多源最短路径--Floyd-Warshall算法
- 原码, 反码, 补码
- php-fpm的配置和优化
- linux 非阻塞 connect
- 在 virtualbox 的 centos7 虚拟机中安装增强工具
- 关于回调
- mybatis如何防止sql注入
- python学习(7)定制类的特殊方法
- 阿里云centos6.5下搭建javaWeb运行环境
- 25. Reverse Nodes in k-Group
- tomcat结合nginx使用小结