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 9
values |
|---|---|---|---|---|---|---|---|
p02996 | #include <bits/stdc++.h>
using namespace std;
// type alias
typedef long long LL;
typedef pair<int, int> II;
typedef tuple<int, int, int> III;
typedef vector<int> VI;
typedef vector<string> VS;
typedef unordered_map<int, int> MAPII;
typedef unordered_set<int> SETI;
template <class T> using VV = vector<vector<T>>;
// mi... | #include <bits/stdc++.h>
using namespace std;
// type alias
typedef long long LL;
typedef pair<int, int> II;
typedef tuple<int, int, int> III;
typedef vector<int> VI;
typedef vector<string> VS;
typedef unordered_map<int, int> MAPII;
typedef unordered_set<int> SETI;
template <class T> using VV = vector<vector<T>>;
// mi... | [
"expression.operation.binary.remove"
] | 807,584 | 807,585 | u465317453 | cpp |
p02996 | #include <algorithm>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main(void) {
int n;
std::cin >> n;
vector<pair<int, int>... | #include <algorithm>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main(void) {
int n;
std::cin >> n;
vector<pair<int, int>... | [
"variable_declaration.value.change",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 807,588 | 807,589 | u851205244 | cpp |
p02996 | #include <algorithm>
#include <iostream>
#include <limits>
#include <string>
#include <vector>
using namespace std;
bool sortbysec(const pair<int, int> &a, const pair<int, int> &b) {
return (a.second < b.second);
}
int main() {
vector<pair<int, int>> vec;
int N;
cin >> N;
for (int i = 0; i < N; i++) {
i... | #include <algorithm>
#include <iostream>
#include <limits>
#include <string>
#include <vector>
using namespace std;
bool sortbysec(const pair<int, int> &a, const pair<int, int> &b) {
return (a.second < b.second);
}
int main() {
vector<pair<int, int>> vec;
int N;
cin >> N;
for (int i = 0; i < N; i++) {
i... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 807,594 | 807,595 | u986889396 | cpp |
p02996 |
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define fst first
#define snd second
int N;
vector<pair<int, int>> dat; // until, duration
int main() {
scanf("%d", &N);
for (int i = 0; i < N; i++) {
int A, B;
scanf("%d%d", &A, &B);
... |
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define fst first
#define snd second
int N;
vector<pair<int, int>> dat; // until, duration
int main() {
scanf("%d", &N);
for (int i = 0; i < N; i++) {
int A, B;
scanf("%d%d", &A, &B);
... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 807,609 | 807,610 | u720394712 | cpp |
p02996 | #include "bits/stdc++.h"
using namespace std;
pair<int, int> Array[200005];
int main() {
int N, i;
scanf("%d", &N);
for (i = 1; i <= N; ++i)
scanf("%d%d", &Array[i].second, &Array[i].first);
sort(Array + 1, Array + N + 1);
long long Total = 0;
for (i = 1; i <= N; ++i) {
if (Total + Array[i].seco... | #include "bits/stdc++.h"
using namespace std;
pair<int, int> Array[200005];
int main() {
int N, i;
scanf("%d", &N);
for (i = 1; i <= N; ++i)
scanf("%d%d", &Array[i].second, &Array[i].first);
sort(Array + 1, Array + N + 1);
long long Total = 0;
for (i = 1; i <= N; ++i) {
if (Total + Array[i].seco... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 807,617 | 807,618 | u843106258 | cpp |
p02996 | #include <bits/stdc++.h>
#define ll long long
#define dl double
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define F first
#define S second
#define endl "\n"
#define rep(i, a, b) for (i = a; i < b; i++)
#define all(v) v.begin(), v.end()
#define allr(v) v.rbegin(), v.rend()
#define mod 1e9 + 7
#de... | #include <bits/stdc++.h>
#define ll long long
#define dl double
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define F first
#define S second
#define endl "\n"
#define rep(i, a, b) for (i = a; i < b; i++)
#define all(v) v.begin(), v.end()
#define allr(v) v.rbegin(), v.rend()
#define mod 1e9 + 7
#de... | [] | 807,621 | 807,622 | u121266738 | cpp |
p02996 | #include <algorithm>
#include <iostream>
#include <map> // pair
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
ll func(ll a, ll b) {
ll r = a % b;
if (r == 0)
return b;
return func(b, r);
}
int main() {
ll n, x, y;
cin >> n;
pair<ll, ll> p[n];
for (ll... | #include <algorithm>
#include <iostream>
#include <map> // pair
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
ll func(ll a, ll b) {
ll r = a % b;
if (r == 0)
return b;
return func(b, r);
}
int main() {
ll n, x, y;
cin >> n;
pair<ll, ll> p[n];
for (ll... | [
"call.arguments.change",
"call.arguments.add"
] | 807,623 | 807,624 | u019870062 | cpp |
p02996 | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define endl "\n"
#define se second
#define ll long long
// priority_queue<int, vector<int>, greater<int> > pq;
#define _CRT_SECURE_NO_DEPRECATE
const int N = 1000001;
#define rep(i, begin, end) \
for (_... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define endl "\n"
#define se second
#define ll long long
// priority_queue<int, vector<int>, greater<int> > pq;
#define _CRT_SECURE_NO_DEPRECATE
const int N = 1000001;
#define rep(i, begin, end) \
for (_... | [
"literal.number.change",
"variable_declaration.value.change"
] | 807,625 | 807,626 | u278557567 | cpp |
p02996 | //#define NDEBUG
#include <cstddef>
#include <cstdint>
#include <vector>
namespace n91 {
using i8 = std::int_fast8_t;
using i32 = std::int_fast32_t;
using i64 = std::int_fast64_t;
using u8 = std::uint_fast8_t;
using u32 = std::uint_fast32_t;
using u64 = std::uint_fast64_t;
using isize = std::ptrdiff_t;
using usize = ... | //#define NDEBUG
#include <cstddef>
#include <cstdint>
#include <vector>
namespace n91 {
using i8 = std::int_fast8_t;
using i32 = std::int_fast32_t;
using i64 = std::int_fast64_t;
using u8 = std::uint_fast8_t;
using u32 = std::uint_fast32_t;
using u64 = std::uint_fast64_t;
using isize = std::ptrdiff_t;
using usize = ... | [] | 807,633 | 807,634 | u708618797 | cpp |
p02996 | #include <bits/stdc++.h>
using namespace std;
struct job {
int a;
int b;
} s[200010];
int cmp(job a, job b) {
if (a.b != b.b) {
return a.b < b.b;
} else {
return a.a < b.a;
}
}
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> s[i].a >> s[i].b;
}
sort(s, s + n + 1, cmp... | #include <bits/stdc++.h>
using namespace std;
struct job {
int a;
int b;
} s[200010];
int cmp(job a, job b) {
if (a.b != b.b) {
return a.b < b.b;
} else {
return a.a < b.a;
}
}
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> s[i].a >> s[i].b;
}
sort(s, s + n + 1, cmp... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 807,635 | 807,636 | u612745975 | cpp |
p02996 | #include <bits/stdc++.h>
#define ll long long
#define rep(i, a, b) for (i = a; i < b; i++)
#define pb push_back
#define all(v) v.begin(), v.end()
#define F first
#define S second
#define CLR(a) memset((a), 0, sizeof(a))
#define mp make_pair
#define hell 1000000007
using namespace std;
// int g[105][105];
// vector < i... | #include <bits/stdc++.h>
#define ll long long
#define rep(i, a, b) for (i = a; i < b; i++)
#define pb push_back
#define all(v) v.begin(), v.end()
#define F first
#define S second
#define CLR(a) memset((a), 0, sizeof(a))
#define mp make_pair
#define hell 1000000007
using namespace std;
// int g[105][105];
// vector < i... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 807,645 | 807,646 | u216069198 | cpp |
p02996 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (a); i >= (b); i--)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) RFOR(i, n, 0)
#define dump(x) cout << #x << " = " << (x) << endl;
typedef long long ll;
typedef pair<int, int> ii;... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (a); i >= (b); i--)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) RFOR(i, n, 0)
#define dump(x) cout << #x << " = " << (x) << endl;
typedef long long ll;
typedef pair<int, int> ii;... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 807,647 | 807,648 | u305824645 | cpp |
p02996 | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <vector>
#define _USE_MATH_DEFINES
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <list>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <... | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <vector>
#define _USE_MATH_DEFINES
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <list>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <... | [
"expression.operation.binary.remove"
] | 807,653 | 807,654 | u414877092 | cpp |
p02996 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define REP(NAME, NUM) for (int NAME = 0; NAME < (NUM); ++NAME)
#define BREP(NAME, NUM) for (int NAME = (NUM)-1; NAME >= 0; --NAME)
#define ALL(NAME) (NAME).begin(), (NAME).end()
#define cMOD 10... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define REP(NAME, NUM) for (int NAME = 0; NAME < (NUM); ++NAME)
#define BREP(NAME, NUM) for (int NAME = (NUM)-1; NAME >= 0; --NAME)
#define ALL(NAME) (NAME).begin(), (NAME).end()
#define cMOD 10... | [
"expression.operation.binary.remove",
"assignment.compound.arithmetic.replace.add",
"expression.operator.arithmetic.replace.remove",
"expression.operation.binary.change"
] | 807,657 | 807,658 | u627427672 | cpp |
p02996 | #include <bits/stdc++.h>
using namespace std;
long long n, i, s;
pair<long long, long long> mas[100001];
int main() {
cin >> n;
for (i = 1; i <= n; i++)
cin >> mas[i].second >> mas[i].first;
sort(mas + 1, mas + n + 1);
for (i = 1; i <= n; i++) {
s += mas[i].second;
if (s > mas[i].first) {
cou... | #include <bits/stdc++.h>
using namespace std;
long long n, i, s;
pair<long long, long long> mas[1000001];
int main() {
cin >> n;
for (i = 1; i <= n; i++)
cin >> mas[i].second >> mas[i].first;
sort(mas + 1, mas + n + 1);
for (i = 1; i <= n; i++) {
s += mas[i].second;
if (s > mas[i].first) {
co... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 807,668 | 807,669 | u771796442 | cpp |
p02996 | #include <bits/stdc++.h>
typedef long long int ll;
using namespace std;
struct Job {
ll a, b;
bool operator<(const Job &j) { return b < j.b; }
};
int main() {
ios_base::sync_with_stdio(false);
int n;
cin >> n;
ll sum = 0LL;
vector<Job> jobs(n);
for (int i = 0; i < n; ++i)
cin >> jobs[i].a >>... | #include <bits/stdc++.h>
typedef long long int ll;
using namespace std;
struct Job {
ll a, b;
bool operator<(const Job &j) { return b < j.b; }
};
int main() {
ios_base::sync_with_stdio(false);
int n;
cin >> n;
ll sum = 0LL;
vector<Job> jobs(n);
for (int i = 0; i < n; ++i)
cin >> jobs[i].a >>... | [
"assignment.change"
] | 807,670 | 807,671 | u408808361 | cpp |
p02996 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<pair<int, int>> ab(n);
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
ab[i] = make_pair(b, a);
}
sort(ab.begin(), ab.... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<pair<int, int>> ab(n);
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
ab[i] = make_pair(b, a);
}
sort(ab.begin(), ab.... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 807,678 | 807,679 | u990764614 | cpp |
p02996 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i;
pair<long long, long long> task[100005];
cin >> n;
long long a[100005], b[100005], suma = 0, sumb = 0;
for (i = 0; i < n; i++) {
cin >> a[i] >> b[i];
task[i] = make_pair(-b[i], -a[i]);
}
sort(task, task + n);
int flag = 0;
f... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i;
pair<long long, long long> task[200005];
cin >> n;
long long a[200005], b[200005], suma = 0, sumb = 0;
for (i = 0; i < n; i++) {
cin >> a[i] >> b[i];
task[i] = make_pair(-b[i], -a[i]);
}
sort(task, task + n);
int flag = 0;
f... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 807,684 | 807,685 | u073082475 | cpp |
p02996 | #pragma GCC optimize("O3")
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define pb push_back
#define ins insert
#define er erase
#define f(i, a, b) for (i = a; i < b; ++i)
#define rf(i, a, b) for (i = a; i... | #pragma GCC optimize("O3")
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define pb push_back
#define ins insert
#define er erase
#define f(i, a, b) for (i = a; i < b; ++i)
#define rf(i, a, b) for (i = a; i... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 807,690 | 807,691 | u172942446 | cpp |
p02996 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fw(p) for (int w = 0; w < (p); w++)
#define fx(p) for (int x = 0; x < (p); x++)
#define fy(p) for (int y = 0; y < (p); y++)
#define fz(p) for (int z = 0; z < (p); z++)
#define fyg(p, g) for (int y = (g); y < (p); y++)
#define fzg(p, g) for (int... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fw(p) for (int w = 0; w < (p); w++)
#define fx(p) for (int x = 0; x < (p); x++)
#define fy(p) for (int y = 0; y < (p); y++)
#define fz(p) for (int z = 0; z < (p); z++)
#define fyg(p, g) for (int y = (g); y < (p); y++)
#define fzg(p, g) for (int... | [] | 807,694 | 807,695 | u824327013 | cpp |
p02995 | #include <bits/stdc++.h>
// #include <iostream>
// #include <vector>
// #include <map>
// #include <algorithm>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int)(x).size())
template <typename T> T mod(T a, T b) { return... | #include <bits/stdc++.h>
// #include <iostream>
// #include <vector>
// #include <map>
// #include <algorithm>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int)(x).size())
template <typename T> T mod(T a, T b) { return... | [
"identifier.change",
"call.function.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 807,712 | 807,713 | u796269639 | cpp |
p02995 | #include <bits/stdc++.h>
// #include <iostream>
// #include <vector>
// #include <map>
// #include <algorithm>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int)(x).size())
template <typename T> T mod(T a, T b) { return... | #include <bits/stdc++.h>
// #include <iostream>
// #include <vector>
// #include <map>
// #include <algorithm>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int)(x).size())
template <typename T> T mod(T a, T b) { return... | [
"call.add",
"function.return_value.change",
"expression.operation.binary.change"
] | 807,714 | 807,713 | u796269639 | cpp |
p02995 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#defin... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#defin... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 807,720 | 807,721 | u519950235 | cpp |
p02995 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#defin... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#defin... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 807,722 | 807,721 | u519950235 | cpp |
p02995 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#defin... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#defin... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 807,724 | 807,721 | u519950235 | cpp |
p02995 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
//#include<bits/stdc++.h>
using namespace std... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
//#include<bits/stdc++.h>
using namespace std... | [
"expression.operation.binary.remove"
] | 807,750 | 807,751 | u373958718 | cpp |
p02995 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdint>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <sstream>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespa... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdint>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <sstream>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespa... | [
"call.remove",
"call.arguments.change"
] | 807,752 | 807,753 | u101264341 | cpp |
p02995 | using namespace std;
#include <bits/stdc++.h>
#define rep(i, s) for (int i = 0; i < s; ++i)
#define repr(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define all(v) (v.begin(), v.end())
#define EACH(i, s) \
for (__typeo... | using namespace std;
#include <bits/stdc++.h>
#define rep(i, s) for (int i = 0; i < s; ++i)
#define repr(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define all(v) (v.begin(), v.end())
#define EACH(i, s) \
for (__typeo... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 807,754 | 807,755 | u535810324 | cpp |
p02995 | using namespace std;
#include <bits/stdc++.h>
#define rep(i, s) for (int i = 0; i < s; ++i)
#define repr(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define all(v) (v.begin(), v.end())
#define EACH(i, s) \
for (__typeo... | using namespace std;
#include <bits/stdc++.h>
#define rep(i, s) for (int i = 0; i < s; ++i)
#define repr(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define all(v) (v.begin(), v.end())
#define EACH(i, s) \
for (__typeo... | [
"expression.operation.binary.add"
] | 807,756 | 807,755 | u535810324 | cpp |
p02995 | #include <algorithm>
#include <float.h>
#include <iostream>
#include <limits>
#include <math.h>
#include <numeric>
using namespace ::std;
int main() {
long long int A;
long long int B;
long long int C;
long long int D;
cin >> A >> B >> C >> D;
long long int tmp;
long long int tc = C;
long long int td =... | #include <algorithm>
#include <float.h>
#include <iostream>
#include <limits>
#include <math.h>
#include <numeric>
using namespace ::std;
int main() {
long long int A;
long long int B;
long long int C;
long long int D;
cin >> A >> B >> C >> D;
long long int tmp;
long long int tc = C;
long long int td =... | [] | 807,757 | 807,758 | u319945100 | cpp |
p02995 | #include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int main() {
long long A, B;
cin >> A >> B;
int C, D;
cin >> C >> D;
int CD = gcd(C, D);
long long CD_lcm = C * D / CD;
if (C == D) {
long long Ccnt = (B / C) - ((A - 1) / C)... | #include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int main() {
long long A, B;
cin >> A >> B;
long long C, D;
cin >> C >> D;
int CD = gcd(C, D);
long long CD_lcm = C * D / CD;
if (C == D) {
long long Ccnt = (B / C) - ((A - 1)... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 807,777 | 807,778 | u109497000 | cpp |
p02995 | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int sa(ll a, ll b) {
if (a < b)
swap(a, b);
ll r = a % b;
ll x = a * b;
while (r != 0) {
a = b;
b = r;
r = a % b;
}
return x / b;
}
int main() {
ll a, b, c, d;
cin >> a >> b >> c >> d;
ll ans = 0;
ans += b / c - (a... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
ll sa(ll a, ll b) {
if (a < b)
swap(a, b);
ll r = a % b;
ll x = a * b;
while (r != 0) {
a = b;
b = r;
r = a % b;
}
return x / b;
}
int main() {
ll a, b, c, d;
cin >> a >> b >> c >> d;
ll ans = 0;
ans += b / c - (a ... | [] | 807,779 | 807,780 | u408650734 | cpp |
p02995 | #include <bits/stdc++.h>
#include <cmath>
typedef long long ll;
#define repd(i, a, b) for (ll i = (a); i < (b); i++)
#define rep(i, n) repd(i, 0, n)
ll mod = 1e9 + 7;
using namespace std;
ll inputValue() {
ll a;
cin >> a;
return a;
};
void inputArray(int *p, ll a){rep(i, a){cin >> p[i];
}
}
;
template <type... | #include <bits/stdc++.h>
#include <cmath>
typedef long long ll;
#define repd(i, a, b) for (ll i = (a); i < (b); i++)
#define rep(i, n) repd(i, 0, n)
ll mod = 1e9 + 7;
using namespace std;
ll inputValue() {
ll a;
cin >> a;
return a;
};
void inputArray(int *p, ll a){rep(i, a){cin >> p[i];
}
}
;
template <type... | [
"expression.unary.arithmetic.add"
] | 807,791 | 807,792 | u712259491 | cpp |
p02995 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <string>
using namespace std;
using ll = long long;
int main() {
ll a1, b1, a, b, c = 0, d = 0, e, m, n, k, o = 0, p, l, q, x1, y1, z,
max1 = 0, s = 0, ans, r, i1 = -1, x, w, h, y, j1;
string t, u;
cin >> a >> b >> c >> d;
... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <string>
using namespace std;
using ll = long long;
int main() {
ll a1, b1, a, b, c = 0, d = 0, e, m, n, k, o = 0, p, l, q, x1, y1, z,
max1 = 0, s = 0, ans, r, i1 = -1, x, w, h, y, j1;
string t, u;
cin >> a >> b >> c >> d;
... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 807,801 | 807,802 | u953532675 | cpp |
p02995 | #include <bits/stdc++.h>
#define MAX 100005
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
ll a, b, c, d;
cin >> a >> b >> c >> d;
ll g = __gcd(c, d);
ll l = (c * d) / g;
ll ans1 = b / c - a / c;
if (a % c == 0)
ans1++;
ll ans2 = b / d -... | #include <bits/stdc++.h>
#define MAX 100005
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
ll a, b, c, d;
cin >> a >> b >> c >> d;
ll g = __gcd(c, d);
ll l = (c * d) / g;
ll ans1 = b / c - a / c;
if (a % c == 0)
ans1++;
ll ans2 = b / d -... | [] | 807,814 | 807,815 | u066910956 | cpp |
p02995 | #include <bits/stdc++.h>
using namespace std;
int64_t gcd(int64_t a, int64_t b) {
if (b == 0ll)
return a;
return gcd(b, a % b);
}
int64_t lcm(int64_t a, int64_t b) { return a * b / gcd(a, b); }
int main() {
int64_t a, b, c, d;
cin >> a >> b >> c >> d;
int64_t cd = lcm(c, d);
int64_t cue = b / c;
... | #include <bits/stdc++.h>
using namespace std;
int64_t gcd(int64_t a, int64_t b) {
if (b == 0ll)
return a;
return gcd(b, a % b);
}
int64_t lcm(int64_t a, int64_t b) { return a * b / gcd(a, b); }
int main() {
int64_t a, b, c, d;
cin >> a >> b >> c >> d;
int64_t cd = lcm(c, d);
int64_t cue = b / c;
... | [
"expression.operation.binary.remove"
] | 807,823 | 807,824 | u424602097 | cpp |
p02995 | #include <bits/stdc++.h>
using namespace std;
int64_t gcd(int64_t a, int64_t b) {
if (b == 0ll)
return a;
return gcd(b, a % b);
}
int64_t lcm(int64_t a, int64_t b) { return a * b / gcd(a, b); }
int main() {
int64_t a, b, c, d;
cin >> a >> b >> c >> d;
int64_t cd = lcm(c, d);
int64_t cue = b / c;
i... | #include <bits/stdc++.h>
using namespace std;
int64_t gcd(int64_t a, int64_t b) {
if (b == 0ll)
return a;
return gcd(b, a % b);
}
int64_t lcm(int64_t a, int64_t b) { return a * b / gcd(a, b); }
int main() {
int64_t a, b, c, d;
cin >> a >> b >> c >> d;
int64_t cd = lcm(c, d);
int64_t cue = b / c;
... | [
"expression.operation.binary.remove"
] | 807,825 | 807,824 | u424602097 | cpp |
p02995 | #include <bits/stdc++.h>
using namespace std;
int64_t gcd(int64_t a, int64_t b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int64_t lcm(int64_t a, int64_t b) { return a * b / gcd(a, b); }
int main() {
int64_t a, b, c, d;
cin >> a >> b >> c >> d;
int64_t cd = lcm(c, d);
int64_t cue = b / c;
int... | #include <bits/stdc++.h>
using namespace std;
int64_t gcd(int64_t a, int64_t b) {
if (b == 0ll)
return a;
return gcd(b, a % b);
}
int64_t lcm(int64_t a, int64_t b) { return a * b / gcd(a, b); }
int main() {
int64_t a, b, c, d;
cin >> a >> b >> c >> d;
int64_t cd = lcm(c, d);
int64_t cue = b / c;
... | [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 807,826 | 807,824 | u424602097 | cpp |
p02995 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C, D;
cin >> A >> B >> C >> D;
int sumAC = 0, sumAD = 0, sumACD = 0, sumBC = 0, sumBD = 0, sumBCD = 0,
sumACDuso = 0, sumBCDuso = 0;
int out;
int saidai;
int tempC = C, tempD = D;
saidai = C * D;
int r;
if (tempC > tempD) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
long int A, B, C, D;
cin >> A >> B >> C >> D;
long int sumAC = 0, sumAD = 0, sumACD = 0, sumBC = 0, sumBD = 0, sumBCD = 0,
sumACDuso = 0, sumBCDuso = 0;
long int out;
long int saidai;
long int tempC = C, tempD = D;
saidai = C * D;
in... | [
"variable_declaration.type.widen.change"
] | 807,827 | 807,828 | u431602218 | cpp |
p02996 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
// ll a, b, c, d;
// cin >> a >> b >> c >> d;
// ll ans = 0;
int n;
cin >> n;
vector<pair<int, int>> ab(n);
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
ab[i] = make_pair(b, a);
}
bool flg = fa... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<pair<int, int>> ab(n);
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
ab[i] = make_pair(b, a);
}
bool flg = false;
sort(ab.begin(), ab.end());
int now = 0;
for (int i = 0... | [
"control_flow.break.add"
] | 807,831 | 807,832 | u291178324 | cpp |
p02996 | #include <algorithm>
#include <iostream>
using namespace std;
struct ab {
long long j, t;
};
bool tmp(ab a, ab b) {
if (a.j < b.j)
return true;
else if (a.t < a.t)
return true;
return false;
}
int main() {
long long n, i;
cin >> n;
ab a[n];
for (i = 0; i < n; i++) {
cin >> a[i].t >> a[i].j;
... | #include <algorithm>
#include <iostream>
using namespace std;
struct ab {
long long j, t;
};
bool tmp(ab a, ab b) {
if (a.j < b.j)
return true;
else if (a.t < a.t)
return true;
return false;
}
int main() {
long long n, i;
cin >> n;
ab a[n];
for (i = 0; i < n; i++) {
cin >> a[i].t >> a[i].j;
... | [
"assignment.variable.change",
"assignment.value.change"
] | 807,833 | 807,834 | u180614022 | cpp |
p02996 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
using ll = long long;
using itn = int;
const ll MOD = 1000000007;
const ll INF = MOD * MOD;
template <cl... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
using ll = long long;
using itn = int;
const ll MOD = 1000000007;
const ll INF = MOD * MOD;
template <cl... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 807,835 | 807,836 | u538125576 | cpp |
p02996 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
using ll = long long;
using itn = int;
const ll MOD = 1000000007;
const ll INF = MOD * MOD;
template <cl... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
using ll = long long;
using itn = int;
const ll MOD = 1000000007;
const ll INF = MOD * MOD;
template <cl... | [
"expression.operation.unary.add",
"call.arguments.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 807,837 | 807,836 | u538125576 | cpp |
p02996 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace st... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace st... | [
"literal.number.change",
"variable_declaration.value.change"
] | 807,843 | 807,844 | u166696759 | cpp |
p02996 | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
typedef pair<ll, ll> Pair;
int main() {
ll n;
scanf("%lld", &n);
vector<Pair> v(n);
for (auto &x : v)
scanf("%lld%lld", &x.first, &x.second);
sort(v.begin(), v.end(), [](Pair x, Pair y) {
if (x.second <= y.second) {
if (x.f... | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
typedef pair<ll, ll> Pair;
int main() {
ll n;
scanf("%lld", &n);
vector<Pair> v(n);
for (auto &x : v)
scanf("%lld%lld", &x.first, &x.second);
sort(v.begin(), v.end(), [](Pair x, Pair y) {
if (x.second <= y.second) {
if (x.f... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 807,845 | 807,846 | u145429281 | cpp |
p02996 | // Keep working hard :)
#include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout... | // Keep working hard :)
#include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout... | [
"call.remove"
] | 807,853 | 807,854 | u490234157 | cpp |
p02996 | #include <bits/stdc++.h>
using namespace std;
#define pb emplace_back
#define int long long
#define endl "\n"
#define pii pair<int, int>
#define ff first
#define ss second
#define mii map<int, int>
#define si set<int>
#define sti stack<int>
#define qi queue<int>
#define vi vector<int>
#define pq priority_queue<int>
#de... | #include <bits/stdc++.h>
using namespace std;
#define pb emplace_back
#define int long long
#define endl "\n"
#define pii pair<int, int>
#define ff first
#define ss second
#define mii map<int, int>
#define si set<int>
#define sti stack<int>
#define qi queue<int>
#define vi vector<int>
#define pq priority_queue<int>
#de... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 807,869 | 807,870 | u231918578 | cpp |
p02996 | #include <bits/stdc++.h>
#include <utility>
using namespace std;
int main() {
int N;
cin >> N;
vector<pair<long long, long long>> work(N);
for (int i = 0; i < N; i++) {
long long A, B;
cin >> A >> B;
work[i] = make_pair(B, A);
}
sort(work.begin(), work.end());
long long A = 0;
long long B = ... | #include <bits/stdc++.h>
#include <utility>
using namespace std;
int main() {
int N;
cin >> N;
vector<pair<long long, long long>> work(N);
for (int i = 0; i < N; i++) {
long long A, B;
cin >> A >> B;
work[i] = make_pair(B, A);
}
sort(work.begin(), work.end());
long long A = 0;
long long B = ... | [
"assignment.value.change"
] | 807,877 | 807,878 | u058186113 | cpp |
p02996 | using namespace std;
#include <bits/stdc++.h>
#define rep(i, s) for (int i = 0; i < s; ++i)
#define repr(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define all(v) (v.begin(), v.end())
#define EACH(i, s) \
for (__typeo... | using namespace std;
#include <bits/stdc++.h>
#define rep(i, s) for (int i = 0; i < s; ++i)
#define repr(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define all(v) (v.begin(), v.end())
#define EACH(i, s) \
for (__typeo... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 807,883 | 807,884 | u535810324 | cpp |
p02996 | using namespace std;
#include <bits/stdc++.h>
#define rep(i, s) for (int i = 0; i < s; ++i)
#define repr(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define all(v) (v.begin(), v.end())
#define EACH(i, s) \
for (__typeo... | using namespace std;
#include <bits/stdc++.h>
#define rep(i, s) for (int i = 0; i < s; ++i)
#define repr(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define all(v) (v.begin(), v.end())
#define EACH(i, s) \
for (__typeo... | [
"control_flow.branch.if.condition.change",
"assignment.value.change"
] | 807,885 | 807,884 | u535810324 | cpp |
p02996 | #include <bits/stdc++.h>
using namespace std;
#define maxn 200007
#define ll long long int
#define db(x) cout << #x << " ->" << x << " " << endl
#define db2(x, y) cout << #x << "->" << x << ", " << #y << " -> " << y << endl
#define db3(x, y, z) \
cout << #x ... | #include <bits/stdc++.h>
using namespace std;
#define maxn 200007
#define ll long long int
#define db(x) cout << #x << " ->" << x << " " << endl
#define db2(x, y) cout << #x << "->" << x << ", " << #y << " -> " << y << endl
#define db3(x, y, z) \
cout << #x ... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 807,888 | 807,889 | u616128518 | cpp |
p02996 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
vector<pair<int, int>> a(n);
for (int i = 0; i < n; i++)
cin >> a.at(i).second >> a.at(i).first;
int ans = 0;
int time = 0;
sort(a.begin(), a.end());
for (pair<int, int> x : a) {
int s, t;
tie(s, t) = x;
time += t;
if... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<pair<int, int>> a(n);
for (int i = 0; i < n; i++)
cin >> a.at(i).second >> a.at(i).first;
int ans = 0;
int time = 0;
sort(a.begin(), a.end());
for (pair<int, int> x : a) {
int s, t;
tie(s, t) = x;
time ... | [] | 807,915 | 807,916 | u424602097 | cpp |
p02996 | #include <bits/stdc++.h>
#define mxn 1000010
#define LL long long
#define pb push_back
#define pf push_front
#define pii pair<int, int>
#define mp make_pair
#define fr first
#define sc second
using namespace std;
int n, nw, sl, fh;
LL S;
struct node {
int a, b;
bool operator<(const node &x) const { return b < x.b; ... | #include <bits/stdc++.h>
#define mxn 1000010
#define LL long long
#define pb push_back
#define pf push_front
#define pii pair<int, int>
#define mp make_pair
#define fr first
#define sc second
using namespace std;
int n, nw, sl, fh;
LL S;
struct node {
int a, b;
bool operator<(const node &x) const { return b < x.b; ... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 807,938 | 807,939 | u938301018 | cpp |
p02996 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define F first
#define S second
using namespace std;
typedef long long ll;
typedef vector... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define F first
#define S second
using namespace std;
typedef long long ll;
typedef vector... | [
"control_flow.break.add"
] | 807,940 | 807,941 | u916207924 | cpp |
p02996 |
#include <bits/stdc++.h>
#include <map>
#define FOR(i, a, b) for (int i = (a); i < (int)(b); ++i)
#define REP(i, n) FOR(i, 0, n)
using namespace std;
int main() {
int n;
cin >> n;
vector<pair<int, int>> p(n);
REP(i, n) {
int temp1, temp2;
cin >> temp1 >> temp2;
p[i] = make_pair(temp2, temp1);
}... |
#include <bits/stdc++.h>
#include <map>
#define FOR(i, a, b) for (int i = (a); i < (int)(b); ++i)
#define REP(i, n) FOR(i, 0, n)
using namespace std;
int main() {
int n;
cin >> n;
vector<pair<int, int>> p(n);
REP(i, n) {
int temp1, temp2;
cin >> temp1 >> temp2;
p[i] = make_pair(temp2, temp1);
}... | [
"assignment.value.change",
"control_flow.branch.if.condition.change"
] | 807,942 | 807,943 | u538853954 | cpp |
p02996 | #include <iostream>
#include <stdlib.h>
#include <vector>
#include <algorithm>
#include <stdio.h>
#include <string>
#include <map>
#include <math.h>
#include <iomanip>
#include <set>
#include <limits.h>
#define rep(i, n) for (ll i = 0; i < (ll)n; i++)
#define swap(a, b) ... | #include <iostream>
#include <stdlib.h>
#include <vector>
#include <algorithm>
#include <stdio.h>
#include <string>
#include <map>
#include <math.h>
#include <iomanip>
#include <set>
#include <limits.h>
#define rep(i, n) for (ll i = 0; i < (ll)n; i++)
#define swap(a, b) ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"call.arguments.change"
] | 807,944 | 807,945 | u040251933 | cpp |
p02996 | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1e9;
const ll LINF = 1e18;
const int MOD = 1e9 + 7;
int main() {
int n;
cin >> n;
vector<P> ab(n);
for (int i = 0; i < n; i++) {
cin >> ab[i].second >> ab[i].f... | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1e9;
const ll LINF = 1e18;
const int MOD = 1e9 + 7;
int main() {
int n;
cin >> n;
vector<P> ab(n);
for (int i = 0; i < n; i++) {
cin >> ab[i].second >> ab[i].f... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 807,946 | 807,947 | u654240084 | cpp |
p02998 | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "debug.h"
#else
#define dump(...)
#endif
#define endl '\n'
#define ll long long
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define REP(i, x) for (int i = 0; i < (int)(x); i++)
#define REPS(i, x) for (int i = 1; i <= (int)(x); i++)
#... | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "debug.h"
#else
#define dump(...)
#endif
#define endl '\n'
#define ll long long
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define REP(i, x) for (int i = 0; i < (int)(x); i++)
#define REPS(i, x) for (int i = 1; i <= (int)(x); i++)
#... | [
"literal.number.change",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 808,653 | 808,654 | u030090262 | cpp |
p02998 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define int long long... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define int long long... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"assignment.variable.change"
] | 808,676 | 808,677 | u491256431 | cpp |
p02998 | #include <algorithm>
#include <array>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdint>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <... | #include <algorithm>
#include <array>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdint>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <... | [
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 808,684 | 808,685 | u664394831 | cpp |
p02998 | #include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#define REP(i, a, b) for (int i = int(a); i < int(b); i++)
using namespace std;
using ll = long long int;
using P = pair<ll, ll>;
// clang-format off
#ifdef _DEBUG_
#define dump(...) do{... | #include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#define REP(i, a, b) for (int i = int(a); i < int(b); i++)
using namespace std;
using ll = long long int;
using P = pair<ll, ll>;
// clang-format off
#ifdef _DEBUG_
#define dump(...) do{... | [] | 808,696 | 808,697 | u451748673 | cpp |
p02998 | #define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
#define FOR(i, j, k) for (int(i) = (j); (i) < (int)(k); ++(i))
#define rep(i, j) FOR(i, 0, j)
#define each(x, y) for (auto &(x) : (y))
#define mp make_pair
#define MT make_tuple
#define all(x) (x).begin(), (x).end()
#define debug(x) cout << #x << "... | #define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
#define FOR(i, j, k) for (int(i) = (j); (i) < (int)(k); ++(i))
#define rep(i, j) FOR(i, 0, j)
#define each(x, y) for (auto &(x) : (y))
#define mp make_pair
#define MT make_tuple
#define all(x) (x).begin(), (x).end()
#define debug(x) cout << #x << "... | [
"assignment.change"
] | 808,902 | 808,903 | u750436322 | cpp |
p02998 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
const ll mo = 1000000007;
const ll INF = 1LL << 60; // MAX 9223372036854775807
ll ans = 0;
struct UnionFind {
vector<ll> data;
UnionFind(ll size) : data(size, -1) {}
bool unionSet(ll x, ll y) {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
const ll mo = 1000000007;
const ll INF = 1LL << 60; // MAX 9223372036854775807
ll ans = 0;
struct UnionFind {
vector<ll> data;
UnionFind(ll size) : data(size, -1) {}
bool unionSet(ll x, ll y) {
... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove",
"assignment.change"
] | 808,910 | 808,911 | u419307948 | cpp |
p02998 | #include <bits/stdc++.h>
#define MOD 1000000007LL
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
struct uftree {
int par[100005];
int rank[100005];
int sz[100005];
uftree() {}
void init(int n) {
for (int i = 0; i < n; i++) {
par[i] = i;
rank[i] = 0;
sz[i] = 1;
... | #include <bits/stdc++.h>
#define MOD 1000000007LL
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
struct uftree {
int par[100005];
int rank[100005];
int sz[100005];
uftree() {}
void init(int n) {
for (int i = 0; i < n; i++) {
par[i] = i;
rank[i] = 0;
sz[i] = 1;
... | [
"expression.operation.binary.remove"
] | 808,916 | 808,917 | u854869949 | cpp |
p02998 | // template version 1.12
using namespace std;
#include <bits/stdc++.h>
#include <iostream>
// varibable settings
#define infile "../test/sample-1.in"
#define int long long //{{{
const int INF = 1e18;
const int MOD = 1e9 + 7; //}}}
// define basic macro {{{
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i... | // template version 1.12
using namespace std;
#include <bits/stdc++.h>
#include <iostream>
// varibable settings
#define infile "../test/sample-1.in"
#define int long long //{{{
const int INF = 1e18;
const int MOD = 1e9 + 7; //}}}
// define basic macro {{{
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i... | [
"preprocessor.define.value.change",
"literal.integer.change"
] | 808,920 | 808,921 | u314057689 | cpp |
p02998 | #include <algorithm>
#include <cfloat>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <unordered_map>
#... | #include <algorithm>
#include <cfloat>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <unordered_map>
#... | [
"expression.operation.unary.logical.remove"
] | 808,924 | 808,925 | u379822620 | cpp |
p02998 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
class UnionFind {
public:
// parent node index if not root index
// minus size of the tree if root index
std::vector<int> data;
UnionFind(int n) { data.resize(n, -1); }
int find(int x) {
if (data[x] < 0) {
return x;
} else {
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
class UnionFind {
public:
// parent node index if not root index
// minus size of the tree if root index
std::vector<int> data;
UnionFind(int n) { data.resize(n, -1); }
int find(int x) {
if (data[x] < 0) {
return x;
} else {
... | [
"assignment.value.change",
"identifier.change",
"call.function.change",
"expression.operation.binary.change"
] | 808,962 | 808,961 | u930841425 | cpp |
p02998 | #include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <chrono>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <s... | #include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <chrono>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <s... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 808,974 | 808,975 | u483814783 | cpp |
p02998 | #include <bits/stdc++.h>
#define err(args...) \
{}
#ifdef DEBUG
#include "_debug.cpp"
#endif
using namespace std;
using ll = long long;
template <typename T> using lim = numeric_limits<T>;
const int N = 200'000;
int main() {
ios_base::sync_with_stdio(false);... | #include <bits/stdc++.h>
#define err(args...) \
{}
#ifdef DEBUG
#include "_debug.cpp"
#endif
using namespace std;
using ll = long long;
template <typename T> using lim = numeric_limits<T>;
const int N = 200'000;
int main() {
ios_base::sync_with_stdio(false);... | [
"variable_declaration.type.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"control_flow.loop.for.initializer.change"
] | 808,999 | 808,998 | u957513998 | cpp |
p02998 | #include <iostream>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
ll N;
vector<vector<int>> v(200010);
int vis[200010] = {};
ll dfs(int n, set<int> &sx, set<int> &sy) {
ll cnt = 0;
vis[n] = 1;
if (n <= 100000)
sx.insert(n);
else
sy.insert(n);
for (auto x : v[n]) {
c... | #include <iostream>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
ll N;
vector<vector<int>> v(200010);
int vis[200010] = {};
ll dfs(int n, set<int> &sx, set<int> &sy) {
ll cnt = 0;
vis[n] = 1;
if (n <= 100000)
sx.insert(n);
else
sy.insert(n);
for (auto x : v[n]) {
c... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"expression.operation.binary.change"
] | 809,000 | 809,001 | u623954643 | cpp |
p02998 | #include <algorithm>
#include <cctype>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
#define ll long long
#define reg register
#define rep(i, a, b) for (reg int i = (a), i##end = (b); i <= i##end; ++i)
#define dep(i, a, b) for (reg int i = (a), i##end = (b); i >= i##end; --i)
template ... | #include <algorithm>
#include <cctype>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
#define ll long long
#define reg register
#define rep(i, a, b) for (reg int i = (a), i##end = (b); i <= i##end; ++i)
#define dep(i, a, b) for (reg int i = (a), i##end = (b); i >= i##end; --i)
template ... | [
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 809,012 | 809,013 | u786191361 | cpp |
p02998 | #include <bits/stdc++.h>
#define N 100005
#define LL long long
using namespace std;
template <class T> inline void Rd(T &x) {
x = 0;
char c = getchar();
bool f = 0;
while (c < '0' || c > '9') {
if (c == '-')
f ^= 1;
c = getchar();
}
while (c >= '0' && c <= '9')
x = (x << 1) + (x << 3) + c ... | #include <bits/stdc++.h>
#define N 100005
#define LL long long
using namespace std;
template <class T> inline void Rd(T &x) {
x = 0;
char c = getchar();
bool f = 0;
while (c < '0' || c > '9') {
if (c == '-')
f ^= 1;
c = getchar();
}
while (c >= '0' && c <= '9')
x = (x << 1) + (x << 3) + c ... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 809,064 | 809,063 | u766592454 | cpp |
p02998 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
using namespace std;
inline int read() {
int x = 0, f = 1;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-')
f = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9')
x = x * 10 + ch... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
using namespace std;
inline int read() {
int x = 0, f = 1;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-')
f = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9')
x = x * 10 + ch... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 809,065 | 809,066 | u475221259 | cpp |
p02998 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
using namespace std;
inline int read() {
int x = 0, f = 1;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-')
f = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9')
x = x * 10 + ch... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
using namespace std;
inline int read() {
int x = 0, f = 1;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-')
f = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9')
x = x * 10 + ch... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"call.arguments.change"
] | 809,067 | 809,066 | u475221259 | cpp |
p02998 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vll = vector<ll>;
using vvi = vector<vector<int>>;
using vvl = vector<vector<ll>>;
class U {
public:
int n;
vector<int> p, s;
U(int _) {
n = _;
p.resize(n);
s.resize(n);
for (int i = 0; i < n; i++... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vll = vector<ll>;
using vvi = vector<vector<int>>;
using vvl = vector<vector<ll>>;
class U {
public:
int n;
vector<int> p, s;
U(int _) {
n = _;
p.resize(n);
s.resize(n);
for (int i = 0; i < n; i++... | [
"variable_access.subscript.index.change",
"call.arguments.change"
] | 809,074 | 809,075 | u656572785 | cpp |
p02999 | #include <bits/stdc++.h>
using namespace std;
int main() {
int x, a;
cin >> x >> a;
if (x < a) {
cout << "0" << endl;
} else if (x >= 10) {
cout << "10" << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int x, a;
cin >> x >> a;
if (x < a) {
cout << "0" << endl;
} else if (x >= a) {
cout << "10" << endl;
}
return 0;
} | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 809,080 | 809,081 | u497715246 | cpp |
p02999 | #include <iostream>
int main() {
int X, A;
std::cin >> X >> A;
if (X <= A)
std::cout << 0 << std::endl;
else
std::cout << 10 << std::endl;
return 0;
} | #include <iostream>
int main() {
int X, A;
std::cin >> X >> A;
if (X < A)
std::cout << 0 << std::endl;
else
std::cout << 10 << std::endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 809,089 | 809,090 | u913480647 | cpp |
p02999 | #include <bits/stdc++.h>
using namespace std;
int main() {
int x, a;
cin >> a >> x;
if (x < a) {
cout << 0;
} else {
cout << 10;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int x, a;
cin >> x >> a;
if (x < a) {
cout << 0;
} else {
cout << 10;
}
return 0;
}
| [
"expression.operation.binary.remove"
] | 809,119 | 809,120 | u523119383 | cpp |
p02999 | #include <bits/stdc++.h>
using namespace std;
int main() {
int x, a;
cin >> a >> x;
if (x < a) {
cout << 10;
} else {
cout << 0;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int x, a;
cin >> x >> a;
if (x < a) {
cout << 0;
} else {
cout << 10;
}
return 0;
}
| [
"expression.operation.binary.remove",
"literal.number.change",
"io.output.change"
] | 809,121 | 809,120 | u523119383 | cpp |
p02999 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
... | [
"control_flow.branch.else.remove",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 809,125 | 809,126 | u605833494 | cpp |
p02999 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 809,131 | 809,132 | u926006934 | cpp |
p02998 | //#pragma once
#include <algorithm>
#include <bitset>
#include <cctype>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define modd 1000000007
type... | //#pragma once
#include <algorithm>
#include <bitset>
#include <cctype>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define modd 1000000007
type... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"assignment.variable.change"
] | 809,150 | 809,151 | u058317639 | cpp |
p02998 | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 5;
inline int read() {
char c = getchar();
int t = 0, f = 1;
while (!isdigit(c)) {
if (c == '-')
f = -1;
c = getchar();
}
while (isdigit(c)) {
t = (t << 3) + (t << 1) + (c ^ 48);
c = getchar();
}
return t * f;
}
int... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 5;
inline int read() {
char c = getchar();
int t = 0, f = 1;
while (!isdigit(c)) {
if (c == '-')
f = -1;
c = getchar();
}
while (isdigit(c)) {
t = (t << 3) + (t << 1) + (c ^ 48);
c = getchar();
}
return t * f;
}
int... | [] | 809,156 | 809,157 | u879660427 | cpp |
p02998 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
const int maxn = 1e5 + 5;
int xfa[maxn] = {0}, yfa[maxn] = {0};
int xsize[maxn] = {0}, ysize[maxn] = {0};
int vis[maxn] = {0};
struct point {
int x;
int y;
} p[maxn];
list<int> xcolumn[maxn];
list<int> yrow[maxn];
int xfindrt(int p) { return (p =... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
const int maxn = 1e5 + 5;
int xfa[maxn] = {0}, yfa[maxn] = {0};
ll xsize[maxn] = {0}, ysize[maxn] = {0};
int vis[maxn] = {0};
struct point {
int x;
int y;
} p[maxn];
list<int> xcolumn[maxn];
list<int> yrow[maxn];
int xfindrt(int p) { return (p ==... | [
"variable_declaration.type.change",
"identifier.change",
"call.function.change"
] | 809,162 | 809,161 | u219398458 | cpp |
p02998 | #include <bits/stdc++.h>
typedef long long LL;
#define SZ(X) ((int)(X).size())
#define ALL(X) (X).begin(), (X).end()
#define REP(I, N) for (int I = 0; I < (N); ++I)
#define REPP(I, A, B) for (int I = (A); I < (B); ++I)
#define RI(X) scanf("%d", &(X))
#define RII(X, Y) scanf("%d%d", &(X), &(Y))
#define RIII(X, Y, Z) sca... | #include <bits/stdc++.h>
typedef long long LL;
#define SZ(X) ((int)(X).size())
#define ALL(X) (X).begin(), (X).end()
#define REP(I, N) for (int I = 0; I < (N); ++I)
#define REPP(I, A, B) for (int I = (A); I < (B); ++I)
#define RI(X) scanf("%d", &(X))
#define RII(X, Y) scanf("%d%d", &(X), &(Y))
#define RIII(X, Y, Z) sca... | [
"identifier.change"
] | 809,166 | 809,167 | u067899663 | cpp |
p02998 | #include <bits/stdc++.h>
typedef long long LL;
#define SZ(X) ((int)(X).size())
#define ALL(X) (X).begin(), (X).end()
#define REP(I, N) for (int I = 0; I < (N); ++I)
#define REPP(I, A, B) for (int I = (A); I < (B); ++I)
#define RI(X) scanf("%d", &(X))
#define RII(X, Y) scanf("%d%d", &(X), &(Y))
#define RIII(X, Y, Z) sca... | #include <bits/stdc++.h>
typedef long long LL;
#define SZ(X) ((int)(X).size())
#define ALL(X) (X).begin(), (X).end()
#define REP(I, N) for (int I = 0; I < (N); ++I)
#define REPP(I, A, B) for (int I = (A); I < (B); ++I)
#define RI(X) scanf("%d", &(X))
#define RII(X, Y) scanf("%d%d", &(X), &(Y))
#define RIII(X, Y, Z) sca... | [
"identifier.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 809,168 | 809,167 | u067899663 | cpp |
p02998 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef long double ld;
typedef vector<ld> vd;
typedef bool bl;
typedef vector<bl> vb;
typedef unordered_map<ll, unordered_map<ll, ll>> graph;
const ll e5 = 1 << 20;
const ll mod = 1000000007;
const ll e3 = 1 << 13;
const ll I... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef long double ld;
typedef vector<ld> vd;
typedef bool bl;
typedef vector<bl> vb;
typedef unordered_map<ll, unordered_map<ll, ll>> graph;
const ll e5 = 1 << 20;
const ll mod = 1000000007;
const ll e3 = 1 << 13;
const ll I... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"call.arguments.change",
"control_flow.branch.if.replace.add",
"control_flow.branch.else_if.replace.remove"
] | 809,173 | 809,174 | u842401785 | cpp |
p02998 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, x, n) for (int i = x; i < (n); i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)
#define all(X) (X).begin(), (X).end()
#define X first
#define Y second
#define pb push_back
#define eb emplace_back
using namespace std;
type... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, x, n) for (int i = x; i < (n); i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)
#define all(X) (X).begin(), (X).end()
#define X first
#define Y second
#define pb push_back
#define eb emplace_back
using namespace std;
type... | [] | 809,181 | 809,182 | u703805376 | cpp |
p02998 | // Author: πα
#include <bits/stdc++.h>
using namespace std;
#define long int64_t
const int N = 1e5 + 5;
vector<int> g[N];
bool vis[N];
int cl, cr, ce;
void dfs(int u) {
if (vis[u])
return;
vis[u] = 1;
if (u < N)
cl++, ce += g[u].size();
else
cr++;
for (auto v : g[u])
dfs(v);
}
int main() {... | // Author: πα
#include <bits/stdc++.h>
using namespace std;
#define long int64_t
const int N = 1e5 + 5;
vector<int> g[N + N];
bool vis[N + N];
int cl, cr, ce;
void dfs(int u) {
if (vis[u])
return;
vis[u] = 1;
if (u < N)
cl++, ce += g[u].size();
else
cr++;
for (auto v : g[u])
dfs(v);
}
int ... | [
"variable_declaration.array_dimensions.change",
"expression.operation.binary.add"
] | 809,183 | 809,184 | u518468154 | cpp |
p02998 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
static const int MOD = 1000000007;
using ll = long long;
using u32 = uint32_t;
using namespace std;
template <class T> constexpr T INF = ::n... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
static const int MOD = 1000000007;
using ll = long long;
using u32 = uint32_t;
using namespace std;
template <class T> constexpr T INF = ::n... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"identifier.change",
"call.arguments.change"
] | 809,193 | 809,194 | u915020369 | cpp |
p02999 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, X;
cin >> A >> X;
if (X < A) {
cout << "0";
} else if (X >= A) {
cout << "10";
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, X;
cin >> X >> A;
if (X < A) {
cout << "0";
} else if (X >= A) {
cout << "10";
}
} | [
"expression.operation.binary.remove"
] | 809,205 | 809,206 | u946356400 | cpp |
p02999 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int x, a;
cin >> x >> a;
if (x < a)
cout << 0 << endl;
else
cout << 1 << endl;
}
// cout << fixed << setprecision(15) << << endl; | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int x, a;
cin >> x >> a;
if (x < a)
cout << 0 << endl;
else
cout << 10 << endl;
}
// cout << fixed << setprecision(15) << << endl; | [
"literal.number.change",
"io.output.change"
] | 809,211 | 809,212 | u052656528 | cpp |
p02999 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a;
cin >> n >> a;
if (n << a) {
cout << "0" << endl;
} else {
cout << "10" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a;
cin >> n >> a;
if (n < a) {
cout << 0 << endl;
} else {
cout << 10 << endl;
}
}
| [
"misc.typo",
"control_flow.branch.if.condition.change"
] | 809,213 | 809,214 | u089230684 | cpp |
p02999 | #include <stdio.h>
int main() {
int a, b;
scanf("%d%d", &a, &b);
if (a > b)
printf("0");
else
printf("10");
} | #include <stdio.h>
int main() {
int a, b;
scanf("%d%d", &a, &b);
if (a < b)
printf("0");
else
printf("10");
return 0;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.return.add",
"control_flow.return.0.add"
] | 809,215 | 809,216 | u018679195 | cpp |
p02999 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int A, X;
cin >> A >> X;
if (X < A)
cout << 0;
else
cout << 10;
cout << endl;
} | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int A, X;
cin >> X >> A;
if (X < A)
cout << 0;
else
cout << 10;
cout << endl;
} | [
"expression.operation.binary.remove"
] | 809,217 | 809,218 | u018679195 | cpp |
p02999 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a > b) {
cout << "10";
} else {
cout << "0";
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a >= b) {
cout << "10";
} else {
cout << "0";
}
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 809,219 | 809,220 | u018679195 | cpp |
p02999 | //#include<bits/stdc++.h>
#include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
/*
#include <boost/multiprecision/cpp_dec_float.hpp>
#include<boost/multiprecision/cpp_int.hpp>
#include <boost/rational.hpp>
namespace mp = boost::mul... | //#include<bits/stdc++.h>
#include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
/*
#include <boost/multiprecision/cpp_dec_float.hpp>
#include<boost/multiprecision/cpp_int.hpp>
#include <boost/rational.hpp>
namespace mp = boost::mul... | [
"identifier.replace.remove",
"literal.replace.add",
"io.output.change"
] | 809,233 | 809,234 | u853817705 | cpp |
p02999 | #include <algorithm>
#include <bitset>
#include <cstring>
#include <ctype.h>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector... | #include <algorithm>
#include <bitset>
#include <cstring>
#include <ctype.h>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector... | [
"literal.number.change",
"io.output.change"
] | 809,237 | 809,238 | u734397606 | cpp |
p02999 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int X, A;
cin >> X >> A;
if (X < A)
cout << "0\n";
else
"10\n";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main(void) {
int X, A;
cin >> X >> A;
if (X < A)
cout << "0\n";
else
cout << "10\n";
return 0;
}
| [
"io.output.change"
] | 809,245 | 809,246 | u346040900 | cpp |
p02999 | #include <bits/stdc++.h>
using namespace std;
int main() {
int x, a;
cin >> x >> a;
if (x < a) {
cout << '0' << endl;
} else {
cout << '10' << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int x, a;
cin >> x >> a;
if (x < a) {
cout << '0' << endl;
} else {
cout << "10" << endl;
}
} | [
"literal.string.change",
"io.output.change"
] | 809,251 | 809,252 | u965418380 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.