题目描述
include[HTML_REMOVED]
include[HTML_REMOVED]
include[HTML_REMOVED]
include[HTML_REMOVED]
using namespace std;
typedef long long ll;
ll n,k;
int k;
int main{
int q;
cin >> q;
for(int i = 0; i < q, i++ ){
n = 0;
k = 0;
res = 1;
scanf("%lld%d",&n , &k);
for(int j = 2; j <= n/j; j++){
int num = 0;
while(n%j ==0){
n = n / j;
num++;
}
if(num >= k) res *=pow(j , num);
}
cout << res << endl;
}
return 0;
}
样例
blablabla
算法1
(暴力枚举) $O(n^2)$
blablabla
时间复杂度
参考文献
C++ 代码
blablabla
算法2
(暴力枚举) $O(n^2)$
blablabla
时间复杂度
参考文献
C++ 代码
blablabla