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 |
|---|---|---|---|---|---|---|---|
p02953 | #include <iostream>
using namespace std;
int main() {
long long n, i, f = 0, a[100010], j = 1;
cin >> n;
cin >> a[0];
for (i = 1; i < n; i++) {
long long c;
cin >> c;
if (c != a[j - 1])
a[j++] = c;
}
if (n == 1)
cout << "Yes" << endl;
else if (n == 2 && a[0] - a[1] < 2)
cout <<... | #include <iostream>
using namespace std;
int main() {
long long n, i, f = 0, a[100010], j = 1;
cin >> n;
cin >> a[0];
for (i = 1; i < n; i++) {
long long c;
cin >> c;
if (c != a[j - 1])
a[j++] = c;
}
if (j == 1)
cout << "Yes" << endl;
else if (j == 2 && a[0] - a[1] < 2)
cout <<... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 757,374 | 757,375 | u283026992 | cpp |
p02953 | #include <stdio.h>
int main() {
int N, i, ans = 0;
scanf("%d", &N);
int H[N];
for (i = 0; i < N; i++) {
scanf("%d", &H[i]);
}
for (i = 0; i < N - 1; i++) {
if (H[i] + 1 == H[i + 1]) {
H[i + 1] += 1;
} else if (H[i] > H[i + 1] + 1) {
ans = 1;
}
}
if (ans == 1) {
printf("N... | #include <stdio.h>
int main() {
int N, i, ans = 0;
scanf("%d", &N);
int H[N];
for (i = 0; i < N; i++) {
scanf("%d", &H[i]);
}
for (i = 0; i < N - 1; i++) {
if (H[i] == H[i + 1] + 1) {
H[i + 1] += 1;
} else if (H[i] > H[i + 1] + 1) {
ans = 1;
}
}
if (ans == 1) {
printf("N... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change",
"misc.off_by_one",
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 757,376 | 757,377 | u911952711 | cpp |
p02953 | #include <stdio.h>
int main() {
int N, i, ans = 0;
scanf("%d", &N);
int H[N];
for (i = 0; i < N; i++) {
scanf("%d", &H[i]);
}
for (i = 0; i < N - 1; i++) {
if (H[i] == H[i + 1] + 1) {
H[i + 1] += 1;
} else if (H[i] > H[i + 1] + 1) {
ans = 1;
}
}
if (ans == 1) {
printf("N... | #include <stdio.h>
int main() {
int N, i, ans = 0;
scanf("%d", &N);
int H[N];
for (i = 0; i < N; i++) {
scanf("%d", &H[i]);
}
for (i = 0; i < N - 1; i++) {
if (H[i] == H[i + 1] + 1) {
H[i + 1] += 1;
} else if (H[i] > H[i + 1] + 1) {
ans = 1;
}
}
if (ans == 1) {
printf("N... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 757,378 | 757,377 | u911952711 | cpp |
p02953 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
// freopen("INP.txt", "r", stdin);
// freopen("OUT.txt", "w", stdout);
ll n;
cin >> n;
vector<ll> hold(n);
for (ll i = 0; i < n; i++) {
cin >> hold[i];
}
... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
// freopen("INP.txt", "r", stdin);
// freopen("OUT.txt", "w", stdout);
ll n;
cin >> n;
vector<ll> hold(n);
for (ll i = 0; i < n; i++) {
cin >> hold[i];
}
... | [
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operation.binary.change",
"control_flow.return.add",
"control_flow.return.0.add"
] | 757,379 | 757,380 | u508700891 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int h, H;
cin >> H;
H--;
for (int i = 0; i < N; i++) {
cin >> h;
if (H - h >= 1) {
cout << "No" << endl;
return 0;
;
}
if (h > H)
H = h - 1;
}
cout << "Yes" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int h, H;
cin >> H;
H--;
for (int i = 1; i < N; i++) {
cin >> h;
if (H - h >= 1) {
cout << "No" << endl;
return 0;
;
}
if (h > H)
H = h - 1;
}
cout << "Yes" << endl;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 757,383 | 757,384 | u259672270 | cpp |
p02953 | #include <iostream>
using namespace std;
int main(void) {
int n;
cin >> n;
int h, currentH;
cin >> currentH;
for (int i = 1; i < n; i++) {
cin >> h;
if (currentH - h >= 2) {
cout << "No";
return 0;
} else if (h > currentH) {
currentH = h - 1;
}
}
cout << "Yes";
}
| #include <iostream>
using namespace std;
int main(void) {
int n;
cin >> n;
int h, currentH;
cin >> currentH;
currentH--;
for (int i = 1; i < n; i++) {
cin >> h;
if (currentH - h >= 1) {
cout << "No";
return 0;
}
if (h > currentH) {
currentH = h - 1;
}
}
cout << "Yes... | [
"expression.unary.arithmetic.add",
"literal.number.change",
"control_flow.branch.if.condition.change",
"control_flow.branch.if.replace.add",
"control_flow.branch.else_if.replace.remove"
] | 757,385 | 757,386 | u496279623 | cpp |
p02953 | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int current_val = 0;
int max_val = 0;
int flg = 0;
for (int i = 0; i < N; i++) {
cin >> current_val;
if (max_val <= current_val) {
max_val = current_val;
} else if (max_val - 1 <= current_val) {
max_val = max_val... | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int current_val = 0;
int max_val = 0;
int flg = 0;
for (int i = 0; i < N; i++) {
cin >> current_val;
if (max_val <= current_val) {
max_val = current_val;
} else if (max_val - 1 <= current_val) {
max_val = max_val... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 757,387 | 757,388 | u616025987 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define ff first
#define ss second
#define endl '\n'
#define fast \
ios::sync_with_stdio(false); \
cin.tie(NULL);
///////////////////... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define ff first
#define ss second
#define endl '\n'
#define fast \
ios::sync_with_stdio(false); \
cin.tie(NULL);
///////////////////... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 757,393 | 757,394 | u487128874 | cpp |
p02953 |
#include <bits/stdc++.h>
using namespace std;
/* g++ -g -fsanitize=address -lasan -std=c++11 -Dfoo_ */
/* freopen("input.txt", "rt", stdin); */
/* freopen("output.txt", "wt", stdout); */
#define ALL(c) (c).begin(), (c).end()
#define ALLR(c) (c).rbegin(), (c).rend()
#define FOR(i, a, b) for (int i = (a); i < (b); +... |
#include <bits/stdc++.h>
using namespace std;
/* g++ -g -fsanitize=address -lasan -std=c++11 -Dfoo_ */
/* freopen("input.txt", "rt", stdin); */
/* freopen("output.txt", "wt", stdout); */
#define ALL(c) (c).begin(), (c).end()
#define ALLR(c) (c).rbegin(), (c).rend()
#define FOR(i, a, b) for (int i = (a); i < (b); +... | [] | 757,395 | 757,396 | u668711082 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define zzz \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define zzz \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 757,401 | 757,402 | u608668320 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = 1; i < n; i++) {
if (a[i] > a[i + 1]) {
a[i]--;
}
}
for (int i = 1; i < n; i++) {
if (a[i] > a[i + 1]) {
cout << "NO"... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = 1; i <= n; i++) {
if (a[i] > a[i - 1]) {
a[i]--;
}
}
for (int i = 1; i < n; i++) {
if (a[i] > a[i + 1]) {
cout << "No... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"literal.stri... | 757,405 | 757,404 | u542075673 | cpp |
p02953 | #include <bits/stdc++.h>
#define ll long long
#define speed_up \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define rep(i, a... | #include <bits/stdc++.h>
#define ll long long
#define speed_up \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define rep(i, a... | [
"expression.operation.binary.remove"
] | 757,408 | 757,409 | u223028888 | cpp |
p02953 | #include <bits/stdc++.h>
typedef long long ll;
#define REP(i, a, b) for (int i = a; i < b; i++)
#define IN(n) \
int n; \
cin >> n;
#define ARR(arr, i, n) ... | #include <bits/stdc++.h>
typedef long long ll;
#define REP(i, a, b) for (int i = a; i < b; i++)
#define IN(n) \
int n; \
cin >> n;
#define ARR(arr, i, n) ... | [
"literal.string.change",
"io.output.change",
"literal.number.change",
"assignment.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 757,413 | 757,412 | u447706255 | cpp |
p02953 | #include <iostream>
#include <vector>
using namespace std;
int main(void) {
int n;
int h[100010];
cin >> n;
for (int i = 0; i < n; i++) {
cin >> h[i];
}
int a = 0;
for (int i = 0; i < n - 1; i++) {
if (a > h[i]) {
cout << "No";
return 0;
}
if (a < h[i]) {
h[i]--;
... | #include <iostream>
#include <vector>
using namespace std;
int main(void) {
int n;
int h[100010];
cin >> n;
for (int i = 0; i < n; i++) {
cin >> h[i];
}
int a = 0;
for (int i = 0; i < n; i++) {
if (a > h[i]) {
cout << "No";
return 0;
} else if (a < h[i]) {
h[i]--;
a =... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 757,414 | 757,415 | u817464145 | cpp |
p02953 | #include <iostream>
#include <vector>
using namespace std;
int main(void) {
int n;
int h[100010];
cin >> n;
for (int i = 0; i < n; i++) {
cin >> h[i];
}
int a = 0;
for (int i = 0; i < n - 1; i++) {
if (a > h[i]) {
cout << "No";
}
if (a < h[i]) {
h[i]--;
a = h[i];
}... | #include <iostream>
#include <vector>
using namespace std;
int main(void) {
int n;
int h[100010];
cin >> n;
for (int i = 0; i < n; i++) {
cin >> h[i];
}
int a = 0;
for (int i = 0; i < n; i++) {
if (a > h[i]) {
cout << "No";
return 0;
} else if (a < h[i]) {
h[i]--;
a =... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"control_flow.return.add",
"control_flow.return.0.add",
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 757,416 | 757,415 | u817464145 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> h(n), tmp(n);
for (int i = 0; i < n; i++) {
cin >> h[i];
tmp[i] = h[i];
}
bool flag = true;
for (int i = n; i > 0; ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> h(n), tmp(n);
for (int i = 0; i < n; i++) {
cin >> h[i];
tmp[i] = h[i];
}
bool flag = true;
for (int i = n - 1; i >... | [
"control_flow.loop.for.initializer.change"
] | 757,428 | 757,429 | u525137785 | cpp |
p02953 | #include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define mod 1000000007
#define MAX 1000000000000000
#define all(v) v.begin(), v.end()
#define rep(i, ... | #include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define mod 1000000007
#define MAX 1000000000000000
#define all(v) v.begin(), v.end()
#define rep(i, ... | [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change",
"expression.operation.binary.remove"
] | 757,442 | 757,443 | u794573819 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
int n, h[100010];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &h[i]);
for (int i = n; i > 1; i--)
if (h[i - 1] - h[i] >= 2) {
printf("NO\n");
return 0;
} else if (h[i - 1] - h[i] == 1)
h[i - 1]--;
printf("YES\... | #include <bits/stdc++.h>
using namespace std;
int n, h[100010];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &h[i]);
for (int i = n; i > 1; i--)
if (h[i - 1] - h[i] >= 2) {
printf("No\n");
return 0;
} else if (h[i - 1] - h[i] == 1)
h[i - 1]--;
printf("Yes\... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 757,447 | 757,448 | u829878015 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
// def
#define debug(x) cout << #x << ": " << x << endl
#define out(x) cout << x << endl
#define repeat (i, a, b) for (int i = (a); i < (b); i++)
#define rep (i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
const int M = 1e9 + 7;
const int INF = 1e9;
const i... | #include <bits/stdc++.h>
using namespace std;
// def
#define debug(x) cout << #x << ": " << x << endl
#define out(x) cout << x << endl
#define repeat (i, a, b) for (int i = (a); i < (b); i++)
#define rep (i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
const int M = 1e9 + 7;
const int INF = 1e9;
const i... | [
"call.remove"
] | 757,454 | 757,455 | u765690804 | cpp |
p02953 | #include <iostream>
#include <math.h>
#include <vector>
typedef long long ll;
using namespace std;
ll rem(ll num, ll a) {
while (num >= a) {
num -= a;
}
return num;
}
bool maxima(int index, int n, vector<int> &v) {
int a = 0;
int b = 2147483647;
if (index - 1 > 0) {
a = v[index - 1];
}
if (ind... | #include <iostream>
#include <math.h>
#include <vector>
typedef long long ll;
using namespace std;
ll rem(ll num, ll a) {
while (num >= a) {
num -= a;
}
return num;
}
bool maxima(int index, int n, vector<int> &v) {
int a = 0;
int b = 2147483647;
if (index - 1 > 0) {
a = v[index - 1];
}
if (ind... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 757,461 | 757,462 | u327949948 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
#ifdef _IS_LOCAL //
#define dout cout
#define debug() if (true)
#define dvout(v) vout(v)
#else
#define dout \
if (false) \
cout
#define de... | #include <bits/stdc++.h>
using namespace std;
#ifdef _IS_LOCAL //
#define dout cout
#define debug() if (true)
#define dvout(v) vout(v)
#else
#define dout \
if (false) \
cout
#define de... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 757,471 | 757,472 | u111937495 | cpp |
p02953 | // https://atcoder.jp/contests/abc136/tasks/abc136_c
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
#define EPS (1e-9)
#define INF (1e9)
#define INFL (1e18)
#define MOD (1000000007)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define R... | // https://atcoder.jp/contests/abc136/tasks/abc136_c
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
#define EPS (1e-9)
#define INF (1e9)
#define INFL (1e18)
#define MOD (1000000007)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define R... | [
"expression.operation.binary.add"
] | 757,479 | 757,480 | u858107870 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
#define rep for (int i = 0; i < n; i++)
const int MOD = 1000000007;
int main() {
int n;
cin >> n;
int a[n];
rep { cin >> a[i]; }
string frag = "Yes";
for (int i = n - 1; i > 0; i--) {
if (a[i - 1] - a[i] == 1)
a[i] -= 1;
else if (a[i - 1] - a[i] ... | #include <bits/stdc++.h>
using namespace std;
#define rep for (int i = 0; i < n; i++)
const int MOD = 1000000007;
int main() {
int n;
cin >> n;
int a[n];
rep { cin >> a[i]; }
string frag = "Yes";
for (int i = n - 1; i > 0; i--) {
if (a[i - 1] - a[i] == 1)
a[i - 1] -= 1;
else if (a[i - 1] - a... | [
"assignment.change"
] | 757,485 | 757,486 | u974214237 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
#define rep for (int i = 0; i < n; i++)
const int MOD = 1000000007;
int main() {
int n;
cin >> n;
int a[n];
rep { cin >> a[i]; }
string frag = "Yes";
for (int i = n - 1; i > 0; i++) {
if (a[i - 1] - a[i] == 1)
a[i] -= 1;
else if (a[i - 1] - a[i] ... | #include <bits/stdc++.h>
using namespace std;
#define rep for (int i = 0; i < n; i++)
const int MOD = 1000000007;
int main() {
int n;
cin >> n;
int a[n];
rep { cin >> a[i]; }
string frag = "Yes";
for (int i = n - 1; i > 0; i--) {
if (a[i - 1] - a[i] == 1)
a[i - 1] -= 1;
else if (a[i - 1] - a... | [
"assignment.change"
] | 757,487 | 757,486 | u974214237 | cpp |
p02953 | #include <iostream>
#include <vector>
using namespace std;
int main() {
long long N;
cin >> N;
vector<long long> v(N);
for (long long i = 0; i < N; i++) {
cin >> v[i];
}
bool frag = true;
for (long long i = N - 1; i >= 0; i--) {
if ((v[i - 1] - v[i]) >= 2) {
frag = false;
break;
... | #include <iostream>
#include <vector>
using namespace std;
int main() {
long long N;
cin >> N;
vector<long long> v(N);
for (long long i = 0; i < N; i++) {
cin >> v[i];
}
bool frag = true;
for (long long i = N - 1; i > 0; i--) {
if ((v[i - 1] - v[i]) >= 2) {
frag = false;
break;
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 757,506 | 757,507 | u652609504 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
int a[N];
main() {
int n;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
for (int i = n - 1; i >= 1; i--) {
if (a[i] < a[i - 1]) {
if (a[i - 1] - a[i] > 1) {
printf("NO\n");
return 0;... | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
int a[N];
main() {
int n;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
for (int i = n - 1; i >= 1; i--) {
if (a[i] < a[i - 1]) {
if (a[i - 1] - a[i] > 1) {
printf("No\n");
return 0;... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 757,508 | 757,509 | u284539389 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> H(N);
for (int i = 0; i < N; ++i) {
cin >> H.at(i);
}
bool flg = true;
int minN = INT_MAX;
for (int i = N - 1; i > 0; --i) {
minN = min(minN, H.at(i));
if (H.at(i) > H.at(i - 1)) {
continue;
}... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> H(N);
for (int i = 0; i < N; ++i) {
cin >> H.at(i);
}
bool flg = true;
int minN = INT_MAX;
for (int i = N - 1; i > 0; --i) {
minN = min(minN, H.at(i));
if (H.at(i) >= H.at(i - 1)) {
continue;
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 757,518 | 757,519 | u920340928 | cpp |
p02953 | #include <stdio.h>
#define N 100001
int main(void) {
int i, n, judge = 1;
long long int h[N];
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%lld", &h[i]);
for (i = 1; i < n; i++) {
if (h[i] > h[i - 1])
h[i]--;
else if (h[i] < h[i - 1]) {
judge = 0;
break;
}
}
print... | #include <stdio.h>
#define N 100001
int main(void) {
int i, n, judge = 1;
long long int h[N];
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%lld", &h[i]);
for (i = 1; i < n; i++) {
if (h[i] > h[i - 1])
h[i]--;
else if (h[i] < h[i - 1]) {
judge = 0;
break;
}
}
print... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 757,522 | 757,523 | u391667116 | cpp |
p02953 | #include <stdio.h>
#define N 100001
int main(void) {
int i, n, judge = 1;
long long int h[N];
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%lld", &h[i]);
for (i = 0; i < n; i++) {
if (h[i] > h[i - 1])
h[i]--;
else if (h[i] < h[i - 1]) {
judge = 0;
break;
}
}
print... | #include <stdio.h>
#define N 100001
int main(void) {
int i, n, judge = 1;
long long int h[N];
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%lld", &h[i]);
for (i = 1; i < n; i++) {
if (h[i] > h[i - 1])
h[i]--;
else if (h[i] < h[i - 1]) {
judge = 0;
break;
}
}
print... | [
"literal.number.change",
"assignment.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 757,524 | 757,523 | u391667116 | cpp |
p02953 | #include <stdio.h>
#define N 100001
int main(void) {
int i, n, judge = 1;
long long int h[N];
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%lld", &h[i]);
for (i = 0; i < n; i++) {
if (h[i] > h[i - 1])
h[i - 1]--;
else if (h[i] < h[i - 1]) {
judge = 0;
break;
}
}
p... | #include <stdio.h>
#define N 100001
int main(void) {
int i, n, judge = 1;
long long int h[N];
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%lld", &h[i]);
for (i = 1; i < n; i++) {
if (h[i] > h[i - 1])
h[i]--;
else if (h[i] < h[i - 1]) {
judge = 0;
break;
}
}
print... | [
"literal.number.change",
"assignment.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operation.binary.remove",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 757,525 | 757,523 | u391667116 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vec(N);
int ans = 0;
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
for (int i = 0; i < N - 1; i++) {
if (vec.at(i) > vec.at(i + 1) + 1) {
ans = 1;
} else if (vec.at(i) > vec.at(i + 1)) {
ve... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vec(N);
int ans = 0;
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
for (int i = 0; i < N - 1; i++) {
if (vec.at(i) > vec.at(i + 1) + 1) {
ans = 1;
} else if (vec.at(i) > vec.at(i + 1)) {
ve... | [
"assignment.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 757,534 | 757,535 | u105533331 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
long long int a[n];
int f = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int x = a[n - 1];
for (int i = n - 2; i >= 0; i--) {
if (a[i] <= a[i - 1])
x = a[i];
else {
if (a[i] - x > 1)
f = 1;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
long long int a[n];
int f = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int x = a[n - 1];
for (int i = n - 2; i >= 0; i--) {
if (a[i] <= x)
x = a[i];
else {
if (a[i] - x > 1)
f = 1;
}
}
... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 757,538 | 757,537 | u148049084 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++)
cin >> arr[i];
int able = 1;
arr[0]--;
for (int i = 1; i < n; i++) {
if (arr[i] > arr[i - 1])
arr[i]--;
}
for (int i = 0; i < n - 1; i++) {
if (arr[i] - arr[i + 1] < 0... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++)
cin >> arr[i];
int able = 1;
arr[0]--;
for (int i = 1; i < n; i++) {
if (arr[i] > arr[i - 1])
arr[i]--;
}
for (int i = 0; i < n - 1; i++) {
if (arr[i] - arr[i + 1] > 0... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 757,541 | 757,542 | u222252114 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
#include <math.h>
int main() {
int N, i;
// cout << "debug" << endl;
cin >> N;
vector<long> vec(N + 1);
vec.at(0) = 0;
for (i = 1; i < N + 1; i++) {
cin >> vec.at(i);
}
// cout << "N= " << N << endl;
//右から順にみて、1より大きく高いならアウト
for (i = N; i > 0; i--)... | #include <bits/stdc++.h>
using namespace std;
#include <math.h>
int main() {
int N, i;
// cout << "debug" << endl;
cin >> N;
vector<long> vec(N + 1);
vec.at(0) = 0;
for (i = 1; i < N + 1; i++) {
cin >> vec.at(i);
}
// cout << "N= " << N << endl;
//右から順にみて、1より大きく高いならアウト
for (i = N; i > 0; i--)... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 757,549 | 757,550 | u844703694 | cpp |
p02953 | #include <stdio.h>
#include <vector>
using namespace std;
int main() {
int N;
scanf("%d", &N);
vector<int> A(N);
for (int i = 0; i < N; i++) {
scanf("%d", &A.at(i));
}
bool flg = true;
int i = N - 2;
while (i >= 0) {
/// printf("%d\n",A.at(i)-A.at(i+1) );
if (A.at(i) - A.at(i + 1) == 1) {... | #include <stdio.h>
#include <vector>
using namespace std;
int main() {
int N;
scanf("%d", &N);
vector<int> A(N);
for (int i = 0; i < N; i++) {
scanf("%d", &A.at(i));
}
bool flg = true;
int i = N - 2;
while (i >= 0) {
if (A.at(i) - A.at(i + 1) == 1) {
A.at(i) = A.at(i) - 1;
} else if... | [] | 757,553 | 757,554 | u161168905 | cpp |
p02953 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
const ll mod = 1e9 + 7;
int main() {
int N;
cin >> N;
vll H(N);
for (int i = 0; i < N; i++) ... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
const ll mod = 1e9 + 7;
int main() {
int N;
cin >> N;
vll H(N);
for (int i = 0; i < N; i++) ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 757,558 | 757,559 | u420528322 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
int m = 0, minn, maxn;
while (m < n) {
scanf("%d", &a[m++]);
}
minn = a[0], maxn = a[0];
for (int i = 0; i < n - 1; i++) {
if (a[i] - a[i + 1] == 2) {
printf("No\n");
return 0;
} else if (a[i] ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
int m = 0, minn, maxn;
while (m < n) {
scanf("%d", &a[m++]);
}
minn = a[0], maxn = a[0];
for (int i = 0; i < n - 1; i++) {
if (a[i] - a[i + 1] >= 2) {
printf("No\n");
return 0;
} else if (a[i] ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 757,570 | 757,571 | u333991119 | cpp |
p02953 | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <iomanip>
#include <iostream> // cout, endl, cin
#include <limits>
#include <map> // map
... | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <iomanip>
#include <iostream> // cout, endl, cin
#include <limits>
#include <map> // map
... | [
"control_flow.branch.if.replace.add",
"control_flow.branch.else_if.replace.remove"
] | 757,572 | 757,573 | u913104858 | cpp |
p02953 | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <iomanip>
#include <iostream> // cout, endl, cin
#include <limits>
#include <map> // map
... | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <iomanip>
#include <iostream> // cout, endl, cin
#include <limits>
#include <map> // map
... | [
"control_flow.branch.if.replace.add",
"control_flow.branch.else_if.replace.remove"
] | 757,574 | 757,573 | u913104858 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
int main() {
size_t N;
cin >> N;
vector<int> H(N, 0);
for (int i = 0; i < N; ++i) {
cin >> H[i];
}
int Ha = H[N - 1];
bool is_d = true;
for (int i = N - 2; i >= 0; --i) {
if (H[i] > Ha + 1) {
is_d = false;
break;
} else if (H[i]... | #include <bits/stdc++.h>
using namespace std;
int main() {
size_t N;
cin >> N;
vector<int> H(N, 0);
for (int i = 0; i < N; ++i) {
cin >> H[i];
}
int Ha = H[N - 1];
bool is_d = true;
for (int i = N - 2; i >= 0; --i) {
if (H[i] > Ha + 1) {
is_d = false;
break;
} else if (H[i]... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 757,587 | 757,588 | u898714404 | cpp |
p02953 | #include <bits/stdc++.h>
typedef long long int64;
int main() {
int64 n;
scanf("%lld", &n);
int64 *h = new int64[n];
for (int i = 0; i < n; i++) {
scanf("%lld", &h[i]);
}
if (h[0] > 0)
h[0] -= 1;
int64 max = h[0];
int no = 0;
for (int i = 1; i < n; i++) {
if (h[i] > max) {
h[i] -... | #include <bits/stdc++.h>
typedef long long int64;
int main() {
int64 n;
scanf("%lld", &n);
int64 *h = new int64[n];
for (int i = 0; i < n; i++) {
scanf("%lld", &h[i]);
}
if (h[0] > 0)
h[0] -= 1;
int64 max = h[0];
int no = 0;
for (int i = 1; i < n; i++) {
if (h[i] > max) {
h[i] -... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 757,598 | 757,599 | u220152525 | cpp |
p02953 | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef vector<vector<pair<int, int>>> vvp;
typedef vector<pair<int, int>> vp;
typedef vector<vector<int>> vvi;
typedef vector<int> vi;
typedef vector<vector<ll>> vvl;
typedef vector<ll> vl;
typedef vector<vector<bool>> vvb;
typedef vector<bool> vb;
ty... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef vector<vector<pair<int, int>>> vvp;
typedef vector<pair<int, int>> vp;
typedef vector<vector<int>> vvi;
typedef vector<int> vi;
typedef vector<vector<ll>> vvl;
typedef vector<ll> vl;
typedef vector<vector<bool>> vvb;
typedef vector<bool> vb;
ty... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 757,611 | 757,612 | u902151549 | cpp |
p02953 | #include <iostream>
#include <vector>
using namespace std;
int main(int argc, const char *argv[]) {
uint64_t N;
cin >> N;
vector<uint64_t> H;
for (uint64_t i = 0; i < N; i++) {
uint64_t tmp;
cin >> tmp;
H.push_back(tmp);
}
bool ans = true;
uint64_t max = H[0];
if (N > 1) {
for (uint64... | #include <iostream>
#include <vector>
using namespace std;
int main(int argc, const char *argv[]) {
uint64_t N;
cin >> N;
vector<uint64_t> H;
for (uint64_t i = 0; i < N; i++) {
uint64_t tmp;
cin >> tmp;
H.push_back(tmp);
}
bool ans = true;
uint64_t max = H[0];
if (N > 1) {
for (uint64... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 757,620 | 757,621 | u307752464 | cpp |
p02953 | #include "bits/stdc++.h"
using namespace std;
int N;
vector<int> H;
int main() {
string answer = "yes";
cin >> N;
for (int i = 0; i < N; i++) {
int tmp;
cin >> tmp;
H.emplace_back(tmp);
}
H[0] -= 1;
for (int i = 1; i < N; i++) {
if (H[i] - H[i - 1] == 0)
continue;
else if (H[i] -... | #include "bits/stdc++.h"
using namespace std;
int N;
vector<int> H;
int main() {
string answer = "Yes";
cin >> N;
for (int i = 0; i < N; i++) {
int tmp;
cin >> tmp;
H.emplace_back(tmp);
}
H[0] -= 1;
for (int i = 1; i < N; i++) {
if (H[i] - H[i - 1] == 0)
continue;
else if (H[i] -... | [
"literal.string.change",
"literal.string.case.change",
"variable_declaration.value.change",
"assignment.value.change"
] | 757,624 | 757,625 | u436976004 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> h(n);
for (int i = 0; i < n; ++i) {
cin >> h[i];
}
for (int i = n; i > 0; --i) {
if (h[i] < h[i - 1])
h[i - 1]--;
}
bool is_valid = true;
for (int i = 0; i < n - 1; ++i) {
if (h[i + 1] < h[i])
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> h(n);
for (int i = 0; i < n; ++i) {
cin >> h[i];
}
for (int i = n - 1; i > 0; --i) {
if (h[i] < h[i - 1])
h[i - 1]--;
}
bool is_valid = true;
for (int i = 0; i < n - 1; ++i) {
if (h[i + 1] < h[... | [
"control_flow.loop.for.initializer.change"
] | 757,632 | 757,633 | u559765551 | cpp |
p02953 | #define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
int main() {
int N, i, ans = 0;
bool flag = 0;
int H[100000] = {0};
scanf("%d", &N);
for (i = 0; i < N; i++) {
scanf("%d", H + i);
}
for (i = 1; i < N; i++) {
if (H[i - 1] < H[i]) {
H[i]--;
} else if (H[i - 1] != H[i]) {
flag = 1;... | #define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
int main() {
int N, i, ans = 0;
bool flag = 0;
int H[100000] = {0};
scanf("%d", &N);
for (i = 0; i < N; i++) {
scanf("%d", H + i);
}
for (i = 1; i < N; i++) {
if (H[i - 1] < H[i]) {
H[i]--;
} else if (H[i - 1] != H[i]) {
flag = 1;... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 757,638 | 757,639 | u424405505 | cpp |
p02953 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
const long long mod = 1e9 + 7;
int main() {
int n, ans = 1;
cin >> n;
int h[n];
rep(i, n) cin >> h[i];
for... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
const long long mod = 1e9 + 7;
int main() {
int n, ans = 1;
cin >> n;
int h[n];
rep(i, n) cin >> h[i];
for... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 757,640 | 757,641 | u969617556 | cpp |
p02953 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <queue>
#include <string>
using namespace std;
typedef long long ll;
int gcd(int a, int b) {
int t;
while (b > 0) {
t = b;
b = a % b;
a = t;
}
return a;
}
int lcm(int a, int b) { return a * b / gcd(a, b); }
int m... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <queue>
#include <string>
using namespace std;
typedef long long ll;
int gcd(int a, int b) {
int t;
while (b > 0) {
t = b;
b = a % b;
a = t;
}
return a;
}
int lcm(int a, int b) { return a * b / gcd(a, b); }
int m... | [
"control_flow.break.remove",
"control_flow.return.add",
"function.return_value.change"
] | 757,650 | 757,651 | u953532675 | cpp |
p02953 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int n, H[100009];
int i, j, max;
bool flag;
cin >> n;
for (i = 1; i <= n; i++) {
cin >> H[i];
}
if (n == 1)
cout << "yes" << endl;
else {
max = H[1];
flag = true;
for (i = 2; i <= n; i++) {
if (H[i] ... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int n, H[100009];
int i, j, max;
bool flag;
cin >> n;
for (i = 1; i <= n; i++) {
cin >> H[i];
}
if (n == 1) {
cout << "Yes" << endl;
} else {
max = H[1];
flag = true;
for (i = 2; i <= n; i++) {
if (H... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 757,652 | 757,653 | u477710819 | cpp |
p02953 | // code by PARTH_4399 for competitive programming
#include <bits/stdc++.h>
using namespace std;
#define l long // -2^31 to +2^31-1 (upper limit ~ 2*(10^9))
#define ul unsigned long // 0 to +2^32-1
#define ll long long // -2^63 to +2^63-1 (upper limit ~ 9*(10^18))
#define ull unsigned lon... | // code by PARTH_4399 for competitive programming
#include <bits/stdc++.h>
using namespace std;
#define l long // -2^31 to +2^31-1 (upper limit ~ 2*(10^9))
#define ul unsigned long // 0 to +2^32-1
#define ll long long // -2^63 to +2^63-1 (upper limit ~ 9*(10^18))
#define ull unsigned lon... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 757,656 | 757,655 | u053309694 | cpp |
p02953 | #include <iostream>
using namespace std;
int main() {
int n, ans = 0;
cin >> n;
int *a = new int[n];
bool *used = new bool[n];
fill(used, used + n, 0);
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < n - 1; i++) {
if (a[i] > a[i + 1]) {
if (!used[i]) {
used[i] = 1;
... | #include <iostream>
using namespace std;
int main() {
int n, ans = 0;
cin >> n;
int *a = new int[n];
bool *used = new bool[n];
fill(used, used + n, 0);
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < n - 1; i++) {
if (a[i] > a[i + 1]) {
if (!used[i]) {
used[i] = 1;
... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 757,660 | 757,661 | u704687987 | cpp |
p02953 | #include <iostream>
using namespace std;
int n;
int a[10000];
int main() {
cin >> n;
for (int i = 0; i < n; ++i)
cin >> a[i];
bool flag = false;
for (int j = 0; j < n; ++j) {
if (a[j] - a[j - 1] < 0) {
flag = true;
break;
} else if (j == 0) {
} else if (a[j] - a[j - 1] > 0) {
... | #include <iostream>
using namespace std;
int n;
int a[100000];
int main() {
cin >> n;
for (int i = 0; i < n; ++i)
cin >> a[i];
bool flag = false;
for (int j = 0; j < n; ++j) {
if (a[j] - a[j - 1] < 0) {
flag = true;
break;
} else if (j == 0) {
} else if (a[j] - a[j - 1] > 0) {
... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"literal.string.change",
"io.output.change"
] | 757,662 | 757,663 | u326647750 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
const int m = 100000 + 5;
int a[m];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
int f = 1;
for (int i = n - 1; i > 0; i--) {
if (a[i] < a[i - 1]) {
if (a[i - 1] - a[i] == 1)
a[i - 1] = a[i - 1] - 1;
else {
... | #include <bits/stdc++.h>
using namespace std;
const int m = 100000 + 5;
int a[m];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
int f = 1;
for (int i = n - 1; i > 0; i--) {
if (a[i] < a[i - 1]) {
if (a[i - 1] - a[i] == 1)
a[i - 1] = a[i - 1] - 1;
else {
... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 757,665 | 757,666 | u744950774 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
#define MAX 100000
int h[MAX];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++)
cin >> h[i];
string ans = "Yes";
for (int i = 0; i < n - 1; i++) {
if (h[i] >= h[i + 1]) {
h[i]--;
}
}
for (int i = 0; i < n - 1; i++) {
if (h[i]... | #include <bits/stdc++.h>
using namespace std;
#define MAX 100000
int h[MAX];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++)
cin >> h[i];
string ans = "Yes";
for (int i = 0; i < n - 1; i++) {
if (h[i] < h[i + 1]) {
h[i + 1]--;
}
}
// for(int i=0;i<n;i++)cout<<h[i]<<endl;
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 757,667 | 757,668 | u055447809 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, a[100000];
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
a[0]--;
if (n == 1) {
cout << "Yes";
return 0;
}
for (int i = 0; i < n - 1; i++) {
if (a[i] > a[i + 1]) {
cout << "No";
return 0;
}
if (... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, a[100000];
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
a[0]--;
if (n == 1) {
cout << "Yes";
return 0;
}
for (int i = 0; i < n - 1; i++) {
if (a[i] > a[i + 1]) {
cout << "No";
return 0;
}
if (... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 757,670 | 757,671 | u118789292 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, a[100000];
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
a[0]--;
if (n == 1) {
cout << "Yes";
return 0;
}
for (int i = 0; i < n - 1; i++) {
if (a[i] > a[i + 1]) {
cout << "NO";
return 0;
}
if (... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, a[100000];
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
a[0]--;
if (n == 1) {
cout << "Yes";
return 0;
}
for (int i = 0; i < n - 1; i++) {
if (a[i] > a[i + 1]) {
cout << "No";
return 0;
}
if (... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 757,672 | 757,671 | u118789292 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
// C++14 (GCC 5.4.1)
#define LLINF (1LL << 60)
typedef long long ll;
#define mod 1000000007
#define repd(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) repd(i, 0, n)
#define rrepd(i, a, b) for (int i = (a); i >= (b); i--)
template <typename T> inline bool ch... | #include <bits/stdc++.h>
using namespace std;
// C++14 (GCC 5.4.1)
#define LLINF (1LL << 60)
typedef long long ll;
#define mod 1000000007
#define repd(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) repd(i, 0, n)
#define rrepd(i, a, b) for (int i = (a); i >= (b); i--)
template <typename T> inline bool ch... | [
"literal.string.change",
"io.output.change"
] | 757,690 | 757,691 | u216459554 | cpp |
p02953 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <stdio.h>
#include <string.h>
#include <vector>
using namespace std;
int A[100010];
int main() {
int i, n;
cin >> n;
for (i = 1; i <= n; i++)
cin >> A[i];
for (i = n - 1; i; i--) {
if (A[i] > A[i + 1] + 1) {
cout <<... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <stdio.h>
#include <string.h>
#include <vector>
using namespace std;
int A[100010];
int main() {
int i, n;
cin >> n;
for (i = 1; i <= n; i++)
cin >> A[i];
for (i = n - 1; i; i--) {
if (A[i] > A[i + 1] + 1) {
cout <<... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 757,717 | 757,718 | u950345492 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, flag;
int *h;
cin >> n;
h = new int[n];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
if (n == 1) {
cout << "Yes" << endl;
} else {
flag = 0;
for (int i = (n - 1); i > 0 && flag != 1; i--) {
if (h[i - 1] > h[i]) ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, flag;
int *h;
cin >> n;
h = new int[n];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
if (n == 1) {
cout << "Yes" << endl;
} else {
flag = 0;
for (int i = (n - 1); i > 0 && flag != 1; i--) {
if (h[i - 1] > h[i]) ... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 757,719 | 757,720 | u779636842 | cpp |
p02953 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int t = 0, n, a;
bool flag = 0;
bool flag1 = 0;
cin >> n;
while (n--) {
cin >> a;
if (a > t) {
t = a;
flag1 = 0;
} else if (a == t)
t = a;
else if (a == t - 1) {
if (flag1) {
flag = 1;
... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int t = 0, n, a;
bool flag = 0;
bool flag1 = 0;
cin >> n;
while (n--) {
cin >> a;
if (a > t) {
t = a;
flag1 = 0;
} else if (a == t)
t = a;
else if (a == t - 1) {
if (flag1) {
flag = 1;
... | [
"expression.operation.binary.remove"
] | 757,737 | 757,738 | u451010951 | cpp |
p02953 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, max = 0;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < n; i++) {
if (a[i] < max) {
cout << "No" << endl;
return 0;
}
if (a[i] >= a[i++]) {
a[i]--;
... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, max = 0;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < n; i++) {
if (a[i] < max) {
cout << "No" << endl;
return 0;
}
if (a[i] >= a[i + 1]) {
a[i]--;
... | [
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 757,761 | 757,762 | u323966851 | cpp |
p02953 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
bool answer = true;
cin >> N;
vector<long long> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
long long b = -1;
for (int i = 0; i < N - 1; i++) {
long long a = 0;
a = vec.at(i +... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
bool answer = true;
cin >> N;
vector<long long> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
long long b = -1;
for (int i = 0; i < N - 1; i++) {
long long a = 0;
a = vec.at(i +... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 757,764 | 757,765 | u641446860 | cpp |
p02953 | #include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int N, temp;
int arr[100001];
scanf("%d", &N);
for (temp = 1; temp <= N; temp++) {
scanf(" %d", &arr[temp]);
}
for (temp = N; temp > 1; temp--) {
if (arr[temp] < arr[temp - 1]) {
arr[temp - 1] -= 1;
}
}
for (te... | #include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int N, temp;
int arr[100001];
scanf("%d", &N);
for (temp = 1; temp <= N; temp++) {
scanf(" %d", &arr[temp]);
}
for (temp = N; temp > 1; temp--) {
if (arr[temp] < arr[temp - 1]) {
arr[temp - 1] -= 1;
}
}
for (te... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 757,768 | 757,769 | u096338524 | cpp |
p02953 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, border = 0, H[100000], Highest = 0;
cin >> N;
for (int i = 0; i < N - 2; i++) {
cin >> H[i];
}
for (int i = 0; i < N; i++) {
if (H[i + 1] - H[i] > 1 && border < H[i + 1]) {
border = H[i + 1] - 1;
}
if (H[i] ... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, border = 0, H[100000], Highest = 0;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> H[i];
}
for (int i = 0; i < N - 2; i++) {
if (H[i + 1] - H[i] > 1 && border < H[i + 1]) {
border = H[i + 1] - 1;
}
if (H[i] ... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 757,776 | 757,777 | u534015096 | cpp |
p02953 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, border = 0, H[100000], Highest = 0;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> H[i];
}
for (int i = 0; i < N; i++) {
if (H[i + 1] - H[i] > 1 && border < H[i + 1]) {
border = H[i + 1] - 1;
}
if (H[i] > Hi... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, border = 0, H[100000], Highest = 0;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> H[i];
}
for (int i = 0; i < N - 2; i++) {
if (H[i + 1] - H[i] > 1 && border < H[i + 1]) {
border = H[i + 1] - 1;
}
if (H[i] ... | [
"control_flow.loop.for.condition.change"
] | 757,778 | 757,777 | u534015096 | cpp |
p02953 | #include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long... | #include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 757,781 | 757,782 | u716566635 | cpp |
p02953 | #include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long... | #include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change",
"expression.operator.compare.change"
] | 757,783 | 757,782 | u716566635 | cpp |
p02953 | #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 ... | [
"expression.operation.binary.add"
] | 757,784 | 757,785 | u971256474 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, H = 0, Flag = 0;
cin >> N;
vector<int> V(N);
for (int i = 0; i < N; ++i) {
cin >> V.at(i);
}
for (int i = 0; i < N - 1; ++i) {
if (V.at(i) - V.at(i + 1) > 1) {
Flag = 1;
break;
} else if (V.at(i) - V.at(i + 1) == 1) ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, H = 0, Flag = 0;
cin >> N;
vector<int> V(N);
for (int i = 0; i < N; ++i) {
cin >> V.at(i);
}
for (int i = 0; i < N - 1; ++i) {
if (V.at(i) - V.at(i + 1) > 1) {
Flag = 1;
break;
} else if (V.at(i) - V.at(i + 1) == 1) ... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 757,798 | 757,799 | u770964565 | cpp |
p02953 | #include <bits/stdc++.h>
#include <chrono>
#pragma GCC optimize("Ofast")
using namespace std;
using namespace chrono;
#define all(a) a.begin(), a.end()
#define sz(x) (int(x.size()))
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<in... | #include <bits/stdc++.h>
#include <chrono>
#pragma GCC optimize("Ofast")
using namespace std;
using namespace chrono;
#define all(a) a.begin(), a.end()
#define sz(x) (int(x.size()))
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<in... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 757,805 | 757,806 | u158297468 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define pb push_back
#define mp make_pair
#define mod 1000000007
const int N = 100005;
const int inf = 1e18;
int pow(int a, int b) {
int res = 1;
while (b > 0) {
if (b & 1) {
res = res * a;
}
a = a * a;
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define pb push_back
#define mp make_pair
#define mod 1000000007
const int N = 100005;
const int inf = 1e18;
int pow(int a, int b) {
int res = 1;
while (b > 0) {
if (b & 1) {
res = res * a;
}
a = a * a;
... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 757,807 | 757,808 | u859774897 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define ALL(a) a.begin(), a.end()
ll dx[4] = {0, 1, 0, -1};
ll dy[4] = {1, 0, -1, 0};
const ll INF = 1e14;
const ll MOD = 1e9 + 7;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
// input
l... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define ALL(a) a.begin(), a.end()
ll dx[4] = {0, 1, 0, -1};
ll dy[4] = {1, 0, -1, 0};
const ll INF = 1e14;
const ll MOD = 1e9 + 7;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
// input
l... | [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 757,809 | 757,810 | u946090308 | cpp |
p02953 | #include "bits/stdc++.h"
typedef long long ll;
#define int ll
#define fi first
#define se second
#define SORT(a) sort(a.begin(), a.end())
#define rep(i, n) for (int i = 0; i < (n); i++)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define MP(a, b) make_pair(a, b)
#define pb(a) push_back(a)
#define INF LLONG_MAX / 2... | #include "bits/stdc++.h"
typedef long long ll;
#define int ll
#define fi first
#define se second
#define SORT(a) sort(a.begin(), a.end())
#define rep(i, n) for (int i = 0; i < (n); i++)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define MP(a, b) make_pair(a, b)
#define pb(a) push_back(a)
#define INF LLONG_MAX / 2... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 757,816 | 757,817 | u548768105 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
a[0]--;
for (int i = 1; i < n - 1; i++) {
if (a[i] =... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
a[0]--;
for (int i = 1; i < n - 1; i++) {
if (a[i] =... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 757,818 | 757,819 | u825143564 | cpp |
p02953 | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <string>
using namespace std;
inline int read() {
int res = 0, fh = 1;
char ch = getchar();
while ((ch > '9' || ch < '0') && ch != '-')
ch = getchar();
if (ch == '-')
fh = -1, ch ... | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <string>
using namespace std;
inline int read() {
int res = 0, fh = 1;
char ch = getchar();
while ((ch > '9' || ch < '0') && ch != '-')
ch = getchar();
if (ch == '-')
fh = -1, ch ... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"function.return_value.change",
"io.output.change"
] | 757,820 | 757,821 | u970579664 | cpp |
p02953 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <limits>
#include <numeric>
#include <string>
#include <vector>
#define rep(i, x, n) for (int i = x; i < n; i++)
using namespace std;
const long long INF = 1LL << 60;
long long GCD(long long a, long long b) {
if (b == 0)
return a;
else
ret... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <limits>
#include <numeric>
#include <string>
#include <vector>
#define rep(i, x, n) for (int i = x; i < n; i++)
using namespace std;
const long long INF = 1LL << 60;
long long GCD(long long a, long long b) {
if (b == 0)
return a;
else
ret... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 757,824 | 757,825 | u183971632 | cpp |
p02953 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
#define pb push_back
#define mp make_p... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
#define pb push_back
#define mp make_p... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change",
"misc.off_by_one"
] | 757,829 | 757,830 | u459548136 | cpp |
p02953 | /***************************************************************
File name: C.cpp
Author: ljfcnyali
Create time: 2019年08月04日 星期日 19时58分04秒
***************************************************************/
#include <bits/stdc++.h>
using namespace std;
#define REP(i, a, b) for (int i = (a), _end_... | /***************************************************************
File name: C.cpp
Author: ljfcnyali
Create time: 2019年08月04日 星期日 19时58分04秒
***************************************************************/
#include <bits/stdc++.h>
using namespace std;
#define REP(i, a, b) for (int i = (a), _end_... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 757,831 | 757,832 | u192982222 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
#define int long long
bool cd(int n) {
int c = 0;
while (n) {
n /= 10;
c++;
}
return c & 1;
}
int32_t main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
a[0]--;
for (int i = 1; i < n; i++) {
if (a[i] == ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
bool cd(int n) {
int c = 0;
while (n) {
n /= 10;
c++;
}
return c & 1;
}
int32_t main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
a[0]--;
for (int i = 1; i < n; i++) {
if (a[i] == ... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 757,835 | 757,836 | u781762706 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
#define fastio() \
ios_base::sync_with_stdio(0); \
cin.tie(0); ... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
#define fastio() \
ios_base::sync_with_stdio(0); \
cin.tie(0); ... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 757,837 | 757,838 | u908436921 | cpp |
p02953 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int curr;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
if (i == 0)
curr = x - 1;
else {
if (x > curr)
curr = x - 1;
else if (x == curr)
;
else {
cout << "NO";
return 0... | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int curr;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
if (i == 0)
curr = x - 1;
else {
if (x > curr)
curr = x - 1;
else if (x == curr)
;
else {
cout << "No";
return 0... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 757,848 | 757,849 | u339979795 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
int n, a[100010] = {0};
int main() {
cin >> n;
int f = 0;
for (int i = 1; i <= n; i++) {
scanf("%d", a + i);
if (a[i] < a[i - 1])
a[i]++;
if (a[i] < a[i - 1])
f = 1;
}
if (f)
cout << "NO";
else
cout << "YES";
} | #include <bits/stdc++.h>
using namespace std;
int n, a[100010] = {0};
int main() {
cin >> n;
int f = 0;
for (int i = 1; i <= n; i++) {
scanf("%d", a + i);
if (a[i] < a[i - 1])
a[i]++;
if (a[i] < a[i - 1])
f = 1;
}
if (f)
cout << "No";
else
cout << "Yes";
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 757,854 | 757,855 | u709966987 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define fi first
#define se second
const ll MOD = 1000000007;
int main() {
int n;
scanf("%d", &n);
vector<int> h(n);
for (int &i : h)
scanf("%d", &i);
for (int i = 1; i < n; ++i) {
if (h[i] > h[i - 1])
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define fi first
#define se second
const ll MOD = 1000000007;
int main() {
int n;
scanf("%d", &n);
vector<int> h(n);
for (int &i : h)
scanf("%d", &i);
for (int i = 1; i < n; ++i) {
if (h[i] > h[i - 1])
... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 757,856 | 757,857 | u843954136 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e5 + 5;
int n;
int h[N];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n;
for (int i = 1; i <= n; i++)
cin >> h[i];
h[0] = h[1];
for (int i = 1; i <= n; i++) {
if (h[i] > h[i - 1])
h[i]--;
els... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e5 + 5;
int n;
int h[N];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n;
for (int i = 1; i <= n; i++)
cin >> h[i];
h[0] = h[1];
for (int i = 1; i <= n; i++) {
if (h[i] > h[i - 1])
h[i]--;
els... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 757,858 | 757,859 | u651116403 | cpp |
p02953 | #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;
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("O3")
#pragma GCC optimize("O2")
#pragma GCC optimize("Ofast")
#prag... | #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;
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("O3")
#pragma GCC optimize("O2")
#pragma GCC optimize("Ofast")
#prag... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 757,866 | 757,867 | u777824330 | cpp |
p02953 | #include <iostream>
#define max(a, b) (a) > (b) ? (a) : (b);
using namespace std;
const int MAXN = 1e5 + 10;
int H[MAXN] = {0}, N, ans = 0, l = -1, r = -1;
int main() {
cin >> N;
for (int i = 0; i < N; i++)
cin >> H[i];
for (int i = 1; i < N; i++) {
if (H[i] <= H[i - 1]) {
if (l == -1) {
l ... | #include <iostream>
#define max(a, b) (a) > (b) ? (a) : (b);
using namespace std;
const int MAXN = 1e5 + 10;
int H[MAXN] = {0}, N, ans = 0, l = -1, r = -1;
int main() {
cin >> N;
for (int i = 0; i < N; i++)
cin >> H[i];
for (int i = 1; i < N; i++) {
if (H[i] <= H[i - 1]) {
if (l == -1) {
l ... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 757,868 | 757,869 | u592284018 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
// for(int i = 0; i < n; i++)
int main() {
int n, x = 1;
cin >> n;
vector<long> h(n);
for (int i = 0; i < n; i++) {
cin >> h.at(i);
if (i != 0 && h.at(i) > h.at(i - 1) || i == 0)
h.at(i)--;
if (i != 0 && h.at(i) < h.at(i - 1))
x = 0;
}
i... | #include <bits/stdc++.h>
using namespace std;
// for(int i = 0; i < n; i++)
int main() {
int n, x = 1;
cin >> n;
vector<long> h(n);
for (int i = 0; i < n; i++) {
cin >> h.at(i);
if (i != 0 && h.at(i) > h.at(i - 1) || i == 0)
h.at(i)--;
if (i != 0 && h.at(i) < h.at(i - 1))
x = 0;
}
i... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 757,871 | 757,872 | u743438759 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
// for(int i = 0; i < n; i++)
int main() {
int n, x = 1;
cin >> n;
vector<int> h(n);
for (int i = 0; i < n; i++) {
cin >> h.at(i);
if (i != 0 && h.at(i) > h.at(i - 1) || i == 0)
h.at(i)--;
if (i != 0 && h.at(i) < h.at(i - 1))
x = 0;
}
if... | #include <bits/stdc++.h>
using namespace std;
// for(int i = 0; i < n; i++)
int main() {
int n, x = 1;
cin >> n;
vector<long> h(n);
for (int i = 0; i < n; i++) {
cin >> h.at(i);
if (i != 0 && h.at(i) > h.at(i - 1) || i == 0)
h.at(i)--;
if (i != 0 && h.at(i) < h.at(i - 1))
x = 0;
}
i... | [
"variable_declaration.type.primitive.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 757,873 | 757,872 | u743438759 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
vector<long> H(N);
for (int n = 0; n < N; n++) {
cin >> H[n];
}
bool can = true;
long max_high = 0;
for (int n = 0; n < N; n++) {
if (max_high - H[n] >= 2) {
can = f... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
vector<long> H(N);
for (int n = 0; n < N; n++) {
cin >> H[n];
}
bool can = true;
long max_high = 0;
for (int n = 0; n < N; n++) {
if (max_high - H[n] >= 2) {
can = f... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 757,879 | 757,880 | u518623219 | cpp |
p02953 | #include <iostream>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
int h[n];
for (int i = n - 1; i >= 0; i--) {
cin >> h[n];
}
for (int i = 0; i < n - 1; i++) {
if (h[i] >= h[i + 1]) {
continue;
} else if (h[i] + 1 == h[i + 1]) {
h[i + 1]--;
continue;
... | #include <iostream>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
int h[n];
for (int i = n - 1; i >= 0; i--) {
cin >> h[i];
}
for (int i = 0; i < n - 1; i++) {
if (h[i] >= h[i + 1]) {
continue;
} else if (h[i] + 1 == h[i + 1]) {
h[i + 1]--;
continue;
... | [
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 757,881 | 757,882 | u504407856 | cpp |
p02953 | #include <iostream>
using namespace std;
int main(void) {
int n, h[100000];
bool flg = true;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> h[i];
}
for (int i = n - 2; i >= 0; i--) {
if (h[i] > h[i - 1]) {
h[i]--;
}
if (h[i] > h[i - 1]) {
flg = false;
}
}
if (flg)
put... | #include <iostream>
using namespace std;
int main(void) {
int n, h[100000];
bool flg = true;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> h[i];
}
for (int i = n - 2; i >= 0; i--) {
if (h[i] > h[i + 1]) {
h[i]--;
}
if (h[i] > h[i + 1]) {
flg = false;
}
}
if (flg)
put... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 757,884 | 757,885 | u024809932 | cpp |
p02953 | #include <bits/stdc++.h>
#define re register
#define rep(i, a, b) for (re int i = a, i##end = b; i <= i##end; i++)
#define drep(i, a, b) for (re int i = a, i##end = b; i >= i##end; i--)
#define repp(i, a, b) for (re int i = a, i##end = b; i < i##end; i++)
#define drepp(i, a, b) for (re int i = a, i##end = b; i > i##end... | #include <bits/stdc++.h>
#define re register
#define rep(i, a, b) for (re int i = a, i##end = b; i <= i##end; i++)
#define drep(i, a, b) for (re int i = a, i##end = b; i >= i##end; i--)
#define repp(i, a, b) for (re int i = a, i##end = b; i < i##end; i++)
#define drepp(i, a, b) for (re int i = a, i##end = b; i > i##end... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 757,888 | 757,889 | u941446746 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main(void) {
int N;
cin >> N;
vector<int> H(N);
rep(i, N) cin >> H[i];
if (N == 1) {
cout << "yes" << endl;
return 0;
}
rep(i, N - 1) {
if (H[i] > H[i + 1]) {
H[i + 1]++;
}
if (H... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main(void) {
int N;
cin >> N;
vector<int> H(N);
rep(i, N) cin >> H[i];
if (N == 1) {
cout << "Yes" << endl;
return 0;
}
rep(i, N - 1) {
if (H[i] > H[i + 1]) {
H[i + 1]++;
}
if (H... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 757,895 | 757,896 | u285043842 | cpp |
p02953 | #include <bits/stdc++.h>
#define int long long
using namespace std;
int32_t main() {
int N, i, o = 0;
cin >> N;
int H[N];
for (i = 0; i < N; i++)
cin >> H[i];
for (i = 0; i < N - 1; i++) {
if (H[i] - H[i + 1] > 1) {
cout << "No\n";
break;
} else if (H[i + 1] > H[i]) {
H[i]--;
... | #include <bits/stdc++.h>
#define int long long
using namespace std;
int32_t main() {
int N, i, o = 0;
cin >> N;
int H[N];
for (i = 0; i < N; i++)
cin >> H[i];
for (i = 0; i < N - 1; i++) {
if (H[i] - H[i + 1] > 0) {
cout << "No\n";
break;
} else if (H[i + 1] > H[i]) {
H[i + 1]--;... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 757,897 | 757,898 | u909375072 | cpp |
p02953 | // Author :: ABHINAV3010 ::
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define fast ios_base::sync_with_stdio(false)
typedef long long ll;
typedef pair<ll, ll> p;
ll mod = 1000000007;
ll gcd(ll a, ll b) { return (b == 0) ? a : gcd(b, a % b); }
int main() {
... | // Author :: ABHINAV3010 ::
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define fast ios_base::sync_with_stdio(false)
typedef long long ll;
typedef pair<ll, ll> p;
ll mod = 1000000007;
ll gcd(ll a, ll b) { return (b == 0) ? a : gcd(b, a % b); }
int main() {
... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 757,904 | 757,905 | u071109514 | cpp |
p02953 | #include <algorithm>
#include <cstdio>
#include <cstring>
void Unused(...) {}
#ifndef DEBUG
#define echo(...) Unused(__VA_ARGS__)
#else
#define echo(...) fprintf(stderr, __VA_ARGS__)
#endif
const int MaxN = int(1e5) + 7;
int n;
int main() {
scanf("%d", &n);
int nowmax = 0;
for (int i = 0; i < n; ++i) {
int... | #include <algorithm>
#include <cstdio>
#include <cstring>
void Unused(...) {}
#ifndef DEBUG
#define echo(...) Unused(__VA_ARGS__)
#else
#define echo(...) fprintf(stderr, __VA_ARGS__)
#endif
const int MaxN = int(1e5) + 7;
int n;
int main() {
scanf("%d", &n);
int nowmax = 0;
for (int i = 0; i < n; ++i) {
int... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 757,906 | 757,907 | u905333381 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll md = 1e9 + 7;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
ll n;
cin >> n;
vector<ll> a(n);
for (ll i = 0; i < n; i++) {
cin >> a[i];
}
vector<ll> suf(n);
ll ci = n - 1;
for (ll i = n - 2; i >= 0; i--) {
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll md = 1e9 + 7;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
ll n;
cin >> n;
vector<ll> a(n);
for (ll i = 0; i < n; i++) {
cin >> a[i];
}
vector<ll> suf(n);
ll ci = n - 1;
for (ll i = n - 2; i >= 0; i--) {
... | [
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 757,908 | 757,909 | u770383589 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
int n, m;
int i, j, k;
char s[1000000];
cin >> n;
if (n == 1) {
cout << "Yes";
return 0;
}
for (i = 0; i < n; i++) {
cin >> s[i];
}
for (i = 0; i < n - 1; i++) {
if (s[i] > s[i + 1]) {
int t = i;
whil... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
int n, m;
int i, j, k;
int s[1000000];
cin >> n;
if (n == 1) {
cout << "Yes";
return 0;
}
for (i = 0; i < n; i++) {
cin >> s[i];
}
for (i = 0; i < n - 1; i++) {
if (s[i] > s[i + 1]) {
int t = i;
while... | [
"variable_declaration.type.primitive.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 757,920 | 757,921 | u241345538 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
int n, m;
int i, j, k;
char s[1000000];
cin >> n;
if (n == 1) {
cout << "Yes";
return 0;
}
for (i = 0; i < n; i++) {
cin >> s[i];
}
for (i = 0; i < n - 1; i++) {
if (s[i] > s[i + 1]) {
int t = i;
whil... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
int n, m;
int i, j, k;
int s[1000000];
cin >> n;
if (n == 1) {
cout << "Yes";
return 0;
}
for (i = 0; i < n; i++) {
cin >> s[i];
}
for (i = 0; i < n - 1; i++) {
if (s[i] > s[i + 1]) {
int t = i;
while... | [
"variable_declaration.type.primitive.change"
] | 757,922 | 757,921 | u241345538 | cpp |
p02953 | #include <algorithm>
#include <cstdio>
using namespace std;
int n, h[100001];
bool vis[100001];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &h[i]);
for (int i = 1; i < n; i++) {
if (h[i - 1] < h[i] && h[i] >= h[i + 1])
h[i]--;
if (h[i] > h[i + 1]) {
puts("NO");
... | #include <algorithm>
#include <cstdio>
using namespace std;
int n, h[100001];
bool vis[100001];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &h[i]);
for (int i = 1; i < n; i++) {
if (h[i - 1] < h[i] && h[i] >= h[i + 1])
h[i]--;
if (h[i] > h[i + 1]) {
puts("No");
... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 757,923 | 757,924 | u095403512 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.