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 |
|---|---|---|---|---|---|---|---|
p03248 | #include <iostream>
#include <vector>
using namespace std;
int main(int argc, char const *argv[]) {
string s;
cin >> s;
int n = s.length();
bool b;
if (s[n - 1] == '1' || s[0] == '0')
b = true;
for (int i = 0; i < n - 1; i++)
if (s[i] != s[n - 2 - i])
b = true;
if (b)
cout << -1 << endl;... | #include <iostream>
#include <vector>
using namespace std;
int main(int argc, char const *argv[]) {
string s;
cin >> s;
int n = s.length();
bool b = 0;
if (s[n - 1] == '1' || s[0] == '0')
b = true;
for (int i = 0; i < n - 1; i++)
if (s[i] != s[n - 2 - i])
b = true;
if (b)
cout << -1 << e... | [
"variable_declaration.value.change"
] | 1,036,311 | 1,036,312 | u076635704 | cpp |
p03248 | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
int main(int argc, char const *argv[]) {
string s;
cin >> s;
in... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
int main(int argc, char const *argv[]) {
string s;
cin >> s;
in... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 1,036,314 | 1,036,315 | u076635704 | cpp |
p03248 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
string s;
cin >> s;
n = (int)s.size();
s = '0' + s;
if (s[1] == 0) {
cout << "-1\n";
return 0;
}
if (s[n] == 1) {
cout << "-1\n";
return 0;
}
for (int i = 1; i < n; i++)... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
string s;
cin >> s;
n = (int)s.size();
s = '0' + s;
if (s[1] == '0') {
cout << "-1\n";
return 0;
}
if (s[n] == '1') {
cout << "-1\n";
return 0;
}
for (int i = 1; i < n; ... | [
"control_flow.branch.if.condition.change"
] | 1,036,325 | 1,036,326 | u924194799 | cpp |
p03248 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <set>
#include <vector>
#define lowbit(x) (x & (-x))
#define MAX(a, b) (a < b ? b : a)
#define MIN(a, b) (a < b ? a : b)
using namespace std;
typedef long long ll;
typedef pair<int,... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <set>
#include <vector>
#define lowbit(x) (x & (-x))
#define MAX(a, b) (a < b ? b : a)
#define MIN(a, b) (a < b ? a : b)
using namespace std;
typedef long long ll;
typedef pair<int,... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 1,036,339 | 1,036,340 | u003099342 | cpp |
p03248 | #include <bits/stdc++.h>
using namespace std;
const int Nmax = 1e5 + 5;
int n, i, j, t[Nmax];
char a[Nmax];
int main() {
/// freopen("input", "r", stdin);
cin.sync_with_stdio(false);
cin >> (a + 1);
a[0] = '0';
n = strlen(a + 1);
for (i = 1; i <= n; ++i)
if (a[i] != a[n - i] || !a[1]) {
cout... | #include <bits/stdc++.h>
using namespace std;
const int Nmax = 1e5 + 5;
int n, i, j, t[Nmax];
char a[Nmax];
int main() {
/// freopen("input", "r", stdin);
cin.sync_with_stdio(false);
cin >> (a + 1);
a[0] = '0';
n = strlen(a + 1);
for (i = 1; i <= n; ++i)
if (a[i] != a[n - i] || a[1] == '0') {
... | [
"expression.operation.unary.logical.remove",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 1,036,346 | 1,036,347 | u636784987 | cpp |
p03248 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
#define fors(i, a, b) for (int i = (a); i <= (b); ++i)
#define ford(i, a, b) for (int i = (a); i >= (b); --i)
#define min(x, y) ((x) < (y) ? (x) : (y))
#d... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
#define fors(i, a, b) for (int i = (a); i <= (b); ++i)
#define ford(i, a, b) for (int i = (a); i >= (b); --i)
#define min(x, y) ((x) < (y) ? (x) : (y))
#d... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,036,354 | 1,036,355 | u884100569 | cpp |
p03248 | #include <bits/stdc++.h>
using namespace std;
#define fo(i, s, t) for (int i = s; i <= t; ++i)
#define fd(i, s, t) for (int i = s; i >= t; --i)
#define bf(i, s) for (int i = head[s]; i; i = e[i].next)
#define mp make_pair
#define fi first
#define se second
#define pii pair<int, int>
#define pb push_back
#define VI vec... | #include <bits/stdc++.h>
using namespace std;
#define fo(i, s, t) for (int i = s; i <= t; ++i)
#define fd(i, s, t) for (int i = s; i >= t; --i)
#define bf(i, s) for (int i = head[s]; i; i = e[i].next)
#define mp make_pair
#define fi first
#define se second
#define pii pair<int, int>
#define pb push_back
#define VI vec... | [
"expression.operation.binary.add"
] | 1,036,358 | 1,036,359 | u854354919 | cpp |
p03248 | #include <bits/stdc++.h>
#define rep(i, j, k) for (int i = j; i <= k; ++i)
#define rap(i, j, k) for (int i = j; i >= k; --i)
using namespace std;
int read() {
int num = 0, f = 1;
char c = getchar();
for (; c < '0' || c > '9'; c = getchar())
if (c == '-')
f = -1;
for (; c >= '0' && c <= '9'; c = getcha... | #include <bits/stdc++.h>
#define rep(i, j, k) for (int i = j; i <= k; ++i)
#define rap(i, j, k) for (int i = j; i >= k; --i)
using namespace std;
int read() {
int num = 0, f = 1;
char c = getchar();
for (; c < '0' || c > '9'; c = getchar())
if (c == '-')
f = -1;
for (; c >= '0' && c <= '9'; c = getcha... | [
"assignment.change"
] | 1,036,367 | 1,036,368 | u905181088 | cpp |
p03248 | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, a, b) for (int i = a; i >= b; i--)
#define fore(i, a) for (auto &i : a)
#define all(x) (x).begin(), (x).end()
#pragma GCC optimize("-O3")
using namespace std;
void _main();
int main() {
cin.tie(0);
ios::sync_with_stdio(false);... | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, a, b) for (int i = a; i >= b; i--)
#define fore(i, a) for (auto &i : a)
#define all(x) (x).begin(), (x).end()
#pragma GCC optimize("-O3")
using namespace std;
void _main();
int main() {
cin.tie(0);
ios::sync_with_stdio(false);... | [
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 1,036,371 | 1,036,372 | u141378465 | cpp |
p03248 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
const int inf = 1e9 + 7;
const int mod = 1e9 + 7;
using namespace std;
//
int main() {
... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
const int inf = 1e9 + 7;
const int mod = 1e9 + 7;
using namespace std;
//
int main() {
... | [
"variable_declaration.remove",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 1,036,378 | 1,036,379 | u587366956 | cpp |
p03248 | #include <bits/stdc++.h>
using namespace std;
const int MAX_N = 100010;
bool a[MAX_N];
int ne[MAX_N];
int build_tree(int v, int k) {
if (k == 1)
return v;
v--;
int i = 2;
int pr = 1;
while (i <= k) {
int e = ne[i];
// while (e <= k && !a[e])
// e++;
int u = build_tree(v + i, min(e - i ... | #include <bits/stdc++.h>
using namespace std;
const int MAX_N = 100010;
bool a[MAX_N];
int ne[MAX_N];
int build_tree(int v, int k) {
if (k == 1)
return v;
v--;
int i = 2;
int pr = 1;
while (i <= k) {
int e = ne[i];
// while (e <= k && !a[e])
// e++;
int u = build_tree(v + i, min(e - i ... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 1,036,384 | 1,036,385 | u498320152 | cpp |
p03248 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
#define MOD 1000000007
typedef long long ll;
using namespace std;
int main() {
string s;
cin >> s;
int n = s.size();
if (s[0] == '0' || s[n - 1] == '1' || s[n - 2] == '0') {
cout << -1 << endl;
return 0;
}... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
#define MOD 1000000007
typedef long long ll;
using namespace std;
int main() {
string s;
cin >> s;
int n = s.size();
if (s[0] == '0' || s[n - 1] == '1' || s[n - 2] == '0') {
cout << -1 << endl;
return 0;
}... | [
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 1,036,395 | 1,036,396 | u646339490 | cpp |
p03248 | #include "bits/stdc++.h"
#define ll long long
#define rep2(i, a, b) for (int i = a; i <= b; ++i)
#define rep(i, n) for (int i = 0; i < n; i++)
#define pii pair<int, int>
#define pll pair<ll, ll>
#define tii tuple<int, int, int>
#define pq priority_queue<int>
#define pqg priority_queue<int, vector<int>, greater<int>>
#d... | #include "bits/stdc++.h"
#define ll long long
#define rep2(i, a, b) for (int i = a; i <= b; ++i)
#define rep(i, n) for (int i = 0; i < n; i++)
#define pii pair<int, int>
#define pll pair<ll, ll>
#define tii tuple<int, int, int>
#define pq priority_queue<int>
#define pqg priority_queue<int, vector<int>, greater<int>>
#d... | [
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 1,036,426 | 1,036,427 | u495699318 | cpp |
p03248 | /*input
1010
*/
#include <bits/stdc++.h>
#define pii pair<int, int>
#define F first
#define S second
#define int long long
using namespace std;
const int MX = 1e5 + 100;
vector<int> G[MX];
int ptr[MX];
main() {
string s;
cin >> s;
int n = s.size();
if (s[0] == '0' or s[n - 1] == '1')
return cout << -1, 0;
... | /*input
1010
*/
#include <bits/stdc++.h>
#define pii pair<int, int>
#define F first
#define S second
#define int long long
using namespace std;
const int MX = 1e5 + 100;
vector<int> G[MX];
int ptr[MX];
main() {
string s;
cin >> s;
int n = s.size();
if (s[0] == '0' or s[n - 1] == '1')
return cout << -1, 0;
... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,036,452 | 1,036,453 | u466435290 | cpp |
p03250 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
vector<int> ans(3);
for (int i = 0; i < 5; i++)
cin >> ans.at(i);
sort(ans.begin(), ans.end());
cout << ans.at(0) + ans.at(1) + ans.at(2) * 10;
} | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
vector<int> ans(3);
for (int i = 0; i < 3; i++)
cin >> ans.at(i);
sort(ans.begin(), ans.end());
cout << ans.at(0) + ans.at(1) + ans.at(2) * 10;
}
| [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 1,036,529 | 1,036,530 | u079532978 | cpp |
p03250 | #include <bits/stdc++.h>
#include <iostream>
//#include <algorithm>
// #include <iomanip>
#define ll long long
#define map unordered_map
#define set unordered_set
#define l_l pair<ll, ll>
#define vll vector<ll>
#define mll map<ll, ll>
using namespace std;
const ll MOD = 1000000007LL;
const ll INF = (1LL << 60LL);
i... | #include <bits/stdc++.h>
#include <iostream>
//#include <algorithm>
// #include <iomanip>
#define ll long long
#define map unordered_map
#define set unordered_set
#define l_l pair<ll, ll>
#define vll vector<ll>
#define mll map<ll, ll>
using namespace std;
const ll MOD = 1000000007LL;
const ll INF = (1LL << 60LL);
i... | [
"literal.number.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 1,036,531 | 1,036,532 | u006576567 | cpp |
p03250 | #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[2] + A[1] + A[0] << endl;
}
| #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[2] * 10 + A[1] + A[0] << endl;
}
| [
"expression.operation.binary.add"
] | 1,036,533 | 1,036,534 | u187772564 | cpp |
p03250 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cstdint>
#include <cstdio>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cstdint>
#include <cstdio>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
... | [
"literal.number.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,036,539 | 1,036,540 | u923270446 | cpp |
p03250 | /*
author : nishi5451
created: 11.08.2020 20:57:56
*/
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << max(max(a, b), c) * 10 + a + b - max(max(a, b), c) << endl;
return 0;
} | /*
author : nishi5451
created: 11.08.2020 20:57:56
*/
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << max(max(a, b), c) * 10 + a + b + c - max(max(a, b), c) << endl;
return 0;
}
| [
"expression.operation.binary.add"
] | 1,036,553 | 1,036,554 | u033937898 | cpp |
p03250 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
int X = max(max(A, B), C) - 1;
cout << A + B + C + X * 9 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
int X = max(max(A, B), C);
cout << A + B + C + X * 9 << endl;
}
| [
"expression.operation.binary.remove"
] | 1,036,555 | 1,036,556 | u025773431 | cpp |
p03250 | #include <algorithm>
#include <iostream>
using namespace std;
int main(void) {
int N[3];
for (int i = 0; i < 3; i++) {
cin >> N[i];
}
sort(N, N + 3);
int ans = N[0] * 10 + N[1] + N[2];
cout << ans << endl;
}
| #include <algorithm>
#include <iostream>
using namespace std;
int main(void) {
int N[3];
for (int i = 0; i < 3; i++) {
cin >> N[i];
}
sort(N, N + 3);
int ans = N[2] * 10 + N[1] + N[0];
cout << ans << endl;
}
| [
"literal.number.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 1,036,557 | 1,036,558 | u963353562 | 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 << 10 * a + b + c << endl;
} else if (b >= a && b >= c) {
cout << 10 * b + a + c << endl;
} else {
cout << 10 * c + a + c << endl;
}
} | #include <bits/stdc++.h>
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;
}
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"identifier.change",
"io.output.change"
] | 1,036,567 | 1,036,568 | u543466827 | cpp |
p03250 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <set>
#include <string>
#include <vector>
#define rep(i, a, n) for (int i = a; i < n; i++)
using namespace std;
int main() {
int a[3];
rep(i, 0, 3) { cin >> a[i]; }
sort(a, a + 3);
int b = a[1] + a[2];
cout << a[0] + b << "\n";
}
| #include <algorithm>
#include <iomanip>
#include <iostream>
#include <set>
#include <string>
#include <vector>
#define rep(i, a, n) for (int i = a; i < n; i++)
using namespace std;
int main() {
int a[3];
rep(i, 0, 3) { cin >> a[i]; }
sort(a, a + 3);
int b = a[1] + a[2] * 10;
cout << a[0] + b << "\n";
}
| [
"assignment.change"
] | 1,036,571 | 1,036,572 | u742666659 | cpp |
p03250 | #include "bits/stdc++.h"
using namespace std;
void Main() {
int a[3];
cin >> a[0] >> a[1] >> a[2];
sort(a, a + 3);
cout << a[0] * 10 + a[1] + a[2] << endl;
}
int main() {
std::cin.tie(nullptr);
std::ios_base::sync_with_stdio(false);
std::cout << std::fixed << std::setprecision(15);
Main();
return ... | #include "bits/stdc++.h"
using namespace std;
void Main() {
int a[3];
cin >> a[0] >> a[1] >> a[2];
sort(a, a + 3);
cout << a[2] * 10 + a[1] + a[0] << endl;
}
int main() {
std::cin.tie(nullptr);
std::ios_base::sync_with_stdio(false);
std::cout << std::fixed << std::setprecision(15);
Main();
return ... | [
"literal.number.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 1,036,583 | 1,036,584 | u931698099 | cpp |
p03250 | #include <iomanip>
#include <iostream>
#include <stdio.h>
#include <string.h>
#include <vector>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a >= b && a >= c) {
cout << a * 10 + b + c << endl;
}
if (b >= a && b >= c) {
cout << b * 10 + a + c << endl;
}
if (c >= b && c >=... | #include <iomanip>
#include <iostream>
#include <stdio.h>
#include <string.h>
#include <vector>
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 if (c >= b &... | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 1,036,587 | 1,036,588 | u117737149 | cpp |
p03250 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
int D, E, F;
D = max(10 * A + B, 10 * B + A) + C;
E = max(10 * B + C, 10 * C + B) + A;
F = max(10 * C + A, 10 * A + B) + B;
cout << max(D, max(E, F)) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
int D, E, F;
D = max(10 * A + B, 10 * B + A) + C;
E = max(10 * B + C, 10 * C + B) + A;
F = max(10 * C + A, 10 * A + C) + B;
cout << max(D, max(E, F)) << endl;
}
| [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,036,621 | 1,036,622 | u280966279 | cpp |
p03250 | /* {:i:i:|i:i:/l/l-- --l/li:i:i|i:i:i:i}
{:rx|:i:i ィi芥ミ .ィi芥ミｉ:ｉ|ﾍ:i:i:}
. ｛ﾏ|ｉ: {::’:} {:‘::} :ｉ:i:|〉｝:/
乂|:i:| ｀¨¨¨¨´ ｀¨¨¨´ :i:ｉ:|ｼ/
ﾉ:|:i| ′ |:i:i:|ﾂ
/:/|:i:| ､ _ _ |:i:i:|
/:/ .|:i:|/ ＼ ｨ〔|:i:/
... | /* {:i:i:|i:i:/l/l-- --l/li:i:i|i:i:i:i}
{:rx|:i:i ィi芥ミ .ィi芥ミｉ:ｉ|ﾍ:i:i:}
. ｛ﾏ|ｉ: {::’:} {:‘::} :ｉ:i:|〉｝:/
乂|:i:| ｀¨¨¨¨´ ｀¨¨¨´ :i:ｉ:|ｼ/
ﾉ:|:i| ′ |:i:i:|ﾂ
/:/|:i:| ､ _ _ |:i:i:|
/:/ .|:i:|/ ＼ ｨ〔|:i:/
... | [
"literal.number.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 1,036,626 | 1,036,627 | u477516105 | cpp |
p03250 | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> a(3);
for (int i = 0; i < 3; ++i)
cin >> a[i];
sort(a.begin(), a.end());
reverse(a.begin(), a.end());
cout << a[0] * 10 + a[1] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> a(3);
for (int i = 0; i < 3; ++i)
cin >> a[i];
sort(a.begin(), a.end());
reverse(a.begin(), a.end());
cout << a[0] * 10 + a[1] + a[2] << endl;
return 0;
} | [
"expression.operation.binary.add"
] | 1,036,634 | 1,036,635 | u294683729 | cpp |
p03250 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A == B && B == C) {
cout << A * 10 + B * 2 << endl;
}
else {
cout << max(max(A, B), C) * 10 + B + C << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A == B && B == C) {
cout << A * 10 + B * 2 << endl;
}
else {
cout << max(max(A, B), C) * 9 + A + B + C << endl;
}
}
| [
"literal.number.change",
"io.output.change"
] | 1,036,638 | 1,036,639 | u425231382 | cpp |
p03250 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define PI 3.14159265358979323846
constexpr int INF = numeric_limits<int>::max() / 2;
constexpr long long INFL = numeric_limits<long long>::max() / 2;
constexpr int MOD = 1000000007;
using Graph = vector<vector<int>>;
in... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define PI 3.14159265358979323846
constexpr int INF = numeric_limits<int>::max() / 2;
constexpr long long INFL = numeric_limits<long long>::max() / 2;
constexpr int MOD = 1000000007;
using Graph = vector<vector<int>>;
in... | [
"literal.number.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 1,036,648 | 1,036,649 | u093973314 | cpp |
p03250 |
#include <bits/stdc++.h>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#define endl "\n"
#define int long long int
#define vi vector<int>
#define vll vector<ll>
#define vvi vector<vi>
#define pii pair<int, int>
#define pll pair<long long, long long>
#define mod 1000000007
#... |
#include <bits/stdc++.h>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#define endl "\n"
#define int long long int
#define vi vector<int>
#define vll vector<ll>
#define vvi vector<vi>
#define pii pair<int, int>
#define pll pair<long long, long long>
#define mod 1000000007
#... | [
"call.arguments.change",
"call.arguments.add"
] | 1,036,658 | 1,036,659 | u500494303 | cpp |
p03250 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
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 { // max:c
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
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 { // ma... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,036,666 | 1,036,667 | u440632112 | cpp |
p03250 | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> x;
cin >> x[0] >> x[1] >> x[2];
sort(x.begin(), x.end());
cout << x[2] * 10 + x[1] + x[0] << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> x(3);
cin >> x[0] >> x[1] >> x[2];
sort(x.begin(), x.end());
cout << x[2] * 10 + x[1] + x[0] << endl;
}
| [
"call.arguments.add"
] | 1,036,668 | 1,036,669 | u379168673 | cpp |
p03250 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
typedef long long ll;
#define all(x) (x).begin(), (x).end() // sortなどの引数を省略
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define max3(x, y, z) max(x, max(y, z))
#ifdef _MSC_FULL_VER ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
typedef long long ll;
#define all(x) (x).begin(), (x).end() // sortなどの引数を省略
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define max3(x, y, z) max(x, max(y, z))
#ifdef _MSC_FULL_VER ... | [
"literal.number.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 1,036,676 | 1,036,677 | u043964516 | cpp |
p03250 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define ALL(a) (a).begin(), (a).end()
#define PI 3.141592653589793238
#defin... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define ALL(a) (a).begin(), (a).end()
#define PI 3.141592653589793238
#defin... | [
"call.arguments.add"
] | 1,036,680 | 1,036,681 | u220428866 | cpp |
p03250 | #include <iostream>
using namespace std;
int main() {
int a, b, c;
int max;
cin >> a >> b >> c;
if (a > b && a > c) {
max = a;
} else if (b > a && b > c) {
max = b;
} else {
max = c;
}
cout << (max * 9) + a + b + c << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a, b, c;
int max;
cin >> a >> b >> c;
if (a >= b && a >= c) {
max = a;
} else if (b >= a && b >= c) {
max = b;
} else {
max = c;
}
cout << (max * 9) + a + b + c << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,036,682 | 1,036,683 | u658283466 | cpp |
p03250 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
vector<int> array(3);
array[0] = A;
array[1] = B;
array[2] = C;
sort(array.begin(), array.end());
int t = 0;
t = array[0] * 10 + array[1];
cout << t + array[2] << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
vector<int> array(3);
array[0] = A;
array[1] = B;
array[2] = C;
sort(array.begin(), array.end());
int t = 0;
t = array[2] * 10 + array[1];
cout << t + array[0] << endl;
} | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"io.output.change"
] | 1,036,684 | 1,036,685 | u908448907 | cpp |
p03250 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define FASTINOUT \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define FASTINOUT \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie... | [
"literal.number.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 1,036,692 | 1,036,693 | u257571179 | cpp |
p03250 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int A, B, C;
cin >> A, B, C;
int m = max(A, max(B, C));
cout << 9 * m + A + B + C;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int A, B, C;
cin >> A >> B >> C;
int m = max(A, max(B, C));
cout << 9 * m + A + B + C;
} | [] | 1,036,729 | 1,036,730 | u724012411 | cpp |
p03250 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
int s = A * 10 + B + C;
int t = A + B * 10 + C;
int u = A + B + C * 10;
if (s > t && s > u) {
cout << s << endl;
} else if (t > s && t > u) {
cout << t << endl;
} else {
cout << u << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
int s = A * 10 + B + C;
int t = A + B * 10 + C;
int u = A + B + C * 10;
if (s >= t && s >= u) {
cout << s << endl;
} else if (t >= s && t >= u) {
cout << t << endl;
} else {
cout << u << endl;
}
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,036,737 | 1,036,738 | u457196771 | cpp |
p03250 | #include <bits/stdc++.h>
using longlong = long long;
int main() {
std::cin.tie(0);
std::cin.sync_with_stdio(false);
int a, b, c;
std::cin >> a >> b >> c;
std::cout << (a + b + c + 9 * std::max(a, b)) << std::endl;
return 0;
} | #include <bits/stdc++.h>
using longlong = long long;
int main() {
std::cin.tie(0);
std::cin.sync_with_stdio(false);
int a, b, c;
std::cin >> a >> b >> c;
std::cout << (a + b + c + 9 * std::max({a, b, c})) << std::endl;
return 0;
} | [
"call.arguments.change"
] | 1,036,739 | 1,036,740 | u846041485 | cpp |
p03250 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
int mx = max(A, max(B, C));
int ans = 10 * mx + A + B + C - mx;
cout << mx << endl;
} | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
int mx = max(A, max(B, C));
int ans = 10 * mx + A + B + C - mx;
cout << ans << endl;
} | [
"identifier.change",
"io.output.change"
] | 1,036,741 | 1,036,742 | u138273120 | cpp |
p03250 | #include <bits/stdc++.h>
#include <stdlib.h>
using namespace std;
typedef long long ll;
int main() {
int a[3];
scanf("%d %d %d", a[0], a[1], a[2]);
sort(a, a + 3);
cout << 10 * a[2] + a[1] + a[0] << endl;
return 0;
}
| #include <bits/stdc++.h>
#include <stdlib.h>
using namespace std;
typedef long long ll;
int main() {
int a[3];
scanf("%d %d %d", &a[0], &a[1], &a[2]);
sort(a, a + 3);
cout << 10 * a[2] + a[1] + a[0] << endl;
return 0;
}
| [
"expression.operation.unary.reference.add"
] | 1,036,745 | 1,036,746 | u201553784 | cpp |
p03250 | #include <iostream>
using namespace std;
int main() {
int a, b, c;
std::cin >> a >> b >> c;
if (a <= c && b <= c) {
std::cout << c * 10 + a + b << '\n';
} else if (a <= b && c <= b) {
std::cout << b * 10 + a + c << '\n';
} else {
std::cout << c * 10 + a + b << '\n';
}
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int a, b, c;
std::cin >> a >> b >> c;
if (a <= c && b <= c) {
std::cout << c * 10 + a + b << '\n';
} else if (a <= b && c <= b) {
std::cout << b * 10 + a + c << '\n';
} else {
std::cout << a * 10 + c + b << '\n';
}
return 0;
}
| [
"identifier.change",
"expression.operation.binary.change"
] | 1,036,747 | 1,036,748 | u507749492 | cpp |
p03250 | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> a(3);
for (int i = 0; i < 3; i++) {
int b;
a.at(i) = b;
}
sort(a.begin(), a.end());
cout << a.at(2) * 10 + a.at(1) + a.at(0) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> a(3);
for (int i = 0; i < 3; i++) {
int b;
cin >> b;
a.at(i) = b;
}
sort(a.begin(), a.end());
cout << a.at(2) * 10 + a.at(1) + a.at(0) << endl;
} | [] | 1,036,749 | 1,036,750 | u613960672 | cpp |
p03250 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e, f;
cin >> a >> b >> c;
f = a + b + c;
d = min({a, b, c});
e = max({a, b, c});
f = f - (d + e);
cout << e << f + d;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e, f;
cin >> a >> b >> c;
f = a + b + c;
d = min({a, b, c});
e = max({a, b, c});
f = f - (d + e);
cout << e * 10 + f + d;
return 0;
} | [
"io.output.change"
] | 1,036,759 | 1,036,760 | u975604467 | cpp |
p03250 | /*{{{*/
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define SZ(X) ((int)(X).size())
#defin... | /*{{{*/
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define SZ(X) ((int)(X).size())
#defin... | [
"literal.number.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,036,763 | 1,036,764 | u284124505 | cpp |
p03250 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
int a, b, c;
cin >> a >> b >> c;
int m = max({a, b, c});
if (m == a)
cout << a * 10 + b + c << endl;
if (m == b)
cout << b * 10 + a + c << endl;
if (m == c)
cout << c * 10 + b + a << endl... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
int a, b, c;
cin >> a >> b >> c;
int m = max({a, b, c});
if (m == a)
cout << a * 10 + b + c << endl;
else if (m == b)
cout << b * 10 + a + c << endl;
else if (m == c)
cout << c * 10 + b +... | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 1,036,771 | 1,036,772 | u561143568 | cpp |
p03250 | #include <bits/stdc++.h>
typedef long long ll;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define all(v) v.begin(), v.end()
using namespace std;
using vi = vector<int>;
using vvi = vector<vi>;
const int INF = 1 << 30;
const ll INFll = 1ll << 60;
template <typename T> bool chmax(T &a, cons... | #include <bits/stdc++.h>
typedef long long ll;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define all(v) v.begin(), v.end()
using namespace std;
using vi = vector<int>;
using vvi = vector<vi>;
const int INF = 1 << 30;
const ll INFll = 1ll << 60;
template <typename T> bool chmax(T &a, cons... | [
"expression.operator.arithmetic.change",
"io.output.change"
] | 1,036,781 | 1,036,782 | u735008991 | cpp |
p03250 | #include <bits/stdc++.h>
typedef long long ll;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define all(v) v.begin(), v.end()
using namespace std;
using vi = vector<int>;
using vvi = vector<vi>;
const int INF = 1 << 30;
const ll INFll = 1ll << 60;
template <typename T> bool chmax(T &a, cons... | #include <bits/stdc++.h>
typedef long long ll;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define all(v) v.begin(), v.end()
using namespace std;
using vi = vector<int>;
using vvi = vector<vi>;
const int INF = 1 << 30;
const ll INFll = 1ll << 60;
template <typename T> bool chmax(T &a, cons... | [
"call.arguments.add",
"expression.operator.arithmetic.change",
"io.output.change"
] | 1,036,783 | 1,036,782 | u735008991 | cpp |
p03250 | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> a(3);
int sum = 0;
for (int i = 0; i < 3; i++) {
cin >> a.at(i);
}
sort(a.begin(), a.end());
cout << 10 * a.at(0) + a.at(1) + a.at(2) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> a(3);
int sum = 0;
for (int i = 0; i < 3; i++) {
cin >> a.at(i);
}
sort(a.begin(), a.end());
cout << a.at(0) + a.at(1) + 10 * a.at(2) << endl;
return 0;
} | [
"expression.operation.binary.remove"
] | 1,036,784 | 1,036,785 | u637318391 | cpp |
p03250 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
int main(void) {
vector<int> a(3, 0);
cin >> a[0] >> a[1] >> a[2];
sort(a.begin(), a.end());
int b;
b = 10 * a[0] + a[1];
cout << b + a[2] << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
int main(void) {
vector<int> a(3, 0);
cin >> a[0] >> a[1] >> a[2];
sort(a.begin(), a.end());
int b;
b = 10 * a[2] + a[1];
cout << b + a[0] << endl;
return 0;
} | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"io.output.change"
] | 1,036,786 | 1,036,787 | u093941965 | cpp |
p03250 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
int main(void) {
vector<int> a(4, 0);
cin >> a[0] >> a[1] >> a[2];
sort(a.begin(), a.end());
int b;
b = 10 * a[0] + a[1];
cout << b + a[3] << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
int main(void) {
vector<int> a(3, 0);
cin >> a[0] >> a[1] >> a[2];
sort(a.begin(), a.end());
int b;
b = 10 * a[2] + a[1];
cout << b + a[0] << endl;
return 0;
} | [
"literal.number.change",
"call.arguments.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"io.output.change"
] | 1,036,788 | 1,036,787 | u093941965 | cpp |
p03250 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
int main... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
int main... | [
"expression.operation.binary.add"
] | 1,036,789 | 1,036,790 | u552122040 | cpp |
p03250 | #include <bits/stdc++.h>
using namespace std;
int main() {
int arr[3];
cin >> arr[0] >> arr[1] >> arr[2];
sort(arr, arr + 3);
cout << arr[0] * 10 + arr[1] + arr[2];
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int arr[3];
cin >> arr[0] >> arr[1] >> arr[2];
sort(arr, arr + 3);
cout << arr[2] * 10 + arr[1] + arr[0];
} | [
"literal.number.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 1,036,799 | 1,036,800 | u901813121 | cpp |
p03250 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << max(max(B * 10 + A + C, C * 10 + A + B), C * 10 + A + B) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << max(max(B * 10 + A + C, C * 10 + A + B), A * 10 + C + B) << endl;
} | [
"identifier.change",
"io.output.change"
] | 1,036,805 | 1,036,806 | u568270381 | cpp |
p03249 | #include <bits/stdc++.h>
#define debug(x) cerr << #x << " " << (x) << endl
using namespace std;
const int N = 100005;
template <class T> void read(T &x) {
int sgn = 1;
char ch;
x = 0;
for (ch = getchar(); (ch < '0' || ch > '9') && ch != '-'; ch = getchar())
;
if (ch == '-')
ch = getchar(), sgn = -1;... | #include <bits/stdc++.h>
#define debug(x) cerr << #x << " " << (x) << endl
using namespace std;
const int N = 100005;
template <class T> void read(T &x) {
int sgn = 1;
char ch;
x = 0;
for (ch = getchar(); (ch < '0' || ch > '9') && ch != '-'; ch = getchar())
;
if (ch == '-')
ch = getchar(), sgn = -1;... | [
"control_flow.branch.if.add"
] | 1,036,834 | 1,036,835 | u198204105 | cpp |
p03249 | #include <bits/stdc++.h>
using namespace std;
#define DEBUG(x) cerr << #x << ": " << x << endl;
#define DEBUG_VEC(v) \
cerr << #v << ":"; \
for (int i = 0; i < v.size(); i++) ... | #include <bits/stdc++.h>
using namespace std;
#define DEBUG(x) cerr << #x << ": " << x << endl;
#define DEBUG_VEC(v) \
cerr << #v << ":"; \
for (int i = 0; i < v.size(); i++) ... | [
"literal.number.change",
"io.output.change"
] | 1,036,885 | 1,036,886 | u579152247 | cpp |
p03250 | #include <iostream>
#define rep(S, L) for (int i = S; i < L; ++i)
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int ans = 0;
if (a <= b && b <= c) {
ans = c * 10 + a + b;
} else if (a <= c && c <= b) {
ans = b * 10 + a + c;
} else {
ans = a * 10 + b + c;
}
cout << ans <... | #include <iostream>
#define rep(S, L) for (int i = S; i < L; ++i)
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int ans = 0;
if (a <= c && b <= c) {
ans = c * 10 + a + b;
} else if (a <= b && c <= b) {
ans = b * 10 + a + c;
} else {
ans = a * 10 + b + c;
}
cout << ans <... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 1,036,929 | 1,036,930 | u351174574 | cpp |
p03250 | #include <iostream>
#define rep(S, L) for (int i = S; i < L; ++i)
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int ans = 0;
if (a < b && b < c) {
ans = c * 10 + a + b;
} else if (a < c && c < b) {
ans = b * 10 + a + c;
} else {
ans = a * 10 + b + c;
}
cout << ans << en... | #include <iostream>
#define rep(S, L) for (int i = S; i < L; ++i)
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int ans = 0;
if (a <= c && b <= c) {
ans = c * 10 + a + b;
} else if (a <= b && c <= b) {
ans = b * 10 + a + c;
} else {
ans = a * 10 + b + c;
}
cout << ans <... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,036,931 | 1,036,930 | u351174574 | cpp |
p03250 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = ... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = ... | [
"literal.number.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"assignment.value.change"
] | 1,036,934 | 1,036,935 | u366581326 | cpp |
p03250 | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int a, b, c;
cin >> a >> b >> c;
int num, num1, num2;
num1 = max(a, b);
num2 = max(b, c);
num = max(num1, num2);
if (num == a) {
cout << num * 10 + b + c << '\n';
} else if (num == b) {
cout <... | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int a, b, c;
cin >> a >> b >> c;
int num, num1, num2;
num1 = max(a, b);
num2 = max(b, c);
num = max(num1, num2);
if (num == a) {
cout << num * 10 + b + c << '\n';
} else if (num == b) {
cout <... | [
"identifier.change",
"io.output.change"
] | 1,036,945 | 1,036,946 | u017829818 | cpp |
p03250 | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> ans(3);
cin >> ans[0] >> ans[1] >> ans[2];
sort(ans.begin(), ans.end());
cout << ans[0] * 10 + ans[1] + ans[2] << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> ans(3);
cin >> ans[0] >> ans[1] >> ans[2];
sort(ans.begin(), ans.end());
cout << ans[2] * 10 + ans[1] + ans[0] << endl;
} | [
"literal.number.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 1,036,955 | 1,036,956 | u966045029 | cpp |
p03250 | #include <bits/stdc++.h>
typedef long long ll;
#define REP(i, n) for (int i = 0; i < n; i++)
#define ALL(x) (x).begin(), (x).end()
using namespace std;
//素因数分解
vector<pair<ll, int>> factorize(ll n) {
vector<pair<ll, int>> res;
for (ll i = 2; i * i <= n; i++) {
if (n % i)
continue;
res.emplace_back(i,... | #include <bits/stdc++.h>
typedef long long ll;
#define REP(i, n) for (int i = 0; i < n; i++)
#define ALL(x) (x).begin(), (x).end()
using namespace std;
//素因数分解
vector<pair<ll, int>> factorize(ll n) {
vector<pair<ll, int>> res;
for (ll i = 2; i * i <= n; i++) {
if (n % i)
continue;
res.emplace_back(i,... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,036,967 | 1,036,968 | u355371431 | cpp |
p03250 | #include <bits/stdc++.h>
typedef long long ll;
#define REP(i, n) for (int i = 0; i < n; i++)
#define ALL(x) (x).begin(), (x).end()
using namespace std;
//素因数分解
vector<pair<ll, int>> factorize(ll n) {
vector<pair<ll, int>> res;
for (ll i = 2; i * i <= n; i++) {
if (n % i)
continue;
res.emplace_back(i,... | #include <bits/stdc++.h>
typedef long long ll;
#define REP(i, n) for (int i = 0; i < n; i++)
#define ALL(x) (x).begin(), (x).end()
using namespace std;
//素因数分解
vector<pair<ll, int>> factorize(ll n) {
vector<pair<ll, int>> res;
for (ll i = 2; i * i <= n; i++) {
if (n % i)
continue;
res.emplace_back(i,... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,036,969 | 1,036,968 | u355371431 | cpp |
p03250 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
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... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
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... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,036,981 | 1,036,982 | u915797797 | cpp |
p03250 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
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;
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
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... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,036,983 | 1,036,984 | u352969025 | cpp |
p03250 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
vector<int> a(3);
rep(i, 3) cin >> a.at(i);
sort(a.begin(), a.end());
cout << a.at(0) * 10 + a.at(1) + a.at(2);
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
vector<int> a(3);
rep(i, 3) cin >> a.at(i);
sort(a.begin(), a.end());
cout << a.at(2) * 10 + a.at(1) + a.at(0);
} | [
"literal.number.change",
"io.output.change"
] | 1,036,987 | 1,036,988 | u009870106 | cpp |
p03250 | #include <cstdio>
#define max(a, b) ((a) < (b) ? (a) : (b))
int main() {
int a, b, c;
scanf("%d %d %d", &a, &b, &c);
printf("%d\n", max(a, max(b, c)) * 9 + (a + b + c));
return 0;
} | #include <cstdio>
#define max(a, b) ((a) > (b) ? (a) : (b))
int main() {
int a, b, c;
scanf("%d %d %d", &a, &b, &c);
printf("%d\n", max(a, max(b, c)) * 9 + (a + b + c));
return 0;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"preprocessor.define.value.change"
] | 1,036,998 | 1,036,999 | u931819817 | cpp |
p03250 | #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[2] * 10 + a[1] + a[2] << endl;
}
| #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[2] * 10 + a[1] + a[0] << endl;
}
| [
"literal.number.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 1,037,004 | 1,037,005 | u677400065 | cpp |
p03250 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
int main() {
int a, b, c;
cin >> a >> b >> c;
int d = max({a, b, c});
int e = min({a, b, c});
int f ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
int main() {
int a, b, c;
cin >> a >> b >> c;
int d = max({a, b, c});
int e = min({a, b, c});
int f ... | [
"identifier.change",
"expression.operation.binary.change"
] | 1,037,046 | 1,037,047 | u852449189 | cpp |
p03250 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
int main() {
int a, b, c;
cin >> a >> b >> c;
int d = max({a, b, c});
int e = max({a, b, c});
int f ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
int main() {
int a, b, c;
cin >> a >> b >> c;
int d = max({a, b, c});
int e = min({a, b, c});
int f ... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"expression.operation.binary.change"
] | 1,037,048 | 1,037,047 | u852449189 | cpp |
p03250 | #include <bits/stdc++.h>
using namespace std;
//#define int long long
#define fo(a, b) for (int a = 0; a < b; a++)
#define Sort(a) sort(a.begin(), a.end())
#define rev(a) reverse(a.begin(), a.end())
int wari(int a, int b) {
if (a % b == 0)
return a / b;
else
return a / b + 1;
}
int keta(int a) {
double b ... | #include <bits/stdc++.h>
using namespace std;
//#define int long long
#define fo(a, b) for (int a = 0; a < b; a++)
#define Sort(a) sort(a.begin(), a.end())
#define rev(a) reverse(a.begin(), a.end())
int wari(int a, int b) {
if (a % b == 0)
return a / b;
else
return a / b + 1;
}
int keta(int a) {
double b ... | [
"expression.operator.arithmetic.change",
"io.output.change"
] | 1,037,071 | 1,037,072 | u322177979 | cpp |
p03250 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e, f;
cin >> a, b, c;
d = max(a, max(b, c));
e = min(a, min(b, c));
f = a + b + c - d - e;
cout << d * 10 + e + f << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e, f;
cin >> a >> b >> c;
d = max(a, max(b, c));
e = min(a, min(b, c));
f = a + b + c - d - e;
cout << d * 10 + e + f << endl;
}
| [] | 1,037,075 | 1,037,076 | u018807058 | cpp |
p03250 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
int main() {
int A, B, C;
cin >> A, B, C;
cout << max({10 * A + B + C, 10 * B + A + C, 10 * C + A + B}) << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << max({10 * A + B + C, 10 * B + A + C, 10 * C + A + B}) << endl;
} | [] | 1,037,087 | 1,037,088 | u552357043 | cpp |
p03250 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A[2];
cin >> A[0] >> A[1] >> A[2];
sort(A, A + 2);
cout << A[2] * 10 + A[1] + A[0] << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A[3];
cin >> A[0] >> A[1] >> A[2];
sort(A, A + 3);
cout << A[2] * 10 + A[1] + A[0] << endl;
} | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,037,109 | 1,037,110 | u415916075 | cpp |
p03250 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int ab = a * 10 + b;
int bc = b * 10 + c;
int ac = c * 10 * a;
cout << max(ab + c, max(a + bc, ac + b)) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int ab = a * 10 + b;
int bc = b * 10 + c;
int ac = c * 10 + a;
cout << max(ab + c, max(a + bc, ac + b)) << endl;
return 0;
} | [
"expression.operator.arithmetic.change",
"expression.operation.binary.change"
] | 1,037,111 | 1,037,112 | u318027064 | cpp |
p03250 | #include <iostream>
using namespace std;
int main() {
int A, B, C, max_factor, max;
cin >> A >> B >> C;
if (A > B && A > C)
max = 10 * A + B + C;
else if (B > A && B > C)
max = A + 10 * B + C;
else
max = A + B + 10 * C;
cout << max;
} | #include <iostream>
using namespace std;
int main() {
int A, B, C, max_factor, max;
cin >> A >> B >> C;
if (A >= B && A >= C)
max = 10 * A + B + C;
else if (B >= A && B >= C)
max = A + 10 * B + C;
else
max = A + B + 10 * C;
cout << max;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,037,123 | 1,037,124 | u164385976 | cpp |
p03250 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main(void) {
// Your code here!
int A, B, C;
cin >> A >> B >> C;
if (A > B && A > C) {
cout << A * 10 + B + C << endl;
} else if (B > C && B > A) {
cout << B * 10 + A + C << endl;
} else {
cout << C * 10 + A + B << endl;
}
}... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main(void) {
// Your code here!
int A, B, C;
cin >> A >> B >> C;
if (A >= B && A >= C) {
cout << A * 10 + B + C << endl;
} else if (B >= C && B >= A) {
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,125 | 1,037,126 | u791448889 | cpp |
p03250 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(int argc, char *argv[]) {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int a, b, c;
cin >> a >> b >> c;
cout << max(max(a * 10 + b + c, b * 10 + a + c), c * 10 + a + c) << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(int argc, char *argv[]) {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int a, b, c;
cin >> a >> b >> c;
cout << max(max(a * 10 + b + c, b * 10 + a + c), c * 10 + a + b) << endl;
return 0;
}
| [
"identifier.change",
"io.output.change"
] | 1,037,145 | 1,037,146 | u440032761 | 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 + a + 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;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,037,157 | 1,037,158 | u018586085 | cpp |
p03250 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A == max({A, B, C})) {
cout << 10 * A + B + C;
}
if (B == max({A, B, C})) {
cout << 10 * B + A + C;
}
if (C == max({A, B, C})) {
cout << 10 * C + A + B;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A == max({A, B, C})) {
cout << 10 * A + B + C;
} else if (B == max({A, B, C})) {
cout << 10 * B + A + C;
} else if (C == max({A, B, C})) {
cout << 10 * C + A + B;
}
}
| [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 1,037,159 | 1,037,160 | u224951113 | 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 << endl;
}
if (b >= a && b >= c) {
cout << b * 10 + a + c << endl;
}
if (c >= b && c >= a) {
cout << c * 10 + b + a << endl;
}
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 << endl;
}
if (b > a && b >= c) {
cout << b * 10 + a + c << endl;
}
if (c > b && c > a) {
cout << c * 10 + b + a << endl;
}
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,037,161 | 1,037,162 | u800100718 | cpp |
p03250 | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> MY(3);
for (int i = 0; i < 3; i++) {
cin >> MY.at(i);
}
sort(MY.begin(), MY.end());
cout << MY.at(0) * 10 + MY.at(1) + MY.at(2) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> MY(3);
for (int i = 0; i < 3; i++) {
cin >> MY.at(i);
}
sort(MY.begin(), MY.end());
cout << MY.at(2) * 10 + MY.at(1) + MY.at(0) << endl;
return 0;
} | [
"literal.number.change",
"io.output.change"
] | 1,037,166 | 1,037,167 | u983062344 | cpp |
p03250 | #include <algorithm>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <string.h>
#include <vector>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
int MAX = max({A, B, C});
cout << MAX * 10 + B + C << endl;
return 0;
} | #include <algorithm>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <string.h>
#include <vector>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
int MAX = max({A, B, C});
cout << MAX * 10 + A + B + C - MAX << endl;
return 0;
} | [
"expression.operation.binary.add"
] | 1,037,177 | 1,037,178 | u221769213 | cpp |
p03250 | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define ld long double
#define ll long long int
... | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define ld long double
#define ll long long int
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,037,185 | 1,037,186 | u961198482 | cpp |
p03250 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int a[3];
cin >> a[0] >> a[1] >> a[2];
sort(a, a + 3);
cout << a[0] * 10 + a[1] + a[2] << endl;
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int a[3];
cin >> a[0] >> a[1] >> a[2];
sort(a, a + 3);
cout << a[2] * 10 + a[1] + a[0] << endl;
}
| [
"literal.number.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 1,037,323 | 1,037,324 | u527806673 | cpp |
p03250 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
#ifdef _DEBUG
#define DMP(x) cerr << #x << ": " << x << "\n"
#else
#define DMP(x) ((void)0)
#endif
const int MOD = 1000000007, INF = 1111111111;
using name... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
#ifdef _DEBUG
#define DMP(x) cerr << #x << ": " << x << "\n"
#else
#define DMP(x) ((void)0)
#endif
const int MOD = 1000000007, INF = 1111111111;
using name... | [
"literal.number.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 1,037,331 | 1,037,332 | u532573979 | cpp |
p03250 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define vvi vector<vector<int>>
#define vec vector
#define pq priority_queue
#define all(v) (v).begin(), (v).end()
#define uniqueV(x) \
sort(x.begin(), x.end()); ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define vvi vector<vector<int>>
#define vec vector
#define pq priority_queue
#define all(v) (v).begin(), (v).end()
#define uniqueV(x) \
sort(x.begin(), x.end()); ... | [
"literal.number.change",
"io.output.change",
"expression.operation.binary.remove"
] | 1,037,339 | 1,037,340 | u219873012 | cpp |
p03250 | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> a(3);
cin >> a.at(0) >> a.at(1) >> a.at(2);
sort(a.begin(), a.end());
int ans = a.at(0) * 10 + a.at(1) + a.at(2);
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> a(3);
cin >> a.at(0) >> a.at(1) >> a.at(2);
sort(a.begin(), a.end());
int ans = a.at(2) * 10 + a.at(1) + a.at(0);
cout << ans << endl;
} | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,037,341 | 1,037,342 | u936602931 | cpp |
p03250 | #include <iostream>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A > B && A > C)
A *= 10;
else if (B > A && B > C)
B *= 10;
else
C *= 10;
cout << A + B + C << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A >= B && A >= C)
A *= 10;
else if (B >= A && B >= C)
B *= 10;
else
C *= 10;
cout << A + B + C << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,037,346 | 1,037,347 | u940000534 | cpp |
p03250 | #include <algorithm>
#include <bitset>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define MOD (long long int)(1e9... | #include <algorithm>
#include <bitset>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define MOD (long long int)(1e9... | [
"expression.operation.binary.remove",
"assignment.change"
] | 1,037,350 | 1,037,351 | u050698451 | cpp |
p03250 | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a > b && a > c)
a *= 10;
else if (b > a && b > c)
b *= 10;
else
c *= 10;
cout << a + b + c << endl;
} | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a >= b && a >= c)
a *= 10;
else if (b >= a && b >= c)
b *= 10;
else
c *= 10;
cout << a + b + c << endl;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,037,352 | 1,037,353 | u180436681 | cpp |
p03250 | #include <bits/stdc++.h>
using namespace std;
/* メモリ食い過ぎ注意 */
#define int long long
typedef long long ll;
/* define const */
const ll INF = (1ll << 60);
const ll MOD = (ll)1e9 + 7;
/* end defineing */
signed main() {
int t;
vector<int> v;
cin >> t;
v.push_back(t);
cin >> t;
v.push_back(t);
cin >> t;
... | #include <bits/stdc++.h>
using namespace std;
/* メモリ食い過ぎ注意 */
#define int long long
typedef long long ll;
/* define const */
const ll INF = (1ll << 60);
const ll MOD = (ll)1e9 + 7;
/* end defineing */
signed main() {
int t;
vector<int> v;
cin >> t;
v.push_back(t);
cin >> t;
v.push_back(t);
cin >> t;
... | [
"literal.number.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 1,037,356 | 1,037,357 | u218759384 | cpp |
p03250 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
int D = max(A, B);
int E = max(D, C);
cout << 10 * E + A + B << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
int D = max(A, B);
int E = max(D, C);
cout << 9 * E + A + B + C << endl;
}
| [
"literal.number.change",
"io.output.change"
] | 1,037,358 | 1,037,359 | u764365016 | cpp |
p03250 | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <limits.h>
#include <math.h>
#include <stdio.h>
#include <string>
#include <typeinfo>
#include <vector>
//#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef vector<string> vs;
... | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <limits.h>
#include <math.h>
#include <stdio.h>
#include <string>
#include <typeinfo>
#include <vector>
//#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef vector<string> vs;
... | [
"expression.operation.binary.add"
] | 1,037,369 | 1,037,370 | u662614053 | cpp |
p03250 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
vector<int> x = {a, b, c};
sort(x.begin(), x.end());
cout << x.at(0) * +x.at(1) + x.at(2) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
vector<int> x = {a, b, c};
sort(x.begin(), x.end());
cout << x.at(2) * 10 + x.at(1) + x.at(0) << endl;
}
| [
"literal.number.change",
"io.output.change"
] | 1,037,373 | 1,037,374 | u521723672 | cpp |
p03250 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int a[3];
for (int i = 0; i < 3; i++)
cin >> a[i];
sort(a, a + 2);
cout << a[0] * 10 + a[1] + a[2] << endl;
} | #include <algorithm>
#include <iostream>
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] << endl;
} | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 1,037,383 | 1,037,384 | u420421811 | cpp |
p03250 | // 110
#include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
int ans = 0;
if (A > B && A > C) {
ans = A * 10 + B + C;
} else if (B > A && B > C) {
ans = B * 10 + A + C;
} else {
ans = C *... | // 110
#include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
int ans = 0;
if (A >= B && A >= C) {
ans = A * 10 + B + C;
} else if (B >= A && B >= C) {
ans = B * 10 + A + C;
} else {
ans =... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,037,385 | 1,037,386 | u123724799 | cpp |
p03250 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a[3];
cin >> a[0] >> a[1] >> a[2];
int ans;
int tmp;
for (int i = 0; i < 3; i++) {
if (a[i] > a[i + 1]) {
tmp = a[i];
a[i] = a[i + 1];
a[i + 1] = tmp;
}
}
cout << a[2] * 10 + a[0] + a[1] << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a[3];
cin >> a[0] >> a[1] >> a[2];
int ans;
int tmp;
for (int i = 0; i < 2; i++) {
if (a[i] > a[i + 1]) {
tmp = a[i];
a[i] = a[i + 1];
a[i + 1] = tmp;
}
}
cout << a[2] * 10 + a[0] + a[1] << endl;
}
| [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,037,391 | 1,037,392 | u941284252 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.