problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k | fixed_code stringlengths 12 526k | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M | fixed_submission_id int64 2 1.54M | user_id stringlengths 10 10 | language stringclasses 8
values |
|---|---|---|---|---|---|---|---|
p03071 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
cout << max(A, B), max(max(A, B) - 1, min(A, B));
return 0;
} | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
cout << max(A, B) + max(max(A, B) - 1, min(A, B));
return 0;
} | [
"io.output.change"
] | 880,533 | 880,534 | u921628708 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << max((max(a, b) << 1 - 1), a + b) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << max((2 * max(a, b)) - 1, a + b) << endl;
return 0;
} | [
"io.output.change",
"call.arguments.change"
] | 880,537 | 880,538 | u679682246 | cpp |
p03071 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b;
if (b > a) {
cout << b + b - 1;
} else if (a == b) {
cout << 2 * a;
} else if (a < b) {
cout << a + a - 1;
}
} | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (b > a) {
cout << b + b - 1;
} else if (a == b) {
cout << 2 * a;
} else if (a > b) {
cout << a + a - 1;
}
} | [
"variable_declaration.remove",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 880,541 | 880,542 | u860150008 | cpp |
p03071 | #include <iostream>
using namespace std;
int main() {
int a, b, ans = 0;
cin >> a >> b;
for (int i = 0; i < 2; i++) {
if (a >= b) {
ans += a;
a--;
}
if (b > a) {
ans += b;
b--;
}
}
cout << ans;
}
| #include <iostream>
using namespace std;
int main() {
int a, b, ans = 0;
cin >> a >> b;
for (int i = 0; i < 2; i++) {
if (a >= b) {
ans += a;
a--;
} else if (b > a) {
ans += b;
b--;
}
}
cout << ans;
}
| [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 880,545 | 880,546 | u713574885 | cpp |
p03071 | #include <iostream>
using namespace std;
int main() {
int a, b, ans = 0;
cin >> a >> b;
for (int i = 0; i < 2; i++) {
if (a > b) {
ans += a;
a--;
}
if (b > a) {
ans += b;
b--;
}
}
cout << ans;
} | #include <iostream>
using namespace std;
int main() {
int a, b, ans = 0;
cin >> a >> b;
for (int i = 0; i < 2; i++) {
if (a >= b) {
ans += a;
a--;
} else if (b > a) {
ans += b;
b--;
}
}
cout << ans;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 880,547 | 880,546 | u713574885 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
signed main() {
int A, B;
scanf("%d%d", &A, &B);
printf("%d\n", (A == B) ? (A + B) : (max(A, B) - 1));
return 0;
} | #include <bits/stdc++.h>
using namespace std;
signed main() {
int A, B;
scanf("%d%d", &A, &B);
printf("%d\n", (A == B) ? (A + B) : (2 * max(A, B) - 1));
return 0;
} | [
"expression.operation.binary.add"
] | 880,548 | 880,549 | u208608367 | cpp |
p03071 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_set>
#include <... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_set>
#include <... | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 880,550 | 880,551 | u038537254 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A, B;
int X = max(A, B);
int Y = min(A, B);
int ans = X;
int M = max(X - 1, Y);
ans += M;
cout << ans;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
int X = max(A, B);
int Y = min(A, B);
int ans = X;
int M = max(X - 1, Y);
ans += M;
cout << ans;
}
| [] | 880,552 | 880,553 | u025773431 | cpp |
p03071 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <utility>
#include <vector>
const double PI = acos(-1);
#define rep(i, n) for (int i = 0; i < (n); i++)
usi... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <utility>
#include <vector>
const double PI = acos(-1);
#define rep(i, n) for (int i = 0; i < (n); i++)
usi... | [
"expression.unary.arithmetic.add"
] | 880,554 | 880,555 | u272628953 | cpp |
p03071 | //---------------------------------------------------------------
#include <bits/stdc++.h>
using namespace std;
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <math.h>
#include <numeric>
#include <sstream>
#include <vector>
//... | //---------------------------------------------------------------
#include <bits/stdc++.h>
using namespace std;
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <math.h>
#include <numeric>
#include <sstream>
#include <vector>
//... | [
"expression.operation.binary.remove"
] | 880,556 | 880,557 | u825601908 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
// #define ordered_set tree<int, null_type,less<int>,
// rb_tree_tag,tree_order_statistics_node_update>
#define FS ... | #include <bits/stdc++.h>
using namespace std;
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
// #define ordered_set tree<int, null_type,less<int>,
// rb_tree_tag,tree_order_statistics_node_update>
#define FS ... | [
"call.arguments.change"
] | 880,577 | 880,578 | u293991054 | cpp |
p03071 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A < B)
swap(A, B);
int ans = max(A + A + 1, A + B);
cout << ans << endl;
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A < B)
swap(A, B);
int ans = max(A + A - 1, A + B);
cout << ans << endl;
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 880,594 | 880,595 | u618263300 | cpp |
p03071 | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A == B) {
cout << A + B << endl;
} else {
if (A >= B - 1) {
cout << 2 * A - 1 << endl;
} else {
cout << 2 * B - 1 << endl;
}
}
} | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A == B) {
cout << A + B << endl;
} else {
if (A > B) {
cout << 2 * A - 1 << endl;
} else {
cout << 2 * B - 1 << endl;
}
}
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 880,598 | 880,599 | u158677249 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define lvector vector<ll>
#define cvector vector<char>
#define svector vector<string>
#define lque queue<ll>
#define lpque priority_queue<ll>
#define dlpque priority_queue<ll, lvector, greater<ll>>
#define P pair<ll, ll>
#define ALL(a) a.begin(), a.end... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define lvector vector<ll>
#define cvector vector<char>
#define svector vector<string>
#define lque queue<ll>
#define lpque priority_queue<ll>
#define dlpque priority_queue<ll, lvector, greater<ll>>
#define P pair<ll, ll>
#define ALL(a) a.begin(), a.end... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"call.arguments.change",
"io.output.change"
] | 880,608 | 880,609 | u894339989 | cpp |
p03071 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main(void) {
int a, b;
cin >> a >> b;
if (a - 1 >= b)
cout << a * a - a << endl;
else if (a == b)
cout << a + b << endl;
else
cout << b * b - b << endl;
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main(void) {
int a, b;
cin >> a >> b;
if (a - 1 >= b)
cout << 2 * a - 1 << endl;
else if (a == b)
cout << a + b << endl;
else
cout << 2 * b - 1 << endl;
... | [
"identifier.replace.remove",
"literal.replace.add",
"io.output.change"
] | 880,615 | 880,616 | u917518913 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (max(a, b) - min(a, b) < 2) {
cout << 2 * max(a, b) - 1 << endl;
} else {
cout << a + b << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (max(a, b) - min(a, b) >= 2) {
cout << 2 * max(a, b) - 1 << endl;
} else {
cout << a + b << endl;
}
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 880,617 | 880,618 | u637669066 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int a, b;
cin >> a >> b;
if (a > b) {
cout << 2 * a - 1 << endl;
} else if (a > b) {
cout << 2 * b - 1 << endl;
} else {
cout << 2 * a << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int a, b;
cin >> a >> b;
if (a > b) {
cout << 2 * a - 1 << endl;
} else if (a < b) {
cout << 2 * b - 1 << endl;
} else {
cout << 2 * a << endl;
}
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 880,633 | 880,634 | u680574634 | cpp |
p03071 | // testcode.cpp
#include <iostream>
#include <utility>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b;
if (a < b) {
swap(a, b);
}
if (a == b) {
c == 2 * a;
}
else {
c == 2 * a - 1;
}
cout << c << endl;
} | // testcode.cpp
#include <iostream>
#include <utility>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b;
if (a < b) {
swap(a, b);
}
if (a == b) {
c = 2 * a;
}
else {
c = 2 * a - 1;
}
cout << c;
} | [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo",
"expression.operation.binary.remove"
] | 880,641 | 880,642 | u928108659 | cpp |
p03071 | // testcode.cpp
#include <iostream>
#include <utility>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b;
if (a < b) {
swap(a, b);
}
if (a == b) {
c == 2 * a;
}
else {
c == 2 * a - 1;
}
cout << c;
} | // testcode.cpp
#include <iostream>
#include <utility>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b;
if (a < b) {
swap(a, b);
}
if (a == b) {
c = 2 * a;
}
else {
c = 2 * a - 1;
}
cout << c;
} | [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 880,643 | 880,642 | u928108659 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A == B) {
cout << A * B << endl;
} else {
cout << max(A, B) + (max(A, B) - 1) << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A == B) {
cout << A + B << endl;
} else {
cout << max(A, B) + (max(A, B) - 1) << endl;
}
} | [
"expression.operator.arithmetic.change",
"io.output.change"
] | 880,650 | 880,651 | u164730704 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A == B) {
cout << A * B << endl;
} else {
cout << max(A, B) * (max(A, B) - 1) << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A == B) {
cout << A + B << endl;
} else {
cout << max(A, B) + (max(A, B) - 1) << endl;
}
} | [
"expression.operator.arithmetic.change",
"io.output.change"
] | 880,652 | 880,651 | u164730704 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
int Max = max(A, B);
if (A = B)
cout << 2 * Max << endl;
else
cout << 2 * Max - 1 << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
int Max = max(A, B);
if (A == B)
cout << 2 * Max << endl;
else
cout << 2 * Max - 1 << endl;
return 0;
} | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 880,660 | 880,661 | u101018317 | cpp |
p03071 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
int main() {
int a, b;
cin >> a >> b;
int ans;
if (abs(a - b) >= 2) {
ans = 2 * max(a, b) - 1;
} else
ans = a + b - 1;
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
int main() {
int a, b;
cin >> a >> b;
int ans;
if (abs(a - b) >= 2) {
ans = 2 * max(a, b) - 1;
} else
ans = a + b;
cout << ans << endl;
} | [
"expression.operation.binary.remove"
] | 880,662 | 880,663 | u937618939 | cpp |
p03071 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int s = max(a, b);
cout << max(a, b) + max(s, min(a, b)) << endl;
} | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int s = max(a, b) - 1;
cout << max(a, b) + max(s, min(a, b)) << endl;
} | [
"assignment.change"
] | 880,664 | 880,665 | u206390098 | cpp |
p03071 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <new>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
typedef long long ll;
typedef long double ld;
using namespace std;
usin... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <new>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
typedef long long ll;
typedef long double ld;
using namespace std;
usin... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 880,675 | 880,676 | u441865202 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << max({2 * a + 1, 2 * b + 1, a + b}) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << max({2 * a - 1, 2 * b - 1, a + b}) << endl;
}
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 880,680 | 880,681 | u492660436 | cpp |
p03071 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int max_1 = a + a - 1;
int max_2 = a + b;
int max_3 = b + b + 1;
cout << max(max(max_1, max_2), max_3) << endl;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int max_1 = a + a - 1;
int max_2 = a + b;
int max_3 = b + b - 1;
cout << max(max(max_1, max_2), max_3) << endl;
}
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"expression.operation.binary.change"
] | 880,682 | 880,683 | u816145694 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A == B) {
cout << A + A - 1 << endl;
} else {
int tmp = max(A, B);
cout << tmp + tmp - 1 << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A == B) {
cout << A + A << endl;
} else {
int tmp = max(A, B);
cout << tmp + tmp - 1 << endl;
}
} | [
"expression.operation.binary.remove"
] | 880,684 | 880,685 | u760748346 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B;
if (A = B) {
cout << 2 * A << endl;
} else {
cout << 2 * max(A, B) - 1 << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A == B) {
cout << 2 * A << endl;
} else {
cout << 2 * max(A, B) - 1 << endl;
}
} | [
"variable_declaration.remove",
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 880,690 | 880,691 | u978640776 | cpp |
p03071 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a > b)
cout << max(a + b, max(a + a - 1, b + b - 1));
} | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << max(a + b, max(a + a - 1, b + b - 1));
} | [] | 880,700 | 880,701 | u746310630 | cpp |
p03071 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cstdio>
#include <ctime>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i =... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cstdio>
#include <ctime>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i =... | [
"control_flow.branch.if.condition.change"
] | 880,713 | 880,714 | u018713014 | cpp |
p03071 | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define all(a) (a).begin(), (a).end()
#define dunk(a) cout << (a) << endl
#define rall(a) (a).rbegin(), (a).rend()
const int INF = 2e9;
using namespace std;
using Graph = vector<vector<int>>;
typedef pair<int, int> P;
typedef long long ll;
int mai... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define all(a) (a).begin(), (a).end()
#define dunk(a) cout << (a) << endl
#define rall(a) (a).rbegin(), (a).rend()
const int INF = 2e9;
using namespace std;
using Graph = vector<vector<int>>;
typedef pair<int, int> P;
typedef long long ll;
int mai... | [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 880,721 | 880,722 | u454081619 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
const unsigned int MOD = 1000000007;
#define ll long long
#define PI 3.1416
string day[] = {"SUN", "MON", "TUE", "WED", "THU", "FRI", "SAT"};
vector<string> v;
void dfs(string str, string t = "", int cnt = 0) {
if (cnt == 2) {
v.push_back(t);
return;
} else {
... | #include <bits/stdc++.h>
using namespace std;
const unsigned int MOD = 1000000007;
#define ll long long
#define PI 3.1416
string day[] = {"SUN", "MON", "TUE", "WED", "THU", "FRI", "SAT"};
vector<string> v;
void dfs(string str, string t = "", int cnt = 0) {
if (cnt == 2) {
v.push_back(t);
return;
} else {
... | [
"identifier.change",
"io.output.change",
"identifier.replace.add",
"literal.replace.remove"
] | 880,731 | 880,732 | u207235471 | cpp |
p03071 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
int count = 0, sum = 0;
while (count > 2) {
if (A > B) {
sum += A;
--A;
} else {
sum += B;
--B;
}
++... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
int count = 0, sum = 0;
while (count < 2) {
if (A > B) {
sum += A;
--A;
} else {
sum += B;
--B;
}
++... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 880,740 | 880,741 | u323542775 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, a, n) for (ll i = a; i < (ll)(n); i++)
#define memi cout << endl
#define kono(n) cout << fixed << setprecision(n)
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define hina... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, a, n) for (ll i = a; i < (ll)(n); i++)
#define memi cout << endl
#define kono(n) cout << fixed << setprecision(n)
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define hina... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 880,746 | 880,747 | u917049698 | cpp |
p03071 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int ans = max(a, b);
if (ans == a)
cout << max(a, b) + max(a - 1, b);
else
cout << max(a, b) + max(a, b - b);
}
| #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int ans = max(a, b);
if (ans == a)
cout << max(a, b) + max(a - 1, b);
else
cout << max(a, b) + max(a, b - 1);
}
| [
"identifier.replace.remove",
"literal.replace.add",
"io.output.change"
] | 880,748 | 880,749 | u639300218 | cpp |
p03071 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a > b) {
int c = a;
a = b;
b = c;
}
if (a == b)
cout << a + b << endl;
else
cout << b * 2 + 1 << endl;
} | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a > b) {
int c = a;
a = b;
b = c;
}
if (a == b)
cout << a + b << endl;
else
cout << b * 2 - 1 << endl;
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 880,752 | 880,753 | u993074316 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
template <typename T> void print(T x) { cout << x << endl; }
int main(void) {
int a, b;
cin >> a >> b;
if (a < b)
swap(a, b);
int mx = (2 * a - 1, a + b);
cout << mx;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
template <typename T> void print(T x) { cout << x << endl; }
int main(void) {
int a, b;
cin >> a >> b;
if (a < b)
swap(a, b);
int mx = max(2 * a - 1, a + b);
cout << mx;
}
| [
"call.add"
] | 880,764 | 880,765 | u243407720 | cpp |
p03064 | #include <bits/stdc++.h>
using namespace std;
// #define int long long
#define rep(i, n) for (long long i = (long long)(0); i < (long long)(n); ++i)
#define reps(i, n) for (long long i = (long long)(1); i <= (long long)(n); ++i)
#define rrep(i, n) for (long long i = ((long long)(n)-1); i >= 0; i--)
#define rreps(i, n)... | #include <bits/stdc++.h>
using namespace std;
// #define int long long
#define rep(i, n) for (long long i = (long long)(0); i < (long long)(n); ++i)
#define reps(i, n) for (long long i = (long long)(1); i <= (long long)(n); ++i)
#define rrep(i, n) for (long long i = ((long long)(n)-1); i >= 0; i--)
#define rreps(i, n)... | [
"literal.number.change",
"variable_declaration.value.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 880,778 | 880,779 | u530107518 | cpp |
p03064 | #include <bits/stdc++.h>
using namespace std;
// #define int long long
#define rep(i, n) for (long long i = (long long)(0); i < (long long)(n); ++i)
#define reps(i, n) for (long long i = (long long)(1); i <= (long long)(n); ++i)
#define rrep(i, n) for (long long i = ((long long)(n)-1); i >= 0; i--)
#define rreps(i, n)... | #include <bits/stdc++.h>
using namespace std;
// #define int long long
#define rep(i, n) for (long long i = (long long)(0); i < (long long)(n); ++i)
#define reps(i, n) for (long long i = (long long)(1); i <= (long long)(n); ++i)
#define rrep(i, n) for (long long i = ((long long)(n)-1); i >= 0; i--)
#define rreps(i, n)... | [
"literal.number.change",
"variable_declaration.value.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 880,778 | 880,780 | u530107518 | cpp |
p03064 | #include <bits/stdc++.h>
#define l_ength size
const int inf = (1 << 30);
const int mod = 998244353;
using ll = long long;
using namespace std;
const int bound = 100000;
ll sp[310][bound];
ll dp[310][bound];
int main() {
int n;
cin >> n;
vector<int> a(n);
for (auto &k : a)
cin >> k;
dp[0][0] = 1;
ll su... | #include <bits/stdc++.h>
#define l_ength size
const int inf = (1 << 30);
const int mod = 998244353;
using ll = long long;
using namespace std;
const int bound = 100000;
ll sp[310][bound];
ll dp[310][bound];
int main() {
int n;
cin >> n;
vector<int> a(n);
for (auto &k : a)
cin >> k;
dp[0][0] = 1;
ll su... | [
"expression.operation.binary.add"
] | 880,785 | 880,786 | u548624367 | cpp |
p03064 | #include <bits/stdc++.h>
#define l_ength size
const int inf = (1 << 30);
using ll = long long;
const ll mod = 998244353;
using namespace std;
const int bound = 100000;
ll sp[310][bound];
ll dp[310][bound];
int main() {
int n;
cin >> n;
vector<ll> a(n);
for (auto &k : a)
cin >> k;
dp[0][0] = 1;
ll sum ... | #include <bits/stdc++.h>
#define l_ength size
const int inf = (1 << 30);
using ll = long long;
const ll mod = 998244353;
using namespace std;
const int bound = 100000;
ll sp[310][bound];
ll dp[310][bound];
int main() {
int n;
cin >> n;
vector<ll> a(n);
for (auto &k : a)
cin >> k;
dp[0][0] = 1;
ll sum ... | [
"expression.operation.binary.add"
] | 880,787 | 880,788 | u268977772 | cpp |
p03064 | #include <algorithm>
#include <cassert>
#include <chrono>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <un... | #include <algorithm>
#include <cassert>
#include <chrono>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <un... | [
"function.return_value.change",
"call.remove",
"call.arguments.change"
] | 880,789 | 880,790 | u096453658 | cpp |
p03064 | #include <bits/stdc++.h>
#include <ext/numeric>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
#define oo 0x3f3f3f3f
#define OO 0x3f3f3f3f3f3f3f3f
#define popcount(n) __builtin_popcount(n)
#define popcountll(n) __builtin_popcou... | #include <bits/stdc++.h>
#include <ext/numeric>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
#define oo 0x3f3f3f3f
#define OO 0x3f3f3f3f3f3f3f3f
#define popcount(n) __builtin_popcount(n)
#define popcountll(n) __builtin_popcou... | [
"expression.operation.binary.add"
] | 880,791 | 880,792 | u381626581 | cpp |
p03064 | #include <iostream>
using namespace std;
typedef long long ll;
const int MAX_N = 303;
const int MAX_A = 303;
const ll MOD = 998244353;
ll A[MAX_N], dp[MAX_N][MAX_N * MAX_A], sub_dp[MAX_N][MAX_N * MAX_A];
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
ll sum = 0;
for (int i = 1; i ... | #include <iostream>
using namespace std;
typedef long long ll;
const int MAX_N = 303;
const int MAX_A = 303;
const ll MOD = 998244353;
ll A[MAX_N], dp[MAX_N][MAX_N * MAX_A], sub_dp[MAX_N][MAX_N * MAX_A];
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
ll sum = 0;
for (int i = 1; i ... | [
"expression.operation.binary.add"
] | 880,805 | 880,806 | u134519179 | cpp |
p03064 | // Copyright © 2019 Diego Garcia Rodriguez del Campo. All rights reserved.
#include <bits/stdc++.h>
#define MAX 305
#define MOD 998244353
using namespace std;
#define optimiza_io \
cin.tie(0); ... | // Copyright © 2019 Diego Garcia Rodriguez del Campo. All rights reserved.
#include <bits/stdc++.h>
#define MAX 305
#define MOD 998244353
using namespace std;
#define optimiza_io \
cin.tie(0); ... | [] | 880,815 | 880,816 | u414944342 | cpp |
p03064 | #include <bits/stdc++.h>
#include <fstream>
#include <iostream>
#define ll long long
using namespace std;
int main() {
int N;
cin >> N;
int S = 0;
int mod = 998244353;
vector<int> a(N + 1, 0);
for (int i = 1; i <= N; i++) {
cin >> a[i];
S += a[i];
}
vector<vector<ll>> dp1(N + 1, vector<ll>(S +... | #include <bits/stdc++.h>
#include <fstream>
#include <iostream>
#define ll long long
using namespace std;
int main() {
int N;
cin >> N;
int S = 0;
int mod = 998244353;
vector<int> a(N + 1, 0);
for (int i = 1; i <= N; i++) {
cin >> a[i];
S += a[i];
}
vector<vector<ll>> dp1(N + 1, vector<ll>(S +... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 880,827 | 880,828 | u119098168 | cpp |
p03064 | #include <algorithm>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <str... | #include <algorithm>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <str... | [
"expression.operator.compare.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 880,842 | 880,843 | u500496457 | cpp |
p03064 | #include <iostream>
#include <vector>
typedef long long TI;
std::vector<TI> cdp(std::vector<TI> A, TI S, TI m, TI Mod) {
TI N = A.size();
auto dp = std::vector<std::vector<TI>>(N + 1);
for (TI i = 0; i <= N; ++i) {
dp[i] = std::vector<TI>(S + 1, 0);
}
dp[0][0] = 1;
TI t = 0;
for (TI i = 0; i < N; ++... | #include <iostream>
#include <vector>
typedef long long TI;
std::vector<TI> cdp(std::vector<TI> A, TI S, TI m, TI Mod) {
TI N = A.size();
auto dp = std::vector<std::vector<TI>>(N + 1);
for (TI i = 0; i <= N; ++i) {
dp[i] = std::vector<TI>(S + 1, 0);
}
dp[0][0] = 1;
TI t = 0;
for (TI i = 0; i < N; ++... | [
"control_flow.branch.while.replace.add",
"control_flow.loop.if.replace.remove"
] | 880,875 | 880,876 | u670503797 | cpp |
p03064 | #include <algorithm>
#include <iostream>
#include <map>
#include <numeric>
#include <vector>
using namespace std;
using ll = long long;
const ll mod = 998244353;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REP_FROM(i, j, n) for (int i = (j); i < (n); ++i)
#define all(x) (x).begin(), (x).end()
ll power(ll ... | #include <algorithm>
#include <iostream>
#include <map>
#include <numeric>
#include <vector>
using namespace std;
using ll = long long;
const ll mod = 998244353;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REP_FROM(i, j, n) for (int i = (j); i < (n); ++i)
#define all(x) (x).begin(), (x).end()
ll power(ll ... | [
"assignment.value.change",
"identifier.change",
"assignment.change"
] | 880,885 | 880,886 | u702582248 | cpp |
p03064 | #include <iomanip>
#include <iostream>
//#include<cstdio>
#include <algorithm>
#include <cassert>
#include <cmath>
#include <map>
#include <queue>
#include <vector>
using namespace std;
typedef long long ll;
const ll P = 998244353;
int N;
const int Nmax = 300;
int A[Nmax];
int main() {
cin >> N;
for (int i = 0; i ... | #include <iomanip>
#include <iostream>
//#include<cstdio>
#include <algorithm>
#include <cassert>
#include <cmath>
#include <map>
#include <queue>
#include <vector>
using namespace std;
typedef long long ll;
const ll P = 998244353;
int N;
const int Nmax = 300;
int A[Nmax];
int main() {
cin >> N;
for (int i = 0; i ... | [
"assignment.change"
] | 880,902 | 880,903 | u534998883 | cpp |
p03064 | #include <iomanip>
#include <iostream>
//#include<cstdio>
#include <algorithm>
#include <cassert>
#include <cmath>
#include <map>
#include <queue>
#include <vector>
using namespace std;
typedef long long ll;
const int P = 998244353;
int N;
const int Nmax = 300;
int A[Nmax];
int main() {
cin >> N;
for (int i = 0; i... | #include <iomanip>
#include <iostream>
//#include<cstdio>
#include <algorithm>
#include <cassert>
#include <cmath>
#include <map>
#include <queue>
#include <vector>
using namespace std;
typedef long long ll;
const ll P = 998244353;
int N;
const int Nmax = 300;
int A[Nmax];
int main() {
cin >> N;
for (int i = 0; i ... | [
"variable_declaration.type.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"assignment.change"
] | 880,904 | 880,903 | u534998883 | cpp |
p03064 | #include <algorithm>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
long long dp[305][90005] = {}, dp2[305][90005] = {}, res = 0;
long long int rui(long long int a, long long int b, l... | #include <algorithm>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
long long dp[305][90005] = {}, dp2[305][90005] = {}, res = 0;
long long int rui(long long int a, long long int b, l... | [
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 880,922 | 880,921 | u018872912 | cpp |
p03064 | #include <bits/stdc++.h>
#define fst(t) std::get<0>(t)
#define snd(t) std::get<1>(t)
#define thd(t) std::get<2>(t)
#define unless(p) if (!(p))
#define until(p) while (!(p))
using ll = std::int64_t;
using P = std::tuple<int, int>;
template <typename T> T mod_expt(T a, std::int64_t n, T mod) {
T power{1};
while (n... | #include <bits/stdc++.h>
#define fst(t) std::get<0>(t)
#define snd(t) std::get<1>(t)
#define thd(t) std::get<2>(t)
#define unless(p) if (!(p))
#define until(p) while (!(p))
using ll = std::int64_t;
using P = std::tuple<int, int>;
template <typename T> T mod_expt(T a, std::int64_t n, T mod) {
T power{1};
while (n... | [
"assignment.change"
] | 880,929 | 880,930 | u764058295 | cpp |
p03064 | #include <cstdint>
#include <iostream>
using namespace std; // 575
const int MAX = 301;
const int MAX2 = 90001;
const int MOD = 998244353;
int64_t pow(int64_t a, int b) {
if (b == 0)
return 1;
if (b == 1)
return a;
if (b == 2)
return a * a % MOD;
return pow(pow(a, b >> 1), 2) * pow(a, b & 1) % MOD... | #include <cstdint>
#include <iostream>
using namespace std; // 575
const int MAX = 301;
const int MAX2 = 90001;
const int MOD = 998244353;
int64_t pow(int64_t a, int b) {
if (b == 0)
return 1;
if (b == 1)
return a;
if (b == 2)
return a * a % MOD;
return pow(pow(a, b >> 1), 2) * pow(a, b & 1) % MOD... | [
"assignment.change"
] | 880,940 | 880,941 | u550314572 | cpp |
p03064 | #include <iostream>
using namespace std;
const int MOD = 998244353;
typedef long long ll;
ll dp[90001];
ll dp_[90001];
ll dp1[90001];
ll dp1_[90001];
void copy() {
for (int i = 0; i <= 90001; i++) {
dp_[i] = dp[i];
dp1_[i] = dp1[i];
}
}
int main() {
int N;
int a[300];
ll ans;
cin >> N;
ll su... | #include <iostream>
using namespace std;
const int MOD = 998244353;
typedef long long ll;
ll dp[90001];
ll dp_[90001];
ll dp1[90001];
ll dp1_[90001];
void copy() {
for (int i = 0; i <= 90001; i++) {
dp_[i] = dp[i];
dp1_[i] = dp1[i];
}
}
int main() {
int N;
int a[300];
ll ans;
cin >> N;
ll su... | [
"assignment.add"
] | 880,942 | 880,943 | u693133807 | cpp |
p03071 | #include <stdio.h>
main() {
int a, b, sum;
scanf("%d %d", &a, &b);
if (a - b >= 1)
sum = 2 * a - 1;
else if (a - b <= 1)
sum = 2 * b - 1;
else
sum = a + b;
printf("%d", sum);
}
| #include <stdio.h>
main() {
int a, b, sum;
scanf("%d %d", &a, &b);
if (a - b >= 1)
sum = 2 * a - 1;
else if (a - b <= -1)
sum = 2 * b - 1;
else
sum = a + b;
printf("%d", sum);
}
| [
"control_flow.branch.if.condition.change"
] | 880,956 | 880,957 | u110688573 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
#define ll long long // long long省略
#define pb push_back // push_back省略
#define mp make_pair // make_pair省略
#define fi first // first省略
#define se second // second省略
#define itn int // int誤字保険
#define count cout // cout誤字保険
#define vecotr vector // vect... | #include <bits/stdc++.h>
using namespace std;
#define ll long long // long long省略
#define pb push_back // push_back省略
#define mp make_pair // make_pair省略
#define fi first // first省略
#define se second // second省略
#define itn int // int誤字保険
#define count cout // cout誤字保険
#define vecotr vector // vect... | [
"expression.operation.binary.add"
] | 880,960 | 880,961 | u547754910 | cpp |
p03071 | #include <iostream>
//#include <iomanip>
//#include <algorithm>
//#include <numeric>
//#include <queue>
//#include <stack>
//#include <math.h>
//#include <vector>
//#include <string>
// typedef long long LL;
using namespace std;
int main() {
int a;
int b;
int ans = 0;
cin >> a >> b;
for (int i = 0; i < 2; i+... | #include <iostream>
//#include <iomanip>
//#include <algorithm>
//#include <numeric>
//#include <queue>
//#include <stack>
//#include <math.h>
//#include <vector>
//#include <string>
// typedef long long LL;
using namespace std;
int main() {
int a;
int b;
int ans = 0;
cin >> a >> b;
for (int i = 0; i < 2; i+... | [] | 880,962 | 880,963 | u755310927 | cpp |
p03071 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int ans = max(a + b - 1, max(a + a - 1, b + b - 1));
cout << ans << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int ans = max(a + b, max(a + a - 1, b + b - 1));
cout << ans << endl;
return 0;
} | [
"expression.operation.binary.remove"
] | 880,967 | 880,968 | u522506260 | cpp |
p03071 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int ans = max(a + b - 2, max(a + a - 2, b + b - 2));
cout << ans << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int ans = max(a + b, max(a + a - 1, b + b - 1));
cout << ans << endl;
return 0;
} | [
"expression.operation.binary.remove",
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 880,969 | 880,968 | u522506260 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
cout << max({A + B, A * 2, B * 2}) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
cout << max({A + B, A * 2 - 1, B * 2 - 1}) << endl;
}
| [
"expression.operation.binary.add"
] | 880,970 | 880,971 | u979078704 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a == b) {
cout << a + a;
}
if (a > b) {
cout << a + a - 1;
} else {
cout << b + b - 1;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a == b) {
cout << a + b;
} else {
if (a > b) {
cout << a + a - 1;
} else {
cout << b + b - 1;
}
}
return 0;
}
| [
"identifier.change",
"io.output.change",
"control_flow.branch.else.add"
] | 880,976 | 880,977 | u562321612 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a == b) {
cout << a + b;
}
if (a > b) {
cout << a + a - 1;
} else {
cout << b + b - 1;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a == b) {
cout << a + b;
} else {
if (a > b) {
cout << a + a - 1;
} else {
cout << b + b - 1;
}
}
return 0;
}
| [
"control_flow.branch.else.add"
] | 880,978 | 880,977 | u562321612 | cpp |
p03071 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main(void) {
int a, b;
cin >> a >> b;
int ans = max(b + b - 1, max(a + a - 1, a + b - 1));
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main(void) {
int a, b;
cin >> a >> b;
int ans = max(b + b - 1, max(a + a - 1, a + b));
cout << ans << endl;
return 0;
}
| [
"expression.operation.binary.remove"
] | 880,991 | 880,992 | u980485808 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
int main(void) {
int a, b;
cin >> a >> b;
if (a == b)
cout << max(a, b) * 2 - 1 << endl;
else
cout << max(a, b) * 2 << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
int main(void) {
int a, b;
cin >> a >> b;
if (a == b)
cout << max(a, b) * 2 << endl;
else
cout << max(a, b) * 2 - 1 << endl;
return 0;
}
| [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add",
"control_flow.branch.else.remove"
] | 880,993 | 880,994 | u326152409 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int coin = 0;
if (a > b) {
coin += a;
a--;
coin += a;
} else if (a < b) {
coin += b;
b--;
coin += b;
} else if (a == b) {
coin += 2 * b - 1;
}
cout << coin << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int coin = 0;
if (a > b) {
coin += a;
a--;
coin += a;
} else if (a < b) {
coin += b;
b--;
coin += b;
} else if (a == b) {
coin += a + b;
}
cout << coin << endl;
return 0;
}
| [
"expression.operation.binary.remove"
] | 881,004 | 881,005 | u550374978 | cpp |
p03071 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int sum = max(a, b);
if (sum == a) {
a = a--;
} else {
b = b--;
}
sum += max(a, b);
cout << sum << endl;
} | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int sum = max(a, b);
if (sum == a) {
a--;
} else {
b--;
}
sum += max(a, b);
cout << sum << endl;
} | [
"assignment.change"
] | 881,014 | 881,015 | u840731541 | cpp |
p03071 | #include <array>
#include <iostream>
#include <string>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int ans = 0;
for (int i = 0; i < 2; i++) {
if (a <= b) {
ans = ans + b;
b = b--;
} else if (b < a) {
ans = ans + a;
a = a--;
}
}
cout << ans << endl;
} | #include <array>
#include <iostream>
#include <string>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int ans = 0;
for (int i = 0; i < 2; i++) {
if (a <= b) {
ans = ans + b;
b = --b;
} else if (b < a) {
ans = ans + a;
a = --a;
}
}
cout << ans << endl;
} | [] | 881,016 | 881,017 | u840731541 | cpp |
p03071 | #include <array>
#include <iostream>
#include <string>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int ans = 0;
for (int i = 0; i < 2; i++) {
if (a <= b) {
ans = ans + b;
b = b--;
} else if (b < a) {
ans = ans + a;
a = a--;
}
}
cout << ans << endl;
} | #include <array>
#include <iostream>
#include <string>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int ans = 0;
for (int i = 0; i < 2; i++) {
if (a <= b) {
ans = ans + b;
b--;
} else if (b < a) {
ans = ans + a;
a--;
}
}
cout << ans << endl;
} | [
"assignment.change"
] | 881,016 | 881,018 | u840731541 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int ans = 0;
if (a = b)
ans = a * 2;
else
ans += max(a, b) * 2 - 1;
cout << ans;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int ans = 0;
if (a == b)
ans = a * 2;
else
ans += max(a, b) * 2 - 1;
cout << ans;
}
| [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 881,021 | 881,022 | u260907804 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int ans = 0;
if (a > b)
ans = a + a - 1;
if (a < b)
ans = b + b - 1;
else
ans = a + b;
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int ans = 0;
if (a > b)
ans = a + a - 1;
else if (a < b)
ans = b + b - 1;
else
ans = a + b;
cout << ans << endl;
} | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 881,029 | 881,030 | u417563928 | cpp |
p03071 | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
const int MOD = 1000000007;
const int INF_32 = 1LL << 30;
const int64_t INF_64 = 1LL << 60;
int main() {
int A, B;
cin >> A >> B;
int a... | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
const int MOD = 1000000007;
const int INF_32 = 1LL << 30;
const int64_t INF_64 = 1LL << 60;
int main() {
int A, B;
cin >> A >> B;
int a... | [
"expression.operation.binary.remove"
] | 881,031 | 881,032 | u715366261 | cpp |
p03071 | #include <iostream>
using namespace std;
int main(void) {
int a, b;
cin >> a >> b;
if (a > b + 1) {
cout << a + (a - 1);
}
if (a + 1 < b) {
cout << b + (b - 1);
} else {
cout << a + b;
}
return 0;
} | #include <iostream>
using namespace std;
int main(void) {
// Your code here!
int a, b;
cin >> a >> b;
if (a > b + 1) {
cout << a + (a - 1);
}
else if (a + 1 < b) {
cout << b + (b - 1);
}
else {
cout << a + b;
}
return 0;
} | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 881,033 | 881,034 | u618714790 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
cin >> a;
int b;
cin >> b;
if (a == b)
return cout << a + b, 0;
return (max(a, b) * 2) - 1;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
cin >> a;
int b;
cin >> b;
if (a == b)
return cout << a + b, 0;
cout << (max(a, b) * 2) - 1;
} | [
"io.output.change"
] | 881,045 | 881,046 | u901813121 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
#ifdef _DEBUG
#define dlog(str) cout << "====" << str << endl;
#else
#define dlog(str)
#endif
#define INF 999999999
#define MOD 1000000007
#define REP(i, n) for (int i = 0, i##_l = (n); i < i##_l; i++)
#define FOR(i, s, e) for (int i = s, i##_l = (e); i < i##_l; i++)
#defin... | #include <bits/stdc++.h>
using namespace std;
#ifdef _DEBUG
#define dlog(str) cout << "====" << str << endl;
#else
#define dlog(str)
#endif
#define INF 999999999
#define MOD 1000000007
#define REP(i, n) for (int i = 0, i##_l = (n); i < i##_l; i++)
#define FOR(i, s, e) for (int i = s, i##_l = (e); i < i##_l; i++)
#defin... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 881,047 | 881,048 | u840105874 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a > b)
swap(a, b);
int res = 0;
res += b;
b -= 1;
if (a < b)
swap(a, b);
res += b;
cout << res << '\n';
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a > b)
swap(a, b);
int res = 0;
res += b;
b -= 1;
if (a > b)
swap(a, b);
res += b;
cout << res << '\n';
return 0;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 881,049 | 881,050 | u217173261 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a > b - 1)
cout << 2 * a - 1 << '\n';
else if (a == b)
cout << 2 * a << '\n';
else
cout << 2 * b - 1 << '\n';
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a > b)
cout << 2 * a - 1 << '\n';
else if (a == b)
cout << 2 * a << '\n';
else
cout << 2 * b - 1 << '\n';
return 0;
} | [
"expression.operation.binary.remove"
] | 881,051 | 881,052 | u551519692 | cpp |
p03071 | #include <iostream>
using namespace std;
int main() {
int A, B;
int coin = 0;
cin >> A >> B;
for (int i = 1; i < 3; ++i) {
if (A > B) {
coin += A;
--A;
} else if (A < B) {
coin += B;
--B;
} else if (A == B) {
coin += A;
--A;
--B;
}
}
cout << coin <<... | #include <iostream>
using namespace std;
int main() {
int A, B;
int coin = 0;
cin >> A >> B;
for (int i = 1; i < 3; ++i) {
if (A > B) {
coin += A;
--A;
} else if (A < B) {
coin += B;
--B;
} else if (A == B) {
coin += A;
--A;
}
}
cout << coin << endl;
} | [
"expression.unary.arithmetic.remove"
] | 881,063 | 881,064 | u949097771 | cpp |
p03071 | #include <iostream>
#include <string>
using namespace std;
#define rep(i, n) for (int(i) = 1; (i) <= (n); (i)++)
int main() {
int a, b, ans;
cin >> a >> b;
if (a > b)
ans = a + (a - 1);
if (a < b)
ans = b + (b - 1);
else
ans = a + b;
cout << ans << endl;
}
| #include <iostream>
#include <string>
using namespace std;
#define rep(i, n) for (int(i) = 1; (i) <= (n); (i)++)
int main() {
int a, b, ans;
cin >> a >> b;
if (a > b)
ans = a + (a - 1);
else if (a < b)
ans = b + (b - 1);
else
ans = a + b;
cout << ans << endl;
}
| [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 881,079 | 881,080 | u902803949 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int x = a * 2 - 1, y = b * 2 - 1, z = a * b;
int ans = max(x, y);
ans = max(ans, z);
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int x = a * 2 - 1, y = b * 2 - 1, z = a + b;
int ans = max(x, y);
ans = max(ans, z);
cout << ans << endl;
} | [
"expression.operator.arithmetic.change",
"expression.operation.binary.change"
] | 881,088 | 881,089 | u351265848 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
int ans = 0;
cin >> a >> b;
if (a > b)
ans = 2 * a - 1;
if (a == b)
ans = 2 * a;
else
ans = 2 * b - 1;
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
int ans = 0;
cin >> a >> b;
if (a > b)
ans = 2 * a - 1;
else if (a == b)
ans = 2 * a;
else
ans = 2 * b - 1;
cout << ans << endl;
}
| [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 881,093 | 881,094 | u332153950 | cpp |
p03071 | #include <iostream>
#include <string>
using namespace std;
int main() {
int A;
int B;
cin >> A >> B;
int ans;
if (A > B)
ans = A * (A - 1);
else if (A < B)
ans = B * (B - 1);
else
ans = A + B;
cout << ans << endl;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
int A;
int B;
cin >> A >> B;
int ans;
if (A > B)
ans = A + (A - 1);
else if (A < B)
ans = B + (B - 1);
else
ans = A + B;
cout << ans << endl;
} | [
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 881,104 | 881,105 | u419501474 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int a, b;
cin >> a >> b;
cout << max({a + a, a + b, b + b}) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int a, b;
cin >> a >> b;
cout << max({a + a - 1, a + b, b + b - 1}) << endl;
return 0;
} | [
"expression.operation.binary.add"
] | 881,108 | 881,109 | u720447689 | cpp |
p03071 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a > b)
cout << 2 * a - 1;
else if (a = b)
cout << 2 * a;
else
cout << 2 * b - 1;
} | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a > b)
cout << 2 * a - 1;
else if (a == b)
cout << 2 * a;
else
cout << 2 * b - 1;
} | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 881,118 | 881,119 | u404145225 | cpp |
p03071 | #include <bits/stdc++.h>
#define r(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a >= (b + 1))
cout << a + a + 1 << endl;
else if (a == b)
cout << a + a << endl;
else if (b >= (a + 1))
cout << b + b + 1 << endl;
} | #include <bits/stdc++.h>
#define r(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a >= (b + 1))
cout << a + a - 1 << endl;
else if (a == b)
cout << a + a << endl;
else if (b >= (a + 1))
cout << b + b - 1 << endl;
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 881,125 | 881,126 | u192280767 | cpp |
p03071 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
int main() {
int a, b;
cin >> a >> b;
if (a == b) {
cout << a + b << endl;
} else if (a > b) {
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
int main() {
int a, b;
cin >> a >> b;
if (a == b) {
cout << a + b << endl;
} else if (a > b) {
... | [
"expression.operator.arithmetic.change",
"io.output.change"
] | 881,129 | 881,130 | u852449189 | cpp |
p03071 | #include <algorithm>
#include <bits/stdc++.h>
#include <cstdio>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
#define rep(i, x) for (int i = 0; i < x; i++)
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
type... | #include <algorithm>
#include <bits/stdc++.h>
#include <cstdio>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
#define rep(i, x) for (int i = 0; i < x; i++)
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
type... | [
"assignment.value.change"
] | 881,131 | 881,132 | u899645116 | cpp |
p03071 | // template
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<long long, long long> LP;
#define INF 999999999
#define MOD 1000000007
#define REP(i, n) for (ll i = 0, i##_len = (n); i < i##_len; i++)
#define REP_AB(i, a, b) for (ll i = ll(a); i < ll(b); i++)
#define ALL(v) v.begin(), v... | // template
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<long long, long long> LP;
#define INF 999999999
#define MOD 1000000007
#define REP(i, n) for (ll i = 0, i##_len = (n); i < i##_len; i++)
#define REP_AB(i, a, b) for (ll i = ll(a); i < ll(b); i++)
#define ALL(v) v.begin(), v... | [
"expression.operation.binary.add"
] | 881,135 | 881,136 | u703877026 | cpp |
p03071 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int k, l, m;
k = a * (a - 1);
l = a * b;
m = b * (b - 1);
cout << max(max(k, l), m) << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int k, l, m;
k = a + (a - 1);
l = a + b;
m = b + (b - 1);
cout << max(max(k, l), m) << endl;
return 0;
} | [
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 881,139 | 881,140 | u553183019 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a, b;
int coins;
for (int i = 0; i < 2; i++) {
if (a >= b) {
coins += a;
a--;
} else {
coins += b;
b--;
}
}
cout << coins << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int coins = 0;
for (int i = 0; i < 2; i++) {
if (a >= b) {
coins += a;
a--;
} else {
coins += b;
b--;
}
}
cout << coins << endl;
return 0;
} | [
"variable_declaration.value.change"
] | 881,161 | 881,162 | u318027064 | cpp |
p03071 | #include <algorithm>
#include <float.h>
#include <iostream>
#include <limits>
#include <math.h>
#include <numeric>
#include <string.h>
#include <vector>
#define rep(i, a, n) for (ll int(i) = (a); (i) < (n); (i)++)
#define urep(i, a, n) for (ll int(i) = (a); (i) > (n); (i)--)
#define MOD 1000000007
#define ll long long... | #include <algorithm>
#include <float.h>
#include <iostream>
#include <limits>
#include <math.h>
#include <numeric>
#include <string.h>
#include <vector>
#define rep(i, a, n) for (ll int(i) = (a); (i) < (n); (i)++)
#define urep(i, a, n) for (ll int(i) = (a); (i) > (n); (i)--)
#define MOD 1000000007
#define ll long long... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"io.output.change"
] | 881,163 | 881,164 | u319945100 | cpp |
p03071 | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <math.h>
#include <string>
using namespace std;
int main() {
vector<int> X(1);
cin >> X[0] >> X[1];
int cnt = 0;
sort(X.begin(), X.end());
cnt = X[1] + max(X[1] - 1, X[0]);
cout << cnt << endl;
} | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <math.h>
#include <string>
using namespace std;
int main() {
vector<int> X(2);
cin >> X[0] >> X[1];
int cnt = 0;
sort(X.begin(), X.end());
cnt = X[1] + max(X[1] - 1, X[0]);
cout << cnt << endl;
} | [
"literal.number.change",
"call.arguments.change"
] | 881,165 | 881,166 | u431929942 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << max(a, b) + max(max(a, b) - 1, min(a, b) - 1) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << max(a, b) + max(max(a, b) - 1, min(a, b)) << endl;
return 0;
} | [
"expression.operation.binary.remove"
] | 881,184 | 881,185 | u366115355 | cpp |
p03071 | #include <iostream>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A > B + 2) {
cout << 2 * A - 1 << endl;
} else {
if (A == B) {
cout << 2 * A << endl;
} else {
cout << 2 * B - 1 << endl;
}
}
}
| #include <iostream>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A >= B + 1) {
cout << 2 * A - 1 << endl;
} else {
if (A == B) {
cout << 2 * A << endl;
} else {
cout << 2 * B - 1 << endl;
}
}
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.number.change"
] | 881,198 | 881,199 | u938317342 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int ans;
ans = max(a * (a - 1), b * (b - 1));
ans = max(ans, a * b);
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int ans;
ans = max(a + (a - 1), b + (b - 1));
ans = max(ans, a + b);
cout << ans << endl;
}
| [
"expression.operator.arithmetic.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 881,200 | 881,201 | u653482689 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a >= b + 1)
cout << a * 2 << endl;
else if (b >= a + 1)
cout << b * 2 << endl;
else
cout << a + b << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a >= b + 1)
cout << a * 2 - 1 << endl;
else if (b >= a + 1)
cout << b * 2 - 1 << endl;
else
cout << a + b << endl;
}
| [
"expression.operation.binary.add"
] | 881,210 | 881,211 | u469953228 | cpp |
p03071 | #include <iostream>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A > B + 1) {
cout << A + (A - 1) << endl;
} else if (A == B) {
cout << A + B << endl;
} else {
cout << B + (B - 1) << endl;
}
} | #include <iostream>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A > B) {
cout << A + (A - 1) << endl;
} else if (A == B) {
cout << A + B << endl;
} else {
cout << B + (B - 1) << endl;
}
} | [
"expression.operation.binary.remove"
] | 881,212 | 881,213 | u436741428 | cpp |
p03071 | #include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int i, j, k = 0;
cin >> i >> j;
if (i > j) {
k += i;
i++;
} else {
k += j;
j--;
}
if (i > j) {
k += i;
} else
k += j;
cout << k << endl;
return 0;
} | #include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int i, j, k = 0;
cin >> i >> j;
if (i > j) {
k += i;
i--;
} else {
k += j;
j--;
}
if (i > j) {
k += i;
} else
k += j;
cout << k << endl;
return 0;
} | [] | 881,214 | 881,215 | u199768991 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a > b) {
cout << 2 * a - 1 << endl;
} else if (a == b) {
cout << 2 * a << endl;
} else {
cout << 2 * b << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a > b) {
cout << 2 * a - 1 << endl;
} else if (a == b) {
cout << 2 * a << endl;
} else {
cout << 2 * b - 1 << endl;
}
return 0;
} | [
"expression.operation.binary.add"
] | 881,230 | 881,231 | u432194969 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.