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 |
|---|---|---|---|---|---|---|---|
p03011 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define MOD (1000000007)
using namespace std;
typedef long long int Int;
int main(void) {
int p, q, r;
cin >> p >> q >> r;
int sum = INT_MAX;
sum = min(p + q, sum);
sum = min(p + r, sum);
sum = min(q + p, sum);
cout << sum << endl;
return 0;
}
| #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define MOD (1000000007)
using namespace std;
typedef long long int Int;
int main(void) {
int p, q, r;
cin >> p >> q >> r;
int sum = INT_MAX;
sum = min(p + q, sum);
sum = min(p + r, sum);
sum = min(q + r, sum);
cout << sum << endl;
return 0;
}
| [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 822,826 | 822,827 | u498141549 | cpp |
p03011 | #include <bits/stdc++.h>
#include <stdlib.h>
using namespace std;
typedef long long ll;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << a + b + c - max(a, (b, c)) << endl;
return 0;
}
| #include <bits/stdc++.h>
#include <stdlib.h>
using namespace std;
typedef long long ll;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << a + b + c - max(a, max(b, c)) << endl;
return 0;
}
| [
"call.add",
"call.arguments.change"
] | 822,828 | 822,829 | u201553784 | cpp |
p03011 | #include <algorithm>
#include <cassert>
#include <functional>
#include <iostream>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int p, q, r;
cin >> p >> q >> r;
cout << min(q + p, min(p + q, q + r)) << endl;
return 0;
}
| #include <algorithm>
#include <cassert>
#include <functional>
#include <iostream>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int p, q, r;
cin >> p >> q >> r;
cout << min(r + p, min(p + q, q + r)) << endl;
return 0;
}
| [
"identifier.change",
"io.output.change"
] | 822,830 | 822,831 | u602267597 | cpp |
p03011 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define inf 1001001001
typedef pair<int, int> P;
int main() {
int p, q, r;
cin >> p >> q >> r;
int a = p + q;
int b = q + r;
int c = r + p;
cout << min(p, min(q, r)) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define inf 1001001001
typedef pair<int, int> P;
int main() {
int p, q, r;
cin >> p >> q >> r;
int a = p + q;
int b = q + r;
int c = r + p;
cout << min(a, min(b, c)) << endl;
return 0;
} | [
"identifier.change",
"io.output.change"
] | 822,832 | 822,833 | u001327021 | cpp |
p03011 | #include <bits/stdc++.h>
using namespace std;
int main() {
int p, q, r;
cin >> p >> q >> r;
if (p > q && p > r) {
cout << q + r << endl;
} else if (q > p && q > r) {
cout << p + r << endl;
} else {
cout << p + q << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int p, q, r;
cin >> p >> q >> r;
if (p >= q && p >= r) {
cout << q + r << endl;
} else if (q >= p && q >= r) {
cout << p + r << endl;
} else {
cout << p + q << endl;
}
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 822,834 | 822,835 | u164352406 | cpp |
p03011 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a + b < a + c && a + b < b + c)
cout << a + b << endl;
else if (a + c < a + b && a + c < b + c)
cout << a + c << 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 <= a + c && a + b <= b + c)
cout << a + b << endl;
else if (a + c <= a + b && a + c <= b + c)
cout << a + c << endl;
else
cout << b + c << endl;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 822,836 | 822,837 | u613960672 | cpp |
p03011 | #include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007;
const long long INF = 1LL << 60;
int main() {
int P, Q, R;
cin >> P >> Q >> R;
int ans = 0;
ans = max(P + R, max(P + Q, Q + R));
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007;
const long long INF = 1LL << 60;
int main() {
int P, Q, R;
cin >> P >> Q >> R;
int ans = 0;
ans = min(P + R, min(P + Q, Q + R));
cout << ans << endl;
}
| [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change",
"call.arguments.change"
] | 822,838 | 822,839 | u665871498 | cpp |
p03011 | #include <algorithm>
#include <iostream>
using namespace std;
int main(void) {
int a, b, c;
cin >> a >> b >> c;
cout << max(a + b, max(a + c, b + c));
return 0;
}
| #include <algorithm>
#include <iostream>
using namespace std;
int main(void) {
int a, b, c;
cin >> a >> b >> c;
cout << min(a + b, min(a + c, b + c)) << endl;
return 0;
}
| [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change",
"io.output.newline.add"
] | 822,851 | 822,852 | u959692740 | cpp |
p03011 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, smallest;
cin >> a >> b >> c;
smallest = a + b;
if (smallest > a + c) {
smallest == a + c;
}
if (smallest > b + c) {
smallest = b + c;
}
cout << smallest;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, smallest;
cin >> a >> b >> c;
smallest = a + b;
if (smallest > a + c) {
smallest = a + c;
}
if (smallest > b + c) {
smallest = b + c;
}
cout << smallest;
}
| [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 822,853 | 822,854 | u026375009 | cpp |
p03011 | #include <bits/stdc++.h>
using namespace std;
int main() {
int p, q, r;
cin >> p, q, r;
cout << min({p + q, q + r, r + p}) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int p, q, r;
cin >> p >> q >> r;
cout << min({p + q, q + r, r + p}) << endl;
} | [] | 822,871 | 822,872 | u761989513 | cpp |
p03011 | #include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const double PI = 3.14159265358979323846;
const int64_t waru = 1000000007;
using in = int64_t;
int main() {
int p, q, r;
cin >> p >> q >> r;
int a1, a2, a3;
a1 = p + q;
a2 = q + r;
a3 = p + r;
cout << max(a1, max(a2, a3));
}
| #include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const double PI = 3.14159265358979323846;
const int64_t waru = 1000000007;
using in = int64_t;
int main() {
int p, q, r;
cin >> p >> q >> r;
int a1, a2, a3;
a1 = p + q;
a2 = q + r;
a3 = p + r;
cout << min(a1, min(a2, a3));
}
| [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 822,873 | 822,874 | u424602097 | cpp |
p03011 | #include <algorithm>
#include <bitset>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define i64 int64_t
#define ff(ii, nn, mm) for (int ii = nn; ii < mm; ii++)
#define st(vvv) sort(vvv.begin(), vvv.end())
#define rvs(vvv) reverse(vvv.begin(), vvv.end())
int inf = 1000000007;
i64 giant = 4000000000000000000;
using namespace std;
int main() {
int p, q, r;
cin >> p >> q >> r;
int ans = p + q + r;
ans -= min(p, min(q, r));
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <bitset>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define i64 int64_t
#define ff(ii, nn, mm) for (int ii = nn; ii < mm; ii++)
#define st(vvv) sort(vvv.begin(), vvv.end())
#define rvs(vvv) reverse(vvv.begin(), vvv.end())
int inf = 1000000007;
i64 giant = 4000000000000000000;
using namespace std;
int main() {
int p, q, r;
cin >> p >> q >> r;
int ans = p + q + r;
ans -= max(p, max(q, r));
cout << ans << endl;
return 0;
} | [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change",
"call.arguments.change"
] | 822,875 | 822,876 | u771541325 | cpp |
p03011 | /*{{{*/
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define SZ(X) ((int)(X).size())
#define ALL(X) (X).begin(), (X).end()
#define REP(I, N) for (int I = 0; I < (N); ++I)
#define REPP(I, A, B) for (int I = (A); I < (B); ++I)
#define FOR(I, A, B) for (int I = (A); I <= (B); ++I)
#define FORS(I, S) for (int I = 0; S[I]; ++I)
#define RS(X) scanf("%s", (X))
#define SORT_UNIQUE(c) \
(sort(c.begin(), c.end()), \
c.resize(distance(c.begin(), unique(c.begin(), c.end()))))
#define GET_POS(c, x) (lower_bound(c.begin(), c.end(), x) - c.begin())
#define CASET \
int ___T; \
scanf("%d", &___T); \
for (int cs = 1; cs <= ___T; cs++)
#define MP make_pair
#define PB push_back
#define MS0(X) memset((X), 0, sizeof((X)))
#define MS1(X) memset((X), -1, sizeof((X)))
#define LEN(X) strlen(X)
#define F first
#define S second
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef long double LD;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<LL> VL;
typedef vector<PII> VPII;
typedef pair<LL, LL> PLL;
typedef vector<PLL> VPLL;
template <class T> void _R(T &x) { cin >> x; }
void _R(int &x) { scanf("%d", &x); }
void _R(LL &x) { scanf("%lld", &x); }
void _R(double &x) { scanf("%lf", &x); }
void _R(char &x) { scanf(" %c", &x); }
void _R(char *x) { scanf("%s", x); }
void R() {}
template <class T, class... U> void R(T &head, U &...tail) {
_R(head);
R(tail...);
}
template <class T> void _W(const T &x) { cout << x; }
void _W(const int &x) { printf("%d", x); }
void _W(const LL &x) { printf("%lld", x); }
void _W(const double &x) { printf("%.16f", x); }
void _W(const char &x) { putchar(x); }
void _W(const char *x) { printf("%s", x); }
template <class T, class U> void _W(const pair<T, U> &x) {
_W(x.F);
putchar(' ');
_W(x.S);
}
template <class T> void _W(const vector<T> &x) {
for (auto i = x.begin(); i != x.end(); _W(*i++))
if (i != x.cbegin())
putchar(' ');
}
void W() {}
template <class T, class... U> void W(const T &head, const U &...tail) {
_W(head);
putchar(sizeof...(tail) ? ' ' : '\n');
W(tail...);
}
#ifdef HOME
#define DEBUG(...) \
{ \
printf("# "); \
printf(__VA_ARGS__); \
puts(""); \
}
#else
#define DEBUG(...)
#endif
int MOD = 1e9 + 7;
void ADD(LL &x, LL v) {
x = (x + v) % MOD;
if (x < 0)
x += MOD;
}
/*}}}*/
const int SIZE = 1e6 + 10;
int main() {
int A, B, C;
R(A, B, C);
W(A + B + C - min({A, B, C}));
return 0;
}
| /*{{{*/
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define SZ(X) ((int)(X).size())
#define ALL(X) (X).begin(), (X).end()
#define REP(I, N) for (int I = 0; I < (N); ++I)
#define REPP(I, A, B) for (int I = (A); I < (B); ++I)
#define FOR(I, A, B) for (int I = (A); I <= (B); ++I)
#define FORS(I, S) for (int I = 0; S[I]; ++I)
#define RS(X) scanf("%s", (X))
#define SORT_UNIQUE(c) \
(sort(c.begin(), c.end()), \
c.resize(distance(c.begin(), unique(c.begin(), c.end()))))
#define GET_POS(c, x) (lower_bound(c.begin(), c.end(), x) - c.begin())
#define CASET \
int ___T; \
scanf("%d", &___T); \
for (int cs = 1; cs <= ___T; cs++)
#define MP make_pair
#define PB push_back
#define MS0(X) memset((X), 0, sizeof((X)))
#define MS1(X) memset((X), -1, sizeof((X)))
#define LEN(X) strlen(X)
#define F first
#define S second
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef long double LD;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<LL> VL;
typedef vector<PII> VPII;
typedef pair<LL, LL> PLL;
typedef vector<PLL> VPLL;
template <class T> void _R(T &x) { cin >> x; }
void _R(int &x) { scanf("%d", &x); }
void _R(LL &x) { scanf("%lld", &x); }
void _R(double &x) { scanf("%lf", &x); }
void _R(char &x) { scanf(" %c", &x); }
void _R(char *x) { scanf("%s", x); }
void R() {}
template <class T, class... U> void R(T &head, U &...tail) {
_R(head);
R(tail...);
}
template <class T> void _W(const T &x) { cout << x; }
void _W(const int &x) { printf("%d", x); }
void _W(const LL &x) { printf("%lld", x); }
void _W(const double &x) { printf("%.16f", x); }
void _W(const char &x) { putchar(x); }
void _W(const char *x) { printf("%s", x); }
template <class T, class U> void _W(const pair<T, U> &x) {
_W(x.F);
putchar(' ');
_W(x.S);
}
template <class T> void _W(const vector<T> &x) {
for (auto i = x.begin(); i != x.end(); _W(*i++))
if (i != x.cbegin())
putchar(' ');
}
void W() {}
template <class T, class... U> void W(const T &head, const U &...tail) {
_W(head);
putchar(sizeof...(tail) ? ' ' : '\n');
W(tail...);
}
#ifdef HOME
#define DEBUG(...) \
{ \
printf("# "); \
printf(__VA_ARGS__); \
puts(""); \
}
#else
#define DEBUG(...)
#endif
int MOD = 1e9 + 7;
void ADD(LL &x, LL v) {
x = (x + v) % MOD;
if (x < 0)
x += MOD;
}
/*}}}*/
const int SIZE = 1e6 + 10;
int main() {
int A, B, C;
R(A, B, C);
W(A + B + C - max({A, B, C}));
return 0;
}
| [
"misc.opposites",
"identifier.change",
"call.function.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 822,879 | 822,880 | u284124505 | cpp |
p03011 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C, WA, WB, WC, min;
cin >> A >> B >> C;
WA = A + B;
WB = B + C;
WC = C + A;
min = WA;
if (WB < WA) {
min = WB;
}
if (WC < min) {
min = WC;
}
cout << WC << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C, WA, WB, WC, min;
cin >> A >> B >> C;
WA = A + B;
WB = B + C;
WC = C + A;
min = WA;
if (WB < WA) {
min = WB;
}
if (WC < min) {
min = WC;
}
cout << min << endl;
} | [
"identifier.change",
"io.output.change"
] | 822,883 | 822,884 | u962997675 | cpp |
p03011 | #include <iostream>
using namespace std;
int main() {
int p, q, r;
int a, b, c;
cin >> p >> q >> r;
a = p + q;
b = q + r;
c = r + p;
if (a >= b && a >= c) {
std::cout << a << std::endl;
} else if (b >= c && b > a) {
std::cout << b << std::endl;
} else {
std::cout << c << std::endl;
}
} | #include <iostream>
using namespace std;
int main() {
int p, q, r;
int a, b, c;
cin >> p >> q >> r;
a = p + q;
b = q + r;
c = r + p;
if (a <= b && a <= c) {
std::cout << a << std::endl;
} else if (b <= c && b < a) {
std::cout << b << std::endl;
} else {
std::cout << c << std::endl;
}
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 822,897 | 822,898 | u999788719 | cpp |
p03011 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
using ll = long long;
int main() {
int p, q, r;
cin >> p >> q >> r;
cout << min(p + q, min(q + r, q + r)) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
using ll = long long;
int main() {
int p, q, r;
cin >> p >> q >> r;
cout << min(p + q, min(q + r, p + r)) << endl;
return 0;
} | [
"identifier.change",
"io.output.change"
] | 822,911 | 822,912 | u970690920 | cpp |
p03011 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a[10];
for (int i = 0; i < 3; i++) {
cin >> a[i];
}
sort(a, a + 3);
cout << a[1] + a[2] << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a[10];
for (int i = 0; i < 3; i++) {
cin >> a[i];
}
sort(a, a + 3);
cout << a[0] + a[1] << endl;
return 0;
}
| [
"literal.number.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 822,919 | 822,920 | u526894223 | cpp |
p03011 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)n; i++)
#define MAX_N 100000
typedef long long ll;
void solve() {
int a[3];
cin >> a[0] >> a[1] >> a[2];
int ans = 301;
REP(i, 3)
for (int j = i + 1; j < 3; j++)
ans = min(a[i] * a[j], ans);
cout << ans << endl;
}
int main() {
solve();
return 0;
} | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)n; i++)
#define MAX_N 100000
typedef long long ll;
void solve() {
int a[3];
cin >> a[0] >> a[1] >> a[2];
int ans = 301;
REP(i, 3)
for (int j = i + 1; j < 3; j++)
ans = min(a[i] + a[j], ans);
cout << ans << endl;
}
int main() {
solve();
return 0;
}
| [
"expression.operator.arithmetic.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 822,921 | 822,922 | u754909749 | cpp |
p03011 | #include <iostream>
using namespace std;
int main() {
int n, r, m;
cin >> n >> r >> m;
if ((n + r) <= (n + m) && (n + r) <= (r + m)) {
cout << n + r;
} else if ((n + m) <= (n + r) && (n + m) <= (r + m)) {
cout << n + r;
} else if ((m + r) <= (n + m) && (m + r) <= (n + r)) {
cout << n + r;
}
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int n, r, m;
cin >> n >> r >> m;
if ((n + r) <= (n + m) && (n + r) <= (r + m)) {
cout << n + r;
} else if ((n + m) <= (n + r) && (n + m) <= (r + m)) {
cout << n + m;
} else if ((m + r) <= (n + m) && (m + r) <= (n + r)) {
cout << m + r;
}
return 0;
}
| [
"identifier.change",
"io.output.change"
] | 822,928 | 822,929 | u705509942 | cpp |
p03011 | #include <stdio.h>
int main() {
int a, b, c, i;
scanf("%d%d%d", &a, &b, &c);
int d = a + b;
int e = b + c;
int f = a + c;
if (d > e) {
i = d;
d = e;
e = i;
}
if (e > f) {
i = e;
e = c;
f = i;
}
if (d > e) {
i = d;
d = e;
e = i;
}
printf("%d\n", d);
} | #include <stdio.h>
int main() {
int a, b, c, i;
scanf("%d%d%d", &a, &b, &c);
int d = a + b;
int e = b + c;
int f = a + c;
if (d > e) {
i = d;
d = e;
e = i;
}
if (e > f) {
i = e;
e = f;
f = i;
}
if (d > e) {
i = d;
d = e;
e = i;
}
printf("%d\n", d);
} | [
"assignment.value.change",
"identifier.change"
] | 822,932 | 822,933 | u559735669 | cpp |
p03011 | #include <bits/stdc++.h>
#define INF 1e18
#define MOD 1000000007
#define PI M_PI
#define ll long long
#define vi vector<int>
#define all(v) v.begin(), v.end()
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPD(i, n) for (int i = n - 1; i >= 0; i--)
#define print(x) cout << x << endl;
#define debug(x) cout << #x << " = " << endl;
using namespace std;
void solve() {
int P, Q, R;
cin >> P >> Q >> R;
print(min({P + Q, Q + R, P + Q}));
}
int main() {
solve();
return 0;
}
| #include <bits/stdc++.h>
#define INF 1e18
#define MOD 1000000007
#define PI M_PI
#define ll long long
#define vi vector<int>
#define all(v) v.begin(), v.end()
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPD(i, n) for (int i = n - 1; i >= 0; i--)
#define print(x) cout << x << endl;
#define debug(x) cout << #x << " = " << endl;
using namespace std;
void solve() {
int P, Q, R;
cin >> P >> Q >> R;
print(min({P + Q, Q + R, R + P}));
}
int main() {
solve();
return 0;
}
| [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 822,939 | 822,940 | u929199273 | cpp |
p03011 | #include <iostream>
using namespace std;
int main(void) {
int p, q, r, ans;
cin >> p >> q >> r;
if (p + q < p + r && p + q < q + r) {
ans = p + q;
} else if (p + r < p + q && p + r < q + r) {
ans = p + r;
} else {
ans = q + r;
}
cout << ans << endl;
return 0;
} | #include <iostream>
using namespace std;
int main(void) {
int p, q, r, ans;
cin >> p >> q >> r;
if (p + q <= p + r && p + q <= q + r) {
ans = p + q;
} else if (p + r <= p + q && p + r <= q + r) {
ans = p + r;
} else {
ans = q + r;
}
cout << ans << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 822,944 | 822,945 | u749089333 | cpp |
p03011 | #include <iostream>
using namespace std;
int main() {
int P, Q, R;
cin >> P >> Q >> R;
if (P > Q && P > R)
cout << Q + R << endl;
else if (Q > P && Q > R)
cout << P + R << endl;
else
cout << P + Q << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int P, Q, R;
cin >> P >> Q >> R;
if (P >= Q && P >= R)
cout << Q + R << endl;
else if (Q >= P && Q >= R)
cout << P + R << endl;
else
cout << P + Q << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 822,946 | 822,947 | u204523044 | cpp |
p03011 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << min(a, b) + min(min(a, b), c);
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << min(a, b) + min(max(a, b), c);
} | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 822,952 | 822,951 | u009870106 | cpp |
p03011 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int A, B, C;
cin >> A >> B >> C;
int ans = A + B;
ans = max(ans, A + C);
ans = max(ans, B + C);
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int A, B, C;
cin >> A >> B >> C;
int ans = A + B;
ans = min(ans, A + C);
ans = min(ans, B + C);
cout << ans << endl;
}
| [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 822,957 | 822,958 | u854161810 | cpp |
p03011 | #include <bits/stdc++.h>
using namespace std;
int main() {
int P, Q, R;
cin >> P >> Q >> R;
cout << max({P + Q, Q + R, R + P}) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int P, Q, R;
cin >> P >> Q >> R;
cout << min({P + Q, Q + R, R + P}) << endl;
} | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 822,984 | 822,985 | u280120599 | cpp |
p03011 | #include <bits/stdc++.h>
using namespace std;
#define LL long long
void print() { std::cout << std::endl; }
template <class Head, class... Tail> void print(Head &&head, Tail &&...tail) {
std::cout << head;
if (sizeof...(tail) != 0)
std::cout << " ";
print(std::forward<Tail>(tail)...);
}
template <class T> void print(std::vector<T> &vec) {
for (auto &a : vec) {
std::cout << a;
if (&a != &vec.back())
std::cout << " ";
}
std::cout << std::endl;
}
template <class T> void print(std::vector<std::vector<T>> &df) {
for (auto &vec : df) {
print(vec);
}
}
int main() {
int p, q, r;
cin >> p >> q >> r;
print(min({p + q, q + r, r + q}));
} | #include <bits/stdc++.h>
using namespace std;
#define LL long long
void print() { std::cout << std::endl; }
template <class Head, class... Tail> void print(Head &&head, Tail &&...tail) {
std::cout << head;
if (sizeof...(tail) != 0)
std::cout << " ";
print(std::forward<Tail>(tail)...);
}
template <class T> void print(std::vector<T> &vec) {
for (auto &a : vec) {
std::cout << a;
if (&a != &vec.back())
std::cout << " ";
}
std::cout << std::endl;
}
template <class T> void print(std::vector<std::vector<T>> &df) {
for (auto &vec : df) {
print(vec);
}
}
int main() {
int p, q, r;
cin >> p >> q >> r;
print(min({p + q, q + r, p + r}));
} | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 822,988 | 822,989 | u272246549 | cpp |
p03011 | #include <iostream>
#include <string>
using namespace std;
int main() {
int a;
int b;
int c;
int d;
int e;
int f;
int g;
cin >> a;
cin >> b;
cin >> c;
d = a + b;
e = a + c;
f = b + c;
if (d >= e && d >= f) {
cout << d << endl;
} else if (e >= d && e >= f) {
cout << e << endl;
} else {
cout << f << endl;
}
}
| #include <iostream>
#include <string>
using namespace std;
int main() {
int a;
int b;
int c;
int d;
int e;
int f;
int g;
cin >> a;
cin >> b;
cin >> c;
d = a + b;
e = a + c;
f = b + c;
if (d <= e && d <= f) {
cout << d << endl;
} else if (e <= d && e <= f) {
cout << e << endl;
} else {
cout << f << endl;
}
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 822,992 | 822,993 | u479202791 | cpp |
p03011 | #include <bits/stdc++.h>
using namespace std;
// create arrays outside of main()
int a[100];
int main() {
int a;
int b;
int c;
cin >> a >> b >> c;
int shortest;
if ((a + b) < (b + c)) {
shortest = a + b;
} else {
shortest = b + c;
}
if ((a + c) < shortest) {
shortest = a + b;
}
cout << shortest;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
// create arrays outside of main()
int a[100];
int main() {
int a;
int b;
int c;
cin >> a >> b >> c;
int shortest;
if ((a + b) < (b + c)) {
shortest = a + b;
} else {
shortest = b + c;
}
if ((a + c) < shortest) {
shortest = a + c;
}
cout << shortest;
return 0;
} | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 823,002 | 823,003 | u974680794 | cpp |
p03011 | #include <iostream>
using namespace std;
int input1;
int input2;
int input3;
int main() {
cin >> input1 >> input2 >> input3;
int total = 0;
if (input1 <= input2 && input1 <= input3) {
total = total + input1;
if (input2 < input3) {
total = total + input2;
} else {
total = total + input3;
}
}
if (input2 <= input3 && input2 <= input1) {
total = total + input2;
if (input1 < input3) {
total = total + input1;
} else {
total = total + input3;
}
}
if (input3 <= input1 && input3 <= input2) {
total = total + input3;
if (input2 < input1) {
total = total + input2;
} else {
total = total + input1;
}
}
cout << total;
return 0;
} | #include <iostream>
using namespace std;
int input1;
int input2;
int input3;
int main() {
cin >> input1 >> input2 >> input3;
int total = 0;
if (input1 <= input2 && input1 <= input3) {
total = total + input1;
if (input2 < input3) {
total = total + input2;
} else {
total = total + input3;
}
}
else if (input2 <= input3 && input2 <= input1) {
total = total + input2;
if (input1 < input3) {
total = total + input1;
} else {
total = total + input3;
}
}
else if (input3 <= input1 && input3 <= input2) {
total = total + input3;
if (input2 < input1) {
total = total + input2;
} else {
total = total + input1;
}
}
cout << total;
return 0;
} | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 823,004 | 823,005 | u261501616 | cpp |
p03011 | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<double> VD;
#define MP make_pair
#define PB push_back
#define X first
#define Y second
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define RFOR(i, b, a) for (int i = (b)-1; i >= (a); --i)
#define ITER(it, a) \
for (__typeof(a.begin()) it = a.begin(); it != a.end(); ++it)
#define ALL(a) a.begin(), a.end()
#define SZ(a) (int)((a).size())
#define FILL(a, value) memset(a, value, sizeof(a))
#define debug(a) cout << #a << " = " << a << endl;
const double PI = acos(-1.0);
const LL INF = 1e9 + 47;
const LL LINF = INF * INF;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
// freopen("In.txt", "r", stdin);
// freopen("In.txt", "w", stdout);
int a, b, c;
cin >> a >> b >> c;
cout << a + b + c + max(a, max(b, c));
cerr << "Time elapsed: " << clock() / (double)CLOCKS_PER_SEC << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<double> VD;
#define MP make_pair
#define PB push_back
#define X first
#define Y second
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define RFOR(i, b, a) for (int i = (b)-1; i >= (a); --i)
#define ITER(it, a) \
for (__typeof(a.begin()) it = a.begin(); it != a.end(); ++it)
#define ALL(a) a.begin(), a.end()
#define SZ(a) (int)((a).size())
#define FILL(a, value) memset(a, value, sizeof(a))
#define debug(a) cout << #a << " = " << a << endl;
const double PI = acos(-1.0);
const LL INF = 1e9 + 47;
const LL LINF = INF * INF;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
// freopen("In.txt", "r", stdin);
// freopen("In.txt", "w", stdout);
int a, b, c;
cin >> a >> b >> c;
cout << a + b + c - max(a, max(b, c));
cerr << "Time elapsed: " << clock() / (double)CLOCKS_PER_SEC << endl;
return 0;
}
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 823,006 | 823,007 | u761582382 | cpp |
p03011 | #include <bits/stdc++.h>
using namespace std;
int main() {
int p, q, r;
cin >> p >> q >> r;
int ans = min(p + q, max(p + r, q + r));
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int p, q, r;
cin >> p >> q >> r;
int ans = min(p + q, min(p + r, q + r));
cout << ans << endl;
} | [
"misc.opposites",
"identifier.change",
"call.function.change",
"call.arguments.change"
] | 823,016 | 823,017 | u111600809 | cpp |
p03011 | #include <bits/stdc++.h>
using namespace std;
int main() {
char a, b, c;
cin >> a >> b >> c;
cout << min(min(a + b, b + c), c + a) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d;
cin >> a >> b >> c;
cout << min(min(a + b, b + c), c + a) << endl;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.add"
] | 823,022 | 823,023 | u397130503 | cpp |
p03011 | #include <bits/stdc++.h>
using namespace std;
int main() {
int P, Q, R;
cin >> P >> Q >> R;
cout << (P + Q + R) - max((P, Q), R) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int P, Q, R;
cin >> P >> Q >> R;
cout << (P + Q + R) - max({P, Q, R}) << endl;
}
| [
"io.output.change",
"call.arguments.change"
] | 823,027 | 823,028 | u804520294 | cpp |
p03011 | #include <bits/stdc++.h>
using namespace std;
typedef int shar;
typedef double shara;
typedef string w;
int main() {
shar x, y, z, a, b, c;
cin >> a >> b >> c;
x = a + b;
y = b + c;
z = a + c;
if (x < y && x < z) {
cout << x;
} else if (z < x && z < y) {
cout << z;
} else if (z == x && y == z && x == y) {
cout << a + b + c;
} else if (y <= x && y <= z) {
cout << y;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef int shar;
typedef double shara;
typedef string w;
int main() {
shar x, y, z, a, b, c;
cin >> a >> b >> c;
x = a + b;
y = b + c;
z = a + c;
if (x <= y && x <= z) {
cout << x;
} else if (z < x && z < y) {
cout << z;
} else if (z == x && y == z && x == y) {
cout << a + b + c;
} else if (y <= x && y <= z) {
cout << y;
}
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 823,031 | 823,032 | u470490204 | cpp |
p03011 | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int p, q, r;
cin >> p >> q >> r;
cout << p + r + r - max({p, q, r}) << endl;
return 0;
}
| #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int p, q, r;
cin >> p >> q >> r;
cout << p + q + r - max({p, q, r}) << endl;
return 0;
}
| [
"identifier.change",
"io.output.change"
] | 823,035 | 823,036 | u163149221 | cpp |
p03011 | #include <iostream>
using namespace std;
int main() {
int x, y, z;
cin >> x >> y >> z;
int i = x + y;
if (y + z < i) {
i = y + z;
}
if (x + z < i)
i = x + y;
cout << i;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int x, y, z;
cin >> x >> y >> z;
int i = x + y;
if (y + z < i) {
i = y + z;
}
if (x + z < i)
i = x + z;
cout << i;
return 0;
}
| [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 823,037 | 823,038 | u118192443 | cpp |
p03011 | #include <bits/stdc++.h>
using namespace std;
int main() {
int p, q, r;
cin >> p >> q >> r;
if (p < q && r < q)
cout << p + r << endl;
else if (q < p && r < p)
cout << q + r << endl;
else
cout << p + q << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int p, q, r;
cin >> p >> q >> r;
if (p <= q && r <= q)
cout << p + r << endl;
else if (q <= p && r <= p)
cout << q + r << endl;
else
cout << p + q << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 823,049 | 823,050 | u368279380 | cpp |
p03011 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int a, b, c, d, e, f;
cin >> a >> b >> c;
d = a + b;
e = a + c;
f = b + c;
if (d < e && d < f) {
cout << d << endl;
} else if (e < d && e < f) {
cout << e << endl;
} else {
cout << f << endl;
}
return 0;
}
| #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int a, b, c, d, e, f;
cin >> a >> b >> c;
d = a + b;
e = b + c;
f = a + c;
if (d <= e && d <= f) {
cout << d << endl;
} else if (e <= d && e <= f) {
cout << e << endl;
} else {
cout << f << endl;
}
return 0;
}
| [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 823,051 | 823,052 | u746486430 | cpp |
p03011 | #include <iostream>
using namespace std;
int minimum(int a, int b, int c) {
if (a <= b && a <= c) {
return a;
} else if (b <= c && c <= a) {
return b;
} else if (c <= a && c <= b) {
return c;
}
}
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << minimum(A + B, B + C, C + A) << endl;
return 0;
} | #include <iostream>
using namespace std;
int minimum(int a, int b, int c) {
if (a <= b && a <= c) {
return a;
} else if (b <= c && b <= a) {
return b;
} else if (c <= a && c <= b) {
return c;
}
}
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << minimum(A + B, B + C, C + A) << endl;
return 0;
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 823,057 | 823,058 | u212083331 | cpp |
p03011 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <string.h>
#include <vector>
using namespace std;
int main() {
vector<int> a(2);
cin >> a.at(0) >> a.at(1) >> a.at(2);
sort(a.begin(), a.end());
cout << a.at(0) + a.at(1) << endl;
return 0;
} | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <string.h>
#include <vector>
using namespace std;
int main() {
vector<int> a(3);
cin >> a.at(0) >> a.at(1) >> a.at(2);
sort(a.begin(), a.end());
cout << a.at(0) + a.at(1) << endl;
return 0;
} | [
"literal.number.change",
"call.arguments.change"
] | 823,061 | 823,062 | u927933718 | cpp |
p03011 | #include <bits/stdc++.h>
#define rep(i, N) for (int i = 0; i < (int)N; i++)
using namespace std;
typedef long long ll;
const ll LLINF = 9223372036854775807;
const int INF = pow(2, 29);
const int MOD = 1000000007;
int main() {
int t[3];
cin >> t[0] >> t[1] >> t[2];
sort(t, t + 2);
int result = t[0] + t[1];
cout << result << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, N) for (int i = 0; i < (int)N; i++)
using namespace std;
typedef long long ll;
const ll LLINF = 9223372036854775807;
const int INF = pow(2, 29);
const int MOD = 1000000007;
int main() {
int t[3];
cin >> t[0] >> t[1] >> t[2];
sort(t, t + 3);
int result = t[0] + t[1];
cout << result << endl;
return 0;
} | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 823,067 | 823,068 | u680707192 | cpp |
p03011 | #include <bits/stdc++.h>
typedef long long ll;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
using namespace std;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, a, b) for (int i = a; i <= b; i++)
#define revrep(i, s) for (int i = s - 1; i > 0; i--)
#define revrrep(i, s) for (int i = s - 1; i >= 0; i--)
#define all(a) begin((a)), end((a))
#define uniq(c) (c).erase(unique(all((c))), end((c)))
int main() {
int P, Q, R;
cin >> P >> Q >> R;
cout << min(Q + R, min(P + Q, Q + R)) << endl;
} | #include <bits/stdc++.h>
typedef long long ll;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
using namespace std;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, a, b) for (int i = a; i <= b; i++)
#define revrep(i, s) for (int i = s - 1; i > 0; i--)
#define revrrep(i, s) for (int i = s - 1; i >= 0; i--)
#define all(a) begin((a)), end((a))
#define uniq(c) (c).erase(unique(all((c))), end((c)))
int main() {
int P, Q, R;
cin >> P >> Q >> R;
cout << min(P + R, min(P + Q, Q + R)) << endl;
} | [
"identifier.change",
"io.output.change"
] | 823,069 | 823,070 | u729217226 | cpp |
p03011 | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> fl;
for (int i = 0; i < 3; i++) {
cin >> fl.at(i);
}
sort(fl.begin(), fl.end());
cout << fl.at(0) + fl.at(1) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> fl(3);
for (int i = 0; i < 3; i++) {
cin >> fl.at(i);
}
sort(fl.begin(), fl.end());
cout << fl.at(0) + fl.at(1) << endl;
} | [
"call.arguments.add"
] | 823,075 | 823,076 | u191476275 | cpp |
p03011 | #include <algorithm>
#include <iostream>
#include <vector>
int main(void) {
std::vector<int> ans(3);
std::cin >> ans[0];
std::cin >> ans[1];
std::cin >> ans[2];
std::sort(ans.begin(), ans.end());
std::cout << ans[1] + ans[2] << std::endl;
return 0;
}
| #include <algorithm>
#include <iostream>
#include <vector>
int main(void) {
std::vector<int> ans(3);
std::cin >> ans[0];
std::cin >> ans[1];
std::cin >> ans[2];
std::sort(ans.begin(), ans.end());
std::cout << ans[1] + ans[0] << std::endl;
return 0;
}
| [
"literal.number.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 823,077 | 823,078 | u122994151 | cpp |
p03011 | #include <bits/stdc++.h>
using namespace std;
int main() {
int P, Q, R, a, b, c;
cin >> P >> Q >> R;
a = P + Q;
b = Q + R;
c = R + P;
cout << max({a, b, c}) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int P, Q, R, a, b, c;
cin >> P >> Q >> R;
a = P + Q;
b = Q + R;
c = R + P;
cout << min({a, b, c}) << endl;
} | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 823,081 | 823,082 | u559112776 | cpp |
p03011 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main(void) {
int a, b, c;
cin >> a >> b >> c;
int cal[3];
cal[0] = a * b;
cal[1] = b * c;
cal[2] = a * c;
int min = 500000;
rep(i, 3) {
if (cal[i] < min) {
min = cal[i];
}
}
cout << min << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main(void) {
int a, b, c;
cin >> a >> b >> c;
int cal[3];
cal[0] = a + b;
cal[1] = b + c;
cal[2] = a + c;
int min = 500000;
rep(i, 3) {
if (cal[i] < min) {
min = cal[i];
}
}
cout << min << endl;
return 0;
}
| [
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 823,083 | 823,084 | u905170328 | cpp |
p03011 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
typedef pair<ll, ll> P;
#define M 1000000007
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << a + a + c - max({a, b, c});
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
typedef pair<ll, ll> P;
#define M 1000000007
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << a + b + c - max({a, b, c});
} | [
"identifier.change",
"io.output.change"
] | 823,090 | 823,091 | u987476436 | cpp |
p03011 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << min({(a * b), (b * c), (c * a)}) << endl;
;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << min({(a + b), (b + c), (c + a)}) << endl;
;
}
| [
"expression.operator.arithmetic.change",
"io.output.change"
] | 823,092 | 823,093 | u931071094 | cpp |
p03011 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int tmp, i = 0, a[3];
while (cin >> tmp) {
a[i] = tmp;
i++;
}
sort(a, a + 2);
cout << a[0] + a[1] << endl;
return 0;
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int tmp, i = 0, a[3];
while (cin >> tmp) {
a[i] = tmp;
i++;
}
sort(a, a + 3);
cout << a[0] + a[1] << endl;
return 0;
} | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 823,096 | 823,097 | u548587261 | cpp |
p03011 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
typedef long long ll;
typedef long double ld;
#define REP(i, n) for (int i = 0; i < n; i++)
/* print like python */
void print() { cout << endl; }
template <class Head, class... Tail> void print(Head &&head, Tail &&...tail) {
cout << head;
if (sizeof...(tail) != 0)
cout << " ";
print(forward<Tail>(tail)...);
}
template <class T> void print(vector<T> &vec) {
for (auto &a : vec) {
cout << a;
if (&a != &vec.back())
cout << " ";
}
cout << endl;
}
template <class T> void print(vector<vector<T>> &df) {
for (auto &vec : df) {
print(vec);
}
}
int main() {
int v[3];
cin >> v[0] >> v[1] >> v[2];
sort(v, v + 2);
print(v[0] + v[1]);
} | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
typedef long long ll;
typedef long double ld;
#define REP(i, n) for (int i = 0; i < n; i++)
/* print like python */
void print() { cout << endl; }
template <class Head, class... Tail> void print(Head &&head, Tail &&...tail) {
cout << head;
if (sizeof...(tail) != 0)
cout << " ";
print(forward<Tail>(tail)...);
}
template <class T> void print(vector<T> &vec) {
for (auto &a : vec) {
cout << a;
if (&a != &vec.back())
cout << " ";
}
cout << endl;
}
template <class T> void print(vector<vector<T>> &df) {
for (auto &vec : df) {
print(vec);
}
}
int main() {
int v[3];
cin >> v[0] >> v[1] >> v[2];
sort(v, v + 3);
print(v[0] + v[1]);
} | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 823,100 | 823,101 | u484229314 | cpp |
p03011 | #include <bits/stdc++.h>
using namespace std;
/*int n;
cin >> n;
vector<int> h(n);*/
int main() {
int p, q, r;
cin >> p >> q >> r;
if ((p + q) <= (r + q) && (p + q) <= (p + r)) {
cout << p + q << endl;
}
if ((r + q) <= (p + q) && (r + q) <= (p + r)) {
cout << r + q << endl;
}
if ((p + r) <= (r + q) && (p + r) <= (p + q)) {
cout << p + r << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
/*int n;
cin >> n;
vector<int> h(n);*/
int main() {
int p, q, r;
cin >> p >> q >> r;
if ((p + q) <= (r + q) && (p + q) <= (p + r)) {
cout << p + q << endl;
} else if ((r + q) <= (p + q) && (r + q) <= (p + r)) {
cout << r + q << endl;
} else if ((p + r) <= (r + q) && (p + r) <= (p + q)) {
cout << p + r << endl;
}
return 0;
} | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 823,102 | 823,103 | u062857571 | cpp |
p03011 | #include <bits/stdc++.h>
using namespace std;
long gcd(long n, long m) {
if (n == 0)
return m;
if (n < m)
swap(n, m);
return gcd(n % m, m);
}
int main() {
int P, Q, R;
cin >> P >> Q >> R;
int ans = min(P, Q);
cout << min(ans, R);
} | #include <bits/stdc++.h>
using namespace std;
long gcd(long n, long m) {
if (n == 0)
return m;
if (n < m)
swap(n, m);
return gcd(n % m, m);
}
int main() {
int P, Q, R;
cin >> P >> Q >> R;
int ans = min(P + Q, Q + R);
cout << min(ans, R + P);
} | [
"assignment.change",
"expression.operation.binary.add"
] | 823,109 | 823,110 | u126833093 | cpp |
p03011 | #include <bits/stdc++.h>
using namespace std;
int main() {
int P, Q, R;
cin >> P >> Q >> R;
cout << P + Q + R - min(P, min(Q, R)) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int P, Q, R;
cin >> P >> Q >> R;
cout << P + Q + R - max(P, max(Q, R)) << endl;
}
| [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 823,113 | 823,114 | u437926966 | cpp |
p03011 | #include <iostream>
using namespace std;
int main() {
int p, q, r;
cin >> p >> q >> r;
int ans;
if (p >= q && q >= r) {
ans = q + r;
} else if (q >= p && q >= r) {
ans = p + r;
} else {
ans = p + q;
}
cout << ans << endl;
}
| #include <iostream>
using namespace std;
int main() {
int p, q, r;
cin >> p >> q >> r;
int ans;
if (p >= q && p >= r) {
ans = q + r;
} else if (q >= p && q >= r) {
ans = p + r;
} else {
ans = p + q;
}
cout << ans << endl;
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 823,115 | 823,116 | u246343119 | cpp |
p03011 | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
int p, q, r;
cin >> p >> q >> r;
cout << min(p + q, min(q + r, r + q));
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
cin.sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
int p, q, r;
cin >> p >> q >> r;
cout << min(p + q, min(q + r, r + p));
return 0;
}
| [
"identifier.change",
"io.output.change"
] | 823,123 | 823,124 | u276568758 | cpp |
p03011 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
#define CHMAX(a, b) a = std::max(a, b)
#define CHMIN(a, b) a = std::min(a, b)
#define CHABS(a) a = std::abs(a)
#define COUT(a) std::cout << a << std::endl
#define CERR(a) std::cerr << a << std::endl
#define FOR(n) for (lli i = 0; i < n; i++)
using namespace std;
using lli = long long int;
using pll = pair<lli, lli>;
using tlll = tuple<lli, lli, lli>;
lli mod197 = 1000000007LL;
// ax + by = gcd(a,b) 最大公約数
template <typename T> T extgcd(T a, T b, T &x, T &y) {
T d = a;
if (b != 0) {
d = extgcd(b, a % b, y, x);
y -= (a / b) * x;
} else {
x = 1;
y = 0;
}
return d;
}
int main(void) {
lli A, B, C;
cin >> A >> B >> C;
COUT(A + B + C - min({A, B, C}));
return 0;
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
#define CHMAX(a, b) a = std::max(a, b)
#define CHMIN(a, b) a = std::min(a, b)
#define CHABS(a) a = std::abs(a)
#define COUT(a) std::cout << a << std::endl
#define CERR(a) std::cerr << a << std::endl
#define FOR(n) for (lli i = 0; i < n; i++)
using namespace std;
using lli = long long int;
using pll = pair<lli, lli>;
using tlll = tuple<lli, lli, lli>;
lli mod197 = 1000000007LL;
// ax + by = gcd(a,b) 最大公約数
template <typename T> T extgcd(T a, T b, T &x, T &y) {
T d = a;
if (b != 0) {
d = extgcd(b, a % b, y, x);
y -= (a / b) * x;
} else {
x = 1;
y = 0;
}
return d;
}
int main(void) {
lli A, B, C;
cin >> A >> B >> C;
COUT(A + B + C - max({A, B, C}));
return 0;
}
| [
"misc.opposites",
"identifier.change",
"call.function.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 823,127 | 823,128 | u155216115 | cpp |
p03011 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
#define CHMAX(a, b) a = std::max(a, b)
#define CHMIN(a, b) a = std::min(a, b)
#define CHABS(a) a = std::abs(a)
#define COUT(a) std::cout << a << std::endl
#define CERR(a) std::cerr << a << std::endl
#define FOR(n) for (lli i = 0; i < n; i++)
using namespace std;
using lli = long long int;
using pll = pair<lli, lli>;
using tlll = tuple<lli, lli, lli>;
lli mod197 = 1000000007LL;
// ax + by = gcd(a,b) 最大公約数
template <typename T> T extgcd(T a, T b, T &x, T &y) {
T d = a;
if (b != 0) {
d = extgcd(b, a % b, y, x);
y -= (a / b) * x;
} else {
x = 1;
y = 0;
}
return d;
}
int main(void) {
lli A, B, C;
cin >> A >> B >> C;
COUT(A + B + C - min({A, B, C}));
return 0;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
#define CHMAX(a, b) a = std::max(a, b)
#define CHMIN(a, b) a = std::min(a, b)
#define CHABS(a) a = std::abs(a)
#define COUT(a) std::cout << a << std::endl
#define CERR(a) std::cerr << a << std::endl
#define FOR(n) for (lli i = 0; i < n; i++)
using namespace std;
using lli = long long int;
using pll = pair<lli, lli>;
using tlll = tuple<lli, lli, lli>;
lli mod197 = 1000000007LL;
// ax + by = gcd(a,b) 最大公約数
template <typename T> T extgcd(T a, T b, T &x, T &y) {
T d = a;
if (b != 0) {
d = extgcd(b, a % b, y, x);
y -= (a / b) * x;
} else {
x = 1;
y = 0;
}
return d;
}
int main(void) {
lli A, B, C;
cin >> A >> B >> C;
COUT(A + B + C - max({A, B, C}));
return 0;
}
| [
"misc.opposites",
"identifier.change",
"call.function.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 823,129 | 823,128 | u155216115 | cpp |
p03011 | #include <stdio.h>
int main() {
int p, q, r;
scanf("%d%d%d", &p, &q, &r);
if (p > q && p > r) {
printf("%d", q + r);
} else if (q > p && q > r) {
printf("%d", p + r);
} else if (r > p && r > q) {
printf("%d", p + q);
}
}
| #include <stdio.h>
int main() {
int p, q, r;
scanf("%d%d%d", &p, &q, &r);
if (p >= q && p >= r) {
printf("%d", q + r);
} else if (q >= p && q >= r) {
printf("%d", p + r);
} else if (r >= p && r >= q) {
printf("%d", p + q);
}
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 823,158 | 823,159 | u923465140 | cpp |
p03011 | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#define rep(i, s, n) for (int i = s; i < n; i++)
#define repe(i, s, n) for (int i = s; i <= n; i++)
using namespace std;
typedef long long ll;
static const ll MOD = 1e9 + 7;
int main() {
ll p, q, r;
cin >> p >> q >> r;
cout << min(min(p + q, q + r), (q + r)) << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#define rep(i, s, n) for (int i = s; i < n; i++)
#define repe(i, s, n) for (int i = s; i <= n; i++)
using namespace std;
typedef long long ll;
static const ll MOD = 1e9 + 7;
int main() {
ll p, q, r;
cin >> p >> q >> r;
cout << min(min(p + q, q + r), (p + r)) << endl;
return 0;
} | [
"identifier.change",
"io.output.change"
] | 823,164 | 823,165 | u685009987 | cpp |
p03011 | #include <bits/stdc++.h>
using namespace std;
int main() {
int P, Q, R;
cin >> P >> Q >> R;
int ans = P + Q;
if (ans > (Q + R))
ans = (Q + R);
else if (ans > (P + R))
ans = (P + R);
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int P, Q, R;
cin >> P >> Q >> R;
int ans = P + Q;
if (ans > (Q + R))
ans = (Q + R);
if (ans > (P + R))
ans = (P + R);
cout << ans << endl;
}
| [
"control_flow.branch.if.replace.add",
"control_flow.branch.else_if.replace.remove"
] | 823,168 | 823,169 | u690326065 | cpp |
p03011 | #include <bits/stdc++.h>
using namespace std;
int main() {
int P, Q, R;
cin >> P >> Q >> R;
int ans = P + Q;
if (ans > (Q + R))
ans = Q + R;
else if (ans > (P + R))
ans = P + R;
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int P, Q, R;
cin >> P >> Q >> R;
int ans = P + Q;
if (ans > (Q + R))
ans = (Q + R);
if (ans > (P + R))
ans = (P + R);
cout << ans << endl;
}
| [
"control_flow.branch.if.replace.add",
"control_flow.branch.else_if.replace.remove"
] | 823,170 | 823,169 | u690326065 | cpp |
p03011 | #include <stdio.h>
int main() {
int P;
int Q;
int R;
scanf("%d", &P);
scanf("%d", &Q);
scanf("%d", &R);
int totalX = P + Q;
int totalY = Q + R;
int totalZ = Q + P;
if (totalX > totalY) {
if (totalY > totalZ) {
printf("%d", totalZ);
} else {
printf("%d", totalY);
}
} else {
if (totalX > totalZ) {
printf("%d", totalZ);
} else {
printf("%d", totalX);
}
}
} | #include <stdio.h>
int main() {
int P;
int Q;
int R;
scanf("%d", &P);
scanf("%d", &Q);
scanf("%d", &R);
int totalX = P + Q;
int totalY = Q + R;
int totalZ = R + P;
if (totalX > totalY) {
if (totalY > totalZ) {
printf("%d", totalZ);
} else {
printf("%d", totalY);
}
} else {
if (totalX > totalZ) {
printf("%d", totalZ);
} else {
printf("%d", totalX);
}
}
} | [
"identifier.change",
"expression.operation.binary.change"
] | 823,186 | 823,187 | u625522718 | cpp |
p03011 | #include <stdio.h>
int main() {
int P;
int Q;
int R;
scanf("%d", &P);
scanf("%d", &Q);
scanf("%d", &R);
int totalX = P + Q;
int totalY = Q + R;
int totalZ = Q + P;
if (totalX >= totalY) {
if (totalY >= totalZ) {
printf("%d", totalZ);
} else {
printf("%d", totalY);
}
} else {
if (totalX >= totalZ) {
printf("%d", totalZ);
} else {
printf("%d", totalX);
}
}
} | #include <stdio.h>
int main() {
int P;
int Q;
int R;
scanf("%d", &P);
scanf("%d", &Q);
scanf("%d", &R);
int totalX = P + Q;
int totalY = Q + R;
int totalZ = R + P;
if (totalX > totalY) {
if (totalY > totalZ) {
printf("%d", totalZ);
} else {
printf("%d", totalY);
}
} else {
if (totalX > totalZ) {
printf("%d", totalZ);
} else {
printf("%d", totalX);
}
}
} | [
"identifier.change",
"expression.operation.binary.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 823,188 | 823,187 | u625522718 | cpp |
p03011 | #include <stdio.h>
int main() {
int a, b, c;
scanf("%d %d %d", &a, &b, &c);
if (a >= b && a >= c) {
printf("%d\n", b + c);
} else if (b >= a && b >= c) {
printf("%d\n", a + c);
} else {
printf("%d\n", a + c);
}
} | #include <stdio.h>
int main() {
int a, b, c;
scanf("%d %d %d", &a, &b, &c);
if (a >= b && a >= c) {
printf("%d\n", b + c);
} else if (b >= a && b >= c) {
printf("%d\n", a + c);
} else {
printf("%d\n", a + b);
}
} | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 823,191 | 823,192 | u691912637 | cpp |
p03011 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << max(max(a + b, b + c), c + a) << endl;
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << min(min(a + b, b + c), c + a) << endl;
}
| [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 823,196 | 823,197 | u677400065 | cpp |
p03011 | #include "bits/stdc++.h"
using namespace std;
int main() {
int P;
int Q;
int R;
cin >> P;
cin >> Q;
cin >> R;
int ans1;
int ans2;
int ans3;
int ans4;
int ans5;
int ans6;
ans1 = P + Q;
ans2 = P + R;
ans3 = Q + R;
ans4 = Q + P;
ans5 = R + Q;
ans6 = R + P;
int array[6] = {ans1, ans2, ans3, ans4, ans5, ans6};
int min;
for (int i = 0; i < 6; ++i) {
if (array[i] < min)
min = array[i];
}
cout << min << endl;
}
| #include "bits/stdc++.h"
using namespace std;
int main() {
int P;
int Q;
int R;
cin >> P;
cin >> Q;
cin >> R;
int ans1;
int ans2;
int ans3;
int ans4;
int ans5;
int ans6;
ans1 = P + Q;
ans2 = P + R;
ans3 = Q + R;
ans4 = Q + P;
ans5 = R + Q;
ans6 = R + P;
int array[6] = {ans1, ans2, ans3, ans4, ans5, ans6};
int min;
min = 1000;
for (int i = 0; i < 6; ++i) {
if (array[i] < min)
min = array[i];
}
cout << min << endl;
} | [
"assignment.add"
] | 823,201 | 823,202 | u663821872 | cpp |
p03011 | #include "bits/stdc++.h"
using namespace std;
int main() {
int P;
int Q;
int R;
cin >> P;
cin >> Q;
cin >> R;
int ans1;
int ans2;
int ans3;
int ans4;
int ans5;
int ans6;
ans1 = P + Q;
ans2 = P + R;
ans3 = Q + R;
ans4 = Q + P;
ans5 = R + Q;
ans6 = R + P;
int array[6] = {ans1, ans2, ans3, ans4, ans5, ans6};
int min;
for (int i = 0; i < 5; ++i) {
if (array[i] < min)
min = array[i];
}
cout << min << endl;
} | #include "bits/stdc++.h"
using namespace std;
int main() {
int P;
int Q;
int R;
cin >> P;
cin >> Q;
cin >> R;
int ans1;
int ans2;
int ans3;
int ans4;
int ans5;
int ans6;
ans1 = P + Q;
ans2 = P + R;
ans3 = Q + R;
ans4 = Q + P;
ans5 = R + Q;
ans6 = R + P;
int array[6] = {ans1, ans2, ans3, ans4, ans5, ans6};
int min;
min = 1000;
for (int i = 0; i < 6; ++i) {
if (array[i] < min)
min = array[i];
}
cout << min << endl;
} | [
"assignment.add",
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 823,203 | 823,202 | u663821872 | cpp |
p03011 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << a + b + c - min(a, min(b, c)) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << a + b + c - max(a, max(b, c)) << endl;
return 0;
}
| [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 823,208 | 823,209 | u183530284 | cpp |
p03011 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
//関数getinputdata宣言
vector<vector<string>> getinputdata();
vector<vector<int>> getinputdata2();
vector<vector<double>> getinputdata3();
void abc129_a(vector<vector<int>> v) {
int p = v[0][0];
int q = v[0][1];
int r = v[0][2];
int pq = p + q;
int pr = p + q;
int qr = q + r;
cout << min(min(pq, pr), qr) << endl;
}
int main() {
// vector<vector < string>> vec_arr_result;
vector<vector<int>> vec_arr_result;
vec_arr_result = getinputdata2();
abc129_a(vec_arr_result);
return 0;
}
//関数getinputdata実装
vector<vector<double>> getinputdata3() {
string str;
string ret;
stringstream ss;
vector<string> v1;
vector<vector<double>> vec_arr;
//標準入力から入力がある間ループ処理でvector配列にデータ格納
while (getline(cin, str)) {
v1.push_back(str);
}
// stringstreamを利用してvector配列v1をスペースで分解処理
for (string s : v1) {
vector<double> array_data;
ss << s;
while (!ss.eof()) {
ss >> ret;
array_data.push_back(atof(ret.c_str()));
}
// vector配列に追加
vec_arr.push_back(array_data);
//バッファクリア
ss.str("");
//ストリームクリア
ss.clear(stringstream::goodbit);
}
return vec_arr;
}
//関数getinputdata実装
vector<vector<int>> getinputdata2() {
string str;
string ret;
stringstream ss;
vector<string> v1;
vector<vector<int>> vec_arr;
//標準入力から入力がある間ループ処理でvector配列にデータ格納
while (getline(cin, str)) {
v1.push_back(str);
}
// stringstreamを利用してvector配列v1をスペースで分解処理
for (string s : v1) {
vector<int> array_data;
ss << s;
while (!ss.eof()) {
ss >> ret;
array_data.push_back(atoi(ret.c_str()));
}
// vector配列に追加
vec_arr.push_back(array_data);
//バッファクリア
ss.str("");
//ストリームクリア
ss.clear(stringstream::goodbit);
}
return vec_arr;
}
//関数getinputdata実装
vector<vector<string>> getinputdata() {
string str;
string ret;
stringstream ss;
vector<string> v1;
vector<vector<string>> vec_arr;
//標準入力から入力がある間ループ処理でvector配列にデータ格納
while (getline(cin, str)) {
v1.push_back(str);
}
// stringstreamを利用してvector配列v1をスペースで分解処理
for (string s : v1) {
vector<string> array_data;
ss << s;
while (!ss.eof()) {
ss >> ret;
array_data.push_back(ret);
}
// vector配列に追加
vec_arr.push_back(array_data);
//バッファクリア
ss.str("");
//ストリームクリア
ss.clear(stringstream::goodbit);
}
return vec_arr;
}
| #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
//関数getinputdata宣言
vector<vector<string>> getinputdata();
vector<vector<int>> getinputdata2();
vector<vector<double>> getinputdata3();
void abc129_a(vector<vector<int>> v) {
int p = v[0][0];
int q = v[0][1];
int r = v[0][2];
int pq = p + q;
int pr = p + r;
int qr = q + r;
cout << min(min(pq, pr), qr) << endl;
}
int main() {
// vector<vector < string>> vec_arr_result;
vector<vector<int>> vec_arr_result;
vec_arr_result = getinputdata2();
abc129_a(vec_arr_result);
return 0;
}
//関数getinputdata実装
vector<vector<double>> getinputdata3() {
string str;
string ret;
stringstream ss;
vector<string> v1;
vector<vector<double>> vec_arr;
//標準入力から入力がある間ループ処理でvector配列にデータ格納
while (getline(cin, str)) {
v1.push_back(str);
}
// stringstreamを利用してvector配列v1をスペースで分解処理
for (string s : v1) {
vector<double> array_data;
ss << s;
while (!ss.eof()) {
ss >> ret;
array_data.push_back(atof(ret.c_str()));
}
// vector配列に追加
vec_arr.push_back(array_data);
//バッファクリア
ss.str("");
//ストリームクリア
ss.clear(stringstream::goodbit);
}
return vec_arr;
}
//関数getinputdata実装
vector<vector<int>> getinputdata2() {
string str;
string ret;
stringstream ss;
vector<string> v1;
vector<vector<int>> vec_arr;
//標準入力から入力がある間ループ処理でvector配列にデータ格納
while (getline(cin, str)) {
v1.push_back(str);
}
// stringstreamを利用してvector配列v1をスペースで分解処理
for (string s : v1) {
vector<int> array_data;
ss << s;
while (!ss.eof()) {
ss >> ret;
array_data.push_back(atoi(ret.c_str()));
}
// vector配列に追加
vec_arr.push_back(array_data);
//バッファクリア
ss.str("");
//ストリームクリア
ss.clear(stringstream::goodbit);
}
return vec_arr;
}
//関数getinputdata実装
vector<vector<string>> getinputdata() {
string str;
string ret;
stringstream ss;
vector<string> v1;
vector<vector<string>> vec_arr;
//標準入力から入力がある間ループ処理でvector配列にデータ格納
while (getline(cin, str)) {
v1.push_back(str);
}
// stringstreamを利用してvector配列v1をスペースで分解処理
for (string s : v1) {
vector<string> array_data;
ss << s;
while (!ss.eof()) {
ss >> ret;
array_data.push_back(ret);
}
// vector配列に追加
vec_arr.push_back(array_data);
//バッファクリア
ss.str("");
//ストリームクリア
ss.clear(stringstream::goodbit);
}
return vec_arr;
}
| [
"identifier.change",
"expression.operation.binary.change"
] | 823,210 | 823,211 | u200239931 | cpp |
p03011 | // abc129_a
#include <bits/stdc++.h>
using namespace std;
int main(void) {
int P, Q, R;
cin >> P >> Q >> R;
int max = P;
if (max <= Q) {
max = Q;
} else if (max <= R) {
max = R;
}
cout << P + Q + R - max << endl;
return 0;
} | // abc129_a
#include <bits/stdc++.h>
using namespace std;
int main(void) {
int P, Q, R;
cin >> P >> Q >> R;
int max = P;
if (max <= Q) {
max = Q;
}
if (max <= R) {
max = R;
}
cout << P + Q + R - max << endl;
return 0;
} | [
"control_flow.branch.if.replace.add",
"control_flow.branch.else_if.replace.remove"
] | 823,225 | 823,226 | u798557584 | cpp |
p03011 | #include <bits/stdc++.h>
using namespace std;
int main() {
int P, Q, R;
cin >> P, Q, R;
int r;
r = (P + Q + R) - max({P, Q, R});
cout << r << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int P, Q, R;
cin >> P >> Q >> R;
int r;
r = (P + Q + R) - max({P, Q, R});
cout << r << endl;
}
| [] | 823,227 | 823,228 | u224951113 | cpp |
p03011 | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int p, q, r;
cin >> p >> q >> r;
if (p > q && p > r)
cout << q + r;
else if (q > p && q > r)
cout << p + r;
else
cout << p + q;
return 0;
} | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int p, q, r;
cin >> p >> q >> r;
if (p >= q && p >= r)
cout << q + r;
else if (q >= p && q >= r)
cout << p + r;
else
cout << p + q;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 823,233 | 823,234 | u855186748 | cpp |
p03011 | /*
_ooOoo_
o8888888o
88" . "88
(| -_- |)
O\ = /O
____/`---'\____
.' \\| |// `.
/ \\||| : |||// \
/ _||||| -:- |||||- \
| | \\\ - /// | |
| \_| ''\---/'' | |
\ .-\__ `-` ___/-. /
___`. .' /--.--\ `. . __
."" '< `.___\_<|>_/___.' >'"".
| | : `- \`.;`\ _ /`;.`/ - ` : | |
\ \ `-. \_ __\ /__ _/ .-` / /
======`-.____`-.___\_____/___.-`____.-'======
`=---='
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
prayer
*/
// 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>
#include <unordered_map>
#include <utility>
#include <vector>
#define loop(i, a, b) for (long long i = a; i < b; i++)
#define rep(i, a) loop(i, 0, a)
#define FOR(i, a) for (auto i : a)
#define pb push_back
#define all(in) in.begin(), in.end()
#define shosu(x) fixed << setprecision(x)
#define show1d(v) \
{ \
rep(_, v.size()) cout << " " << v[_]; \
cout << endl; \
}
#define show2d(v) \
{ rep(__, v.size()) show1d(v[__]); }
using namespace std;
// kaewasuretyuui
typedef long long ll;
#define int ll
typedef int Def;
typedef pair<Def, Def> pii;
typedef vector<Def> vi;
typedef vector<vi> vvi;
typedef vector<pii> vp;
typedef vector<vp> vvp;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef pair<Def, pii> pip;
typedef vector<pip> vip;
#define mt make_tuple
typedef tuple<int, int, int, int> tp;
typedef vector<tp> vt;
template <typename A, typename B> bool cmin(A &a, const B &b) {
return a > b ? (a = b, true) : false;
}
template <typename A, typename B> bool cmax(A &a, const B &b) {
return a < b ? (a = b, true) : false;
}
const double PI = acos(-1);
const double EPS = 1e-9;
Def inf = sizeof(Def) == sizeof(long long) ? 2e18 : 1e9 + 10;
#define yes cout << "Yes\n"
#define no cout << "No\n"
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int a, b, c;
cin >> a >> b >> c;
cout << a + b + c - min({a, b, c}) << endl;
}
| /*
_ooOoo_
o8888888o
88" . "88
(| -_- |)
O\ = /O
____/`---'\____
.' \\| |// `.
/ \\||| : |||// \
/ _||||| -:- |||||- \
| | \\\ - /// | |
| \_| ''\---/'' | |
\ .-\__ `-` ___/-. /
___`. .' /--.--\ `. . __
."" '< `.___\_<|>_/___.' >'"".
| | : `- \`.;`\ _ /`;.`/ - ` : | |
\ \ `-. \_ __\ /__ _/ .-` / /
======`-.____`-.___\_____/___.-`____.-'======
`=---='
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
prayer
*/
// 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>
#include <unordered_map>
#include <utility>
#include <vector>
#define loop(i, a, b) for (long long i = a; i < b; i++)
#define rep(i, a) loop(i, 0, a)
#define FOR(i, a) for (auto i : a)
#define pb push_back
#define all(in) in.begin(), in.end()
#define shosu(x) fixed << setprecision(x)
#define show1d(v) \
{ \
rep(_, v.size()) cout << " " << v[_]; \
cout << endl; \
}
#define show2d(v) \
{ rep(__, v.size()) show1d(v[__]); }
using namespace std;
// kaewasuretyuui
typedef long long ll;
#define int ll
typedef int Def;
typedef pair<Def, Def> pii;
typedef vector<Def> vi;
typedef vector<vi> vvi;
typedef vector<pii> vp;
typedef vector<vp> vvp;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef pair<Def, pii> pip;
typedef vector<pip> vip;
#define mt make_tuple
typedef tuple<int, int, int, int> tp;
typedef vector<tp> vt;
template <typename A, typename B> bool cmin(A &a, const B &b) {
return a > b ? (a = b, true) : false;
}
template <typename A, typename B> bool cmax(A &a, const B &b) {
return a < b ? (a = b, true) : false;
}
const double PI = acos(-1);
const double EPS = 1e-9;
Def inf = sizeof(Def) == sizeof(long long) ? 2e18 : 1e9 + 10;
#define yes cout << "Yes\n"
#define no cout << "No\n"
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int a, b, c;
cin >> a >> b >> c;
cout << a + b + c - max({a, b, c}) << endl;
}
| [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 823,237 | 823,238 | u010004797 | cpp |
p03011 | #include <bits/stdc++.h>
using namespace std;
int main() {
int P, Q, R;
cin >> P >> Q >> R;
cout << min(min(P + Q, Q + R), R + Q) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int P, Q, R;
cin >> P >> Q >> R;
cout << min(min(P + Q, Q + R), R + P) << endl;
} | [
"identifier.change",
"io.output.change"
] | 823,248 | 823,249 | u679366464 | cpp |
p03011 | #include <bits/stdc++.h>
using namespace std;
int main() {
int P, Q, R;
cin >> P >> Q >> R;
if (P > Q && P > R) {
cout << Q + R << endl;
} else if (Q > P && Q > R) {
cout << P + R << endl;
} else {
cout << Q + P << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int P, Q, R;
cin >> P >> Q >> R;
if (P >= Q && P >= R) {
cout << Q + R << endl;
} else if (Q >= P && Q >= R) {
cout << P + R << endl;
} else {
cout << Q + P << endl;
}
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 823,250 | 823,251 | u373984877 | cpp |
p03011 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int n[3];
cin >> n[0] >> n[1] >> n[2];
sort(n, n + 2);
cout << n[0] + n[1] << endl;
return 0;
} | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int n[3];
cin >> n[0] >> n[1] >> n[2];
sort(n, n + 3);
cout << n[0] + n[1] << endl;
return 0;
} | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 823,254 | 823,255 | u114838227 | cpp |
p03011 | #include <algorithm>
#include <cmath>
#include <complex> // complex<double> a(1.2 , 2.3);// real(): 1.2, imag()2.3
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
#define MOD 1000000007
#define ll long long
#define ld long double
#define FOR(i, a, b) for (ll i = (ll)a; i < (ll)b; i++)
#define rep(i, n) FOR(i, 0, n)
#define pb push_back
#define mp make_pair
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define rmsame(a) sort(all(a)), a.erase(unique(all(a)), a.end())
#define rmvector(a, b) \
rep(i, a.size()) rep(j, b.size()) if (a[i] == b[j]) { \
a.erase(a.begin() + i); \
i--; \
break; \
}
#define first_more_idx(ve, num) \
upper_bound(all(ve), num) - ve.begin() // idx = first_more_idx(ve,num); if(idx
// = ve.size()) , then not exist
#define first_lessequal_idx(ve, num) lower_bound(all(ve), num) - ve.begin()
#define pq_pair_tB \
priority_queue<pair<ll, ll>, vector<pair<ll, ll>>, greater<pair<ll, ll>>>
#define pq_pair_ts priority_queue<pair<ll, ll>> // only sort first param
template <typename X> bool exist(vector<X> vec, X item) {
return find(all(vec), item) != vec.end();
}
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
ll power(ll x, ll n) {
if (n == 0)
return 1;
return (n % 2) ? x * power(x, n - 1) % MOD : power(x * x % MOD, n / 2);
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll A, B, C;
cin >> A >> B >> C;
cout << A + B + C - min(A, min(B, C)) << endl;
// cout << fixed << setprecision(16) << ans << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <complex> // complex<double> a(1.2 , 2.3);// real(): 1.2, imag()2.3
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
#define MOD 1000000007
#define ll long long
#define ld long double
#define FOR(i, a, b) for (ll i = (ll)a; i < (ll)b; i++)
#define rep(i, n) FOR(i, 0, n)
#define pb push_back
#define mp make_pair
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define rmsame(a) sort(all(a)), a.erase(unique(all(a)), a.end())
#define rmvector(a, b) \
rep(i, a.size()) rep(j, b.size()) if (a[i] == b[j]) { \
a.erase(a.begin() + i); \
i--; \
break; \
}
#define first_more_idx(ve, num) \
upper_bound(all(ve), num) - ve.begin() // idx = first_more_idx(ve,num); if(idx
// = ve.size()) , then not exist
#define first_lessequal_idx(ve, num) lower_bound(all(ve), num) - ve.begin()
#define pq_pair_tB \
priority_queue<pair<ll, ll>, vector<pair<ll, ll>>, greater<pair<ll, ll>>>
#define pq_pair_ts priority_queue<pair<ll, ll>> // only sort first param
template <typename X> bool exist(vector<X> vec, X item) {
return find(all(vec), item) != vec.end();
}
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
ll power(ll x, ll n) {
if (n == 0)
return 1;
return (n % 2) ? x * power(x, n - 1) % MOD : power(x * x % MOD, n / 2);
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll A, B, C;
cin >> A >> B >> C;
cout << A + B + C - max(A, max(B, C)) << endl;
// cout << fixed << setprecision(16) << ans << endl;
return 0;
}
| [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 823,258 | 823,259 | u866107333 | cpp |
p03011 | #include <iostream>
using namespace std;
int main(void) {
int P, Q, R;
cin >> P >> Q >> R;
int T;
if ((P + Q) < (Q + R) && (P + Q) < (P + R)) {
T = P + Q;
}
if ((Q + R) < (P + Q) && (Q + R) < (P + R)) {
T = Q + R;
}
if ((P + R) < (Q + R) && (P + R) < (P + Q)) {
T = P + R;
}
cout << T;
}
| #include <iostream>
using namespace std;
int main(void) {
int P, Q, R;
cin >> P >> Q >> R;
int T;
if ((P + Q) <= (Q + R) && (P + Q) <= (P + R)) {
T = P + Q;
}
if ((Q + R) <= (P + Q) && (Q + R) <= (P + R)) {
T = Q + R;
}
if ((P + R) <= (Q + R) && (P + R) <= (P + Q)) {
T = P + R;
}
cout << T;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 823,262 | 823,263 | u968313090 | cpp |
p03011 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, r1, r2, r3;
cin >> a;
cin >> b;
cin >> c;
r1 = a + b;
r2 = b + c;
r3 = a + c;
if (r1 >= r2 && r1 >= r3)
cout << r1 << endl;
else if (r2 >= r1 && r2 >= r3)
cout << r2 << endl;
else
cout << r3 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, r1, r2, r3;
cin >> a;
cin >> b;
cin >> c;
r1 = a + b;
r2 = b + c;
r3 = a + c;
if (r1 <= r2 && r1 <= r3)
cout << r1 << endl;
else if (r2 <= r1 && r2 <= r3)
cout << r2 << endl;
else
cout << r3 << endl;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 823,275 | 823,276 | u540741303 | cpp |
p03011 | #include <iostream>
using namespace std;
int main() {
int a, b, c, d;
cin >> a >> b >> c;
if (a + b <= b + c or a + b <= a + c) {
cout << a + b << endl;
} else if (b + c <= a + b or b + c <= a + c) {
cout << b + c << endl;
} else if (a + c <= a + b or a + c <= b + c) {
cout << a + c << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a + b <= b + c and a + b <= a + c) {
cout << a + b << endl;
} else if (b + c <= a + b and b + c <= a + c) {
cout << b + c << endl;
} else if (a + c <= a + b and a + c <= b + c) {
cout << a + c << endl;
}
return 0;
} | [
"variable_declaration.remove",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 823,277 | 823,278 | u431873156 | cpp |
p03011 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
double P, Q, R;
cin >> P >> Q >> R;
cout << min(P + Q, max(Q + R, R + P));
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
double P, Q, R;
cin >> P >> Q >> R;
cout << min(P + Q, min(Q + R, R + P));
} | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 823,279 | 823,280 | u473116917 | cpp |
p03011 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int P, Q, R;
cin >> P >> Q >> R;
cout << min(P + Q, max(Q + R, R + P));
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
double P, Q, R;
cin >> P >> Q >> R;
cout << min(P + Q, min(Q + R, R + P));
} | [
"variable_declaration.type.primitive.change",
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 823,281 | 823,280 | u473116917 | cpp |
p03011 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(x) (x).begin(), (x).end()
using namespace std;
int main() {
int p, q, r;
int ans = 0;
cin >> p >> q >> r;
ans = min(p + q, min(q + r, r + q));
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(x) (x).begin(), (x).end()
using namespace std;
int main() {
int p, q, r;
int ans = 0;
cin >> p >> q >> r;
ans = min(p + q, min(q + r, r + p));
cout << ans << endl;
} | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 823,284 | 823,285 | u479032944 | cpp |
p03011 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, A, B, C, E, D;
cin >> a >> b >> c;
A = a + b;
B = b + c;
C = a + c;
if (A > B) {
E = A;
} else {
E = B;
}
if (E > C) {
D = C;
} else {
D = E;
}
cout << D << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, A, B, C, E, D;
cin >> a >> b >> c;
A = a + b;
B = b + c;
C = a + c;
if (A > B) {
E = B;
} else {
E = A;
}
if (E > C) {
D = C;
} else {
D = E;
}
cout << D << endl;
} | [
"assignment.value.change",
"identifier.change"
] | 823,292 | 823,293 | u348914050 | cpp |
p03011 | #include <iostream>
using namespace std;
int main(void) {
int p, q, r;
cin >> p >> q >> r;
int r1 = p + q, r2 = q + r, r3 = r + p;
if (r1 <= r2 && r1 <= r3)
cout << r1;
if (r2 <= r1 && r2 <= r3)
cout << r2;
if (r3 <= r1 && r3 <= r2)
cout << r3;
} | #include <iostream>
using namespace std;
int main(void) {
int p, q, r;
cin >> p >> q >> r;
int r1 = p + q, r2 = q + r, r3 = r + p;
if (r1 <= r2 && r1 <= r3)
cout << r1;
else if (r2 <= r1 && r2 <= r3)
cout << r2;
else if (r3 <= r1 && r3 <= r2)
cout << r3;
} | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 823,294 | 823,295 | u991152356 | cpp |
p03011 | #include <bits/stdc++.h>
using namespace std;
int main() {
int P, R, Q, a;
cin >> P >> R >> Q;
a = min({P + R, R + Q, P + Q});
if (a == P + R) {
cout << a << endl;
}
if (a == R + Q) {
cout << a << endl;
}
if (a == P + Q) {
cout << a << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int P, R, Q, a;
cin >> P >> R >> Q;
a = min({P + R, R + Q, P + Q});
if (a == P + R) {
cout << a << endl;
} else if (a == R + Q) {
cout << a << endl;
} else if (a == P + Q) {
cout << a << endl;
}
} | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 823,322 | 823,323 | u910900288 | cpp |
p03011 | #include <stdio.h>
using namespace std;
int P, Q, R;
int a;
int c[2];
int main() {
scanf("%d %d %d", &P, &Q, &R);
c[0] = P + Q;
c[1] = Q + R;
c[2] = R + P;
a = P + Q;
if (a < Q + R)
a = Q + R;
if (a < R + P)
a = R + P;
printf("%d", a);
return 0;
} | #include <stdio.h>
using namespace std;
int P, Q, R;
int a;
int c[2];
int main() {
scanf("%d %d %d", &P, &Q, &R);
c[0] = P + Q;
c[1] = Q + R;
c[2] = R + P;
a = P + Q;
if (a > Q + R)
a = Q + R;
if (a > R + P)
a = R + P;
printf("%d", a);
return 0;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 823,326 | 823,327 | u088989565 | cpp |
p03011 | #include <bits/stdc++.h>
using namespace std;
int main() {
int p, q, r;
cin >> p >> q >> r;
cout << p + q + r - min(p, min(q, r)) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int p, q, r;
cin >> p >> q >> r;
cout << p + q + r - max(p, max(q, r)) << endl;
}
| [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 823,328 | 823,329 | u859897687 | cpp |
p03011 | #include <iostream>
using namespace std;
int main() {
int s[3];
for (int i = 0; i < 3; i++) {
cin >> s[i];
}
int m;
for (int j = 0; j < 3; j++) {
for (int k = 1; k < 3; k++) {
if (s[j] > s[k]) {
m = s[j];
s[j] = s[k];
s[k] = m;
}
}
}
cout << s[0] + s[1] << endl;
} | #include <iostream>
using namespace std;
int main() {
int s[3];
for (int i = 0; i < 3; i++) {
cin >> s[i];
}
int m;
for (int j = 0; j < 2; j++) {
for (int k = j + 1; k < 3; k++) {
if (s[j] > s[k]) {
m = s[j];
s[j] = s[k];
s[k] = m;
}
}
}
cout << s[0] + s[1] << endl;
} | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"control_flow.loop.for.initializer.change"
] | 823,352 | 823,353 | u805227991 | cpp |
p03011 | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> v(3);
for (int i = 0; i < 2; ++i) {
cin >> v[i];
}
sort(v.begin(), v.end());
int t = v[1] + v[0];
cout << t << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> v(3);
for (int i = 0; i < 3; ++i) {
cin >> v[i];
}
sort(v.begin(), v.end());
int t = v[0] + v[1];
cout << t << endl;
} | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"variable_access.subscript.index.change"
] | 823,358 | 823,359 | u567252408 | cpp |
p03011 | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> v(3);
for (int i = 0; i < 2; ++i) {
cin >> v[i];
}
sort(v.begin(), v.end());
int t = v[1] + v[2];
cout << t << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> v(3);
for (int i = 0; i < 3; ++i) {
cin >> v[i];
}
sort(v.begin(), v.end());
int t = v[0] + v[1];
cout << t << endl;
} | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"variable_access.subscript.index.change"
] | 823,360 | 823,359 | u567252408 | cpp |
p03011 | #include <bits/stdc++.h>
using namespace std;
int main()
{
int P, Q, R;
cin >> P >> Q >> R;
cout << P + Q + R - min({P, Q, R});
} | #include <bits/stdc++.h>
using namespace std;
int main()
{
int P, Q, R;
cin >> P >> Q >> R;
cout << P + Q + R - max({P, Q, R});
} | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 823,367 | 823,368 | u653388379 | cpp |
p03011 | #include <iostream>
using namespace std;
int main(void) {
// Your code here!
int p, q, r;
cin >> p >> q >> r;
int a = p + q, b = q + r, c = r + p;
cin >> a >> b >> c;
if (a <= b) {
if (a <= c)
cout << a << endl;
if (a >= c)
cout << c << endl;
}
if (b < a) {
if (b <= c)
cout << b << endl;
if (b >= c)
cout << c << endl;
}
} | #include <iostream>
using namespace std;
int main(void) {
// Your code here!
int p, q, r;
cin >> p >> q >> r;
int a = p + q, b = q + r, c = r + p;
cin >> a >> b >> c;
if (a <= b) {
if (a <= c)
cout << a << endl;
if (a > c)
cout << c << endl;
}
if (b < a) {
if (b <= c)
cout << b << endl;
if (b > c)
cout << c << endl;
}
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 823,369 | 823,370 | u133525845 | cpp |
p03011 | // https://atcoder.jp/contests/abc129/tasks/abc129_a
#include <bits/stdc++.h>
#define debugi(x) cerr << "x -> " << x << endl;
#define For(i, n) for (__typeof(i) i = 0; i < n; i++)
#define all(v) v.begin(), v.end()
#define _ \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
void solve() {
int i;
vector<int> flight_times(3, INT_MAX);
For(i, 3) { cin >> flight_times[i]; }
sort(all(flight_times));
cout << flight_times[0] + flight_times[1] << endl;
}
int main() {
_;
ull testcases = 1LL;
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
// cin >> testcases;
while (testcases--)
solve();
return 0;
} | // https://atcoder.jp/contests/abc129/tasks/abc129_a
#include <bits/stdc++.h>
#define debugi(x) cerr << "x -> " << x << endl;
#define For(i, n) for (__typeof(i) i = 0; i < n; i++)
#define all(v) v.begin(), v.end()
#define ONLINE_JUDGE
#define _ \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
void solve() {
int i;
vector<int> flight_times(3, INT_MAX);
For(i, 3) { cin >> flight_times[i]; }
sort(all(flight_times));
cout << flight_times[0] + flight_times[1] << endl;
}
int main() {
_;
ull testcases = 1LL;
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
// cin >> testcases;
while (testcases--)
solve();
return 0;
} | [] | 823,373 | 823,374 | u673273726 | cpp |
p03011 | #include <iostream>
using namespace std;
int main() {
int p, q, r;
cin >> p >> q >> r;
int min = p + q;
if (min > p + r) {
min = p + r;
} else if (min > q + r) {
min = q + r;
}
cout << min << endl;
} | #include <iostream>
using namespace std;
int main() {
int p, q, r;
cin >> p >> q >> r;
int min = p + q;
if (min > p + r) {
min = p + r;
}
if (min > q + r) {
min = q + r;
}
cout << min << endl;
} | [
"control_flow.branch.if.replace.add",
"control_flow.branch.else_if.replace.remove"
] | 823,387 | 823,388 | u962942039 | cpp |
p03011 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
int p, q, r, ans;
cin >> p >> q >> r;
ans = p + q + r;
cout << ans - min({p, q, r}) << endl;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
int p, q, r, ans;
cin >> p >> q >> r;
ans = p + q + r;
cout << ans - max({p, q, r}) << endl;
} | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 823,391 | 823,392 | u294829559 | cpp |
p03011 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int gcd(int a, int b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << max(max(a + b, b + c), a + c);
} | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int gcd(int a, int b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << min(min(a + b, b + c), a + c);
} | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 823,397 | 823,398 | u554988565 | cpp |
p03011 | /*input
*/
#include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pdd;
#define IOS \
ios_base::sync_with_stdio(0); \
cin.tie(0)
#define ALL(a) a.begin(), a.end()
#define SZ(a) ((int)a.size())
#define F first
#define S second
#define REP(i, n) for (int i = 0; i < ((int)n); i++)
#define pb emplace_back
#define MP(a, b) make_pair(a, b)
#define SORT_UNIQUE(c) \
(sort(c.begin(), c.end()), \
c.resize(distance(c.begin(), unique(c.begin(), c.end()))))
#define GET_POS(c, x) (lower_bound(c.begin(), c.end(), x) - c.begin())
template <typename T1, typename T2>
ostream &operator<<(ostream &out, pair<T1, T2> P) {
out << '(' << P.F << ',' << P.S << ')';
return out;
}
//}}}
const ll maxn = 300005;
const ll maxlg = __lg(maxn) + 2;
const ll INF64 = 8000000000000000000LL;
const int INF = 0x3f3f3f3f;
const ll MOD = ll(1e9 + 7);
const ld PI = acos(-1);
const ld eps = 1e-9;
// const ll p=880301;
// const ll P=31;
ll mypow(ll a, ll b) {
ll res = 1LL;
while (b) {
if (b & 1)
res = res * a % MOD;
a = a * a % MOD;
b >>= 1;
}
return res;
}
int main() {
IOS;
int a, b, c;
cin >> a >> b >> c;
cout << a + b + c - min({a, b, c});
return 0;
}
| /*input
*/
#include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pdd;
#define IOS \
ios_base::sync_with_stdio(0); \
cin.tie(0)
#define ALL(a) a.begin(), a.end()
#define SZ(a) ((int)a.size())
#define F first
#define S second
#define REP(i, n) for (int i = 0; i < ((int)n); i++)
#define pb emplace_back
#define MP(a, b) make_pair(a, b)
#define SORT_UNIQUE(c) \
(sort(c.begin(), c.end()), \
c.resize(distance(c.begin(), unique(c.begin(), c.end()))))
#define GET_POS(c, x) (lower_bound(c.begin(), c.end(), x) - c.begin())
template <typename T1, typename T2>
ostream &operator<<(ostream &out, pair<T1, T2> P) {
out << '(' << P.F << ',' << P.S << ')';
return out;
}
//}}}
const ll maxn = 300005;
const ll maxlg = __lg(maxn) + 2;
const ll INF64 = 8000000000000000000LL;
const int INF = 0x3f3f3f3f;
const ll MOD = ll(1e9 + 7);
const ld PI = acos(-1);
const ld eps = 1e-9;
// const ll p=880301;
// const ll P=31;
ll mypow(ll a, ll b) {
ll res = 1LL;
while (b) {
if (b & 1)
res = res * a % MOD;
a = a * a % MOD;
b >>= 1;
}
return res;
}
int main() {
IOS;
int a, b, c;
cin >> a >> b >> c;
cout << a + b + c - max({a, b, c});
return 0;
}
| [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 823,401 | 823,402 | u010467501 | cpp |
p03011 | #include <iostream>
using namespace std;
int main() {
int A[4], i, min, tmp;
for (i = 0; i < 2; i++) {
cin >> A[i];
}
A[3] = A[0];
min = 200;
for (i = 0; i < 3; i++) {
tmp = A[i] + A[i + 1];
if (tmp < min) {
min = tmp;
}
}
cout << min << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int A[4], i, min, tmp;
for (i = 0; i < 3; i++) {
cin >> A[i];
}
A[3] = A[0];
min = 200;
for (i = 0; i < 3; i++) {
tmp = A[i] + A[i + 1];
if (tmp < min) {
min = tmp;
}
}
cout << min << endl;
return 0;
} | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 823,408 | 823,409 | u423803491 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.