text stringlengths 49 983k |
|---|
#include <iostream>
#include <cmath>
using namespace std;
long N, P, i, j, n;
int main(void) {
cin >> N >> P;
if (N == 1) {
cout << P << endl;
return 0;
}
long ans = 1;
//Pを素因数分解
for (i=2; i*i<=P; i++) {
n = 0;
while (P % i == 0) {
P /= i;
n++;
}
if (n >= N) {
ans *= pow(i, n / N);
}
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int main(){
ll N,P,ans=1;
cin>>N>>P;
if(N==1){
printf("%lld\n",P);
return 0;
}
for(ll i=2;pow(i,N)<=P;i++){
ll tmp=pow(i,N);
if(P%tmp==0)
ans = i;
}
printf("%lld\n",ans);
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n,p;
ll ans=1;
int main(){
cin>>n>>p;
if(n==1){
cout<<p<<endl;
return 0;
}
for(int i=2;i<=sqrt(p);i++){
if(p%i==0){
int cnt=0;
while(p%i==0){
cnt++;
p/=i;
if(cnt%n==0) ans*=i;
}
}
if(p==1) break;
}
cout<<ans<<endl;
return 0;
} |
#include <bits/stdc++.h>
#define dum(x) cout<<#x<<'='<<x<<endl
#define ll long long
using namespace std;
int main() {
ll n, p;
cin >> n >> p;
ll ans = 1;
for (ll i = 2; i * i <= p; i++) {
int cnt = 0;
while (p % i == 0) {
cnt++;
p /= i;
}
int tmp = cnt / n;
for (int j = 0; j < tmp; j++) {
ans *= i;
}
}
if (n == 1) ans *= p;
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
long long n, p;
cin >> n >> p;
long long ans = 1;
map<long long, long long> mp;
for(long long i = 2; i * i <= p; i++) {
while(p % i == 0) {
mp[i]++;
p /= i;
}
}
if(p != 1) {
mp[p]++;
}
for(auto i : mp) {
if(i.second >= n) {
ans *= pow(i.first, i.second / n);
}
}
cout << ans << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
long long n,p;
cin>>n>>p;
long long cnt=0,s=1;
if(n==1){
cout<<p<<endl;
return 0;
}
for(long long i=2;i<=sqrt(p);i++){
while(p%i==0){
cnt++;
p/=i;
if(cnt>=n){
s*=i;
cnt=0;
}
}
cnt=0;
}
cout<<s<<endl;
} |
#include <bits/stdc++.h>
using namespace std;
#include <iostream>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <algorithm>
#include <time.h>
int main() {
long P,Q,N,count,score,j,a,b;
score=1.0;
cin>>N>>P;
Q=P+1;
if(N==1){
cout<<P<<endl;
}else{
for(j=2;pow(j,N)<Q;j++){
for(;;){
if(fmod(P,pow(j,N))==0){
P=P/pow(j,N);
Q=P+1;
score=score*j;
} else{
break;
}
}
}
cout<<score<<endl;
}
} |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
ll n,p;
cin >> n >> p;
map <ll,ll> m;
for(ll i = 2 ; i*i <= p ; i++)
{
while(p % i == 0)
{
m[i]++;
p /= i;
}
}
if(p > 1)
m[p]++;
ll ans = 1;
for(auto i = m.begin() ; i != m.end() ; i++)
{
ans *= pow(i->first,(i->second/n));
}
cout << ans;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long lint;
int main() {
lint N, P; cin >> N >> P;
if (N == 1) {
cout << P << endl;
return 0;
}
lint a = 2;
lint ans = 1;
while (pow(a, N) <= P) {
if (P % lint(pow(a, N)) == 0) {
P /= pow(a, N);
ans *= a;
} else {
a++;
}
}
cout << ans << endl;
}
|
#include <iostream>
#include <vector>
#include <map>
#include <algorithm>
#include <math.h>
#include <numeric>
using namespace std;
int main() {
long long int N, P;
int max_gcd = 1;
int start_num = 0;
cin >> N >> P;
if (N == 1) {
cout << P << endl;
} else {
for (int i = 1;; i *= 10) {
if (pow(i, N) > P) {
start_num = i;
break;
}
}
for (long long int i = start_num; i != 1; i--) {
if (P % (long long int) pow(i, N) == 0) {
max_gcd = i;
break;
}
}
cout << max_gcd << endl;
}
}
|
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<cmath>
#include<set>
#include<map>
#include<iomanip>
using namespace std;
int main(void) {
long long n, p;
cin >> n >> p;
long long ans;
if (n == 1) {
cout << p;
}
else {
for (long long i = 1; i <= p && pow(i, n) <= p; i++) {
if (p % ((long long)pow(i, n)) == 0) {
ans = i;
}
//cout << i << endl;
}
cout << ans;
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main()
{
long long n, p;
cin >> n >> p;
long long ans = 1;
for (int i = 2; 1LL * i * i <= p; i++) {
int cnt = 0;
while (p % i == 0) {
p /= i;
cnt++;
}
if (cnt >= n) {
for (int j = 0; j < cnt / n; j++) {
ans *= 1LL * i;
}
}
}
if (n == 1) ans *= p;
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
long N,P;
long ans;
cin >> N >> P;
ans = (long)pow(P,1/(long double)N);
while((long)P % (long)pow(ans,N) != 0){
ans--;
}
cout << ans << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define M 1000005
#define ll long long
ll n, p, ans = 1;
bool dd[M];
vector<ll> v;
int main(){
cin >> n >> p;
if (n == 1){
cout << p;
return 0;
}
for (int i = 2; i < M; i++){
if (!dd[i]){
v.push_back(i);
for (int j = 2*i; j < M; j += i) dd[j] = true;
}
}
for (int i = 0; i < v.size(); i++){
ll cnt = 0;
while (p > 0 && p%v[i] == 0) cnt++, p /= v[i];
if (cnt > 0) ans *= pow(v[i], cnt/n);
}
cout << ans;
return 0;
}
|
#include<iostream>
#include<cmath>
using namespace std;
int main(){
long long n,p;
cin >> n >> p;
long long ans=1;
for(long long i=2;i<=pow((long double)p,(long double)1/n);i++){
if(n==1) {
ans=p;
break;
}
if(p%(long long)pow((long double)i,(long double)n)==0) ans=i;
}
cout << ans <<endl;
} |
#include <iostream>
#include <map>
#include <cmath>
long long n, p;
std::map<long long, long long> data;
int main() {
std::cin >> n >> p;
long long a = 2;
while (p >= a * a) {
if (p % a == 0) {
++data[a];
p /= a;
}
else {
a++;
}
}
if (p != 1)
++data[p];
long long ans = 1;
for (auto& s : data)
if (s.second >= n)
ans *= std::pow(s.first, s.second / n);
std::cout << ans << std::endl;
return 0;
}
|
#include <iostream>
#include <vector>
#include <map>
#include <cmath>
using namespace std;
typedef long long ll;
vector<pair<ll, ll> > v;
int main()
{
ll n, p;
cin >> n >> p;
if(n == 1){
cout << p << endl;
return 0;
}
if(n >= 40){
cout << 1 << endl;
return 0;
}
ll ans = 1;
for(ll i = 2;;){
ll po = pow(i, n);
if(po > p){
break;
}else if(p % po == 0){
p /= po;
ans *= i;
}else{
i++;
}
}
cout << ans << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ll n,p;
cin >> n >> p;
ll ans=1,t=p;
ll cnt=0,mod=2;
while(mod*mod<=t&&p)
{
if (p%mod==0)
{
cnt++;
p/=mod;
}else
{
ans*=pow(mod,cnt/n);
cnt=0,mod++;
}
}
if (p!=0&&n==1) ans*=p;
cout << ans << endl;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int main(){
long long int N,P;
long long int pans = 0,ans = 0;
cin >>N>>P;
if(N == 1){
cout <<P<<endl;
return 0;
}
while(pow(pans,N) <= P ){
pans++;
/*cout <<pans<<endl;
cout <<pow(pans,N)<<' '<<P<<endl;
cout <<(double)P/pow(pans,N)<<' '<<(long long int)(P/pow(pans,N))<<endl;
/*if (pans == 210)break;*/
if((P % (long long int)pow(pans,N)) == 0)ans = pans;
}
cout <<ans<<endl;
return 0;
}
|
#include <iostream>
#include <map>
using namespace std;
long long n,p,cnt;
map<long long, int>v;
int main(){
cin >> n >> p;
for(int i = 2; i *1ll* i <= p; i ++)
while(p % i == 0)
v[i] ++, p /= i, cnt ++;
if(p > 1)
v[p] ++;
long long res = 1;
for(map<long long, int> :: iterator it = v.begin(); it != v.end(); it ++)
for(int i = 0; i < (*it).second / n; i ++)
res *= it->first;
cout << res;
}
|
#include<iostream>
#include<algorithm>
#include<string>
#include<map>
#include<vector>
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define MM = 1000000000;
#define mod = MM + 7;
#define INF (ll)1e18
#define pi acos(-1.0)
#define MAX 10000000005
#define NIL -1
int main(){
ll n, p; cin >> n >> p;
ll ans = 1;
if(n == 1){
cout << p << endl;
return 0;
}
ll a = 1;
while(pow(a, n) <= p){
ll i = pow(a, n);
if(p % i == 0) ans = a;
a++;
}
cout << ans << endl;
} |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll n,p;cin>>n>>p;
if(n==1){
cout<<p<<endl;
return 0;
}
ll ans=1;
for(ll i=2;;i++){
if(pow(i,n)>p)break;
ll num=pow(i,n);
if(p%num==0)ans=i;
}
cout<<ans<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (int)(n); ++i)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
int main() {
long n,p;
cin >> n>>p;
if(n==1){
cout<<p<<endl;
}
else{
vector<int>a(1000100);
rep2(i,2,1000100){
long w=p;
while(w%i==0){
w/=i;
a.at(i)++;
}
}
long ans=1;
rep2(i,2,1000100){
if(a.at(i)>=n){
ans=i;
}
}
cout<<ans<<endl;
}
}
|
#include <iostream>
#include <vector>
#include <map>
#include <cmath>
#include <cstdio>
#include <string>
#include <algorithm>
using namespace std;
int main(void){
long long N, P;
cin >> N >> P;
long long answer = 1;
// P = ans^N * buf
long long ans = pow(P, (double)1/N) + 1;
while(true){
long long a = pow(ans, N);
if(P % a == 0){
answer = ans;
break;
}
ans--;
}
cout << answer << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
ll n, p;
cin >> n >> p;
ll ans = 1;
if (n == 1) {
cout << p << endl;
return 0;
}
ll a = 1;
while (pow(a, n) <= p) {
ll kake = pow(a, n);
if (p % kake == 0) ans = a;
a++;
}
cout << ans << endl;
}
|
#include <iostream>
#include <cmath>
using namespace std;
int main() {
long long N, P;
cin >> N >> P;
long long x = floor(pow(P, 1.0 / N) + 1);
while (x > 1) {
long long temp = pow(x, N);
if (P % temp == 0) {
cout << x << endl;
return 0;
}
--x;
}
cout << 1 << endl;
return 0;
} |
#include <iostream>
#include <cmath>
using namespace std;
int main(void){
// Your code here!
long long int N,P;
cin>>N>>P;
if(N==1){cout<<P<<endl;return 0;}
else{
long long int ans=1;
for(int i=2;i<=1000000;i++){
long long int A;
A=pow(i,N);
if( P % A ==0){
ans=i;
}
}
cout<<ans<<endl;
return 0;
}
}
|
#include <iostream>
#include <cmath>
using namespace std;
int main(){
int n,i,k,cnt;
unsigned long long int p,ans;
cin>>n>>p;
if(n==1){
ans=p;
}else{
ans=1;
for(i=2;i<=sqrt(p);i++){
cnt=0;
while(p%i==0){
p=p/i;cnt++;
}
while(cnt>=n){
ans=ans*i;
cnt=cnt-n;
}
}
}
cout << ans <<endl;
return 0;
}
|
#include <iostream>
#include <math.h>
using namespace std;
int main() {
long long N, P;
cin >> N >> P;
if(N==1) {
cout << P << endl;
return 0;
}
for(int i=1000000; i > 0; --i) {
if(P % (long long)pow((double)i, (double)N) == 0) {
cout << i << endl;
return 0;
}
}
} |
#include <cstdio>
#include <cmath>
#define LL long long
int main() {
LL n, p;
scanf("%lld%lld", &n, &p);
LL ans = 1;
LL cnt = 0;
if (n == 1) {
printf("%lld", p); return 0;
}
for (LL i = 2; i * i <= p; i++) {
if (p % i == 0) {
int cnt = 0;
while (p % i == 0) {
cnt++;
p /= i;
if (cnt % n == 0) ans *= i;
}
}
if (p == 1) break;
}
printf("%lld", ans);
return 0;
} |
#include <iostream>
#include <math.h>
using namespace std;
int main(void) {
long long N, P;
cin >> N;
cin >> P;
long long ans = 1;
int i;
if (N == 1){
ans = P;
}else{
for (i = 2; i <= 1000010; i++) {
long long kn = pow(i, N);
if ((P % kn) == 0) {
ans = i;
}
if (P < kn) {
break;
}
}
}
cout << ans << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int box[10000000];
void soinsuu(ll n){
for(ll i=2;i*i<=n;i++){
while(n%i==0){
box[i]++;
n/=i;
}
if(n==1)break;
}
}
int main(){
ll n,p;
cin>>n>>p;
if(n==1){
cout<<p<<endl;
return 0;
}
soinsuu(p);
ll ans=1;
for(ll i=2;i*i<=p;i++){
while(box[i]>=n){
ans*=i;
box[i]-=n;
}
}
cout<<ans<<endl;
}
|
#include <cstdio>
#include <algorithm>
#include <vector>
#include <string>
#include <iostream>
#include <cmath>
#include <climits>
#include <unordered_map>
using namespace std;
#define size_t int
int main(int argc, char const *argv[]) {
long N, P;
scanf("%ld %ld", &N, &P);
long k = (long)(pow(P, 1.0/N)+2.0);
for (long i = k; i >= 0; i--) {
if (P % (long)pow(i, N) == 0) {
printf("%ld\n", i);
return 0;
}
}
}
|
#include <iostream>
#include <math.h>
#include <map>
using namespace std;
int main()
{
long N, P;
cin >> N >> P;
map<long, long> mp;
for (long i = 2; i * i <= P; i++)
{
while (P % i == 0)
{
if (mp.find(i) == mp.end())
mp[i] = 1;
else
mp[i] = mp[i] + 1;
P /= i;
}
}
if (P != 1)
{
if (mp.find(P) == mp.end())
mp[P] = 1;
else
mp[P] = mp[P] + 1;
}
long ans = 1;
for (auto m : mp)
{
ans *= pow(m.first, m.second / N);
}
cout << ans << endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main(){
long double N,P;
unsigned long long ans;
cin >> N >> P;
ans = (unsigned long long)pow(P,1/N);
while((unsigned long long)P % (unsigned long long)pow(ans,N) != 0){
ans--;
}
cout << ans << endl;
return 0;
}
|
#include <iostream>
#include <cmath>
using namespace std;
int main() {
long long n, p, m = 1, q = 2;
cin >> n >> p;
while(q <= sqrt(p)){
int i = 0;
while(p % q == 0){
p /= q;
i++;
}
for(int j = 0; j < (i / n); j++)
m *= q;
q++;
}
if(n == 1)
m *= p;
cout << m << endl;
return 0;
} |
#include<iostream>
#include<math.h>
using namespace std;
int main()
{
long n,p,ans=1,st;
cin >> n >> p;
if(n==1)
{
cout << p << endl;
return 0;
}
st = sqrt(p)+1;
for(long i=2;i<st;i++)
{
while(p % long(pow(i,n))==0)
{
ans*=i;
p = p/pow(i,n);
}
}
cout << ans << endl;
return 0;
} |
#include <iostream>
#include <cmath>
using namespace std;
int main(){
long long int n, p, c, d, ans=1;
cin >> n >> p;
for(int i=2; i<=(int)sqrt(p); i++){
c=0;
d=p;
while(d%i==0 && c<n){
d=d/i;
c++;
}
if(c==n){
ans=i;
}
}
if(n==1){
ans = p;
}
cout << ans << endl;
} |
#include<bits/stdc++.h>
using namespace std;
int main(){
map<int,int> m;
long n,p,P,d,res=1;
cin>>n>>P;
p=P;
if(n==1){cout<<p;return 0;}
for(int i=2;i<=pow((double)P,1.0/(double)n);++i){
d=pow(i,n);
while(p%d==0){
m[i]++;
p/=d;
}
}
for(auto itr=m.begin();itr!=m.end();itr++)res*=pow(itr->first,itr->second);
cout<<res;
return 0;
} |
#include <cstdio>
long long qpow(long long a, long long n) {
long long res = 1;
for (; n; n >>= 1, a *= a) if (n & 1) res *= a;
return res;
}
int main() {
long long n, p;
scanf("%lld %lld", &n, &p);
long long ans = 1;
for (int i = 2; 1ll * i * i <= p; i++) if (p % i == 0) {
int cnt = 0;
while (p % i == 0) {
++cnt;
p /= i;
}
ans *= qpow(i, cnt / n);
}
if (p > 1 && n == 1) ans *= p;
printf("%lld\n", ans);
return 0;
} |
#include<iostream>
#include<sstream>
#include<vector>
#include<iterator>
#include<cmath>
using namespace std;
int main(void)
{
long long N, P;
cin >> N >> P;
if(N == 1){
cout << P << endl;
return 0;
}
long long ans = 1;
for(long long i=2; i*i<=P; i++){
long long cnt = 0;
long long p = P;
while(p%i == 0){
cnt++;
p /= i;
}
if(cnt >= N)
ans = i;
}
cout << ans << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int prime(long long n){
for(long long i=2;i<=sqrt(n);i++){
if(n%i==0){
return 0;
}
}
return 1;
}
int main(){
long long n,m;
cin>>n>>m;
long long maxn=1;
if(n==1){
cout<<m<<endl;
return 0;
}
double ff=m,fff=n;
double f=pow(ff,1.0/fff);
for(long long i=f+1;i>=2;i--){
long long sum=1;
for(long long j=0;j<n;j++){
sum*=i;
if(sum>m)
break;
}
if(m%sum==0){
maxn=i;
break;
}
}
cout<<maxn<<endl;
}
|
#include <iostream>
#include <cmath>
using namespace std;
int main(){
long long N, P, tmp, j;
long long ret = 1;
cin >> N >> P;
if (N == 1) ret = P;
else{
long long max_p = ceil(pow(P, 1.0/(double)N));
for (j=max_p; j >= 1; j--){
tmp = pow(j, N);
if (P % tmp == 0) break;
}
ret = j;
}
cout << ret << endl;
return 0;
}
|
#include <bits/stdc++.h>
#include <assert.h>
using namespace std;
int main()
{
long long n, p;
cin >> n >> p;
unordered_map<long long, long long> m;
long long now = 2;
while (now * now <= p)
if (p % now == 0)
{
m[now]++;
p /= now;
}
else
now++;
m[p]++;
long long ans = 1;
for (pair<long long, long long> t : m)
for (int i = 0; i < t.second / n; i++)
ans *= t.first;
cout << ans << endl;
return 0;
}
|
#include<iostream>
#include<vector>
using namespace std;
using ll = long long;
ll n, p;
ll ans = 1, e = 0, q = 0;
vector<ll> prime_factor(ll n){
vector<ll> res;
for (ll i = 2; i * i <= n; i++){
while (n % i == 0){
res.push_back(i);
n /= i;
}
}
if (n != 1) res.push_back(n);
return res;
}
int main(){
cin >> n >> p;
vector<ll> v = prime_factor(p);
for (int i = 0; i < v.size(); ++i){
if (q != v[i]) q = v[i], e = 0;
e++;
if (e % n == 0) ans *= v[i];
}
cout << ans << endl;
} |
#include<bits/stdc++.h>
#define gc getchar
#define rint register int
#define rep(i,u,z) for(rint i=u;i<=z;++i)
#define reb(i,u,z) for(rint i=u;i>=z;--i)
#define inf 0x7fffffff
using namespace std;
typedef long long ll;
const int N=1e6+10;
ll n,p,ans=1;
ll cnt[N];
int main(){
scanf("%lld%lld",&n,&p);
if(n==1){
printf("%lld",p);
return 0;
}
ll emm=p;
rep(i,2,sqrt(emm))while(emm%i==0)++cnt[i],emm/=i;
rep(i,2,sqrt(p))rep(j,1,cnt[i]/n)ans*=(ll)i;
printf("%lld",ans);
return 0;
} |
#include <iostream>
#include <stdio.h>
#include <string>
#include <math.h>
#include <vector>
#include <algorithm>
#include <functional>
#include <map>
#include <climits>
#include <memory>
#include <sstream>
#include <iomanip>
using namespace std;
int main() {
long long n, p;
cin >> n >> p;
long long a = pow(p, (1.0/n)) + 1;
for (; a >= 1; a--) {
if (p % (long long)pow(a, n) == 0) break;
}
cout << a << endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define int long long
int32_t main()
{
int n,p;
cin>>n>>p;
int ans=1;
for(int i=2;i<=1000000;++i){
if(p%i==0){
int cp=0;
while(p%i==0){
p/=i;
cp++;
}
cp/=n;
for(int j=0;j<cp;++j)
ans*=i;
}
}
if(n==1)
ans*=p;
cout<<ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll a[1005],b[1005];
ll zyou(ll i,ll n){
ll k=1;
while(n>0){
if(n&1) k=k*i;
i=i*i;
n>>=1;
}
return k;
}
int main(void){
ll n,p; cin>>n>>p;
ll ans=1;
if(n==1){
cout<<p<<endl; return 0;
}
if(n>=40){
cout<<1<<endl;
return 0;
}
for(ll i=2;zyou(i,n)<=p;i++){
while(p%zyou(i,n)==0){
ans=ans*i;
p=p/zyou(i,n);
}
}
cout<<ans<<endl;
}
|
#include <iostream>
#include <string>
#include <algorithm>
#include <cstring>
#include <set>
#include <string>
#include <cmath>
#include <vector>
#include <map>
using namespace std;
typedef long long ll;
int main()
{
ll n, p;
cin >> n >> p;
ll ans = 0;
//除外
if (p == 1) {
cout << 1;
return 0;
}
if (n == 1) {
cout << p;
return 0;
}
//1から最大公約数を検索
for (ll i = 1; pow(i, n) <= p; i++) {
ll D = pow(i, n);
//指数表示にして指数がnと同じなら
if (p%D == 0)ans = max(ans, i);
}
cout << ans;
} |
#include <bits/stdc++.h>
#define int long long
using namespace std;
signed main(){
int N,P;
cin>>N>>P;
int ans=1;
if(N==1){cout<<P<<endl;return 0;}
for(int i=1;pow(i,N)<=P;i++){
int j=pow(i,N);
if(P%j==0)ans=i;
}
cout<<ans<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
long N,P;
long ans;
cin >> N >> P;
ans = (long)pow(P,1/(long double)N);
while(P % (long)pow(ans,N) != 0){
ans--;
}
cout << ans << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
long long mp[10000005];
int main()
{
long long n,p,ans=1;
cin>>n>>p;
if(n==1) {cout<<p;return 0;}
memset(mp,0,sizeof(mp));
for(long long i=2;i*i<=p;i++)
while(p%i==0)
{
mp[i]++;
p/=i;
if(mp[i]>=n)
{
ans*=i;
mp[i]-=n;
}
}
//if(p+mp[p]>=n) ans*=p;
cout<<ans;
} |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int n,h,w;
int H,W;
int main()
{
ll n,p;
cin>>n>>p;
ll ans=1;
for(ll i=2,sq=sqrt(p+0.5);i<=sq;i++)if(p%i==0)
{
int cnt=0;
while(p%i==0)p/=i,cnt++;
for(int j=cnt/n;j>=1;j--)ans*=i;
}
if(p>1)for(int j=1/n;j>=1;j--)ans*=p;
cout<<ans<<endl;
}
|
#include <iostream>
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n,p,i=1,ans=0;
int main(void){
cin>>n>>p;
if(n==1){
cout<<p<<endl;
return 0;
}
else{
for(int i=1;i<=1000000;i++){
if(p%(ll)pow(i,n)==0){
ans=i;
}
if(p<=(ll)pow(i,n)){
break;
}
}
cout<<ans<<endl;
return 0;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long N,P,answer = 1,frequency;
cin >> N >> P;
if (N == 1) {
cout << P;
return 0;
}
for (int i = 2; 1ll*i*i <= P; i++) {
for (frequency = 0; !(P%i); frequency++, P /= i);
answer *= (long long)pow(i,frequency/N);
}
cout << answer;
} |
#include <iostream>
#include <map>
using namespace std;
int main(){
long N, P, p, ans;
map<long, long> m;
cin >> N >> P;
p = P;
while (p % 2 == 0) {
++(m[2]);
p /= 2;
}
long i;
for (i = 3; i * i <= P; i += 2) {
while (p % i == 0) {
++(m[i]);
p /= i;
}
}
if (p > 1) ++(m[p]);
ans = 1;
for (const auto s : m){
cerr << s.first << " " << s.second << endl;
for(i = 0; i < s.second / N; ++i){
ans *= s.first;
}
}
cout << ans << endl;
return 0;
} |
#include <iostream>
#include <cmath>
using namespace std;
int main() {
long long N, P;
cin >> N >> P;
long long x = pow(P, 1.0 / N) + 1;
while (x > 1) {
long long temp = pow(x, N);
if (P % temp == 0) {
cout << x << endl;
return 0;
}
--x;
}
cout << 1 << endl;
return 0;
} |
#include <iostream>
#include <cmath>
#define LL long long
using namespace std;
int main()
{
LL N, P;
cin >> N >> P;
if(1 == N)
{
cout << P << endl;
return 0;
}
LL ans = pow(P, 1.0/N) + 1;
for(; ans >= 1; ans--)
{
if((P % (LL)pow(ans, N)) == 0)
{
break;
}
}
cout << ans << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main()
{
long long int n,m;
while(cin>>n>>m){
long long int ans = 1;
if(n==1 || m==1) {cout<<m<<endl; continue;}
long long int maxx = sqrt(m);
maxx+=2;
for (long long int i=2;i<=maxx;i++){
long long int c=0;
while(m%i==0){
m=m/i;
c++;
if(c==n)
{ans = ans*i;c=0;}
}
}
cout<<ans<<endl;
}
}
|
#include <iostream>
using ll = long long;
using namespace std;
int main() {
ll n,p;
cin >> n >> p;
if (n == 1) {
cout << p << endl;
return 0;
}
ll ans = 1;
ll cur = 2;
while(p > 1) {
ll count = 0;
while(p % cur == 0) {
count++;
p /= cur;
}
ll cur0 = count / n;
for (ll i = 0; i < cur0; i++) {
ans *= cur;
}
cur++;
if (cur >= 1000000+ 10L) {
break;
}
}
cout << ans << endl;
return 0;
} |
#include<iostream>
#include <string>
#include<algorithm>
#include <set>
#include <cmath>
#include<math.h>
using namespace std;
int main(void){
ios::sync_with_stdio(false);
long N, P, i, k, j, a,s;
cin >> N >> P;
s = (long)pow((double)(P), 1.0 / (double)(N));
a = 0;
if (N == 1) a = P;
else{
for (i = 1; i <= s + 1; i++) {
j = (long)pow((double)(i), (double)(N));
if (P % j == 0) a = i;
if (P <= j) break;
}
}
cout << a;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int box[1000000];
void soinsuu(ll n){
ll hoge=n;
for(ll i=2;i*i<=n;i++){
while(hoge%i==0){
box[i]++;
hoge/=i;
}
if(hoge==1)break;
}
}
int main(){
ll n,p;
cin>>n>>p;
if(n==1){
cout<<p<<endl;
return 0;
}
soinsuu(p);
ll ans=1;
for(ll i=2;i*i<=p;i++){
while(box[i]>=n){
ans*=i;
box[i]-=n;
}
}
cout<<ans<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long int LL;
int main(){
LL N,P;
cin>> N>>P;
for(LL i=pow(P,1.0/N)+1;i>=1;i--){
if(P%LL(pow(i,N))==0){
cout << i << endl;
return 0;
}
}
cout << 1<< endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main (void){
long long int n, p, ans;
ans = 1;
cin >> n >> p;
if (n == 1){
cout << p << endl;
return 0;
}
for (long long int i = 2; i*i <= p; i++){
int cnt = 0;
while (p % i == 0){
cnt++;
p /= i;
if (cnt == n){
ans *= i;
cnt = 0;
}
}
}
cout << ans << endl;
} |
#include <iostream>
#include <cmath>
using namespace std;
int main() {
long long n, p;
long long i = 0;
long long ans;
cin >> n >> p;
if (n == 1) {
cout << p << endl;
} else if (p == 1) {
cout << "1" << endl;
} else if (n > 64) {
cout << "1" << endl;
} else {
ans = 1;
i = 2;
while (pow(i, n) <= p) {
if (p % (long long)pow(i, n) == 0){
ans = i;
}
i++;
}
cout << ans << endl;
}
return 0;
}
|
#include <iostream>
#include <cstdio>
#include <cmath>
using namespace std;
typedef long long ll;
ll n, p, ans=1;
int main() {
cin >> n >> p;
if(n==1) {return printf("%lld", p)*0;}
for(ll i=1; pow(i,n)<=p; i++) {
if(p % (ll)pow(i,n) == 0) ans = i;
}
cout << ans;
return 0;
} |
#include <iostream>
#include <cmath>
using namespace std;
int main()
{
long long N, P;
cin >> N >> P;
if(1 == N)
{
cout << P << endl;
return 0;
}
long long mx = pow(P, 1.0/N);
int ans = mx;
for(int i = mx + 1; i >= 1; i--)
{
long long temp = pow(i, N);
if((P % temp) == 0)
{
ans = i;
break;
}
}
cout << ans << endl;
return 0;
}
|
#include <iostream>
#include <cmath>
typedef long long int ll;
int main() {
ll i, n, p, ans = 1;
std::cin >> n >> p;
ll gcd_lim = pow(p, 1.0 / n);
if (n == 1) {
std::cout << p << std::endl;
return 0;
}
for (gcd_lim = gcd_lim + 1; gcd_lim >= 1; gcd_lim--) {
if ((p % (ll) std::pow(gcd_lim, n)) == 0) {
break;
}
}
std::cout << gcd_lim << std::endl;
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
map< ll, int > prime_factor(ll n) {
map< ll, int > ret;
for(ll i = 2; i * i <= n; i++) {
while(n % i == 0) {
ret[i]++;
n /= i;
}
}
if(n != 1) ret[n] = 1;
return ret;
}
int main(){
ll n,p;
cin >> n >> p;
map<ll,int> mp = prime_factor(p);
ll ans=1;
for(auto p:mp){
if(p.second>=n)ans*=pow(p.first,p.second/n);
}
cout << ans << endl;
}
|
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <string>
using namespace std;
int main() {
long long N, P;
cin >> N >> P;
long long temp;
bool flg;
for (long long i = pow(P,1/double(N))+1; i > 0; i--) {
temp = P;
flg = true;
if (i == 1) {
cout << i;
break;
}
for (long long j = 0; j < N; j++) {
if (temp%i == 0) {
temp = temp / i;
}
else {
flg = false;
break;
}
}
if (flg) {
cout << i;
break;
}
}
return 0;
} |
#include <cstdio>
#include <cmath>
#include <iostream>
#include <cstdlib>
#include <cstring>
#include <algorithm>
using namespace std;
typedef long long LL;
int main()
{
LL n,p;
scanf("%lld%lld",&n,&p);
LL cnt = 0,s = 1;
if (n == 1) {
printf("%lld\n",p);
return 0;
}
for (LL i = 2; i <= sqrt(p); i++){
while (p % i == 0){
cnt++;
p /= i;
if (cnt >= n){
s *= i;
cnt = 0;
}
}
cnt = 0;
}
printf("%lld\n",s);
} |
#include <cstdio>
typedef long long ll;
ll n,p,tot=0,pr[40],t[40],ans=1;
int main()
{
scanf("%lld%lld",&n,&p);
for(ll i=2;i*i<=p;i++)
{
if(p%i==0)
{
t[tot]=0;
pr[tot]=i;
while(p%i==0)
{
t[tot]++;
p/=i;
}
tot++;
}
}
if(p!=1) {t[tot]=1;pr[tot++]=p;}
for(int i=0;i<tot;i++)
for(int j=0;j<t[i]/n;j++)
ans*=pr[i];
printf("%lld",ans);
return 0;
} |
#include<iostream>
#include<cmath>
using namespace std;
int main()
{
long long n,p;
cin >> n >> p;
long long ans=0;
for(long long i=(long long)(pow(p,1.0/n))+3;i>=1;i--)
{
if(p%(long long)(pow(i,n))==0)
{
ans=i;
break;
}
}
cout << ans << endl;
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long N, P;
cin >> N >> P;
long long tmp = 0, max = 0, ans = 1;
max = exp(log(P) / N)+1;
for (long long i = max; i > 1; i--) {
tmp = pow(i, N);
if (P%tmp == 0) {
ans = i;
break;
}
}
cout << ans << endl;
}
|
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(void){
ll n,p,a=1,ans;
cin>>n>>p;
if(n==1){cout<<p<<endl;return 0;}
while(pow(a,n)<=p){
if(p%(ll)pow(a,n)==0){
ans=a;
}
a++;
}
cout<<ans<<endl;
}
|
#include <iostream>
#include <cmath>
using namespace std;
int main() {
int ans = 1;
long long int n, p;
cin >> n >> p;
if (n == 1) {
cout << p << endl;
return 0;
}
long long int tmp;
int cont;
for (int i=2; i<=sqrt(p)+1; i++) {
tmp = p;
cont = 0;
while (tmp%i == 0) {
cont++;
tmp = tmp/i;
}
if (cont >= n) ans = i;//i * (cont/n);
}
cout << ans << endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll POW(ll n, ll m) {
if (m == 0) {
return 1;
} else {
return n * POW(n, m - 1);
}
}
int main() {
ll n, p, i, ans = 1, tmp = 0;
cin >> n >> p;
map<ll, ll> mp;
i = 2;
tmp = p;
while (i * i <= p) {
while (p % i == 0) {
p /= i;
++mp[i];
}
++i;
}
++mp[p];
for (auto p : mp) {
if (p.second >= n) {
ans *= POW(p.first, (p.second) / n);
}
}
cout << ans << "\n";
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define rep(i,n) FOR(i,0,n)
typedef long long ll;
map<int,int> ma;
int main(){
ll n,p;
cin >> n>>p;
ll ans = 1;
// factor
ll a=2;
if (n==1) {
cout << p << endl;
return 0;
}
while (p>=a*a) {
if (p%a == 0) {
ma[a]++;
p/=a;
} else {
a++;
}
}
if (p!=1) {
ma[p]++;
}
for (auto &num : ma) {
while (num.second >= n) {
ans *= num.first;
num.second -= n;
}
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
ll n,p;
map<ll,int> g;
int main()
{
cin>>n>>p;
int nn = sqrtl(p);
for(int i=2;i<=nn;++i) {
while(p % i == 0 ){
g[i]++;
p/=i;
}
}
if(p>1){
g[p]++;
}
long long ans = 1;
for(auto pp:g) {
ll bas = pp.first;
ll num = pp.second;
ll mul = num / n;
ll gx = powl(bas,mul);
ans = ans * gx;
}
cout<<ans<<endl;
} |
#include "bits/stdc++.h"
using namespace std;
#define ll long long
int main() {
ll n, p;
cin >> n >> p;
if ( n == 1 ) {
cout << p << endl;
return 0;
}
ll ans = 1, lim = sqrt(p) + 1;
for ( ll i = 2; i <= lim; i++ ) {
ll cnt = 0;
while ( p % i == 0 ) {
p /= i;
cnt++;
if ( cnt == n ) {
ans *= i;
cnt = 0;
}
}
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
ll n,p,ans=1;
cin >> n >> p;
vector<ll> e(1e6+1);
ll sp=p;
for(ll i = 2;i <= 1e6;i ++){
while(p%i==0){
e[i] ++;
p /= i;
}
}
for(ll i = 2;i <= 1e6;i ++){
if(e[i]>=n) ans *= pow(i,e[i]/n);
}
if(n==1&&ans!=sp) ans = sp;
cout << ans << endl;
return 0;
} |
#include<cstdio>
long long p,ans=1,n;
int main()
{
scanf("%lld%lld",&n,&p);
if (n==1)
{
printf("%lld\n",p);
return 0;
}
for (long long i=2;i*i<=p;i++)
{
long long cnt=0;
while (p%i==0) ++cnt,p=p/i;
for (long long j=1;j*n<=cnt;j++) ans=ans*i;
}
printf("%lld\n",ans);
} |
#include<iostream>
#include<string>
#include<math.h>
using namespace std;
int main(){
long long n,p,ans=1;
cin>>n>>p;
long long e=p;
for(int i=2;i<=sqrt(e);i++){
int x=0;
while(p%i==0){
p=p/i;
x++;
}
ans=ans*pow(i,x/n);
}
if(n>=2) cout<<ans;
else cout<<e;
} |
#include <iostream>
#include <algorithm>
#include <map>
#include <cmath>
using namespace std;
typedef long long ll;
map<ll,ll> res;
void factor(ll n) {
for (ll i = 2; i * i <= n; i++) {
while (n % i == 0) {
res[i]++;
n /= i;
}
}
if (n != 1) res[n]++;
}
int main() {
ll n, p;
cin >> n >> p;
factor(p);
ll ans = 1;
for (auto pr : res) {
if (pr.second >= n) {
ans *= pow(pr.first, pr.second / n);
}
}
cout << ans << endl;
} |
#include <iostream>
#include <math.h>
using namespace std;
int main(){
long long int N, P, i, j, k, count=0, ans=1;
cin >> N >> P;
j = P;
for(i=2; i<sqrt(P); i++){
while(j % i == 0){
count++;
j /= i;
}
count /= N;
//cout << i << " " << count << "\n";
for(k=0; k<count; k++){
ans *= i;
}
count = 0;
}
if(N == 1) ans*=j;
cout << ans << "\n";
return 0;
}
|
#include <bits/stdc++.h>
#define ll long long int
#define INFTY (1<<21)
using namespace std;
int main(void){
cin.sync_with_stdio(false);
long double N;
ll P;
cin>>N>>P;
ll gmax = pow(P, 1/N);
for(ll g = gmax; g > 0; --g){
ll gn = pow(g,N);
if(P%gn==0){
cout<<g<<endl;
break;
}
}
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll n,p;
cin >> n >> p;
vector<ll> x(1000000);
if(n==1){
cout << p << endl;
}
else{
for(ll i=2;i<=1000000;i++){
while(p%i==0){
x[i]++;
p/=i;
}
}
ll ans=1;
for(ll i=2;i<=1000000;i++){
for(int j=1;j<=x[i]/n;j++){
ans*=i;
}
}
cout << ans << endl;
}
} |
#include<bits/stdc++.h>
using namespace std;
using LL=long long;
int main(){
LL N,P;
cin>>N>>P;
for(LL i=pow(P,1.0/N)+1;i>=1;i--){
if(P%LL(pow(i,N))==0){
cout<<i<<endl;
return 0;
}
}
cout<<1<<endl;
} |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
const ll M = 1e9 + 7;
int main() {
ll n, p;
cin >> n >> p;
if (n==1){
cout << p << endl;
return 0;
}
vector<ll> v(1e6+1,0);
v[1] = n;
for (ll i = 2; i*i <= p; i++){
while(p%i == 0){
v[i]++;
p /= i;
}
}
ll ans = 1;
for(ll i = 0; i <= v.size(); i++){
ans *= powl((i+1),(ll)(v[i+1]/n));
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main () {
long N, P;
cin >> N >> P;
if(N == 1){
cout << P << endl;
return 0;
} else if (N >= 64) {
cout << 1 << endl;
return 0;
}
long ans = 1;
vector<long> data((long)(sqrt(P) + 1));
for(long i = 2; i <= sqrt(P); i++){
while(P % i == 0){
data.at(i)++;
P /= i;
}
if(data.at(i) >= N)ans *= pow(i, data.at(i) / N);
}
cout << ans << endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main(){
long long N,P;cin>>N>>P;
map<long long,int> m;
for(long long i=2;i*i<=P;i++){
while(P%i == 0){
m[i] += 1;
P /= i;
}
}
if(P > 1) m[P] += 1;
long long ans = 1;
for(auto x: m) {
int times = x.second / N;
for(int i=0;i<times;i++) ans *= x.first;
}
cout<<ans<<endl;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
//Compiler version g++ 6.3.0
int main()
{
ll n, p;
cin >> n >> p;
if(n == 1){
cout << p << endl;
} else {
ll i = 1000000;
while(1){
ll power = pow(i, n);
if(p % power == 0) break;
i--;
}
cout << i << endl;
}
return 0;
} |
#include <iostream>
#include <map>
#include <cmath>
using namespace std;
typedef long long ll;
map<ll, ll> prime_factor(ll n){
map<ll, ll> res;
for (ll i = 2; i * i <= n; i++) {
while (n % i == 0) {
++res[i];
n /= i;
}
}
if (n != 1) res[n] = 1;
return res;
}
int main(int argc, char const *argv[])
{
ll n, p;
cin >> n >> p;
map<ll, ll> mp;
mp = prime_factor(p);
ll ans = 1;
for (auto x : mp){
if (x.second >= n) ans*=pow(x.first, x.second/n);
}
cout << ans << endl;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll n,p;
cin >> n >> p;
vector<ll> x(1000000);
if(n==1){
cout << p << endl;
}
else{
for(int i=2;i<=1000000;i++){
while(p%i==0){
x[i]++;
p/=i;
}
}
ll ans=1;
for(int i=2;i<=1000000;i++){
for(int j=1;j<=x[i]/n;j++){
ans*=i;
}
}
cout << ans << endl;
}
} |
#include <iostream>
using namespace std;
using int64 = long long;
int64 Solve(int64 n, int64 p) {
int64 ret = 1;
for (int64 a = 2; a * a <= p; ++a) {
int e = 0;
while (p % a == 0) {
p /= a;
++e;
}
for (e /= n; e; e--)
ret *= a;
}
if (n == 1)
ret *= p;
return ret;
}
int main() {
int64 n, p;
cin >> n >> p;
cout << Solve(n, p) << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
typedef vector<ll> vll;
typedef pair<ll, ll> pll;
#define rep(i, n) REP(i, 0, n)
#define ALL(v) v.begin() , v.end()
#define REP(i, x, n) for(ll i = x; i < n; i++)
int main(){
ll n,p; cin >> n >> p;
ll ans = 1;
if(n == 1) {
cout << p << endl;
return 0;
}
ll a = 1;
while(pow(a, n) <= p){
ll i = pow(a, n);
if(p % i == 0) ans = a;
a++;
}
cout << ans << endl;
} |
#include<cstdio>
#include<iostream>
using namespace std;
typedef long long ll;
int main()
{
ll n,p,ans=1,prime=2;
int cnt=0;
scanf("%lld%lld",&n,&p);
if(n==1)
printf("%lld",p);
else if(p==1)
printf("1\n");
else{
while(p>1&&prime*prime<=p){
while(p%prime==0)
{
cnt++;
p/=prime;
if(cnt==n){
ans*=prime;
cnt=0;
}
}
cnt=0;
if(prime==2) prime++;
else
prime+=2;
}
printf("%lld",ans);
}
return 0;
} |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int main(){
ll n,p;
cin>>n>>p;
ll ans=1;
for(ll i=2;i*i<=p;i++){
if(p%i==0){
int x=0;
while(p%i==0){
p/=i;
x++;
}
if(x>=n){
ans*=pow(i,x/n);
}
}
}
if(p>1){
if(n==1){
ans*=p;
}
}
cout<<ans<<endl;
} |
#include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
using namespace std;
ll inf=9223372036854775806;
int main()
{
//freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);
ios_base::sync_with_stdio(false); cin.tie(0);
ll n,p,i,j,ans=1,r;
cin>>p>>n;
for (i=2;i*i<=n;i++){
if (n%i==0){
r=0;
while (n%i==0){
n/=i;
r++;
}
j=r/p;
while (j>0){
ans*=i;
j--;
}
}
}
if (n>1&&p==1){
ans*=n;
}
cout<<ans;
return 0;
} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.