Problem p03196 (C++)

Buggy submission (status: Time Limit Exceeded):
#pragma region header
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rev(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define rev1(i, n) for (int i = (int)(n); i > 0; i--)
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define resort(v) sort((v).rbegin(), (v).rend())
#define vi vector<int>
#define vvi vector<vector<int>>
#define vc vector<char>
#define vvc vector<vector<char>>
#define vb vector<bool>
#define vvb vector<vector<bool>>
using ll = long long;
using P = pair<int, int>;
/* ----------------よく使う数字や配列----------------- */
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};
constexpr ll mod = 1e9 + 7;
constexpr ll inf = INT32_MAX / 2;
constexpr ll INF = LLONG_MAX / 2;
constexpr long double eps = DBL_EPSILON;
constexpr long double pi = 3.141592653589793238462643383279;
/* ----------------------end----------------------- */

/* --------------------テンプレート------------------ */
template <class T> inline bool chmin(T &a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
template <class T> inline bool chmax(T &a, T b) {
  if (a <= b) {
    a = b;
    return true;
  }
  return false;
}
/* ----------------------end----------------------- */

/* --------------------ライブラリ-------------------- */
ll fact(int i) { // 階乗
  if (i == 0)
    return 1;
  return (fact(i - 1)) * i % mod;
}
ll gcd(ll a, ll b) { // 最大公約数
  if (b == 0)
    return a;
  return gcd(b, a % b);
}
ll lcm(ll a, ll b) { // 最小公倍数
  return a * b / gcd(a, b);
}
int keta(ll n) { // 桁数を求める
  if (n == 0)
    return 1;
  int count = 0;
  while (n != 0) {
    n /= 10;
    count++;
  }
  return count;
}
ll ketasum(ll n) { // 各桁の和
  ll sum = 0;
  while (n != 0) {
    sum += n % 10;
    n /= 10;
  }
  return sum;
}
/* ----------------------end----------------------- */
#pragma endregion
vector<P> prime_div(int p) {
  vector<P> prime;
  int P = p;
  for (int i = 2; i <= P; i++) {
    if (p % i == 0) {
      int count = 0;
      while (p % i == 0) {
        p /= i;
        count++;
      }
      prime.pb({i, count});
    }
  }
  return prime;
}
signed main() {
  /*int n,p;cin >> n >> p;
  vector<P> prime = prime_div(p);
  for(auto p:prime)cout << p.first << ' ' << p.second << endl;
  int ma = -1;
  int ans = 1;
  rep(i, prime.size()) {
      if(chmax(ma,prime[i].second/n)){
          ans *= prime[i].first;
      }

  }
  // int ans = 1;
  // rep(i, prime.size()) {
      // ans*=prime[i].first*mi;
  // }
  cout << ans << endl;*/
  int n, p;
  cin >> n >> p;
  int ma = -1;
  // int ans = 1;
  for (int i = 2; i <= p; i++) {
    if (pow(i, n) > p || pow(i, n) <= 0)
      break;
    if (p % (int)pow(i, n) == 0) {
      chmax(ma, i);
      // cout << i << endl;
      // p/=i;
      // cout << ans << endl;
    }
    // cout << ans << endl;
  }
  cout << max(ma, 1LL) << endl;
  // cout << 24%(int)pow(2,3) << endl;
  // cout << pow(42436,n) << endl;
  return 0;
}

Fixed submission:
#pragma region header
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rev(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define rev1(i, n) for (int i = (int)(n); i > 0; i--)
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define resort(v) sort((v).rbegin(), (v).rend())
#define vi vector<int>
#define vvi vector<vector<int>>
#define vc vector<char>
#define vvc vector<vector<char>>
#define vb vector<bool>
#define vvb vector<vector<bool>>
using ll = long long;
using P = pair<int, int>;
/* ----------------よく使う数字や配列----------------- */
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};
constexpr ll mod = 1e9 + 7;
constexpr ll inf = INT32_MAX / 2;
constexpr ll INF = LLONG_MAX / 2;
constexpr long double eps = DBL_EPSILON;
constexpr long double pi = 3.141592653589793238462643383279;
/* ----------------------end----------------------- */

/* --------------------テンプレート------------------ */
template <class T> inline bool chmin(T &a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
template <class T> inline bool chmax(T &a, T b) {
  if (a <= b) {
    a = b;
    return true;
  }
  return false;
}
/* ----------------------end----------------------- */

/* --------------------ライブラリ-------------------- */
ll fact(int i) { // 階乗
  if (i == 0)
    return 1;
  return (fact(i - 1)) * i % mod;
}
ll gcd(ll a, ll b) { // 最大公約数
  if (b == 0)
    return a;
  return gcd(b, a % b);
}
ll lcm(ll a, ll b) { // 最小公倍数
  return a * b / gcd(a, b);
}
int keta(ll n) { // 桁数を求める
  if (n == 0)
    return 1;
  int count = 0;
  while (n != 0) {
    n /= 10;
    count++;
  }
  return count;
}
ll ketasum(ll n) { // 各桁の和
  ll sum = 0;
  while (n != 0) {
    sum += n % 10;
    n /= 10;
  }
  return sum;
}
/* ----------------------end----------------------- */
#pragma endregion
vector<P> prime_div(int p) {
  vector<P> prime;
  int P = p;
  for (int i = 2; i <= P; i++) {
    if (p % i == 0) {
      int count = 0;
      while (p % i == 0) {
        p /= i;
        count++;
      }
      prime.pb({i, count});
    }
  }
  return prime;
}
signed main() {
  /*int n,p;cin >> n >> p;
  vector<P> prime = prime_div(p);
  for(auto p:prime)cout << p.first << ' ' << p.second << endl;
  int ma = -1;
  int ans = 1;
  rep(i, prime.size()) {
      if(chmax(ma,prime[i].second/n)){
          ans *= prime[i].first;
      }

  }
  // int ans = 1;
  // rep(i, prime.size()) {
      // ans*=prime[i].first*mi;
  // }
  cout << ans << endl;*/
  int n, p;
  cin >> n >> p;
  if (n == 1) {
    cout << p << endl;
    return 0;
  }
  int ma = -1;
  // int ans = 1;
  for (int i = 2; i <= p; i++) {
    if (pow(i, n) > p || pow(i, n) <= 0)
      break;
    if (p % (int)pow(i, n) == 0) {
      chmax(ma, i);
      // cout << i << endl;
      // p/=i;
      // cout << ans << endl;
    }
    // cout << ans << endl;
  }
  cout << max(ma, 1LL) << endl;
  // cout << 24%(int)pow(2,3) << endl;
  // cout << pow(42436,n) << endl;
  return 0;
}