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 >> b;
if (a > b)
cout << 1;
cout << 0;
}
| #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a >= b)
cout << 1;
cout << 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 809,255 | 809,256 | u798562499 | cpp |
p02999 | #include <bits/stdc++.h>
using namespace std;
//#define int long long
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define rep11(i, n) for (int i = 1; i < (int)(n); ++i)
#define repo(i, o, n) for (int i = o; i < (int)(n); ++i)
#define repm(i, n) for (int i = (int)(n)-1; i >= 0; --i)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define pb(n) push_back(n)
#define mp make_pair
#define MOD 1002000007
#define INF LONG_LONG_MAX
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;
//#define int long long
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define rep11(i, n) for (int i = 1; i < (int)(n); ++i)
#define repo(i, o, n) for (int i = o; i < (int)(n); ++i)
#define repm(i, n) for (int i = (int)(n)-1; i >= 0; --i)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define pb(n) push_back(n)
#define mp make_pair
#define MOD 1002000007
#define INF LONG_LONG_MAX
int main() {
int x, a;
cin >> x >> a;
if ((x < a) ? cout << 0 << endl : cout << 10 << endl)
;
return 0;
} | [] | 809,259 | 809,260 | u338193317 | cpp |
p02999 | #include <bits/stdc++.h>
using namespace std;
//#define int long long
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define rep11(i, n) for (int i = 1; i < (int)(n); ++i)
#define repo(i, o, n) for (int i = o; i < (int)(n); ++i)
#define repm(i, n) for (int i = (int)(n)-1; i >= 0; --i)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define pb(n) push_back(n)
#define mp make_pair
#define MOD 1002000007
#define INF LONG_LONG_MAX
int main() {
int x, a, t;
cin >> x, a;
if (x < a) {
t = 0;
cout << t << endl;
} else {
t = 10;
cout << t << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
//#define int long long
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define rep11(i, n) for (int i = 1; i < (int)(n); ++i)
#define repo(i, o, n) for (int i = o; i < (int)(n); ++i)
#define repm(i, n) for (int i = (int)(n)-1; i >= 0; --i)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define pb(n) push_back(n)
#define mp make_pair
#define MOD 1002000007
#define INF LONG_LONG_MAX
int main() {
int x, a, t;
cin >> x >> a;
if (x < a) {
t = 0;
cout << t << endl;
} else {
t = 10;
cout << t << endl;
}
} | [] | 809,261 | 809,262 | u338193317 | cpp |
p02999 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, X;
cin >> A >> X;
if (A > X)
cout << 0;
if (A <= X)
cout << 10;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, X;
cin >> X >> A;
if (A > X)
cout << 0;
if (A <= X)
cout << 10;
} | [
"expression.operation.binary.remove"
] | 809,278 | 809,279 | u073895786 | cpp |
p02999 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a > b)
cout << 10;
else
cout << 0;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a >= b)
cout << 10;
else
cout << 0;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 809,284 | 809,285 | u190142290 | cpp |
p02999 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (B < A) {
cout << 0 << endl;
} else {
cout << 10 << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (B > A) {
cout << 0 << endl;
} else {
cout << 10 << endl;
}
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 809,297 | 809,298 | u602711435 | cpp |
p02999 | #include <iostream>
using namespace std;
int main() {
int x, a;
cin >> x >> a;
if (x > a) {
cout << "10" << endl;
} else {
cout << "0" << endl;
}
} | #include <iostream>
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"
] | 809,299 | 809,300 | u361435342 | cpp |
p02999 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int X, A;
cin >> X, A;
int ans = 10;
if (X < A) {
ans = 0;
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int X, A;
cin >> X >> A;
int ans = 10;
if (X < A) {
ans = 0;
}
cout << ans << endl;
return 0;
}
| [] | 809,305 | 809,306 | u282657760 | cpp |
p02999 | #include <iostream>
using namespace std;
int main(void) {
int a, b;
cin >> a >> b;
if (b < a) {
cout << "0" << endl;
} else {
cout << "10" << endl;
}
} | #include <iostream>
using namespace std;
int main(void) {
// Your code here!
int a, b;
cin >> a >> b;
if (a < b) {
cout << "0" << endl;
} else {
cout << "10" << endl;
}
}
| [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 809,307 | 809,308 | u783388585 | cpp |
p02999 | #include <iostream>
using namespace std;
int main(void) {
int a, b;
cin >> a >> b;
if (b < a) {
cout << "0" << endl;
} else {
cout << "10" << endl;
}
} | #include <iostream>
using namespace std;
int main(void) {
int a, b;
cin >> a >> b;
if (b > a) {
cout << "0" << endl;
} else {
cout << "10" << endl;
}
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 809,307 | 809,309 | u783388585 | cpp |
p02999 | #include <iostream>
using namespace std;
int main(void) {
int X, A;
cin >> X >> A;
if (X > A)
cout << 1 << endl;
else
cout << 0 << endl;
}
| #include <iostream>
using namespace std;
int main(void) {
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",
"literal.number.change",
"io.output.change"
] | 809,321 | 809,322 | u083513584 | cpp |
p02999 | #include <iostream>
using namespace std;
int main(void) {
int X, A;
cin >> X >> A;
if (X >= A)
cout << 1 << endl;
else
cout << 0 << endl;
}
| #include <iostream>
using namespace std;
int main(void) {
int X, A;
cin >> X >> A;
if (X >= A)
cout << 10 << endl;
else
cout << 0 << endl;
}
| [
"literal.number.change",
"io.output.change"
] | 809,323 | 809,322 | u083513584 | cpp |
p02999 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (B < A) {
cout << 0 << endl;
} else {
cout << 10 << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (B > A) {
cout << 0 << endl;
} else {
cout << 10 << endl;
}
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 809,326 | 809,327 | u977547071 | cpp |
p02999 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int x, a;
cin >> x >> a;
if (x < a) {
cout << 0;
} else if (a > x or a == x) {
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;
} else if (a < x or a == x) {
cout << 10 << endl;
}
return 0;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 809,328 | 809,329 | u135197691 | cpp |
p02999 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
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;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int x, a;
cin >> x >> a;
if (x < a)
cout << 0 << endl;
else
cout << 10 << endl;
}
| [] | 809,333 | 809,334 | u425086757 | 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;
}
| [] | 809,341 | 809,342 | u449303900 | cpp |
p02999 | #include <bits/stdc++.h>
using namespace std;
int main() {
int x;
cin >> x;
int a;
cin >> a;
if (x > a) {
cout << 10;
} else {
cout << 0;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int x;
cin >> x;
int a;
cin >> a;
if (x >= a) {
cout << 10;
} else {
cout << 0;
}
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 809,345 | 809,346 | u759632062 | cpp |
p02999 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int n, m;
cin >> n, m;
if (n < m)
cout << 0 << endl;
else
cout << 10 << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int n, m;
cin >> n >> m;
if (n < m)
cout << 0 << endl;
else
cout << 10 << endl;
} | [] | 809,349 | 809,350 | u070779615 | cpp |
p02999 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int n, m;
cin >> n, m;
if (n < m)
cout << 0 << endl;
else
cout << 10 << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int n, m;
cin >> n >> m;
if (n < m)
cout << 0 << endl;
else
cout << 10 << endl;
} | [] | 809,351 | 809,350 | u070779615 | cpp |
p02999 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define ll long long
#define vec vector
#define vecll vector<long long>
#define vec2ll vector<vector<long long>>
#define forll(s, a, b) for (long long s = a; s < b; s++)
#define forllde(s, a) for (long long s = a; s > 0; s--)
int main() {
ll a, b;
scanf("%d%d", &a, &b);
if (a < b)
cout << "0" << endl;
else
cout << "10" << endl;
} | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define ll long long
#define vec vector
#define vecll vector<long long>
#define vec2ll vector<vector<long long>>
#define forll(s, a, b) for (long long s = a; s < b; s++)
#define forllde(s, a) for (long long s = a; s > 0; s--)
int main() {
ll a, b;
scanf("%lld %lld", &a, &b);
if (a < b)
cout << "0" << endl;
else
cout << "10" << endl;
} | [
"literal.string.change",
"call.arguments.change"
] | 809,352 | 809,353 | u783408650 | cpp |
p02999 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define ll long long
#define vec vector
#define vecll vector<long long>
#define vec2ll vector<vector<long long>>
#define forll(s, a, b) for (long long s = a; s < b; s++)
#define forllde(s, a) for (long long s = a; s > 0; s--)
int main() {
ll a, b;
scanf("%d%d", &a, &b);
if (a < b)
cout << 0 << endl;
else
cout << 10 << endl;
} | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define ll long long
#define vec vector
#define vecll vector<long long>
#define vec2ll vector<vector<long long>>
#define forll(s, a, b) for (long long s = a; s < b; s++)
#define forllde(s, a) for (long long s = a; s > 0; s--)
int main() {
ll a, b;
scanf("%lld %lld", &a, &b);
if (a < b)
cout << "0" << endl;
else
cout << "10" << endl;
} | [
"literal.string.change",
"call.arguments.change"
] | 809,354 | 809,353 | u783408650 | cpp |
p02999 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define ll long long
#define vec vector
#define vecll vector<long long>
#define vec2ll vector<vector<long long>>
#define forll(s, a, b) for (long long s = a; s < b; s++)
#define forllde(s, a) for (long long s = a; s > 0; s--)
int main() {
ll a, b;
scanf("%d%d", &a, &b);
if (a < b)
cout << "0" << endl;
else
cout << "10" << endl;
} | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define ll long long
#define vec vector
#define vecll vector<long long>
#define vec2ll vector<vector<long long>>
#define forll(s, a, b) for (long long s = a; s < b; s++)
#define forllde(s, a) for (long long s = a; s > 0; s--)
int main() {
ll a, b;
scanf("%lld%lld", &a, &b);
if (a < b)
cout << "0" << endl;
else
cout << "10" << endl;
} | [
"literal.string.change",
"call.arguments.change"
] | 809,352 | 809,355 | u783408650 | cpp |
p02999 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define ll long long
#define vec vector
#define vecll vector<long long>
#define vec2ll vector<vector<long long>>
#define forll(s, a, b) for (long long s = a; s < b; s++)
#define forllde(s, a) for (long long s = a; s > 0; s--)
int main() {
ll a, b;
scanf("%d%d", &a, &b);
if (a < b)
cout << 0 << endl;
else
cout << 10 << endl;
} | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define ll long long
#define vec vector
#define vecll vector<long long>
#define vec2ll vector<vector<long long>>
#define forll(s, a, b) for (long long s = a; s < b; s++)
#define forllde(s, a) for (long long s = a; s > 0; s--)
int main() {
ll a, b;
scanf("%lld%lld", &a, &b);
if (a < b)
cout << "0" << endl;
else
cout << "10" << endl;
} | [
"literal.string.change",
"call.arguments.change"
] | 809,354 | 809,355 | u783408650 | cpp |
p02999 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define ll long long
#define vec vector
#define vecll vector<long long>
#define vec2ll vector<vector<long long>>
#define forll(s, a, b) for (long long s = a; s < b; s++)
#define forllde(s, a) for (long long s = a; s > 0; s--)
int main() {
ll a, b;
scanf("%d%d", &a, &b);
if (a < b)
cout << "0" << endl;
else
cout << "10" << endl;
} | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define ll long long
#define vec vector
#define vecll vector<long long>
#define vec2ll vector<vector<long long>>
#define forll(s, a, b) for (long long s = a; s < b; s++)
#define forllde(s, a) for (long long s = a; s > 0; s--)
int main() {
int a, b;
scanf("%d%d", &a, &b);
if (a < b)
cout << "0" << endl;
else
cout << "10" << endl;
} | [
"variable_declaration.type.change"
] | 809,352 | 809,356 | u783408650 | cpp |
p02999 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define ll long long
#define vec vector
#define vecll vector<long long>
#define vec2ll vector<vector<long long>>
#define forll(s, a, b) for (long long s = a; s < b; s++)
#define forllde(s, a) for (long long s = a; s > 0; s--)
int main() {
ll a, b;
scanf("%d%d", &a, &b);
if (a < b)
cout << 0 << endl;
else
cout << 10 << endl;
} | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define ll long long
#define vec vector
#define vecll vector<long long>
#define vec2ll vector<vector<long long>>
#define forll(s, a, b) for (long long s = a; s < b; s++)
#define forllde(s, a) for (long long s = a; s > 0; s--)
int main() {
int a, b;
scanf("%d%d", &a, &b);
if (a < b)
cout << "0" << endl;
else
cout << "10" << endl;
} | [
"variable_declaration.type.change"
] | 809,354 | 809,356 | u783408650 | 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"
] | 809,357 | 809,358 | u016183710 | 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;
}
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 809,359 | 809,358 | u016183710 | 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;
}
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 809,375 | 809,376 | u573574657 | cpp |
p02999 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define eb emplace_back
#define precision(n) cout << fixed << setprecision(n);
#define fast \
{ \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
}
int main() {
fast;
int x, a;
cin >> x >> a;
if (x > a) {
cout << 10 << endl;
} else
cout << 0 << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define eb emplace_back
#define precision(n) cout << fixed << setprecision(n);
#define fast \
{ \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
}
int main() {
fast;
int x, a;
cin >> x >> a;
if (x >= a) {
cout << 10 << endl;
} else
cout << 0 << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 809,393 | 809,394 | u754189797 | 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"
] | 809,395 | 809,396 | u380345032 | cpp |
p02999 | #include <iostream>
int main() {
int x, a;
std::cin >> x >> a;
if (x < a)
std::cout << 0 << std::endl;
else
std::cout << 1 << 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;
}
| [
"literal.number.change",
"expression.operation.binary.change"
] | 809,412 | 809,413 | u864752370 | cpp |
p02999 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (b >= a) {
cout << 0 << endl;
}
else {
cout << 10 << endl;
}
}
| #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (b > a) {
cout << 0 << endl;
}
else {
cout << 10 << endl;
}
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 809,416 | 809,417 | u840731541 | cpp |
p02999 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const long long INF = 1LL << 60;
typedef pair<ll, ll> pairs;
vector<pairs> p;
bool pairCompare(const pair<double, ll> &firstElof,
const pair<double, ll> &secondElof) {
return firstElof.first < secondElof.first;
}
#define MAX_N 1000100
bool x[MAX_N];
ll num[MAX_N];
ll fibl[MAX_N] = {0};
ll fib(ll a) {
if (fibl[a] != 0)
return fibl[a];
if (a == 0) {
return 0;
} else if (a == 1) {
return 1;
}
return fibl[a] = fib(a - 1) + fib(a - 2);
}
ll eratosthenes(ll n) {
int p = 0;
for (ll i = 0; i <= n; ++i)
x[i] = true;
x[0] = x[1] = false;
for (int i = 2; i <= n; ++i) {
if (x[i]) {
p++;
for (int j = 2 * i; j <= n; j += i)
x[j] = false;
}
num[i] = p;
}
return p;
}
ll gcd(ll a, ll b) {
if (a % b == 0)
return (b);
else
return (gcd(b, a % b));
}
ll keta(ll N) {
int tmp{};
while (N > 0) {
tmp += (N % 10);
N /= 10;
}
N = tmp;
return N;
}
int main() {
ll x, a;
cin >> x >> a;
if (x > a)
cout << 10 << endl;
else if (a > x)
cout << 0 << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const long long INF = 1LL << 60;
typedef pair<ll, ll> pairs;
vector<pairs> p;
bool pairCompare(const pair<double, ll> &firstElof,
const pair<double, ll> &secondElof) {
return firstElof.first < secondElof.first;
}
#define MAX_N 1000100
bool x[MAX_N];
ll num[MAX_N];
ll fibl[MAX_N] = {0};
ll fib(ll a) {
if (fibl[a] != 0)
return fibl[a];
if (a == 0) {
return 0;
} else if (a == 1) {
return 1;
}
return fibl[a] = fib(a - 1) + fib(a - 2);
}
ll eratosthenes(ll n) {
int p = 0;
for (ll i = 0; i <= n; ++i)
x[i] = true;
x[0] = x[1] = false;
for (int i = 2; i <= n; ++i) {
if (x[i]) {
p++;
for (int j = 2 * i; j <= n; j += i)
x[j] = false;
}
num[i] = p;
}
return p;
}
ll gcd(ll a, ll b) {
if (a % b == 0)
return (b);
else
return (gcd(b, a % b));
}
ll keta(ll N) {
int tmp{};
while (N > 0) {
tmp += (N % 10);
N /= 10;
}
N = tmp;
return N;
}
int main() {
ll x, a;
cin >> x >> a;
if (x >= a)
cout << 10 << endl;
else if (a > x)
cout << 0 << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 809,430 | 809,431 | u474551232 | cpp |
p02999 | #include <iostream>
using namespace std;
int main() {
int x, a;
cin >> x >> a;
cout << (x < a ? x : 10) << "\n";
} | #include <iostream>
using namespace std;
int main() {
int x, a;
cin >> x >> a;
cout << (x < a ? 0 : 10) << "\n";
} | [
"identifier.replace.remove",
"literal.replace.add",
"io.output.change"
] | 809,442 | 809,443 | u703912513 | 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 (A >= X) {
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 if (A <= X) {
cout << 10 << endl;
}
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 809,448 | 809,449 | u073514287 | cpp |
p02999 | #include <iostream>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <vector>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
const long long INF = 1LL << 60;
#define max(a, b) a > b ? a : b
#define min(a, b) a < b ? a : b
void strInit(char str[]); // str[]を0で初期化
void extIntStr(char str[],
int data[]); // str[]から数値(int)を抽出しdata[]に順次格納
void incsort(int data[], int len); // data[]を昇順ソート
void decsort(int data[], int len); // data[]を降順ソート
void printIntArray(int data[], int len); // data[]をprint
int *inputArray(
int n); //文字列を受け取り数値を抽出、n個の数値(int)を格納した配列のポインタをreturn
int *cpyArray(int data[], int len); //配列(int)を複製した配列のポインタをreturn
int judgePrime(int x); //素数かどうか判断するよ
int printPrime(int n); //ｎ番目の素数を出すよ
void soinsubunkai(int a, int *indexes, int **prim, int **e); //素因数を出すよ
// don't forget free(data);
int main() {
int X, A;
cin >> X >> A;
if (X > A)
cout << 10;
else
cout << 0;
}
// temp##############################################
int judgePrime(int x) {
for (int i = 2; i < x - 1; i++) {
if (x % i == 0)
return 0;
}
return 1;
}
int printPrime(int n) {
int i = 1;
for (int j = 0; j < n + 1; j++) {
while (1) {
if (judgePrime(++i))
break;
}
}
return i;
}
void soinsubunkai(int a, int *indexes, int **prim, int **e) {
if (a == 1) {
int *t = (int *)malloc(sizeof(int));
int *b = (int *)malloc(sizeof(int));
*t = 1;
*b = 1;
*indexes = 1;
*prim = t;
*e = b;
return;
}
int n = a;
std::vector<int> pr, er;
int index, prm, j, rec;
index = rec = 0;
for (int i = 0; n != 1; i++) {
prm = printPrime(i);
if (n % prm == 0) {
pr.push_back(prm);
er.push_back(0);
while ((n % prm) == 0) {
n /= prm;
er[index]++;
j++;
}
index++;
}
}
int len = pr.size();
int *ret = (int *)malloc(sizeof(int) * len);
int *re = (int *)malloc(sizeof(int) * len);
for (int i = 0; i < len; i++) {
ret[i] = pr[i];
re[i] = er[i];
}
*indexes = len;
*prim = ret;
*e = re;
return;
}
void strInit(char str[]) {
int len = strlen(str);
for (int i = 0; i < len; i++) {
str[i] = 0;
}
}
void extIntStr(char str[], int data[]) {
int length = strlen(str);
str[length - 1] = ' ';
char buff[12];
int j, index;
index = j = 0;
for (int i = 0; i < length; i++) {
if (str[i] != ' ') {
buff[j++] = str[i];
} else {
data[index++] = atoi(buff);
strInit(buff);
j = 0;
}
}
}
void incsort(int data[], int len) {
for (int i = 0; i < len - 1; i++) {
for (int j = i + 1; j < len; j++) {
if (data[i] > data[j]) {
int tmp = data[i];
data[i] = data[j];
data[j] = tmp;
}
}
}
}
void decsort(int data[], int len) {
for (int i = 0; i < len - 1; i++) {
for (int j = i + 1; j < len; j++) {
if (data[i] < data[j]) {
int tmp = data[i];
data[i] = data[j];
data[j] = tmp;
}
}
}
}
void printIntArray(int data[], int len) {
for (int i = 0; i < len; i++) {
printf("%d\n", data[i]);
}
}
int *inputArray(int n) {
int *data;
data = (int *)malloc(sizeof(int) * n);
char *get;
get = (char *)malloc(sizeof(char) * 11 * n + 1);
fgets(get, 11 * n + 1, stdin);
extIntStr(get, data);
free(get);
return data;
}
int *cpyArray(int data[], int len) {
int *cp;
cp = (int *)malloc(sizeof(int) * len);
for (int i = 0; i < len; i++) {
cp[i] = data[i];
}
return cp;
}
// temp##############################################
| #include <iostream>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <vector>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
const long long INF = 1LL << 60;
#define max(a, b) a > b ? a : b
#define min(a, b) a < b ? a : b
void strInit(char str[]); // str[]を0で初期化
void extIntStr(char str[],
int data[]); // str[]から数値(int)を抽出しdata[]に順次格納
void incsort(int data[], int len); // data[]を昇順ソート
void decsort(int data[], int len); // data[]を降順ソート
void printIntArray(int data[], int len); // data[]をprint
int *inputArray(
int n); //文字列を受け取り数値を抽出、n個の数値(int)を格納した配列のポインタをreturn
int *cpyArray(int data[], int len); //配列(int)を複製した配列のポインタをreturn
int judgePrime(int x); //素数かどうか判断するよ
int printPrime(int n); //ｎ番目の素数を出すよ
void soinsubunkai(int a, int *indexes, int **prim, int **e); //素因数を出すよ
// don't forget free(data);
int main() {
int X, A;
cin >> X >> A;
if (X >= A)
cout << 10;
else
cout << 0;
}
// temp##############################################
int judgePrime(int x) {
for (int i = 2; i < x - 1; i++) {
if (x % i == 0)
return 0;
}
return 1;
}
int printPrime(int n) {
int i = 1;
for (int j = 0; j < n + 1; j++) {
while (1) {
if (judgePrime(++i))
break;
}
}
return i;
}
void soinsubunkai(int a, int *indexes, int **prim, int **e) {
if (a == 1) {
int *t = (int *)malloc(sizeof(int));
int *b = (int *)malloc(sizeof(int));
*t = 1;
*b = 1;
*indexes = 1;
*prim = t;
*e = b;
return;
}
int n = a;
std::vector<int> pr, er;
int index, prm, j, rec;
index = rec = 0;
for (int i = 0; n != 1; i++) {
prm = printPrime(i);
if (n % prm == 0) {
pr.push_back(prm);
er.push_back(0);
while ((n % prm) == 0) {
n /= prm;
er[index]++;
j++;
}
index++;
}
}
int len = pr.size();
int *ret = (int *)malloc(sizeof(int) * len);
int *re = (int *)malloc(sizeof(int) * len);
for (int i = 0; i < len; i++) {
ret[i] = pr[i];
re[i] = er[i];
}
*indexes = len;
*prim = ret;
*e = re;
return;
}
void strInit(char str[]) {
int len = strlen(str);
for (int i = 0; i < len; i++) {
str[i] = 0;
}
}
void extIntStr(char str[], int data[]) {
int length = strlen(str);
str[length - 1] = ' ';
char buff[12];
int j, index;
index = j = 0;
for (int i = 0; i < length; i++) {
if (str[i] != ' ') {
buff[j++] = str[i];
} else {
data[index++] = atoi(buff);
strInit(buff);
j = 0;
}
}
}
void incsort(int data[], int len) {
for (int i = 0; i < len - 1; i++) {
for (int j = i + 1; j < len; j++) {
if (data[i] > data[j]) {
int tmp = data[i];
data[i] = data[j];
data[j] = tmp;
}
}
}
}
void decsort(int data[], int len) {
for (int i = 0; i < len - 1; i++) {
for (int j = i + 1; j < len; j++) {
if (data[i] < data[j]) {
int tmp = data[i];
data[i] = data[j];
data[j] = tmp;
}
}
}
}
void printIntArray(int data[], int len) {
for (int i = 0; i < len; i++) {
printf("%d\n", data[i]);
}
}
int *inputArray(int n) {
int *data;
data = (int *)malloc(sizeof(int) * n);
char *get;
get = (char *)malloc(sizeof(char) * 11 * n + 1);
fgets(get, 11 * n + 1, stdin);
extIntStr(get, data);
free(get);
return data;
}
int *cpyArray(int data[], int len) {
int *cp;
cp = (int *)malloc(sizeof(int) * len);
for (int i = 0; i < len; i++) {
cp[i] = data[i];
}
return cp;
}
// temp##############################################
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 809,451 | 809,452 | u493708099 | cpp |
p02999 | #include <stdio.h>
int main() {
int x, a;
scanf("%d %d", &x, &a);
if (x <= a) {
printf("0\n");
} else {
printf("10\n");
}
return 0;
}
| #include <stdio.h>
int main() {
int x, a;
scanf("%d %d", &x, &a);
if (x >= a) {
printf("10\n");
} else {
printf("0\n");
}
return 0;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 809,459 | 809,460 | u621146716 | cpp |
p02999 | #include <bits/stdc++.h>
using namespace std;
int main() {
int x, a;
cin >> x >> a;
(x > a) ? cout << 0 : cout << 10;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int x, a;
cin >> x >> a;
(x < a) ? cout << 0 : cout << 10;
return 0;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 809,472 | 809,473 | u980485808 | cpp |
p02999 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int X, A;
cin >> X >> A;
if (X < A) {
cout << 0 << endl;
} else {
cout << 1 << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
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,477 | 809,478 | u610579155 | cpp |
p02999 | #include <iostream>
using namespace std;
int main() {
int x, a;
cin >> x >> a;
if (x < a)
cout << 0 << endl;
if (x > a)
cout << 10 << endl;
} | #include <iostream>
using namespace std;
int main() {
int x, a;
cin >> x >> a;
if (x < a)
cout << 0 << endl;
if (x >= a)
cout << 10 << endl;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 809,482 | 809,483 | u548587261 | cpp |
p02999 | #include <stdio.h>
int main(void) {
int x, a, result;
scanf("%d %d", x, a);
if (x < a)
result = 0;
else
result = 10;
printf("%d", result);
return 0;
}
| #include <stdio.h>
int main(void) {
int x, a, result;
scanf("%d %d", &x, &a);
if (x < a)
result = 0;
else
result = 10;
printf("%d", result);
return 0;
}
| [
"expression.operation.unary.reference.add"
] | 809,489 | 809,490 | u032170290 | cpp |
p02999 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a >= b) {
cout << 10;
} else if (b < a) {
cout << 0;
}
} | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a >= b) {
cout << 10;
} else if (b > a) {
cout << 0;
}
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 809,494 | 809,495 | u515468466 | cpp |
p02999 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, X;
cin >> A >> X;
if (A < X) {
cout << "0" << endl;
} else {
cout << "1000" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int A, X;
cin >> A >> X;
if (A < X) {
cout << "0" << endl;
} else {
cout << "10" << endl;
}
}
| [
"literal.string.change",
"io.output.change"
] | 809,499 | 809,500 | u795273869 | cpp |
p02999 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll x, a;
cin >> x >> a;
x < a ? cout << 1 : cout << 10;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll x, a;
cin >> x >> a;
x < a ? cout << 0 : cout << 10;
return 0;
} | [
"literal.number.change",
"expression.operation.binary.change"
] | 809,512 | 809,513 | u708590262 | cpp |
p02999 |
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int a = 0, x = 0;
cin >> a >> x;
if (x < a) {
cout << "0" << endl;
} else {
cout << "10" << endl;
}
} |
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int a = 0, x = 0;
cin >> x >> a;
if (x < a) {
cout << "0" << endl;
} else {
cout << "10" << endl;
}
} | [
"expression.operation.binary.remove"
] | 809,519 | 809,520 | u564004296 | cpp |
p02999 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a, b;
if (a >= b) {
cout << 10 << endl;
} else {
cout << 0 << endl;
}
}
| #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a >= b) {
cout << 10 << endl;
} else {
cout << 0 << endl;
}
}
| [] | 809,529 | 809,530 | u353748264 | cpp |
p02999 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a, b;
if (a > b) {
cout << 10 << endl;
} else {
cout << 0 << endl;
}
}
| #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a >= b) {
cout << 10 << endl;
} else {
cout << 0 << endl;
}
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 809,531 | 809,530 | u353748264 | cpp |
p02999 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a, 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 << 10 << endl;
} else {
cout << 0 << endl;
}
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.number.change",
"io.output.change"
] | 809,532 | 809,530 | u353748264 | cpp |
p02999 | #include <iostream>
#include <string>
using namespace std;
int main() {
int x, a;
cin >> x, a;
if (x < a)
cout << 0;
else
cout << 10;
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
int x, a;
cin >> x >> a;
if (x < a)
cout << 0;
else
cout << 10;
return 0;
} | [] | 809,533 | 809,534 | u448922807 | cpp |
p02999 | #include <iostream>
using namespace std;
int main(void) {
// Your code here!
int X, A;
cin >> X >> A;
if (X < A) {
cout << '0' << endl;
} else if (X >= A) {
cout << '10' << endl;
}
}
| #include <iostream>
using namespace std;
int main(void) {
// Your code here!
int X, A;
cin >> X >> A;
if (X < A) {
cout << '0' << endl;
} else if (X >= A) {
cout << 10 << endl;
}
}
| [] | 809,543 | 809,544 | u020193852 | cpp |
p02999 | #include <stdio.h>
int main(void) {
int a, x;
scanf("%d %d", &a, &x);
if (x < a) {
printf("0");
} else {
printf("10");
}
return 0;
} | #include <stdio.h>
int main(void) {
int a, x;
scanf("%d %d", &a, &x);
if (x > a) {
printf("0");
} else {
printf("10");
}
return 0;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 809,545 | 809,546 | u244416763 | cpp |
p02999 | #include <stdio.h>
int main(void) {
int a, x;
scanf("%d %d", a, x);
if (x < a) {
printf("0");
} else {
printf("10");
}
return 0;
} | #include <stdio.h>
int main(void) {
int a, x;
scanf("%d %d", &a, &x);
if (x > a) {
printf("0");
} else {
printf("10");
}
return 0;
} | [
"expression.operation.unary.reference.add",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 809,547 | 809,546 | u244416763 | cpp |
p02999 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1000000007;
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;
typedef long long ll;
const ll MOD = 1000000007;
int main() {
int A, B;
cin >> A >> B;
if (A < B) {
cout << 0 << endl;
} else {
cout << 10 << endl;
}
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 809,550 | 809,551 | u833295869 | cpp |
p02999 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1000000007;
int main() {
int A, B;
cin >> A >> B;
if (A <= B) {
cout << 10 << endl;
} else {
cout << 0 << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1000000007;
int main() {
int A, B;
cin >> A >> B;
if (A < B) {
cout << 0 << endl;
} else {
cout << 10 << endl;
}
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.number.change",
"io.output.change"
] | 809,552 | 809,551 | u833295869 | 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 > a)
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;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 809,562 | 809,563 | u166550014 | cpp |
p02999 | #include <iostream>
using namespace std;
int main(void) {
int x, a;
cin >> x >> a;
if (x > a)
cout << 10;
else
cout << 0 << endl;
return (0);
} | #include <iostream>
using namespace std;
int main(void) {
int x, a;
cin >> x >> a;
if (x >= a)
cout << 1;
cout << 0 << endl;
return (0);
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.number.change",
"io.output.change",
"control_flow.branch.else.remove"
] | 809,564 | 809,565 | u278788045 | cpp |
p02999 | #include <algorithm>
#include <iostream>
using namespace std;
int main(void) {
int x, a;
cin >> x >> a;
if (x > a)
cout << 1;
cout << 0 << endl;
return (0);
} | #include <iostream>
using namespace std;
int main(void) {
int x, a;
cin >> x >> a;
if (x >= a)
cout << 1;
cout << 0 << endl;
return (0);
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 809,566 | 809,565 | u278788045 | cpp |
p02999 | #include <iostream>
using namespace std;
int main(void) {
int x, a;
cin >> x >> a;
if (x > a)
cout << 10 << endl;
else
cout << 0 << endl;
return (0);
} | #include <iostream>
using namespace std;
int main(void) {
int x, a;
cin >> x >> a;
if (x >= a)
cout << 10 << endl;
else
cout << 0 << endl;
return (0);
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 809,567 | 809,568 | u278788045 | cpp |
p02999 | #include <iostream>
using namespace std;
int main(void) {
int x, a;
cin >> x >> a;
if (x > a)
cout << 10;
else
cout << 0 << endl;
return (0);
} | #include <iostream>
using namespace std;
int main(void) {
int x, a;
cin >> x >> a;
if (x >= a)
cout << 10 << endl;
else
cout << 0 << endl;
return (0);
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"io.output.newline.add"
] | 809,564 | 809,568 | u278788045 | cpp |
p02999 | #include <bits/stdc++.h>
using namespace std;
int main() {
int X, A;
cin >> X >> A;
bool _res = X <= A;
int res = _res ? 0 : 10;
cout << res << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int X, A;
cin >> X >> A;
bool _res = X < A;
int res = _res ? 0 : 10;
cout << res << endl;
}
| [
"expression.operator.compare.change",
"expression.operation.binary.change"
] | 809,569 | 809,570 | u211286909 | cpp |
p02999 | #include <bits/stdc++.h>
using namespace std;
int main() {
int x, a;
cin >> x, a;
cout << (x < a ? 0 : 10);
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int x, a;
cin >> x >> a;
cout << (x < a ? 0 : 10) << endl;
}
| [
"io.output.newline.add"
] | 809,573 | 809,574 | u154898295 | 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 << 1 << 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;
} | [
"literal.number.change",
"io.output.change"
] | 809,575 | 809,576 | u787120084 | cpp |
p02999 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, x) for (int i = 0; i < (int)(x); i++)
#define REPS(i, x) for (int i = 1; i <= (int)(x); i++)
#define RREP(i, x) for (int i = ((int)(x)-1); i >= 0; i--)
#define RREPS(i, x) for (int i = ((int)(x)); i > 0; i--)
#define all(x) (x).begin(), (x).end()
#define in(type, a) \
type a; \
cin >> a
using ll = long long;
int main() {
in(int, a);
in(int, x);
if (x < a) {
cout << 0 << endl;
} else {
cout << 10 << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define REP(i, x) for (int i = 0; i < (int)(x); i++)
#define REPS(i, x) for (int i = 1; i <= (int)(x); i++)
#define RREP(i, x) for (int i = ((int)(x)-1); i >= 0; i--)
#define RREPS(i, x) for (int i = ((int)(x)); i > 0; i--)
#define all(x) (x).begin(), (x).end()
#define in(type, a) \
type a; \
cin >> a
using ll = long long;
int main() {
in(int, x);
in(int, a);
if (x < a) {
cout << 0 << endl;
} else {
cout << 10 << endl;
}
return 0;
}
| [] | 809,577 | 809,578 | u892922562 | cpp |
p02999 | #include <iostream>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
if (n > x)
cout << "10";
else
cout << "0";
} | #include <iostream>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
if (n >= x)
cout << "10";
else
cout << "0";
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 809,585 | 809,586 | u933936078 | cpp |
p02999 | #include <bits/stdc++.h>
using namespace std;
string s;
int p1, p2, p3, p4;
int main() {
int x, a;
cin >> x >> a;
if (x < a)
cout << 0;
else
cout << 1;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
string s;
int p1, p2, p3, p4;
int main() {
int x, a;
cin >> x >> a;
if (x < a)
cout << 0;
else
cout << 10;
return 0;
}
| [
"literal.number.change",
"io.output.change"
] | 809,589 | 809,590 | u250046233 | cpp |
p02999 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int x, a;
cin >> x >> a;
if (x < 0)
cout << 0 << endl;
else
cout << 10 << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
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.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 809,591 | 809,592 | u697968316 | 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,595 | 809,596 | u578871832 | cpp |
p02999 | #include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#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;
} | #include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#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;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 809,597 | 809,598 | u323542775 | 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 << 1 << 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,605 | 809,606 | u630211216 | cpp |
p02999 | #include <iostream>
using namespace std;
int main(void) {
int x, a;
cin >> x >> a;
if (x < a) {
cout << 0 << endl;
} else {
cout << 0 << endl;
}
} | #include <iostream>
using namespace std;
int main(void) {
int x, a;
cin >> x >> a;
if (x < a) {
cout << 0 << endl;
} else {
cout << 10 << endl;
}
}
| [
"literal.number.change",
"io.output.change"
] | 809,611 | 809,612 | u693378622 | cpp |
p02999 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int x, a;
cin >> x >> a;
cout << 10 * (x < a) << endl;
}
| #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int x, a;
cin >> x >> a;
cout << 10 * (x >= a) << endl;
}
| [
"expression.operator.compare.change",
"io.output.change"
] | 809,613 | 809,614 | u293523151 | cpp |
p02999 | #include <algorithm>
#include <cmath> //abs()かfabs()で少数絶対値
#include <cstdlib> //abs()で整数絶対値
#include <iomanip> //stw(数字)で空白による桁揃え
#include <iostream>
#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;
} | #include <algorithm>
#include <cmath> //abs()かfabs()で少数絶対値
#include <cstdlib> //abs()で整数絶対値
#include <iomanip> //stw(数字)で空白による桁揃え
#include <iostream>
#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;
} | [] | 809,619 | 809,620 | u022890424 | cpp |
p02999 | #include <iostream>
#include <iterator>
#include <map>
using namespace std;
int main() {
int x, a;
cin >> x >> a;
if (x > a) {
cout << "10";
} else {
cout << "0";
}
} | #include <iostream>
#include <iterator>
#include <map>
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",
"literal.string.change",
"io.output.change"
] | 809,621 | 809,622 | u554529201 | cpp |
p02999 | #include <iostream>
int main() {
int x, a;
std::cin >> x, a;
if (x < a)
std::cout << 0;
else
std::cout << 10;
} | #include <iostream>
int main() {
int x, a;
std ::cin >> x >> a;
if (x < a)
std ::cout << 0;
else
std ::cout << 10;
}
| [] | 809,630 | 809,629 | u533749093 | cpp |
p02999 | #include <iostream>
#include <string>
using namespace std;
int main() {
int x, a;
cin >> x >> a;
if (a < x) {
cout << 10 << endl;
} else {
cout << 0 << endl;
}
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
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",
"literal.number.change",
"io.output.change"
] | 809,646 | 809,647 | u384161668 | cpp |
p02999 | // Author: Mohammad Faisal
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
(n < x) ? cout << "1" : cout << "10" << endl;
return 0;
}
| // Author: Mohammad Faisal
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
(n < x) ? cout << "0" : cout << "10";
return 0;
}
| [
"literal.string.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 809,664 | 809,665 | u993949676 | cpp |
p02999 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using P = pair<int, int>;
using PL = pair<ll, ll>;
using vp = vector<P>;
using vpl = vector<PL>;
constexpr const int INF = 1 << 30, MOD = 1000000007;
constexpr const ll LINF = 1ll << 60;
#define _ol3(_1, _2, _3, name, ...) name
#define _rep(i, n) _repi(i, 0, n)
#define _repi(i, a, b) for (int i = a, i##_l = (b); i < i##_l; ++i)
#define REP(...) _ol3(__VA_ARGS__, _repi, _rep, )(__VA_ARGS__)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define REPA(i, v) REP(i, v.size())
#define all(v) (v).begin(), (v).end()
#define bit(n) (1ll << (n))
#define uniq(v) \
sort(all(v)); \
v.erase(unique(all(v)), v.end())
#define F first
#define S second
#define endl '\n'
#define cho(n, a, b) cout << ((n) ? a : b) << endl
void YES(int n) { cho(n, "YES", "NO"); }
void Yes(int n) { cho(n, "Yes", "No"); }
void Poss(int n) { cho(n, "Possible", "Impossible"); }
#ifndef LOCAL
struct osd {
template <class T> osd &operator<(const T &t) { return *this; }
template <class T> osd &operator<<(const T &t) { return *this; }
};
osd cer_;
template <class... T> void _print(osd &a, T &&...t) {}
#define cerr cer_
#endif
template <class T> ostream &operator<(ostream &o, const T &t) { return o << t; }
template <class T> istream &operator>(istream &i, T &t) { return i >> t; }
void _print(ostream &s) {}
template <class T, class... U> void _print(ostream &s, T &&t, U &&...u) {
s < t < (sizeof...(u) ? ' ' : '\n');
_print(s, u...);
}
template <class... T> void print(T &&...t) { _print(cout, t...); }
template <class... T> void dprint(T &&...t) { _print(cerr, t...); }
template <class T> void chmax(T &a, const T &b) {
if (a < b)
a = b;
}
template <class T> void chmin(T &a, const T &b) {
if (a > b)
a = b;
}
template <class T> ostream &operator<<(ostream &o, const vector<T> &v) {
for (auto &&i : v)
o < i < ' ';
return o;
}
template <class T> istream &operator>>(istream &i, vector<T> &v) {
for (T &j : v)
i > j;
return i;
}
template <class T, class U>
ostream &operator<<(ostream &o, const pair<T, U> &p) {
return o < p.F < ' ' < p.S;
}
template <class T, class U> istream &operator>>(istream &i, pair<T, U> &p) {
return i > p.F > p.S;
}
template <class T> ostream &operator<<(ostream &o, const set<T> &v) {
for (auto &&i : v)
o < i < ' ';
return o;
}
template <class T> vector<T> &operator<<(vector<T> &v, const T &t) {
v.push_back(t);
return v;
}
template <class T> queue<T> &operator<<(queue<T> &q, const T &t) {
q.push(t);
return q;
}
template <class T> queue<T> &operator<<(T &t, queue<T> &q) {
t = q.front();
q.pop();
return q;
}
template <class T> deque<T> &operator>>(const T &t, deque<T> &q) {
q.push_front(t);
return q;
}
template <class T> deque<T> &operator<<(T &t, deque<T> &q) {
t = q.front();
q.pop_front();
return q;
}
template <class T> deque<T> &operator<<(deque<T> &q, const T &t) {
q.push_back(t);
return q;
}
template <class T> deque<T> &operator>>(deque<T> &q, T &t) {
t = q.back(t);
q.pop_back();
return q;
}
template <class T> stack<T> &operator<<(stack<T> &s, const T &t) {
s.push(t);
return s;
}
template <class T> stack<T> &operator>>(stack<T> &s, T &t) {
t = s.top();
s.pop();
return s;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(0);
int x, a;
cin > x > a;
cout < (x / a) * 10 < endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using P = pair<int, int>;
using PL = pair<ll, ll>;
using vp = vector<P>;
using vpl = vector<PL>;
constexpr const int INF = 1 << 30, MOD = 1000000007;
constexpr const ll LINF = 1ll << 60;
#define _ol3(_1, _2, _3, name, ...) name
#define _rep(i, n) _repi(i, 0, n)
#define _repi(i, a, b) for (int i = a, i##_l = (b); i < i##_l; ++i)
#define REP(...) _ol3(__VA_ARGS__, _repi, _rep, )(__VA_ARGS__)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define REPA(i, v) REP(i, v.size())
#define all(v) (v).begin(), (v).end()
#define bit(n) (1ll << (n))
#define uniq(v) \
sort(all(v)); \
v.erase(unique(all(v)), v.end())
#define F first
#define S second
#define endl '\n'
#define cho(n, a, b) cout << ((n) ? a : b) << endl
void YES(int n) { cho(n, "YES", "NO"); }
void Yes(int n) { cho(n, "Yes", "No"); }
void Poss(int n) { cho(n, "Possible", "Impossible"); }
#ifndef LOCAL
struct osd {
template <class T> osd &operator<(const T &t) { return *this; }
template <class T> osd &operator<<(const T &t) { return *this; }
};
osd cer_;
template <class... T> void _print(osd &a, T &&...t) {}
#define cerr cer_
#endif
template <class T> ostream &operator<(ostream &o, const T &t) { return o << t; }
template <class T> istream &operator>(istream &i, T &t) { return i >> t; }
void _print(ostream &s) {}
template <class T, class... U> void _print(ostream &s, T &&t, U &&...u) {
s < t < (sizeof...(u) ? ' ' : '\n');
_print(s, u...);
}
template <class... T> void print(T &&...t) { _print(cout, t...); }
template <class... T> void dprint(T &&...t) { _print(cerr, t...); }
template <class T> void chmax(T &a, const T &b) {
if (a < b)
a = b;
}
template <class T> void chmin(T &a, const T &b) {
if (a > b)
a = b;
}
template <class T> ostream &operator<<(ostream &o, const vector<T> &v) {
for (auto &&i : v)
o < i < ' ';
return o;
}
template <class T> istream &operator>>(istream &i, vector<T> &v) {
for (T &j : v)
i > j;
return i;
}
template <class T, class U>
ostream &operator<<(ostream &o, const pair<T, U> &p) {
return o < p.F < ' ' < p.S;
}
template <class T, class U> istream &operator>>(istream &i, pair<T, U> &p) {
return i > p.F > p.S;
}
template <class T> ostream &operator<<(ostream &o, const set<T> &v) {
for (auto &&i : v)
o < i < ' ';
return o;
}
template <class T> vector<T> &operator<<(vector<T> &v, const T &t) {
v.push_back(t);
return v;
}
template <class T> queue<T> &operator<<(queue<T> &q, const T &t) {
q.push(t);
return q;
}
template <class T> queue<T> &operator<<(T &t, queue<T> &q) {
t = q.front();
q.pop();
return q;
}
template <class T> deque<T> &operator>>(const T &t, deque<T> &q) {
q.push_front(t);
return q;
}
template <class T> deque<T> &operator<<(T &t, deque<T> &q) {
t = q.front();
q.pop_front();
return q;
}
template <class T> deque<T> &operator<<(deque<T> &q, const T &t) {
q.push_back(t);
return q;
}
template <class T> deque<T> &operator>>(deque<T> &q, T &t) {
t = q.back(t);
q.pop_back();
return q;
}
template <class T> stack<T> &operator<<(stack<T> &s, const T &t) {
s.push(t);
return s;
}
template <class T> stack<T> &operator>>(stack<T> &s, T &t) {
t = s.top();
s.pop();
return s;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(0);
int x, a;
cin > x > a;
cout < ((x < a) ? 0 : 10) < endl;
return 0;
}
| [
"io.output.change"
] | 809,666 | 809,667 | u502709453 | cpp |
p02999 | #include <stdio.h>
int main(void) {
int a, x, c;
scanf("%d", &a);
scanf("%d", &x);
if (x < a) {
c = 10;
}
if (x >= a) {
c = 0;
}
printf("%d\n", c);
return 0;
} | #include <stdio.h>
int main(void) {
int a, x, c;
scanf("%d", &a);
scanf("%d", &x);
if (x <= a) {
c = 10;
}
if (x > a) {
c = 0;
}
printf("%d\n", c);
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 809,668 | 809,669 | u644911355 | 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 << "0" << endl;
else
cout << "10" << endl;
} | [
"control_flow.branch.else.remove",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 809,672 | 809,673 | u501243139 | 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 && X != A)
cout << "0" << endl;
else
cout << "10" << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 809,681 | 809,682 | u625176086 | 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 && X != A)
cout << "0" << endl;
else
cout << "10" << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 809,683 | 809,682 | u625176086 | cpp |
p02999 | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <list>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define ld long double
#define ll long long int
#define ull unsigned long long int
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const long long INF = 1LL << 60;
// set<int>::iterator it;
int main(void) {
int x, a;
cin >> x >> a;
if (x < a)
cout << 0 << endl;
cout << 10 << endl;
return 0;
}
// a>b>c = c>b>a b>a>c = c>a>b b>c>a = a>c>b | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <list>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define ld long double
#define ll long long int
#define ull unsigned long long int
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const long long INF = 1LL << 60;
// set<int>::iterator it;
int main(void) {
int x, a;
cin >> x >> a;
if (x < a)
cout << 0 << endl;
else
cout << 10 << endl;
return 0;
}
// a>b>c = c>b>a b>a>c = c>a>b b>c>a = a>c>b | [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 809,689 | 809,690 | u018361568 | cpp |
p02999 | #include <cstdlib>
#include <iostream>
#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;
} | #include <cstdlib>
#include <iostream>
#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;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 809,691 | 809,692 | u870074807 | cpp |
p02999 | #include <stdio.h>
int main(void) {
int A, X;
scanf("%d %d", &A, &X);
if (X < A) {
printf("%d", 0);
} else if (X >= A) {
printf("%d", 10);
}
}
| #include <stdio.h>
int main(void) {
int A, X;
scanf("%d %d", &X, &A);
if (X < A) {
printf("%d", 0);
} else if (X >= A) {
printf("%d", 10);
}
}
| [
"identifier.change",
"call.arguments.change"
] | 809,693 | 809,694 | u007480238 | cpp |
p02999 | #include <bits/stdc++.h>
using namespace std;
int main() {
int x, a;
cin >> x >> a;
if (a < x)
cout << 0 << endl;
if (a >= x)
cout << 10 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int x, a;
cin >> x >> a;
if (a > x)
cout << 0 << endl;
if (a <= x)
cout << 10 << endl;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 809,695 | 809,696 | u626360077 | cpp |
p02999 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, x;
cin >> a >> x;
if (x >= a) {
cout << 10 << endl;
} else {
cout << 0 << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, x;
cin >> x >> a;
if (x >= a) {
cout << 10 << endl;
} else {
cout << 0 << endl;
}
return 0;
}
| [
"expression.operation.binary.remove"
] | 809,724 | 809,725 | u959353968 | cpp |
p02999 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, a;
cin >> n >> a;
if (n >= a) {
cout << "0" << endl;
} else {
cout << "10" << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, a;
cin >> n >> a;
if (n >= a) {
cout << "10" << endl;
} else {
cout << "0" << endl;
}
return 0;
}
| [
"literal.string.change",
"io.output.change"
] | 809,732 | 809,733 | u707853565 | 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;
}
} | [] | 809,737 | 809,738 | u232711814 | cpp |
p02999 | #include <stdio.h>
int main(void) {
int x, a;
scanf("%d, %d", &x, &a);
if (x < a) {
printf("0");
} else {
printf("10");
}
return 0;
} | #include <stdio.h>
int main(void) {
int x, a;
scanf("%d %d", &x, &a);
if (x < a) {
printf("0");
} else {
printf("10");
}
return 0;
} | [
"literal.string.change",
"call.arguments.change"
] | 809,750 | 809,751 | u098923136 | cpp |
p02999 | #include <bits/stdc++.h>
#define st first
#define nd second
using namespace std;
void debug_out() { cerr << endl; }
template <class T> ostream &prnt(ostream &out, T v) {
out << v.size() << '\n';
for (auto e : v)
out << e << ' ';
return out;
}
template <class T> ostream &operator<<(ostream &out, vector<T> v) {
return prnt(out, v);
}
template <class T> ostream &operator<<(ostream &out, set<T> v) {
return prnt(out, v);
}
template <class T1, class T2> ostream &operator<<(ostream &out, map<T1, T2> v) {
return prnt(out, v);
}
template <class T1, class T2>
ostream &operator<<(ostream &out, pair<T1, T2> p) {
return out << '(' << p.st << ' ' << p.nd << ')';
}
template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) {
cerr << " " << H;
debug_out(T...);
}
#define dbg(...) cerr << #__VA_ARGS__ << " ->", debug_out(__VA_ARGS__)
#define dbg_v(x, n) \
do { \
cerr << #x "[]: "; \
for (int _ = 0; _ < n; ++_) \
cerr << x[_] << " "; \
cerr << '\n'; \
} while (0)
#define dbg_ok cerr << "OK!\n"
// const int N = ;
int n;
int main() {
ios_base::sync_with_stdio(false);
int x, l;
cin >> n >> x;
cout << 10 * (n < x);
}
| #include <bits/stdc++.h>
#define st first
#define nd second
using namespace std;
void debug_out() { cerr << endl; }
template <class T> ostream &prnt(ostream &out, T v) {
out << v.size() << '\n';
for (auto e : v)
out << e << ' ';
return out;
}
template <class T> ostream &operator<<(ostream &out, vector<T> v) {
return prnt(out, v);
}
template <class T> ostream &operator<<(ostream &out, set<T> v) {
return prnt(out, v);
}
template <class T1, class T2> ostream &operator<<(ostream &out, map<T1, T2> v) {
return prnt(out, v);
}
template <class T1, class T2>
ostream &operator<<(ostream &out, pair<T1, T2> p) {
return out << '(' << p.st << ' ' << p.nd << ')';
}
template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) {
cerr << " " << H;
debug_out(T...);
}
#define dbg(...) cerr << #__VA_ARGS__ << " ->", debug_out(__VA_ARGS__)
#define dbg_v(x, n) \
do { \
cerr << #x "[]: "; \
for (int _ = 0; _ < n; ++_) \
cerr << x[_] << " "; \
cerr << '\n'; \
} while (0)
#define dbg_ok cerr << "OK!\n"
// const int N = ;
int n;
int main() {
ios_base::sync_with_stdio(false);
int x, l;
cin >> n >> x;
cout << 10 * (n >= x);
}
| [
"expression.operator.compare.change",
"io.output.change"
] | 809,763 | 809,764 | u541161485 | cpp |
p02999 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, x;
cin >> a >> x;
if (x < a) {
cout << " 0 " << endl;
} else if (x >= a) {
cout << " 10 " << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, x;
cin >> x;
cin >> a;
if (x < a) {
cout << " 0 " << endl;
} else if (x >= a) {
cout << " 10 " << endl;
}
}
| [
"expression.operation.binary.remove"
] | 809,765 | 809,766 | u990037841 | cpp |
p02999 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
int X, A;
cin >> X;
cin >> A;
puts(A < X ? "0" : "10");
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
int X, A;
cin >> X >> A;
puts(X < A ? "0" : "10");
}
| [
"expression.operation.binary.remove"
] | 809,773 | 809,774 | u447604786 | cpp |
p02999 | #include <iostream>
using namespace std;
int main() {
int x, a;
cin >> x >> a;
if (x > a) {
cout << 10 << endl;
} else {
cout << 0 << endl;
}
} | #include <iostream>
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"
] | 809,775 | 809,776 | u835629653 | cpp |
p02999 | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
int a, b;
char g[6];
cin >> a >> b;
if (a > b) {
cout << 10;
} else
cout << 0;
} | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
int a, b;
char g[6];
cin >> a >> b;
if (a >= b) {
cout << 10;
} else
cout << 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 809,782 | 809,783 | u768204022 | cpp |
p02999 | #include <bits/stdc++.h>
using namespace std;
int main() {
int X, A;
cin >> X >> A;
if (A >= X) {
cout << 10 << endl;
} else {
cout << 0 << endl;
}
return 0;
} | #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;
}
return 0;
} | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 809,784 | 809,785 | u313578168 | cpp |
p02999 | #include <bits/stdc++.h>
using namespace std;
int main() {
int x, p;
cin >> x >> p;
if (x > p)
cout << 0;
else
cout << 10;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int x, p;
cin >> x >> p;
if (x < p)
cout << 0;
else
cout << 10;
return 0;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 809,788 | 809,789 | u796786871 | cpp |
p02999 | #include <bits/stdc++.h>
using namespace std;
int main() {
int x, a;
scanf("%d %d", &x, &a);
printf("%d\n", x >= a);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int x, a;
scanf("%d %d", &x, &a);
printf("%d\n", (x >= a) * 10);
return 0;
} | [
"call.arguments.change",
"call.arguments.add"
] | 809,800 | 809,801 | u153798346 | cpp |
p02999 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int x, a, tmp;
cin >> x >> a;
if (x >= a) {
tmp = 1;
} else {
tmp = 10;
}
cout << tmp << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int x, a, tmp;
cin >> x >> a;
if (x >= a) {
tmp = 10;
} else {
tmp = 0;
}
cout << tmp << endl;
return 0;
}
| [
"literal.number.change",
"assignment.value.change"
] | 809,818 | 809,819 | u255172538 | cpp |
p02999 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int x, a, tmp;
cin >> x >> a;
if (x >= a) {
tmp = 1;
} else {
tmp = 0;
}
cout << tmp << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int x, a, tmp;
cin >> x >> a;
if (x >= a) {
tmp = 10;
} else {
tmp = 0;
}
cout << tmp << endl;
return 0;
}
| [
"literal.number.change",
"assignment.value.change"
] | 809,820 | 809,819 | u255172538 | cpp |
p02999 | #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;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, x;
cin >> x >> a;
if (x >= a) {
cout << "10" << endl;
} else {
cout << "0" << endl;
}
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"io.output.change"
] | 809,828 | 809,829 | u437324130 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.