problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k | fixed_code stringlengths 12 526k | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M | fixed_submission_id int64 2 1.54M | user_id stringlengths 10 10 | language stringclasses 8
values |
|---|---|---|---|---|---|---|---|
p03194 | #include <bits/stdc++.h>
using namespace std;
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <time.h>
#include <vector>
int main() {
double 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 =... | #include <bits/stdc++.h>
using namespace std;
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <time.h>
#include <vector>
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... | [
"variable_declaration.type.primitive.change"
] | 991,767 | 991,768 | u499729664 | cpp |
p03194 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
bool isPrime(int n) {
if (n < 2)
return false;
else if (n == 2)
return true;
else if (n % 2 == 0)
return false;
else {
for (int i = 3; i * i < n; i += 2) {
if (n % i == 0)
return false;
}
return true;
}
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
bool isPrime(int n) {
if (n < 2)
return false;
else if (n == 2)
return true;
else if (n % 2 == 0)
return false;
else {
for (int i = 3; i * i < n; i += 2) {
if (n % i == 0)
return false;
}
return true;
}
... | [
"variable_declaration.type.change"
] | 991,817 | 991,818 | u762955009 | cpp |
p03194 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
int main() {
long long n, p;
cin >> n >> p;
long long ans = 1;
if (n == 1) {
cout << p << endl;
return 0;
}
long long i;
long long cnt = 0;
for (i = 2; i * i <= ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
int main() {
long long n, p;
cin >> n >> p;
long long ans = 1;
if (n == 1) {
cout << p << endl;
return 0;
}
long long i;
long long cnt = 0;
for (i = 2; i * i <= ... | [
"assignment.add"
] | 991,827 | 991,828 | u446795710 | cpp |
p03194 | #define _USE_MATH_DEFINES // M_PI等のフラグ
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <string>
#include <vector>
#define MOD 1000000007
#define COUNTOF(array) (sizeof(array) / sizeof(array[0]))
using namespace std;
string replace_with_str(string str, string str_... | #define _USE_MATH_DEFINES // M_PI等のフラグ
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <string>
#include <vector>
#define MOD 1000000007
#define COUNTOF(array) (sizeof(array) / sizeof(array[0]))
using namespace std;
string replace_with_str(string str, string str_... | [
"expression.operation.binary.remove"
] | 991,838 | 991,839 | u687044304 | cpp |
p03194 | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
typedef long long int ll;
ll cnt = 0;
bool is_prime(int n) {
if (n == 1)
return false; // 1 は素数ではない。
for (int i = 2; i * i <= n; ++i) { // 2 <= i <= sqrt(n) に約数があれば、
if (n % i == 0)
re... | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
typedef long long int ll;
ll cnt = 0;
bool is_prime(ll n) {
if (n == 1)
return false; // 1 は素数ではない。
for (ll i = 2; i * i <= n; ++i) { // 2 <= i <= sqrt(n) に約数があれば、
if (n % i == 0)
retur... | [
"control_flow.loop.for.initializer.change",
"variable_declaration.type.change"
] | 991,840 | 991,841 | u082673785 | cpp |
p03194 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
ll power(ll a, ll b) {
int res = 1;
for (int i = 1; i <= b; i++)
res *= a;
return res;
}
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 <... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
ll power(ll a, ll b) {
ll res = 1;
for (ll i = 1; i <= b; i++)
res *= a;
return res;
}
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 <= ... | [
"variable_declaration.type.change",
"control_flow.loop.for.initializer.change"
] | 991,843 | 991,844 | u788544244 | cpp |
p03194 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
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 *= ... | #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) {
... | [
"variable_declaration.type.widen.change"
] | 991,856 | 991,857 | u369212307 | cpp |
p03194 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
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);... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
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);... | [] | 991,863 | 991,864 | u658130751 | cpp |
p03194 | #include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
long long a, b, ans;
long long check(long long x) {
long long now = 1;
for (int i = 1; i <= a; i++) {
now *= x;
if (now > b)
return 0;
}
return (b % now) + 1;
}
int main() {
cin >> a >> b;
if (a == 1) {
cout <<... | #include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
long long a, b, ans;
long long check(long long x) {
long long now = 1;
for (int i = 1; i <= a; i++) {
now *= x;
if (now > b)
return 0;
}
return (b % now) + 1;
}
int main() {
cin >> a >> b;
if (a == 1) {
cout <<... | [
"assignment.add"
] | 991,871 | 991,872 | u409052964 | cpp |
p03194 | #include <iostream>
using namespace std;
long solve(long n, long p) {
if (n == 1) {
return p;
}
long res = 1, count = 0;
for (long i = 2; i * i <= p; i++) {
while (p % i == 0) {
count++;
p /= i;
if (count > n) {
res *= i;
count = 0;
}
}
count = 0;
}
r... | #include <iostream>
using namespace std;
long solve(long n, long p) {
if (n == 1) {
return p;
}
long res = 1, count = 0;
for (long i = 2; i * i <= p; i++) {
while (p % i == 0) {
count++;
p /= i;
if (count >= n) {
res *= i;
count = 0;
}
}
count = 0;
}
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 991,873 | 991,874 | u467763786 | cpp |
p03194 | #include <iostream>
using namespace std;
long solve(long n, long p) {
if (n == 1) {
return p;
}
long res = 1, count = 0;
for (long i = 2; i * i <= p; i++) {
while (p % i == 0) {
count++;
p /= i;
if (count > n) {
res *= i;
count = 0;
}
}
count = 0;
}
r... | #include <iostream>
using namespace std;
long solve(long n, long p) {
if (n == 1) {
return p;
}
long res = 1, count = 0;
for (long i = 2; i * i <= p; i++) {
while (p % i == 0) {
count++;
p /= i;
if (count >= n) {
res *= i;
count = 0;
}
}
count = 0;
}
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"variable_declaration.type.narrow.change"
] | 991,875 | 991,874 | u467763786 | cpp |
p03194 | #include "algorithm"
#include "iostream"
#include "math.h"
#include "string"
#include "vector"
using namespace std;
typedef long long ll;
ll power_int(ll a, int b) {
ll x = 1;
while (b > 0) {
x *= a;
b--;
}
return x;
}
vector<int> decompPrimeMatrix(ll n) {
const int SIZE = 1234567; //ここは変える
vecto... | #include "algorithm"
#include "iostream"
#include "math.h"
#include "string"
#include "vector"
using namespace std;
typedef long long ll;
ll power_int(ll a, int b) {
ll x = 1;
while (b > 0) {
x *= a;
b--;
}
return x;
}
vector<int> decompPrimeMatrix(ll n) {
const int SIZE = 1000010; //ここは変える
vecto... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.branch.if.condition.change"
] | 991,876 | 991,877 | u346193734 | cpp |
p03194 | #include "algorithm"
#include "iostream"
#include "math.h"
#include "string"
#include "vector"
using namespace std;
typedef long long ll;
ll power_int(ll a, int b) {
ll x = 1;
while (b > 0) {
x *= a;
b--;
}
return x;
}
vector<int> decompPrimeMatrix(ll n) {
const int SIZE = 1234567; //ここは変える
vecto... | #include "algorithm"
#include "iostream"
#include "math.h"
#include "string"
#include "vector"
using namespace std;
typedef long long ll;
ll power_int(ll a, int b) {
ll x = 1;
while (b > 0) {
x *= a;
b--;
}
return x;
}
vector<int> decompPrimeMatrix(ll n) {
const int SIZE = 1234567; //ここは変える
vecto... | [] | 991,876 | 991,878 | u346193734 | cpp |
p03194 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
int main() {
ll N, P;
cin >> N >> P;
if (N == 1) {
cout << P << endl;
return 0;
}
if (N > sqrt(P)) {
cout << 1 << endl;
return 0;
}
ll ans = 1;
for (int i = 2; i <= sqrt(P); ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
int main() {
ll N, P;
cin >> N >> P;
if (N == 1) {
cout << P << endl;
return 0;
}
if (N > sqrt(P)) {
cout << 1 << endl;
return 0;
}
ll ans = 1;
for (int i = 2; i <= sqrt(P); ... | [
"expression.operator.change"
] | 991,879 | 991,880 | u756388720 | cpp |
p03194 | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(0)
#define pb push_back
//#define mp make_pair
#define ff first
#define ss second
#define debug(x) cou... | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(0)
#define pb push_back
//#define mp make_pair
#define ff first
#define ss second
#define debug(x) cou... | [
"assignment.value.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 991,883 | 991,884 | u496698613 | cpp |
p03194 | #include <bits/stdc++.h>
using namespace std;
#define uint unsigned int
#define llong long long int
#define ullong unsigned long long int
#define rep(i, n) \
for (int i = 0; i < n; ++i) \
;
map<llong, ll... | #include <bits/stdc++.h>
using namespace std;
#define uint unsigned int
#define llong long long int
#define ullong unsigned long long int
#define rep(i, n) \
for (int i = 0; i < n; ++i) \
;
map<llong, ll... | [
"variable_declaration.type.change"
] | 991,885 | 991,886 | u943004959 | cpp |
p03194 | #include <bits/stdc++.h>
using namespace std;
#define uint unsigned int
#define llong long long int
#define ullong unsigned long long int
#define rep(i, n) \
for (int i = 0; i < n; ++i) \
;
map<llong, ll... | #include <bits/stdc++.h>
using namespace std;
#define uint unsigned int
#define llong long long int
#define ullong unsigned long long int
#define rep(i, n) \
for (int i = 0; i < n; ++i) \
;
map<llong, ll... | [
"variable_declaration.type.change",
"assignment.change"
] | 991,887 | 991,886 | u943004959 | cpp |
p03194 | #include <algorithm>
#include <functional>
#include <iostream>
#include <math.h>
#include <string>
using namespace std;
long long power(long long a, long long n) {
long long ans = 1;
while (0 < n) {
if (n % 2 == 0) {
a *= a;
n >>= 1;
} else {
ans *= a;
n--;
}
}
return ans;
}... | #include <algorithm>
#include <functional>
#include <iostream>
#include <math.h>
#include <string>
using namespace std;
long long power(long long a, long long n) {
long long ans = 1;
while (0 < n) {
if (n % 2 == 0) {
a *= a;
n >>= 1;
} else {
ans *= a;
n--;
}
}
return ans;
}... | [
"identifier.replace.add",
"literal.replace.remove",
"io.output.change",
"identifier.change",
"call.function.change",
"control_flow.branch.if.condition.change"
] | 991,891 | 991,892 | u861401695 | cpp |
p03194 | #include <algorithm>
#include <functional>
#include <iostream>
#include <math.h>
#include <string>
using namespace std;
long long power(long long a, long long n) {
long long ans = 1;
while (0 < n) {
if (n % 2 == 0) {
a *= a;
n >>= 1;
} else {
ans *= a;
n--;
}
}
return ans;
}... | #include <algorithm>
#include <functional>
#include <iostream>
#include <math.h>
#include <string>
using namespace std;
long long power(long long a, long long n) {
long long ans = 1;
while (0 < n) {
if (n % 2 == 0) {
a *= a;
n >>= 1;
} else {
ans *= a;
n--;
}
}
return ans;
}... | [
"identifier.replace.add",
"literal.replace.remove",
"io.output.change"
] | 991,893 | 991,892 | u861401695 | cpp |
p03194 | #include <math.h>
#include <stdio.h>
int main(void) {
long long int N, P, Q, p, k, ans;
scanf("%lld%lld", &N, &P);
if (N == 1) {
printf("%lld\n", P);
return 0;
}
if (N >= 40)
printf("%lld\n", 1);
return 0;
ans = 1;
p = 2;
while (1) {
Q = pow(p, N);
if (P < Q) {
break;
... | #include <math.h>
#include <stdio.h>
int main(void) {
long long int N, P, Q, p, k, ans;
scanf("%lld%lld", &N, &P);
if (N == 1) {
printf("%lld\n", P);
return 0;
} else if (N >= 40) {
printf("%lld\n", 1);
return 0;
}
ans = 1;
p = 2;
while (1) {
Q = pow(p, N);
if (P < Q) {
... | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 991,930 | 991,931 | u757738907 | cpp |
p03194 | #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, ans;
cin >> n >> p;
if (n == 1) {
... | #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, ans = 1;
cin >> n >> p;
if (n == 1... | [
"variable_declaration.value.change"
] | 991,958 | 991,959 | u038027079 | cpp |
p03194 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (ll(i) = (0); (i) < (n); ++i)
#define PB push_back
#define MP make_pair
#define FI first
#define SE second
#define ... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (ll(i) = (0); (i) < (n); ++i)
#define PB push_back
#define MP make_pair
#define FI first
#define SE second
#define ... | [
"expression.operation.binary.remove"
] | 991,969 | 991,970 | u973997867 | cpp |
p03194 | #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... | [] | 991,983 | 991,984 | u437973379 | cpp |
p03194 | #include <algorithm>
#include <array>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <iostream>
#include <unordered_map>
#include <vector>
std::unordered_map<uint64_t, uint64_t> makeFactors(uint64_t n) {
uint64_t val = n;
std::unordered_map<uint64_t, uint64_t> factors;
while (val % 2 == 0) {
... | #include <algorithm>
#include <array>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <iostream>
#include <unordered_map>
#include <vector>
std::unordered_map<uint64_t, uint64_t> makeFactors(uint64_t n) {
uint64_t val = n;
std::unordered_map<uint64_t, uint64_t> factors;
while (val % 2 == 0) {
... | [
"assignment.value.change",
"expression.operation.binary.change"
] | 991,991 | 991,992 | u042751985 | cpp |
p03187 | #include <algorithm>
#include <cstdio>
#include <cstring>
const int MAXN = 2e5 + 10;
int n, l;
int a[MAXN];
int d[MAXN];
typedef long long LL;
LL solve() {
static LL sum[MAXN], sum1[MAXN], sum2[MAXN];
for (int i = 1; i <= n; i++)
sum[i] = sum[i - 1] + d[i];
for (int i = 1; i <= n; i++) {
sum1[i] = sum1[... | #include <algorithm>
#include <cstdio>
#include <cstring>
const int MAXN = 2e5 + 10;
int n, l;
int a[MAXN];
int d[MAXN];
typedef long long LL;
LL solve() {
static LL sum[MAXN], sum1[MAXN], sum2[MAXN];
for (int i = 1; i <= n; i++)
sum[i] = sum[i - 1] + d[i];
for (int i = 1; i <= n; i++) {
sum1[i] = sum1[... | [] | 991,997 | 991,998 | u159654334 | cpp |
p03187 | #include <bits/stdc++.h>
using namespace std;
#define LL long long
#define LD long double
#define SC(t, x) static_cast<t>(x)
#define AR(t) vector<t>
#define PII pair<int, int>
#define PLL pair<LL, LL>
#define PIL pair<int, LL>
#define PLI pair<LL, int>
#define MP make_pair
#define PB push_back
#define PF push_front
#d... | #include <bits/stdc++.h>
using namespace std;
#define LL long long
#define LD long double
#define SC(t, x) static_cast<t>(x)
#define AR(t) vector<t>
#define PII pair<int, int>
#define PLL pair<LL, LL>
#define PIL pair<int, LL>
#define PLI pair<LL, int>
#define MP make_pair
#define PB push_back
#define PF push_front
#d... | [
"variable_declaration.type.change"
] | 992,007 | 992,008 | u011213027 | cpp |
p03197 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
using node = pair<string, ll>;
const ll inf = numeric_limits<ll>::max() / 3;
const ll mod = 1e9 + 7;
int main(void) {
int n;
cin >> n;
bool win = false;
for (int i = 0; i < n; ++i) {
int tmp;
cin >> tmp;
i... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
using node = pair<string, ll>;
const ll inf = numeric_limits<ll>::max() / 3;
const ll mod = 1e9 + 7;
int main(void) {
int n;
cin >> n;
bool win = false;
for (int i = 0; i < n; ++i) {
int tmp;
cin >> tmp;
i... | [
"assignment.value.change",
"expression.operation.unary.remove"
] | 992,090 | 992,091 | u488078009 | cpp |
p03197 | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 7;
const int mo = 1e9 + 7;
#define ll long long
int a[MAXN], n, m, win;
int main() {
cin >> n;
win = 1;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = 1; i <= n; i++)
if (a[i] % 2 == 1)
win = 1;
if (win == 1)
cout <... | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 7;
const int mo = 1e9 + 7;
#define ll long long
int a[MAXN], n, m, win;
int main() {
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = 1; i <= n; i++)
if (a[i] % 2 == 1)
win = 1;
if (win == 1)
cout << "first";
... | [] | 992,092 | 992,093 | u225495372 | cpp |
p03197 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define ppp pop_back
#define fi first
#define se second
#define pii pair<int, int>
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
#ifdef LOCAL
freopen("input.txt", "r", stdin);
#endif
int n;
bool odd = 0;
for ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define ppp pop_back
#define fi first
#define se second
#define pii pair<int, int>
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
#ifdef LOCAL
freopen("input.txt", "r", stdin);
#endif
int n;
cin >> n;
bool odd... | [] | 992,094 | 992,095 | u041066818 | cpp |
p03197 | #include <bits/stdc++.h>
typedef long long ll;
const int INF = 1e9, MOD = 1e9 + 7, ohara = 1e6;
const ll LINF = 1e18;
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (int)(n); (i)++)
#define rrep(i, a, b) for (int i = (a); i < (b); i++)
#define rrrep(i, a, b) for (int i = (a); i >= (b); i--)
#define all(... | #include <bits/stdc++.h>
typedef long long ll;
const int INF = 1e9, MOD = 1e9 + 7, ohara = 1e6;
const ll LINF = 1e18;
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (int)(n); (i)++)
#define rrep(i, a, b) for (int i = (a); i < (b); i++)
#define rrrep(i, a, b) for (int i = (a); i >= (b); i--)
#define all(... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change"
] | 992,096 | 992,097 | u876335718 | cpp |
p03197 | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ull = unsigned long long;
typedef pair<int, int> Pi;
typedef pair<long long, long long> P;
typedef pair<long long, P> PP;
typedef pair<P, P> PPP;
const long long MOD = 1e9 + 7;
const long long INF = 5e18;
const int di[4] = {1, 0, -1, 0};
const... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ull = unsigned long long;
typedef pair<int, int> Pi;
typedef pair<long long, long long> P;
typedef pair<long long, P> PP;
typedef pair<P, P> PPP;
const long long MOD = 1e9 + 7;
const long long INF = 5e18;
const int di[4] = {1, 0, -1, 0};
const... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 992,098 | 992,099 | u732285858 | cpp |
p03198 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, n) for (int i = 1; i <= (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define uniq(x) (x).erase(unique(all(x)), (x).end())
#define bit(n) (1LL << (n))
#define cdiv(a, b) (((a)... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, n) for (int i = 1; i <= (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define uniq(x) (x).erase(unique(all(x)), (x).end())
#define bit(n) (1LL << (n))
#define cdiv(a, b) (((a)... | [
"control_flow.loop.condition.change"
] | 992,106 | 992,107 | u450832845 | cpp |
p03198 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, n) for (int i = 1; i <= (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define uniq(x) (x).erase(unique(all(x)), (x).end())
#define bit(n) (1LL << (n))
#define cdiv(a, b) (((a)... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, n) for (int i = 1; i <= (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define uniq(x) (x).erase(unique(all(x)), (x).end())
#define bit(n) (1LL << (n))
#define cdiv(a, b) (((a)... | [
"identifier.change",
"call.arguments.change",
"control_flow.loop.condition.change"
] | 992,108 | 992,107 | u450832845 | cpp |
p03198 | #include <bits/stdc++.h>
#define inf (long long)(1e18)
using namespace std;
long long n;
vector<long long> a, pre, suf;
long long solve();
int main() {
cin >> n;
a.resize(n);
for (auto &p : a)
cin >> p;
cout << solve() << endl;
return 0;
}
long long solve() {
auto calc = [](vector<long long> &v) {
... | #include <bits/stdc++.h>
#define inf (long long)(1e18)
using namespace std;
long long n;
vector<long long> a, pre, suf;
long long solve();
int main() {
cin >> n;
a.resize(n);
for (auto &p : a)
cin >> p;
cout << solve() << endl;
return 0;
}
long long solve() {
auto calc = [](vector<long long> &v) {
... | [
"literal.number.change",
"variable_declaration.value.change"
] | 992,109 | 992,110 | u269963329 | cpp |
p03198 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define REP(i, k, n) for (long long i = k; i < (long long)(n); i++)
#define all(a) a.begin(), a.end()
#define pb emplace_back
#define eb emplace_back
#define lb(v, k) (lower_bound(all(v), k) - v.begin())
#defi... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define REP(i, k, n) for (long long i = k; i < (long long)(n); i++)
#define all(a) a.begin(), a.end()
#define pb emplace_back
#define eb emplace_back
#define lb(v, k) (lower_bound(all(v), k) - v.begin())
#defi... | [] | 992,122 | 992,123 | u422633119 | cpp |
p03198 | #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set... | #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set... | [
"assignment.add"
] | 992,124 | 992,125 | u021034020 | cpp |
p03198 | #include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define int long long
typedef pair<int, int> P;
int num(int a, int b) {
if (a >= b)
return 0;
return 1 + num(a * 4, b);
}
int num2(int a, int b) {
int cnt = 0;
while (a * 4 <= b) {
cnt++;
a *= 4;
}
retur... | #include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define int long long
typedef pair<int, int> P;
int num(int a, int b) {
if (a >= b)
return 0;
return 1 + num(a * 4, b);
}
int num2(int a, int b) {
int cnt = 0;
while (a * 4 <= b) {
cnt++;
a *= 4;
}
retur... | [
"expression.operation.binary.remove",
"assignment.change"
] | 992,126 | 992,127 | u722628899 | cpp |
p03198 | #include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define int long long
typedef pair<int, int> P;
int num(int a, int b) {
if (a >= b)
return 0;
return 1 + num(a * 4, b);
}
int num2(int a, int b) {
int cnt = 0;
while (a * 4 <= b) {
cnt++;
a *= 4;
}
retur... | #include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define int long long
typedef pair<int, int> P;
int num(int a, int b) {
if (a >= b)
return 0;
return 1 + num(a * 4, b);
}
int num2(int a, int b) {
int cnt = 0;
while (a * 4 <= b) {
cnt++;
a *= 4;
}
retur... | [
"expression.operation.binary.remove",
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 992,128 | 992,127 | u722628899 | cpp |
p03198 | #include <bits/stdc++.h>
#include <iomanip>
using namespace std;
#define reps(i, s, n) for (int i = s; i < n; i++)
#define rep(i, n) reps(i, 0, n)
#define Rreps(i, n, e) for (int i = n - 1; i >= e; --i)
#define Rrep(i, n) Rreps(i, n, 0)
#define ALL(a) a.begin(), a.end()
#define fi first
#define se second
#define mp mak... | #include <bits/stdc++.h>
#include <iomanip>
using namespace std;
#define reps(i, s, n) for (int i = s; i < n; i++)
#define rep(i, n) reps(i, 0, n)
#define Rreps(i, n, e) for (int i = n - 1; i >= e; --i)
#define Rrep(i, n) Rreps(i, n, 0)
#define ALL(a) a.begin(), a.end()
#define fi first
#define se second
#define mp mak... | [
"assignment.change"
] | 992,147 | 992,148 | u016531517 | cpp |
p03198 | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define F first
#define S second
#define int long long
#define ll long long
//#define int unsigned long long
#define pb push_back
#define double long double
using namespace std;
using namespace __gnu_pbds;
typedef tree<in... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define F first
#define S second
#define int long long
#define ll long long
//#define int unsigned long long
#define pb push_back
#define double long double
using namespace std;
using namespace __gnu_pbds;
typedef tree<in... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 992,155 | 992,156 | u373008269 | cpp |
p03198 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#undef LOCAL
string to_string(string s) { return '"' + s + '"'; }
string to_string(bool x) { return (x ? "T" : "F"); }
string to_string(const char *s) { return to_string((string)s); }
template <typename A, typename B> string to_string(pair<A, B> p) {... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#undef LOCAL
string to_string(string s) { return '"' + s + '"'; }
string to_string(bool x) { return (x ? "T" : "F"); }
string to_string(const char *s) { return to_string((string)s); }
template <typename A, typename B> string to_string(pair<A, B> p) {... | [
"assignment.change"
] | 992,163 | 992,164 | u031986221 | cpp |
p03198 | #include <bits/stdc++.h>
#define syosu(x) fixed << setprecision(x)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
typedef pair<long double, long double> pdd;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<double> vd;
typedef... | #include <bits/stdc++.h>
#define syosu(x) fixed << setprecision(x)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
typedef pair<long double, long double> pdd;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<double> vd;
typedef... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 992,167 | 992,168 | u434747175 | cpp |
p03198 | #include <bits/stdc++.h>
#define pb push_back
#define int long long
#define mp make_pair
#define inf 1000000007LL
#define LINF 1000000000000000007LL
#define ll long long
using namespace std;
int dp[214514][16], rdp[214514][16], tdp[214514], trdp[214514];
signed main() {
int n;
cin >> n;
if (n == 1) {
cout << ... | #include <bits/stdc++.h>
#define pb push_back
#define int long long
#define mp make_pair
#define inf 1000000007LL
#define LINF 1000000000000000007LL
#define ll long long
using namespace std;
int dp[214514][16], rdp[214514][16], tdp[214514], trdp[214514];
signed main() {
int n;
cin >> n;
if (n == 1) {
cout << ... | [
"assignment.add"
] | 992,172 | 992,173 | u335590796 | cpp |
p03198 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
using namespace std;
typedef long long int ll;
typedef pair<l... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
using namespace std;
typedef long long int ll;
typedef pair<l... | [
"identifier.change"
] | 992,176 | 992,177 | u791593901 | cpp |
p03198 | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
const ll INF = 1LL << 60;
const ll MOD = 998244353;
ll dp1[200000][16];
ll dp2[200000][16];
ll A[200000], B[200000];
int main() {
int N;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> A[i];
B[i] = A[i] * 2;
}
fill((ll *)dp1, (ll *)(dp... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
const ll INF = 1LL << 60;
const ll MOD = 998244353;
ll dp1[200000][16];
ll dp2[200000][16];
ll A[200000], B[200000];
int main() {
int N;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> A[i];
B[i] = A[i] * 2;
}
fill((ll *)dp1, (ll *)(dp... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 992,187 | 992,188 | u243961437 | cpp |
p03198 | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
const ull mod = 1e9 + 7;
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
// debug
#define dump(x) cerr << #x << " = " << (x) <<... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
const ull mod = 1e9 + 7;
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
// debug
#define dump(x) cerr << #x << " = " << (x) <<... | [
"control_flow.branch.if.add"
] | 992,189 | 992,190 | u895971408 | cpp |
p03198 | #include <algorithm>
#include <bitset>
#include <climits>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#... | #include <algorithm>
#include <bitset>
#include <climits>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#... | [
"assignment.change",
"assignment.variable.change",
"identifier.change",
"function.return_value.change"
] | 992,193 | 992,194 | u003873207 | cpp |
p03198 | #include <bits/stdc++.h>
using namespace std;
#define i64 long long int
#define ran 200020
int n;
i64 a[ran], b[ran], L[ran], R[ran];
int ace[ran], w[ran];
int ancestor(int x) { return x - ace[x] ? ace[x] = ancestor(ace[x]) : x; }
void proc(i64 *a, i64 *res) {
res[1] = 0;
w[1] = 12345678;
for (int i = 1; i <= n... | #include <bits/stdc++.h>
using namespace std;
#define i64 long long int
#define ran 200020
int n;
i64 a[ran], b[ran], L[ran], R[ran];
int ace[ran], w[ran];
int ancestor(int x) { return x - ace[x] ? ace[x] = ancestor(ace[x]) : x; }
void proc(i64 *a, i64 *res) {
res[1] = 0;
w[1] = 12345678;
for (int i = 1; i <= n... | [
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 992,201 | 992,202 | u647940094 | cpp |
p03198 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = (0); (i) < (long long)(n); ++(i))
using ll = long long;
using P = pair<int, int>;
using namespace std;
ll dp[201010][16][2], dp2[201010][2];
int main() {
int N;
cin >> N;
vector<ll> A(N);
rep(i, N) cin >> A[i];
rep(i, N - 1) rep(... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = (0); (i) < (long long)(n); ++(i))
using ll = long long;
using P = pair<int, int>;
using namespace std;
ll dp[201010][16][2], dp2[201010][2];
int main() {
int N;
cin >> N;
vector<ll> A(N);
rep(i, N) cin >> A[i];
rep(i, N - 1) rep(... | [
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 992,203 | 992,204 | u482544950 | cpp |
p03198 | #include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
const ll INF = 5e15;
struct I {
ll i, cnt;
};
vector<ll> calc(const vector<ll> &v) {
vector<ll> ret(v.size(), 0);
ll pre = v[0];
stack<I> st;
for (ll i = 1; i < v.size(); i++) {
ret[i] = ret[i - 1];
if (v[i] <= pre) {
ll cnt = 0... | #include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
const ll INF = 5e15;
struct I {
ll i, cnt;
};
vector<ll> calc(const vector<ll> &v) {
vector<ll> ret(v.size(), 0);
ll pre = v[0];
stack<I> st;
for (ll i = 1; i < v.size(); i++) {
ret[i] = ret[i - 1];
if (v[i] <= pre) {
ll cnt = 0... | [
"assignment.add"
] | 992,205 | 992,206 | u216962796 | cpp |
p03198 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0, max_i = (n); i < max_i; i++)
#define REPI(i, a, b) for (int i = (a), max_i = (b); i < max_i; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define RALL(obj) (obj).rbegin(), (obj).rend()
#define fi first
#define se second
#define int long long
using namespace... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0, max_i = (n); i < max_i; i++)
#define REPI(i, a, b) for (int i = (a), max_i = (b); i < max_i; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define RALL(obj) (obj).rbegin(), (obj).rend()
#define fi first
#define se second
#define int long long
using namespace... | [
"assignment.value.change"
] | 992,214 | 992,215 | u852113235 | cpp |
p03198 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0, max_i = (n); i < max_i; i++)
#define REPI(i, a, b) for (int i = (a), max_i = (b); i < max_i; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define RALL(obj) (obj).rbegin(), (obj).rend()
#define fi first
#define se second
#define int long long
using namespace... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0, max_i = (n); i < max_i; i++)
#define REPI(i, a, b) for (int i = (a), max_i = (b); i < max_i; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define RALL(obj) (obj).rbegin(), (obj).rend()
#define fi first
#define se second
#define int long long
using namespace... | [
"expression.operation.binary.change"
] | 992,216 | 992,217 | u852113235 | cpp |
p03198 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define all(c) c.begin(), c.end()
#define rall(c)... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define all(c) c.begin(), c.end()
#define rall(c)... | [
"assignment.add"
] | 992,220 | 992,221 | u986399983 | cpp |
p03198 | #include <bits/stdc++.h>
#define ll long long
#define N 200010
using namespace std;
template <typename T> void read(T &x) {
x = 0;
char c = getchar();
int fh = 1;
while (!isdigit(c)) {
if (c == '-')
fh = -1;
c = getchar();
}
while (isdigit(c))
x = x * 10 + c - '0', c = getchar();
x *= fh... | #include <bits/stdc++.h>
#define ll long long
#define N 200010
using namespace std;
template <typename T> void read(T &x) {
x = 0;
char c = getchar();
int fh = 1;
while (!isdigit(c)) {
if (c == '-')
fh = -1;
c = getchar();
}
while (isdigit(c))
x = x * 10 + c - '0', c = getchar();
x *= fh... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 992,227 | 992,228 | u539443668 | cpp |
p03198 | #include <bits/stdc++.h>
#define INF 1e18
using namespace std;
typedef long long ll;
ll V[200005], dp[200005][20], dp2[200005][20], P[20];
int n;
int main() {
ios_base::sync_with_stdio(false);
P[0] = 1;
for (int i = 1; i <= 15; i++)
P[i] = P[i - 1] * 4;
scanf("%d", &n);
for (int i = 1; i <= n; i++)
... | #include <bits/stdc++.h>
#define INF 1e18
using namespace std;
typedef long long ll;
ll V[200005], dp[200005][20], dp2[200005][20], P[50];
int n;
int main() {
ios_base::sync_with_stdio(false);
P[0] = 1;
for (int i = 1; i <= 30; i++)
P[i] = P[i - 1] * 4;
scanf("%d", &n);
for (int i = 1; i <= n; i++)
... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 992,240 | 992,241 | u377566715 | cpp |
p03198 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
#define repeat(i, n) for... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
#define repeat(i, n) for... | [
"type_conversion.add"
] | 992,253 | 992,254 | u120143737 | cpp |
p03198 | #include <bits/stdc++.h>
using namespace std;
#define int long long // aaaaaaaaaaaaaaaaaa
#define rep(i, a, n) for (int i = a; i < n; i++)
#define per(i, a, n) for (int i = n - 1; i >= a; i--)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define allr(x) (x).rbegin(), (x).rend()
#defin... | #include <bits/stdc++.h>
using namespace std;
#define int long long // aaaaaaaaaaaaaaaaaa
#define rep(i, a, n) for (int i = a; i < n; i++)
#define per(i, a, n) for (int i = n - 1; i >= a; i--)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define allr(x) (x).rbegin(), (x).rend()
#defin... | [
"control_flow.loop.condition.change"
] | 992,255 | 992,256 | u884982181 | cpp |
p03198 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define N 200010
#define pii pair<int, int>
int n;
ll a[N], b[N], f[N], g[N], lazy;
void Run() {
while (scanf("%d", &n) != EOF) {
for (int i = 1; i <= n; ++i)
scanf("%lld", a + i);
queue<pii> q;
f[n] = 0;
for (int i = n - 1; i ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define N 200010
#define pii pair<int, int>
int n;
ll a[N], b[N], f[N], g[N], lazy;
void Run() {
while (scanf("%d", &n) != EOF) {
for (int i = 1; i <= n; ++i)
scanf("%lld", a + i);
queue<pii> q;
f[n] = 0;
for (int i = n - 1; i ... | [] | 992,261 | 992,262 | u717168969 | cpp |
p03200 | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
string S;
cin >> S;
int ans = 0, w = 0;
for (int i = 0; i < S.size() - 1; i++) {
if (S[i] == 'W') {
ans += i - w;
w++;
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
string S;
cin >> S;
int ans = 0, w = 0;
for (int i = 0; i < S.size(); i++) {
if (S[i] == 'W') {
ans += i - w;
w++;
}
}
cout << ans << endl;
}
| [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 992,302 | 992,303 | u187772564 | cpp |
p03200 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
int main() {
int cnt = 0, ans = 1, sum = 0;
string s;
cin >> s;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'B') {
cnt++;
} else if (s[i] == 'W... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
int main() {
long long cnt = 0, ans = 1, sum = 0;
string s;
cin >> s;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'B') {
cnt++;
} else if (s[i]... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"assignment.add"
] | 992,410 | 992,409 | u448598378 | cpp |
p03200 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define ld long double
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define ld long double
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
... | [
"identifier.change"
] | 992,458 | 992,459 | u876953939 | cpp |
p03200 | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
const int N = 2e5 + 7;
char s[N];
int main() {
scanf("%s", s + 1);
long long res = 0, cur = 0;
const int len = strlen(s + 1);
for (int i = 1; i <= len; ++i) {
if (s[i] == 'W') {
res += cur;
cur = 0... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
const int N = 2e5 + 7;
char s[N];
int main() {
scanf("%s", s + 1);
long long res = 0, cur = 0;
const int len = strlen(s + 1);
for (int i = 1; i <= len; ++i) {
if (s[i] == 'W')
res += cur;
else
... | [] | 992,611 | 992,612 | u067001883 | cpp |
p03200 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll MOD = 1e9 + 7;
int main() {
string S;
cin >> S;
ll ans = 0;
ll cnt = 0;
bool flag = false;
for (int i = 0; i < S.size(); i++) {
if (flag && S[i] == 'W') {
ans += i - cnt;
cnt++;
} else if (!flag && S[i] == 'B')
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll MOD = 1e9 + 7;
int main() {
string S;
cin >> S;
ll ans = 0;
ll cnt = 0;
bool flag = false;
for (int i = 0; i < S.size(); i++) {
if (S[i] == 'W') {
if (flag)
ans += i - cnt;
cnt++;
}
else if (!flag && S[... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"control_flow.branch.if.add"
] | 992,723 | 992,724 | u521973174 | cpp |
p03200 | #include <bits/stdc++.h>
using namespace std;
// std::vector<long long int> ;
long long int getMoves(long long int b, long long int a) { return b - a; }
int main() {
string a;
cin >> a;
// cout << a;
long long int k = 0;
long long int st = 0;
long long int ans = 0;
for (long long int i = 0; i < a.size();... | #include <bits/stdc++.h>
using namespace std;
// std::vector<long long int> ;
long long int getMoves(long long int b, long long int a) { return b - a; }
int main() {
string a;
cin >> a;
// cout << a;
long long int k = 0;
long long int st = 0;
long long int ans = 0;
for (long long int i = 0; i < a.size();... | [
"assignment.change"
] | 992,820 | 992,821 | u691169306 | cpp |
p03200 | #include <bits/stdc++.h>
using namespace std;
// std::vector<long long int> ;
long long int getMoves(long long int b, long long int a) { return b - a; }
int main() {
string a;
cin >> a;
// cout << a;
long long int k = 0;
long long int st = 0;
long long int ans = 0;
for (long long int i = 0; i < a.size();... | #include <bits/stdc++.h>
using namespace std;
// std::vector<long long int> ;
long long int getMoves(long long int b, long long int a) { return b - a; }
int main() {
string a;
cin >> a;
// cout << a;
long long int k = 0;
long long int st = 0;
long long int ans = 0;
for (long long int i = 0; i < a.size();... | [
"control_flow.loop.for.condition.change",
"expression.operation.unary.arithmetic.remove",
"assignment.change"
] | 992,822 | 992,821 | u691169306 | cpp |
p03200 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
#define pb push_back
#define f(i, n) for (i = 0; i < n; i++)
#define F(i, a, b) for (i = a; a <= b; i++)
#define arr(a, n) \
for (i = 0; i < n; i++) ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
#define pb push_back
#define f(i, n) for (i = 0; i < n; i++)
#define F(i, a, b) for (i = a; a <= b; i++)
#define arr(a, n) \
for (i = 0; i < n; i++) ... | [] | 992,915 | 992,916 | u159663513 | cpp |
p03196 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
const int MOD = 1000000007;
struct Edge {
int to;
int weight;
Edge(int t, int w) : to(t), weight(w) {}
};
int main() {
long long N, P;
cin >> N >> P;
long l... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
const int MOD = 1000000007;
struct Edge {
int to;
int weight;
Edge(int t, int w) : to(t), weight(w) {}
};
int main() {
long long N, P;
cin >> N >> P;
long l... | [
"control_flow.loop.for.condition.change",
"identifier.change",
"expression.operation.binary.change"
] | 993,039 | 993,040 | u095756391 | cpp |
p03196 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
int Prime[1000010]; // Pr... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
int Prime[1000010]; // Pr... | [
"control_flow.branch.while.replace.add",
"control_flow.loop.if.replace.remove",
"assignment.add"
] | 993,050 | 993,051 | u828388155 | cpp |
p03196 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
//#include<bits/stdc++... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
//#include<bits/stdc++... | [] | 993,052 | 993,053 | u098844816 | cpp |
p03196 | #include <iostream>
#include <math.h>
using namespace std;
int main() {
long int N, P;
cin >> N >> P;
long double logP = log(double(P));
long int i = 1;
long int start = 0;
long int tempP;
int cnt = 0;
if (P == 1) {
cout << 1;
return 0;
}
if (N == 1) {
cout << P;
return 0;
}
fo... | #include <iostream>
#include <math.h>
using namespace std;
int main() {
long int N, P;
cin >> N >> P;
long double logP = log(double(P));
long int i = 1;
long int start = 0;
long int tempP;
int cnt = 0;
if (P == 1) {
cout << 1;
return 0;
}
if (N == 1) {
cout << P;
return 0;
}
fo... | [] | 993,064 | 993,065 | u447485613 | cpp |
p03196 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, p;
cin >> n >> p;
map<long long, long long> m;
for (int i = 2; i < sqrt(p) + 1; i++) {
while (p % i == 0) {
++m[i];
p = p / i;
}
}
if (p > 1) {
++m[p];
}
long long ans = 1;
for (auto mi : m) {
if (mi.s... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, p;
cin >> n >> p;
map<long long, long long> m;
for (int i = 2; i < sqrt(p) + 1; i++) {
while (p % i == 0) {
++m[i];
p = p / i;
}
}
if (p > 1) {
++m[p];
}
long long ans = 1;
for (auto mi : m) {
if (mi.s... | [
"call.add",
"assignment.value.change",
"expression.operation.binary.change"
] | 993,080 | 993,081 | u313766957 | cpp |
p03196 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
long i, n, p;
cin >> n >> p;
for (i = (long)pow(p, (double)1 / n);; i--)
if (p % (long)pow(i, n) == 0) {
cout << i << endl;
return 0;
}
} | #include <cmath>
#include <iostream>
using namespace std;
int main() {
long i, n, p;
cin >> n >> p;
for (i = pow(p, (double)1 / n) + 1;; i--)
if (p % (long)pow(i, n) == 0) {
cout << i << endl;
return 0;
}
} | [
"control_flow.loop.for.initializer.change",
"assignment.change"
] | 993,086 | 993,087 | u612175324 | cpp |
p03196 | #include <bits/stdc++.h>
using namespace std;
int main() {
long N, P;
cin >> N >> P;
long a = pow(P, 1.0 / N);
for (long i = a; i > 0; i--) {
long b = pow(i, N);
if (P % b == 0) {
cout << i;
break;
}
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long N, P;
cin >> N >> P;
long a = pow(P, 1.0 / N);
a = a + 1;
for (long i = a; i > 0; i--) {
long b = pow(i, N);
if (P % b == 0) {
cout << i;
break;
}
}
} | [
"assignment.add"
] | 993,090 | 993,089 | u593555034 | cpp |
p03196 | #include <algorithm>
#include <bits/stdc++.h>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using na... | #include <algorithm>
#include <bits/stdc++.h>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using na... | [
"assignment.value.change",
"expression.operation.binary.change",
"call.arguments.add"
] | 993,100 | 993,101 | u925940521 | cpp |
p03196 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define pb push_back
#define mp make_pair
#define rep(i, n) for (int i = 0; i < (n); ++i)
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n, p;
cin >> n >> p;
if (n == 1) {
cout << p << endl;
retu... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define pb push_back
#define mp make_pair
#define rep(i, n) for (int i = 0; i < (n); ++i)
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n, p;
cin >> n >> p;
if (n == 1) {
cout << p << endl;
retu... | [
"call.add",
"assignment.value.change",
"expression.operation.binary.change",
"call.arguments.change"
] | 993,114 | 993,115 | u480831358 | cpp |
p03196 | #include <bits/stdc++.h>
#define mins(a, b) a = min(a, b)
#define maxs(a, b) a = max(a, b)
template <typename T> std::string to_string(const T &n) {
std::ostringstream stm;
stm << n;
return stm.str();
}
using namespace std;
const long long INF = 9000000000000000;
int main() {
long long n, ans = 1, p, x;
cin ... | #include <bits/stdc++.h>
#define mins(a, b) a = min(a, b)
#define maxs(a, b) a = max(a, b)
template <typename T> std::string to_string(const T &n) {
std::ostringstream stm;
stm << n;
return stm.str();
}
using namespace std;
const long long INF = 9000000000000000;
int main() {
long long n, ans = 1, p, x;
cin ... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 993,120 | 993,119 | u127856129 | cpp |
p03196 | #include <bits/stdc++.h>
#define mins(a, b) a = min(a, b)
#define maxs(a, b) a = max(a, b)
template <typename T> std::string to_string(const T &n) {
std::ostringstream stm;
stm << n;
return stm.str();
}
using namespace std;
const long long INF = 9000000000000000;
int main() {
long long n, ans = 1, p, x;
cin ... | #include <bits/stdc++.h>
#define mins(a, b) a = min(a, b)
#define maxs(a, b) a = max(a, b)
template <typename T> std::string to_string(const T &n) {
std::ostringstream stm;
stm << n;
return stm.str();
}
using namespace std;
const long long INF = 9000000000000000;
int main() {
long long n, ans = 1, p, x;
cin ... | [
"variable_declaration.name.change",
"identifier.change",
"control_flow.loop.for.initializer.change",
"control_flow.branch.if.condition.change"
] | 993,121 | 993,119 | u127856129 | cpp |
p03196 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define ALL(A) A.begin(), A.end()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
map<ll, int> prime_factorize(ll a) {
map<ll, int> res;
res.clear();
for (ll p = 2LL; p * p <= a; ++p) {
if (a % p == 0LL) {
i... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define ALL(A) A.begin(), A.end()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
map<ll, int> prime_factorize(ll a) {
map<ll, int> res;
res.clear();
for (ll p = 2LL; p * p <= a; ++p) {
if (a % p == 0LL) {
i... | [
"call.add",
"assignment.value.change",
"expression.operation.binary.change"
] | 993,133 | 993,134 | u635277286 | cpp |
p03196 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double db;
#define pb push_back
#define fr(i, n) for (int i = 0; i < n; i++)
#define Fr(i, n) for (int i = 0; i + < n;)
#define ifr(i, n) for (int i = n - 1; i >= 0; i--)
#define iFr(i, n) for (int i = n; i > 0; i--)
int main() {
ll n, p, an... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double db;
#define pb push_back
#define fr(i, n) for (int i = 0; i < n; i++)
#define Fr(i, n) for (int i = 0; i + < n;)
#define ifr(i, n) for (int i = n - 1; i >= 0; i--)
#define iFr(i, n) for (int i = n; i > 0; i--)
int main() {
ll n, p, an... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 993,135 | 993,136 | u434208140 | cpp |
p03196 | #include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include ... | #include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include ... | [
"control_flow.branch.else.add"
] | 993,161 | 993,162 | u307511072 | cpp |
p03196 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1000000007;
const int MAXN = 1000000;
vector<ll> primes;
bool is_prime[MAXN + 1];
// eratosthenesの篩 O(nloglogn)
// n以下の素数を列挙して、n以下の素数の数を返す
void sieve() {
for (int i = 0; i <= MAXN; i++)
is_prime[i] = true;
is_prime[0] = is_... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1000000007;
const int MAXN = 1000000;
vector<ll> primes;
bool is_prime[MAXN + 1];
// eratosthenesの篩 O(nloglogn)
// n以下の素数を列挙して、n以下の素数の数を返す
void sieve() {
for (int i = 0; i <= MAXN; i++)
is_prime[i] = true;
is_prime[0] = is_... | [
"assignment.add"
] | 993,167 | 993,168 | u637771514 | cpp |
p03196 | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n;... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n;... | [
"control_flow.branch.while.replace.add",
"control_flow.loop.if.replace.remove"
] | 993,171 | 993,172 | u859396346 | cpp |
p03196 | #include <iostream>
using namespace std;
int main() {
long long N, P;
cin >> N >> P;
long long ans = 0;
for (long long i = 2; i * i <= P; ++i) {
int cnt = 0;
while (P % i == 0) {
P /= i;
++cnt;
}
for (int j = 0; j < cnt / N; ++j) {
ans *= i;
}
}
if (P > 1 && N == 1)
... | #include <iostream>
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) {
int cnt = 0;
while (P % i == 0) {
P /= i;
++cnt;
}
for (int j = 0; j < cnt / N; ++j) {
ans *= i;
}
}
if (P > 1 && N == 1)
... | [
"literal.number.change",
"variable_declaration.value.change"
] | 993,180 | 993,181 | u837745858 | cpp |
p03196 | #include <cmath>
#include <iostream>
#include <set>
using namespace std;
#define ll long long
int main(void) {
ll n, p, i = 2, x = 1;
multiset<ll> v;
cin >> n >> p;
ll k = p;
while (k > 1) {
if (k % i == 0) {
v.insert(i);
k /= i;
} else
i += 1;
if (i > sqrt(k)) {
v.insert(k... | #include <cmath>
#include <iostream>
#include <set>
using namespace std;
#define ll long long
int main(void) {
ll n, p, i = 2, x = 1;
multiset<ll> v;
cin >> n >> p;
ll k = p;
while (k > 1) {
if (k % i == 0) {
v.insert(i);
k /= i;
} else
i += 1;
if (i > sqrt(k)) {
v.insert(k... | [
"call.add",
"assignment.value.change",
"expression.operation.binary.change",
"call.arguments.change"
] | 993,182 | 993,183 | u219041750 | cpp |
p03196 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vb = vector<bool>;
using vvb = vector<vb>;
using vd = vector<double>;
using vvd = vector<vd>;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using pll = pair<ll, ll>;
using tll = tuple<ll, ll>;
usin... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vb = vector<bool>;
using vvb = vector<vb>;
using vd = vector<double>;
using vvd = vector<vd>;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using pll = pair<ll, ll>;
using tll = tuple<ll, ll>;
usin... | [] | 993,186 | 993,187 | u364618491 | cpp |
p03196 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
#define all(x) x.begin(), x.end()
const ll mod = 1e9 + 7;
const ll INF = 1e9;
const ll MAXN... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
#define all(x) x.begin(), x.end()
const ll mod = 1e9 + 7;
const ll INF = 1e9;
const ll MAXN... | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 993,204 | 993,205 | u700986952 | cpp |
p03196 | #include <algorithm>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define rep(i, rept) for (ll i = 0; i < (ll)rept; ++i)
typedef long long ll;
using namespace std;
// Product and GCD
... | #include <algorithm>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define rep(i, rept) for (ll i = 0; i < (ll)rept; ++i)
typedef long long ll;
using namespace std;
// Product and GCD
... | [
"assignment.value.change",
"expression.operation.binary.change",
"call.arguments.add"
] | 993,210 | 993,211 | u345965293 | cpp |
p03196 | #include <algorithm>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define rep(i, rept) for (ll i = 0; i < (ll)rept; ++i)
typedef long long ll;
using namespace std;
// Product and GCD
... | #include <algorithm>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define rep(i, rept) for (ll i = 0; i < (ll)rept; ++i)
typedef long long ll;
using namespace std;
// Product and GCD
... | [
"control_flow.branch.while.replace.add",
"control_flow.loop.if.replace.remove",
"expression.operation.binary.change"
] | 993,210 | 993,212 | u345965293 | cpp |
p03196 | #include <bits/stdc++.h>
using namespace std;
long long n, p, maxx = 1, dem = 0;
void input() { cin >> n >> p; }
void output() { cout << maxx; }
void kt(long long x) {
if (x < 4)
return;
long long y = x;
for (long i = 2; i * i <= x; i++) {
if (y == 1)
return;
dem = 0;
while (y % i == 0) ... | #include <bits/stdc++.h>
using namespace std;
long long n, p, maxx = 1, dem = 0;
void input() { cin >> n >> p; }
void output() { cout << maxx; }
void kt(long long x) {
if (x < 4)
return;
long long y = x;
for (long i = 2; i * i <= x; i++) {
if (y == 1)
return;
dem = 0;
while (y % i == 0) ... | [
"variable_declaration.name.change",
"identifier.change",
"control_flow.loop.for.initializer.change",
"control_flow.branch.if.condition.change"
] | 993,213 | 993,214 | u325444307 | cpp |
p03196 | #include <iostream>
using namespace std;
int main() {
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 q = 1;
for (int e = 0; e < n && q <= p; e++)
q *= i;
if (p % q == 0) {
ans *... | #include <iostream>
using namespace std;
int main() {
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 q = 1;
for (int e = 0; e < n && q <= p; e++)
q *= i;
while (p % q == 0) {
an... | [
"control_flow.branch.while.replace.add",
"control_flow.loop.if.replace.remove"
] | 993,215 | 993,216 | u374416262 | cpp |
p03196 | #include <iostream>
using namespace std;
int main() {
long long n, p;
cin >> n >> p;
if (n == 1) {
cout << p << endl;
return 0;
}
long long ans = 1;
for (int i = 2; i * i <= p; i++) {
long long q = 1;
for (int e = 0; e < n && q <= p; e++)
q *= i;
if (p % q == 0) {
ans *= i;
... | #include <iostream>
using namespace std;
int main() {
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 q = 1;
for (int e = 0; e < n && q <= p; e++)
q *= i;
while (p % q == 0) {
an... | [
"control_flow.loop.for.initializer.change",
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"control_flow.branch.while.replace.add",
"control_flow.loop.if.replace.remove"
] | 993,217 | 993,216 | u374416262 | cpp |
p03196 | #include <iostream>
unsigned long long a, b;
bool chk(unsigned long long c) {
for (unsigned long long i = 0; i < a; i++) {
if (b % c == 0)
b /= c;
else
return false;
}
return true;
}
int main(void) {
std::cin >> a >> b;
if (a == 1) {
std::cout << b;
return 0;
} else {
unsigne... | #include <iostream>
unsigned long long a, b;
bool chk(unsigned long long c) {
for (unsigned long long d = b, i = 0; i < a; i++) {
if (d % c == 0)
d /= c;
else
return false;
}
return true;
}
int main(void) {
std::cin >> a >> b;
if (a == 1) {
std::cout << b;
return 0;
} else {
... | [
"control_flow.loop.for.initializer.change",
"variable_declaration.add",
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.variable.change"
] | 993,220 | 993,221 | u422104747 | cpp |
p03196 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define all(a) (a).begin(), (a).end()
template <typename T> map<T, int> factorize(T x) {
map<T, int> mp;
for (T i = 2; i * i <= x; i++) {
while (x % i == 0) {
x /= i;
mp[i]++;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define all(a) (a).begin(), (a).end()
template <typename T> map<T, int> factorize(T x) {
map<T, int> mp;
for (T i = 2; i * i <= x; i++) {
while (x % i == 0) {
x /= i;
mp[i]++;
... | [
"identifier.change",
"call.arguments.change"
] | 993,224 | 993,225 | u241615199 | cpp |
p03196 | #include <iostream>
#include <math.h>
using namespace std;
using ll = long long;
int main() {
ll n, p;
cin >> n >> p;
ll r = 1;
if (n == 1) {
r = p;
} else {
for (ll i = 2; i * i < p; i++) {
ll c = 0;
while (p % i == 0) {
p /= i;
c++;
}
r *= pow(i, c / n);
... | #include <iostream>
#include <math.h>
using namespace std;
using ll = long long;
int main() {
ll n, p;
cin >> n >> p;
ll r = 1;
if (n == 1) {
r = p;
} else {
for (ll i = 2; i * i <= p; i++) {
ll c = 0;
while (p % i == 0) {
p /= i;
c++;
}
r *= pow(i, c / n);
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 993,226 | 993,227 | u388697579 | cpp |
p03196 | #include <iostream>
#include <math.h>
using namespace std;
using ll = long long;
int main() {
ll n, p;
cin >> n >> p;
ll r = 1;
if (n == 1) {
r = p;
} else {
for (int i = 2; i * i < p; i++) {
int c = 0;
while (p % i == 0) {
p /= i;
c++;
}
r *= pow(i, c / n);
... | #include <iostream>
#include <math.h>
using namespace std;
using ll = long long;
int main() {
ll n, p;
cin >> n >> p;
ll r = 1;
if (n == 1) {
r = p;
} else {
for (ll i = 2; i * i <= p; i++) {
ll c = 0;
while (p % i == 0) {
p /= i;
c++;
}
r *= pow(i, c / n);
... | [
"control_flow.loop.for.initializer.change",
"variable_declaration.type.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 993,228 | 993,227 | u388697579 | cpp |
p03196 | #include <bits/stdc++.h>
using namespace std;
bool memo[1000010] = {};
queue<int> que;
int main() {
long long n, p;
cin >> n >> p;
for (int i = 2; i < 1000010; i++) {
if (!memo[i]) {
que.push(i);
for (int j = i * 2; j < 1000010; j += i) {
memo[j] = true;
}
}
}
long long ... | #include <bits/stdc++.h>
using namespace std;
bool memo[1000010] = {};
queue<int> que;
int main() {
long long n, p;
cin >> n >> p;
for (int i = 2; i < 1000010; i++) {
if (!memo[i]) {
que.push(i);
for (int j = i * 2; j < 1000010; j += i) {
memo[j] = true;
}
}
}
long long ... | [
"assignment.add",
"identifier.replace.add",
"literal.replace.remove",
"io.output.change"
] | 993,239 | 993,238 | u221119670 | cpp |
p03196 | #include <bits/stdc++.h>
typedef long long ll;
const int INF = 1e9, MOD = 1e9 + 7, ohara = 1e6;
const ll LINF = 1e18;
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (int)(n); (i)++)
#define rrep(i, a, b) for (int i = (a); i < (b); i++)
#define rrrep(i, a, b) for (ll i = (a); i >= (b); i--)
#define all(v... | #include <bits/stdc++.h>
typedef long long ll;
const int INF = 1e9, MOD = 1e9 + 7, ohara = 1e6;
const ll LINF = 1e18;
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (int)(n); (i)++)
#define rrep(i, a, b) for (int i = (a); i < (b); i++)
#define rrrep(i, a, b) for (ll i = (a); i >= (b); i--)
#define all(v... | [
"variable_declaration.type.widen.change"
] | 993,242 | 993,243 | u876335718 | cpp |
p03196 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>... | [
"assignment.add"
] | 993,244 | 993,245 | u466917094 | cpp |
p03196 | #include <bits/stdc++.h>
using namespace std;
int main() {
long N, P;
cin >> N >> P;
if (N == 1 || P == 1) {
cout << P << endl;
return 0;
}
long counter;
long ans = 1;
for (long i = 2; i * i < P; i++) {
counter = 0;
while (P % i == 0) {
counter++;
P /= i;
}
if (count... | #include <bits/stdc++.h>
using namespace std;
int main() {
long N, P;
cin >> N >> P;
if (N == 1 || P == 1) {
cout << P << endl;
return 0;
}
long counter;
long ans = 1;
for (long i = 2; i * i <= P; i++) {
counter = 0;
while (P % i == 0) {
counter++;
P /= i;
}
if (coun... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 993,248 | 993,249 | u618697411 | cpp |
p03196 | #include <bits/stdc++.h>
using namespace std;
int main() {
long N, P;
cin >> N >> P;
if (N == 1 || P == 1) {
cout << P << endl;
return 0;
}
int counter;
long ans = 1;
for (long i = 2; i * i < P; i++) {
counter = 0;
while (P % i == 0) {
counter++;
P /= i;
}
if (counte... | #include <bits/stdc++.h>
using namespace std;
int main() {
long N, P;
cin >> N >> P;
if (N == 1 || P == 1) {
cout << P << endl;
return 0;
}
long counter;
long ans = 1;
for (long i = 2; i * i <= P; i++) {
counter = 0;
while (P % i == 0) {
counter++;
P /= i;
}
if (coun... | [
"variable_declaration.type.primitive.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"control_flow.loop.for.initializer.change"
] | 993,250 | 993,249 | u618697411 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.