C++(clang++ 11.0.1) 解法, 执行用时: 43ms, 内存消耗: 564K, 提交时间: 2022-12-10 21:28:46

#include<iostream>
using namespace std;
int main(){
	int T;cin>>T;
	while(T--){
		long long l,r,k,t=1;
		bool flag=true;
		cin>>l>>r>>k;
		if(k==0&&l==0){cout<<"0 ";flag=false;}
		while(t<=r){
			if(t>=l){flag=false;cout<<t<<" ";}
			if(k==0||k==1)break;
			if(t>r/k)break;t=t*k;
		}
		if(flag)cout<<"None.";
		cout<<endl;
	}
	return 0;
}

Python3 解法, 执行用时: 1729ms, 内存消耗: 5032K, 提交时间: 2022-10-29 19:01:32

t = int(input())

for _ in range(t):
    l, r, k = [int(s) for s in input().split()]
    ok = False
    s = set()
    for i in range(0, 64):
        p = pow(k, i)
        if l <= p and p <= r:
            s.add(p)
    lst = s
    lst = sorted(lst)
    if len(lst ) != 0:
        print(*lst)
    else:
        print("None.")