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 |
|---|---|---|---|---|---|---|---|
p03243 | #include <bits/stdc++.h>
using ll = long long;
#define int ll
#define rep(i, n) for (int i = 0; i < n; i++)
#define loop(i, s, n) for (int i = s; i < n; i++)
#define erep(e, v) for (auto &&e : v)
#define all(in) in.begin(), in.end()
#define MP make_pair
#define INF (sizeof(int) == 4 ? (int)1e9 : (int)1e18)
#define EPS ... | #include <bits/stdc++.h>
using ll = long long;
#define int ll
#define rep(i, n) for (int i = 0; i < n; i++)
#define loop(i, s, n) for (int i = s; i < n; i++)
#define erep(e, v) for (auto &&e : v)
#define all(in) in.begin(), in.end()
#define MP make_pair
#define INF (sizeof(int) == 4 ? (int)1e9 : (int)1e18)
#define EPS ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,033,964 | 1,033,965 | u318334550 | cpp |
p03243 | #include <iostream>
#include <string.h>
using namespace std;
int main() {
int N;
cin >> N;
int p[9];
p[0] = 111;
p[1] = 222;
p[2] = 333;
p[3] = 444;
p[4] = 555;
p[5] = 666;
p[6] = 777;
p[7] = 888;
p[8] = 999;
for (int i = 0; i < 8; i++) {
if (N <= p[i]) {
cout << p[i] << endl;
... | #include <iostream>
#include <string.h>
using namespace std;
int main() {
int N;
cin >> N;
int p[9];
p[0] = 111;
p[1] = 222;
p[2] = 333;
p[3] = 444;
p[4] = 555;
p[5] = 666;
p[6] = 777;
p[7] = 888;
p[8] = 999;
for (int i = 0; i < 9; i++) {
if (N <= p[i]) {
cout << p[i] << endl;
... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,033,966 | 1,033,967 | u271545619 | cpp |
p03243 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int data[9] = {111, 222, 333, 444, 555, 666, 777, 888, 999};
while (scanf("%d", &n) == 1) {
for (int i = 0; i < 9; i++) {
if (n <= data[i]) {
printf("%d\n", data[i - 1]);
break;
}
}
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int data[10] = {0, 111, 222, 333, 444, 555, 666, 777, 888, 999};
while (scanf("%d", &n) == 1) {
for (int i = 0; i < 10; i++) {
if (n <= data[i]) {
printf("%d\n", data[i]);
break;
}
}
}
return 0;
}
| [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"control_flow.loop.condition.change",
"expression.operation.binary.remove"
] | 1,033,970 | 1,033,971 | u897227448 | cpp |
p03243 | #include <iostream>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
if (n > 111 && n < 999) {
int k = (n / 111) + 1;
cout << k * 111;
} else {
cout << n;
}
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
if (n % 111 != 0) {
int k = (n / 111) + 1;
cout << k * 111;
} else {
cout << n;
}
return 0;
} | [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 1,033,975 | 1,033,976 | u952906050 | cpp |
p03244 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, n;
cin >> N;
n = N / 2;
vector<int> A(n), B(n);
for (int i = 0; i < N; i++) {
if (i % 2 == 0)
cin >> A[i / 2];
else
cin >> B[i / 2];
}
set<int> sa, sb;
map<int, int> ma, mb;
for (auto a : A) {
sa.insert(a);
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, n;
cin >> N;
n = N / 2;
vector<int> A(n), B(n);
for (int i = 0; i < N; i++) {
if (i % 2 == 0)
cin >> A[i / 2];
else
cin >> B[i / 2];
}
set<int> sa, sb;
map<int, int> ma, mb;
for (auto a : A) {
sa.insert(a);
... | [
"literal.number.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 1,033,982 | 1,033,983 | u615258936 | cpp |
p03244 | #include <bits/stdc++.h>
#define REP(type, i, a, b) for (type i = a; i < b; i++)
typedef long long ll;
using namespace std;
int main(void) {
ll N, a, b, ans;
map<ll, ll> mp1, mp2;
scanf("%lld", &N);
REP(int, i, 0, N / 2) {
scanf("%lld %lld", &a, &b);
mp1[a]++;
mp2[b]++;
}
ll maxVala = 0;
l... | #include <bits/stdc++.h>
#define REP(type, i, a, b) for (type i = a; i < b; i++)
typedef long long ll;
using namespace std;
int main(void) {
ll N, a, b, ans;
map<ll, ll> mp1, mp2;
scanf("%lld", &N);
REP(int, i, 0, N / 2) {
scanf("%lld %lld", &a, &b);
mp1[a]++;
mp2[b]++;
}
ll maxVala = 0;
l... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 1,033,984 | 1,033,985 | u214547877 | cpp |
p03244 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, x, n) for (int i = x; i < (n); i++)
#define all(n) begin(n), end(n)
struct cww {
cww() {
ios::sync_with_stdio(false);
cin.tie(0);
}
} star;
const long long INF = numeric_limits<long long>::max();
i... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, x, n) for (int i = x; i < (n); i++)
#define all(n) begin(n), end(n)
struct cww {
cww() {
ios::sync_with_stdio(false);
cin.tie(0);
}
} star;
const long long INF = numeric_limits<long long>::max();
i... | [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 1,033,994 | 1,033,995 | u987913144 | cpp |
p03244 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define DEBUG(x) cout << #x << " = " << (x) << endl;
#define SORT(x) sort(ALL(x));
#define RSORT(x) sort(RALL(x));
using namespace std;
using ll = long long;
using vi =... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define DEBUG(x) cout << #x << " = " << (x) << endl;
#define SORT(x) sort(ALL(x));
#define RSORT(x) sort(RALL(x));
using namespace std;
using ll = long long;
using vi =... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,034,007 | 1,034,008 | u850516963 | cpp |
p03244 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<VI> VVI;
typedef vector<VL> VVL;
typedef pair<int, int> P;
typedef pair<ll, ll> PL;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) for (int i = 0; i < (n); ++i)
#def... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<VI> VVI;
typedef vector<VL> VVL;
typedef pair<int, int> P;
typedef pair<ll, ll> PL;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) for (int i = 0; i < (n); ++i)
#def... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,034,045 | 1,034,046 | u019780057 | cpp |
p03244 | //============================================================================
// Everyone has a different way of thinking, so God Created us
// Hope You Respect My Way..,Thank You ):
// Author : Murad
// Name : Codeforces.cpp & Atcoder.cpp
// Description : Problem name
//=================================... | //============================================================================
// Everyone has a different way of thinking, so God Created us
// Hope You Respect My Way..,Thank You ):
// Author : Murad
// Name : Codeforces.cpp & Atcoder.cpp
// Description : Problem name
//=================================... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 1,034,052 | 1,034,053 | u720420025 | cpp |
p03244 | #include <algorithm>
#include <bits/stdc++.h>
#include <cstdio>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
#define rep(i, x) for (int i = 0; i < x; i++)
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
type... | #include <algorithm>
#include <bits/stdc++.h>
#include <cstdio>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
#define rep(i, x) for (int i = 0; i < x; i++)
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
type... | [
"misc.opposites",
"expression.operator.compare.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 1,034,096 | 1,034,097 | u899645116 | cpp |
p03244 | #include <algorithm>
#include <cstdio>
#include <map>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
int n, a[100000];
scanf("%d", &n);
rep(i, n) scanf("%d", a + i);
map<int, int> f1, f2;
rep(i, n / 2) {
f1[a[2 * i]]++;
f2[a[2 * i + 1]]++;
}
... | #include <algorithm>
#include <cstdio>
#include <map>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
int n, a[100000];
scanf("%d", &n);
rep(i, n) scanf("%d", a + i);
map<int, int> f1, f2;
rep(i, n / 2) {
f1[a[2 * i]]++;
f2[a[2 * i + 1]]++;
}
... | [
"literal.number.change",
"call.arguments.change",
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 1,034,104 | 1,034,105 | u781095600 | cpp |
p03244 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n); i >= 0; i--)
#define repm(i, m, n) for (int i = (int)(m); i < (int)(n); i++)
#define repmr(i, m, n) for (int i = (int)(n); i >= (int)(m); i--)
#define all(x) (x).begin(), (x).end()
#define inf 2e9
#d... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n); i >= 0; i--)
#define repm(i, m, n) for (int i = (int)(m); i < (int)(n); i++)
#define repmr(i, m, n) for (int i = (int)(n); i >= (int)(m); i--)
#define all(x) (x).begin(), (x).end()
#define inf 2e9
#d... | [
"control_flow.branch.else.remove",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add",
"assignment.add"
] | 1,034,122 | 1,034,123 | u917101497 | cpp |
p03244 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define N (1000000000 + 7)
#define INF 1e16
typedef pair<int, int> P;
typedef long long ll;
bool cmp(const pair<int, int> &a, const pair<... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define N (1000000000 + 7)
#define INF 1e16
typedef pair<int, int> P;
typedef long long ll;
bool cmp(const pair<int, int> &a, const pair<... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,034,145 | 1,034,146 | u744305661 | cpp |
p03244 | /* Don’t Quit
When things go wrong as they sometimes will;
When the road you’re trudging seems all uphill;
When the funds are low, and the debts are high;
And you want to smile, but you have to sigh;
When care is pressing you down a bit
... | /* Don’t Quit
When things go wrong as they sometimes will;
When the road you’re trudging seems all uphill;
When the funds are low, and the debts are high;
And you want to smile, but you have to sigh;
When care is pressing you down a bit
... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 1,034,176 | 1,034,177 | u035131936 | cpp |
p03244 | #include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, N) for (ll(i) = 0; (i) < (N... | #include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, N) for (ll(i) = 0; (i) < (N... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,034,194 | 1,034,195 | u239409893 | cpp |
p03244 | #include <bits/stdc++.h>
#define debug(x) cerr << "\n" << #x << ": " << x << "\n"
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define int long long
#define print(x) cout << (x) << endl
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
co... | #include <bits/stdc++.h>
#define debug(x) cerr << "\n" << #x << ": " << x << "\n"
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define int long long
#define print(x) cout << (x) << endl
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
co... | [
"control_flow.branch.if.condition.change",
"identifier.change"
] | 1,034,212 | 1,034,213 | u265065462 | cpp |
p03244 | #include <algorithm>
#include <cmath>
#include <functional>
#include <stdio.h>
using namespace std;
long long mod = 1000000007;
int v[100000], odd_count[100010] = {0}, even_count[100010] = {0};
int main() {
int N;
scanf("%d", &N);
for (int i = 0; i < N; i++) {
scanf("%d", &v[i]);
}
for (int i = 0; i < N; ... | #include <algorithm>
#include <cmath>
#include <functional>
#include <stdio.h>
using namespace std;
long long mod = 1000000007;
int v[100000], odd_count[100010] = {0}, even_count[100010] = {0};
int main() {
int N;
scanf("%d", &N);
for (int i = 0; i < N; i++) {
scanf("%d", &v[i]);
}
for (int i = 0; i < N; ... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 1,034,240 | 1,034,241 | u475843109 | cpp |
p03244 | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
using namespace std;
#define inf 0x3f3f3f3f
#define ll long long
#define met(a, b) memset(a, b, sizeof(a))
int a[100005];
int even[100005], odd[100005];
bool cmp(int a, int b) { return a > b; }
int main() {
int n, x = 0,... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
using namespace std;
#define inf 0x3f3f3f3f
#define ll long long
#define met(a, b) memset(a, b, sizeof(a))
int a[100005];
int even[100005], odd[100005];
bool cmp(int a, int b) { return a > b; }
int main() {
int n, x = 0,... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 1,034,255 | 1,034,256 | u018679195 | cpp |
p03244 | #include <algorithm>
#include <cmath>
#include <fstream>
#include <iostream>
#include <map>
#include <numeric>
#include <type_traits>
#include <vector>
using namespace std;
int main(int argc, const char *argv[]) {
int n;
cin >> n;
int v;
map<int, int> mp1;
map<int, int> mp2;
for (int i = 0; i < n / 2; i++)... | #include <algorithm>
#include <cmath>
#include <fstream>
#include <iostream>
#include <map>
#include <numeric>
#include <type_traits>
#include <vector>
using namespace std;
int main(int argc, const char *argv[]) {
int n;
cin >> n;
int v;
map<int, int> mp1;
map<int, int> mp2;
for (int i = 0; i < n / 2; i++)... | [
"call.add"
] | 1,034,265 | 1,034,266 | u432194969 | cpp |
p03244 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 1e9 + 7;
int dy[] = {1, -1, 0, 0};
int dx[] = {0, 0, 1, -1};
int main() {
int n;
cin >> n;
vector<int> v(n);
vector<vector<pair<int, int>>> cnt(2, vector<pair<int, int>>(100005, {0, 0}));
for (int i = 0; i < n; i++) {
cin ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 1e9 + 7;
int dy[] = {1, -1, 0, 0};
int dx[] = {0, 0, 1, -1};
int main() {
int n;
cin >> n;
vector<int> v(n);
vector<vector<pair<int, int>>> cnt(2, vector<pair<int, int>>(100005, {0, 0}));
for (int i = 0; i < n; i++) {
cin ... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 1,034,269 | 1,034,270 | u854831509 | cpp |
p03244 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 1e9 + 7;
int dy[] = {1, -1, 0, 0};
int dx[] = {0, 0, 1, -1};
int main() {
int n;
cin >> n;
vector<int> v(n);
vector<vector<pair<int, int>>> cnt(2, vector<pair<int, int>>(10005, {0, 0}));
for (int i = 0; i < n; i++) {
cin >... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 1e9 + 7;
int dy[] = {1, -1, 0, 0};
int dx[] = {0, 0, 1, -1};
int main() {
int n;
cin >> n;
vector<int> v(n);
vector<vector<pair<int, int>>> cnt(2, vector<pair<int, int>>(100005, {0, 0}));
for (int i = 0; i < n; i++) {
cin ... | [
"literal.number.change",
"call.arguments.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 1,034,271 | 1,034,270 | u854831509 | cpp |
p03244 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int odd[100001];
int even[100001];
int v[100001];
cin >> N;
for (int i = 0; i < N; i++) {
cin >> v[i];
}
for (int i = 1; i < N; i += 2) {
odd[v[i]]++;
even[v[i + 1]]++;
}
int omax = 0, emax = 0, omax2 = 0, emax2 = 0;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int odd[100001];
int even[100001];
int v[100001];
cin >> N;
for (int i = 0; i < N; i++) {
cin >> v[i];
}
for (int i = 1; i < N; i += 2) {
odd[v[i]]++;
even[v[i - 1]]++;
}
int omax = 0, emax = 0, omax2 = 0, emax2 = 0;
... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 1,034,276 | 1,034,277 | u845882023 | cpp |
p03244 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n);
map<int, int> m0;
map... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n);
map<int, int> m0;
map... | [
"expression.operation.binary.remove",
"assignment.change"
] | 1,034,288 | 1,034,289 | u110336920 | cpp |
p03244 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n);
map<int, int> m0;
map... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n);
map<int, int> m0;
map... | [
"control_flow.branch.if.condition.change",
"literal.number.change",
"expression.operation.binary.remove",
"assignment.change"
] | 1,034,290 | 1,034,289 | u110336920 | cpp |
p03244 | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
const double pi = acos(-1);
#define FOR(i, a, b) for (ll i = (a), __last_##i = (b); i < __last_##i; i++)
#define RFOR(i, a, b) for (ll i = (b)-1, __last_##i = (a); i >= __last_##i; i--)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, 0, n)
#... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
const double pi = acos(-1);
#define FOR(i, a, b) for (ll i = (a), __last_##i = (b); i < __last_##i; i++)
#define RFOR(i, a, b) for (ll i = (b)-1, __last_##i = (a); i >= __last_##i; i--)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, 0, n)
#... | [
"identifier.change"
] | 1,034,293 | 1,034,294 | u800551451 | cpp |
p03244 | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vect... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vect... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 1,034,295 | 1,034,296 | u622585907 | cpp |
p03244 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n;
m = n / 2;
vector<int> e(m), o(m);
for (int i = 0; i < m; ++i)
cin >> e[i] >> o[i];
sort(e.begin(), e.end());
sort(o.begin(), o.end());
vector<pair<int, int>> ee, oo;
ee.push_back(make_pair(0, 0));
oo.push_back(mak... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n;
m = n / 2;
vector<int> e(m), o(m);
for (int i = 0; i < m; ++i)
cin >> e[i] >> o[i];
sort(e.begin(), e.end());
sort(o.begin(), o.end());
vector<pair<int, int>> ee, oo;
ee.push_back(make_pair(0, 0));
oo.push_back(mak... | [
"identifier.change",
"call.arguments.change"
] | 1,034,297 | 1,034,298 | u640800420 | cpp |
p03244 | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
map<int, int> mp1, mp2;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
if (i % 2 == 0) {
mp1[a]++;
} else {
mp2[a]++;
}
}
int cnt1 = 0;
int cnt12 ... | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
map<int, int> mp1, mp2;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
if (i % 2 == 0) {
mp1[a]++;
} else {
mp2[a]++;
}
}
int cnt1 = 0;
int cnt12 ... | [
"assignment.value.change",
"identifier.change"
] | 1,034,300 | 1,034,301 | u904123392 | cpp |
p03244 | #include <bits/stdc++.h>
using namespace std;
int odd[100010], even[100010];
int main() {
int N;
cin >> N;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
if (i % 2 == 0)
even[a]++;
else
odd[a]++;
}
int o1 = 0, o2 = 0, e1 = 0, e2 = 0;
for (int i = 1; i <= 100000; i++) {
if (... | #include <bits/stdc++.h>
using namespace std;
int odd[100010], even[100010];
int main() {
int N;
cin >> N;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
if (i % 2 == 0)
even[a]++;
else
odd[a]++;
}
int o1 = 0, o2 = 0, e1 = 0, e2 = 0;
for (int i = 1; i <= 100000; i++) {
if (... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 1,034,312 | 1,034,313 | u774622463 | cpp |
p03244 | #include <bits/stdc++.h>
using namespace std;
int odd[100010], even[100010];
int main() {
int N;
cin >> N;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
if (i % 2 == 0)
even[a]++;
else
odd[a]++;
}
int o1 = 0, o2 = 0, e1 = 0, e2 = 0;
for (int i = 1; i <= 100000; i++) {
if (... | #include <bits/stdc++.h>
using namespace std;
int odd[100010], even[100010];
int main() {
int N;
cin >> N;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
if (i % 2 == 0)
even[a]++;
else
odd[a]++;
}
int o1 = 0, o2 = 0, e1 = 0, e2 = 0;
for (int i = 1; i <= 100000; i++) {
if (... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"misc.opposites",
"call.function.change",
"io.output.change"
] | 1,034,314 | 1,034,313 | u774622463 | cpp |
p03244 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
ll n;
cin >> n;
ll e[n], o[n], k = 0, l = 0;
for (ll i = 0; i < n; i++) {
if (i % 2 == 0) {
cin >> e[k];
k++;
} else {
cin >> o[l];
l++;
}
}
vector<pair<ll, ll>> ee, oo;
k = n / 2;
so... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
ll n;
cin >> n;
ll e[n], o[n], k = 0, l = 0;
for (ll i = 0; i < n; i++) {
if (i % 2 == 0) {
cin >> e[k];
k++;
} else {
cin >> o[l];
l++;
}
}
vector<pair<ll, ll>> ee, oo;
k = n / 2;
so... | [
"identifier.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 1,034,323 | 1,034,324 | u082673785 | cpp |
p03244 | #include <algorithm>
#include <cctype>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef int long long ll... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef int long long ll... | [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove",
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 1,034,325 | 1,034,326 | u031448582 | cpp |
p03244 | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int odd[1000];
int even[1000];
int max = 0;
map<int, int> m;
int main() {
int N;
cin >> N;
int Omax1 = 0, Omax2 = 0, Emax1 = 0, Emax2 = 0;
map<int, int> o;
map<int, int> e;
int n, l, Oans1, Oa... | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int odd[1000];
int even[1000];
int max = 0;
map<int, int> m;
int main() {
int N;
cin >> N;
int Omax1 = 0, Omax2 = 0, Emax1 = 0, Emax2 = 0;
map<int, int> o;
map<int, int> e;
int n, l, Oans1, Oa... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.value.change"
] | 1,034,341 | 1,034,342 | u120564432 | cpp |
p03244 | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int odd[1000];
int even[1000];
int max = 0;
map<int, int> m;
int main() {
int N;
cin >> N;
int Omax1 = 0, Omax2 = 0, Emax1 = 0, Emax2 = 0;
map<int, int> o;
map<int, int> e;
int n, l, Oans1, Oa... | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int odd[1000];
int even[1000];
int max = 0;
map<int, int> m;
int main() {
int N;
cin >> N;
int Omax1 = 0, Omax2 = 0, Emax1 = 0, Emax2 = 0;
map<int, int> o;
map<int, int> e;
int n, l, Oans1, Oa... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"assignment.value.change",
"identifier.change"
] | 1,034,343 | 1,034,342 | u120564432 | cpp |
p03244 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; ++i)
#define REP(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define each(i, c) \
for (__typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define all(v)... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; ++i)
#define REP(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define each(i, c) \
for (__typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define all(v)... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 1,034,344 | 1,034,345 | u569778242 | cpp |
p03244 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; ++i)
#define REP(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define each(i, c) \
for (__typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define all(v)... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; ++i)
#define REP(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define each(i, c) \
for (__typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define all(v)... | [
"call.add",
"call.remove",
"expression.operation.binary.add"
] | 1,034,344 | 1,034,346 | u569778242 | cpp |
p03244 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef string str;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef map<str, int> mapsi;
typedef map<str, int>::iterator mapsitr;
typedef ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef string str;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef map<str, int> mapsi;
typedef map<str, int>::iterator mapsitr;
typedef ... | [
"assignment.add"
] | 1,034,366 | 1,034,367 | u337775536 | cpp |
p03244 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
const int mod = 1e9 + 7;
const ll INF = 1e18;
const int inf = 1e9;
void solve() {
int n;
cin >> n;
vector<int> v1(n / 2, 0);
vector<int> v2(n / 2, 0);
int mv1 = 0, mv2 = 0;
int max1 = 0, max2 = 0;
vector<int> ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
const int mod = 1e9 + 7;
const ll INF = 1e18;
const int inf = 1e9;
void solve() {
int n;
cin >> n;
vector<int> v1(n / 2, 0);
vector<int> v2(n / 2, 0);
int mv1 = 0, mv2 = 0;
int max1 = 0, max2 = 0;
vector<int> ... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 1,034,377 | 1,034,378 | u305824645 | cpp |
p03244 | #include <cstring>
#include <iostream>
#include <utility>
using namespace std;
int n, v, a[2][100010];
pair<int, int> p[2][2];
int main() {
cin >> n;
memset(a, 0, sizeof(a));
for (int i = 0; i < n; ++i) {
cin >> v;
a[i % 2][v]++;
}
for (int j = 0; j < 2; ++j) {
for (int i = 0; i < 2; ++i) {
... | #include <cstring>
#include <iostream>
#include <utility>
using namespace std;
int n, v, a[2][100010];
pair<int, int> p[2][2];
int main() {
cin >> n;
memset(a, 0, sizeof(a));
for (int i = 0; i < n; ++i) {
cin >> v;
a[i % 2][v]++;
}
for (int j = 0; j < 2; ++j) {
for (int i = 0; i < 2; ++i) {
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,034,379 | 1,034,380 | u486908386 | cpp |
p03244 | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
int N;
cin >> N;
vector<int> v(N);
for (int i = 0; i < N; i++) {
cin >> v[i];
}
vector<pair<int, int>> odd(100001);
vector<pair<int, int>> even(100001);
for (int i = ... | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
int N;
cin >> N;
vector<int> v(N);
for (int i = 0; i < N; i++) {
cin >> v[i];
}
vector<pair<int, int>> odd(100001);
vector<pair<int, int>> even(100001);
for (int i = ... | [] | 1,034,394 | 1,034,395 | u254766083 | cpp |
p03244 | #include <algorithm> // min,max, sort(v.begin(),v.end())
#include <cmath> // abs(x),pow(x,2)
#include <iostream> // cin,cout
#include <stdio.h> // printf,scanf (standard input/output)
#include <string.h> // strlen, strcmp
#include <string>
#include <time.h>
#include <vector>
using namespace std;
struct Data {
... | #include <algorithm> // min,max, sort(v.begin(),v.end())
#include <cmath> // abs(x),pow(x,2)
#include <iostream> // cin,cout
#include <stdio.h> // printf,scanf (standard input/output)
#include <string.h> // strlen, strcmp
#include <string>
#include <time.h>
#include <vector>
using namespace std;
struct Data {
... | [
"misc.opposites",
"assignment.value.change",
"identifier.change"
] | 1,034,408 | 1,034,409 | u398072911 | cpp |
p03244 | #include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
auto e = map<int, int>(), o = map<int, int>();
e[0] = 0;
o[0] = 0;
for (auto i = 0; i < n; ++i) {
int v;
cin >> v;
if (i % 2 == 0)
++e[v];
... | #include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
auto e = map<int, int>(), o = map<int, int>();
e[0] = 0;
o[0] = 0;
for (auto i = 0; i < n; ++i) {
int v;
cin >> v;
if (i % 2 == 0)
++e[v];
... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 1,034,416 | 1,034,417 | u338550320 | cpp |
p03244 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// 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; } return false; }
/* attention
long longのシフト演算には気をつけよう
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// 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; } return false; }
/* attention
long longのシフト演算には気をつけよう
... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"identifier.change",
"io.output.change"
] | 1,034,426 | 1,034,427 | u052332717 | cpp |
p03244 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define reps(i, s, n) for (int(i) = (s); (i) < (n); (i)++)
#define repr(i, n) for (int(i) = (n)-1; (i) >= 0; (i)--)
#define forin(x, array) for (auto &(x) : (array))
#define all(v) (v).begin(), (v).end()
#define pb push_... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define reps(i, s, n) for (int(i) = (s); (i) < (n); (i)++)
#define repr(i, n) for (int(i) = (n)-1; (i) >= 0; (i)--)
#define forin(x, array) for (auto &(x) : (array))
#define all(v) (v).begin(), (v).end()
#define pb push_... | [] | 1,034,440 | 1,034,441 | u943094398 | cpp |
p03244 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define reps(i, s, n) for (int(i) = (s); (i) < (n); (i)++)
#define repr(i, n) for (int(i) = (n)-1; (i) >= 0; (i)--)
#define forin(x, array) for (auto &(x) : (array))
#define all(v) (v).begin(), (v).end()
#define pb push_... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define reps(i, s, n) for (int(i) = (s); (i) < (n); (i)++)
#define repr(i, n) for (int(i) = (n)-1; (i) >= 0; (i)--)
#define forin(x, array) for (auto &(x) : (array))
#define all(v) (v).begin(), (v).end()
#define pb push_... | [
"literal.number.change",
"call.arguments.change"
] | 1,034,442 | 1,034,441 | u943094398 | cpp |
p03244 | #include <bits/stdc++.h>
using namespace std;
/* テンプレここから */
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define repi(i, start, end) for (int i = start; i < end; ++i)
#define all(x) (x).begin(), (x).end()
#define INF (1e9)
#define add_mod(a, b, x) ((ll)(a) + (ll)(b)) % (ll)(x)
#define mul_mo... | #include <bits/stdc++.h>
using namespace std;
/* テンプレここから */
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define repi(i, start, end) for (int i = start; i < end; ++i)
#define all(x) (x).begin(), (x).end()
#define INF (1e9)
#define add_mod(a, b, x) ((ll)(a) + (ll)(b)) % (ll)(x)
#define mul_mo... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.number.change",
"variable_access.subscript.index.change"
] | 1,034,468 | 1,034,467 | u934073187 | cpp |
p03244 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<pair<int, int>> V;
for (int i = 0; i <= 100000; ++i) {
V.push_back(make_pair(0, i));
}
vector<pair<int, int>> U;
for (int i = 0; i <= 100000; ++i) {
U.push_back(make_pair(0, i));
... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<pair<int, int>> V;
for (int i = 0; i <= 100000; ++i) {
V.push_back(make_pair(0, i));
}
vector<pair<int, int>> U;
for (int i = 0; i <= 100000; ++i) {
U.push_back(make_pair(0, i));
... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 1,034,480 | 1,034,481 | u041282550 | cpp |
p03244 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n);
map<int, int> even;
map<int, int> odd;
for (int i = 0; i < n; i++) {
cin >> v[i];
if (i % 2 == 0) {
if (even.find(v[i]) == even.end())
even[v[i]] = 1;
else
even[v[i]]++;
} el... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n);
map<int, int> even;
map<int, int> odd;
for (int i = 0; i < n; i++) {
cin >> v[i];
if (i % 2 == 0) {
if (even.find(v[i]) == even.end())
even[v[i]] = 1;
else
even[v[i]]++;
} el... | [
"control_flow.branch.if.condition.change"
] | 1,034,482 | 1,034,483 | u526708273 | cpp |
p03244 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v1(100001), v2(100001);
int temp;
for (int i = 0; i < n; i++) {
cin >> temp;
if (i % 2 == 0) {
v1[temp]++;
} else {
... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v1(100001), v2(100001);
int temp;
for (int i = 0; i < n; i++) {
cin >> temp;
if (i % 2 == 0) {
v1[temp]++;
} else {
... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 1,034,525 | 1,034,526 | u727099903 | cpp |
p03244 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, MAX = 100010, ans;
cin >> n;
vector<int> odd(MAX), even(MAX);
fill(odd.begin(), odd.end(), 0);
fill(even.begin(), even.end()... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, MAX = 100010, ans;
cin >> n;
vector<int> odd(MAX), even(MAX);
fill(odd.begin(), odd.end(), 0);
fill(even.begin(), even.end()... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 1,034,542 | 1,034,543 | u519756887 | cpp |
p03244 | //{{{
#include <bits/stdc++.h>
using namespace std;
#define repX(a, b, c, x, ...) x
#define repN(a) repX a
#define rep(...) repN((__VA_ARGS__, rep3, rep2, loop))(__VA_ARGS__)
#define rrep(...) repN((__VA_ARGS__, rrep3, rrep2))(__VA_ARGS__)
#define loop(n) rep2(i_, n)
#define rep2(i, n) rep3(i, 0, n)
#define rep3(i, beg... | //{{{
#include <bits/stdc++.h>
using namespace std;
#define repX(a, b, c, x, ...) x
#define repN(a) repX a
#define rep(...) repN((__VA_ARGS__, rep3, rep2, loop))(__VA_ARGS__)
#define rrep(...) repN((__VA_ARGS__, rrep3, rrep2))(__VA_ARGS__)
#define loop(n) rep2(i_, n)
#define rep2(i, n) rep3(i, 0, n)
#define rep3(i, beg... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 1,034,550 | 1,034,551 | u899220667 | cpp |
p03244 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define all(v) v.begin(), v.end()
//'A' = 65, 'Z' = 90, 'a' = 97, 'z' = 122
int main() {
int n;
cin >> n;
int v[n];
int even[100001] = {}, odd[100001] = {};
rep(i, 0, n) {
cin >> v[i];
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define all(v) v.begin(), v.end()
//'A' = 65, 'Z' = 90, 'a' = 97, 'z' = 122
int main() {
int n;
cin >> n;
int v[n];
int even[100001] = {}, odd[100001] = {};
rep(i, 0, n) {
cin >> v[i];
... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 1,034,558 | 1,034,559 | u214304095 | cpp |
p03244 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <utility>
#include <vector>
#define reps(i, s, n) for (int(i) = (s); (i) < (n); (i)++)
#define rep(i, n) reps(i, 0, n)
using namespace std;
using ll = long long;
using pii = pair<int, int>;
bool comp(const pii &a, ... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <utility>
#include <vector>
#define reps(i, s, n) for (int(i) = (s); (i) < (n); (i)++)
#define rep(i, n) reps(i, 0, n)
using namespace std;
using ll = long long;
using pii = pair<int, int>;
bool comp(const pii &a, ... | [
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,034,560 | 1,034,561 | u704411633 | cpp |
p03244 | #include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; ++i)
#define RUP(a, b) ((a + b - 1) / ... | #include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; ++i)
#define RUP(a, b) ((a + b - 1) / ... | [
"control_flow.branch.if.condition.change",
"identifier.change"
] | 1,034,577 | 1,034,578 | u635484372 | cpp |
p03244 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, i;
cin >> n;
vector<int> a(100000);
vector<int> b(100001);
for (i = 0; i < n; i++) {
cin >> a[i];
b[i] = 0;
}
int ans = 0;
int m = 0;
for (i = 0; i * 2 < n; ... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, i;
cin >> n;
vector<int> a(100000);
vector<int> b(100001);
for (i = 0; i < n; i++) {
cin >> a[i];
b[i] = 0;
}
int ans = 0;
int m = 0;
for (i = 0; i * 2 < n; ... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 1,034,593 | 1,034,594 | u407614884 | cpp |
p03244 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, i;
cin >> n;
vector<int> a(100000);
vector<int> b(100000);
for (i = 0; i < n; i++) {
cin >> a[i];
b[i] = 0;
}
int ans = 0;
int m = 0;
for (i = 0; i * 2 < n; ... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, i;
cin >> n;
vector<int> a(100000);
vector<int> b(100001);
for (i = 0; i < n; i++) {
cin >> a[i];
b[i] = 0;
}
int ans = 0;
int m = 0;
for (i = 0; i * 2 < n; ... | [
"literal.number.change",
"call.arguments.change",
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 1,034,595 | 1,034,594 | u407614884 | cpp |
p03244 | #define debug_interval ','
#define dump_interval ' '
#define debug_toggle 1
//{
#include <bits/stdc++.h>
using namespace std;
#define hi cerr << "hi" << endl;
#define int long long
#define INT_MAX LLONG_MAX
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define pb push... | #define debug_interval ','
#define dump_interval ' '
#define debug_toggle 1
//{
#include <bits/stdc++.h>
using namespace std;
#define hi cerr << "hi" << endl;
#define int long long
#define INT_MAX LLONG_MAX
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define pb push... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,034,629 | 1,034,630 | u130196064 | cpp |
p03244 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
bool comp(pair<int, int> &a, pair<int, int> &b) { return a.second > b.second; }
int main() {
int n, a[50005], b[50005], p, q, ans;
vector<pair<int, int>> ca, cb;
cin >> n;
for (int i = 0; i < n / 2; i++) {
cin >> a[i] >> b[i];... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
bool comp(pair<int, int> &a, pair<int, int> &b) { return a.second > b.second; }
int main() {
int n, a[50005], b[50005], p, q, ans;
vector<pair<int, int>> ca, cb;
cin >> n;
for (int i = 0; i < n / 2; i++) {
cin >> a[i] >> b[i];... | [
"identifier.change",
"call.arguments.change"
] | 1,034,647 | 1,034,648 | u467763786 | cpp |
p03244 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
bool comp(pair<int, int> &a, pair<int, int> &b) { return a.second > b.second; }
int main() {
int n, a[50005], b[50005], p, q, ans;
vector<pair<int, int>> ca, cb;
cin >> n;
for (int i = 0; i < n / 2; i++)
cin >> a[i] >> b[i];
... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
bool comp(pair<int, int> &a, pair<int, int> &b) { return a.second > b.second; }
int main() {
int n, a[50005], b[50005], p, q, ans;
vector<pair<int, int>> ca, cb;
cin >> n;
for (int i = 0; i < n / 2; i++)
cin >> a[i] >> b[i];
... | [
"identifier.replace.remove",
"literal.replace.add",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 1,034,649 | 1,034,650 | u601082779 | cpp |
p03244 | #include <bits/stdc++.h>
#define INF INT_MAX / 2;
#define MOD 1000000007
using namespace std;
using ll = long long;
using ull = unsigned long long;
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
ll n;
cin >> n;
vector<ll> v(n);
for (ll i = 0; i < n; i++)
cin >> v[i];
map<ll, ll> ... | #include <bits/stdc++.h>
#define INF INT_MAX / 2;
#define MOD 1000000007
using namespace std;
using ll = long long;
using ull = unsigned long long;
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
ll n;
cin >> n;
vector<ll> v(n);
for (ll i = 0; i < n; i++)
cin >> v[i];
map<ll, ll> ... | [
"assignment.change"
] | 1,034,662 | 1,034,663 | u864171425 | cpp |
p03244 | #include "algorithm"
#include <functional> // std::greater
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
bool cmp(const pair<int, int> &a, const pair<int, int> &b) {
return a.second > b.second;
}
int main(int argc, char *argv[]) {
int n;
while (cin >> n) {
int i;
... | #include "algorithm"
#include <functional> // std::greater
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
bool cmp(const pair<int, int> &a, const pair<int, int> &b) {
return a.second > b.second;
}
int main(int argc, char *argv[]) {
int n;
while (cin >> n) {
int i;
... | [
"identifier.change"
] | 1,034,666 | 1,034,667 | u275155270 | cpp |
p03244 | #include <bits/stdc++.h>
using namespace std;
// ==================================================
using i64 = int64_t;
using u64 = uint64_t;
#define rep(i, a, b) for (i64 i = (int64_t)(a); i < (int64_t)(b); i++)
#define repn(i, n) rep(i, 0, n)
#define din(t, ...) ... | #include <bits/stdc++.h>
using namespace std;
// ==================================================
using i64 = int64_t;
using u64 = uint64_t;
#define rep(i, a, b) for (i64 i = (int64_t)(a); i < (int64_t)(b); i++)
#define repn(i, n) rep(i, 0, n)
#define din(t, ...) ... | [
"literal.number.change",
"assignment.variable.change",
"call.arguments.change"
] | 1,034,678 | 1,034,679 | u651068030 | cpp |
p03244 | #include <bits/stdc++.h>
using namespace std;
// ==================================================
using i64 = int64_t;
using u64 = uint64_t;
#define rep(i, a, b) for (i64 i = (int64_t)(a); i < (int64_t)(b); i++)
#define repn(i, n) rep(i, 0, n)
#define din(t, ...) ... | #include <bits/stdc++.h>
using namespace std;
// ==================================================
using i64 = int64_t;
using u64 = uint64_t;
#define rep(i, a, b) for (i64 i = (int64_t)(a); i < (int64_t)(b); i++)
#define repn(i, n) rep(i, 0, n)
#define din(t, ...) ... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,034,680 | 1,034,679 | u651068030 | cpp |
p03244 | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
const ll MOD = 1e9 + 7;
const int INF = 1e9;
int main() {
int n;
cin >> n;
map<int, int> mp[2];
for (int i = 0; i < n; i++) {
int a;
cin >> a;
if (i & 1) {
mp[1][a]++;
} else {
mp[0][a]++;
... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
const ll MOD = 1e9 + 7;
const int INF = 1e9;
int main() {
int n;
cin >> n;
map<int, int> mp[2];
for (int i = 0; i < n; i++) {
int a;
cin >> a;
if (i & 1) {
mp[1][a]++;
} else {
mp[0][a]++;
... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change"
] | 1,034,683 | 1,034,684 | u891178744 | cpp |
p03244 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int A[100001], B[100001];
int main() {
int n, i, j, k = 0, count1 = INT_MIN, count2 = INT_MIN, x, y;
cin >> n;
int a[n];
for (i = 0; i < n; i++) {
cin >> a[i];
if (i % 2 == 0) {
A[a[i]]++;
if (A[a[i]] > count1) {
coun... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int A[100001], B[100001];
int main() {
int n, i, j, k = 0, count1 = INT_MIN, count2 = INT_MIN, x, y;
cin >> n;
int a[n];
for (i = 0; i < n; i++) {
cin >> a[i];
if (i % 2 == 0) {
A[a[i]]++;
if (A[a[i]] > count1) {
coun... | [
"assignment.value.change",
"identifier.change"
] | 1,034,735 | 1,034,736 | u573483192 | cpp |
p03244 | #include <algorithm>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <unordered_set>
#include <vector>
using namespace std;
using ll = long long;
using ld = long double;
int main() {
int n;
vector<int> v;
cin >> n;
for (int i = 0; i < n; ++i) {
int t;
cin >> t;
v.push... | #include <algorithm>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <unordered_set>
#include <vector>
using namespace std;
using ll = long long;
using ld = long double;
int main() {
int n;
vector<int> v;
cin >> n;
for (int i = 0; i < n; ++i) {
int t;
cin >> t;
v.push... | [
"identifier.change",
"control_flow.loop.for.initializer.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,034,739 | 1,034,738 | u588454863 | cpp |
p03244 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, before;
cin >> n;
bool allSame = true;
vector<int> l(n / 2), r(n / 2);
unordered_map<int, int> lc, rc;
for (int j = 0; j < n / 2; ++j) {
cin >> l[j] >> r[j];
lc[l[j]] += 1;
rc[r[j]] += 1;
}
before = l[0];
for (int j = ... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, before;
cin >> n;
bool allSame = true;
vector<int> l(n / 2), r(n / 2);
unordered_map<int, int> lc, rc;
for (int j = 0; j < n / 2; ++j) {
cin >> l[j] >> r[j];
lc[l[j]] += 1;
rc[r[j]] += 1;
}
before = l[0];
for (int j = ... | [
"call.function.change",
"call.arguments.change"
] | 1,034,742 | 1,034,743 | u275710783 | cpp |
p03244 | #include <stdio.h>
#include <stdlib.h>
#define MAX_LEN (100000)
#define MAX_NUM (120)
int main(int argc, char *argv[]) {
int n, a[MAX_LEN];
int cnt_even[MAX_NUM + 1] = {}, cnt_odd[MAX_NUM + 1] = {};
int max1_cnt_even, max1_cnt_odd, max2_cnt_even, max2_cnt_odd;
int max1_num_even, max1_num_odd, max2_num_even, m... | #include <stdio.h>
#include <stdlib.h>
#define MAX_LEN (100000)
#define MAX_NUM (100000)
int main(int argc, char *argv[]) {
int n, a[MAX_LEN];
int cnt_even[MAX_NUM + 1] = {}, cnt_odd[MAX_NUM + 1] = {};
int max1_cnt_even, max1_cnt_odd, max2_cnt_even, max2_cnt_odd;
int max1_num_even, max1_num_odd, max2_num_even... | [
"preprocessor.define.value.change",
"literal.integer.change"
] | 1,034,766 | 1,034,767 | u359413838 | cpp |
p03244 | #include <bits/stdc++.h>
using namespace std;
#define eps 1e-7
#define For(i, a, b) for (int i = a; i <= b; i++)
#define Fore(i, a, b) for (int i = a; i >= b; i--)
#define lson l, mid, rt << 1
#define rson mid + 1, r, rt << 1 | 1
#define mkp make_pair
#define pb push_back
#define sz size()
#define met(a, b) memset(a, b... | #include <bits/stdc++.h>
using namespace std;
#define eps 1e-7
#define For(i, a, b) for (int i = a; i <= b; i++)
#define Fore(i, a, b) for (int i = a; i >= b; i--)
#define lson l, mid, rt << 1
#define rson mid + 1, r, rt << 1 | 1
#define mkp make_pair
#define pb push_back
#define sz size()
#define met(a, b) memset(a, b... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,034,774 | 1,034,773 | u012619688 | cpp |
p03244 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int n;
int a[100010];
pair<int, int> x[100010];
pair<int, int> y[100010];
int main() {
cin ... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int n;
int a[100010];
pair<int, int> x[100010];
pair<int, int> y[100010];
int main() {
cin ... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 1,034,788 | 1,034,789 | u006686215 | cpp |
p03244 | #include <iostream>
using namespace std;
int c[2][100001];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
int v;
cin >> v;
c[i % 2][v]++;
}
int c1 = 0, c2 = 0;
for (int i = 1; i <= 100000; i++) {
if (c[0][c1] <= c[0][i])
c1 = i;
if (c[1][c2] <= c[1][i])
c2 =... | #include <iostream>
using namespace std;
int c[2][100001];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
int v;
cin >> v;
c[i % 2][v]++;
}
int c1 = 0, c2 = 0;
for (int i = 1; i <= 100000; i++) {
if (c[0][c1] <= c[0][i])
c1 = i;
if (c[1][c2] <= c[1][i])
c2 =... | [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change",
"expression.operation.binary.change"
] | 1,034,804 | 1,034,805 | u057866967 | cpp |
p03244 | #pragma GCC optimize("O2")
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
vector<int> v1, v2;
int f1[100005], f2[100005];
int mx11, mx12, mx21, mx22, m11, m12, m21, m22;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
in... | #pragma GCC optimize("O2")
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
vector<int> v1, v2;
int f1[100005], f2[100005];
int mx11, mx12, mx21, mx22, m11, m12, m21, m22;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
in... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 1,034,811 | 1,034,812 | u574576596 | cpp |
p03244 | #include <stdio.h>
#include <string.h>
int main(int argc, char *argv[]) {
int d;
scanf("%d", &d);
int a[100005], b[100005];
memset(a, 0, sizeof(a));
memset(b, 0, sizeof(b));
int t;
int maxa = 0, maxb = 0;
int sea = 0, seb = 0;
for (int i = 0; i < d; i++) {
if (i % 2 == 0) {
scanf("%d", &t);
... | #include <stdio.h>
#include <string.h>
int main(int argc, char *argv[]) {
int d;
scanf("%d", &d);
int a[100005], b[100005];
memset(a, 0, sizeof(a));
memset(b, 0, sizeof(b));
int t;
int maxa = 0, maxb = 0;
int sea = 0, seb = 0;
for (int i = 0; i < d; i++) {
if (i % 2 == 0) {
scanf("%d", &t);
... | [
"control_flow.branch.if.condition.change"
] | 1,034,813 | 1,034,814 | u952247386 | cpp |
p03244 | #include <algorithm>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <queue>
#include <stack>
#include <utility>
#include <vector>
using std::cin;
using std::cout;
using std::endl;
typedef std::pair<int, int> p;
const int MAX_N = 100000;
int main(void) {
cout << std::fixed << std... | #include <algorithm>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <queue>
#include <stack>
#include <utility>
#include <vector>
using std::cin;
using std::cout;
using std::endl;
typedef std::pair<int, int> p;
const int MAX_N = 100000;
int main(void) {
cout << std::fixed << std... | [
"misc.opposites",
"expression.operator.compare.change",
"assignment.value.change",
"control_flow.branch.if.condition.change"
] | 1,034,815 | 1,034,816 | u844133200 | cpp |
p03244 | #include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include... | #include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include... | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 1,034,827 | 1,034,828 | u113268066 | cpp |
p03244 | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
struct X {
int num;
int val;
X() {
num = 0;
val = 0;
}
};
bool Comp(X &l, X &r) { return l.num > r.num; }
int main(int argc, char *argv[]) {
int n;
cin >> n;
map<int, int> EvenMap;
map<int, int> OddMap... | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
struct X {
int num;
int val;
X() {
num = 0;
val = 0;
}
};
bool Comp(X &l, X &r) { return l.num > r.num; }
int main(int argc, char *argv[]) {
int n;
cin >> n;
map<int, int> EvenMap;
map<int, int> OddMap... | [
"expression.unary.arithmetic.add"
] | 1,034,869 | 1,034,870 | u875570028 | cpp |
p03244 | /*******************************
* written by Koki Riho
* Rih0z https://github.com/Rih0z
* the base of this program is
*http://c-mer.hatenablog.com/entry/2018/09/30/013414 made by C-mer
*******************************/
#include <algorithm>
#include <iostream>
#include <map>
#include <vector>
#define DEBUG false
... | /*******************************
* written by Koki Riho
* Rih0z https://github.com/Rih0z
* the base of this program is
*http://c-mer.hatenablog.com/entry/2018/09/30/013414 made by C-mer
*******************************/
#include <algorithm>
#include <iostream>
#include <map>
#include <vector>
#define DEBUG false
... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 1,034,893 | 1,034,894 | u135371668 | cpp |
p03244 | #include <algorithm>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
void insert(unordered_map<int, int> &mp, int a) {
if (mp.find(a) == mp.end())
mp[a] = 1;
else
... | #include <algorithm>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
void insert(unordered_map<int, int> &mp, int a) {
if (mp.find(a) == mp.end())
mp[a] = 1;
else
... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,034,910 | 1,034,911 | u320491590 | cpp |
p03244 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <vector>
using namespace std;
typedef pair<int, int> P;
#define INF (1 << 31 - 1)
#define ll long long
// 頻度をmapに変換 {1,2,1,1,3,2,2}=>{1:3, 2:3, 3:1}
map<int, int> count(int *a, int *b) {
map<int, int> m;
for (; a != b; a++) {
... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <vector>
using namespace std;
typedef pair<int, int> P;
#define INF (1 << 31 - 1)
#define ll long long
// 頻度をmapに変換 {1,2,1,1,3,2,2}=>{1:3, 2:3, 3:1}
map<int, int> count(int *a, int *b) {
map<int, int> m;
for (; a != b; a++) {
... | [
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 1,034,914 | 1,034,915 | u592610268 | cpp |
p03244 | #include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9 + 7;
using LL = long long;
const LL LINF = 1e18;
const double EPS = 1e-10;
using namespace std;
#define COUT(v) cout << (v) << endl
#define CIN(n) \
int(n); ... | #include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9 + 7;
using LL = long long;
const LL LINF = 1e18;
const double EPS = 1e-10;
using namespace std;
#define COUT(v) cout << (v) << endl
#define CIN(n) \
int(n); ... | [
"expression.operation.unary.logical.remove",
"control_flow.branch.if.condition.change"
] | 1,034,924 | 1,034,925 | u580402951 | cpp |
p03244 | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
using namespace std;
int main() {
long long n;
long long max1, max2, maxp1, maxp2, max12, max22, maxp12, maxp22;
maxp1 = -1;
maxp2 = -1;
max1 = 0;
max2 = 0;
maxp12 = -1;
maxp22 = -1;
max12 = 0;
max22 = 0;
cin >> n;
long l... | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
using namespace std;
int main() {
long long n;
long long max1, max2, maxp1, maxp2, max12, max22, maxp12, maxp22;
maxp1 = -1;
maxp2 = -1;
max1 = 0;
max2 = 0;
maxp12 = -1;
maxp22 = -1;
max12 = 0;
max22 = 0;
cin >> n;
long l... | [
"control_flow.loop.for.condition.change",
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 1,034,935 | 1,034,934 | u596912804 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
scanf("%d%d", &n, &m);
int d = sqrt(m), ans = 0;
for (int i = 2; i <= d; i++) {
if (m % i == 0) {
int temp = m / i;
if (i >= n)
ans = max(ans, temp);
if (m / i >= n)
ans = max(ans, i);
}
}
printf("... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
scanf("%d%d", &n, &m);
int d = sqrt(m), ans = 0;
for (int i = 1; i <= d; i++) {
if (m % i == 0) {
int temp = m / i;
if (i >= n)
ans = max(ans, temp);
if (m / i >= n)
ans = max(ans, i);
}
}
printf("... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,034,949 | 1,034,950 | u326400916 | cpp |
p03241 | #include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int my_max(int a, int b) { return a > b ? a : b; }
int main() {
int gyz = 1;
int n, m;
scanf("%d %d", &n, &m);
for (int i = 2; i * i <= m; i++) {
if (m % i == 0) {
if (m / i >= n)
gyz = my_max(gyz, i);
if (i >= ... | #include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int my_max(int a, int b) { return a > b ? a : b; }
int main() {
int gyz = 1;
int n, m;
scanf("%d %d", &n, &m);
for (int i = 1; i * i <= m; i++) {
if (m % i == 0) {
if (m / i >= n)
gyz = my_max(gyz, i);
if (i >= ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,034,955 | 1,034,956 | u442158182 | cpp |
p03241 | #include <iostream>
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 = max(a, ans);
}
if (b * n <= m) {
ans = max(b, ans);
}
}
cout << an... | #include <iostream>
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) {
ans = max(a, ans);
}
if ((long)b * n <= m) {
ans = max(b, ans);
}
}
... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 1,034,957 | 1,034,958 | u244834838 | cpp |
p03241 | #include <iostream>
using namespace std;
int main() {
long long N, M;
long long ans = 1;
cin >> N >> M;
for (long long i = 2; i * i <= M; i++) {
if (M % i == 0) {
if (i * N <= M)
ans = max(ans, i);
if ((M / i) * N <= M)
ans = max(ans, (M / i) * N);
}
}
cout << ans << end... | #include <iostream>
using namespace std;
int main() {
long long N, M;
long long ans = 1;
cin >> N >> M;
for (long long i = 1; i * i <= M; i++) {
if (M % i == 0) {
if (i * N <= M)
ans = max(ans, i);
if ((M / i) * N <= M)
ans = max(ans, (M / i));
}
}
cout << ans << endl;
}... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operation.binary.remove"
] | 1,034,966 | 1,034,967 | u176433576 | cpp |
p03241 | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define INF (1 << 30)
#define INFLL (1ll << 60)
typedef pair<int, int> P;
typedef pair<int, P> E;
#define MOD (1000000007ll)
#define l_ength size
void mul_mod(ll &a, ll b) {
a *= b;
a %= MOD;
}
void add_mod(ll &a, ll b) {
b += MOD;
a += b;
... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define INF (1 << 30)
#define INFLL (1ll << 60)
typedef pair<int, int> P;
typedef pair<int, P> E;
#define MOD (1000000007ll)
#define l_ength size
void mul_mod(ll &a, ll b) {
a *= b;
a %= MOD;
}
void add_mod(ll &a, ll b) {
b += MOD;
a += b;
... | [
"expression.operation.binary.remove"
] | 1,034,970 | 1,034,971 | u548624367 | cpp |
p03241 | #include <iostream>
using namespace std;
int main() {
long long n, m;
cin >> n >> m;
int a = m / n + 1;
for (long long i = a; i >= 1; i--) {
if (m % i == 0) {
cout << i << endl;
return 0;
}
}
}
| #include <iostream>
using namespace std;
int main() {
long long n, m;
cin >> n >> m;
int a = m / n;
for (long long i = a; i >= 1; i--) {
if (m % i == 0) {
cout << i << endl;
return 0;
}
}
}
| [
"expression.operation.binary.remove"
] | 1,034,981 | 1,034,982 | u702906718 | cpp |
p03241 | #include <iostream>
using namespace std;
int main() {
long long n, m;
cin >> n >> m;
long long a = m / n;
for (long long i = a; i >= 1; i--) {
if (m % i == 0)
cout << i << endl;
return 0;
}
}
| #include <iostream>
using namespace std;
int main() {
long long n, m;
cin >> n >> m;
int a = m / n;
for (long long i = a; i >= 1; i--) {
if (m % i == 0) {
cout << i << endl;
return 0;
}
}
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.narrow.change"
] | 1,034,983 | 1,034,982 | u702906718 | cpp |
p03241 | #include <iostream>
using namespace std;
long n, m, ans = 1;
main() {
cin >> n >> m;
for (long i = 2; i * i <= m; i++) {
if (m % i)
continue;
if (m / i >= n)
ans = ans < i ? i : ans;
if (i >= n)
ans = ans < m / i ? m / i : ans;
}
cout << ans << endl;
}
| #include <iostream>
using namespace std;
long n, m, ans;
main() {
cin >> n >> m;
for (long i = 1; i * i <= m; i++) {
if (m % i)
continue;
if (m / i >= n)
ans = ans < i ? i : ans;
if (i >= n)
ans = ans < m / i ? m / i : ans;
}
cout << ans << endl;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,034,984 | 1,034,985 | u657913472 | cpp |
p03241 | /* -*- coding: utf-8 -*-
*
* d.cc: D: Partition
*/
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <... | /* -*- coding: utf-8 -*-
*
* d.cc: D: Partition
*/
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,034,986 | 1,034,987 | u744314647 | cpp |
p03241 | #define rep(i, n) for (int i = 0; i < (int)(n); i++) //定番のn回繰り返しを省略
#define SZ(x) ((int)(x).size()) // unsignedのサイズをint型に変換
#include <iostream>
#include <math.h>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
//ここから書き始める
int main(int argc, char const *argv[]) {
int n, m;
... | #define rep(i, n) for (int i = 0; i < (int)(n); i++) //定番のn回繰り返しを省略
#define SZ(x) ((int)(x).size()) // unsignedのサイズをint型に変換
#include <iostream>
#include <math.h>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
//ここから書き始める
int main(int argc, char const *argv[]) {
int n, m;
... | [
"variable_declaration.type.change",
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change",
"assignment.value.change",
"call.function.change"
] | 1,034,988 | 1,034,989 | u077025302 | cpp |
p03241 | #define rep(i, n) for (int i = 0; i < (int)(n); i++) //定番のn回繰り返しを省略
#define SZ(x) ((int)(x).size()) // unsignedのサイズをint型に変換
#include <iostream>
#include <math.h>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
//ここから書き始める
int main(int argc, char const *argv[]) {
int n, m;
... | #define rep(i, n) for (int i = 0; i < (int)(n); i++) //定番のn回繰り返しを省略
#define SZ(x) ((int)(x).size()) // unsignedのサイズをint型に変換
#include <iostream>
#include <math.h>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
//ここから書き始める
int main(int argc, char const *argv[]) {
int n, m;
... | [
"variable_declaration.type.change",
"assignment.value.change",
"call.function.change"
] | 1,034,990 | 1,034,989 | u077025302 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define Would
#d... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define Would
#d... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,035,007 | 1,035,008 | u096883693 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
int n, m;
int main() {
cin >> n >> m;
int ans = 1;
for (int i = 1; i <= sqrt(m); i++) {
if (m % i == 0) {
if (i <= n)
ans = max(ans, i);
if (m / i <= n)
ans = max(ans, m / i);
}
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int n, m;
int main() {
cin >> n >> m;
int ans = 1;
for (int i = 1; i <= sqrt(m); i++) {
if (m % i == 0) {
if (i <= m / n)
ans = max(ans, i);
if (m / i <= m / n)
ans = max(ans, m / i);
}
}
cout << ans << endl;
return 0;
}
| [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 1,035,009 | 1,035,010 | u006686215 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<long long> vll;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef pair<int, int> pii;
struct cww {
cww() {
ios::sync_with_stdio(false);
cin.ti... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<long long> vll;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef pair<int, int> pii;
struct cww {
cww() {
ios::sync_with_stdio(false);
cin.ti... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,035,013 | 1,035,014 | u889914341 | cpp |
p03241 |
#include <bits/stdc++.h>
#define pb push_back
#define REP(i, n) for (signed long long i = 0; i < (n); i++)
#define MOD 998244353
#define INF 98765431219876543
#define bitcnt(a) (ll) __builtin_popcount((a))
#define lb(a, b) lower_bound((a).begin(), (a).end(), (b))
#define ub(a, b) upper_bound((a).begin(), (a).end(), (b... |
#include <bits/stdc++.h>
#define pb push_back
#define REP(i, n) for (signed long long i = 0; i < (n); i++)
#define MOD 998244353
#define INF 98765431219876543
#define bitcnt(a) (ll) __builtin_popcount((a))
#define lb(a, b) lower_bound((a).begin(), (a).end(), (b))
#define ub(a, b) upper_bound((a).begin(), (a).end(), (b... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,035,015 | 1,035,016 | u451610133 | cpp |
p03241 | /* nothing is impossible */
#include <bits/stdc++.h>
#define mp make_pair
#define mt make_tuple
#define eb emplace_back
#define fi first
#define se second
#define ff first
#define ss second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define forn(i, n) for (int i... | /* nothing is impossible */
#include <bits/stdc++.h>
#define mp make_pair
#define mt make_tuple
#define eb emplace_back
#define fi first
#define se second
#define ff first
#define ss second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define forn(i, n) for (int i... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,035,017 | 1,035,018 | u862316882 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define INF 1e9
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll N, M;
cin >> N >> M;
ll maxa = 1;
if (N == 1) {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define INF 1e9
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll N, M;
cin >> N >> M;
ll ans = 1;
if (N == 1) {
c... | [
"variable_declaration.name.change",
"identifier.change",
"assignment.variable.change",
"assignment.value.change",
"call.arguments.change",
"io.output.change"
] | 1,035,019 | 1,035,020 | u810671118 | cpp |
p03241 | #include <algorithm>
#include <cstdio>
#include <deque>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int G = 1;
for (int d = 2; d * d <= M; ++d) {
if (M % d == 0 && d <= M / N) {
if (d >= N) // M / d <= M / N
{
G = m... | #include <algorithm>
#include <cstdio>
#include <deque>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int G = 1;
for (int d = 1; d * d <= M; ++d) {
if (M % d == 0 && d <= M / N) {
if (d >= N) // M / d <= M / N
{
G = m... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,035,023 | 1,035,024 | u479592231 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.