problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k | fixed_code stringlengths 12 526k | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M | fixed_submission_id int64 2 1.54M | user_id stringlengths 10 10 | language stringclasses 8
values |
|---|---|---|---|---|---|---|---|
p03072 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repf(i, a, b) for (int i = (a); i < (b); i++)
#define repi(i, a, b) for (int i = (a); i <= (b); i++)
#define repr(i, a, b) for (int i = (a); i >= (b); i--)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#def... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repf(i, a, b) for (int i = (a); i < (b); i++)
#define repi(i, a, b) for (int i = (a); i <= (b); i++)
#define repr(i, a, b) for (int i = (a); i >= (b); i--)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#def... | [
"expression.operation.binary.remove"
] | 882,415 | 882,414 | u850516963 | cpp |
p03072 | #include <bits/stdc++.h>
#define INF 1000000000
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int N, maxtmp = 0, cnt = 0;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
if (maxtmp >= A[i])
cnt++;
if (maxtmp < A[i])
maxtmp = A[... | #include <bits/stdc++.h>
#define INF 1000000000
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int N, maxtmp = 0, cnt = 0;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
if (maxtmp <= A[i])
cnt++;
if (maxtmp < A[i])
maxtmp = A[i... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 882,416 | 882,417 | u207948013 | cpp |
p03072 | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <set>
#include <stdlib.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
// cout << << endl;
typedef long long int ll;
typedef long double ld;
const... | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <set>
#include <stdlib.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
// cout << << endl;
typedef long long int ll;
typedef long double ld;
const... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 882,418 | 882,419 | u273928723 | cpp |
p03072 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
// const ll INF = 1LL<<60;
const long long INF = 1LL << 60; // 仮想的な無限大の値
int main() {
ll N;
cin >> N;
vector<ll> H(N);
rep(i, N) cin >> H[i];
vector<ll> S(N, 0);
rep(i, N) S[i + 1] = m... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
// const ll INF = 1LL<<60;
const long long INF = 1LL << 60; // 仮想的な無限大の値
int main() {
ll N;
cin >> N;
vector<ll> H(N);
rep(i, N) cin >> H[i];
vector<ll> S(N + 1, 0);
rep(i, N) S[i + 1]... | [
"assignment.change"
] | 882,362 | 882,363 | u409417260 | cpp |
p03072 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define ll long long
int main() {
int n;
cin >> n;
int h[n];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
int ans = 0;
for (int i = 0; i < n; i++) {
bool temp = true;
for (int j = 0; j < i; j++) {
if (h[j] < h[i]) {
... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define ll long long
int main() {
int n;
cin >> n;
int h[n];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
int ans = 0;
for (int i = 0; i < n; i++) {
bool temp = true;
for (int j = 0; j < i; j++) {
if (h[j] > h[i]) {
... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 882,431 | 882,432 | u205280593 | cpp |
p03072 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int max = 0;
int ans = 0;
for (int i = 0; i < N; i++) {
int h;
cin >> h;
if (h > max) {
max = h;
ans++;
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int max = 0;
int ans = 0;
for (int i = 0; i < N; i++) {
int h;
cin >> h;
if (h >= max) {
max = h;
ans++;
}
}
cout << ans << endl;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 882,445 | 882,446 | u538808095 | cpp |
p03072 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n;
cin >> n;
vector<int> h(n);
rep(i, n) { cin >> h[i]; }
int niceView = 1; //西端は常に見られる
int maxHeight = h.at(0);
for (int i = 1; i < n; i++) {
if (maxHeight <= h.at(i)) {
maxHeig... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n;
cin >> n;
vector<int> h(n);
rep(i, n) { cin >> h[i]; }
int niceView = 1; //西端は常に見られる
int maxHeight = h.at(0);
for (int i = 1; i < n; i++) {
if (maxHeight <= h.at(i)) {
maxHeig... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change"
] | 882,447 | 882,448 | u815628714 | cpp |
p03072 | #include <iostream>
#include <vector>
int main() {
using namespace std;
int n;
cin >> n;
vector<int> h(n);
for (int hi : h)
cin >> hi;
int h_max = 0;
int ans = 0;
for (const int &hi : h) {
if (h_max <= hi) {
h_max = hi;
++ans;
}
}
cout << ans << endl;
return 0;
} | #include <iostream>
#include <vector>
int main() {
using namespace std;
int n;
cin >> n;
vector<int> h(n);
for (int &hi : h)
cin >> hi;
int h_max = 0;
int ans = 0;
for (const int &hi : h) {
if (h_max <= hi) {
h_max = hi;
++ans;
}
}
cout << ans << endl;
return 0;
} | [] | 882,449 | 882,450 | u356069145 | cpp |
p03072 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> H(N);
int high = 0;
int count = 0;
for (int i = 0; i < N; i++) {
cin >> H.at(i);
int high = max(high, H.at(i));
if (H.at(i) >= high)
count++;
}
cout << count << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> H(N);
int high = 0;
int count = 0;
for (int i = 0; i < N; i++) {
cin >> H.at(i);
high = max(high, H.at(i));
if (H.at(i) >= high)
count++;
}
cout << count << endl;
}
| [] | 882,451 | 882,452 | u021657949 | 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 w = h[0], aw = 1;
for (int i = 1; i < n; i++) {
w = max(w, h[i]);
if (w = h[i]) {
aw++;
}
}
cout << aw << 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 w = h[0], aw = 1;
for (int i = 1; i < n; i++) {
w = max(w, h[i]);
if (w == h[i]) {
aw++;
}
}
cout << aw << endl;
}
| [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 882,453 | 882,454 | u834753207 | cpp |
p03072 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll LINF = 1e18;
const int INF = 1e9;
const ll MOD = 1000000007;
int main() {
int n;
cin >> n;
vector<int> h(n);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
int ans = 1;
int max_h = h[0];
for (int i = 1; i < n; i++) {
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll LINF = 1e18;
const int INF = 1e9;
const ll MOD = 1000000007;
int main() {
int n;
cin >> n;
vector<int> h(n);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
int ans = 1;
int max_h = h[0];
for (int i = 1; i < n; i++) {
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 882,458 | 882,459 | u748757847 | cpp |
p03072 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int h;
int m = -1;
int res = 0;
for (int i = 0; i < n; i++) {
cin >> h;
if (m <= h) {
res++;
}
m = max(m, h);
}
cout << res << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int h;
cin >> n;
int m = -1;
int res = 0;
for (int i = 0; i < n; i++) {
cin >> h;
if (m <= h) {
res++;
}
m = max(m, h);
}
cout << res << endl;
}
| [] | 882,464 | 882,465 | u231354686 | cpp |
p03072 | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#inclu... | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#inclu... | [
"variable_declaration.name.change",
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.variable.change"
] | 882,477 | 882,478 | u504142483 | cpp |
p03072 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int max = a[0], ans;
for (int i = 1; i < n; i++) {
if (max <= a[i])
ans++;
if (max < a[i])
max = a[i];
}
cout << ans << endl;
... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int max = a[0], ans = 1;
for (int i = 1; i < n; i++) {
if (max <= a[i])
ans++;
if (max < a[i])
max = a[i];
}
cout << ans << en... | [
"variable_declaration.value.change"
] | 882,479 | 882,480 | u056912761 | cpp |
p03072 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define _GLIBCXX_DEBUG
static const int MAX = 20;
int main() {
int N;
cin >> N;
int H[MAX];
int count = 1;
int Hmax;
rep(i, N) cin >> H[i];
Hmax = ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define _GLIBCXX_DEBUG
static const int MAX = 20;
int main() {
int N;
cin >> N;
int H[MAX];
int count = 1;
int Hmax;
rep(i, N) cin >> H[i];
Hmax = ... | [
"expression.operation.binary.remove"
] | 882,488 | 882,489 | u378125390 | cpp |
p03072 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define _GLIBCXX_DEBUG
static const int MAX = 20;
int main() {
int N;
cin >> N;
int H[MAX];
int count = 1;
int Hmax;
rep(i, N) cin >> H[i];
Hmax = ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define _GLIBCXX_DEBUG
static const int MAX = 20;
int main() {
int N;
cin >> N;
int H[MAX];
int count = 1;
int Hmax;
rep(i, N) cin >> H[i];
Hmax = ... | [
"expression.operation.binary.remove"
] | 882,490 | 882,489 | u378125390 | cpp |
p03072 | #include <iostream>
using namespace std;
int main() {
int N, H[20];
cin >> N;
for (int i = 0; i < N; i++) {
cin >> H[i];
}
int ans = 1;
for (int i = 1; i < N; i++) {
for (int j = 0; j < i; j++) {
if (H[i] < H[j])
break;
if (j = i - 1)
ans++;
}
}
cout << ans << end... | #include <iostream>
using namespace std;
int main() {
int N, H[20];
cin >> N;
for (int i = 0; i < N; i++) {
cin >> H[i];
}
int ans = 1;
for (int i = 1; i < N; i++) {
for (int j = 0; j < i; j++) {
if (H[i] < H[j])
break;
if (j == i - 1)
ans++;
}
}
cout << ans << en... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 882,493 | 882,494 | u204523044 | cpp |
p03072 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, h, hmax, i, ans = 1;
cin >> n >> hmax;
for (i = 1; i < n; i++) {
cin >> h;
if (h > hmax) {
ans++;
hmax = h;
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, h, hmax, i, ans = 1;
cin >> n >> hmax;
for (i = 1; i < n; i++) {
cin >> h;
if (h >= hmax) {
ans++;
hmax = h;
}
}
cout << ans << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 882,497 | 882,498 | u088895504 | cpp |
p03072 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, h, hmax, i, ans = 0;
cin >> n >> hmax;
for (i = 1; i < n; i++) {
cin >> h;
if (h > hmax) {
ans++;
hmax = h;
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, h, hmax, i, ans = 1;
cin >> n >> hmax;
for (i = 1; i < n; i++) {
cin >> h;
if (h >= hmax) {
ans++;
hmax = h;
}
}
cout << ans << endl;
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 882,499 | 882,498 | u088895504 | cpp |
p03072 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, h;
cin >> n;
int mxh = 0, ans = 0;
for (int i = 0; i < n; i++) {
cin >> h;
if (mxh < h) {
mxh = h;
ans++;
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, h;
cin >> n;
int mxh = 0, ans = 0;
for (int i = 0; i < n; i++) {
cin >> h;
if (mxh <= h) {
mxh = h;
ans++;
}
}
cout << ans << endl;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 882,505 | 882,506 | u332946309 | cpp |
p03072 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int N;
cin >> N;
int max = 0;
int ans = 0;
vector<int> A(N);
rep(i, N) cin >> A.at(i);
rep(i, N) {
if (max <= A.at(i)) {
ans++;
max = A.at(i);
}
cout << ans << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int N;
cin >> N;
int max = 0;
int ans = 0;
vector<int> A(N);
rep(i, N) cin >> A.at(i);
rep(i, N) {
if (max <= A.at(i)) {
ans++;
max = A.at(i);
}
}
cout << ans << endl;
}
| [] | 882,511 | 882,512 | u854161810 | cpp |
p03072 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
#define MIN(a, b) ((a) < (b) ? (a) : (b))
#define MAX(a, b) ((a) > (b) ? (a) : (b))
#define for_... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
#define MIN(a, b) ((a) < (b) ? (a) : (b))
#define MAX(a, b) ((a) > (b) ? (a) : (b))
#define for_... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 882,513 | 882,514 | u479202791 | cpp |
p03072 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
#define MIN(a, b) ((a) < (b) ? (a) : (b))
#define MAX(a, b) ((a) > (b) ? (a) : (b))
#define for_... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
#define MIN(a, b) ((a) < (b) ? (a) : (b))
#define MAX(a, b) ((a) > (b) ? (a) : (b))
#define for_... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"identifier.change",
"io.output.change"
] | 882,515 | 882,514 | u479202791 | cpp |
p03072 | #include <iostream>
using namespace std;
int main() {
int n, *H;
cin >> n;
H = new int[n];
for (int i; i < n; i++)
cin >> H[i];
int ans = 1;
int i = 0;
for (i = 1; i < n; i++) {
bool can = true;
for (int j = 0; j < i; j++) {
if (H[j] > H[i])
can = false;
}
if (can)
... | #include <iostream>
using namespace std;
int main() {
int n, *H;
cin >> n;
H = new int[n];
for (int i = 0; i < n; i++)
cin >> H[i];
int ans = 1;
int i = 0;
for (i = 1; i < n; i++) {
bool can = true;
for (int j = 0; j < i; j++) {
if (H[j] > H[i])
can = false;
}
if (can)
... | [
"control_flow.loop.for.initializer.change",
"variable_declaration.value.change"
] | 882,524 | 882,525 | u110383054 | cpp |
p03072 | #include <array>
#include <iostream>
#include <string>
using namespace std;
int main() {
int num;
cin >> num;
int mou;
int old = 0;
int see = 0;
int f = 0;
int loop = 0;
while (num--) {
cin >> mou;
if (mou > old && mou >= f) {
see++;
}
if (loop == 0) {
f = mou;
}
if ... | #include <array>
#include <iostream>
#include <string>
using namespace std;
int main() {
int num;
cin >> num;
int mou;
int old = 0;
int see = 0;
int f = 0;
int loop = 0;
while (num--) {
cin >> mou;
if (mou >= old && mou >= f) {
see++;
}
if (loop == 0) {
f = mou;
}
if... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 882,526 | 882,527 | u840731541 | cpp |
p03072 | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define mod 1000000007
string divide[4] = {"dream", "dreamer", "erase", "eraser"};
int main() {
int N; //山の数
... | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define mod 1000000007
string divide[4] = {"dream", "dreamer", "erase", "eraser"};
int main() {
int N; //山の数
... | [
"assignment.value.change"
] | 882,530 | 882,531 | u539675863 | cpp |
p03072 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N; // yama no kazu
cin >> N;
int H[100];
for (int i = 0; i < N; i++) {
cin >> H[i];
}
int count = 0; // mieru ryokan no kazu
int max = 0; // saidai yama takasa
for (int i = 0; i < N; i++) {
if (H[i] < max) {
max = H[i];
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int H[100];
for (int i = 0; i < N; i++) {
cin >> H[i];
}
int count = 0;
int max = 0;
for (int i = 0; i < N; i++) {
if (H[i] > max) {
max = H[i];
}
if (max <= H[i]) {
count++;
}
}
cout << coun... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 882,532 | 882,533 | u539675863 | cpp |
p03072 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> height(N);
for (int i = 0; i < N; i++) {
cin >> height.at(i);
}
int count = 0;
for (int i = 0; i < N; i++) {
bool flag = true;
for (int j = 0; j < i; j++) {
if (height.at(j) > height.at(i)) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> height(N);
for (int i = 0; i < N; i++) {
cin >> height.at(i);
}
int count = 0;
for (int i = 0; i < N; i++) {
bool flag = true;
for (int j = 0; j < i; j++) {
if (height.at(j) > height.at(i)) {
... | [] | 882,534 | 882,535 | u477343425 | cpp |
p03072 | #include <algorithm> //sort(all(変数),greater<型名>()) で降順に
#include <cmath> //切り上げceil(値)
#include <deque>
#include <iomanip> //setprecision(数字)
#include <iostream>
#include <list>
#include <map>
#include <numeric> //xとyの最大公約数は__gcd(x,y),xとyの最小公倍数は(x*y)/__gcd
#include <queue>
#include <set>
#include <stack>
#include <... | #include <algorithm> //sort(all(変数),greater<型名>()) で降順に
#include <cmath> //切り上げceil(値)
#include <deque>
#include <iomanip> //setprecision(数字)
#include <iostream>
#include <list>
#include <map>
#include <numeric> //xとyの最大公約数は__gcd(x,y),xとyの最小公倍数は(x*y)/__gcd
#include <queue>
#include <set>
#include <stack>
#include <... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 882,538 | 882,539 | u667375816 | cpp |
p03072 | #include <bits/stdc++.h>
using namespace std;
/* #pragma */
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
/*alias*/
#define F first
#define S second
#define y0 y3487465
#define y1 y8687969
#define j0 j1347829
#define j1 j234892
#define next asdnext
#d... | #include <bits/stdc++.h>
using namespace std;
/* #pragma */
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
/*alias*/
#define F first
#define S second
#define y0 y3487465
#define y1 y8687969
#define j0 j1347829
#define j1 j234892
#define next asdnext
#d... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 882,540 | 882,541 | u509680664 | cpp |
p03072 | // template
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<long long, long long> LP;
#define INF 999999999
#define MOD 1000000007
#define REP(i, n) for (ll i = 0, i##_len = (n); i < i##_len; i++)
#define REP_AB(i, a, b) for (ll i = ll(a); i < ll(b); i++)
#define ALL(v) v.begin(), v... | // template
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<long long, long long> LP;
#define INF 999999999
#define MOD 1000000007
#define REP(i, n) for (ll i = 0, i##_len = (n); i < i##_len; i++)
#define REP_AB(i, a, b) for (ll i = ll(a); i < ll(b); i++)
#define ALL(v) v.begin(), v... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 882,548 | 882,549 | u703877026 | cpp |
p03072 | // templates
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <unordered_map>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define ALL(x) (x).begin(), (x).end()
#define sort_key(struct_name, key_name) ... | // templates
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <unordered_map>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define ALL(x) (x).begin(), (x).end()
#define sort_key(struct_name, key_name) ... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 882,552 | 882,553 | u970738863 | cpp |
p03072 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
int n;
cin >> n;
vector<int> vec(n);
rep(i, n) { cin >> vec.at(i); }
int max = 0;
int num = 0;
rep(i, n) {
if (i == 0) {
max = vec.at(i);
continue;
}
if (vec.at(i) >= max) {
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
int n;
cin >> n;
vector<int> vec(n);
rep(i, n) { cin >> vec.at(i); }
int max = 0;
int num = 1;
rep(i, n) {
if (i == 0) {
max = vec.at(i);
continue;
}
if (vec.at(i) >= max) {
... | [
"literal.number.change",
"variable_declaration.value.change"
] | 882,558 | 882,559 | u741134767 | cpp |
p03072 | #include <iostream>
using namespace std;
int main() {
int N, H[21], max_h, cnt = 0;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> H[i];
if (H[i] >= max_h) {
cnt++;
}
max_h = max(max_h, H[i]);
}
cout << cnt << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int N, H[21], max_h = -1, cnt = 0;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> H[i];
if (H[i] >= max_h) {
cnt++;
}
max_h = max(max_h, H[i]);
}
cout << cnt << endl;
return 0;
}
| [
"variable_declaration.value.change"
] | 882,566 | 882,567 | u134181243 | cpp |
p03072 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int max;
cin >> max;
int ret = 1;
for (int i = 1; i < n; ++i) {
int h;
cin >> h;
if (max < h) {
++ret;
max = h;
}
}
cout << ret << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int max;
cin >> max;
int ret = 1;
for (int i = 1; i < n; ++i) {
int h;
cin >> h;
if (max <= h) {
++ret;
max = h;
}
}
cout << ret << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 882,574 | 882,575 | u611571299 | cpp |
p03072 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, m, n) for (int i = m; i < (int)(n); i++)
#define MOD 1000000007
int arrayMax(vector<int> p, int idx) {
int max_Val = p.at(0);
rep(i, idx) { max_Val = max(max_Val, p.at(i)); }
return max_Val;
}
int... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, m, n) for (int i = m; i < (int)(n); i++)
#define MOD 1000000007
int arrayMax(vector<int> p, int idx) {
int max_Val = p.at(0);
rep(i, idx) { max_Val = max(max_Val, p.at(i)); }
return max_Val;
}
int... | [
"expression.operation.binary.remove"
] | 882,576 | 882,577 | u503640463 | cpp |
p03072 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
int maxH = 0;
int res = 0;
for (int i = 0; i < n; i++) {
if (a[i] >= maxH) {
res += 1;
maxH = a[i];
}
}
cout << maxH << '\n';
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
int maxH = 0;
int res = 0;
for (int i = 0; i < n; i++) {
if (a[i] >= maxH) {
res += 1;
maxH = a[i];
}
}
cout << res << '\n';
return 0;
} | [
"identifier.change",
"io.output.change"
] | 882,578 | 882,579 | u217173261 | cpp |
p03072 | #include <bits/stdc++.h>
#include <cctype>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
std::string line;
typedef long long ll;
int main() {
int n, h[110];
cin >> n;
re... | #include <bits/stdc++.h>
#include <cctype>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
std::string line;
typedef long long ll;
int main() {
int n, h[110];
cin >> n;
re... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 882,583 | 882,584 | u796819311 | cpp |
p03072 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X, ans = 0, tall;
cin >> N >> X;
tall = X;
for (int i = 1; i < N; i++) {
cin >> X;
if (X >= tall)
ans++;
tall = max(tall, X);
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X, ans = 0, tall;
cin >> N >> X;
tall = X;
for (int i = 1; i < N; i++) {
cin >> X;
if (X >= tall)
ans++;
tall = max(tall, X);
}
cout << ans + 1;
} | [] | 882,585 | 882,586 | u347057617 | cpp |
p03072 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X, ans = 0, tall;
cin >> N >> X;
tall = X;
for (int i = 1; i < N; i++) {
cin >> X;
if (X >= tall)
ans++;
tall = max(tall, X);
}
cout << ans;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X, ans = 0, tall;
cin >> N >> X;
tall = X;
for (int i = 1; i < N; i++) {
cin >> X;
if (X >= tall)
ans++;
tall = max(tall, X);
}
cout << ans + 1;
} | [
"expression.operation.binary.add"
] | 882,587 | 882,586 | u347057617 | cpp |
p03072 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int count = 0;
int flag = 0;
int N;
cin >> N;
vector<int> X(N);
rep(i, N) { cin >> X[i]; }
rep(i, N) {
rep(j, i) {
if (X[j] <= X[i]) {
flag++;
}
}
if (flag > 0) ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int count = 0;
int flag = 0;
int N;
cin >> N;
vector<int> X(N);
rep(i, N) { cin >> X[i]; }
rep(i, N) {
rep(j, i) {
if (X[j] > X[i]) {
flag++;
}
}
if (flag == 0) ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 882,588 | 882,589 | u573537453 | cpp |
p03072 | // 🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤
// //
// 🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤
// //
// 🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤
// //
// 🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤
// //
// 🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤
// //
// 🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤�... | // 🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤
// //
// 🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤
// //
// 🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤
// //
// 🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤
// //
// 🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤
// //
// 🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤�... | [] | 882,590 | 882,591 | u652633828 | cpp |
p03072 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, sum = 1;
bool a;
cin >> n;
vector<int> h(n);
cin >> h.at(0);
for (int i = 1; i < n; i++) {
a = true;
cin >> h.at(i);
for (int l = 0; l < i; l++) {
if (h.at(i) > h.at(l)) {
a = false;
break;
}
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, sum = 1;
bool a;
cin >> n;
vector<int> h(n);
cin >> h.at(0);
for (int i = 1; i < n; i++) {
a = true;
cin >> h.at(i);
for (int l = 0; l < i; l++) {
if (h.at(i) < h.at(l)) {
a = false;
break;
}
}
... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 882,594 | 882,595 | u442754977 | cpp |
p03072 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int h_max = 0;
int answer = 0;
for (int i = 0; i < N; i++) {
int H;
cin >> H;
if (H > h_max) {
answer++;
h_max = H;
}
}
cout << answer;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int h_max = 0;
int answer = 0;
for (int i = 0; i < N; i++) {
int H;
cin >> H;
if (H >= h_max) {
answer++;
h_max = H;
}
}
cout << answer;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 882,602 | 882,603 | u599568485 | cpp |
p03072 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> h(n);
for (int i = 0; i < n; i++)
cin >> h[i];
int ans = 0;
int max = 0;
for (int j = 0; j < n; j++) {
if (j == 0) {
ans++;
max = h[j];
} else if (h[j] > h[j - 1] && h[j] > max)... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> h(n);
for (int i = 0; i < n; i++)
cin >> h[i];
int ans = 0;
int max = 0;
for (int j = 0; j < n; j++) {
if (j == 0) {
ans++;
max = h[j];
} else if (h[j] >= h[j - 1] && h[j] >= ma... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 882,604 | 882,605 | u726187349 | cpp |
p03072 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> h(n);
rep(i, n) cin >> h[i + 1];
int res = 1;
int max_hight = h[1];
for (int i = 2; i < (n); ++i) {
max_hight = max(max_hight, h[i]);
if (m... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> h(n);
rep(i, n) cin >> h[i + 1];
int res = 1;
int max_hight = h[1];
for (int i = 2; i < (n + 1); ++i) {
max_hight = max(max_hight, h[i]);
i... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 882,610 | 882,611 | u139255323 | cpp |
p03072 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, ans(0), M;
cin >> N;
vector<int> h(N);
for (int i = 0; i < N; i++) {
cin >> h[i];
if (h[i] >= M) {
M = h[i];
ans++;
}
}
cout << ans << endl;
} | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, ans(0), M(0);
cin >> N;
vector<int> h(N);
for (int i = 0; i < N; i++) {
cin >> h[i];
if (h[i] >= M) {
M = h[i];
ans++;
}
}
cout << ans << endl;
} | [
"call.arguments.add"
] | 882,636 | 882,637 | u456658814 | cpp |
p03072 | #include <iostream>
using namespace std;
int main() {
int n, h, dp[20], cnt = 1;
cin >> n;
cin >> dp[0];
for (int i = 1; i < n; i++) {
cin >> h;
if (h > dp[i - 1]) {
cnt++;
dp[i] = h;
} else {
dp[i] = dp[i - 1];
}
}
cout << cnt << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n, h, dp[20], cnt = 1;
cin >> n;
cin >> dp[0];
for (int i = 1; i < n; i++) {
cin >> h;
if (h >= dp[i - 1]) {
cnt++;
dp[i] = h;
} else {
dp[i] = dp[i - 1];
}
}
cout << cnt << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 882,638 | 882,639 | u522506260 | 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 cnt = 1;
int nax = 0;
for (int i = 1; i < N; i++) {
if (H[i] >= nax) {
cnt++;
nax = H[i];
}
}
cout << cnt;
return 0;
}
| #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 cnt = 1;
int nax = H[0];
for (int i = 1; i < N; i++) {
if (H[i] >= nax) {
cnt++;
nax = H[i];
}
}
cout << cnt;
return 0;
}
| [] | 882,648 | 882,649 | u101513772 | cpp |
p03072 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int h[110];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
int count = 0;
for (int i = 1; i < n; i++) {
bool isOk = true;
for (int j = 0; j < i - 1; j++) {
if (h[j] > h[i]) {
isOk = false;
}
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int h[110];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
int count = 1;
for (int i = 1; i < n; i++) {
bool isOk = true;
for (int j = 0; j < i; j++) {
if (h[j] > h[i]) {
isOk = false;
}
}
if ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 882,653 | 882,654 | u692131329 | cpp |
p03072 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, s = 1;
cin >> n;
vector<int> v(n);
cin >> v.at(0);
for (int i = 1; i < n; i++) {
cin >> v.at(i);
bool a = 1;
for (int j = 0; j < i; j++) {
if (v.at(i) < v.at(j))
a = 0;
}
if (a = 1)
s++;
}
cout << s ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, s = 1;
cin >> n;
vector<int> v(n);
cin >> v.at(0);
for (int i = 1; i < n; i++) {
cin >> v.at(i);
bool a = 1;
for (int j = 0; j < i; j++) {
if (v.at(i) < v.at(j))
a = 0;
}
if (a)
s++;
}
cout << s << e... | [
"control_flow.loop.for.condition.change",
"assignment.change"
] | 882,655 | 882,656 | u757584836 | cpp |
p03072 | #include <algorithm>
#include <functional>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define All(x) (x).begin(), (x).end()
using namespace std;
using pii = pair<int, int>;
typedef long long ll;
#define ... | #include <algorithm>
#include <functional>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define All(x) (x).begin(), (x).end()
using namespace std;
using pii = pair<int, int>;
typedef long long ll;
#define ... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 882,657 | 882,658 | u008229752 | cpp |
p03072 | #include <algorithm>
#include <deque>
#include <iostream>
#include <math.h>
#include <queue>
#include <stdlib.h>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
... | #include <algorithm>
#include <deque>
#include <iostream>
#include <math.h>
#include <queue>
#include <stdlib.h>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change"
] | 882,663 | 882,664 | u561443723 | cpp |
p03072 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i < (int)(n); i++)
#define fs first
#define sc second
typedef pair<ll, ll> l_l;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
int main() {
cin.tie(0... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i < (int)(n); i++)
#define fs first
#define sc second
typedef pair<ll, ll> l_l;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
int main() {
cin.tie(0... | [
"call.arguments.change"
] | 882,672 | 882,673 | u263715385 | cpp |
p03072 | #include <iostream>
using namespace std;
int main() {
int N, A;
int max = 0;
int some_count = 0;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> A;
if (A >= max) {
some_count++;
A = max;
}
}
cout << some_count << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int N, A;
int max = 0;
int some_count = 0;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> A;
if (A >= max) {
some_count++;
max = A;
}
}
cout << some_count << endl;
return 0;
}
| [
"assignment.change"
] | 882,674 | 882,675 | u399527001 | cpp |
p03072 | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <vector>
typedef long long ll;
typedef unsigned long long ull;
typedef int itn;
const ll LINF = 1e18;
const int INF = 1e8;
using namespace std;
#define vvint(vec, n, m, l) vector<v... | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <vector>
typedef long long ll;
typedef unsigned long long ull;
typedef int itn;
const ll LINF = 1e18;
const int INF = 1e8;
using namespace std;
#define vvint(vec, n, m, l) vector<v... | [
"expression.operation.binary.add"
] | 882,682 | 882,683 | u776194115 | cpp |
p03072 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m = 1;
cin >> n;
vector<int> h(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[j] <= h[i]) {
if (j = i - 1)
m++;
} else {
break;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m = 1;
cin >> n;
vector<int> h(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[j] <= h[i]) {
if (j == i - 1)
m++;
} else {
break;
... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 882,684 | 882,685 | u930561195 | cpp |
p03072 | #include <algorithm>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
//#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a), i##formax = (b); i < i##formax; i++)
typedef long long ll;
int main() {
int n, ct = 0, mx = 101;
cin >> n;
int h[n];
... | #include <algorithm>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
//#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a), i##formax = (b); i < i##formax; i++)
typedef long long ll;
int main() {
int n, ct = 0, mx = 0;
cin >> n;
int h[n];
... | [
"literal.number.change",
"variable_declaration.value.change"
] | 882,688 | 882,689 | u287367500 | cpp |
p03072 | #include <iostream>
using namespace std;
int main() {
int temp, N, max, count = 1;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> temp;
if (i == 0) {
max = temp;
} else if (max < temp) {
count++;
max = temp;
}
}
cout << count << endl;
} | #include <iostream>
using namespace std;
int main() {
int temp, N, max, count = 1;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> temp;
if (i == 0) {
max = temp;
} else if (max <= temp) {
count++;
max = temp;
}
}
cout << count << endl;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 882,694 | 882,695 | u710135612 | cpp |
p03072 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define repone(i, n) for (int i = 1; i < (int)(n); ++i)
#define Rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define int long long
using namespace std;
signed main() {
int x, y, z, w, i, j = 0;
cin >> x;
std::vector<int> v(x);
rep... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define repone(i, n) for (int i = 1; i < (int)(n); ++i)
#define Rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define int long long
using namespace std;
signed main() {
int x, y, z, w, i, j = 1;
cin >> x;
std::vector<int> v(x);
rep... | [
"literal.number.change",
"variable_declaration.value.change",
"identifier.change"
] | 882,696 | 882,697 | u893330446 | cpp |
p03072 | #include <iostream>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
int main() {
int N, ans = 1;
cin >> N;
vector<int> H(N);
rep(i, N) cin >> H[i];
for (int i = 1; i < N; ++i) {
int cnt = 0;
rep(j, i + 1) {
if (H[i] <= H[j]) {
cnt++;
}
}... | #include <iostream>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
int main() {
int N, ans = 1;
cin >> N;
vector<int> H(N);
rep(i, N) cin >> H[i];
for (int i = 1; i < N; ++i) {
int cnt = 0;
rep(j, i + 1) {
if (H[j] <= H[i]) {
cnt++;
}
}... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 882,698 | 882,699 | u887207211 | cpp |
p03072 | #include <bits/stdc++.h>
#define all(a) a.begin(), a.end()
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef pair<ll, ll> P;
constexpr ll mod = 1000000007;
int main() {
int n;
cin >> n;
vll h(n);
ll ma = 0, ans = 0;
for (int i = 0; i < n; i++) {
cin >> h[i];
if (ma >= h[i])
... | #include <bits/stdc++.h>
#define all(a) a.begin(), a.end()
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef pair<ll, ll> P;
constexpr ll mod = 1000000007;
int main() {
int n;
cin >> n;
vll h(n);
ll ma = 0, ans = 0;
for (int i = 0; i < n; i++) {
cin >> h[i];
if (ma <= h[i])
... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 882,700 | 882,701 | u408650734 | cpp |
p03072 | #include <iostream>
#include <math.h>
using namespace std;
int main() {
int n;
cin >> n;
int h[n];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
int ans = 1;
for (int i = 1; i < n; i++) {
int judge = 0;
for (int j = 0; j < i; j++) {
if (h[j] < h[i]) {
judge += 1;
}
i... | #include <iostream>
#include <math.h>
using namespace std;
int main() {
int n;
cin >> n;
int h[n];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
int ans = 1;
for (int i = 1; i < n; i++) {
int judge = 0;
for (int j = 0; j < i; j++) {
if (h[j] <= h[i]) {
judge += 1;
}
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 882,702 | 882,703 | u725133562 | cpp |
p03072 | #include <algorithm>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define SORT(x) sort(x.begin(), x.end())
#define REVE(x) reverse(x.begin(), x.end())
#define all(x) (x)... | #include <algorithm>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define SORT(x) sort(x.begin(), x.end())
#define REVE(x) reverse(x.begin(), x.end())
#define all(x) (x)... | [] | 882,704 | 882,705 | u379928983 | cpp |
p03072 | #include <algorithm>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define SORT(x) sort(x.begin(), x.end())
#define REVE(x) reverse(x.begin(), x.end())
#define all(x) (x)... | #include <algorithm>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define SORT(x) sort(x.begin(), x.end())
#define REVE(x) reverse(x.begin(), x.end())
#define all(x) (x)... | [
"variable_declaration.value.change"
] | 882,706 | 882,705 | u379928983 | cpp |
p03072 | #include <algorithm>
#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 count = 1;
int max_high = H[0];
for (int i = 1; i < N; ++i) {
if (H[i] >= max_high) {
count++;
}
max_h... | #include <algorithm>
#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 count = 1;
int max_high = H[0];
for (int i = 1; i < N; ++i) {
if (H[i] >= max_high) {
count++;
}
max_h... | [
"assignment.value.change",
"call.arguments.change"
] | 882,707 | 882,708 | u318150500 | cpp |
p03072 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> h(n);
int ans = 0;
int max = 0;
for (int i = 0; i < n; i++) {
cin >> h[i];
if (max < h[i]) {
max = h[i];
ans++;
}
}
cout << ans << endl;
return 0;
}
| #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> h(n);
int ans = 0;
int max = 0;
for (int i = 0; i < n; i++) {
cin >> h[i];
if (max <= h[i]) {
max = h[i];
ans++;
}
}
cout << ans << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 882,711 | 882,712 | u195054737 | cpp |
p03072 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N, count = 0;
cin >> N;
vector<int> height, core;
height.resize(N);
core.resize(N);
for (int i = 0; i < N; i++)
cin >> height[i];
for (int t = 0; t < N; t++) {
for (int j = 0; j < t + 1; j++)
if (height[t + 1] >= height[j])... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N, count = 0;
cin >> N;
vector<int> height, core;
height.resize(N);
core.resize(N);
for (int i = 0; i < N; i++)
cin >> height[i];
for (int t = 0; t < N; t++) {
for (int j = 0; j < t + 1; j++)
if (height[t + 1] >= height[j])... | [
"expression.operation.binary.add"
] | 882,714 | 882,715 | u174509352 | cpp |
p03072 | #include <iostream>
using namespace std;
int main() {
int n, flag;
int ans = 1;
cin >> n;
int h[110];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
for (int i = 0; i < n; i++) {
flag = 0;
for (int j = 0; j < i; j++) {
if (h[i] <= h[j]) {
flag = 1;
}
}
if (flag == 0)... | #include <iostream>
using namespace std;
int main() {
int n, flag;
int ans = 1;
cin >> n;
int h[110];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
for (int i = 1; i < n; i++) {
flag = 0;
for (int j = 0; j < i; j++) {
if (h[i] < h[j]) {
flag = 1;
}
}
if (flag == 0) ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 882,718 | 882,719 | u817783285 | cpp |
p03072 | #include <stdio.h>
int main() {
int N, k;
scanf("%d", &N);
int H[N];
for (k = 0; k < N; k++) {
scanf("%d", &H[k]);
}
int max = 0;
int c = 0;
for (k = 0; k < N; k++) {
if (H[k] > max) {
max = H[k];
c++;
}
}
printf("%d", c);
return 0;
} | #include <stdio.h>
int main() {
int N, k;
scanf("%d", &N);
int H[N];
for (k = 0; k < N; k++) {
scanf("%d", &H[k]);
}
int max = 0;
int c = 0;
for (k = 0; k < N; k++) {
if (H[k] >= max) {
max = H[k];
c++;
}
}
printf("%d", c);
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 882,720 | 882,721 | u374372942 | cpp |
p03072 |
// include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
... |
// include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 882,732 | 882,733 | u874996917 | cpp |
p03072 | #include <bits/stdc++.h>
using namespace std;
int main() {
int i, t;
cin >> t;
int h[t];
int temp = 0, tot = 0, highest = 0;
for (i = 0; i < t; i++) {
cin >> h[i];
if (h[i] > highest)
highest = h[i];
if (h[i] > temp && h[i] >= highest)
temp = h[i];
else {
tot++;
temp =... | #include <bits/stdc++.h>
using namespace std;
int main() {
int i, t;
cin >> t;
int h[t];
int temp = 0, tot = 0, highest = 0;
for (i = 0; i < t; i++) {
cin >> h[i];
if (h[i] > highest)
highest = h[i];
if (h[i] >= temp && h[i] >= highest)
temp = h[i];
else {
tot++;
te... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 882,743 | 882,744 | u415778984 | cpp |
p03072 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int ans = 0;
int maxh = 0;
vector<int> h(n);
for (int i = 0; i < n; i++) {
cin >> h.at(i);
maxh = max(maxh, h.at(i));
if (h.at(i) > maxh) {
ans++;
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int ans = 0;
int maxh = 0;
vector<int> h(n);
for (int i = 0; i < n; i++) {
cin >> h.at(i);
maxh = max(maxh, h.at(i));
if (h.at(i) >= maxh) {
ans++;
}
}
cout << ans << endl;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 882,745 | 882,746 | u370447425 | cpp |
p03072 | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int unit[N];
for (int i = 0; i < N; i++) {
cin >> unit[i];
}
int ans = 0, min = 0;
for (int i = 0; i < N; i++) {
min = 0;
for (int j = 0; j < i; j++) {
if (unit[j] > unit[i])
min = 1;
break;
}
... | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int unit[N];
for (int i = 0; i < N; i++) {
cin >> unit[i];
}
int ans = 0, min = 0;
for (int i = 0; i < N; i++) {
min = 0;
for (int j = 0; j < i; j++) {
if (unit[j] > unit[i])
min = 1;
}
if (min == 0... | [] | 882,747 | 882,748 | u747087681 | cpp |
p03072 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<string> vs;
typedef vector<vll> vvll;
typedef pair<ll, ll> pii;
typedef pair<string, ll> psi;
typedef pair<ll, string> pis;
typedef pair<ll, vll> plv;
#define REP(i, a, b) for (ll i = ll(a); i <= ll(b); ++i)
#de... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<string> vs;
typedef vector<vll> vvll;
typedef pair<ll, ll> pii;
typedef pair<string, ll> psi;
typedef pair<ll, string> pis;
typedef pair<ll, vll> plv;
#define REP(i, a, b) for (ll i = ll(a); i <= ll(b); ++i)
#de... | [
"expression.operation.binary.add"
] | 882,758 | 882,759 | u423832505 | cpp |
p03072 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define sz(v) ll(v.size)
int main() {
ll N;
cin >> N;
vector<ll> H(N);
rep(i, N) { cin >> H[i]; }
ll highest = 0;
ll counter = 0;
rep(i, N) {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define sz(v) ll(v.size)
int main() {
ll N;
cin >> N;
vector<ll> H(N);
rep(i, N) { cin >> H[i]; }
ll highest = 0;
ll counter = 0;
rep(i, N) {
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 882,774 | 882,775 | u333190709 | 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 S = 1;
for (int j = 0; j < N; j++) {
int s = 1;
for (int i = 0; i < j; i++) {
if (H.at(j) > H.at(i)) {
s *= 1;
} else {
... | #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 S = 1;
for (int j = 1; j < N; j++) {
int s = 1;
for (int i = 0; i < j; i++) {
if (H.at(j) >= H.at(i)) {
s *= 1;
} else {
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 882,776 | 882,777 | u991310813 | 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 S = 0;
for (int j = 0; j < N; j++) {
int s = 1;
for (int i = 0; i < j; i++) {
if (H.at(j) > H.at(i)) {
s *= 1;
} else {
... | #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 S = 1;
for (int j = 1; j < N; j++) {
int s = 1;
for (int i = 0; i < j; i++) {
if (H.at(j) >= H.at(i)) {
s *= 1;
} else {
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 882,778 | 882,777 | u991310813 | cpp |
p03072 | #include <bits/stdc++.h>
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 j = 1;
int k = vec.at(0);
int count = 0;
while (N > j) {
if (k <= vec.at(j)) {
count++;
k = vec.at(j);
}
j++;
}
cout << ... | #include <bits/stdc++.h>
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 j = 1;
int k = vec.at(0);
int count = 1;
while (N > j) {
if (k <= vec.at(j)) {
count++;
k = vec.at(j);
}
j++;
}
cout << ... | [
"literal.number.change",
"variable_declaration.value.change"
] | 882,791 | 882,792 | u346059918 | cpp |
p03072 |
#include <algorithm>
#include <bits/stdc++.h>
#include <numeric>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
int h[n], highest[n];
int count = 1;
for (int i = 0; i < n; i++) {
cin >> h[i];
if (i == 0) {
highest[0] = h[0];
} else {
if (h[i] > highest[i - 1]) {... |
#include <algorithm>
#include <bits/stdc++.h>
#include <numeric>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
int h[n], highest[n];
int count = 1;
for (int i = 0; i < n; i++) {
cin >> h[i];
if (i == 0) {
highest[0] = h[0];
} else {
if (h[i] > highest[i - 1]) {... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 882,793 | 882,794 | u827974318 | cpp |
p03072 | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
typedef long long int lli;
#define pb emplace_back
#define mp make_pair
#define pii pair<int, int>
#define INF 1000000000
#define fastio \
ios_base::sync_with_stdio(0); ... | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
typedef long long int lli;
#define pb emplace_back
#define mp make_pair
#define pii pair<int, int>
#define INF 1000000000
#define fastio \
ios_base::sync_with_stdio(0); ... | [
"literal.number.change",
"variable_declaration.value.change"
] | 882,799 | 882,800 | u059313618 | 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++) {
cin >> H.at(i);
}
int count = 0;
for (int i = 1; i < N; i++) {
bool flg = true;
for (int j = 0; j < i; j++) {
if (H.at(i) < H.at(j)) {
flg = false;
... | #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 count = 0;
for (int i = 1; i < N; i++) {
bool flg = true;
for (int j = 0; j < i; j++) {
if (H.at(i) < H.at(j)) {
flg = false;
... | [] | 882,813 | 882,814 | u489117389 | cpp |
p03072 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, a, max, C;
cin >> N;
vector<int> H(N);
for (int i = 0; i < N; i++) {
cin >> H.at(i);
}
max = H.at(0);
for (int i = 0; i < N; i++) {
a = H.at(i) - max;
if (a >= 0) {
C += 1;
max = H.at(i);
}
}
cout << C << ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, a, max, C;
cin >> N;
vector<int> H(N);
for (int i = 0; i < N; i++) {
cin >> H.at(i);
}
C = 0;
max = H.at(0);
for (int i = 0; i < N; i++) {
a = H.at(i) - max;
if (a >= 0) {
C++;
max = H.at(i);
}
}
cout <<... | [
"assignment.add"
] | 882,818 | 882,819 | u025771681 | cpp |
p03072 | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1e9;
const ll LINF = 1e18;
const int MOD = 1e9 + 7;
int main() {
int n;
cin >> n;
vector<int> h(n);
for (int i = 0; i < n; i++)
cin >> h[i];
int maxN = h[0],... | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1e9;
const ll LINF = 1e18;
const int MOD = 1e9 + 7;
int main() {
int n;
cin >> n;
vector<int> h(n);
for (int i = 0; i < n; i++)
cin >> h[i];
int maxN = h[0],... | [
"literal.number.change",
"variable_declaration.value.change"
] | 882,820 | 882,821 | u654240084 | cpp |
p03072 | #include <bits/stdc++.h>
using namespace std;
int N, ans = 0, last;
int main() {
cin >> N;
vector<int> H(N);
for (int i = 0; i < N; i++) {
cin >> H[i];
}
for (int i = 0; i < N; i++) {
int ok = 1;
for (int j = 0; j < i; j++) {
if (H[j] > H[i])
ok = 0;
break;
}
if (ok... | #include <bits/stdc++.h>
using namespace std;
int N, ans = 0, last;
int main() {
cin >> N;
vector<int> H(N);
for (int i = 0; i < N; i++) {
cin >> H[i];
}
for (int i = 0; i < N; i++) {
int ok = 1;
for (int j = 0; j < i; j++) {
if (H[j] > H[i]) {
ok = 0;
}
}
if (ok) {... | [] | 882,827 | 882,828 | u904951912 | cpp |
p03072 | #include <bits/stdc++.h>
#include <iostream>
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 count = 1;
int maxH = H.at(1);
for (int i = 1; i < N; i++) {
if (maxH <= H.at(i)) {
count++;
maxH = H.at(i);
}
}
... | #include <bits/stdc++.h>
#include <iostream>
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 count = 1;
int maxH = H.at(0);
for (int i = 1; i < N; i++) {
if (maxH <= H.at(i)) {
count++;
maxH = H.at(i);
}
}
... | [
"literal.number.change",
"call.arguments.change"
] | 882,831 | 882,832 | u707059295 | cpp |
p03072 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int H[n];
for (int i = 0; i < n; i++) {
cin >> H[i];
}
int minHeight = H[0];
int cnt;
for (int i = 0; i < n; i++) {
if (minHeight <= H[i]) {
minHeight = H[i];
cnt++;
}
}
cout << cnt << endl;
}
| #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int H[n];
for (int i = 0; i < n; i++) {
cin >> H[i];
}
int minHeight = H[0];
int cnt = 0;
for (int i = 0; i < n; i++) {
if (minHeight <= H[i]) {
minHeight = H[i];
cnt++;
}
}
cout << cnt << endl;
}
| [
"variable_declaration.value.change"
] | 882,833 | 882,834 | u929024786 | cpp |
p03072 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int maxHeight(vector<int>::iterator begin, vector<int>::iterator end) {
int ret = 0;
while (begin++ != end) {
ret = max(ret, *begin);
}
return ret;
}
int main() {
int n;
cin >> n;
vector<int> heights(n);
for (auto &he... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int maxHeight(vector<int>::iterator begin, vector<int>::iterator end) {
int ret = 0;
while (begin != end) {
ret = max(ret, *begin);
begin++;
}
return ret;
}
int main() {
int n;
cin >> n;
vector<int> heights(n);
fo... | [
"control_flow.loop.condition.change",
"expression.unary.arithmetic.add"
] | 882,840 | 882,841 | u498695849 | cpp |
p03072 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const double pi = acos(-1);
#define FOR(i, a, b) for (ll i = (a), __last_##i = (b); i < __last_##i; i++)
#define RFOR(i, a, b) for (ll i = (b)-1, __last_##i = (a); i >= __last_##i; i--)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, 0, n)
#d... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const double pi = acos(-1);
#define FOR(i, a, b) for (ll i = (a), __last_##i = (b); i < __last_##i; i++)
#define RFOR(i, a, b) for (ll i = (b)-1, __last_##i = (a); i >= __last_##i; i--)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, 0, n)
#d... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 882,842 | 882,843 | u430974466 | cpp |
p03072 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int i;
int n = 0;
cin >> N;
vector<int> H(N);
int max = 0;
for (i = 0; i < N; i++) {
cin >> H.at(i);
}
for (i = 0; i < N; i++) {
if (max < H.at(i)) {
n++;
max = H.at(i);
}
}
cout << n << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int i;
int n = 0;
cin >> N;
vector<int> H(N);
int max = 0;
for (i = 0; i < N; i++) {
cin >> H.at(i);
}
for (i = 0; i < N; i++) {
if (H.at(i) >= max) {
n++;
max = H.at(i);
}
}
cout << n << endl;
}
| [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 882,846 | 882,847 | u548596361 | cpp |
p03072 | #include <bits/stdc++.h>
#include <string.h>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
void solve() {
int n;
vector<int> h;
for (int i = 0; i < n; i++) {
int k;
cin >> k;
h.push_back(k);
}
int count = 0;
for (int i = 0; i < n; i++) {
bool b = true;... | #include <bits/stdc++.h>
#include <string.h>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
void solve() {
int n;
cin >> n;
vector<int> h;
for (int i = 0; i < n; i++) {
int k;
cin >> k;
h.push_back(k);
}
int count = 0;
for (int i = 0; i < n; i++) {
bo... | [] | 882,850 | 882,851 | u272496669 | cpp |
p03072 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> mt(n);
vector<int> maxmt(n);
for (int i = 0; i < n; i++) {
cin >> mt[i];
}
maxmt[0] = mt[0];
for (int i = 1; i < n; i++) {
maxmt[i] = max(mt[i - 1], mt[i]);
}
int c;
for (int i = 0; i < n; i++) {
i... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> mt(n);
vector<int> maxmt(n);
for (int i = 0; i < n; i++) {
cin >> mt[i];
}
maxmt[0] = mt[0];
for (int i = 1; i < n; i++) {
maxmt[i] = max(maxmt[i - 1], mt[i]);
}
int c = 0;
for (int i = 0; i < n; i++) ... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"variable_declaration.value.change"
] | 882,852 | 882,853 | u544165468 | cpp |
p03072 | #include <bits/stdc++.h>
#define speed \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
using namespace std;
int main() {... | #include <bits/stdc++.h>
#define speed \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
using namespace std;
int main() {... | [
"io.output.change"
] | 882,856 | 882,857 | u662918817 | cpp |
p03072 | #define debug_interval ','
#define dump_interval ' '
#define debug_toggle 1
//{
#include <bits/stdc++.h>
using namespace std;
#define hi cerr << "hi" << endl;
#define int long long
#define INT_MAX LLONG_MAX
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define pb push... | #define debug_interval ','
#define dump_interval ' '
#define debug_toggle 1
//{
#include <bits/stdc++.h>
using namespace std;
#define hi cerr << "hi" << endl;
#define int long long
#define INT_MAX LLONG_MAX
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define pb push... | [] | 882,871 | 882,872 | u130196064 | 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 Answer = 0;
int flag = 0;
for (int i = 1; i < N; i++) {
flag = 0;
for (int j = 0; j < i; j++) {
if (H.at(i) < H.at(j)) {
flag = ... | #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 Answer = 1;
int flag = 0;
for (int i = 1; i < N; i++) {
flag = 0;
for (int j = 0; j < i; j++) {
if (H.at(i) < H.at(j)) {
flag = ... | [
"literal.number.change",
"variable_declaration.value.change"
] | 882,875 | 882,876 | u031274276 | cpp |
p03072 | #include <iostream>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
int maximum = 0;
int total = 0;
for (int i = 0; i < n; i++) {
if (arr[i] > maximum) {
total++;
maximum = arr[i];
}
}
cout << to... | #include <iostream>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
int maximum = 0;
int total = 0;
for (int i = 0; i < n; i++) {
if (arr[i] >= maximum) {
total++;
maximum = arr[i];
}
}
cout << t... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 882,897 | 882,898 | u553927381 | cpp |
p03072 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int a[n + 1];
int maxv = 0;
int s = 0;
for (int i = 1; i <= n; i++) {
cin >> a[i];
if (a[i] > maxv) {
maxv = a[i];
s++;
}
}
cout << s;
} | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int a[n + 1];
int maxv = 0;
int s = 0;
for (int i = 1; i <= n; i++) {
cin >> a[i];
if (a[i] >= maxv) {
maxv = a[i];
s++;
}
}
cout << s;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 882,901 | 882,902 | u950909548 | cpp |
p03072 | #include <algorithm>
#include <array>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
int ans = 0;
int prev = 0;
int tmp = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> tmp;
if (tmp >= prev)
ans++;
prev = tmp;
}
cout << ans << ... | #include <algorithm>
#include <array>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
int ans = 0;
int prev = 0;
int tmp = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> tmp;
if (tmp >= prev) {
ans++;
prev = tmp;
}
}
cout ... | [] | 882,919 | 882,920 | u785521224 | cpp |
p03072 | #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;
} | #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;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 882,938 | 882,939 | u261026404 | cpp |
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, 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,940 | 882,939 | u261026404 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.