problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k | fixed_code stringlengths 12 526k | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M | fixed_submission_id int64 2 1.54M | user_id stringlengths 10 10 | language stringclasses 8
values |
|---|---|---|---|---|---|---|---|
p03071 | #include <bits/stdc++.h>
using namespace std;
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;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
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;
}
return 0;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 881,954 | 881,955 | u106782100 | cpp |
p03071 | #include <iostream>
using namespace std;
int main() {
int A, B, a;
cin >> A >> B;
if (A > B) {
a = A + A - 1;
cout << a << endl;
}
if (A < B) {
a = B + B - 1;
cout << a << endl;
}
if (A == B) {
a = B + A - 1;
cout << a << endl;
}
}
| #include <iostream>
using namespace std;
int main() {
int A, B, a;
cin >> A >> B;
if (A > B) {
a = A + A - 1;
cout << a << endl;
}
if (A < B) {
a = B + B - 1;
cout << a << endl;
}
if (A == B) {
a = B + B;
cout << a << endl;
}
}
| [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 881,964 | 881,965 | u788063708 | cpp |
p03071 | #include <iostream>
using namespace std;
int main() {
int A, B, a;
cin >> A >> B;
if (A > B) {
a = A + A - 1;
cout << a << endl;
}
if (A < B) {
a = B + B - 1;
cout << a << endl;
}
if (A == B) {
a = B + B - 1;
cout << a << endl;
}
}
| #include <iostream>
using namespace std;
int main() {
int A, B, a;
cin >> A >> B;
if (A > B) {
a = A + A - 1;
cout << a << endl;
}
if (A < B) {
a = B + B - 1;
cout << a << endl;
}
if (A == B) {
a = B + B;
cout << a << endl;
}
}
| [
"expression.operation.binary.remove"
] | 881,966 | 881,965 | u788063708 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, ans;
cin >> a >> b;
ans = 0;
for (int i = 0; i < 2; i++) {
if (a < b) {
ans += a;
a--;
} else {
ans += b;
b--;
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, ans;
cin >> a >> b;
ans = 0;
for (int i = 0; i < 2; i++) {
if (a > b) {
ans += a;
a--;
} else {
ans += b;
b--;
}
}
cout << ans << endl;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 881,969 | 881,970 | u270626454 | cpp |
p03071 | #include <iostream>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
int main(void) {
int a, b, result = 0;
cin >> a >> b;
rep(i, 2) {
if (a > b) {
result += a;
a--;
} else {
result += b;
b--;
}
cout << result;
}
return 0;
} | #include <iostream>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
int main(void) {
int a, b, result = 0;
cin >> a >> b;
rep(i, 2) {
if (a > b) {
result += a;
a--;
} else {
result += b;
b--;
}
}
cout << result;
return 0;
} | [] | 881,979 | 881,980 | u130128796 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
inline ll read() {
ll x = 0, f = 1;
char ch = getchar();
for (; ch < '0' || ch > '9'; ch = getchar())
if (ch == '-')
f = -f;
for (; ch >= '0' && ch <= '9'; ch = getchar())
x = x * 10 + ch - '0';
return x * f;
}
inline void chkmin... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
inline ll read() {
ll x = 0, f = 1;
char ch = getchar();
for (; ch < '0' || ch > '9'; ch = getchar())
if (ch == '-')
f = -f;
for (; ch >= '0' && ch <= '9'; ch = getchar())
x = x * 10 + ch - '0';
return x * f;
}
inline void chkmin... | [
"expression.operation.binary.add"
] | 881,988 | 881,989 | u900306103 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
long long n, m, ans;
signed main() {
cin >> n >> m;
if (n != m)
cout << n * 2 - 1 << endl;
else
cout << m * 2 << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
long long n, m, ans;
signed main() {
cin >> n >> m;
if (n != m)
cout << max(n, m) * 2 - 1 << endl;
else
cout << m * 2 << endl;
return 0;
} | [
"call.add",
"call.arguments.add"
] | 881,994 | 881,995 | u524675980 | cpp |
p03071 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int a, b, res;
cin >> a >> b;
res = max(a, b);
if (a == res) {
a--;
} else {
b--;
}
res + max(a, b);
cout << res << endl;
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int a, b, res;
cin >> a >> b;
res = max(a, b);
if (a == res) {
a--;
} else {
b--;
}
res += max(a, b);
cout << res << endl;
} | [
"assignment.compound.arithmetic.replace.add",
"expression.operator.arithmetic.replace.remove",
"expression.operation.binary.change"
] | 881,998 | 881,999 | u946304145 | cpp |
p03071 | #pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse2")
#include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <i... | #pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse2")
#include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <i... | [
"call.add"
] | 882,007 | 882,008 | u240509821 | cpp |
p03071 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int x, y, z, w;
x = a * (a - 1), y = a * b, z = b * (b - 1);
w = max({x, y, z});
cout << w << endl;
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int x, y, z, w;
x = a + (a - 1), y = a + b, z = b + (b - 1);
w = max({x, y, z});
cout << w << endl;
} | [
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 882,009 | 882,010 | u384124931 | cpp |
p03071 | #include <iostream>
using namespace std;
int main() {
int a, b, c, d, e;
cin >> a >> b;
c = a + (a - 1);
d = b + (b - 1);
e = a + b;
if (e > d && e > c) {
cout << e << endl;
} else if (c > d && c > e) {
cout << c << endl;
} else if (d > e && d > c) {
cout << d << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a, b, c, d, e;
cin >> a >> b;
c = a + (a - 1);
d = b + (b - 1);
e = a + b;
if (e >= d && e >= c) {
cout << e << endl;
} else if (c >= d && c >= e) {
cout << c << endl;
} else if (d >= e && d >= c) {
cout << d << endl;
}
return 0;
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 882,013 | 882,014 | u203045601 | cpp |
p03071 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int a, b;
int ans = 0;
cin >> a >> b;
if (a > b)
ans = 2 * a - 1;
else if (b < a)
ans = 2 * b - 1;
else if (b == a)
ans = a + b;
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int a, b;
int ans = 0;
cin >> a >> b;
if (a > b)
ans = 2 * a - 1;
else if (a < b)
ans = 2 * b - 1;
else if (b == a)
ans = a + b;
cout << ans << endl;
return 0;
} | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 882,023 | 882,024 | u227764848 | cpp |
p03071 | #include <algorithm>
#include <iostream>
int main(void) {
int a, b, c;
std::cin >> a, b;
c = std::max(a, b);
c += std::max(c - 1, std::min(a, b));
std::cout << c << std::endl;
} | #include <algorithm>
#include <iostream>
int main(void) {
int a, b, c;
std::cin >> a >> b;
c = std::max(a, b);
c += std::max(c - 1, std::min(a, b));
std::cout << c << std::endl;
} | [] | 882,025 | 882,026 | u464397170 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int a, b;
cin >> a >> b;
int ans = max(a, b);
if (a > b) {
ans += max(a - 1, b);
} else {
ans += max(a, b - 1);
cout << ans << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main(void) {
int a, b;
cin >> a >> b;
int ans = max(a, b);
if (a > b) {
ans += max(a - 1, b);
} else {
ans += max(a, b - 1);
}
cout << ans << endl;
}
| [] | 882,031 | 882,032 | u464540027 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
int n = 0;
cin >> a >> b;
for (int i = 0; i < 1; i++) {
if (a >= b) {
n += a;
a = a - 1;
} else {
n += b;
b = b - 1;
}
}
cout << n << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
int n = 0;
cin >> a >> b;
for (int i = 0; i < 2; i++) {
if (a >= b) {
n += a;
a = a - 1;
} else {
n += b;
b = b - 1;
}
}
cout << n << endl;
} | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 882,033 | 882,034 | u745852541 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, n;
cin >> a >> b;
for (int i = 0; i < 1; i++) {
if (a >= b) {
n += a;
a = a - 1;
} else {
n += b;
b = b - 1;
}
}
cout << n << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
int n = 0;
cin >> a >> b;
for (int i = 0; i < 2; i++) {
if (a >= b) {
n += a;
a = a - 1;
} else {
n += b;
b = b - 1;
}
}
cout << n << endl;
} | [
"variable_declaration.value.change",
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 882,035 | 882,034 | u745852541 | cpp |
p03071 | #include <algorithm>
#include <iostream>
int my_abs(int a) { return a < 0 ? -1 : a; }
int main() {
std::cin.tie(nullptr);
std::ios::sync_with_stdio(false);
int A, B;
std::cin >> A >> B;
int ans = 0;
if (my_abs(A - B) >= 2) {
ans = std::max(A, B) * 2 - 1;
} else {
ans = A + B;
}
std::cout <... | #include <algorithm>
#include <iostream>
#include <vector>
int my_abs(int a) { return a < 0 ? -a : a; }
int main() {
std::cin.tie(nullptr);
std::ios::sync_with_stdio(false);
// int N; std::cin >> N;
// std::vector<int> H(N); for (int i = 0; i < H.size(); i++)std::cin >>
// H.at(i); bool flag = true;//見れる
... | [
"import.add",
"identifier.replace.add",
"literal.replace.remove",
"function.return_value.change"
] | 882,039 | 882,040 | u575279726 | cpp |
p03071 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
map<int, int> mp;
map<int, int> m... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
map<int, int> mp;
map<int, int> m... | [] | 882,044 | 882,045 | u154672915 | cpp |
p03071 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 1; i < n; i++)
#define rept(i, a, b)... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 1; i < n; i++)
#define rept(i, a, b)... | [
"literal.number.change",
"variable_declaration.value.change"
] | 882,052 | 882,053 | u569041543 | cpp |
p03071 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 1; i < n; i++)
#define rept(i, a, b)... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 1; i < n; i++)
#define rept(i, a, b)... | [
"literal.number.change",
"variable_declaration.value.change",
"function.return_value.change"
] | 882,054 | 882,053 | u569041543 | cpp |
p03071 | #include <algorithm>
#include <iostream>
using namespace std;
int main(void) {
int n, m;
cin >> n >> m;
int res = n * 2 - 1;
res = max(res, n + m);
res = max(res, n * 2 - 1);
cout << res << endl;
return 0;
} | #include <algorithm>
#include <iostream>
using namespace std;
int main(void) {
int n, m;
cin >> n >> m;
int res = n * 2 - 1;
res = max(res, n + m);
res = max(res, m * 2 - 1);
cout << res << endl;
return 0;
} | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 882,055 | 882,056 | u809889010 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
int num_coins;
if (A > B) {
num_coins = A + A - 1;
} else if (B < A) {
num_coins = B + B - 1;
} else {
num_coins = A + B;
}
cout << num_coins << "\n";
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
int num_coins;
if (A > B) {
num_coins = A + A - 1;
} else if (B > A) {
num_coins = B + B - 1;
} else {
num_coins = A + B;
}
cout << num_coins << "\n";
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 882,057 | 882,058 | u069838609 | cpp |
p03071 | #include <algorithm>
#include <iostream>
using namespace std;
int n, m;
int main() {
// freopen("in.txt", "r", stdin);
int a, b;
while (~scanf("%d%d", &a, &b)) {
int ans = a + b;
ans = max(ans, a + a);
ans = max(ans, b + b);
printf("%d\n", ans);
}
return 0;
} | #include <algorithm>
#include <iostream>
using namespace std;
int n, m;
int main() {
// freopen("in.txt", "r", stdin);
int a, b;
while (~scanf("%d%d", &a, &b)) {
int ans = a + b;
ans = max(ans, a + a - 1);
ans = max(ans, b + b - 1);
printf("%d\n", ans);
}
return 0;
}
| [
"assignment.change"
] | 882,061 | 882,062 | u598672545 | cpp |
p03071 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int ans[3];
ans[0] = a + a - 1;
ans[1] = a + b;
ans[2] = b + b - 2;
sort(ans, ans + 3);
cout << ans[2] << endl;
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int ans[3];
ans[0] = a + a - 1;
ans[1] = a + b;
ans[2] = b + b - 1;
sort(ans, ans + 3);
cout << ans[2] << endl;
} | [
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 882,065 | 882,066 | u141938981 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
#define INF 1000000007
#define LINF 1000000000000000007
typedef long long i64;
typedef pair<i64, i64> P;
int a, b;
int main() {
cin >> a >> b;
if (a == b)
cout << a * 2 << endl;
cout << max(a, b) * 2 - 1 << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define INF 1000000007
#define LINF 1000000000000000007
typedef long long i64;
typedef pair<i64, i64> P;
int a, b;
int main() {
cin >> a >> b;
if (a == b)
cout << a + b << endl;
else
cout << max(a, b) * 2 - 1 << endl;
return 0;
} | [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 882,076 | 882,077 | u414947284 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, sum;
cin >> A >> B;
if (A - 1 > B) {
sum = 2 * A - 1;
} else if (A - 1 == B) {
sum = A + B;
} else if (B - 1 > A) {
sum = 2 * B - 1;
} else if (B - 1 == A) {
sum = A + B;
} else if (A = B) {
sum = A + B - 1;
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, sum;
cin >> A >> B;
if (A - 1 > B) {
sum = 2 * A - 1;
} else if (A - 1 == B) {
sum = A + B;
} else if (B - 1 > A) {
sum = 2 * B - 1;
} else if (B - 1 == A) {
sum = A + B;
} else if (A = B) {
sum = A + B;
}
cout... | [
"expression.operation.binary.remove"
] | 882,080 | 882,081 | u291603831 | cpp |
p03071 | #include <iostream>
#include <string>
using namespace std;
int main() {
int a;
int b;
cin >> a;
cin >> b;
int result;
if (a > b) {
result = 2 * a - 1;
} else if (a == b) {
result = 2 * a;
} else {
result = 2 * b;
}
cout << result << endl;
return 0;
}
| #include <iostream>
#include <string>
using namespace std;
int main() {
int a;
int b;
cin >> a;
cin >> b;
int result;
if (a > b) {
result = 2 * a - 1;
} else if (a == b) {
result = 2 * a;
} else {
result = 2 * b - 1;
}
cout << result << endl;
return 0;
}
| [
"assignment.change"
] | 882,088 | 882,089 | u054322298 | 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);
int ansl = max(ans, A + (B - 1));
cout << ansl << endl;
}
| #include "bits/stdc++.h"
using namespace std;
int main() {
int A, B;
cin >> A >> B;
int ans = max(A + (A - 1), A + B);
int ansl = max(ans, B + (B - 1));
cout << ansl << endl;
}
| [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 882,092 | 882,093 | u389766217 | 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);
int ansl = max(ans, A * (B - 1));
cout << ansl << endl;
}
| #include "bits/stdc++.h"
using namespace std;
int main() {
int A, B;
cin >> A >> B;
int ans = max(A + (A - 1), A + B);
int ansl = max(ans, B + (B - 1));
cout << ansl << endl;
}
| [
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 882,094 | 882,093 | u389766217 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A >= B && A - 1 >= B)
cout << A + A - 1 << endl;
else if (A > B && A - 1 < B)
cout << A + B << endl;
else if (A <= B && A <= B - 1)
cout << B + B - 1 << endl;
else if (A < B && A > B - 1)
cout << B + A <<... | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A >= B && A - 1 >= B)
cout << A + A - 1 << endl;
else if (A >= B && A - 1 < B)
cout << A + B << endl;
else if (A <= B && A <= B - 1)
cout << B + B - 1 << endl;
else if (A <= B && A > B - 1)
cout << B + A ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 882,097 | 882,098 | u066647962 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A > B && A - 1 >= B)
cout << A + A - 1 << endl;
else if (A > B && A - 1 < B)
cout << A + B << endl;
else if (A < B && A <= B - 1)
cout << B + B - 1 << endl;
else if (A < B && A > B - 1)
cout << B + A << e... | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A >= B && A - 1 >= B)
cout << A + A - 1 << endl;
else if (A >= B && A - 1 < B)
cout << A + B << endl;
else if (A <= B && A <= B - 1)
cout << B + B - 1 << endl;
else if (A <= B && A > B - 1)
cout << B + A ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 882,099 | 882,098 | u066647962 | 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;
} else if (A - 1 > B) {
cout << 2 * A - 1 << endl;
} else if (B > A - 1) {
cout << 2 * 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;
} else if (A > B) {
cout << 2 * A - 1 << endl;
} else if (B > A) {
cout << 2 * B - 1 << endl;
}
}
| [
"expression.operation.binary.remove"
] | 882,102 | 882,103 | u036531287 | 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;
} else if (A - 1 > B) {
cout << 2 * A - 1 << endl;
} else if (B > A - 1) {
cout << 2 * 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;
} else if (A > B) {
cout << 2 * A - 1 << endl;
} else if (B > A) {
cout << 2 * B - 1 << endl;
}
}
| [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo",
"expression.operation.binary.remove"
] | 882,105 | 882,103 | u036531287 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
int s = 0;
cin >> a >> b;
if (a > b) {
s = a + (a - 1);
} else if (a = b) {
s = 2 * a;
} else if (a < b) {
s = b + (b - 1);
}
cout << s << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
int s = 0;
cin >> a >> b;
if (a > b) {
s = a + (a - 1);
} else if (a == b) {
s = 2 * a;
} else if (a < b) {
s = b + (b - 1);
}
cout << s << endl;
}
| [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 882,106 | 882,107 | u636186470 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
/* #pragma */
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
/*alias*/
#define y0 y3487465
#define y1 y8687969
#define j0 j1347829
#define j1 j234892
#define next asdnext
#define prev asdprev
#define itn int... | #include <bits/stdc++.h>
using namespace std;
/* #pragma */
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
/*alias*/
#define y0 y3487465
#define y1 y8687969
#define j0 j1347829
#define j1 j234892
#define next asdnext
#define prev asdprev
#define itn int... | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 882,117 | 882,118 | u509680664 | cpp |
p03071 | #include <iostream>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A + B > A + A - 1 && A + B > B + B - 1) {
cout << A + B << endl;
} else if (A + B <= B + B - 1 && A + A - 1 <= B + B - 1) {
cout << B + B - 1 << endl;
} else if (A + B < A + A - 1 && A + A - 1 > B + B - 1) {
cout... | #include <iostream>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A + B >= A + A - 1 && A + B >= B + B - 1) {
cout << A + B << endl;
} else if (A + B <= B + B - 1 && A + A - 1 <= B + B - 1) {
cout << B + B - 1 << endl;
} else if (A + B <= A + A - 1 && A + A - 1 >= B + B - 1) {
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 882,119 | 882,120 | u899108527 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
int a, b;
int main() {
cin >> a >> b;
if (a < b)
swap(a, b);
if (a > b + 1)
cout << a * 2;
else if (a == b + 1)
cout << a + b;
else
cout << b * 2;
} | #include <bits/stdc++.h>
using namespace std;
int a, b;
int main() {
cin >> a >> b;
if (a < b)
swap(a, b);
if (a > b + 1)
cout << a * 2 - 1;
else if (a == b + 1)
cout << a + b;
else
cout << b * 2;
} | [
"expression.operation.binary.add"
] | 882,129 | 882,130 | u924638591 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, ans;
ans = 0;
cin >> A >> B;
for (int i = 0; i < 2; i++) {
if (A <= B) {
ans += B;
B--;
}
if (A > B) {
ans += A;
A--;
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, ans;
ans = 0;
cin >> A >> B;
for (int i = 0; i < 2; i++) {
if (A <= B) {
ans += B;
B--;
} else if (A > B) {
ans += A;
A--;
}
}
cout << ans << endl;
}
| [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 882,133 | 882,134 | u222866518 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, koin = 0;
cin >> a >> b;
for (int i = 1; i <= 2; i++) {
if (a > b) {
koin += a;
a--;
} else if (a < b) {
koin += b;
b--;
}
}
cout << koin << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, koin = 0;
cin >> a >> b;
for (int i = 1; i <= 2; i++) {
if (a >= b) {
koin += a;
a--;
} else if (a <= b) {
koin += b;
b--;
}
}
cout << koin << endl;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 882,140 | 882,141 | u437324130 | 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 if (a > b + 1)
cout << a + a - 1 << endl;
else
cout << b + b - 1 << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a == b)
cout << a + b << endl;
else if (a >= b + 1)
cout << a + a - 1 << endl;
else
cout << b + b - 1 << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 882,157 | 882,158 | u418568023 | cpp |
p03071 | #include <iostream>
#include <string>
using namespace std;
int main() {
int A, B;
cin >> A;
cin >> B;
int out = 0;
if (A > B) {
out += A;
A -= 1;
} else {
out += B;
B - +1;
}
if (A > B) {
out += A;
} else {
out += B;
}
cout << out << endl;
return 0;
}
|
#include <iostream>
#include <string>
using namespace std;
int main() {
int A, B;
cin >> A;
cin >> B;
int out = 0;
if (A > B) {
out += A;
A -= 1;
} else {
out += B;
B -= 1;
}
if (A > B) {
out += A;
} else {
out += B;
}
cout << out << endl;
return 0;
}
| [
"assignment.compound.arithmetic.replace.add",
"expression.operator.arithmetic.replace.remove",
"expression.operation.binary.change"
] | 882,159 | 882,160 | u883982500 | cpp |
p03071 | #include "bits/stdc++.h"
using namespace std;
#ifdef _DEBUG
#define _GLIBCXX_DEBUG
#include "dump.hpp"
#else
#define dump(...)
#endif
#define int long long
#define ll long long
#define DBG 1
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define rrep(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define loop(n) r... | #include "bits/stdc++.h"
using namespace std;
#ifdef _DEBUG
#define _GLIBCXX_DEBUG
#include "dump.hpp"
#else
#define dump(...)
#endif
#define int long long
#define ll long long
#define DBG 1
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define rrep(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define loop(n) r... | [
"expression.operation.binary.add"
] | 882,169 | 882,170 | u570522509 | cpp |
p03071 | #include <iostream>
using namespace std;
int a, b;
int main() {
cin >> a >> b;
cout << max((a + a - 1), max((b + b - 1), (a + b - 1)));
return 0;
}
| #include <iostream>
using namespace std;
int a, b;
int main() {
cin >> a >> b;
cout << max((a + a - 1), max((b + b - 1), (a + b)));
return 0;
}
| [
"expression.operation.binary.remove"
] | 882,171 | 882,172 | u430061790 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vb = vector<bool>;
using vvb = vector<vb>;
using vd = vector<double>;
using vvd = vector<vd>;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
usi... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vb = vector<bool>;
using vvb = vector<vb>;
using vd = vector<double>;
using vvd = vector<vd>;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
usi... | [
"call.arguments.change",
"call.arguments.add"
] | 882,175 | 882,176 | u591883167 | cpp |
p03072 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <string>
#include <array>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
#define int64... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <string>
#include <array>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
#define int64... | [
"literal.number.change",
"variable_declaration.value.change"
] | 882,177 | 882,178 | u834987206 | cpp |
p03071 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <ss... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <ss... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"expression.operator.arithmetic.change"
] | 882,185 | 882,186 | u120810144 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << max(max(a + a, b + b), a + b) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << max(max(a + a - 1, b + b - 1), a + b) << endl;
} | [
"expression.operation.binary.add"
] | 882,193 | 882,194 | u058881350 | cpp |
p03071 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int total = 0;
int m = max(a, b);
if (a == b) {
cout << m + m - 1 << endl;
} else {
cout << m + m << endl;
}
}
| #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int total = 0;
int m = max(a, b);
if (a == b) {
cout << m + m << endl;
} else {
cout << m + m - 1 << endl;
}
}
| [
"expression.operation.binary.remove"
] | 882,200 | 882,201 | u059082716 | cpp |
p03071 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int total = 0;
int m = max(a, b);
if (a == b) {
cout << m * m << endl;
} else {
cout << m * (m - 1) << endl;
}
}
| #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int total = 0;
int m = max(a, b);
if (a == b) {
cout << m + m << endl;
} else {
cout << m + m - 1 << endl;
}
}
| [
"expression.operator.arithmetic.change",
"io.output.change"
] | 882,202 | 882,201 | u059082716 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
int max1 = max(A, B);
int max2 = max(max1, min(A, B));
cout << max1 + max2;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
int max1 = max(A, B);
int max2 = max(max1 - 1, min(A, B));
cout << max1 + max2;
}
| [
"assignment.change"
] | 882,205 | 882,206 | u435108403 | cpp |
p03071 | #include <math.h>
#include <stdio.h>
#include <stdlib.h>
int main(void) {
int A, B;
int i;
int s;
scanf("%d %d", &A, &B);
for (i = 0; i < 2; i++) {
if (A >= B) {
s += A--;
} else {
s -= B--;
}
}
printf("%d\n", s);
return 0;
} | #include <math.h>
#include <stdio.h>
#include <stdlib.h>
int main(void) {
int A, B;
int i;
int s;
scanf("%d %d", &A, &B);
for (i = 0; i < 2; i++) {
if (A >= B) {
s += A--;
} else {
s += B--;
}
}
printf("%d\n", s);
return 0;
} | [
"expression.operator.change"
] | 882,209 | 882,210 | u231798544 | cpp |
p03071 |
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b;
if (b > a) {
c = a;
a = b;
b = c;
}
cout << max(a - 1 + b, a + b) << endl;
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b;
if (b > a) {
c = a;
a = b;
b = c;
}
cout << max(a - 1 + a, a + b) << endl;
} | [
"identifier.change",
"io.output.change"
] | 882,211 | 882,212 | u791146764 | 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
cout << max(a, b) - 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.add"
] | 882,213 | 882,214 | u916256067 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define lli long long int
#define ulli unsigned long long int
#define ld long double
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define loop(i, a, b) for (lli i = a; i < b... | #include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define lli long long int
#define ulli unsigned long long int
#define ld long double
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define loop(i, a, b) for (lli i = a; i < b... | [] | 882,215 | 882,216 | u774144672 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int A, B;
cin >> A >> B;
if (A == B)
cout << A * 2 << endl;
else {
if (A > B)
cout << A * (A - 1) << endl;
else
cout << B * (B - 1) << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main(void) {
int A, B;
cin >> A >> B;
if (A == B)
cout << A * 2 << endl;
else {
if (A > B)
cout << A + (A - 1) << endl;
else
cout << B + (B - 1) << endl;
}
return 0;
}
| [
"expression.operator.arithmetic.change",
"io.output.change"
] | 882,217 | 882,218 | u341488930 | cpp |
p03071 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a > b)
cout << 2 * a << endl;
else if (b > a)
cout << 2 * b << endl;
else
cout << a + b << endl;
return 0;
} | #include <iostream>
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;
return 0;
} | [
"expression.operation.binary.add"
] | 882,225 | 882,226 | u691380397 | cpp |
p03071 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define int long long
using namespace std;
signed main() {
int a, b;
cin >> a >> b;
if (a > b) {
cout << a + a... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define int long long
using namespace std;
signed main() {
int a, b;
cin >> a >> b;
if (a > b) {
cout << a + a... | [
"expression.operation.binary.remove"
] | 882,229 | 882,230 | u783922005 | cpp |
p03071 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define REP(i, n) for (ll i = 0; i < (ll)n; i++)
#define INF 1000000000000000
using namespace std;
typedef long long ll;
typedef double db;
typedef string str;
... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define REP(i, n) for (ll i = 0; i < (ll)n; i++)
#define INF 1000000000000000
using namespace std;
typedef long long ll;
typedef double db;
typedef string str;
... | [
"expression.operation.binary.remove"
] | 882,233 | 882,234 | u780950519 | cpp |
p03072 | #include <bits/stdc++.h>
using namespace std;
//入力
template <typename T> istream &operator>>(istream &is, vector<T> &a) {
for (int i = 0; i < a.size(); i++)
is >> a[i];
return is;
}
template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p) {
is >> p.first >> p.second;
return is;
}
... | #include <bits/stdc++.h>
using namespace std;
//入力
template <typename T> istream &operator>>(istream &is, vector<T> &a) {
for (int i = 0; i < a.size(); i++)
is >> a[i];
return is;
}
template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p) {
is >> p.first >> p.second;
return is;
}
... | [
"control_flow.branch.if.condition.change",
"assignment.change"
] | 882,239 | 882,240 | u190580703 | cpp |
p03072 | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define rrep(i, n) for (ll i = 1; i <= (n); ++i)
#define drep(i, n) for (ll i = (n)-1; i >= 0; --i)
#define all(v) v.begin(), v.end()
#define len(x) (ll)(x).length()
#define maxs(x, y) x = max(x, y)
#define mins(x, y) x = min(x, y)
#define pb push_... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define rrep(i, n) for (ll i = 1; i <= (n); ++i)
#define drep(i, n) for (ll i = (n)-1; i >= 0; --i)
#define all(v) v.begin(), v.end()
#define len(x) (ll)(x).length()
#define maxs(x, y) x = max(x, y)
#define mins(x, y) x = min(x, y)
#define pb push_... | [] | 882,241 | 882,242 | u818755983 | cpp |
p03072 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
vector<int> A(N);
for (int i = 0; i < N; i++)
cin >> A[i];
int MAX = A[0];
int cnt = 0;
for (int i = 0; i < N; i++) {
if (MAX < A[i])
MAX = A[i];
if (MAX <= A[i])
cnt++;
}
cout << cnt << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++)
cin >> A[i];
int MAX = A[0];
int cnt = 0;
for (int i = 0; i < N; i++) {
if (MAX < A[i])
MAX = A[i];
if (MAX <= A[i])
cnt++;
}
cout << cnt << endl;
}
| [] | 882,246 | 882,247 | u851044959 | cpp |
p03072 | #include <iostream>
using namespace std;
int main() {
int n, ans = 0, max = 0;
cin >> n;
for (int i = 0; i < n; i++) {
int h;
cin >> h;
if (h > max) {
ans++;
max = h;
}
}
cout << ans << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n, ans = 0, max = 0;
cin >> n;
for (int i = 0; i < n; i++) {
int h;
cin >> h;
if (h >= max) {
ans++;
max = h;
}
}
cout << ans << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 882,248 | 882,249 | u553321223 | cpp |
p03072 | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pp pair<int, int>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define ld long double
#define al(a) (a).begin(), (a).end()
#define mk make_pair
#define check cout << "?" << endl;
ll MOD = 1000000007;
ll mod = 9... | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pp pair<int, int>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define ld long double
#define al(a) (a).begin(), (a).end()
#define mk make_pair
#define check cout << "?" << endl;
ll MOD = 1000000007;
ll mod = 9... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 882,256 | 882,257 | u096616343 | cpp |
p03072 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int latas_seged = 1;
int n;
bool logikai_valtozo = true;
vector<int> sanyiszamok;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> latas_seged;
sanyiszamok.push_back(latas_seged);
}
latas_seged = 1;
for (int i = 1; i < n; i... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int latas_seged = 1;
int n;
bool logikai_valtozo = true;
vector<int> sanyiszamok;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> latas_seged;
sanyiszamok.push_back(latas_seged);
}
latas_seged = 1;
for (int i = 1; i < n; i... | [
"assignment.add"
] | 882,265 | 882,264 | u742481447 | cpp |
p03072 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N = 0;
vector<int> szamok;
int seged = 0;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> seged;
szamok.push_back(seged);
}
bool vane = true;
seged = 1;
for (int i = 1; i < N; i++) {
for (int j = 0; j < i; j++) {
... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N = 0;
vector<int> szamok;
int seged = 0;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> seged;
szamok.push_back(seged);
}
bool vane = true;
seged = 1;
for (int i = 1; i < N; i++) {
for (int j = 0; j < i; j++) {
... | [] | 882,266 | 882,267 | u112217209 | cpp |
p03072 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N = 0;
vector<int> szamok;
int seged = 0;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> seged;
szamok.push_back(seged);
}
bool vane = true;
seged = 0;
for (int i = 1; i < N; i++) {
for (int j = 0; j < i; j++) {
... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N = 0;
vector<int> szamok;
int seged = 0;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> seged;
szamok.push_back(seged);
}
bool vane = true;
seged = 1;
for (int i = 1; i < N; i++) {
for (int j = 0; j < i; j++) {
... | [
"literal.number.change",
"assignment.value.change"
] | 882,268 | 882,267 | u112217209 | cpp |
p03072 | #include <bits/stdc++.h>
using namespace std;
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
// #define ordered_set tree<int, null_type,less<int>,
// rb_tree_tag,tree_order_statistics_node_update>
#define FS ... | #include <bits/stdc++.h>
using namespace std;
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
// #define ordered_set tree<int, null_type,less<int>,
// rb_tree_tag,tree_order_statistics_node_update>
#define FS ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 882,269 | 882,270 | u293991054 | cpp |
p03072 | #include <bits/stdc++.h>
#include <fstream>
#include <iostream>
#include <stdlib.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> llP;
ll mod(ll a, ll b) {
ll ret = a % b;
if (ret < 0)
ret += b;
return ret;
}
ll modpow(ll a, ll b, ll c) {
ll res = 1;
while (b ... | #include <bits/stdc++.h>
#include <fstream>
#include <iostream>
#include <stdlib.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> llP;
ll mod(ll a, ll b) {
ll ret = a % b;
if (ret < 0)
ret += b;
return ret;
}
ll modpow(ll a, ll b, ll c) {
ll res = 1;
while (b ... | [
"literal.number.change",
"variable_declaration.value.change"
] | 882,273 | 882,274 | u201553784 | cpp |
p03072 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
... | [
"literal.number.change",
"variable_declaration.value.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 882,275 | 882,276 | u991713078 | cpp |
p03072 | #include <iostream>
#include <vector>
using namespace std;
int main() {
//入力
int N;
cin >> N;
vector<int> H(N);
for (int i = 0; i < N; i++) {
cin >> H[i];
}
int ans = 0; //答えとなる山の数
int maxheight = 0; //今までで最も高い山の高さ
//今見ている山
for (int i = 0; i < N; i++) {
if (maxheight << H[i]) {
... | #include <iostream>
#include <vector>
using namespace std;
int main() {
//入力
int N;
cin >> N;
vector<int> H(N);
for (int i = 0; i < N; i++) {
cin >> H[i];
}
int ans = 0; //答えとなる山の数
int maxheight = 0; //今までで最も高い山の高さ
//今見ている山
for (int i = 0; i < N; i++) {
if (maxheight <= H[i]) {
... | [
"control_flow.branch.if.condition.change"
] | 882,277 | 882,278 | u618263300 | cpp |
p03072 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> h(n);
rep(i, n) cin >> h[i];
int count = 0;
rep(i, n) {
bool flag = true;
rep(j, i) {
if (h[i] < h[j])
flag = false;
brea... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> h(n);
rep(i, n) cin >> h[i];
int count = 0;
rep(i, n) {
bool flag = true;
rep(j, i) {
if (h[i] < h[j]) {
flag = false;
... | [] | 882,288 | 882,289 | u186506670 | cpp |
p03072 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> h(n);
rep(i, n) cin >> h[i];
int count = 0;
rep(i, n) {
bool num = true;
rep(j, i) {
if (h[i] < h[j])
num = false;
break;... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> h(n);
rep(i, n) cin >> h[i];
int count = 0;
rep(i, n) {
bool flag = true;
rep(j, i) {
if (h[i] < h[j]) {
flag = false;
... | [
"variable_declaration.name.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 882,290 | 882,289 | u186506670 | cpp |
p03072 | #include <bits/stdc++.h>
#include <math.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
using namespace std;
int main(void) {
int n, ans = 1;
cin >> n;
vector<int> h(n);
rep(i, n) { cin >> h[i]; }
for (int i = 1; i < n - 1; i++) {
if (h[0] <= h[0 + i]) {
ans++;
h[0] = h[0 + i];
}
... | #include <bits/stdc++.h>
#include <math.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
using namespace std;
int main(void) {
int n, ans = 1;
cin >> n;
vector<int> h(n);
rep(i, n) { cin >> h[i]; }
for (int i = 1; i < n + 1; i++) {
if (h[0] <= h[0 + i]) {
ans++;
h[0] = h[0 + i];
}
... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 882,291 | 882,292 | u778867542 | cpp |
p03072 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> H(N + 1);
for (int i = 1; i <= N + 1; i++)
cin >> H[i];
int max = 0;
int count = 0;
for (int i = 1; i <= N; i++) {
if (H[i] > max) {
count++;
max = H[i];
}
}
cout << count << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> H(N + 1);
for (int i = 1; i <= N + 1; i++)
cin >> H[i];
int max = 0;
int count = 0;
for (int i = 1; i <= N; i++) {
if (H[i] >= max) {
count++;
max = H[i];
}
}
cout << count << endl;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 882,293 | 882,294 | u711676593 | cpp |
p03072 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
vector<int> h;
cin >> n;
for (int i = 0; i < n; i++) {
int tmp;
cin >> tmp;
h.push_back(tmp);
}
int cnt = 0;
for (int i = 1; i < h.size(); i++) {
bool flg = true;
for (int j = 0; j < i - 1; j++) {
i... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
vector<int> h;
cin >> n;
for (int i = 0; i < n; i++) {
int tmp;
cin >> tmp;
h.push_back(tmp);
}
int cnt = 1;
for (int i = 1; i < h.size(); i++) {
bool flg = true;
for (int j = 0; j < i; j++) {
if (h... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 882,297 | 882,298 | u313498252 | cpp |
p03072 | #include <iostream>
using namespace std;
int h[20];
int main() {
int n, br = 0;
cin >> n;
for (int i = 0; i < n; i++)
cin >> h[i];
int max = 0;
for (int i = 0; i < n; i++) {
if (h[i] >= max) {
max = h[i];
}
}
cout << br;
} | #include <iostream>
using namespace std;
int h[20];
int main() {
int n, br = 0;
cin >> n;
for (int i = 0; i < n; i++)
cin >> h[i];
int max = 0;
for (int i = 0; i < n; i++) {
if (h[i] >= max) {
max = h[i];
br++;
}
}
cout << br;
} | [
"expression.unary.arithmetic.add"
] | 882,301 | 882,302 | u233308191 | cpp |
p03072 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <forward_list>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <utility>
#include <vector>
#define rep(i, s, g) for (... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <forward_list>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <utility>
#include <vector>
#define rep(i, s, g) for (... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 882,313 | 882,314 | u880221923 | cpp |
p03072 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
vector<int> H(N);
for (int i = 0; i < N; i++) {
cin >> H.at(i);
}
int count = 0;
for (int i = 1; i < N; i++) {
bool ok = true;
for (int j = i - 1; j < i; j++) {
if (H.at(i) - H.at(j) < 0) ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
vector<int> H(N);
for (int i = 0; i < N; i++) {
cin >> H.at(i);
}
int count = 0;
for (int i = 1; i < N; i++) {
bool ok = true;
for (int j = 0; j < i; j++) {
if (H.at(i) - H.at(j) < 0) {
... | [
"variable_declaration.value.change",
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 882,315 | 882,316 | u632527507 | cpp |
p03072 | #include <iostream>
using namespace std;
int h[101];
int main() {
int n, i, max = 0, br = 0;
cin >> n;
for (i = 0; i < n; i++) {
cin >> h[i];
if (h[i] > max) {
br++;
max = h[i];
}
}
cout << br;
}
| #include <iostream>
using namespace std;
int h[101];
int main() {
int n, i, max = 0, br = 0;
cin >> n;
for (i = 0; i < n; i++) {
cin >> h[i];
if (h[i] >= max) {
br++;
max = h[i];
}
}
cout << br;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 882,320 | 882,321 | u746310630 | cpp |
p03072 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n); i > 0; i++)
using ll = long long;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int hmax = 0;
int n;
cin >> n;
int ans;
rep(i, n) {
int h = 0;
cin ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n); i > 0; i++)
using ll = long long;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int hmax = 0;
int n;
cin >> n;
int ans = 0;
rep(i, n) {
int h = 0;
... | [
"variable_declaration.value.change"
] | 882,322 | 882,323 | u297398560 | cpp |
p03072 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
int count = 0;
for (int i = 0; i < N; i++) {
bool flag = false;
for (int j = 0; j < i; j++) {
if (A[i] >= A[j]) {
flag = true;
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
int count = 0;
for (int i = 0; i < N; i++) {
bool flag = true;
for (int j = 0; j < i; j++) {
if (A[i] < A[j]) {
flag = false;
}
... | [
"misc.opposites",
"variable_declaration.value.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"assignment.value.change"
] | 882,324 | 882,325 | u016183710 | cpp |
p03072 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
int count = 0;
for (int i = 0; i < N; i++) {
bool flag = true;
for (int j = 0; j < i; j++) {
if (A[i] >= A[j]) {
flag = false;
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
int count = 0;
for (int i = 0; i < N; i++) {
bool flag = true;
for (int j = 0; j < i; j++) {
if (A[i] < A[j]) {
flag = false;
}
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 882,326 | 882,325 | u016183710 | cpp |
p03072 | #include <bits/stdc++.h>
using namespace std;
#define xx first
#define yy second
#define pb push_back
#define mp make_pair
#define LL long long
#define inf INT_MAX / 3
#define mod 1000000007ll
#define PI acos(-1.0)
#define linf (1ll << 60) - 1
#define FOR(I, A, B) for (int I = (A); I < (B); ++I)
#define REP(I, N) FOR... | #include <bits/stdc++.h>
using namespace std;
#define xx first
#define yy second
#define pb push_back
#define mp make_pair
#define LL long long
#define inf INT_MAX / 3
#define mod 1000000007ll
#define PI acos(-1.0)
#define linf (1ll << 60) - 1
#define FOR(I, A, B) for (int I = (A); I < (B); ++I)
#define REP(I, N) FOR... | [] | 882,327 | 882,328 | u853580735 | cpp |
p03072 | #include <bits/stdc++.h>
using namespace std;
#define xx first
#define yy second
#define pb push_back
#define mp make_pair
#define LL long long
#define inf INT_MAX / 3
#define mod 1000000007ll
#define PI acos(-1.0)
#define linf (1ll << 60) - 1
#define FOR(I, A, B) for (int I = (A); I < (B); ++I)
#define REP(I, N) FOR... | #include <bits/stdc++.h>
using namespace std;
#define xx first
#define yy second
#define pb push_back
#define mp make_pair
#define LL long long
#define inf INT_MAX / 3
#define mod 1000000007ll
#define PI acos(-1.0)
#define linf (1ll << 60) - 1
#define FOR(I, A, B) for (int I = (A); I < (B); ++I)
#define REP(I, N) FOR... | [
"variable_declaration.type.change"
] | 882,329 | 882,328 | u853580735 | cpp |
p03072 | #include <bits/stdc++.h>
using namespace std;
#define xx first
#define yy second
#define pb push_back
#define mp make_pair
#define LL long long
#define inf INT_MAX / 3
#define mod 1000000007ll
#define PI acos(-1.0)
#define linf (1ll << 60) - 1
#define FOR(I, A, B) for (int I = (A); I < (B); ++I)
#define REP(I, N) FOR... | #include <bits/stdc++.h>
using namespace std;
#define xx first
#define yy second
#define pb push_back
#define mp make_pair
#define LL long long
#define inf INT_MAX / 3
#define mod 1000000007ll
#define PI acos(-1.0)
#define linf (1ll << 60) - 1
#define FOR(I, A, B) for (int I = (A); I < (B); ++I)
#define REP(I, N) FOR... | [
"variable_declaration.type.change",
"io.output.newline.add"
] | 882,330 | 882,328 | u853580735 | cpp |
p03072 | // 10のi乗pow(10, i);
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n;
cin >> n;
vector<int> h(n);
rep(i, n) cin >> h.at(i);
int count = 0;
int ma = h.at(0);
rep(i, n) {
if (ma >= h.at(i))
count++;
ma = max(ma, h.at(i));
... | // 10のi乗pow(10, i);
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n;
cin >> n;
vector<int> h(n);
rep(i, n) cin >> h.at(i);
int count = 0;
int ma = h.at(0);
rep(i, n) {
if (ma <= h.at(i))
count++;
ma = max(ma, h.at(i));
... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 882,331 | 882,332 | u037563046 | cpp |
p03072 |
#include <bits/stdc++.h>
#define se second
#define fi first
#define pb push_back
#define cn cout << "\n"
#define rep(i, a, b) for (int i = a; i < b; i++)
#define repr(i, a, b) for (int i = a; i >= b; i--)
#define all(v) v.begin(), v.end()
#define allr(v) v.rbegin(), v.rend()
#define _ ... |
#include <bits/stdc++.h>
#define se second
#define fi first
#define pb push_back
#define cn cout << "\n"
#define rep(i, a, b) for (int i = a; i < b; i++)
#define repr(i, a, b) for (int i = a; i >= b; i--)
#define all(v) v.begin(), v.end()
#define allr(v) v.rbegin(), v.rend()
#define _ ... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 882,333 | 882,334 | u572796018 | cpp |
p03072 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> H(N);
for (int i = 0; i < N; i++)
cin >> H[i];
int sum = 1;
int hantei = 1;
for (int i = 1; i < N; i++) {
hantei = 1;
for (int j = 0; j <= i - 1; j++) {
if (H[i] < H[j]) {
break;
h... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> H(N);
for (int i = 0; i < N; i++)
cin >> H[i];
int sum = 1;
int hantei = 1;
for (int i = 1; i < N; i++) {
hantei = 1;
for (int j = 0; j <= i - 1; j++) {
if (H[i] < H[j]) {
hantei = 0;
... | [
"control_flow.break.add"
] | 882,342 | 882,343 | u109191542 | cpp |
p03072 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i < n + 1; i++)
#define sort(A) sort(A.begin(), A.end())
#define reverse(A) reverse(A.begin(), A.end())
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> h(n);
rep(i, n) ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i < n + 1; i++)
#define sort(A) sort(A.begin(), A.end())
#define reverse(A) reverse(A.begin(), A.end())
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> h(n);
rep(i, n) ... | [
"literal.number.change",
"variable_declaration.value.change"
] | 882,344 | 882,345 | u132364782 | cpp |
p03072 | #include <iostream>
#include <vector>
using namespace std;
int main(void) {
int n;
cin >> n;
int h;
int max = 0;
int ans = 0;
for (int i = 0; i < n; i++) {
cin >> h;
if (max < h) {
ans++;
max = h;
}
}
cout << ans << endl;
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
int main(void) {
int n;
cin >> n;
int h;
int max = 0;
int ans = 0;
for (int i = 0; i < n; i++) {
cin >> h;
if (max <= h) {
ans++;
max = h;
}
}
cout << ans << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 882,350 | 882,351 | u955202970 | cpp |
p03072 | #include <iostream>
#include <vector>
using namespace std;
int main(void) {
int n;
cin >> n;
int h;
int max = 0;
int ans = 1;
for (int i = 0; i < n; i++) {
cin >> h;
if (max < h) {
ans++;
max = h;
}
}
cout << ans << endl;
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
int main(void) {
int n;
cin >> n;
int h;
int max = 0;
int ans = 0;
for (int i = 0; i < n; i++) {
cin >> h;
if (max <= h) {
ans++;
max = h;
}
}
cout << ans << endl;
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 882,352 | 882,351 | u955202970 | cpp |
p03072 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define intput(i) cout << i << endl
#define ll long long
#define stringput(s) cout << (string)(s) << endl
int main() {
int N;
cin >> N;
vector<int> h(N);
int j = 0;
rep(i, N) { cin >> h[i]; }
rep(i, N) {
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define intput(i) cout << i << endl
#define ll long long
#define stringput(s) cout << (string)(s) << endl
int main() {
int N;
cin >> N;
vector<int> h(N);
int j = 0;
rep(i, N) { cin >> h[i]; }
rep(i, N) {
... | [
"expression.operation.binary.remove"
] | 882,367 | 882,368 | u578871832 | cpp |
p03072 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++)
cin >> A.at(i);
int count = 1;
int max = A.at(0);
for (int i = 0; i < N - 1; i++) {
if (A.at(i) < A.at(i + 1) && max <= A.at(i + 1))
count++;
if (max < A.at(i + 1))... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++)
cin >> A.at(i);
int count = 1;
int max = A.at(0);
for (int i = 0; i < N - 1; i++) {
if (A.at(i) <= A.at(i + 1) && max <= A.at(i + 1))
count++;
if (max < A.at(i + 1)... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 882,376 | 882,377 | u533566373 | cpp |
p03072 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repl(i, l, r) for (ll i = (l); i < (r); i++)
#define per(i, n) for (ll i = n - 1; i >= 0; i--)
#define lper(i, r, l) for (ll i = r - 1; i >= l; i--)
#define fi first
#define se second
#define mp make_pair
#define all(x) (... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repl(i, l, r) for (ll i = (l); i < (r); i++)
#define per(i, n) for (ll i = n - 1; i >= 0; i--)
#define lper(i, r, l) for (ll i = r - 1; i >= l; i--)
#define fi first
#define se second
#define mp make_pair
#define all(x) (... | [] | 882,382 | 882,383 | u978260507 | cpp |
p03072 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repl(i, l, r) for (ll i = (l); i < (r); i++)
#define per(i, n) for (ll i = n - 1; i >= 0; i--)
#define lper(i, r, l) for (ll i = r - 1; i >= l; i--)
#define fi first
#define se second
#define mp make_pair
#define all(x) (... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repl(i, l, r) for (ll i = (l); i < (r); i++)
#define per(i, n) for (ll i = n - 1; i >= 0; i--)
#define lper(i, r, l) for (ll i = r - 1; i >= l; i--)
#define fi first
#define se second
#define mp make_pair
#define all(x) (... | [
"assignment.variable.change",
"assignment.add"
] | 882,384 | 882,383 | u978260507 | cpp |
p03072 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define inf 1001001001
typedef pair<int, int> P;
#define mod 1000000007
int main() {
int n;
cin >> n;
int ans = 1;
int mi = -inf;
rep(i, n) {
int h;
cin >> h;
if (h >= mi)
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define inf 1001001001
typedef pair<int, int> P;
#define mod 1000000007
int main() {
int n;
cin >> n;
int ans = 0;
int mi = -inf;
rep(i, n) {
int h;
cin >> h;
if (h >= mi)
... | [
"literal.number.change",
"variable_declaration.value.change"
] | 882,385 | 882,386 | u001327021 | cpp |
p03072 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> as(n);
for (int i = 0; i < n; i++) {
cin >> as[i];
}
int ans = 0, nax = -1;
for (int i = 0; i < n; i++) {
ans += as[i] > nax;
nax = max(nax, as[i]);
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> as(n);
for (int i = 0; i < n; i++) {
cin >> as[i];
}
int ans = 0, nax = -1;
for (int i = 0; i < n; i++) {
ans += as[i] >= nax;
nax = max(nax, as[i]);
}
cout << ans << endl;
} | [
"expression.operator.compare.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 882,387 | 882,388 | u210718367 | cpp |
p03072 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> h(n);
int ans = 1;
for (int i = 0; i < n; i++) {
cin >> h.at(i);
}
int t = h.at(0);
for (int i = 0; i < n; i++) {
if (t <= h.at(i)) {
ans++;
}
t = max(t, h.at(i));
}
cout << ans << endl... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> h(n);
int ans = 1;
for (int i = 0; i < n; i++) {
cin >> h.at(i);
}
int t = h.at(0);
for (int i = 1; i < n; i++) {
if (t <= h.at(i)) {
ans++;
}
t = max(t, h.at(i));
}
cout << ans << endl... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 882,397 | 882,398 | u316226687 | cpp |
p03072 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int x;
int cont = 1;
int y = 0;
for (int i = 0; i < n; i++) {
cin >> x;
if (x >= y)
cont++;
y = x;
}
cout << cont - 1;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int x;
int cont = 0;
int y = 0;
for (int i = 0; i < n; i++) {
cin >> x;
if (x >= y) {
cont++;
y = x;
}
}
cout << cont;
return 0;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"expression.operation.binary.remove"
] | 882,401 | 882,402 | u265789933 | cpp |
p03072 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repf(i, a, b) for (int i = (a); i < (b); i++)
#define repi(i, a, b) for (int i = (a); i <= (b); i++)
#define repr(i, a, b) for (int i = (a); i >= (b); i--)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#def... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repf(i, a, b) for (int i = (a); i < (b); i++)
#define repi(i, a, b) for (int i = (a); i <= (b); i++)
#define repr(i, a, b) for (int i = (a); i >= (b); i--)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#def... | [] | 882,413 | 882,414 | u850516963 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.