problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k ⌀ | fixed_code stringlengths 12 526k ⌀ | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M ⌀ | fixed_submission_id int64 2 1.54M ⌀ | user_id stringlengths 10 10 ⌀ | language stringclasses 9
values |
|---|---|---|---|---|---|---|---|
p03071 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A == B)
cout << 2 * A << endl;
if (A > B)
cout << A * (A - 1) << endl;
if (A < B)
cout << B * (B - 1) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A == B)
cout << 2 * A << endl;
if (A > B)
cout << 2 * A - 1 << endl;
if (A < B)
cout << 2 * B - 1 << endl;
} | [
"identifier.replace.remove",
"literal.replace.add",
"io.output.change"
] | 881,232 | 881,233 | u983062344 | cpp |
p03069 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N;
cin >> N;
string S;
cin >> S;
// 累積和での実装
vector<int> blacks(1, 0), whites(1, 0);
for (int i = 0; i < N; i++) {
if (S[i] == '#') {
blacks.push_back(blacks[i] + 1);
} else {
blacks.push_back(blacks[i]);
}
if (S[N - 1 - i] == '.') {
whites.push_back(whites[i] + 1);
} else {
whites.push_back(whites[i]);
}
}
// 番兵を前後にくっつける
blacks.push_back(blacks[N]);
whites.push_back(whites[N]);
reverse(whites.begin(), whites.end());
vector<int> costs;
for (int i = 1; i < N + 1; i++) {
costs.push_back(blacks[i] + whites[i + 1]);
}
int ans = *min_element(costs.begin(), costs.end());
// for (int i = 0; i < costs.size(); i++)
//{
// cout << "blacks:" << blacks[i] << endl;
// cout << "whites:" << whites[i] << endl;
//}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N;
cin >> N;
string S;
cin >> S;
// 累積和での実装
vector<int> blacks(1, 0), whites(1, 0);
for (int i = 0; i < N; i++) {
if (S[i] == '#') {
blacks.push_back(blacks[i] + 1);
} else {
blacks.push_back(blacks[i]);
}
if (S[N - 1 - i] == '.') {
whites.push_back(whites[i] + 1);
} else {
whites.push_back(whites[i]);
}
}
// 番兵を前後にくっつける
blacks.push_back(blacks[N]);
whites.push_back(whites[N]);
reverse(whites.begin(), whites.end());
vector<int> costs;
for (int i = 0; i < N + 2; i++) {
costs.push_back(blacks[i] + whites[i + 1]);
}
int ans = *min_element(costs.begin(), costs.end());
// for (int i = 0; i < costs.size(); i++)
//{
// cout << "blacks:" << blacks[i] << endl;
// cout << "whites:" << whites[i] << endl;
//}
cout << ans << endl;
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 881,236 | 881,237 | u934246119 | cpp |
p03069 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, p = 0;
int a[200000];
string s;
cin >> n >> s;
for (int i = 0; i < n; i++) {
if (s[i] == '.')
p++;
a[i] = p;
}
int m = n;
for (int i = 0; i < n; i++)
m = min(p + i + 1 - a[i] * 2, m);
cout << m << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, p = 0;
int a[200000];
string s;
cin >> n >> s;
for (int i = 0; i < n; i++) {
if (s[i] == '.')
p++;
a[i] = p;
}
int m = p;
for (int i = 0; i < n; i++)
m = min(p + i + 1 - a[i] * 2, m);
cout << m << endl;
return 0;
}
| [
"variable_declaration.value.change",
"identifier.change"
] | 881,238 | 881,239 | u597243424 | cpp |
p03069 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define REP(i, b) FOR(i, 0, b)
#define RFOR(i, a, b) for (int i = a - 1; i >= b; i--)
#define RREP(i, a) RFOR(i, a, 0)
#define REPALL(i, v) for (int i = 0; i < v.size(); i++)
#define RREPALL(i, v) for (int i = v.size() - 1; i >= 0; i--)
#define SORT(v) sort(v.begin(), v.end())
#define MIN_ELEMENT(v) min_element(v.begin(), v.end())
#define MAX_ELEMENT(v) max_element(v.begin(), v.end())
#define COUNT(v, n) count(v.begin(), v.end(), n);
void YES(bool flag) { cout << (flag ? "YES" : "NO") << endl; }
void Yes(bool flag) { cout << (flag ? "Yes" : "No") << endl; }
void yes(bool flag) { cout << (flag ? "yes" : "no") << endl; }
typedef long long ll;
typedef unsigned long long ull;
const int INF = 1e7;
const ll MOD = 1e9 + 7;
int main() {
int n;
string s;
cin >> n >> s;
int m = COUNT(s, '.');
int ans = INF;
REP(i, n) {
if (s[i] == '#') {
m++;
} else {
m--;
}
ans = min(ans, m);
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define REP(i, b) FOR(i, 0, b)
#define RFOR(i, a, b) for (int i = a - 1; i >= b; i--)
#define RREP(i, a) RFOR(i, a, 0)
#define REPALL(i, v) for (int i = 0; i < v.size(); i++)
#define RREPALL(i, v) for (int i = v.size() - 1; i >= 0; i--)
#define SORT(v) sort(v.begin(), v.end())
#define MIN_ELEMENT(v) min_element(v.begin(), v.end())
#define MAX_ELEMENT(v) max_element(v.begin(), v.end())
#define COUNT(v, n) count(v.begin(), v.end(), n);
void YES(bool flag) { cout << (flag ? "YES" : "NO") << endl; }
void Yes(bool flag) { cout << (flag ? "Yes" : "No") << endl; }
void yes(bool flag) { cout << (flag ? "yes" : "no") << endl; }
typedef long long ll;
typedef unsigned long long ull;
const int INF = 1e7;
const ll MOD = 1e9 + 7;
int main() {
int n;
string s;
cin >> n >> s;
int m = COUNT(s, '.');
int ans = m;
REP(i, n) {
if (s[i] == '#') {
m++;
} else {
m--;
}
ans = min(ans, m);
}
cout << ans << endl;
return 0;
}
| [
"variable_declaration.value.change",
"identifier.change"
] | 881,240 | 881,241 | u007637377 | cpp |
p03069 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl '\n'
#define N 1e5 + 1;
#define INF 1e9
const ll MOD = 10e9 + 7;
ll max(ll a, ll b) { return a > b ? a : b; }
ll min(ll a, ll b) { return a < b ? a : b; }
vector<int> ans;
ll a[200001];
ll b[200001];
vector<int> sorted;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n;
string str;
ll ans = 0;
int w = 0;
cin >> n >> str;
for (int i = 0; i < n; i++)
if (str[i] == '.')
w++;
int b = 0;
int m = INT_MAX;
for (int i = 0; i < n; i++) {
if (str[i] == '#')
b++;
else
w--;
m = min(m, w + b);
}
cout << m;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl '\n'
#define N 1e5 + 1;
#define INF 1e9
const ll MOD = 10e9 + 7;
ll max(ll a, ll b) { return a > b ? a : b; }
ll min(ll a, ll b) { return a < b ? a : b; }
vector<int> ans;
ll a[200001];
ll b[200001];
vector<int> sorted;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n;
string str;
ll ans = 0;
int w = 0;
cin >> n >> str;
for (int i = 0; i < n; i++)
if (str[i] == '.')
w++;
int b = 0;
int m = w;
for (int i = 0; i < n; i++) {
if (str[i] == '#')
b++;
else
w--;
m = min(m, w + b);
}
cout << m;
}
| [
"variable_declaration.value.change",
"identifier.change"
] | 881,246 | 881,247 | u990641118 | cpp |
p03069 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, (n)-1, 0)
#define FOR(i, a, b) for (int i = (a), i##Len_ = (b); i < i##Len_; i++)
#define RFOR(i, a, b) for (int i = (a), i##End_ = (b); i >= i##End_; i--)
const char *LF = "\n";
namespace {
struct _ {
_() {
cin.tie(0);
ios::sync_with_stdio(false);
}
} a;
} // namespace
signed main() {
ll N;
cin >> N;
string S;
cin >> S;
ll nb = 0;
ll nw = 0;
REP(i, N) {
if (S[i] == '.') {
nw++;
}
}
ll ans = 1e7;
REP(i, N) {
if (S[i] == '.') {
nw--;
} else {
nb++;
}
ans = min(ans, nw + nb);
}
cout << ans << LF;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, (n)-1, 0)
#define FOR(i, a, b) for (int i = (a), i##Len_ = (b); i < i##Len_; i++)
#define RFOR(i, a, b) for (int i = (a), i##End_ = (b); i >= i##End_; i--)
const char *LF = "\n";
namespace {
struct _ {
_() {
cin.tie(0);
ios::sync_with_stdio(false);
}
} a;
} // namespace
signed main() {
ll N;
cin >> N;
string S;
cin >> S;
ll nb = 0;
ll nw = 0;
REP(i, N) {
if (S[i] == '.') {
nw++;
}
}
ll ans = nw + nb;
REP(i, N) {
if (S[i] == '.') {
nw--;
} else {
nb++;
}
ans = min(ans, nw + nb);
}
cout << ans << LF;
return 0;
}
| [
"identifier.replace.add",
"literal.replace.remove"
] | 881,248 | 881,249 | u248306486 | cpp |
p03069 | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author Apolloliu
*/
#include <fstream>
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
#define MEM(a, b) memset(a, b, sizeof(a))
#define UN(a) sort(all(a)), a.erase(unique(all(a)), a.end())
#define REV(a) reverse(all(a))
#define MP(a, b) make_pair(a, b)
#define PAIR(a, b) pair<int, int>(a, b)
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<int, int> pii;
const int MOD = 1e9 + 7;
const int maxn = 1;
const double EPS = 1e-8;
class CStones {
public:
void solve(std::istream &in, std::ostream &out) {
int n;
string s;
in >> n >> s;
int res = n;
std::vector<int> sumw(n, 0), sumb(n, 0);
for (int i = 0; i < n; ++i) {
if (s[i] == '.') {
sumw[i] = 1;
} else {
sumb[i] = 1;
}
if (i) {
sumw[i] += sumw[i - 1];
sumb[i] += sumb[i - 1];
}
}
if (n >= 2) {
for (int i = 1; i < n; ++i) {
// if (s[i] != s[i - 1]) {
// res = min(res, sumb[i] + sumw[n-1] - sumw[i]);
res =
min(res, (i - sumw[i - 1]) + (n - i - (sumb[n - 1] - sumb[i - 1])));
// }
}
}
// cerr << sumb[n-1] << ' ' << sumw[n-1] << endl;
res = min(n - sumb[n - 1], n - sumw[n - 1]);
// if(sumb[n-1] == n || sumw[n-1] == n)res = 0;
out << res << endl;
}
};
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
CStones solver;
std::istream &in(std::cin);
std::ostream &out(std::cout);
solver.solve(in, out);
return 0;
} | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author Apolloliu
*/
#include <fstream>
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
#define MEM(a, b) memset(a, b, sizeof(a))
#define UN(a) sort(all(a)), a.erase(unique(all(a)), a.end())
#define REV(a) reverse(all(a))
#define MP(a, b) make_pair(a, b)
#define PAIR(a, b) pair<int, int>(a, b)
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<int, int> pii;
const int MOD = 1e9 + 7;
const int maxn = 1;
const double EPS = 1e-8;
class CStones {
public:
void solve(std::istream &in, std::ostream &out) {
int n;
string s;
in >> n >> s;
int res = n;
std::vector<int> sumw(n, 0), sumb(n, 0);
for (int i = 0; i < n; ++i) {
if (s[i] == '.') {
sumw[i] = 1;
} else {
sumb[i] = 1;
}
if (i) {
sumw[i] += sumw[i - 1];
sumb[i] += sumb[i - 1];
}
}
if (n >= 2) {
for (int i = 1; i < n; ++i) {
// if (s[i] != s[i - 1]) {
// res = min(res, sumb[i] + sumw[n-1] - sumw[i]);
res =
min(res, (i - sumw[i - 1]) + (n - i - (sumb[n - 1] - sumb[i - 1])));
// }
}
}
// cerr << sumb[n-1] << ' ' << sumw[n-1] << endl;
res = min(res, min(n - sumb[n - 1], n - sumw[n - 1]));
// if(sumb[n-1] == n || sumw[n-1] == n)res = 0;
out << res << endl;
}
};
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
CStones solver;
std::istream &in(std::cin);
std::ostream &out(std::cout);
solver.solve(in, out);
return 0;
} | [
"call.add",
"call.arguments.change"
] | 881,252 | 881,253 | u608624039 | cpp |
p03069 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
using namespace std;
#define MAXN 1000010
int n, ans = 1e9;
int b[MAXN], w[MAXN];
char a[MAXN];
inline int read() {
int x = 0, t = 1, c;
while (!isdigit(c = getchar()))
if (c == '-')
t = -1;
while (isdigit(c))
x = x * 10 + c - '0', c = getchar();
return x * t;
}
int main() {
n = read();
scanf("%s", a + 1);
for (int i = 1; i <= n; i++) {
if (a[i] == 'B')
b[i]++;
b[i] += b[i - 1];
}
for (int i = n; i >= 1; i--) {
if (a[i] == 'W')
w[i]++;
w[i] += w[i + 1];
}
for (int i = 0; i <= n; i++)
ans = min(ans, b[i] + w[i + 1]);
printf("%d\n", ans);
return 0;
}
| #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
using namespace std;
#define MAXN 1000010
int n, ans = 1e9;
int b[MAXN], w[MAXN];
char a[MAXN];
inline int read() {
int x = 0, t = 1, c;
while (!isdigit(c = getchar()))
if (c == '-')
t = -1;
while (isdigit(c))
x = x * 10 + c - '0', c = getchar();
return x * t;
}
int main() {
n = read();
scanf("%s", a + 1);
for (int i = 1; i <= n; i++) {
if (a[i] == '#')
b[i]++;
b[i] += b[i - 1];
}
for (int i = n; i >= 1; i--) {
if (a[i] == '.')
w[i]++;
w[i] += w[i + 1];
}
for (int i = 0; i <= n; i++)
ans = min(ans, b[i] + w[i + 1]);
printf("%d\n", ans);
return 0;
}
| [
"literal.string.change",
"control_flow.branch.if.condition.change"
] | 881,263 | 881,264 | u519489463 | cpp |
p03069 | #include <bits/stdc++.h>
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 FORR(i, m, n) for (int i = (m); i >= (n); i--)
#define All(x) (x).begin(), (x).end()
typedef long long ll;
typedef unsigned long long ull;
const int INF = 1e9;
int main() {
int n;
string s;
cin >> n >> s;
int cnt = 0;
for (int i = 0; i < n; i++) {
if (s[i] == '.')
cnt++;
}
int ans = n;
for (int i = 0; i < n; i++) {
if (s[i] == '.')
cnt--;
else
cnt++;
ans = min(ans, cnt);
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
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 FORR(i, m, n) for (int i = (m); i >= (n); i--)
#define All(x) (x).begin(), (x).end()
typedef long long ll;
typedef unsigned long long ull;
const int INF = 1e9;
int main() {
int n;
string s;
cin >> n >> s;
int cnt = 0;
for (int i = 0; i < n; i++) {
if (s[i] == '.')
cnt++;
}
int ans = cnt;
for (int i = 0; i < n; i++) {
if (s[i] == '.')
cnt--;
else
cnt++;
ans = min(ans, cnt);
}
cout << ans << endl;
return 0;
} | [
"variable_declaration.value.change",
"identifier.change"
] | 881,286 | 881,287 | u875541682 | cpp |
p03069 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define OUT(a) cout << (a) << "\n";
#define ll long long
ll MOD = 10e9 + 7;
int main() {
int n;
string s;
cin >> n;
cin >> s;
int black[n], white[n];
REP(i, n) {
if (i == 0)
black[i] = (s[i] == '#' ? 1 : 0);
else if (s[i] == '#')
black[i] = black[i - 1] + 1;
else
black[i] = black[i - 1];
}
for (int i = n - 1; i >= 0; i--) {
if (i == n - 1)
white[i] = (s[i] == '.' ? 1 : 0);
else if (s[i] == '.')
white[i] = white[i + 1] + 1;
else
white[i] = white[i + 1];
}
int min_change = min(n - black[n - 1], black[n - 1]);
int tmp_b, tmp_w;
REP(i, n) {
tmp_b = black[i];
tmp_w = white[i];
min_change = min(min_change, tmp_b + tmp_w);
}
OUT(min_change);
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define OUT(a) cout << (a) << "\n";
#define ll long long
ll MOD = 10e9 + 7;
int main() {
int n;
string s;
cin >> n;
cin >> s;
int black[n], white[n];
REP(i, n) {
if (i == 0)
black[i] = (s[i] == '#' ? 1 : 0);
else if (s[i] == '#')
black[i] = black[i - 1] + 1;
else
black[i] = black[i - 1];
}
for (int i = n - 1; i >= 0; i--) {
if (i == n - 1)
white[i] = (s[i] == '.' ? 1 : 0);
else if (s[i] == '.')
white[i] = white[i + 1] + 1;
else
white[i] = white[i + 1];
}
int min_change = min(n - black[n - 1], black[n - 1]);
int tmp_b, tmp_w;
REP(i, n) {
tmp_b = black[i];
tmp_w = white[i + 1];
min_change = min(min_change, tmp_b + tmp_w);
}
OUT(min_change);
return 0;
} | [
"assignment.change"
] | 881,292 | 881,293 | u860374704 | cpp |
p03069 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, black = 0, sum, white = 0,
minv = 200005; // blackは黒に、whiteは白にぬりかえるもの
int j;
cin >> n;
string s;
cin >> s;
for (int i = 0; i < n; ++i) {
if (s[i] == '.')
++white;
}
for (int i = 0; i < n; ++i) {
if (i) {
if (s[i] == '#')
++black;
else
--white;
}
sum = white + black;
minv = min(sum, minv);
}
cout << minv << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, black = 0, sum, white = 0,
minv = 200005; // blackは黒に、whiteは白にぬりかえるもの
int j;
cin >> n;
string s;
cin >> s;
for (int i = 0; i < n; ++i) {
if (s[i] == '.')
++white;
}
for (int i = 0; i <= n; ++i) {
if (i) {
if (s[i - 1] == '#')
++black;
else
--white;
}
sum = white + black;
minv = min(sum, minv);
}
cout << minv << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change",
"misc.off_by_one"
] | 881,294 | 881,295 | u698883164 | cpp |
p03069 | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(void) {
long long N;
string S;
cin >> N >> S;
long long w = 0;
for (long long i = 0; i < N; i++) {
if (S[i] == '.') {
w++;
}
}
long long BL = 0;
long long WR = w;
long long ans = N;
for (long long i = 0; i < N; i++) {
if (S[i] == '#') {
BL++;
} else {
WR--;
}
ans = min(ans, BL + WR);
}
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(void) {
long long N;
string S;
cin >> N >> S;
long long w = 0;
for (long long i = 0; i < N; i++) {
if (S[i] == '.') {
w++;
}
}
long long BL = 0;
long long WR = w;
long long ans = w;
for (long long i = 0; i < N; i++) {
if (S[i] == '#') {
BL++;
} else {
WR--;
}
ans = min(ans, BL + WR);
}
cout << ans << endl;
return 0;
}
| [
"variable_declaration.value.change",
"identifier.change"
] | 881,337 | 881,338 | u579882657 | cpp |
p03069 | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(void) {
long long N;
string S;
cin >> N >> S;
long long w = 0;
for (long long i = 0; i < N; i++) {
if (S[i] == '.') {
w++;
}
}
long long BL = 0;
long long WR = w;
long long ans = 100000;
for (long long i = 0; i < N; i++) {
if (S[i] == '#') {
BL++;
} else {
WR--;
}
ans = min(ans, BL + WR);
}
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(void) {
long long N;
string S;
cin >> N >> S;
long long w = 0;
for (long long i = 0; i < N; i++) {
if (S[i] == '.') {
w++;
}
}
long long BL = 0;
long long WR = w;
long long ans = w;
for (long long i = 0; i < N; i++) {
if (S[i] == '#') {
BL++;
} else {
WR--;
}
ans = min(ans, BL + WR);
}
cout << ans << endl;
return 0;
}
| [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 881,339 | 881,338 | u579882657 | cpp |
p03069 | #include "bits/stdc++.h"
using namespace std;
int main() {
int N;
string S;
cin >> N >> S;
int num = 0;
int ans = 0;
for (int i = 0; i < N; i++) {
if (S[i] == '.') {
num++;
} else if (S[i] == '#' && num > 0) {
ans++;
num--;
}
}
cout << ans << endl;
return 0;
}
| #include "bits/stdc++.h"
using namespace std;
int main() {
int N;
string S;
cin >> N >> S;
int num = 0;
int ans = 0;
for (int i = 0; i < N; i++) {
if (S[i] == '#') {
num++;
} else if (S[i] == '.' && num > 0) {
ans++;
num--;
}
}
cout << ans << endl;
return 0;
} | [
"literal.string.change",
"control_flow.branch.if.condition.change"
] | 881,344 | 881,345 | u692207013 | cpp |
p03069 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, i, a = 0, b, c = 0;
string s;
cin >> n >> s;
while (n > 0 && s[0] == '.') {
s.erase(0, 1);
n--;
}
while (n > 0 && s[n - 1] == '*') {
s.erase(n - 1, 1);
n--;
}
for (i = 0; i < n; i++)
if (s[i] == '.')
a++;
b = a;
for (i = 0; i < n; i++) {
if (s[i] == '*') {
if (i != 0 && s[i - 1] == '.') {
b += c;
a = min(a, b);
c = 0;
}
c++;
} else
c--;
}
b += c;
a = min(a, b);
cout << a << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, i, a = 0, b, c = 0;
string s;
cin >> n >> s;
while (n > 0 && s[0] == '.') {
s.erase(0, 1);
n--;
}
while (n > 0 && s[n - 1] == '#') {
s.erase(n - 1, 1);
n--;
}
for (i = 0; i < n; i++)
if (s[i] == '.')
a++;
b = a;
for (i = 0; i < n; i++) {
if (s[i] == '#') {
if (i != 0 && s[i - 1] == '.') {
b += c;
a = min(a, b);
c = 0;
}
c++;
} else
c--;
}
b += c;
a = min(a, b);
cout << a << endl;
return 0;
} | [
"literal.string.change",
"control_flow.loop.condition.change",
"control_flow.branch.if.condition.change"
] | 881,350 | 881,351 | u054798759 | cpp |
p03069 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); ++i)
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
const int INF = 1e9;
int N;
string S;
int main() {
cin >> N >> S;
int w = 0;
REP(i, S.size()) if (S[i] == '.')++ w;
int ans = INF;
int B = 0, W = w;
REP(i, S.size()) {
if (S[i] == '#') {
++B;
} else {
--W;
}
chmin(ans, B + W);
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); ++i)
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
const int INF = 1e9;
int N;
string S;
int main() {
cin >> N >> S;
int w = 0;
REP(i, S.size()) if (S[i] == '.')++ w;
int ans = w;
int B = 0, W = w;
REP(i, S.size()) {
if (S[i] == '#') {
++B;
} else {
--W;
}
chmin(ans, B + W);
}
cout << ans << endl;
return 0;
} | [
"variable_declaration.value.change",
"identifier.change"
] | 881,357 | 881,358 | u843175622 | cpp |
p03069 | #include <algorithm>
#include <array>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define _USE_MATH_DEFINES
#include <math.h>
#include <stdio.h>
#include <unordered_map>
#include <unordered_set>
using namespace std;
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<long long int> vll;
typedef vector<vll> vvll;
typedef vector<string> vs;
typedef pair<int, int> pii;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef unsigned long long ull;
// repetition
//------------------------------------------
#define REP(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) REP(i, 0, n)
#define rrep(i, n) for (int i = (n); i >= 0; i--)
#define VEC_2D(a, b) vector<vector<int>>(a, vector<int>(b, 0))
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
#define mp make_pair
#define INF (1001000000)
#define SZ(a) int((a).size())
#define EACH(i, c) \
for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define EXIST(s, e) ((s).find(e) != (s).end())
#define SORT(c) sort((c).begin(), (c).end())
#define UNIQ(c) (c).erase(unique((c).begin(), (c).end()), (c).end());
#define MOD 1000000007LL
#define MS(v, n) memset((v), (n), sizeof(v))
// input
#define VEC(type, c, n) \
std::vector<type> c(n); \
for (auto &i : c) \
std::cin >> i;
// output
#define P(p) cout << (p) << endl;
#define FSP(a) cout << fixed << setprecision(a)
template <typename T> T gcd(T x, T y) {
if (y == 0)
return x;
else
return gcd(y, x % y);
}
template <typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
template <typename T> bool is_prime(T n) {
for (int i = 2; i * i <= n; i++) {
if (n % i == 0)
return false;
}
return n != 1;
}
map<ll, ll> prime_factor(ll n) {
map<ll, ll> res;
for (int i = 2; i * i <= n; i++) {
while (n % i == 0) {
++res[i];
n /= i;
}
}
if (n != 1)
res[n] = 1;
return res;
}
int extgcd(int a, int b, int &x, int &y) { //
int d = a;
if (b != 0) {
d = extgcd(b, a % b, y, x);
y -= (a / b) * x;
} else {
x = 1;
y = 0;
}
return d;
}
ll mod_pow(ll x, ll n, ll mod) {
if (n == 0)
return 1;
ll res = mod_pow(x * x % mod, n / 2, mod);
if (n & 1)
res = res * x % mod;
return res;
}
ll comb(ll a, ll b, ll mod) {
ll mul = 1;
ll div = 1;
rep(i, b) {
mul *= (a - (ll)i);
mul %= mod;
div *= ((ll)i + 1);
div %= mod;
}
mul *= mod_pow(div, mod - 2, mod);
return mul % mod;
}
vector<string> split(const string &str, char delim) {
vector<string> res;
size_t current = 0, found;
while ((found = str.find_first_of(delim, current)) != string::npos) {
res.push_back(string(str, current, found - current));
current = found + 1;
}
res.push_back(string(str, current, str.size() - current));
return res;
}
bool is_kadomatsu(int a, int b, int c) {
if (a == b || a == c || b == c)
return false;
if (a > b && c > b)
return true;
if (a < b && c < b)
return true;
return false;
}
struct UF {
int n;
vi d;
UF() {}
UF(int n) : n(n), d(n, -1) {}
int root(int v) {
if (d[v] < 0)
return v;
return d[v] = root(d[v]);
}
bool same(int a, int b) { return root(a) == root(b); }
bool unite(int x, int y) {
x = root(x);
y = root(y);
if (x == y)
return false;
if (size(x) < size(y))
swap(x, y);
d[x] += d[y];
d[y] = x;
return true;
}
int size(int v) { return -d[root(v)]; }
};
struct Fibonacci {
vvll fib;
Fibonacci() {
fib.resize(2, vll(2));
fib[0][0] = 1;
fib[0][1] = 1;
fib[1][0] = 1;
fib[1][1] = 0;
}
vvll mul(vvll &A, vvll &B) {
vvll C(2, vll(2));
rep(i, 2) {
rep(k, 2) {
rep(j, 2) { C[i][j] = (C[i][j] + A[i][k] * B[k][j]) % MOD; }
}
}
return C;
}
ll pow(ll n) {
vvll A = fib;
vvll B(2, vll(2));
rep(i, 2) { B[i][i] = 1; }
while (n > 0) {
if (n & 1)
B = mul(B, A);
A = mul(A, A);
n >>= 1;
}
return B[1][0];
}
};
vector<int> divisor(int n) {
if (n == 1)
return {};
vi res;
for (int i = 1; i * i <= n; i++) {
if (n % i == 0) {
res.emplace_back(i);
if (i != 1 && i != n / i)
res.emplace_back(n / i);
}
}
return res;
}
struct Bellmanford {
int n;
struct edge {
int from, to, cost;
};
vector<edge> E;
vi d;
Bellmanford(int n) : n(n), d(n) { E.resize(n); }
void add_edge(int x, int y, int cost) {
edge e;
e.from = x;
e.to = y;
e.cost = cost;
E.push_back(e);
}
void shortest_path(int s) {
rep(i, n) d[i] = INF;
d[s] = 0;
while (true) {
bool update = false;
for (auto e : E) {
if (d[e.from] != INF && d[e.to] > d[e.from] + e.cost) {
d[e.to] = d[e.from] + e.cost;
update = true;
}
}
if (!update)
break;
}
}
};
struct Dijkstra {
int n;
struct edge {
int to;
ll cost;
};
vector<vector<edge>> G;
vll d;
Dijkstra(int n) : n(n), d(n) { G.resize(n); }
void add_edge(int x, int y, ll cost) {
edge e;
e.to = y;
e.cost = cost;
G[x].push_back(e);
}
void shortest_path(int s) {
rep(i, n) d[i] = 100000000000000000;
d[s] = 0;
priority_queue<pair<ll, int>, vector<pair<ll, int>>, greater<pair<ll, int>>>
que;
que.push(make_pair(0, s));
while (!que.empty()) {
pii p = que.top();
que.pop();
int v = p.second;
if (d[v] < p.first)
continue;
for (auto e : G[v]) {
if (d[e.to] > d[v] + e.cost) {
d[e.to] = d[v] + e.cost;
que.push(make_pair(d[e.to], e.to));
}
}
}
}
};
struct Segmenttree {
int n;
vector<int> dat;
Segmenttree(int n_) {
n = 1;
while (n < n_)
n *= 2;
dat = vector<int>(2 * n - 1, 0);
}
void add(int idx, ll val) { // 0-indexed
idx += n - 1;
dat[idx] += val;
while (idx > 0) {
idx = (idx - 1) / 2;
dat[idx] += val;
}
}
int query(int a, int b) { return query_seg(a, b, 0, 0, n); }
int query_seg(int a, int b, int k, int l, int r) {
if (r <= a || b <= l)
return 0;
if (a <= l && r <= b)
return dat[k];
else {
return query_seg(a, b, k * 2 + 1, l, (l + r) / 2) +
query_seg(a, b, k * 2 + 2, (l + r) / 2, r);
}
}
};
struct Trie {
Trie *next[26];
Trie() { fill(next, next + 26, (Trie *)0); }
void insert(char *s) {
if (*s == '\0')
return;
if (this->next[*s - 'a'] == NULL) {
this->next[*s - 'a'] = new Trie();
}
this->next[*s - 'a']->insert(s + 1);
}
bool find(char *s) {
if (*s == '\0')
return true;
if (this->next[*s - 'a'] == NULL) {
return false;
}
return this->next[*s - 'a']->find(s + 1);
}
};
struct BIT {
int n;
vi bit;
BIT() {}
BIT(int n) : n(n) { bit.resize(n + 1); }
int sum(int i) {
int s = 0;
while (i > 0) {
s += bit[i];
i -= i & -i;
}
return s;
}
void add(int i, int x) {
while (i <= n) {
bit[i] += x;
i += i & -i;
}
}
};
/*
struct edge { int to, cap, rev; };
vector<edge> G[200005];
int level[200005];
int iter[200005];
void add_edge(int from, int to, int cap) {
G[from].push_back({ to, cap, (int)G[to].size() });
G[to].push_back({ from, 0, (int)G[from].size() - 1 });
}
void fbfs(int s) {
memset(level, -1, sizeof(level));
queue<int> que;
level[s] = 0;
que.push(s);
while (!que.empty()) {
int v = que.front(); que.pop();
for (edge &e : G[v]) {
if (e.cap > 0 && level[e.to] < 0) {
level[e.to] = level[v] + 1;
que.push(e.to);
}
}
}
}
int fdfs(int v, int t, int f) {
if (v == t) return f;
for (edge &e : G[v]) {
if (e.cap > 0 && level[v] < level[e.to]) {
int d = fdfs(e.to, t, min(f, e.cap));
if (d > 0) {
e.cap -= d;
G[e.to][e.rev].cap += d;
return d;
}
}
}
return 0;
}
int max_flow(int s, int t) {
int flow = 0;
for (;;) {
fbfs(s);
if (level[t] < 0) return flow;
memset(iter, 0, sizeof(iter));
int f;
while ((f = fdfs(s, t, INF)) > 0) {
flow += f;
}
}
}
*/
//------------------------
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
string S;
cin >> N >> S;
int all_w = 0;
rep(i, N) {
if (S[i] == '.')
all_w++;
}
int tmp_w = 0;
int ans = 11111111;
rep(i, N) {
int tmp = (i - tmp_w) + (N - i - (N - all_w - tmp_w));
ans = min(tmp, ans);
if (S[i] == '.')
tmp_w++;
}
ans = min(ans, N - all_w);
P(ans);
return 0;
} | #include <algorithm>
#include <array>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define _USE_MATH_DEFINES
#include <math.h>
#include <stdio.h>
#include <unordered_map>
#include <unordered_set>
using namespace std;
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<long long int> vll;
typedef vector<vll> vvll;
typedef vector<string> vs;
typedef pair<int, int> pii;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef unsigned long long ull;
// repetition
//------------------------------------------
#define REP(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) REP(i, 0, n)
#define rrep(i, n) for (int i = (n); i >= 0; i--)
#define VEC_2D(a, b) vector<vector<int>>(a, vector<int>(b, 0))
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
#define mp make_pair
#define INF (1001000000)
#define SZ(a) int((a).size())
#define EACH(i, c) \
for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define EXIST(s, e) ((s).find(e) != (s).end())
#define SORT(c) sort((c).begin(), (c).end())
#define UNIQ(c) (c).erase(unique((c).begin(), (c).end()), (c).end());
#define MOD 1000000007LL
#define MS(v, n) memset((v), (n), sizeof(v))
// input
#define VEC(type, c, n) \
std::vector<type> c(n); \
for (auto &i : c) \
std::cin >> i;
// output
#define P(p) cout << (p) << endl;
#define FSP(a) cout << fixed << setprecision(a)
template <typename T> T gcd(T x, T y) {
if (y == 0)
return x;
else
return gcd(y, x % y);
}
template <typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
template <typename T> bool is_prime(T n) {
for (int i = 2; i * i <= n; i++) {
if (n % i == 0)
return false;
}
return n != 1;
}
map<ll, ll> prime_factor(ll n) {
map<ll, ll> res;
for (int i = 2; i * i <= n; i++) {
while (n % i == 0) {
++res[i];
n /= i;
}
}
if (n != 1)
res[n] = 1;
return res;
}
int extgcd(int a, int b, int &x, int &y) { //
int d = a;
if (b != 0) {
d = extgcd(b, a % b, y, x);
y -= (a / b) * x;
} else {
x = 1;
y = 0;
}
return d;
}
ll mod_pow(ll x, ll n, ll mod) {
if (n == 0)
return 1;
ll res = mod_pow(x * x % mod, n / 2, mod);
if (n & 1)
res = res * x % mod;
return res;
}
ll comb(ll a, ll b, ll mod) {
ll mul = 1;
ll div = 1;
rep(i, b) {
mul *= (a - (ll)i);
mul %= mod;
div *= ((ll)i + 1);
div %= mod;
}
mul *= mod_pow(div, mod - 2, mod);
return mul % mod;
}
vector<string> split(const string &str, char delim) {
vector<string> res;
size_t current = 0, found;
while ((found = str.find_first_of(delim, current)) != string::npos) {
res.push_back(string(str, current, found - current));
current = found + 1;
}
res.push_back(string(str, current, str.size() - current));
return res;
}
bool is_kadomatsu(int a, int b, int c) {
if (a == b || a == c || b == c)
return false;
if (a > b && c > b)
return true;
if (a < b && c < b)
return true;
return false;
}
struct UF {
int n;
vi d;
UF() {}
UF(int n) : n(n), d(n, -1) {}
int root(int v) {
if (d[v] < 0)
return v;
return d[v] = root(d[v]);
}
bool same(int a, int b) { return root(a) == root(b); }
bool unite(int x, int y) {
x = root(x);
y = root(y);
if (x == y)
return false;
if (size(x) < size(y))
swap(x, y);
d[x] += d[y];
d[y] = x;
return true;
}
int size(int v) { return -d[root(v)]; }
};
struct Fibonacci {
vvll fib;
Fibonacci() {
fib.resize(2, vll(2));
fib[0][0] = 1;
fib[0][1] = 1;
fib[1][0] = 1;
fib[1][1] = 0;
}
vvll mul(vvll &A, vvll &B) {
vvll C(2, vll(2));
rep(i, 2) {
rep(k, 2) {
rep(j, 2) { C[i][j] = (C[i][j] + A[i][k] * B[k][j]) % MOD; }
}
}
return C;
}
ll pow(ll n) {
vvll A = fib;
vvll B(2, vll(2));
rep(i, 2) { B[i][i] = 1; }
while (n > 0) {
if (n & 1)
B = mul(B, A);
A = mul(A, A);
n >>= 1;
}
return B[1][0];
}
};
vector<int> divisor(int n) {
if (n == 1)
return {};
vi res;
for (int i = 1; i * i <= n; i++) {
if (n % i == 0) {
res.emplace_back(i);
if (i != 1 && i != n / i)
res.emplace_back(n / i);
}
}
return res;
}
struct Bellmanford {
int n;
struct edge {
int from, to, cost;
};
vector<edge> E;
vi d;
Bellmanford(int n) : n(n), d(n) { E.resize(n); }
void add_edge(int x, int y, int cost) {
edge e;
e.from = x;
e.to = y;
e.cost = cost;
E.push_back(e);
}
void shortest_path(int s) {
rep(i, n) d[i] = INF;
d[s] = 0;
while (true) {
bool update = false;
for (auto e : E) {
if (d[e.from] != INF && d[e.to] > d[e.from] + e.cost) {
d[e.to] = d[e.from] + e.cost;
update = true;
}
}
if (!update)
break;
}
}
};
struct Dijkstra {
int n;
struct edge {
int to;
ll cost;
};
vector<vector<edge>> G;
vll d;
Dijkstra(int n) : n(n), d(n) { G.resize(n); }
void add_edge(int x, int y, ll cost) {
edge e;
e.to = y;
e.cost = cost;
G[x].push_back(e);
}
void shortest_path(int s) {
rep(i, n) d[i] = 100000000000000000;
d[s] = 0;
priority_queue<pair<ll, int>, vector<pair<ll, int>>, greater<pair<ll, int>>>
que;
que.push(make_pair(0, s));
while (!que.empty()) {
pii p = que.top();
que.pop();
int v = p.second;
if (d[v] < p.first)
continue;
for (auto e : G[v]) {
if (d[e.to] > d[v] + e.cost) {
d[e.to] = d[v] + e.cost;
que.push(make_pair(d[e.to], e.to));
}
}
}
}
};
struct Segmenttree {
int n;
vector<int> dat;
Segmenttree(int n_) {
n = 1;
while (n < n_)
n *= 2;
dat = vector<int>(2 * n - 1, 0);
}
void add(int idx, ll val) { // 0-indexed
idx += n - 1;
dat[idx] += val;
while (idx > 0) {
idx = (idx - 1) / 2;
dat[idx] += val;
}
}
int query(int a, int b) { return query_seg(a, b, 0, 0, n); }
int query_seg(int a, int b, int k, int l, int r) {
if (r <= a || b <= l)
return 0;
if (a <= l && r <= b)
return dat[k];
else {
return query_seg(a, b, k * 2 + 1, l, (l + r) / 2) +
query_seg(a, b, k * 2 + 2, (l + r) / 2, r);
}
}
};
struct Trie {
Trie *next[26];
Trie() { fill(next, next + 26, (Trie *)0); }
void insert(char *s) {
if (*s == '\0')
return;
if (this->next[*s - 'a'] == NULL) {
this->next[*s - 'a'] = new Trie();
}
this->next[*s - 'a']->insert(s + 1);
}
bool find(char *s) {
if (*s == '\0')
return true;
if (this->next[*s - 'a'] == NULL) {
return false;
}
return this->next[*s - 'a']->find(s + 1);
}
};
struct BIT {
int n;
vi bit;
BIT() {}
BIT(int n) : n(n) { bit.resize(n + 1); }
int sum(int i) {
int s = 0;
while (i > 0) {
s += bit[i];
i -= i & -i;
}
return s;
}
void add(int i, int x) {
while (i <= n) {
bit[i] += x;
i += i & -i;
}
}
};
/*
struct edge { int to, cap, rev; };
vector<edge> G[200005];
int level[200005];
int iter[200005];
void add_edge(int from, int to, int cap) {
G[from].push_back({ to, cap, (int)G[to].size() });
G[to].push_back({ from, 0, (int)G[from].size() - 1 });
}
void fbfs(int s) {
memset(level, -1, sizeof(level));
queue<int> que;
level[s] = 0;
que.push(s);
while (!que.empty()) {
int v = que.front(); que.pop();
for (edge &e : G[v]) {
if (e.cap > 0 && level[e.to] < 0) {
level[e.to] = level[v] + 1;
que.push(e.to);
}
}
}
}
int fdfs(int v, int t, int f) {
if (v == t) return f;
for (edge &e : G[v]) {
if (e.cap > 0 && level[v] < level[e.to]) {
int d = fdfs(e.to, t, min(f, e.cap));
if (d > 0) {
e.cap -= d;
G[e.to][e.rev].cap += d;
return d;
}
}
}
return 0;
}
int max_flow(int s, int t) {
int flow = 0;
for (;;) {
fbfs(s);
if (level[t] < 0) return flow;
memset(iter, 0, sizeof(iter));
int f;
while ((f = fdfs(s, t, INF)) > 0) {
flow += f;
}
}
}
*/
//------------------------
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
string S;
cin >> N >> S;
int all_w = 0;
rep(i, N) {
if (S[i] == '.')
all_w++;
}
int tmp_w = 0;
int ans = 11111111;
rep(i, N) {
int tmp = (i - tmp_w) + (N - i - (N - all_w - (i - tmp_w)));
ans = min(tmp, ans);
if (S[i] == '.')
tmp_w++;
}
ans = min(ans, N - all_w);
P(ans);
return 0;
} | [] | 881,361 | 881,362 | u221758210 | cpp |
p03071 | /* Code by : Suraj (@suraj1611) */
#include <bits/stdc++.h>
#include <string>
using namespace std;
#define ll long long int
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define mx INT_MAX
#define mn INT_MIN
#define md 1000000007
#define pb push_back
#define mp make_pair
#define maxsize 1100005
#define lb cout << endl;
#define endl "\n"
#define F first
#define S second
#define label cout << "hello!" << endl
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
ll power(ll x, ll y) {
ll m = md;
ll ans = 1;
while (y > 0) {
if (y & 1)
ans = (ans * x) % m;
x = (x * x) % m;
y >>= 1;
}
return ans;
}
int main() {
IOS
ll a,
b;
cin >> a >> b;
cout << max(2 * a - 1, max(2 * b - 1, a + b - 1)) << endl;
return 0;
} | /* Code by : Suraj (@suraj1611) */
#include <bits/stdc++.h>
#include <string>
using namespace std;
#define ll long long int
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define mx INT_MAX
#define mn INT_MIN
#define md 1000000007
#define pb push_back
#define mp make_pair
#define maxsize 1100005
#define lb cout << endl;
#define endl "\n"
#define F first
#define S second
#define label cout << "hello!" << endl
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
ll power(ll x, ll y) {
ll m = md;
ll ans = 1;
while (y > 0) {
if (y & 1)
ans = (ans * x) % m;
x = (x * x) % m;
y >>= 1;
}
return ans;
}
int main() {
IOS
ll a,
b;
cin >> a >> b;
cout << max(2 * a - 1, max(2 * b - 1, a + b)) << endl;
return 0;
} | [
"expression.operation.binary.remove"
] | 881,371 | 881,372 | u675396875 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
int coin;
if (A > B) {
coin = A + (A - 1);
} else if (B < A) {
coin = B + (B - 1);
} else {
coin = A + B;
}
cout << coin << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
int coin;
if (A > B) {
coin = A + (A - 1);
} else if (B > A) {
coin = B + (B - 1);
} else {
coin = A + B;
}
cout << coin << endl;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 881,373 | 881,374 | u850516963 | cpp |
p03071 | #include <iostream>
using namespace std;
int main() {
int A, B, ans;
cin >> A >> B;
if (A > B) {
ans = 2 * A - 1;
} else if (B < A) {
ans = 2 * B - 1;
} else {
ans = A + B;
}
cout << ans;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int A, B, ans;
cin >> A >> B;
if (A > B) {
ans = 2 * A - 1;
} else if (B > A) {
ans = 2 * B - 1;
} else {
ans = A + B;
}
cout << ans;
return 0;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 881,381 | 881,382 | u725133562 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b;
if (a == b) {
c = a + b;
} else if (a > (b + 1)) {
c = 2 * a - 1;
} else if (b > (a + 1)) {
c = 2 * b - 1;
}
cout << c << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b;
if (a == b) {
c = a + b;
} else if (a >= (b + 1)) {
c = 2 * a - 1;
} else if (b >= (a + 1)) {
c = 2 * b - 1;
}
cout << c << endl;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 881,385 | 881,386 | u818393512 | cpp |
p03071 | #include <iostream>
int main() {
int a, b;
std::cin >> a >> b;
int sum;
for (int i = 0; i < 2; i++) {
if (a > b) {
sum += a;
a--;
} else if (b > a) {
sum += b;
b--;
} else if (a == b) {
sum += a;
a--;
}
}
std::cout << sum;
return 0;
}
| #include <iostream>
int main() {
int a, b;
std::cin >> a >> b;
int sum = 0;
for (int i = 0; i < 2; i++) {
if (a > b) {
sum += a;
a--;
} else if (b > a) {
sum += b;
b--;
} else if (a == b) {
sum += a;
a--;
}
}
std::cout << sum;
return 0;
}
| [
"variable_declaration.value.change"
] | 881,391 | 881,392 | u195054737 | cpp |
p03071 | #include <iostream>
#include <string>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a == b)
cout << 2 * a << endl;
else if (a > b)
cout << 1 * a - 1 << endl;
else
cout << 2 * b - 1 << endl;
}
| #include <iostream>
#include <string>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a == b)
cout << 2 * a << endl;
else if (a > b)
cout << 2 * a - 1 << endl;
else
cout << 2 * b - 1 << endl;
}
| [
"literal.number.change",
"io.output.change"
] | 881,393 | 881,394 | u661461084 | cpp |
p03071 | #include <iostream>
using namespace std;
int main() {
int a, b, s = 0;
cin >> a >> b;
for (int i = 0; i < 2; i++) {
if (a >= b) {
s += a;
a--;
}
if (a < b) {
s += b;
b--;
}
}
cout << s << endl;
} | #include <iostream>
using namespace std;
int main() {
int a, b, s = 0;
cin >> a >> b;
for (int i = 0; i < 2; i++) {
if (a >= b) {
s += a;
a--;
} else {
s += b;
b--;
}
}
cout << s << endl;
} | [
"control_flow.loop.for.condition.change"
] | 881,400 | 881,401 | u702008643 | cpp |
p03071 | #include <iostream>
using namespace std;
int main() {
int A, B, X;
cin >> A >> B;
if (A > B) {
X = A;
A--;
} else {
X = B;
B--;
}
if (A > B) {
X = A;
A--;
} else {
X = B;
B--;
}
cout << X << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int A, B, X;
cin >> A >> B;
if (A > B) {
X = A;
A--;
} else {
X = B;
B--;
}
if (A > B) {
X += A;
A--;
} else {
X += B;
B--;
}
cout << X << endl;
return 0;
} | [
"assignment.value.change"
] | 881,402 | 881,403 | u573083749 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a == b) {
cout << (a + b) - 1 << endl;
} else {
cout << max(a, b) * 2 - 1 << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a == b) {
cout << (a + b) << endl;
} else {
cout << max(a, b) * 2 - 1 << endl;
}
} | [
"expression.operation.binary.remove"
] | 881,444 | 881,445 | u440248708 | cpp |
p03071 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define ll long long
int main() {
int a, b;
cin >> a >> b;
int m = max(a, b);
if (a == b)
cout << 2 * m;
else
2 * m - 1;
return 0;
}
| #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define ll long long
int main() {
int a, b;
cin >> a >> b;
int m = max(a, b);
if (a == b)
cout << 2 * m;
else
cout << 2 * m - 1;
return 0;
}
| [
"io.output.change"
] | 881,446 | 881,447 | u770161743 | cpp |
p03071 | #include "bits/stdc++.h"
using namespace std;
int main() {
int a, b, c;
cin >> a >> b;
if (a > b)
c = a + a - 1;
else if (b > a)
c = b + b + 1;
else
c = a * 2;
cout << c << endl;
}
| #include "bits/stdc++.h"
using namespace std;
int main() {
int a, b, c;
cin >> a >> b;
if (a > b)
c = a + a - 1;
else if (b > a)
c = b + b - 1;
else
c = a * 2;
cout << c << endl;
}
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 881,450 | 881,451 | u627143908 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
int difference;
//値の差を２以上か以下かを判断
if (A >= B) {
int difference = A - B;
} else if (A < B) {
int difference = B - A;
}
// differenceの値で場合分け
if (difference > 2) {
if (A > B) {
cout << A + A - 1 << endl;
} else if (A < B) {
cout << B + B - 1 << endl;
}
} else if (difference <= 2) {
cout << A + B << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
int difference;
//値の差を２以上か以下かを判断
if (A >= B) {
difference = A - B;
} else if (A < B) {
difference = B - A;
}
// differenceの値で場合分け
if (difference >= 2) {
if (A > B) {
cout << A + A - 1 << endl;
} else if (A < B) {
cout << B + B - 1 << endl;
}
} else if (difference < 2) {
cout << A + B << endl;
}
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 881,456 | 881,457 | u886188867 | cpp |
p03071 | #include <stdio.h>
int main(void) {
int A, B, a;
scanf("%d", &A);
scanf("%d", &B);
a = A - B;
int C, D;
C = A - 1;
D = B - 1;
if (a > 0) {
if (C > B)
printf("%d", A + C);
else
printf("%d", A + B);
}
if (a < 0) {
if (D > A)
printf("%d", B + D);
else
printf("%d", B + A);
}
return 0;
} | #include <stdio.h>
int main(void) {
int A, B, a;
scanf("%d", &A);
scanf("%d", &B);
a = A - B;
int C, D;
C = A - 1;
D = B - 1;
if (a > 0) {
if (C > B)
printf("%d", A + C);
else
printf("%d", A + B);
}
else {
if (D > A)
printf("%d", B + D);
else
printf("%d", B + A);
}
return 0;
} | [] | 881,461 | 881,462 | u956941456 | cpp |
p03071 | #include <iostream>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A == B, A == B + 1, A + 1 == B) {
cout << A + B;
} else if (A > (B + 1)) {
cout << A + (A - 1);
} else if ((A + 1) < B) {
cout << B + (B - 1);
}
}
| #include <iostream>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A == B || A == (B + 1) || (A + 1) == B) {
cout << A + B;
} else if (A > (B + 1)) {
cout << A + (A - 1);
} else if ((A + 1) < B) {
cout << B + (B - 1);
}
}
| [
"control_flow.branch.if.condition.change"
] | 881,465 | 881,466 | u596187345 | cpp |
p03071 | #include "bits/stdc++.h"
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A > B) {
cout << A + A - 1 << endl;
}
if (B > A) {
cout << B + B - 1 << endl;
} else {
cout << A + B << endl;
}
} | #include "bits/stdc++.h"
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A > B) {
cout << 2 * A - 1 << endl;
} else if (B > A) {
cout << 2 * B - 1 << endl;
} else {
cout << A + B << endl;
}
} | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 881,469 | 881,470 | u074003648 | cpp |
p03071 | #include "bits/stdc++.h"
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A > B) {
cout << 2 * A - 1 << endl;
}
if (B > A) {
cout << 2 * B - 1 << endl;
} else {
cout << A + B << endl;
}
} | #include "bits/stdc++.h"
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A > B) {
cout << 2 * A - 1 << endl;
} else if (B > A) {
cout << 2 * B - 1 << endl;
} else {
cout << A + B << endl;
}
} | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 881,471 | 881,470 | u074003648 | cpp |
p03071 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define loop(i, x, n) for (int i = (x); i < (n); i++)
#define all(v) (v).begin(), (v).end()
#define int long long
#define INF 1e9
using namespace std;
template <typename T> void cmin(T &a, T b) { a = min(a, b); }
template <typename T> void cmax(T &a, T b) { a = max(a, b); }
signed main() {
int a, b;
cin >> a >> b;
int ans = 0;
if (a == b)
ans = a + a - 1;
else {
if (a < b) {
ans = b + max(a, b - 1);
} else {
ans = a + max(a - 1, b);
}
}
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define loop(i, x, n) for (int i = (x); i < (n); i++)
#define all(v) (v).begin(), (v).end()
#define int long long
#define INF 1e9
using namespace std;
template <typename T> void cmin(T &a, T b) { a = min(a, b); }
template <typename T> void cmax(T &a, T b) { a = max(a, b); }
signed main() {
int a, b;
cin >> a >> b;
int ans = 0;
if (a == b)
ans = a + b;
else {
if (a < b) {
ans = b + max(a, b - 1);
} else {
ans = a + max(a - 1, b);
}
}
cout << ans << endl;
return 0;
}
| [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 881,474 | 881,475 | u093420647 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a > b) {
cout << 2 * a + 1;
return 0;
} else if (b > a) {
cout << 2 * b + 1;
return 0;
} else {
cout << 2 * a;
return 0;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a > b) {
cout << 2 * a - 1;
return 0;
} else if (b > a) {
cout << 2 * b - 1;
return 0;
} else {
cout << 2 * a;
return 0;
}
}
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 881,498 | 881,499 | u735266303 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A > B) {
cout << A * 2 - 1 << endl;
} else if (A = B) {
cout << A * 2 << endl;
} else {
cout << B * 2 - 1 << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A > B) {
cout << A * 2 - 1 << endl;
} else if (A == B) {
cout << A * 2 << endl;
} else {
cout << B * 2 - 1 << endl;
}
}
| [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 881,510 | 881,511 | u190233776 | cpp |
p03071 | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <queue>
#include <stdio.h>
#include <string>
#include <vector>
const int mod = 1e9 + 7;
const int INF = 1e9;
using namespace std;
typedef long long ll;
int main() {
int a, b;
cin >> a >> b;
if (a > b) {
cout << a + a - 1 << endl;
} else if (b > a) {
cout << b + b - 1 << endl;
} else {
cout << a + b - 1 << endl;
}
} | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <queue>
#include <stdio.h>
#include <string>
#include <vector>
const int mod = 1e9 + 7;
const int INF = 1e9;
using namespace std;
typedef long long ll;
int main() {
int a, b;
cin >> a >> b;
if (a > b) {
cout << a + a - 1 << endl;
} else if (b > a) {
cout << b + b - 1 << endl;
} else {
cout << a + b << endl;
}
} | [
"expression.operation.binary.remove"
] | 881,512 | 881,513 | u883323885 | cpp |
p03071 | #include <stdio.h>
int main(void) {
int a, b;
scanf("%d &d", &a, &b);
int i;
int sum = 0;
for (i = 0; i < 2; i++) {
if (a >= b) {
sum = sum + a;
a = a - 1;
}
else {
sum = sum + b;
b = b - 1;
}
}
printf("%d", sum);
return 0;
} | #include <stdio.h>
int main(void) {
int a, b;
scanf("%d %d", &a, &b);
int i;
int sum = 0;
for (i = 0; i < 2; i++) {
if (a >= b) {
sum = sum + a;
a = a - 1;
}
else {
sum = sum + b;
b = b - 1;
}
}
printf("%d", sum);
return 0;
} | [
"literal.string.change",
"call.arguments.change"
] | 881,517 | 881,518 | u770491983 | cpp |
p03071 | #include <iostream>
using namespace std;
int main() {
int A, B;
int answer = 0;
int count = 0;
cin >> A >> B;
while (count < 2) {
if (A >= B) {
answer += A;
A -= 1;
} else {
answer = B;
B -= 1;
}
count++;
}
cout << answer << endl;
} | #include <iostream>
using namespace std;
int main() {
int A, B;
int answer = 0;
int count = 0;
cin >> A >> B;
while (count < 2) {
if (A >= B) {
answer += A;
A -= 1;
} else {
answer += B;
B -= 1;
}
count++;
}
cout << answer << endl;
} | [
"assignment.value.change"
] | 881,528 | 881,529 | u306716491 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, N;
cin >> A >> B;
if (A < B) {
N = B * (B - 1);
} else if (A > B) {
N = A * (A - 1);
} else {
N = A * B;
}
cout << N << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, N;
cin >> A >> B;
if (A < B) {
N = B + (B - 1);
} else if (A > B) {
N = A + (A - 1);
} else {
N = A + B;
}
cout << N << endl;
} | [
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 881,535 | 881,536 | u025771681 | cpp |
p03071 | #include <iostream>
using namespace std;
int main() {
int A, B, C, D, E;
cin >> A >> B;
C = A + A - 1;
D = A + B - 1;
E = B + B - 1;
if (C >= D && C >= E) {
cout << C;
} else if (D >= E && D >= C) {
cout << D;
} else if (E >= C && E >= D) {
cout << E;
}
} | #include <iostream>
using namespace std;
int main() {
int A, B, C, D, E;
cin >> A >> B;
C = A + A - 1;
D = A + B;
E = B + B - 1;
if (C >= D && C >= E) {
cout << C;
} else if (D >= E && D >= C) {
cout << D;
} else if (E >= C && E >= D) {
cout << E;
}
} | [
"expression.operation.binary.remove"
] | 881,547 | 881,548 | u001858868 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A == B) {
cout << A + B << endl;
} else {
int x;
x = max(A, B);
cout << x * x - 1 << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A == B) {
cout << A + B << endl;
} else {
int x;
x = max(A, B);
cout << x * 2 - 1 << endl;
}
}
| [
"identifier.replace.remove",
"literal.replace.add",
"io.output.change"
] | 881,551 | 881,552 | u003761219 | cpp |
p03071 | #include <bits/stdc++.h>
#include <numeric>
typedef long long Int;
#define rep(i, n) for (Int i = 0; i < n; ++i)
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int A, B;
cin >> A >> B;
int res = 0;
for (int i = 0; i < 2; ++i) {
res = max(A, B);
if (A >= B)
--A;
else
--B;
}
cout << res << "\n";
}
| #include <bits/stdc++.h>
#include <numeric>
typedef long long Int;
#define rep(i, n) for (Int i = 0; i < n; ++i)
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int A, B;
cin >> A >> B;
int res = 0;
for (int i = 0; i < 2; ++i) {
res += max(A, B);
if (A >= B)
--A;
else
--B;
}
cout << res << "\n";
} | [
"assignment.value.change"
] | 881,559 | 881,560 | u980078875 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, s;
cin >> a >> b;
if (a == b) {
cout << 2 * a - 1 << endl;
} else {
s = max(a, b) + max(a - 1, b - 1);
cout << s << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, s;
cin >> a >> b;
if (a == b) {
cout << 2 * a << endl;
} else {
s = max(a, b) + max(a - 1, b - 1);
cout << s << endl;
}
}
| [
"expression.operation.binary.remove"
] | 881,571 | 881,572 | u551813187 | cpp |
p03071 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a - 1 > b) {
cout << a * 2 - 1 << endl;
} else if (b - 1 > a) {
cout << b * 2 - 1 << endl;
} else {
cout << a * 2 << endl;
}
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a - 1 >= b) {
cout << a * 2 - 1 << endl;
} else if (b - 1 >= a) {
cout << b * 2 - 1 << endl;
} else {
cout << a * 2 << endl;
}
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 881,573 | 881,574 | u495284745 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
using ll = long long;
int main() {
int A, B;
cin >> A >> B;
if (A > B)
cout << A + A - 1;
if (B > A)
cout << B + B - 1;
if (A = B)
cout << A + B;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
using ll = long long;
int main() {
int A, B;
cin >> A >> B;
if (A > B)
cout << A + A - 1;
if (B > A)
cout << B + B - 1;
if (A == B)
cout << A + B;
return 0;
} | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 881,578 | 881,579 | u590088474 | cpp |
p03071 | #include <bits/stdc++.h>
#include <string.h>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
void solve() {
int a, b;
int c;
cin >> a >> b;
if (a == b) {
c = 2 * a - 1;
} else {
c = max(a, b) * 2 - 1;
}
cout << c << endl;
}
int main() {
solve();
return 0;
}
| #include <bits/stdc++.h>
#include <string.h>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
void solve() {
int a, b;
int c;
cin >> a >> b;
if (a == b) {
c = 2 * a;
} else {
c = max(a, b) * 2 - 1;
}
cout << c << endl;
}
int main() {
solve();
return 0;
}
| [
"expression.operation.binary.remove"
] | 881,580 | 881,581 | u272496669 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define ALL(v) (v).begin(), (v).end()
#define ios() \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
using ll = long long;
using ull = unsigned long long;
using vi = vector<int>;
using vvi = vector<vi>;
using pii = pair<int, int>;
constexpr ll MOD = 1e9 + 7;
constexpr ll INF = 1LL << 60;
constexpr int Inf = 1e9;
inline int in() {
int x;
cin >> x;
return x;
}
template <typename T> inline void out(const T &x) { cout << x << endl; }
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
// UP = 0;RIGHT = 1; DOWN = 2; LEFT =3;
const int dx[] = {0, 1, 0, -1, 1, -1, 1, -1},
dy[] = {1, 0, -1, 0, 1, -1, -1, 1};
int gcd(int a, int b) {
if (a < b)
gcd(b, a);
int r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
void eratos(bool *isPrime, int max) {
fill(isPrime, isPrime + max, true);
isPrime[0] = false;
isPrime[1] = false;
for (int i = 2; i <= max / i; ++i)
if (isPrime[i])
for (int j = 2; j <= max / i; ++j)
isPrime[i * j] = false;
}
//
signed main() {
ios();
int A, B;
cin >> A >> B;
if (A == B) {
cout << 2 * A << endl;
return 0;
}
cout << 2 * A - 1 << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define ALL(v) (v).begin(), (v).end()
#define ios() \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
using ll = long long;
using ull = unsigned long long;
using vi = vector<int>;
using vvi = vector<vi>;
using pii = pair<int, int>;
constexpr ll MOD = 1e9 + 7;
constexpr ll INF = 1LL << 60;
constexpr int Inf = 1e9;
inline int in() {
int x;
cin >> x;
return x;
}
template <typename T> inline void out(const T &x) { cout << x << endl; }
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
// UP = 0;RIGHT = 1; DOWN = 2; LEFT =3;
const int dx[] = {0, 1, 0, -1, 1, -1, 1, -1},
dy[] = {1, 0, -1, 0, 1, -1, -1, 1};
int gcd(int a, int b) {
if (a < b)
gcd(b, a);
int r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
void eratos(bool *isPrime, int max) {
fill(isPrime, isPrime + max, true);
isPrime[0] = false;
isPrime[1] = false;
for (int i = 2; i <= max / i; ++i)
if (isPrime[i])
for (int j = 2; j <= max / i; ++j)
isPrime[i * j] = false;
}
//
signed main() {
ios();
int A, B;
cin >> A >> B;
if (A == B) {
cout << 2 * A << endl;
return 0;
}
cout << 2 * max(A, B) - 1 << endl;
return 0;
}
| [
"call.add",
"call.arguments.add"
] | 881,582 | 881,583 | u904833081 | cpp |
p03071 | //#include <bits/stdc++.h>
//#include <stdio.h>
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define RFOR(i, a, b) for (int i = (a); i >= (b); i--)
#define LFOR(i, a, b) for (long long int i = (a); i <= (b); i++)
#define LRFOR(i, a, b) for (long long int i = (a); i >= (b); i--)
#define MOD 1000000007
#define INF 1000000000 // 2000000000
#define LINF 1000000000000000000 // 9000000000000000000
#define PI 3.14159265358979
#define MAXI 7500000
using namespace std;
typedef long long int ll;
typedef pair<long long int, long long int> P;
int dy[5] = {0, 0, 1, -1, 0};
int dx[5] = {1, -1, 0, 0, 0};
int main(void) {
int a, b;
int count = 0;
cin >> a >> b;
if (a > b) {
count = a + (a - 1);
} else if (a < b) {
count = b + (b - 1);
} else {
count = a + b;
}
cout << a + b << endl;
} | //#include <bits/stdc++.h>
//#include <stdio.h>
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define RFOR(i, a, b) for (int i = (a); i >= (b); i--)
#define LFOR(i, a, b) for (long long int i = (a); i <= (b); i++)
#define LRFOR(i, a, b) for (long long int i = (a); i >= (b); i--)
#define MOD 1000000007
#define INF 1000000000 // 2000000000
#define LINF 1000000000000000000 // 9000000000000000000
#define PI 3.14159265358979
#define MAXI 7500000
using namespace std;
typedef long long int ll;
typedef pair<long long int, long long int> P;
int dy[5] = {0, 0, 1, -1, 0};
int dx[5] = {1, -1, 0, 0, 0};
int main(void) {
int a, b;
int count = 0;
cin >> a >> b;
if (a > b) {
count = a + (a - 1);
} else if (a < b) {
count = b + (b - 1);
} else {
count = a + b;
}
cout << count << endl;
} | [
"identifier.change",
"io.output.change",
"expression.operation.binary.remove"
] | 881,587 | 881,588 | u057611820 | cpp |
p03071 | #include <iostream>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A > B + 1) {
cout << A + A - 1;
} else if (B > A + 1) {
cout << B + B - 1;
} else {
cout << A + A - 1;
}
} | #include <iostream>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A > B + 1) {
cout << A + A - 1;
} else if (B > A + 1) {
cout << B + B - 1;
} else {
cout << A + B;
}
} | [
"identifier.change",
"io.output.change",
"expression.operation.binary.remove"
] | 881,589 | 881,590 | u107555502 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, x;
cin >> A >> B;
x = 0;
for (int i = 0; i < 2; i++) {
if (A > B) {
x += A;
A--;
} else {
x += B;
A--;
}
}
cout << x << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, x;
cin >> A >> B;
x = 0;
for (int i = 0; i < 2; i++) {
if (A > B) {
x += A;
A--;
} else {
x += B;
B--;
}
}
cout << x << endl;
}
| [
"identifier.change"
] | 881,602 | 881,603 | u201743726 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int coins;
coins = (a + a - 1, a + b);
coins = (coins, b + b - 1);
cout << coins << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int coins;
coins = max(a + a - 1, a + b);
coins = max(coins, b + b - 1);
cout << coins << endl;
} | [
"call.add"
] | 881,611 | 881,612 | u371237856 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int coins;
coins = (a + a - 1, a + b);
coins = (coins, b + b - 1);
cout << coins;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int coins;
coins = max(a + a - 1, a + b);
coins = max(coins, b + b - 1);
cout << coins << endl;
} | [
"call.add",
"io.output.newline.add"
] | 881,613 | 881,612 | u371237856 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
scanf("%d%d", &a, &b);
printf("%d", min(min(2 * a - 1, 2 * b - 1), a + b));
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
scanf("%d%d", &a, &b);
printf("%d", max(max(2 * a - 1, 2 * b - 1), a + b));
} | [
"misc.opposites",
"identifier.change",
"call.function.change",
"call.arguments.change",
"io.output.change"
] | 881,616 | 881,617 | u880379631 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int s = max(a, b);
if (a != b) {
cout << s * (s - 1) << endl;
} else {
cout << s * 2 << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int s = max(a, b);
if (a != b) {
cout << s + (s - 1) << endl;
} else {
cout << s * 2 << endl;
}
}
| [
"expression.operator.arithmetic.change",
"io.output.change"
] | 881,620 | 881,621 | u529813812 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a != b) {
cout << max(a, b) * +(max(a, b) - 1) << endl;
} else {
cout << max(a, b) * 2 << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a != b) {
cout << max(a, b) + (max(a, b) - 1) << endl;
} else {
cout << max(a, b) * 2 << endl;
}
}
| [] | 881,622 | 881,623 | u529813812 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a != b) {
cout << max(a, b) * (max(a, b) - 1) << endl;
} else {
cout << max(a, b) * 2 << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a != b) {
cout << max(a, b) + (max(a, b) - 1) << endl;
} else {
cout << max(a, b) * 2 << endl;
}
}
| [
"expression.operator.arithmetic.change",
"io.output.change"
] | 881,624 | 881,623 | u529813812 | cpp |
p03071 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a > b)
cout << a * 2 - 1;
else if (b > a)
cout << b * 2 - 1;
else
cout << a + b - 1;
}
| #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a > b)
cout << a * 2 - 1;
else if (b > a)
cout << b * 2 - 1;
else
cout << a + b;
}
| [
"expression.operation.binary.remove"
] | 881,637 | 881,638 | u859897687 | cpp |
p03071 | #include <iostream>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
int N = max(A, B);
int ans = N + max(max(A, B) - 1, min(A, B));
cout << N;
}
| #include <iostream>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
int N = max(A, B);
int ans = N + max(max(A, B) - 1, min(A, B));
cout << ans;
}
| [
"identifier.change",
"io.output.change"
] | 881,649 | 881,650 | u166632863 | cpp |
p03071 | #include <iostream>
using namespace std;
int main(void) {
int a, b, c, d;
cin >> a >> b;
c = max(a, b);
d = max(c + c + 1, a + b);
cout << d << endl;
} | #include <iostream>
using namespace std;
int main(void) {
int a, b, c, d;
cin >> a >> b;
c = max(a, b);
d = max(c + c - 1, a + b);
cout << d << endl;
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 881,651 | 881,652 | u125468789 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A > B + 1) {
cout << 2 * A - 1 << endl;
} else if (A == B) {
cout << A + B << endl;
} else {
cout << 2 * B - 1 << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A > B) {
cout << 2 * A - 1 << endl;
} else if (A == B) {
cout << A + B << endl;
} else {
cout << 2 * B - 1 << endl;
}
}
| [
"expression.operation.binary.remove"
] | 881,655 | 881,656 | u584169254 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int ans;
if (a + 1 >= b)
ans = 2 * a - 1;
else if (a == b)
ans = a + b;
else
ans = 2 * b - 1;
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int ans;
if (a - 1 >= b)
ans = 2 * a - 1;
else if (a == b)
ans = a + b;
else
ans = 2 * b - 1;
cout << ans << endl;
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 881,661 | 881,662 | u535810324 | cpp |
p03071 | #include <iostream>
using namespace std;
int main() {
int a, b;
int sum = 0;
cin >> a >> b;
for (int i = 0; i < 2; i++) {
sum += (a > b) ? a : b;
}
cout << sum;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a, b;
int sum = 0;
cin >> a >> b;
for (int i = 0; i < 2; i++) {
sum += (a > b) ? a-- : b--;
}
cout << sum;
return 0;
} | [] | 881,690 | 881,691 | u187491596 | cpp |
p03071 | #include <iostream>
using namespace std;
int main() {
int a, b, sum = 0;
cin >> a >> b;
for (int i = 0; i < 2; i++) {
if (a >= b) {
sum += a;
a--;
} else if (b > a) {
sum += b;
b--;
}
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a, b, sum = 0;
cin >> a >> b;
for (int i = 0; i < 2; i++) {
if (a >= b) {
sum += a;
a--;
} else if (b > a) {
sum += b;
b--;
}
}
cout << sum;
return 0;
} | [] | 881,698 | 881,699 | u902149880 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
int Sum = 0;
if (A > B) {
Sum += A;
if (A - 1 > B) {
Sum += A - 1;
} else {
Sum += B;
}
}
if (A < B) {
Sum += B;
if (A < B - 1) {
Sum += B - 1;
} else {
Sum += A;
}
}
cout << Sum;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
int Sum = 0;
if (A > B) {
Sum += A;
if (A - 1 > B) {
Sum += A - 1;
} else {
Sum += B;
}
}
else {
Sum += B;
if (A < B - 1) {
Sum += B - 1;
} else {
Sum += A;
}
}
cout << Sum;
} | [] | 881,734 | 881,735 | u122284126 | cpp |
p03071 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a + 1 < b) {
cout << a + a - 1 << endl;
} else if (b + 1 < a) {
cout << b + b - 1 << endl;
} else {
cout << a + b << endl;
}
} | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a + 1 < b) {
cout << b + b - 1 << endl;
} else if (b + 1 < a) {
cout << a + a - 1 << endl;
} else {
cout << a + b << endl;
}
} | [
"identifier.change",
"io.output.change"
] | 881,736 | 881,737 | u914086391 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
int score = 0;
if (A >= B + 1) {
score = A + A - 1;
}
if (A + 1 <= B) {
score = B + B - 1;
} else {
score = A + B;
}
cout << score << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
int score = 0;
if (A >= B + 1) {
score = A + A - 1;
} else if (A + 1 <= B) {
score = B + B - 1;
} else {
score = A + B;
}
cout << score << endl;
}
| [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 881,740 | 881,741 | u776056110 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
int score = 0;
if (A > B + 1) {
score = A + A - 1;
}
if (A + 1 < B) {
score = B + B - 1;
} else {
score = A + B;
}
cout << score << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
int score = 0;
if (A >= B + 1) {
score = A + A - 1;
} else if (A + 1 <= B) {
score = B + B - 1;
} else {
score = A + B;
}
cout << score << endl;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 881,742 | 881,741 | u776056110 | cpp |
p03071 | #include <iostream>
using namespace std;
int main(void) {
int a, b, x;
cin >> a, b;
if (a == b) {
x = 2 * a;
} else {
x = 2 * max(a, b) - 1;
}
cout << x;
return 0;
}
| #include <iostream>
using namespace std;
int main(void) {
int a, b, x;
cin >> a >> b;
if (a == b) {
x = 2 * a;
} else {
x = 2 * max(a, b) - 1;
}
cout << x;
return 0;
}
| [] | 881,750 | 881,751 | u579754454 | cpp |
p03071 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a > b) {
int t;
t = a;
a = b;
b = t;
}
if (a == b)
cout << a * 2 << endl;
else if ((b - a) == 2)
cout << b + b - 1 << endl;
else
cout << a + b << endl;
} | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a > b) {
int t;
t = a;
a = b;
b = t;
}
if (a == b)
cout << a * 2 << endl;
else if ((b - a) >= 2)
cout << b + b - 1 << endl;
else
cout << a + b << endl;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 881,752 | 881,753 | u936271647 | cpp |
p03071 | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <memory.h>
#include <numeric>
#include <queue>
#include <random>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#define ll long long
#define ld long double
#define ull unsigned ll
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define pii pair<int, int>
#define vi vector<int>
#define vpii vector<pii>
#define vvi vector<vector<int>>
#define forn(it, from, to) for (int(it) = from; (it) < to; (it)++)
const int Inf = 2 * 1000 * 1000 * 1000;
ll LINF = (ll)4e18;
using namespace std;
#define M_PI 3.14159265358979323846 // pi
int main() {
#ifdef _DEBUG
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#else
// freopen("sum.in", "r", stdin);
// freopen("sum.out", "w", stdout);
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
#endif
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int a, b;
cin >> a >> b;
cout << max({a + a, b + b, a + b});
return 0;
} | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <memory.h>
#include <numeric>
#include <queue>
#include <random>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#define ll long long
#define ld long double
#define ull unsigned ll
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define pii pair<int, int>
#define vi vector<int>
#define vpii vector<pii>
#define vvi vector<vector<int>>
#define forn(it, from, to) for (int(it) = from; (it) < to; (it)++)
const int Inf = 2 * 1000 * 1000 * 1000;
ll LINF = (ll)4e18;
using namespace std;
#define M_PI 3.14159265358979323846 // pi
int main() {
#ifdef _DEBUG
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#else
// freopen("sum.in", "r", stdin);
// freopen("sum.out", "w", stdout);
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
#endif
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int a, b;
cin >> a >> b;
cout << max({a + a - 1, b + b - 1, a + b});
return 0;
} | [
"expression.operation.binary.add"
] | 881,763 | 881,764 | u459760166 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
int abs(int, int);
int main() {
int A, B;
cin >> A >> B;
if (abs(A - B) < 2) {
cout << A + B << endl;
} else {
if (A > B) {
cout << A + (A - 1) << endl;
} else {
cout << B - (B - 1) << endl;
}
}
}
int abs(int a, int b) {
if (a > b) {
return a;
} else {
return b;
}
} | #include <bits/stdc++.h>
using namespace std;
int abs(int, int);
int main() {
int A, B;
cin >> A >> B;
if (abs(A - B) < 2) {
cout << A + B << endl;
} else {
if (A > B) {
cout << A + (A - 1) << endl;
} else {
cout << B + (B - 1) << endl;
}
}
}
int abs(int a, int b) {
if (a > b) {
return a;
} else {
return b;
}
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 881,782 | 881,783 | u900303768 | cpp |
p03071 | #include <iostream> /*入出力関連ヘッダファイル*/
using namespace std; /*標準名前空間を利用する。cinやcoutはこれによって利用可能になる*/
int A;
int B;
int S;
int main(void) {
cin >> A >> B;
cout << max(2 * A - 1, max(A + B - 1, 2 * B - 1)) << endl;
return 0;
}
| #include <iostream> /*入出力関連ヘッダファイル*/
using namespace std; /*標準名前空間を利用する。cinやcoutはこれによって利用可能になる*/
int A;
int B;
int S;
int main(void) {
cin >> A >> B;
cout << max(2 * A - 1, max(A + B, 2 * B - 1)) << endl;
return 0;
}
| [
"expression.operation.binary.remove"
] | 881,804 | 881,805 | u607444339 | cpp |
p03071 | #include <iostream>
using namespace std;
int main(void) {
// Your code here!
int a = 3, b = 3;
cin >> a >> b;
if (a > b) {
if (a * 2 - 1 > a + b) {
cout << a * 2 - 1;
} else {
a + b;
}
} else {
if (b * 2 - 1 > a + b) {
cout << b * 2 - 1;
;
} else {
cout << a + b;
}
}
}
| #include <iostream>
using namespace std;
int main(void) {
// Your code here!
int a = 3, b = 3;
cin >> a >> b;
if (a > b) {
if (a * 2 - 1 >= a + b) {
cout << a * 2 - 1;
} else {
a + b;
}
} else {
if (b * 2 - 1 >= a + b) {
cout << b * 2 - 1;
;
} else {
cout << a + b;
}
}
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 881,810 | 881,811 | u583030172 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A > B) {
cout << 2 * A - 1 << endl;
} else if (A = B) {
cout << A + B << endl;
} else {
cout << 2 * B - 1 << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A > B) {
cout << 2 * A - 1 << endl;
} else if (A == B) {
cout << A + B << endl;
} else {
cout << 2 * B - 1 << endl;
}
return 0;
} | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 881,816 | 881,817 | u485405254 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
int main() {
int x, y;
cin >> x >> y;
if (x == y)
cout << x * 2;
else
cout << max(x, y) * (max(x, y) - 1);
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int x, y;
cin >> x >> y;
if (x == y)
cout << x * 2;
else
cout << max(x, y) + (max(x, y) - 1);
} | [
"expression.operator.arithmetic.change",
"io.output.change"
] | 881,820 | 881,821 | u149471950 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c = 0;
cin >> a >> b;
for (int i = 0; i < 2; i++) {
if (a >= b)
c += a, a -= 1;
else
c += b, c -= 1;
}
cout << c << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c = 0;
cin >> a >> b;
for (int i = 0; i < 2; i++) {
if (a >= b)
c += a, a -= 1;
else
c += b, b -= 1;
}
cout << c << endl;
} | [
"assignment.variable.change",
"identifier.change"
] | 881,822 | 881,823 | u959539771 | cpp |
p03071 | #include <iostream>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A - 2 > B) {
cout << A + A - 1 << endl;
}
else if (B - 2 > A) {
cout << B + B - 1 << endl;
}
else if (A == B || A - 1 == B || B - 1 == A) {
cout << A + B << endl;
}
} | #include <iostream>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A - 2 >= B) {
cout << A + A - 1 << endl;
}
else if (B - 2 >= A) {
cout << B + B - 1 << endl;
}
else if (A == B || A - 1 == B || B - 1 == A) {
cout << A + B << endl;
}
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 881,826 | 881,827 | u842842118 | cpp |
p03071 | #include <iostream>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A - 2 > B) {
cout << A + A - 1 << endl;
}
else if (B - 2 > A) {
cout << B + B - 1 << endl;
}
else if (A == B || A - 1 > B || B - 1 > A) {
cout << A + B << endl;
}
} | #include <iostream>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A - 2 >= B) {
cout << A + A - 1 << endl;
}
else if (B - 2 >= A) {
cout << B + B - 1 << endl;
}
else if (A == B || A - 1 == B || B - 1 == A) {
cout << A + B << endl;
}
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 881,828 | 881,827 | u842842118 | cpp |
p03071 | #include "bits/stdc++.h"
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a == b)
cout << 2 * a;
else
cout << 2 * min(a, b) - 1;
}
| #include "bits/stdc++.h"
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a == b)
cout << 2 * a;
else
cout << 2 * max(a, b) - 1;
}
| [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 881,841 | 881,842 | u400235146 | cpp |
p03071 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int ans = 0;
if (a > b) {
ans += a;
ans += a - 1;
} else if (a == b) {
ans += 2 * a;
} else {
ans += b;
ans += b - 1;
}
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int ans = 0;
if (a > b) {
ans += a;
ans += a - 1;
} else if (a == b) {
ans += 2 * a;
} else {
ans += b;
ans += b - 1;
}
cout << ans;
return 0;
}
| [] | 881,849 | 881,850 | u373111370 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
scanf("%d %d", &a, &b);
int max = 0;
max = a * 2 - 1;
if (max < b * 2 - 1)
max = b * 2 - 1;
if (max < a + b - 1)
max = a + b - 1;
printf("%d", max);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
scanf("%d %d", &a, &b);
int max = 0;
max = a * 2 - 1;
if (max < b * 2 - 1)
max = b * 2 - 1;
if (max < a + b)
max = a + b;
printf("%d", max);
return 0;
} | [
"expression.operation.binary.remove"
] | 881,874 | 881,875 | u035948122 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, est, cnt;
cin >> a >> b;
cnt = 0;
for (int i = 0; i > 2; i++) {
if (a >= b) {
cnt += a;
a = a - 1;
} else {
cnt += b;
b = b - 1;
}
}
cout << cnt << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, est, cnt;
cin >> a >> b;
cnt = 0;
for (int i = 0; i < 2; i++) {
if (a >= b) {
cnt += a;
a = a - 1;
} else {
cnt += b;
b = b - 1;
}
}
cout << cnt << endl;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 881,878 | 881,879 | u756698981 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
int main() {
int x, y, ans;
cin >> x >> y;
ans = x + x - 1;
ans = min(ans, y + y - 1);
ans = min(ans, x + y);
cout << ans;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int x, y, ans;
cin >> x >> y;
ans = x + x - 1;
ans = max(ans, y + y - 1);
ans = max(ans, x + y);
cout << ans;
return 0;
} | [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 881,880 | 881,881 | u919953003 | cpp |
p03071 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <limits>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int A, B;
cin >> A >> B;
if (A == B) {
cout << A + A - 1 << endl;
} else {
int m = max(A, B);
cout << m + m - 1 << endl;
}
return 0;
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <limits>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int A, B;
cin >> A >> B;
if (A == B) {
cout << A + B << endl;
} else {
int m = max(A, B);
cout << m + m - 1 << endl;
}
return 0;
}
| [
"identifier.change",
"io.output.change",
"expression.operation.binary.remove"
] | 881,888 | 881,889 | u273834941 | cpp |
p03071 | #include <bits/stdc++.h>
#include <cstdio>
#include <cstdlib>
using namespace std;
#define FOR(i, s, e) for (int(i) = (s); (i) < (e); (i)++)
int main() {
int A, B;
cin >> A >> B;
int sum = 0;
if (A > B + 1) {
sum = A + A - 1;
}
if (A == B + 1) {
sum = A + B;
}
if (A == B) {
sum = 2 * A - 1;
}
if (B == A + 1) {
sum = B + A;
}
if (B > A + 1) {
sum = B + B - 1;
}
printf("%d\n", sum);
} | #include <bits/stdc++.h>
#include <cstdio>
#include <cstdlib>
using namespace std;
#define FOR(i, s, e) for (int(i) = (s); (i) < (e); (i)++)
int main() {
int A, B;
cin >> A >> B;
int sum = 0;
if (A > B + 1) {
sum = A + A - 1;
}
if (A == B + 1) {
sum = A + B;
}
if (A == B) {
sum = 2 * A;
}
if (B == A + 1) {
sum = B + A;
}
if (B > A + 1) {
sum = B + B - 1;
}
printf("%d\n", sum);
} | [
"expression.operation.binary.remove"
] | 881,898 | 881,899 | u508571192 | cpp |
p03071 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <sstream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
#define range(i, n, m) for (int i = n; i < m; i++)
#define rrange(i, n, m) for (int i = n - 1; i = > m; i--)
#define MOD 1000000007
#define MAX 20000000000
typedef long long int ll;
typedef unsigned long long int ull;
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll A, B;
cin >> A >> B;
ll ret = 0;
if (A == B) {
ret = A * 2;
} else {
ll m = max(A, B);
ret = A + (A - 1);
}
cout << ret << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <sstream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
#define range(i, n, m) for (int i = n; i < m; i++)
#define rrange(i, n, m) for (int i = n - 1; i = > m; i--)
#define MOD 1000000007
#define MAX 20000000000
typedef long long int ll;
typedef unsigned long long int ull;
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll A, B;
cin >> A >> B;
ll ret = 0;
if (A == B) {
ret = A * 2;
} else {
ll m = max(A, B);
ret = m + (m - 1);
}
cout << ret << endl;
return 0;
}
| [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 881,900 | 881,901 | u991974907 | cpp |
p03071 | #include <iostream>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
int ans = 0;
for (int i = 0; i < 1; i++) {
if (A < B) {
ans += B;
B--;
} else {
ans += A;
A--;
}
}
cout << ans << endl;
} | #include <iostream>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
int ans = 0;
for (int i = 0; i < 2; i++) {
if (A < B) {
ans += B;
B--;
} else {
ans += A;
A--;
}
}
cout << ans << endl;
} | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 881,902 | 881,903 | u963055157 | cpp |
p03071 | #define _CRT_SECURE_NO_WARNINGS
/* include ***********************/
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
/* define *************************/
// for
#define REP(i, n) for (int i = 0, i##_len = (int)(n); i < i##_len; i++)
#define REPS(i, n) for (int i = 1, i##_len = (int)(n); i <= i##_len; i++)
#define RREP(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define RREPS(i, n) for (int i = (int)(n); i > 0; i--)
#define FOR(i, s, n) \
for (int i = (int)(s), i##_len = (int)(n); i < i##_len; i++)
#define RFOR(i, s, n) \
for (int i = (int)(s)-1, i##_len = (int)(n); i >= i##_len; i--)
// printf
#define PRINTD(d) printf("%d\n", (d))
#define PRINTL(d) printf("%lld\n", (d))
// memset
#define m0(s) memset(s, 0, sizeof(s))
#define ml(s) memset(s, 63, sizeof(s))
#define fill(s, c) memset(s, c, sizeof(s))
#define INF 1e9
#define MOD 1000000007
typedef long long ll;
typedef unsigned long long ull;
int diff[4][2] = {
{0, -1},
{-1, 0},
{1, 0},
{0, 1},
};
//今回の変数
ll d[1000000];
ll e[3000000];
int Min(int a, int b) { return (a) < (b) ? (a) : (b); }
int Max(int a, int b) { return (a) > (b) ? (a) : (b); }
ll Minl(ll a, ll b) { return (a) < (b) ? (a) : (b); }
ll Maxl(ll a, ll b) { return (a) > (b) ? (a) : (b); }
int main() {
int a, b;
scanf("%d%d", &a, &b);
if (a > b) {
PRINTD(a * (a - 1));
} else if (a < b) {
PRINTD(b * (b - 1));
} else {
PRINTD(a * b);
}
} | #define _CRT_SECURE_NO_WARNINGS
/* include ***********************/
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
/* define *************************/
// for
#define REP(i, n) for (int i = 0, i##_len = (int)(n); i < i##_len; i++)
#define REPS(i, n) for (int i = 1, i##_len = (int)(n); i <= i##_len; i++)
#define RREP(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define RREPS(i, n) for (int i = (int)(n); i > 0; i--)
#define FOR(i, s, n) \
for (int i = (int)(s), i##_len = (int)(n); i < i##_len; i++)
#define RFOR(i, s, n) \
for (int i = (int)(s)-1, i##_len = (int)(n); i >= i##_len; i--)
// printf
#define PRINTD(d) printf("%d\n", (d))
#define PRINTL(d) printf("%lld\n", (d))
// memset
#define m0(s) memset(s, 0, sizeof(s))
#define ml(s) memset(s, 63, sizeof(s))
#define fill(s, c) memset(s, c, sizeof(s))
#define INF 1e9
#define MOD 1000000007
typedef long long ll;
typedef unsigned long long ull;
int diff[4][2] = {
{0, -1},
{-1, 0},
{1, 0},
{0, 1},
};
//今回の変数
ll d[1000000];
ll e[3000000];
int Min(int a, int b) { return (a) < (b) ? (a) : (b); }
int Max(int a, int b) { return (a) > (b) ? (a) : (b); }
ll Minl(ll a, ll b) { return (a) < (b) ? (a) : (b); }
ll Maxl(ll a, ll b) { return (a) > (b) ? (a) : (b); }
int main() {
int a, b;
scanf("%d%d", &a, &b);
if (a > b) {
PRINTD(a + (a - 1));
} else if (a < b) {
PRINTD(b + (b - 1));
} else {
PRINTD(a + b);
}
} | [
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 881,904 | 881,905 | u539339654 | cpp |
p03071 | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
using namespace std;
int main() {
int A = 0, B = 0;
cin >> A >> B;
int sum1 = 0, sum2 = 0, sum3 = 0;
sum1 = A + A - 1;
sum2 = B + B - 1;
sum3 = A + B;
int a[3];
a[1] = sum1;
a[2] = sum2;
a[3] = sum3;
sort(a, a + 3);
cout << a[3];
// system("pause");
return 0;
} | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
using namespace std;
int main() {
int A = 0, B = 0;
cin >> A >> B;
int sum1 = 0, sum2 = 0, sum3 = 0;
sum1 = A + A - 1;
sum2 = B + B - 1;
sum3 = A + B;
int a[3];
a[0] = sum1;
a[1] = sum2;
a[2] = sum3;
sort(a, a + 3);
cout << a[2];
// system("pause");
return 0;
} | [
"literal.number.change",
"assignment.variable.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 881,910 | 881,911 | u647622685 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int ans = max({a + a - 1, a + b - 1, b + b - 1});
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int ans = max({a + a - 1, a + b, b + b - 1});
cout << ans << endl;
return 0;
}
| [
"expression.operation.binary.remove"
] | 881,912 | 881,913 | u143383345 | cpp |
p03071 | #include "bits/stdc++.h"
#define en "\n"
using namespace std;
const int M = 1e5 + 100;
int main() {
int a, b;
cin >> a >> b;
if (2 * max(a, b) - 1 >= a + b - 1)
cout << 2 * max(a, b) - 1 << en;
else
cout << a + b - 1 << en;
return 0;
}
| #include "bits/stdc++.h"
#define en "\n"
using namespace std;
const int M = 1e5 + 100;
int main() {
int a, b;
cin >> a >> b;
if (2 * max(a, b) - 1 >= a + b)
cout << 2 * max(a, b) - 1 << en;
else
cout << a + b << en;
return 0;
}
| [
"expression.operation.binary.remove"
] | 881,914 | 881,915 | u399616977 | cpp |
p03071 | #include "bits/stdc++.h"
#define en "\n"
using namespace std;
const int M = 1e5 + 100;
int main() {
int a, b;
cin >> a >> b;
if (2 * max(a, b) - 1 >= a + b)
cout << 2 * max(a, b) - 1 << en;
else
cout << a + b - 1 << en;
return 0;
}
| #include "bits/stdc++.h"
#define en "\n"
using namespace std;
const int M = 1e5 + 100;
int main() {
int a, b;
cin >> a >> b;
if (2 * max(a, b) - 1 >= a + b)
cout << 2 * max(a, b) - 1 << en;
else
cout << a + b << en;
return 0;
}
| [
"expression.operation.binary.remove"
] | 881,916 | 881,915 | u399616977 | cpp |
p03071 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << max(2 * a, max(2 * b, a + b)) << endl;
}
| #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << max(2 * a - 1, max(2 * b - 1, a + b)) << endl;
}
| [
"expression.operation.binary.add"
] | 881,925 | 881,926 | u041282550 | cpp |
p03071 | #include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int mod = 1e9 + 7;
int main() {
int a, b;
cin >> a >> b;
cout << min({2 * a - 1, 2 * b - 1, a + b}) << endl;
return 0;
}
| #include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int mod = 1e9 + 7;
int main() {
int a, b;
cin >> a >> b;
cout << max({2 * a - 1, 2 * b - 1, a + b}) << endl;
return 0;
}
| [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 881,927 | 881,928 | u050138914 | cpp |
p03071 | #include <iostream>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A != B)
cout << max(A, B) * 2 - 1;
else
cout << A * 2 - 1;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A != B)
cout << max(A, B) * 2 - 1;
else
cout << A * 2;
return 0;
}
| [
"expression.operation.binary.remove"
] | 881,933 | 881,934 | u261245192 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A;
int B;
cin >> A >> B;
if (A = B) {
cout << A + B << endl;
}
if (A - B == 1) {
cout << A + B << endl;
}
if (B - A == 1) {
cout << A + B << endl;
}
if (A - B > 1) {
cout << A + A - 1 << endl;
}
if (B - A > 1) {
cout << B + B - 1 << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A;
int B;
cin >> A >> B;
if (A == B) {
cout << A + B << endl;
}
if (A - B == 1) {
cout << A + B << endl;
}
if (B - A == 1) {
cout << A + B << endl;
}
if (A - B > 1) {
cout << A + A - 1 << endl;
}
if (B - A > 1) {
cout << B + B - 1 << endl;
}
} | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 881,939 | 881,940 | u162509656 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
int point = 0;
cin >> a >> b;
if (a > b) {
point += a;
a = a - 1;
} else {
point += b;
b = b - 1;
}
if (a < b) {
point += a;
a = a - 1;
} else {
point += b;
b = b - 1;
}
cout << point << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
int point = 0;
cin >> a >> b;
if (a > b) {
point += a;
a = a - 1;
} else {
point += b;
b = b - 1;
}
if (a > b) {
point += a;
a = a - 1;
} else {
point += b;
b = b - 1;
}
cout << point << endl;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 881,941 | 881,942 | u778484787 | cpp |
p03071 | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (abs(a) - abs(b) >= 2)
cout << max(a, b) + max(a, b) - 1 << endl;
else
cout << a + b << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (abs(a - b) >= 1)
cout << max(a, b) + max(a, b) - 1 << endl;
else
cout << a + b << endl;
return 0;
} | [
"control_flow.branch.if.condition.change",
"call.remove",
"literal.number.change"
] | 881,950 | 881,951 | u117734686 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// 端点を間違えないように気をつけること!
#define FOR(i, m, n) for (ll i = (ll)(m); i <= (ll)(n); i++)
#define RFOR(i, m, n) for (ll i = (ll)(m); i >= (ll)(n); i--)
// 割り算をするときは自作関数syou,amariを使うこと!
// 入力は変数を宣言した直後に入れること!
int main() {
ll A, B;
cin >> A >> B;
cout << max({A * (A - 1), A * B, B * (B - 1)}) << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// 端点を間違えないように気をつけること!
#define FOR(i, m, n) for (ll i = (ll)(m); i <= (ll)(n); i++)
#define RFOR(i, m, n) for (ll i = (ll)(m); i >= (ll)(n); i--)
// 割り算をするときは自作関数syou,amariを使うこと!
// 入力は変数を宣言した直後に入れること!
int main() {
ll A, B;
cin >> A >> B;
cout << max({A + (A - 1), A + B, B + (B - 1)}) << endl;
} | [
"expression.operator.arithmetic.change",
"io.output.change"
] | 881,952 | 881,953 | u642467876 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.