【CodeForces 614A】Link/Cut Tree

#include <stdio.h>
unsigned long long l,r,k,t;
int ok;
int main(){
    scanf("%lld%lld%lld",&l,&r,&k);
    t=1;
    while(t<=r){
        if(t>=l){
            printf("%lld ",t);
            ok=1;
        }
        if(t>r/k)break;
        t*=k;
    }
    if(!ok)printf("-1\n");
    return 0;
}

#include <stdio.h>
unsigned long long l,r,k,t;
int main(){
    scanf("%lld%lld%lld",&l,&r,&k);
    t=1;
    while(t<l)t*=k;//这里会爆
    if(t>r)printf("-1\n");else
    while(t<=r){
        printf("%lld ",t);
        if(t>r/k)break;
        t*=k;
    }
    return 0;
}