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 |
|---|---|---|---|---|---|---|---|
p03185 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
long long dp[200005];
pair<lo... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
long long dp[200005];
pair<lo... | [] | 987,537 | 987,538 | u871933975 | cpp |
p03185 | #include <bits/stdc++.h>
using namespace std;
typedef vector<int> VI;
typedef pair<int, int> ii;
typedef long long LL;
typedef pair<LL, int> li;
#define pb push_back
const int INF = 2147483647;
const int N = 200005;
int tab[N], nextt[N], prevv[N], head, tail, i, v, n;
LL res[N], c, T[N];
set<li> Q;
li top;
void add(i... | #include <bits/stdc++.h>
using namespace std;
typedef vector<int> VI;
typedef pair<int, int> ii;
typedef long long LL;
typedef pair<LL, int> li;
#define pb push_back
const int INF = 2147483647;
const int N = 200005;
int tab[N], nextt[N], prevv[N], head, tail, i, v, n;
LL res[N], c, T[N];
set<li> Q;
li top;
void add(i... | [
"control_flow.branch.if.condition.change"
] | 987,557 | 987,558 | u643180062 | cpp |
p03185 | #include <bits/stdc++.h>
using namespace std;
#define x first
#define y second
#define mp make_pair
#define pb push_back
#define sqr(a) ((a) * (a))
#define sz(a) int(a.size())
#define all(a) a.begin(), a.end()
#define forn(i, n) for (int i = 0; i < int(n); i++)
#define fore(i, l, r) for (int i = int(l); i < int(r); i... | #include <bits/stdc++.h>
using namespace std;
#define x first
#define y second
#define mp make_pair
#define pb push_back
#define sqr(a) ((a) * (a))
#define sz(a) int(a.size())
#define all(a) a.begin(), a.end()
#define forn(i, n) for (int i = 0; i < int(n); i++)
#define fore(i, l, r) for (int i = int(l); i < int(r); i... | [
"identifier.change",
"call.arguments.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 987,567 | 987,568 | u406010268 | cpp |
p03185 | #include <cmath>
#include <iostream>
#include <queue>
using namespace std;
using ll = long long;
using ld = long double;
const int MAXN = 2e5 + 5;
ll dp[MAXN], h[MAXN];
ll f(int j, int i) { return dp[j] + (h[i] - h[j]) * (h[i] - h[j]); }
ld intersection(int i, int j) {
return (ld)(f(j, 0) - f(i, 0)) / (2 * (h[j]... | #include <cmath>
#include <iostream>
#include <queue>
using namespace std;
using ll = long long;
using ld = long double;
const int MAXN = 2e5 + 5;
ll dp[MAXN], h[MAXN];
ll f(int j, int i) { return dp[j] + (h[i] - h[j]) * (h[i] - h[j]); }
ld intersection(int i, int j) {
return (ld)(f(j, 0) - f(i, 0)) / (2 * (h[j]... | [
"control_flow.loop.condition.change",
"control_flow.loop.for.condition.change"
] | 987,571 | 987,572 | u973476274 | cpp |
p03185 | #include <cmath>
#include <iostream>
#include <queue>
using namespace std;
using ll = long long;
using ld = long double;
const int MAXN = 2e5 + 5;
ll dp[MAXN], h[MAXN];
ll f(int j, int i) { return dp[j] + (h[i] - h[j]) * (h[i] - h[j]); }
ld intersection(int i, int j) {
return (ld)(f(j, 0) - f(i, 0)) / (2 * (h[j]... | #include <cmath>
#include <iostream>
#include <queue>
using namespace std;
using ll = long long;
using ld = long double;
const int MAXN = 2e5 + 5;
ll dp[MAXN], h[MAXN];
ll f(int j, int i) { return dp[j] + (h[i] - h[j]) * (h[i] - h[j]); }
ld intersection(int i, int j) {
return (ld)(f(j, 0) - f(i, 0)) / (2 * (h[j]... | [
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.loop.condition.change",
"control_flow.loop.for.condition.change"
] | 987,573 | 987,572 | u973476274 | cpp |
p03185 | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define FOR(a, b, c) for (int a = b; a <= c; ++a)
#define pb push_back
#define ll long long
typedef pair<ll, ll> ii;
const int N = 2e5 + 10;
const ll oo = 1e18;
int n;
int a[N];
ll f[N], tmp;
vector<ii> vi;
bool check(ii l1, ii l2, ii ... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define FOR(a, b, c) for (int a = b; a <= c; ++a)
#define pb push_back
#define ll long long
typedef pair<ll, ll> ii;
const int N = 2e5 + 10;
const ll oo = 1e18;
int n;
int a[N];
ll f[N], tmp;
vector<ii> vi;
bool check(ii l1, ii l2, ii ... | [
"assignment.add"
] | 987,585 | 987,586 | u292091954 | cpp |
p03186 | #include <bits/stdc++.h>
#define REP(i, n) for (int(i) = 0; (i) < (int)(n); i++)
#define FOR(i, a, b) for (int(i) = a; (i) < (int)b; i++)
#define RREP(i, n) for (int(i) = ((int)(n)-1); (i) >= 0; i--)
#define RFOR(i, a, b) for (int(i) = ((int)(b)-1); (i) >= (int)a; i--)
#define ALL(v) (v).begin(), (v).end()
#define MOD ... | #include <bits/stdc++.h>
#define REP(i, n) for (int(i) = 0; (i) < (int)(n); i++)
#define FOR(i, a, b) for (int(i) = a; (i) < (int)b; i++)
#define RREP(i, n) for (int(i) = ((int)(n)-1); (i) >= 0; i--)
#define RFOR(i, a, b) for (int(i) = ((int)(b)-1); (i) >= (int)a; i--)
#define ALL(v) (v).begin(), (v).end()
#define MOD ... | [
"expression.operation.binary.add"
] | 987,600 | 987,601 | u852449189 | cpp |
p03186 | #include <bits/stdc++.h>
#define REP(i, n) for (int(i) = 0; (i) < (int)(n); i++)
#define FOR(i, a, b) for (int(i) = a; (i) < (int)b; i++)
#define RREP(i, n) for (int(i) = ((int)(n)-1); (i) >= 0; i--)
#define RFOR(i, a, b) for (int(i) = ((int)(b)-1); (i) >= (int)a; i--)
#define ALL(v) (v).begin(), (v).end()
#define MOD ... | #include <bits/stdc++.h>
#define REP(i, n) for (int(i) = 0; (i) < (int)(n); i++)
#define FOR(i, a, b) for (int(i) = a; (i) < (int)b; i++)
#define RREP(i, n) for (int(i) = ((int)(n)-1); (i) >= 0; i--)
#define RFOR(i, a, b) for (int(i) = ((int)(b)-1); (i) >= (int)a; i--)
#define ALL(v) (v).begin(), (v).end()
#define MOD ... | [
"expression.operation.binary.add"
] | 987,602 | 987,601 | u852449189 | cpp |
p03186 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll a, b, c;
cin >> a >> b >> c;
if (a + b >= c)
cout << b + c << endl;
else
cout << a + b << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll a, b, c;
cin >> a >> b >> c;
if (a + b >= c)
cout << b + c << endl;
else
cout << a + b + 1 + b << endl;
} | [
"expression.operation.binary.add"
] | 987,607 | 987,608 | u470507123 | cpp |
p03186 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll a, b, c;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cin >> a >> b >> c;
if (a + b >= c)
return cout << b + c << endl, 0;
else
return cout << a + b + b << endl, 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll a, b, c;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cin >> a >> b >> c;
if (a + b >= c)
return cout << b + c << endl, 0;
else
return cout << a + b + b + 1 << endl, 0;
} | [
"expression.operation.binary.add"
] | 987,611 | 987,612 | u089230684 | cpp |
p03186 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << B + min(A + B, C) << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << B + min(A + B + 1, C) << endl;
return 0;
}
| [
"expression.operation.binary.add"
] | 987,615 | 987,616 | u469315559 | cpp |
p03186 | #include <algorithm>
#include <cfenv>
#include <climits>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#i... | #include <algorithm>
#include <cfenv>
#include <climits>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#i... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 987,617 | 987,618 | u553461888 | cpp |
p03186 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define FOR(i, a, b) for (int i = a; i < b; ++i)
#define ALL(vec) vec.begin(), vec.end()
#define rALL(vec) vec.rbegin(), vec.rend()
using namespace std;
using ll = long long;
// ------------------------------
int main() {
int A, B, C;
cin >> A ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define FOR(i, a, b) for (int i = a; i < b; ++i)
#define ALL(vec) vec.begin(), vec.end()
#define rALL(vec) vec.rbegin(), vec.rend()
using namespace std;
using ll = long long;
// ------------------------------
int main() {
int A, B, C;
cin >> A ... | [
"assignment.change"
] | 987,621 | 987,622 | u665598835 | cpp |
p03186 | #include <bits/stdc++.h>
// atoi : atoi(変数名.c_str())
// to_string(数値)
// %0桁数d とすると表示桁数が「桁数」に満たない場合に0埋めされる
// find(): int i = 変数名.find(“文字列”) 何番目にあるかを得る
// cout << (条件 ? "Yes" : "No") << endl;
// printf("%02d:%02d:%02d",hour,minute,second);
// 降順 sort(a.begin(),a.end(),greater<int>());
// bitset<ビット数> 変数名; // すべてのビットが... | #include <bits/stdc++.h>
// atoi : atoi(変数名.c_str())
// to_string(数値)
// %0桁数d とすると表示桁数が「桁数」に満たない場合に0埋めされる
// find(): int i = 変数名.find(“文字列”) 何番目にあるかを得る
// cout << (条件 ? "Yes" : "No") << endl;
// printf("%02d:%02d:%02d",hour,minute,second);
// 降順 sort(a.begin(),a.end(),greater<int>());
// bitset<ビット数> 変数名; // すべてのビットが... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 987,625 | 987,626 | u184335045 | cpp |
p03186 | #include <bits/stdc++.h>
#define mod 1000000007
using namespace std;
int dy[4] = {1, 0, -1, 0};
int dx[4] = {0, 1, 0, -1};
vector<vector<int>> graph;
bool sort_sec(const pair<int, int> &a, const pair<int, int> &b) {
if (a.second < b.second) {
return true;
}
return false;
}
void swap(int *a, int *b) {
int ... | #include <bits/stdc++.h>
#define mod 1000000007
using namespace std;
int dy[4] = {1, 0, -1, 0};
int dx[4] = {0, 1, 0, -1};
vector<vector<int>> graph;
bool sort_sec(const pair<int, int> &a, const pair<int, int> &b) {
if (a.second < b.second) {
return true;
}
return false;
}
void swap(int *a, int *b) {
int ... | [
"control_flow.branch.if.condition.change"
] | 987,631 | 987,632 | u150155436 | cpp |
p03186 | #include <algorithm>
#include <cstdio>
using namespace std;
long long a, b, c;
int main() {
scanf("%lld%lld%lld", &a, &b, &c);
printf("%lld", b + min(c, a + b));
return 0;
} | #include <algorithm>
#include <cstdio>
using namespace std;
long long a, b, c;
int main() {
scanf("%lld%lld%lld", &a, &b, &c);
printf("%lld", b + min(a + b + 1, c));
return 0;
} | [
"call.arguments.change",
"call.arguments.add"
] | 987,648 | 987,649 | u022001221 | cpp |
p03186 | #include <bits/stdc++.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++)
typedef long long ll;
#define ALL(v) v.begin(), v.end()
#define vmax(v) *max_element(ALL(v))
#define vmin(v) *min_element(ALL(v))
#define chmax(x, a) x = max(x, a... | #include <bits/stdc++.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++)
typedef long long ll;
#define ALL(v) v.begin(), v.end()
#define vmax(v) *max_element(ALL(v))
#define vmin(v) *min_element(ALL(v))
#define chmax(x, a) x = max(x, a... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 987,650 | 987,651 | u552357043 | cpp |
p03186 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long A, B, C;
cin >> A >> B >> C;
if (C <= B + A) {
cout << C + B << endl;
} else {
cout << A + 2 * B << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long A, B, C;
cin >> A >> B >> C;
if (C <= B + A) {
cout << C + B << endl;
} else {
cout << A + 2 * B + 1 << endl;
}
}
| [
"expression.operation.binary.add"
] | 987,652 | 987,653 | u028061225 | cpp |
p03186 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << min(b + c, b + min(a + b, c + 1));
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << min(b + c, b + min(a + b + 1, c));
}
| [
"call.arguments.change",
"call.arguments.add"
] | 987,654 | 987,655 | u222643545 | cpp |
p03186 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
signed main() {
ll a, b, c;
cin >> a >> b >> c;
if (a + b >= c) {
cout << b + c << "\n";
} else {
cout << a + 2 * b << "\n";
}
return 0;
} | #include <bits/stdc++.h>
#define ll long long
using namespace std;
signed main() {
ll a, b, c;
cin >> a >> b >> c;
if (a + b >= c) {
cout << b + c << "\n";
} else {
cout << a + 2 * b + 1 << "\n";
}
return 0;
} | [
"expression.operation.binary.add"
] | 987,656 | 987,657 | u652908807 | cpp |
p03186 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
signed main() {
ll a, b, c;
cin >> a >> b >> c;
if (a + b >= c) {
cout << b + c << "\n";
} else {
cout << 2 * c - a - 2 * b + 1 << "\n";
}
return 0;
} | #include <bits/stdc++.h>
#define ll long long
using namespace std;
signed main() {
ll a, b, c;
cin >> a >> b >> c;
if (a + b >= c) {
cout << b + c << "\n";
} else {
cout << a + 2 * b + 1 << "\n";
}
return 0;
} | [
"expression.operation.binary.remove",
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 987,658 | 987,657 | u652908807 | cpp |
p03186 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b, c;
cin >> a >> b >> c;
if (a + b >= c + 1)
cout << b + c << endl;
else
cout << a + b * 2 + 1 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b, c;
cin >> a >> b >> c;
if (a + b >= c - 1)
cout << b + c << endl;
else
cout << a + b * 2 + 1 << endl;
}
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 987,661 | 987,662 | u261947526 | cpp |
p03186 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define PRINT(v) \
for (auto x : (V)) \
cout << x << " " << endl;
using namespace ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define PRINT(v) \
for (auto x : (V)) \
cout << x << " " << endl;
using namespace ... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 987,663 | 987,664 | u195132800 | cpp |
p03186 | #include <bits/stdc++.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++)
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a + b + 1 >= c) {
cout << b + c << endl;
} else {
cout << a + b + 1 << endl;
}
} | #include <bits/stdc++.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++)
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a + b + 1 >= c) {
cout << b + c << endl;
} else {
cout << a + b + b + 1 << endl;
}
} | [
"expression.operation.binary.add"
] | 987,665 | 987,666 | u387371565 | cpp |
p03186 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
long long A, B, C;
cin >> A >> B >> C;
if (A + B > C) {
printf("%lld\n", B + C);
} else {
printf("%lld\n", A + B + B + 1);
}
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
long long A, B, C;
cin >> A >> B >> C;
if (A + B >= C) {
printf("%lld\n", B + C);
} else {
printf("%lld\n", A + B + B + 1);
}
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 987,667 | 987,668 | u478462004 | cpp |
p03186 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int i = 0;
int A, B, C;
cin >> A >> B >> C;
int ans = 0;
if (C - (A + B + 1) >= 0) {
... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int i = 0;
int A, B, C;
cin >> A >> B >> C;
int ans = 0;
if (C - (A + B + 1) >= 0) {
... | [
"assignment.change"
] | 987,671 | 987,672 | u249466958 | cpp |
p03186 | #include <bits/stdc++.h>
using namespace std;
int main() {
long A, B, C;
cin >> A >> B >> C;
cout << max((A + B + 1), C) + B << "\n";
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long A, B, C;
cin >> A >> B >> C;
cout << min((A + B + 1), C) + B << "\n";
} | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 987,683 | 987,684 | u045289115 | cpp |
p03186 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll A, B, C;
cin >> A >> B >> C;
ll ans;
if (A + B - 1 >= C)
ans = B + C;
else
ans = (ll)(A + 2 * B + 1);
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll A, B, C;
cin >> A >> B >> C;
ll ans;
if (A + B + 1 >= C)
ans = B + C;
else
ans = (ll)(A + 2 * B + 1);
cout << ans << endl;
}
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 987,685 | 987,686 | u433189059 | cpp |
p03186 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll A, B, C;
cin >> A >> B >> C;
ll ans;
if (A + B - 1 >= C)
ans = B + C;
else
ans = A + 2 * B + 1;
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll A, B, C;
cin >> A >> B >> C;
ll ans;
if (A + B + 1 >= C)
ans = B + C;
else
ans = (ll)(A + 2 * B + 1);
cout << ans << endl;
}
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change",
"call.add",
"call.arguments.change"
] | 987,687 | 987,686 | u433189059 | cpp |
p03186 | #include <bits/stdc++.h>
using namespace std;
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define per(i, n) for (int i = n - 1; i >= 0; ++i)
#define rep1(i, n) for (int i = 1; i <= n; ++i)
#define per1(i, n) for (int i = n; i >= 1; ++i)
... | #include <bits/stdc++.h>
using namespace std;
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define per(i, n) for (int i = n - 1; i >= 0; ++i)
#define rep1(i, n) for (int i = 1; i <= n; ++i)
#define per1(i, n) for (int i = n; i >= 1; ++i)
... | [
"io.output.change"
] | 987,696 | 987,697 | u502312544 | cpp |
p03186 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
ll ans = 0;
if (a + b + 1 >= c)
ans = b + c;
else
ans = a + b + 1;
cout << ans << endl;
}
| #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ll a, b, c;
cin >> a >> b >> c;
ll ans = 0;
if (a + b + 1 >= c)
ans = b + c;
else
ans = a + 2 * b + 1;
cout << ans << endl;
}
| [
"variable_declaration.type.change",
"assignment.change"
] | 987,700 | 987,701 | u747390421 | cpp |
p03186 | #include <iostream>
using namespace std;
int main() {
int A, B, C, D, E;
int ans = 0;
cin >> A >> B >> C;
D = A + B;
if (D < C) {
ans = D + B + 1;
} else {
ans = B + C + 1;
}
cout << ans << '\n';
return 0;
} | #include <iostream>
using namespace std;
int main() {
int A, B, C, D, E;
int ans = 0;
cin >> A >> B >> C;
D = A + B;
if (D < C) {
ans = D + B + 1;
} else {
ans = B + C;
}
cout << ans << '\n';
return 0;
} | [
"expression.operation.binary.remove"
] | 987,706 | 987,707 | u577189232 | cpp |
p03186 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b, c;
cin >> a >> b >> c;
long long ans = 0;
if (a + b >= c) {
ans = b + c;
} else {
ans = a + b + b;
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b, c;
cin >> a >> b >> c;
long long ans = 0;
if (a + b >= c) {
ans = b + c;
} else {
ans = a + b + b + 1;
}
cout << ans << endl;
return 0;
}
| [
"assignment.change"
] | 987,710 | 987,711 | u144029820 | cpp |
p03186 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define ll long long
using namespace std;
int main() {
ll a, b, c;
cin >> a >> b >> c;
if (a + b >= c)
cout << b + c << endl;
else
cout << a + b + b << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define ll long long
using namespace std;
int main() {
ll a, b, c;
cin >> a >> b >> c;
if (a + b >= c)
cout << b + c << endl;
else
cout << a + b + b + 1 << endl;
return 0;
}
| [
"expression.operation.binary.add"
] | 987,712 | 987,713 | u021358975 | cpp |
p03186 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define ll long long
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a + b >= c)
cout << b + c << endl;
else
cout << a + b + b << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define ll long long
using namespace std;
int main() {
ll a, b, c;
cin >> a >> b >> c;
if (a + b >= c)
cout << b + c << endl;
else
cout << a + b + b + 1 << endl;
return 0;
}
| [
"variable_declaration.type.change"
] | 987,714 | 987,713 | u021358975 | cpp |
p03186 | #include <algorithm>
#include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a + b >= c)
cout << b + c << endl;
else
cout << a + 2 * b << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a + b >= c)
cout << b + c << endl;
else
cout << a + 2 * b + 1 << endl;
return 0;
} | [
"expression.operation.binary.add"
] | 987,729 | 987,730 | u648009244 | cpp |
p03186 | #include <bits/stdc++.h>
#define REP(i, n) for (ll i = 0; i < (ll)n; i++)
#define FOR(i, a, b) for (ll i = (a); i < (ll)b; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF (1ll << 60)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
using vl = vector<ll>;
using vvl = vector<vl>;
typede... | #include <bits/stdc++.h>
#define REP(i, n) for (ll i = 0; i < (ll)n; i++)
#define FOR(i, a, b) for (ll i = (a); i < (ll)b; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF (1ll << 60)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
using vl = vector<ll>;
using vvl = vector<vl>;
typede... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 987,731 | 987,732 | u824337972 | cpp |
p03186 | #include <bits/stdc++.h>
#define REP(i, n) for (ll i = 0; i < (ll)n; i++)
#define FOR(i, a, b) for (ll i = (a); i < (ll)b; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF (1ll << 60)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
using vl = vector<ll>;
using vvl = vector<vl>;
typede... | #include <bits/stdc++.h>
#define REP(i, n) for (ll i = 0; i < (ll)n; i++)
#define FOR(i, a, b) for (ll i = (a); i < (ll)b; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF (1ll << 60)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
using vl = vector<ll>;
using vvl = vector<vl>;
typede... | [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 987,733 | 987,732 | u824337972 | cpp |
p03186 | #include <bits/stdc++.h>
#define MOD 1e9 + 7
using namespace std;
#define pp push_back
#define po pop_back
#define mp make_pair
#define clr(a) memset(a, 0, sizeof(a))
#define neg(a) memset(a, -1, sizeof(a))
#define fas(a) memset(a, false, sizeof(a))
#define debug(x) cout << #x << ": " << x << endl
#define debug1(x) cou... | #include <bits/stdc++.h>
#define MOD 1e9 + 7
using namespace std;
#define pp push_back
#define po pop_back
#define mp make_pair
#define clr(a) memset(a, 0, sizeof(a))
#define neg(a) memset(a, -1, sizeof(a))
#define fas(a) memset(a, false, sizeof(a))
#define debug(x) cout << #x << ": " << x << endl
#define debug1(x) cou... | [
"expression.operation.binary.add"
] | 987,738 | 987,739 | u332596718 | cpp |
p03186 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll a, b, c;
cin >> a >> b >> c;
cout << min(a + b, c) + b << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll a, b, c;
cin >> a >> b >> c;
cout << min(a + b + 1, c) + b << endl;
return 0;
} | [
"expression.operation.binary.add"
] | 987,740 | 987,741 | u904123392 | cpp |
p03186 | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a + b >= c + 1) {
cout << b + c;
} else {
cout << a + 2 * b + 1;
}
} | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a + b >= c) {
cout << b + c;
} else {
cout << a + 2 * b + 1;
}
} | [
"expression.operation.binary.remove"
] | 987,748 | 987,749 | u532047586 | cpp |
p03186 | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a + b >= c + 1) {
cout << b + c;
} else {
cout << a + b + 2;
}
} | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a + b >= c) {
cout << b + c;
} else {
cout << a + 2 * b + 1;
}
} | [
"expression.operation.binary.remove",
"literal.number.change",
"io.output.change"
] | 987,750 | 987,749 | u532047586 | cpp |
p03186 | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a + b >= c + 1) {
cout << b + c;
} else {
cout << a + b + 1;
}
} | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a + b >= c) {
cout << b + c;
} else {
cout << a + 2 * b + 1;
}
} | [
"expression.operation.binary.remove"
] | 987,751 | 987,749 | u532047586 | cpp |
p03186 | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
LL a, b, c;
int main() {
scanf("%lld %lld %lld", &a, &b, &c);
printf("%lld\n", b + min(a + b, c));
} | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
LL a, b, c;
int main() {
scanf("%lld %lld %lld", &a, &b, &c);
printf("%lld\n", b + min(a + b + 1, c));
} | [
"expression.operation.binary.add"
] | 987,756 | 987,757 | u527820217 | cpp |
p03186 | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
LL a, b, c;
int main() {
scanf("%lld %lld %lld", &a, &b, &c);
printf("%lld\n", a + b + min(a + b, c));
} | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
LL a, b, c;
int main() {
scanf("%lld %lld %lld", &a, &b, &c);
printf("%lld\n", b + min(a + b + 1, c));
} | [
"expression.operation.binary.remove"
] | 987,758 | 987,757 | u527820217 | cpp |
p03186 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C, ans;
cin >> A >> B >> C;
if (A + B < C + 1)
ans = (A + B + 1) + B;
else
ans = B + C;
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C, ans;
cin >> A >> B >> C;
if (A + B < C - 1)
ans = (A + B + 1) + B;
else
ans = B + C;
cout << ans << endl;
return 0;
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 987,766 | 987,767 | u615178274 | cpp |
p03186 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define co(x) cout << x << endl
#define cs(x) cout << x << " "
#define ALL(a) (a).begin(), (a).end()
#define MOD 1e9 + 7
typedef long long ll;
using namespace std;
int main() {
int a, b, c;
cin >>... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define co(x) cout << x << endl
#define cs(x) cout << x << " "
#define ALL(a) (a).begin(), (a).end()
#define MOD 1e9 + 7
typedef long long ll;
using namespace std;
int main() {
int a, b, c;
cin >>... | [
"expression.operation.binary.add"
] | 987,768 | 987,769 | u984529214 | cpp |
p03186 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b, c;
cin >> a >> b >> c;
if (a + b >= c) {
cout << c + b << endl;
} else if (a + b < c) {
cout << b + c - (a + b) + 1 << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b, c;
cin >> a >> b >> c;
if (a + b >= c) {
cout << c + b << endl;
} else if (a + b < c) {
cout << b + a + b + 1 << endl;
}
}
| [
"expression.operation.binary.remove"
] | 987,778 | 987,779 | u218759384 | cpp |
p03186 | #include "bits/stdc++.h"
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pi;
typedef pair<pair<ll, ll>, ll> pii;
vector<ll> vec;
vector<vector<ll>> vec2;
ll MOD = 1000000007;
int main() {
ll A, B, C;
cin >> A >> B >> C;
ll t_C = C - 1;
ll ans = 0;
if (A + B < C) {
ans = A + 2 * B... | #include "bits/stdc++.h"
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pi;
typedef pair<pair<ll, ll>, ll> pii;
vector<ll> vec;
vector<vector<ll>> vec2;
ll MOD = 1000000007;
int main() {
ll A, B, C;
cin >> A >> B >> C;
ll t_C = C - 1;
ll ans = 0;
if (A + B < C) {
ans = A + 2 * B... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 987,782 | 987,783 | u048791623 | cpp |
p03186 | #include <algorithm> // sort
#include <cstring>
#include <fstream>
#include <iostream>
#include <queue>
#include <vector>
#define REP(i, n) for (long long i = 0; i < (n); i++)
typedef long long ll;
static const ll mod = 1000000007;
static const ll INF = 1000000000000000000LL;
using namespace std;
int main() {
ll a,... | #include <algorithm> // sort
#include <cstring>
#include <fstream>
#include <iostream>
#include <queue>
#include <vector>
#define REP(i, n) for (long long i = 0; i < (n); i++)
typedef long long ll;
static const ll mod = 1000000007;
static const ll INF = 1000000000000000000LL;
using namespace std;
int main() {
ll a,... | [
"assignment.change"
] | 987,784 | 987,785 | u485731913 | cpp |
p03186 |
// include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
... |
// include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 987,788 | 987,789 | u874996917 | cpp |
p03186 | #include <cstdio>
int main() {
long long a, b, c;
scanf("%lld%lld%lld", &a, &b, &c);
if (a + b - 1 >= c) {
printf("%lld\n", b + c);
} else {
printf("%lld\n", (a + b + 1) + b);
}
return 0;
} | #include <cstdio>
int main() {
long long a, b, c;
scanf("%lld%lld%lld", &a, &b, &c);
if (a + b >= c - 1) {
printf("%lld\n", b + c);
} else {
printf("%lld\n", (a + b + 1) + b);
}
return 0;
} | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 987,790 | 987,791 | u931819817 | cpp |
p03186 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int a, b, c;
cin >> a >> b >> c;
int t = b + c;
int v = c - a - b;
if (a + b < c) {
cout << t - v + 1 << endl;
} else {
cout << "t" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int a, b, c;
cin >> a >> b >> c;
int t = b + c;
int v = c - a - b;
if (a + b < c) {
cout << t - v + 1 << endl;
} else {
cout << t << endl;
}
}
| [] | 987,797 | 987,798 | u636605529 | cpp |
p03186 |
#include <algorithm>
#include <functional>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
#include <cstring>
#include <map>
#include <queue>
#include <set>
#include <utility>
using namespace std;
typedef long long LL;
#define dump(c) ... |
#include <algorithm>
#include <functional>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
#include <cstring>
#include <map>
#include <queue>
#include <set>
#include <utility>
using namespace std;
typedef long long LL;
#define dump(c) ... | [
"identifier.change",
"expression.operation.binary.change"
] | 987,803 | 987,804 | u851470173 | cpp |
p03186 |
#include <algorithm>
#include <functional>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
#include <cstring>
#include <map>
#include <queue>
#include <set>
#include <utility>
using namespace std;
typedef long long LL;
#define dump(c) ... |
#include <algorithm>
#include <functional>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
#include <cstring>
#include <map>
#include <queue>
#include <set>
#include <utility>
using namespace std;
typedef long long LL;
#define dump(c) ... | [
"identifier.change",
"expression.operation.binary.change"
] | 987,805 | 987,804 | u851470173 | cpp |
p03186 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
using namespace std;
int main() {
long long a, b, c;
cin >> a >> b >> c;
if (a + b > c) {
cout << b + c << endl;
} else {
cout << b + a + b + 1 << endl;
}
} | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
using namespace std;
int main() {
long long a, b, c;
cin >> a >> b >> c;
if (a + b + 1 >= c) {
cout << b + c << endl;
} else {
cout << b + a + b + 1 << endl;
}
}
| [
"control_flow.branch.if.condition.change"
] | 987,810 | 987,811 | u401900157 | cpp |
p03186 | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define REPr(i, n) for (int i = (n)-1; i >= 0; --i)
#define FORq(i, m, n) for (int i = (m); i <= (n); ++i)
#define FORqr(i, m, n) for (int i = (n); i >= (m); --i)
#define PB push_back
#define M... | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define REPr(i, n) for (int i = (n)-1; i >= 0; --i)
#define FORq(i, m, n) for (int i = (m); i <= (n); ++i)
#define FORqr(i, m, n) for (int i = (n); i >= (m); --i)
#define PB push_back
#define M... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 987,812 | 987,813 | u532894762 | cpp |
p03186 | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define REPr(i, n) for (int i = (n)-1; i >= 0; --i)
#define FORq(i, m, n) for (int i = (m); i <= (n); ++i)
#define FORqr(i, m, n) for (int i = (n); i >= (m); --i)
#define PB push_back
#define M... | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define REPr(i, n) for (int i = (n)-1; i >= 0; --i)
#define FORq(i, m, n) for (int i = (m); i <= (n); ++i)
#define FORqr(i, m, n) for (int i = (n); i >= (m); --i)
#define PB push_back
#define M... | [
"variable_declaration.type.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 987,814 | 987,813 | u532894762 | cpp |
p03186 | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define INF 999999999
#define rep(i, n) for (int i = 0; i < n; i++)
#define pb(n) push_back(n)
#define Sort(n) sort(n.begin(), n.end())
#define Rev(n) reverse(n.begin(), n.end())
#define Out(S) cout << S << endl
#define NeOut(S) cout << S
#define H... | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define INF 999999999
#define rep(i, n) for (int i = 0; i < n; i++)
#define pb(n) push_back(n)
#define Sort(n) sort(n.begin(), n.end())
#define Rev(n) reverse(n.begin(), n.end())
#define Out(S) cout << S << endl
#define NeOut(S) cout << S
#define H... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"expression.operation.binary.change",
"assignment.change"
] | 987,825 | 987,826 | u618604643 | cpp |
p03186 | #include <algorithm>
#include <array>
#include <cmath>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
namespace io ... | #include <algorithm>
#include <array>
#include <cmath>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
namespace io ... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 987,827 | 987,828 | u465699806 | cpp |
p03186 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
ll MOD = pow(10, 9) + 7;
int main()... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
ll MOD = pow(10, 9) + 7;
int main()... | [
"expression.operation.binary.add"
] | 987,831 | 987,832 | u644778646 | cpp |
p03186 | #include <bits/stdc++.h>
int main() {
int a, b, c;
std::cin >> a >> b >> c;
if (a + b > c) {
printf("%d\n", b + c);
} else {
printf("%d\n", b * 2 + a + 1);
}
return 0;
}
| #include <bits/stdc++.h>
int main() {
int a, b, c;
std::cin >> a >> b >> c;
if (a + b >= c) {
printf("%d\n", b + c);
} else {
printf("%d\n", b * 2 + a + 1);
}
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 987,845 | 987,846 | u772588522 | cpp |
p03186 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll A, B, C;
cin >> A >> B >> C;
cout << min(A + B + 1, C + B) << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll A, B, C;
cin >> A >> B >> C;
cout << min(B + A + B + 1, C + B) << endl;
return 0;
}
| [
"expression.operation.binary.add"
] | 987,847 | 987,848 | u027091475 | cpp |
p03186 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
using namespace std;
long long int gcd(long long int x, long long int y) {
return y != 0 ? gcd(y, x % y) : x;
}
long long int lcm(long long int x, long long int y) {
return x * y / gcd(x, y);
}
int main() {
long long i... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
using namespace std;
long long int gcd(long long int x, long long int y) {
return y != 0 ? gcd(y, x % y) : x;
}
long long int lcm(long long int x, long long int y) {
return x * y / gcd(x, y);
}
int main() {
long long i... | [
"control_flow.branch.if.condition.change"
] | 987,857 | 987,858 | u340494803 | cpp |
p03186 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
using namespace std;
long long int gcd(long long int x, long long int y) {
return y != 0 ? gcd(y, x % y) : x;
}
long long int lcm(long long int x, long long int y) {
return x * y / gcd(x, y);
}
int main() {
int i, j, a... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
using namespace std;
long long int gcd(long long int x, long long int y) {
return y != 0 ? gcd(y, x % y) : x;
}
long long int lcm(long long int x, long long int y) {
return x * y / gcd(x, y);
}
int main() {
long long i... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"control_flow.branch.if.condition.change"
] | 987,859 | 987,858 | u340494803 | cpp |
p03186 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
using namespace std;
long long int gcd(long long int x, long long int y) {
return y != 0 ? gcd(y, x % y) : x;
}
long long int lcm(long long int x, long long int y) {
return x * y / gcd(x, y);
}
int main() {
int i, j, a... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
using namespace std;
long long int gcd(long long int x, long long int y) {
return y != 0 ? gcd(y, x % y) : x;
}
long long int lcm(long long int x, long long int y) {
return x * y / gcd(x, y);
}
int main() {
long long i... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"control_flow.branch.if.condition.change"
] | 987,860 | 987,858 | u340494803 | cpp |
p03186 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int eat = a + b;
if (eat > c) {
cout << b + c << endl;
}
if (eat < c) {
cout << b + eat + 1 << endl;
}
if (eat == c) {
cout << eat + 1 << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int eat = a + b;
if (eat > c) {
cout << b + c << endl;
}
if (eat < c) {
cout << b + eat + 1 << endl;
}
if (eat == c) {
cout << b + c << endl;
}
return 0;
}
| [
"identifier.change",
"io.output.change",
"identifier.replace.add",
"literal.replace.remove"
] | 987,863 | 987,864 | u122496126 | cpp |
p03186 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <queue>
#include <set>
#include <vector>
#define debug(x) cerr << #x << '=' << x << endl
#define set0(x) memset(x, 0, sizeof(x))
using namespace std;
typedef long long ll;
typedef... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <queue>
#include <set>
#include <vector>
#define debug(x) cerr << #x << '=' << x << endl
#define set0(x) memset(x, 0, sizeof(x))
using namespace std;
typedef long long ll;
typedef... | [
"expression.operation.binary.add"
] | 987,865 | 987,866 | u054789652 | cpp |
p03186 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int a, b, c;
cin >> a >> b >> c;
if (a + b >= c - 1)
cout << b + c + 1 << endl;
else
cout << a + b * 2 + 1 << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int a, b, c;
cin >> a >> b >> c;
if (a + b >= c - 1)
cout << b + c << endl;
else
cout << a + b * 2 + 1 << endl;
return 0;
} | [
"expression.operation.binary.remove"
] | 987,869 | 987,870 | u088895504 | cpp |
p03186 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int a, b, c;
cin >> a >> b >> c;
if (a + b >= c)
cout << b + c;
else
cout << a + b + 1;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int a, b, c;
cin >> a >> b >> c;
if (a + b + 1 >= c)
cout << b + c;
else
cout << a + (2 * b) + 1;
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 987,873 | 987,874 | u364123307 | cpp |
p03186 | #include <stdio.h>
int main(void) {
int a, b, c;
scanf("%d", &a);
scanf("%d", &b);
scanf("%d", &c);
int ans = 0;
if (a + b == c) {
ans = b + c;
} else if (a + b < c) {
ans = c + b - 1;
} else {
ans = b + c;
}
printf("%d\n", ans);
return 0;
} | #include <stdio.h>
int main(void) {
int a, b, c;
scanf("%d", &a);
scanf("%d", &b);
scanf("%d", &c);
int ans = 0;
if (a + b == c) {
ans = b + c;
} else if (a + b < c) {
ans = a + 1 + b * 2;
} else {
ans = b + c;
}
printf("%d\n", ans);
return 0;
} | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change",
"assignment.change"
] | 987,877 | 987,878 | u015875086 | cpp |
p03186 | #include <iostream>
using namespace std;
int main() {
int a, b, c, ans;
cin >> a >> b >> c;
if (a + b >= c) {
ans = b + c;
} else {
ans = 2 * b + c + 1;
}
cout << ans << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a, b, c, ans;
cin >> a >> b >> c;
if (a + b >= c) {
ans = b + c;
} else {
ans = 2 * b + a + 1;
}
cout << ans << endl;
return 0;
} | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 987,882 | 987,883 | u821416900 | cpp |
p03186 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A + B + 1 >= C)
cout << B + C << endl;
else
cout << A + B + 1 << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A + B + 1 >= C)
cout << B + C << endl;
else
cout << A + B * 2 + 1 << endl;
return 0;
} | [
"expression.operation.binary.add"
] | 987,884 | 987,885 | u239087789 | cpp |
p03186 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <list> //双方向リスト
#include <map> //連想配列
#include <queue>
#include <set> //集合
#include <stack>
#include <string>
#include <vector> //動的配列
typedef long long ll;
using namespace std;
template <class T> ostream &operator<<(ostream &o, const vector<T> &v) ... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <list> //双方向リスト
#include <map> //連想配列
#include <queue>
#include <set> //集合
#include <stack>
#include <string>
#include <vector> //動的配列
typedef long long ll;
using namespace std;
template <class T> ostream &operator<<(ostream &o, const vector<T> &v) ... | [
"expression.operation.binary.add"
] | 987,894 | 987,895 | u652150585 | cpp |
p03186 | #include <algorithm>
#include <bitset>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#in... | #include <algorithm>
#include <bitset>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#in... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 987,898 | 987,899 | u508571192 | cpp |
p03186 | #include <bits/stdc++.h>
using namespace std;
long long a, b, c;
int main() {
cin >> a >> b >> c;
printf("%lld\n", b + min(a + b, c));
return 0;
} | #include <bits/stdc++.h>
using namespace std;
long long a, b, c;
int main() {
cin >> a >> b >> c;
printf("%lld\n", b + min(a + b + 1, c));
return 0;
}
| [
"expression.operation.binary.add"
] | 987,904 | 987,905 | u184802358 | cpp |
p03186 | #include <iostream>
using namespace std;
int n1, n2, n3;
int main() {
cin >> n1;
cin >> n2;
cin >> n3;
if (n1 + n2 >= n3) {
cout << n2 + n3 << endl;
} else {
cout << n2 + n1 + n2 << endl;
}
} | #include <iostream>
using namespace std;
int n1, n2, n3;
int main() {
cin >> n1;
cin >> n2;
cin >> n3;
if (n1 + n2 >= n3) {
cout << n2 + n3 << endl;
} else {
cout << n2 + n1 + n2 + 1 << endl;
}
} | [
"expression.operation.binary.add"
] | 987,908 | 987,909 | u977885542 | cpp |
p03186 | #include <algorithm>
#include <iostream>
#include <map>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
int ans = 0;
if (C + 1 <= A + B) {
ans = B + C;
} else {
ans = (2 * B) + A + 1;
}
cout << ans << endl;
... | #include <algorithm>
#include <iostream>
#include <map>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
int ans = 0;
if (C <= A + B + 1) {
ans = B + C;
} else {
ans = (2 * B) + A + 1;
}
cout << ans << endl;
... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 987,912 | 987,913 | u430797067 | cpp |
p03186 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << min(a + b + 1, c) + max(b, c) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << min(a + b + 1, c) + b << endl;
} | [
"call.remove",
"call.arguments.change"
] | 987,916 | 987,917 | u640800420 | cpp |
p03186 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define mkp make_pair
#define pr(num) cout << num << "\n"
#define max(a, b) ((a) > (b) ? (... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define mkp make_pair
#define pr(num) cout << num << "\n"
#define max(a, b) ((a) > (b) ? (... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 987,920 | 987,921 | u768152935 | cpp |
p03186 | #include <stdio.h>
int main(void) {
int a, b, c;
scanf("%d%d%d", &a, &b, &c);
if (a + b >= c + 1) {
printf("%d", b + c);
} else {
printf("%d", b + b + a + 1);
}
return 0;
}
| #include <stdio.h>
int main(void) {
int a, b, c;
scanf("%d%d%d", &a, &b, &c);
if (a + b >= c - 1) {
printf("%d", b + c);
} else {
printf("%d", b + b + a + 1);
}
return 0;
}
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 987,922 | 987,923 | u211122428 | cpp |
p03186 | #include <stdio.h>
int main(void) {
int a, b, c;
scanf("%d%d%d", &a, &b, &c);
if (a + b >= c + 1) {
printf("%d", b + c);
} else {
printf("%d", b + c + 1);
}
return 0;
} | #include <stdio.h>
int main(void) {
int a, b, c;
scanf("%d%d%d", &a, &b, &c);
if (a + b >= c - 1) {
printf("%d", b + c);
} else {
printf("%d", b + b + a + 1);
}
return 0;
}
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 987,924 | 987,923 | u211122428 | cpp |
p03186 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int mod = 1e9 + 7;
const int inf = (1 << 30) - 1;
const ll infll = (1LL << 61) - 1;
int N, K;
vector<int> u, v;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int main() {
ll a, b, c;
cin >> a >> b >> c;
ll ans = 0;
if (a + b > c... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int mod = 1e9 + 7;
const int inf = (1 << 30) - 1;
const ll infll = (1LL << 61) - 1;
int N, K;
vector<int> u, v;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int main() {
ll a, b, c;
cin >> a >> b >> c;
ll ans = 0;
if (a + b >= ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 987,930 | 987,931 | u394482932 | cpp |
p03186 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll a, b, c;
vector<ll> v;
int main() {
cin >> a >> b >> c;
ll ans = 0;
if (a + b >= c)
ans = b + c;
else
ans = a + 2 * b;
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll a, b, c;
vector<ll> v;
int main() {
cin >> a >> b >> c;
ll ans = 0;
if (a + b >= c)
ans = b + c;
else
ans = a + 2 * b + 1;
cout << ans << endl;
} | [
"assignment.change"
] | 987,932 | 987,933 | u394482932 | cpp |
p03186 | #include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int mod = 1e9 + 7;
int main... | #include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int mod = 1e9 + 7;
int main... | [
"expression.operation.binary.add"
] | 987,936 | 987,937 | u050138914 | cpp |
p03186 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
typedef long long int ll;
int main(int argc, char const *argv[]) {
ll A, B, C;
cin >> A >> B >> C;
if (A + B >= C + 1)
cout << B + C << endl;
else {
cout << B + B + A + 1 <... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
typedef long long int ll;
int main(int argc, char const *argv[]) {
ll A, B, C;
cin >> A >> B >> C;
if (A + B >= C - 1)
cout << B + C << endl;
else {
cout << B + B + A + 1 <... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 987,938 | 987,939 | u280016524 | cpp |
p03186 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
typedef long long int ll;
int main(int argc, char const *argv[]) {
ll A, B, C;
cin >> A >> B >> C;
if (A + B > C)
cout << B + C << endl;
else {
cout << B + B + A + 1 << end... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
typedef long long int ll;
int main(int argc, char const *argv[]) {
ll A, B, C;
cin >> A >> B >> C;
if (A + B >= C - 1)
cout << B + C << endl;
else {
cout << B + B + A + 1 <... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 987,940 | 987,939 | u280016524 | cpp |
p03186 | using namespace std;
#include <iostream>
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << max(A + B + 1, C) + B << endl;
return 0;
}
| using namespace std;
#include <iostream>
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << min(A + B + 1, C) + B << endl;
return 0;
}
| [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 987,944 | 987,945 | u981068718 | cpp |
p03186 | #include <cstdio>
using namespace std;
int main() {
int a, b, c;
int re;
scanf("%d%d%d", &a, &b, &c);
if (a + b + 1 > c) {
re = b + c;
} else {
re = a + b + 1;
}
printf("%d", re);
return 0;
} | #include <cstdio>
using namespace std;
int main() {
int a, b, c;
int re;
scanf("%d%d%d", &a, &b, &c);
if (a + b + 1 > c) {
re = b + c;
} else {
re = a + b + 1 + b;
}
printf("%d", re);
return 0;
} | [
"assignment.change"
] | 987,948 | 987,949 | u590088474 | cpp |
p03186 | #include <bits/stdc++.h>
using namespace std;
using int32 = int_fast32_t;
using uint32 = uint_fast32_t;
using int64 = int_fast64_t;
using uint64 = uint_fast64_t;
using pi = pair<int32, int32>;
using pll = pair<int64, int64>;
using vi = vector<int32>;
using vvi = vector<vector<int32>>;
using vll = vector<int64>;
using l... | #include <bits/stdc++.h>
using namespace std;
using int32 = int_fast32_t;
using uint32 = uint_fast32_t;
using int64 = int_fast64_t;
using uint64 = uint_fast64_t;
using pi = pair<int32, int32>;
using pll = pair<int64, int64>;
using vi = vector<int32>;
using vvi = vector<vector<int32>>;
using vll = vector<int64>;
using l... | [
"expression.operation.binary.add"
] | 987,950 | 987,951 | u572532976 | cpp |
p03186 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a + b >= c)
cout << a + b + c << endl;
else
cout << a + 2 * b + 1 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a + b >= c)
cout << b + c << endl;
else
cout << a + 2 * b + 1 << endl;
}
| [
"expression.operation.binary.remove"
] | 987,954 | 987,955 | u546943614 | cpp |
p03186 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a + b >= c)
cout << a + b + c << endl;
else
cout << 2 * a + b + 1 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a + b >= c)
cout << b + c << endl;
else
cout << a + 2 * b + 1 << endl;
}
| [
"expression.operation.binary.remove"
] | 987,956 | 987,955 | u546943614 | cpp |
p03186 | #include <iostream>
#include <string>
using namespace std;
int main(void) {
int A, B, C;
cin >> A >> B >> C;
if (C <= A + B) {
cout << B + C << endl;
} else {
cout << A + B + 3 << endl;
}
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main(void) {
int A, B, C;
cin >> A >> B >> C;
if (C <= A + B + 1) {
cout << B + C << endl;
} else {
cout << B + A + B + 1 << endl;
}
return 0;
} | [
"control_flow.branch.if.condition.change",
"literal.number.change",
"io.output.change"
] | 987,957 | 987,958 | u813840685 | cpp |
p03186 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << min(a + 2 * b - 1, b + c) << endl;
} | #include <cmath>
#include <iostream>
using namespace std;
int main() {
long a, b, c;
cin >> a >> b >> c;
cout << min(a + 2 * b + 1, b + c) << endl;
} | [
"variable_declaration.type.primitive.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 987,968 | 987,967 | u599267194 | cpp |
p03186 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << min(a + 2 * b, b + c);
} | #include <cmath>
#include <iostream>
using namespace std;
int main() {
long a, b, c;
cin >> a >> b >> c;
cout << min(a + 2 * b + 1, b + c) << endl;
} | [
"variable_declaration.type.primitive.change",
"io.output.newline.add"
] | 987,970 | 987,967 | u599267194 | cpp |
p03186 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << b + min(a + b, c);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << b + min(1 + a + b, c);
return 0;
} | [
"expression.operation.binary.add"
] | 987,979 | 987,980 | u158165654 | cpp |
p03186 | #include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-ffloat-store")
#pragma GCC optimize("-fno-defer-pop")
#define ll long long int
#define ps push_back
#define fs first
#define sc second
#define mkp make_pair
#define mod 1000000007
int ... | #include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-ffloat-store")
#pragma GCC optimize("-fno-defer-pop")
#define ll long long int
#define ps push_back
#define fs first
#define sc second
#define mkp make_pair
#define mod 1000000007
int ... | [
"assignment.change"
] | 987,984 | 987,985 | u838261804 | cpp |
p03186 | #include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-ffloat-store")
#pragma GCC optimize("-fno-defer-pop")
#define ll long long int
#define ps push_back
#define fs first
#define sc second
#define mkp make_pair
#define mod 1000000007
int ... | #include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-ffloat-store")
#pragma GCC optimize("-fno-defer-pop")
#define ll long long int
#define ps push_back
#define fs first
#define sc second
#define mkp make_pair
#define mod 1000000007
int ... | [
"assignment.value.change",
"expression.operation.binary.change"
] | 987,987 | 987,985 | u838261804 | cpp |
p03186 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
typedef unsigned long long ULL;
int main() {
int a, b, c;
std::cin >> a >> b >> c;
if (a == b == c == 0) {
std::cout << 0 << std::endl;
} else if (a + b + 1 >= c) {
std::cout << b + c << std... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
typedef unsigned long long ULL;
int main() {
int a, b, c;
std::cin >> a >> b >> c;
if (a == 0 && b == 0 && c == 0) {
std::cout << 0 << std::endl;
} else if (a + b + 1 >= c) {
std::cout << b ... | [
"control_flow.branch.if.condition.change"
] | 987,988 | 987,989 | u085117197 | cpp |
p03186 | #include <iostream>
#include <string>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (c <= a + b) {
cout << c + b;
} else {
cout << a + b + b;
}
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (c <= a + b + 1) {
cout << c + b;
} else {
cout << a + b + b + 1;
}
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 987,994 | 987,995 | u932076037 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.