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 |
|---|---|---|---|---|---|---|---|
p03241 | #include <bits/stdc++.h>
using namespace std;
vector<long> calc(long x) {
vector<long> dat;
for (int i = 1; i * i <= x; i++) {
if (x % i == 0)
dat.push_back(i);
}
return dat;
}
int main() {
long n, m;
cin >> n >> m;
vector<long> dat = calc(m);
// for (auto e : dat) {
// cout << e << endl;... | #include <bits/stdc++.h>
using namespace std;
vector<long> calc(long x) {
vector<long> dat;
for (int i = 1; i * i <= x; i++) {
if (x % i == 0)
dat.push_back(i);
}
return dat;
}
int main() {
long n, m;
cin >> n >> m;
vector<long> dat = calc(m);
// for (auto e : dat) {
// cout << e << endl;... | [
"call.arguments.change"
] | 1,035,028 | 1,035,029 | u560670090 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
vector<long> calc(long x) {
vector<long> dat;
for (int i = 1; i * i <= x; i++) {
if (x % i == 0)
dat.push_back(i);
}
return dat;
}
int main() {
long n, m;
cin >> n >> m;
vector<long> dat = calc(m);
// for (auto e : dat) {
// cout << e << endl;... | #include <bits/stdc++.h>
using namespace std;
vector<long> calc(long x) {
vector<long> dat;
for (int i = 1; i * i <= x; i++) {
if (x % i == 0)
dat.push_back(i);
}
return dat;
}
int main() {
long n, m;
cin >> n >> m;
vector<long> dat = calc(m);
// for (auto e : dat) {
// cout << e << endl;... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"call.arguments.change"
] | 1,035,030 | 1,035,029 | u560670090 | cpp |
p03241 | #include <bits/stdc++.h>
#include <iostream>
#include <vector>
using namespace std;
using ll = long long;
int main() {
ll n, m;
cin >> n >> m;
ll ans = 1;
for (ll i = 2; i * i <= m; i++) {
if (m % i == 0) {
ll temp = m / i;
if (temp >= n) {
ans = max(ans, i);
}
if (i >= n) {
... | #include <bits/stdc++.h>
#include <iostream>
#include <vector>
using namespace std;
using ll = long long;
int main() {
ll n, m;
cin >> n >> m;
ll ans = 1;
for (ll i = 1; i * i <= m; i++) {
if (m % i == 0) {
ll temp = m / i;
if (temp >= n) {
ans = max(ans, i);
}
if (i >= n) {
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,035,035 | 1,035,036 | u742493978 | cpp |
p03241 | /*input
*/
#include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
#define IOS ... | /*input
1 100
*/
#include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
#define IOS ... | [
"assignment.change"
] | 1,035,045 | 1,035,046 | u010467501 | cpp |
p03241 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int ans = 1;
for (int A = 1; A * A <= M; A++) {
//約数の判定をする！！！
if (M % A != 0)
continue;
int B = M / A;
if (A * N <= M)
ans = m... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int ans = 1;
for (int A = 1; A * A <= M; A++) {
//約数の判定をする！！！
if (M % A != 0)
continue;
int B = M / A;
if ((long)A * N <= M)
a... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 1,035,047 | 1,035,048 | u987412812 | cpp |
p03241 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
int main() {
int n, m, lyq = 0, ans;
cin >> n >> m;
ans = m / n;
for (int i = 1; i <= sqrt(m + 1); i++) {
if (i > ans)
break;
if (m % i == 0)
... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
int main() {
int n, m, lyq = 0, ans;
cin >> n >> m;
ans = m / n;
for (int i = 1; i <= sqrt(m + 1); i++) {
if (i > ans)
break;
if (m % i == 0)
... | [
"assignment.change"
] | 1,035,062 | 1,035,063 | u506205196 | cpp |
p03241 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cstdio>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
// #inc... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cstdio>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
// #inc... | [
"literal.number.change",
"call.arguments.change"
] | 1,035,066 | 1,035,067 | u304121198 | cpp |
p03241 | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, ans = 1;
long long m;
cin >> n >> m;
int d = m / n;
if (d < 10000000) {
for (int j = 1; j <= d; j++) {
if (m % j == 0) {
ans = j;
}
}
cout <<... | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, ans = 1;
long long m;
cin >> n >> m;
int d = m / n;
if (d < 100000000) {
for (int j = 1; j <= d; j++) {
if (m % j == 0) {
ans = j;
}
}
cout <... | [
"literal.number.change",
"control_flow.branch.if.condition.change",
"assignment.change"
] | 1,035,068 | 1,035,069 | u607741489 | cpp |
p03241 | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, ans = 1;
long long m;
cin >> n >> m;
int d = m / n;
if (d < 10000000) {
for (int j = 1; j <= d; j++) {
if (m % j == 0) {
ans = j;
}
}
cout <<... | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, ans = 1;
long long m;
cin >> n >> m;
int d = m / n;
if (d < 100000000) {
for (int j = 1; j <= d; j++) {
if (m % j == 0) {
ans = j;
}
}
cout <... | [
"literal.number.change",
"control_flow.branch.if.condition.change",
"assignment.change"
] | 1,035,068 | 1,035,070 | u607741489 | cpp |
p03241 | #include <iostream>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int n;
for (n = N; n >= 1; --n) {
if (M % n == 0) {
cout << n << endl;
return 0;
}
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int n;
for (n = M / N; n >= 1; --n) {
if (M % n == 0) {
cout << n << endl;
return 0;
}
}
return 0;
} | [
"control_flow.loop.for.initializer.change",
"assignment.change"
] | 1,035,071 | 1,035,072 | u432456012 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int ans = 1;
for (int i = 1; i * i <= m; --i) {
if (m % i == 0) {
if (m / i >= n) {
ans = max(ans, i);
}
if (m / (m / i) >= n) {
ans = max(ans, m / i);
}
}
}
cout << ans <<... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int ans = 1;
for (int i = 1; i * i <= m; ++i) {
if (m % i == 0) {
if (m / i >= n) {
ans = max(ans, i);
}
if (m / (m / i) >= n) {
ans = max(ans, m / i);
}
}
}
cout << ans <<... | [] | 1,035,077 | 1,035,078 | u209467566 | cpp |
p03241 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
vector<pair<ll, ll>> factorize(ll N) {
vector<pair<ll, ll>> res;
ll n = N;
for (ll p = 2; p * p <= n; p++) {
if (N % p != 0)
continue;
int count = 0;
w... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
vector<pair<ll, ll>> factorize(ll N) {
vector<pair<ll, ll>> res;
ll n = N;
for (ll p = 2; p * p <= n; p++) {
if (N % p != 0)
continue;
int count = 0;
w... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 1,035,095 | 1,035,096 | u957084285 | cpp |
p03241 | #include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const int MOD = 1000000007;
const double EPS = 1e-9;
int main() {
ci... | #include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const int MOD = 1000000007;
const double EPS = 1e-9;
int main() {
ci... | [
"variable_declaration.type.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 1,035,099 | 1,035,100 | u799021348 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, ans = 0;
cin >> n >> m;
for (int i = 2; i * i <= m; i++)
if (m % i == 0) {
int i1 = i, i2 = m / i;
if (i1 <= m / n && i1 > ans)
ans = i1;
if (i2 <= m / n && i2 > ans)
ans = i2;
}
cout << ans << endl;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, ans = 0;
cin >> n >> m;
for (int i = 1; i * i <= m; i++)
if (m % i == 0) {
int i1 = i, i2 = m / i;
if (i1 <= m / n && i1 > ans)
ans = i1;
if (i2 <= m / n && i2 > ans)
ans = i2;
}
cout << ans << endl;
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,035,101 | 1,035,102 | u504098542 | cpp |
p03241 | #include <iostream>
#include <math.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int t = m;
int now = 1;
int k = m / n;
int i;
if (n != 1)
for (i = k; i >= 2; i--) {
if (m % i == 0 && t / (now * i) >= n) {
m = m / i;
now *= i;
i++;
}
}
cout << ... | #include <iostream>
#include <math.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int t = m;
int now = 1;
int k = m / n;
int i;
if (n == 1)
now = m;
else
for (i = k; i >= 2; i--) {
if (m % i == 0 && t / (now * i) >= n) {
m = m / i;
now *= i;
i++;
... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"assignment.add",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 1,035,106 | 1,035,107 | u952247386 | cpp |
p03241 | #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, m;
cin >> n >> m;
if (m % n == 0) {
cout << m / n << endl;
... | #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, m;
cin >> n >> m;
if (m % n == 0) {
cout << m / n << endl;
... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.initializer.change"
] | 1,035,108 | 1,035,109 | u480831358 | cpp |
p03241 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <vector>
#define INF 1000000000
#define LM 55555
#define LL long long
using namespace ::std;
long long now, D, H, a, p, t, A, T, x[101], y[101], h[101], num, N, K, M, ans;
string S;
bool xy[100][100]... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <vector>
#define INF 1000000000
#define LM 55555
#define LL long long
using namespace ::std;
long long now, D, H, a, p, t, A, T, x[101], y[101], h[101], num, N, K, M, ans;
string S;
bool xy[100][100]... | [
"variable_declaration.add",
"control_flow.return.add",
"control_flow.return.0.add"
] | 1,035,112 | 1,035,113 | u568682546 | cpp |
p03241 | #include <algorithm>
#include <iostream>
#include <map>
#include <set>
#include <string>
using namespace std;
using ll = long long;
using ld = long double;
int main() {
ll N, M;
cin >> N >> M;
ll a = M / N;
for (int i = a; a > 0; --a) {
if (M % i == 0) {
cout << i << endl;
return 0;
}
... | #include <algorithm>
#include <iostream>
#include <map>
#include <set>
#include <string>
using namespace std;
using ll = long long;
using ld = long double;
int main() {
ll N, M;
cin >> N >> M;
ll a = M / N;
for (int i = a; i > 0; --i) {
if (M % i == 0) {
cout << i << endl;
return 0;
}
... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 1,035,118 | 1,035,119 | u588454863 | cpp |
p03241 | #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)
typedef long long LL;
typedef unsigned long UL;
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
int temp1 = m / n;
for (int ... | #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)
typedef long long LL;
typedef unsigned long UL;
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
int temp1 = m / n;
for (int ... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 1,035,120 | 1,035,121 | u549268855 | cpp |
p03246 |
#include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
const int MAXN = 1e5 + 10;
bool cmp(pair<int, int> &a, pair<int, int> &b) { return a.first > b.first; }
int main() {
int n;
cin >> n;
vector<int> v(n);
for (int i = 0... |
#include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
const int MAXN = 1e5 + 10;
bool cmp(pair<int, int> &a, pair<int, int> &b) { return a.first > b.first; }
int main() {
int n;
cin >> n;
vector<int> v(n);
for (int i = 0... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,035,190 | 1,035,191 | u467285925 | cpp |
p03246 | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1e6;
int n;
int a[maxn], b[maxn];
int mx[2], mw[2];
int main() {
scanf("%d", &n);
for (int l = 1; l <= n; l++) {
int wy;
scanf("%d", &wy);
if (l & 1)
a[wy]++;
else
b[wy]++;
}
for (int l = 1; l <= n; l++) {
int w... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1e6;
int n;
int a[maxn], b[maxn];
int mx[2], mw[2];
int main() {
scanf("%d", &n);
for (int l = 1; l <= n; l++) {
int wy;
scanf("%d", &wy);
if (l & 1)
a[wy]++;
else
b[wy]++;
}
for (int l = 1; l <= 1e5 + 10; l++) {
... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 1,035,192 | 1,035,193 | u728450427 | cpp |
p03246 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<ll, ll>;
using vi = vector<ll>;
using vvi = vector<vi>;
using vb = vector<bool>;
using vs = vector<string>;
using vp = vector<pii>;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define sz(x) (ll)((x).siz... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<ll, ll>;
using vi = vector<ll>;
using vvi = vector<vi>;
using vb = vector<bool>;
using vs = vector<string>;
using vp = vector<pii>;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define sz(x) (ll)((x).siz... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,035,238 | 1,035,239 | u073139376 | cpp |
p03246 | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define forn(i, a, b) for (int i = a; i < b; i++)
#define fi first
#define se second
#define fast ios_base::sync_with_stdio(false);
using namespace std;
typedef long long int ll;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef pair<ll, ll> ... | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define forn(i, a, b) for (int i = a; i < b; i++)
#define fi first
#define se second
#define fast ios_base::sync_with_stdio(false);
using namespace std;
typedef long long int ll;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef pair<ll, ll> ... | [
"assignment.variable.change",
"identifier.change"
] | 1,035,242 | 1,035,243 | u768225950 | cpp |
p03246 | #include <iostream>
#include <vector>
using namespace std;
const int M = 100000;
int main() {
int n, umax = 0, vmax = 0, usubmax = 0, vsubmax = 0, umode = 0, vmode = 0;
cin >> n;
vector<int> u, v, uc(M, 0), vc(M, 0);
for (int i = 0; i < n; i++) {
int m;
if (i % 2) {
cin >> m;
v.push_back(... | #include <iostream>
#include <vector>
using namespace std;
const int M = 100000;
int main() {
int n, umax = 0, vmax = 0, usubmax = 0, vsubmax = 0, umode = 0, vmode = 0;
cin >> n;
vector<int> u, v, uc(M, 0), vc(M, 0);
for (int i = 0; i < n; i++) {
int m;
if (i % 2) {
cin >> m;
v.push_back(... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 1,035,267 | 1,035,268 | u164385976 | cpp |
p03246 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i < n + 1; i++)
#define sort(A) sort(A.begin(), A.end())
#define reverse(A) reverse(A.begin(), A.end())
typedef long long ll;
typedef pair<int, int> P;
int main() {
int n;
cin >> n;
map<... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i < n + 1; i++)
#define sort(A) sort(A.begin(), A.end())
#define reverse(A) reverse(A.begin(), A.end())
typedef long long ll;
typedef pair<int, int> P;
int main() {
int n;
cin >> n;
map<... | [
"control_flow.branch.if.condition.change"
] | 1,035,292 | 1,035,293 | u132364782 | cpp |
p03246 | #include <bits/stdc++.h>
const int MAXN = 1e5 + 10;
int n, ans;
struct Node {
int cnt, val;
} a[MAXN], b[MAXN];
int main() {
scanf("%d", &n);
for (int i = 1, x; i <= n; ++i) {
scanf("%d", &x);
if (i & 1)
++a[x].cnt, a[x].val = x;
++b[x].cnt, b[x].val = x;
}
std::sort(a + 1, a + MAXN, [](No... | #include <bits/stdc++.h>
const int MAXN = 1e5 + 10;
int n, ans;
struct Node {
int cnt, val;
} a[MAXN], b[MAXN];
int main() {
scanf("%d", &n);
for (int i = 1, x; i <= n; ++i) {
scanf("%d", &x);
if (i & 1)
++a[x].cnt, a[x].val = x;
else
++b[x].cnt, b[x].val = x;
}
std::sort(a + 1, a +... | [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 1,035,298 | 1,035,299 | u965088197 | cpp |
p03246 | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <... | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <... | [
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 1,035,308 | 1,035,309 | u894275299 | cpp |
p03246 | #include <algorithm>
#include <cstdio>
#include <map>
#include <vector>
using namespace std;
int main() {
int n, ans = 1e9, i;
vector<pair<int, int>> v, w;
map<int, int> mp1, mp2;
map<int, int>::iterator it;
scanf("%d", &n);
for (i = 0; i < n; i++) {
int x;
scanf("%d", &x);
if (i % 2 == 0)... | #include <algorithm>
#include <cstdio>
#include <map>
#include <vector>
using namespace std;
int main() {
int n, ans = 1e9, i;
vector<pair<int, int>> v, w;
map<int, int> mp1, mp2;
map<int, int>::iterator it;
scanf("%d", &n);
for (i = 0; i < n; i++) {
int x;
scanf("%d", &x);
if (i % 2 == 0)... | [
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,035,312 | 1,035,313 | u649618744 | cpp |
p03246 | #include <bits/stdc++.h>
using namespace std;
int a[100003], b[100003], c[100003], b1, b2, c1, c2, ans, N, b3, c3;
bool q, w;
int main() {
cin >> N;
for (int i = 1; i <= N; i++) {
cin >> a[i];
if (i % 2 == 1)
b[a[i]]++;
else
c[a[i]]++;
}
for (int i = 1; i <= 100000; i++) {
b1 = max(b... | #include <bits/stdc++.h>
using namespace std;
int a[100003], b[100003], c[100003], b1, b2, c1, c2, ans, N, b3, c3;
bool q, w;
int main() {
cin >> N;
for (int i = 1; i <= N; i++) {
cin >> a[i];
if (i % 2 == 1)
b[a[i]]++;
else
c[a[i]]++;
}
for (int i = 1; i <= 100000; i++) {
b1 = max(b... | [
"misc.opposites",
"control_flow.branch.if.condition.change",
"literal.number.change"
] | 1,035,316 | 1,035,317 | u217830224 | cpp |
p03246 | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
#define N 100000
pair<int, int> odd[N], even[N];
int main(void) {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
if (i % 2 == 0) {
even[a[i]].first++;
even[a[i]].second = a[i];
} else... | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
#define N 100000
pair<int, int> odd[N], even[N];
int main(void) {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
if (i % 2 == 0) {
even[a[i]].first++;
even[a[i]].second = a[i];
} else... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,035,320 | 1,035,321 | u774263141 | cpp |
p03246 | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
int main(void) {
int n;
cin >> n;
map<int, int> m[2];
for (int i = 0; i < n; i++) {
int x;
cin >> x;
m[i % 2][x]++;
}
int v1[2] = {0}, c1[2] = {0}, c2[2] = {0};
for (int i = 0; i < 2; i++) {
for (auto j : m[i]) {
... | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
int main(void) {
int n;
cin >> n;
map<int, int> m[2];
for (int i = 0; i < n; i++) {
int x;
cin >> x;
m[i % 2][x]++;
}
int v1[2] = {0}, c1[2] = {0}, c2[2] = {0};
for (int i = 0; i < 2; i++) {
for (auto j : m[i]) {
... | [
"identifier.change",
"io.output.change",
"literal.number.change",
"variable_access.subscript.index.change"
] | 1,035,322 | 1,035,323 | u774263141 | cpp |
p03246 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORR(i, a, b) for (ll i = (a); i <= (b); i++)
#define repR(i, n) for (ll i = n; i >= 0; i--)
#define all(v) (v).begin(), (v).end()
#define rall(v)... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORR(i, a, b) for (ll i = (a); i <= (b); i++)
#define repR(i, n) for (ll i = n; i >= 0; i--)
#define all(v) (v).begin(), (v).end()
#define rall(v)... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 1,035,334 | 1,035,335 | u103850114 | cpp |
p03246 | #include <bits/stdc++.h>
#define pii pair<int, int>
#define ll long long
#define F first
#define S second
#define mp make_pair
using namespace std;
const int N = 1e5 + 123;
int n;
int a[N], cnt1[N], cnt2[N], ans = N;
pii x, y, p;
set<pii> s, t;
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >... | #include <bits/stdc++.h>
#define pii pair<int, int>
#define ll long long
#define F first
#define S second
#define mp make_pair
using namespace std;
const int N = 1e5 + 123;
int n;
int a[N], cnt1[N], cnt2[N], ans = N;
pii x, y, p;
set<pii> s, t;
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >... | [
"call.arguments.change",
"call.function.change"
] | 1,035,347 | 1,035,348 | u909486901 | cpp |
p03246 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0), cin.tie(0);
int N;
cin >> N;
map<int, int> mp[2];
for (int i = 0; i < N; i++) {
int a;
cin >> a;
mp[i % 2][a]++;
}
vector<pair<int, int>> vecs[2];
for (int p = 0; p < 2; p++) {
mp[p].emplace(0, 0);
f... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0), cin.tie(0);
int N;
cin >> N;
map<int, int> mp[2];
for (int i = 0; i < N; i++) {
int a;
cin >> a;
mp[i % 2][a]++;
}
vector<pair<int, int>> vecs[2];
for (int p = 0; p < 2; p++) {
mp[p].emplace(0, 0);
f... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,035,354 | 1,035,355 | u142891994 | cpp |
p03246 | #include <algorithm>
#include <iostream>
#include <map>
#include <numeric>
#include <vector>
using namespace std;
int main() {
size_t n{};
cin >> n;
vector<int> v(n);
for (auto &it : v)
cin >> it;
map<size_t, size_t> m[2];
for (size_t i = 0; i < n; ++i)
++m[i % 2][v[i]];
vector<pair<size_t, si... | #include <algorithm>
#include <iostream>
#include <map>
#include <numeric>
#include <vector>
using namespace std;
int main() {
size_t n{};
cin >> n;
vector<int> v(n);
for (auto &it : v)
cin >> it;
map<size_t, size_t> m[2];
for (size_t i = 0; i < n; ++i)
++m[i % 2][v[i]];
vector<pair<size_t, si... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,035,362 | 1,035,363 | u966065309 | cpp |
p03246 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define endl "\n"
#define mod 1000000007
#define fastio \
std::ios::sync_with_stdio(false); \
cin.tie(NULL); ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define endl "\n"
#define mod 1000000007
#define fastio \
std::ios::sync_with_stdio(false); \
cin.tie(NULL); ... | [
"assignment.variable.change",
"identifier.change"
] | 1,035,367 | 1,035,368 | u544218562 | cpp |
p03246 | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
#define pb push_back
#define mp make_pair
#define eps 1e-9
#define INF 2000000000
#define sz(x) ((int)(x).size())
#define fi first
#define sec second
#define all(x) (x).begin(), ... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
#define pb push_back
#define mp make_pair
#define eps 1e-9
#define INF 2000000000
#define sz(x) ((int)(x).size())
#define fi first
#define sec second
#define all(x) (x).begin(), ... | [
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,035,370 | 1,035,371 | u379947938 | cpp |
p03246 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
#define ALL(v) (v).begin(), (v).end()
#define int long long
using namespace std;
typedef vector<int> vint;
typedef pair<int, int> pint;
int cnt1[100005], cnt2[100005];
signed main() {
int N;
cin >> N;
REP(i, N) {
int t;
cin >> t;
... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
#define ALL(v) (v).begin(), (v).end()
#define int long long
using namespace std;
typedef vector<int> vint;
typedef pair<int, int> pint;
int cnt1[100005], cnt2[100005];
signed main() {
int N;
cin >> N;
REP(i, N) {
int t;
cin >> t;
... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 1,035,389 | 1,035,390 | u738450435 | cpp |
p03246 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int maxn = 100010;
int v[maxn], cnt[2][maxn];
int main() {
int n;
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", v + i);
cnt[i & 1][v[i]]++;
}
int ans = n, max_cnt = 0, sec_cnt = 0, max_v... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int maxn = 100010;
int v[maxn], cnt[2][maxn];
int main() {
int n;
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", v + i);
cnt[i & 1][v[i]]++;
}
int ans = n, max_cnt = 0, sec_cnt = 0, max_v... | [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 1,035,395 | 1,035,396 | u396746872 | cpp |
p03246 | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> even(n / 2), odd(n / 2);
int i_even = 0, i_odd = 0;
for (int i = 0; i < n; i++) {
if (i % 2 == 0)
cin >> even[i_even++];
else
cin >> odd[i_odd++];
}... | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> even(n / 2), odd(n / 2);
int i_even = 0, i_odd = 0;
for (int i = 0; i < n; i++) {
if (i % 2 == 0)
cin >> even[i_even++];
else
cin >> odd[i_odd++];
}... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,035,431 | 1,035,432 | u939260103 | cpp |
p03246 | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> even(n / 2), odd(n / 2);
int i_even = 0, i_odd = 0;
for (int i = 0; i < n; i++) {
if (i % 2 == 0)
cin >> even[i_even++];
else
cin >> odd[i_odd++];
}... | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> even(n / 2), odd(n / 2);
int i_even = 0, i_odd = 0;
for (int i = 0; i < n; i++) {
if (i % 2 == 0)
cin >> even[i_even++];
else
cin >> odd[i_odd++];
}... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,035,431 | 1,035,433 | u939260103 | cpp |
p03246 | /* Just_Do_It ___________ICARUS__________________*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); ... | /* Just_Do_It ___________ICARUS__________________*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); ... | [
"identifier.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 1,035,438 | 1,035,439 | u920161031 | cpp |
p03246 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#includ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#includ... | [
"io.output.change"
] | 1,035,440 | 1,035,441 | u344412812 | cpp |
p03246 | #include <cstdio>
#include <iostream>
using namespace std;
int x[2][100010], n, v[2], m[2], k, t, q[2];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &k);
t = i % 2;
x[t][k]++;
if (m[t] < x[t][k]) {
m[t] = x[t][k];
v[t] = i;
}
}
if (v[0] != v[1])
co... | #include <cstdio>
#include <iostream>
using namespace std;
int x[2][100010], n, v[2], m[2], k, t, q[2];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &k);
t = i % 2;
x[t][k]++;
if (m[t] < x[t][k]) {
m[t] = x[t][k];
v[t] = k;
}
}
if (v[0] != v[1])
co... | [
"assignment.value.change",
"identifier.change",
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 1,035,458 | 1,035,457 | u323497460 | cpp |
p03246 |
// include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#inclu... |
// include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#inclu... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 1,035,471 | 1,035,472 | u874996917 | cpp |
p03246 | #include <bits/stdc++.h>
using namespace std;
#define MN 100000
int u[2][MN + 5];
int main() {
int n, i, j, x, mx, ans = 0;
scanf("%d", &n);
for (i = 1; i <= n; ++i)
scanf("%d", &x), ++u[i & 1][x];
for (x = 0; x < 2; ++x) {
for (i = 1, mx = 0; i <= MN; ++i)
mx = max(mx, u[x][i]);
for (i = 1; i... | #include <bits/stdc++.h>
using namespace std;
#define MN 100000
int u[2][MN + 5];
int main() {
int n, i, j, x, mx, ans = MN;
scanf("%d", &n);
for (i = 1; i <= n; ++i)
scanf("%d", &x), ++u[i & 1][x];
for (x = 0; x < 2; ++x) {
for (i = 1, mx = 0; i <= MN; ++i)
mx = max(mx, u[x][i]);
for (i = 1; ... | [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove",
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 1,035,475 | 1,035,476 | u777986894 | cpp |
p03246 | #pragma GCC optimize(2)
#pragma GCC optimize(3)
#pragma GCC optimize(4)
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pi acos(-1.0)
#define LL long long
//#define mp make_pair
#define pb push_back
#define ls rt << 1, l, m
#define rs rt << 1 | 1, m + 1, r
#define ULL unsigned L... | #pragma GCC optimize(2)
#pragma GCC optimize(3)
#pragma GCC optimize(4)
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pi acos(-1.0)
#define LL long long
//#define mp make_pair
#define pb push_back
#define ls rt << 1, l, m
#define rs rt << 1 | 1, m + 1, r
#define ULL unsigned L... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 1,035,477 | 1,035,478 | u980716006 | cpp |
p03246 | #include <algorithm>
#include <bitset>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
#define n 200000
#define loop(i, a, b) for (int i = a; i <= b; i++)
#define mem(arr... | #include <algorithm>
#include <bitset>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
#define n 200000
#define loop(i, a, b) for (int i = a; i <= b; i++)
#define mem(arr... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 1,035,493 | 1,035,494 | u073500051 | cpp |
p03246 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int n;
cin >> n;
vector<int> odd(100010, 0);
vector<int> even(100010, 0);
int odd_sum = 0, even_sum = 0;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
if (i % 2 == 0) {
odd[a]++;
odd_sum++;
} else {... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int n;
cin >> n;
vector<int> odd(100100, 0);
vector<int> even(100100, 0);
int odd_sum = 0, even_sum = 0;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
if (i % 2 == 0) {
odd[a]++;
odd_sum++;
} else {... | [
"literal.number.change",
"call.arguments.change",
"control_flow.branch.if.condition.change"
] | 1,035,496 | 1,035,497 | u550014122 | cpp |
p03246 | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
//#include <regex>
using namespace std;
typedef long long LL;
typedef long double LD;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
typedef pair<double, LL> PDL;
typedef vector<int> VI;
typedef vector<LL> VL;
typedef vector<VI> VVI;
typedef vector<VL> VVL;
... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
//#include <regex>
using namespace std;
typedef long long LL;
typedef long double LD;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
typedef pair<double, LL> PDL;
typedef vector<int> VI;
typedef vector<LL> VL;
typedef vector<VI> VVI;
typedef vector<VL> VVL;
... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 1,035,521 | 1,035,522 | u209449507 | cpp |
p03246 | #include <algorithm>
#include <bitset>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#in... | #include <algorithm>
#include <bitset>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#in... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,035,543 | 1,035,544 | u508571192 | cpp |
p03246 | #include <bits/stdc++.h>
using namespace std;
#define next Next
const int N = 1e6 + 5;
int n, cnt1, cnt2, gs, ama1, aid1, ama2, aid2, bma1, bid1, bma2, bid2, a[N],
b[N];
/*char buf[1<<21],*p1=buf,*p2=buf;
inline int gc(){return
p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++;}*/
#define gc getchar
i... | #include <bits/stdc++.h>
using namespace std;
#define next Next
const int N = 1e6 + 5;
int n, cnt1, cnt2, gs, ama1, aid1, ama2, aid2, bma1, bid1, bma2, bid2, a[N],
b[N];
/*char buf[1<<21],*p1=buf,*p2=buf;
inline int gc(){return
p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++;}*/
#define gc getchar
i... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 1,035,549 | 1,035,550 | u447610671 | cpp |
p03246 | #include <bits/stdc++.h>
using namespace std;
typedef long double ld;
typedef long long int ll;
const ll logx = 30;
const ll N = 4e5 + 5;
const ll M = 3e5 + 5;
const ll mod = 1e9 + 7;
const ll INF = 1e18 + 5;
const double PI = 3.14159265358979323846;
#define ints(n) scanf("%d", &n)
#define intp(n) printf("%d\n", n)
#... | #include <bits/stdc++.h>
using namespace std;
typedef long double ld;
typedef long long int ll;
const ll logx = 30;
const ll N = 4e5 + 5;
const ll M = 3e5 + 5;
const ll mod = 1e9 + 7;
const ll INF = 1e18 + 5;
const double PI = 3.14159265358979323846;
#define ints(n) scanf("%d", &n)
#define intp(n) printf("%d\n", n)
#... | [
"variable_declaration.value.change"
] | 1,035,575 | 1,035,576 | u416273217 | cpp |
p03246 | #include <bits/stdc++.h>
using namespace std;
typedef long double ld;
typedef long long int ll;
const ll logx = 30;
const ll N = 4e5 + 5;
const ll M = 3e5 + 5;
const ll mod = 1e9 + 7;
const ll INF = 1e18 + 5;
const double PI = 3.14159265358979323846;
#define ints(n) scanf("%d", &n)
#define intp(n) printf("%d\n", n)
#... | #include <bits/stdc++.h>
using namespace std;
typedef long double ld;
typedef long long int ll;
const ll logx = 30;
const ll N = 4e5 + 5;
const ll M = 3e5 + 5;
const ll mod = 1e9 + 7;
const ll INF = 1e18 + 5;
const double PI = 3.14159265358979323846;
#define ints(n) scanf("%d", &n)
#define intp(n) printf("%d\n", n)
#... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"variable_declaration.value.change"
] | 1,035,577 | 1,035,576 | u416273217 | cpp |
p03246 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <string>
#include <sys/time.h>
#include <tuple>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
void solve(long long n, vector<long long> v) {
... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <string>
#include <sys/time.h>
#include <tuple>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
void solve(long long n, vector<long long> v) {
... | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 1,035,651 | 1,035,652 | u462434199 | cpp |
p03246 | #include <bits/stdc++.h>
#define LiangJiaJun main
#define pa pair<int, int>
using namespace std;
int n, gb[100004], ga[100004];
pa sa[100004], sb[100004];
int LiangJiaJun() {
memset(gb, 0, sizeof(gb));
memset(ga, 0, sizeof(ga));
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
int x;
scanf("%d", &x);
... | #include <bits/stdc++.h>
#define LiangJiaJun main
#define pa pair<int, int>
using namespace std;
int n, gb[100004], ga[100004];
pa sa[100004], sb[100004];
int LiangJiaJun() {
memset(gb, 0, sizeof(gb));
memset(ga, 0, sizeof(ga));
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
int x;
scanf("%d", &x);
... | [
"expression.operation.binary.add"
] | 1,035,678 | 1,035,679 | u628253919 | cpp |
p03246 | #include <bits/stdc++.h>
#define F first
#define S second
#define vc vector
#define INF (0x3f3f3f3f)
#define LINF ((long long)(0x3f3f3f3f3f3f3f3f))
#define Pb push_back
#define Mp make_pair
#define ll long long
#define _tp template
#define _tyn typename
#define Pf push_front
#define ull unsigned ll
#define pii pair<int... | #include <bits/stdc++.h>
#define F first
#define S second
#define vc vector
#define INF (0x3f3f3f3f)
#define LINF ((long long)(0x3f3f3f3f3f3f3f3f))
#define Pb push_back
#define Mp make_pair
#define ll long long
#define _tp template
#define _tyn typename
#define Pf push_front
#define ull unsigned ll
#define pii pair<int... | [
"assignment.change"
] | 1,035,732 | 1,035,733 | u065793287 | cpp |
p03246 | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> ii;
#define X first
#define Y second
map<int, int> ma[2];
ii ch[2];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
ma[i & 1][x]++;
}
int ans = n;
for (auto j : ma[0]) {
if (j.Y > ch[1].Y)
... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> ii;
#define X first
#define Y second
map<int, int> ma[2];
ii ch[2];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
ma[i & 1][x]++;
}
int ans = n;
for (auto j : ma[0]) {
if (j.Y > ch[1].Y)
... | [
"identifier.replace.remove",
"literal.replace.add",
"variable_access.subscript.index.change"
] | 1,035,761 | 1,035,762 | u596976719 | cpp |
p03246 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const double PI = 4 * atan(1);
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3f;
const double EPS = 1e-6;
const string YES = "Possible";
const string NO = "Impossible";
#define pb push_back
#define mp make_pair
const int MAX_N = 1e5 + 5;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const double PI = 4 * atan(1);
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3f;
const double EPS = 1e-6;
const string YES = "Possible";
const string NO = "Impossible";
#define pb push_back
#define mp make_pair
const int MAX_N = 1e5 + 5;
... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 1,035,785 | 1,035,786 | u570770016 | cpp |
p03246 | #include "bits/stdc++.h"
using namespace std;
int a[100010];
typedef pair<int, int> pii;
int main(int argc, char const *argv[]) {
/* code */
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
map<int, int> cnt1, cnt2;
for (int i = 1; i <= n; i += 2) {
cnt1[a[i]] += 1;
}
for (int i... | #include "bits/stdc++.h"
using namespace std;
int a[100010];
typedef pair<int, int> pii;
int main(int argc, char const *argv[]) {
/* code */
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
map<int, int> cnt1, cnt2;
for (int i = 1; i <= n; i += 2) {
cnt1[a[i]] += 1;
}
for (int i... | [
"io.output.change"
] | 1,035,820 | 1,035,821 | u669432519 | cpp |
p03246 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
#define pb push_back
#define rep(i, a, n) for (int i = (a); i < (n); i++)
#define dep(i, a, n) for (int i = (a); i >= (n); i--)
#define mod (ll)(1e9 + 7)
#define int ll
__attribute__((construct... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
#define pb push_back
#define rep(i, a, n) for (int i = (a); i < (n); i++)
#define dep(i, a, n) for (int i = (a); i >= (n); i--)
#define mod (ll)(1e9 + 7)
#define int ll
__attribute__((construct... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 1,035,835 | 1,035,836 | u986898382 | cpp |
p03246 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define forx(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, ans = 1e9, amax = 0, bmax = 0, af, bf;
cin >> n;
map<int, int> a, b;
rep(i,... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define forx(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, ans = 1e9, amax = 0, bmax = 0, af, bf;
cin >> n;
map<int, int> a, b;
rep(i,... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"expression.operator.arithmetic.change",
"io.output.change"
] | 1,035,885 | 1,035,884 | u604231488 | cpp |
p03248 | #include <algorithm>
#include <array>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctype.h>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stac... | #include <algorithm>
#include <array>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctype.h>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stac... | [
"assignment.add"
] | 1,035,954 | 1,035,955 | u224756887 | cpp |
p03248 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
template... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
template... | [
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 1,035,970 | 1,035,971 | u408910484 | cpp |
p03248 | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
... | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 1,035,976 | 1,035,977 | u415325136 | cpp |
p03248 | #include <bits/stdc++.h>
using namespace std;
char s[200010];
int main() {
scanf("%s", s + 1);
int n = strlen(s + 1);
int flag = 1;
if (s[1] == '0' || s[n] == '1')
flag = 0;
for (int i = 1; i <= n; i++)
if (s[i] != s[n - i])
flag = 0;
if (!flag) {
puts("-1");
return 0;
}
int now ... | #include <bits/stdc++.h>
using namespace std;
char s[200010];
int main() {
scanf("%s", s + 1);
int n = strlen(s + 1);
int flag = 1;
if (s[1] == '0' || s[n] == '1')
flag = 0;
for (int i = 1; i < n; i++)
if (s[i] != s[n - i])
flag = 0;
if (!flag) {
puts("-1");
return 0;
}
int now =... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,035,982 | 1,035,983 | u900300481 | cpp |
p03248 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pdd;
typedef vector<ll> vll;
typedef vector<ld> vld;
typedef vector<pll> vpl;
typedef vector<vll> vvll;
#define ALL(a) a.begin(), a.end()
#define SZ(a)... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pdd;
typedef vector<ll> vll;
typedef vector<ld> vld;
typedef vector<pll> vpl;
typedef vector<vll> vvll;
#define ALL(a) a.begin(), a.end()
#define SZ(a)... | [
"control_flow.branch.if.condition.change"
] | 1,035,988 | 1,035,989 | u194908943 | cpp |
p03248 | #include <bits/stdc++.h>
#ifdef __DEBUG__
#define DBG(X) cout << #X << " = " << (X) << endl;
#define SAY(X) cout << (X) << endl;
#else
#define DBG(X)
#define SAY(X)
#endif
using namespace std;
using ll = long long int;
using ull = unsigned long long int;
using ld = long double;
using pii = pair<int, int>;
using pll =... | #include <bits/stdc++.h>
#ifdef __DEBUG__
#define DBG(X) cout << #X << " = " << (X) << endl;
#define SAY(X) cout << (X) << endl;
#else
#define DBG(X)
#define SAY(X)
#endif
using namespace std;
using ll = long long int;
using ull = unsigned long long int;
using ld = long double;
using pii = pair<int, int>;
using pll =... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 1,035,996 | 1,035,995 | u858670323 | cpp |
p03248 | #include <bits/stdc++.h>
/*
// ordered_set
# include <ext/pb_ds/assoc_container.hpp>
# include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
# define ordered_set tree<int, null_type,less<int>,
rb_tree_tag,tree_order_statistics_node_update>
*/
using namespace std;
typedef long long ll;
typedef long double ld... | #include <bits/stdc++.h>
/*
// ordered_set
# include <ext/pb_ds/assoc_container.hpp>
# include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
# define ordered_set tree<int, null_type,less<int>,
rb_tree_tag,tree_order_statistics_node_update>
*/
using namespace std;
typedef long long ll;
typedef long double ld... | [
"variable_declaration.value.change"
] | 1,036,006 | 1,036,007 | u418541852 | cpp |
p03248 | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define REP(i, s, n) for (int i = s; i < n; i++)
#define NUM 2520
#define INF (1LL << 50)
#define DEBUG 0
#define mp(a, b) make_pair(a, b)
#define SORT(V) sort(V.begin(), V.end())
#define PI (3.141592653589794)
#define TO_STRING(VariableName) #Var... | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define REP(i, s, n) for (int i = s; i < n; i++)
#define NUM 2520
#define INF (1LL << 50)
#define DEBUG 0
#define mp(a, b) make_pair(a, b)
#define SORT(V) sort(V.begin(), V.end())
#define PI (3.141592653589794)
#define TO_STRING(VariableName) #Var... | [
"control_flow.return.add"
] | 1,036,011 | 1,036,012 | u041513069 | cpp |
p03248 | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define REP(i, s, n) for (int i = s; i < n; i++)
#define NUM 2520
#define INF (1LL << 50)
#define DEBUG 0
#define mp(a, b) make_pair(a, b)
#define SORT(V) sort(V.begin(), V.end())
#define PI (3.141592653589794)
#define TO_STRING(VariableName) #Var... | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define REP(i, s, n) for (int i = s; i < n; i++)
#define NUM 2520
#define INF (1LL << 50)
#define DEBUG 0
#define mp(a, b) make_pair(a, b)
#define SORT(V) sort(V.begin(), V.end())
#define PI (3.141592653589794)
#define TO_STRING(VariableName) #Var... | [
"control_flow.return.add",
"assignment.change"
] | 1,036,013 | 1,036,012 | u041513069 | cpp |
p03248 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define flush fflush(stdout)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, int> Pl;
const int mod = (int)1e9 + 7, INF = (int)1e9;
const int di[4] = {1, 0, -1, 0}, dj[4] = {0, 1, 0, -1};
int main(void) {... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define flush fflush(stdout)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, int> Pl;
const int mod = (int)1e9 + 7, INF = (int)1e9;
const int di[4] = {1, 0, -1, 0}, dj[4] = {0, 1, 0, -1};
int main(void) {... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 1,036,014 | 1,036,015 | u088895504 | cpp |
p03248 | #include <iostream>
#include <string>
using namespace std;
bool pal(std::string const &s) {
return s == std::string(s.rbegin(), s.rend());
}
int main(void) {
string s;
cin >> s;
int n = s.size();
s = "0" + s;
if (!pal(s) || !s[1]) {
cout << -1 << endl;
} else {
int r = 1;
for (int i = 2; i... | #include <iostream>
#include <string>
using namespace std;
bool pal(std::string const &s) {
return s == std::string(s.rbegin(), s.rend());
}
int main(void) {
string s;
cin >> s;
int n = s.size();
s = "0" + s;
if (!pal(s) || s[1] == '0') {
cout << -1 << endl;
} else {
int r = 1;
for (int i ... | [
"expression.operation.unary.logical.remove",
"control_flow.branch.if.condition.change"
] | 1,036,035 | 1,036,036 | u976833038 | cpp |
p03244 | #include <bits/stdc++.h>
#include <numeric>
#include <string.h>
using namespace std;
///////////////////////////////////////////
// const long long int INF = 1000000000000000000LL;
const long long int INF = 1000000;
using ll = long long int;
using vi = vector<int>;
using Vi = vector<long long int>;
#define pb push_ba... | #include <bits/stdc++.h>
#include <numeric>
#include <string.h>
using namespace std;
///////////////////////////////////////////
// const long long int INF = 1000000000000000000LL;
const long long int INF = 1000000;
using ll = long long int;
using vi = vector<int>;
using Vi = vector<long long int>;
#define pb push_ba... | [
"assignment.change"
] | 1,036,047 | 1,036,048 | u896014917 | cpp |
p03244 | #include <bits/stdc++.h>
#define rep(i, m, n) for (int i = m; i < (n); i++)
#define print(x) cout << (x) << endl;
#define printa(x, n) \
for (int i = 0; i < n; i++) { \
cout << (x[i]) << " "; ... | #include <bits/stdc++.h>
#define rep(i, m, n) for (int i = m; i < (n); i++)
#define print(x) cout << (x) << endl;
#define printa(x, n) \
for (int i = 0; i < n; i++) { \
cout << (x[i]) << " "; ... | [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 1,036,056 | 1,036,057 | u218842729 | cpp |
p03244 | #include <iostream>
#include <vector>
using namespace std;
typedef pair<int, int> P;
int ans1 = 0;
int ans2 = 0;
int n = 0;
long oV[100001] = {0};
long eV[100001] = {0};
int main() {
cin >> n;
P oddN, evenN;
for (int i = 1; i <= n; i++) {
int x;
cin >> x;
if (i % 2 != 0) {
oV[x] += 1;
} e... | #include <iostream>
#include <vector>
using namespace std;
typedef pair<int, int> P;
int ans1 = 0;
int ans2 = 0;
int n = 0;
long oV[100001] = {0};
long eV[100001] = {0};
int main() {
cin >> n;
P oddN, evenN;
for (int i = 1; i <= n; i++) {
int x;
cin >> x;
if (i % 2 != 0) {
oV[x] += 1;
} e... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,036,060 | 1,036,061 | u355798276 | cpp |
p03244 | #include <iostream>
#include <vector>
using namespace std;
typedef pair<int, int> P;
int ans1 = 0;
int ans2 = 0;
int n = 0;
int oV[100001] = {0};
int eV[100001] = {0};
int main() {
cin >> n;
P oddN, evenN;
for (int i = 1; i <= n; i++) {
int x;
cin >> x;
if (i % 2 != 0) {
oV[x] += 1;
} els... | #include <iostream>
#include <vector>
using namespace std;
typedef pair<int, int> P;
int ans1 = 0;
int ans2 = 0;
int n = 0;
long oV[100001] = {0};
long eV[100001] = {0};
int main() {
cin >> n;
P oddN, evenN;
for (int i = 1; i <= n; i++) {
int x;
cin >> x;
if (i % 2 != 0) {
oV[x] += 1;
} e... | [
"variable_declaration.type.primitive.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"assignment.value.change"
] | 1,036,062 | 1,036,061 | u355798276 | cpp |
p03244 |
#if 1
#include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <cstdint>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#in... |
#if 1
#include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <cstdint>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#in... | [
"function.return_value.change"
] | 1,036,070 | 1,036,071 | u935586669 | cpp |
p03244 | /// ITNOG :)))
/// SAliB
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define pp pop_back
#define mp make_pair
#define fi first
#define sec second
#define xmax(x, y) ((x) = max((x), (y)))
#define xmin(x, y) ((x) = min((x), (y)))
#define all(x) (x).begin(), (x).end()
#define mem(x, y) memset(x, y... | /// ITNOG :)))
/// SAliB
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define pp pop_back
#define mp make_pair
#define fi first
#define sec second
#define xmax(x, y) ((x) = max((x), (y)))
#define xmin(x, y) ((x) = min((x), (y)))
#define all(x) (x).begin(), (x).end()
#define mem(x, y) memset(x, y... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,036,082 | 1,036,083 | u835879071 | cpp |
p03244 | #include <algorithm>
#include <iostream>
#include <map>
#include <set>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
map<int, int> e, o;
for (int i = 0; i < (n / 2); i++) {
int temp;
cin >> temp;
e[temp]++;
cin >> temp;
o[temp]++;
}
int e1 = 0, e2 = 0, e_max;
... | #include <algorithm>
#include <iostream>
#include <map>
#include <set>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
map<int, int> e, o;
for (int i = 0; i < (n / 2); i++) {
int temp;
cin >> temp;
e[temp]++;
cin >> temp;
o[temp]++;
}
int e1 = 0, e2 = 0, e_max;
... | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 1,036,086 | 1,036,087 | u189870205 | cpp |
p03244 | #include <algorithm>
#include <cstring>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
const int MAXN = 1e5 + 7;
int ans[MAXN];
int v1[MAXN];
int v2[MAXN];
bool cmp(int a, int b) { return a > b; }
int main() {
int n;
cin >> n;
for (int i = 1; i <=... | #include <algorithm>
#include <cstring>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
const int MAXN = 1e5 + 7;
int ans[MAXN];
int v1[MAXN];
int v2[MAXN];
bool cmp(int a, int b) { return a > b; }
int main() {
int n;
cin >> n;
for (int i = 1; i <=... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 1,036,109 | 1,036,110 | u049933323 | cpp |
p03244 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; ++i) {
cin >> v[i];
}
map<int, int> odds, evens;
for (int i = 0; i < n; ++i) {
if (i % 2) {
odds[v[i]]++;
} else {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; ++i) {
cin >> v[i];
}
map<int, int> odds, evens;
for (int i = 0; i < n; ++i) {
if (i % 2) {
odds[v[i]]++;
} else {
... | [
"call.function.change",
"call.arguments.change"
] | 1,036,119 | 1,036,120 | u838194315 | cpp |
p03244 | #include <bits/stdc++.h>
typedef long long ll;
int main(int argc, char const *argv[]) {
ll n;
std::cin >> n;
ll v[n];
for (size_t i = 0; i < n; i++) {
std::cin >> v[i];
}
std::map<ll, ll> even{};
std::map<ll, ll> odd{};
for (size_t i = 0; i < n; i++) {
if (i % 2 == 0) {
even[v[i]] += 1;
... | #include <bits/stdc++.h>
typedef long long ll;
int main(int argc, char const *argv[]) {
ll n;
std::cin >> n;
ll v[n];
for (size_t i = 0; i < n; i++) {
std::cin >> v[i];
}
std::map<ll, ll> even{};
std::map<ll, ll> odd{};
for (size_t i = 0; i < n; i++) {
if (i % 2 == 0) {
even[v[i]] += 1;
... | [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 1,036,121 | 1,036,122 | u267325300 | cpp |
p03244 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#define FOR(i, a, b) for (size_t i = a; i < b; i++)
#define REP(i, b) FOR(i, 0, b)
#define RFOR(i, a, b) for (size_t i = a - 1; i >= b; i--)
#define RREP(i, a) RFOR(i, a, 0)
#define INF 1e7
int p1[111111], p2[111111];
vector<int> a, b;
in... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#define FOR(i, a, b) for (size_t i = a; i < b; i++)
#define REP(i, b) FOR(i, 0, b)
#define RFOR(i, a, b) for (size_t i = a - 1; i >= b; i--)
#define RREP(i, a) RFOR(i, a, 0)
#define INF 1e7
int p1[111111], p2[111111];
vector<int> a, b;
in... | [
"literal.number.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,036,135 | 1,036,136 | u007637377 | cpp |
p03244 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#define FOR(i, a, b) for (size_t i = a; i < b; i++)
#define REP(i, b) FOR(i, 0, b)
#define RFOR(i, a, b) for (size_t i = a - 1; i >= b; i--)
#define RREP(i, a) RFOR(i, a, 0)
#define INF 1e7
int p1[111111], p2[111111];
vector<int> a, b;
in... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#define FOR(i, a, b) for (size_t i = a; i < b; i++)
#define REP(i, b) FOR(i, 0, b)
#define RFOR(i, a, b) for (size_t i = a - 1; i >= b; i--)
#define RREP(i, a) RFOR(i, a, 0)
#define INF 1e7
int p1[111111], p2[111111];
vector<int> a, b;
in... | [
"literal.number.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,036,137 | 1,036,136 | u007637377 | cpp |
p03244 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int g[100005], k[100005], n, ans;
int main() {
cin >> n;
n /= 2;
int maxk = 0, maxg = 0;
for (int i = 0; i < n; ++i) {
int w1, w2;
cin >> w1 >> w2;
++k[w1];
++g[w2];
if (k[maxk] < k[w1]) {
maxk = w1;
... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int g[100005], k[100005], n, ans;
int main() {
cin >> n;
n /= 2;
int maxk = 0, maxg = 0;
for (int i = 0; i < n; ++i) {
int w1, w2;
cin >> w1 >> w2;
++k[w1];
++g[w2];
if (k[maxk] < k[w1]) {
maxk = w1;
... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 1,036,138 | 1,036,139 | u209467566 | cpp |
p03244 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stdlib.h>
#include <string.h>
#include <time.h>
#include <vector>
using namespace std;
int main(void) {
map<int, int> A;
map<int, int> B;
vector<int> C;
vector<int> D;
int n, v;
int numb... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stdlib.h>
#include <string.h>
#include <time.h>
#include <vector>
using namespace std;
int main(void) {
map<int, int> A;
map<int, int> B;
vector<int> C;
vector<int> D;
int n, v;
int numb... | [] | 1,036,142 | 1,036,143 | u267144086 | cpp |
p03244 | #include <bits/stdc++.h>
using namespace std;
static bool comp(pair<int, int> x, pair<int, int> y) {
return x.second < y.second;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int n;
cin >> n;
vector<int> nums(n);
unordered_map<int, int> hashMap1;
unordered_map<in... | #include <bits/stdc++.h>
using namespace std;
static bool comp(pair<int, int> x, pair<int, int> y) {
return x.second > y.second;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int n;
cin >> n;
vector<int> nums(n);
unordered_map<int, int> hashMap1;
unordered_map<in... | [
"misc.opposites",
"expression.operator.compare.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 1,036,193 | 1,036,194 | u666721654 | cpp |
p03244 | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int i, a[100001];
for (i = 0; i < n; i++) {
cin >> a[i];
}
int max11 = 0, max11i = 0, b[100001] = {0}, max12 = 0, max12i = 0;
for (i = 0; i < n; i = i + 2) {
b[a[i]]++;
if (b[a[i]] > m... | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int i, a[100001];
for (i = 0; i < n; i++) {
cin >> a[i];
}
int max11 = 0, max11i = 0, b[100001] = {0}, max12 = 0, max12i = 0;
for (i = 0; i < n; i = i + 2) {
b[a[i]]++;
if (b[a[i]] > m... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 1,036,197 | 1,036,198 | u737168568 | cpp |
p03248 | #include <bits/stdc++.h>
using namespace std;
// repetition
#define FOR(i, a, b) for (ll i = (a); i < (b); ++i)
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
// container util
#define all(x) (x).begin(), (x).end()
// typedef
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll... | #include <bits/stdc++.h>
using namespace std;
// repetition
#define FOR(i, a, b) for (ll i = (a); i < (b); ++i)
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
// container util
#define all(x) (x).begin(), (x).end()
// typedef
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll... | [
"variable_declaration.type.change"
] | 1,036,238 | 1,036,239 | u336011173 | cpp |
p03248 | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
int main() {
string s;
cin >> s;
int n = s.length();
string t = s.substr(0, n - 1), rt = t;
reverse(rt.begin(), rt.end());
if (s[n - 1] != '0' || s[0] != '1' || s[n - 2] != '1' || t != rt) {
cout << -... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
int main() {
string s;
cin >> s;
int n = s.length();
string t = s.substr(0, n - 1), rt = t;
reverse(rt.begin(), rt.end());
if (s[n - 1] != '0' || s[0] != '1' || s[n - 2] != '1' || t != rt) {
cout << -... | [
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 1,036,242 | 1,036,243 | u348670055 | cpp |
p03248 | #include <bits/stdc++.h>
#pragma GCC optimize("O3")
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPP(i, n) for (int i = 1; i <= n; i++)
#define ALL(obj) (obj).begin(), (obj).end()
const double PI = acos(-1);
const double EPS = 1e-15;
long long INF = (long long)1E17;
#define i_7 (long long)(1E9 + 7)
long mod(l... | #include <bits/stdc++.h>
#pragma GCC optimize("O3")
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPP(i, n) for (int i = 1; i <= n; i++)
#define ALL(obj) (obj).begin(), (obj).end()
const double PI = acos(-1);
const double EPS = 1e-15;
long long INF = (long long)1E17;
#define i_7 (long long)(1E9 + 7)
long mod(l... | [
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 1,036,266 | 1,036,267 | u222293734 | cpp |
p03248 | #include <bits/stdc++.h>
#pragma GCC optimize("O3")
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPP(i, n) for (int i = 1; i <= n; i++)
#define ALL(obj) (obj).begin(), (obj).end()
const double PI = acos(-1);
const double EPS = 1e-15;
long long INF = (long long)1E17;
#define i_7 (long long)(1E9 + 7)
long mod(l... | #include <bits/stdc++.h>
#pragma GCC optimize("O3")
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPP(i, n) for (int i = 1; i <= n; i++)
#define ALL(obj) (obj).begin(), (obj).end()
const double PI = acos(-1);
const double EPS = 1e-15;
long long INF = (long long)1E17;
#define i_7 (long long)(1E9 + 7)
long mod(l... | [
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 1,036,268 | 1,036,267 | u222293734 | cpp |
p03248 | #include <bits/stdc++.h>
#pragma GCC optimize("O3")
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPP(i, n) for (int i = 1; i <= n; i++)
#define ALL(obj) (obj).begin(), (obj).end()
const double PI = acos(-1);
const double EPS = 1e-15;
long long INF = (long long)1E17;
#define i_7 (long long)(1E9 + 7)
long mod(l... | #include <bits/stdc++.h>
#pragma GCC optimize("O3")
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPP(i, n) for (int i = 1; i <= n; i++)
#define ALL(obj) (obj).begin(), (obj).end()
const double PI = acos(-1);
const double EPS = 1e-15;
long long INF = (long long)1E17;
#define i_7 (long long)(1E9 + 7)
long mod(l... | [] | 1,036,269 | 1,036,267 | u222293734 | cpp |
p03248 | #include <algorithm>
#include <bitset>
#include <cstdlib>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <unordered_map>
#include <vector>
typedef long long ll;
typedef long double ld;
const ll MOD = 1e9 + 7, INF = 1... | #include <algorithm>
#include <bitset>
#include <cstdlib>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <unordered_map>
#include <vector>
typedef long long ll;
typedef long double ld;
const ll MOD = 1e9 + 7, INF = 1... | [
"literal.string.change",
"io.output.change"
] | 1,036,272 | 1,036,273 | u784000395 | cpp |
p03248 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits.h>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#in... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits.h>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#in... | [
"control_flow.branch.if.condition.change"
] | 1,036,280 | 1,036,281 | u859396346 | cpp |
p03248 | #include <bits/stdc++.h>
#define ALL(c) (c).begin(), (c).end()
#define EACH(i, c) for (auto i = (c).begin(); i != (c).end(); ++i)
using namespace std;
#define int long long
void solve(string s) {
int N = s.size();
if (s[0] != '1' && s[N - 1] != '0') {
cout << -1 << endl;
return;
}
s = "0" + s;
string... | #include <bits/stdc++.h>
#define ALL(c) (c).begin(), (c).end()
#define EACH(i, c) for (auto i = (c).begin(); i != (c).end(); ++i)
using namespace std;
#define int long long
void solve(string s) {
int N = s.size();
if (s[0] != '1' || s[N - 1] != '0') {
cout << -1 << endl;
return;
}
s = "0" + s;
string... | [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 1,036,296 | 1,036,297 | u183530284 | cpp |
p03248 | #include <bits/stdc++.h>
using namespace std;
signed main() {
ios::sync_with_stdio(false);
string S;
cin >> S;
if (S[0] == '0' || S[S.size() - 1] == '1') {
cout << -1 << endl;
return 0;
}
for (int i = 0; i < S.size(); ++i) {
if (S[i] != S[S.size() - 1 - i]) {
cout << -1 << endl;
... | #include <bits/stdc++.h>
using namespace std;
signed main() {
ios::sync_with_stdio(false);
string S;
cin >> S;
if (S[0] == '0' || S[S.size() - 1] == '1') {
cout << -1 << endl;
return 0;
}
for (int i = 0; i + 1 < S.size(); ++i) {
if (S[i] != S[S.size() - 2 - i]) {
cout << -1 << endl;
... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 1,036,307 | 1,036,308 | u209551477 | cpp |
p03248 | #include <bits/stdc++.h>
using namespace std;
signed main() {
ios::sync_with_stdio(false);
string S;
cin >> S;
if (S[0] == '0' || S[S.size() - 1] == '1') {
cout << -1 << endl;
return 0;
}
for (int i = 1; i < S.size(); ++i) {
if (S[i] != S[S.size() - i]) {
cout << -1 << endl;
retu... | #include <bits/stdc++.h>
using namespace std;
signed main() {
ios::sync_with_stdio(false);
string S;
cin >> S;
if (S[0] == '0' || S[S.size() - 1] == '1') {
cout << -1 << endl;
return 0;
}
for (int i = 0; i + 1 < S.size(); ++i) {
if (S[i] != S[S.size() - 2 - i]) {
cout << -1 << endl;
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"control_flow.branch.if.condition.change"
] | 1,036,309 | 1,036,308 | u209551477 | cpp |
p03248 | #include <bits/stdc++.h>
using namespace std;
signed main() {
ios::sync_with_stdio(false);
string S;
cin >> S;
if (S[0] == '0' || S[S.size() - 1] == '1') {
cout << -1 << endl;
return 0;
}
for (int i = 1; i < S.size(); ++i) {
if (S[i] == S[S.size() - i]) {
cout << -1 << endl;
retu... | #include <bits/stdc++.h>
using namespace std;
signed main() {
ios::sync_with_stdio(false);
string S;
cin >> S;
if (S[0] == '0' || S[S.size() - 1] == '1') {
cout << -1 << endl;
return 0;
}
for (int i = 0; i + 1 < S.size(); ++i) {
if (S[i] != S[S.size() - 2 - i]) {
cout << -1 << endl;
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,036,310 | 1,036,308 | u209551477 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.