problem_id stringlengths 6 6 | language stringclasses 2
values | original_status stringclasses 3
values | original_src stringlengths 19 243k | changed_src stringlengths 19 243k | change stringclasses 3
values | i1 int64 0 8.44k | i2 int64 0 8.44k | j1 int64 0 8.44k | j2 int64 0 8.44k | error stringclasses 270
values | stderr stringlengths 0 226k |
|---|---|---|---|---|---|---|---|---|---|---|---|
p03194 | C++ | Time Limit Exceeded | /// @file
#include <cmath>
#include <iostream>
namespace {
bool run(std::istream &is, std::ostream &os);
} // unnamed namespace
/// @brief エントリポイント
#ifdef _TEST
static int run()
#else
int main()
#endif
{
try {
if (run(std::cin, std::cout) == false) {
std::cerr << "main funciton error.\n";
return E... | /// @file
#include <cmath>
#include <iostream>
namespace {
bool run(std::istream &is, std::ostream &os);
} // unnamed namespace
/// @brief エントリポイント
#ifdef _TEST
static int run()
#else
int main()
#endif
{
try {
if (run(std::cin, std::cout) == false) {
std::cerr << "main funciton error.\n";
return E... | replace | 42 | 46 | 42 | 43 | TLE | |
p03194 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ll int64_t
// ライブラリ始まり
// 定数
// 円周率
const double PI = 3.1415926535897932384;
// 天井
const int INF = 1000000000; // = 10^9
const ll LINF = 1000000000000000; // = 10^15
// ABC文字列
const string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZABC";
const string abc = "abcdefg... | #include <bits/stdc++.h>
using namespace std;
#define ll int64_t
// ライブラリ始まり
// 定数
// 円周率
const double PI = 3.1415926535897932384;
// 天井
const int INF = 1000000000; // = 10^9
const ll LINF = 1000000000000000; // = 10^15
// ABC文字列
const string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZABC";
const string abc = "abcdefg... | replace | 81 | 88 | 81 | 92 | TLE | |
p03194 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
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;
for (long ... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
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... | insert | 17 | 17 | 17 | 21 | TLE | |
p03194 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define int long long
using namespace std;
signed main() {
int N, P;
cin >> N >> P;
int ans = 1;
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>
#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;
}
| insert | 8 | 8 | 8 | 12 | TLE | |
p03194 | C++ | Time Limit Exceeded | #include <math.h>
#include <stdio.h>
#include <stdlib.h>
int main(void) {
long long int n, p;
long long int cur[60000] = {};
int count[60000] = {};
int check[60000] = {};
int end_flag = 0;
int index = 0;
int i, j;
long long int result;
scanf("%lld %lld", &n, &p);
if (n == 1) {
result = p;
... | #include <math.h>
#include <stdio.h>
#include <stdlib.h>
int main(void) {
long long int n, p;
long long int cur[60000] = {};
int count[60000] = {};
int check[60000] = {};
int end_flag = 0;
int index = 0;
int i, j;
long long int result;
scanf("%lld %lld", &n, &p);
if (n == 1) {
result = p;
... | replace | 40 | 41 | 40 | 41 | TLE | |
p03194 | C++ | Time Limit Exceeded | #include <iostream>
#define ll long long
using namespace std;
typedef unsigned long long ull;
int main(void) {
// Your code here!
ll n, p;
cin >> n >> p;
ll ans = 1;
for (ll i = 2; i <= p; i++) {
ll count = 0;
while (p % i == 0) {
count++;
if (count == n) {
count = 0;
ans *... | #include <iostream>
#define ll long long
using namespace std;
typedef unsigned long long ull;
int main(void) {
// Your code here!
ll n, p;
cin >> n >> p;
ll ans = 1;
for (ll i = 2; i * i <= p; i++) {
if (n == 1) {
ans = p;
break;
}
ll count = 0;
while (p % i == 0) {
count++;
... | replace | 9 | 10 | 9 | 14 | TLE | |
p03194 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define ll long long
#define fort(i, n) for (int i = 1; i <= n; ++i)
#define pi pair<int, int>
#define vi vector<int>
#define pb push_back
#define sz size()
#define er erase
#define fr first
#define sc second
#define rc(x) return cout << x, 0
using namespace std;
ll n, p, d;
ll power(ll a, ll... | #include <bits/stdc++.h>
#define ll long long
#define fort(i, n) for (int i = 1; i <= n; ++i)
#define pi pair<int, int>
#define vi vector<int>
#define pb push_back
#define sz size()
#define er erase
#define fr first
#define sc second
#define rc(x) return cout << x, 0
using namespace std;
ll n, p, d;
ll power(ll a, ll... | insert | 31 | 31 | 31 | 33 | TLE | |
p03194 | C++ | Time Limit Exceeded | #include <iostream>
#include <math.h>
using namespace std;
int main() {
long long int n, p, ans;
cin >> n >> p;
ans = pow((long double)p, 1.0 / (long double)n) + 1;
while (ans > 1) {
long long int num = 1;
long long int x = n;
while (x > 0) {
num *= ans;
x--;
}
if (p % num == 0... | #include <iostream>
#include <math.h>
using namespace std;
int main() {
long long int n, p, ans;
cin >> n >> p;
ans = pow((long double)p, 1.0 / (long double)n) + 1;
while (ans > 1) {
if (p % (long long int)pow((long long int)ans, (long long int)n) == 0) {
break;
} else {
ans--;
}
}
... | replace | 10 | 17 | 10 | 11 | TLE | |
p03194 | C++ | Time Limit Exceeded | #include <cmath>
#include <cstdio>
int main() {
long long int n, k, p = 1, ans = 1;
scanf("%lld %lld", &k, &n);
while (n > 1) {
p++;
if (n % p != 0) {
continue;
}
long long int c = 0;
while (n % p == 0) {
n /= p;
c++;
}
ans *= pow(p, c / k);
}
printf("%lld\n", ans... | #include <cmath>
#include <cstdio>
int main() {
long long int n, k, p = 1, ans = 1;
scanf("%lld %lld", &k, &n);
if (k == 1) {
printf("%lld\n", n);
return 0;
}
while (n > 1 && p <= sqrt(n)) {
p++;
if (n % p != 0) {
continue;
}
long long int c = 0;
while (n % p == 0) {
n ... | replace | 5 | 6 | 5 | 10 | TLE | |
p03194 | C++ | Runtime Error | /*
##############################
# Author: Pratyush Gaurav #
# College: NIT ROURKELA #
##############################
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long lli;
typedef long double ld;
typedef pair<lli, lli> plli;
typedef vector<lli> vlli;
typedef vector<plli> vpl... | /*
##############################
# Author: Pratyush Gaurav #
# College: NIT ROURKELA #
##############################
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long lli;
typedef long double ld;
typedef pair<lli, lli> plli;
typedef vector<lli> vlli;
typedef vector<plli> vpl... | insert | 43 | 43 | 43 | 47 | 0 | |
p03194 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
typedef long long ll;
#define M 1000000007
ll power(ll a, ll n) {
ll ans = 1;
while (0 < n) {
if (n % 2 == 0) {
a *= a;
n >>= 1;
} else {
ans *= a;
n--;
}
}
return ans;
}
int main(void) {
ll n... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
typedef long long ll;
#define M 1000000007
ll power(ll a, ll n) {
ll ans = 1;
while (0 < n) {
if (n % 2 == 0) {
a *= a;
n >>= 1;
} else {
ans *= a;
n--;
}
}
return ans;
}
int main(void) {
ll n... | replace | 24 | 25 | 24 | 28 | TLE | |
p03194 | Python | Time Limit Exceeded | N, P = list(map(int, input().split()))
if N == 1:
print(P)
exit()
elif P == 1:
print("1")
exit()
ans = 1
tmp = P
for i in range(2, P):
po = pow(i, N)
while tmp % po == 0:
tmp = tmp // po
ans = ans * i
# print(i, tmp, ans)
if tmp < po:
break
print(ans)
| N, P = list(map(int, input().split()))
if N == 1:
print(P)
exit()
elif P == 1:
print("1")
exit()
ans = 1
tmp = P
for i in range(2, int(pow(P, 1 / N)) + 1):
po = pow(i, N)
while tmp % po == 0:
tmp = tmp // po
ans = ans * i
# print(i, tmp, ans)
if tmp < po:
b... | replace | 11 | 12 | 11 | 12 | TLE | |
p03194 | Python | Time Limit Exceeded | from collections import Counter
def d(P):
c = Counter()
i = 2
while P > 1:
if P % i == 0:
c.update([i])
P //= i
i -= 1
i += 1
return c
def solve(N, P):
c = d(P)
ans = 1
for k in [k for k, v in c.items() if v >= N]:
ans *= k ** (... | from collections import Counter
def d(P):
c = Counter()
i = 2
while P > 1:
if P % i == 0:
c.update([i])
P //= i
i -= 1
i += 1
if i > P**0.5:
c.update([P])
break
return c
def solve(N, P):
c = d(P)
ans = 1
... | insert | 12 | 12 | 12 | 15 | TLE | |
p03194 | Python | Time Limit Exceeded | n, p = map(int, input().split())
if n == 1:
print(p)
else:
m = 1
while m**n <= p:
m += 1
for i in reversed(range(1, m + 1)):
if p % (i**n) == 0:
print(i)
break
| n, p = map(int, input().split())
if n == 1:
print(p)
else:
m = int((p + 1) ** (1 / n))
while m**n > p:
m -= 1
for i in reversed(range(1, m + 1)):
if p % (i**n) == 0:
print(i)
break
| replace | 5 | 8 | 5 | 8 | TLE | |
p03194 | Python | Time Limit Exceeded | import math
N, P = list(map(int, input().split()))
for i in range(int(math.pow(P, 1 / N)) + 1, 0, -1):
if P % (i**N) == 0:
print(i)
break
| n, p = map(int, input().split())
if n == 1:
print(p)
else:
for i in range(1, round(p ** (1 / n)) + 1):
if p % i**n == 0:
res = i
print(res)
| replace | 0 | 8 | 0 | 8 | TLE | |
p03194 | C++ | Time Limit Exceeded | #include <cmath>
#include <iostream>
#include <stdio.h>
#include <utility>
#include <vector>
using namespace std;
int main() {
unsigned long n, p;
cin >> n >> p;
vector<pair<unsigned long, unsigned long>> factors;
// prime factorize p
for (unsigned long i = 2; i <= p; i++) {
unsigned long j = 0;
for (... | #include <cmath>
#include <iostream>
#include <stdio.h>
#include <utility>
#include <vector>
using namespace std;
int main() {
unsigned long n, p;
cin >> n >> p;
vector<pair<unsigned long, unsigned long>> factors;
// prime factorize p
for (unsigned long i = 2; i <= p; i++) {
unsigned long j = 0;
if (i... | insert | 13 | 13 | 13 | 19 | TLE | |
p03194 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
ll f(ll x, ll res) {
ll ans = 1;
while (x) {
if (x & 1)
ans = ans * res;
res *= res;
x /= 2;
}
return ans;
}
int main() {
ll n, p;
ll ans = 1;
cin >> n >> p;
for (ll i = 2;; i++) {
ll k = f(n, i);
if (p < k)
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
ll f(ll x, ll res) {
ll ans = 1;
while (x) {
if (x & 1)
ans = ans * res;
res *= res;
x /= 2;
}
return ans;
}
int main() {
ll n, p;
ll ans = 1;
cin >> n >> p;
if (n == 1) {
cout << p;
return 0;
}
if (p == 1) ... | insert | 17 | 17 | 17 | 33 | 0 | |
p03194 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxx = 1e6 + 7;
const int Inf = 1 << 30;
const ll INF = 1LL << 60;
#define mst(x) memset(x, 0, sizeof(x))
ll n, p;
ll pr[maxx]; // p的所有因子
map<ll, bool> vis;
ll ans;
int main() {
vis.clear();
cin >> n >> p;
if (n == 1) {
cout << p <... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxx = 1e6 + 7;
const int Inf = 1 << 30;
const ll INF = 1LL << 60;
#define mst(x) memset(x, 0, sizeof(x))
ll n, p;
ll pr[maxx]; // p的所有因子
map<ll, bool> vis;
ll ans;
int main() {
vis.clear();
cin >> n >> p;
if (n == 1) {
cout << p <... | replace | 34 | 44 | 34 | 46 | TLE | |
p03194 | C++ | Time Limit Exceeded | #include <iostream>
#include <math.h>
using namespace std;
int main(void) {
long ans = 0;
long long n = 0, i, N, P;
cin >> N >> P;
for (i = 1; n < P && n >= 0; i++) {
n = powl(i, N);
// cout<<n<<" "<<i<<" "<<P<<" "<<ans<<endl;
if (P % n == 0)
ans = i;
}
cout << ans << endl;
return 0;
} | #include <iostream>
#include <math.h>
using namespace std;
int main(void) {
long ans = 0;
long long n = 0, i, N, P;
cin >> N >> P;
if (N == 1) {
cout << P << endl;
return 0;
}
for (i = 1; n < P && n >= 0; i++) {
n = powl(i, N);
// cout<<n<<" "<<i<<" "<<P<<" "<<ans<<endl;
if (P % n == 0)... | insert | 7 | 7 | 7 | 11 | TLE | |
p03194 | C++ | Time Limit Exceeded | #define ioFix \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
long long madd(long long x, long long y, long long modulo) {
... | #define ioFix \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
long long madd(long long x, long long y, long long modulo) {
... | insert | 108 | 108 | 108 | 114 | TLE | |
p03194 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <unordered_set>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
unordered_multiset<long long int> fact(long long int n) {
unordered_multiset<long long int> ret;
long long int a = 2;
while (n !... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <unordered_set>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
unordered_multiset<long long int> fact(long long int n) {
unordered_multiset<long long int> ret;
long long int a = 2;
while (n !... | replace | 27 | 28 | 27 | 28 | TLE | |
p03194 | C++ | Time Limit Exceeded | #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 (int i = 2; i * i <= p; i++) {
int cnt = 0;
while (p % i == 0) {
cnt++;
p /= i;
}
int tmp = cnt / n;
for (int j... | #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 ... | replace | 10 | 11 | 10 | 11 | TLE | |
p03194 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iostream>
#include <math.h>
#include <set>
#include <string>
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;
for (i = 1; i <= s + 1; i++) {
j... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <math.h>
#include <set>
#include <string>
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 {
... | replace | 14 | 20 | 14 | 25 | TLE | |
p03194 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <queue>
#include <regex>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
int ma... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <queue>
#include <regex>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
int ma... | insert | 23 | 23 | 23 | 27 | TLE | |
p03194 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, num, verysum = 1;
cin >> n >> num;
if (n >= 40) {
cout << 1;
return 0;
}
for (int i = 2; i <= num; i++) {
long long t = num;
while (t % int(pow(i, n)) == 0)
verysum *= i, t /= (pow(i, n));
num = t;
}
cout << ... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, num, verysum = 1;
cin >> n >> num;
if (n >= 40) {
cout << 1;
return 0;
}
if (n == 1) {
cout << num;
return 0;
}
for (int i = 2; pow(i, n) <= num; i++) {
while (num % (long long)(pow(i, n)) == 0)
verysum *= i,... | replace | 9 | 14 | 9 | 16 | TLE | |
p03194 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
long N, P;
cin >> N;
cin >> P;
long zantei = 1;
long temp;
if (N == 1) {
zantei = P;
} else if (P == 1) {
} else {
for (long i = 2; i <= P; i++) {
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
long N, P;
cin >> N;
cin >> P;
long zantei = 1;
long temp;
if (N == 1) {
zantei = P;
} else if (P == 1 || N > 39) {
} else {
for (long i = 2; i <= P; ... | replace | 17 | 18 | 17 | 18 | TLE | |
p03194 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ll N, P, ans = 1;
cin >> N >> P;
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>
#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);
}
| insert | 6 | 6 | 6 | 10 | TLE | |
p03194 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define int long long
#define vec(a, n) vector<int>(a)((n))
#define Vec(a, n) vector<string>(a)((n))
#define P pair<int, int>
#define PQ(n) priority_queue<P, vector<P>, greater<P>>(n)
#define pq... | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define int long long
#define vec(a, n) vector<int>(a)((n))
#define Vec(a, n) vector<string>(a)((n))
#define P pair<int, int>
#define PQ(n) priority_queue<P, vector<P>, greater<P>>(n)
#define pq... | replace | 31 | 34 | 31 | 36 | TLE | |
p03194 | C++ | Time Limit Exceeded | #include <iostream>
#include <map>
using namespace std;
typedef long long int ll;
map<ll, ll> M;
ll N, P, ans = 1;
void disassemble(ll p) {
for (int i = 2; i * i <= p; i++) {
ll cnt = 0;
while (p % i == 0) {
cnt++;
p /= i;
if (cnt == N) {
ans *= i;
cnt = 0;
}
}
... | #include <iostream>
#include <map>
using namespace std;
typedef long long int ll;
map<ll, ll> M;
ll N, P, ans = 1;
void disassemble(ll p) {
for (ll i = 2; i * i <= p; i++) {
ll cnt = 0;
while (p % i == 0) {
cnt++;
p /= i;
if (cnt == N) {
ans *= i;
cnt = 0;
}
}
... | replace | 10 | 11 | 10 | 11 | TLE | |
p03194 | C++ | Time Limit Exceeded | #include <iostream>
#include <map>
using namespace std;
map<long, long> prime_factor(long long n) {
map<long, long> res;
for (int i = 2; i * i <= n; i++) {
while (n % i == 0) {
++res[i];
n /= i;
}
}
if (n != 1)
res[n] = 1;
return res;
}
long long mod_pow(long long x, long long n) {
... | #include <iostream>
#include <map>
using namespace std;
map<long, long> prime_factor(long long n) {
map<long, long> res;
for (long long i = 2; i * i <= n; i++) {
while (n % i == 0) {
++res[i];
n /= i;
}
}
if (n != 1)
res[n] = 1;
return res;
}
long long mod_pow(long long x, long long ... | replace | 6 | 7 | 6 | 7 | TLE | |
p03194 | C++ | Time Limit Exceeded | #include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
#define ll long long int
int main(int argc, const char *argv[]) {
ll N, P;
cin >> N >> P;
if (N == 1) {
cout << P << endl;
return 0;
}
// int max = (int)sqrt(P)+1;
ll max = P / 2;
ll ret = 1;
for (ll divider = 2; divide... | #include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
#define ll long long int
int main(int argc, const char *argv[]) {
ll N, P;
cin >> N >> P;
if (N == 1) {
cout << P << endl;
return 0;
}
ll max = (int)pow(1.0 * P, 1.0 / N);
ll ret = 1;
for (ll divider = 2; divider <= max &... | replace | 13 | 15 | 13 | 14 | TLE | |
p03194 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
long long ans = 1, n, a;
cin >> n >> a;
for (long long i = 2; i <= a; i++) {
if (a % i == 0) {
int cnt = 0;
while (a % i == 0) {
cnt++;
a /= i;
}
cnt /= n;
for (int j = 0; j < cnt; j++)
... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
long long ans = 1, n, a;
cin >> n >> a;
if (n == 1) {
cout << a << endl;
return 0;
}
for (long long i = 2; i <= sqrt(a) + 1; i++) {
if (a % i == 0) {
int cnt = 0;
while (a % i == 0) {
cnt++;
a /= ... | replace | 8 | 9 | 8 | 13 | TLE | |
p03194 | C++ | Time Limit Exceeded | #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 * 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 !... | #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()... | replace | 7 | 8 | 7 | 8 | TLE | |
p03194 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) FOR(i, 0, n)
#define SORT(c) sort((c).begin(), (c).end())
#defin... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) FOR(i, 0, n)
#define SORT(c) sort((c).begin(), (c).end())
#defin... | replace | 33 | 38 | 33 | 43 | TLE | |
p03194 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define ll long long
int main() {
ll N, P;
cin >> N >> P;
ll tmp = 2;
ll cnt;
ll ans = 1;
if (N == 1) {
cout << P;
} e... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define ll long long
int main() {
ll N, P;
cin >> N >> P;
ll tmp = 2;
ll cnt;
ll ans = 1;
if (N == 1) {
cout << P;
} e... | replace | 27 | 28 | 27 | 28 | TLE | |
p03194 | C++ | Time Limit Exceeded | #include <iostream>
#include <map>
using namespace std;
typedef long long ll;
int main() {
ll n, p;
map<ll, ll> yakusuu;
cin >> n >> p;
while (p % 2 == 0) {
yakusuu[2]++;
p /= 2;
}
for (int i = 3; i * i <= p; i += 2) {
while (p % i == 0) {
yakusuu[i]++;
p /= i;
}
}
yakusuu[p... | #include <iostream>
#include <map>
using namespace std;
typedef long long ll;
int main() {
ll n, p;
map<ll, ll> yakusuu;
cin >> n >> p;
while (p % 2 == 0) {
yakusuu[2]++;
p /= 2;
}
for (ll i = 3; i * i <= p; i += 2) {
while (p % i == 0) {
yakusuu[i]++;
p /= i;
}
}
yakusuu[p]... | replace | 13 | 14 | 13 | 14 | TLE | |
p03194 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
const int N = 501;
const int mod = 1e9 + 7;
int main() {
long long n, p;
long long ans = 1;
scanf("%lld %lld", &n, &p);
for (int i = 2; i * i <= p; i++) {
if (p % i)
continue;
int cnt = 0;
while (p % i == 0) {
p /= i;
cnt++;
if (c... | #include <bits/stdc++.h>
using namespace std;
const int N = 501;
const int mod = 1e9 + 7;
int main() {
long long n, p;
long long ans = 1;
scanf("%lld %lld", &n, &p);
for (int i = 2; 1LL * i * i <= p; i++) {
if (p % i)
continue;
int cnt = 0;
while (p % i == 0) {
p /= i;
cnt++;
... | replace | 8 | 9 | 8 | 9 | TLE | |
p03194 | C++ | Runtime Error | /* -*- coding: utf-8 -*-
*
* c.cc: C - Product and GCD
*/
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#in... | /* -*- coding: utf-8 -*-
*
* c.cc: C - Product and GCD
*/
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#in... | insert | 55 | 55 | 55 | 57 | 0 | |
p03194 | C++ | Runtime Error | /*
オーダー
10**6 余裕を持って間に合う
10**7 おそらく間に合う 余裕を持って間に合う
10**8 非常にシンプルな処理でない限り厳しい おそらく間に合う
10**9 非常にシンプルな処理でない限り厳しい
logn :OK
n :10^7
nlogn :10^6
n**2 :10^4
n**3 :300
2**n :20
n! :10
// 各桁の和を計算する関数
int findSumOfDigits(int n) {
int sum = 0;
while (n > 0) { // n が 0 になるまで
sum += n % 10;
n /= 10;
}
return s... | /*
オーダー
10**6 余裕を持って間に合う
10**7 おそらく間に合う 余裕を持って間に合う
10**8 非常にシンプルな処理でない限り厳しい おそらく間に合う
10**9 非常にシンプルな処理でない限り厳しい
logn :OK
n :10^7
nlogn :10^6
n**2 :10^4
n**3 :300
2**n :20
n! :10
// 各桁の和を計算する関数
int findSumOfDigits(int n) {
int sum = 0;
while (n > 0) { // n が 0 になるまで
sum += n % 10;
n /= 10;
}
return s... | insert | 104 | 104 | 104 | 106 | 0 | |
p03195 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
long long n, a;
vector<long long> v;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a;
v.push_back(a);
}
vector<long long>::iterator it = v.begin();
vector<long long>::iterator it_end = v.end();
while... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
long long n, a;
vector<long long> v;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a;
v.push_back(a);
}
vector<long long>::iterator it = v.begin();
vector<long long>::iterator it_end = v.end();
while... | replace | 20 | 21 | 20 | 21 | 1 | |
p03195 | Python | Runtime Error | N = int(input())
a = [int(input()) for _ in range(N)] * [0, 0]
a.sort()
if len(a) >= 2:
res = a[-2]
else:
res = a[-1]
res += sum(a[:-2])
print("second" if res % 2 == 0 else "first")
| N = int(input())
a = [int(input()) % 2 for _ in range(N)]
res = sum(a)
print("first" if res > 0 else "second")
| replace | 1 | 9 | 1 | 4 | TypeError: can't multiply sequence by non-int of type 'list' | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p03195/Python/s025451632.py", line 2, in <module>
a = [int(input()) for _ in range(N)] * [0, 0]
TypeError: can't multiply sequence by non-int of type 'list'
|
p03196 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <iostream>
#include <math.h>
#include <queue>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <utility>
#include <vector>
#define mp make_pair
#define pb push_back
#define pm % 1000000007
#define llc (long long)
#define ldc (long doubl... | #include <algorithm>
#include <bitset>
#include <iostream>
#include <math.h>
#include <queue>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <utility>
#include <vector>
#define mp make_pair
#define pb push_back
#define pm % 1000000007
#define llc (long long)
#define ldc (long doubl... | replace | 33 | 34 | 33 | 34 | TLE | |
p03196 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
#define MAXN 100009
#define INF 1000000007
#define mp(x, y) make_pair(x, y)
#define all(v) v.begin(), v.end()
#define pb(x) push_back(x)
#define wr cout << "----------------" << endl;
#define ppb() pop_back()
#define tr(ii, c) \
for... | #include "bits/stdc++.h"
#define MAXN 100009
#define INF 1000000007
#define mp(x, y) make_pair(x, y)
#define all(v) v.begin(), v.end()
#define pb(x) push_back(x)
#define wr cout << "----------------" << endl;
#define ppb() pop_back()
#define tr(ii, c) \
for... | replace | 39 | 41 | 39 | 41 | TLE | |
p03196 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = ll(1e12);
const ll mod = ll(1e9) + 7;
const double pi = acos(-1);
#define rep0(i, n) for (ll(i) = 0; (i) < (n); ++(i))
#define rrep0(i, n) for (ll(i) = (n)-1; (i) >= 0; --(i))
#define rep1(i, n) for (ll(i) = 1; (i) <= (n); ++(i))
#define... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = ll(1e12);
const ll mod = ll(1e9) + 7;
const double pi = acos(-1);
#define rep0(i, n) for (ll(i) = 0; (i) < (n); ++(i))
#define rrep0(i, n) for (ll(i) = (n)-1; (i) >= 0; --(i))
#define rep1(i, n) for (ll(i) = 1; (i) <= (n); ++(i))
#define... | replace | 73 | 74 | 73 | 74 | TLE | |
p03196 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using i64 = std::int_fast64_t;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
i64 N, P;
cin >> N >> P;
map<i64, int> cnts;
for (int i = 2; i * i < P + 1; i++) {
int cnt = 0;
while (P % i == 0) {
P /= i;
cnt++;
}
if (cnt > 0)
... | #include <bits/stdc++.h>
using namespace std;
using i64 = std::int_fast64_t;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
i64 N, P;
cin >> N >> P;
map<i64, int> cnts;
for (i64 i = 2; i * i < P + 1; i++) {
int cnt = 0;
while (P % i == 0) {
P /= i;
cnt++;
}
if (cnt > 0)
... | replace | 11 | 12 | 11 | 12 | TLE | |
p03196 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e5 + 5;
inline ll read() {
ll x = 0, w = 1;
char ch = 0;
while (ch < '0' || ch > '9') {
ch = getchar();
if (ch == '-')
w = -1;
}
while (ch <= '9' && ch >= '0') {
x = (x << 1) + (x << 3) + ch - '0';
ch = ge... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e5 + 5;
inline ll read() {
ll x = 0, w = 1;
char ch = 0;
while (ch < '0' || ch > '9') {
ch = getchar();
if (ch == '-')
w = -1;
}
while (ch <= '9' && ch >= '0') {
x = (x << 1) + (x << 3) + ch - '0';
ch = ge... | replace | 35 | 36 | 35 | 36 | TLE | |
p03196 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (n); i++)
constexpr int MOD = 1000000007;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
constexpr int dx[] = {1, 0, -1,... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (n); i++)
constexpr int MOD = 1000000007;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
constexpr int dx[] = {1, 0, -1,... | replace | 59 | 69 | 59 | 71 | TLE | |
p03196 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, p, ans;
cin >> n >> p;
if (n == 1) {
cout << p << endl;
return 0;
}
for (ll i = 1; i <= p; i++) {
ll gcd = pow(i, n);
if (p % gcd == 0) {
ans = i;
} else if (gcd > p) {
break;
}
}
cou... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, p, ans;
cin >> n >> p;
if (n == 1) {
cout << p << endl;
return 0;
}
if (n > 40) {
cout << 1 << endl;
return 0;
}
for (ll i = 1; i <= p; i++) {
ll gcd = pow(i, n);
if (p % gcd == 0) {
ans = ... | insert | 8 | 8 | 8 | 12 | TLE | |
p03196 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cassert>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <st... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <st... | replace | 41 | 42 | 41 | 47 | TLE | |
p03196 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int INF = 1e9;
const ll LINF = 1e18;
inline ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
inline ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
template <class S, class T>
ostream &op... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int INF = 1e9;
const ll LINF = 1e18;
inline ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
inline ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
template <class S, class T>
ostream &op... | replace | 60 | 61 | 60 | 61 | TLE | |
p03196 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll N, P;
ll mx = 1;
int main() {
scanf("%lld%lld", &N, &P);
for (int i = 2; i * i <= P; ++i) {
int cnt = 0;
while (!(P % i)) {
cnt++;
if (!(cnt % N))
mx *= i;
P /= i;
}
}
if (N == 1)
mx *= P;
pr... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll N, P;
ll mx = 1;
int main() {
scanf("%lld%lld", &N, &P);
for (ll i = 2; i * i <= P; ++i) {
int cnt = 0;
while (!(P % i)) {
cnt++;
if (!(cnt % N))
mx *= i;
P /= i;
}
}
if (N == 1)
mx *= P;
pri... | replace | 11 | 12 | 11 | 12 | TLE | |
p03196 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
ll mod = 1e9 + 7;
map<ll, ll> prime_factor(ll n) {
map<ll, ll> res;
for (int i = 2; i * i <= n; i++) {
while (n % i == 0) {
res[i]++;
n /= i;
}
}
if (n != 1) {
res[n]++;
}
return res;
}
ll... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
ll mod = 1e9 + 7;
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]++;
}
return res;
}
ll ... | replace | 8 | 9 | 8 | 9 | TLE | |
p03196 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#defin... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#defin... | insert | 64 | 64 | 64 | 66 | TLE | |
p03196 | C++ | Time Limit Exceeded | #include <algorithm>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <utility>
#include <vector>
#include <vector>
#define ss second
#define ff first
#define use_fast ios::sync_with_stdio(false), ci... | #include <algorithm>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <utility>
#include <vector>
#include <vector>
#define ss second
#define ff first
#define use_fast ios::sync_with_stdio(false), ci... | replace | 32 | 33 | 32 | 33 | TLE | |
p03196 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
typedef vector<int> vi;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define rep(i, n) rep2(i, 0, n)
#define rep2(i, m, n) for (int i = m; i < (n); i++)
#define ALL(c... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
typedef vector<int> vi;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define rep(i, n) rep2(i, 0, n)
#define rep2(i, m, n) for (int i = m; i < (n); i++)
#define ALL(c... | replace | 27 | 28 | 27 | 28 | TLE | |
p03196 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, int> pli;
typedef pair<int, ll> pil;
const int maxN = 2e5 + 10;
const int INF = 999999999;
ll n, p;
ll a[maxN];
ll q[maxN];
struct node {
ll x, t;
};
ll tot = 0ll;
ll power(ll x,... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, int> pli;
typedef pair<int, ll> pil;
const int maxN = 2e5 + 10;
const int INF = 999999999;
ll n, p;
ll a[maxN];
ll q[maxN];
struct node {
ll x, t;
};
ll tot = 0ll;
ll power(ll x,... | replace | 41 | 42 | 41 | 42 | 0 | |
p03196 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define ll long long
using namespace std;
ll n, p, cnt = 1;
ll ans, tmp;
int main() {
cin >> n >> p;
if (n == 1) {
cout << p << endl;
return 0;
}
while (1) {
tmp = 1;
for (long long i = 1; i <= n; i++)
tmp *= cnt;
if (tmp > p)
break;
if (p % tmp == 0)... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
ll n, p, cnt = 1;
ll ans, tmp;
int main() {
cin >> n >> p;
if (n >= 50) {
cout << 1 << endl;
return 0;
}
if (n == 1) {
cout << p << endl;
return 0;
}
while (1) {
tmp = 1;
for (long long i = 1; i <= n; i++)
tmp *... | insert | 7 | 7 | 7 | 11 | TLE | |
p03196 | C++ | Time Limit Exceeded | /*** Template Begin ***/
#pragma region template
#define USING_NAMESPACE
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#i... | /*** Template Begin ***/
#pragma region template
#define USING_NAMESPACE
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#i... | replace | 222 | 223 | 222 | 223 | TLE | |
p03196 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
// define
#define int long long
#define UNIQUE(v) v.erase(unique(all(v)), v.end());
#define ZIP(v) sort(all(v)), UNIQUE(v)
#define ADD(a, b) a = (a + b) % mod
#define SUB(a, b) a = (a + mod - b) % mod
#define MUL(a, b) a = (a * b) % mod
#define rollcall cout << "I'm Sucu." ... | #include <bits/stdc++.h>
using namespace std;
// define
#define int long long
#define UNIQUE(v) v.erase(unique(all(v)), v.end());
#define ZIP(v) sort(all(v)), UNIQUE(v)
#define ADD(a, b) a = (a + b) % mod
#define SUB(a, b) a = (a + mod - b) % mod
#define MUL(a, b) a = (a * b) % mod
#define rollcall cout << "I'm Sucu." ... | replace | 103 | 104 | 103 | 104 | TLE | |
p03196 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using Vec = vector<ll>;
#define FOR(i, m, n) for (ll(i) = (m); (i) < (n); (i)++)
#define FORN(i, m, n) for (ll(i) = (m); (i) <= (n); (i)++)
#define FORR(i, m, n) for (ll(i) = (m); (i) >= (n); (i)--)
#define rep(i, n) FOR(i, 0, n... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using Vec = vector<ll>;
#define FOR(i, m, n) for (ll(i) = (m); (i) < (n); (i)++)
#define FORN(i, m, n) for (ll(i) = (m); (i) <= (n); (i)++)
#define FORR(i, m, n) for (ll(i) = (m); (i) >= (n); (i)--)
#define rep(i, n) FOR(i, 0, n... | insert | 34 | 34 | 34 | 37 | TLE | |
p03196 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define mod 1000000007 // 10^9+7
#define INF 1000000000000 // 10^12
#define P pair<int, int>
#define rep(i, n) for (int i = 0; i < n; i++)
int n, p;
int ans = 1, x = 1;
signed main() {
cin >> n >> p;
for (int i = 2; x ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define mod 1000000007 // 10^9+7
#define INF 1000000000000 // 10^12
#define P pair<int, int>
#define rep(i, n) for (int i = 0; i < n; i++)
int n, p;
int ans = 1, x = 1;
signed main() {
cin >> n >> p;
if (n == 1) {
... | insert | 12 | 12 | 12 | 16 | TLE | |
p03196 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N, P;
cin >> N >> P;
long long r = 1;
if (N == 1) {
r = P;
} else {
for (int i = 2; i * i <= P; ++i) {
int c = 0;
while (P % i == 0) {
++c;
P /= i;
}
for (int j = 0; j < c / N; ++j)
r *... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N, P;
cin >> N >> P;
long long r = 1;
if (N == 1) {
r = P;
} else {
for (long long i = 2; i * i <= P; ++i) {
int c = 0;
while (P % i == 0) {
++c;
P /= i;
}
for (int j = 0; j < c / N; ++j)
... | replace | 9 | 10 | 9 | 10 | TLE | |
p03196 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define int long long
#define ggr ... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define int long long
#define ggr ... | replace | 136 | 141 | 136 | 139 | TLE | |
p03196 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
ll n, p;
cin >> n >> p;
vector<ll> div;
for (ll i = 1; ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
ll n, p;
cin >> n >> p;
vector<ll> div;
for (ll i = 1; ... | replace | 31 | 35 | 31 | 38 | 0 | |
p03196 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define _repargs(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#defi... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define _repargs(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#defi... | insert | 49 | 49 | 49 | 53 | TLE | |
p03196 | C++ | Time Limit Exceeded | #ifndef BZ
#pragma GCC optimize "-O3"
#endif
#include <bits/stdc++.h>
#define FASTIO
#define ALL(v) (v).begin(), (v).end()
#define rep(i, l, r) for (int i = (l); i < (r); ++i)
#ifdef FASTIO
#define scanf abacaba
#define printf abacaba
#endif
typedef long long ll;
typedef long double ld;
typedef unsigned long long ul... | #ifndef BZ
#pragma GCC optimize "-O3"
#endif
#include <bits/stdc++.h>
#define FASTIO
#define ALL(v) (v).begin(), (v).end()
#define rep(i, l, r) for (int i = (l); i < (r); ++i)
#ifdef FASTIO
#define scanf abacaba
#define printf abacaba
#endif
typedef long long ll;
typedef long double ld;
typedef unsigned long long ul... | replace | 37 | 38 | 37 | 38 | TLE | |
p03196 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
u... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
u... | replace | 25 | 26 | 25 | 26 | TLE | |
p03196 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
ll mm = 1000000000;
ll MM = mm + 7;
#define rep(i, n) for (int i = 0; i < n; i++)
#define PI 3.141592653589793
int main() {
ll n, p;
cin >> n >> p;
if (n == 1)
cout << p << endl;
else {
ll i = 0;
ll ans;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
ll mm = 1000000000;
ll MM = mm + 7;
#define rep(i, n) for (int i = 0; i < n; i++)
#define PI 3.141592653589793
int main() {
ll n, p;
cin >> n >> p;
if (n == 1)
cout << p << endl;
else if (n >= 50)
cout << 1 << ... | insert | 15 | 15 | 15 | 17 | TLE | |
p03196 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using lint = long long;
vector<long long> d;
int main(void) {
lint n;
cin >> n;
long long p;
cin >> p;
if (n == 1) {
cout << p << endl;
return 0;
}
for (int i = 2; i * i <= p; i++) {
while (p % i == 0) {
d.push_back(i);
p /= i;
}
... | #include <bits/stdc++.h>
using namespace std;
using lint = long long;
vector<long long> d;
int main(void) {
lint n;
cin >> n;
long long p;
cin >> p;
if (n == 1) {
cout << p << endl;
return 0;
}
for (long long i = 2; i * i <= p; i++) {
while (p % i == 0) {
d.push_back(i);
p /= i;
... | replace | 13 | 14 | 13 | 14 | TLE | |
p03196 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, p, ans = 1;
cin >> n >> p;
if (n == 1) {
cout << p << endl;
return 0;
}
for (int i = 2; i * i <= p; i++) {
if (p % i != 0)
continue;
ll num = 0;
while (p % i == 0) {
p /= i;
num++;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, p, ans = 1;
cin >> n >> p;
if (n == 1) {
cout << p << endl;
return 0;
}
for (ll i = 2; i * i <= p; i++) {
ll num = 0;
while (p % i == 0) {
p /= i;
num++;
if (num == n) {
ans *= i;... | replace | 12 | 15 | 12 | 13 | TLE | |
p03196 | C++ | Time Limit Exceeded |
#include <bits/stdc++.h>
#define x first
#define y second
#define mp make_pair
// everything goes according to my plan
#define pb push_back
#define sz(a) (int)(a.size())
#define vec vector
// shimkenttin kyzdary, dzyn, dzyn, dzyn...
#define y1 Y_U_NO_y1
#define left Y_U_NO_left
#define right Y_U_NO_right
#ifdef Loca... |
#include <bits/stdc++.h>
#define x first
#define y second
#define mp make_pair
// everything goes according to my plan
#define pb push_back
#define sz(a) (int)(a.size())
#define vec vector
// shimkenttin kyzdary, dzyn, dzyn, dzyn...
#define y1 Y_U_NO_y1
#define left Y_U_NO_left
#define right Y_U_NO_right
#ifdef Loca... | replace | 71 | 72 | 71 | 72 | TLE | |
p03196 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, p;
cin >> n >> p;
ll r = 1;
if (n < 40) {
for (int i = 1; i <= p; i++) {
ll x = pow(i, n);
if (x > p) {
break;
}
if (p % x == 0) {
r = i;
}
}
}
cout << r << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, p;
cin >> n >> p;
ll r = 1;
if (n == 1) {
r = p;
} else if (n < 40) {
for (int i = 1; i <= p; i++) {
ll x = pow(i, n);
if (x > p) {
break;
}
if (p % x == 0) {
r = i;
}
... | replace | 8 | 9 | 8 | 11 | TLE | |
p03196 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll qpow(ll a, ll n) {
ll ret = 1;
while (n) {
if (n & 1)
ret = ret * a;
a = a * a;
n >>= 1;
if (ret > 1e12)
return LLONG_MAX;
}
return ret;
}
int main() {
ll n, p;
cin >> n >> p;
if (n > 40) {
puts("1");
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll qpow(ll a, ll n) {
ll ret = 1;
while (n) {
if (n & 1)
ret = ret * a;
a = a * a;
n >>= 1;
if (ret > 1e12)
return LLONG_MAX;
}
return ret;
}
int main() {
ll n, p;
cin >> n >> p;
if (n > 40) {
puts("1");
... | replace | 51 | 53 | 51 | 54 | 0 | |
p03196 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repr(i, a, n) for (int i = n - 1; i >= a; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chmax(T &a, T b) { a = max(a, b)... | #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repr(i, a, n) for (int i = n - 1; i >= a; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chmax(T &a, T b) { a = max(a, b)... | insert | 30 | 30 | 30 | 39 | 0 | |
p03196 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cstdint>
#include <cstdio>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#in... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cstdint>
#include <cstdio>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#in... | replace | 116 | 117 | 116 | 121 | TLE | |
p03196 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int cot = 0;
ll n, p, a[10000005];
bool judge(ll m) {
ll ans = 1;
ll t = n;
while (t) {
if (m > p)
return false;
if (t & 1)
ans *= m;
if (ans > p || p % ans)
return false;
if (m > 1e10 && (t >> 1))
return fa... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int cot = 0;
ll n, p, a[10000005];
bool judge(ll m) {
ll ans = 1;
ll t = n;
while (t) {
if (m > p)
return false;
if (t & 1)
ans *= m;
if (ans > p || p % ans)
return false;
if (m > 1e8 && (t >> 1))
return fal... | replace | 15 | 16 | 15 | 16 | 0 | |
p03196 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll unsigned long long
using namespace std;
ll i, j, k, n, m, p, ans = 1;
ll Pow(ll n, ll m) {
ll ans = 1;
while (m > 1) {
if (m % 2 == 0) {
m /= 2;
n = n * n;
} else {
ans = ans * n;
m /= 2;
n = n * n;
}
}
return n * ans;
}
int main() {
... | #include <bits/stdc++.h>
#define ll unsigned long long
using namespace std;
ll i, j, k, n, m, p, ans = 1;
ll Pow(ll n, ll m) {
ll ans = 1;
while (m > 1) {
if (m % 2 == 0) {
m /= 2;
n = n * n;
} else {
ans = ans * n;
m /= 2;
n = n * n;
}
}
return n * ans;
}
int main() {
... | replace | 31 | 32 | 31 | 32 | 0 | |
p03196 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i =... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i =... | insert | 56 | 56 | 56 | 57 | TLE | |
p03196 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
using namesp... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
using namesp... | insert | 44 | 44 | 44 | 48 | TLE | |
p03196 | C++ | Time Limit Exceeded | /**
* author: souzai32
* created: 12.08.2020 12:16:11
**/
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
long long n, p;
cin >> n >> p;
long long gcd = 1, num, i = 2;
int count = 0;
if (n == 1)
gcd = p;
else {
while (1) {... | /**
* author: souzai32
* created: 12.08.2020 12:16:11
**/
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
long long n, p;
cin >> n >> p;
long long gcd = 1, num, i = 2;
int count = 0;
if (n == 1)
gcd = p;
else if (n >= 40)
... | insert | 18 | 18 | 18 | 20 | TLE | |
p03196 | C++ | Time Limit Exceeded |
#include <bits/stdc++.h>
// macros
using namespace std;
typedef long long ll;
typedef pair<int, int> Pii;
typedef pair<ll, ll> Pll;
typedef vector<int> Vi;
typedef vector<ll> Vll;
#define pb push_back
#define rs resize
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define repll(i, a, b) for (ll i = (a); i < (b... |
#include <bits/stdc++.h>
// macros
using namespace std;
typedef long long ll;
typedef pair<int, int> Pii;
typedef pair<ll, ll> Pll;
typedef vector<int> Vi;
typedef vector<ll> Vll;
#define pb push_back
#define rs resize
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define repll(i, a, b) for (ll i = (a); i < (b... | replace | 27 | 28 | 27 | 28 | TLE | |
p03196 | C++ | Time Limit Exceeded | // HTTF.cpp : このファイルには 'main'
// 関数が含まれています。プログラム実行の開始と終了がそこで行われます。
//
#include "bits/stdc++.h"
// 実装が重そうな問題はある程度考えてから書く
// 初期化を忘れずに（特に二分探索とか）
// コーナーケースを考えて（特に場合分けとか）
// 不可解すぎるバグは配列外参照（配列の長さ）を検討
#define YES "YES"
#define NO "NO"
#define YESNO OUT(three(solve(), YES, NO))
#define ECHO OUT(solve())
#define three(A, B,... | // HTTF.cpp : このファイルには 'main'
// 関数が含まれています。プログラム実行の開始と終了がそこで行われます。
//
#include "bits/stdc++.h"
// 実装が重そうな問題はある程度考えてから書く
// 初期化を忘れずに（特に二分探索とか）
// コーナーケースを考えて（特に場合分けとか）
// 不可解すぎるバグは配列外参照（配列の長さ）を検討
#define YES "YES"
#define NO "NO"
#define YESNO OUT(three(solve(), YES, NO))
#define ECHO OUT(solve())
#define three(A, B,... | replace | 95 | 96 | 95 | 96 | TLE | |
p03196 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, p, ans = 1;
scanf("%lld%lld", &n, &p);
if (n == 1)
printf("%lld\n", p);
else {
for (int i = 2; i * i <= p; i += 2) {
int j = 0;
for (; p % i == 0; p /= i, j++)
;
for (int k = 0; k < (j / n); k++)
a... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, p, ans = 1;
scanf("%lld%lld", &n, &p);
if (n == 1)
printf("%lld\n", p);
else {
for (long long i = 2; i * i <= p; i += 2) {
int j = 0;
for (; p % i == 0; p /= i, j++)
;
for (int k = 0; k < (j / n); k++)
... | replace | 9 | 10 | 9 | 10 | TLE | |
p03196 | C++ | Time Limit Exceeded | // #include <bits/stdc++.h>
// #include <stdio.h>
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>... | // #include <bits/stdc++.h>
// #include <stdio.h>
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>... | replace | 60 | 61 | 60 | 61 | TLE | |
p03196 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(a, b) for (int a = 0; a < (b); ++a)
#define REP1(i, n) for (int i = 1; i <= (n); ++i)
#define debug(x) cerr << #x << ": " << x << '\n'
#define all(x) (x).begin(), (x).end()
#defi... | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(a, b) for (int a = 0; a < (b); ++a)
#define REP1(i, n) for (int i = 1; i <= (n); ++i)
#define debug(x) cerr << #x << ": " << x << '\n'
#define all(x) (x).begin(), (x).end()
#defi... | insert | 218 | 218 | 218 | 220 | 0 | |
p03196 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rng(i, a, b) for (int i = int(a); i < int(b); i++)
#define rep(i, b) rng(i, 0, b)
#define gnr(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define per(i, b) gnr(i, 0, b)
#define bg begin()
#define ed end()
#define all(x) x.bg, x.ed
#defi... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rng(i, a, b) for (int i = int(a); i < int(b); i++)
#define rep(i, b) rng(i, 0, b)
#define gnr(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define per(i, b) gnr(i, 0, b)
#define bg begin()
#define ed end()
#define all(x) x.bg, x.ed
#defi... | replace | 40 | 41 | 40 | 41 | TLE | |
p03196 | C++ | Time Limit Exceeded | #include <iostream>
#include <stdio.h>
#include <string.h>
using namespace std;
long long n, p, ans;
int main() {
scanf("%lld%lld", &n, &p);
long long ans = 1;
for (int i = 2; i * i <= p; i++) {
int tot = 0;
while (p % i == 0) {
tot++;
if (tot == n)
tot = 0, ans *= i;
p /= i;
... | #include <iostream>
#include <stdio.h>
#include <string.h>
using namespace std;
long long n, p, ans;
int main() {
scanf("%lld%lld", &n, &p);
long long ans = 1;
for (long long i = 2; i * i <= p; i++) {
int tot = 0;
while (p % i == 0) {
tot++;
if (tot == n)
tot = 0, ans *= i;
p /= ... | replace | 8 | 9 | 8 | 9 | TLE | |
p03196 | C++ | Time Limit Exceeded | #pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC optimize(3)
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC target("sse3", "sse2", "sse")
#pragma GCC target("avx", "sse4", "sse4.1", "sse4.2", "ssse3")
#pragma GCC target("f16c")
#pragma GCC ... | #pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC optimize(3)
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC target("sse3", "sse2", "sse")
#pragma GCC target("avx", "sse4", "sse4.1", "sse4.2", "ssse3")
#pragma GCC target("f16c")
#pragma GCC ... | replace | 134 | 138 | 134 | 138 | TLE | |
p03196 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n, p;
cin >> n >> p;
vector<ll> num(1001000, 0);
if (n == 1) {
cout << p << endl;
return 0;
}
if (p == 1) {
cout << 1 << endl;
return 0;
}
ll ans = 1;
if (p % 2 == 0) {
while (p % 2 == 0) {
p... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n, p;
cin >> n >> p;
vector<ll> num(1001000, 0);
if (n == 1) {
cout << p << endl;
return 0;
}
if (p == 1) {
cout << 1 << endl;
return 0;
}
ll ans = 1;
if (p % 2 == 0) {
while (p % 2 == 0) {
p... | replace | 25 | 27 | 25 | 27 | 0 | |
p03196 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cctype>
#include <cstdio>
#include <cstring>
#include <queue>
using namespace std;
inline char gc() {
// static char buf[100000],*p1,*p2;
// return
//p1==p2&&(p2=(p1=buf)+fread(buf,1,100000,stdin)),p1==p2)?EOF:*p1++;
return getchar();
}
template <class T> int read(T &ans) {
an... | #include <algorithm>
#include <cctype>
#include <cstdio>
#include <cstring>
#include <queue>
using namespace std;
inline char gc() {
// static char buf[100000],*p1,*p2;
// return
//p1==p2&&(p2=(p1=buf)+fread(buf,1,100000,stdin)),p1==p2)?EOF:*p1++;
return getchar();
}
template <class T> int read(T &ans) {
an... | replace | 38 | 39 | 38 | 39 | TLE | |
p03196 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
using vl = vector<ll>;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define all(i) i.begin(), i.end()
template <class T, class U> bool cmax(T &a, U b) {
if (a < b) {
a = b;
return true;
} ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
using vl = vector<ll>;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define all(i) i.begin(), i.end()
template <class T, class U> bool cmax(T &a, U b) {
if (a < b) {
a = b;
return true;
} ... | replace | 31 | 32 | 31 | 32 | TLE | |
p03196 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define int long long
map<int, int> prime_factor(int n) {
map<int, int> ret;
for (int i = 2; i * i <= n; i++) {
while (n % i == 0) {
ret[i]++;
n /= i;
}
}
if (n != 1)
ret[n] = 1;
return ret;
}
signed main() {
cin.tie(0);
ios_base::sy... | #include <bits/stdc++.h>
using namespace std;
#define int long long
map<int, int> prime_factor(int n) {
map<int, int> ret;
for (int i = 2; i * i <= n; i++) {
while (n % i == 0) {
ret[i]++;
n /= i;
}
}
if (n != 1)
ret[n] = 1;
return ret;
}
signed main() {
cin.tie(0);
ios_base::sy... | replace | 30 | 31 | 30 | 32 | TLE | |
p03196 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
... | replace | 63 | 64 | 63 | 64 | TLE | |
p03196 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N, P;
cin >> N >> P;
long long ans = 1;
for (int i = 2; i * i <= P; i++) {
if (P % i == 0) {
int cnt = 0;
while (P % i == 0) {
P /= i;
cnt++;
}
for (int j = 0; j < cnt / N; j++) {
ans *= i;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N, P;
cin >> N >> P;
long long ans = 1;
for (long long i = 2; i * i <= P; i++) {
if (P % i == 0) {
int cnt = 0;
while (P % i == 0) {
P /= i;
cnt++;
}
for (int j = 0; j < cnt / N; j++) {
ans *... | replace | 6 | 7 | 6 | 7 | TLE | |
p03196 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef pair<ll, ll> p;
ll Mod = 1000000007;
vector<p> pri(ll n) {
vector<p> Pr;
for (int i = 2; i * i <= n; i++) {
int cnt = 0;
while (n % i == 0) {
cnt++;
n /= i;
}
if (cnt != 0) {
Pr.push_back(make_pair(i, cnt)... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef pair<ll, ll> p;
ll Mod = 1000000007;
vector<p> pri(ll n) {
vector<p> Pr;
for (ll i = 2; i * i <= n; i++) {
int cnt = 0;
while (n % i == 0) {
cnt++;
n /= i;
}
if (cnt != 0) {
Pr.push_back(make_pair(i, cnt))... | replace | 8 | 9 | 8 | 9 | TLE | |
p03196 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N, P;
cin >> N >> P;
map<int64_t, int64_t> M;
int64_t X = P;
for (int i = 2; i * i <= P && i <= X; i++) {
if (X % i == 0) {
int64_t a = 0;
while (X % i == 0) {
X /= i;
a++;
}
a /= N;
M[i] = a;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N, P;
cin >> N >> P;
map<int64_t, int64_t> M;
int64_t X = P;
for (int64_t i = 2; i * i <= P && i <= X; i++) {
if (X % i == 0) {
int64_t a = 0;
while (X % i == 0) {
X /= i;
a++;
}
a /= N;
M[i] =... | replace | 7 | 8 | 7 | 8 | TLE | |
p03196 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define _GLIBCXX_DEBUG
using namespace std;
typedef long long ll;
// cd test ; rm -R ./*; cd ..
int main(void) {
ll n, p;
cin >> n >> p;
ll ans = 1;
if (n == 1) {
cout << p << endl;
return 0;
}
for (int i = 2; i * i <=... | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define _GLIBCXX_DEBUG
using namespace std;
typedef long long ll;
// cd test ; rm -R ./*; cd ..
int main(void) {
ll n, p;
cin >> n >> p;
ll ans = 1;
if (n == 1) {
cout << p << endl;
return 0;
}
for (ll i = 2; i * i <= ... | replace | 18 | 19 | 18 | 19 | TLE | |
p03196 | C++ | Runtime Error | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <stack>
using namespace std;
long long mpow(long long a, long long b) {
long long cur = a;
long long ans = 1;
for (;;) {
if (b == 0)
return ans;
if (b & 1) {
ans = a... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <stack>
using namespace std;
long long mpow(long long a, long long b) {
long long cur = a;
long long ans = 1;
for (;;) {
if (b == 0)
return ans;
if (b & 1) {
ans = a... | insert | 29 | 29 | 29 | 33 | 0 | |
p03196 | C++ | Time Limit Exceeded | #include <cmath>
#include <iostream>
using namespace std;
typedef long long ll;
int main() {
ll n, m;
cin >> n >> m;
ll ans = 1;
if (n == 1) {
cout << m << endl;
} else {
for (int i = 2; i * i <= m; i++) {
int count = 0;
ll k = m;
while (k % i == 0 && count < n) {
k /= i;
... | #include <cmath>
#include <iostream>
using namespace std;
typedef long long ll;
int main() {
ll n, m;
cin >> n >> m;
ll ans = 1;
if (n == 1) {
cout << m << endl;
} else {
for (ll i = 2; i * i <= m; i++) {
int count = 0;
ll k = m;
while (k % i == 0 && count < n) {
k /= i;
... | replace | 13 | 14 | 13 | 14 | TLE | |
p03196 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
long long MOD = 1000000000 + 7;
template <typename T> map<T, ll> prime_factorize(T x) {
map<T, ll> res;
for (int i = 2; i * i <= x; i++) {
while (x % i == 0) {
x /= i;
res[i]++;
}
}
if (x != 1)... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
long long MOD = 1000000000 + 7;
template <typename T> map<T, ll> prime_factorize(T x) {
map<T, ll> res;
while (x % 2 == 0) {
x /= 2;
res[2]++;
}
for (ll i = 3; i * i <= x; i += 2) {
while (x % i == 0... | replace | 10 | 11 | 10 | 17 | TLE |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.