Codeforces Round #339 (Div. 2) A
2016-01-15 21:50
323 查看
Description
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).Sample Input
1 10 22 4 5
Sample Output
1 2 4 8-1
此题非常要注意什么时候循环结束,否则可能会爆long long
#include<stdio.h> //#include<bits/stdc++.h> #include<string.h> #include<iostream> #include<math.h> #include<sstream> #include<set> #include<queue> #include<vector> #include<algorithm> #include<limits.h> #define inf 0x3fffffff #define lson l,m,rt<<1 #define rson m+1,r,rt<<1|1 #define LL long long using namespace std; LL powll(LL x, LL n) { LL pw = 1; while (n > 0) { if (n & 1) pw *= x; x *= x; n >>= 1; } return pw; } int main() { LL l,r,k; LL x; cin>>l>>r>>k; int flag=0; for(int i=0;i<=66;i++) { if(x>r/k) break; x=powll(k,i); if(x>=l&&x<=r) { flag=1; cout<<x<<" "; } } if(flag==0) { puts("-1"); } return 0; }
相关文章推荐
- KVO/KVC系列概论
- 【Unity开发】简单的Wav文件压缩
- 如何将arcgis的mxd文档存储为相对路径
- 一款简单的QQ盗号蠕虫逆向分析 --发文于2013-7-23
- iOS如何写入日历 提醒?
- String、StringBuffer和StringBuilder的区别
- 线程安全(单例与多例)
- google perftools分析程序性能
- 蓝懿iOS 技术内容和心得 16.1.15
- C++实现二叉树(二)
- Apache虚拟目录与与虚拟主机
- Set Matrix Zeroes leetcode
- Mysql Binlog 主从模式配置 与 验证
- 天线-新年新目标,人生再一次远航
- 【Ajax】——学习后的小结
- 闲书的一点总结
- SourceInsight的实用设置
- python 第十天
- 鼠标拉近旋转拖拽模型
- dTree 动态生成树