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 |
|---|---|---|---|---|---|---|---|
p02999 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a;
cin >> b;
if (a <= b) {
cout << 0 << endl;
} else {
cout << 10 << endl;
}
} | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a < b) {
cout << 0 << endl;
} else {
cout << 10 << endl;
}
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 809,840 | 809,841 | u728824436 | cpp |
p02999 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll MOD = 1000000007;
int main() {
int X, A;
cin >> X >> A;
if (X < A)
cout << 0 << endl;
else
cout << 1 << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll MOD = 1000000007;
int main() {
int X, A;
cin >> X >> A;
if (X < A)
cout << 0 << endl;
else
cout << 10 << endl;
return 0;
}
| [
"literal.number.change",
"io.output.change"
] | 809,850 | 809,851 | u831873811 | cpp |
p02999 | #include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
#define DEBUG
#ifdef DEB... | #include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
#define DEBUG
#ifdef DEB... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 809,852 | 809,853 | u320267258 | cpp |
p02999 | #include <bits/stdc++.h>
using namespace std;
int main() {
int x, a;
std::cin >> x >> a;
if (x > a)
std::cout << '1';
std::cout << '0' << std::endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int x, a;
std::cin >> x >> a;
if (x >= a)
std::cout << '1';
std::cout << '0' << std::endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 809,856 | 809,857 | u832726997 | cpp |
p02999 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << (a > b ? 10 : 0) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << (a >= b ? 10 : 0) << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"io.output.change"
] | 809,866 | 809,867 | u676654593 | cpp |
p02999 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main(void) {
int A, X;
int res;
cin >> A >> X;
res = (X < A) ? 0 : 10;
cout << res;
}
| #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main(void) {
int A, X;
int res;
cin >> X >> A;
res = (X < A) ? 0 : 10;
cout << res;
}
| [
"expression.operation.binary.remove"
] | 809,873 | 809,874 | u209053759 | cpp |
p02999 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
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;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
int x, a;
cin >> x >> a;
if (x < a) {
cout << 0 << endl;
}
if (x >= a) {
cout << 10 << endl;
}
return 0;
} | [
"control_flow.branch.if.replace.add",
"control_flow.branch.else_if.replace.remove",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 809,882 | 809,883 | u294829559 | cpp |
p02999 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
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;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
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;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 809,882 | 809,884 | u294829559 | cpp |
p02999 | #include <iostream>
using namespace std;
int main(void) {
int X, A;
cin >> X >> A;
if (X <= A) {
cout << 0 << endl;
} else if (X >= A) {
cout << 10 << endl;
} else if (X == A) {
cout << 10 << endl;
}
} | #include <iostream>
using namespace std;
int main(void) {
int X, A;
cin >> X >> A;
if (X < A) {
cout << 0 << endl;
} else if (X > A) {
cout << 10 << endl;
} else if (X == A) {
cout << 10 << endl;
}
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 809,885 | 809,886 | u413186616 | cpp |
p02999 | #include <iostream>
#include <string>
using namespace std;
int main(void) {
int i, j;
cin >> i >> j;
if (i > j) {
cout << "0" << endl;
} else {
cout << "10" << endl;
}
return 0;
}
| #include <iostream>
#include <string>
using namespace std;
int main(void) {
int i, j;
cin >> i >> j;
if (i < j) {
cout << "0" << endl;
} else {
cout << "10" << endl;
}
return 0;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 809,887 | 809,888 | u370315157 | cpp |
p02999 | #include <algorithm>
#include <cmath>
#include <complex> // complex<double> a(1.2 , 2.3);// real(): 1.2, imag()2.3
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
#define MOD 1000000007
#define ll long long
#define ld long double
#define ... | #include <algorithm>
#include <cmath>
#include <complex> // complex<double> a(1.2 , 2.3);// real(): 1.2, imag()2.3
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
#define MOD 1000000007
#define ll long long
#define ld long double
#define ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 809,900 | 809,901 | u866107333 | cpp |
p02999 | #include <bits/stdc++.h>
#define sz(c) int(c.size())
#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define per(i, a, b) for (int i = (b)-1; i >= (a); --i)
using namespace std;
using ll = long long;
int main() {
cin.tie(0);
ios_base::sync_with_stdio(0);
cout << fixed << setprecision(10);
int x, a;
cin >... | #include <bits/stdc++.h>
#define sz(c) int(c.size())
#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define per(i, a, b) for (int i = (b)-1; i >= (a); --i)
using namespace std;
using ll = long long;
int main() {
cin.tie(0);
ios_base::sync_with_stdio(0);
cout << fixed << setprecision(10);
int x, a;
cin >... | [
"io.output.change"
] | 809,915 | 809,916 | u740102500 | cpp |
p02999 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, x;
cin >> a >> x;
if (x < a) {
cout << "0" << endl;
} else {
cout << "10" << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, x;
cin >> x >> a;
if (x < a) {
cout << "0" << endl;
} else {
cout << "10" << endl;
}
return 0;
}
| [
"expression.operation.binary.remove"
] | 809,919 | 809,920 | u010685577 | cpp |
p02999 | #include <bits/stdc++.h>
using namespace std;
int main() {
int x, a;
cin >> x >> a;
if (x < a)
cout << 1 << 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.number.change",
"io.output.change"
] | 809,933 | 809,934 | u544165468 | cpp |
p02999 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
scanf("%d%d", &a, &b);
printf("%d", a > b ? 0 : 10);
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
scanf("%d%d", &a, &b);
printf("%d", a < b ? 0 : 10);
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 809,935 | 809,936 | u508834119 | cpp |
p02999 | #include <bits/stdc++.h>
using namespace std;
int main() {
int x, y;
cin >> x >> y;
if (x > y) {
cout << "10" << endl;
} else
cout << "0" << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int x, y;
cin >> x >> y;
if (x >= y) {
cout << "10" << endl;
} else
cout << "0" << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 809,954 | 809,955 | u432205669 | cpp |
p02999 |
#include <iostream>
int main(void) {
int A, X;
std::cin >> A >> X;
if (X < A)
std::cout << 0 << std::endl;
else
std::cout << 10 << std::endl;
return 0;
} | #include <iostream>
int main(void) {
int A, X;
std::cin >> X >> A;
if (X < A)
std::cout << 0 << std::endl;
else
std::cout << 10 << std::endl;
return 0;
} | [
"expression.operation.binary.remove"
] | 809,959 | 809,960 | u967843578 | cpp |
p02999 | #include <iostream>
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;
}
| #include <iostream>
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;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 809,966 | 809,967 | u236517920 | cpp |
p02999 | #include <iostream>
using namespace std;
int main() {
int X, A;
cin >> X >> A;
if (X < A) {
cout << 0 << endl;
} else {
cout << 1 << endl;
}
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int X, A;
cin >> X >> A;
if (X < A) {
cout << 0 << endl;
} else {
cout << 10 << endl;
}
return 0;
}
| [
"literal.number.change",
"io.output.change"
] | 809,978 | 809,979 | u807156908 | cpp |
p02999 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <list>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
typedef pair<int, ... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <list>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
typedef pair<int, ... | [
"literal.number.change",
"io.output.change"
] | 809,985 | 809,986 | u950174376 | cpp |
p02999 | #include <iostream>
using namespace std;
int main() {
int x, a;
cin >> x, a;
if (x < a)
cout << "0";
else
cout << "10";
return 0;
} | #include <iostream>
using namespace std;
int main() {
int x, a;
cin >> x >> a;
if (x < a)
cout << "0";
else
cout << "10";
return 0;
} | [] | 809,987 | 809,988 | u924527074 | cpp |
p02999 | #include <iostream>
using namespace std;
int main() {
int x, a;
cin >> x, a;
if (x < a)
cout << "0";
else
cout << "1";
return 0;
} | #include <iostream>
using namespace std;
int main() {
int x, a;
cin >> x >> a;
if (x < a)
cout << "0";
else
cout << "10";
return 0;
} | [
"literal.string.change",
"io.output.change"
] | 809,989 | 809,988 | u924527074 | cpp |
p02999 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
scanf("%d %d", &a, &b);
printf("%d\n", a < b ? 1 : 10);
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
scanf("%d %d", &a, &b);
printf("%d\n", a < b ? 0 : 10);
} | [
"literal.number.change",
"call.arguments.change",
"io.output.change"
] | 809,997 | 809,998 | u702404504 | cpp |
p02999 | #include <iostream>
using namespace std;
int main() {
int X, A;
cin >> X >> A;
if (A <= X) {
cout << 1;
} else {
cout << 0;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int X, A;
cin >> X >> A;
if (A <= X) {
cout << 10;
} else {
cout << 0;
}
return 0;
} | [
"literal.number.change",
"io.output.change"
] | 810,011 | 810,012 | u367177642 | cpp |
p02999 | #include <iostream>
using namespace std;
int main() {
int X, A;
cin >> X >> A;
if (X < A) {
cout << "0" << endl;
} else {
cout << "1" << endl;
}
} | #include <iostream>
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"
] | 810,019 | 810,020 | u065375429 | cpp |
p02999 | #include <bits/stdc++.h>
using namespace std;
int main() {
int x, a;
cin >> x >> a;
if (x < a)
cout << 0 << endl;
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
cout << 10 << endl;
return 0;
} | [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 810,028 | 810,029 | u211795663 | cpp |
p02999 | #include <iostream>
int main(void) {
int X, A;
std::cin >> X >> A;
std::cout << (X < A) ? 0 : 10;
return 0;
}
| #include <iostream>
int main(void) {
int X, A;
std::cin >> X >> A;
std::cout << ((X < A) ? 0 : 10);
return 0;
}
| [] | 810,036 | 810,037 | u459819918 | cpp |
p02999 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define all(x) x.begin(), x.end()
int tt = 1;
void ok() {
int a, x;
cin >> a >> x;
cout << ((x < a) ? 0 : 10) << "\n";
}
int32_t main() {
int t = 1;
// cin >> t;
int c = 0;
while (t--) {
ok();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define all(x) x.begin(), x.end()
int tt = 1;
void ok() {
int a, x;
cin >> x >> a;
cout << ((x < a) ? 0 : 10) << "\n";
}
int32_t main() {
int t = 1;
// cin >> t;
int c = 0;
while (t--) {
ok();
}
return 0;
}
| [
"expression.operation.binary.remove"
] | 810,038 | 810,039 | u745631549 | cpp |
p02999 | #include <iostream>
#include <stdio.h>
int main() {
int n, m;
std::cin >> n, m;
puts(n < m ? "0" : "10");
} | #include <iostream>
#include <stdio.h>
int main() {
int n, m;
std::cin >> n >> m;
puts(n < m ? "0" : "10");
} | [] | 810,046 | 810,047 | u244203620 | cpp |
p02999 | #include <iostream>
using namespace std;
int main() {
int x, a;
cin >> x >> a;
cout << (x < a) ? (0) : (10);
return 0;
} | #include <iostream>
using namespace std;
int main() {
int x, a;
cin >> x >> a;
cout << ((x < a) ? (0) : (10));
return 0;
} | [] | 810,055 | 810,056 | u061626279 | cpp |
p02999 | #include <stdio.h>
int X;
int A;
int main() {
scanf("%d %d", X, A);
if (X < A)
printf("0");
else
printf("10");
return 0;
} | #include <stdio.h>
using namespace std;
int X;
int A;
int main() {
scanf("%d %d", &X, &A);
if (X < A)
printf("0");
else
printf("10");
return 0;
}
| [
"expression.operation.unary.reference.add"
] | 810,057 | 810,058 | u088989565 | cpp |
p02999 | #include <algorithm> // sort
#include <bits/stdc++.h>
#include <ctype.h>
#include <iomanip>
#include <iostream>
#include <map> // pair
#include <math.h>
#include <numeric>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define nin(n) ... | #include <algorithm> // sort
#include <bits/stdc++.h>
#include <ctype.h>
#include <iomanip>
#include <iostream>
#include <map> // pair
#include <math.h>
#include <numeric>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define nin(n) ... | [
"literal.string.change",
"io.output.change"
] | 810,278 | 810,279 | u132284673 | cpp |
p02999 | #include <cstdio>
int main() {
int x, a;
scanf("%d %d", &x, &a);
if (x > a)
printf("0");
else
printf("10");
}
| #include <cstdio>
int main() {
int x, a;
scanf("%d %d", &x, &a);
if (x < a)
printf("0");
else
printf("10");
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 810,282 | 810,283 | u175715341 | cpp |
p02999 | #include <iostream>
using namespace std;
int main() {
int x, a;
cin >> x >> a;
if (x < a) {
cout << '0' << endl;
} else {
cout << '10' << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int x, a;
cin >> x >> a;
if (x < a) {
cout << "0" << endl;
} else {
cout << "10" << endl;
}
return 0;
} | [
"literal.string.change",
"io.output.change"
] | 810,288 | 810,289 | u478018523 | cpp |
p02999 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b, c, ans, temp;
cin >> n >> a;
if (n <= a) {
cout << 10;
} else {
cout << 0;
}
// cout << ;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b, c, ans, temp;
cin >> n >> a;
if (a <= n) {
cout << 10;
} else {
cout << 0;
}
// cout << ;
return 0;
}
| [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 810,290 | 810,291 | u922786510 | cpp |
p02999 | #include <iostream>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
if (x < n)
cout << 0;
else
cout << 10;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n, x;
cin >> x >> n;
if (x < n)
cout << 0;
else
cout << 10;
return 0;
} | [
"expression.operation.binary.remove"
] | 810,302 | 810,303 | u264043768 | cpp |
p02999 | #include <iostream>
using namespace std;
int main() {
int a, b, c, d;
cin >> a >> b;
if (a < b) {
cout << 10;
} else
cout << 0;
} | #include <iostream>
using namespace std;
int main() {
int a, b, c, d;
cin >> a >> b;
if (a < b) {
cout << 0;
} else
cout << 10;
}
| [
"literal.number.change",
"io.output.change"
] | 810,304 | 810,305 | u661845689 | cpp |
p02999 | #include <bits/stdc++.h>
#define ll long long
#define speed_up \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define rep(i, a... | #include <bits/stdc++.h>
#define ll long long
#define speed_up \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define rep(i, a... | [
"identifier.replace.remove",
"literal.replace.add",
"io.output.change"
] | 810,306 | 810,307 | u223028888 | cpp |
p02999 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a <= b)
cout << 0 << endl;
else
cout << 10 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a < b)
cout << 0 << endl;
else
cout << 10 << endl;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 810,316 | 810,317 | u466983830 | cpp |
p02999 | #include <iostream>
using namespace std;
int main() {
// 整数Xの入力
int X;
cin >> X;
// 整数Aの入力
int A;
cin >> A;
// 分岐
if (X < A) { // XがA未満のときは0を出力する
cout << 0 << endl;
}
else { // X >= A以上の時10を出力せよ。
cout << 0 << endl;
}
} | #include <iostream>
using namespace std;
int main() {
// 整数Xの入力
int X;
cin >> X;
// 整数Aの入力
int A;
cin >> A;
// 分岐
if (X < A) { // XがA未満のときは0を出力する
cout << 0 << endl;
}
else { // X >= A以上の時10を出力せよ。
cout << 10 << endl;
}
} | [
"literal.number.change",
"io.output.change"
] | 810,318 | 810,319 | u203694953 | cpp |
p02999 | #include <iostream>
using namespace std;
int main(void) {
int a, b;
cin >> a >> b;
if (a < b) {
cout << "0";
} else if (a >= b) {
cout << "1";
}
cout << endl;
}
| #include <iostream>
using namespace std;
int main(void) {
int a, b;
cin >> a >> b;
if (a < b) {
cout << "0";
} else if (a >= b) {
cout << "10";
}
cout << endl;
}
| [
"literal.string.change",
"io.output.change"
] | 810,340 | 810,341 | u869112787 | cpp |
p02999 | #include <iostream>
using namespace std;
int main() {
int X, A;
cin >> X >> A;
cout << (A - X >= 0) * 10 << endl;
} | #include <iostream>
using namespace std;
int main() {
int X, A;
cin >> X >> A;
cout << (X - A >= 0) * 10 << endl;
} | [
"expression.operation.binary.remove"
] | 810,350 | 810,351 | u313403396 | cpp |
p02999 | #include <iostream>
using namespace std;
int main() {
int X, A;
cin >> X >> A;
cout << (X - A <= 0) * 10 << endl;
} | #include <iostream>
using namespace std;
int main() {
int X, A;
cin >> X >> A;
cout << (X - A >= 0) * 10 << endl;
} | [
"misc.opposites",
"expression.operator.compare.change",
"io.output.change"
] | 810,352 | 810,351 | u313403396 | 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;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int x, a;
cin >> x >> a;
if (x < a) {
cout << 0;
} else {
cout << 10;
}
}
| [
"expression.operation.binary.remove"
] | 810,366 | 810,367 | u521723672 | cpp |
p02999 | #include <bits/stdc++.h>
using namespace std;
int main() {
int X, A;
cin >> X >> A;
if (X > A) {
printf("0");
} else {
printf("10");
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int X, A;
cin >> X >> A;
if (X < A) {
printf("0");
} else {
printf("10");
}
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 810,368 | 810,369 | u840958781 | cpp |
p02999 | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
int x, a;
cin >> x >> a;
if (x < a)
cout << x << endl;
else
cout << 10 << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
int x, a;
cin >> x >> a;
if (x < a)
cout << 0 << endl;
else
cout << 10 << endl;
return 0;
} | [
"identifier.replace.remove",
"literal.replace.add",
"io.output.change"
] | 810,385 | 810,386 | u754144235 | cpp |
p02999 | #include <bits/stdc++.h>
using namespace std;
int main() {
int x, a;
cin >> x >> a;
if (x > a) {
cout << 10 << endl;
} else {
cout << 0 << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int x, a;
cin >> x >> a;
if (x >= a) {
cout << 10 << endl;
} else {
cout << 0 << endl;
}
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 810,387 | 810,388 | u600611341 | 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"
] | 810,389 | 810,390 | u111886521 | cpp |
p02999 | #include <bits/stdc++.h>
#include <string>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<double> vd;
#define INF (1e9)
// テンプレート関数
#define REP(i, x, n) for (int i = x; i < n; i++)
#define rep(i, n) REP(i, 0, n)
int main() {
int X, A;
cin >> X >... | #include <bits/stdc++.h>
#include <string>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<double> vd;
#define INF (1e9)
// テンプレート関数
#define REP(i, x, n) for (int i = x; i < n; i++)
#define rep(i, n) REP(i, 0, n)
int main() {
int X, A;
cin >> X >... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 810,393 | 810,394 | u490932182 | cpp |
p02999 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (long long i = 0; i < n; i++)
#define REP1(i, n) for (long long i = 1; i <= n; i++)
#define PER(i, n) for (long long i = ((n)-1); i >= 0; i--)
#define PER1(i, n) for (long long i = (n); i > 0; i--)
#define FOR(i, a, b) for (long long i = (a); i < (b); ... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (long long i = 0; i < n; i++)
#define REP1(i, n) for (long long i = 1; i <= n; i++)
#define PER(i, n) for (long long i = ((n)-1); i >= 0; i--)
#define PER1(i, n) for (long long i = (n); i > 0; i--)
#define FOR(i, a, b) for (long long i = (a); i < (b); ... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.condition.change",
"io.output.change"
] | 810,395 | 810,396 | u786318703 | cpp |
p02999 | #include <iostream>
using namespace std;
int main() {
int x, a;
cin >> x >> a;
int res = (x < a) ? 0 : 1;
cout << res << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int x, a;
cin >> x >> a;
int res = (x < a) ? 0 : 10;
cout << res << endl;
return 0;
} | [
"literal.number.change"
] | 810,402 | 810,403 | u455317716 | cpp |
p02999 | #include <bits/stdc++.h>
using namespace std;
int main() {
// your code goes here
int x, a;
cin >> x >> a;
if (x < 0)
cout << 0;
else
cout << 10;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
// your code goes here
int x, a;
cin >> x >> a;
if (x < a)
cout << 0;
else
cout << 10;
return 0;
} | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 810,414 | 810,415 | u788544244 | cpp |
p02999 | #include <iostream>
using namespace std;
int main() {
int X, A;
cin >> X >> A;
if (A < 0)
cout << 0;
else
cout << 10;
}
| #include <iostream>
using namespace std;
int main() {
int X, A;
cin >> X >> A;
if (X < A)
cout << 0;
else
cout << 10;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change",
"identifier.replace.add",
"literal.replace.remove"
] | 810,419 | 810,420 | u275488634 | cpp |
p02999 | #include <bits/stdc++.h>
using namespace std;
int main() {
int x, z;
cin >> x >> z;
if (x <= z)
cout << "0";
else
cout << "10";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int x, z;
cin >> x >> z;
if (x < z)
cout << "0";
else
cout << "10";
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 810,427 | 810,428 | u728408455 | cpp |
p02999 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, m;
cin >> n >> m;
if (n > m)
cout << "0" << endl;
else
cout << "10" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, m;
cin >> n >> m;
if (n < m)
cout << "0" << endl;
else
cout << "10" << endl;
return 0;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 810,431 | 810,432 | u787972656 | cpp |
p02999 | #include <bits/stdc++.h>
using namespace std;
int main() {
int x, a;
cin >> x >> a;
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;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.branch.else.remove",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 810,445 | 810,446 | u152997492 | cpp |
p02999 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a <= b)
cout << 0;
else
cout << 10;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a < b)
cout << 0;
else
cout << 10;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 810,447 | 810,448 | u923018133 | cpp |
p02999 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a + b < 10)
cout << 0;
else
cout << 10;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a < b)
cout << 0;
else
cout << 10;
return 0;
} | [
"expression.operation.binary.remove",
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 810,449 | 810,448 | u923018133 | cpp |
p02999 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a, b;
if (a < b) {
cout << "0" << endl;
} else {
cout << "10" << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a < b) {
cout << "0" << endl;
} else {
cout << "10" << endl;
}
return 0;
}
| [] | 810,452 | 810,453 | u818818531 | cpp |
p02999 | #include <bits/stdc++.h>
using namespace std;
int main() {
int X, A;
cin >> X >> A;
if (X < A)
cout << '0';
else {
cout << '10';
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int X, A;
cin >> X >> A;
if (X < A)
cout << '0';
else {
cout << "10";
}
} | [
"literal.string.change",
"io.output.change"
] | 810,458 | 810,459 | u341447450 | 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 << 0;
else
cout << 10;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.branch.else.remove",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 810,460 | 810,461 | u398059025 | cpp |
p02999 | #include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#incl... | #include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#incl... | [
"control_flow.branch.if.condition.change"
] | 810,462 | 810,463 | u559149715 | 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;
return 0;
}
| #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;
return 0;
}
| [] | 810,469 | 810,470 | u656527663 | cpp |
p02999 | #include <iostream>
using namespace std;
int main() {
int X, A;
cin >> X >> A;
if (X < A) {
cout << 0 << endl;
} else {
cout << 1 << endl;
}
}
| #include <iostream>
using namespace std;
int main() {
int X, A;
cin >> X >> A;
if (X < A) {
cout << 0 << endl;
} else {
cout << 10 << endl;
}
}
| [
"literal.number.change",
"io.output.change"
] | 810,477 | 810,478 | u788063708 | cpp |
p02999 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int x, a;
cin >> x >> a;
if (x > a) {
cout << 0;
} else {
cout << 10;
}
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int x, a;
cin >> x >> a;
if (x < a) {
cout << 0;
} else {
cout << 10;
}
return 0;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 810,479 | 810,480 | u125051909 | cpp |
p02999 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int X, A;
cin >> X >> A;
if (A < X)
cout << 0 << endl;
else
cout << 10 << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int X, A;
cin >> X >> A;
if (X < A)
cout << 0 << endl;
else
cout << 10 << endl;
return 0;
}
| [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 810,483 | 810,484 | u777853124 | cpp |
p02999 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <string>
typedef long long ll;
using namespace std;
int a, b;
int main() {
scanf("%sd%d", &a, &b);
printf("%d", a < b ? 0 : 10);
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <string>
typedef long long ll;
using namespace std;
int a, b;
int main() {
scanf("%d%d", &a, &b);
printf("%d", a < b ? 0 : 10);
return 0;
} | [
"literal.string.change",
"call.arguments.change"
] | 810,491 | 810,492 | u885501507 | cpp |
p02999 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, n) for (int i = 0; i < n; ++i)
#define FORR(i, a, n) for (int i = a; i < n; ++i)
#define ALL(c) (c).begin(), (c).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define UNIQ(c) (c).erase(unique(ALL((c))), end((c)))
typedef long long ll;
typedef vector<int> ... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, n) for (int i = 0; i < n; ++i)
#define FORR(i, a, n) for (int i = a; i < n; ++i)
#define ALL(c) (c).begin(), (c).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define UNIQ(c) (c).erase(unique(ALL((c))), end((c)))
typedef long long ll;
typedef vector<int> ... | [
"expression.operation.binary.remove"
] | 810,493 | 810,494 | u522598953 | cpp |
p02999 | #include <bits/stdc++.h>
using namespace std;
int main() {
int x, y;
cin >> x >> y;
if (x >= y)
cout << "0";
else
cout << "10";
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int x, y;
cin >> x >> y;
if (x >= y)
cout << "10";
else
cout << "0";
} | [
"control_flow.branch.else.remove",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 810,498 | 810,499 | u786773683 | cpp |
p02999 | #include <bits/stdc++.h>
using namespace std;
int main() {
int x, a;
cin >> x >> a;
if (x < a) {
cout << '0';
} else {
cout << '10';
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int x, a;
cin >> x >> a;
if (x < a) {
cout << "0";
} else {
cout << "10";
}
} | [
"literal.string.change",
"io.output.change"
] | 810,500 | 810,501 | u583560632 | cpp |
p02999 | #include <bits/stdc++.h>
using namespace std;
#define PB push_back
#define ZERO (1e-10)
#define INF int(1e9 + 1)
#define CL(A, I) (memset(A, I, sizeof(A)))
#define DEB printf("DEB!\n");
#define D(X) cout << " " << #X ": " << X << endl;
#define EQ(A, B) (A + ZERO > B && A - ZERO < B)
typedef long long ll;
typedef pair<... | #include <bits/stdc++.h>
using namespace std;
#define PB push_back
#define ZERO (1e-10)
#define INF int(1e9 + 1)
#define CL(A, I) (memset(A, I, sizeof(A)))
#define DEB printf("DEB!\n");
#define D(X) cout << " " << #X ": " << X << endl;
#define EQ(A, B) (A + ZERO > B && A - ZERO < B)
typedef long long ll;
typedef pair<... | [
"identifier.change",
"call.arguments.change"
] | 810,502 | 810,503 | u710480858 | cpp |
p02999 | #include <iostream>
using namespace std;
int main() {
int x, a;
cin >> x >> a;
if (x > a)
cout << 0;
else
cout << 10;
}
| #include <iostream>
using namespace std;
int main() {
int x, a;
cin >> x >> a;
if (x < a)
cout << 0;
else
cout << 10;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 810,504 | 810,505 | u927804708 | cpp |
p02999 | #include <bits/stdc++.h>
using namespace std;
int main() {
int x, a;
cin >> x >> a;
if (x < a)
cout << 1;
else
cout << 10;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int x, a;
cin >> x >> a;
if (x < a)
cout << 0;
else
cout << 10;
} | [
"literal.number.change",
"io.output.change"
] | 810,508 | 810,509 | u506112954 | cpp |
p02999 | #include <bits/stdc++.h>
#define REP(i, n) for (ll i = 0; i < n; i++)
#define ALL(x) (x).begin(), (x).end()
#define MSG(x) cout << x << endl;
#define YN(x) x ? cout << "YES" << endl : cout << "NO" << endl;
#define Yn(x) x ? cout << "Yes" << endl : cout << "No" << endl;
#define yn(x) x ? cout << "yes" << endl : cout <<... | #include <bits/stdc++.h>
#define REP(i, n) for (ll i = 0; i < n; i++)
#define ALL(x) (x).begin(), (x).end()
#define MSG(x) cout << x << endl;
#define YN(x) x ? cout << "YES" << endl : cout << "NO" << endl;
#define Yn(x) x ? cout << "Yes" << endl : cout << "No" << endl;
#define yn(x) x ? cout << "yes" << endl : cout <<... | [] | 810,510 | 810,511 | u720829795 | cpp |
p02999 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a > b)
printf("10");
else
printf("0");
printf("\n");
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a >= b)
printf("10");
else
printf("0");
printf("\n");
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 810,514 | 810,515 | u073500051 | cpp |
p02999 | #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)
#... | [
"control_flow.branch.if.condition.change"
] | 810,518 | 810,519 | u800551451 | cpp |
p02999 | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define int long long int
#define rep(i, n) for (int i = 0; i < n; i++)
#define INF 1001001001
#define LLINF 1001001001001001001
#define mp make_pair
#def... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define int long long int
#define rep(i, n) for (int i = 0; i < n; i++)
#define INF 1001001001
#define LLINF 1001001001001001001
#define mp make_pair
#def... | [
"literal.string.change",
"call.arguments.change"
] | 810,520 | 810,521 | u857644621 | cpp |
p02999 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, x;
cin >> x >> a;
if (a < x)
cout << "0" << endl;
else
cout << "10" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, x;
cin >> x >> a;
if (a > x)
cout << "0" << endl;
else
cout << "10" << endl;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 810,522 | 810,523 | u330689597 | 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;
}
| [] | 810,524 | 810,525 | u983062344 | cpp |
p02999 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a < b) {
cout << 0 << "\n";
} else {
cout << 1 << "\n";
}
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a < b) {
cout << 0 << "\n";
} else {
cout << 10 << "\n";
}
return 0;
}
| [
"literal.number.change",
"io.output.change"
] | 810,533 | 810,534 | u148386511 | cpp |
p02999 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
using std::cerr;
using std::cin;
using std::cout;
using std::endl;
using std::bitset;
us... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
using std::cerr;
using std::cin;
using std::cout;
using std::endl;
using std::bitset;
us... | [
"expression.operator.compare.change",
"io.output.change"
] | 810,535 | 810,536 | u798339690 | cpp |
p02999 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#incl... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#incl... | [
"expression.operator.compare.change",
"io.output.change"
] | 810,542 | 810,543 | u811004127 | cpp |
p02999 | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define f first
#define s se... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define f first
#define s se... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 810,546 | 810,547 | u520002141 | cpp |
p02999 | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define bit(x) (1L << (x))
using ll = long long;
using namespace std;
template <typename T> vector<T> make_v(size_t a, T b) {
return vector<T>(a, b);
}
template <typenam... | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define bit(x) (1L << (x))
using ll = long long;
using namespace std;
template <typename T> vector<T> make_v(size_t a, T b) {
return vector<T>(a, b);
}
template <typenam... | [
"identifier.replace.remove",
"literal.replace.add",
"io.output.change"
] | 810,575 | 810,576 | u772304668 | cpp |
p02999 | #include <algorithm>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (long(i) = 0; (i) < (long)(n); (i)++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define rrep(i, a, b) for (long ... | #include <algorithm>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (long(i) = 0; (i) < (long)(n); (i)++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define rrep(i, a, b) for (long ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 810,577 | 810,578 | u060896757 | cpp |
p02999 | /*
我的心脏怦怦跳，监管者就在附近
*/
#include <bits/stdc++.h>
#include <cmath>
#include <cstring>
#include <iostream>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <unistd.h>
#define random(a, b) (rand() % (b - a + 1) + a)
using namespace std;
int main() {
int n, x;
cin >> n >> x;... | /*
我的心脏怦怦跳，监管者就在附近
*/
#include <bits/stdc++.h>
#include <cmath>
#include <cstring>
#include <iostream>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <unistd.h>
#define random(a, b) (rand() % (b - a + 1) + a)
using namespace std;
int main() {
int n, x;
cin >> n >> x;... | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove",
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 810,581 | 810,582 | u378968614 | cpp |
p02999 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <set>
#include <string>
using namespace std;
typedef long long lint;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rep0(i, n) rep(i, 0, n)
int main(void) {
ios::sync_with_stdio(false);
int a, b;
cin >> a >> b;
if (a <= b) {
cout ... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <set>
#include <string>
using namespace std;
typedef long long lint;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rep0(i, n) rep(i, 0, n)
int main(void) {
ios::sync_with_stdio(false);
int a, b;
cin >> a >> b;
if (a < b) {
cout <... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 810,591 | 810,592 | u809278162 | cpp |
p02999 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, m, n) for (int i = (m); i < (n); i++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(c) (c).begin(), (c).end()
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <clas... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, m, n) for (int i = (m); i < (n); i++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(c) (c).begin(), (c).end()
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <clas... | [] | 810,618 | 810,619 | u540491484 | cpp |
p02999 | #include <bits/stdc++.h>
#define pb(x) push_back(x)
#define mp(x, y) make_pair(x, y)
#define CANCER \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); ... | #include <bits/stdc++.h>
#define pb(x) push_back(x)
#define mp(x, y) make_pair(x, y)
#define CANCER \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); ... | [
"literal.number.change",
"io.output.change"
] | 810,620 | 810,621 | u470437951 | cpp |
p02999 | #include <bits/stdc++.h>
using namespace std;
int main() {
int X, A;
cin >> X, A;
if (X >= A)
cout << "10" << endl;
else
cout << "0" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int X, A;
cin >> X >> A;
if (X >= A)
cout << 10 << endl;
else
cout << 0 << endl;
}
| [] | 810,624 | 810,625 | u236540805 | cpp |
p02999 | #include <bits/stdc++.h>
using namespace std;
int main() {
int x, a;
cin >> x >> a;
int res;
if (x <= a)
res = 0;
else
res = 10;
cout << res << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int x, a;
cin >> x >> a;
int res;
if (x < a)
res = 0;
else
res = 10;
cout << res << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 810,626 | 810,627 | u203527087 | cpp |
p02999 | #include <iostream>
using namespace ::std;
int main() {
int a, b;
cin >> a, b;
cout << (a >= b ? 10 : 0) << '\n';
} | #include <iostream>
using namespace ::std;
int main() {
int a, b;
cin >> a >> b;
cout << (a >= b ? 10 : 0) << '\n';
} | [] | 810,628 | 810,629 | u461597211 | cpp |
p02999 | #include <algorithm>
#include <iostream>
#include <stdio.h>
using namespace std;
int main(void) {
int a, x;
cin >> x >> a;
if (x < a) {
cout << 0;
} else {
cout << 1;
}
return 0;
} | #include <algorithm>
#include <iostream>
#include <stdio.h>
using namespace std;
int main(void) {
int a, x;
cin >> x >> a;
if (x < a) {
cout << 0;
} else {
cout << 10;
}
return 0;
}
| [
"literal.number.change",
"io.output.change"
] | 810,632 | 810,633 | u419633921 | cpp |
p02999 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, n) for (int i = 0; i < n; i++)
#define why(n, x) \
int n; \
while (cin >> n, n != x)
#define iFOR(i, x, n) for (int i = x; i... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, n) for (int i = 0; i < n; i++)
#define why(n, x) \
int n; \
while (cin >> n, n != x)
#define iFOR(i, x, n) for (int i = x; i... | [
"literal.number.change",
"io.output.change"
] | 810,648 | 810,649 | u678146855 | cpp |
p02998 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define fi first
#define se second
#define endl "\n"
template <typename T> inline b... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define fi first
#define se second
#define endl "\n"
template <typename T> inline b... | [
"control_flow.branch.if.condition.change"
] | 810,677 | 810,678 | u340010271 | cpp |
p02998 | #include <bits/stdc++.h>
using namespace std;
#define repr(i, a, b) for (int i = a; i < b; i++)
#define rep(i, n) for (int i = 0; i < n; i++)
#define reprrev(i, a, b) for (int i = b - 1; i >= a; i--) // [a, b)
#define reprev(i, n) reprrev(i, 0, n)
typedef long long ll;
typedef unsigned long long ull;
template <class T>... | #include <bits/stdc++.h>
using namespace std;
#define repr(i, a, b) for (int i = a; i < b; i++)
#define rep(i, n) for (int i = 0; i < n; i++)
#define reprrev(i, a, b) for (int i = b - 1; i >= a; i--) // [a, b)
#define reprev(i, n) reprrev(i, 0, n)
typedef long long ll;
typedef unsigned long long ull;
template <class T>... | [
"expression.operation.binary.add"
] | 810,718 | 810,719 | u052332717 | cpp |
p02998 |
/*vvv>
zzzzzI
.---. zzuzuI .vgggg&,.
+++++= dunkoI .WbbWo JMM9^```?TMB` ..&gNNg,. gggggggJ, qgggggggg]
(&&&&&&&&[ c+OA&J, (&&&&&&+J, .cJeAA&-. (&&&&&&&&x .&AA&=-.
+++++= dunkoI Xpbpbp JM#` (M#^ ?MMp MM| +TMN. JMF '
|yk ` dVY 7Vk, Vy XV cV... |
/*vvv>
zzzzzI
.---. zzuzuI .vgggg&,.
+++++= dunkoI .WbbWo JMM9^```?TMB` ..&gNNg,. gggggggJ, qgggggggg]
(&&&&&&&&[ c+OA&J, (&&&&&&+J, .cJeAA&-. (&&&&&&&&x .&AA&=-.
+++++= dunkoI Xpbpbp JM#` (M#^ ?MMp MM| +TMN. JMF '
|yk ` dVY 7Vk, Vy XV cV... | [
"identifier.change",
"call.arguments.change"
] | 810,731 | 810,732 | u675296835 | cpp |
p02998 | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
class UnionFind {
vector<int> par;
public:
UnionFind(int n) { par.assign(n, -1); }
int root(int x) {
if (par[x] < 0)
return x;
else
return par[x] == root(par[x]);
}
bool same(int x, int y) { re... | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
class UnionFind {
vector<int> par;
public:
UnionFind(int n) { par.assign(n, -1); }
int root(int x) {
if (par[x] < 0)
return x;
else
return par[x] = root(par[x]);
}
bool same(int x, int y) { ret... | [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 810,735 | 810,736 | u468811760 | cpp |
p02998 | /*input
9
1 1
2 1
3 1
4 1
5 1
1 2
1 3
1 4
1 5
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef tree<long long, null_type, less_equal<long long>, rb_tree_tag,
tree_order_statistics_node_update>
... | /*input
3
1 1
5 1
5 5
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef tree<long long, null_type, less_equal<long long>, rb_tree_tag,
tree_order_statistics_node_update>
indexed_set;
#pragma... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 810,742 | 810,743 | u110464018 | cpp |
p02998 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
using namespace std;
const int V = 100005;
vector<int> to[V * 2];
bool visited[V * 2]; //グローバル変数なので０で初期化される
vector<int> cnt;
void dfs(int v) {
if (visited[v])
retu... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
using namespace std;
const int V = 100005;
vector<int> to[V * 2];
bool visited[V * 2]; //グローバル変数なので０で初期化される
vector<int> cnt;
void dfs(int v) {
if (visited[v])
retu... | [
"identifier.change",
"io.output.change"
] | 810,752 | 810,753 | u091665287 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.