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 |
|---|---|---|---|---|---|---|---|
p03072 | #include <iostream>
int n;
// int a[30];
int a = 0, b;
int c = 1;
int main() {
std::cin >> n;
for (int i = 0; i < n; i++) {
std::cin >> b;
if (a < b)
a = b;
else {
c++;
}
}
std::cout << c;
} | #include <iostream>
int n;
int a = 0, b;
int c = 0;
int main() {
std::cin >> n;
for (int i = 0; i < n; i++) {
std::cin >> b;
if (a <= b) {
a = b;
c++;
}
}
std::cout << c;
} | [
"literal.number.change",
"variable_declaration.value.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 882,941 | 882,939 | u261026404 | cpp |
p03072 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> H(N, 0);
for (int i = 0; i < N; ++i)
cin >> H[i];
int ans = 0;
int wall = 0;
for (int i = 0; i < N; ++i) {
if (H[i] > wall) {
ans++;
wall = H[i];
}
}
cout << ans << endl;
} | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> H(N, 0);
for (int i = 0; i < N; ++i)
cin >> H[i];
int ans = 0;
int wall = 0;
for (int i = 0; i < N; ++i) {
if (H[i] >= wall) {
ans++;
wall = H[i];
}
}
cout << ans << endl;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 882,947 | 882,948 | u010218093 | cpp |
p03072 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int count = 0;
int *h = new int[n];
for (int i = 0; i < n; i++) {
int tmp;
cin >> tmp;
h[i] = tmp;
bool b = false;
for (int j = 0; j < i; j++) {
b = b || h[i] >= h[j];
}
if (b || i == 0)
count++;
}
cout << count;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int count = 0;
int *h = new int[n];
for (int i = 0; i < n; i++) {
int tmp;
cin >> tmp;
h[i] = tmp;
bool b = true;
for (int j = 0; j < i; j++) {
b = b && h[i] >= h[j];
}
if (b || i == 0)
count++;
}
cout << count;
return 0;
}
| [
"misc.opposites",
"variable_declaration.value.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 882,965 | 882,966 | u884491303 | cpp |
p03072 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int count = 0;
int *h = new int[n];
for (int i = 0; i < n; i++) {
int tmp;
cin >> tmp;
h[i] = tmp;
bool b = false;
for (int j = 0; j < i; j++) {
b = b || h[i] > h[j];
}
if (b || i == 0)
count++;
}
cout << count;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int count = 0;
int *h = new int[n];
for (int i = 0; i < n; i++) {
int tmp;
cin >> tmp;
h[i] = tmp;
bool b = true;
for (int j = 0; j < i; j++) {
b = b && h[i] >= h[j];
}
if (b || i == 0)
count++;
}
cout << count;
return 0;
}
| [
"misc.opposites",
"variable_declaration.value.change",
"assignment.value.change",
"expression.operation.binary.change",
"expression.operator.compare.change"
] | 882,967 | 882,966 | u884491303 | cpp |
p03072 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> h(n);
int count = 0;
bool t = 0;
for (int i = 0; i < n; i++) {
cin >> h.at(i);
for (int j = 0; j < i; j++) {
if (h.at(j) <= h.at(i)) {
t = 1;
}
}
if (t == 1)
++count;
t = 0;
}
cout << count + 1 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> h(n);
int count = 0;
bool t = 0;
for (int i = 0; i < n; i++) {
cin >> h.at(i);
for (int j = 0; j < i; j++) {
if (h.at(j) > h.at(i)) {
t = 1;
}
}
if (t == 0)
++count;
t = 0;
}
cout << count << endl;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.number.change",
"expression.operation.binary.remove"
] | 882,989 | 882,990 | u371237856 | cpp |
p03072 | #include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int n;
scanf("%d", &n);
int h, h0 = 0, cnt = 0;
for (int i = 1; i <= n; i++) {
scanf("%d", &h);
if (h >= h0)
cnt++;
h0 = h;
}
printf("%d", cnt);
return 0;
} | #include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int n;
scanf("%d", &n);
int h, h0 = 0, cnt = 0;
for (int i = 1; i <= n; i++) {
scanf("%d", &h);
if (h >= h0) {
cnt++;
h0 = h;
}
}
printf("%d", cnt);
return 0;
} | [] | 882,994 | 882,995 | u713012891 | cpp |
p03072 | #include <iostream>
using namespace std;
int main() {
int n;
scanf("%d", &n);
int s[n];
for (int i = 0; i < n; i++) {
int temp;
scanf("%d", &temp);
s[i] = temp;
}
int cnt = 1;
if (n == 1) {
cout << cnt;
return 0;
}
int MAx = s[0];
for (int i = 1; i < n; i++) {
if (s[i] > MAx) {
MAx = s[i];
cnt++;
}
}
cout << cnt << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n;
scanf("%d", &n);
int s[n];
for (int i = 0; i < n; i++) {
int temp;
scanf("%d", &temp);
s[i] = temp;
}
int cnt = 1;
if (n == 1) {
cout << cnt;
return 0;
}
int MAx = s[0];
for (int i = 1; i < n; i++) {
if (s[i] >= MAx) {
MAx = s[i];
cnt++;
}
}
cout << cnt << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 882,996 | 882,997 | u198624562 | cpp |
p03072 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int h[n];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
int c = 0;
int m = h[0];
for (int i = 0; i < n; i++) {
if (m <= h[i]) {
c++;
m = h[i];
}
}
cout << m << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int h[n];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
int c = 0;
int m = h[0];
for (int i = 0; i < n; i++) {
if (m <= h[i]) {
c++;
m = h[i];
}
}
cout << c << endl;
}
| [
"identifier.change",
"io.output.change"
] | 883,009 | 883,010 | u704064492 | cpp |
p03072 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int maxH = 0;
int H;
int answer = 0;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> H;
if (H >= maxH)
answer++;
maxH = H;
}
cout << answer;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int maxH = 0;
int H;
int answer = 0;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> H;
if (H >= maxH) {
answer++;
maxH = H;
}
}
cout << answer;
return 0;
} | [] | 883,023 | 883,024 | u038569501 | cpp |
p03072 | //
// Created by yuu on 2019-04-16.
//
#include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main(void) {
int A;
vector<int> H;
for (int i = 0; i < A; ++i) {
int temp;
cin >> temp;
H.push_back(temp);
}
int ans = 0;
int max = -1;
for (int j = 0; j < H.size(); ++j) {
if (max <= H[j]) {
ans++;
max = H[j];
}
}
cout << ans << endl;
return 0;
} | //
// Created by yuu on 2019-04-16.
//
#include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main(void) {
int A;
cin >> A;
vector<int> H;
for (int i = 0; i < A; ++i) {
int temp;
cin >> temp;
H.push_back(temp);
}
int ans = 0;
int max = -1;
for (int j = 0; j < H.size(); ++j) {
if (max <= H[j]) {
ans++;
max = H[j];
}
}
cout << ans << endl;
return 0;
} | [] | 883,025 | 883,026 | u149583407 | 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 counter = 0;
bool f;
for (int i = 0; i < N; i++) {
f = false;
for (int j = 0; j <= i; j++) {
if (H[i] <= H[j])
f = true;
}
if (f == false)
counter++;
}
cout << counter;
}
| #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 counter = 0;
bool f;
for (int i = 0; i < N; i++) {
f = false;
for (int j = 0; j <= i; j++) {
if (H[i] < H[j])
f = true;
}
if (f == false)
counter++;
}
cout << counter;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 883,027 | 883,028 | u166632863 | 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 counter = 0;
bool f;
for (int i = 0; i < N; i++) {
f = false;
for (int j = 0; j <= i; j++) {
if (H[i] >= H[j])
f = true;
}
if (f == false)
counter++;
}
cout << counter;
}
| #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 counter = 0;
bool f;
for (int i = 0; i < N; i++) {
f = false;
for (int j = 0; j <= i; j++) {
if (H[i] < H[j])
f = true;
}
if (f == false)
counter++;
}
cout << counter;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 883,029 | 883,028 | u166632863 | 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 counter = 0;
bool f;
for (int i = 0; i < N; i++) {
f = false;
for (int j = 0; j <= i; j++) {
if (H[i] >= H[j])
f = true;
}
if (f)
counter++;
}
cout << counter;
}
| #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 counter = 0;
bool f;
for (int i = 0; i < N; i++) {
f = false;
for (int j = 0; j <= i; j++) {
if (H[i] < H[j])
f = true;
}
if (f == false)
counter++;
}
cout << counter;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 883,030 | 883,028 | u166632863 | cpp |
p03072 | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int h[100];
for (int i = 0; i < N; i++)
cin >> h[i];
int ma = h[0];
int ans = 1;
for (int i = 1; i < N; i++) {
if (h[i] > ma) {
ma = h[i];
ans++;
}
}
cout << ans << endl;
} | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int h[100];
for (int i = 0; i < N; i++)
cin >> h[i];
int ma = h[0];
int ans = 1;
for (int i = 1; i < N; i++) {
if (h[i] >= ma) {
ma = h[i];
ans++;
}
}
cout << ans << endl;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 883,042 | 883,043 | u058186113 | 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 max = 0;
for (int i = 0; i < N; i++) {
int count = 0;
for (int j = 0; j < i; j++) {
if (H[i] < H[j]) {
break;
}
}
if (count = i) {
max += 1;
}
}
cout << max << endl;
}
| #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 max = 0;
for (int i = 0; i < N; i++) {
int count = 0;
for (int j = 0; j < i; j++) {
if (H[i] < H[j]) {
break;
}
count++;
}
if (count == i) {
max += 1;
}
}
cout << max << endl;
}
| [
"expression.unary.arithmetic.add",
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 883,044 | 883,045 | u416234344 | cpp |
p03072 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> h(n);
int count = 0;
for (int i = 0; i < n; i++) {
cin >> h.at(i);
}
int tmp = -1;
for (int i = 0; i < n; i++) {
if (tmp < h.at(i)) {
count++;
tmp = h.at(i);
}
}
cout << count << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> h(n);
int count = 0;
for (int i = 0; i < n; i++) {
cin >> h.at(i);
}
int tmp = -1;
for (int i = 0; i < n; i++) {
if (tmp <= h.at(i)) {
count++;
tmp = h.at(i);
}
}
cout << count << endl;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 883,055 | 883,056 | u735909278 | cpp |
p03072 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory>
#include <numeric>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, a, b) for (int i = (a); i < (b); ++i)
#define all(x) (x).begin(), (x).end()
#define MOD 1000000007
#define int long long
using ll = long long;
using namespace std;
const int INF = 1LL << 50;
using P = pair<int, int>;
template <class T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
} else {
return false;
}
}
template <class T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
} else {
return false;
}
}
struct Setup {
Setup() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
}
} SETUP;
signed main() {
int n;
cin >> n;
vector<int> hs(n);
rep(i, 0, n) {
int h;
cin >> h;
hs[i] = h;
}
int ans = 0;
int nax = -1;
rep(r, 0, n) {
if (nax < hs[r]) {
ans++;
nax = hs[r];
}
}
cout << ans << endl;
}
| #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory>
#include <numeric>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, a, b) for (int i = (a); i < (b); ++i)
#define all(x) (x).begin(), (x).end()
#define MOD 1000000007
#define int long long
using ll = long long;
using namespace std;
const int INF = 1LL << 50;
using P = pair<int, int>;
template <class T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
} else {
return false;
}
}
template <class T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
} else {
return false;
}
}
struct Setup {
Setup() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
}
} SETUP;
signed main() {
int n;
cin >> n;
vector<int> hs(n);
rep(i, 0, n) {
int h;
cin >> h;
hs[i] = h;
}
int ans = 0;
int nax = -1;
rep(r, 0, n) {
if (nax <= hs[r]) {
ans++;
nax = hs[r];
}
}
cout << ans << endl;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 883,061 | 883,062 | u377777817 | cpp |
p03072 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N;
int H[110];
cin >> N;
for (int i = 0; i < N; ++i)
cin >> H[i];
int hotel = 1;
int max = H[0];
for (int i = 1; i < N; ++i) {
if (H[i] > max) {
++hotel;
max = H[i];
}
}
cout << hotel << endl;
}
| #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N;
int H[110];
cin >> N;
for (int i = 0; i < N; ++i)
cin >> H[i];
int hotel = 1;
int max = H[0];
for (int i = 1; i < N; ++i) {
if (H[i] >= max) {
++hotel;
max = H[i];
}
}
cout << hotel << endl;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 883,065 | 883,066 | u281876921 | cpp |
p03072 | #define _USE_NATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define REP(i, m, n) for (int i = (int)m; i < (int)n; ++i)
#define rep(i, n) REP(i, 0, n)
using namespace std;
#define INF 100000000
int main() {
int n;
cin >> n;
int h[30];
int cnt = 0;
int target = 0;
rep(i, n) cin >> h[i];
rep(i, n) {
if (h[i] >= target)
cnt++;
target = h[i];
}
cout << cnt << endl;
return 0;
} | #define _USE_NATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define REP(i, m, n) for (int i = (int)m; i < (int)n; ++i)
#define rep(i, n) REP(i, 0, n)
using namespace std;
#define INF 100000000
int main() {
int n;
cin >> n;
int h[30];
int cnt = 0;
int target = 0;
rep(i, n) cin >> h[i];
rep(i, n) {
if (h[i] >= target) {
cnt++;
target = h[i];
}
}
cout << cnt << endl;
return 0;
} | [] | 883,077 | 883,078 | u419390395 | cpp |
p03072 | #define _USE_NATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define REP(i, m, n) for (int i = (int)m; i < (int)n; ++i)
#define rep(i, n) REP(i, 0, n)
using namespace std;
int main() {
int n;
int h[25];
cin >> n;
rep(i, n) cin >> h[i];
int ans = 1;
int target = h[0];
for (int i = 1; i <= n; ++i) {
if (target <= h[i]) {
ans++;
target = h[i];
}
}
cout << ans << endl;
return 0;
} | #define _USE_NATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define REP(i, m, n) for (int i = (int)m; i < (int)n; ++i)
#define rep(i, n) REP(i, 0, n)
using namespace std;
int main() {
int n;
int h[25];
cin >> n;
rep(i, n) cin >> h[i];
int ans = 0;
int target = h[0];
for (int i = 0; i < n; ++i) {
if (target <= h[i]) {
ans++;
target = h[i];
}
}
cout << ans << endl;
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 883,079 | 883,080 | u419390395 | 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.at(i);
}
int counter = 1;
int ma = -1;
for (int j = 0; j < N; j++) {
if (H[j] >= ma) {
counter = counter + 1;
ma = H[j];
}
}
cout << counter << endl;
} | #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.at(i);
}
int counter = 0;
int ma = -1;
for (int j = 0; j < N; j++) {
if (H[j] >= ma) {
counter = counter + 1;
ma = H[j];
}
}
cout << counter << endl;
} | [
"literal.number.change",
"variable_declaration.value.change"
] | 883,087 | 883,088 | u655048024 | cpp |
p03072 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, n, b, s = 0, k = 0;
cin >> n;
int ar[n + 2];
for (int i = 0; i < n; i++) {
cin >> ar[i];
}
for (int i = n - 1; i >= 1; i--) {
for (int j = 0; j < i - 1; j++) {
if (ar[i] >= ar[j]) {
continue;
}
k++;
break;
}
if (k == 0) {
s++;
} else {
k = 0;
}
}
cout << s << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, n, b, s = 1, k = 0;
cin >> n;
int ar[n + 2];
for (int i = 0; i < n; i++) {
cin >> ar[i];
}
for (int i = n - 1; i >= 1; i--) {
for (int j = 0; j <= i - 1; j++) {
if (ar[i] >= ar[j]) {
continue;
}
k++;
break;
}
if (k == 0) {
s++;
} else {
k = 0;
}
}
cout << s << endl;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 883,099 | 883,100 | u671802527 | cpp |
p03072 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, ans = 0;
cin >> N;
vector<int> h(N);
for (int i = 0; i < N; i++) {
cin >> h.at(i);
}
for (int i = 0; i < N; i++) {
int count = 0;
for (int j = 0; j < i; j++) {
if (h.at(i) >= h.at(j)) {
count++;
} else {
break;
}
if (count = j) {
ans++;
}
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, ans = 1;
cin >> N;
vector<int> h(N);
for (int i = 0; i < N; i++) {
cin >> h.at(i);
}
for (int i = 0; i < N; i++) {
int count = 0;
for (int j = 0; j < i; j++) {
if (h.at(i) >= h.at(j)) {
count++;
} else {
break;
}
if (count == i) {
ans++;
break;
}
}
}
cout << ans << endl;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.condition.change"
] | 883,110 | 883,111 | u181519552 | cpp |
p03072 | #include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;
#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x, to) for (x = 0; x < (to); x++)
#define FORR(x, arr) for (auto &x : arr)
#define ITR(x, c) for (__typeof(c.begin()) x = c.begin(); x != c.end(); x++)
#define ALL(a) (a.begin()), (a.end())
#define ZERO(a) memset(a, 0, sizeof(a))
#define MINUS(a) memset(a, 0xff, sizeof(a))
//-------------------------------------------------------
int N;
int H[101];
void solve() {
int i, j, k, l, r, x, y;
string s;
cin >> N;
int ma = 0, ret = 0;
FOR(i, N) {
cin >> H[i];
if (ma <= H[i])
ret++;
ma = max(ma, H[i]);
}
cout << ma << endl;
}
int main(int argc, char **argv) {
string s;
int i;
if (argc == 1)
ios::sync_with_stdio(false), cin.tie(0);
FOR(i, argc - 1) s += argv[i + 1], s += '\n';
FOR(i, s.size()) ungetc(s[s.size() - 1 - i], stdin);
cout.tie(0);
solve();
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;
#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x, to) for (x = 0; x < (to); x++)
#define FORR(x, arr) for (auto &x : arr)
#define ITR(x, c) for (__typeof(c.begin()) x = c.begin(); x != c.end(); x++)
#define ALL(a) (a.begin()), (a.end())
#define ZERO(a) memset(a, 0, sizeof(a))
#define MINUS(a) memset(a, 0xff, sizeof(a))
//-------------------------------------------------------
int N;
int H[101];
void solve() {
int i, j, k, l, r, x, y;
string s;
cin >> N;
int ma = 0, ret = 0;
FOR(i, N) {
cin >> H[i];
if (ma <= H[i])
ret++;
ma = max(ma, H[i]);
}
cout << ret << endl;
}
int main(int argc, char **argv) {
string s;
int i;
if (argc == 1)
ios::sync_with_stdio(false), cin.tie(0);
FOR(i, argc - 1) s += argv[i + 1], s += '\n';
FOR(i, s.size()) ungetc(s[s.size() - 1 - i], stdin);
cout.tie(0);
solve();
return 0;
}
| [
"identifier.change",
"io.output.change"
] | 883,112 | 883,113 | u452725238 | cpp |
p03072 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, c;
cin >> a;
vector<int> b(a);
c = 0;
for (int i = 0; i < a; i++) {
cin >> b[i];
if (i > 0) {
if (b[i] >= b[i - 1]) {
c++;
}
b[i] = max(b[i], b[i - 1]);
}
}
cout << c << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, c;
cin >> a;
vector<int> b(a);
c = 0;
for (int i = 0; i < a; i++) {
cin >> b[i];
if (i > 0) {
if (b[i] >= b[i - 1]) {
c++;
}
b[i] = max(b[i], b[i - 1]);
}
}
cout << c + 1 << endl;
}
| [
"expression.operation.binary.add"
] | 883,114 | 883,115 | u902787159 | cpp |
p03072 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> H(N);
for (int num = 0; num < N; ++num) {
cin >> H[num];
}
int k = 0;
for (int num = 0; num < N; ++num) {
bool s = true;
for (int t = 0; num > t; ++t) {
if (H[t] < H[num]) {
s = false;
break;
}
}
if (s) {
++k;
}
}
cout << k << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> H(N);
for (int num = 0; num < N; ++num) {
cin >> H[num];
}
int k = 0;
for (int num = 0; num < N; ++num) {
bool s = true;
for (int t = 0; num > t; ++t) {
if (H[t] > H[num]) {
s = false;
break;
}
}
if (s) {
++k;
}
}
cout << k << endl;
return 0;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 883,127 | 883,128 | u006521935 | cpp |
p03072 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> H(N);
for (int num = 0; num < N; ++num) {
cin >> H[num];
}
int k = 0;
for (int num = 0; num < N; ++num) {
bool s = true;
for (int t = 0; num > t; ++t) {
if (H[t] < H[s]) {
s = false;
break;
}
}
if (s) {
++k;
}
}
cout << k << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> H(N);
for (int num = 0; num < N; ++num) {
cin >> H[num];
}
int k = 0;
for (int num = 0; num < N; ++num) {
bool s = true;
for (int t = 0; num > t; ++t) {
if (H[t] > H[num]) {
s = false;
break;
}
}
if (s) {
++k;
}
}
cout << k << endl;
return 0;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 883,129 | 883,128 | u006521935 | cpp |
p03072 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> H(N);
for (int num = 0; num < N; ++num) {
cin >> H[num];
}
int k = 0;
for (int num = 0; num < N; ++num) {
bool s = true;
for (int t = 0; num < t; ++t) {
if (H[t] < H[s]) {
s = false;
break;
}
}
if (s) {
++k;
}
}
cout << k << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> H(N);
for (int num = 0; num < N; ++num) {
cin >> H[num];
}
int k = 0;
for (int num = 0; num < N; ++num) {
bool s = true;
for (int t = 0; num > t; ++t) {
if (H[t] > H[num]) {
s = false;
break;
}
}
if (s) {
++k;
}
}
cout << k << endl;
return 0;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 883,130 | 883,128 | u006521935 | cpp |
p03072 | #include <algorithm>
#include <iostream>
#include <sstream>
#include <stdexcept>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
int h[n];
int ans = 0;
for (int q = 0; q < n; q++) {
cin >> h[q];
}
if (n == 1)
cout << '1' << endl;
else {
if (h[0] <= h[1])
ans++;
for (int i = 2; i < n; i++) {
int res = 0;
for (int j = 0; j < i - 1; j++) {
if (h[j] <= h[i])
res++;
}
if (res == i - 1)
ans++;
}
cout << ans + 1 << endl;
}
return 0;
} | #include <algorithm>
#include <iostream>
#include <sstream>
#include <stdexcept>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
int h[n];
int ans = 0;
for (int q = 0; q < n; q++) {
cin >> h[q];
}
if (n == 1)
cout << '1' << endl;
else {
if (h[0] <= h[1])
ans++;
for (int i = 2; i < n; i++) {
int res = 0;
for (int j = 0; j < i; j++) {
if (h[j] <= h[i])
res++;
}
if (res == i)
ans++;
}
cout << ans + 1 << endl;
}
return 0;
} | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 883,137 | 883,138 | u139300044 | cpp |
p03072 | #include <iostream>
using namespace std;
int main(void) {
int a;
cin >> a;
int s[20];
int i = 0;
for (int i = 0; i < a; i++) {
cin >> s[i];
}
int ans = 1;
for (int j = 0; j < a; j++) {
for (int p = 0; p < j; p++) {
if (s[j] < s[p]) {
break;
}
if (p == j - 1) {
ans = ans++;
}
}
}
cout << ans << endl;
return 0;
} | #include <iostream>
using namespace std;
int main(void) {
int a;
cin >> a;
int s[20];
int i = 0;
for (int i = 0; i < a; i++) {
cin >> s[i];
}
int ans = 1;
for (int j = 0; j < a; j++) {
for (int p = 0; p < j; p++) {
if (s[j] < s[p]) {
break;
}
if (p == j - 1) {
ans++;
}
}
}
cout << ans << endl;
return 0;
} | [
"assignment.change"
] | 883,145 | 883,146 | u543434391 | cpp |
p03072 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d;
c = 0;
cin >> a;
for (int i = 0; i < a; i++) {
cin >> b;
if (b >= c) {
d++;
c = b;
}
}
cout << d << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d;
c = 0;
d = 0;
cin >> a;
for (int i = 0; i < a; i++) {
cin >> b;
if (b >= c) {
d++;
c = b;
}
}
cout << d << endl;
} | [
"assignment.add"
] | 883,154 | 883,155 | u618604643 | cpp |
p03072 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d;
d = 0;
c = 0;
cin >> a;
for (int i = 0; i < a; i++) {
cin >> b;
if (b >= c) {
d++;
}
c = b;
}
cout << d << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d;
c = 0;
d = 0;
cin >> a;
for (int i = 0; i < a; i++) {
cin >> b;
if (b >= c) {
d++;
c = b;
}
}
cout << d << endl;
} | [
"assignment.variable.change",
"identifier.change"
] | 883,157 | 883,155 | u618604643 | cpp |
p03072 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d;
c = 0;
cin >> a;
for (int i = 0; i < a; i++) {
cin >> b;
if (b >= c) {
d++;
}
c = b;
}
cout << d << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d;
c = 0;
d = 0;
cin >> a;
for (int i = 0; i < a; i++) {
cin >> b;
if (b >= c) {
d++;
c = b;
}
}
cout << d << endl;
} | [
"assignment.add"
] | 883,158 | 883,155 | u618604643 | cpp |
p03072 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d;
c = 0;
cin >> a;
for (int i = 0; i < a; i++) {
cin >> b;
if (b >= c)
d++;
c = b;
}
cout << d << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d;
c = 0;
d = 0;
cin >> a;
for (int i = 0; i < a; i++) {
cin >> b;
if (b >= c) {
d++;
c = b;
}
}
cout << d << endl;
} | [
"assignment.add"
] | 883,160 | 883,155 | u618604643 | cpp |
p03072 | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int n;
cin >> n;
int max = 0;
int count = 0;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
if (a > max) {
max = a;
count++;
}
}
cout << count;
return 0;
} | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int n;
cin >> n;
int max = 0;
int count = 0;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
if (a >= max) {
max = a;
count++;
}
}
cout << count;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 883,161 | 883,162 | u619101331 | cpp |
p03072 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define VV vector
#define pb push_back
#define bitc __builtin_popcountl
#define m_p make_pair
#define inf 1000000000000000000
#define MAXN 1000001
#define eps 0.0000000001
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
string char_to_str(char c) {
string tem(1, c);
return tem;
}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
template <class T> // usage rand<long long>()
T rand() {
return uniform_int_distribution<T>()(rng);
}
// string to integer stuuu()
// string to long long stoll()
// string.substr(position,length);
// integer to string to_string();
//////////////
#define S second
#define F first
// #define int long long
//////////
signed main() {
fastio;
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; ++i)
cin >> a[i];
int ma = 0;
int ans = 0;
for (int i = 0; i < n; ++i)
if (a[i] > ma) {
ans++;
ma = a[i];
}
cout << ans;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define VV vector
#define pb push_back
#define bitc __builtin_popcountl
#define m_p make_pair
#define inf 1000000000000000000
#define MAXN 1000001
#define eps 0.0000000001
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
string char_to_str(char c) {
string tem(1, c);
return tem;
}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
template <class T> // usage rand<long long>()
T rand() {
return uniform_int_distribution<T>()(rng);
}
// string to integer stuuu()
// string to long long stoll()
// string.substr(position,length);
// integer to string to_string();
//////////////
#define S second
#define F first
// #define int long long
//////////
signed main() {
fastio;
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; ++i)
cin >> a[i];
int ma = 0;
int ans = 0;
for (int i = 0; i < n; ++i)
if (a[i] >= ma) {
ans++;
ma = a[i];
}
cout << ans;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 883,163 | 883,164 | u883546077 | cpp |
p03072 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int highest = 0;
int num = 0;
cin >> N;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
if (a > highest) {
highest = a;
num++;
}
}
cout << num << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int highest = 0;
int num = 0;
cin >> N;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
if (a >= highest) {
highest = a;
num++;
}
}
cout << num << endl;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 883,167 | 883,168 | u778484787 | cpp |
p03072 | #include <iostream>
using namespace std;
int main() {
int N, max, look = 1, i;
int Mount[100];
cin >> N;
for (i = 0; i < N; i++)
cin >> Mount[i];
max = Mount[0];
for (i = 1; i < N; i++) {
if (max < Mount[i]) {
max = Mount[i];
look = look + 1;
} else if (max == Mount[i])
look = look;
1;
}
printf("%d", look);
return 0;
} | #include <iostream>
using namespace std;
int main() {
int N, max, look = 1, i;
int Mount[100];
cin >> N;
for (i = 0; i < N; i++)
cin >> Mount[i];
max = Mount[0];
for (i = 1; i < N; i++) {
if (max < Mount[i]) {
max = Mount[i];
look = look + 1;
} else if (max == Mount[i])
look = look + 1;
}
printf("%d", look);
return 0;
} | [
"assignment.value.change"
] | 883,175 | 883,176 | u732647191 | cpp |
p03072 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> H;
for (int i = 0; i < N; ++i) {
int h;
cin >> h;
H.push_back(h);
}
int ans = 1;
for (int i = 1; i < N; ++i) {
int flag = 1;
for (int j = 0; j < i - 1; ++j) {
if (H[j] > H[i]) {
flag = 0;
}
}
if (flag == 1) {
ans++;
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> H;
for (int i = 0; i < N; ++i) {
int h;
cin >> h;
H.push_back(h);
}
int ans = 1;
for (int i = 1; i < N; ++i) {
int flag = 1;
for (int j = 0; j < i; ++j) {
if (H[j] > H[i]) {
flag = 0;
}
}
if (flag == 1) {
ans++;
}
}
cout << ans << endl;
return 0;
} | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 883,177 | 883,178 | u826487371 | cpp |
p03072 | #include <bits/stdc++.h>
#define vel vector<long long>
#define veb vector<bool>
#define vvel vector<vel>
#define int long long
#define pin pair<int, int>
#define ppin pair<int, pin>
#define mkp make_pair
#define rep(i, n) for (int i = 0; i < n; i++)
#define maxel(vec, j) *max_element(vec.begin(), vec.begin() + j)
using namespace std;
void mmin(int &a, int b) { a = min(a, b); }
void mmax(int &a, int b) { a = max(a, b); }
signed main() {
int pr = 1000;
pr *= pr * pr;
pr += 7;
int n;
cin >> n;
vel h(n);
rep(i, n) { cin >> h[i]; }
int count = 0;
rep(i, n) {
if (i == 0) {
count++;
continue;
}
if (h[i] >= maxel(h, i - 1)) {
count++;
}
}
cout << count << endl;
return 0;
}
| #include <bits/stdc++.h>
#define vel vector<long long>
#define veb vector<bool>
#define vvel vector<vel>
#define int long long
#define pin pair<int, int>
#define ppin pair<int, pin>
#define mkp make_pair
#define rep(i, n) for (int i = 0; i < n; i++)
#define maxel(vec, j) *max_element(vec.begin(), vec.begin() + j)
using namespace std;
void mmin(int &a, int b) { a = min(a, b); }
void mmax(int &a, int b) { a = max(a, b); }
signed main() {
int pr = 1000;
pr *= pr * pr;
pr += 7;
int n;
cin >> n;
vel h(n);
rep(i, n) { cin >> h[i]; }
int count = 0;
rep(i, n) {
if (i == 0) {
count++;
continue;
}
if (h[i] >= maxel(h, i)) {
count++;
}
}
cout << count << endl;
return 0;
}
| [
"expression.operation.binary.remove"
] | 883,179 | 883,180 | u966932195 | cpp |
p03072 | #include <bits/stdc++.h>
#define vel vector<long long>
#define veb vector<bool>
#define vvel vector<vel>
#define int long long
#define pin pair<int, int>
#define ppin pair<int, pin>
#define mkp make_pair
#define rep(i, n) for (int i = 0; i < n; i++)
#define maxel(vec, j) *max_element(vec.begin(), vec.begin() + j)
using namespace std;
void mmin(int &a, int b) { a = min(a, b); }
void mmax(int &a, int b) { a = max(a, b); }
signed main() {
int pr = 1000;
pr *= pr * pr;
pr += 7;
int n;
cin >> n;
vel h(n);
rep(i, n) { cin >> h[i]; }
int count = 0;
rep(i, n) {
if (i == 0) {
count++;
continue;
}
if (h[i] >= maxel(h, i - 1)) {
count++;
}
}
cout << count;
return 0;
}
| #include <bits/stdc++.h>
#define vel vector<long long>
#define veb vector<bool>
#define vvel vector<vel>
#define int long long
#define pin pair<int, int>
#define ppin pair<int, pin>
#define mkp make_pair
#define rep(i, n) for (int i = 0; i < n; i++)
#define maxel(vec, j) *max_element(vec.begin(), vec.begin() + j)
using namespace std;
void mmin(int &a, int b) { a = min(a, b); }
void mmax(int &a, int b) { a = max(a, b); }
signed main() {
int pr = 1000;
pr *= pr * pr;
pr += 7;
int n;
cin >> n;
vel h(n);
rep(i, n) { cin >> h[i]; }
int count = 0;
rep(i, n) {
if (i == 0) {
count++;
continue;
}
if (h[i] >= maxel(h, i)) {
count++;
}
}
cout << count << endl;
return 0;
}
| [
"expression.operation.binary.remove",
"io.output.newline.add"
] | 883,181 | 883,180 | u966932195 | cpp |
p03072 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string.h>
using namespace std;
int main(void) {
int N, maxh, *mountains, answer = 1;
scanf("%d", &N);
mountains = (int *)malloc(sizeof(int));
for (int i = 0; i < N; i++) {
scanf("%d", mountains + i);
if (!i) {
maxh = mountains[0];
} else {
if (mountains[i] > maxh) {
answer++;
maxh = mountains[i];
}
}
}
printf("%d", answer);
return 0;
} | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string.h>
using namespace std;
int main(void) {
int N, maxh, *mountains, answer = 1;
scanf("%d", &N);
mountains = (int *)malloc(sizeof(int));
for (int i = 0; i < N; i++) {
scanf("%d", mountains + i);
if (!i) {
maxh = mountains[0];
} else {
if (mountains[i] >= maxh) {
answer++;
maxh = mountains[i];
}
}
}
printf("%d", answer);
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 883,188 | 883,189 | u499078067 | cpp |
p03072 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int temp = 0;
int top = 0;
int ans = 0;
for (int i = 0; i < N; i++) {
int mount;
cin >> mount;
// １つ前の山より高く以前の山と同等以上なら
if (temp < mount && top <= mount)
ans++;
// １番高い山
if (top < mount)
top = mount;
temp = mount;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int temp = 0;
int top = 0;
int ans = 0;
for (int i = 0; i < N; i++) {
int mount;
cin >> mount;
// 以前の山と同等以上なら
if (temp <= mount && top <= mount)
ans++;
// １番高い山
if (top < mount)
top = mount;
temp = mount;
}
cout << ans << endl;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 883,199 | 883,200 | u554965736 | cpp |
p03072 | #include <iostream>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
int main(void) {
int N, H[100], now, result = 1;
cin >> N;
rep(i, N) cin >> H[i];
now = H[0];
rep(i, N) {
if (now <= H[i]) {
now = H[i];
result++;
}
}
cout << result;
return 0;
} | #include <iostream>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
int main(void) {
int N, H[100], now, result = 0;
cin >> N;
rep(i, N) cin >> H[i];
now = H[0];
rep(i, N) {
if (now <= H[i]) {
now = H[i];
result++;
}
}
cout << result << endl;
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change",
"io.output.newline.add"
] | 883,203 | 883,202 | u130128796 | cpp |
p03072 | #include <algorithm>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define inf 10000000000 + 5
int n;
int h[22];
int answer = 0;
int tmp[22];
int main() {
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> h[i];
}
// cout << n;
for (int i = 0; i < n; ++i) {
tmp[i] = 0;
for (int j = 0; j < i; ++j) {
if (h[i] > h[j]) {
// return 0;
tmp[i]++;
}
}
// cout << tmp[i] << endl;
if (tmp[i] == i) {
answer++;
}
}
cout << answer + 1 << endl;
} | #include <algorithm>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define inf 10000000000 + 5
int n;
int h[22];
int answer = 0;
int tmp[22];
int main() {
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> h[i];
}
// cout << n;
for (int i = 0; i < n; ++i) {
tmp[i] = 0;
for (int j = 0; j < i; ++j) {
if (h[i] >= h[j]) {
// return 0;
tmp[i]++;
}
}
// cout << tmp[i] << endl;
if (tmp[i] == i) {
answer++;
}
}
cout << answer << endl;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 883,214 | 883,215 | u229235826 | cpp |
p03072 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define sz(c) ((int)(c).size())
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
// const int MAX=;
int main() {
int N;
cin >> N;
int H[20];
rep(i, N) cin >> H[i];
int ans = 0;
rep(i, N) {
bool ok = true;
rep(j, i - 1) if (H[j] >= H[i]) ok = false;
if (ok)
ans++;
}
cout << ans;
} | #include <algorithm>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define sz(c) ((int)(c).size())
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
// const int MAX=;
int main() {
int N;
cin >> N;
int H[20];
rep(i, N) cin >> H[i];
int ans = 0;
rep(i, N) {
bool ok = true;
rep(j, i) if (H[j] > H[i]) ok = false;
if (ok)
ans++;
}
cout << ans;
} | [
"expression.operation.binary.remove",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 883,216 | 883,217 | u228214259 | cpp |
p03072 | #include <bits/stdc++.h>
using namespace std;
#define cc(x) cout << (x) << endl
#define rep(i, n) for (int i = 0; i < int(n); i++)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
typedef long long ll;
template <typename T, typename U> inline void amin(T &x, U y) {
if (y < x)
x = y;
}
template <typename T, typename U> inline void amax(T &x, U y) {
if (x < y)
x = y;
}
const ll inf = 1LL << 58;
const int iinf = 1 << 30;
int main() {
int n;
cin >> n;
int h[n];
rep(i, n) { cin >> h[i]; }
int tmp = 1;
int ok = 0;
repi(i, 1, n) {
repi(j, 0, i) {
if (h[i] <= h[j]) {
ok = 1;
}
}
if (ok == 0) {
tmp++;
}
ok = 0;
}
cc(tmp);
} | #include <bits/stdc++.h>
using namespace std;
#define cc(x) cout << (x) << endl
#define rep(i, n) for (int i = 0; i < int(n); i++)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
typedef long long ll;
template <typename T, typename U> inline void amin(T &x, U y) {
if (y < x)
x = y;
}
template <typename T, typename U> inline void amax(T &x, U y) {
if (x < y)
x = y;
}
const ll inf = 1LL << 58;
const int iinf = 1 << 30;
int main() {
int n;
cin >> n;
int h[n];
rep(i, n) { cin >> h[i]; }
int tmp = 1;
int ok = 0;
repi(i, 1, n) {
repi(j, 0, i) {
if (h[i] < h[j]) {
ok = 1;
}
}
if (ok == 0) {
tmp++;
}
ok = 0;
}
cc(tmp);
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 883,226 | 883,227 | u654470292 | cpp |
p03072 | // Decision's template
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define DP_maxn 16
#define maxn 1000000 + 10
#define INF 1000000007
#define mod 1000000007
#define mst(s, k) memset(s, k, sizeof(s))
#define eps 1e-12
typedef long long ll;
struct Edge {
int from, to, dist;
Edge(int u, int v, int d) : from(u), to(v), dist(d) {}
};
/*-------------------------------template End--------------------------------*/
int n, a[30];
int ans = 1;
int main() {
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = 2; i <= n; i++) {
for (int j = 1; j <= n; j++) {
if (j == n) {
ans++;
}
if (a[i] >= a[j])
continue;
else
break;
}
}
cout << ans << endl;
return 0;
} | // Decision's template
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define DP_maxn 16
#define maxn 1000000 + 10
#define INF 1000000007
#define mod 1000000007
#define mst(s, k) memset(s, k, sizeof(s))
#define eps 1e-12
typedef long long ll;
struct Edge {
int from, to, dist;
Edge(int u, int v, int d) : from(u), to(v), dist(d) {}
};
/*-------------------------------template End--------------------------------*/
int n, a[30];
int ans = 1;
int main() {
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = 2; i <= n; i++) {
for (int j = 1; j <= i; j++) {
if (j == i) {
ans++;
}
if (a[i] >= a[j])
continue;
else
break;
}
}
cout << ans << endl;
return 0;
} | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 883,230 | 883,231 | u781806179 | 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.at(i);
int max = H.at(0), sum = 0;
for (int i = 0; i < N; i++) {
if (H.at(i) <= max) {
sum++;
} else {
max = H.at(i);
}
}
cout << sum << endl;
} | #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.at(i);
int max = H.at(0), sum = 0;
for (int i = 0; i < N; i++) {
if (H.at(i) >= max) {
sum++;
max = H.at(i);
}
}
cout << sum << endl;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 883,234 | 883,235 | u607746177 | cpp |
p03072 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N, max = 0, cnt = 0;
cin >> N;
int H[N];
for (int i = 0; i < N; i++) {
cin >> H[i];
if (H[i] > max) {
max = H[i];
cnt++;
} else
break;
}
cout << cnt << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N, max = 0, cnt = 0;
cin >> N;
int H[N];
for (int i = 0; i < N; i++) {
cin >> H[i];
if (H[i] >= max) {
max = H[i];
cnt++;
}
}
cout << cnt << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.branch.else.remove"
] | 883,240 | 883,241 | u341488930 | cpp |
p03072 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> vec(n);
int ans = 1;
for (int i = 0; i < n; i++) {
cin >> vec[i];
}
int s = vec[0];
for (int i = 1; i < n; i++) {
s = max(s, i);
if (s <= vec[i]) {
ans++;
}
}
cout << ans;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> vec(n);
int ans = 1;
for (int i = 0; i < n; i++) {
cin >> vec[i];
}
int s = vec[0];
for (int i = 1; i < n; i++) {
s = max(s, vec[i]);
if (s <= vec[i]) {
ans++;
}
}
cout << ans;
}
| [
"call.arguments.change"
] | 883,247 | 883,248 | u529813812 | cpp |
p03072 | #include <algorithm>
#include <array>
#include <iostream>
#include <stdio.h>
#include <string>
#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 count = 1;
for (int i = 1; i < n; ++i) {
bool f = false;
for (int j = 0; j < i; ++j) {
if (h[j] >= h[i])
f = true;
}
if (f)
++count;
}
cout << count << endl;
return 0;
} | #include <algorithm>
#include <array>
#include <iostream>
#include <stdio.h>
#include <string>
#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 count = 1;
for (int i = 1; i < n; ++i) {
bool f = true;
for (int j = 0; j < i; ++j) {
if (h[j] > h[i])
f = false;
}
if (f)
++count;
}
cout << count << endl;
return 0;
} | [
"misc.opposites",
"variable_declaration.value.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"assignment.value.change"
] | 883,256 | 883,257 | u540724932 | cpp |
p03072 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
typedef long long lint;
#define SZ(x) ((int)(x).size())
int main() {
int n;
int h[100];
cin >> n;
rep(i, n) cin >> h[i];
int cnt = 1;
for (int i = n - 1; i > 0; i--) {
bool flg = false;
for (int j = 0; j < n - 2; j++) {
if (h[i] < h[j]) {
flg = true;
break;
}
}
if (!flg)
cnt++;
}
cout << cnt << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
typedef long long lint;
#define SZ(x) ((int)(x).size())
int main() {
int n;
int h[100];
cin >> n;
rep(i, n) cin >> h[i];
int cnt = 1;
for (int i = n - 1; i > 0; i--) {
bool flg = false;
for (int j = 0; j < i; j++) {
if (h[i] < h[j]) {
flg = true;
break;
}
}
if (!flg)
cnt++;
}
cout << cnt << endl;
return 0;
}
| [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 883,258 | 883,259 | u290673589 | cpp |
p03072 | #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 = 0; 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 N;
cin >> N;
vector<int> H(N);
rep(i, N) cin >> H[i];
int cnt = 1;
int st = H[0];
rept(i, 1, N) {
if (st <= H[i]) {
cnt++;
st = H[i];
} else
break;
}
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 = 0; 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 N;
cin >> N;
vector<int> H(N);
rep(i, N) cin >> H[i];
int cnt = 1;
int st = H[0];
rept(i, 1, N) {
if (st <= H[i]) {
cnt++;
st = H[i];
} else
continue;
}
cout << cnt << endl;
return 0;
}
| [
"control_flow.break.remove",
"control_flow.continue.add"
] | 883,260 | 883,261 | u569041543 | cpp |
p03072 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, count = 1;
cin >> n;
vector<int> s(n);
for (int i = 0; i < n; i++) {
cin >> s[i];
}
for (int i = 0; i < n - 1; i++) {
for (int j = 0; j <= i; j++) {
if (s[i] >= s[j]) {
if (j == i) {
count += 1;
}
} else {
break;
}
}
}
cout << count << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, count = 0;
cin >> n;
vector<int> s(n);
for (int i = 0; i < n; i++) {
cin >> s[i];
}
for (int i = 0; i < n; i++) {
for (int j = 0; j <= i; j++) {
if (s[i] >= s[j]) {
if (j == i) {
count += 1;
}
} else {
break;
}
}
}
cout << count << endl;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 883,262 | 883,263 | u422725381 | cpp |
p03072 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, ans = 0;
cin >> n;
vector<int> data(n);
for (int i = 0; i < n; i++) {
cin >> data.at(i);
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < i; j++) {
if (data.at(i) < data.at(j)) {
break;
}
if (j = i - 1) {
ans++;
}
}
}
cout << ans + 1 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, ans = 0;
cin >> n;
vector<int> data(n);
for (int i = 0; i < n; i++) {
cin >> data.at(i);
}
for (int i = 1; i < n; i++) {
for (int j = 0; j < i; j++) {
if (data.at(j) > data.at(i)) {
break;
} else if (j == i - 1) {
ans++;
}
}
}
cout << ans + 1 << endl;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"identifier.change",
"control_flow.branch.if.condition.change",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.else_if.replace.add",
"con... | 883,264 | 883,265 | u634967948 | cpp |
p03072 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
int count = 1;
for (int i = 1; i < N; i++) {
for (int j = 0; j < i; j++) {
if (vec.at(j) <= vec.at(i)) {
if (j == i) {
count++;
}
continue;
} else {
break;
}
}
}
cout << count << endl;
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
int count = 1;
for (int i = 1; i < N; i++) {
for (int j = 0; j < i; j++) {
if (vec.at(j) <= vec.at(i)) {
if (j == i - 1) {
count++;
}
continue;
} else {
break;
}
}
}
cout << count << endl;
}
| [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 883,277 | 883,278 | u668785999 | cpp |
p03072 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, ans;
int H[256] = {};
cin >> n;
ans = n;
for (int i = 0; i < n; i++) {
cin >> H[i];
}
for (int i = 1; i < n; i++) {
for (int j = 0; j < n - 1; j++) {
if (H[i] < H[j]) {
ans--;
break;
}
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, ans;
int H[256] = {};
cin >> n;
ans = n;
for (int i = 0; i < n; i++) {
cin >> H[i];
}
for (int i = 1; i < n; i++) {
for (int j = 0; j < i; j++) {
if (H[i] < H[j]) {
ans--;
break;
}
}
}
cout << ans << endl;
} | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 883,286 | 883,287 | u745852541 | cpp |
p03072 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, ans;
int H[256] = {};
cin >> n;
ans = n;
for (int i = 0; i < n; i++) {
cin >> H[i];
}
for (int i = 1; i < n; i++) {
for (int j = 0; j < n - 1; j++) {
if (H[i] < H[j]) {
ans--;
break;
}
}
}
cout << ans + 1 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, ans;
int H[256] = {};
cin >> n;
ans = n;
for (int i = 0; i < n; i++) {
cin >> H[i];
}
for (int i = 1; i < n; i++) {
for (int j = 0; j < i; j++) {
if (H[i] < H[j]) {
ans--;
break;
}
}
}
cout << ans << endl;
} | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 883,289 | 883,287 | u745852541 | cpp |
p03072 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, sum = 0;
cin >> N;
vector<int> v(N);
for (int i = 0; i < N; i++) {
int a;
cin >> a;
v.at(i) = a;
sort(v.begin(), v.end());
if (v.at(i) == a) {
sum++;
}
}
cout << sum << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, sum = 0;
cin >> N;
vector<int> v(N);
for (int i = 0; i < N; i++) {
int a;
cin >> a;
v.at(0) = a;
sort(v.begin(), v.end());
if (v.at(N - 1) == a) {
sum++;
}
}
cout << sum << endl;
}
| [
"assignment.variable.change",
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 883,301 | 883,302 | u094261547 | cpp |
p03072 | #include <iostream>
using namespace std;
int main() {
int n, h, pre, ans;
pre = ans = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> h;
if (pre < h) {
ans++;
pre = h;
}
}
cout << ans << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n, h, pre, ans;
pre = ans = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> h;
if (pre <= h) {
ans++;
pre = h;
}
}
cout << ans << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 883,303 | 883,304 | u227170240 | cpp |
p03072 | #include "bits/stdc++.h"
using namespace std;
int main() {
int N, res = 1, Hmax = 0;
cin >> N;
vector<int> H(N);
for (int i = 0; i < N; i++) {
cin >> H.at(i);
}
Hmax = H.at(0);
for (int i = 1; i < N; i++) {
if (H.at(0) <= H.at(i)) {
if (Hmax <= H.at(i)) {
res++;
Hmax = H.at(0);
}
}
}
cout << res << endl;
} | #include "bits/stdc++.h"
using namespace std;
int main() {
int N, res = 1, Hmax = 0;
cin >> N;
vector<int> H(N);
for (int i = 0; i < N; i++) {
cin >> H.at(i);
}
Hmax = H.at(0);
for (int i = 1; i < N; i++) {
if (H.at(0) <= H.at(i)) {
if (Hmax <= H.at(i)) {
res++;
Hmax = H.at(i);
}
}
}
cout << res << endl;
} | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change"
] | 883,307 | 883,308 | u718774863 | cpp |
p03072 |
#include <iostream>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
std::vector<int> h;
for (int i = 0; i < N; i++) {
int tmp;
cin >> tmp;
h.push_back(tmp);
}
int count = 1;
for (int i = 1; i < N; i++) {
int ni = h[i];
bool canlook = true;
for (int j = 0; j < i; j++) {
if (ni >= h[j]) {
canlook = true;
} else {
canlook = false;
}
}
if (canlook == true) {
count += 1;
}
}
cout << count << endl;
return 0;
} | #include <iostream>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
std::vector<int> h;
for (int i = 0; i < N; i++) {
int tmp;
cin >> tmp;
h.push_back(tmp);
}
int count = 1;
for (int i = 1; i < N; i++) {
int ni = h[i];
bool canlook = true;
for (int j = 0; j < i; j++) {
if (ni >= h[j]) {
canlook = true;
} else {
canlook = false;
break;
}
}
if (canlook == true) {
count += 1;
}
}
cout << count << endl;
return 0;
}
| [
"control_flow.break.add"
] | 883,313 | 883,314 | u517032746 | cpp |
p03072 |
#include <iostream>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
std::vector<int> h;
for (int i = 0; i < N; i++) {
int tmp;
cin >> tmp;
h.push_back(tmp);
}
int count = 1;
for (int i = 1; i < N; i++) {
int ni = h[i];
bool canlook = false;
for (int j = 0; j < i; j++) {
if (ni >= h[j]) {
canlook = true;
} else {
canlook = false;
}
}
if (canlook == true) {
count += 1;
}
}
cout << count << endl;
return 0;
}
| #include <iostream>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
std::vector<int> h;
for (int i = 0; i < N; i++) {
int tmp;
cin >> tmp;
h.push_back(tmp);
}
int count = 1;
for (int i = 1; i < N; i++) {
int ni = h[i];
bool canlook = true;
for (int j = 0; j < i; j++) {
if (ni >= h[j]) {
canlook = true;
} else {
canlook = false;
break;
}
}
if (canlook == true) {
count += 1;
}
}
cout << count << endl;
return 0;
}
| [
"misc.opposites",
"variable_declaration.value.change"
] | 883,315 | 883,314 | u517032746 | cpp |
p03072 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
int N;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> N;
vector<int> H(N);
for (auto &x : H)
cin >> x;
int ans = 1, under = H[0];
REP(i, N) {
if (H[i] >= under) {
ans++;
under = H[i];
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
int N;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> N;
vector<int> H(N);
for (auto &x : H)
cin >> x;
int ans = 0, under = H[0];
REP(i, N) {
if (H[i] >= under) {
ans++;
under = H[i];
}
}
cout << ans << endl;
} | [
"literal.number.change",
"variable_declaration.value.change"
] | 883,316 | 883,317 | u325820449 | cpp |
p03072 | #include <algorithm>
#include <clocale>
#include <cmath>
#include <complex>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <iostream>
#include <istream>
#include <map>
#include <math.h>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int n, a[100], ans = 1;
int main() {
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 2; i < n; i++) {
int f = 0;
for (int j = 0; j < i; j++)
if (a[j] > a[i])
f = 1;
if (f == 0)
ans++;
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <clocale>
#include <cmath>
#include <complex>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <iostream>
#include <istream>
#include <map>
#include <math.h>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int n, a[100], ans = 1;
int main() {
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 1; i < n; i++) {
int f = 0;
for (int j = 0; j < i; j++)
if (a[j] > a[i])
f = 1;
if (f == 0)
ans++;
}
cout << ans << endl;
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 883,318 | 883,319 | u966582222 | cpp |
p03072 | #include <algorithm>
#include <clocale>
#include <cmath>
#include <complex>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <iostream>
#include <istream>
#include <map>
#include <math.h>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int n, a[100], ans = 0;
int main() {
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 2; i < n; i++) {
int f = 0;
for (int j = 0; j < i; j++)
if (a[j] > a[i])
f = 1;
if (f == 0)
ans++;
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <clocale>
#include <cmath>
#include <complex>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <iostream>
#include <istream>
#include <map>
#include <math.h>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int n, a[100], ans = 1;
int main() {
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 1; i < n; i++) {
int f = 0;
for (int j = 0; j < i; j++)
if (a[j] > a[i])
f = 1;
if (f == 0)
ans++;
}
cout << ans << endl;
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 883,320 | 883,319 | u966582222 | cpp |
p03072 | #include <algorithm>
#include <clocale>
#include <cmath>
#include <complex>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <iostream>
#include <istream>
#include <map>
#include <math.h>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int n, a[100], ans = 1;
int main() {
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 1; i < n; i++) {
int f = 0;
for (int j = 0; j < i; j++)
if (a[j] > a[i])
f = 1;
if (f == 0)
ans = i;
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <clocale>
#include <cmath>
#include <complex>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <iostream>
#include <istream>
#include <map>
#include <math.h>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int n, a[100], ans = 1;
int main() {
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 1; i < n; i++) {
int f = 0;
for (int j = 0; j < i; j++)
if (a[j] > a[i])
f = 1;
if (f == 0)
ans++;
}
cout << ans << endl;
return 0;
} | [] | 883,321 | 883,319 | u966582222 | cpp |
p03072 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
vector<int> nums;
cin >> n;
for (int i = 0; i < n; i++) {
int temp;
cin >> temp;
nums.push_back(temp);
}
int max = -1;
int ans = 1;
for (int i = 0; i < n - 1; i++) {
if (max < nums.at(i))
max = nums.at(i);
if (nums.at(i) < nums.at(i + 1) && nums.at(i + 1) >= max) {
ans += 1;
}
}
cout << ans;
}
| #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
vector<int> nums;
cin >> n;
for (int i = 0; i < n; i++) {
int temp;
cin >> temp;
nums.push_back(temp);
}
int max = -1;
int ans = 1;
for (int i = 0; i < n - 1; i++) {
if (max < nums.at(i))
max = nums.at(i);
if (nums.at(i) <= nums.at(i + 1) && nums.at(i + 1) >= max) {
ans += 1;
}
}
cout << ans;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 883,326 | 883,327 | u507749492 | 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 m = h[0];
int ans = 1;
for (int i = 1; i < n; i++) {
if (h[i] >= m) {
ans++;
} else {
m = h[i];
}
}
cout << ans << endl;
}
| #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 m = h[0];
int ans = 1;
for (int i = 1; i < n; i++) {
if (h[i] >= m) {
ans++;
m = h[i];
}
}
cout << ans << endl;
}
| [] | 883,331 | 883,332 | u410878763 | cpp |
p03072 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, ans = 0, count = 1, j;
cin >> n;
int a[n];
for (i = 0; i < n; i++)
cin >> a[i];
for (i = 0; i < n; i++) {
for (j = 0; j < i; j++) {
if (a[i] >= a[j]) {
ans++;
break;
}
}
if (ans == 0)
count++;
ans = 0;
}
cout << count;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, ans = 0, count = 0, j;
cin >> n;
int a[n];
for (i = 0; i < n; i++)
cin >> a[i];
for (i = 0; i < n; i++) {
for (j = 0; j < i; j++) {
if (a[j] > a[i]) {
ans++;
break;
}
}
if (ans == 0)
count++;
ans = 0;
}
cout << count;
return 0;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"expression.operator.compare.change"
] | 883,333 | 883,334 | u370273398 | cpp |
p03072 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int h[100];
int max;
cin >> max;
int ct = 1;
for (int i = 1; i < n; i++) {
cin >> h[i];
if (h[i] > max) {
ct++;
max = h[i];
}
}
cout << ct << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int h[100];
int max;
cin >> max;
int ct = 1;
for (int i = 1; i < n; i++) {
cin >> h[i];
if (h[i] >= max) {
ct++;
max = h[i];
}
}
cout << ct << endl;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 883,342 | 883,343 | u941284252 | cpp |
p03072 | #include <bits/stdc++.h>
//#define int long long
#define FOR(i, a, b) for (int i = a; i < b; ++i)
#define rep(N) for (int i = 0; i < N; ++i)
#define Rep(a, b) for (int i = a; i < b; ++i)
#define For(i, N) for (int i = 0; i < N; ++i)
#define all(v) v.begin(), v.end()
#define rev(v) v.rbegin(), v.rend()
#define mi(N) \
int N; \
cin >> N;
#define ms(s) \
string s; \
cin >> s;
#define md(d) \
double d; \
cin >> d;
#define mv(v, N) \
vi v(N); \
rep(N) cin >> v[i];
#define mod 1000000007
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vll = vector<ll>;
using vb = vector<bool>;
using vvb = vector<vector<bool>>;
using vs = vector<string>;
using pii = pair<int, int>;
using pis = pair<int, string>;
using msi = map<string, int>;
template <typename T> void say(T s) { cout << s << "\n"; }
template <typename T> void say(vector<T> s) {
auto itr = s.begin();
cout << *(itr++);
while (itr != s.end()) {
cout << " " << *(itr++);
}
cout << "\n";
}
template <typename T> void say(vector<T> s, char r) {
auto itr = s.begin();
cout << *(itr++);
while (itr != s.end()) {
cout << r << *(itr++);
}
cout << "\n";
}
void yn(bool b) {
if (b)
say("yes");
else
say("no");
}
void Yn(bool b) {
if (b)
say("Yes");
else
say("No");
}
void YN(bool b) {
if (b)
say("YES");
else
say("NO");
}
void Yay(bool b) {
if (b)
say("Yay!");
else
say(":(");
}
template <typename T> void maxi(T &a, T b) { a = max(a, b); }
template <typename T> void mini(T &a, T b) { a = min(a, b); }
void exact_say(double x) {
cout << setprecision(numeric_limits<double>::max_digits10) << x << endl;
}
template <typename T> vector<vector<T>> fill_vector(int h, int w, T val) {
vector<vector<T>> ret;
vector<T> v(w, val);
rep(h) ret.push_back(v);
return ret;
}
template <typename T> T max(vector<T> v) {
T ret = v[0];
Rep(1, v.size()) maxi(ret, v[i]);
return ret;
}
template <typename T> T min(vector<T> v) {
T ret = v[0];
Rep(1, v.size()) mini(ret, v[i]);
return ret;
}
signed main() {
mi(n);
mv(v, n);
int ans = 0;
int Max = 0;
rep(n) {
if (v[i] <= Max)
ans++;
maxi(Max, v[i]);
}
say(ans);
} | #include <bits/stdc++.h>
//#define int long long
#define FOR(i, a, b) for (int i = a; i < b; ++i)
#define rep(N) for (int i = 0; i < N; ++i)
#define Rep(a, b) for (int i = a; i < b; ++i)
#define For(i, N) for (int i = 0; i < N; ++i)
#define all(v) v.begin(), v.end()
#define rev(v) v.rbegin(), v.rend()
#define mi(N) \
int N; \
cin >> N;
#define ms(s) \
string s; \
cin >> s;
#define md(d) \
double d; \
cin >> d;
#define mv(v, N) \
vi v(N); \
rep(N) cin >> v[i];
#define mod 1000000007
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vll = vector<ll>;
using vb = vector<bool>;
using vvb = vector<vector<bool>>;
using vs = vector<string>;
using pii = pair<int, int>;
using pis = pair<int, string>;
using msi = map<string, int>;
template <typename T> void say(T s) { cout << s << "\n"; }
template <typename T> void say(vector<T> s) {
auto itr = s.begin();
cout << *(itr++);
while (itr != s.end()) {
cout << " " << *(itr++);
}
cout << "\n";
}
template <typename T> void say(vector<T> s, char r) {
auto itr = s.begin();
cout << *(itr++);
while (itr != s.end()) {
cout << r << *(itr++);
}
cout << "\n";
}
void yn(bool b) {
if (b)
say("yes");
else
say("no");
}
void Yn(bool b) {
if (b)
say("Yes");
else
say("No");
}
void YN(bool b) {
if (b)
say("YES");
else
say("NO");
}
void Yay(bool b) {
if (b)
say("Yay!");
else
say(":(");
}
template <typename T> void maxi(T &a, T b) { a = max(a, b); }
template <typename T> void mini(T &a, T b) { a = min(a, b); }
void exact_say(double x) {
cout << setprecision(numeric_limits<double>::max_digits10) << x << endl;
}
template <typename T> vector<vector<T>> fill_vector(int h, int w, T val) {
vector<vector<T>> ret;
vector<T> v(w, val);
rep(h) ret.push_back(v);
return ret;
}
template <typename T> T max(vector<T> v) {
T ret = v[0];
Rep(1, v.size()) maxi(ret, v[i]);
return ret;
}
template <typename T> T min(vector<T> v) {
T ret = v[0];
Rep(1, v.size()) mini(ret, v[i]);
return ret;
}
signed main() {
mi(n);
mv(v, n);
int ans = 0;
int Max = 0;
rep(n) {
if (v[i] >= Max)
ans++;
maxi(Max, v[i]);
}
say(ans);
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 883,344 | 883,345 | u698760125 | cpp |
p03072 | #include <algorithm>
#include <iostream>
#include <numeric>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <time.h>
#include <vector>
using namespace std;
int main(int argc, char *argv[]) {
/*
cin>>x;
cout<<x<<endl;
*/
int i, j, n, m, l, c = 0;
cin >> n;
cin >> m;
c++;
for (i = 0; i < n; i++) {
cin >> l;
if (m > l)
continue;
else {
c++;
m = l;
}
}
cout << c << endl;
}
| #include <algorithm>
#include <iostream>
#include <numeric>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <time.h>
#include <vector>
using namespace std;
int main(int argc, char *argv[]) {
/*
cin>>x;
cout<<x<<endl;
*/
int i, j, n, m, l, c = 0;
cin >> n;
cin >> m;
c++;
for (i = 1; i < n; i++) {
cin >> l;
if (m > l)
continue;
else {
c++;
m = l;
}
}
cout << c << endl;
}
| [
"literal.number.change",
"assignment.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 883,350 | 883,351 | u785689316 | cpp |
p03072 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> mountains;
for (int i = 0; i < N; ++i) {
int tmp;
cin >> tmp;
mountains.push_back(tmp);
}
int highest = 0;
int count = 0;
for (auto m : mountains) {
if (m >= highest) {
++highest;
highest = m;
}
}
cout << count << endl;
}
| #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> mountains;
for (int i = 0; i < N; ++i) {
int tmp;
cin >> tmp;
mountains.push_back(tmp);
}
int highest = 0;
int count = 0;
for (auto m : mountains) {
if (m >= highest) {
++count;
highest = m;
}
}
cout << count << endl;
}
| [
"identifier.change"
] | 883,352 | 883,353 | u059082716 | cpp |
p03072 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define y0 y3487465
#define y1 y8687969
#define j0 j1347829
#define j1 j234892
#define next asdnext
#define prev asdprev
#define INF 1000000007
#define PI acos(-1.0)
#define endl "\n"
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
#define REP_R(i, n) for (int i = ((int)(n)-1); i >= 0; --i)
#define FOR(i, m, n) for (int i = ((int)(m)); i < (int)(n); ++i)
#define FOR_R(i, m, n) for (int i = ((int)(m)-1); i >= (int)(n); --i)
#define ALL(v) (v).begin(), (v).end()
#define RALL(v) (v).rbegin(), (v).rend()
#define SIZ(x) ((int)(x).size())
typedef long long int lli;
using namespace std;
int main() {
int N;
cin >> N;
vector<int> H(N);
REP(i, N) { cin >> H[i]; }
int mx = H[0];
int cnt = 1;
FOR(i, 1, N) {
if (mx < H[i]) {
++cnt;
mx = H[i];
}
}
cout << cnt << endl;
}
| #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define y0 y3487465
#define y1 y8687969
#define j0 j1347829
#define j1 j234892
#define next asdnext
#define prev asdprev
#define INF 1000000007
#define PI acos(-1.0)
#define endl "\n"
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
#define REP_R(i, n) for (int i = ((int)(n)-1); i >= 0; --i)
#define FOR(i, m, n) for (int i = ((int)(m)); i < (int)(n); ++i)
#define FOR_R(i, m, n) for (int i = ((int)(m)-1); i >= (int)(n); --i)
#define ALL(v) (v).begin(), (v).end()
#define RALL(v) (v).rbegin(), (v).rend()
#define SIZ(x) ((int)(x).size())
typedef long long int lli;
using namespace std;
int main() {
int N;
cin >> N;
vector<int> H(N);
REP(i, N) { cin >> H[i]; }
int mx = H[0];
int cnt = 1;
FOR(i, 1, N) {
if (mx <= H[i]) {
++cnt;
mx = H[i];
}
}
cout << cnt << endl;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 883,356 | 883,357 | u900727536 | cpp |
p03072 | #include <bits/stdc++.h>
using namespace std;
int main() {
//入力
int n;
cin >> n;
vector<int> yama(n);
for (int i = 0; i < n; i++) {
cin >> yama[i];
}
//処理
int ans = 1;
int max_ = yama[0];
for (int i = 1; i < n; i++) {
if (max_ < yama[i]) {
ans++;
max_ = yama[i];
}
}
//出力
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
//入力
int n;
cin >> n;
vector<int> yama(n);
for (int i = 0; i < n; i++) {
cin >> yama[i];
}
//処理
int ans = 1;
int max_ = yama[0];
for (int i = 1; i < n; i++) {
if (max_ <= yama[i]) {
ans++;
max_ = yama[i];
}
}
//出力
cout << ans << endl;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 883,358 | 883,359 | u775507068 | cpp |
p03072 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
cin >> a;
int big = 0;
int ans = 0;
for (int i = 0; i < a; i++) {
if (i == 0) {
int d;
cin >> d;
big = d;
ans++;
} else {
int d;
cin >> d;
if (big < d) {
big = d;
ans++;
}
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
cin >> a;
int big = 0;
int ans = 0;
for (int i = 0; i < a; i++) {
if (i == 0) {
int d;
cin >> d;
big = d;
ans++;
} else {
int d;
cin >> d;
if (big <= d) {
big = d;
ans++;
}
}
}
cout << ans << endl;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 883,360 | 883,361 | u578806044 | cpp |
p03072 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, cnt = 0;
cin >> N;
int H[100];
for (int i = 0; i < N; i++) {
cin >> H[i];
}
for (int i = 1; i < N; i++) {
int hoge = 0;
for (int j = 0; j < i; j++) {
hoge = max(H[j], hoge);
if (H[i] >= hoge) {
cnt++;
}
}
}
cout << cnt + 1 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, cnt = 0;
cin >> N;
int H[100];
for (int i = 0; i < N; i++) {
cin >> H[i];
}
for (int i = 1; i < N; i++) {
int hoge = 0;
for (int j = 0; j < i; j++) {
hoge = max(H[j], hoge);
}
if (H[i] >= hoge) {
cnt++;
}
}
cout << cnt + 1 << endl;
}
| [] | 883,366 | 883,367 | u376859266 | cpp |
p03072 | #include "bits/stdc++.h"
#define REP(i, n) for (ll i = 0; i < ll(n); ++i)
#define RREP(i, n) for (ll i = ll(n) - 1; i >= 0; --i)
#define FOR(i, m, n) for (ll i = m; i < ll(n); ++i)
#define RFOR(i, m, n) for (ll i = ll(n) - 1; i >= ll(m); --i)
#define ALL(v) (v).begin(), (v).end()
#define UNIQUE(v) v.erase(unique(ALL(v)), v.end());
#define INF 1000000001ll
#define MOD 1000000007ll
#define EPS 1e-9
constexpr int dx[8] = {1, 1, 0, -1, -1, -1, 0, 1};
constexpr int dy[8] = {0, 1, 1, 1, 0, -1, -1, -1};
using namespace std;
using ll = long long;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vi>;
using vvl = vector<vl>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
int m = 0, cnt = 0;
REP(i, n) {
int h;
cin >> h;
if (m >= h)
cnt++;
chmax(m, h);
}
cout << cnt << endl;
} | #include "bits/stdc++.h"
#define REP(i, n) for (ll i = 0; i < ll(n); ++i)
#define RREP(i, n) for (ll i = ll(n) - 1; i >= 0; --i)
#define FOR(i, m, n) for (ll i = m; i < ll(n); ++i)
#define RFOR(i, m, n) for (ll i = ll(n) - 1; i >= ll(m); --i)
#define ALL(v) (v).begin(), (v).end()
#define UNIQUE(v) v.erase(unique(ALL(v)), v.end());
#define INF 1000000001ll
#define MOD 1000000007ll
#define EPS 1e-9
constexpr int dx[8] = {1, 1, 0, -1, -1, -1, 0, 1};
constexpr int dy[8] = {0, 1, 1, 1, 0, -1, -1, -1};
using namespace std;
using ll = long long;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vi>;
using vvl = vector<vl>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
int m = 0, cnt = 0;
REP(i, n) {
int h;
cin >> h;
if (m <= h)
cnt++;
chmax(m, h);
}
cout << cnt << endl;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 883,370 | 883,371 | u918357423 | cpp |
p03072 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
int N;
cin >> N;
vector<int> H(N);
if (N < 1 && N > 20)
return 0;
for (int i = 0; i < N; i++) {
cin >> H[i];
if (H[i] < 1 && H[i] > 100)
return 0;
}
int max = 0;
int count = 1;
for (int i = 0; i < N; i++) {
if (i != 0) {
count = H[i] - H[i - 1] > 0 && H[i] >= max ? count + 1 : count;
}
max = H[i] > max ? H[i] : max;
}
cout << count << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
int N;
cin >> N;
vector<int> H(N);
if (N < 1 && N > 20)
return 0;
for (int i = 0; i < N; i++) {
cin >> H[i];
if (H[i] < 1 && H[i] > 100)
return 0;
}
int max = 0;
int count = 1;
for (int i = 0; i < N; i++) {
if (i != 0) {
count = H[i] - H[i - 1] >= 0 && H[i] >= max ? count + 1 : count;
}
max = H[i] > max ? H[i] : max;
}
cout << count << endl;
return 0;
}
| [
"expression.operator.compare.change",
"assignment.value.change",
"control_flow.branch.if.condition.change"
] | 883,375 | 883,376 | u579882657 | cpp |
p03072 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
int N;
cin >> N;
vector<int> H(N);
if (N < 1 && N > 20)
return 0;
for (int i = 0; i < N; i++) {
cin >> H[i];
if (H[i] < 1 && H[i] > 100)
return 0;
}
int max = 0;
int count = 0;
for (int i = 0; i < N; i++) {
if (i != 0) {
count = H[i] - H[i - 1] > 0 && H[i] >= max ? count + 1 : count;
}
max = H[i] > max ? H[i] : max;
}
cout << count + 1 << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
int N;
cin >> N;
vector<int> H(N);
if (N < 1 && N > 20)
return 0;
for (int i = 0; i < N; i++) {
cin >> H[i];
if (H[i] < 1 && H[i] > 100)
return 0;
}
int max = 0;
int count = 1;
for (int i = 0; i < N; i++) {
if (i != 0) {
count = H[i] - H[i - 1] >= 0 && H[i] >= max ? count + 1 : count;
}
max = H[i] > max ? H[i] : max;
}
cout << count << endl;
return 0;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"expression.operator.compare.change",
"assignment.value.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 883,377 | 883,376 | u579882657 | cpp |
p03072 | #include <bits/stdc++.h>
using namespace std;
int main() {
int val, i, Mt, inn, Max;
inn = 1;
cin >> val;
int hight[val];
for (i = 0; i < val; i++) {
cin >> Mt;
hight[i] = Mt;
}
Max = hight[0];
for (i = 0; i < val; i++) {
if (Max <= hight[i]) {
inn++;
Max = hight[i];
}
}
cout << inn << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int val, i, Mt, inn, Max;
inn = 0;
cin >> val;
int hight[val];
for (i = 0; i < val; i++) {
cin >> Mt;
hight[i] = Mt;
}
Max = hight[0];
for (i = 0; i < val; i++) {
if (Max <= hight[i]) {
inn++;
Max = hight[i];
}
}
cout << inn << endl;
} | [
"literal.number.change",
"assignment.value.change"
] | 883,384 | 883,385 | u479377156 | cpp |
p03072 | #include <iostream>
#include <stdio.h>
int main(int argc, char *argv[]) {
int sum = 1;
int n;
std::cin >> n;
int a[n];
for (int i = 0; i < n; i++)
std::cin >> a[i];
for (int i = 1; i < n; i++) {
if (a[0] < a[i]) {
sum++;
a[0] = a[i];
}
}
printf("%d", sum);
} | #include <iostream>
#include <stdio.h>
int main(int argc, char *argv[]) {
int sum = 1;
int n;
std::cin >> n;
int a[n];
for (int i = 0; i < n; i++)
std::cin >> a[i];
for (int i = 1; i < n; i++) {
if (a[0] <= a[i]) {
sum++;
a[0] = a[i];
}
}
printf("%d", sum);
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 883,388 | 883,389 | u634169216 | cpp |
p03072 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
vector<int> H(N);
for (int i = 0; i < N; i++) {
cin >> H[i];
}
int M = H[0];
int count = 0;
for (int i = 0; i < N; i++) {
if (H[i] >= M) {
count++;
}
M = max(M, H[i]);
}
cout << count << endl;
} | #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 M = H[0];
int count = 0;
for (int i = 0; i < N; i++) {
if (H[i] >= M) {
count++;
}
M = max(M, H[i]);
}
cout << count << endl;
} | [] | 883,392 | 883,393 | u374141734 | cpp |
p03072 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int a[21];
int ans = 0;
int ma = 0;
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
if (ma < a[i]) {
ans++;
ma = a[i];
}
}
printf("%d\n", ans);
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int a[21];
int ans = 0;
int ma = 0;
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
if (ma <= a[i]) {
ans++;
ma = a[i];
}
}
printf("%d\n", ans);
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 883,394 | 883,395 | u433665020 | cpp |
p03072 | #include <stdio.h>
int main() {
int i, n, a = 0, h = 0;
int data[20];
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &data[i]);
}
for (i = 0; i < n; i++) {
if (h < data[i]) {
a++;
h = data[i];
}
}
printf("%d", a);
return 0;
} | #include <stdio.h>
int main() {
int i, n, a = 0, h = 0;
int data[20];
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &data[i]);
}
for (i = 0; i < n; i++) {
if (h <= data[i]) {
a++;
h = data[i];
}
}
printf("%d", a);
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 883,396 | 883,397 | u433204705 | cpp |
p03072 | #include <cstring>
#include <iostream>
//#include<bits/stdc++.h>
#include <algorithm>
#include <cstdio>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#define si(a) scanf("%d", &a)
#define sl(a) scanf("%lld", &a)
#define sii(a, b) scanf("%d%d", &a, &b)
#define sll(a, b) scanf("%lld%lld", &a, &b)
#define queues priority_queue
#define mod 1000000007
#define mem(a) memset(a, 0, sizeof(a));
#define def(a) ((a) & (-a))
#define fi first
#define se second
#define mp make_pair
#define pb push_back
typedef long long ll;
// priority_queue<int,vector<int >,greater<int > >q;
const ll INF = 0x3f3f3f3f;
const double E = exp(1);
const double PI = acos(-1);
using namespace std;
ll kc(ll a, ll b) {
ll c = 1;
while (b) {
if (b & 1)
c *= a;
a *= a;
b >>= 1;
}
return c;
}
ll gcd(ll a, ll b) { return b == 0 ? a : gcd(b, a % b); }
int s[200003];
bool cmp(int a, int b) { return a > b; }
int main() {
int n, a[30], b[30], sum;
sum = 0;
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
int Max = 0;
for (int i = 1; i <= n; i++) {
if (s[i] >= Max) {
sum++;
}
Max = max(Max, s[i]);
}
cout << sum << endl;
}
/******************************************
** ** ******** **
** ** ** ** **
** ** ** ** **
** ** ** ** **
** *********** ** **
** ** ** ******** **
******************************************/
| #include <cstring>
#include <iostream>
//#include<bits/stdc++.h>
#include <algorithm>
#include <cstdio>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#define si(a) scanf("%d", &a)
#define sl(a) scanf("%lld", &a)
#define sii(a, b) scanf("%d%d", &a, &b)
#define sll(a, b) scanf("%lld%lld", &a, &b)
#define queues priority_queue
#define mod 1000000007
#define mem(a) memset(a, 0, sizeof(a));
#define def(a) ((a) & (-a))
#define fi first
#define se second
#define mp make_pair
#define pb push_back
typedef long long ll;
// priority_queue<int,vector<int >,greater<int > >q;
const ll INF = 0x3f3f3f3f;
const double E = exp(1);
const double PI = acos(-1);
using namespace std;
ll kc(ll a, ll b) {
ll c = 1;
while (b) {
if (b & 1)
c *= a;
a *= a;
b >>= 1;
}
return c;
}
ll gcd(ll a, ll b) { return b == 0 ? a : gcd(b, a % b); }
int s[200003];
bool cmp(int a, int b) { return a > b; }
int main() {
int n, a[30], b[30], sum;
sum = 0;
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
int Max = 0;
for (int i = 1; i <= n; i++) {
if (a[i] >= Max) {
sum++;
}
Max = max(Max, a[i]);
}
cout << sum << endl;
}
/******************************************
** ** ******** **
** ** ** ** **
** ** ** ** **
** ** ** ** **
** *********** ** **
** ** ** ******** **
******************************************/
| [
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"call.arguments.change"
] | 883,402 | 883,403 | u114362525 | cpp |
p03072 | #include <iostream>
using namespace std;
int check(int front, int back) {
int point = 0;
if (front < back) {
point++;
}
return point;
}
int main() {
int n;
int counter = 1;
cin >> n;
if (n > 0 && n <= 20) {
int h[n];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
for (int i = 1; i < n; i++) {
//山の高さを比べる(再帰処理が必要)
int j = i;
int counter2 = 0;
while (j == 0) {
counter2 += check(h[j - 1], h[i]);
j--;
}
if (counter2 == i) {
counter++;
}
}
cout << counter << endl;
} else {
return 0;
}
}
| #include <iostream>
using namespace std;
int check(int front, int back) {
int point = 0;
if (front <= back) {
point++;
}
return point;
}
int main() {
int n;
int counter = 1;
cin >> n;
if (n > 0 && n <= 20) {
int h[n];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
for (int i = 1; i < n; i++) {
//山の高さを比べる(再帰処理が必要)
int j = i;
int counter2 = 0;
while (j > 0) {
counter2 += check(h[j - 1], h[i]);
// cout << "counter2: " << counter2 << endl;
j--;
}
if (counter2 == i) {
counter++;
}
// cout << "counter: " << counter <<endl;
}
cout << counter << endl;
} else {
return 0;
}
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.condition.change"
] | 883,414 | 883,415 | u267434042 | cpp |
p03072 | #include <stdio.h>
int main(void) {
int n;
int a[20];
int i, j, co = 0, flag;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
for (i = n - 1; i > 0; i--) {
flag = 0;
for (j = i - 1; j >= 0; j--) {
if (a[i] >= a[j]) {
flag = 1;
} else {
flag = 0;
}
}
if (flag == 1) {
co++;
}
}
printf("%d\n", co + 1);
return 0;
} | #include <stdio.h>
int main(void) {
int n;
int a[20];
int i, j, co = 0, flag;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
for (i = n - 1; i > 0; i--) {
flag = 0;
for (j = i - 1; j >= 0; j--) {
if (a[i] >= a[j] && flag != 2) {
flag = 1;
} else {
flag = 2;
}
}
if (flag == 1) {
co++;
}
}
printf("%d\n", co + 1);
return 0;
} | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"literal.number.change",
"assignment.value.change"
] | 883,423 | 883,424 | u180133008 | cpp |
p03072 | #include <bits/stdc++.h>
using namespace std;
int main() {
int mountCnt = 0;
cin >> mountCnt;
int viewCnt = mountCnt;
int z = mountCnt;
vector<int> vec(mountCnt);
for (int i = 0; i < mountCnt; i++) {
cin >> vec.at(i);
}
for (int i = 0; i < mountCnt; i++) {
if (i == 0)
continue;
for (int j = 0; j < z; j++) {
if (vec.at(i) < vec.at(j)) {
viewCnt--;
break;
}
}
}
cout << viewCnt << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int mountCnt = 0;
cin >> mountCnt;
int viewCnt = mountCnt;
int z = mountCnt;
vector<int> vec(mountCnt);
for (int i = 0; i < mountCnt; i++) {
cin >> vec.at(i);
}
for (int i = 0; i < mountCnt; i++) {
if (i == 0)
continue;
for (int j = 0; j < i; j++) {
if (vec.at(i) < vec.at(j)) {
viewCnt--;
break;
}
}
}
cout << viewCnt << endl;
} | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 883,425 | 883,426 | u657465456 | cpp |
p03072 | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int H[100];
int answer = 1;
int saidai = 0;
for (int i = 0; i < N; i++) {
int X;
cin >> X;
H[i] = X;
if (i == 0) {
saidai = H[i];
}
if (i != 0 && saidai < H[i]) {
saidai = H[i];
answer++;
}
}
cout << answer << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int H[100];
int answer = 1;
int saidai = 0;
for (int i = 0; i < N; i++) {
int X;
cin >> X;
H[i] = X;
if (i == 0) {
saidai = H[0];
}
if (i != 0 && saidai <= H[i]) {
saidai = H[i];
answer++;
}
}
cout << answer << endl;
return 0;
}
| [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add",
"variable_access.subscript.index.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 883,427 | 883,428 | u899108527 | cpp |
p03072 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int count = 0;
int flag = 0;
cin >> N;
vector<int> a(N);
for (int i = 0; i < N; i++) {
cin >> a[i];
}
for (int i = 1; i < N; i++) {
flag = 0;
for (int j = i - 1; j >= 0; j--) {
if (a[i] > a[j]) {
flag++;
}
}
if (flag == i) {
count++;
}
}
cout << count + 1 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int count = 0;
int flag = 0;
cin >> N;
vector<int> a(N);
for (int i = 0; i < N; i++) {
cin >> a[i];
}
for (int i = 1; i < N; i++) {
flag = 0;
for (int j = (i - 1); j >= 0; j--) {
if (a[i] >= a[j]) {
flag++;
}
}
if (flag == i) {
count++;
}
}
cout << count + 1 << endl;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 883,431 | 883,432 | u311517735 | cpp |
p03072 | #include <bits/stdc++.h>
using namespace std;
int main() {
int r = 0;
int m = 0;
int N;
cin >> N;
vector<int> height(N); // N個の山の高さのデータ
// 標高のデータを受け取る
for (int i = 0; i < N; i++) {
cin >> height.at(i);
}
// 最大値のチェックと宿数チェック
for (int i = 0; i < N; i++) {
if (m <= height.at(i)) {
m = height.at(i), r = r + 1;
}
if (m > height.at(i)) {
m = m, r = r;
}
cout << r << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int r = 0;
int m = 0;
int N;
cin >> N;
vector<int> height(N); // N個の山の高さのデータ
// 標高のデータを受け取る
for (int i = 0; i < N; i++) {
cin >> height.at(i);
}
// 最大値のチェックと宿数チェック
for (int i = 0; i < N; i++) {
if (m <= height.at(i)) {
m = height.at(i), r = r + 1;
}
if (m > height.at(i)) {
m = m, r = r;
}
}
cout << r << endl;
}
| [] | 883,435 | 883,436 | u992159785 | cpp |
p03072 | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int height[N];
for (int i = 0; i < N; i++) {
cin >> height[i];
}
int max = 0;
int counter = 0;
for (int k = 0; k < N; k++) {
if (max < height[k]) {
max = height[k];
++counter;
}
}
cout << counter << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int height[N];
for (int i = 0; i < N; i++) {
cin >> height[i];
}
int max = 0;
int counter = 0;
for (int k = 0; k < N; k++) {
if (max <= height[k]) {
max = height[k];
++counter;
}
}
cout << counter << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 883,437 | 883,438 | u982831987 | cpp |
p03072 | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int height[N];
for (int i = 0; i < N; i++) {
cin >> height[i];
}
int max = 0;
int counter = 0;
for (int k = 0; k < N; k++) {
if (max < height[k]) {
max = height[k];
++counter;
}
}
cout << counter << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int height[N];
for (int i = 0; i < N; i++) {
cin >> height[i];
}
int max = 0;
int counter = 0;
for (int k = 0; k < N; k++) {
if (max <= height[k]) {
max = height[k];
++counter;
}
}
cout << counter << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 883,439 | 883,438 | u982831987 | cpp |
p03072 | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int height[N];
for (int i = 0; i < N; i++) {
cin >> height[i];
}
int max = 0;
int counter = 0;
for (int k; k < N; k++) {
if (max < height[k]) {
max = height[k];
++counter;
}
}
cout << counter << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int height[N];
for (int i = 0; i < N; i++) {
cin >> height[i];
}
int max = 0;
int counter = 0;
for (int k = 0; k < N; k++) {
if (max <= height[k]) {
max = height[k];
++counter;
}
}
cout << counter << endl;
return 0;
}
| [
"control_flow.loop.for.initializer.change",
"variable_declaration.value.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 883,440 | 883,438 | u982831987 | cpp |
p03072 | #include <bits/stdc++.h>
using namespace std;
int main() { // freopen("in.txt","r",stdin);
// freopen("out.txt","w",stdout);
int n;
cin >> n;
int ans, ma = 0;
cin >> ans;
int count = 1;
for (int i = 1; i < n; i++) {
cin >> ma;
if (ma >= ans)
count++;
}
cout << count;
}
| #include <bits/stdc++.h>
using namespace std;
int main() { // freopen("in.txt","r",stdin);
// freopen("out.txt","w",stdout);
int n;
cin >> n;
int ans, ma = 0;
cin >> ans;
int count = 1;
for (int i = 1; i < n; i++) {
cin >> ma;
if (ma >= ans)
count++, ans = ma;
}
cout << count;
}
| [] | 883,445 | 883,446 | u207685829 | cpp |
p03072 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, e;
cin >> a;
vector<int> vec;
for (int b = 0; b < a; b++) {
cin >> e;
vec.push_back(e);
}
int c = 1;
int f = vec.at(0);
for (int d = 1; d < a; d++) {
if (vec.at(d) > f) {
c++;
f = vec.at(d);
}
}
cout << c << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, e;
cin >> a;
vector<int> vec;
for (int b = 0; b < a; b++) {
cin >> e;
vec.push_back(e);
}
int c = 1;
int f = vec.at(0);
for (int d = 1; d < a; d++) {
if (vec.at(d) >= f) {
c++;
f = vec.at(d);
}
}
cout << c << endl;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 883,459 | 883,460 | u759162415 | cpp |
p03072 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, n) for (int i = 0; i < n; ++i)
#define FORR(i, a, n) for (int i = a; i < n; ++i)
#define ALL(c) (c).begin(), (c).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define UNIQ(c) (c).erase(unique(ALL((c))), end((c)))
typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<VI> VVI;
typedef vector<VL> VVL;
typedef vector<string> VS;
typedef pair<int, int> P;
typedef pair<ll, ll> PL;
int in() {
int x;
scanf("%d", &x);
return x;
}
ll lin() {
ll x;
scanf("%lld", &x);
return x;
}
void printfv(VI a) {
int n = a.size();
FOR(i, n) cout << a[i] << " ";
}
int main(void) {
int n;
cin >> n;
int a[n];
FOR(i, n) { cin >> a[i]; }
int count = 1, obs = a[0];
FORR(i, 1, n - 1) {
if (obs <= a[i]) {
obs = a[i];
count++;
}
}
cout << count;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define FOR(i, n) for (int i = 0; i < n; ++i)
#define FORR(i, a, n) for (int i = a; i < n; ++i)
#define ALL(c) (c).begin(), (c).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define UNIQ(c) (c).erase(unique(ALL((c))), end((c)))
typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<VI> VVI;
typedef vector<VL> VVL;
typedef vector<string> VS;
typedef pair<int, int> P;
typedef pair<ll, ll> PL;
int in() {
int x;
scanf("%d", &x);
return x;
}
ll lin() {
ll x;
scanf("%lld", &x);
return x;
}
void printfv(VI a) {
int n = a.size();
FOR(i, n) cout << a[i] << " ";
}
int main(void) {
int n;
cin >> n;
int a[n];
FOR(i, n) { cin >> a[i]; }
int count = 1, obs = a[0];
FORR(i, 1, n) {
if (obs <= a[i]) {
obs = a[i];
count++;
}
}
cout << count;
return 0;
}
| [
"expression.operation.binary.remove"
] | 883,466 | 883,467 | u522598953 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.