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 <bits/stdc++.h>
using namespace std;
int main() {
int p, q, r;
cin >> p >> q >> r;
vector<int> route(3);
route[0] = p + q;
route[1] = r + q;
route[2] = p + r;
int m = min({route[0], route[1], route[2]});
cout << p + q << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int p, q, r;
cin >> p >> q >> r;
vector<int> route(3);
route[0] = p + q;
route[1] = r + q;
route[2] = p + r;
int m = min({route[0], route[1], route[2]});
cout << m << endl;
}
| [
"identifier.change",
"io.output.change",
"expression.operation.binary.remove"
] | 823,412 | 823,413 | u173210352 | cpp |
p03011 | #include <iostream>
using namespace std;
int main() {
int p, q, r;
cin >> p >> q >> r;
int a = p + q;
int b = p + r;
int c = q + r;
int d = max(a, b);
cout << max(c, d) << endl;
} | #include <iostream>
using namespace std;
int main() {
int p, q, r;
cin >> p >> q >> r;
int a = p + q;
int b = p + r;
int c = q + r;
int d = min(a, b);
cout << min(c, d) << endl;
}
| [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 823,428 | 823,429 | u532401120 | cpp |
p03011 | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <stdio.h>
#include <string>
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < n; i++)
#define For(i, a, b) for (int i = (a); i < (b); i++)
#define all(a) (a).begin(), (a).end()
#define ra... | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <stdio.h>
#include <string>
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < n; i++)
#define For(i, a, b) for (int i = (a); i < (b); i++)
#define all(a) (a).begin(), (a).end()
#define ra... | [
"expression.operation.binary.remove",
"assignment.change"
] | 823,432 | 823,433 | u767543103 | cpp |
p03011 | #include <bits/stdc++.h>
using namespace std;
int main() {
int min_hour = 0;
int P_hour = 0, Q_hour = 0, R_hour = 0;
cin >> P_hour >> Q_hour >> R_hour;
min_hour = P_hour + Q_hour;
if (Q_hour + R_hour < min_hour) {
min_hour = Q_hour + R_hour;
} else if (R_hour + P_hour < min_hour) {
min_hour = R_... | #include <bits/stdc++.h>
using namespace std;
int main() {
int min_hour = 0;
int P_hour = 0, Q_hour = 0, R_hour = 0;
cin >> P_hour >> Q_hour >> R_hour;
min_hour = P_hour + Q_hour;
if (Q_hour + R_hour < min_hour) {
min_hour = Q_hour + R_hour;
}
if (R_hour + P_hour < min_hour) {
min_hour = R_hou... | [
"control_flow.branch.if.replace.add",
"control_flow.branch.else_if.replace.remove"
] | 823,445 | 823,446 | u718082610 | 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;
using P = pair<int, int>;
using namespace std;
template <class T> void vin(vector<T> &v, int n) {
v.resize(n);
for (int i = 0; i < n; ++i) {
cin >> v[i];
}
}
int main() {
int P, ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = (0); (i) < (int)(n); ++(i))
using ll = long long;
using P = pair<int, int>;
using namespace std;
template <class T> void vin(vector<T> &v, int n) {
v.resize(n);
for (int i = 0; i < n; ++i) {
cin >> v[i];
}
}
int main() {
int P, ... | [
"call.arguments.change"
] | 823,451 | 823,452 | u482544950 | cpp |
p03011 | #include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int P, Q, R;
cin >> P >> Q >> R;
if (P > Q && P > R) {
printf("%d\n", Q + R);
return 0;
} else if (Q > P && Q > R) {
printf("%d\n", P + R);
return 0;
} else {
printf("%d\n", P + Q);
return 0;
}
} | #include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int P, Q, R;
cin >> P >> Q >> R;
if (P >= Q && P >= R) {
printf("%d\n", Q + R);
return 0;
} else if (Q >= P && Q >= R) {
printf("%d\n", P + R);
return 0;
} else {
printf("%d\n", P + Q);
return 0;
}
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 823,453 | 823,454 | u300866293 | cpp |
p03011 | #include <iostream>
#include <math.h>
using namespace std;
int main() {
int x, p, q, r;
cin >> p, q, r;
x = min(p + q, min(q + r, r + p));
cout << x;
return 0;
}
| #include <iostream>
#include <math.h>
using namespace std;
int main() {
int x, p, q, r;
cin >> p >> q >> r;
x = min(p + q, min(q + r, r + p));
cout << x;
return 0;
}
| [] | 823,470 | 823,471 | u187491596 | cpp |
p03011 | #include <bits/stdc++.h>
using namespace std;
int main() {
int P, Q, R;
cin >> P >> Q >> R;
if (Q > R && R > P) {
cout << P + R << endl;
}
if (R > P && P > Q) {
cout << P + Q << endl;
}
if (P > Q && Q > R) {
cout << R + Q << endl;
}
if (Q > P && P > R) {
cout << P + R << endl;
}... | #include <bits/stdc++.h>
using namespace std;
int main() {
int P, Q, R;
cin >> P >> Q >> R;
if (Q > R && R > P) {
cout << P + R << endl;
}
if (R > P && P > Q) {
cout << P + Q << endl;
}
if (P > Q && Q > R) {
cout << R + Q << endl;
}
if (Q > P && P > R) {
cout << P + R << endl;
}... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"io.output.change"
] | 823,480 | 823,481 | u085887707 | cpp |
p03011 | #include <bits/stdc++.h>
using namespace std;
int main() {
int P, Q, R;
cin >> P >> Q >> R;
if (Q > R && R > P) {
cout << P + R << endl;
}
if (R > P && P > Q) {
cout << P + Q << endl;
}
if (P > Q && Q > R) {
cout << R + Q << endl;
}
if (Q > P && P > R) {
cout << P + R << endl;
}... | #include <bits/stdc++.h>
using namespace std;
int main() {
int P, Q, R;
cin >> P >> Q >> R;
if (Q > R && R > P) {
cout << P + R << endl;
}
if (R > P && P > Q) {
cout << P + Q << endl;
}
if (P > Q && Q > R) {
cout << R + Q << endl;
}
if (Q > P && P > R) {
cout << P + R << endl;
}... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"io.output.change"
] | 823,482 | 823,481 | u085887707 | cpp |
p03011 | #include <bits/stdc++.h>
using namespace std;
int main() {
int P, Q, R;
cin >> P >> Q >> R;
if (Q > R && R > P) {
cout << P + R << endl;
}
if (R > P && P > Q) {
cout << P + Q << endl;
}
if (P > Q && Q > R) {
cout << R + Q << endl;
}
if (Q > P && P > R) {
cout << P + R << endl;
}... | #include <bits/stdc++.h>
using namespace std;
int main() {
int P, Q, R;
cin >> P >> Q >> R;
if (Q > R && R > P) {
cout << P + R << endl;
}
if (R > P && P > Q) {
cout << P + Q << endl;
}
if (P > Q && Q > R) {
cout << R + Q << endl;
}
if (Q > P && P > R) {
cout << P + R << endl;
}... | [
"identifier.change",
"io.output.change"
] | 823,483 | 823,481 | u085887707 | cpp |
p03011 | #include <bits/stdc++.h>
using namespace std;
int main() {
int P, Q, R;
cin >> P >> Q >> R;
if (Q > R && R > P) {
cout << P + R << endl;
}
if (R > P && P > Q) {
cout << P + Q << endl;
}
if (P > Q && Q > R) {
cout << R + Q << endl;
}
if (Q > P && P > R) {
cout << P + R << endl;
}... | #include <bits/stdc++.h>
using namespace std;
int main() {
int P, Q, R;
cin >> P >> Q >> R;
if (Q > R && R > P) {
cout << P + R << endl;
}
if (R > P && P > Q) {
cout << P + Q << endl;
}
if (P > Q && Q > R) {
cout << R + Q << endl;
}
if (Q > P && P > R) {
cout << P + R << endl;
}... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"io.output.change"
] | 823,484 | 823,481 | u085887707 | cpp |
p03011 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define whole(f, x, ...) \
([&](decltype((x)) whole) { \
return (f)(begin(whole), end(w... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define whole(f, x, ...) \
([&](decltype((x)) whole) { \
return (f)(begin(whole), end(w... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 823,485 | 823,486 | u369212307 | cpp |
p03011 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
int m = max(max(A + B, B + C), C + A);
cout << m << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
int m = min(min(A + B, B + C), C + A);
cout << m << endl;
}
| [
"misc.opposites",
"identifier.change",
"call.function.change",
"call.arguments.change"
] | 823,495 | 823,496 | u222866518 | cpp |
p03011 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int a[3];
cin >> a[0] >> a[1] >> a[2];
sort(a, a + 3);
cout << a[0] << a[1];
return 0;
} |
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int a[3] = {};
cin >> a[0] >> a[1] >> a[2];
sort(a, a + 3);
cout << a[0] + a[1];
return 0;
} | [
"variable_declaration.value.change",
"io.output.change"
] | 823,514 | 823,515 | u344810256 | cpp |
p03011 | #include <algorithm>
#include <cctype>
#include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << a + b + c - (max(a, (b, c))) << endl;
return 0;
} | #include <algorithm>
#include <cctype>
#include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << a + b + c - (max(a, max(b, c))) << endl;
} | [
"call.add",
"call.arguments.change"
] | 823,522 | 823,523 | u568453908 | cpp |
p03011 |
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <tuple>
#include <vector>
using ll = ... |
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <tuple>
#include <vector>
using ll = ... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 823,530 | 823,531 | u136354774 | cpp |
p03011 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define int long long
using namespace std;
signed main() {
int p, q, r;
cin >> p >> q >> r;
cout << p + q + r - min(min(p, q), r) << endl;
} | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define int long long
using namespace std;
signed main() {
int p, q, r;
cin >> p >> q >> r;
cout << p + q + r - max(max(p, q), r) << endl;
} | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 823,545 | 823,546 | u141968173 | cpp |
p03011 | #include <stdio.h>
int main() {
int p, q, r;
int min = 300;
scanf("%d %d %d", &p, &q, &r);
if (p + q < min) {
min = p + q;
} else if (p + r < min) {
min = p + r;
} else if (q + r < min) {
min = q + r;
}
printf("%d", min);
return 0;
}
| #include <stdio.h>
int main() {
int p, q, r;
int min = 300;
scanf("%d %d %d", &p, &q, &r);
if (p + q < min) {
min = p + q;
}
if (p + r < min) {
min = p + r;
}
if (q + r < min) {
min = q + r;
}
printf("%d", min);
return 0;
} | [
"control_flow.branch.if.replace.add",
"control_flow.branch.else_if.replace.remove"
] | 823,568 | 823,569 | u353919145 | cpp |
p03011 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << max(a + b, max(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, min(b + c, c + a)) << endl;
}
| [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 823,572 | 823,573 | u882098164 | cpp |
p03011 | #include <algorithm>
#include <stdio.h>
using namespace std;
int main() {
int p, q, r, maxx;
scanf("%d%d%d", &p, &q, &r);
maxx = max(p, (q, r));
printf("%d\n", p + q + r - maxx);
return 0;
} | #include <algorithm>
#include <stdio.h>
using namespace std;
int main() {
int p, q, r, maxx;
scanf("%d%d%d", &p, &q, &r);
maxx = max(p, max(q, r));
printf("%d\n", p + q + r - maxx);
return 0;
} | [
"call.add",
"call.arguments.change"
] | 823,580 | 823,581 | u089230684 | cpp |
p03011 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int p, q, r, menor = 101;
cin >> p >> q >> r;
if ((p + q) < menor)
menor = p + q;
else if ((q + r) < menor)
menor = q + r;
else if ((p + r) < menor)
menor = p + r;
cout << menor <... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int p, q, r, menor = 201;
cin >> p >> q >> r;
if ((p + q) < menor)
menor = p + q;
if ((q + r) < menor)
menor = q + r;
if ((p + r) < menor)
menor = p + r;
cout << menor << endl;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.branch.if.replace.add",
"control_flow.branch.else_if.replace.remove"
] | 823,582 | 823,583 | u816631826 | cpp |
p03011 | #include <algorithm>
#include <bits/stdc++.h>
#include <ctype.h>
#include <iostream>
#include <math.h>
#include <string.h>
#include <string>
using namespace std;
int main() {
int p[3];
for (int i = 0; i < 3; i++)
cin >> p[i];
sort(p, p + 2);
cout << p[0] + p[1] << endl;
} | #include <algorithm>
#include <bits/stdc++.h>
#include <ctype.h>
#include <iostream>
#include <math.h>
#include <string.h>
#include <string>
using namespace std;
int main() {
int p[3];
for (int i = 0; i < 3; i++)
cin >> p[i];
sort(p, p + 3);
cout << p[0] + p[1] << endl;
} | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 823,584 | 823,585 | u337018543 | cpp |
p03011 | #include <iostream>
using namespace std;
int main() {
int p, q, r;
cin >> p >> q >> r;
cout << max(max(p + q, p + r), q + p);
} | #include <iostream>
using namespace std;
int main() {
int p, q, r;
cin >> p >> q >> r;
cout << min(min(p + q, p + r), q + r);
}
| [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 823,590 | 823,591 | u005275032 | cpp |
p03011 | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int ans = a + b > b + c ? a + b : b + c;
ans = ans > c + a ? ans : c + a;
cout << ans << endl;
}
| #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int ans = a + b < b + c ? a + b : b + c;
ans = ans < c + a ? ans : c + a;
cout << ans << endl;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"assignment.value.change"
] | 823,595 | 823,596 | u965093879 | cpp |
p03011 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 823,597 | 823,598 | u156778176 | cpp |
p03011 | #include <algorithm>
#include <iostream>
using namespace std;
int P, Q, R;
void solve() {
int ans = P + Q + R;
int m = P;
m = max(m, Q);
m = max(m, R);
ans -= R;
cout << ans << endl;
}
int main() {
cin >> P >> Q >> R;
solve();
return 0;
} | #include <algorithm>
#include <iostream>
using namespace std;
int P, Q, R;
void solve() {
int ans = P + Q + R;
int m = P;
m = max(m, Q);
m = max(m, R);
ans -= m;
cout << ans << endl;
}
int main() {
cin >> P >> Q >> R;
solve();
return 0;
} | [
"assignment.value.change",
"identifier.change"
] | 823,605 | 823,606 | u540433787 | cpp |
p03011 | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int ma... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int ma... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 823,621 | 823,622 | u105801182 | cpp |
p03011 | #include <algorithm>
#include <climits>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vect... | #include <algorithm>
#include <climits>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vect... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 823,623 | 823,624 | u917048429 | cpp |
p03011 | #include <iostream>
using namespace std;
int main(void) {
int x, y, z;
cin >> x >> y >> z;
if (x > y) {
if (z > x) {
cout << x + y << endl;
} else {
cout << y + z << endl;
}
} else if (y > x) {
if (z > y) {
cout << x + y << endl;
} else {
cout << x + z << endl;
... | #include <iostream>
using namespace std;
int main(void) {
int x, y, z;
cin >> x >> y >> z;
if (x > y) {
if (z >= x) {
cout << x + y << endl;
} else {
cout << y + z << endl;
}
} else if (y >= x) {
if (z >= y) {
cout << x + y << endl;
} else {
cout << x + z << endl;
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 823,625 | 823,626 | u257402864 | cpp |
p03011 | #include <bits/stdc++.h>
using namespace std;
#define print(x) cout << (x) << endl;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int P, Q, R;
cin >> P >> Q >> R;
vector<int> A(3);
A.at(0) = P;
A.at(1) = Q;
A.at(2) = R;
sort(A.begin(), A.begin());
cout << A.at(0) + A.at(1) << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define print(x) cout << (x) << endl;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int P, Q, R;
cin >> P >> Q >> R;
vector<int> A(3);
A.at(0) = P;
A.at(1) = Q;
A.at(2) = R;
sort(A.begin(), A.end());
cout << A.at(0) + A.at(1) << endl;
} | [
"call.function.change",
"call.arguments.change"
] | 823,633 | 823,634 | u583742345 | cpp |
p03011 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a[4];
for (int i = 1; i <= 3; i++) {
cin >> a[i];
}
sort(a + 1, a + 4 + 1);
cout << (a[1] + a[2]);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a[4];
for (int i = 1; i <= 3; i++) {
cin >> a[i];
}
sort(a + 1, a + 3 + 1);
cout << a[1] + a[2];
return 0;
}
| [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 823,639 | 823,640 | u152997492 | cpp |
p03011 | #include <iostream>
using namespace std;
int main() {
int P, Q, R, ans;
cin >> P >> Q >> R;
ans = P + Q;
if (ans > Q + R)
ans = Q + R;
if (ans > R + Q)
ans = R + Q;
cout << ans << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int P, Q, R, ans;
cin >> P >> Q >> R;
ans = P + Q;
if (ans > Q + R)
ans = Q + R;
if (ans > R + P)
ans = R + P;
cout << ans << endl;
return 0;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 823,651 | 823,652 | u570124150 | cpp |
p03011 | #include <bits/stdc++.h>
using namespace std;
typedef long long int lli;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int p, q, r;
cin >> p >> q >> r;
cout << min(p + q, max(q + r, r + p)) << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long int lli;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int p, q, r;
cin >> p >> q >> r;
cout << min(p + q, min(q + r, r + p)) << endl;
return 0;
}
| [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 823,659 | 823,660 | u905270643 | cpp |
p03011 | #include <bits/stdc++.h>
using namespace std;
int P, Q, R;
int main(void) {
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;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int P, Q, R;
int main(void) {
cin >> P >> Q >> R;
if (P > Q && P > R)
cout << Q + R << endl;
else if (Q > R)
cout << P + R << endl;
else
cout << Q + P << endl;
return 0;
}
| [
"expression.operation.binary.remove"
] | 823,663 | 823,664 | u793136026 | cpp |
p03011 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int p, q, r, ans;
cin >> p >> q >> r;
if (p >= q && p >= r)
ans = q + r;
else if (q >= p && q >= r)
ans = p + r;
else
ans = p + r;
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int p, q, r, ans;
cin >> p >> q >> r;
if (p >= q && p >= r)
ans = q + r;
else if (q >= p && q >= r)
ans = p + r;
else
ans = p + q;
cout << ans << endl;
return 0;
} | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 823,665 | 823,666 | u088895504 | cpp |
p03011 | #include "bits/stdc++.h"
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = int(a), i##_len = (b); i < i##_len; ++i)
#define MSVC_UNKO(x) x
#define rep(...) \
MSVC_UNKO(_overload3(__VA_ARGS__,... | #include "bits/stdc++.h"
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = int(a), i##_len = (b); i < i##_len; ++i)
#define MSVC_UNKO(x) x
#define rep(...) \
MSVC_UNKO(_overload3(__VA_ARGS__,... | [
"call.arguments.change",
"expression.operation.binary.change"
] | 823,669 | 823,670 | u751488284 | cpp |
p03011 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int P, Q, R;
cin >> P >> Q >> R;
int x = P + Q;
int y = Q + R;
int z = R + Q;
cout << std::min({x, y, z});
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int P, Q, R;
cin >> P >> Q >> R;
int x = P + Q;
int y = Q + R;
int z = R + P;
cout << std::min({x, y, z});
} | [
"identifier.change",
"expression.operation.binary.change"
] | 823,675 | 823,676 | u920340928 | cpp |
p03011 | #include <iostream>
using namespace std;
int main() {
int min = 10000;
int a[3];
cin >> a[0] >> a[1] >> a[2];
if (min > (a[0] + a[1])) {
min = a[0] + a[1];
}
if (min > (a[0] + a[2])) {
min = a[0] + a[2];
}
if (min > (a[1] + a[2])) {
min = a[0] + a[2];
}
cout << min << endl;
}
| #include <iostream>
using namespace std;
int main() {
int min = 10000;
int a[3];
cin >> a[0] >> a[1] >> a[2];
if (min > (a[0] + a[1])) {
min = a[0] + a[1];
}
if (min > (a[0] + a[2])) {
min = a[0] + a[2];
}
if (min > (a[1] + a[2])) {
min = a[1] + a[2];
}
cout << min << endl;
}
| [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 823,680 | 823,681 | u607564800 | cpp |
p03011 | #include <algorithm>
#include <cctype>
#include <cstdlib>
#include <iostream>
#include <string>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
int comp(const void *a, const void *b) { return *(int *)a - *(int *)b; }
int main() {
int a, b, c;
cin >> a >> b >> c;
int ab = a + b;
int bc = b +... | #include <algorithm>
#include <cctype>
#include <cstdlib>
#include <iostream>
#include <string>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
int comp(const void *a, const void *b) { return *(int *)a - *(int *)b; }
int main() {
int a, b, c;
cin >> a >> b >> c;
int ab = a + b;
int bc = b +... | [] | 823,682 | 823,683 | u373164102 | cpp |
p03011 | #include <algorithm>
#include <cctype>
#include <cstdlib>
#include <iostream>
#include <string>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
int comp(const void *a, const void *b) { return *(int *)a - *(int *)b; }
int main() {
int a, b, c;
cin >> a >> b >> c;
int ab = a + b;
int bc = b +... | #include <algorithm>
#include <cctype>
#include <cstdlib>
#include <iostream>
#include <string>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
int comp(const void *a, const void *b) { return *(int *)a - *(int *)b; }
int main() {
int a, b, c;
cin >> a >> b >> c;
int ab = a + b;
int bc = b +... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 823,684 | 823,683 | u373164102 | cpp |
p03011 | #include <bits/stdc++.h>
using namespace std;
int main() {
int P, Q, R;
cin >> P >> Q >> R;
int min, min2, tmp, ans;
if (P > Q) {
min = Q;
min2 = P;
} else {
min = P;
min2 = Q;
}
if (min > R) {
tmp = min;
min = R;
min2 = min;
} else if (min2 > R) {
min2 = R;
}
an... | #include <bits/stdc++.h>
using namespace std;
int main() {
int P, Q, R;
cin >> P >> Q >> R;
int min, min2, tmp, ans;
if (P > Q) {
min = Q;
min2 = P;
} else {
min = P;
min2 = Q;
}
if (min > R) {
tmp = min;
min = R;
min2 = tmp;
} else if (min2 > R) {
min2 = R;
}
an... | [
"assignment.value.change",
"identifier.change"
] | 823,685 | 823,686 | u111886521 | cpp |
p03011 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A + B < B + C && A + B < A + C)
cout << A + B << endl;
else if (A + C < B + C && A + C < A + B)
cout << A + C << endl;
else {
cout << C + B << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A + B <= B + C && A + B <= A + C)
cout << A + B << endl;
else if (A + C <= B + C && A + C <= A + B)
cout << A + C << endl;
else
cout << C + B << endl;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 823,691 | 823,692 | u236824845 | cpp |
p03011 | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a > b && a > c) {
cout << b + c << endl;
} else if (b > a && b > c) {
cout << a + c << endl;
} else {
cout << a + b << endl;
}
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a >= b && a >= c) {
cout << b + c << endl;
} else if (b >= a && b >= c) {
cout << a + c << endl;
} else {
cout << a + b << endl;
}
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 823,693 | 823,694 | u809889010 | cpp |
p03011 | #include <bits/stdc++.h>
using namespace std;
int main() {
int P, Q, R, result = INT_MAX;
cin >> P >> Q >> R;
if (P + Q < result) {
result = P + Q;
}
if (Q + R < result) {
result = Q + R;
}
if (R + P < result) {
result = Q + R;
}
cout << result << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int P, Q, R, result = INT_MAX;
cin >> P >> Q >> R;
if (P + Q < result) {
result = P + Q;
}
if (Q + R < result) {
result = Q + R;
}
if (R + P < result) {
result = R + P;
}
cout << result << endl;
}
| [
"expression.operation.binary.remove",
"assignment.change"
] | 823,695 | 823,696 | u085640913 | cpp |
p03011 | #include <bits/stdc++.h>
using namespace std;
int main() {
int P, Q, R;
int ans = 0;
cin >> P >> Q >> R;
if (P + R < Q + P && P + R < Q + R) {
ans += P + R;
} else if (Q + R < P + R && Q + R < P + Q) {
ans += Q + R;
} else if (P + Q < Q + R && P + Q < P + R) {
ans += P + Q;
}
cout << ans <<... | #include <bits/stdc++.h>
using namespace std;
int main() {
int P, Q, R;
int ans = 0;
cin >> P >> Q >> R;
if (P + R <= Q + P && P + R <= Q + R) {
ans += P + R;
} else if (Q + R <= P + R && Q + R <= P + Q) {
ans += Q + R;
} else if (P + Q <= Q + R && P + Q <= P + R) {
ans += P + Q;
}
cout << ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 823,697 | 823,698 | u438035643 | cpp |
p03011 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int p, q, r;
cin >> p >> q >> r;
int s = min(p + q, q + r);
int shr = min(s, r + p);
cout << s << endl;
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int p, q, r;
cin >> p >> q >> r;
int s = min(p + q, q + r);
int shr = min(s, r + p);
cout << shr << endl;
} | [
"identifier.change",
"io.output.change"
] | 823,699 | 823,700 | u056123277 | cpp |
p03011 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, a1, a2, b1;
cin >> a >> b >> c;
a1 = a + b;
a2 = a + c;
b1 = b + c;
if (a1 > a2) {
if (a1 > b1) {
cout << a1 << endl;
} else {
cout << b1 << endl;
}
} else {
if (a2 > b1) {
cout << a2 << endl;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, a1, a2, b1;
cin >> a >> b >> c;
a1 = a + b;
a2 = a + c;
b1 = b + c;
if (a1 < a2) {
if (a1 < b1) {
cout << a1 << endl;
} else {
cout << b1 << endl;
}
} else {
if (a2 < b1) {
cout << a2 << endl;
... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 823,701 | 823,702 | u264974123 | cpp |
p03011 | #include <iostream>
using namespace std;
int main() {
int P, Q, R;
cin >> P >> Q >> R;
int ans = P + Q;
ans = min(ans, Q + R);
ans = min(ans, P + Q);
cout << ans << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int P, Q, R;
cin >> P >> Q >> R;
int ans = P + Q;
ans = min(ans, Q + R);
ans = min(ans, P + R);
cout << ans << endl;
return 0;
} | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 823,703 | 823,704 | u341347211 | cpp |
p03011 | #include "bits/stdc++.h"
#include <algorithm>
using namespace std;
int main() {
int p, q, r;
cin >> p >> q >> r;
int ans = p + q + r;
if (p > q && p > r) {
ans -= p;
} else if (q > p && q > r) {
ans -= q;
} else {
ans -= r;
}
cout << ans << endl;
return (0);
} | #include "bits/stdc++.h"
#include <algorithm>
using namespace std;
int main() {
int p, q, r;
cin >> p >> q >> r;
int ans = p + q + r;
if (p >= q && p >= r) {
ans -= p;
} else if (q >= p && q >= r) {
ans -= q;
} else {
ans -= r;
}
cout << ans << endl;
return (0);
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 823,709 | 823,710 | u149751724 | cpp |
p03011 | #include "bits/stdc++.h"
#include <algorithm>
using namespace std;
int main() {
int p, q, r;
cin >> p >> q >> r;
int ans = p + q + r;
if (p > q && p > r) {
ans -= p;
} else if (q < p && q > r) {
ans -= q;
} else {
ans -= r;
}
cout << ans << endl;
return (0);
} | #include "bits/stdc++.h"
#include <algorithm>
using namespace std;
int main() {
int p, q, r;
cin >> p >> q >> r;
int ans = p + q + r;
if (p >= q && p >= r) {
ans -= p;
} else if (q >= p && q >= r) {
ans -= q;
} else {
ans -= r;
}
cout << ans << endl;
return (0);
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 823,711 | 823,710 | u149751724 | cpp |
p03011 | #include <iostream>
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;
if (a <= b) {
if (a <= c) {
cout << a;
} else {
cout << c;
}
}
if (b <= a) {
if (b <= c) {
cout << b;
} else {
cout << c;
}... | #include <iostream>
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;
if (a <= b) {
if (a <= c) {
cout << a;
} else {
cout << c;
}
}
if (b < a) {
if (b <= c) {
cout << b;
} else {
cout << c;
}
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 823,712 | 823,713 | u664272778 | cpp |
p03011 | #include <iostream>
using namespace std;
int main() {
int p, q, r;
cin >> p >> q >> r;
if (p + q <= q + r && p + q <= r + p) {
cout << p + q << endl;
} else if (q + r <= p + q && q + r <= r + p) {
cout << q + r << endl;
} else {
cout << r + q << endl;
}
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int p, q, r;
cin >> p >> q >> r;
if (p + q <= q + r && p + q <= r + p) {
cout << p + q << endl;
} else if (q + r <= p + q && q + r <= r + p) {
cout << q + r << endl;
} else {
cout << r + p << endl;
}
return 0;
}
| [
"identifier.change",
"io.output.change"
] | 823,714 | 823,715 | u338369716 | cpp |
p03011 | #include <iostream>
using namespace std;
int main() {
int p, q, r;
cin >> p >> q >> r;
if (p + q <= q + r && p + q <= r + q) {
cout << p + q << endl;
} else if (q + r <= p + q && q + r <= r + p) {
cout << q + r << endl;
} else {
cout << r + q << endl;
}
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int p, q, r;
cin >> p >> q >> r;
if (p + q <= q + r && p + q <= r + p) {
cout << p + q << endl;
} else if (q + r <= p + q && q + r <= r + p) {
cout << q + r << endl;
} else {
cout << r + p << endl;
}
return 0;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change",
"io.output.change"
] | 823,716 | 823,715 | u338369716 | cpp |
p03011 | #include <iostream>
using namespace std;
int main() {
int P;
int Q;
int R;
cin >> P >> Q >> R;
int ans;
ans = P + Q;
if (ans >= Q + R) {
ans = Q + P;
}
if (ans >= R + P) {
ans = R + P;
}
cout << ans << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int P;
int Q;
int R;
cin >> P >> Q >> R;
int ans;
ans = P + Q;
if (ans > Q + R) {
ans = Q + R;
}
if (ans > R + P) {
ans = R + P;
}
cout << ans << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 823,719 | 823,720 | u734484183 | cpp |
p03011 | #include <iostream>
using namespace std;
int main() {
int P;
int Q;
int R;
cin >> P >> Q >> R;
int ans;
ans = P + Q;
if (ans >= Q + P) {
ans = Q + P;
}
if (ans >= R + P) {
ans = R + P;
}
cout << ans << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int P;
int Q;
int R;
cin >> P >> Q >> R;
int ans;
ans = P + Q;
if (ans > Q + R) {
ans = Q + R;
}
if (ans > R + P) {
ans = R + P;
}
cout << ans << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"identifier.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 823,721 | 823,720 | u734484183 | 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 if (r >= p || r >= q) {
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 if (r >= p && r >= q) {
cout << p + q << endl;
}
return 0;
} | [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 823,726 | 823,727 | u342121835 | cpp |
p03011 | #include <iostream>
using namespace std;
int main() {
int p, q, r;
cin >> p >> q >> r;
if (p >= q || q >= r) {
cout << q + r << endl;
} else if (q >= p || p >= r) {
cout << p + r << endl;
} else if (r >= p || p >= q) {
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 if (r >= p && r >= q) {
cout << p + q << endl;
}
return 0;
} | [] | 823,728 | 823,727 | u342121835 | cpp |
p03011 |
#include <algorithm>
#include <iostream>
#include <math.h>
using namespace ::std;
int main() {
int A;
int B;
int C;
cin >> A;
cin >> B;
cin >> C;
int sum;
sum = A + B + C;
if (A >= B && A >= C) {
cout << sum - A;
} else if (B >= A && B >= C) {
cout << sum - B;
} else if (C >= B && C >=... |
#include <algorithm>
#include <iostream>
#include <math.h>
using namespace ::std;
int main() {
int A;
int B;
int C;
cin >> A;
cin >> B;
cin >> C;
int sum;
sum = A + B + C;
if (A >= B && A >= C) {
cout << sum - A;
} else if (B >= A && B >= C) {
cout << sum - B;
} else if (C >= B && C >=... | [
"identifier.change",
"io.output.change"
] | 823,733 | 823,734 | u319945100 | cpp |
p03011 | #include <bits/stdc++.h>
using namespace std;
int main() {
int p, q, r, t;
cin >> p >> q >> r;
if (p + q > q + r && p + r > q + r)
t = q + r;
else if (q + r > p + q && p + r > p + q)
t = p + q;
else
t = p + r;
cout << t << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int p, q, r, t;
cin >> p >> q >> r;
if (p + q >= q + r && p + r >= q + r)
t = q + r;
else if (q + r >= p + q && p + r >= p + q)
t = p + q;
else
t = p + r;
cout << t << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 823,743 | 823,744 | u088208280 | cpp |
p03011 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int P, Q, R, t[5];
scanf("%d%d%d", &t[0], &t[1], &t[2]);
sort(t, t + 2);
printf("%d\n", t[0] + t[1]);
return 0;
} | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int P, Q, R, t[5];
scanf("%d%d%d", &t[0], &t[1], &t[2]);
sort(t, t + 3);
printf("%d\n", t[0] + t[1]);
return 0;
} | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 823,745 | 823,746 | u263366485 | cpp |
p03011 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int p, q, r;
cin >> p >> q >> r;
int a;
a = max(p + q, p + r);
a = max(a, q + r);
cout << a << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int p, q, r;
cin >> p >> q >> r;
int a;
a = min(p + q, p + r);
a = min(a, q + r);
cout << a << endl;
} | [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 823,757 | 823,758 | u330689597 | cpp |
p03011 | #include <bits/stdc++.h>
using namespace std;
int x, y, z, sl, fh;
int rd() {
sl = 0;
fh = 1;
char ch = getchar();
while (ch < '0' || '9' < ch) {
if (ch == '-')
fh = -1;
ch = getchar();
}
while ('0' <= ch && ch <= '9')
sl = sl * 10 + ch - '0', ch = getchar();
return sl * fh;
}
int main()... | #include <bits/stdc++.h>
using namespace std;
int x, y, z, sl, fh;
int rd() {
sl = 0;
fh = 1;
char ch = getchar();
while (ch < '0' || '9' < ch) {
if (ch == '-')
fh = -1;
ch = getchar();
}
while ('0' <= ch && ch <= '9')
sl = sl * 10 + ch - '0', ch = getchar();
return sl * fh;
}
int main()... | [
"call.arguments.change",
"call.arguments.add"
] | 823,763 | 823,764 | u938301018 | cpp |
p03011 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
using ll = long long;
using itn = int;
const ll MOD = 1000000007;
int main() {
int x, a, b, c;
cin >> a >> b >> c;
... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
using ll = long long;
using itn = int;
const ll MOD = 1000000007;
int main() {
int x, a, b, c;
cin >> a >> b >> c;
... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 823,782 | 823,783 | u538125576 | cpp |
p03011 | #include <bits/stdc++.h>
using namespace std;
using i64 = int64_t;
#define rep(i, x, y) \
for (i64 i = i64(x), i##_max_for_repmacro = i64(y); \
i < i##_max_for_repmacro; ++i)
#define debug(x) #x << "=" << (x)
#ifdef DEBUG
#de... | #include <bits/stdc++.h>
using namespace std;
using i64 = int64_t;
#define rep(i, x, y) \
for (i64 i = i64(x), i##_max_for_repmacro = i64(y); \
i < i##_max_for_repmacro; ++i)
#define debug(x) #x << "=" << (x)
#ifdef DEBUG
#de... | [
"expression.operator.arithmetic.change",
"io.output.change"
] | 823,792 | 823,793 | u759266806 | cpp |
p03011 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for (int i = 0; i < int(n); i++)
#define FOR(i, m, n) for (int i = int(m); i < int(n); i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define VI vector<int>
#define VLL vector<long long>
#define VVI vector<vector<int>>
#define VVLL... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for (int i = 0; i < int(n); i++)
#define FOR(i, m, n) for (int i = int(m); i < int(n); i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define VI vector<int>
#define VLL vector<long long>
#define VVI vector<vector<int>>
#define VVLL... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 823,794 | 823,795 | u856232850 | cpp |
p03011 | #include <iostream>
#define nagasa 3
using namespace std;
int main() {
int data[nagasa] = {};
int check;
for (int i = 0; i < nagasa; i++) {
cin >> data[i];
}
for (int i = 0; i < nagasa - 1; i++) {
for (int j = nagasa - 1; j > i + 1; j--) {
if (data[j] < data[j - 1]) {
check = data[j];... | #include <iostream>
#define nagasa 3
using namespace std;
int main() {
int data[nagasa] = {};
int check;
for (int i = 0; i < nagasa; i++) {
cin >> data[i];
}
for (int i = 0; i < nagasa - 1; i++) {
for (int j = nagasa - 1; j >= i + 1; j--) {
if (data[j] < data[j - 1]) {
check = data[j]... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 823,796 | 823,797 | u148037244 | cpp |
p03011 | #include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int p, q, r;
cin >> p >> q >> r;
if (r >= p && r >= q)
cout << p + q;
return 0;
if (p >= q && p >= r)
cout << q + r;
return 0;
if (q >= r && q >= p)... | #include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int p, q, r;
cin >> p >> q >> r;
if (r >= p && r >= q) {
cout << p + q;
return 0;
}
if (p >= q && p >= r) {
cout << q + r;
return 0;
}
if (q... | [] | 823,808 | 823,809 | u347588083 | cpp |
p03011 | #include <bits/stdc++.h>
using namespace std;
int main() {
int P, Q, R;
cin >> P >> Q >> R;
int pq, qr, rp;
pq = P + Q;
qr = Q + R;
rp = R + P;
int out;
if (pq >= qr) {
out = pq;
} else {
out = qr;
}
if (out < rp) {
out = rp;
}
cout << out;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int P, Q, R;
cin >> P >> Q >> R;
int pq, qr, rp;
pq = P + Q;
qr = Q + R;
rp = R + P;
int out;
if (pq <= qr) {
out = pq;
} else {
out = qr;
}
if (out > rp) {
out = rp;
}
cout << out;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 823,810 | 823,811 | u431602218 | cpp |
p03011 | #include <iostream>
using namespace std;
int main() {
int n = 3, min = 500, dis = 0;
int p[3];
cin >> p[0] >> p[1] >> p[2];
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++)
dis = p[i] + p[j];
if (dis < min)
min = dis;
}
cout << min;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n = 3, min = 500, dis = 0;
int p[3];
cin >> p[0] >> p[1] >> p[2];
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
dis = p[i] + p[j];
if (dis < min)
min = dis;
}
}
cout << min;
return 0;
} | [] | 823,814 | 823,815 | u649645943 | cpp |
p03011 | #include <bits/stdc++.h>
using namespace std;
// 変数ダンプ先。coutかcerr
#define DUMPOUT cerr
// 提出時はコメントアウト
#define DEBUG_
// #define int long long // intで書いたけど心配なときにlong longに変換する
struct Fast {
Fast() {
std::cin.tie(0);
ios::sync_with_stdio(false);
}
} fast;
/* cpp template {{{ */
/* short */
#define pb pus... | #include <bits/stdc++.h>
using namespace std;
// 変数ダンプ先。coutかcerr
#define DUMPOUT cerr
// 提出時はコメントアウト
#define DEBUG_
// #define int long long // intで書いたけど心配なときにlong longに変換する
struct Fast {
Fast() {
std::cin.tie(0);
ios::sync_with_stdio(false);
}
} fast;
/* cpp template {{{ */
/* short */
#define pb pus... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 823,819 | 823,820 | u545411641 | cpp |
p03011 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << a + b + c + max({a, b, c}) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << a + b + c - max({a, b, c}) << endl;
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 823,821 | 823,822 | u045811375 | cpp |
p03011 | #include <bits/stdc++.h>
using namespace std;
int main() {
int p, q, r;
cin >> p >> q >> r;
int abc, bca, cab, ans;
abc = p + q;
bca = q + r;
cab = r + q;
ans = min({abc, bca, cab});
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int p, q, r;
cin >> p >> q >> r;
int abc, bca, cab, ans;
abc = p + q;
bca = q + r;
cab = r + p;
ans = min({abc, bca, cab});
cout << ans << endl;
return 0;
}
| [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 823,831 | 823,832 | u032068406 | cpp |
p03011 | #include <bits/stdc++.h>
using namespace std;
int main() {
int P, Q, R;
cin >> P >> Q >> R;
if (R > P && R > Q) {
cout << P + Q << endl;
} else if (Q > P && Q > R) {
cout << P + R << endl;
} else {
cout << Q + R << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int P, Q, R;
cin >> P >> Q >> R;
if (R >= P && R >= Q) {
cout << P + Q << endl;
} else if (Q >= P && Q >= R) {
cout << P + R << endl;
} else {
cout << Q + R << endl;
}
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 823,833 | 823,834 | u908819059 | cpp |
p03011 | #include <bits/stdc++.h>
using namespace std;
int main() {
int P, Q, R;
cin >> P >> Q >> R;
if (P + Q < P + R && P + Q < Q + R) {
cout << P + Q << endl;
} else if (P + R < P + Q && P + R < Q + R) {
cout << P + R << endl;
} else {
cout << Q + R << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int P, Q, R;
cin >> P >> Q >> R;
if (P + Q <= P + R && P + Q <= Q + R) {
cout << P + Q << endl;
} else if (P + R <= P + Q && P + R <= Q + R) {
cout << P + R << endl;
} else {
cout << Q + R << endl;
}
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 823,835 | 823,836 | u857619742 | cpp |
p03011 | #include <bits/stdc++.h>
using namespace std;
int main() {
int P, Q, R, i = 0, a[2];
cin >> P >> Q >> R;
a[0] = P + Q;
a[1] = Q + R;
a[2] = R + P;
int min = a[0];
for (i = 1; i < 2; i++) {
if (a[i] <= min) {
min = a[i];
}
}
cout << min << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int P, Q, R, i, a[3];
cin >> P >> Q >> R;
a[0] = P + Q;
a[1] = Q + R;
a[2] = R + P;
int min = a[0];
for (i = 1; i < 3; i++) {
if (a[i] <= min) {
min = a[i];
}
}
cout << min << endl;
}
| [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 823,839 | 823,838 | u992695783 | cpp |
p03011 | #include <bits/stdc++.h>
using namespace std;
int a, b, c;
int main() {
cin >> a >> b >> c;
int minv = 999999999;
if (a + b < minv)
minv = a + b;
if (a + c < minv)
minv = a + c;
if (c + b < minv)
minv = c + b;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int a, b, c;
int main() {
cin >> a >> b >> c;
int minv = 999999999;
if (a + b < minv)
minv = a + b;
if (a + c < minv)
minv = a + c;
if (c + b < minv)
minv = c + b;
cout << minv;
return 0;
}
| [] | 823,846 | 823,847 | u031920644 | cpp |
p03011 | #include <iostream>
#include <stdio.h>
using namespace std;
int main() {
// 整数の入力
int a, b, c;
scanf("%d %d %d", &a, &b, &c);
int ab = a + b;
int ac = a + c;
int bc = b + c;
// 出力
if (ab < bc && ac < bc)
cout << bc << endl;
else if (ab < ac)
cout << ac << endl;
else
cout << ab << endl;
... | #include <iostream>
#include <stdio.h>
using namespace std;
int main() {
// 整数の入力
int a, b, c;
scanf("%d %d %d", &a, &b, &c);
int ab = a + b;
int ac = a + c;
int bc = b + c;
// 出力
if (ab > bc && ac > bc)
cout << bc << endl;
else if (ab > ac)
cout << ac << endl;
else
cout << ab << endl;
... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 823,852 | 823,853 | u954968536 | cpp |
p03011 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
int d, e, f;
d = A + B;
e = B + C;
f = B + C;
int ans = min({d, e, f});
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
int d, e, f;
d = A + B;
e = A + C;
f = B + C;
int ans = min({d, e, f});
cout << ans << endl;
}
| [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 823,858 | 823,859 | u319589470 | cpp |
p03011 | #include <iostream>
using namespace std;
int main(void) {
int P, Q, R;
cin >> P >> Q >> R;
if (R + P >= P + Q) {
if (P + Q >= Q + R) {
cout << P + R << endl;
} else {
cout << P + Q << endl;
}
} else {
if (R + P >= Q + R) {
cout << Q + R << endl;
} else {
cout << R + ... | #include <iostream>
using namespace std;
int main(void) {
int P, Q, R;
cin >> P >> Q >> R;
if (R + P >= P + Q) {
if (P + Q >= Q + R) {
cout << Q + R << endl;
} else {
cout << P + Q << endl;
}
} else {
if (R + P >= Q + R) {
cout << Q + R << endl;
} else {
cout << R + ... | [
"identifier.change",
"io.output.change"
] | 823,865 | 823,866 | u093941965 | cpp |
p03011 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll i, p, q, r;
cin >> p >> q >> r;
ll m = max(p, max(p, r));
if (m == p)
i = q + r;
else if (m == q)
i = p + r;
else
i = ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll i, p, q, r;
cin >> p >> q >> r;
ll m = max(p, max(q, r));
if (m == p)
i = q + r;
else if (m == q)
i = p + r;
else
i =... | [
"identifier.change",
"call.arguments.change"
] | 823,867 | 823,868 | u978519204 | cpp |
p03011 | #include <algorithm>
#include <functional>
#include <iostream>
using namespace std;
int main() {
int P, Q, R;
cin >> P >> Q >> R;
int PQ = P + Q;
int QR = Q + R;
int PR = P + R;
int a = min(min(PQ, QR), QR);
cout << a << endl;
return 0;
}
| #include <algorithm>
#include <functional>
#include <iostream>
using namespace std;
int main() {
int P, Q, R;
cin >> P >> Q >> R;
int PQ = P + Q;
int QR = Q + R;
int PR = P + R;
int a = min(min(PQ, QR), PR);
cout << a << endl;
return 0;
}
| [
"identifier.change",
"call.arguments.change"
] | 823,873 | 823,874 | u652609504 | cpp |
p03011 | #include <iostream>
#include <string>
using namespace std;
int main() {
int p, q, r;
cin >> p >> q >> r;
if (r >= q && r >= p) {
cout << q + p;
return 0;
}
if (q >= r && q >= p) {
cout << r + p;
return 0;
}
if (p >= q && p >= r) {
cout << q + p;
return 0;
}
} | #include <iostream>
#include <string>
using namespace std;
int main() {
int p, q, r;
cin >> p >> q >> r;
if (r >= q && r >= p) {
cout << q + p;
return 0;
}
if (q >= r && q >= p) {
cout << r + p;
return 0;
}
if (p >= q && p >= r) {
cout << q + r;
return 0;
}
} | [
"identifier.change",
"io.output.change"
] | 823,881 | 823,882 | u365178348 | cpp |
p03011 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int p, q, r;
cin >> p >> q >> r;
int hai[] = {p + q, p + r, q + r};
int i;
int min;
int max;
int ans;
/* 代入 */
min = hai[0];
max = hai[0];
ans = 0;
/* 計算 */
for (i = 0; i <= 4; i++) { /* 最大値求める */
if (hai[i] > max)
... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int p, q, r;
cin >> p >> q >> r;
int hai[] = {p + q, p + r, q + r};
int i;
int min;
int max;
int ans;
/* 代入 */
min = hai[0];
max = hai[0];
ans = 0;
/* 計算 */
for (i = 0; i <= 2; i++) { /* 最大値求める */
if (hai[i] > max)
... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 823,887 | 823,888 | u299137831 | cpp |
p03011 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int P, Q, R;
cin >> P >> Q >> R;
cout << min({P + Q, Q + R, Q + R}) << endl;
return 0;
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int P, Q, R;
cin >> P >> Q >> R;
cout << min({P + Q, Q + R, P + R}) << endl;
return 0;
} | [
"identifier.change",
"io.output.change"
] | 823,891 | 823,892 | u709583164 | cpp |
p03011 | #include <bits/stdc++.h>
using namespace std;
long long a[3];
int main() {
for (long long i = 0; i < 3; i++)
cin >> a[i];
sort(a, a + 2);
cout << a[0] + a[1];
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int a[3];
int main() {
for (int i = 0; i < 3; i++)
cin >> a[i];
sort(a, a + 3);
cout << a[0] + a[1];
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.narrow.change",
"control_flow.loop.for.initializer.change",
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 823,893 | 823,894 | u505870180 | cpp |
p03011 | #include <bits/stdc++.h>
using namespace std;
int a[3];
int main() {
for (int i = 0; i < 3; i++)
cin >> a[i];
sort(a, a + 2);
cout << a[0] + a[1];
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int a[3];
int main() {
for (int i = 0; i < 3; i++)
cin >> a[i];
sort(a, a + 3);
cout << a[0] + a[1];
return 0;
} | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 823,895 | 823,894 | u505870180 | cpp |
p03011 | #include <bits/stdc++.h>
using namespace std;
int a[3];
int main() {
for (int i = 0; i < 2; i++)
cin >> a[i];
sort(a, a + 2);
cout << a[0] + a[1];
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int a[3];
int main() {
for (int i = 0; i < 3; i++)
cin >> a[i];
sort(a, a + 3);
cout << a[0] + a[1];
return 0;
} | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"call.arguments.change"
] | 823,896 | 823,894 | u505870180 | cpp |
p03011 | #include <bits/stdc++.h>
using namespace std;
int main() {
int P, Q, R, A, B, C, a, b;
cin >> P >> Q >> R;
A = P + Q;
B = Q + R;
C = R + Q;
a = min(A, B);
b = min(a, C);
cout << b << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int P, Q, R, A, B, C, a, b;
cin >> P >> Q >> R;
A = P + Q;
B = Q + R;
C = R + P;
a = min(A, B);
b = min(a, C);
cout << b << endl;
}
| [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 823,897 | 823,898 | u189449016 | cpp |
p03011 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, init, n) for (lli i = init; i < n; i++)
#define REPE(i, init, n) for (lli i = init; i <= n; i++)
#define REPIT(it, container) \
for (auto it = container.begin(); it != container.end(); it++)
#define REPIT_R... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, init, n) for (lli i = init; i < n; i++)
#define REPE(i, init, n) for (lli i = init; i <= n; i++)
#define REPIT(it, container) \
for (auto it = container.begin(); it != container.end(); it++)
#define REPIT_R... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 823,905 | 823,906 | u058297300 | cpp |
p03011 | #include <bits/stdc++.h>
using namespace std;
int main() {
int P, Q, R;
cin >> P >> Q >> R;
int minn = min(P, min(Q, R));
cout << (P + Q + R - minn) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int P, Q, R;
cin >> P >> Q >> R;
int maxx = max(P, max(Q, R));
cout << (P + Q + R - maxx) << endl;
return 0;
} | [
"variable_declaration.name.change",
"identifier.change",
"misc.opposites",
"call.function.change",
"call.arguments.change",
"io.output.change"
] | 823,914 | 823,915 | u506320030 | cpp |
p03012 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> w(n);
for (int i = 1; i < n; i++)
cin >> w[i];
int ans = 1e9;
for (int i = 0; i < n; i++) {
int l = 0, r = 0;
for (int j = 0; j < i; j++) {
l += w[j];
}
for (int j = i; j < n; j++) {
r +=... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> w(n);
for (int i = 0; i < n; i++)
cin >> w[i];
int ans = 1e9;
for (int i = 1; i < n; i++) {
int l = 0, r = 0;
for (int j = 0; j < i; j++) {
l += w[j];
}
for (int j = i; j < n; j++) {
r +=... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 823,918 | 823,919 | u023127434 | cpp |
p03012 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> w(n);
for (int i = 1; i < n; i++)
cin >> w[i];
int ans = 1e9;
for (int i = 0; i < n; i++) {
int l = 0, r = 0;
for (int j = 0; j < i; j++) {
l += w[j];
}
for (int j = i; j < n; j++) {
r +=... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> w(n);
for (int i = 0; i < n; i++)
cin >> w[i];
int ans = 1e9;
for (int i = 1; i < n; i++) {
int l = 0, r = 0;
for (int j = 0; j < i; j++) {
l += w[j];
}
for (int j = i; j < n; j++) {
r +=... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 823,920 | 823,919 | u023127434 | cpp |
p03012 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> w(n);
for (int i = 0; i < n; i++)
cin >> w[i];
int ans = 1e9;
for (int i = 0; i < n; i++) {
int l = 0, r = 0;
for (int j = 0; j < i; j++) {
l += w[j];
}
for (int j = i; j < n; j++) {
r +=... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> w(n);
for (int i = 0; i < n; i++)
cin >> w[i];
int ans = 1e9;
for (int i = 1; i < n; i++) {
int l = 0, r = 0;
for (int j = 0; j < i; j++) {
l += w[j];
}
for (int j = i; j < n; j++) {
r +=... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 823,921 | 823,919 | u023127434 | cpp |
p03012 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <utility>
#include <vector>
const double PI = acos(-1);
#define rep(i, n) for (int i = 0; i < (n); i++)
usi... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <utility>
#include <vector>
const double PI = acos(-1);
#define rep(i, n) for (int i = 0; i < (n); i++)
usi... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 823,923 | 823,924 | u272628953 | cpp |
p03012 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> W(N);
for (int i = 1; i <= N; i++) {
cin >> W.at(i);
}
int ans = 1e9;
for (int i = 1; i < N; i++) {
int l = 0, r = 0;
for (int j = 0; j < i; j++) {
l += W.at(j);
}
for (int j = i; j < N; j++) ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> W(N);
for (int i = 0; i < N; i++) {
cin >> W.at(i);
}
int ans = 1e9;
for (int i = 1; i < N; i++) {
int l = 0, k = 0;
for (int j = 0; j < i; j++) {
l += W.at(j);
}
for (int j = i; j < N; j++) {... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"variable_declaration.name.change",
"identifier.cha... | 823,925 | 823,926 | u856957535 | cpp |
p03012 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> W(N);
for (int i = 1; i <= N; i++) {
cin >> W.at(i);
}
int ans = 1e9;
for (int i = 1; i < N; i++) {
int l = 0, r = 0;
for (int j = 0; j < i; j++) {
l += W.at(j);
}
for (int j = i; j < N; j++) ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> W(N);
for (int i = 0; i < N; i++) {
cin >> W.at(i);
}
int ans = 1e9;
for (int i = 1; i < N; i++) {
int l = 0, r = 0;
for (int j = 0; j < i; j++) {
l += W.at(j);
}
for (int j = i; j < N; j++) {... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 823,925 | 823,927 | u856957535 | cpp |
p03012 | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pp pair<int, int>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define ld long double
#define al(a) (a).begin(), (a).end()
#define mk make_pair
#define check cout << "?" << endl;
ll MOD = 1000000007;
ll mod = 9... | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pp pair<int, int>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define ld long double
#define al(a) (a).begin(), (a).end()
#define mk make_pair
#define check cout << "?" << endl;
ll MOD = 1000000007;
ll mod = 9... | [] | 823,928 | 823,929 | u096616343 | cpp |
p03012 | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
int N;
cin >> N;
vector<int> W(N);
for (int i = 0; i < N; i++) {
cin >> W[i];
}
int ans = INT_MAX;
for (int i = 0; i < N; i++) {
// S1とS2の合計値の宣言
int s1_Sum = 0... | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
int N;
cin >> N;
vector<int> W(N);
for (int i = 0; i < N; i++) {
cin >> W[i];
}
int ans = INT_MAX;
for (int i = 0; i < N; i++) {
// S1とS2の合計値の宣言
int s1_Sum = 0... | [
"control_flow.loop.for.initializer.change"
] | 823,941 | 823,942 | u963353562 | cpp |
p03012 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_set>
#include <... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_set>
#include <... | [
"literal.number.change",
"variable_declaration.value.change"
] | 823,943 | 823,944 | u038537254 | cpp |
p03012 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define fast \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define fast \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.... | [
"identifier.change",
"io.output.change"
] | 823,947 | 823,948 | u603991349 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.