Codeforces Round #339 (Div. 2) A.Link/Cut Tree

链接：http://codeforces.com/contest/614/problem/A

题意：给定l,r,k，求出所有l<=x<=r并且x为k的整数次幂，没有输出-1。

分析：用r连除k，求出最大次幂。for一遍看哪些>=l即可。(好像有好多人直接乘乘爆了，用log丢精度。。)

代码：

#include<map>
#include<set>
#include<cmath>
#include<queue>
#include<math.h>
#include<cstdio>
#include<vector>
#include<string>
#include<cstring>
#include<iostream>
#include<algorithm>
#pragma comment(linker, "/STACK:102400000,102400000")
using namespace std;
const int N=1000010;
const int MAX=151;
const int MOD=1000000007;
const int MOD1=100000007;
const int MOD2=100000009;
const int INF=1000000000;
const double EPS=0.00000001;
typedef long long ll;
typedef unsigned long long uI64;
int read()
{
    int x=0,f=1;char ch=getchar();
    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
    return x*f;
}
ll a[100];
int main()
{
    int i,g=0,h=0;
    ll l,r,k,kk;
    scanf("%I64d%I64d%I64d", &l, &r, &k);
    while (r>=k) { g++;r/=k; }
    kk=1;
    if (1>=l) a[++h]=1;
    for (i=1;i<=g;i++) {
        kk*=k;
        if (kk>=l) a[++h]=kk;
    }
    if (!h) printf("-1\n");
    else {
        for (i=1;i<=h;i++) printf("%I64d ", a[i]);
    }
    return 0;
}