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 << 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(int &a, int b) {
if (a > b)
a = b;
}
inline void chkmax(int &a, int b) {
if (a < b)
a = b;
}
#define _ read()
int main() {
int a = _, b = _;
cout << max(a * 2, max(b * 2, a + b));
} | #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(int &a, int b) {
if (a > b)
a = b;
}
inline void chkmax(int &a, int b) {
if (a < b)
a = b;
}
#define _ read()
int main() {
int a = _, b = _;
cout << max(a * 2 - 1, max(b * 2 - 1, a + b));
} | [
"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 <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
using namespace std;
#define int long long
#define ll long long
#define pb push_back
#define pii pair<int, int>
#define vi vector<int>
#define vii vector<pii>
#define mi map<int, int>
#define mii map<pii, int>
#define mp make_pair
#define all(a) (a).begin(), (a).end()
#define FF first
#define SS second
#define sz(x) (int)x.size()
#define endl '\n'
//#define hell 1000000007
#define rep(i, a, b) for (int i = a; i < b; i++)
// mp::cpp_int
#define pp pair<pii, pii>
const int hell = 1000000007;
int power(int a, int b) {
if (b == 0)
return 1;
if (b == 1)
return a;
int t = power(a, b / 2);
t %= hell;
t *= t;
t %= hell;
if (b % 2)
return (t * a) % hell;
else
return t;
}
int p[100000] = {0};
bool b[100000] = {false};
void pri() {
rep(i, 2, 100000) for (int j = i + i; j < 100000; j += i) b[j] = true;
rep(i, 2, 100000) if (b[i] == false) p[i] = 1;
}
int solve() {
int a, b;
cin >> a >> b;
int mx = (a, b), mn = min(a, b);
if (mx - mn >= 1) {
cout << mx + mx - 1;
}
if (mn == mx) {
cout << 2 * mn;
}
return 0;
}
signed main() {
int t = 1;
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin.exceptions(cin.failbit);
// pri();
clock_t time_req;
// Without using pow function
time_req = clock();
// cin>>t;
int k = 1;
while (t--) {
// cout<<"case #"<<k<<":"<<" ";k++;
solve();
}
time_req = clock() - time_req;
// cout << "Processor time taken is "
// << (double)time_req/CLOCKS_PER_SEC << " seconds" << endl;
return 0;
}
| #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 <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
using namespace std;
#define int long long
#define ll long long
#define pb push_back
#define pii pair<int, int>
#define vi vector<int>
#define vii vector<pii>
#define mi map<int, int>
#define mii map<pii, int>
#define mp make_pair
#define all(a) (a).begin(), (a).end()
#define FF first
#define SS second
#define sz(x) (int)x.size()
#define endl '\n'
//#define hell 1000000007
#define rep(i, a, b) for (int i = a; i < b; i++)
// mp::cpp_int
#define pp pair<pii, pii>
const int hell = 1000000007;
int power(int a, int b) {
if (b == 0)
return 1;
if (b == 1)
return a;
int t = power(a, b / 2);
t %= hell;
t *= t;
t %= hell;
if (b % 2)
return (t * a) % hell;
else
return t;
}
int p[100000] = {0};
bool b[100000] = {false};
void pri() {
rep(i, 2, 100000) for (int j = i + i; j < 100000; j += i) b[j] = true;
rep(i, 2, 100000) if (b[i] == false) p[i] = 1;
}
int solve() {
int a, b;
cin >> a >> b;
int mx = max(a, b), mn = min(a, b);
if (mx - mn >= 1) {
cout << mx + mx - 1;
}
if (mn == mx) {
cout << 2 * mn;
}
return 0;
}
signed main() {
int t = 1;
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin.exceptions(cin.failbit);
// pri();
clock_t time_req;
// Without using pow function
time_req = clock();
// cin>>t;
int k = 1;
while (t--) {
// cout<<"case #"<<k<<":"<<" ";k++;
solve();
}
time_req = clock() - time_req;
// cout << "Processor time taken is "
// << (double)time_req/CLOCKS_PER_SEC << " seconds" << endl;
return 0;
}
| [
"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 << ans;
return 0;
} | #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;//見れる
//
// for (int i = 1; i < H.size(); i++) {
// for (int j = 0; j < i; j++) {
//
// }
//}
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 << ans;
return 0;
} | [
"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> mm;
#define ll long long
#define ld long double
#define PI 3.14159265358979l
int gcd(int a, int b) {
if (a < b) {
int tmp = a;
a = b;
b = tmp;
}
int r = a % b;
while (r != 0) {
a = b;
b = r;
r = a % b;
}
return b;
}
int main() {
int a, b;
cin >> a, b;
if (a == b)
cout << a + b << endl;
else
cout << max(a, b) * 2 - 1 << endl;
return 0;
} | #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> mm;
#define ll long long
#define ld long double
#define PI 3.14159265358979l
int gcd(int a, int b) {
if (a < b) {
int tmp = a;
a = b;
b = tmp;
}
int r = a % b;
while (r != 0) {
a = b;
b = r;
r = a % b;
}
return b;
}
int main() {
int a, b;
cin >> a >> b;
if (a == b)
cout << a + b << endl;
else
cout << max(a, b) * 2 - 1 << endl;
return 0;
} | [] | 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) for (int i = a; i < b; i++)
#define ll long long
#define IMIN INT_MIN;
#define IMAX INT_MAX;
int main() {
int A, B;
cin >> A >> B;
int cnt = 1;
if (A > B) {
cnt += A;
A--;
} else {
cnt += B;
B--;
}
cnt += max(A, B);
cout << cnt << endl;
return 0;
}
| #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) for (int i = a; i < b; i++)
#define ll long long
#define IMIN INT_MIN;
#define IMAX INT_MAX;
int main() {
int A, B;
cin >> A >> B;
int cnt = 0;
if (A > B) {
cnt += A;
A--;
} else {
cnt += B;
B--;
}
cnt += max(A, B);
cout << cnt << endl;
return 0;
}
| [
"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) for (int i = a; i < b; i++)
#define ll long long
#define IMIN INT_MIN;
#define IMAX INT_MAX;
int main() {
int A, B;
cin >> A >> B;
int cnt = 1;
if (A > B) {
cnt += A;
A--;
} else {
cnt += B;
B--;
}
cnt += max(A, B);
cout << cnt << endl;
return 1;
}
| #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) for (int i = a; i < b; i++)
#define ll long long
#define IMIN INT_MIN;
#define IMAX INT_MAX;
int main() {
int A, B;
cin >> A >> B;
int cnt = 0;
if (A > B) {
cnt += A;
A--;
} else {
cnt += B;
B--;
}
cnt += max(A, B);
cout << cnt << endl;
return 0;
}
| [
"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;
}
cout << sum << endl;
} | #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 << sum << endl;
} | [
"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 << endl;
} | #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 << endl;
} | [
"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 << endl;
} | #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 << endl;
} | [
"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
/*struct*/
struct aaa {
aaa() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
};
} aaaaaaa;
/* const */
const int INF = 1001001001;
const long long LINF = 1001001001001001001ll;
const int MOD = 1e9 + 7; // 10^9
const double EPS = 1e-9;
const int dx[] = {1, 1, 0, -1, -1, -1, 0, 1},
dy[] = {0, 1, 1, 1, 0, -1, -1, -1};
// Counterclockwise from the 6o'clock direction
// Take the x-axis downward and the y-axis right
//#define int long long
// g++ -std=c++14 -Wall --pedantic-errors -fsanitize=signed-integer-overflow
// -fno-sanitize-recover=all -o template template.cpp
string divide[4] = {"dream", "dreamer", "erase", "eraser"};
signed main() {
int a{};
cin >> a;
int b{};
cin >> b;
int ans{};
for (int i = 0, i_len = 2; i < i_len; ++i) {
if (a <= b) {
ans += b;
--b;
}
if (a > b) {
ans += a;
--a;
}
}
cout << ans << endl;
return 0;
} | #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
/*struct*/
struct aaa {
aaa() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
};
} aaaaaaa;
/* const */
const int INF = 1001001001;
const long long LINF = 1001001001001001001ll;
const int MOD = 1e9 + 7; // 10^9
const double EPS = 1e-9;
const int dx[] = {1, 1, 0, -1, -1, -1, 0, 1},
dy[] = {0, 1, 1, 1, 0, -1, -1, -1};
// Counterclockwise from the 6o'clock direction
// Take the x-axis downward and the y-axis right
//#define int long long
// g++ -std=c++14 -Wall --pedantic-errors -fsanitize=signed-integer-overflow
// -fno-sanitize-recover=all -o template template.cpp
string divide[4] = {"dream", "dreamer", "erase", "eraser"};
signed main() {
int a{};
cin >> a;
int b{};
cin >> b;
int ans{};
for (int i = 0, i_len = 2; i < i_len; ++i) {
if (a <= b) {
ans += b;
--b;
} else if (a > b) {
ans += a;
--a;
}
}
cout << ans << endl;
return 0;
} | [
"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 << A + A - 1 << endl;
}
return 0;
} | #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 << A + A - 1 << endl;
}
return 0;
} | [
"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) rep(loop, (0), (n))
#define all(c) begin(c), end(c)
const int INF =
sizeof(int) == sizeof(long long) ? 0x3f3f3f3f3f3f3f3fLL : 0x3f3f3f3f;
const int MOD = (int)(1e9) + 7;
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
using pii = pair<int, int>;
// template<class T> ostream &operator<<(ostream &os,T &t){dump(t);return os;}
template <typename T, typename S>
istream &operator>>(istream &is, pair<T, S> &p) {
is >> p.first >> p.second;
return is;
}
template <typename T, typename S>
ostream &operator<<(ostream &os, pair<T, S> &p) {
os << p.first << " " << p.second;
return os;
}
template <typename T> void printvv(const vector<vector<T>> &v) {
cerr << endl;
rep(i, 0, v.size()) rep(j, 0, v[i].size()) {
if (typeid(v[i][j]).name() == typeid(INF).name() and v[i][j] == INF) {
cerr << "INF";
} else
cerr << v[i][j];
cerr << (j == v[i].size() - 1 ? '\n' : ' ');
}
cerr << endl;
}
#ifndef _DEBUG
#define printvv(...)
#endif
void YES(bool f) { cout << (f ? "YES" : "NO") << endl; }
void Yes(bool f) { cout << (f ? "Yes" : "No") << endl; }
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return true;
}
return false;
}
signed main(signed argc, char *argv[]) {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(12);
int N, M;
cin >> N >> M;
cout << max({2 * N, N + M, 2 * M}) << endl;
return 0;
}
| #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) rep(loop, (0), (n))
#define all(c) begin(c), end(c)
const int INF =
sizeof(int) == sizeof(long long) ? 0x3f3f3f3f3f3f3f3fLL : 0x3f3f3f3f;
const int MOD = (int)(1e9) + 7;
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
using pii = pair<int, int>;
// template<class T> ostream &operator<<(ostream &os,T &t){dump(t);return os;}
template <typename T, typename S>
istream &operator>>(istream &is, pair<T, S> &p) {
is >> p.first >> p.second;
return is;
}
template <typename T, typename S>
ostream &operator<<(ostream &os, pair<T, S> &p) {
os << p.first << " " << p.second;
return os;
}
template <typename T> void printvv(const vector<vector<T>> &v) {
cerr << endl;
rep(i, 0, v.size()) rep(j, 0, v[i].size()) {
if (typeid(v[i][j]).name() == typeid(INF).name() and v[i][j] == INF) {
cerr << "INF";
} else
cerr << v[i][j];
cerr << (j == v[i].size() - 1 ? '\n' : ' ');
}
cerr << endl;
}
#ifndef _DEBUG
#define printvv(...)
#endif
void YES(bool f) { cout << (f ? "YES" : "NO") << endl; }
void Yes(bool f) { cout << (f ? "Yes" : "No") << endl; }
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return true;
}
return false;
}
signed main(signed argc, char *argv[]) {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(12);
int N, M;
cin >> N >> M;
cout << max({2 * N - 1, N + M, 2 * M - 1}) << endl;
return 0;
}
| [
"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>;
using tll = tuple<ll, ll>;
using tlll = tuple<ll, ll, ll>;
using vs = vector<string>;
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define rep(i, n) range(i, 0, n)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)
#define range(i, a, n) for (int i = (a); i < (n); i++)
#define LINF ((ll)1ll << 60)
#define INF ((int)1 << 30)
#define EPS (1e-9)
#define MOD (1000000007ll)
#define fcout(a) cout << setprecision(a) << fixed
#define fs first
#define sc second
#define PI 3.1415926535897932384
int dx[] = {1, 0, -1, 0, 1, -1, -1, 1}, dy[] = {0, 1, 0, -1, 1, 1, -1, -1};
template <class T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class S> S acm(vector<S> &a) { return accumulate(all(a), S()); }
template <class S> S max(vector<S> &a) { return *max_element(all(a)); }
template <class S> S min(vector<S> &a) { return *min_element(all(a)); }
void YN(bool b) { cout << (b ? "YES" : "NO") << "\n"; }
void Yn(bool b) { cout << (b ? "Yes" : "No") << "\n"; }
void yn(bool b) { cout << (b ? "yes" : "no") << "\n"; }
ll max(int a, ll b) { return max((ll)a, b); }
ll max(ll a, int b) { return max(a, (ll)b); }
template <class T> void puta(T &&t) { cout << t << "\n"; }
template <class H, class... T> void puta(H &&h, T &&...t) {
cout << h << ' ';
puta(t...);
}
template <class S, class T> ostream &operator<<(ostream &os, pair<S, T> p) {
os << "[" << p.first << ", " << p.second << "]";
return os;
};
template <class S> auto &operator<<(ostream &os, vector<S> t) {
bool a = 1;
for (auto s : t) {
os << (a ? "" : " ") << s;
a = 0;
}
return os;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int a, b;
cin >> a >> b;
cout << max({a + a, a + b, b + b}) - 1 << endl;
}
| #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>;
using tll = tuple<ll, ll>;
using tlll = tuple<ll, ll, ll>;
using vs = vector<string>;
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define rep(i, n) range(i, 0, n)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)
#define range(i, a, n) for (int i = (a); i < (n); i++)
#define LINF ((ll)1ll << 60)
#define INF ((int)1 << 30)
#define EPS (1e-9)
#define MOD (1000000007ll)
#define fcout(a) cout << setprecision(a) << fixed
#define fs first
#define sc second
#define PI 3.1415926535897932384
int dx[] = {1, 0, -1, 0, 1, -1, -1, 1}, dy[] = {0, 1, 0, -1, 1, 1, -1, -1};
template <class T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class S> S acm(vector<S> &a) { return accumulate(all(a), S()); }
template <class S> S max(vector<S> &a) { return *max_element(all(a)); }
template <class S> S min(vector<S> &a) { return *min_element(all(a)); }
void YN(bool b) { cout << (b ? "YES" : "NO") << "\n"; }
void Yn(bool b) { cout << (b ? "Yes" : "No") << "\n"; }
void yn(bool b) { cout << (b ? "yes" : "no") << "\n"; }
ll max(int a, ll b) { return max((ll)a, b); }
ll max(ll a, int b) { return max(a, (ll)b); }
template <class T> void puta(T &&t) { cout << t << "\n"; }
template <class H, class... T> void puta(H &&h, T &&...t) {
cout << h << ' ';
puta(t...);
}
template <class S, class T> ostream &operator<<(ostream &os, pair<S, T> p) {
os << "[" << p.first << ", " << p.second << "]";
return os;
};
template <class S> auto &operator<<(ostream &os, vector<S> t) {
bool a = 1;
for (auto s : t) {
os << (a ? "" : " ") << s;
a = 0;
}
return os;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int a, b;
cin >> a >> b;
cout << max({a + a - 1, a + b, b + b - 1}) << endl;
}
| [
"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 long long
#define uint64 unsigned long long
#define PI 3.1415926535897932384626433832795
#define coutfix(i) cout << fixed << setprecision(i)
using namespace std;
int main() {
int64 nn, ans = 0;
cin >> nn;
vector<int64> hh(nn);
for (int64 ii = 0; ii < nn; ii++) {
cin >> hh[ii];
}
for (int64 ii = 1; ii < nn; ii++) {
if (hh[ii - 1] <= hh[ii]) {
ans++;
} else {
hh[ii] = hh[ii - 1];
}
}
cout << ans << endl;
}
| #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 long long
#define uint64 unsigned long long
#define PI 3.1415926535897932384626433832795
#define coutfix(i) cout << fixed << setprecision(i)
using namespace std;
int main() {
int64 nn, ans = 1;
cin >> nn;
vector<int64> hh(nn);
for (int64 ii = 0; ii < nn; ii++) {
cin >> hh[ii];
}
for (int64 ii = 1; ii < nn; ii++) {
if (hh[ii - 1] <= hh[ii]) {
ans++;
} else {
hh[ii] = hh[ii - 1];
}
}
cout << ans << endl;
}
| [
"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 <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a < b) {
swap(a, b);
}
if (a <= b + 1) {
cout << 2 * b - 1 << endl;
} else {
cout << a + b << endl;
}
return 0;
}
| #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 <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a > b) {
swap(a, b);
}
if (a <= b - 1) {
cout << 2 * b - 1 << endl;
} else {
cout << a + b << endl;
}
return 0;
}
| [
"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; i++)
#define initialize(array, size, value) \
for (lli i = 0; i < size; i++) \
array[i] = value
#define couta(array, size) \
for (lli i = 0; i < size; i++) \
cout << array[i] << " "
#define vl vector<lli>
#define vp vector<pair<lli, lli>>
#define sl set<lli>
#define msp multiset<pair<long long, long long>> S;
#define pll pair<lli, lli>
#define mll \
map<lli, \
lli> // for( map<lli, lli>::iterator
// i=temp.begin();i!=temp.end();i++)cout<<i->fi<<" "<<i->se<<endl;
#define mvl map<lli, vl>
#define umll unordered_map<lli, lli>
#define vt vector<pair<lli, pll>>
#define vf vector<pair<pll, pll>>
#define qu queue<lli>
#define pq priority_queue<lli>
#define dq deque<lli>
#define ptr vector<lli>::iterator
#define bs(array, x) \
binary_search(array.begin(), array.end(), \
x) // also valid for set and multiset
#define lb(array, x) lower_bound(array.begin(), array.end(), x)
#define ub(array, x) upper_bound(array.begin(), array.end(), x)
#define nobw(array, i, j) \
upper_bound(array.begin(), array.end(), j) - \
lower_bound(array.begin(), array.end(), \
i) // number of numbers between i & j
#define vc clear()
#define endl '\n'
#define sp system("pause");
#define INF 9223372036854775807
#define MINF -9223372036854775808
typedef tree<pll, null_type, less<pll>, rb_tree_tag,
tree_order_statistics_node_update>
indexed_set;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
// #ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
// #endif
lli a, b;
cin >> a >> b;
if (a == b)
cout << a + b;
else
cout << 2 * (max(a, b) - 1);
return 0;
} | #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; i++)
#define initialize(array, size, value) \
for (lli i = 0; i < size; i++) \
array[i] = value
#define couta(array, size) \
for (lli i = 0; i < size; i++) \
cout << array[i] << " "
#define vl vector<lli>
#define vp vector<pair<lli, lli>>
#define sl set<lli>
#define msp multiset<pair<long long, long long>> S;
#define pll pair<lli, lli>
#define mll \
map<lli, \
lli> // for( map<lli, lli>::iterator
// i=temp.begin();i!=temp.end();i++)cout<<i->fi<<" "<<i->se<<endl;
#define mvl map<lli, vl>
#define umll unordered_map<lli, lli>
#define vt vector<pair<lli, pll>>
#define vf vector<pair<pll, pll>>
#define qu queue<lli>
#define pq priority_queue<lli>
#define dq deque<lli>
#define ptr vector<lli>::iterator
#define bs(array, x) \
binary_search(array.begin(), array.end(), \
x) // also valid for set and multiset
#define lb(array, x) lower_bound(array.begin(), array.end(), x)
#define ub(array, x) upper_bound(array.begin(), array.end(), x)
#define nobw(array, i, j) \
upper_bound(array.begin(), array.end(), j) - \
lower_bound(array.begin(), array.end(), \
i) // number of numbers between i & j
#define vc clear()
#define endl '\n'
#define sp system("pause");
#define INF 9223372036854775807
#define MINF -9223372036854775808
typedef tree<pll, null_type, less<pll>, rb_tree_tag,
tree_order_statistics_node_update>
indexed_set;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
//#ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
//#endif
lli a, b;
cin >> a >> b;
if (a == b)
cout << a + b;
else
cout << 2 * (max(a, b)) - 1;
return 0;
} | [] | 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 - 1 << endl;
} else if (a < b) {
cout << b + b - 1 << endl;
} else {
cout << a + a - 1 << endl;
}
return 0;
}
| #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 - 1 << endl;
} else if (a < b) {
cout << b + b - 1 << endl;
} else {
cout << a + a << endl;
}
return 0;
}
| [
"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;
int main() {
int a, b;
cin >> a >> b;
int ans = a + a - 1;
ans = max(ans, a + b - 1);
ans = max(ans, b + b - 1);
cout << ans << endl;
return 0;
}
| #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;
int main() {
int a, b;
cin >> a >> b;
int ans = a + a - 1;
ans = max(ans, a + b);
ans = max(ans, b + b - 1);
cout << ans << endl;
return 0;
}
| [
"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;
}
//出力
template <typename T> ostream &operator<<(ostream &os, const vector<T> &a) {
for (int i = 0; i < a.size(); i++) {
os << a[i] << ((i + 1 != a.size()) ? " " : "");
}
return os;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << p.first << " " << p.second;
return os;
}
//入出力高速化
struct hishimochi {
hishimochi() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout << fixed << setprecision(10);
}
};
hishimochi Hishimochi;
//辺
struct edge {
long long to, cost;
edge(long long t, long long c) : to(t), cost(c) {}
};
struct edge2 {
long long from, to, cost;
edge2(long long f, long long t, long long c) : from(f), to(t), cost(c) {}
};
//型名
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pll = pair<long long, long long>;
using vl = vector<long long>;
using vvl = vector<vector<long long>>;
using vvvl = vector<vector<vector<long long>>>;
using vc = vector<char>;
using vvc = vector<vector<char>>;
using vs = vector<string>;
using vb = vector<bool>;
using vvb = vector<vector<bool>>;
using vp = vector<pair<long long, long long>>;
using Lqueue = priority_queue<long long>;
using Squeue = priority_queue<long long, vector<long long>, greater<long long>>;
//定数
const int MOD1 = 1000000007;
const int MOD2 = 998244353;
const long double PI = 3.1415926535897932;
const long long MAXLL = 9223372036854775807;
const long long INF = 2305843009213693951;
const long double eps = 0.000000001;
const int dx[] = {0, 1, 0, -1, 1, -1, 1, -1};
const int dy[] = {1, 0, -1, 0, 1, 1, -1, -1};
//マクロ
#define overload3(_1, _2, _3, name, ...) name
#define rep1(n) for (int _ = 0; _ < (n); _++)
#define rep2(i, n) for (int i = 0; i < (n); i++)
#define rep3(i, s, n) for (long long i = (s); i < (n); i++)
#define rep(...) overload3(__VA_ARGS__, rep3, rep2, rep1)(__VA_ARGS__)
#define bitrep1(n) for (int _ = 0; _ < (1LL << (n)); _++)
#define bitrep2(i, n) for (int i = 0; i < (1LL << (n)); i++)
#define bitrep3(i, s, n) for (int i = (s); i < (1LL << (n)); i++)
#define bitrep(...) \
overload3(__VA_ARGS__, bitrep3, bitrep2, bitrep1)(__VA_ARGS__)
#define rrep0(n) for (int i = (n)-1; i >= 0; i--)
#define rrep1(i, n) for (int i = (n)-1; i >= 0; i--)
#define rrep2(i, s, n) for (long long i = (n - 1); i >= (s); i--)
#define rrep(...) overload3(__VA_ARGS__, rrep2, rrep1, rrep0)(__VA_ARGS__)
#define rbf(a, x) for (auto &a : x)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define bitcheck(bit, i) (bit) & (1LL << (i))
#define Maxe(x) *max_element((x).begin(), (x).end())
#define Mine(x) *min_element((x).begin(), (x).end())
#define Sume(x) accumulate((x).begin(), (x).end(), 0LL)
#define Size(x) ((long long)(x).size())
#define Sort(x) sort((x).begin(), (x).end())
#define rSort(x) sort((x).rbegin(), (x).rend())
#define Rev(x) reverse((x).begin(), (x).end())
#define Lin(s) getline(cin, (s))
//省略
#define fi first
#define se second
#define mp make_pair
#define mt make_tuple
#define eb emplace_back
//関数
void Yes(bool a) { cout << (a ? "Yes" : "No") << endl; }
void YES(bool a) { cout << (a ? "YES" : "NO") << endl; }
long long modpow(long long x, long long n, int m) {
long long r = 1;
while (n > 0) {
if (n & 1)
(r *= x) %= m;
(x *= x) %= m;
n >>= 1;
}
return r;
}
long long Gcd(long long a, long long b) { return b ? Gcd(b, a % b) : a; }
long long Lcm(long long a, long long b) { return a / Gcd(a, b) * b; }
inline long long cutup(long long a, long long b) { return (a + b - 1) / b; }
inline long long popcnt(long long a) { return __builtin_popcountll(a); }
template <class T, class U> auto max(T a, U b) { return a > b ? a : b; }
template <class T, class U> auto min(T a, U b) { return a < b ? a : b; }
template <class T, class U> inline bool chmin(T &a, U b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T, class U> inline bool chmax(T &a, U b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> void print(T a) { cout << a << endl; }
template <class t> t mypow(t a, long long b) {
if (b == 0)
return 1;
if (a == 0)
return 0;
t x = 1;
while (b > 0) {
if (b & 1LL)
x *= a;
a *= a;
b >>= 1LL;
}
return x;
}
signed main() {
ll n;
cin >> n;
vl H(n);
cin >> H;
ll max = H[0];
ll res = 1;
rep(i, n - 1) if (H[i] >= max) {
res++;
max = H[i];
}
print(res);
} | #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;
}
//出力
template <typename T> ostream &operator<<(ostream &os, const vector<T> &a) {
for (int i = 0; i < a.size(); i++) {
os << a[i] << ((i + 1 != a.size()) ? " " : "");
}
return os;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << p.first << " " << p.second;
return os;
}
//入出力高速化
struct hishimochi {
hishimochi() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout << fixed << setprecision(10);
}
};
hishimochi Hishimochi;
//辺
struct edge {
long long to, cost;
edge(long long t, long long c) : to(t), cost(c) {}
};
struct edge2 {
long long from, to, cost;
edge2(long long f, long long t, long long c) : from(f), to(t), cost(c) {}
};
//型名
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pll = pair<long long, long long>;
using vl = vector<long long>;
using vvl = vector<vector<long long>>;
using vvvl = vector<vector<vector<long long>>>;
using vc = vector<char>;
using vvc = vector<vector<char>>;
using vs = vector<string>;
using vb = vector<bool>;
using vvb = vector<vector<bool>>;
using vp = vector<pair<long long, long long>>;
using Lqueue = priority_queue<long long>;
using Squeue = priority_queue<long long, vector<long long>, greater<long long>>;
//定数
const int MOD1 = 1000000007;
const int MOD2 = 998244353;
const long double PI = 3.1415926535897932;
const long long MAXLL = 9223372036854775807;
const long long INF = 2305843009213693951;
const long double eps = 0.000000001;
const int dx[] = {0, 1, 0, -1, 1, -1, 1, -1};
const int dy[] = {1, 0, -1, 0, 1, 1, -1, -1};
//マクロ
#define overload3(_1, _2, _3, name, ...) name
#define rep1(n) for (int _ = 0; _ < (n); _++)
#define rep2(i, n) for (int i = 0; i < (n); i++)
#define rep3(i, s, n) for (long long i = (s); i < (n); i++)
#define rep(...) overload3(__VA_ARGS__, rep3, rep2, rep1)(__VA_ARGS__)
#define bitrep1(n) for (int _ = 0; _ < (1LL << (n)); _++)
#define bitrep2(i, n) for (int i = 0; i < (1LL << (n)); i++)
#define bitrep3(i, s, n) for (int i = (s); i < (1LL << (n)); i++)
#define bitrep(...) \
overload3(__VA_ARGS__, bitrep3, bitrep2, bitrep1)(__VA_ARGS__)
#define rrep0(n) for (int i = (n)-1; i >= 0; i--)
#define rrep1(i, n) for (int i = (n)-1; i >= 0; i--)
#define rrep2(i, s, n) for (long long i = (n - 1); i >= (s); i--)
#define rrep(...) overload3(__VA_ARGS__, rrep2, rrep1, rrep0)(__VA_ARGS__)
#define rbf(a, x) for (auto &a : x)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define bitcheck(bit, i) (bit) & (1LL << (i))
#define Maxe(x) *max_element((x).begin(), (x).end())
#define Mine(x) *min_element((x).begin(), (x).end())
#define Sume(x) accumulate((x).begin(), (x).end(), 0LL)
#define Size(x) ((long long)(x).size())
#define Sort(x) sort((x).begin(), (x).end())
#define rSort(x) sort((x).rbegin(), (x).rend())
#define Rev(x) reverse((x).begin(), (x).end())
#define Lin(s) getline(cin, (s))
//省略
#define fi first
#define se second
#define mp make_pair
#define mt make_tuple
#define eb emplace_back
//関数
void Yes(bool a) { cout << (a ? "Yes" : "No") << endl; }
void YES(bool a) { cout << (a ? "YES" : "NO") << endl; }
long long modpow(long long x, long long n, int m) {
long long r = 1;
while (n > 0) {
if (n & 1)
(r *= x) %= m;
(x *= x) %= m;
n >>= 1;
}
return r;
}
long long Gcd(long long a, long long b) { return b ? Gcd(b, a % b) : a; }
long long Lcm(long long a, long long b) { return a / Gcd(a, b) * b; }
inline long long cutup(long long a, long long b) { return (a + b - 1) / b; }
inline long long popcnt(long long a) { return __builtin_popcountll(a); }
template <class T, class U> auto max(T a, U b) { return a > b ? a : b; }
template <class T, class U> auto min(T a, U b) { return a < b ? a : b; }
template <class T, class U> inline bool chmin(T &a, U b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T, class U> inline bool chmax(T &a, U b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> void print(T a) { cout << a << endl; }
template <class t> t mypow(t a, long long b) {
if (b == 0)
return 1;
if (a == 0)
return 0;
t x = 1;
while (b > 0) {
if (b & 1LL)
x *= a;
a *= a;
b >>= 1LL;
}
return x;
}
signed main() {
ll n;
cin >> n;
vl H(n);
cin >> H;
ll max = H[0];
ll res = 1;
rep(i, n - 1) if (H[i + 1] >= max) {
res++;
max = H[i + 1];
}
print(res);
} | [
"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_back
#define sz(x) (ll)(x).size()
#define v(T) vector<T>
#define vv(T) vector<vector<T>>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
ll gcd(ll a, ll b) {
if (a % b == 0) {
return b;
} else {
return (gcd(b, a % b));
}
}
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
const int INF = 1e9;
const ll MX = 1e18;
const ll MOD = INF + 7;
const int di[] = {-1, 0, 1, 0};
const int dj[] = {0, -1, 0, 1};
const double PI = acos(-1);
#define dame \
{ \
puts("-1"); \
return 0; \
}
#define yn \
{ puts("Yes"); } \
else { \
puts("No"); \
}
#define YN \
{ puts("YES"); } \
else { \
puts("NO"); \
}
const ll MAX = 1000001;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
long long COM(ll n, ll k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
ll llpow(ll n, ll i) {
ll cnt = n;
for (ll j = 0; j < i - 1; j++) {
n *= cnt;
}
return n;
}
int main() {
int ans = 1;
int n;
cin >> n;
vi h(n);
rep(i, n) cin >> h[i];
int ja = h[0];
for (int i = 1; i < n; i++) {
if (h[i] >= ja)
ans++;
ja = h[i];
}
cout << ans << endl;
}
| #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_back
#define sz(x) (ll)(x).size()
#define v(T) vector<T>
#define vv(T) vector<vector<T>>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
ll gcd(ll a, ll b) {
if (a % b == 0) {
return b;
} else {
return (gcd(b, a % b));
}
}
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
const int INF = 1e9;
const ll MX = 1e18;
const ll MOD = INF + 7;
const int di[] = {-1, 0, 1, 0};
const int dj[] = {0, -1, 0, 1};
const double PI = acos(-1);
#define dame \
{ \
puts("-1"); \
return 0; \
}
#define yn \
{ puts("Yes"); } \
else { \
puts("No"); \
}
#define YN \
{ puts("YES"); } \
else { \
puts("NO"); \
}
const ll MAX = 1000001;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
long long COM(ll n, ll k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
ll llpow(ll n, ll i) {
ll cnt = n;
for (ll j = 0; j < i - 1; j++) {
n *= cnt;
}
return n;
}
int main() {
int ans = 1;
int n;
cin >> n;
vi h(n);
rep(i, n) cin >> h[i];
int ja = h[0];
for (int i = 1; i < n; i++) {
if (h[i] >= ja) {
ans++;
ja = h[i];
}
}
cout << ans << endl;
}
| [] | 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 = 998244353;
int inf = 1000001000;
ll INF = 1e18 + 5;
int main() {
int n, ans = 0, m = 0;
cin >> n;
rep(i, n) {
int h;
cin >> h;
if (h > m)
ans++;
m = max(m, h);
}
cout << ans << endl;
}
| //#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 = 998244353;
int inf = 1000001000;
ll INF = 1e18 + 5;
int main() {
int n, ans = 0, m = 0;
cin >> n;
rep(i, n) {
int h;
cin >> h;
if (h >= m)
ans++;
m = max(m, h);
}
cout << ans << endl;
}
| [
"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++) {
for (int j = 0; j < i; j++) {
if (sanyiszamok[j] > sanyiszamok[i]) {
logikai_valtozo = false;
}
}
if (logikai_valtozo) {
latas_seged += 1;
}
}
cout << latas_seged;
return 0;
}
| #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++) {
for (int j = 0; j < i; j++) {
if (sanyiszamok[j] > sanyiszamok[i]) {
logikai_valtozo = false;
}
}
if (logikai_valtozo) {
latas_seged += 1;
}
logikai_valtozo = true;
}
cout << latas_seged;
return 0;
}
| [
"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++) {
if (szamok[j] > szamok[i]) {
vane = false;
break;
}
if (vane) {
seged++;
}
vane = true;
}
}
cout << seged;
return 0;
}
| #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++) {
if (szamok[j] > szamok[i]) {
vane = false;
break;
}
}
if (vane) {
seged++;
}
vane = true;
}
cout << seged;
return 0;
}
| [] | 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++) {
if (szamok[j] > szamok[i]) {
vane = false;
break;
}
if (vane) {
seged++;
}
vane = true;
}
}
cout << seged;
return 0;
}
| #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++) {
if (szamok[j] > szamok[i]) {
vane = false;
break;
}
}
if (vane) {
seged++;
}
vane = true;
}
cout << seged;
return 0;
}
| [
"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 \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define ll long long int
#define ld long double
#define pb push_back
#define bp __builtin_popcount
#define sz size()
#define ff first
#define ss second
#define vll vector<ll>
#define vbool vector<bool>
#define vpll vector<pair<ll, ll>>
#define pll pair<ll, ll>
#define vllv vector<vector<ll>>
#define setpri(x) cout << setprecision(x) << fixed;
#define all(v) v.begin(), v.end()
#define allr(v) v.rbegin(), v.rend()
#define yesr \
{ \
cout << "YES" << endl; \
return; \
}
#define nor \
{ \
cout << "NO" << endl; \
return; \
}
// getline (std::cin,name);
ll MOD = 1e9 + 7;
ll ceil1(ll n, ll x) { return (n - 1) / x + (n > 0); }
ll gcd(ll a, ll b) { return __gcd(a, b); }
ll lcm(ll a, ll b) { return (max(a, b) / gcd(a, b)) * min(a, b); }
ll pow1(ll n, ll m, ll mod = MOD);
ll pow2(ll n, ll k);
ll modinv(ll n, ll mod = MOD) { return pow1(n, mod - 2, mod); }
bool func(pair<ll, ll> &a, pair<ll, ll> &b) {
if (a.ff != b.ff)
return a.ff < b.ff;
return a.ss > b.ss;
}
ll const N = (ll)2e5 + 11;
ll const LG = (ll)log2(N) + 1;
void solve() {
ll i, j, k, l, n, m, x, y, z, r;
cin >> n;
vll a(n);
for (i = 0; i < n; i++) {
cin >> a[i];
}
ll ans = 1;
ll mx = a[0];
for (i = 1; i < n; i++) {
if (a[i] > mx) {
ans++;
mx = a[i];
}
}
cout << ans << endl;
}
int main() {
FS;
ll i, j, k, n, m, x, y, z, q;
q = 1;
// cin>>q;
for (ll tc = 1; tc <= q; tc++) {
// cout<<"Case #"<<tc<<": ";
solve();
}
return 0;
}
ll pow1(ll n, ll m, ll mod) {
if (m == 0)
return 1;
if (m % 2 == 0)
return pow1((n * n) % mod, m / 2, mod);
return (pow1((n * n) % mod, m / 2, mod) * n) % mod;
}
ll pow2(ll n, ll k) {
ll ans = 1;
while (k > 0) {
if (k % 2 == 1)
ans = ans * n;
n = n * n;
k /= 2;
}
return ans;
}
| #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 \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define ll long long int
#define ld long double
#define pb push_back
#define bp __builtin_popcount
#define sz size()
#define ff first
#define ss second
#define vll vector<ll>
#define vbool vector<bool>
#define vpll vector<pair<ll, ll>>
#define pll pair<ll, ll>
#define vllv vector<vector<ll>>
#define setpri(x) cout << setprecision(x) << fixed;
#define all(v) v.begin(), v.end()
#define allr(v) v.rbegin(), v.rend()
#define yesr \
{ \
cout << "YES" << endl; \
return; \
}
#define nor \
{ \
cout << "NO" << endl; \
return; \
}
// getline (std::cin,name);
ll MOD = 1e9 + 7;
ll ceil1(ll n, ll x) { return (n - 1) / x + (n > 0); }
ll gcd(ll a, ll b) { return __gcd(a, b); }
ll lcm(ll a, ll b) { return (max(a, b) / gcd(a, b)) * min(a, b); }
ll pow1(ll n, ll m, ll mod = MOD);
ll pow2(ll n, ll k);
ll modinv(ll n, ll mod = MOD) { return pow1(n, mod - 2, mod); }
bool func(pair<ll, ll> &a, pair<ll, ll> &b) {
if (a.ff != b.ff)
return a.ff < b.ff;
return a.ss > b.ss;
}
ll const N = (ll)2e5 + 11;
ll const LG = (ll)log2(N) + 1;
void solve() {
ll i, j, k, l, n, m, x, y, z, r;
cin >> n;
vll a(n);
for (i = 0; i < n; i++) {
cin >> a[i];
}
ll ans = 1;
ll mx = a[0];
for (i = 1; i < n; i++) {
if (a[i] >= mx) {
ans++;
mx = a[i];
}
}
cout << ans << endl;
}
int main() {
FS;
ll i, j, k, n, m, x, y, z, q;
q = 1;
// cin>>q;
for (ll tc = 1; tc <= q; tc++) {
// cout<<"Case #"<<tc<<": ";
solve();
}
return 0;
}
ll pow1(ll n, ll m, ll mod) {
if (m == 0)
return 1;
if (m % 2 == 0)
return pow1((n * n) % mod, m / 2, mod);
return (pow1((n * n) % mod, m / 2, mod) * n) % mod;
}
ll pow2(ll n, ll k) {
ll ans = 1;
while (k > 0) {
if (k % 2 == 1)
ans = ans * n;
n = n * n;
k /= 2;
}
return ans;
}
| [
"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 > 0) {
if (b & 1)
res = mod(res * a, c);
a = mod(a * a, c);
b >>= 1;
}
return res;
}
int main() {
int n;
cin >> n;
int h[n];
int cur = 1;
for (int i = 0; i < n; i++) {
cin >> h[i];
bool ans = true;
for (int j = 0; j < i; j++) {
if (h[j] > h[i])
ans = false;
}
if (ans)
cur++;
}
cout << cur << endl;
return 0;
}
| #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 > 0) {
if (b & 1)
res = mod(res * a, c);
a = mod(a * a, c);
b >>= 1;
}
return res;
}
int main() {
int n;
cin >> n;
int h[n];
int cur = 0;
for (int i = 0; i < n; i++) {
cin >> h[i];
bool ans = true;
for (int j = 0; j < i; j++) {
if (h[j] > h[i])
ans = false;
}
if (ans)
cur++;
}
cout << cur << endl;
return 0;
}
| [
"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 <iterator>
#include <limits>
#include <list>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define ArraySizeOf(array) (sizeof(array) / sizeof(array[0]))
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i < n; i++)
#define rev(i, n) for (int i = n - 1; i >= 0; i--)
#define REV(i, n) for (int i = n - 1; i > 0; i--)
#define req(i, n, m) for (int i = n; i < m; i++)
#define REQ(i, n, m, l) for (int i = n; i < m; i += l)
#define _GLIBCXX_DEBUG
int INF = 1e9 + 7;
unsigned NthDayOfWeekToDay(unsigned n, unsigned dow, unsigned dow1) {
unsigned day;
if (dow < dow1)
dow += 7;
day = dow - dow1;
day += 7 * n - 6;
return day;
}
signed gcd(int x, int y) {
if (y == 0)
return x;
return gcd(y, x % y);
}
signed lcm(int x, int y) { return x / gcd(x, y) * y; }
unsigned DayToWeekNumber(unsigned day) { return (day - 1) / 7 + 1; }
unsigned AnotherDayOfWeek(unsigned day, unsigned day0, unsigned dow0) {
return (dow0 + 35 + day - day0) % 7;
}
using namespace std;
pair<string, int> A[101];
signed main() {
int N;
cin >> N;
vector<int> H(N);
rep(i, N) cin >> H[i];
int count = H[0];
int ans = 0;
REP(i, N) {
if (H[i] > count) {
count = H[i];
ans++;
}
}
cout << ans << endl;
} | #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 <iterator>
#include <limits>
#include <list>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define ArraySizeOf(array) (sizeof(array) / sizeof(array[0]))
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i < n; i++)
#define rev(i, n) for (int i = n - 1; i >= 0; i--)
#define REV(i, n) for (int i = n - 1; i > 0; i--)
#define req(i, n, m) for (int i = n; i < m; i++)
#define REQ(i, n, m, l) for (int i = n; i < m; i += l)
#define _GLIBCXX_DEBUG
int INF = 1e9 + 7;
unsigned NthDayOfWeekToDay(unsigned n, unsigned dow, unsigned dow1) {
unsigned day;
if (dow < dow1)
dow += 7;
day = dow - dow1;
day += 7 * n - 6;
return day;
}
signed gcd(int x, int y) {
if (y == 0)
return x;
return gcd(y, x % y);
}
signed lcm(int x, int y) { return x / gcd(x, y) * y; }
unsigned DayToWeekNumber(unsigned day) { return (day - 1) / 7 + 1; }
unsigned AnotherDayOfWeek(unsigned day, unsigned day0, unsigned dow0) {
return (dow0 + 35 + day - day0) % 7;
}
using namespace std;
pair<string, int> A[101];
signed main() {
int N;
cin >> N;
vector<int> H(N);
rep(i, N) cin >> H[i];
int count = H[0];
int ans = 1;
REP(i, N) {
if (H[i] >= count) {
count = H[i];
ans++;
}
}
cout << ans << endl;
} | [
"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]) {
ans++;
maxheight = H[i];
}
}
cout << ans << endl;
}
| #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]) {
ans++;
maxheight = H[i];
}
}
cout << ans << endl;
} | [
"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;
break;
}
if (flag)
++count;
}
cout << count << endl;
return 0;
} | #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;
break;
}
}
if (flag)
++count;
}
cout << count << endl;
return 0;
}
| [] | 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;
}
if (num)
++count;
}
cout << count << endl;
return 0;
} | #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;
break;
}
}
if (flag)
++count;
}
cout << count << endl;
return 0;
}
| [
"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];
}
}
cout << ans << endl;
}
| #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];
}
}
cout << ans << endl;
}
| [
"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++) {
if (h[j] > h[i]) {
flg = false;
}
}
if (flg) {
cnt++;
}
}
cout << cnt << endl;
return 0;
} | #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[j] > h[i]) {
flg = false;
}
}
if (flg) {
cnt++;
}
}
cout << cnt << endl;
return 0;
} | [
"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 ((i) = (s); (i) < (g); ++(i))
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const ll MOD = 1e9 + 7;
const ll INF = (1ll << 60);
int main(void) {
int n;
ll ans = 0;
int m = 0;
cin >> n;
vector<int> h(n);
for (int i = 0; i < n; i++) {
cin >> h[i];
if (h[i] <= m) {
ans++;
}
m = max(h[i], m);
}
cout << ans << endl;
} | #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 ((i) = (s); (i) < (g); ++(i))
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const ll MOD = 1e9 + 7;
const ll INF = (1ll << 60);
int main(void) {
int n;
ll ans = 0;
int m = 0;
cin >> n;
vector<int> h(n);
for (int i = 0; i < n; i++) {
cin >> h[i];
if (h[i] >= m) {
ans++;
}
m = max(h[i], m);
}
cout << ans << endl;
} | [
"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) {
ok = false;
break;
}
}
if (ok) {
count++;
}
}
cout << count + 1 << endl;
}
| #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) {
ok = false;
break;
}
}
if (ok) {
count++;
}
}
cout << count + 1 << endl;
}
| [
"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 >> h;
hmax = max(hmax, h);
if (h == hmax)
ans++;
}
cout << ans << endl;
} | #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;
cin >> h;
hmax = max(hmax, h);
if (h == hmax)
ans++;
}
cout << ans << endl;
} | [
"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;
}
}
if (flag) {
count++;
}
}
cout << count << 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.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;
}
}
if (flag) {
count++;
}
}
cout << count << endl;
} | [
"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;
}
}
if (flag) {
count++;
}
}
cout << count << 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.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;
}
}
if (flag) {
count++;
}
}
cout << count << endl;
} | [
"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(I, 0, N)
#define For(I, N) for (int I = 1; I <= (N); I++)
#define ALL(A) ((A).begin(), (A).end())
#define set0(ar) memset(ar, 0, sizeof ar)
#define vsort(v) sort(v.begin(), v.end())
#define setinf(ar) memset(ar, 126, sizeof ar)
#define SZ(X) ((int)(X.size()))
#define LG(X) ((int)(X.length()))
#define CL(X) (X).clear()
#define MAXEL(A, B) (*max_element(A, B))
#define MINEL(A, B) (*min_element(A, B))
#define ROPEN(X) freopen(X, "r", stdin)
#define WOPEN(X) freopen(X, "w", stdout)
#define BG(X) (X.begin())
#define EN(X) (X.end())
#define VI vector<int>
#define PII pair<int, int>
// cout << fixed << setprecision(20) << p << endl;
template <class T> inline T bigmod(T p, T e, T M) {
LL ret = 1;
for (; e > 0; e >>= 1) {
if (e & 1)
ret = (ret * p) % M;
p = (p * p) % M;
}
return (T)ret;
}
template <class T> inline T gcd(T a, T b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
template <class T> inline T modinverse(T a, T M) { return bigmod(a, M - 2, M); }
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
vector<int> v(n);
REP(i, n) { cin >> v[i]; }
LL res = 0;
int h = 0;
REP(i, n) {
if (v[i] >= h)
res++;
h = v[i];
}
cout << res << endl;
return 0;
}
| #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(I, 0, N)
#define For(I, N) for (int I = 1; I <= (N); I++)
#define ALL(A) ((A).begin(), (A).end())
#define set0(ar) memset(ar, 0, sizeof ar)
#define vsort(v) sort(v.begin(), v.end())
#define setinf(ar) memset(ar, 126, sizeof ar)
#define SZ(X) ((int)(X.size()))
#define LG(X) ((int)(X.length()))
#define CL(X) (X).clear()
#define MAXEL(A, B) (*max_element(A, B))
#define MINEL(A, B) (*min_element(A, B))
#define ROPEN(X) freopen(X, "r", stdin)
#define WOPEN(X) freopen(X, "w", stdout)
#define BG(X) (X.begin())
#define EN(X) (X.end())
#define VI vector<int>
#define PII pair<int, int>
// cout << fixed << setprecision(20) << p << endl;
template <class T> inline T bigmod(T p, T e, T M) {
LL ret = 1;
for (; e > 0; e >>= 1) {
if (e & 1)
ret = (ret * p) % M;
p = (p * p) % M;
}
return (T)ret;
}
template <class T> inline T gcd(T a, T b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
template <class T> inline T modinverse(T a, T M) { return bigmod(a, M - 2, M); }
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
vector<int> v(n);
REP(i, n) { cin >> v[i]; }
LL res = 0;
int h = 0;
REP(i, n) {
if (v[i] >= h) {
res++;
h = v[i];
}
}
cout << res << endl;
return 0;
}
| [] | 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(I, 0, N)
#define For(I, N) for (int I = 1; I <= (N); I++)
#define ALL(A) ((A).begin(), (A).end())
#define set0(ar) memset(ar, 0, sizeof ar)
#define vsort(v) sort(v.begin(), v.end())
#define setinf(ar) memset(ar, 126, sizeof ar)
#define SZ(X) ((int)(X.size()))
#define LG(X) ((int)(X.length()))
#define CL(X) (X).clear()
#define MAXEL(A, B) (*max_element(A, B))
#define MINEL(A, B) (*min_element(A, B))
#define ROPEN(X) freopen(X, "r", stdin)
#define WOPEN(X) freopen(X, "w", stdout)
#define BG(X) (X.begin())
#define EN(X) (X.end())
#define VI vector<int>
#define PII pair<int, int>
// cout << fixed << setprecision(20) << p << endl;
template <class T> inline T bigmod(T p, T e, T M) {
LL ret = 1;
for (; e > 0; e >>= 1) {
if (e & 1)
ret = (ret * p) % M;
p = (p * p) % M;
}
return (T)ret;
}
template <class T> inline T gcd(T a, T b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
template <class T> inline T modinverse(T a, T M) { return bigmod(a, M - 2, M); }
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
vector<int> v(n);
REP(i, n) { cin >> v[i]; }
int res = 0;
int h = 0;
REP(i, n) {
if (v[i] >= h)
res++;
h = v[i];
}
cout << res << endl;
return 0;
}
| #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(I, 0, N)
#define For(I, N) for (int I = 1; I <= (N); I++)
#define ALL(A) ((A).begin(), (A).end())
#define set0(ar) memset(ar, 0, sizeof ar)
#define vsort(v) sort(v.begin(), v.end())
#define setinf(ar) memset(ar, 126, sizeof ar)
#define SZ(X) ((int)(X.size()))
#define LG(X) ((int)(X.length()))
#define CL(X) (X).clear()
#define MAXEL(A, B) (*max_element(A, B))
#define MINEL(A, B) (*min_element(A, B))
#define ROPEN(X) freopen(X, "r", stdin)
#define WOPEN(X) freopen(X, "w", stdout)
#define BG(X) (X.begin())
#define EN(X) (X.end())
#define VI vector<int>
#define PII pair<int, int>
// cout << fixed << setprecision(20) << p << endl;
template <class T> inline T bigmod(T p, T e, T M) {
LL ret = 1;
for (; e > 0; e >>= 1) {
if (e & 1)
ret = (ret * p) % M;
p = (p * p) % M;
}
return (T)ret;
}
template <class T> inline T gcd(T a, T b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
template <class T> inline T modinverse(T a, T M) { return bigmod(a, M - 2, M); }
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
vector<int> v(n);
REP(i, n) { cin >> v[i]; }
LL res = 0;
int h = 0;
REP(i, n) {
if (v[i] >= h) {
res++;
h = v[i];
}
}
cout << res << endl;
return 0;
}
| [
"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(I, 0, N)
#define For(I, N) for (int I = 1; I <= (N); I++)
#define ALL(A) ((A).begin(), (A).end())
#define set0(ar) memset(ar, 0, sizeof ar)
#define vsort(v) sort(v.begin(), v.end())
#define setinf(ar) memset(ar, 126, sizeof ar)
#define SZ(X) ((int)(X.size()))
#define LG(X) ((int)(X.length()))
#define CL(X) (X).clear()
#define MAXEL(A, B) (*max_element(A, B))
#define MINEL(A, B) (*min_element(A, B))
#define ROPEN(X) freopen(X, "r", stdin)
#define WOPEN(X) freopen(X, "w", stdout)
#define BG(X) (X.begin())
#define EN(X) (X.end())
#define VI vector<int>
#define PII pair<int, int>
// cout << fixed << setprecision(20) << p << endl;
template <class T> inline T bigmod(T p, T e, T M) {
LL ret = 1;
for (; e > 0; e >>= 1) {
if (e & 1)
ret = (ret * p) % M;
p = (p * p) % M;
}
return (T)ret;
}
template <class T> inline T gcd(T a, T b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
template <class T> inline T modinverse(T a, T M) { return bigmod(a, M - 2, M); }
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
vector<int> v(n);
REP(i, n) { cin >> v[i]; }
int res = 0;
int h = 0;
REP(i, n) {
if (v[i] >= h)
res++;
h = v[i];
}
cout << res;
return 0;
}
| #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(I, 0, N)
#define For(I, N) for (int I = 1; I <= (N); I++)
#define ALL(A) ((A).begin(), (A).end())
#define set0(ar) memset(ar, 0, sizeof ar)
#define vsort(v) sort(v.begin(), v.end())
#define setinf(ar) memset(ar, 126, sizeof ar)
#define SZ(X) ((int)(X.size()))
#define LG(X) ((int)(X.length()))
#define CL(X) (X).clear()
#define MAXEL(A, B) (*max_element(A, B))
#define MINEL(A, B) (*min_element(A, B))
#define ROPEN(X) freopen(X, "r", stdin)
#define WOPEN(X) freopen(X, "w", stdout)
#define BG(X) (X.begin())
#define EN(X) (X.end())
#define VI vector<int>
#define PII pair<int, int>
// cout << fixed << setprecision(20) << p << endl;
template <class T> inline T bigmod(T p, T e, T M) {
LL ret = 1;
for (; e > 0; e >>= 1) {
if (e & 1)
ret = (ret * p) % M;
p = (p * p) % M;
}
return (T)ret;
}
template <class T> inline T gcd(T a, T b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
template <class T> inline T modinverse(T a, T M) { return bigmod(a, M - 2, M); }
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
vector<int> v(n);
REP(i, n) { cin >> v[i]; }
LL res = 0;
int h = 0;
REP(i, n) {
if (v[i] >= h) {
res++;
h = v[i];
}
}
cout << res << endl;
return 0;
}
| [
"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));
}
cout << count << endl;
}
| // 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));
}
cout << count << endl;
}
| [
"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 _ \
ios::sync_with_stdio(0); \
cin.tie(0);
#define vi vector<int>
#define ii pair<int, int>
#define vii vector<ii>
#define ll long long
#define vll vector<ll>
#define flush fflush(stdout)
const int INF = 1e8;
const ll MOD = 1e9 + 7;
using namespace std;
int main() {
_
int t = 1;
cin >> t;
vi v;
int aux;
int ans = 0;
rep(i, 0, t) {
cin >> aux;
bool y = 1;
rep(j, 0, v.size()) if (v[i] > aux) y = 0;
v.pb(aux);
if (y)
ans++;
}
cout << ans;
cn;
return 0;
} |
#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 _ \
ios::sync_with_stdio(0); \
cin.tie(0);
#define vi vector<int>
#define ii pair<int, int>
#define vii vector<ii>
#define ll long long
#define vll vector<ll>
#define flush fflush(stdout)
const int INF = 1e8;
const ll MOD = 1e9 + 7;
using namespace std;
int main() {
_
int t = 1;
cin >> t;
vi v;
int aux;
int ans = 0;
rep(i, 0, t) {
cin >> aux;
bool y = 1;
rep(j, 0, v.size()) if (v[j] > aux) y = 0;
v.pb(aux);
if (y)
ans++;
}
cout << ans;
cn;
return 0;
} | [
"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;
hantei = 0;
}
}
if (hantei == 1) {
sum += 1;
}
}
cout << sum << endl;
return 0;
}
| #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;
break;
}
}
if (hantei == 1) {
sum += 1;
}
}
cout << sum << endl;
return 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) cin >> h[i];
int ans = 0;
for (int i = 1; i < n; i++) {
for (int j = 0; j <= i; j++) {
if (h[j] > h[i])
break;
if (j == i)
ans++;
}
}
cout << ans << endl;
} | #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) cin >> h[i];
int ans = 1;
for (int i = 1; i < n; i++) {
for (int j = 0; j <= i; j++) {
if (h[j] > h[i])
break;
if (j == i)
ans++;
}
}
cout << ans << endl;
} | [
"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) {
int M = *max_element(h.begin(), h.begin() + i + 1);
if (M == h[i]) {
j++;
}
}
cout << j + 1 << endl;
}
| #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) {
int M = *max_element(h.begin(), h.begin() + i + 1);
if (M == h[i]) {
j++;
}
}
cout << j << endl;
}
| [
"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))
max = A.at(i + 1);
}
cout << count << 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.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))
max = A.at(i + 1);
}
cout << count << endl;
} | [
"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) (x).begin(), (x).end()
#define CST(x) cout << fixed << setprecision(x)
using ll = long long;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using pl = pair<ll, ll>;
const ll MOD = 1000000007;
const ll MOD9 = 998244353;
const int inf = 1e9;
const ll INF = 4e18;
const ll dy[4] = {1, 0, -1, 0};
const ll dx[4] = {0, -1, 0, 1};
int main() {
int N;
cin >> N;
vector<int> vec(N);
rep(i, N) { cin >> vec.at(i); }
int count = 1;
int counting = 0;
repl(i, 1, N) {
rep(j, i) {
if (vec.at(j) <= vec.at(i)) {
counting++;
}
if (counting == i) {
count++;
}
counting = 0;
}
}
cout << count << endl;
}
| #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) (x).begin(), (x).end()
#define CST(x) cout << fixed << setprecision(x)
using ll = long long;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using pl = pair<ll, ll>;
const ll MOD = 1000000007;
const ll MOD9 = 998244353;
const int inf = 1e9;
const ll INF = 4e18;
const ll dy[4] = {1, 0, -1, 0};
const ll dx[4] = {0, -1, 0, 1};
int main() {
int N;
cin >> N;
vector<int> vec(N);
rep(i, N) { cin >> vec.at(i); }
int count = 1;
int counting = 0;
repl(i, 1, N) {
rep(j, i) {
if (vec.at(j) <= vec.at(i)) {
counting++;
}
}
if (counting == i) {
count++;
}
counting = 0;
}
cout << count << endl;
}
| [] | 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) (x).begin(), (x).end()
#define CST(x) cout << fixed << setprecision(x)
using ll = long long;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using pl = pair<ll, ll>;
const ll MOD = 1000000007;
const ll MOD9 = 998244353;
const int inf = 1e9;
const ll INF = 4e18;
const ll dy[4] = {1, 0, -1, 0};
const ll dx[4] = {0, -1, 0, 1};
int main() {
int N;
cin >> N;
vector<int> vec(N);
rep(i, N) { cin >> vec.at(i); }
int count = 1;
int counting = 0;
repl(i, 1, N) {
rep(j, i) {
if (vec.at(j) <= vec.at(i)) {
counting++;
}
if (counting == i) {
count++;
}
}
}
cout << count << endl;
}
| #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) (x).begin(), (x).end()
#define CST(x) cout << fixed << setprecision(x)
using ll = long long;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using pl = pair<ll, ll>;
const ll MOD = 1000000007;
const ll MOD9 = 998244353;
const int inf = 1e9;
const ll INF = 4e18;
const ll dy[4] = {1, 0, -1, 0};
const ll dx[4] = {0, -1, 0, 1};
int main() {
int N;
cin >> N;
vector<int> vec(N);
rep(i, N) { cin >> vec.at(i); }
int count = 1;
int counting = 0;
repl(i, 1, N) {
rep(j, i) {
if (vec.at(j) <= vec.at(i)) {
counting++;
}
}
if (counting == i) {
count++;
}
counting = 0;
}
cout << count << endl;
}
| [
"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)
ans++;
mi = max(mi, h);
}
cout << ans << endl;
return 0;
}
| #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)
ans++;
mi = max(mi, h);
}
cout << ans << endl;
return 0;
}
| [
"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()
#define debug(x) cout << #x << " = " << (x) << endl;
#define SORT(x) sort(all(x));
#define RSORT(x) sort(rall(x));
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vd = vector<double>;
using vb = vector<bool>;
using pii = pair<int, int>;
using vc = vector<char>;
using vvc = vector<vc>;
using vs = vector<string>;
using tiii = tuple<int, int, int>;
const ll inf = 1ll << 29;
const ll mod = 1000000007;
const double eps = 1e-9;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int main() {
int N;
cin >> N;
vi H(N);
rep(i, N) cin >> H.at(i);
int ans = 0;
int max_H = 0;
rep(i, N) {
if (max_H <= H.at(i))
ans++;
max_H = H.at(i);
}
cout << ans << endl;
} | #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()
#define debug(x) cout << #x << " = " << (x) << endl;
#define SORT(x) sort(all(x));
#define RSORT(x) sort(rall(x));
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vd = vector<double>;
using vb = vector<bool>;
using pii = pair<int, int>;
using vc = vector<char>;
using vvc = vector<vc>;
using vs = vector<string>;
using tiii = tuple<int, int, int>;
const ll inf = 1ll << 29;
const ll mod = 1000000007;
const double eps = 1e-9;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int main() {
int N;
cin >> N;
vi H(N);
rep(i, N) cin >> H.at(i);
int ans = 0;
int max_H = 0;
rep(i, N) {
if (max_H <= H.at(i)) {
ans++;
max_H = H.at(i);
}
}
cout << ans << endl;
} | [] | 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.