problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k | fixed_code stringlengths 12 526k | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M | fixed_submission_id int64 2 1.54M | user_id stringlengths 10 10 | language stringclasses 8
values |
|---|---|---|---|---|---|---|---|
p03186 | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (c <= a + b - 1) {
cout << b + c << endl;
} else {
cout << b * 2 + a + 1 << endl;
}
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (c <= a + b + 1) {
cout << b + c << endl;
} else {
cout << b * 2 + a + 1 << endl;
}
return 0;
}
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 988,001 | 988,002 | u234413973 | cpp |
p03186 | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (c <= a + b - 1) {
cout << a + b + c << endl;
} else {
cout << b * 2 + a + 1 << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (c <= a + b + 1) {
cout << b + c << endl;
} else {
cout << b * 2 + a + 1 << endl;
}
return 0;
}
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 988,003 | 988,002 | u234413973 | cpp |
p03186 | #include <bits/stdc++.h>
int main() {
int a, b, c;
scanf("%d%d%d", &a, &b, &c);
c = std::min(c, a + b);
printf("%d\n", c + b);
return 0;
}
| #include <bits/stdc++.h>
int main() {
int a, b, c;
scanf("%d%d%d", &a, &b, &c);
c = std::min(c, a + b + 1);
printf("%d\n", c + b);
return 0;
}
| [
"assignment.change"
] | 988,011 | 988,012 | u190597469 | cpp |
p03186 | #include <algorithm>
#include <cstdio>
using namespace std;
long long a, b, c;
int main() {
scanf("%lld%lld%lld", &a, &b, &c);
c = min(c, a + b);
printf("%lld\n", c + b);
return 0;
} | #include <algorithm>
#include <cstdio>
using namespace std;
long long a, b, c;
int main() {
scanf("%lld%lld%lld", &a, &b, &c);
c = min(c, a + b + 1);
printf("%lld\n", c + b);
return 0;
} | [
"assignment.change"
] | 988,016 | 988,017 | u955769217 | 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(a + b + 1, c);
return 0;
} | [
"expression.operation.binary.add"
] | 988,020 | 988,021 | u167330161 | cpp |
p03186 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define all(v) v.begin(... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define all(v) v.begin(... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 988,047 | 988,048 | u675512317 | cpp |
p03186 | #include <iostream>
using namespace std;
int main(void) {
int r, a, b, c;
cin >> a >> b >> c;
if (a + b < r)
r = a + b + 1;
else
r = c;
cout << b + r << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main(void) {
int r, a, b, c;
cin >> a >> b >> c;
if (a + b < c)
r = a + b + 1;
else
r = c;
cout << b + r << endl;
return 0;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 988,052 | 988,053 | u787420015 | cpp |
p03186 | #include <iostream>
using namespace std;
int main(void) {
int r, a, b, c;
cin >> a >> b >> c;
if (a + b < r)
r = a + b + 1;
else
r = a + b;
cout << b + r << endl;
return 0;
} | #include <iostream>
using namespace std;
int main(void) {
int r, a, b, c;
cin >> a >> b >> c;
if (a + b < c)
r = a + b + 1;
else
r = c;
cout << b + r << endl;
return 0;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 988,054 | 988,053 | u787420015 | cpp |
p03186 | /*~~~~~~~~~~~~~~~~~ K++ code ~~~~~~~~~~~~~~~~~~~
in(a, b, c)
if(a+b+1 >= c) out(a+b)
else out(a+2*b+1)
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~*/
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>... | /*~~~~~~~~~~~~~~~~~ K++ code ~~~~~~~~~~~~~~~~~~~
in(a, b, c)
if(a+b+1 >= c) out(b+c)
else out(a+2*b+1)
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~*/
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>... | [
"expression.operation.binary.remove"
] | 988,057 | 988,058 | u657901243 | cpp |
p03186 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int a, b, c, ans;
cin >> a >> b >> c;
ans = b;
if (a + b + 1 < c)
ans += b + 1;
else
ans += c;
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long int a, b, c, ans;
cin >> a >> b >> c;
ans = b;
if (a + b + 1 < c)
ans += b + a + 1;
else
ans += c;
cout << ans << endl;
}
| [
"assignment.change"
] | 988,059 | 988,060 | u438621426 | cpp |
p03186 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <vector>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define INF 1145141919
typedef long long int ll;
using n... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <vector>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define INF 1145141919
typedef long long int ll;
using n... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 988,077 | 988,078 | u811528179 | cpp |
p03186 | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (c > a + b)
cout << a + b + b << endl;
else
cout << b + c << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (c > a + b)
cout << a + b + b + 1 << endl;
else
cout << b + c << endl;
return 0;
}
| [
"expression.operation.binary.add"
] | 988,079 | 988,080 | u617525345 | cpp |
p03186 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b, c;
scanf("%lld %lld %lld", &a, &b, &c);
if (a + b >= c) {
printf("%lld", b + c);
} else if (a + b < c) {
printf("%lld", a + b + 3);
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b, c;
scanf("%lld %lld %lld", &a, &b, &c);
if (a + b >= c) {
printf("%lld", b + c);
} else if (a + b < c) {
printf("%lld", a + b + b + 1);
}
return 0;
}
| [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 988,083 | 988,084 | u858741867 | cpp |
p03186 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b, c;
scanf("%lld %lld %lld", &a, &b, &c);
if (a + b >= c) {
printf("%lld", b + c);
} else if (a + b < c) {
printf("%lld", a + b + 2);
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b, c;
scanf("%lld %lld %lld", &a, &b, &c);
if (a + b >= c) {
printf("%lld", b + c);
} else if (a + b < c) {
printf("%lld", a + b + b + 1);
}
return 0;
}
| [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 988,085 | 988,084 | u858741867 | cpp |
p03186 | // g++ -std=c++11 a.cpp
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <typeinfo>
#incl... | // g++ -std=c++11 a.cpp
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <typeinfo>
#incl... | [
"expression.operation.binary.add"
] | 988,088 | 988,089 | u010004797 | cpp |
p03186 | // g++ -std=c++11 a.cpp
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <typeinfo>
#incl... | // g++ -std=c++11 a.cpp
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <typeinfo>
#incl... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 988,090 | 988,089 | u010004797 | cpp |
p03186 | #include <algorithm>
#include <iostream>
int main(void) {
int a, b, c;
std::cin >> a >> b >> c;
std::cout << (a + b >= c ? b + c : a + 2 * b);
} | #include <algorithm>
#include <iostream>
int main(void) {
int a, b, c;
std::cin >> a >> b >> c;
std::cout << (a + b >= c ? b + c : a + 2 * b + 1);
} | [
"expression.operation.binary.add"
] | 988,091 | 988,092 | u343074849 | cpp |
p03186 | #include <bits/stdc++.h>
#define IL __inline__ __attribute__((always_inline))
#define For(i, a, b) for (int i = a, i##end = b; i <= i##end; ++i)
#define FOR(i, a, b) for (int i = a, i##end = b; i < i##end; ++i)
#define Rep(i, a, b) for (int i = a, i##end = b; i >= i##end; --i)
#define REP(i, a, b) for (int i = (a)-1,... | #include <bits/stdc++.h>
#define IL __inline__ __attribute__((always_inline))
#define For(i, a, b) for (int i = a, i##end = b; i <= i##end; ++i)
#define FOR(i, a, b) for (int i = a, i##end = b; i < i##end; ++i)
#define Rep(i, a, b) for (int i = a, i##end = b; i >= i##end; --i)
#define REP(i, a, b) for (int i = (a)-1,... | [
"expression.operation.binary.add"
] | 988,093 | 988,094 | u657272655 | cpp |
p03186 | #include <iostream>
using namespace std;
int main() {
long long A, B, C;
cin >> A >> B >> C;
if (C <= A + B) {
cout << C + B << endl;
} else {
cout << A + B + B << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
long long A, B, C;
cin >> A >> B >> C;
if (C <= A + B) {
cout << C + B << endl;
} else {
cout << A + B + B + 1 << endl;
}
return 0;
} | [
"expression.operation.binary.add"
] | 988,097 | 988,098 | u449922162 | cpp |
p03186 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C, sum = 0;
cin >> A >> B >> C;
if (A + B > C - 1) {
sum = B + C;
} else {
sum = A + 2 * B;
}
cout << sum << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C, sum = 0;
cin >> A >> B >> C;
if (A + B > C - 1) {
sum = B + C;
} else {
sum = A + 2 * B + 1;
}
cout << sum << endl;
} | [
"assignment.change"
] | 988,101 | 988,102 | u216525464 | cpp |
p03186 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C, sum = 0;
cin >> A >> B >> C;
if (A + B > C) {
sum = B + C;
} else {
sum = A + 2 * B;
}
cout << sum << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C, sum = 0;
cin >> A >> B >> C;
if (A + B > C - 1) {
sum = B + C;
} else {
sum = A + 2 * B + 1;
}
cout << sum << endl;
} | [
"control_flow.branch.if.condition.change",
"assignment.change"
] | 988,103 | 988,102 | u216525464 | cpp |
p03186 | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int main(void) {
int a, b, c;
cin >> a >> b >> c;
if (c >= a + b)
cout << b + min(a + b + 1, c) << "a\n";
else
cout << c + b << "b\n";
return 0;
} | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int main(void) {
int a, b, c;
cin >> a >> b >> c;
if (c >= a + b)
cout << b + min(a + b + 1, c) << "\n";
else
cout << c + b << "\n";
return 0;
} | [
"literal.string.change",
"io.output.change"
] | 988,104 | 988,105 | u217596176 | cpp |
p03186 | #include <bits/stdc++.h>
using namespace std;
#define all(a) (a).begin(), (a).end()
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a + b <= c)
cout << a + b + 1 + b;
else
cout << c + b;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define all(a) (a).begin(), (a).end()
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a + b < c)
cout << a + b + 1 + b;
else
cout << c + b;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 988,115 | 988,116 | u662665711 | 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 + b + 1 << 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 + 1 >= c) {
cout << b + c << endl;
} else {
cout << a + b + b + 1 << endl;
}
} | [
"control_flow.branch.if.condition.change"
] | 988,125 | 988,126 | u952437626 | 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 + b + 1 << 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 + b + 1 << endl;
}
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 988,125 | 988,127 | u952437626 | cpp |
p03186 | /*
Converted by scratch2cpp (https://github.com/yos1up/scratch2cpp).
*/
#include <algorithm>
#include <iostream>
#include <math.h>
#include <stdlib.h>
#include <string>
#include <vector>
#define debug \
cerr << "--" << __LINE__ << "--" ... | /*
Converted by scratch2cpp (https://github.com/yos1up/scratch2cpp).
*/
#include <algorithm>
#include <iostream>
#include <math.h>
#include <stdlib.h>
#include <string>
#include <vector>
#define debug \
cerr << "--" << __LINE__ << "--" ... | [
"identifier.change",
"io.output.change"
] | 988,128 | 988,129 | u451598761 | cpp |
p03186 | #include <bits/stdc++.h>
int main(void) {
int a, b, c;
std::cin >> a >> b >> c;
std::cout << (c <= a + b ? b + c : a + 2 * b) << std::endl;
return 0;
} | #include <bits/stdc++.h>
int main(void) {
int a, b, c;
std::cin >> a >> b >> c;
std::cout << (c <= a + b ? b + c : a + 2 * b + 1) << std::endl;
return 0;
} | [
"expression.operation.binary.add"
] | 988,132 | 988,133 | u617380180 | cpp |
p03186 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
int main() {
ll a, b, c;
cin >> a >> b >> c;
if (b + a < c)
cout << 2 * b + a;
else
cout << b + c;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
int main() {
ll a, b, c;
cin >> a >> b >> c;
if (b + a < c)
cout << 2 * b + a + 1;
else
cout << b + c;... | [
"expression.operation.binary.add"
] | 988,145 | 988,146 | u511401499 | cpp |
p03186 | #include <bits/stdc++.h>
using namespace std;
using LL = long long;
int main() {
LL A, B, C;
cin >> A >> B >> C;
if (A + B >= C)
cout << B + C << endl;
else
cout << A + 2 * B << endl;
} | #include <bits/stdc++.h>
using namespace std;
using LL = long long;
int main() {
LL 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.add"
] | 988,156 | 988,157 | u149468221 | cpp |
p03186 | #include <iostream>
typedef long long ll;
int main() {
ll A, B, C;
std::cin >> A >> B >> C;
std::cout << B + (A + B > C ? C : A + B + 1) << std::endl;
return 0;
}
| #include <iostream>
typedef long long ll;
int main() {
ll A, B, C;
std::cin >> A >> B >> C;
std::cout << B + (A + B >= C ? C : A + B + 1) << std::endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 988,158 | 988,159 | u047150897 | cpp |
p03186 | #include <iostream>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
int ans = 0;
if (A + B > C) {
ans = B + C;
} else {
ans = (A + B + 1) + B;
}
cout << ans << endl;
} | #include <iostream>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
int ans = 0;
if (A + B >= C - 1) {
ans = B + C;
} else {
ans = (A + B + 1) + B;
}
cout << ans << endl;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 988,160 | 988,161 | u128142352 | cpp |
p03186 | #include <iostream>
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;
return 0;
} | #include <iostream>
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;
return 0;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 988,169 | 988,170 | u973997867 | cpp |
p03186 | #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 + b + 1;
return 0;
} | #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 + b + 1 + b;
return 0;
} | [
"expression.operation.binary.add"
] | 988,171 | 988,172 | u863104798 | cpp |
p03186 | #include <iostream>
int main() {
int A, B, C;
std::cin >> A >> B >> C;
if (A + B > C) {
std::cout << (B + C);
} else {
std::cout << (A + 2 * B);
}
return 0;
}
| #include <iostream>
int main() {
int A, B, C;
std::cin >> A >> B >> C;
if (A + B >= C) {
std::cout << (B + C);
} else {
std::cout << (A + 2 * B + 1);
}
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 988,175 | 988,176 | u261279477 | cpp |
p03186 | #include <iostream>
int main() {
int A, B, C;
std::cin >> A >> B >> C;
if (A + B >= C) {
std::cout << (B + C);
} else {
std::cout << 2 * B;
}
return 0;
}
| #include <iostream>
int main() {
int A, B, C;
std::cin >> A >> B >> C;
if (A + B >= C) {
std::cout << (B + C);
} else {
std::cout << (A + 2 * B + 1);
}
return 0;
}
| [] | 988,177 | 988,176 | u261279477 | cpp |
p03186 | #include <algorithm>
#include <array>
#include <bitset>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <valarray>
#include ... | #include <algorithm>
#include <array>
#include <bitset>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <valarray>
#include ... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 988,181 | 988,182 | u419874471 | cpp |
p03186 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (n); i++)
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define fi first
#define se second
typedef vector<int> vint;
typedef pair<int, int> pint;
typedef vector<pint> vpint;
template <typename A, ty... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (n); i++)
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define fi first
#define se second
typedef vector<int> vint;
typedef pair<int, int> pint;
typedef vector<pint> vpint;
template <typename A, ty... | [
"expression.operation.binary.add"
] | 988,183 | 988,184 | u685892567 | cpp |
p03186 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (n); i++)
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define fi first
#define se second
typedef vector<int> vint;
typedef pair<int, int> pint;
typedef vector<pint> vpint;
template <typename A, ty... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (n); i++)
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define fi first
#define se second
typedef vector<int> vint;
typedef pair<int, int> pint;
typedef vector<pint> vpint;
template <typename A, ty... | [
"identifier.replace.remove",
"literal.replace.add",
"io.output.change"
] | 988,185 | 988,184 | u685892567 | cpp |
p03186 | #include <stdio.h>
int main(void) {
int a, b, c;
scanf("%d%d%d", &a, &b, &c);
if ((a + b) >= c) {
printf("%d", b + c);
} else
printf("%d", a + b + 1);
return 0;
} | #include <stdio.h>
int main(void) {
int a, b, c;
scanf("%d%d%d", &a, &b, &c);
if ((a + b) >= c) {
printf("%d", b + c);
} else
printf("%d", a + (2 * b) + 1);
return 0;
} | [
"call.arguments.change"
] | 988,188 | 988,189 | u234221995 | cpp |
p03186 | #include <stdio.h>
int main(void) {
int a, b, c;
scanf("%d%d%d", &a, &b, &c);
if ((a + b) >= c) {
printf("%d", a + c);
} else
printf("%d", a + b + 1);
return 0;
} | #include <stdio.h>
int main(void) {
int a, b, c;
scanf("%d%d%d", &a, &b, &c);
if ((a + b) >= c) {
printf("%d", b + c);
} else
printf("%d", a + (2 * b) + 1);
return 0;
} | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 988,190 | 988,189 | u234221995 | 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(c, a + b) + b << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll a, b, c;
cin >> a >> b >> c;
cout << min(c, a + b + 1) + b << endl;
return 0;
} | [
"expression.operation.binary.add",
"control_flow.return.add",
"control_flow.return.0.add"
] | 988,191 | 988,192 | u304382419 | cpp |
p03186 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#define ll long long
#define rint register int
using namespace std;
inline char get() {
const int TOP = 1000000;
static char T[TOP], *x = T, *y = T;
return x == y && (y = (x = T) + fread(T, 1, TOP, stdin), x == y) ? EOF : *x++;
}
inline in... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#define ll long long
#define rint register int
using namespace std;
inline char get() {
const int TOP = 1000000;
static char T[TOP], *x = T, *y = T;
return x == y && (y = (x = T) + fread(T, 1, TOP, stdin), x == y) ? EOF : *x++;
}
inline in... | [
"expression.operation.binary.add"
] | 988,193 | 988,194 | u737715937 | cpp |
p03186 | #include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
int main() {
int a, b, c;
scanf("%d%d%d", &b, &a, &c);
cout << a + min(a + b, c);
} | #include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
int main() {
int a, b, c;
scanf("%d%d%d", &b, &a, &c);
cout << a + min(a + b + 1, c);
} | [
"expression.operation.binary.add"
] | 988,195 | 988,196 | u076546810 | cpp |
p03186 | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int d = min(c, a + b + 1);
cout << d + c << endl;
} | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int d = min(c, a + b + 1);
cout << b + d << endl;
} | [
"identifier.change",
"io.output.change"
] | 988,199 | 988,200 | u838457874 | cpp |
p03186 | #include <stdio.h>
int main(void) {
int a, b, c;
scanf("%d %d %d", &a, &b, &c);
if (a + b - 1 >= c) {
printf("%d\n", b + c);
} else {
printf("%d\n", b * 2 + 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) {
printf("%d\n", b + c);
} else {
printf("%d\n", b * 2 + a + 1);
}
return 0;
}
| [
"expression.operation.binary.remove"
] | 988,201 | 988,202 | u375132909 | cpp |
p03186 | #include <stdio.h>
int main(void) {
int a, b, c;
scanf("%d %d %d", &a, &b, &c);
if (a + b - 1 >= c) {
printf("%d", b + c);
} else {
printf("%d\n", b * 2 + 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) {
printf("%d\n", b + c);
} else {
printf("%d\n", b * 2 + a + 1);
}
return 0;
}
| [
"expression.operation.binary.remove",
"literal.string.change",
"call.arguments.change",
"io.output.change",
"io.output.newline.add"
] | 988,203 | 988,202 | u375132909 | cpp |
p03186 | #include <stdio.h>
int main(void) {
int a, b, c;
scanf("%d %d %d", &a, &b, &c);
if (a + b - 1 >= c) {
printf("%d", a + c);
} else {
printf("%d\n", a * 2 + b + 1);
}
return 0;
}
| #include <stdio.h>
int main(void) {
int a, b, c;
scanf("%d %d %d", &a, &b, &c);
if (a + b >= c) {
printf("%d\n", b + c);
} else {
printf("%d\n", b * 2 + a + 1);
}
return 0;
}
| [
"expression.operation.binary.remove",
"literal.string.change",
"call.arguments.change",
"io.output.change",
"io.output.newline.add",
"identifier.change",
"expression.operation.binary.change"
] | 988,204 | 988,202 | u375132909 | cpp |
p03186 | #include <iostream>
#include <string>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int tmp = 2 * (a + b) + 1;
if (tmp > c)
cout << b + c << endl;
else
cout << a + 2 * b + 1 << endl;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int tmp = (a + b) + 1;
if (tmp > c)
cout << b + c << endl;
else
cout << a + 2 * b + 1 << endl;
} | [
"expression.operation.binary.remove"
] | 988,211 | 988,212 | u949755084 | cpp |
p03186 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vi;
typedef pair<ll, ll> pi;
typedef vector<pi> vpi;
typedef long double ld;
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define MOD 1e9 + 7
ll INF = 1e15;
#define lb lower_bound
#define ub upper_bound
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vi;
typedef pair<ll, ll> pi;
typedef vector<pi> vpi;
typedef long double ld;
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define MOD 1e9 + 7
ll INF = 1e15;
#define lb lower_bound
#define ub upper_bound
... | [
"expression.operation.binary.add"
] | 988,218 | 988,219 | u938024002 | 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 + (2 * b) << endl;
} else
cout << b + c << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if ((a + b) < c) {
cout << a + (2 * b) + 1 << endl;
} else
cout << b + c << endl;
}
| [
"expression.operation.binary.add"
] | 988,220 | 988,221 | u020296964 | 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 + 2 * b << endl;
} else
cout << b + c << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if ((a + b) < c) {
cout << a + (2 * b) + 1 << endl;
} else
cout << b + c << endl;
}
| [
"control_flow.branch.if.condition.change"
] | 988,222 | 988,221 | u020296964 | cpp |
p03186 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int s;
if (c > a + b) {
s = b + a + b + 1;
} else if (c = a + b) {
s = a + 2 * b;
} else {
s = c + b;
}
cout << s << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int s;
if (c > a + b) {
s = b + a + b + 1;
} else if (c == a + b) {
s = a + 2 * b;
} else {
s = c + b;
}
cout << s << endl;
} | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 988,225 | 988,226 | u319783732 | cpp |
p03186 | #include <bits/stdc++.h>
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 <bits/stdc++.h>
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;
} | [
"expression.operation.binary.add"
] | 988,241 | 988,242 | u005899600 | cpp |
p03186 | #include <algorithm>
#include <assert.h>
#include <bits/stdc++.h>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <memory>
... | #include <algorithm>
#include <assert.h>
#include <bits/stdc++.h>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <memory>
... | [
"assignment.change"
] | 988,251 | 988,252 | u937608388 | cpp |
p03186 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long A, B, C;
cin >> A >> B >> C;
cout << min(B + C, B + A + 1) << '\n';
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long A, B, C;
cin >> A >> B >> C;
cout << B + min(C, B + A + 1) << '\n';
return 0;
}
| [
"call.remove",
"call.add"
] | 988,253 | 988,254 | u570944601 | cpp |
p03186 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <string.h>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
long long int a, b, c;
scanf("%lld %ll... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <string.h>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
long long int a, b, c;
scanf("%lld %ll... | [
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 988,255 | 988,256 | u092002408 | cpp |
p03186 | #define debug_interval ','
#define dump_interval ' '
#define debug_toggle 1
//{
#include <bits/stdc++.h>
using namespace std;
#define hi cerr << "hi" << endl;
#define int long long
#define INT_MAX LLONG_MAX
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define pb push... | #define debug_interval ','
#define dump_interval ' '
#define debug_toggle 1
//{
#include <bits/stdc++.h>
using namespace std;
#define hi cerr << "hi" << endl;
#define int long long
#define INT_MAX LLONG_MAX
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define pb push... | [
"identifier.change",
"call.function.change"
] | 988,257 | 988,258 | u130196064 | cpp |
p03186 | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n;... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n;... | [
"expression.operation.binary.add"
] | 988,259 | 988,260 | u859396346 | cpp |
p03186 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << b + min(c, a + b) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << b + min(c, a + b + 1) << endl;
return 0;
} | [
"expression.operation.binary.add"
] | 988,261 | 988,262 | u036561304 | cpp |
p03186 | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <vector>
#define X first
#define ... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <vector>
#define X first
#define ... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 988,263 | 988,264 | u382864097 | cpp |
p03186 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<vector<int>> matrix;
void solve() {
ll a, b, c;
cin >> a >> b >> c;
cout << min(b + c, 2 * a + 1) << endl;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cerr... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<vector<int>> matrix;
void solve() {
ll a, b, c;
cin >> a >> b >> c;
cout << min(b + c, a + 2 * b + 1) << endl;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
... | [
"identifier.change",
"io.output.change"
] | 988,265 | 988,266 | u109256064 | cpp |
p03186 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<vector<int>> matrix;
void solve() {
ll a, b, c;
cin >> a >> b >> c;
cout << min(b + c, 2 * a) << endl;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cerr.tie... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<vector<int>> matrix;
void solve() {
ll a, b, c;
cin >> a >> b >> c;
cout << min(b + c, a + 2 * b + 1) << endl;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
... | [
"identifier.change",
"io.output.change"
] | 988,267 | 988,266 | u109256064 | cpp |
p03186 | #include "bits/stdc++.h"
using namespace std;
#define F first
#define S second
#define mp make_pair
#define pb push_back
typedef long long int ll;
const ll N = 1e6 + 3, inf = 998244353;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
ll a, b, c;
cin >> a >> b >> c;
ll p = a + b;
ll res = 0;
if (p... | #include "bits/stdc++.h"
using namespace std;
#define F first
#define S second
#define mp make_pair
#define pb push_back
typedef long long int ll;
const ll N = 1e6 + 3, inf = 998244353;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
ll a, b, c;
cin >> a >> b >> c;
ll p = a + b;
ll res = 0;
if (p... | [
"assignment.change"
] | 988,270 | 988,271 | u800823145 | cpp |
p03186 | //#include <bits/stdc++.h>
//#include <stdio.h>
#include <algorithm>
#include <bitset>
#include <cstdio>
#include <iostream>
#include <list>
#include <queue>
#include <stack>
#include <vector>
//#include <bits/stdc++.h>
#include <cctype>
#include <cmath>
#include <cstring>
#include <fstream>
#include <functional>
#incl... | //#include <bits/stdc++.h>
//#include <stdio.h>
#include <algorithm>
#include <bitset>
#include <cstdio>
#include <iostream>
#include <list>
#include <queue>
#include <stack>
#include <vector>
//#include <bits/stdc++.h>
#include <cctype>
#include <cmath>
#include <cstring>
#include <fstream>
#include <functional>
#incl... | [
"expression.operation.binary.remove"
] | 988,278 | 988,279 | u043443359 | cpp |
p03186 | //#include <bits/stdc++.h>
//#include <stdio.h>
#include <algorithm>
#include <bitset>
#include <cstdio>
#include <iostream>
#include <list>
#include <queue>
#include <stack>
#include <vector>
//#include <bits/stdc++.h>
#include <cctype>
#include <cmath>
#include <cstring>
#include <fstream>
#include <functional>
#incl... | //#include <bits/stdc++.h>
//#include <stdio.h>
#include <algorithm>
#include <bitset>
#include <cstdio>
#include <iostream>
#include <list>
#include <queue>
#include <stack>
#include <vector>
//#include <bits/stdc++.h>
#include <cctype>
#include <cmath>
#include <cstring>
#include <fstream>
#include <functional>
#incl... | [
"assignment.change"
] | 988,280 | 988,279 | u043443359 | cpp |
p03186 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <set>
#include <string>
using namespace std;
int main(void) {
ios::sync_with_stdio(false);
long A, B, C, re;
cin >> A >> B >> C;
if (A + B >= C) {
re = B + C;
} else {
re = 2 * B + A;
}
cout << re;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <set>
#include <string>
using namespace std;
int main(void) {
ios::sync_with_stdio(false);
long A, B, C, re;
cin >> A >> B >> C;
if (A + B >= C) {
re = B + C;
} else {
re = 2 * B + A + 1;
}
cout << re;
return 0;
}
| [
"assignment.change"
] | 988,281 | 988,282 | u809278162 | cpp |
p03186 | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (c >= a + b)
cout << a + 2 * b + 1;
else
cout << b + c << endl;
} | #include <iostream>
using namespace std;
int main() {
long int a, b, c;
cin >> a >> b >> c;
if (c > a + b)
cout << a + 2 * b + 1;
else
cout << b + c << endl;
} | [
"variable_declaration.type.widen.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 988,287 | 988,288 | u843842420 | cpp |
p03186 | #include <iostream>
using namespace std;
int main(void) {
// Your code here!
int a, b, c;
cin >> a >> b >> c;
if (c >= (a + b)) {
cout << a + 2 * b + 1;
} else {
cout << b + c;
}
} | #include <iostream>
using namespace std;
int main(void) {
// Your code here!
int a, b, c;
cin >> a >> b >> c;
if (c > (a + b)) {
cout << a + 2 * b + 1;
} else {
cout << b + c;
}
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 988,289 | 988,290 | u019356802 | cpp |
p03186 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
int main(int argc, char *argv[]) {
long long int a, b, c;
long long int ans = 0;
cin >> a >> b >> c;
if (a + b >= c)
ans = ... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
int main(int argc, char *argv[]) {
long long int a, b, c;
long long int ans = 0;
cin >> a >> b >> c;
if (a + b >= c)
ans = ... | [
"assignment.change",
"literal.number.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 988,296 | 988,297 | u147325103 | cpp |
p03186 | #include <bits/stdc++.h>
#define ll long long int
#define ld long double
#define pb push_back
#define ff first
#define ss second
#define debug1(a) cout << a << "\n";
#define debug3(a, b, c) cout << a << " " << b << " " << c << "\n";
#define debug2(a, b) cout << a << " " << b << "\n";
#define debug4(a, b, c, d) ... | #include <bits/stdc++.h>
#define ll long long int
#define ld long double
#define pb push_back
#define ff first
#define ss second
#define debug1(a) cout << a << "\n";
#define debug3(a, b, c) cout << a << " " << b << " " << c << "\n";
#define debug2(a, b) cout << a << " " << b << "\n";
#define debug4(a, b, c, d) ... | [
"expression.operation.binary.add"
] | 988,300 | 988,301 | u757055962 | cpp |
p03186 | #include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (n); i++)
#define chmin(x, y) (x) = min((x), (y))
#define chmax(x, y) (x) = max((x), (y))
#define endl "\n"
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
template <ty... | #include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (n); i++)
#define chmin(x, y) (x) = min((x), (y))
#define chmax(x, y) (x) = max((x), (y))
#define endl "\n"
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
template <ty... | [
"call.remove",
"call.arguments.change"
] | 988,304 | 988,305 | u745250049 | cpp |
p03186 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, S;
cin >> N >> M >> S;
int count = 0;
if (N + M > S) {
count = S + M;
} else {
count = (N + M) * 2 - N + 1;
}
cout << count << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, S;
cin >> N >> M >> S;
int count = 0;
if (N + M >= S) {
count = S + M;
} else {
count = (N + M) * 2 - N + 1;
}
cout << count << endl;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 988,310 | 988,311 | u989696545 | cpp |
p03186 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define FOR... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define FOR... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 988,314 | 988,315 | u128676584 | cpp |
p03186 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define FOR... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define FOR... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 988,316 | 988,315 | u128676584 | cpp |
p03186 | #include <algorithm>
#include <complex>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#define rep(i, a) for (int i = 0; i < (a); i++)
using namespace std;
int main() {
long long int a, b, c;
cin >> a >> b >> c;
long long int ans = 0;
if (a +... | #include <algorithm>
#include <complex>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#define rep(i, a) for (int i = 0; i < (a); i++)
using namespace std;
int main() {
long long int a, b, c;
cin >> a >> b >> c;
long long int ans = 0;
if (a +... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 988,319 | 988,320 | u536712674 | cpp |
p03186 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
long A, B, C;
cin >> A >> B >> C;
if (A + B >= C)
cout << B + C << endl;
else
cout << A + B + B << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
long 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"
] | 988,321 | 988,322 | u382513779 | cpp |
p03186 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define FOR(i, b, e) for (ll i = (ll)(b); i < (ll)(e); ++i... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define FOR(i, b, e) for (ll i = (ll)(b); i < (ll)(e); ++i... | [
"expression.operation.binary.add"
] | 988,324 | 988,325 | u715750943 | cpp |
p03186 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, n) for (int i = 0; i < n; i++)
#define why(n, x) \
int n; \
while (cin >> n, n != x)
#define iFOR(i, x, n) for (int i = x; i... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, n) for (int i = 0; i < n; i++)
#define why(n, x) \
int n; \
while (cin >> n, n != x)
#define iFOR(i, x, n) for (int i = x; i... | [
"identifier.replace.add",
"literal.replace.remove",
"io.output.change"
] | 988,326 | 988,327 | u678146855 | cpp |
p03186 | #include <stdio.h>
int main() {
int a, b, c, ans = 0;
scanf("%d %d %d", &a, &b, &c);
if (a + b - 1 <= c)
ans = (a + b + 1) + b;
else
ans = c + b;
printf("%d", ans);
} | #include <stdio.h>
int main() {
int a, b, c, ans = 0;
scanf("%d %d %d", &a, &b, &c);
if (a + b + 1 <= c)
ans = (a + b + 1) + b;
else
ans = c + b;
printf("%d", ans);
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 988,334 | 988,335 | u857348954 | cpp |
p03186 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
map<int, int> mp;
map<int, int> mm;
#define ll long l... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
map<int, int> mp;
map<int, int> mm;
#define ll long l... | [
"control_flow.branch.if.condition.change"
] | 988,340 | 988,341 | u154672915 | cpp |
p03186 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
using namespace std;
long long a, b, c;
int main() {
cin >> a >> b >> c;
cout << ((a + b >= c) ? (c + b) : (b));
} | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
using namespace std;
long long a, b, c;
int main() {
cin >> a >> b >> c;
cout << ((a + b >= c) ? (c + b) : (2 * b + 1 + a));
} | [
"expression.operation.binary.add"
] | 988,347 | 988,348 | u950603962 | cpp |
p03186 | // Created by sz
#include <bits/stdc++.h>
using namespace std;
int main() {
#ifdef LOCAL
freopen("./input.txt", "r", stdin);
#endif
ios_base::sync_with_stdio(false);
cin.tie(0);
int a, b, c;
cin >> a >> b >> c;
if (a + b >= c + 1)
cout << b + c;
else
cout << a + 2 * b + 1;
cout << endl;
re... | // Created by sz
#include <bits/stdc++.h>
using namespace std;
int main() {
#ifdef LOCAL
freopen("./input.txt", "r", stdin);
#endif
ios_base::sync_with_stdio(false);
cin.tie(0);
int a, b, c;
cin >> a >> b >> c;
if (a + b + 1 >= c)
cout << b + c;
else
cout << a + 2 * b + 1;
cout << endl;
re... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 988,349 | 988,350 | u041075929 | cpp |
p03186 | #include <algorithm>
#include <cstdio>
#include <cstdlib>
using namespace std;
int a, b, c;
int main() {
scanf("%d%d%d", &a, &b, &c);
if (a + b >= c)
printf("%d", b + c);
else {
printf("%d", a + b + b);
}
} | #include <algorithm>
#include <cstdio>
#include <cstdlib>
using namespace std;
int a, b, c;
int main() {
scanf("%d%d%d", &a, &b, &c);
if (a + b >= c)
printf("%d", b + c);
else
printf("%d", a + b + b + 1);
} | [
"expression.operation.binary.add"
] | 988,357 | 988,358 | u059124369 | cpp |
p03186 | #include <bits/stdc++.h>
#define rep(i, x, y) for (register int i = x; i <= y; ++i)
#define repd(i, x, y) for (register int i = x; i >= y; --i)
typedef long long ll;
using namespace std;
template <typename T> inline bool chkmax(T &x, T y) {
return x < y ? x = y, 1 : 0;
}
template <typename T> inline bool chkmin(T &x,... | #include <bits/stdc++.h>
#define rep(i, x, y) for (register int i = x; i <= y; ++i)
#define repd(i, x, y) for (register int i = x; i >= y; --i)
typedef long long ll;
using namespace std;
template <typename T> inline bool chkmax(T &x, T y) {
return x < y ? x = y, 1 : 0;
}
template <typename T> inline bool chkmin(T &x,... | [
"expression.operation.binary.add"
] | 988,362 | 988,363 | u084247138 | cpp |
p03186 | // Code by 27.
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <memory.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdlib.h>
#include <string>
#include <tim... | // Code by 27.
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <memory.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdlib.h>
#include <string>
#include <tim... | [
"expression.operation.binary.add"
] | 988,366 | 988,367 | u147008092 | cpp |
p03186 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b, c;
cin >> a >> b >> c;
long long ans = 0;
ans += min(a + b, c) + 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;
ans += min(a + b + 1, c) + b;
cout << ans << endl;
return 0;
} | [
"assignment.change"
] | 988,512 | 988,513 | u212904724 | cpp |
p03186 | #include <bits/stdc++.h>
using namespace std;
int a, b, c;
int main() {
cin >> a >> b >> c;
cout << min(a + b, c) + b << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int a, b, c;
int main() {
cin >> a >> b >> c;
cout << min(a + b + 1, c) + b << endl;
return 0;
} | [
"expression.operation.binary.add"
] | 988,516 | 988,517 | u032327689 | cpp |
p03186 | #include <bits/stdc++.h>
#define all(x) x.begin(), x.end()
#define dbg(x) cerr << #x << " = " << x << endl
#define _ << ' ' <<
using namespace std;
using ll = long long;
using vi = vector<int>;
using ii = pair<int, int>;
using vii = vector<ii>;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int a, b, c;
... | #include <bits/stdc++.h>
#define all(x) x.begin(), x.end()
#define dbg(x) cerr << #x << " = " << x << endl
#define _ << ' ' <<
using namespace std;
using ll = long long;
using vi = vector<int>;
using ii = pair<int, int>;
using vii = vector<ii>;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int a, b, c;
... | [
"expression.operation.binary.remove"
] | 988,518 | 988,519 | u562319622 | cpp |
p03187 | #include <bits/stdc++.h>
#define Tp template <typename Ty>
#define Ts template <typename Ty, typename... Ar>
#define Reg register
#define RI Reg int
#define Con const
#define CI Con int &
#define I inline
#define W while
#define N 200000
#define LL long long
#define Gmax(x, y) (x < (y) && (x = (y)))
using namespace std... | #include <bits/stdc++.h>
#define Tp template <typename Ty>
#define Ts template <typename Ty, typename... Ar>
#define Reg register
#define RI Reg int
#define Con const
#define CI Con int &
#define I inline
#define W while
#define N 200000
#define LL long long
#define Gmax(x, y) (x < (y) && (x = (y)))
using namespace std... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 988,524 | 988,525 | u752711517 | cpp |
p03187 | // base: https://atcoder.jp/contests/agc030/submissions/7566849#
// cf. https://ferin-tech.hatenablog.com/entry/2019/01/04/052343
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#inclu... | // base: https://atcoder.jp/contests/agc030/submissions/7566849#
// cf. https://ferin-tech.hatenablog.com/entry/2019/01/04/052343
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#inclu... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 988,533 | 988,534 | u328294851 | cpp |
p03187 | #include <bits/stdc++.h>
#define x first
#define y second
#define y1 Y1
#define y2 Y2
#define mp make_pair
#define pb push_back
#define DEBUG(x) cout << #x << " = " << x << endl;
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
template <typename T> inline int Chkmax(T &a, T b) {
return a < ... | #include <bits/stdc++.h>
#define x first
#define y second
#define y1 Y1
#define y2 Y2
#define mp make_pair
#define pb push_back
#define DEBUG(x) cout << #x << " = " << x << endl;
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
template <typename T> inline int Chkmax(T &a, T b) {
return a < ... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 988,537 | 988,538 | u530846427 | cpp |
p03181 | #include <bits/stdc++.h>
#define endl "\n"
using namespace std;
typedef long long int lli;
const lli N = 1e5 + 5;
vector<lli> v[N];
lli ans[N], dp[N], M;
void dfs1(lli x, lli par) {
dp[x] = 1LL;
for (auto j : v[x]) {
if (j == par)
continue;
dfs1(j, x);
dp[x] *= dp[j];
dp[x] %= M;
}
dp[x]... | #include <bits/stdc++.h>
#define endl "\n"
using namespace std;
typedef long long int lli;
const lli N = 1e5 + 5;
vector<lli> v[N];
lli ans[N], dp[N], M;
void dfs1(lli x, lli par) {
dp[x] = 1LL;
for (auto j : v[x]) {
if (j == par)
continue;
dfs1(j, x);
dp[x] *= dp[j];
dp[x] %= M;
}
dp[x]... | [
"expression.unary.arithmetic.add"
] | 988,368 | 988,369 | u618540713 | cpp |
p03181 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
const int INF = (1 << 30) - 1;
const long long LINF = (1LL << 62) - 1;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
const int INF = (1 << 30) - 1;
const long long LINF = (1LL << 62) - 1;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
... | [
"call.remove",
"call.arguments.change"
] | 988,380 | 988,381 | u608258653 | cpp |
p03181 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> G(n), x(n);
vector<int> dp(n, 1), par(n);
for (int i = 0; i < n - 1; i++) {
int u, v;
cin >> u >> v;
u--;
v--;
G[u].push_back(v);
G[v].push_back(u);
}
function<void(int, int)> d... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> G(n), x(n);
vector<int> dp(n, 1), par(n);
for (int i = 0; i < n - 1; i++) {
int u, v;
cin >> u >> v;
u--;
v--;
G[u].push_back(v);
G[v].push_back(u);
}
function<void(int, int)> d... | [
"control_flow.loop.for.condition.change"
] | 988,382 | 988,383 | u047554023 | cpp |
p03181 | #include <bits/stdc++.h>
using namespace std;
using lli = long long int;
const int MX = 1e5 + 10;
vector<int> adj[MX];
int ans[MX];
lli mod;
struct node {
node *left, *right;
short int height;
int size;
int value, prod;
node(int value = 1)
: left(NULL), right(NULL), value(value), prod(value), height(... | #include <bits/stdc++.h>
using namespace std;
using lli = long long int;
const int MX = 1e5 + 10;
vector<int> adj[MX];
int ans[MX];
lli mod;
struct node {
node *left, *right;
short int height;
int size;
int value, prod;
node(int value = 1)
: left(NULL), right(NULL), value(value), prod(value), height(... | [
"function.return_value.change"
] | 988,396 | 988,397 | u442895299 | cpp |
p03181 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll M = 1e5 + 50;
ll dp[M], dp1[M], mod, n;
vector<ll> graph[M], pre[M], post[M];
void read_graph() {
for (int i = 0; i < n - 1; i++) {
int a, b;
cin >> a >> b;
a--, b--;
graph[a].push_back(b);
graph[b].push_back(a);
}
}
vo... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll M = 1e5 + 50;
ll dp[M], dp1[M], mod, n;
vector<ll> graph[M], pre[M], post[M];
void read_graph() {
for (int i = 0; i < n - 1; i++) {
int a, b;
cin >> a >> b;
a--, b--;
graph[a].push_back(b);
graph[b].push_back(a);
}
}
vo... | [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove",
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 988,398 | 988,399 | u202796595 | cpp |
p03181 | #include <algorithm>
#include <bits/stdc++.h>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <iomanip>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#in... | #include <algorithm>
#include <bits/stdc++.h>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <iomanip>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#in... | [
"literal.number.change",
"call.arguments.change"
] | 988,406 | 988,407 | u431173823 | cpp |
p03181 | //#pragma GCC optimize("O3")
//#pragma comment(linker, "/STACK:1024000000,1024000000")
#include <bits/stdc++.h>
using namespace std;
function<void(void)> ____ = []() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
};
using LL = int_fast64_t;
const int MAXN = 1e5 + 7;
int n;
LL m, dp[MAXN], f[MAXN];
v... | //#pragma GCC optimize("O3")
//#pragma comment(linker, "/STACK:1024000000,1024000000")
#include <bits/stdc++.h>
using namespace std;
function<void(void)> ____ = []() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
};
using LL = int_fast64_t;
const int MAXN = 1e5 + 7;
int n;
LL m, dp[MAXN], f[MAXN];
v... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"control_flow.loop.for.initializer.change"
] | 988,408 | 988,409 | u231378282 | cpp |
p03181 | // header
#ifdef LOCAL
#include "cxx-prettyprint-master/prettyprint.hpp"
#define print(x) cout << x << endl
#else
#define print(...) 42
#endif
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
// types
using namespace std;
using ll = long long;
typedef pair<ll, ll> Pl;
typedef pair<int, int> Pi;
typedef vector<ll>... | // header
#ifdef LOCAL
#include "cxx-prettyprint-master/prettyprint.hpp"
#define print(x) cout << x << endl
#else
#define print(...) 42
#endif
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
// types
using namespace std;
using ll = long long;
typedef pair<ll, ll> Pl;
typedef pair<int, int> Pi;
typedef vector<ll>... | [
"assignment.change"
] | 988,412 | 988,413 | u310678820 | cpp |
p03181 | #include <bits/stdc++.h>
using namespace std;
const int N = 200005;
const long long MOD = 1e9 + 7;
int n, now[N];
int v[N], nxt[N], head[N];
long long m, dp[N], l[N], r[N], ans[N];
void dfs(int x, int fa) {
dp[x] = 1;
for (int i = head[x]; i > 0; i = nxt[i]) {
if (v[i] == fa)
continue;
dfs(v[i], x),... | #include <bits/stdc++.h>
using namespace std;
const int N = 200005;
const long long MOD = 1e9 + 7;
int n, now[N];
int v[N], nxt[N], head[N];
long long m, dp[N], l[N], r[N], ans[N];
void dfs(int x, int fa) {
dp[x] = 1;
for (int i = head[x]; i > 0; i = nxt[i]) {
if (v[i] == fa)
continue;
dfs(v[i], x),... | [
"assignment.change"
] | 988,414 | 988,415 | u541361127 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.