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 |
|---|---|---|---|---|---|---|---|
p02987 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if (s[0] == s[1] && s[2] == s[3] && s[0] != s[2])
cout << "yes" << endl;
else if (s[0] == s[2] && s[1] == s[3] && s[0] != s[1])
cout << "yes" << endl;
else if (s[0] == s[3] && s[1] == s[2] && s[0] != s[1])
cout << "yes"... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if (s[0] == s[1] && s[2] == s[3] && s[0] != s[2])
cout << "Yes" << endl;
else if (s[0] == s[2] && s[1] == s[3] && s[0] != s[1])
cout << "Yes" << endl;
else if (s[0] == s[3] && s[1] == s[2] && s[0] != s[1])
cout << "Yes"... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 795,241 | 795,242 | u318501828 | cpp |
p02987 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
using namespace std;
int main() {
string S;
int judge = 0;
if (S[0] == S[1]) {
if (S[0] != S[2] && S[2] == S[3]) {
cout << "Yes";
} else {
cout << "No";
}
} else if (S[0] == S[2]) {
if (S[0] != S[1] && S[1... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
int judge = 0;
if (S[0] == S[1]) {
if (S[0] != S[2] && S[2] == S[3]) {
cout << "Yes";
} else {
cout << "No";
}
} else if (S[0] == S[2]) {
if (S[0] !=... | [] | 795,247 | 795,248 | u725133562 | cpp |
p02987 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ll long long
#define ull unsigned ll
#define all(x) x.begin(), x.end()
#define CHECK_BIT(var, pos) ((var) & (1 << (pos)))
#define eb emplace_back
const int M = 1e9 + 7;
typedef long double ldb;
... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ll long long
#define ull unsigned ll
#define all(x) x.begin(), x.end()
#define CHECK_BIT(var, pos) ((var) & (1 << (pos)))
#define eb emplace_back
const int M = 1e9 + 7;
typedef long double ldb;
... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 795,249 | 795,250 | u694882399 | cpp |
p02987 | #include <bits/stdc++.h>
#include <math.h>
#include <set>
#define ll long long int
#define mod 1000000007
#define MAX 10000003
#define pb push_back
#define mem(x, y) memset(x, y, sizeof(x))
#define loop(i, x, y) for (ll i = x; i < y; i++)
#define rloop(i, x, y) for (ll i = x - 1; i >= y; i--)
using namespace std;
vecto... | #include <bits/stdc++.h>
#include <math.h>
#include <set>
#define ll long long int
#define mod 1000000007
#define MAX 10000003
#define pb push_back
#define mem(x, y) memset(x, y, sizeof(x))
#define loop(i, x, y) for (ll i = x; i < y; i++)
#define rloop(i, x, y) for (ll i = x - 1; i >= y; i--)
using namespace std;
vecto... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 795,257 | 795,258 | u266685049 | cpp |
p02987 | //==========================Head files==========================
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#define LL long long
#define db double
#define mp make_pair
#define pr pair<int, int>
#define f... | //==========================Head files==========================
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#define LL long long
#define db double
#define mp make_pair
#define pr pair<int, int>
#define f... | [
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 795,259 | 795,260 | u774596402 | cpp |
p02987 | // Keep Working hard
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(nullptr); ... | // Keep Working hard
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(nullptr); ... | [
"call.remove"
] | 795,265 | 795,266 | u490234157 | cpp |
p02987 | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define endl "\n"
#define se second
#define ll long long
// priority_queue<int, vector<int>, greater<int> > pq;
#define _CRT_SECURE_NO_DEPRECATE
const int N = 30030;
#define rep(i, begin, end) \
for (__t... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define endl "\n"
#define se second
#define ll long long
// priority_queue<int, vector<int>, greater<int> > pq;
#define _CRT_SECURE_NO_DEPRECATE
const int N = 30030;
#define rep(i, begin, end) \
for (__t... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 795,267 | 795,268 | u278557567 | cpp |
p02987 | // JSD
#include <iostream>
#include <set>
#include <vector>
using namespace std;
int main() {
string s;
set<char> st;
cin >> s;
for (int i = 0; i < s.length(); i++)
st.insert(s[i]);
if (st.size() == 2)
cout << "YES\n";
else
cout << "NO\n";
return 0;
} | // JSD
#include <iostream>
#include <set>
#include <vector>
using namespace std;
int main() {
string s;
set<char> st;
cin >> s;
for (int i = 0; i < s.length(); i++)
st.insert(s[i]);
if (st.size() == 2)
cout << "Yes\n";
else
cout << "No\n";
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 795,271 | 795,272 | u436019023 | cpp |
p02987 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef vector<string> vs;
typedef pair<ll, ll> pii;
typedef vector<pii> vpii;
#define pb(x) push_back(x)
#define ppb() pop_back()
#define mp(x, y) make_pair(x, y)
#define mod 1000000007
#define FOR0(i, ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef vector<string> vs;
typedef pair<ll, ll> pii;
typedef vector<pii> vpii;
#define pb(x) push_back(x)
#define ppb() pop_back()
#define mp(x, y) make_pair(x, y)
#define mod 1000000007
#define FOR0(i, ... | [
"literal.string.change",
"literal.string.case.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 795,275 | 795,276 | u729778766 | cpp |
p02987 | #include <bits/stdc++.h>
using namespace std;
map<char, int> cnt;
int main() {
string S;
cin >> S;
for (int i = 0; i < 4; i++)
cnt[S[i]]++;
if (cnt[S[0]] == 2 && cnt[S[1]] == 2 && cnt[S[2]] == 2 && cnt[S[3]] == 2)
cout << "YES\n";
else
cout << "NO\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
map<char, int> cnt;
int main() {
string S;
cin >> S;
for (int i = 0; i < 4; i++)
cnt[S[i]]++;
if (cnt[S[0]] == 2 && cnt[S[1]] == 2 && cnt[S[2]] == 2 && cnt[S[3]] == 2)
cout << "Yes\n";
else
cout << "No\n";
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 795,277 | 795,278 | u538921909 | cpp |
p02987 | #include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
using ll = long long;
using ld = long double;
const char nl = '\n';
/* -*- -*- -*- -*- -*- -*- -*- -*- -*- -*- -*- -*- -*- -*- -*- -*- -*- -*- -*-
* -*- -*- -*- -*- */
#include <bits/extc++.h>
namespace pbds = __gnu_pbds;
template <typen... | #include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
using ll = long long;
using ld = long double;
const char nl = '\n';
/* -*- -*- -*- -*- -*- -*- -*- -*- -*- -*- -*- -*- -*- -*- -*- -*- -*- -*- -*-
* -*- -*- -*- -*- */
#include <bits/extc++.h>
namespace pbds = __gnu_pbds;
template <typen... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 795,281 | 795,282 | u268245868 | cpp |
p02987 | #include <assert.h>
#include <bits/stdc++.h>
#include <time.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template <typename T>
using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
// s... | #include <assert.h>
#include <bits/stdc++.h>
#include <time.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template <typename T>
using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
// s... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 795,283 | 795,284 | u375267383 | cpp |
p02987 | #include <algorithm>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <unordered_set>
#include <vector>
#define mod 998244353
using namespace std;
struct str {
int idx, cnt;
};
int n... | #include <algorithm>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <unordered_set>
#include <vector>
#define mod 998244353
using namespace std;
struct str {
int idx, cnt;
};
int n... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 795,287 | 795,288 | u590012868 | cpp |
p02987 | #include <algorithm>
#include <forward_list>
#include <iostream>
#include <math.h>
#include <numeric>
#include <queue>
#include <stdlib.h>
#include <string>
#include <vector>
#define mod 1000000007
using namespace std;
int main() {
string S;
cin >> S;
for (int i = 0; i < 4; i++) {
int count = 0;
for ... | #include <algorithm>
#include <forward_list>
#include <iostream>
#include <math.h>
#include <numeric>
#include <queue>
#include <stdlib.h>
#include <string>
#include <vector>
#define mod 1000000007
using namespace std;
int main() {
string S;
cin >> S;
for (int i = 0; i < 4; i++) {
int count = 0;
for ... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 795,289 | 795,290 | u998203751 | cpp |
p02987 | #include <bits/stdc++.h>
#define rb(a, b, c) for (int a = b; a <= c; a++)
#define rl(a, b, c) for (int a = b; a >= c; a--)
#define niv vector<int>
#define LL long long
#define IT iterator
#define PB(a) push_back(a)
#define II(a, b) make_pair(a, b)
#define FIR first
#define SEC second
using namespace std;
const int INF ... | #include <bits/stdc++.h>
#define rb(a, b, c) for (int a = b; a <= c; a++)
#define rl(a, b, c) for (int a = b; a >= c; a--)
#define niv vector<int>
#define LL long long
#define IT iterator
#define PB(a) push_back(a)
#define II(a, b) make_pair(a, b)
#define FIR first
#define SEC second
using namespace std;
const int INF ... | [
"literal.string.change",
"io.output.change"
] | 795,291 | 795,292 | u751730221 | cpp |
p02987 | #include "bits/stdc++.h"
using namespace std;
string a;
int main() {
cin >> a;
sort(a.begin(), a.end());
if (a[0] == a[1] and a[2] == a[3] and a[1] != a[2])
cout << "YES";
else
cout << "NO";
} | #include "bits/stdc++.h"
using namespace std;
string a;
int main() {
cin >> a;
sort(a.begin(), a.end());
if (a[0] == a[1] and a[2] == a[3] and a[1] != a[2])
cout << "Yes";
else
cout << "No";
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 795,293 | 795,294 | u325959156 | cpp |
p02987 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)n; i++)
#define MOD 1000000009
using namespace std;
typedef long long ll;
int main() {
string str;
cin >> str;
if (str[0] == str[1]) {
if (str[0] != str[2] && str[2] == str[3])
cout << "Yes" << endl;
return 0;
}
if (str[0] == st... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)n; i++)
#define MOD 1000000009
using namespace std;
typedef long long ll;
int main() {
string str;
cin >> str;
if (str[0] == str[1]) {
if (str[0] != str[2] && str[2] == str[3]) {
cout << "Yes" << endl;
return 0;
}
}
if (st... | [] | 795,295 | 795,296 | u138062788 | cpp |
p02987 | #include <iostream>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
if (S[0] == S[1] && S[2] == S[3] && S[0] != S[2]) {
cout << "Yes" << endl;
} else if (S[0] == S[2] && S[1] == S[3] && S[0] != S[1]) {
cout << "Yes" << endl;
} else if (S[0] == S[4] && S[1] == S[2] && S[0] != ... | #include <iostream>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
if (S[0] == S[1] && S[2] == S[3] && S[0] != S[2]) {
cout << "Yes" << endl;
} else if (S[0] == S[2] && S[1] == S[3] && S[0] != S[1]) {
cout << "Yes" << endl;
} else if (S[0] == S[3] && S[1] == S[2] && S[0] != ... | [
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 795,297 | 795,298 | u904123392 | cpp |
p02987 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define all(a) a.begin(), a.end()
#define sz(a) (ll)(a... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define all(a) a.begin(), a.end()
#define sz(a) (ll)(a... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 795,305 | 795,306 | u616547520 | cpp |
p02987 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb emplace_back
#define f(i, n) for (int i = 0; i < n; i++)
#define F first
#define S second
#define fast ios::sync_with_stdio(false), cin.tie(0);
int32_t main() {
fast;
string s;
sort(s.begin(), s.end());
if (s[0] == s[1] && s[2] == ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb emplace_back
#define f(i, n) for (int i = 0; i < n; i++)
#define F first
#define S second
#define fast ios::sync_with_stdio(false), cin.tie(0);
int32_t main() {
fast;
string s;
cin >> s;
sort(s.begin(), s.end());
if (s[0] == s[1]... | [] | 795,312 | 795,313 | u670919462 | cpp |
p02987 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
string s;
cin >> s;
char a = s[0], b = s[1], c = s[2], d = s[3];
if ((a == b && c == d) ... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
string s;
cin >> s;
char a = s[0], b = s[1], c = s[2], d = s[3];
if ((a == b && c == d) ... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 795,316 | 795,317 | u019356802 | cpp |
p02987 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#define INF 10e10
using namespace std;
// #define y cout << "yes"<< endl
#define Y cout << "YES" << endl
#define y cout << "Yes" << endl
// #define n cout << "no"<< endl
#define N cout << "NO" << endl
#define n cout << "No" << endl
#define ... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#define INF 10e10
using namespace std;
// #define y cout << "yes"<< endl
#define Y cout << "YES" << endl
#define y cout << "Yes" << endl
// #define n cout << "no"<< endl
#define N cout << "NO" << endl
#define n cout << "No" << endl
#define ... | [
"identifier.change"
] | 795,320 | 795,321 | u174265495 | cpp |
p02987 | #include <bits/stdc++.h>
// CLOCKS_PER_SEC
#define se second
#define fi first
#define ll long long
#define Pii pair<int, int>
#define Pli pair<ll, int>
#define ull unsigned long long
#define pb push_back
#define ALL(x) x.begin(), x.end()
#define fio \
... | #include <bits/stdc++.h>
// CLOCKS_PER_SEC
#define se second
#define fi first
#define ll long long
#define Pii pair<int, int>
#define Pli pair<ll, int>
#define ull unsigned long long
#define pb push_back
#define ALL(x) x.begin(), x.end()
#define fio \
... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"expression.operator.compare.change"
] | 795,322 | 795,323 | u496707633 | cpp |
p02987 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
bool flag = true;
string s;
cin >> s;
long int n = s.length(), count = 0;
long int hash[128] = {0};
for (long int i = 0; i < n; i++) {
if (hash[s[i]] == ... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
bool flag = true;
string s;
cin >> s;
long int n = s.length(), count = 0;
long int hash[128] = {0};
for (long int i = 0; i < n; i++) {
if (hash[s[i]] == ... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 795,324 | 795,325 | u442327849 | cpp |
p02987 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
int main() {
string a;
cin >> a;
int b[101];
memset(b, 0, sizeof(b));
for (int i = 0; i < 3; i++) {
int c = a[i] - '0';
// cout<<c<<endl;
b[c]++;
}
int cnt = 0;
for (int i = 0; i < 101; i++) {
if... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
int main() {
string a;
cin >> a;
int b[101];
memset(b, 0, sizeof(b));
for (int i = 0; i < 4; i++) {
int c = a[i] - '0';
// cout<<c<<endl;
b[c]++;
}
int cnt = 0;
for (int i = 0; i < 101; i++) {
if... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 795,330 | 795,331 | u876784108 | cpp |
p02987 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPP(i, n) for (int i = 1; i <= n; i++)
const double PI = acos(-1);
const double EPS = 1e-15;
long long INF = LLONG_MAX;
#define i_7 (long long)(1E9 + 7)
long mod(long a) {
long long c = a % i_7;
if (c >= 0)
return c;
return c + i_... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPP(i, n) for (int i = 1; i <= n; i++)
const double PI = acos(-1);
const double EPS = 1e-15;
long long INF = LLONG_MAX;
#define i_7 (long long)(1E9 + 7)
long mod(long a) {
long long c = a % i_7;
if (c >= 0)
return c;
return c + i_... | [
"literal.string.change",
"literal.string.case.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 795,332 | 795,333 | u222293734 | cpp |
p02987 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 1000000007
int main() {
ios::sync_with_stdio(0), cin.tie(NULL), cout.tie(NULL);
string str;
cin >> str;
int ar[27] = {};
for (int i = 0; i < 4; i++)
ar[str[i] - 'A']++;
int h = 0;
vector<int> v;
for (int i = 0; i < 26; i... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 1000000007
int main() {
ios::sync_with_stdio(0), cin.tie(NULL), cout.tie(NULL);
string str;
cin >> str;
int ar[27] = {};
for (int i = 0; i < 4; i++)
ar[str[i] - 'A']++;
int h = 0;
vector<int> v;
for (int i = 0; i < 26; i... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 795,338 | 795,339 | u972547684 | cpp |
p02987 | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define ll long long int
#define INF INT_MAX
#define mod
#define chutiyaap \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); ... | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define ll long long int
#define INF INT_MAX
#define mod
#define chutiyaap \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); ... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 795,340 | 795,341 | u776675173 | cpp |
p02987 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <ve... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <ve... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 795,344 | 795,345 | u965118468 | cpp |
p02987 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define bit(n) (1LL << (n))
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define bit(n) (1LL << (n))
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a ... | [] | 795,348 | 795,349 | u746411953 | cpp |
p02987 | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
//#define int long long
template <class T> bool INRANGE(T x, T a, T b) { return a <= x && x <= b; }
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
//#define int long long
template <class T> bool INRANGE(T x, T a, T b) { return a <= x && x <= b; }
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T... | [
"literal.string.change",
"io.output.change"
] | 795,352 | 795,353 | u299377613 | cpp |
p02987 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
char s[5];
cin >> s;
sort(s, s + 4);
if (s[0] == s[1] && s[2] == s[3] && s[0] != s[2])
cout << "yes" << endl;
else
cout << "no" << endl;
return 0;
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
char s[5];
cin >> s;
sort(s, s + 4);
if (s[0] == s[1] && s[2] == s[3] && s[0] != s[2])
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 795,363 | 795,364 | u879726139 | cpp |
p02987 | #include <bits/stdc++.h>
using namespace std;
string s;
int num[30], k;
int main() {
cin >> s;
int l = s.size();
for (int i = 0; i < l; i++) {
num[s[i] - 'a']++;
if (num[s[i] - 'a'] == 2)
k++;
}
if (k == 2)
puts("Yes");
else
puts("No");
return 0;
} | #include <bits/stdc++.h>
using namespace std;
string s;
int num[30], k;
int main() {
cin >> s;
int l = s.size();
for (int i = 0; i < l; i++) {
num[s[i] - 'A']++;
if (num[s[i] - 'A'] == 2)
k++;
}
if (k == 2)
puts("Yes");
else
puts("No");
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 795,365 | 795,366 | u211255798 | cpp |
p02987 | #include <bits/stdc++.h>
using namespace std;
// define
#define str string
#define rep(x, y) for (int i = x; i < y; i++)
#define REP(x, y) for (int j = x; j < y; j++)
#define all(x) x.begin(), x.end()
#define elif else if
// vectordefine
#define vint vector<int>
#define vc vector<char>
#define vtr vector<string>
#defin... | #include <bits/stdc++.h>
using namespace std;
// define
#define str string
#define rep(x, y) for (int i = x; i < y; i++)
#define REP(x, y) for (int j = x; j < y; j++)
#define all(x) x.begin(), x.end()
#define elif else if
// vectordefine
#define vint vector<int>
#define vc vector<char>
#define vtr vector<string>
#defin... | [
"variable_declaration.type.change"
] | 795,367 | 795,368 | u347579224 | cpp |
p02988 | #define rep(i, n) for (int i = 0; i < (n); i++)
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int MOD = 1000000007;
// MAX int 2,147,483,647
// MAX O(n) 10^18
int main() {
int n;
cin >> n;
vector<int> p(n);
rep(i, n) cin >> p.at(i);
int count = 0;
rep(... | #define rep(i, n) for (int i = 0; i < (n); i++)
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int MOD = 1000000007;
// MAX int 2,147,483,647
// MAX O(n) 10^18
int main() {
int n;
cin >> n;
vector<int> p(n);
rep(i, n) cin >> p.at(i);
int count = 0;
rep(... | [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 795,375 | 795,376 | u475280305 | cpp |
p02988 | #define rep(i, n) for (int i = 0; i < (n); i++)
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int MOD = 1000000007;
// MAX int 2,147,483,647
// MAX O(n) 10^18
int main() {
int n;
cin >> n;
vector<int> p(n);
rep(i, n) cin >> p.at(i);
int count = 0;
rep(... | #define rep(i, n) for (int i = 0; i < (n); i++)
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int MOD = 1000000007;
// MAX int 2,147,483,647
// MAX O(n) 10^18
int main() {
int n;
cin >> n;
vector<int> p(n);
rep(i, n) cin >> p.at(i);
int count = 0;
rep(... | [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 795,377 | 795,378 | u475280305 | cpp |
p02988 | #include <algorithm>
#include <cmath>
#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 ans = 0;
for (int i = 0; i < n - 1; i++) {
if (a[i - 1] < a[i] && a[i] < a[i + 1]) {
ans++;
... | #include <algorithm>
#include <cmath>
#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 ans = 0;
for (int i = 1; i < n - 1; i++) {
if (a[i - 1] < a[i] && a[i] < a[i + 1]) {
ans++;
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 795,379 | 795,380 | u141180505 | cpp |
p02988 | /*
START BY THE NAME OF ALMIGHTY ALLAH
THIS WONT BE ACCEPTED
STOP_GIVING_UP
██╗███████╗████████╗██╗ █████╗ ██╗ ██╗
██║██╔════╝╚══██╔══╝██║██╔══██╗██║ ██╔╝
██║███████╗ ██║ ██║███████║█████╔╝
██║╚════██║ ██║ ██║██╔══██║██╔═██╗
██║███████║ ██║ ██║██║ ██║██║ ██╗
╚═╝╚══════╝ ╚═╝ ╚═╝╚═╝ ╚═╝╚═╝ ╚═╝
*/
#... | /*
START BY THE NAME OF ALMIGHTY ALLAH
THIS WONT BE ACCEPTED
STOP_GIVING_UP
██╗███████╗████████╗██╗ █████╗ ██╗ ██╗
██║██╔════╝╚══██╔══╝██║██╔══██╗██║ ██╔╝
██║███████╗ ██║ ██║███████║█████╔╝
██║╚════██║ ██║ ██║██╔══██║██╔═██╗
██║███████║ ██║ ██║██║ ██║██║ ██╗
╚═╝╚══════╝ ╚═╝ ╚═╝╚═╝ ╚═╝╚═╝ ╚═╝
*/
#... | [
"expression.operation.binary.remove"
] | 795,381 | 795,382 | u635989753 | cpp |
p02988 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> vec(n);
for (int i = 0; i < n - 2; i++) {
cin >> vec[i];
}
int cnt = 0;
for (int i = 0; i < n; i++) {
if (vec[i] < vec[i + 1] && vec[i + 1] < vec[i + 2])
cnt++;
if (vec[i] > vec[i + 1] && vec[i + 1] ... | #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[i];
}
int cnt = 0;
for (int i = 0; i < n - 2; i++) {
if (vec[i] < vec[i + 1] && vec[i + 1] < vec[i + 2])
cnt++;
if (vec[i] > vec[i + 1] && vec[i + 1] ... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 795,405 | 795,406 | u587622858 | cpp |
p02988 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, ans = 0;
vector<int> p(20);
vector<bool> flag(20);
for (int i = 0; i < n; i++)
cin >> p[i];
if (p[0] < p[1])
flag[0] = true;
else
flag[0] = false;
for (int i = 1; i < n - 1; i++) {
if (p[i] < p[i + 1])
flag[i] = true... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, ans = 0;
vector<int> p(20);
vector<bool> flag(20);
cin >> n;
for (int i = 0; i < n; i++)
cin >> p[i];
if (p[0] < p[1])
flag[0] = true;
else
flag[0] = false;
for (int i = 1; i < n - 1; i++) {
if (p[i] < p[i + 1])
fl... | [] | 795,407 | 795,408 | u652660628 | cpp |
p02988 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1e16;
const ll mod = 1000000007;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
ll n;
cin >> n;
vector<ll> v(n);
rep(i, n) cin >> v.at(i);
ll res = 0;
rep(i, n - 2) {
if (v.at(i) < v.at(i + 1) && v.at(... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1e16;
const ll mod = 1000000007;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
ll n;
cin >> n;
vector<ll> v(n);
rep(i, n) cin >> v.at(i);
ll res = 0;
rep(i, n - 2) {
if (v.at(i) < v.at(i + 1) && v.at(... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 795,409 | 795,410 | u785492958 | cpp |
p02987 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define FAST ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define dofloat cout << fixed << setprecision(8)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define bitcount __built... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define FAST ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define dofloat cout << fixed << setprecision(8)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define bitcount __built... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 795,421 | 795,422 | u091650402 | cpp |
p02987 | #include <bits/stdc++.h>
#define db(x) cout << #x << "=" << x << endl;
using namespace std;
char a[10];
int cnt[27];
int main() {
scanf("%s", a);
for (int i = 0; i < 4; i++)
cnt[a[i] - 'a']++;
bool flg = 0;
for (int i = 0; i < 26; i++)
if (cnt[i] && cnt[i] != 2)
flg = 1;
puts(flg ? "No" : "Yes")... | #include <bits/stdc++.h>
#define db(x) cout << #x << "=" << x << endl;
using namespace std;
char a[10];
int cnt[27];
int main() {
scanf("%s", a);
for (int i = 0; i < 4; i++)
cnt[a[i] - 'A']++;
bool flg = 0;
for (int i = 0; i < 26; i++)
if (cnt[i] && cnt[i] != 2)
flg = 1;
puts(flg ? "No" : "Yes")... | [
"literal.string.change",
"literal.string.case.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 795,423 | 795,424 | u928673524 | cpp |
p02988 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
vector<int> p(n);
for (int i = 0; i < n; i++) {
cin >> p[i];
}
int cnt = 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])) {
cnt++;
}
... | #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 = 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])) {
cnt... | [] | 795,427 | 795,428 | u147762850 | cpp |
p02988 | #include <bits/stdc++.h>
using namespace std;
main() {
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++)
cin >> v[i];
int ans = 0;
for (int i = 0; i < -2; i++) {
vector<int> a = {v[i], v[i + 1], v[i + 2]};
sort(a.begin(), a.end());
if (a[1] == v[i + 1])
ans++;
}
cout ... | #include <bits/stdc++.h>
using namespace std;
main() {
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++)
cin >> v[i];
int ans = 0;
for (int i = 0; i < n - 2; i++) {
vector<int> a = {v[i], v[i + 1], v[i + 2]};
sort(a.begin(), a.end());
if (a[1] == v[i + 1])
ans++;
}
co... | [] | 795,437 | 795,438 | u720321944 | 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.at(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.at(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,442 | 795,443 | u016183710 | 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.at(i);
}
int ans = 0;
for (int i = 0; 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.at(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])... | [
"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"
] | 795,444 | 795,443 | u016183710 | cpp |
p02988 | #include <bits/stdc++.h>
using namespace std;
int main() {
int i, n, m, c = 0;
vector<int> a;
cin >> n;
for (i = 0; i < n; i++) {
cin >> m;
a.push_back(m);
}
for (i = 1; i < n - 1; i++) {
if (a[i + 1] > a[i] && a[i] > a[i - 1] && a[i + 1] > a[i - 1] ||
a[i - 1] > a[i] && a[i] > a[i + 1] ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int i, n, m, c = 0;
vector<int> a;
cin >> n;
for (i = 0; i < n; i++) {
cin >> m;
a.push_back(m);
}
for (i = 1; i < n - 1; i++) {
if (a[i + 1] > a[i] && a[i] > a[i - 1] && a[i + 1] > a[i - 1] ||
a[i - 1] > a[i] && a[i] > a[i + 1] ... | [
"expression.operation.binary.remove"
] | 795,449 | 795,450 | u173252932 | cpp |
p02988 | #include <bits/stdc++.h>
using namespace std;
int main() {
int i, n, m, c = 0;
vector<int> a;
cin >> n;
for (i = 0; i < n; i++) {
cin >> m;
a.push_back(m);
}
for (i = 1; i < n; i++) {
if (a[i + 1] > a[i] && a[i] > a[i - 1] && a[i + 1] > a[i - 1] ||
a[i - 1] > a[i] && a[i] > a[i + 1] && a... | #include <bits/stdc++.h>
using namespace std;
int main() {
int i, n, m, c = 0;
vector<int> a;
cin >> n;
for (i = 0; i < n; i++) {
cin >> m;
a.push_back(m);
}
for (i = 1; i < n - 1; i++) {
if (a[i + 1] > a[i] && a[i] > a[i - 1] && a[i + 1] > a[i - 1] ||
a[i - 1] > a[i] && a[i] > a[i + 1] ... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"expression.operation.binary.remove"
] | 795,451 | 795,450 | u173252932 | cpp |
p02988 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
int a = 0;
for (int i = 0; i < n - 1; i++) {
if (arr[i] > arr[i - 1] && arr[i + 1] > arr[i] ||
arr[i] < arr[i - 1] && arr[i + 1] < arr[i]) {
a++;
}
... | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
int a = 0;
for (int i = 1; i < n - 1; i++) {
if (arr[i] > arr[i - 1] && arr[i + 1] > arr[i] ||
arr[i] < arr[i - 1] && arr[i + 1] < arr[i]) {
a++;
}
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 795,454 | 795,455 | u105471115 | cpp |
p02988 | #include <algorithm>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
#define rep(i, a, n) fo... | #include <algorithm>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
#define rep(i, a, n) fo... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 795,456 | 795,457 | u407213771 | cpp |
p02988 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n + 1];
for (int i = 1; i < n + 1; i++) {
cin >> a[i];
}
int ans = 0;
for (int i = 2; i < n + 1; i++) {
if (a[i - 1] < a[i] && a[i + 1] > a[i]) {
ans++;
} else if (a[i - 1] > a[i] && a[i + 1] < a[i]... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n + 1];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int ans = 0;
for (int i = 1; i < n - 1; i++) {
if (a[i - 1] < a[i] && a[i + 1] > a[i]) {
ans++;
} else if (a[i - 1] > a[i] && a[i + 1] < a[i]) {
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"misc.opposites",
"expression.operator.arithmetic.change",
"expression.operation.binary.c... | 795,458 | 795,459 | u214137532 | cpp |
p02988 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
int main() {
int 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] - p[i - 1]) * (p[i] - p[i + 1]) < 0) {
ans += 1;
}
}
cout << ans << endl;
} | #define _GLIBCXX_DEBUG
#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] - p[i - 1]) * (p[i] - p[i + 1]) < 0) {
ans += 1;
}
}
cout << ans... | [] | 795,462 | 795,463 | u346629192 | cpp |
p02988 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int ans = 0;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
if (i > 1) {
if (((vec.at(i) < vec.at(i - 1)) && (vec.at(i - 1) < vec.at(i - 2)) ||
((vec.at(i) > vec.at(i - 1))) && (vec.at(i -... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int ans = 0;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
if (i > 1) {
if (((vec.at(i) < vec.at(i - 1)) && (vec.at(i - 1) < vec.at(i - 2)) ||
((vec.at(i) > vec.at(i - 1))) && (vec.at(i -... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 795,466 | 795,467 | u280120599 | cpp |
p02988 | // include
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <sstream>
#include <string>
#include <utility>
#include <vector>
//マクロとか
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i < (int)(n) + 1; i++)
#defi... | // include
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <sstream>
#include <string>
#include <utility>
#include <vector>
//マクロとか
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i < (int)(n) + 1; i++)
#defi... | [
"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"
] | 795,468 | 795,469 | u296160120 | cpp |
p02988 | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <string>
using namespace std;
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 - 3); i++) {
if (((p[i + 1] > p[i + 2]) && (p[i + 1] > p[i])) ||
((p... | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <string>
using namespace std;
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 + 1] > p[i + 2]) && (p[i + 1] > p[i])) ||
((p... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 795,470 | 795,471 | u904995051 | 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.at(i);
}
int ans = 0;
for (int i = 2; i < n; i++) {
int mi = min(p.at(i - 2), min(p.at(i - 1), p.at(i)));
int ma = max(p.at(i - 2), min(p.at(i - 1), p.at(i)));
... | #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.at(i);
}
int ans = 0;
for (int i = 2; i < n; i++) {
int mi = min(p.at(i - 2), min(p.at(i - 1), p.at(i)));
int ma = max(p.at(i - 2), max(p.at(i - 1), p.at(i)));
... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"call.arguments.change"
] | 795,476 | 795,477 | u030246664 | cpp |
p02988 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> data(n);
for (int i = 0; i < n; i++) {
cin >> data.at(i);
}
int count = 0;
for (int i = 0; i < n - 3; i++) {
if (data.at(i) > data.at(i + 1) && data.at(i + 1) >= data.at(i + 2)) {
count++;
} else i... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> data(n);
for (int i = 0; i < n; i++) {
cin >> data.at(i);
}
int count = 0;
for (int i = 0; i < n - 2; i++) {
if (data.at(i) > data.at(i + 1) && data.at(i + 1) >= data.at(i + 2)) {
count++;
} else i... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 795,478 | 795,479 | u164352406 | cpp |
p02988 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vl;
typedef vector<string> vs;
typedef vector<char> vc;
typedef queue<ll> ql;
typedef deque<ll> dql;
typedef priority_queue<ll, vl /*, greater<ll>*/> pql; //降順(/*昇順*/)
typedef set<ll> sl;
typedef pair<ll, ... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vl;
typedef vector<string> vs;
typedef vector<char> vc;
typedef queue<ll> ql;
typedef deque<ll> dql;
typedef priority_queue<ll, vl /*, greater<ll>*/> pql; //降順(/*昇順*/)
typedef set<ll> sl;
typedef pair<ll, ... | [
"literal.number.change",
"call.arguments.change"
] | 795,484 | 795,485 | u682191329 | cpp |
p02988 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vl;
typedef vector<string> vs;
typedef vector<char> vc;
typedef queue<ll> ql;
typedef deque<ll> dql;
typedef priority_queue<ll, vl /*, greater<ll>*/> pql; //降順(/*昇順*/)
typedef set<ll> sl;
typedef pair<ll, ... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vl;
typedef vector<string> vs;
typedef vector<char> vc;
typedef queue<ll> ql;
typedef deque<ll> dql;
typedef priority_queue<ll, vl /*, greater<ll>*/> pql; //降順(/*昇順*/)
typedef set<ll> sl;
typedef pair<ll, ... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 795,486 | 795,485 | u682191329 | cpp |
p02988 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> vs(n);
for (auto &x : vs)
cin >> x;
int ans = 0;
for (int i = 1; i < n - 1; ++i) {
int a = vs[i - 1];
int b = vs[i];
int c = vs[i + 1];
int mn = min(a, min(b, c));
int mx = max(a, min(b, c));
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> vs(n);
for (auto &x : vs)
cin >> x;
int ans = 0;
for (int i = 1; i < n - 1; ++i) {
int a = vs[i - 1];
int b = vs[i];
int c = vs[i + 1];
int mn = min(a, min(b, c));
int mx = max(a, max(b, c));
... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"call.arguments.change"
] | 795,491 | 795,492 | u808092084 | cpp |
p02988 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#incl... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#incl... | [
"call.arguments.change"
] | 795,493 | 795,494 | u809967037 | 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.at(i);
int k = 0;
for (int i = 0; i < n - 2; i++) {
if (p.at(i - 1) < p.at(i) && p.at(i) < p.at(i + 1))
k++;
else if (p.at(i + 1) < p.at(i) && p.at(i) < p.a... | #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.at(i);
int k = 0;
for (int i = 1; i < n - 1; i++) {
if (p.at(i - 1) < p.at(i) && p.at(i) < p.at(i + 1))
k++;
else if (p.at(i + 1) < p.at(i) && p.at(i) < p.a... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 795,497 | 795,498 | u247123590 | 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.at(i);
}
int count = 0;
for (int k = 0; k < N - 1; k++) {
if ((P.at(k) - P.at(k - 1)) * (P.at(k + 1) - P.at(k)) > 0) {
count++;
}
}
cout << count << ... | #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.at(i);
}
int count = 0;
for (int k = 1; k < N - 1; k++) {
if ((P.at(k) - P.at(k - 1)) * (P.at(k + 1) - P.at(k)) > 0) {
count++;
}
}
cout << count << ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 795,499 | 795,500 | u702468315 | cpp |
p02988 | #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 - 1; i++) {
if (p[i + 1] > p[i] && p[i] > p[i - 1])
ans++;
if (p[i - 1] > p[i] && p[i] > p[i + 1])
ans++;
}
co... | #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 = 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[i + 1])
ans++;
}
co... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 795,503 | 795,504 | u216525464 | cpp |
p02988 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int ans = 0;
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] == p[i - 1] + p[i] + p[i + 1] - min({p[i - 1], p[i], p[i + 1]}) -
max({p[i - 1], p[i], p[i + 1]})... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int ans = 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] == p[i - 1] + p[i] + p[i + 1] - min({p[i - 1], p[i], p[i + 1]}) -
max({p[i - 1], p[i]... | [] | 795,505 | 795,506 | u578969098 | cpp |
p02988 | #include <bits/stdc++.h>
using namespace std;
int n;
vector<int> p;
int main() {
cin >> n;
p.resize(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++;
}
... | #include <bits/stdc++.h>
using namespace std;
int n;
vector<int> p;
int main() {
cin >> n;
p.resize(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++;
}
... | [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 795,509 | 795,510 | u589508454 | cpp |
p02988 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int n, k, flag;
cin >> n;
int a[n];
rep(i, n) {
cin >> k;
a[i] == k;
}
for (int i = 1; i < n - 1; i++) {
if ((a[i] - a[i + 1]) * (a[i] - a[i - 1]) < 0)
flag++;
}
cout << fla... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int n, k, flag = 0;
cin >> n;
int a[n];
rep(i, n) {
cin >> k;
a[i] = k;
}
for (int i = 1; i < n - 1; i++) {
if ((a[i] - a[i + 1]) * (a[i] - a[i - 1]) < 0)
flag++;
}
cout << ... | [
"variable_declaration.value.change",
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 795,517 | 795,518 | u070779615 | cpp |
p02988 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
//二項係数の計算
int nCr(int A, int B) {
ll ans = 1;
for (int i = 0; i < B; i++) {
ans *= A - i;
}
for (int i = 0; i < B; i++) {
ans /= i + 1;
}
return ans;
}
int... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
//二項係数の計算
int nCr(int A, int B) {
ll ans = 1;
for (int i = 0; i < B; i++) {
ans *= A - i;
}
for (int i = 0; i < B; i++) {
ans /= i + 1;
}
return ans;
}
int... | [] | 795,535 | 795,536 | u983563612 | cpp |
p02988 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int a;
cin >> a;
int b[a];
for (int i = 0; i < a; i++)
cin >> b[i];
int ans = 0;
for (int i = 0; i < a - 2; i++) {
if (b[i] > b[i + 1] && b[i + 2] > b[i + 1])
ans++;
if (b[i] < b[i + 1] && b[i + 2... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int a;
cin >> a;
int b[a];
for (int i = 0; i < a; i++)
cin >> b[i];
int ans = 0;
for (int i = 0; i < a - 2; i++) {
if (b[i] > b[i + 1] && b[i + 2] < b[i + 1])
ans++;
if (b[i] < b[i + 1] && b[i + 2... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 795,537 | 795,538 | u079532978 | 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.at(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] < p[i] && p[i] < p[i + 1])
ans+... | #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.at(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])
ans+... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 795,544 | 795,545 | u497715246 | cpp |
p02988 | #include <algorithm>
#include <cmath> //abs()かfabs()で少数絶対値
#include <cstdlib> //abs()で整数絶対値
#include <deque>
#include <functional> //sort第三引数greater<型名>()で降順
#include <iomanip> //cout<<setw(数字) で空白による桁揃え
#include <iostream> //cout<<right で右揃え
#include <map>
#include <queue>
#include <string>
#include <vector>
u... | #include <algorithm>
#include <cmath> //abs()かfabs()で少数絶対値
#include <cstdlib> //abs()で整数絶対値
#include <deque>
#include <functional> //sort第三引数greater<型名>()で降順
#include <iomanip> //cout<<setw(数字) で空白による桁揃え
#include <iostream> //cout<<right で右揃え
#include <map>
#include <queue>
#include <string>
#include <vector>
u... | [
"control_flow.branch.if.condition.change"
] | 795,546 | 795,547 | u022890424 | cpp |
p02988 | #include <bits/stdc++.h>
using namespace std;
#define all(a) a.begin(), a.end()
#define rep(i, n) for (int i = 0; i < n; i++)
#define endl "\n"
typedef long long ll;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
vector<int> v(n);
rep(i, n) { cin >> v[i]; }
int an... | #include <bits/stdc++.h>
using namespace std;
#define all(a) a.begin(), a.end()
#define rep(i, n) for (int i = 0; i < n; i++)
#define endl "\n"
typedef long long ll;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
vector<int> v(n);
rep(i, n) { cin >> v[i]; }
int an... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 795,550 | 795,551 | u611594870 | cpp |
p02988 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> p(n);
for (int i = 1; i <= n; i++) {
cin >> p.at(i);
}
int ans = 0;
for (int i = 2; 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) > p.at(i) && p.at(... | #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.at(i);
}
int ans = 0;
for (int i = 1; i < n - 1; i++) {
if (p.at(i - 1) < p.at(i) && p.at(i) < p.at(i + 1)) {
ans++;
} else if (p.at(i - 1) > p.at(i) && p.... | [
"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"
] | 795,552 | 795,553 | u856957535 | cpp |
p02988 | #include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define int long long
#define fr(i, a, b) for (int i = a; i <= b; ++i)
#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define tr... | #include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define int long long
#define fr(i, a, b) for (int i = a; i <= b; ++i)
#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define tr... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 795,556 | 795,557 | u128142444 | cpp |
p02988 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define fi first
#define se second
#define endl "\n"
template <typename T> inline b... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define fi first
#define se second
#define endl "\n"
template <typename T> inline b... | [
"identifier.replace.remove",
"literal.replace.add",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 795,560 | 795,561 | u340010271 | cpp |
p02988 | #include <algorithm>
#include <iostream>
#include <set>
#include <vector>
using namespace std;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; n > i; i++) {
cin >> a[i];
}
int Z = 0;
for (int i = 1; n - 1 > i; i++) {
if (max({a[i - 1], a[i], a[i + 1]}) != ... | #include <algorithm>
#include <iostream>
#include <set>
#include <vector>
using namespace std;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; n > i; i++) {
cin >> a[i];
}
int Z = 0;
for (int i = 1; n - 1 > i; i++) {
if (max({a[i - 1], a[i], a[i + 1]}) != ... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"control_flow.branch.if.condition.change"
] | 795,568 | 795,569 | u466161487 | cpp |
p02988 | #include <bits/stdc++.h>
//#include <boost/math/common_factor.hpp>
using namespace std;
#define ll long long int
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define mod 1000000007
#defi... | #include <bits/stdc++.h>
//#include <boost/math/common_factor.hpp>
using namespace std;
#define ll long long int
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define mod 1000000007
#defi... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 795,572 | 795,573 | u734938632 | cpp |
p02988 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int p[20];
for (int i = 0; i < n; i++) {
cin >> p[i];
}
int count = 0;
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]) {
count++;
}
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int p[20];
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++;
}
}
... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 795,574 | 795,575 | u101777447 | cpp |
p02988 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int p[20];
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++;
}
}
co... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int p[20];
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",
"expression.operation.binary.remove"
] | 795,576 | 795,575 | u101777447 | cpp |
p02988 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
vector<int> p(20);
cin >> 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 i... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
vector<int> p(20);
cin >> 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 i... | [
"expression.operation.binary.remove"
] | 795,577 | 795,578 | u258108378 | cpp |
p02988 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
vector<int> p(20);
cin >> n;
for (int i = 0; i < n; i++)
cin >> p[i];
int ans = 0;
for (int i = 1; i < n - 2; i++) {
if (p[i - 1] < p[i] && p[i] < p[i + 1])
ans++;
else i... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
vector<int> p(20);
cin >> 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 i... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 795,579 | 795,578 | u258108378 | cpp |
p02988 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> p(n);
int result = 0;
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]) {
result++;
} else if (... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> p(n);
int result = 0;
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]) {
result++;
} else if (... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change",
"misc.off_by_one"
] | 795,586 | 795,587 | u600215903 | cpp |
p02988 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> p(n);
int result = 0;
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]) {
result++;
} else if (... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> p(n);
int result = 0;
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]) {
result++;
} else if (... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"misc.off_by_one"
] | 795,588 | 795,587 | u600215903 | cpp |
p02988 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> p(n);
int result = 0;
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]) {
result++;
} else if (... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> p(n);
int result = 0;
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]) {
result++;
} else if (... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"misc.off_by_one"
] | 795,589 | 795,587 | u600215903 | cpp |
p02988 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> p(n);
int result = 0;
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]) {
result++;
} else if (... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> p(n);
int result = 0;
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]) {
result++;
} else if (... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 795,590 | 795,587 | u600215903 | cpp |
p02988 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> p(n);
int result = 0;
for (int i = 0; i < n; i++) {
cin >> p[i];
}
for (int i = 0; i < n; i++) {
if (p[i - 1] < p[i] && p[i] < p[i + 1]) {
result++;
} else if (p[i ... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> p(n);
int result = 0;
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]) {
result++;
} else if (... | [
"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",
"misc.opposites",
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"cont... | 795,591 | 795,587 | u600215903 | cpp |
p02988 | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
typedef long long ll;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;... | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
typedef long long ll;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;... | [
"variable_declaration.value.change"
] | 795,600 | 795,601 | u005906204 | cpp |
p02988 | #include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> p(n);
rep(i, n) { cin >> p[i]; }
int count = 0;
for (int i = 0; i < n - 2; i++) {
if (p[i - 1] < p[i] && p[i... | #include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> p(n);
rep(i, n) { cin >> p[i]; }
int count = 0;
for (int i = 1; i < n - 1; i++) {
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",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 795,603 | 795,604 | u602267597 | cpp |
p02988 | #include <iostream>
using namespace std;
int main() {
int n, counter = 0;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 1; i < (n - 1); i++) {
if (a[i] > a[i - 1] && a[i] < a[i + 1])
counter++;
else if (a[i] < a[i - 1] && a[i] > a[i + 1])
counter++... | #include <iostream>
using namespace std;
int main() {
int n, counter = 0;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 1; i < (n - 1); i++) {
if (a[i] > a[i - 1] && a[i] < a[i + 1])
counter++;
else if (a[i] < a[i - 1] && a[i] > a[i + 1])
counter++... | [] | 795,607 | 795,608 | u798780187 | cpp |
p02988 | #include <algorithm>
#include <array>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> ps(n);
for (int i = 0; i < n; i++) {
cin >> ps[i];
}
int cnt;
for (int i = 1; i < n - ... | #include <algorithm>
#include <array>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> ps(n);
for (int i = 0; i < n; i++) {
cin >> ps[i];
}
int cnt = 0;
for (int i = 1; i < ... | [
"variable_declaration.value.change"
] | 795,609 | 795,610 | u579786106 | cpp |
p02988 | #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;
std::cin >> n;
std::vector<int> p(n);
rep(i, n) std::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+... | #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;
std::cin >> n;
std::vector<int> p(n);
rep(i, n) std::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+... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 795,613 | 795,614 | u589238650 | cpp |
p02988 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int p[30];
cin >> N;
int res = 0;
for (size_t i = 0; i < N; i++) {
cin >> p[i];
}
for (int i = 0; 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;
int p[30];
cin >> N;
int res = 0;
for (size_t 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]) {
res++;
} else if ((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"
] | 795,617 | 795,618 | u182146635 | cpp |
p02988 | #include <iostream>
#include <vector>
int main() {
int n;
std::cin >> n;
std::vector<int> p;
int temp;
int cnt = 0;
while (std::cin >> temp)
p.push_back(temp);
for (auto i = p.begin() + 2; i < p.end(); ++i)
if ((*(i - 1) < *i && *i < *(i + 1)) || (*(i + 1) < *i && *i < *(i - 1)))
++cnt;
s... | #include <iostream>
#include <vector>
int main() {
int n;
std::cin >> n;
std::vector<int> p;
int temp;
int cnt = 0;
while (std::cin >> temp)
p.push_back(temp);
for (auto i = p.begin() + 1; i < p.end() - 1; ++i)
if ((*(i - 1) < *i && *i < *(i + 1)) || (*(i + 1) < *i && *i < *(i - 1)))
++cnt;... | [
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operation.binary.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 795,628 | 795,629 | u864752370 | cpp |
p02988 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define repm(i, m, n) for (int i = m; i < (n); i++)
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using pii = pair<int, int>;
int main() {
int n;
c... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define repm(i, m, n) for (int i = m; i < (n); i++)
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using pii = pair<int, int>;
int main() {
int n;
c... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 795,632 | 795,633 | u850516963 | cpp |
p02988 | #include <bits/stdc++.h>
#define sz(arr) (int)arr.size()
#define All(arr) arr.begin(), arr.end()
using namespace std;
typedef long long ll;
void _cin() {}
template <class Head, class... Tail> void _cin(Head &&head, Tail &&...tail) {
cin >> head;
_cin(forward<Tail>(tail)...);
}
#define Cin(T, ...) ... | #include <bits/stdc++.h>
#define sz(arr) (int)arr.size()
#define All(arr) arr.begin(), arr.end()
using namespace std;
typedef long long ll;
void _cin() {}
template <class Head, class... Tail> void _cin(Head &&head, Tail &&...tail) {
cin >> head;
_cin(forward<Tail>(tail)...);
}
#define Cin(T, ...) ... | [
"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"
] | 795,646 | 795,647 | u994307795 | cpp |
p02988 | #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;
typedef long long int ll;
#define MOD 998244353
ll gcd(ll a, ll b) {
if ... | #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;
typedef long long int ll;
#define MOD 998244353
ll gcd(ll a, ll b) {
if ... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 795,650 | 795,651 | u474551232 | cpp |
p02988 | // Author: getharshkumar
#include <bits/stdc++.h>
using namespace std;
#define ll int64_t
const ll N = 1e6 + 6, M = 1e9 + 7;
ll p[N];
int main() {
ios::sync_with_stdio(false), cin.tie(nullptr);
ll n, c = 0;
cin >> n;
for (ll i = 0; i < n; i++)
cin >> p[i];
for (ll i = 1; i + 1 < n; i++) {
vector<ll> ... | // Author: getharshkumar
#include <bits/stdc++.h>
using namespace std;
#define ll int64_t
const ll N = 1e6 + 6, M = 1e9 + 7;
ll p[N];
int main() {
ios::sync_with_stdio(false), cin.tie(nullptr);
ll n, c = 0;
cin >> n;
for (ll i = 0; i < n; i++)
cin >> p[i];
for (ll i = 1; i + 1 < n; i++) {
vector<ll> ... | [
"assignment.change"
] | 795,652 | 795,653 | u319625425 | 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.at(i);
int c = 0;
for (int i = 0; i < n - 2; ++i) {
bool c1 = p.at(i) <= p.at(i + 1) && p.at(i + 1) <= p.at(i + 2);
bool c2 = p.at(i + 2) <= p.at(i + 1) && p.at(i ... | #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.at(i);
int c = 0;
for (int i = 0; i < n - 2; ++i) {
bool c1 = p.at(i) <= p.at(i + 1) && p.at(i + 1) <= p.at(i + 2);
bool c2 = p.at(i + 2) <= p.at(i + 1) && p.at(i ... | [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 795,657 | 795,658 | u294683729 | cpp |
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,659 | 795,660 | u688825490 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.