problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k | fixed_code stringlengths 12 526k | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M | fixed_submission_id int64 2 1.54M | user_id stringlengths 10 10 | language stringclasses 8
values |
|---|---|---|---|---|---|---|---|
p03250 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, a, b) for (i = a; i < b; i++)
#define rep(i, n) REP(i, 0, n)
int main() {
int a[3];
cin >> a[0] >> a[1] >> a[2];
sort(a, a + 3);
cout << 10 * a[0] + a[1] + a[2] << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i, a, b) for (i = a; i < b; i++)
#define rep(i, n) REP(i, 0, n)
int main() {
int a[3];
cin >> a[0] >> a[1] >> a[2];
sort(a, a + 3);
cout << a[0] + a[1] + a[2] * 10 << endl;
} | [
"expression.operation.binary.remove"
] | 1,037,399 | 1,037,400 | u854612287 | cpp |
p03250 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef vector<LL> VLL;
typedef vector<ULL> VULL;
class MYCP {
public:
//数値を区切って文字列にする
static string MakeString_LongLong(vec... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef vector<LL> VLL;
typedef vector<ULL> VULL;
class MYCP {
public:
//数値を区切って文字列にする
static string MakeString_LongLong(vec... | [
"literal.number.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 1,037,403 | 1,037,404 | u196798307 | cpp |
p03250 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
const ... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
const ... | [
"literal.number.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"io.output.change"
] | 1,037,411 | 1,037,412 | u089869622 | cpp |
p03250 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
const ... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
const ... | [
"literal.number.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 1,037,413 | 1,037,412 | u089869622 | cpp |
p03250 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstring>
#include <iostream>
#include <math.h>
#include <numeric>
#include <regex>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pl4 = pair<ll, ll>;
using vi = vector<int>;
using... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstring>
#include <iostream>
#include <math.h>
#include <numeric>
#include <regex>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pl4 = pair<ll, ll>;
using vi = vector<int>;
using... | [
"literal.number.change",
"io.output.change"
] | 1,037,418 | 1,037,419 | u172929647 | cpp |
p03250 | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define maxs(x, y) (x = ma... | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define maxs(x, y) (x = ma... | [
"identifier.change",
"call.arguments.change"
] | 1,037,430 | 1,037,431 | u791593901 | cpp |
p03250 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A < C && B < C)
cout << C * 10 + A + B;
if (A < B && C < B)
cout << B * 10 + A + C;
if (B < A && C < A)
cout << A * 10 + B + C;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A <= C && B <= C)
cout << C * 10 + A + B;
if (A <= B && C < B)
cout << B * 10 + A + C;
if (B < A && C < A)
cout << A * 10 + B + C;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,037,434 | 1,037,435 | u523026610 | cpp |
p03250 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int m = min(a, b);
int n = min(m, c);
cout << a + b + c - n << endl;
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int m = max(a, b);
int n = max(m, c);
cout << a + b + c + 9 * n << endl;
} | [
"misc.opposites",
"identifier.change",
"call.function.change",
"expression.operator.arithmetic.change",
"io.output.change"
] | 1,037,438 | 1,037,439 | u681557252 | cpp |
p03250 | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int main(void) {
int n;
int a[3];
cin >> a[0] >> a[1] >> a[2];
sort(a, a + 3);
cout << a[0] * 10 + a[1] + a[2];
} | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int main(void) {
int n;
int a[3];
cin >> a[0] >> a[1] >> a[2];
sort(a, a + 3);
cout << a[2] * 10 + a[1] + a[0];
} | [
"literal.number.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 1,037,449 | 1,037,450 | u732465302 | cpp |
p03250 | #include <bits/stdc++.h>
using namespace std;
// g++ Main.cpp -std=gnu++1y -O2 -I/opt/boost/gcc/include -o main && ./main
using ll = long long;
using vi = vector<int>;
using vl = vector<ll>;
using vll = vector<vl>;
using vii = vector<vi>;
using pii = pair<int, int>;
using vc = vector<char>;
using vcc = vector<vc>;
us... | #include <bits/stdc++.h>
using namespace std;
// g++ Main.cpp -std=gnu++1y -O2 -I/opt/boost/gcc/include -o main && ./main
using ll = long long;
using vi = vector<int>;
using vl = vector<ll>;
using vll = vector<vl>;
using vii = vector<vi>;
using pii = pair<int, int>;
using vc = vector<char>;
using vcc = vector<vc>;
us... | [
"call.add",
"call.arguments.add"
] | 1,037,457 | 1,037,458 | u394853232 | cpp |
p03250 | #include <iostream>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A > B && A > C) {
cout << 10 * A + B + C << endl;
} else if (B > A && B > C) {
cout << 10 * B + A + C << endl;
} else {
cout << 10 * C + 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 << 10 * A + B + C << endl;
} else if (B >= A && B >= C) {
cout << 10 * B + A + C << endl;
} else {
cout << 10 * C + A + B << endl;
}
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,037,461 | 1,037,462 | u770662489 | cpp |
p03250 | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a > b && a > c) {
cout << a * 10 + b + c << endl;
} else if (b > a && b > c) {
cout << a + b * 10 + c << endl;
} else {
cout << a + b + c * 10 << endl;
}
} | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a >= b && a >= c) {
cout << a * 10 + b + c << endl;
} else if (b >= a && b >= c) {
cout << a + b * 10 + c << endl;
} else {
cout << a + b + c * 10 << endl;
}
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,037,478 | 1,037,479 | u382826454 | cpp |
p03250 | #include <stdio.h>
int main() {
int a, b, c;
int ans;
scanf("%d %d %d", &a, &b, &c);
if (a > b && a > c)
ans = a * 10 + b + c;
else if (b > c && b > a)
ans = b * 10 + a + c;
else
ans = c * 10 + b + a;
printf("%d\n", ans);
return 0;
}
| #include <stdio.h>
int main() {
int a, b, c;
int ans;
scanf("%d %d %d", &a, &b, &c);
if (a >= b && a >= c)
ans = a * 10 + b + c;
else if (b >= c && b >= a)
ans = b * 10 + a + c;
else
ans = c * 10 + b + a;
printf("%d\n", ans);
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,037,488 | 1,037,489 | u056863173 | cpp |
p03250 | #include <iostream>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int kotae = 0;
int max = a;
char ma = 'a';
if (max < b)
max = b;
ma = 'b';
if (max < c)
max = c;
ma = 'c';
if (ma == 'a') {
kotae = 10 * a + ... | #include <iostream>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int kotae = 0;
int max = a;
char ma = 'a';
if (max < b) {
max = b;
ma = 'b';
}
if (max < c) {
max = c;
ma = 'c';
}
if (ma == 'a') {
k... | [] | 1,037,490 | 1,037,491 | u791073783 | cpp |
p03250 | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> v;
for (int i = 0; i < 3; i++) {
cin >> v[i];
}
sort(v.begin(), v.end(), greater<int>());
cout << v[0] * 10 + v[1] + v[2] << endl;
return 0;
}
| #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(), greater<int>());
cout << v[0] * 10 + v[1] + v[2] << endl;
return 0;
}
| [
"call.arguments.add"
] | 1,037,492 | 1,037,493 | u319491032 | cpp |
p03250 | #include <iostream>
using namespace std;
int main() {
int A;
cin >> A;
int B;
cin >> B;
int C;
cin >> C;
if (A > B) {
swap(A, B);
}
if (B > C) {
swap(B, C);
}
cout << (C + 10 + A + B) << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int A;
cin >> A;
int B;
cin >> B;
int C;
cin >> C;
if (A > B) {
swap(A, B);
}
if (B > C) {
swap(B, C);
}
cout << (C * 10 + A + B) << endl;
return 0;
}
| [
"expression.operator.arithmetic.change",
"io.output.change"
] | 1,037,494 | 1,037,495 | u552502395 | cpp |
p03250 | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << a + b + c + max(max(a, b), c) << endl;
}
| #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << a + b + c + 9 * max(max(a, b), c) << endl;
}
| [
"expression.operation.binary.add"
] | 1,037,498 | 1,037,499 | u546943614 | cpp |
p03250 | /*
* @Author: Nguyen Quoc Cuong
* @Mail : 97quoccuong@gmail.com
* @Created at: 2018-10-24 14:39:59
* @Last Modified time: 2018-10-24 14:43:16
*/
#include <bits/stdc++.h>
#define mp make_pair
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegi... | /*
* @Author: Nguyen Quoc Cuong
* @Mail : 97quoccuong@gmail.com
* @Created at: 2018-10-24 14:39:59
* @Last Modified time: 2018-10-24 14:43:57
*/
#include <bits/stdc++.h>
#define mp make_pair
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegi... | [
"literal.number.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 1,037,504 | 1,037,505 | u551605828 | cpp |
p03250 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
#define _USE_MATH_DEFINENS
#include <cmath>
#define ip "%d"
#define op "%d\n"
using namespace std;
#define p(x) cout << x << endl;
#define el cout << endl;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() ... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
#define _USE_MATH_DEFINENS
#include <cmath>
#define ip "%d"
#define op "%d\n"
using namespace std;
#define p(x) cout << x << endl;
#define el cout << endl;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() ... | [
"identifier.change",
"io.output.change"
] | 1,037,506 | 1,037,507 | u492288342 | cpp |
p03250 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a[3];
for (int i = 0; i < 3; i++)
cin >> a[i];
int max = 0;
sort(a, a + 3);
max = a[2] * 100 + a[1] * 10 + a[0];
cout << max;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a[3];
for (int i = 0; i < 3; i++)
cin >> a[i];
int max = 0;
sort(a, a + 3);
max = a[2] * 10 + a[1] * 1 + a[0];
cout << max;
return 0;
} | [
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 1,037,512 | 1,037,513 | u738993574 | cpp |
p03250 | #include <stdio.h>
int main(void) {
int a, b, c, s;
scanf("%d %d %d", &a, &b, &c);
if ((a > b) && (a > c))
s = a * 10 + b + c;
else if ((b > a) && (b > c))
s = b * 10 + a + c;
else
s = c * 10 + a + b;
printf("%d\n", s);
return 0;
}
| #include <stdio.h>
int main(void) {
int a, b, c, s;
scanf("%d %d %d", &a, &b, &c);
if ((a >= b) && (a >= c))
s = a * 10 + b + c;
else if ((b >= a) && (b >= c))
s = b * 10 + a + c;
else
s = c * 10 + a + b;
printf("%d\n", s);
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,037,526 | 1,037,527 | u971750238 | cpp |
p03250 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a[3];
for (int i = 0; i < 3; i++)
cin >> a[i];
sort(a, a + 3);
cout << a[0] * 10 + a[1] + a[2];
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a[3];
for (int i = 0; i < 3; i++)
cin >> a[i];
sort(a, a + 3);
cout << a[2] * 10 + a[1] + a[0];
return 0;
} | [
"literal.number.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 1,037,535 | 1,037,536 | u258691775 | cpp |
p03250 | #include "bits/stdc++.h"
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << max({A < B < C}) * 9 + A + B + C << endl;
}
| #include "bits/stdc++.h"
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << max({A, B, C}) * 9 + A + B + C << endl;
}
| [
"io.output.change"
] | 1,037,537 | 1,037,538 | u892438699 | cpp |
p03250 | #include <bits/stdc++.h>
using namespace std;
#define MD 1000000007
typedef long long int ll;
int main() {
vector<int> v(3);
cin >> v[0] >> v[1] >> v[2];
sort(v.begin(), v.end());
int ans = 10 * v[0] + v[1] + v[2];
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define MD 1000000007
typedef long long int ll;
int main() {
vector<int> v(3);
cin >> v[0] >> v[1] >> v[2];
sort(v.begin(), v.end());
int ans = 10 * v[2] + v[1] + v[0];
cout << ans << endl;
return 0;
} | [
"literal.number.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 1,037,553 | 1,037,554 | u287060310 | cpp |
p03250 | #include "bits/stdc++.h"
#define rep(i, a, n) for (int i = (a); i < (n); i++)
typedef unsigned long long ull;
typedef long long ll;
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int memo = 0;
memo = a + b + c;
memo = max(a, max(b, c)) * 9;
cout << memo << endl;
return 0;
} | #include "bits/stdc++.h"
#define rep(i, a, n) for (int i = (a); i < (n); i++)
typedef unsigned long long ull;
typedef long long ll;
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int memo = 0;
memo = a + b + c;
memo += max(a, max(b, c)) * 9;
cout << memo << endl;
return 0;
} | [
"assignment.value.change"
] | 1,037,572 | 1,037,573 | u129134470 | cpp |
p03250 | #include "bits/stdc++.h"
#define rep(i, a, n) for (int i = (a); i < (n); i++)
typedef unsigned long long ull;
typedef long long ll;
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int memo = 0;
memo = a + b + c;
memo = max(a, max(b, c));
cout << memo << endl;
return 0;
} | #include "bits/stdc++.h"
#define rep(i, a, n) for (int i = (a); i < (n); i++)
typedef unsigned long long ull;
typedef long long ll;
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int memo = 0;
memo = a + b + c;
memo += max(a, max(b, c)) * 9;
cout << memo << endl;
return 0;
} | [
"assignment.value.change",
"assignment.change"
] | 1,037,574 | 1,037,573 | u129134470 | cpp |
p03250 | #include <algorithm>
#include <stdio.h>
int main() {
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
int N[4] = {0}, M;
scanf("%d %d %d", &N[0], &N[1], &N[2]);
std::sort(N, N + 3);
printf("%d", N[0] * 10 + N[1] + N[2]);
} | #include <algorithm>
#include <stdio.h>
int main() {
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
int N[4] = {0}, M;
scanf("%d %d %d", &N[0], &N[1], &N[2]);
std::sort(N, N + 3);
printf("%d", N[2] * 10 + N[1] + N[0]);
} | [
"literal.number.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 1,037,577 | 1,037,578 | u985941003 | cpp |
p03250 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define INF 10e17 // 4倍しても(4回足しても)long longを溢れない
#define rep(i, n) ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define INF 10e17 // 4倍しても(4回足しても)long longを溢れない
#define rep(i, n) ... | [
"identifier.change",
"call.function.change"
] | 1,037,587 | 1,037,588 | u898749314 | cpp |
p03250 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vi;
#define ALL(a) (a).begin(), (a).end()
signed main() {
vi a;
a.resize(3);
cin >> a[0] >> a[1] >> a[2];
sort(ALL(a));
cout << 10 * a[2] * a[1] + a[0] << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vi;
#define ALL(a) (a).begin(), (a).end()
signed main() {
vi a;
a.resize(3);
cin >> a[0] >> a[1] >> a[2];
sort(ALL(a));
cout << 10 * a[2] + a[1] + a[0] << endl;
} | [
"expression.operator.arithmetic.change",
"io.output.change"
] | 1,037,593 | 1,037,594 | u913836622 | cpp |
p03250 | #include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A * 10 + B + C >= A + 10 * B + C && A * 10 + B + C >= A + B + 10 * C) {
cout << A * 10 + B + C << endl;
} else if (A * 10 + B + C <= A + 10 * B + C &&
... | #include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A * 10 + B + C >= A + 10 * B + C && A * 10 + B + C >= A + B + 10 * C) {
cout << A * 10 + B + C << endl;
} else if (A * 10 + B + C <= A + 10 * B + C &&
... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,037,595 | 1,037,596 | u899108527 | cpp |
p03250 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
vector<int> a;
for (int i = 0; i < 3; i++) {
cin >> a[i];
}
sort(a.begin(), a.end());
int ans;
ans = a[0] + a[1] + a[2] * 10;
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
vector<int> a(3);
for (int i = 0; i < 3; i++) {
cin >> a[i];
}
sort(a.begin(), a.end());
int ans;
ans = a[0] + a[1] + a[2] * 10;
cout << ans << endl;
return 0;
} | [
"call.arguments.add"
] | 1,037,597 | 1,037,598 | u222293734 | cpp |
p03250 | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> A;
cin >> A[0] >> A[1] >> A[2];
sort(A.begin(), A.end());
cout << A[0] + A[1] + A[2] * 10 << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> A(3);
cin >> A[0] >> A[1] >> A[2];
sort(A.begin(), A.end());
cout << A[0] + A[1] + A[2] * 10 << endl;
return 0;
} | [
"call.arguments.add"
] | 1,037,601 | 1,037,602 | u471342385 | cpp |
p03250 | #include <bits/stdc++.h>
#include <numeric>
#include <vector>
#define PI 3.14159265358979323846
#define MAXINF 1e18L
#define INF 1e9L
#define EPS 1e-9
#define REP(i, n) for (int i = 0; i < int(n); ++i)
#define RREP(i, n) for (int i = int(n) - 1; i >= 0; --i)
#define ALL(v) v.begin(), v.end()
#define SORT(v) sort(ALL(v)... | #include <bits/stdc++.h>
#include <numeric>
#include <vector>
#define PI 3.14159265358979323846
#define MAXINF 1e18L
#define INF 1e9L
#define EPS 1e-9
#define REP(i, n) for (int i = 0; i < int(n); ++i)
#define RREP(i, n) for (int i = int(n) - 1; i >= 0; --i)
#define ALL(v) v.begin(), v.end()
#define SORT(v) sort(ALL(v)... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,037,606 | 1,037,607 | u528720841 | cpp |
p03250 | #include <bits/stdc++.h>
using namespace std;
using llong = long long;
using P = pair<llong, llong>;
#define BE(x) x.begin(), x.end()
const llong inf = llong(1e18) + 7;
const llong mod = 1e9 + 7;
int main() {
vector<int> v(3);
cin >> v[0] >> v[1] >> v[2];
sort(BE(v));
cout << v[0] * 10 + v[1] + v[2] << en... | #include <bits/stdc++.h>
using namespace std;
using llong = long long;
using P = pair<llong, llong>;
#define BE(x) x.begin(), x.end()
const llong inf = llong(1e18) + 7;
const llong mod = 1e9 + 7;
int main() {
vector<int> v(3);
cin >> v[0] >> v[1] >> v[2];
sort(BE(v));
cout << v[2] * 10 + v[1] + v[0] << en... | [
"literal.number.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 1,037,623 | 1,037,624 | u341957179 | cpp |
p03250 | #include <algorithm>
#include <iostream>
#include <vector>
int main() {
std::vector<int> vec(3);
std::cin >> vec.at(0) >> vec.at(1) >> vec.at(2);
std::sort(vec.begin(), vec.end());
std::cout << vec.at(3) * 10 + vec.at(0) + vec.at(1) << std::endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <vector>
int main() {
std::vector<int> vec(3);
std::cin >> vec.at(0) >> vec.at(1) >> vec.at(2);
std::sort(vec.begin(), vec.end());
std::cout << vec.at(2) * 10 + vec.at(0) + vec.at(1) << std::endl;
return 0;
} | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,037,625 | 1,037,626 | u913226400 | cpp |
p03250 | #include <iostream>
int main() {
int A, B, C;
std::cin >> A >> B >> C;
if (A >= B && B >= C) {
std::cout << A * 10 + B + C << std::endl;
} else if (B >= C && B >= A) {
std::cout << B * 10 + A + C << std::endl;
} else {
std::cout << A + B + C * 10 << std::endl;
}
return 0;
} | #include <iostream>
int main() {
int A, B, C;
std::cin >> A >> B >> C;
if (A >= B && A >= C) {
std::cout << A * 10 + B + C << std::endl;
} else if (B >= C && B >= A) {
std::cout << B * 10 + A + C << std::endl;
} else {
std::cout << A + B + C * 10 << std::endl;
}
return 0;
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 1,037,633 | 1,037,634 | u024764559 | cpp |
p03250 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int a[5], ans = 0;
for (int i = 0; i < 3; i++) {
cin >> a[i];
}
sort(a, a + 3);
ans = a[0] * 10 + a[1] + a[2];
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int a[5], ans = 0;
for (int i = 0; i < 3; i++) {
cin >> a[i];
}
sort(a, a + 3);
ans = a[2] * 10 + a[1] + a[0];
cout << ans << endl;
return 0;
}
| [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 1,037,641 | 1,037,642 | u587326496 | cpp |
p03250 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e, f;
cin >> a >> b >> c;
d = a * 10 + b + c;
e = b * 10 + a + c;
e = c * 10 + a + b;
cout << max({d, e, f});
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e, f;
cin >> a >> b >> c;
d = a * 10 + b + c;
e = b * 10 + a + c;
f = c * 10 + a + b;
cout << max({d, e, f});
} | [
"assignment.variable.change",
"identifier.change"
] | 1,037,643 | 1,037,644 | u959539771 | cpp |
p03250 | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> vec(3);
for (int i = 0; i < 3; i++) {
cin >> vec.at(0);
}
sort(vec.begin(), vec.end());
cout << 10 * vec.at(2) + vec.at(0) + vec.at(1);
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> vec(3);
for (int i = 0; i < 3; i++) {
cin >> vec.at(i);
}
sort(vec.begin(), vec.end());
cout << 10 * vec.at(2) + vec.at(0) + vec.at(1);
}
| [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,037,645 | 1,037,646 | u319783732 | cpp |
p03250 | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> N(3);
for (int i = 0; i < 3; i++)
cin >> N.at(i);
sort(N.begin(), N.end());
int ans = N.at(0) + N.at(2) + N.at(3) * 10;
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> N(3);
for (int i = 0; i < 3; i++)
cin >> N.at(i);
sort(N.begin(), N.end());
int ans = N.at(0) + N.at(1) + N.at(2) * 10;
cout << ans << endl;
}
| [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,037,651 | 1,037,652 | u916256067 | cpp |
p03250 | // warm heart, wagging tail,and a smile just for you!
// ▓▓▓▓▓▓▓▓▓▓▓▓
// ▓▓▓▓▓▓▓▓╬╬╬╬╬╬╬╬╬╬╬╬▓▓▓▓▓▓▓▓▓▓▓▓▓▓
// ▓▓▓▓╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬▓▓▓▓▓▓
// ▓▓▓▓╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬▓▓▓▓
// ... | // warm heart, wagging tail,and a smile just for you!
// ▓▓▓▓▓▓▓▓▓▓▓▓
// ▓▓▓▓▓▓▓▓╬╬╬╬╬╬╬╬╬╬╬╬▓▓▓▓▓▓▓▓▓▓▓▓▓▓
// ▓▓▓▓╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬▓▓▓▓▓▓
// ▓▓▓▓╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬▓▓▓▓
// ... | [
"literal.number.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 1,037,668 | 1,037,669 | u239493918 | cpp |
p03250 | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int ans1, ans2, ans3, x, y, z;
x = c * 10 + b + a;
y = a * 10 + c + b;
z = c * 10 + a + c;
ans1 = max(x, y);
ans2 = max(y, z);
ans3 = max(ans1, ans2);
cout << ans3 << endl;
} | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int ans1, ans2, ans3, x, y, z;
x = c * 10 + b + a;
y = a * 10 + c + b;
z = b * 10 + a + c;
ans1 = max(x, y);
ans2 = max(y, z);
ans3 = max(ans1, ans2);
cout << ans3 << endl;
} | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 1,037,674 | 1,037,675 | u483737025 | cpp |
p03250 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
int calc(int a, int b, int c) { return a * 10 + b + c; }
int main(int argc, char const *argv[]) {
int a, b, c;
std::cin >> a >> b >> c;
std::cout << max(calc(a, b, c), max(calc(b, a, b), calc(c, a, b))) << '\n'... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
int calc(int a, int b, int c) { return a * 10 + b + c; }
int main(int argc, char const *argv[]) {
int a, b, c;
std::cin >> a >> b >> c;
std::cout << max(calc(a, b, c), max(calc(b, a, c), calc(c, a, b))) << '\n'... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,037,681 | 1,037,682 | u688382329 | cpp |
p03250 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
//#include <bits/stdc++.h>
#define rep(i, n) Rep(i, 0, n)
#define Rep(i, k, n) for (int ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
//#include <bits/stdc++.h>
#define rep(i, n) Rep(i, 0, n)
#define Rep(i, k, n) for (int ... | [
"literal.number.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 1,037,683 | 1,037,684 | u381585104 | cpp |
p03250 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int d = max({a, b, c});
cout << d * 10 + a + b << endl;
}
| #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int d = max({a, b, c});
cout << d * 10 + (a + b + c - d) << endl;
}
| [] | 1,037,685 | 1,037,686 | u687548330 | cpp |
p03250 | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a > b && a > c) {
cout << a * 10 + b + c << endl;
} else if (b > a && b > c) {
cout << b * 10 + a + c << endl;
} else {
cout << c * 10 + a + b << endl;
}
}
| #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a >= b && a >= c) {
cout << a * 10 + b + c << endl;
} else if (b >= a && b >= c) {
cout << b * 10 + a + c << endl;
} else {
cout << c * 10 + a + b << endl;
}
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,037,687 | 1,037,688 | u147544115 | cpp |
p03250 | #include <iostream>
int main() {
int a, b, c;
std::cin >> a >> b >> c;
char flag;
int max = a;
flag = 'a';
if (max < b) {
max = b;
flag = 'b';
}
if (max < c) {
max = c;
flag = 'c';
}
int count;
if (flag = 'a') {
count = a * 10 + b + c;
}
if (flag = 'b') {
count = b *... | #include <iostream>
int main() {
int a, b, c;
std::cin >> a >> b >> c;
char flag;
int max = a;
flag = 'a';
if (max < b) {
max = b;
flag = 'b';
}
if (max < c) {
max = c;
flag = 'c';
}
int count;
if (flag == 'a') {
count = a * 10 + b + c;
}
if (flag == 'b') {
count = b... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 1,037,695 | 1,037,696 | u816645498 | cpp |
p03250 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <unordered_map>
#include <vector>
#pragma GCC optimize("O3")
#pragma comment(linker, "STACK:36777... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <unordered_map>
#include <vector>
#pragma GCC optimize("O3")
#pragma comment(linker, "STACK:36777... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 1,037,697 | 1,037,698 | u210718367 | cpp |
p03250 | #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... | [
"identifier.change",
"io.output.change"
] | 1,037,701 | 1,037,702 | u759266806 | cpp |
p03250 | // inlclude前用define
#define _USE_MATH_DEFINES
// include
#include <algorithm>
#include <cmath>
#include <iostream>
#include <limits>
#include <numeric>
#include <string>
#include <type_traits>
#include <vector>
using namespace std;
// typedef
typedef vector<int> VI;
typedef vector<string> VS;
typedef vector<char> VC;
... | // inlclude前用define
#define _USE_MATH_DEFINES
// include
#include <algorithm>
#include <cmath>
#include <iostream>
#include <limits>
#include <numeric>
#include <string>
#include <type_traits>
#include <vector>
using namespace std;
// typedef
typedef vector<int> VI;
typedef vector<string> VS;
typedef vector<char> VC;
... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,037,713 | 1,037,714 | u226951654 | cpp |
p03250 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define Rep(i, n0, n) for (int i = n0; i < n; i++)
#define Com(i, j, n) \
for (int i = 0; i < n - 1; i++) \
for (int j... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define Rep(i, n0, n) for (int i = n0; i < n; i++)
#define Com(i, j, n) \
for (int i = 0; i < n - 1; i++) \
for (int j... | [
"literal.number.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 1,037,715 | 1,037,716 | u987208743 | cpp |
p03250 | #include <algorithm>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <queue>
#include <stack>
#include <utility>
#include <vector>
using std::cin;
using std::cout;
using std::endl;
int main(void) {
int a, b, c;
int result = 0;
cin >> a >> b >> c;
if (a > b && a > c) {
res... | #include <algorithm>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <queue>
#include <stack>
#include <utility>
#include <vector>
using std::cin;
using std::cout;
using std::endl;
int main(void) {
int a, b, c;
int result = 0;
cin >> a >> b >> c;
if (a >= b && a >= c) {
r... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,037,719 | 1,037,720 | u844133200 | cpp |
p03250 | #include <iostream>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A >= B) {
if (B > C)
cout << A * 10 + B + C << endl;
if (C > A)
cout << C * 10 + A + B << endl;
if (A >= C && C >= B)
cout << A * 10 + C + B << endl;
}
if (B >= A) {
if (A > C)
... | #include <iostream>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A >= B) {
if (B > C)
cout << A * 10 + B + C << endl;
if (C > A)
cout << C * 10 + A + B << endl;
if (A >= C && C >= B)
cout << A * 10 + C + B << endl;
}
if (B > A) {
if (A > C)
c... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,037,730 | 1,037,731 | u761582051 | cpp |
p03250 | #include <iostream>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A >= B) {
if (B >= C)
cout << A * 10 + B + C << endl;
if (C >= A)
cout << C * 10 + A + B << endl;
if (A >= C && C >= B)
cout << A * 10 + C + B << endl;
}
if (B >= A) {
if (A >= C)
... | #include <iostream>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A >= B) {
if (B > C)
cout << A * 10 + B + C << endl;
if (C > A)
cout << C * 10 + A + B << endl;
if (A >= C && C >= B)
cout << A * 10 + C + B << endl;
}
if (B > A) {
if (A > C)
c... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,037,732 | 1,037,731 | u761582051 | cpp |
p03250 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
int main() {
std::vector<int> values;
int x;
for (int i = 0; i < 3; i++) {
std::cin >> x;
values.push_back(x);
}
std::sort(values.begin(), values.end());
int p, q;
p = values[0] * 10 + values[1];
q = p + values[2];
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
int main() {
std::vector<int> values;
int x;
for (int i = 0; i < 3; i++) {
std::cin >> x;
values.push_back(x);
}
std::sort(values.begin(), values.end());
int p, q;
p = values[2] * 10 + values[1];
q = p + values[0];
... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 1,037,739 | 1,037,740 | u465669072 | cpp |
p03250 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a >= b && a >= c)
cout << a * 10 + b + c;
else if (b >= a && b >= c)
cout << b * 10 + b + c;
else
cout << c * 10 + a + b;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a >= b && a >= c)
cout << a * 10 + b + c;
else if (b >= a && b >= c)
cout << b * 10 + a + c;
else
cout << c * 10 + a + b;
return 0;
} | [
"identifier.change",
"io.output.change"
] | 1,037,741 | 1,037,742 | u861532527 | cpp |
p03250 | #include <bits/stdc++.h>
using namespace std;
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i, c) \
for (typeof((c).begin()) i = (c).begin(... | #include <bits/stdc++.h>
using namespace std;
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i, c) \
for (typeof((c).begin()) i = (c).begin(... | [
"literal.number.change",
"variable_access.subscript.index.change",
"io.output.change",
"io.output.newline.add"
] | 1,037,745 | 1,037,746 | u748316936 | cpp |
p03250 | #include <algorithm>
#include <iostream>
#include <list>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long int int64;
int main(int argc, char **argv) {
int a[3];
cin >> a[0] >> a[1] >> a[2];
int res = a[0] + a[1] + a[2] + max(max(a[0], ... | #include <algorithm>
#include <iostream>
#include <list>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long int int64;
int main(int argc, char **argv) {
int a[3];
cin >> a[0] >> a[1] >> a[2];
int res = a[0] + a[1] + a[2] + (9 * max(max(a... | [] | 1,037,747 | 1,037,748 | u944835940 | cpp |
p03250 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <string.h>
#include <string>
#include <utility>
using namespace std;
typedef long long LL;
typedef pair<int, int> P;
typedef queue<P> Q;
#define _CRT_SECURE_NO_WARNINGS
int a, b, c... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <string.h>
#include <string>
#include <utility>
using namespace std;
typedef long long LL;
typedef pair<int, int> P;
typedef queue<P> Q;
#define _CRT_SECURE_NO_WARNINGS
int a, b, c... | [
"literal.number.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 1,037,751 | 1,037,752 | u114234520 | cpp |
p03250 | #include <bits/stdc++.h>
using namespace std;
int a[5];
int main() {
for (int i = 1; i <= 3; i++)
cin >> a[i];
sort(a + 1, a + 4);
int ans = a[1] * 10 + a[2] + a[3];
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int a[5];
int main() {
for (int i = 1; i <= 3; i++)
cin >> a[i];
sort(a + 1, a + 4);
int ans = a[3] * 10 + a[2] + a[1];
cout << ans << endl;
} | [
"literal.number.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 1,037,753 | 1,037,754 | u817240026 | cpp |
p03250 | #include <algorithm>
#include <bitset>
#include <climits>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#... | #include <algorithm>
#include <bitset>
#include <climits>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#... | [
"literal.number.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 1,037,759 | 1,037,760 | u003873207 | cpp |
p03250 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a[3];
for (auto &n : a) {
cin >> n;
}
sort(a, a + 3);
cout << a[2] << a[0] + a[1] << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a[3];
for (auto &n : a) {
cin >> n;
}
sort(a, a + 3);
cout << a[2] * 10 + a[0] + a[1] << endl;
return 0;
}
| [
"io.output.change"
] | 1,038,007 | 1,038,008 | u950721652 | cpp |
p03250 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(x) (x).begin(), (x).end()
using namespace std;
template <typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }
template <typename T> T &chmax(T &a, const T &b) { return a = max(a, b); }
using ll = long long;
using l... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(x) (x).begin(), (x).end()
using namespace std;
template <typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }
template <typename T> T &chmax(T &a, const T &b) { return a = max(a, b); }
using ll = long long;
using l... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,038,011 | 1,038,012 | u199808440 | cpp |
p03250 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
int m = max(A, max(B, C));
int ans;
if (m == A)
ans = 10 * A + B + C;
else if (m == B)
ans = 10 * B + A + C;
else
ans = !0 * C + A + B;
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
int m = max(A, max(B, C));
int ans;
if (m == A)
ans = 10 * A + B + C;
else if (m == B)
ans = 10 * B + A + C;
else
ans = 10 * C + A + B;
cout << ans << endl;
}
| [
"assignment.value.change",
"expression.operation.binary.change",
"expression.operation.unary.remove"
] | 1,038,017 | 1,038,018 | u636387751 | cpp |
p03250 | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> X(3);
cin >> X.at(0) >> X.at(1) >> X.at(2);
sort(X.begin(), X.end());
int answer = X.at(0) * 10 + X.at(1) + X.at(2);
cout << answer << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> X(3);
cin >> X.at(0) >> X.at(1) >> X.at(2);
sort(X.begin(), X.end());
int answer = X.at(2) * 10 + X.at(1) + X.at(0);
cout << answer << endl;
}
| [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,038,019 | 1,038,020 | u989696545 | cpp |
p03250 |
// include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#includ... |
// include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#includ... | [
"expression.operation.binary.remove"
] | 1,038,021 | 1,038,022 | u874996917 | cpp |
p03250 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define min(a, b) ((a) < (b) ? (a) : (b))
#define max(a, b) ((a) > (b) ? (a) : (b))
#define REP(i, n) for (int i = 0; i < n; i++)
... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define min(a, b) ((a) < (b) ? (a) : (b))
#define max(a, b) ((a) > (b) ? (a) : (b))
#define REP(i, n) for (int i = 0; i < n; i++)
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,038,023 | 1,038,024 | u055303078 | cpp |
p03250 | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define rep2(x, from, to) for (int x = (from); (x) < (to); (x)++)
#define rep(x, to... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define rep2(x, from, to) for (int x = (from); (x) < (to); (x)++)
#define rep(x, to... | [
"expression.operation.binary.add"
] | 1,038,025 | 1,038,026 | u798441421 | cpp |
p03250 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int a, b, c, t;
scanf("%d%d%d", &a, &b, &c);
if (a < b)
t = a;
a = b;
b = t;
if (a < c)
t = a;
a = c;
c = t;
if (b < c)
t = b;
b = c;
c = t;
printf("%d\n", a * 10 + b + c);
... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int a, b, c, t;
scanf("%d%d%d", &a, &b, &c);
if (a < b) {
t = a;
a = b;
b = t;
}
if (a < c) {
t = a;
a = c;
c = t;
}
if (b < c) {
t = b;
b = c;
c = t;
}
pr... | [] | 1,038,031 | 1,038,032 | u396496228 | cpp |
p03250 | #include <iostream>
using namespace std;
int main(void) {
int a, b, c, mx, ans = 0;
cin >> a >> b >> c;
mx = max(a, max(b, c));
if (mx == a) {
cout << a * 10 + b + c << endl;
return 0;
} else if (mx == b) {
cout << b * 10 + a + c << endl;
return 0;
} else if (mx == c) {
cout << c * 10 + ... | #include <iostream>
using namespace std;
int main(void) {
int a, b, c, mx, ans = 0;
cin >> a >> b >> c;
mx = max(a, max(b, c));
if (mx == a) {
cout << a * 10 + b + c << endl;
return 0;
} else if (mx == b) {
cout << b * 10 + a + c << endl;
return 0;
} else if (mx == c) {
cout << c * 10 + ... | [
"identifier.change",
"io.output.change"
] | 1,038,033 | 1,038,034 | u524212108 | cpp |
p03250 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n[3];
for (int i = 0; i < 3; i++) {
cin >> n[i];
}
sort(n, n + 3);
cout << n[0] * 10 + n[1] + n[2] << endl;
return 0;
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n[3];
for (int i = 0; i < 3; i++) {
cin >> n[i];
}
sort(n, n + 3);
cout << n[2] * 10 + n[1] + n[0] << endl;
return 0;
} | [
"literal.number.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 1,038,043 | 1,038,044 | u021423660 | cpp |
p03250 | #include "algorithm"
#include "cmath"
#include "iostream"
#include "string"
#include "vector"
int main(int argc, char const *argv[]) {
int A, B, C;
std::cin >> A >> B >> C;
if (A > B && A > C) {
std::cout << A * 10 + B + C << '\n';
} else {
if (B > A && B > C) {
std::cout << A + B * 10 + C << ... | #include "algorithm"
#include "cmath"
#include "iostream"
#include "string"
#include "vector"
int main(int argc, char const *argv[]) {
int A, B, C;
std::cin >> A >> B >> C;
if (A >= B && A >= C) {
std::cout << A * 10 + B + C << '\n';
} else {
if (B >= A && B >= C) {
std::cout << A + B * 10 + C... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,038,045 | 1,038,046 | u271986615 | cpp |
p03250 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
vector<int> v(3);
cin >> v[0] >> v[1] >> v[2];
sort(v.begin(), v.end());
cout << v[2] * 10 + v[1] << endl;
} | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
vector<int> v(3);
cin >> v[0] >> v[1] >> v[2];
sort(v.begin(), v.end());
cout << v[2] * 10 + v[1] + v[0] << endl;
}
| [
"expression.operation.binary.add"
] | 1,038,047 | 1,038,048 | u192058345 | cpp |
p03251 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define rep1(i, n) for (int i = 1; i <= (int)n; i++)
#define sp(n) cout << fixed << setprecision(n)
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define rep1(i, n) for (int i = 1; i <= (int)n; i++)
#define sp(n) cout << fixed << setprecision(n)
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,038,254 | 1,038,255 | u222866518 | cpp |
p03251 | #include <bits/stdc++.h>
using namespace std;
int mod = 1000000007;
int main() {
int N, M, X, Y, tmp;
cin >> N >> M >> X >> Y;
int Xmax = X, Ymin = Y;
for (int i = 0; i < N; i++) {
cin >> tmp;
Xmax = max(Xmax, tmp);
}
for (int i = 0; i < N; i++) {
cin >> tmp;
Ymin = min(Ymin, tmp);
}
c... | #include <bits/stdc++.h>
using namespace std;
int mod = 1000000007;
int main() {
int N, M, X, Y, tmp;
cin >> N >> M >> X >> Y;
int Xmax = X, Ymin = Y;
for (int i = 0; i < N; i++) {
cin >> tmp;
Xmax = max(Xmax, tmp);
}
for (int i = 0; i < N; i++) {
cin >> tmp;
Ymin = min(Ymin, tmp);
}
c... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,038,305 | 1,038,306 | u058742919 | cpp |
p03250 | #include <iostream>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
int res, res1, res2, res3;
res1 = 10 * A + B + C;
res2 = A + 10 * B + C;
res3 = A + B + 10 * C;
res = res1;
if (res2 >= res) {
res = res2;
if (res3 >= res) {
res = res3;
}
}
cout << res << endl... | #include <iostream>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
int res, res1, res2, res3;
res1 = 10 * A + B + C;
res2 = A + 10 * B + C;
res3 = A + B + 10 * C;
res = res1;
if (res2 >= res) {
res = res2;
}
if (res3 >= res) {
res = res3;
}
cout << res << endl;
re... | [] | 1,038,752 | 1,038,753 | u580920947 | cpp |
p03250 | #include <iostream>
int main() {
int num[3];
for (int i = 0; i < 3; i++) {
std::cin >> num[i];
if (i != 0) {
for (int j = i; j > 0; j--) {
if (num[j] > num[j - 1]) {
int tmp;
tmp = num[i];
num[i] = num[i - 1];
num[i - 1] = tmp;
}
}
}
... | #include <iostream>
int main() {
int num[3];
for (int i = 0; i < 3; i++) {
std::cin >> num[i];
if (i != 0) {
for (int j = i; j > 0; j--) {
if (num[j] > num[j - 1]) {
int tmp;
tmp = num[j];
num[j] = num[j - 1];
num[j - 1] = tmp;
}
}
}
... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"assignment.variable.change",
"expression.operation.binary.change"
] | 1,038,754 | 1,038,755 | u604446158 | cpp |
p03250 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
vector<int> num;
cin >> A >> B >> C;
num.push_back(10 + A + B + C);
num.push_back(C + 10 * B + A);
num.push_back(A + 10 * C + B);
sort(num.begin(), num.end());
cout << num[2] << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
vector<int> num;
cin >> A >> B >> C;
num.push_back(10 * A + B + C);
num.push_back(C + 10 * B + A);
num.push_back(A + 10 * C + B);
sort(num.begin(), num.end());
cout << num[2] << endl;
return 0;
}
| [
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,038,758 | 1,038,759 | u055644370 | cpp |
p03250 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
string op;
cin >> A >> B >> C;
if (A <= C && B <= C) {
cout << C * 10 + B + A << endl;
}
else if (A <= B && C <= B) {
cout << B * 10 + A + B << endl;
} else {
cout << A * 10 + B + C << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long A, B, C;
cin >> A >> B >> C;
if (A <= C && B <= C) {
cout << C * 10 + B + A << endl;
}
else if (A <= B && C <= B) {
cout << B * 10 + A + C << endl;
} else {
cout << A * 10 + B + C << endl;
}
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"variable_declaration.remove",
"identifier.change",
"io.output.change"
] | 1,038,764 | 1,038,765 | u577552796 | cpp |
p03250 | #include <iostream>
#include <string>
using namespace std;
int main() {
int A, B, C;
int maximum = 0;
cin >> A >> B >> C;
if (A > B && A > C) {
maximum = A;
cout << 10 * maximum + B + C << endl;
} else if (B > A && B > C) {
maximum = B;
cout << 10 * maximum + A + C << endl;
} else {
c... | #include <iostream>
#include <string>
using namespace std;
int main() {
int A, B, C;
int maximum = 0;
cin >> A >> B >> C;
if (A >= B && A >= C) {
maximum = A;
cout << 10 * maximum + B + C << endl;
} else if (B >= A && B >= C) {
maximum = B;
cout << 10 * maximum + A + C << endl;
} else {
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,038,766 | 1,038,767 | u882166397 | cpp |
p03250 | #include <stdio.h>
int main() {
int a, b, c, sum;
scanf("%d %d %d", &a, &b, &c);
if (a <= b) {
if (b <= c) {
sum = c * 10 + b + a;
} else {
sum = b * 10 + a + c;
}
} else {
if (a <= c) {
sum = c * 10 + b + a;
} else {
sum = a * 10 + a + c;
}
}
printf("%d\n"... | #include <stdio.h>
int main() {
int a, b, c, sum;
scanf("%d %d %d", &a, &b, &c);
if (a <= b) {
if (b <= c) {
sum = c * 10 + b + a;
} else {
sum = b * 10 + a + c;
}
} else {
if (a <= c) {
sum = c * 10 + b + a;
} else {
sum = a * 10 + b + c;
}
}
printf("%d\n"... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 1,038,774 | 1,038,775 | u125051909 | cpp |
p03250 | #include <bits/stdc++.h>
using namespace std;
int main() {
std::vector<int> v(3);
std::cin >> v.at(0) >> v.at(1) >> v.at(2);
int memo;
if (v.at(0) > v.at(1)) {
memo = 0;
} else {
memo = 1;
}
for (size_t i = 1; i < v.size() - 1; i++) {
if (v.at(i) > v.at(memo)) {
memo = i;
}
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
std::vector<int> v(3);
std::cin >> v.at(0) >> v.at(1) >> v.at(2);
int memo;
if (v.at(0) > v.at(1)) {
memo = 0;
} else {
memo = 1;
}
for (size_t i = 1; i < v.size(); i++) {
if (v.at(i) > v.at(memo)) {
memo = i;
}
}
v.at... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 1,038,776 | 1,038,777 | u556670958 | cpp |
p03250 | #include <iostream>
using namespace std;
int main(void) {
int a, b, c;
cin >> a;
cin >> b;
cin >> c;
int res;
if (a > b && a > c) {
res = 10 * a + b + c;
} else if (b > a && b > c) {
res = 10 * b + a + c;
} else {
res = 10 * c + a + b;
}
cout << res << endl;
return 0;
} | #include <iostream>
using namespace std;
int main(void) {
int a, b, c;
cin >> a;
cin >> b;
cin >> c;
int res;
if (a >= b && a >= c) {
res = 10 * a + b + c;
} else if (b >= a && b >= c) {
res = 10 * b + a + c;
} else {
res = 10 * c + a + b;
}
cout << res << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,038,787 | 1,038,788 | u284023437 | cpp |
p03250 | #include <iostream>
using namespace std;
int main() {
int A;
int B;
int C;
cin >> A >> B >> C;
int max;
int x;
int y;
int z;
int temp;
x = A;
y = B;
z = C;
if (B > x) {
x = B;
y = A;
}
if (C > x) {
x = C;
z = y;
y = x;
}
max = x * 10 + y + z;
cout << max <<... | #include <iostream>
using namespace std;
int main() {
int A;
int B;
int C;
cin >> A >> B >> C;
int max;
int x;
int y;
int z;
int temp;
x = A;
y = B;
z = C;
if (B > x) {
x = B;
y = A;
}
if (C > x) {
temp = x;
x = C;
z = y;
y = temp;
}
max = x * 10 + y + z;
... | [
"assignment.add",
"assignment.value.change",
"identifier.change"
] | 1,038,789 | 1,038,790 | u017513093 | cpp |
p03250 | #include <iostream>
using namespace std;
int a, b, c;
void swap(int *a, int *b) {
int temp = *a;
*a = *b;
*b = temp;
}
int main() {
cin >> a >> b >> c;
if (a < b)
swap(&a, &b);
if (b < c)
swap(&b, &c);
cout << c * 10 + a + b;
}
| #include <iostream>
using namespace std;
int a, b, c;
void swap(int *a, int *b) {
int temp = *a;
*a = *b;
*b = temp;
}
int main() {
cin >> a >> b >> c;
if (a > b)
swap(&a, &b);
if (b > c)
swap(&b, &c);
cout << c * 10 + a + b;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,038,791 | 1,038,792 | u603234915 | cpp |
p03250 | #include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long unsigned int ... | #include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long unsigned int ... | [
"literal.number.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 1,038,799 | 1,038,800 | u032337012 | cpp |
p03250 | #include <iostream>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A > B && A > C) {
cout << A * 10 + B + C;
} else if (B > A && B > C) {
cout << B * 10 + A + C;
} else {
cout << C * 10 + A + B;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A >= B && A >= C) {
cout << A * 10 + B + C;
} else if (B >= A && B >= C) {
cout << B * 10 + A + C;
} else {
cout << C * 10 + A + B;
}
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,038,801 | 1,038,802 | u272914305 | cpp |
p03250 | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a > b && a > c)
cout << 10 * a + b + c << endl;
if (b > a && b > c)
cout << 10 * b + a + c << endl;
if (c > a && c > b)
cout << 10 * c + a + b << endl;
} | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a >= b && a >= c)
cout << 10 * a + b + c << endl;
if (b > a && b >= c)
cout << 10 * b + a + c << endl;
if (c > a && c > b)
cout << 10 * c + a + b << endl;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,038,805 | 1,038,806 | u539125729 | cpp |
p03250 | #include <bits/stdc++.h>
using namespace std;
int main() {
int i, j, a, b, c;
scanf("%d%d%d", &a, &b, &c);
int ans = 0;
if ((a > b) && (a > c))
ans = 10 * a + b + c;
else if ((b > a) && (b > c))
ans = 10 * b + c + a;
else
ans = 10 * c + a + b;
printf("%d\n", ans);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int i, j, a, b, c;
scanf("%d%d%d", &a, &b, &c);
int ans = 0;
if ((a >= b) && (a >= c))
ans = 10 * a + b + c;
else if ((b >= a) && (b >= c))
ans = 10 * b + c + a;
else
ans = 10 * c + a + b;
printf("%d\n", ans);
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,038,809 | 1,038,810 | u312371680 | cpp |
p03250 | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int sum = 0;
if (a > b && a > c)
sum = a * 10 + b + c;
else if (b > a && b > c)
sum = b * 10 + a + c;
else
sum = c * 10 + a + b;
cout << sum << endl;
}
| #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int sum = 0;
if (a >= b && a >= c)
sum = a * 10 + b + c;
else if (b >= a && b >= c)
sum = b * 10 + a + c;
else
sum = c * 10 + a + b;
cout << sum << endl;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,038,811 | 1,038,812 | u714489093 | cpp |
p03250 | #include <bits/stdc++.h>
using namespace std;
#define repr(i, k, n) for (int i = (k); i < (n); i++)
#define rep(i, n) repr(i, 0, n)
#define ALL(a) begin(a), end(a)
const int INF = 114514810;
const int MOD = 1000000007;
typedef vector<int> vi;
typedef vector<string> vs;
typedef long long ll;
int ctoi(const char c) {
s... | #include <bits/stdc++.h>
using namespace std;
#define repr(i, k, n) for (int i = (k); i < (n); i++)
#define rep(i, n) repr(i, 0, n)
#define ALL(a) begin(a), end(a)
const int INF = 114514810;
const int MOD = 1000000007;
typedef vector<int> vi;
typedef vector<string> vs;
typedef long long ll;
int ctoi(const char c) {
s... | [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 1,038,813 | 1,038,814 | u824590097 | cpp |
p03250 | #include <bits/stdc++.h>
using namespace std;
int main() {
int s[3];
int tmp;
cin >> s[0] >> s[1] >> s[2];
for (int i = 0; i < 3; i++) {
if (s[i] > s[i + 1]) {
tmp = s[i];
s[i] = s[i + 1];
s[i + 1] = tmp;
}
}
cout << s[2] * 10 + s[1] + s[0] << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int s[3];
int tmp;
cin >> s[0] >> s[1] >> s[2];
for (int i = 0; i < 2; i++) {
if (s[i] > s[i + 1]) {
tmp = s[i];
s[i] = s[i + 1];
s[i + 1] = tmp;
}
}
cout << s[2] * 10 + s[1] + s[0] << endl;
} | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,038,815 | 1,038,816 | u953110527 | cpp |
p03251 | #include <bits/stdc++.h>
#define FOR(i, n) for (int i = 0; i < n; i++)
#define SFOR(i, a, b) for (int i = a; i < b; i++)
#define elif (a) else if (a)
#define INF INT_MAX
#define F first
#define S second
#define endl '\n'
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
cin.tie(0);
i... | #include <bits/stdc++.h>
#define FOR(i, n) for (int i = 0; i < n; i++)
#define SFOR(i, a, b) for (int i = a; i < b; i++)
#define elif (a) else if (a)
#define INF INT_MAX
#define F first
#define S second
#define endl '\n'
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
cin.tie(0);
i... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,038,945 | 1,038,946 | u260221618 | cpp |
p03251 | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
typedef long long ll;
const int INF = 1 << 30;
int main() {
int n, m, x, y;
cin >> n >> m >> x >> y;
int max_a = -INF, min_b = INF;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
max_a = max(max_a, a);
}
for (int i = 0; i < n; i++)... | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
typedef long long ll;
const int INF = 1 << 30;
int main() {
int n, m, x, y;
cin >> n >> m >> x >> y;
int max_a = -INF, min_b = INF;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
max_a = max(max_a, a);
}
for (int i = 0; i < n; i++)... | [
"misc.opposites",
"control_flow.loop.for.condition.change",
"io.output.change"
] | 1,038,984 | 1,038,985 | u630664279 | cpp |
p03251 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, X, Y;
cin >> n >> m >> X >> Y;
int max_x = (int)-1e9;
int min_y = (int)1e9;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
max_x = max(x, max_x);
}
for (int i = 0; i < n; i++) {
int y;
cin >> y;
min_y = min(y, mi... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, X, Y;
cin >> n >> m >> X >> Y;
int max_x = (int)-1e9;
int min_y = (int)1e9;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
max_x = max(x, max_x);
}
for (int i = 0; i < n; i++) {
int y;
cin >> y;
min_y = min(y, mi... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,040,251 | 1,040,252 | u807565474 | cpp |
p03251 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, X, Y;
cin >> n >> m >> X >> Y;
int max_x = (int)-1e9;
int min_y = (int)1e9;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
max_x = max(x, max_x);
}
for (int i = 0; i < n; i++) {
int y;
cin >> y;
min_y = min(y, mi... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, X, Y;
cin >> n >> m >> X >> Y;
int max_x = (int)-1e9;
int min_y = (int)1e9;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
max_x = max(x, max_x);
}
for (int i = 0; i < n; i++) {
int y;
cin >> y;
min_y = min(y, mi... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,040,253 | 1,040,254 | u807565474 | cpp |
p03251 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, X, Y;
cin >> n >> m >> X >> Y;
int max_x = (int)-1e9;
int min_y = (int)1e9;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
max_x = max(x, max_x);
}
for (int i = 0; i < n; i++) {
int y;
cin >> y;
min_y = min(y, mi... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, X, Y;
cin >> n >> m >> X >> Y;
int max_x = (int)-1e9;
int min_y = (int)1e9;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
max_x = max(x, max_x);
}
for (int i = 0; i < n; i++) {
int y;
cin >> y;
min_y = min(y, mi... | [
"expression.operator.compare.change",
"assignment.value.change",
"expression.operation.binary.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,040,255 | 1,040,254 | u807565474 | cpp |
p03252 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
//定数
//円周率
const double pi = 3.141592653589793238462643383279;
//天井
const int INF = 1000000000; // = 10^9
const ll LINF = 1000000000000000; // = 10^15
// ABC文字列
const string ABC = "ABCDEFGHIJKLMN... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
//定数
//円周率
const double pi = 3.141592653589793238462643383279;
//天井
const int INF = 1000000000; // = 10^9
const ll LINF = 1000000000000000; // = 10^15
// ABC文字列
const string ABC = "ABCDEFGHIJKLMN... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 1,040,358 | 1,040,359 | u453366189 | cpp |
p03252 | #include <bits/stdc++.h>
using namespace std;
#define debug(n) cerr << #n << ':' << n << endl;
#define dline cerr << __LINE__ << endl;
using ll = long long;
using ull = unsigned long long;
template <class T, class U> using P = pair<T, U>;
template <class T> using Heap = priority_queue<T>;
template <class T> using he... | #include <bits/stdc++.h>
using namespace std;
#define debug(n) cerr << #n << ':' << n << endl;
#define dline cerr << __LINE__ << endl;
using ll = long long;
using ull = unsigned long long;
template <class T, class U> using P = pair<T, U>;
template <class T> using Heap = priority_queue<T>;
template <class T> using he... | [
"identifier.change",
"call.arguments.change"
] | 1,040,366 | 1,040,367 | u691380397 | cpp |
p03252 | #include <bits/stdc++.h>
#define ll long long
#define mod 1000000007
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
string s, t;
cin >> s >> t;
vector<ll> ser(26, -1), ter(26, -1);
for (int i = 0; i < s.size(); i++) {
ll x = s[i] - 'a';
ll y = t[i] - 'a';
i... | #include <bits/stdc++.h>
#define ll long long
#define mod 1000000007
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
string s, t;
cin >> s >> t;
vector<ll> ser(26, -1), ter(26, -1);
for (int i = 0; i < s.size(); i++) {
ll x = s[i] - 'a';
ll y = t[i] - 'a';
i... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,040,381 | 1,040,382 | u026302640 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.