problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k ⌀ | fixed_code stringlengths 12 526k ⌀ | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M ⌀ | fixed_submission_id int64 2 1.54M ⌀ | user_id stringlengths 10 10 ⌀ | language stringclasses 9
values |
|---|---|---|---|---|---|---|---|
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<long long, long long> deq[200005];
long long h[200005];
int main() {
int n;
long long C;
cin >> n >> C;
for (int i = 0; i < n; i++)
cin >> h[i];
dp[h[0]] = 0;
int l = 0, r = 0;
deq[0] = make_pair(h[0], dp[0] + h[0] * h[0]);
for (int i = 1; i < n; i++) {
while (r >= l + 1 && deq[l + 1].second - deq[l].second <=
2 * h[i] * (deq[l + 1].first - deq[l].first))
l++;
dp[i] = deq[l].second + h[i] * h[i] - 2 * h[i] * deq[l].first + C;
long long x = h[i], y = dp[i] + h[i] * h[i];
while (r >= l + 1 &&
(y - deq[r - 1].second) * (deq[r].first - deq[r - 1].first) <=
(deq[r].second - deq[r - 1].second) * (x - deq[r - 1].first))
r--;
deq[++r] = make_pair(x, y);
}
cout << dp[n - 1];
} | #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<long long, long long> deq[200005];
long long h[200005];
int main() {
int n;
long long C;
cin >> n >> C;
for (int i = 0; i < n; i++)
cin >> h[i];
dp[0] = 0;
int l = 0, r = 0;
deq[0] = make_pair(h[0], dp[0] + h[0] * h[0]);
for (int i = 1; i < n; i++) {
while (r >= l + 1 && deq[l + 1].second - deq[l].second <=
2 * h[i] * (deq[l + 1].first - deq[l].first))
l++;
dp[i] = deq[l].second + h[i] * h[i] - 2 * h[i] * deq[l].first + C;
long long x = h[i], y = dp[i] + h[i] * h[i];
while (r >= l + 1 &&
(y - deq[r - 1].second) * (deq[r].first - deq[r - 1].first) <=
(deq[r].second - deq[r - 1].second) * (x - deq[r - 1].first))
r--;
// cout<<r<<endl;
deq[++r] = make_pair(x, y);
}
cout << dp[n - 1];
} | [] | 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(int v1, int v2) {
int dh = tab[v2] - tab[v1];
LL r1 = dh * 1LL * dh + res[v1];
LL r2 = res[v2];
LL cc;
if (r2 <= r1)
cc = 0;
else {
cc = (r2 - r1) / (2 * dh);
if ((r2 - r1) % dh > 0)
cc++;
}
T[v1] = tab[v2] + cc;
Q.insert(li(T[v1], -v1));
// printf("insert for %d = %lld\n", v1, T[v1]);
}
void rem(int v) {
if (nextt[v] != -1) {
prevv[nextt[v]] = prevv[v];
Q.erase(li(T[v], -v));
}
if (prevv[v] != -1) {
nextt[prevv[v]] = nextt[v];
Q.erase(li(T[prevv[v]], -prevv[v]));
}
if (prevv[v] != -1 && nextt[v] != -1)
add(prevv[v], nextt[v]);
if (head == v)
head = nextt[v];
if (tail == v)
tail = prevv[v];
nextt[v] = prevv[v] = -1;
}
int main() {
scanf("%d %lld", &n, &c);
for (i = 1; i <= n; i++)
scanf("%d", &tab[i]);
res[1] = 0;
nextt[1] = prevv[1] = -1;
head = 1;
tail = 1;
for (i = 2; i <= n; i++)
Q.insert(li(tab[i], i));
while (!Q.empty()) {
top = *Q.begin();
Q.erase(Q.begin());
v = top.second;
// cout << v << endl;
if (v > 0) {
res[v] =
res[head] + (tab[v] - tab[head]) * 1LL * (tab[v] - tab[head]) + c;
// printf("res[%d] = %lld\n", v, res[v]);
nextt[tail] = v;
nextt[v] = -1;
prevv[v] = tail;
tail = v;
add(prevv[v], v);
} else {
rem(-v);
}
}
printf("%lld\n", res[n]);
} | #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(int v1, int v2) {
int dh = tab[v2] - tab[v1];
LL r1 = dh * 1LL * dh + res[v1];
LL r2 = res[v2];
LL cc;
if (r2 <= r1)
cc = 0;
else {
cc = (r2 - r1) / (2 * dh);
if ((r2 - r1) % (2 * dh) > 0)
cc++;
}
T[v1] = tab[v2] + cc;
Q.insert(li(T[v1], -v1));
// printf("insert for %d = %lld\n", v1, T[v1]);
}
void rem(int v) {
if (nextt[v] != -1) {
prevv[nextt[v]] = prevv[v];
Q.erase(li(T[v], -v));
}
if (prevv[v] != -1) {
nextt[prevv[v]] = nextt[v];
Q.erase(li(T[prevv[v]], -prevv[v]));
}
if (prevv[v] != -1 && nextt[v] != -1)
add(prevv[v], nextt[v]);
if (head == v)
head = nextt[v];
if (tail == v)
tail = prevv[v];
nextt[v] = prevv[v] = -1;
}
int main() {
scanf("%d %lld", &n, &c);
for (i = 1; i <= n; i++)
scanf("%d", &tab[i]);
res[1] = 0;
nextt[1] = prevv[1] = -1;
head = 1;
tail = 1;
for (i = 2; i <= n; i++)
Q.insert(li(tab[i], i));
while (!Q.empty()) {
top = *Q.begin();
Q.erase(Q.begin());
v = top.second;
// cout << v << endl;
if (v > 0) {
res[v] =
res[head] + (tab[v] - tab[head]) * 1LL * (tab[v] - tab[head]) + c;
// printf("res[%d] = %lld\n", v, res[v]);
nextt[tail] = v;
nextt[v] = -1;
prevv[v] = tail;
tail = v;
add(prevv[v], v);
} else {
rem(-v);
}
}
printf("%lld\n", res[n]);
} | [
"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++)
typedef long long li;
typedef long double ld;
typedef pair<int, int> pt;
typedef pair<li, li> pli;
template <class A, class B>
ostream &operator<<(ostream &out, const pair<A, B> &a) {
return out << "(" << a.x << ", " << a.y << ")";
}
template <class A> ostream &operator<<(ostream &out, const vector<A> &v) {
out << "[";
forn(i, sz(v)) {
if (i)
out << ", ";
out << v[i];
}
return out << "]";
}
mt19937 rnd(time(NULL));
const int INF = int(1e9);
const li INF64 = li(4e18);
const int MOD = INF + 7;
const ld EPS = 1e-9;
const ld PI = acos(-1.0);
const int N = 200 * 1000 + 13;
const int M = 1000 * 1000 + 13;
int n;
li c;
int a[N];
bool read() {
if (scanf("%d%lld", &n, &c) != 2)
return false;
forn(i, n) scanf("%d", &a[i]);
return true;
}
li dp[N];
pli t[4 * M];
pli get(int x) { return mp(-2 * a[x], dp[x] + sqr(li(a[x]))); }
void build(int v, int l, int r) {
t[v] = mp(0, INF64);
if (l == r - 1)
return;
int m = (l + r) / 2;
build(v * 2, l, m);
build(v * 2 + 1, m, r);
}
li f(pli f, int x) { return f.x * x + f.y; }
void upd(int v, int l, int r, pli fx) {
int m = (l + r) / 2;
bool b1 = f(fx, l) < f(t[v], l);
bool b2 = f(fx, m) < f(t[v], m);
if (b2)
swap(t[v], fx);
if (l == r - 1)
return;
else if (b1 != b2)
upd(v * 2, l, m, fx);
else
upd(v * 2 + 1, m, r, fx);
}
li get(int v, int l, int r, int x) {
if (l == r - 1)
return f(t[v], x);
int m = (l + r) / 2;
if (x < m)
return min(f(t[v], x), get(v * 2, l, m, x));
else
return min(f(t[v], x), get(v * 2 + 1, m, r, x));
}
void solve() {
build(1, 0, n);
upd(1, 0, n, get(0));
fore(i, 1, n) {
dp[i] = get(1, 0, n, a[i]) + c + sqr(li(a[i]));
upd(1, 0, n, get(i));
}
printf("%lld\n", dp[n - 1]);
}
int main() {
#ifdef _DEBUG
freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
int tt = clock();
#endif
cerr.precision(15);
cout.precision(15);
cerr << fixed;
cout << fixed;
while (read()) {
solve();
#ifdef _DEBUG
cerr << "TIME = " << clock() - tt << endl;
tt = clock();
#endif
}
} | #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++)
typedef long long li;
typedef long double ld;
typedef pair<int, int> pt;
typedef pair<li, li> pli;
template <class A, class B>
ostream &operator<<(ostream &out, const pair<A, B> &a) {
return out << "(" << a.x << ", " << a.y << ")";
}
template <class A> ostream &operator<<(ostream &out, const vector<A> &v) {
out << "[";
forn(i, sz(v)) {
if (i)
out << ", ";
out << v[i];
}
return out << "]";
}
mt19937 rnd(time(NULL));
const int INF = int(1e9);
const li INF64 = li(4e18);
const int MOD = INF + 7;
const ld EPS = 1e-9;
const ld PI = acos(-1.0);
const int N = 200 * 1000 + 13;
const int M = 1000 * 1000 + 13;
int n;
li c;
int a[N];
bool read() {
if (scanf("%d%lld", &n, &c) != 2)
return false;
forn(i, n) scanf("%d", &a[i]);
return true;
}
li dp[N];
pli t[4 * M];
pli get(int x) { return mp(-2 * a[x], dp[x] + sqr(li(a[x]))); }
void build(int v, int l, int r) {
t[v] = mp(0, INF64);
if (l == r - 1)
return;
int m = (l + r) / 2;
build(v * 2, l, m);
build(v * 2 + 1, m, r);
}
li f(pli f, int x) { return f.x * x + f.y; }
void upd(int v, int l, int r, pli fx) {
int m = (l + r) / 2;
bool b1 = f(fx, l) < f(t[v], l);
bool b2 = f(fx, m) < f(t[v], m);
if (b2)
swap(t[v], fx);
if (l == r - 1)
return;
else if (b1 != b2)
upd(v * 2, l, m, fx);
else
upd(v * 2 + 1, m, r, fx);
}
li get(int v, int l, int r, int x) {
if (l == r - 1)
return f(t[v], x);
int m = (l + r) / 2;
if (x < m)
return min(f(t[v], x), get(v * 2, l, m, x));
else
return min(f(t[v], x), get(v * 2 + 1, m, r, x));
}
void solve() {
build(1, 0, M);
upd(1, 0, M, get(0));
fore(i, 1, n) {
dp[i] = get(1, 0, M, a[i]) + c + sqr(li(a[i]));
upd(1, 0, M, get(i));
}
printf("%lld\n", dp[n - 1]);
}
int main() {
#ifdef _DEBUG
freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
int tt = clock();
#endif
cerr.precision(15);
cout.precision(15);
cerr << fixed;
cout << fixed;
while (read()) {
solve();
#ifdef _DEBUG
cerr << "TIME = " << clock() - tt << endl;
tt = clock();
#endif
}
} | [
"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] - h[i]));
// return (ld) ((h[j] * h[j] + dp[j]) - h[i] * h[i] - dp[i]) / (2 * (h[j] -
// h[i]));
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n;
ll C;
cin >> n >> C;
for (int i = 1; i <= n; i++) {
cin >> h[i];
}
deque<int> Q = {1};
for (int i = 2; i <= n; i++) {
while (Q.size() > 1 and intersection(Q[1], Q[0]) < i) {
Q.pop_front();
}
dp[i] = f(Q[0], i) + C;
while (Q.size() > 1 and intersection(Q[Q.size() - 2], i) <=
intersection(Q[Q.size() - 2], Q.back())) {
Q.pop_back();
}
Q.push_back(i);
}
cout << dp[n] << "\n";
}
| #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] - h[i]));
// return (ld) ((h[j] * h[j] + dp[j]) - h[i] * h[i] - dp[i]) / (2 * (h[j] -
// h[i]));
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n;
ll C;
cin >> n >> C;
for (int i = 1; i <= n; i++) {
cin >> h[i];
}
deque<int> Q = {1};
for (int i = 2; i <= n; i++) {
while (Q.size() > 1 and intersection(Q[1], Q[0]) < h[i]) {
Q.pop_front();
}
dp[i] = f(Q[0], i) + C;
while (Q.size() > 1 and intersection(Q[Q.size() - 2], i) <=
intersection(Q[Q.size() - 2], Q.back())) {
Q.pop_back();
}
Q.push_back(i);
}
cout << dp[n] << "\n";
}
| [
"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] - h[i]));
// return (ld) ((h[j] * h[j] + dp[j]) - h[i] * h[i] - dp[i]) / (2 * (h[j] -
// h[i]));
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n;
ll C;
cin >> n >> C;
for (int i = 1; i <= n; i++) {
cin >> h[i];
}
deque<int> Q = {1};
for (int i = 2; i <= n; i++) {
while (Q.size() > 1 and intersection(Q[0], Q[1]) < i) {
Q.pop_front();
}
dp[i] = f(Q[0], i) + C;
while (Q.size() > 1 and intersection(Q[Q.size() - 2], i) <=
intersection(Q[Q.size() - 2], Q.back())) {
Q.pop_back();
}
Q.push_back(i);
}
cout << dp[n] << "\n";
}
| #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] - h[i]));
// return (ld) ((h[j] * h[j] + dp[j]) - h[i] * h[i] - dp[i]) / (2 * (h[j] -
// h[i]));
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n;
ll C;
cin >> n >> C;
for (int i = 1; i <= n; i++) {
cin >> h[i];
}
deque<int> Q = {1};
for (int i = 2; i <= n; i++) {
while (Q.size() > 1 and intersection(Q[1], Q[0]) < h[i]) {
Q.pop_front();
}
dp[i] = f(Q[0], i) + C;
while (Q.size() > 1 and intersection(Q[Q.size() - 2], i) <=
intersection(Q[Q.size() - 2], Q.back())) {
Q.pop_back();
}
Q.push_back(i);
}
cout << dp[n] << "\n";
}
| [
"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 l3) {
return 1ll * (l3.se - l1.se) * (l1.fi - l2.fi) <=
1ll * (l1.fi - l3.fi) * (l2.se - l1.se);
}
void add(ll A, ll B) {
vi.pb(ii(A, B));
int cnt = vi.size();
while (vi.size() >= 3 && check(vi[cnt - 3], vi[cnt - 2], vi[cnt - 1])) {
auto cur = vi.back();
vi.pop_back();
vi.pop_back();
vi.pb(cur);
}
}
ll get(ll val) {
int l = 0, r = vi.size() - 1;
while (r > l) {
int mid = (l + r) / 2;
if (mid == vi.size() - 1 ||
1.00 * val <= 1.00 * (vi[mid + 1].se - vi[mid].se) /
(double)(vi[mid].fi - vi[mid + 1].fi))
r = mid;
else
l = mid + 1;
}
return 1ll * (vi[l].fi * val + vi[l].se);
}
signed main() {
// freopen("test.inp", "r", stdin);
scanf("%d%lld", &n, &tmp);
FOR(i, 1, n) scanf("%d", &a[i]);
add(-2ll * a[1], 1ll * a[1] * a[1]);
FOR(i, 2, n) {
f[i] = 1ll * a[i] * a[i] + get(a[i]) + tmp;
add(-2ll * a[i], f[i] + 1ll * a[i] * a[i]);
}
printf("%lld", f[n]);
}
| #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 l3) {
return 1ll * (l3.se - l1.se) * (l1.fi - l2.fi) <=
1ll * (l1.fi - l3.fi) * (l2.se - l1.se);
}
void add(ll A, ll B) {
vi.pb(ii(A, B));
int cnt = vi.size();
while (vi.size() >= 3 && check(vi[cnt - 3], vi[cnt - 2], vi[cnt - 1])) {
auto cur = vi.back();
vi.pop_back();
vi.pop_back();
vi.pb(cur);
cnt -= 1;
}
}
ll get(ll val) {
int l = 0, r = vi.size() - 1;
while (r > l) {
int mid = (l + r) / 2;
if (mid == vi.size() - 1 ||
1.00 * val <= 1.00 * (vi[mid + 1].se - vi[mid].se) /
(double)(vi[mid].fi - vi[mid + 1].fi))
r = mid;
else
l = mid + 1;
}
return 1ll * (vi[l].fi * val + vi[l].se);
}
signed main() {
// freopen("test.inp", "r", stdin);
scanf("%d%lld", &n, &tmp);
FOR(i, 1, n) scanf("%d", &a[i]);
add(-2ll * a[1], 1ll * a[1] * a[1]);
FOR(i, 2, n) {
f[i] = 1ll * a[i] * a[i] + get(a[i]) + tmp;
add(-2ll * a[i], f[i] + 1ll * a[i] * a[i]);
}
printf("%lld", f[n]);
}
| [
"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 1000000007
#define FI first
#define SE second
#define MP make_pair
#define PB push_back
#define SZ(x) (int)x.size()
#define SP(x) setprecision((int)x)
using namespace std;
typedef long long ll;
typedef vector<int> vint;
typedef vector<vint> vvint;
typedef vector<string> vstr;
typedef pair<int, int> pii;
const int INF = 1e9;
const ll LINF = 1e18;
const double EPS = 1e-9;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; } //最大公約数
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; } //最小公倍数
int main() {
ll a, b, c;
cin >> a >> b >> c;
if (c <= a + b) {
cout << b + c << endl;
} else {
cout << b * 2 + a << endl;
}
return 0;
}
| #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 1000000007
#define FI first
#define SE second
#define MP make_pair
#define PB push_back
#define SZ(x) (int)x.size()
#define SP(x) setprecision((int)x)
using namespace std;
typedef long long ll;
typedef vector<int> vint;
typedef vector<vint> vvint;
typedef vector<string> vstr;
typedef pair<int, int> pii;
const int INF = 1e9;
const ll LINF = 1e18;
const double EPS = 1e-9;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; } //最大公約数
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; } //最小公倍数
int main() {
ll a, b, c;
cin >> a >> b >> c;
if (c <= a + b) {
cout << b + c << endl;
} else {
cout << b * 2 + a + 1 << endl;
}
return 0;
}
| [
"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 1000000007
#define FI first
#define SE second
#define MP make_pair
#define PB push_back
#define SZ(x) (int)x.size()
#define SP(x) setprecision((int)x)
using namespace std;
typedef long long ll;
typedef vector<int> vint;
typedef vector<vint> vvint;
typedef vector<string> vstr;
typedef pair<int, int> pii;
const int INF = 1e9;
const ll LINF = 1e18;
const double EPS = 1e-9;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; } //最大公約数
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; } //最小公倍数
int main() {
ll a, b, c;
cin >> a >> b >> c;
if (c <= a + b) {
cout << b + c << endl;
} else {
cout << b * 2 << endl;
}
return 0;
}
| #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 1000000007
#define FI first
#define SE second
#define MP make_pair
#define PB push_back
#define SZ(x) (int)x.size()
#define SP(x) setprecision((int)x)
using namespace std;
typedef long long ll;
typedef vector<int> vint;
typedef vector<vint> vvint;
typedef vector<string> vstr;
typedef pair<int, int> pii;
const int INF = 1e9;
const ll LINF = 1e18;
const double EPS = 1e-9;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; } //最大公約数
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; } //最小公倍数
int main() {
ll a, b, c;
cin >> a >> b >> c;
if (c <= a + b) {
cout << b + c << endl;
} else {
cout << b * 2 + a + 1 << endl;
}
return 0;
}
| [
"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>
#include <vector>
#define ll long long
#define rep(i, s, n) for (ll i = (ll)(s); i < (ll)(n); i++)
#define rrep(i, s, n) for (ll i = (ll)(s); i > (ll)(n); i--)
#define all(a) (a).begin(), a.end()
#define rall(a) (a).rbegin(), (a).rend()
#define PI 3.14159265359
#define mod 1000000007
#define P pair<ll, ll>
#define V vector<ll>
#define C vector<char>
#define B vector<bool>
#define endl '\n'
const ll MAX = 510000;
const ll MOD = 1000000007;
using namespace std;
using graph = vector<vector<ll>>;
struct edge {
//辺の重みを管理できるような構造体
//コンストラクタによって簡単に値を入れられるようにしている
// operatorは辺の重みでソート出来るようにしている
ll from, to;
ll cost;
ll capa;
edge(ll s, ll d) : from(s), to(d) {
cost = 0;
capa = 0;
}
edge(ll s, ll d, ll w) : from(s), to(d), cost(w) { capa = 0; }
edge(ll s, ll d, ll x, ll y) : from(s), to(d), cost(x), capa(y) {}
bool operator<(const edge &x) const { return cost < x.cost; }
};
using Graph = vector<vector<edge>>; //重み付きグラフ
//ダイクストラ法
vector<ll> Dijkstra(ll i, vector<vector<edge>> Graph) {
// i:始点
// Graph:重み付きグラフ
ll n = Graph.size();
vector<ll> d(n, LONG_MAX);
d[i] = 0;
priority_queue<pair<ll, ll>, // pair型
vector<pair<ll, ll>>, //内部コンテナ
greater<pair<ll, ll>> //昇順
>
q;
q.push({0, i}); //第一引数:コスト 第二引数:頂点
while (!q.empty()) {
pair<ll, ll> p = q.top();
q.pop();
int v = p.second;
if (d[v] < p.first) {
continue;
}
for (auto x : Graph[v]) {
if (d[x.to] > d[v] + x.cost) {
d[x.to] = d[v] + x.cost;
q.push({d[x.to], x.to});
}
}
}
return d;
}
ll fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void cominit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// mod. m での a の逆元 a^{-1} を計算する
ll modinv(ll a, ll m) {
ll b = m, u = 1, v = 0;
while (b) {
ll t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
// 二項係数計算nCk,n<=10^7,k<=10^7まで
ll com(ll n, ll k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
//二項係数nCk,n<=10^9,k<=10^7まで
ll com2(ll n, ll k) {
ll res, bs = 1, bb = 1;
for (ll i = 0; i < k; i++) {
bs = (bs * (n - i)) % mod;
bb = (bb * (i + 1)) % mod;
}
res = modinv(bb, mod) % mod;
res = (res * bs) % mod;
return res;
}
// 二項係数計算nPk
ll per(ll n, ll k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[n - k] % MOD) % MOD;
}
/* ユークリッドの互除法 最大公約数*/
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
/*最小公倍数*/
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
/*二点間の距離*/
double dist(pair<double, double> a, pair<double, double> b) {
return sqrt(pow((a.first - b.first), 2) + pow((a.second - b.second), 2));
}
//繰り返し自乗法
double ism(double aa, ll p) {
double ap = aa;
double ans = 1;
while (p > 0) {
// cout<<"p="<<p<<",ap="<<ap<<endl;
if (p & 1) { //奇数が真
ans *= ap;
}
p /= 2;
ap = ap * ap;
}
return ans;
}
//繰り返し自乗法(アマリトリバージョン)
ll ismm(ll aa, ll p) {
ll ap = aa;
ll ans = 1;
while (p > 0) {
// cout<<"p="<<p<<",ap="<<ap<<endl;
if (p & 1) { //奇数が真
ans = (ans * ap) % mod;
}
p /= 2;
ap = (ap * ap) % mod;
}
return ans;
}
ll oddXOR(ll a) { return (a + 1) / 2 % 2; }
ll XOR(ll a) {
if (a % 2 == 1)
return oddXOR(a);
else
return oddXOR(a + 1) ^ (a + 1);
}
double median(V a) { //中央値
sort(all(a));
if (a.size() % 2 == 1) {
return a[(a.size() - 1) / 2];
} else {
return (a[(a.size() - 1) / 2] + a[(a.size() - 1) / 2 + 1]) / 2.0;
}
}
struct UnionFind {
vector<ll> par;
UnionFind(ll n) : par(n, -1) {}
ll root(ll x) {
if (par[x] < 0)
return x;
else
return par[x] = root(par[x]);
}
bool issame(ll x, ll y) { return root(x) == root(y); }
bool merge(ll x, ll y) {
x = root(x);
y = root(y);
if (x == y)
return false;
if (par[x] > par[y])
swap(x, y); // merge techniiue
par[x] += par[y];
par[y] = x;
return true;
}
ll size(ll x) { return -par[root(x)]; }
};
// 10の9乗+7でmodをとる
template <std::uint_fast64_t Modulus> class modint {
using u64 = std::uint_fast64_t;
public:
u64 a;
constexpr modint(const u64 x = 0) noexcept : a(x % Modulus) {}
constexpr u64 &value() noexcept { return a; }
constexpr const u64 &value() const noexcept { return a; }
constexpr modint operator+(const modint rhs) const noexcept {
return modint(*this) += rhs;
}
constexpr modint operator-(const modint rhs) const noexcept {
return modint(*this) -= rhs;
}
constexpr modint operator*(const modint rhs) const noexcept {
return modint(*this) *= rhs;
}
constexpr modint operator/(const modint rhs) const noexcept {
return modint(*this) /= rhs;
}
constexpr modint &operator++(auto) noexcept {
++a;
if (a >= Modulus) {
a -= Modulus;
}
return *this;
}
constexpr modint &operator--(auto) noexcept {
--a;
if (a < 0) {
a += Modulus;
}
return *this;
}
constexpr modint &operator+=(const modint rhs) noexcept {
a += rhs.a;
if (a >= Modulus) {
a -= Modulus;
}
return *this;
}
constexpr modint &operator-=(const modint rhs) noexcept {
if (a < rhs.a) {
a += Modulus;
}
a -= rhs.a;
return *this;
}
constexpr modint &operator*=(const modint rhs) noexcept {
a = a * rhs.a % Modulus;
return *this;
}
constexpr modint &operator/=(modint rhs) noexcept {
u64 exp = Modulus - 2;
while (exp) {
if (exp % 2) {
*this *= rhs;
}
rhs *= rhs;
exp /= 2;
}
return *this;
}
};
//素因数分解の関数
vector<pair<long long, long long>> prime_factorize(long long N) {
vector<pair<long long, long long>> res;
for (long long a = 2; a * a <= N; ++a) {
if (N % a != 0)
continue;
long long ex = 0; // 指数
// 割れる限り割り続ける
while (N % a == 0) {
++ex;
N /= a;
}
// その結果を push
res.push_back({a, ex});
}
// 最後に残った数について
if (N != 1)
res.push_back({N, 1});
return res;
}
//約数列挙
vector<long long> enum_divisors(long long N) {
vector<long long> res;
for (long long i = 1; i * i <= N; ++i) {
if (N % i == 0) {
res.push_back(i);
// 重複しないならば i の相方である N/i も push
if (N / i != i) {
res.push_back(N / i);
}
}
}
// 小さい順に並び替える
sort(res.begin(), res.end());
return res;
}
//桁数
ll Keta(ll x) {
ll cnt = 1;
while (x >= 10) {
x /= 10;
cnt++;
}
return cnt;
}
//小数点12桁
struct all_init {
all_init() { cout << fixed << setprecision(12); }
} All_init;
int main() {
ll a, b, c;
cin >> a >> b >> c;
if (a + b >= c + 1) {
cout << b + c << endl;
} else {
cout << b + min(c - 1, a + b + 1) << endl;
}
}
| #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>
#include <vector>
#define ll long long
#define rep(i, s, n) for (ll i = (ll)(s); i < (ll)(n); i++)
#define rrep(i, s, n) for (ll i = (ll)(s); i > (ll)(n); i--)
#define all(a) (a).begin(), a.end()
#define rall(a) (a).rbegin(), (a).rend()
#define PI 3.14159265359
#define mod 1000000007
#define P pair<ll, ll>
#define V vector<ll>
#define C vector<char>
#define B vector<bool>
#define endl '\n'
const ll MAX = 510000;
const ll MOD = 1000000007;
using namespace std;
using graph = vector<vector<ll>>;
struct edge {
//辺の重みを管理できるような構造体
//コンストラクタによって簡単に値を入れられるようにしている
// operatorは辺の重みでソート出来るようにしている
ll from, to;
ll cost;
ll capa;
edge(ll s, ll d) : from(s), to(d) {
cost = 0;
capa = 0;
}
edge(ll s, ll d, ll w) : from(s), to(d), cost(w) { capa = 0; }
edge(ll s, ll d, ll x, ll y) : from(s), to(d), cost(x), capa(y) {}
bool operator<(const edge &x) const { return cost < x.cost; }
};
using Graph = vector<vector<edge>>; //重み付きグラフ
//ダイクストラ法
vector<ll> Dijkstra(ll i, vector<vector<edge>> Graph) {
// i:始点
// Graph:重み付きグラフ
ll n = Graph.size();
vector<ll> d(n, LONG_MAX);
d[i] = 0;
priority_queue<pair<ll, ll>, // pair型
vector<pair<ll, ll>>, //内部コンテナ
greater<pair<ll, ll>> //昇順
>
q;
q.push({0, i}); //第一引数:コスト 第二引数:頂点
while (!q.empty()) {
pair<ll, ll> p = q.top();
q.pop();
int v = p.second;
if (d[v] < p.first) {
continue;
}
for (auto x : Graph[v]) {
if (d[x.to] > d[v] + x.cost) {
d[x.to] = d[v] + x.cost;
q.push({d[x.to], x.to});
}
}
}
return d;
}
ll fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void cominit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// mod. m での a の逆元 a^{-1} を計算する
ll modinv(ll a, ll m) {
ll b = m, u = 1, v = 0;
while (b) {
ll t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
// 二項係数計算nCk,n<=10^7,k<=10^7まで
ll com(ll n, ll k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
//二項係数nCk,n<=10^9,k<=10^7まで
ll com2(ll n, ll k) {
ll res, bs = 1, bb = 1;
for (ll i = 0; i < k; i++) {
bs = (bs * (n - i)) % mod;
bb = (bb * (i + 1)) % mod;
}
res = modinv(bb, mod) % mod;
res = (res * bs) % mod;
return res;
}
// 二項係数計算nPk
ll per(ll n, ll k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[n - k] % MOD) % MOD;
}
/* ユークリッドの互除法 最大公約数*/
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
/*最小公倍数*/
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
/*二点間の距離*/
double dist(pair<double, double> a, pair<double, double> b) {
return sqrt(pow((a.first - b.first), 2) + pow((a.second - b.second), 2));
}
//繰り返し自乗法
double ism(double aa, ll p) {
double ap = aa;
double ans = 1;
while (p > 0) {
// cout<<"p="<<p<<",ap="<<ap<<endl;
if (p & 1) { //奇数が真
ans *= ap;
}
p /= 2;
ap = ap * ap;
}
return ans;
}
//繰り返し自乗法(アマリトリバージョン)
ll ismm(ll aa, ll p) {
ll ap = aa;
ll ans = 1;
while (p > 0) {
// cout<<"p="<<p<<",ap="<<ap<<endl;
if (p & 1) { //奇数が真
ans = (ans * ap) % mod;
}
p /= 2;
ap = (ap * ap) % mod;
}
return ans;
}
ll oddXOR(ll a) { return (a + 1) / 2 % 2; }
ll XOR(ll a) {
if (a % 2 == 1)
return oddXOR(a);
else
return oddXOR(a + 1) ^ (a + 1);
}
double median(V a) { //中央値
sort(all(a));
if (a.size() % 2 == 1) {
return a[(a.size() - 1) / 2];
} else {
return (a[(a.size() - 1) / 2] + a[(a.size() - 1) / 2 + 1]) / 2.0;
}
}
struct UnionFind {
vector<ll> par;
UnionFind(ll n) : par(n, -1) {}
ll root(ll x) {
if (par[x] < 0)
return x;
else
return par[x] = root(par[x]);
}
bool issame(ll x, ll y) { return root(x) == root(y); }
bool merge(ll x, ll y) {
x = root(x);
y = root(y);
if (x == y)
return false;
if (par[x] > par[y])
swap(x, y); // merge techniiue
par[x] += par[y];
par[y] = x;
return true;
}
ll size(ll x) { return -par[root(x)]; }
};
// 10の9乗+7でmodをとる
template <std::uint_fast64_t Modulus> class modint {
using u64 = std::uint_fast64_t;
public:
u64 a;
constexpr modint(const u64 x = 0) noexcept : a(x % Modulus) {}
constexpr u64 &value() noexcept { return a; }
constexpr const u64 &value() const noexcept { return a; }
constexpr modint operator+(const modint rhs) const noexcept {
return modint(*this) += rhs;
}
constexpr modint operator-(const modint rhs) const noexcept {
return modint(*this) -= rhs;
}
constexpr modint operator*(const modint rhs) const noexcept {
return modint(*this) *= rhs;
}
constexpr modint operator/(const modint rhs) const noexcept {
return modint(*this) /= rhs;
}
constexpr modint &operator++(auto) noexcept {
++a;
if (a >= Modulus) {
a -= Modulus;
}
return *this;
}
constexpr modint &operator--(auto) noexcept {
--a;
if (a < 0) {
a += Modulus;
}
return *this;
}
constexpr modint &operator+=(const modint rhs) noexcept {
a += rhs.a;
if (a >= Modulus) {
a -= Modulus;
}
return *this;
}
constexpr modint &operator-=(const modint rhs) noexcept {
if (a < rhs.a) {
a += Modulus;
}
a -= rhs.a;
return *this;
}
constexpr modint &operator*=(const modint rhs) noexcept {
a = a * rhs.a % Modulus;
return *this;
}
constexpr modint &operator/=(modint rhs) noexcept {
u64 exp = Modulus - 2;
while (exp) {
if (exp % 2) {
*this *= rhs;
}
rhs *= rhs;
exp /= 2;
}
return *this;
}
};
//素因数分解の関数
vector<pair<long long, long long>> prime_factorize(long long N) {
vector<pair<long long, long long>> res;
for (long long a = 2; a * a <= N; ++a) {
if (N % a != 0)
continue;
long long ex = 0; // 指数
// 割れる限り割り続ける
while (N % a == 0) {
++ex;
N /= a;
}
// その結果を push
res.push_back({a, ex});
}
// 最後に残った数について
if (N != 1)
res.push_back({N, 1});
return res;
}
//約数列挙
vector<long long> enum_divisors(long long N) {
vector<long long> res;
for (long long i = 1; i * i <= N; ++i) {
if (N % i == 0) {
res.push_back(i);
// 重複しないならば i の相方である N/i も push
if (N / i != i) {
res.push_back(N / i);
}
}
}
// 小さい順に並び替える
sort(res.begin(), res.end());
return res;
}
//桁数
ll Keta(ll x) {
ll cnt = 1;
while (x >= 10) {
x /= 10;
cnt++;
}
return cnt;
}
//小数点12桁
struct all_init {
all_init() { cout << fixed << setprecision(12); }
} All_init;
int main() {
ll a, b, c;
cin >> a >> b >> c;
if (a + b >= c - 1) {
cout << b + c << endl;
} else {
cout << b + min(c - 1, a + b + 1) << endl;
}
}
| [
"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 >> B >> C;
int ans = 0;
if (A + B >= C)
ans = B + C;
else
ans = B + C - 1;
cout << ans << endl;
return 0;
} | #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 >> B >> C;
int ans = 0;
if (A + B >= C)
ans = B + C;
else
ans = B + (A + B) + 1;
cout << ans << endl;
return 0;
} | [
"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<ビット数> 変数名; // すべてのビットが0の状態で初期化される
// bitset<ビット数> 変数名("ビット列"); // 指定したビット列で初期化される
using namespace std;
using vi = vector<int>;
using vb = vector<bool>;
using vc = vector<char>;
using vs = vector<string>;
using vvi = vector<vector<int>>;
using vvc = vector<vector<char>>;
using pii = pair<int, int>;
#define fix10 cout << fixed << setprecision(10);
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
long a, b, c;
cin >> a >> b >> c;
if (a + b <= c) {
cout << a + 2 * b << endl;
return 0;
} else {
cout << b + c << endl;
return 0;
}
}
| #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<ビット数> 変数名; // すべてのビットが0の状態で初期化される
// bitset<ビット数> 変数名("ビット列"); // 指定したビット列で初期化される
using namespace std;
using vi = vector<int>;
using vb = vector<bool>;
using vc = vector<char>;
using vs = vector<string>;
using vvi = vector<vector<int>>;
using vvc = vector<vector<char>>;
using pii = pair<int, int>;
#define fix10 cout << fixed << setprecision(10);
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
long a, b, c;
cin >> a >> b >> c;
if (a + b < c) {
cout << a + 2 * b + 1 << endl;
return 0;
} else {
cout << b + c << endl;
return 0;
}
}
| [
"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 temp = *a;
*a = *b;
*b = temp;
}
int gcd(int a, int b) {
if (a % b == 0)
return b;
return gcd(b, a % b);
}
int digit(int num) {
int cnt = 0;
while (num != 0) {
cnt += num % 10;
num = num / 10;
}
return cnt;
}
int main(void) {
long long A, B, C;
cin >> A >> B >> C;
if (B >= C) {
cout << B + C << endl;
} else {
cout << B + (B + A + 1) << endl;
}
return 0;
}
| #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 temp = *a;
*a = *b;
*b = temp;
}
int gcd(int a, int b) {
if (a % b == 0)
return b;
return gcd(b, a % b);
}
int digit(int num) {
int cnt = 0;
while (num != 0) {
cnt += num % 10;
num = num / 10;
}
return cnt;
}
int main(void) {
long long A, B, C;
cin >> A >> B >> C;
if (A + B >= C) {
cout << B + C << endl;
} else {
cout << B + (B + A + 1) << endl;
}
return 0;
}
| [
"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)
#define chmin(x, a) x = min(x, a)
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A + B - 1 >= C)
cout << B + C << endl;
else
cout << A + 2 * 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++)
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)
#define chmin(x, a) x = min(x, a)
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A + B + 1 >= C)
cout << B + C << endl;
else
cout << A + 2 * B + 1 << endl;
}
| [
"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 std;
using ll = long long;
using Graph = vector<vector<int>>;
const ll MOD = 1000000007;
const ll INF = 10000000000000000;
vector<int> x4 = {0, 1, 0, -1}, x8 = {0, 1, 1, 1, 0, -1, -1, -1};
vector<int> y4 = {1, 0, -1, 0}, y8 = {1, 1, 0, -1, -1, -1, 0, 1};
template <class T> struct edge {
int from, to;
T cost;
};
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline T powerM(T a, T b) {
if (b == 0)
return 1;
T tmp = powerM(a, b / 2);
if (b % 2 == 0)
return tmp * tmp % MOD;
else
return tmp * tmp % MOD * a % MOD;
}
template <class T> inline T power(T a, T b, T m) {
if (b == 0)
return 1;
T tmp = power(a, b / 2, m);
if (b % 2 == 0)
return tmp * tmp % m;
else
return tmp * tmp % m * a % m;
}
template <class T> inline T gcd(T a, T b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
template <class T> inline T lcm(T a, T b) { return a / gcd(a, b) * b; }
// ax+by=gcd(a,b)を解く
template <class T> inline T extgcd(T a, T b, T &x, T &y) {
if (b == 0) {
x = 1;
y = 0;
return a;
}
T d = extgcd(b, a % b, y, x);
y -= a / b * x;
return d;
}
void hey() { cout << "hey" << endl; }
int main() {
ll a, b, c;
cin >> a >> b >> c;
ll res = 0;
if (c > a + b - 1)
c = a + b - 1;
res = b + c;
cout << res << endl;
}
| #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 std;
using ll = long long;
using Graph = vector<vector<int>>;
const ll MOD = 1000000007;
const ll INF = 10000000000000000;
vector<int> x4 = {0, 1, 0, -1}, x8 = {0, 1, 1, 1, 0, -1, -1, -1};
vector<int> y4 = {1, 0, -1, 0}, y8 = {1, 1, 0, -1, -1, -1, 0, 1};
template <class T> struct edge {
int from, to;
T cost;
};
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline T powerM(T a, T b) {
if (b == 0)
return 1;
T tmp = powerM(a, b / 2);
if (b % 2 == 0)
return tmp * tmp % MOD;
else
return tmp * tmp % MOD * a % MOD;
}
template <class T> inline T power(T a, T b, T m) {
if (b == 0)
return 1;
T tmp = power(a, b / 2, m);
if (b % 2 == 0)
return tmp * tmp % m;
else
return tmp * tmp % m * a % m;
}
template <class T> inline T gcd(T a, T b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
template <class T> inline T lcm(T a, T b) { return a / gcd(a, b) * b; }
// ax+by=gcd(a,b)を解く
template <class T> inline T extgcd(T a, T b, T &x, T &y) {
if (b == 0) {
x = 1;
y = 0;
return a;
}
T d = extgcd(b, a % b, y, x);
y -= a / b * x;
return d;
}
void hey() { cout << "hey" << endl; }
int main() {
ll a, b, c;
cin >> a >> b >> c;
ll res = 0;
if (c > a + b + 1)
c = a + b + 1;
res = b + c;
cout << res << endl;
}
| [
"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) {
ans = A + B + 1;
} else {
ans = B + C;
}
cout << ans << endl;
return 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) {
ans = A + B * 2 + 1;
} else {
ans = B + C;
}
cout << ans << endl;
return 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)
#define debug cout << "line : " << __LINE__ << " debug" << endl
#define Dcout(N) cout << setprecision(20) << N << endl
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end()) //被り削除
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define INF 1e9
#define MOD 1000000007
typedef long long ll;
//------------------------------------------------------------------------
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll a, b, c;
cin >> a >> b >> c;
if (a + b >= c)
cout << c + b << endl;
else
cout << c + b + 1 << endl;
return 0;
}
| #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)
#define debug cout << "line : " << __LINE__ << " debug" << endl
#define Dcout(N) cout << setprecision(20) << N << endl
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end()) //被り削除
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define INF 1e9
#define MOD 1000000007
typedef long long ll;
//------------------------------------------------------------------------
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll a, b, c;
cin >> a >> b >> c;
if (a + b >= c)
cout << c + b << endl;
else
cout << (a + b) + b + 1 << endl;
return 0;
}
| [
"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>;
typedef double db;
typedef string str;
typedef pair<ll, ll> p;
constexpr int MOD = 1000000007;
using ll = long long;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
void print(const std::vector<int> &v) {
std::for_each(v.begin(), v.end(), [](int x) { std::cout << x << " "; });
std::cout << std::endl;
}
// http://drken1215.hatenablog.com/entry/2019/03/24/091900
int main() {
int A, B, C;
cin >> A >> B >> C;
//解毒剤入りの美味しくないクッキーを A
//解毒剤入りの美味しいクッキーをB
//毒入りの美味しいクッキーを C 枚持っていま
//美味しいクッキー
if (A + B - 1 >= C) {
//毒は全部食べれる
cout << B + C << endl;
return 0;
}
cout << A + B + 1 + B << endl;
return 0;
} | #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>;
typedef double db;
typedef string str;
typedef pair<ll, ll> p;
constexpr int MOD = 1000000007;
using ll = long long;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
void print(const std::vector<int> &v) {
std::for_each(v.begin(), v.end(), [](int x) { std::cout << x << " "; });
std::cout << std::endl;
}
// http://drken1215.hatenablog.com/entry/2019/03/24/091900
int main() {
int A, B, C;
cin >> A >> B >> C;
//解毒剤入りの美味しくないクッキーを A
//解毒剤入りの美味しいクッキーをB
//毒入りの美味しいクッキーを C 枚持っていま
//美味しいクッキー
if (A + B >= C - 1) {
//毒は全部食べれる
cout << B + C << endl;
return 0;
}
cout << A + B + 1 + B << endl;
return 0;
} | [
"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>;
typedef double db;
typedef string str;
typedef pair<ll, ll> p;
constexpr int MOD = 1000000007;
using ll = long long;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
void print(const std::vector<int> &v) {
std::for_each(v.begin(), v.end(), [](int x) { std::cout << x << " "; });
std::cout << std::endl;
}
// http://drken1215.hatenablog.com/entry/2019/03/24/091900
int main() {
int A, B, C;
cin >> A >> B >> C;
//解毒剤入りの美味しくないクッキーを A
//解毒剤入りの美味しいクッキーをB
//毒入りの美味しいクッキーを C 枚持っていま
//美味しいクッキー
if (A + B - 1 > C) {
//毒は全部食べれる
cout << B + C << endl;
return 0;
}
cout << A + B + 1 + B << endl;
return 0;
} | #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>;
typedef double db;
typedef string str;
typedef pair<ll, ll> p;
constexpr int MOD = 1000000007;
using ll = long long;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
void print(const std::vector<int> &v) {
std::for_each(v.begin(), v.end(), [](int x) { std::cout << x << " "; });
std::cout << std::endl;
}
// http://drken1215.hatenablog.com/entry/2019/03/24/091900
int main() {
int A, B, C;
cin >> A >> B >> C;
//解毒剤入りの美味しくないクッキーを A
//解毒剤入りの美味しいクッキーをB
//毒入りの美味しいクッキーを C 枚持っていま
//美味しいクッキー
if (A + B >= C - 1) {
//毒は全部食べれる
cout << B + C << endl;
return 0;
}
cout << A + B + 1 + B << endl;
return 0;
} | [
"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) cout << #x << ": " << x << " "
#define rev(x) reverse(x.begin(), x.end())
#define int long long
#define F first
#define S second
// int a[2000];
void printvector(std::vector<int> v) {
for (int i = 0; i < v.size(); ++i) {
cout << v[i] << " ";
}
cout << "" << endl;
}
void printarray(int a[], int n) {
for (int i = 0; i < n; ++i) {
cout << a[i] << " ";
}
cout << "" << endl;
}
void solve() {
int a, b, c;
cin >> a >> b >> c;
cout << min(a + b, c) + b << endl;
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
solve();
return 0;
} | #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) cout << #x << ": " << x << " "
#define rev(x) reverse(x.begin(), x.end())
#define int long long
#define F first
#define S second
// int a[2000];
void printvector(std::vector<int> v) {
for (int i = 0; i < v.size(); ++i) {
cout << v[i] << " ";
}
cout << "" << endl;
}
void printarray(int a[], int n) {
for (int i = 0; i < n; ++i) {
cout << a[i] << " ";
}
cout << "" << endl;
}
void solve() {
int a, b, c;
cin >> a >> b >> c;
cout << min(a + b + 1, c) + b << endl;
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
solve();
return 0;
} | [
"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 >> a >> b >> c;
if (a + b + 1 >= c)
co(b + c);
else
co(a + b + 1);
return 0;
}
| #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 >> a >> b >> c;
if (a + b + 1 >= c)
co(b + c);
else
co(a + 2 * b + 1);
return 0;
}
| [
"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 + 1;
} else if (A + B >= C) {
ans = A + B + C;
}
cout << ans << endl;
} | #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 + 1;
} else if (A + B >= C) {
ans = C + B;
}
cout << ans << endl;
} | [
"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, b, c;
cin >> a >> b >> c;
ll res;
// cを先に食べる
if (a + b < c) {
res = b * 2 + 1;
} else {
res = b + c;
}
cout << res << endl;
return 0;
}
| #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, b, c;
cin >> a >> b >> c;
ll res;
// cを先に食べる
if (a + b < c) {
res = b + (a + b + 1);
} else {
res = b + c;
}
cout << res << endl;
return 0;
}
| [
"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 <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
// conversion
//------------------------------------------
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
// math
//-------------------------------------------
template <class T> inline T sqr(T x) { return x * x; }
// typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
// container util
//------------------------------------------
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i, c) \
for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define EXIST(s, e) ((s).find(e) != (s).end())
#define EXISTch(s, c) \
((((s).find_first_of(c)) != std::string::npos) ? 1 : 0) // cがあれば1 if(1)
#define SORT(c) sort((c).begin(), (c).end())
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
#define FOR(i, c) \
for (__typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
// constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI = acos(-1.0);
const int INF = (int)1000000007;
const LL MOD = (LL)1000000007; // 10^9+7
const LL INF2 = (LL)100000000000000000; // 10^18
int main() {
int x, y, z;
cin >> x >> y >> z;
int cure = x + y;
cout << y + max(cure + 1, z) << endl;
return 0;
} |
// 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 <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
// conversion
//------------------------------------------
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
// math
//-------------------------------------------
template <class T> inline T sqr(T x) { return x * x; }
// typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
// container util
//------------------------------------------
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i, c) \
for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define EXIST(s, e) ((s).find(e) != (s).end())
#define EXISTch(s, c) \
((((s).find_first_of(c)) != std::string::npos) ? 1 : 0) // cがあれば1 if(1)
#define SORT(c) sort((c).begin(), (c).end())
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
#define FOR(i, c) \
for (__typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
// constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI = acos(-1.0);
const int INF = (int)1000000007;
const LL MOD = (LL)1000000007; // 10^9+7
const LL INF2 = (LL)100000000000000000; // 10^18
int main() {
int x, y, z;
cin >> x >> y >> z;
int cure = x + y;
cout << y + min(cure + 1, z) << endl;
return 0;
} | [
"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) \
{ \
for (auto it = c.begin(); it != c.end(); ++it) \
if (it == c.begin()) \
cout << *it; \
else \
cout << ' ' << *it; \
cout << endl; \
}
const int MOD = 1000000007;
int main() {
int A, B, C;
cin >> A >> B >> C;
LL ans = min(A + B + 1, C) + A;
cout << ans << endl;
return 0;
}
|
#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) \
{ \
for (auto it = c.begin(); it != c.end(); ++it) \
if (it == c.begin()) \
cout << *it; \
else \
cout << ' ' << *it; \
cout << endl; \
}
const int MOD = 1000000007;
int main() {
int A, B, C;
cin >> A >> B >> C;
LL ans = min(A + B + 1, C) + B;
cout << ans << endl;
return 0;
}
| [
"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) \
{ \
for (auto it = c.begin(); it != c.end(); ++it) \
if (it == c.begin()) \
cout << *it; \
else \
cout << ' ' << *it; \
cout << endl; \
}
const int MOD = 1000000007;
int main() {
int A, B, C;
cin >> A >> B >> C;
LL ans = min(A + B, C) + A;
cout << ans << endl;
return 0;
}
|
#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) \
{ \
for (auto it = c.begin(); it != c.end(); ++it) \
if (it == c.begin()) \
cout << *it; \
else \
cout << ' ' << *it; \
cout << endl; \
}
const int MOD = 1000000007;
int main() {
int A, B, C;
cin >> A >> B >> C;
LL ans = min(A + B + 1, C) + B;
cout << ans << endl;
return 0;
}
| [
"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 MP make_pair
#define DEBUG printf("%s\n", "debug")
#define fst first
#define snd second
#define SIN(x, S) (S.count(x) != 0)
#define M0(x) memset(x, 0, sizeof(x))
#define FILL(x, y) memset(x, y, sizeof(x))
#define MM(x) memset(x, -1, sizeof(x))
#define ALL(x) (x).begin(), (x).end()
using namespace std;
typedef pair<int, int> PII;
typedef pair<long long, long long> PLL;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<long long> VL;
typedef long long ll;
typedef long long integer;
///////////////////////////////////////////////
/* (๑╹◡╹) */
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
ll MOD = 1000000007;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
/* (๑╹◡╹)(๑╹◡╹)(๑╹◡╹)*/
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
/* (๑╹◡╹)(๑╹◡╹)(๑╹◡╹)(๑╹◡╹)(๑╹◡╹)(๑╹◡╹) */
///////////////////////////////////////////////
const int MAX = 510000;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int main() {
ll ans = 0;
int A, B, C;
cin >> A >> B >> C;
if (A + B > C) {
ans = C + B;
} else {
ans = A + B + B + 1;
}
cout << ans << endl;
}
| #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 MP make_pair
#define DEBUG printf("%s\n", "debug")
#define fst first
#define snd second
#define SIN(x, S) (S.count(x) != 0)
#define M0(x) memset(x, 0, sizeof(x))
#define FILL(x, y) memset(x, y, sizeof(x))
#define MM(x) memset(x, -1, sizeof(x))
#define ALL(x) (x).begin(), (x).end()
using namespace std;
typedef pair<int, int> PII;
typedef pair<long long, long long> PLL;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<long long> VL;
typedef long long ll;
typedef long long integer;
///////////////////////////////////////////////
/* (๑╹◡╹) */
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
ll MOD = 1000000007;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
/* (๑╹◡╹)(๑╹◡╹)(๑╹◡╹)*/
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
/* (๑╹◡╹)(๑╹◡╹)(๑╹◡╹)(๑╹◡╹)(๑╹◡╹)(๑╹◡╹) */
///////////////////////////////////////////////
const int MAX = 510000;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int main() {
ll ans = 0;
int A, B, C;
cin >> A >> B >> C;
if (A + B >= C) {
ans = C + B;
} else {
ans = A + B + B + 1;
}
cout << ans << endl;
}
| [
"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 MP make_pair
#define DEBUG printf("%s\n", "debug")
#define fst first
#define snd second
#define SIN(x, S) (S.count(x) != 0)
#define M0(x) memset(x, 0, sizeof(x))
#define FILL(x, y) memset(x, y, sizeof(x))
#define MM(x) memset(x, -1, sizeof(x))
#define ALL(x) (x).begin(), (x).end()
using namespace std;
typedef pair<int, int> PII;
typedef pair<long long, long long> PLL;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<long long> VL;
typedef long long ll;
typedef long long integer;
///////////////////////////////////////////////
/* (๑╹◡╹) */
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
ll MOD = 1000000007;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
/* (๑╹◡╹)(๑╹◡╹)(๑╹◡╹)*/
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
/* (๑╹◡╹)(๑╹◡╹)(๑╹◡╹)(๑╹◡╹)(๑╹◡╹)(๑╹◡╹) */
///////////////////////////////////////////////
const int MAX = 510000;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int main() {
int ans = 0;
int A, B, C;
cin >> A >> B >> C;
if (A + B > C) {
ans = C + B;
} else {
ans = A + B + B + 1;
}
cout << ans << endl;
}
| #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 MP make_pair
#define DEBUG printf("%s\n", "debug")
#define fst first
#define snd second
#define SIN(x, S) (S.count(x) != 0)
#define M0(x) memset(x, 0, sizeof(x))
#define FILL(x, y) memset(x, y, sizeof(x))
#define MM(x) memset(x, -1, sizeof(x))
#define ALL(x) (x).begin(), (x).end()
using namespace std;
typedef pair<int, int> PII;
typedef pair<long long, long long> PLL;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<long long> VL;
typedef long long ll;
typedef long long integer;
///////////////////////////////////////////////
/* (๑╹◡╹) */
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
ll MOD = 1000000007;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
/* (๑╹◡╹)(๑╹◡╹)(๑╹◡╹)*/
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
/* (๑╹◡╹)(๑╹◡╹)(๑╹◡╹)(๑╹◡╹)(๑╹◡╹)(๑╹◡╹) */
///////////////////////////////////////////////
const int MAX = 510000;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int main() {
ll ans = 0;
int A, B, C;
cin >> A >> B >> C;
if (A + B >= C) {
ans = C + B;
} else {
ans = A + B + B + 1;
}
cout << ans << endl;
}
| [
"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 HpOut(S) cout << setprecision(20) << S << endl;
#define Vecpr vector<pair<lli, lli>>
int main() {
lli A, B = 0, C, D = 0, E, F = INF;
cin >> A >> B >> C;
if (A + 3 < C)
C = A + 3;
Out(B + C);
}
| #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 HpOut(S) cout << setprecision(20) << S << endl;
#define Vecpr vector<pair<lli, lli>>
int main() {
lli A, B = 0, C, D = 0, E, F = INF;
cin >> A >> B >> C;
if (A + B + 1 < C)
C = A + B + 1;
Out(B + C);
}
| [
"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 {
// Input
using IS = istream;
IS &in(IS &i) { return i; }
template <class T, class... Ts> IS &in(IS &i, T &a, Ts &...as) {
return in(i >> a, as...);
}
template <class V> IS &operator>>(IS &i, vector<V> &a) {
for_each(a.begin(), a.end(), [&i](auto &e) { i >> e; });
return i;
}
template <class F, class S> IS &operator>>(IS &i, pair<F, S> const &p) {
return in(p.first, p.second);
}
template <class... Ts, size_t... I>
IS &tuple_in(IS &i, tuple<Ts...> &t, index_sequence<I...>) {
return in(i, get<I>(t)...);
}
template <class... Ts> IS &operator>>(IS &i, tuple<Ts...> &t) {
return tuple_in(i, t, make_index_sequence<sizeof...(Ts)>());
}
// Output
using OS = ostream;
OS &out(OS &o) { return o << endl; }
template <class T> OS &out(OS &o, T const &a) { return o << a << endl; }
template <class T, class... Ts> OS &out(OS &o, T const &a, Ts const &...as) {
return out(o << a << " ", as...);
}
template <class F, class S> OS &operator<<(OS &o, pair<F, S> const &p) {
return o << "(" << p.first << " : " << p.second << ")";
}
template <class... Ts> OS &args_out(OS &o, Ts const &...ts);
OS &args_out(OS &o) { return o; }
template <class T> OS &args_out(OS &o, T const &t) { return o << t; }
template <class T0, class T1, class... Ts>
OS &args_out(OS &o, T0 const &t0, T1 const &t1, Ts const &...ts) {
return args_out(o << t0 << ",", t1, ts...);
}
template <class... Ts, size_t... I>
OS &tuple_out(OS &o, tuple<Ts...> const &t, index_sequence<I...>) {
return args_out(o, get<I>(t)...);
}
template <class... Ts> OS &operator<<(OS &o, tuple<Ts...> const &t) {
return tuple_out(o << "(", t, make_index_sequence<sizeof...(Ts)>()) << ")";
}
template <
class C,
class T = typename iterator_traits<typename C::iterator>::value_type,
typename enable_if<!is_same<C, string>::value, nullptr_t>::type = nullptr>
OS &operator<<(OS &o, C const &a) {
return a.empty() ? (o << "[]") : ([&o, &a]() -> OS & {
o << "[" << *a.begin();
for_each(next(a.begin()), a.end(), [&o](auto const &e) { o << "," << e; });
return o << "]";
}());
}
} // namespace io
template <class... Xs> void input(Xs &...xs) { io::in(cin, xs...); }
template <class... Xs> void print(Xs const &...xs) { io::out(cout, xs...); }
// Hash
namespace hashcode {
template <class... Ts> size_t hash_args(size_t h, Ts const &...ts);
size_t hash_args(size_t h) { return h; }
template <class T, class... Ts>
size_t hash_args(size_t h, T const &t, Ts const &...ts) {
return hash_args(h * 31 + hash<T>{}(t), ts...);
}
template <class... Ts, size_t... I>
size_t hash_tuple(tuple<Ts...> const &t, index_sequence<I...>) {
return hash_args(17, get<I>(t)...);
}
} // namespace hashcode
namespace std {
template <class... Ts> struct hash<tuple<Ts...>> {
size_t operator()(tuple<Ts...> const &t) const {
return hashcode::hash_tuple(t, index_sequence_for<Ts...>());
}
};
template <class T> struct hash<unordered_set<T>> {
size_t operator()(unordered_set<T> const &s) const {
return accumulate(s.begin(), s.end(), 0, [](auto const &a, auto const &e) {
return a + hash<T>{}(e);
});
}
};
} // namespace std
// Types
using ll = long long int;
// Range
vector<ll> range(ll const &begin, ll const &end) {
vector<ll> ret(max(0LL, end - begin));
iota(ret.begin(), ret.end(), begin);
return ret;
}
vector<ll> range(ll const &end) { return range(0, end); }
template <class T = ll> vector<T> vec(size_t n, T &&init = T()) {
return vector<T>(n, init);
}
template <class Itr, class T = typename iterator_traits<Itr>::value_type>
vector<T> vec(Itr begin, Itr end) {
return vector<T>(begin, end);
}
// MOD
ll gcd(ll p, ll q) { return (q == 0) ? p : gcd(q, p % q); }
ll pow(ll a, ll n, ll m) {
if (n == 0)
return 1;
if (n & 1)
return ((a % m) * pow(a, n - 1, m)) % m;
auto b = pow(a, n / 2, m);
return (b * b) % m;
}
ll inv(ll a, ll p) { return pow(a, p - 2, p); }
constexpr ll MOD = 1e9 + 7;
int main() {
ll A, B, C;
input(A, B, C);
print((C <= B + A) ? (C + B) : (C + B + 1));
}
| #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 {
// Input
using IS = istream;
IS &in(IS &i) { return i; }
template <class T, class... Ts> IS &in(IS &i, T &a, Ts &...as) {
return in(i >> a, as...);
}
template <class V> IS &operator>>(IS &i, vector<V> &a) {
for_each(a.begin(), a.end(), [&i](auto &e) { i >> e; });
return i;
}
template <class F, class S> IS &operator>>(IS &i, pair<F, S> const &p) {
return in(p.first, p.second);
}
template <class... Ts, size_t... I>
IS &tuple_in(IS &i, tuple<Ts...> &t, index_sequence<I...>) {
return in(i, get<I>(t)...);
}
template <class... Ts> IS &operator>>(IS &i, tuple<Ts...> &t) {
return tuple_in(i, t, make_index_sequence<sizeof...(Ts)>());
}
// Output
using OS = ostream;
OS &out(OS &o) { return o << endl; }
template <class T> OS &out(OS &o, T const &a) { return o << a << endl; }
template <class T, class... Ts> OS &out(OS &o, T const &a, Ts const &...as) {
return out(o << a << " ", as...);
}
template <class F, class S> OS &operator<<(OS &o, pair<F, S> const &p) {
return o << "(" << p.first << " : " << p.second << ")";
}
template <class... Ts> OS &args_out(OS &o, Ts const &...ts);
OS &args_out(OS &o) { return o; }
template <class T> OS &args_out(OS &o, T const &t) { return o << t; }
template <class T0, class T1, class... Ts>
OS &args_out(OS &o, T0 const &t0, T1 const &t1, Ts const &...ts) {
return args_out(o << t0 << ",", t1, ts...);
}
template <class... Ts, size_t... I>
OS &tuple_out(OS &o, tuple<Ts...> const &t, index_sequence<I...>) {
return args_out(o, get<I>(t)...);
}
template <class... Ts> OS &operator<<(OS &o, tuple<Ts...> const &t) {
return tuple_out(o << "(", t, make_index_sequence<sizeof...(Ts)>()) << ")";
}
template <
class C,
class T = typename iterator_traits<typename C::iterator>::value_type,
typename enable_if<!is_same<C, string>::value, nullptr_t>::type = nullptr>
OS &operator<<(OS &o, C const &a) {
return a.empty() ? (o << "[]") : ([&o, &a]() -> OS & {
o << "[" << *a.begin();
for_each(next(a.begin()), a.end(), [&o](auto const &e) { o << "," << e; });
return o << "]";
}());
}
} // namespace io
template <class... Xs> void input(Xs &...xs) { io::in(cin, xs...); }
template <class... Xs> void print(Xs const &...xs) { io::out(cout, xs...); }
// Hash
namespace hashcode {
template <class... Ts> size_t hash_args(size_t h, Ts const &...ts);
size_t hash_args(size_t h) { return h; }
template <class T, class... Ts>
size_t hash_args(size_t h, T const &t, Ts const &...ts) {
return hash_args(h * 31 + hash<T>{}(t), ts...);
}
template <class... Ts, size_t... I>
size_t hash_tuple(tuple<Ts...> const &t, index_sequence<I...>) {
return hash_args(17, get<I>(t)...);
}
} // namespace hashcode
namespace std {
template <class... Ts> struct hash<tuple<Ts...>> {
size_t operator()(tuple<Ts...> const &t) const {
return hashcode::hash_tuple(t, index_sequence_for<Ts...>());
}
};
template <class T> struct hash<unordered_set<T>> {
size_t operator()(unordered_set<T> const &s) const {
return accumulate(s.begin(), s.end(), 0, [](auto const &a, auto const &e) {
return a + hash<T>{}(e);
});
}
};
} // namespace std
// Types
using ll = long long int;
// Range
vector<ll> range(ll const &begin, ll const &end) {
vector<ll> ret(max(0LL, end - begin));
iota(ret.begin(), ret.end(), begin);
return ret;
}
vector<ll> range(ll const &end) { return range(0, end); }
template <class T = ll> vector<T> vec(size_t n, T &&init = T()) {
return vector<T>(n, init);
}
template <class Itr, class T = typename iterator_traits<Itr>::value_type>
vector<T> vec(Itr begin, Itr end) {
return vector<T>(begin, end);
}
// MOD
ll gcd(ll p, ll q) { return (q == 0) ? p : gcd(q, p % q); }
ll pow(ll a, ll n, ll m) {
if (n == 0)
return 1;
if (n & 1)
return ((a % m) * pow(a, n - 1, m)) % m;
auto b = pow(a, n / 2, m);
return (b * b) % m;
}
ll inv(ll a, ll p) { return pow(a, p - 2, p); }
constexpr ll MOD = 1e9 + 7;
int main() {
ll A, B, C;
input(A, B, C);
print((C <= B + A) ? (C + B) : (A + 2 * B + 1));
}
| [
"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() {
int a, b, c;
cin >> a >> b >> c;
if (a + b >= c) {
cout << b + c << endl;
} else {
cout << a + b * 2 << endl;
}
} | #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() {
int a, b, c;
cin >> a >> b >> c;
if (a + b >= c) {
cout << b + c << endl;
} else {
cout << a + b * 2 + 1 << endl;
}
} | [
"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, j, a, b, c;
cin >> a >> b >> c;
if (a + 1 >= c)
cout << b + c;
else
cout << a + 2 * b + 1;
return 0;
}
| #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, j, 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,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, b, c;
cin >> a >> b >> c;
if (a + 1 >= c)
cout << b + c;
else
cout << a + 2 * b + 1;
return 0;
} | #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, j, a, b, c;
cin >> a >> b >> c;
if (a + b + 1 >= c)
cout << b + c;
else
cout << a + 2 * b + 1;
return 0;
}
| [
"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, b, c;
cin >> a >> b >> c;
if (a + 1 >= c)
cout << b + c;
else
cout << a + b + 1;
return 0;
}
| #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, j, a, b, c;
cin >> a >> b >> c;
if (a + b + 1 >= c)
cout << b + c;
else
cout << a + 2 * b + 1;
return 0;
}
| [
"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 pair<ll, ll> pii;
template <typename T> void read(T &x) {
x = 0;
char ch = getchar();
ll f = 1;
while (!isdigit(ch)) {
if (ch == '-')
f *= -1;
ch = getchar();
}
while (isdigit(ch)) {
x = x * 10 + ch - 48;
ch = getchar();
}
x *= f;
}
int a, b, c;
int main() {
cin >> a;
cout << min(a + b + 1, c) + b << endl;
return 0;
}
| #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 pair<ll, ll> pii;
template <typename T> void read(T &x) {
x = 0;
char ch = getchar();
ll f = 1;
while (!isdigit(ch)) {
if (ch == '-')
f *= -1;
ch = getchar();
}
while (isdigit(ch)) {
x = x * 10 + ch - 48;
ch = getchar();
}
x *= f;
}
int a, b, c;
int main() {
cin >> a >> b >> c;
cout << min(a + b + 1, c) + b << endl;
return 0;
}
| [
"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) {
o << "{";
for (int i = 0; i < (int)v.size(); i++)
o << (i > 0 ? ", " : "") << v[i];
o << "}";
return o;
}
int a;
int b;
int c;
int main() {
cin >> a >> b >> c;
cout << (min(a + b, c) + b) << endl;
} | #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) {
o << "{";
for (int i = 0; i < (int)v.size(); i++)
o << (i > 0 ? ", " : "") << v[i];
o << "}";
return o;
}
int a;
int b;
int c;
int main() {
cin >> a >> b >> c;
cout << (min(a + b + 1, c) + b) << endl;
} | [
"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>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned int ui;
const ll mod = 1000000007;
typedef long double ld;
const ll INF = 1e+14;
typedef pair<int, int> P;
#define stop \
char nyaa; \
cin >> nyaa;
#define rep(i, n) for (int i = 0; i < n; i++)
#define per(i, n) for (int i = n - 1; i >= 0; i--)
#define Rep(i, sta, n) for (int i = sta; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define per1(i, n) for (int i = n; i >= 1; i--)
#define Rep1(i, sta, n) for (int i = sta; i <= n; i++)
typedef complex<ld> Point;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<ld, ld> LDP;
typedef pair<ll, ll> LP;
#define fr first
#define sc second
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll A, B, C;
cin >> A >> B >> C;
if (C <= A + B - 1)
cout << C + B << '\n';
else
cout << A + 2 * B + 1 << '\n';
return 0;
}
| #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>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned int ui;
const ll mod = 1000000007;
typedef long double ld;
const ll INF = 1e+14;
typedef pair<int, int> P;
#define stop \
char nyaa; \
cin >> nyaa;
#define rep(i, n) for (int i = 0; i < n; i++)
#define per(i, n) for (int i = n - 1; i >= 0; i--)
#define Rep(i, sta, n) for (int i = sta; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define per1(i, n) for (int i = n; i >= 1; i--)
#define Rep1(i, sta, n) for (int i = sta; i <= n; i++)
typedef complex<ld> Point;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<ld, ld> LDP;
typedef pair<ll, ll> LP;
#define fr first
#define sc second
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll A, B, C;
cin >> A >> B >> C;
if (C <= A + B + 1)
cout << C + B << '\n';
else
cout << A + 2 * B + 1 << '\n';
return 0;
}
| [
"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) ? (a) : (b))
#define min(a, b) ((a) < (b) ? (a) : (b))
#define INF 1000000000000000000
#define MOD 1000000007LL
#define MAX 100010
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef map<ll, ll> Map;
int main(void) {
ll a, b, c;
cin >> a >> b >> c;
if (a + b >= c + 1) {
pr(b + c);
} else {
pr(a + b + 1 + 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) ? (a) : (b))
#define min(a, b) ((a) < (b) ? (a) : (b))
#define INF 1000000000000000000
#define MOD 1000000007LL
#define MAX 100010
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef map<ll, ll> Map;
int main(void) {
ll a, b, c;
cin >> a >> b >> c;
if (a + b + 1 >= c) {
pr(b + c);
} else {
pr(a + b + 1 + 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)
ans = b + c;
else
ans = a + 2 * b + 1;
cout << ans << endl;
} | #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)
ans = b + c;
else
ans = a + 2 * b + 1;
cout << ans << endl;
} | [
"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() {
ll a, b, c;
cin >> a >> b >> c;
cout << (c >= a + b + 1 ? a + b + 1 : b + c) << endl;
}
| #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() {
ll a, b, c;
cin >> a >> b >> c;
cout << (c >= a + b + 1 ? a + 2 * b + 1 : b + c) << endl;
}
| [
"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 << endl;
}
return 0;
} | #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 << endl;
}
return 0;
} | [
"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 << endl;
}
return 0;
} | #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 << endl;
}
return 0;
} | [
"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 ll = int64;
using ull = uint64;
#define all(x) x.begin(), x.end()
inline ll read() {
ll x = 0, f = 1;
char c = getchar();
while (c < '0' || c > '9') {
if (c == '-')
f = -1;
c = getchar();
}
while (c >= '0' && c <= '9')
x = x * 10 + c - '0', c = getchar();
return x * f;
}
void Main() {
int A = read(), B = read(), C = read();
printf("%d\n", B + min(A + B, C));
}
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
Main();
return 0;
} | #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 ll = int64;
using ull = uint64;
#define all(x) x.begin(), x.end()
inline ll read() {
ll x = 0, f = 1;
char c = getchar();
while (c < '0' || c > '9') {
if (c == '-')
f = -1;
c = getchar();
}
while (c >= '0' && c <= '9')
x = x * 10 + c - '0', c = getchar();
return x * f;
}
void Main() {
int A = read(), B = read(), C = read();
printf("%d\n", B + min(A + B + 1, C));
}
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
Main();
return 0;
} | [
"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 main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll a, b, c;
cin >> a >> b >> c;
ll k = b;
if (a + b >= c) {
k = k + c;
} else
k += (a + b);
cout << k;
return 0;
} | #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 main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll a, b, c;
cin >> a >> b >> c;
ll k = b;
if (a + b >= c) {
k = k + c;
} else
k += (a + b + 1);
cout << k;
return 0;
} | [
"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 main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll a, b, c;
cin >> a >> b >> c;
ll k = b;
if (a + b >= c) {
k = k + c;
} else
k += (c - (a + b));
cout << k;
return 0;
} | #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 main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll a, b, c;
cin >> a >> b >> c;
ll k = b;
if (a + b >= c) {
k = k + c;
} else
k += (a + b + 1);
cout << k;
return 0;
} | [
"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::endl;
return 0;
} else {
std::cout << b + a + b + 1 << std::endl;
}
return 0;
} | #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 + c << std::endl;
return 0;
} else {
std::cout << b + a + b + 1 << std::endl;
}
return 0;
} | [
"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.