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 |
|---|---|---|---|---|---|---|---|
p02988 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vd = vector<double>;
using vvd = vector<vd>;
using vc = vector<char>;
#define rep(i, x, n) for (int i = x; i < n; i++)
#define all(x) x.begin(), x.end()
int main() {
int n, ans = 0;
cin >> n;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vd = vector<double>;
using vvd = vector<vd>;
using vc = vector<char>;
#define rep(i, x, n) for (int i = x; i < n; i++)
#define all(x) x.begin(), x.end()
int main() {
int n, ans = 0;
cin >> n;
... | [
"literal.number.change",
"call.arguments.change"
] | 795,661 | 795,660 | u688825490 | cpp |
p02988 | #include <iostream>
using namespace std;
int main() {
int n; // 3 <= n <= 20
cin >> n;
int p[n];
for (int i = 0; i < n; i++) {
cin >> p[i];
}
int cnt;
for (int i = 1; i < n - 1; i++) {
if ((p[i - 1] < p[i] && p[i] < p[i + 1]) ||
(p[i - 1] > p[i] && p[i] > p[i + 1])) {
cnt++;
}
... | #include <iostream>
using namespace std;
int main() {
int n; // 3 <= n <= 20
cin >> n;
int p[n];
for (int i = 0; i < n; i++) {
cin >> p[i];
}
int cnt = 0;
for (int i = 1; i < n - 1; i++) {
if ((p[i - 1] < p[i] && p[i] < p[i + 1]) ||
(p[i - 1] > p[i] && p[i] > p[i + 1])) {
cnt++;
... | [
"variable_declaration.value.change"
] | 795,664 | 795,665 | u526630579 | cpp |
p02988 | #include <iostream>
using namespace std;
int main() {
int n; // 3 <= n <= 20
cin >> n;
int p[n];
for (int i = 0; i < n; i++) {
cin >> p[i];
}
int cnt;
for (int i = 0; i < n - 2; i++) {
if ((p[i - 1] < p[i] && p[i] < p[i + 1]) ||
(p[i - 1] > p[i] && p[i] > p[i + 1])) {
cnt++;
}
... | #include <iostream>
using namespace std;
int main() {
int n; // 3 <= n <= 20
cin >> n;
int p[n];
for (int i = 0; i < n; i++) {
cin >> p[i];
}
int cnt = 0;
for (int i = 1; i < n - 1; i++) {
if ((p[i - 1] < p[i] && p[i] < p[i + 1]) ||
(p[i - 1] > p[i] && p[i] > p[i + 1])) {
cnt++;
... | [
"variable_declaration.value.change",
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 795,666 | 795,665 | u526630579 | cpp |
p02988 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define FORR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define RANGE(i, a, b) for (int i = (a); i <= (b); i++)
#define RANGER(i, a, b) for (int i = (b); i >= (a); i++)
#define REP(i, n) FOR(i, 0, n)
#define REPR(i, n) ... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define FORR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define RANGE(i, a, b) for (int i = (a); i <= (b); i++)
#define RANGER(i, a, b) for (int i = (b); i >= (a); i++)
#define REP(i, n) FOR(i, 0, n)
#define REPR(i, n) ... | [
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 795,669 | 795,670 | u891876603 | cpp |
p02988 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; i++) {
cin >> p[i];
}
int count = 0;
for (int i = 1; i < n; i++) {
if ((p[i - 1] < p[i] && p[i] < p[i + 1]) ||
(p[i - 1] > p[i] && p[i] > p[i + 1])) {
count += 1;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; i++) {
cin >> p[i];
}
int count = 0;
for (int i = 1; i < n - 1; i++) {
if ((p[i - 1] < p[i] && p[i] < p[i + 1]) ||
(p[i - 1] > p[i] && p[i] > p[i + 1])) {
count += ... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 795,671 | 795,672 | u180716041 | cpp |
p02988 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
#define INF 1001001001
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
#define INF 1001001001
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long... | [
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 795,691 | 795,692 | u971166345 | cpp |
p02988 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; i++) {
cin >> p[i];
}
int cnt = 0;
for (int i = 1; i < n - 1; i++) {
if ((p[i - 1] < p[i] && p[i] > p[i + 1]) ||
(p[i - 1] > p[i] && p[i] < p[i + 1]))
cnt++;
}
cou... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; i++) {
cin >> p[i];
}
int cnt = 0;
for (int i = 1; i < n - 1; i++) {
if ((p[i - 1] < p[i] && p[i] < p[i + 1]) ||
(p[i - 1] > p[i] && p[i] > p[i + 1]))
cnt++;
}
cou... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 795,693 | 795,694 | u469239325 | cpp |
p02988 | #include <bits/stdc++.h>
using namespace std;
int n, co;
int main() {
cin >> n;
int p[n];
for (int i = 0; i < n; i++) {
cin >> p[i];
if (i >= 1) {
if ((p[i - 1] < p[i] && p[i - 1] > p[i - 2]) ||
(p[i - 1] > p[i] && p[i - 1] < p[i - 2])) {
co++;
// cout << p[i-1] << " " << i... | #include <bits/stdc++.h>
using namespace std;
int n, co;
int main() {
cin >> n;
int p[n];
for (int i = 0; i < n; i++) {
cin >> p[i];
if (i >= 2) { // compare i-1th elem
if ((p[i - 1] < p[i] && p[i - 1] > p[i - 2]) ||
(p[i - 1] > p[i] && p[i - 1] < p[i - 2])) {
co++;
// cout... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 795,703 | 795,704 | u397732894 | cpp |
p02988 | #include <iostream>
using namespace std;
int main() {
int n, p[20];
int cnt = 0;
cin >> n;
for (int i = 0; i < n; i++)
cin >> p[i];
for (int i = 1; i < n - 1; i++) {
if (p[i - 1] > p[i] && p[i] < p[i + 1]) {
cnt++;
} else if (p[i - 1] < p[i] && p[i] > p[i + 1]) {
cnt++;
}
}
co... | #include <iostream>
using namespace std;
int main() {
int n, p[20];
int cnt = 0;
cin >> n;
for (int i = 0; i < n; i++)
cin >> p[i];
for (int i = 1; i < n - 1; i++) {
if (p[i - 1] > p[i] && p[i] > p[i + 1]) {
cnt++;
} else if (p[i - 1] < p[i] && p[i] < p[i + 1]) {
cnt++;
}
}
co... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 795,705 | 795,706 | u180133008 | cpp |
p02988 | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
int N;
cin >> N;
vector<int> p(N);
for (int i = 0; i < N; i++)
cin >> p[i];
int ans = 0;
for (int i = 1; i < N - 1; i++) {
if (p[i - 1] < p[i] && p[i] < p[i + 1])
ans++;
if (p[i - 1] > p[i] && p[i] > p[... | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
int N;
cin >> N;
vector<int> p(N);
for (int i = 0; i < N; i++)
cin >> p[i];
int ans = 0;
for (int i = 1; i < N - 1; i++) {
if (p[i - 1] < p[i] && p[i] < p[i + 1])
ans++;
if (p[i - 1] > p[i] && p[i] > p[... | [
"identifier.change",
"io.output.change"
] | 795,707 | 795,708 | u592610268 | cpp |
p02988 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; i++)
cin >> p[i];
int count = 0;
for (int i = 0; i < n; i++) {
if (p[i] < p[i + 1] && p[i + 1] < p[i + 2])
count++;
else if (p[i + 2] < p[i + 1] && p[i + 1] < p[i])
c... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; i++)
cin >> p[i];
int count = 0;
for (int i = 0; i < n - 2; i++) {
if (p[i] < p[i + 1] && p[i + 1] < p[i + 2])
count++;
else if (p[i + 2] < p[i + 1] && p[i + 1] < p[i])
... | [
"control_flow.loop.for.condition.change"
] | 795,715 | 795,716 | u679159704 | cpp |
p02988 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <iterator>
#include <map>
#include <vector>
#define mp make_pair
#define pb push_back
#define p push
#define FOR(a, c) for (int a = 0; a < c; a++)
#define ll long long
#define abs(x) (x < 0 ? (-x) : x)
#define getI(a) scanf("%d", &a)
#... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <iterator>
#include <map>
#include <vector>
#define mp make_pair
#define pb push_back
#define p push
#define FOR(a, c) for (int a = 0; a < c; a++)
#define ll long long
#define abs(x) (x < 0 ? (-x) : x)
#define getI(a) scanf("%d", &a)
#... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 795,723 | 795,724 | u198530799 | cpp |
p02988 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> p(n);
rep(i, n) cin >> p[i];
int cnt = 0;
for (int i = 1; i < n - 1; i++) {
if (p[i - 1] < p[i] && p[i] < p[i + 1])
cnt++;
else i... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> p(n);
rep(i, n) cin >> p[i];
int cnt = 0;
for (int i = 1; i < n - 1; i++) {
if (p[i - 1] < p[i] && p[i] < p[i + 1])
cnt++;
else i... | [
"misc.typo",
"control_flow.branch.if.condition.change"
] | 795,725 | 795,726 | u934402094 | cpp |
p02988 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
typedef long long int ll;
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define F first
#define S second
using namespace std;
const ll INF = 10000000000000;
int main() {
int n;
int... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
typedef long long int ll;
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define F first
#define S second
using namespace std;
const ll INF = 10000000000000;
int main() {
int n;
int... | [
"literal.number.change",
"call.arguments.change"
] | 795,727 | 795,728 | u726450206 | cpp |
p02988 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
typedef long long int ll;
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define F first
#define S second
using namespace std;
const ll INF = 10000000000000;
int main() {
int n;
int... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
typedef long long int ll;
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define F first
#define S second
using namespace std;
const ll INF = 10000000000000;
int main() {
int n;
int... | [
"literal.number.change",
"call.arguments.change",
"assignment.change"
] | 795,729 | 795,728 | u726450206 | cpp |
p02988 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
typedef long long int ll;
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define F first
#define S second
using namespace std;
const ll INF = 10000000000000;
int main() {
int n;
int... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
typedef long long int ll;
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define F first
#define S second
using namespace std;
const ll INF = 10000000000000;
int main() {
int n;
int... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change",
"assignment.change"
] | 795,730 | 795,728 | u726450206 | cpp |
p02988 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int i;
int c = 0;
int p[n];
for (i = 0; i < n; i++) {
cin >> p[i];
}
for (i = 1; i < n - 1; i++) {
if (p[i] < p[i + 1] && p[i] > p[i + 1] ||
p[i] < p[i - 1] && p[i] > p[i + 1])
c++;
}
cout << c;
ret... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int i;
int c = 0;
int p[n];
for (i = 0; i < n; i++) {
cin >> p[i];
}
for (i = 1; i < n - 1; i++) {
if (p[i] < p[i + 1] && p[i] > p[i - 1] ||
p[i] < p[i - 1] && p[i] > p[i + 1])
c++;
}
cout << c;
ret... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 795,733 | 795,734 | u621527413 | cpp |
p02988 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> a(N);
for (int i = 0; i < N; i++) {
cin >> a.at(i);
}
int ans = 0;
for (int i = 0; i < N - 3; i++) {
if (a.at(i + 2) > a.at(i + 1) && a.at(i) < a.at(i + 1)) {
ans++;
} else if (a.at(i + 2) < a.at(i... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> a(N);
for (int i = 0; i < N; i++) {
cin >> a.at(i);
}
int ans = 0;
for (int i = 0; i < N - 2; i++) {
if (a.at(i + 2) > a.at(i + 1) && a.at(i) < a.at(i + 1)) {
ans++;
} else if (a.at(i + 2) < a.at(i... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 795,735 | 795,736 | u387371565 | cpp |
p02988 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> a(N);
for (int i = 0; i < N; i++) {
cin >> a.at(i);
}
int ans = 0;
for (int i = 0; i < N - 1; i++) {
if (a.at(i + 2) > a.at(i + 1) && a.at(i) < a.at(i + 1)) {
ans++;
}
if (a.at(i + 2) < a.at(i ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> a(N);
for (int i = 0; i < N; i++) {
cin >> a.at(i);
}
int ans = 0;
for (int i = 0; i < N - 2; i++) {
if (a.at(i + 2) > a.at(i + 1) && a.at(i) < a.at(i + 1)) {
ans++;
} else if (a.at(i + 2) < a.at(i... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 795,737 | 795,736 | u387371565 | cpp |
p02988 | #include <bits/stdc++.h>
#define SEKAI_NO_OWARI return 0;
#define INIT \
cin.tie(0); \
ios::sync_with_stdio(false);
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
... | #include <bits/stdc++.h>
#define SEKAI_NO_OWARI return 0;
#define INIT \
cin.tie(0); \
ios::sync_with_stdio(false);
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
... | [] | 795,762 | 795,763 | u863957421 | cpp |
p02988 | #include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define pb push_back
#define all(x) x.begin(), x.begin()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define reps(i, m, n) for (int i = m; i <= n; ++i)
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typed... | #include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define pb push_back
#define all(x) x.begin(), x.begin()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define reps(i, m, n) for (int i = m; i <= n; ++i)
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typed... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 795,772 | 795,773 | u671257784 | cpp |
p02988 | #include <stdio.h>
int main(void) {
int n;
int ans = 0;
scanf("%d", &n);
int p[22];
for (int i = 0; i < n; i++) {
scanf("%d", &p[i]);
for (int i = 1; i < n - 1; i++) {
if (p[i - 1] < p[i] && p[i] < p[i + 1]) {
ans++;
} else {
if (p[i + 1] < p[i] && p[i] < p[i - 1])
... | #include <stdio.h>
int main(void) {
int n;
int ans = 0;
scanf("%d", &n);
int p[90];
for (int i = 0; i < n; i++) {
scanf("%d", &p[i]);
}
for (int i = 1; i < n - 1; i++) {
if (p[i - 1] < p[i] && p[i] < p[i + 1]) {
ans++;
} else {
if (p[i + 1] < p[i] && p[i] < p[i - 1])
ans++;... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 795,787 | 795,788 | u195269284 | cpp |
p02988 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <st... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <st... | [] | 795,800 | 795,801 | u310790595 | cpp |
p02988 | #include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long int ll;
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
vector<int> p(n);
cin >> n;
int cnt = 0;
rep(i, n) {
cin >> p[i];
if (i >... | #include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long int ll;
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
int p[20];
cin >> n;
int cnt = 0;
rep(i, n) {
cin >> p[i];
if (i > 1) {
... | [] | 795,802 | 795,803 | u438265890 | cpp |
p02988 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<string> v(n);
... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> v(n);
RE... | [] | 795,812 | 795,813 | u983505021 | cpp |
p02988 | #include <bits/stdc++.h>
using namespace std;
int N;
int arr[20];
int main() {
// inputs
cin >> N;
for (int i = 0; i < N; i++) {
cin >> arr[i];
}
int count = 0;
for (int i = 1; i < N - 2; i++) {
int temp[3] = {arr[i - 1], arr[i], arr[i + 1]};
sort(temp, temp + 3);
if (temp[1] == arr[i]) {... | #include <bits/stdc++.h>
using namespace std;
int N;
int arr[20];
int main() {
// inputs
cin >> N;
for (int i = 0; i < N; i++) {
cin >> arr[i];
}
int count = 0;
for (int i = 1; i < N - 1; i++) {
int temp[3] = {arr[i - 1], arr[i], arr[i + 1]};
sort(temp, temp + 3);
if (temp[1] == arr[i]) {... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 795,814 | 795,815 | u777477705 | cpp |
p02988 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> j(n);
int ans = 0;
for (int i = 0; i < n; i++) {
cin >> j.at(i);
}
for (int i = 1; i < n - 1; i++) {
if (j.at(i - 1) < j.at(i) && j.at(i) < j.at(i + 1)) {
ans++;
}
if (j.at(i - 1) > j.at(i) && j.... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> j(n);
int ans = 0;
for (int i = 0; i < n; i++) {
cin >> j.at(i);
}
for (int i = 1; i < n - 1; i++) {
if (j.at(i - 1) < j.at(i) && j.at(i) < j.at(i + 1)) {
ans++;
}
if (j.at(i - 1) > j.at(i) && j.... | [
"expression.operation.binary.remove"
] | 795,816 | 795,817 | u768638812 | cpp |
p02988 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> j(n);
int ans = 0;
for (int i = 0; i < n; i++) {
cin >> j.at(i);
}
for (int i = 1; i < n - 2; i++) {
if (j.at(i - 1) < j.at(i) && j.at(i) < j.at(i + 1)) {
ans++;
}
if (j.at(i - 1) > j.at(i) && j.... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> j(n);
int ans = 0;
for (int i = 0; i < n; i++) {
cin >> j.at(i);
}
for (int i = 1; i < n - 1; i++) {
if (j.at(i - 1) < j.at(i) && j.at(i) < j.at(i + 1)) {
ans++;
}
if (j.at(i - 1) > j.at(i) && j.... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 795,818 | 795,817 | u768638812 | cpp |
p02988 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> P(N);
for (int i = 0; i < N; i++) {
cin >> P[i];
}
int ans = 0;
for (int i = 1; i < N; i++) {
if ((P[i - 1] < P[i]) && (P[i] < P[i + 1]))
ans++;
else if ((P[i - 1] > P[i]) && (P[i] > P[i + 1]))
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> P(N);
for (int i = 0; i < N; i++) {
cin >> P[i];
}
int ans = 0;
for (int i = 1; i < N - 1; i++) {
if ((P[i - 1] < P[i]) && (P[i] < P[i + 1]))
ans++;
else if ((P[i - 1] > P[i]) && (P[i] > P[i + 1]))
... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 795,823 | 795,824 | u914086391 | cpp |
p02988 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> p(N);
for (int i = 0; i < N; ++i)
cin >> p[i];
int ans = 0;
for (int i = 0; i < N - 1; i++) {
if ((p[i - 1] < p[i]) && (p[i] < p[i + 1]))
ans++;
else if ((p[i - 1] >... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> p(N);
for (int i = 0; i < N; ++i)
cin >> p[i];
int ans = 0;
for (int i = 1; i < N - 1; i++) {
if ((p[i - 1] < p[i]) && (p[i] < p[i + 1]))
ans++;
else if ((p[i - 1] >... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 795,836 | 795,837 | u307860479 | cpp |
p02988 | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin()... | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin()... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 795,843 | 795,844 | u520791604 | cpp |
p02988 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int n, cnt;
scanf("%d", &n);
int p[2 * n];
rep(i, n) cin >> p[i];
rep(i, n - 2) {
if (min(p[i], p[i + 2]) < p[i + 1] && p[i + 1] < max(p[i], p[i + 2]))
cnt++;
}
printf("%d\n", cnt);
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int n, cnt = 0;
scanf("%d", &n);
int p[2 * n];
rep(i, n) cin >> p[i];
rep(i, n - 2) {
if (min(p[i], p[i + 2]) < p[i + 1] && p[i + 1] < max(p[i], p[i + 2]))
cnt++;
}
printf("%d\n", cnt);
}
| [
"variable_declaration.value.change"
] | 795,845 | 795,846 | u923105140 | cpp |
p02988 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int n, cnt;
scanf("%d", &n);
int p[2 * n];
rep(i, n) cin >> p[i];
rep(i, n - 2) {
if (min(p[i], p[i + 2]) < p[i + 1] && p[i + 1] < max(p[i], p[i + 2]))
cnt++;
}
printf("%d\n", n);
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int n, cnt = 0;
scanf("%d", &n);
int p[2 * n];
rep(i, n) cin >> p[i];
rep(i, n - 2) {
if (min(p[i], p[i + 2]) < p[i + 1] && p[i + 1] < max(p[i], p[i + 2]))
cnt++;
}
printf("%d\n", cnt);
}
| [
"variable_declaration.value.change",
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 795,847 | 795,846 | u923105140 | cpp |
p02988 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
int n;
vector<int> vec(n);
rep(i, n) cin >> vec.at(n);
int cnt = 0;
rep(i, n - 2) {
if (vec.at(i + 1) != max({vec.at(i), vec.at(i + 1), vec.at(i + 2)}) &&
vec.at(i + 1) != min({vec.at(i), ve... | #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 cnt = 0;
rep(i, n - 2) {
if (vec.at(i + 1) != max({vec.at(i), vec.at(i + 1), vec.at(i + 2)}) &&
vec.at(i + 1) != min({v... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 795,856 | 795,857 | u741134767 | cpp |
p02988 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int p[100];
for (int i = 0; i < n; i++) {
cin >> p[i];
}
int count = 0;
for (int i = 1; i < n; i++) {
if ((p[i - 1] < p[i] && p[i] < p[i + 1]) ||
(p[i - 1] > p[i] && p[i] > p[i + 1]))
count++;
}
cout << c... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int p[100];
for (int i = 0; i < n; i++) {
cin >> p[i];
}
int count = 0;
for (int i = 1; i < n - 1; i++) {
if ((p[i - 1] < p[i] && p[i] < p[i + 1]) ||
(p[i - 1] > p[i] && p[i] > p[i + 1]))
count++;
}
cout ... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 795,872 | 795,873 | u692131329 | cpp |
p02988 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (long int)n; i++)
typedef long long ll;
using namespace std;
int main() {
int n;
cin >> n;
vector<int> p(n);
rep(i, n) { cin >> p[i]; }
int ans = 0;
for (int i = 1; i < n; i++... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (long int)n; i++)
typedef long long ll;
using namespace std;
int main() {
int n;
cin >> n;
vector<int> p(n);
rep(i, n) { cin >> p[i]; }
int ans = 0;
for (int i = 1; i < n - 1;... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 795,906 | 795,907 | u667375816 | cpp |
p02988 | #include <algorithm>
#include <iostream>
#include <iterator>
#include <vector>
int main() {
int n = 5;
std::cin >> n;
std::vector<int> v;
for (size_t i = 0; i < n; i++) {
v.push_back(*std::istream_iterator<int>(std::cin));
}
int count = 0;
for (size_t i = 1; i < n; i++) {
auto min = *std::min_e... | #include <algorithm>
#include <iostream>
#include <iterator>
#include <vector>
int main() {
int n = 5;
std::cin >> n;
std::vector<int> v;
for (size_t i = 0; i < n; i++) {
v.push_back(*std::istream_iterator<int>(std::cin));
}
int count = 0;
for (size_t i = 0; i < n - 2; i++) {
auto min = *std::m... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.loop.for.condition.change"
] | 795,912 | 795,913 | u533749093 | cpp |
p02988 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> p(N);
for (int i = 0; i < N; i++)
cin >> p[N];
int res = 0;
for (int i = 1; i < N - 1; i++) {
if ((p[i - 1] < p[i]) && (p[i] < p[i + 1]))
res++;
else if ((p[i - 1] > p[i]) && (p[i] > p[i + 1]))
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> p(N);
for (int i = 0; i < N; i++)
cin >> p[i];
int res = 0;
for (int i = 1; i < N - 1; i++) {
if ((p[i - 1] < p[i]) && (p[i] < p[i + 1]))
res++;
else if ((p[i - 1] > p[i]) && (p[i] > p[i + 1]))
... | [
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 795,916 | 795,917 | u650773146 | cpp |
p02988 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
vector<int> a(n);
for (auto &i : a)
cin >> i;
int ans = 0;
for (int i = 0; i < n - 2; ++i) {
vector<int> b(3);
b[0] = a[i];
b[1] = a[i + 1];
b[2] = a[i + 2];
sort(b.begin(), b.end());
if (a[i + 1] == b[1])
++an... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (auto &i : a)
cin >> i;
int ans = 0;
for (int i = 0; i < n - 2; ++i) {
vector<int> b(3);
b[0] = a[i];
b[1] = a[i + 1];
b[2] = a[i + 2];
sort(b.begin(), b.end());
if (a[i + 1] == b[1]... | [] | 795,944 | 795,945 | u949798495 | cpp |
p02988 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
int ans = 0;
vector<int> p(30);
cin >> n;
for (int i = 0; i < n - 1; i++) {
cin >> p.at(i);
}
for (int i = 0; i < n; i++) {
if (p.at(i - 1) > p.at(i) && p.at(i) > p.at(i + 1)) {
ans++;
} else if (p.at(i - 1) <... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
int ans = 0;
vector<int> p(30);
cin >> n;
for (int i = 0; i < n; i++) {
cin >> p.at(i);
}
for (int i = 1; i < n - 1; i++) {
if (p.at(i - 1) > p.at(i) && p.at(i) > p.at(i + 1)) {
ans++;
}
if (p.at(i - 1) < ... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"misc.off_by_one",
"control_flow.branch.if.replace.add",
"control_flow.branch.else_if.rep... | 795,948 | 795,949 | u883885514 | cpp |
p02987 | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string str;
cin >> str;
char c1 = ' ';
char c2 = ' ';
string ans = "YES";
int n1 = 0, n2 = 0;
for (int i = 0; i < 4; i++) {
if (str[i] == c1) {
n1++;
} else if ... | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string str;
cin >> str;
char c1 = ' ';
char c2 = ' ';
string ans = "Yes";
int n1 = 0, n2 = 0;
for (int i = 0; i < 4; i++) {
if (str[i] == c1) {
n1++;
} else if ... | [
"literal.string.change",
"literal.string.case.change",
"variable_declaration.value.change",
"assignment.value.change"
] | 795,958 | 795,959 | u855985627 | cpp |
p02987 | // besmellah
#include <bits/stdc++.h>
using namespace std;
// __builtin_popcount
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
string s;
cin >> s;
sort(s.begin(), s.end());
if (s[0] == s[1] && s[2] == s[3] && s[1] == s[2]) {
cout << "Yes";
} else
cout << "No";
} | // besmellah
#include <bits/stdc++.h>
using namespace std;
// __builtin_popcount
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
string s;
cin >> s;
sort(s.begin(), s.end());
if (s[0] == s[1] && s[2] == s[3] && s[1] != s[2]) {
cout << "Yes";
} else
cout << "No";
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 795,965 | 795,966 | u170407818 | cpp |
p02987 | // besmellah
#include <bits/stdc++.h>
using namespace std;
// __builtin_popcount
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
string s;
cin >> s;
sort(s.begin(), s.end());
if (s[0] == s[1] && s[2] == s[3] && s[1] == s[2]) {
cout << "Yes";
}
cout << "No";
} | // besmellah
#include <bits/stdc++.h>
using namespace std;
// __builtin_popcount
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
string s;
cin >> s;
sort(s.begin(), s.end());
if (s[0] == s[1] && s[2] == s[3] && s[1] != s[2]) {
cout << "Yes";
} else
cout << "No";
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 795,967 | 795,966 | u170407818 | cpp |
p02987 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
if (S[0] != S[1]) {
if (S[0] == S[2] && S[1] == S[3]) {
cout << "Yes" << endl;
return 0;
}
if (S[0] == S[3] && S[1] == S[2]) {
cout << "Yes" << endl;
return 0;
}
}
if (S[0] == S[1] && S[2] =... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
if (S[0] != S[1]) {
if (S[0] == S[2] && S[1] == S[3]) {
cout << "Yes" << endl;
return 0;
}
if (S[0] == S[3] && S[1] == S[2]) {
cout << "Yes" << endl;
return 0;
}
}
if (S[0] == S[1] && S[2] =... | [
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 795,972 | 795,973 | u912534104 | cpp |
p02987 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
o... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
o... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 795,974 | 795,975 | u933476247 | cpp |
p02987 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
#define rep(i, n) for (ll i = 0; i < n; i++)
#define ll long long
#define ggr ... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
#define rep(i, n) for (ll i = 0; i < n; i++)
#define ll long long
#define ggr ... | [
"literal.string.change",
"literal.string.case.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 795,976 | 795,977 | u971256474 | cpp |
p02987 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
vector<char> S = {s[0], s[1], s[2], s[3]};
sort(S.begin(), S.end());
if ((S[0] == S[1]) && (S[2] == S[3]) && (S[1] != s[2])) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
vector<char> S = {s[0], s[1], s[2], s[3]};
sort(S.begin(), S.end());
if ((S[0] == S[1]) && (S[2] == S[3]) && (S[1] != S[2])) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 795,978 | 795,979 | u629314247 | cpp |
p02987 | #include <cmath>
#include <cstdlib>
#include <iostream>
#include <math.h>
#include <numeric>
#include <string>
using namespace std;
typedef long long ll;
int main(void) {
string S;
cin >> S;
ll count = 0;
for (int i = 1; i <= 4; i++) {
if (S[0] == S[i]) {
count++;
}
}
for (int i = 2; i <= ... | #include <cmath>
#include <cstdlib>
#include <iostream>
#include <math.h>
#include <numeric>
#include <string>
using namespace std;
typedef long long ll;
int main(void) {
string S;
cin >> S;
ll count = 0;
for (int i = 1; i <= 4; i++) {
if (S[0] == S[i]) {
count++;
}
}
for (int i = 2; i <= ... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 795,986 | 795,987 | u948515969 | cpp |
p02987 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int x = 4;
map<char, int> s;
for (int i = 0; i < x; i++) {
char c;
cin >> c;
s[c]++;
}
if (s.size() == 2) {
for (auto t : s) {
if (t.second != 2) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int x = 4;
map<char, int> s;
for (int i = 0; i < x; i++) {
char c;
cin >> c;
s[c]++;
}
if (s.size() == 2) {
for (auto t : s) {
if (t.second != 2) {
... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 795,988 | 795,989 | u533571397 | cpp |
p02987 | #ifndef LOCAL
#pragma GCC optimize("O3")
#endif
#include "bits/stdc++.h"
using namespace std;
#define sim template <class c
#define ris return *this
#define dor > debug &operator<<
#define eni(x) \
sim > typename enable_if<sizeof dud<c>(0) x 1, debug &>:... | #ifndef LOCAL
#pragma GCC optimize("O3")
#endif
#include "bits/stdc++.h"
using namespace std;
#define sim template <class c
#define ris return *this
#define dor > debug &operator<<
#define eni(x) \
sim > typename enable_if<sizeof dud<c>(0) x 1, debug &>:... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change",
"expression.operation.binary.change"
] | 796,004 | 796,005 | u101513772 | cpp |
p02987 | #include <bits/stdc++.h>
using namespace std;
auto main() -> int {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << boolalpha;
cerr << fixed << boolalpha;
string s;
map<char, int> m;
cin >> s;
for (auto &&elem : s) {
++m[elem];
}
auto ans = m.size() < 4u;
cout << (ans ? "Yes"... | #include <bits/stdc++.h>
using namespace std;
auto main() -> int {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << boolalpha;
cerr << fixed << boolalpha;
string s;
map<char, int> m;
cin >> s;
for (auto &&elem : s) {
++m[elem];
}
auto ans = m.size() == 2u;
cout << (ans ? "Yes... | [] | 796,008 | 796,009 | u431001086 | cpp |
p02987 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
#include <iomanip>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <time.h>
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define REP(i, a, ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
#include <iomanip>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <time.h>
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define REP(i, a, ... | [
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 796,010 | 796,011 | u243196226 | cpp |
p02987 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define all(a) a.begin(), a.end()
#define pb push_back
#define vi vector<int>
#define vl vector<long long>
#define MOD 1000000007
#define FOR(i, a, b) for (int i = a; i <= b; i++)
#define forn(i, n) for (int i = 0; i ... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define all(a) a.begin(), a.end()
#define pb push_back
#define vi vector<int>
#define vl vector<long long>
#define MOD 1000000007
#define FOR(i, a, b) for (int i = a; i <= b; i++)
#define forn(i, n) for (int i = 0; i ... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 796,012 | 796,013 | u391675729 | cpp |
p02988 | //↓template↓
#include "bits/stdc++.h"
using namespace std;
#define Would
#define you
#define all(n) n.begin(), n.end()
#define rall(n) n.rbegin(), n.rend()
typedef long long ll;
const ll INF = 1e18;
const ll MOD = 1e9 + 7;
const double pi = acos(-1);
const ll SIZE = 1 << 17;
int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, ... | //↓template↓
#include "bits/stdc++.h"
using namespace std;
#define Would
#define you
#define all(n) n.begin(), n.end()
#define rall(n) n.rbegin(), n.rend()
typedef long long ll;
const ll INF = 1e18;
const ll MOD = 1e9 + 7;
const double pi = acos(-1);
const ll SIZE = 1 << 17;
int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, ... | [] | 796,035 | 796,036 | u539402331 | cpp |
p02988 | #include <cstdio>
using namespace std;
int main() {
int n, counter;
int a[20];
counter = 0;
scanf("%d", &n);
for (int i = 1; i < n; i++) {
scanf("%d", &a[i]);
}
// printf("%d\n",a[4]);
for (int i = 1; i <= n; i++) {
if ((a[i - 1] < a[i] && a[i] < a[i + 1]) ||
(a[i - 1] > a[i] && a[i... | #include <cstdio>
using namespace std;
int main() {
int n, counter;
int a[20];
counter = 0;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
// printf("%d\n",a[4]);
for (int i = 1; i < n - 1; i++) {
if ((a[i - 1] < a[i] && a[i] < a[i + 1]) ||
(a[i - 1] > a[i] && ... | [
"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",
"misc.off_by_one"
] | 796,037 | 796,038 | u402389525 | cpp |
p02988 | #define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
#define INF 1e9
#define INFLL 1e18
#define EPS 1e-9
#define MOD 1000000007
#define REP(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define REP1(i, n) for (ll i = 1, i##_len = (n); i <= i##_len; ++i)
#define REPR(i, n) for (ll i = (n)-1; i >= 0; --i)
#de... | #define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
#define INF 1e9
#define INFLL 1e18
#define EPS 1e-9
#define MOD 1000000007
#define REP(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define REP1(i, n) for (ll i = 1, i##_len = (n); i <= i##_len; ++i)
#define REPR(i, n) for (ll i = (n)-1; i >= 0; --i)
#de... | [
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 796,044 | 796,045 | u388817534 | cpp |
p02988 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(void) {
int n, cnt = 0;
cin >> n;
int p[n];
for (int i = 1; i < n; i++) {
cin >> p[i];
}
for (int i = 1; i < n - 1; i++) {
if (p[i - 1] > p[i] && p[i] > p[i + 1]) {
cnt++;
} else if (p[i - 1] < p[i] && p[i] <... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(void) {
int n, cnt = 0;
cin >> n;
int p[n];
for (int i = 0; i < n; i++) {
cin >> p[i];
}
for (int i = 1; i < n - 1; i++) {
if (p[i - 1] > p[i] && p[i] > p[i + 1]) {
cnt++;
} else if (p[i - 1] < p[i] && p[i] <... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 796,048 | 796,049 | u181431922 | cpp |
p02988 | #include <bits/stdc++.h>
#include <iostream>
#include <string>
using namespace std;
int main() {
int c = 0, n, p[25], k[3];
cin >> n;
for (int i = 0; i < (n - 1); i++)
cin >> p[i];
for (int i = 1; i < (n - 2); i++) {
k[0] = p[(i - 1)];
k[1] = p[i];
k[2] = p[(i + 1)];
sort(k, k + 3);
if (... | #include <bits/stdc++.h>
#include <iostream>
#include <string>
using namespace std;
int main() {
int c = 0, n, p[25], k[3];
cin >> n;
for (int i = 0; i < (n); i++)
cin >> p[i];
for (int i = 1; i < (n - 1); i++) {
k[0] = p[(i - 1)];
k[1] = p[i];
k[2] = p[(i + 1)];
sort(k, k + 3);
if (k[1]... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"literal.number.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 796,053 | 796,054 | u477516105 | cpp |
p02988 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <regex>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
int p[20];
for (int i = 0; i < n; i++) {
cin >> p[i];
}
int cnt = 0;
for (int i = 1; i < n; i++) {
if (p... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <regex>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
int p[20];
for (int i = 0; i < n; i++) {
cin >> p[i];
}
int cnt = 0;
for (int i = 1; i < n - 1; i++) {
i... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 796,065 | 796,066 | u451206510 | cpp |
p02988 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <regex>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
int p[20];
for (int i = 0; i < n; i++) {
cin >> p[i];
}
int cnt = 0;
for (int i = 1; i < n; i++) {
if (p... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <regex>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
int p[20];
for (int i = 0; i < n; i++) {
cin >> p[i];
}
int cnt = 0;
for (int i = 1; i < n - 1; i++) {
i... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 796,067 | 796,066 | u451206510 | cpp |
p02988 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; i++) {
cin >> p[i];
}
int count = 0;
for (int i = 1; i <= n; i++) {
if (p[i - 1] < p[i] && p[i] < p[i + 1] ||
p[i - 1] > ... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; i++) {
cin >> p[i];
}
int count = 0;
for (int i = 1; i < n - 1; i++) {
if (p[i - 1] < p[i] && p[i] < p[i + 1] ||
p[i - 1]... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"misc.off_by_one"
] | 796,068 | 796,069 | u392569193 | cpp |
p02988 | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; i++)
cin >> p[i];
int ans = 0;
for (int i = 1; i <= n; i++) {
if (p[i - 1] < p[i] && p[i] < p[i + 1])
ans++;
els... | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; i++)
cin >> p[i];
int ans = 0;
for (int i = 1; i < n - 1; i++) {
if (p[i - 1] < p[i] && p[i] < p[i + 1])
ans++;
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"misc.off_by_one"
] | 796,101 | 796,102 | u654240084 | cpp |
p02988 | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; i++)
cin >> p[i];
int ans = 0;
for (int i = 0; i < n; i++) {
if (p[i - 1] < p[i] && p[i] < p[i + 1])
ans++;
else... | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; i++)
cin >> p[i];
int ans = 0;
for (int i = 1; i < n - 1; i++) {
if (p[i - 1] < p[i] && p[i] < p[i + 1])
ans++;
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 796,103 | 796,102 | u654240084 | cpp |
p02988 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int a[N];
for (int i = 0; i < N; i++) {
cin >> a[i];
}
int ans = 0;
for (int i = 0; i < N - 2; i++) {
if (a[i] > a[i + 1] && a[i + 1] > a[i + 2]) {
ans++;
} else if (a[i] > a[i + 1] && a[i + 1] > a[i + 2]) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int a[N];
for (int i = 0; i < N; i++) {
cin >> a[i];
}
int ans = 0;
for (int i = 0; i < N - 2; i++) {
if (a[i] > a[i + 1] && a[i + 1] > a[i + 2]) {
ans++;
} else if (a[i] < a[i + 1] && a[i + 1] < a[i + 2]) {
... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 796,104 | 796,105 | u833295869 | cpp |
p02988 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int ans;
vector<int> p(20);
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> p[i];
}
for (int i = 1; i < n - 1; i++) {
if (p[i] > p[i - 1] && p[i] < p[i + 1]) {
ans++;
} else if (p[i] < p[i - 1] && p[i] > p[i ... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int ans = 0;
vector<int> p(20);
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> p[i];
}
for (int i = 1; i < n - 1; i++) {
if (p[i] > p[i - 1] && p[i] < p[i + 1]) {
ans++;
} else if (p[i] < p[i - 1] && p[i] > ... | [
"variable_declaration.value.change"
] | 796,110 | 796,111 | u919225429 | cpp |
p02988 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> p(n);
for (int i = 1; i < n; i++)
cin >> p[i];
int ans = 0;
for (int i = 1; i < n - 1; i++) {
if ((p[i - 1] < p[i]) && (p[i] < p[i + 1]))
ans++;
else if ((p[i - 1] > p[i]) && (p[i] > p[i +... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; i++)
cin >> p[i];
int ans = 0;
for (int i = 1; i < n - 1; i++) {
if ((p[i - 1] < p[i]) && (p[i] < p[i + 1]))
ans++;
else if ((p[i - 1] > p[i]) && (p[i] > p[i +... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.return.add",
"control_flow.return.0.add"
] | 796,117 | 796,118 | u994910167 | cpp |
p02988 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int x;
int count = 0;
cin >> x;
int n[20];
for (int i = 0; i < x; i++)
cin >> n[i];
for (int i = 0; i < x - 1; i++) {
if (n[i] < n[i + 1] && n[i + 1] < n[i + 2])
count++;
if (n[i] > n[i + 1] && n[... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int x;
int count = 0;
cin >> x;
int n[20];
for (int i = 0; i < x; i++)
cin >> n[i];
for (int i = 0; i < x - 2; i++) {
if (n[i] < n[i + 1] && n[i + 1] < n[i + 2])
count++;
if (n[i] > n[i + 1] && n[... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 796,131 | 796,132 | u743473047 | cpp |
p02988 | #include <iostream>
using namespace std;
int main(void) {
// Your code here!
int n;
int p[21];
std::cin >> n;
for (int i = 0; i < n; i++) {
std::cin >> p[i];
}
int m = 0;
for (int i = 2; i < n; i++) {
if ((p[i - 1] < p[i] && p[i] <= p[i + 1]) ||
(p[i - 1] >= p[i] && p[i] > p[i + 1])) {
... | #include <iostream>
using namespace std;
int main(void) {
// Your code here!
int n;
int p[21];
std::cin >> n;
for (int i = 0; i < n; i++) {
std::cin >> p[i];
}
int m = 0;
for (int i = 1; i < n - 1; i++) {
if ((p[i - 1] < p[i] && p[i] <= p[i + 1]) ||
(p[i - 1] >= p[i] && p[i] > p[i + 1]))... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 796,135 | 796,136 | u240733151 | cpp |
p02988 | #include <iostream>
using namespace std;
int main(void) {
// Your code here!
int n;
int p[21];
std::cin >> n;
for (int i = 0; i < n; i++) {
std::cin >> p[i];
}
int m = 0;
for (int i = 2; i < n; i++) {
if ((p[i - 1] < p[i] && p[i] < p[i + 1]) ||
(p[i - 1] > p[i] && p[i] > p[i + 1])) {
... | #include <iostream>
using namespace std;
int main(void) {
// Your code here!
int n;
int p[21];
std::cin >> n;
for (int i = 0; i < n; i++) {
std::cin >> p[i];
}
int m = 0;
for (int i = 1; i < n - 1; i++) {
if ((p[i - 1] < p[i] && p[i] <= p[i + 1]) ||
(p[i - 1] >= p[i] && p[i] > p[i + 1]))... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 796,137 | 796,136 | u240733151 | cpp |
p02988 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; i++) {
cin >> p[i];
}
int ret = 0;
for (int i = 1; i < n - 1; i++) {
if ((p[i - 1] - p[i]) * (p[i + 1] - p[i]) >= 0)
ret++;
}
cout << ret;
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; i++) {
cin >> p[i];
}
int ret = 0;
for (int i = 1; i < n - 1; i++) {
if ((p[i - 1] - p[i]) * (p[i + 1] - p[i]) <= 0)
ret++;
}
cout << ret;
return 0;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 796,144 | 796,145 | u809153881 | cpp |
p02988 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
vector<int> s(n);
cin >> n;
for (int i = 0; i < n; i++) {
cin >> s[i];
}
int ans = 0;
for (int i = 1; i < n - 1; i++) {
if (s[i] < s[i + 1] || s[i] < s[i - 1]) {
if (s[i] > s[i + 1] || s[i] > s[i - 1]) {
++ans;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
vector<int> s(30);
cin >> n;
for (int i = 0; i < n; i++) {
cin >> s[i];
}
int ans = 0;
for (int i = 1; i < n - 1; i++) {
if (s[i] < s[i + 1] || s[i] < s[i - 1]) {
if (s[i] > s[i + 1] || s[i] > s[i - 1]) {
++ans;
... | [] | 796,148 | 796,149 | u122496126 | cpp |
p02988 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> p(N);
int count;
for (int i = 0; i < N; i++) {
cin >> p[i];
}
for (int i = 1; i < N - 1; i++) {
if ((p[i] > p[i - 1] && p[i] < p[i + 1]))
count++;
if ((p[i] < p[i - 1] && p[i] > p[i +... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> p(N);
int count = 0;
for (int i = 0; i < N; i++) {
cin >> p[i];
}
for (int i = 1; i < N - 1; i++) {
if ((p[i] > p[i - 1] && p[i] < p[i + 1]))
count++;
if ((p[i] < p[i - 1] && p[i] > p... | [
"variable_declaration.value.change"
] | 796,150 | 796,151 | u147556624 | cpp |
p02988 | #include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
int main() {
int n, cnt = 0;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; i++) {
cin >> p[i];
}
for (int i = 0; i < n - 2; i++) {
if ((p[i - 1] < p[i] && p[i] < p[i + 1]) ||
(p[i - 1] > p[i] && p[i] > p[... | #include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
int main() {
int n, cnt = 0;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; i++)
cin >> p[i];
for (int i = 1; i <= n - 2; i++) {
if ((p[i - 1] < p[i] && p[i] < p[i + 1]) ||
(p[i - 1] > p[i] && p[i] > p[i + 1... | [
"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"
] | 796,152 | 796,153 | u426506117 | cpp |
p02988 | #include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; ++i) {
cin >> v[i];
}
int res = 0;
for (int i = 1; i < n - 2; ++i) {
if (v[i] > v[i + 1] && ... | #include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; ++i) {
cin >> v[i];
}
int res = 0;
for (int i = 1; i < n - 1; ++i) {
if (v[i] > v[i + 1] && ... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 796,163 | 796,164 | u640255289 | cpp |
p02988 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
int p[n];
for (int i = 0; i < n; i++) {
cin >> p[i];
}
int ans;
for (int i = 0; i < n - 2; i++) {
if ((p[i] < p[i + 1] && p[i + 1] < p[i + 2]) ||
(p[i] > p[i + 1] && p[i + 1] > p[i + 2]))
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
int p[n];
for (int i = 0; i < n; i++) {
cin >> p[i];
}
int ans = 0;
for (int i = 0; i < n - 2; i++) {
if ((p[i] < p[i + 1] && p[i + 1] < p[i + 2]) ||
(p[i] > p[i + 1] && p[i + 1] > p[i + 2]))... | [
"variable_declaration.value.change"
] | 796,173 | 796,174 | u639032323 | cpp |
p02988 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(void) {
int n;
cin >> n;
vector<int> p;
for (int i = 0; i < n; i++)
cin >> p[i];
int ans = 0;
for (int i = 1; i < n - 1; i++) {
if (p[i - 1] > p[i] && p[i] > p[i + 1])
ans++;
else if (p[i - 1] < p[i] && p[i] < p[... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(void) {
int n;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; i++)
cin >> p[i];
int ans = 0;
for (int i = 1; i < (n - 1); i++) {
if (p[i - 1] > p[i] && p[i] > p[i + 1])
ans++;
else if (p[i - 1] < p[i] && p[i]... | [] | 796,176 | 796,177 | u653206280 | cpp |
p02988 | #include <bits/stdc++.h>
#define rep(i, a, n) for (ll i = a; i < n; i++)
#define per(i, a, n) for (ll i = n - 1; i >= a; i--)
#define fill0(n) setfill('0') << right << setw(n)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define LONGMAX 1e18
#define intMAX 1000000000
using namespace s... | #include <bits/stdc++.h>
#define rep(i, a, n) for (ll i = a; i < n; i++)
#define per(i, a, n) for (ll i = n - 1; i >= a; i--)
#define fill0(n) setfill('0') << right << setw(n)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define LONGMAX 1e18
#define intMAX 1000000000
using namespace s... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 796,180 | 796,181 | u255001744 | cpp |
p02988 | #include <bits/stdc++.h>
using namespace std;
template <typename T> istream &operator>>(istream &is, vector<T> &vec) {
for (T &x : vec)
is >> x;
// for(int i=0; i<vec.size(); i++) is >> x[i]; とかでもいいです。
return is;
}
int main() {
int N;
cin >> N;
int count = 0;
vector<int> p(N);
cin >> p; // vectorも... | #include <bits/stdc++.h>
using namespace std;
template <typename T> istream &operator>>(istream &is, vector<T> &vec) {
for (T &x : vec)
is >> x;
// for(int i=0; i<vec.size(); i++) is >> x[i]; とかでもいいです。
return is;
}
int main() {
int N;
cin >> N;
int count = 0;
vector<int> p(N);
cin >> p; // vectorも... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"expression.operation.binary.remove"
] | 796,186 | 796,187 | u124589361 | cpp |
p02988 | #include <bits/stdc++.h>
#define ll long long int
#define pb push_back
#define ss second
#define ff first
#define mp make_pair
using namespace std;
int main() {
ll n, i, cnt = 0;
cin >> n;
ll a[n];
for (i = 0; i < n; i++) {
cin >> a[i];
}
for (i = 0; i < n - 2; i++) {
if (a[i + 1] < a[i]) {
i... | #include <bits/stdc++.h>
#define ll long long int
#define pb push_back
#define ss second
#define ff first
#define mp make_pair
using namespace std;
int main() {
ll n, i, cnt = 0;
cin >> n;
ll a[n];
for (i = 0; i < n; i++) {
cin >> a[i];
}
for (i = 0; i < n - 2; i++) {
if (a[i + 1] < a[i]) {
i... | [
"control_flow.branch.if.replace.add",
"control_flow.branch.else_if.replace.remove",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 796,190 | 796,191 | u294549908 | cpp |
p02988 | #include "bits/stdc++.h"
#include <cmath>
using namespace std;
#define f first
#define s second
#define pb push_back
#define pp pop_back
#define mp make_pair
#define sz(x) (int)x.size()
#define sqr(x) ((x)*1ll * (x))
#define all(x) x.begin(), x.end()
#define clr(a, v) memset(a, v, sizeof(a))
#define rep(i, l, r) fo... | #include "bits/stdc++.h"
#include <cmath>
using namespace std;
#define f first
#define s second
#define pb push_back
#define pp pop_back
#define mp make_pair
#define sz(x) (int)x.size()
#define sqr(x) ((x)*1ll * (x))
#define all(x) x.begin(), x.end()
#define clr(a, v) memset(a, v, sizeof(a))
#define rep(i, l, r) fo... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 796,194 | 796,195 | u954456431 | cpp |
p02988 | #include <algorithm>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <utility>
#include <vector>
using namespace std;
typedef uint64_t u64;
typedef int64_t s64;
typedef uint32_t u32;
typedef int32_t s32;
#define MAX(x, y) ((x) < (y) ? (y) : (x))
#define MIN(x, y) ((x) ... | #include <algorithm>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <utility>
#include <vector>
using namespace std;
typedef uint64_t u64;
typedef int64_t s64;
typedef uint32_t u32;
typedef int32_t s32;
#define MAX(x, y) ((x) < (y) ? (y) : (x))
#define MIN(x, y) ((x) ... | [] | 796,196 | 796,197 | u806999568 | cpp |
p02988 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> p(n);
for (auto &&p_ : p)
cin >> p_;
int count = 0;
for (int i = 1; i < n - 1; ++i) {
if ((p[i] > p[i - 1] && p[i] < p[i + 1]) ||
(p[i] > p[i + 1] && p[i] > p[i - 1]))
count++;
}
... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> p(n);
for (auto &&p_ : p)
cin >> p_;
int count = 0;
for (int i = 1; i < n - 1; ++i) {
if ((p[i] > p[i - 1] && p[i] < p[i + 1]) ||
(p[i] > p[i + 1] && p[i] < p[i - 1]))
count++;
}
... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 796,200 | 796,201 | u442062970 | cpp |
p02988 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> L(3), S(3);
for (int j = 0; j < 3; j++) {
cin >> L.at(j);
S.at(j) = L.at(j);
}
sort(L.begin(), L.end());
int a = 0;
if (L.at(1) == S.at(1)) {
a++;
for (int i = 3; i < n; i++) {
L.at(0) = S.at(1... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> L(3), S(3);
for (int j = 0; j < 3; j++) {
cin >> L.at(j);
S.at(j) = L.at(j);
}
sort(L.begin(), L.end());
int a = 0;
if (L.at(1) == S.at(1)) {
a++;
}
for (int i = 3; i < n; i++) {
L.at(0) = S.at(1... | [] | 796,204 | 796,205 | u182791129 | cpp |
p02988 | #include <algorithm>
#include <iostream>
#include <list>
#include <map>
#include <set>
#include <vector>
using namespace std;
template <typename T = int> T in() {
T temp;
cin >> temp;
return temp;
}
template <typename VType = int> list<VType> const LR(VType start, VType end) {
list<VType> ret;
for (VType i =... | #include <algorithm>
#include <iostream>
#include <list>
#include <map>
#include <set>
#include <vector>
using namespace std;
template <typename T = int> T in() {
T temp;
cin >> temp;
return temp;
}
template <typename VType = int> list<VType> const LR(VType start, VType end) {
list<VType> ret;
for (VType i =... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change"
] | 796,208 | 796,209 | u074059110 | cpp |
p02988 | #include <iostream>
using namespace std;
int p[20];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> p[i];
}
int count = 0;
for (int i = 2; i < n; ++i) {
int judge = (p[i] - p[i - 1]) * (p[i + 1] - p[i]);
if (judge > 0) {
++count;
}
}
cout << count << endl;
... | #include <iostream>
using namespace std;
int p[20];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> p[i];
}
int count = 0;
for (int i = 1; i < n - 1; ++i) {
int judge = (p[i] - p[i - 1]) * (p[i + 1] - p[i]);
if (judge > 0) {
++count;
}
}
cout << count << e... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 796,226 | 796,227 | u478018523 | cpp |
p02988 | #include <algorithm>
#include <cassert>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
const int INF = 1 << 30;
const ll MOD = 1e9 + 7;
const double EPS = 1e-9;
in... | #include <algorithm>
#include <cassert>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
const int INF = 1 << 30;
const ll MOD = 1e9 + 7;
const double EPS = 1e-9;
in... | [
"variable_declaration.value.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 796,231 | 796,229 | u320491590 | cpp |
p02988 |
/*
LANG:C++
PROB:
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
#include <iostream>
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define rall(x)... |
/*
LANG:C++
PROB:
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
#include <iostream>
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define rall(x)... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 796,241 | 796,242 | u114047445 | cpp |
p02988 | #include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <stdlib.h>
#define ll long long
const ll INF = 0x3f3f3f3f;
#define mod 109
using namespace std;
// priority_queue
const ll Maxn = 1e5;
ll gcd(ll a, ll b) { return b == 0 ? a : gcd(b, a % b); }
ll kc(ll a, ll b) {
ll c = 1;
while (b) {
if (b ... | #include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <stdlib.h>
#define ll long long
const ll INF = 0x3f3f3f3f;
#define mod 109
using namespace std;
// priority_queue
const ll Maxn = 1e5;
ll gcd(ll a, ll b) { return b == 0 ? a : gcd(b, a % b); }
ll kc(ll a, ll b) {
ll c = 1;
while (b) {
if (b ... | [
"expression.operation.binary.change"
] | 796,249 | 796,250 | u916695530 | cpp |
p02988 | #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 ans = 0;
for (int i = 1; i < n; ++i) {
if (max({a[i - 1], a[i], a[i + 1]}) != a[i] &&
min({a[i - 1], a[i], a[i + 1]}) != a[i]) {
++ans;
}
}
... | #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 ans = 0;
for (int i = 1; i < n - 1; ++i) {
if (max({a[i - 1], a[i], a[i + 1]}) != a[i] &&
min({a[i - 1], a[i], a[i + 1]}) != a[i]) {
++ans;
}
... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 796,255 | 796,256 | u025469035 | cpp |
p02988 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define lol long long
int main() {
int n;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; i++) {
cin >> p[i];
}
int count = 0;
for (int i = 0; i <... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define lol long long
int main() {
int n;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; i++) {
cin >> p[i];
}
int count = 0;
for (int i = 0; i <... | [
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 796,261 | 796,262 | u086366728 | cpp |
p02988 | #include <algorithm>
#include <complex>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <string.h>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
typedef long long int llint;
typedef pair<int, int> pint;
typedef vector<int> vin... | #include <algorithm>
#include <complex>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <string.h>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
typedef long long int llint;
typedef pair<int, int> pint;
typedef vector<int> vin... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 796,269 | 796,270 | u376082984 | cpp |
p02988 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <string>
#include <unordered_map>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n);
rep(i, n) cin >> v[i];
int ... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <string>
#include <unordered_map>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n);
rep(i, n) cin >> v[i];
int ... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 796,277 | 796,278 | u314960567 | cpp |
p02988 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> ps(n);
for (auto &p : ps) {
cin >> p;
}
int ans = 0;
for (int i = 1; i < n - 1; i++) {
vector<int> as;
for (int j = -1; j < 1; j++) {
as.emplace_back(ps[i + j]);
}
sort(as.begin(), as.end())... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> ps(n);
for (auto &p : ps) {
cin >> p;
}
int ans = 0;
for (int i = 1; i < n - 1; i++) {
vector<int> as;
for (int j = -1; j <= 1; j++) {
as.emplace_back(ps[i + j]);
}
sort(as.begin(), as.end()... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 796,279 | 796,280 | u017167684 | cpp |
p02988 | #include <bits/stdc++.h>
using namespace std;
int a[30];
int main() {
#ifdef LOCAL
freopen("input.txt", "r", stdin);
#endif
int n;
cin >> n;
for (int i = 0; i < n; ++i)
cin >> a[i];
int ans = 0;
for (int i = 1; i < n - 1; ++i)
if ((a[i] < a[i - 1] && a[i] < a[i + 1]) ||
(a[i] < a[i - 1] &&... | #include <bits/stdc++.h>
using namespace std;
int a[30];
int main() {
#ifdef LOCAL
freopen("input.txt", "r", stdin);
#endif
int n;
cin >> n;
for (int i = 0; i < n; ++i)
cin >> a[i];
int ans = 0;
for (int i = 1; i < n - 1; ++i)
if ((a[i] > a[i - 1] && a[i] < a[i + 1]) ||
(a[i] < a[i - 1] &&... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 796,281 | 796,282 | u209067041 | cpp |
p02988 | #include <bits/stdc++.h>
using namespace std;
int main() {
int num;
int i;
int pn[4];
int count = 0;
cin >> num;
for (i = 0; i < num; i++)
cin >> pn[i];
for (i = 1; i < num - 1; i++) {
if (pn[i - 1] < pn[i] && pn[i] < pn[i + 1])
count++;
else if (pn[i + 1] < pn[i] && pn[i] < pn[i - 1]... | #include <bits/stdc++.h>
using namespace std;
int main() {
int num;
int i;
int pn[20];
int count = 0;
cin >> num;
for (i = 0; i < num; i++)
cin >> pn[i];
for (i = 1; i < num - 1; i++) {
if (pn[i - 1] < pn[i] && pn[i] < pn[i + 1])
count++;
else if (pn[i + 1] < pn[i] && pn[i] < pn[i - 1... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 796,309 | 796,310 | u315947928 | cpp |
p02988 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, ans;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; i++)
cin >> p[i];
for (int i = 0; i < n - 2; i++) {
if ((p[i] < p[i + 1] && p[i + 1] <= p[i + 2]) ||
(p[i] >= p[i + 1] && p[i + 1] > p[i + 2]))
ans++;
}
cout << ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, ans = 0;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; i++)
cin >> p[i];
for (int i = 0; i < n - 2; i++) {
if ((p[i] < p[i + 1] && p[i + 1] <= p[i + 2]) ||
(p[i] >= p[i + 1] && p[i + 1] > p[i + 2]))
ans++;
}
cout... | [
"variable_declaration.value.change"
] | 796,329 | 796,330 | u405230134 | cpp |
p02988 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, ans;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; i++)
cin >> p[i];
for (int i = 0; i < n - 2; i++) {
if ((p[i] < p[i + 1] && p[i + 1] < p[i + 2]) ||
(p[i] > p[i + 1] && p[i + 1] > p[i + 2]))
ans++;
}
cout << an... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, ans = 0;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; i++)
cin >> p[i];
for (int i = 0; i < n - 2; i++) {
if ((p[i] < p[i + 1] && p[i + 1] <= p[i + 2]) ||
(p[i] >= p[i + 1] && p[i + 1] > p[i + 2]))
ans++;
}
cout... | [
"variable_declaration.value.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 796,331 | 796,330 | u405230134 | cpp |
p02988 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n = 0, cnt = 0;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; ++i) {
cin >> p[i];
}
for (int i = 1; i < n; ++i) {
if (p[i - 1] > p[i] && p[i] >= p[i + 1]) {
++cnt;
} else if (p[i - 1] <= p[i] && p[i] < p[... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n = 0, cnt = 0;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; ++i) {
cin >> p[i];
}
for (int i = 1; i < n - 1; ++i) {
if (p[i - 1] > p[i] && p[i] > p[i + 1]) {
++cnt;
} else if (p[i - 1] < p[i] && p[i] < ... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 796,338 | 796,339 | u525318688 | cpp |
p02988 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n = 0, cnt = 0;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; ++i) {
cin >> p[i];
}
for (int i = 1; i < n; ++i) {
if (p[i - 1] >= p[i] && p[i] >= p[i + 1]) {
++cnt;
} else if (p[i - 1] <= p[i] && p[i] <= ... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n = 0, cnt = 0;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; ++i) {
cin >> p[i];
}
for (int i = 1; i < n - 1; ++i) {
if (p[i - 1] > p[i] && p[i] > p[i + 1]) {
++cnt;
} else if (p[i - 1] < p[i] && p[i] < ... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 796,340 | 796,339 | u525318688 | cpp |
p02988 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n = 0, cnt = 0;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; ++i) {
cin >> p[i];
}
for (int i = 1; i < n; ++i) {
if (p[i - 1] > p[i] && p[i] > p[i + 1]) {
++cnt;
} else if (p[i - 1] < p[i] && p[i] < p[i ... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n = 0, cnt = 0;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; ++i) {
cin >> p[i];
}
for (int i = 1; i < n - 1; ++i) {
if (p[i - 1] > p[i] && p[i] > p[i + 1]) {
++cnt;
} else if (p[i - 1] < p[i] && p[i] < ... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 796,341 | 796,339 | u525318688 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.