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 <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int H[N];
for (int i = 0; i < N; i++) {
cin >> H[i];
}
bool ans = true;
for (int i = 1; i < N; i++) {
if (H[i - 1] == H[i]) {
continue;
}
if (H[i - 1] + 1 == H[i]) {
H[i]--;
} else {
ans = fa... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int H[N];
for (int i = 0; i < N; i++) {
cin >> H[i];
}
bool ans = true;
for (int i = 1; i < N; i++) {
if (H[i - 1] == H[i]) {
continue;
}
if (H[i - 1] < H[i]) {
H[i]--;
} else {
ans = false;
... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 756,859 | 756,860 | u275786410 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m = 0;
string ans = "Yes";
vector<int> c(n);
for (int i = 0; i < n; i++) {
cin >> c[i];
if (m - c[i] >= 2) {
cout << "No";
return 0;
}
m = max(m, c[i]);
}
cout << ans;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m = 0;
cin >> n;
string ans = "Yes";
vector<int> c(n);
for (int i = 0; i < n; i++) {
cin >> c[i];
if (m - c[i] >= 2) {
cout << "No";
return 0;
}
m = max(m, c[i]);
}
cout << ans;
}
| [] | 756,861 | 756,862 | u885523920 | cpp |
p02953 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> H(n, 0);
for (int i = 0; i < n; i++) {
cin >> H[i];
}
for (int i = n - 2; i >= 0; i--) {
if (H[i] == H[i + 1]) {
continue;
}
if (H[i] == H[i + 1] + 1) {
H[i] -= 1;
continue... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> H(n, 0);
for (int i = 0; i < n; i++) {
cin >> H[i];
}
for (int i = n - 2; i >= 0; i--) {
if (H[i] <= H[i + 1]) {
continue;
}
if (H[i] == H[i + 1] + 1) {
H[i] -= 1;
continue... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 756,872 | 756,873 | u231230182 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, flag = 1, s;
cin >> n;
vector<int> v;
for (int i = 0; i < n; i++) {
cin >> a;
v.push_back(a);
}
for (int i = 0; i < n - 1; i++) {
if (v[i] >= v[i + 1]) {
if (v[i] - v[i + 1] > 1) {
cout << "Nohel" << endl;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, flag = 1, s;
cin >> n;
vector<int> v;
for (int i = 0; i < n; i++) {
cin >> a;
v.push_back(a);
}
for (int i = 0; i < n - 1; i++) {
if (v[i] >= v[i + 1]) {
if (v[i] - v[i + 1] > 1) {
cout << "No" << endl;
... | [
"literal.string.change",
"io.output.change"
] | 756,881 | 756,882 | u674491576 | cpp |
p02953 | //
// main.cpp
// qtSubstitute
//
// Created by Happy on 17/09/18.
// Copyright © 2018 Mayank Yadav. All rights reserved.
//
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
int data[N];
for (int i = 0; i < N; i++) {
cin >> data[N];
}
bool b = true;
for (i... | //
// main.cpp
// qtSubstitute
//
// Created by Happy on 17/09/18.
// Copyright © 2018 Mayank Yadav. All rights reserved.
//
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
int data[N];
for (int i = 0; i < N; i++) {
cin >> data[i];
}
bool b = true;
for (i... | [
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"io.output.newline.add"
] | 756,883 | 756,884 | u403563240 | cpp |
p02953 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <utility>
#include <vector>
typedef long long ll;
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
const... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <utility>
#include <vector>
typedef long long ll;
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
const... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 756,888 | 756,889 | u339558464 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef string st;
typedef vector<int> vi;
typedef vector<st> vs;
#define rep(i, n) for (int i = 0; i < n; i++)
#define fogg(i, a, b) for (int i = (a); i <= (b); i++)
#define ford(i, a, b) for (int i = (a); i >= (b); i--)
#define test ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef string st;
typedef vector<int> vi;
typedef vector<st> vs;
#define rep(i, n) for (int i = 0; i < n; i++)
#define fogg(i, a, b) for (int i = (a); i <= (b); i++)
#define ford(i, a, b) for (int i = (a); i >= (b); i--)
#define test ... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 756,892 | 756,893 | u391494739 | cpp |
p02953 | #include <bits/stdc++.h>
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define ll long long
#define pii std:... | #include <bits/stdc++.h>
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define ll long long
#define pii std:... | [
"literal.string.change",
"literal.string.case.change",
"function.return_value.change",
"expression.operation.binary.change",
"io.output.change"
] | 756,902 | 756,903 | u752814744 | cpp |
p02953 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
long long n;
long long a[500000];
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n;
for (int i = 0; i < n; i+... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
long long n;
long long a[500000];
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n;
for (int i = 0; i < n; i+... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 756,927 | 756,928 | u798339690 | cpp |
p02953 | #include <algorithm>
#include <iostream>
using namespace std;
int i[114514];
int main() {
int a, b, c, d = 0, e;
cin >> a >> i[0];
for (int n = 1; n < a; n++) {
cin >> i[n];
if (i[n] > i[n - 1])
i[n]--;
if (i[n - 1] > i[n])
d++;
}
if (d > 0)
cout << "NO\n";
else
cout << "YES\... | #include <algorithm>
#include <iostream>
using namespace std;
int i[114514];
int main() {
int a, b, c, d = 0, e;
cin >> a >> i[0];
for (int n = 1; n < a; n++) {
cin >> i[n];
if (i[n] > i[n - 1])
i[n]--;
if (i[n - 1] > i[n])
d++;
}
if (d > 0)
cout << "No\n";
else
cout << "Yes\... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 756,929 | 756,930 | u699392591 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, memo = 0;
cin >> n;
vector<int> h(n);
vector<int> j(n);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
int num = h[n - 1];
for (int i = n - 1; i < 0; i--) {
if (h[i] - 1 > num) {
cout << "No" << endl;
return 0;
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, memo = 0;
cin >> n;
vector<int> h(n);
vector<int> j(n);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
int num = h[n - 1];
for (int i = n - 1; i >= 0; i--) {
if (h[i] - 1 > num) {
cout << "No" << endl;
return 0;
}
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 756,933 | 756,934 | u735909278 | cpp |
p02953 | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(a, b) for (int a = 0; a < (b); ++a)
#define REP1(i, n) for (int i = 1; i <= (n); ++i)
#define debug(x) cerr << #x << ": " << x << '\n'
#define all(x) (x).begin(), (x).end()
#def... | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(a, b) for (int a = 0; a < (b); ++a)
#define REP1(i, n) for (int i = 1; i <= (n); ++i)
#define debug(x) cerr << #x << ": " << x << '\n'
#define all(x) (x).begin(), (x).end()
#def... | [
"expression.operation.binary.add"
] | 756,935 | 756,936 | u311671153 | cpp |
p02953 | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(a, b) for (int a = 0; a < (b); ++a)
#define REP1(i, n) for (int i = 1; i <= (n); ++i)
#define debug(x) cerr << #x << ": " << x << '\n'
#define all(x) (x).begin(), (x).end()
#def... | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(a, b) for (int a = 0; a < (b); ++a)
#define REP1(i, n) for (int i = 1; i <= (n); ++i)
#define debug(x) cerr << #x << ": " << x << '\n'
#define all(x) (x).begin(), (x).end()
#def... | [
"expression.operation.binary.add"
] | 756,937 | 756,936 | u311671153 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
// 総数を1000000007で割った余り
const long long mod = 1e9 + 7;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define ull unsigned long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define vc vector<char>
#define vs vector<... | #include <bits/stdc++.h>
using namespace std;
// 総数を1000000007で割った余り
const long long mod = 1e9 + 7;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define ull unsigned long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define vc vector<char>
#define vs vector<... | [
"expression.operation.binary.add"
] | 756,938 | 756,939 | u766205979 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
// 総数を1000000007で割った余り
const long long mod = 1e9 + 7;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define ull unsigned long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define vc vector<char>
#define vs vector<... | #include <bits/stdc++.h>
using namespace std;
// 総数を1000000007で割った余り
const long long mod = 1e9 + 7;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define ull unsigned long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define vc vector<char>
#define vs vector<... | [
"expression.operation.binary.add"
] | 756,948 | 756,949 | u766205979 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
// 総数を1000000007で割った余り
const long long mod = 1e9 + 7;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define ull unsigned long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define vc vector<char>
#define vs vector<... | #include <bits/stdc++.h>
using namespace std;
// 総数を1000000007で割った余り
const long long mod = 1e9 + 7;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define ull unsigned long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define vc vector<char>
#define vs vector<... | [] | 756,951 | 756,952 | u766205979 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
int check(int A[], int N) {
for (int i = 0; i < N - 2; i++) {
if (A[i] > A[i + 1])
return 0;
}
return 1;
}
int main() {
int N;
cin >> N;
int H[N];
for (int i = 0; i < N; i++) {
cin >> H[i];
H[i] -= 1;
}
for (int i = 0; i < N - 2; i++) ... | #include <bits/stdc++.h>
using namespace std;
int check(int A[], int N) {
for (int i = 0; i < N - 1; i++) {
if (A[i] > A[i + 1])
return 0;
}
return 1;
}
int main() {
int N;
cin >> N;
int H[N];
for (int i = 0; i < N; i++) {
cin >> H[i];
H[i] -= 1;
}
for (int i = 0; i < N - 1; i++) ... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 756,964 | 756,965 | u270825463 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
int check(int A[], int N) {
for (int i = 0; i < N - 2; i++) {
if (A[i] < A[i + 1])
return 0;
}
return 1;
}
int main() {
int N;
cin >> N;
int H[N];
for (int i = 0; i < N; i++) {
cin >> H[i];
H[i] -= 1;
}
for (int i = 0; i < N - 2; i++) ... | #include <bits/stdc++.h>
using namespace std;
int check(int A[], int N) {
for (int i = 0; i < N - 1; i++) {
if (A[i] > A[i + 1])
return 0;
}
return 1;
}
int main() {
int N;
cin >> N;
int H[N];
for (int i = 0; i < N; i++) {
cin >> H[i];
H[i] -= 1;
}
for (int i = 0; i < N - 1; i++) ... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 756,966 | 756,965 | u270825463 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
int check(int A[], int N) {
for (int i = 0; i < N - 2; i++) {
if (A[i] < A[i + 1])
return 0;
}
return 1;
}
int main() {
int N;
cin >> N;
int H[N];
for (int i = 0; i < N; i++) {
cin >> H[i];
H[i] -= 1;
}
for (int i = 0; i < N - 2; i++) ... | #include <bits/stdc++.h>
using namespace std;
int check(int A[], int N) {
for (int i = 0; i < N - 1; i++) {
if (A[i] > A[i + 1])
return 0;
}
return 1;
}
int main() {
int N;
cin >> N;
int H[N];
for (int i = 0; i < N; i++) {
cin >> H[i];
H[i] -= 1;
}
for (int i = 0; i < N - 1; i++) ... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 756,967 | 756,965 | u270825463 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
int check(int A[], int N) {
for (int i = 0; i < N - 2; i++) {
if (A[i] < A[i + 1])
return 0;
}
return 1;
}
int main() {
int N;
cin >> N;
int H[N];
for (int i = 0; i < N; i++) {
cin >> H[i];
H[i] -= 1;
}
for (int i = 0; i < N - 2; i++) ... | #include <bits/stdc++.h>
using namespace std;
int check(int A[], int N) {
for (int i = 0; i < N - 1; i++) {
if (A[i] > A[i + 1])
return 0;
}
return 1;
}
int main() {
int N;
cin >> N;
int H[N];
for (int i = 0; i < N; i++) {
cin >> H[i];
H[i] -= 1;
}
for (int i = 0; i < N - 1; i++) ... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 756,968 | 756,965 | u270825463 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
int check(int A[], int N) {
for (int i = 0; i < N - 2; i++) {
if (A[i] < A[i + 1])
return 0;
}
return 1;
}
int main() {
int N;
cin >> N;
int H[N];
for (int i = 0; i < N; i++) {
cin >> H[i];
H[i] -= 1;
}
for (int i = 0; i < N - 2; i++) ... | #include <bits/stdc++.h>
using namespace std;
int check(int A[], int N) {
for (int i = 0; i < N - 1; i++) {
if (A[i] > A[i + 1])
return 0;
}
return 1;
}
int main() {
int N;
cin >> N;
int H[N];
for (int i = 0; i < N; i++) {
cin >> H[i];
H[i] -= 1;
}
for (int i = 0; i < N - 1; i++) ... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 756,969 | 756,965 | u270825463 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
int check(int A[], int N) {
for (int i = 0; i < N - 2; i++) {
if (A[i] < A[i + 1])
return 0;
}
return 1;
}
int main() {
int N;
cin >> N;
int H[N];
for (int i = 0; i < N; i++) {
cin >> H[i];
H[i] -= 1;
}
for (int i = 0; i < N - 2; i++) ... | #include <bits/stdc++.h>
using namespace std;
int check(int A[], int N) {
for (int i = 0; i < N - 1; i++) {
if (A[i] > A[i + 1])
return 0;
}
return 1;
}
int main() {
int N;
cin >> N;
int H[N];
for (int i = 0; i < N; i++) {
cin >> H[i];
H[i] -= 1;
}
for (int i = 0; i < N - 1; i++) ... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 756,970 | 756,965 | u270825463 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repback(i, n, k) for (int i = int(n); i >= (int)(k); --i)
typedef long long ll;
int main() {
int n, m;
cin >> n;
vector<int> h(n); //配列
for (int i = 0; i < n; i++) {
cin >> h[i];
}
for (int i = 0... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repback(i, n, k) for (int i = int(n); i >= (int)(k); --i)
typedef long long ll;
int main() {
int n, m;
cin >> n;
vector<int> h(n); //配列
for (int i = 0; i < n; i++) {
cin >> h[i];
}
for (int i = 0... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 756,971 | 756,972 | u453500284 | 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 > 1; i--) {
if (H[i - 1] > H[i] + 1) {
cout << "No" << endl;
return 0;
}
if (H[i - 1] == H[i] + 1) {
H[i - 1]--;
... | #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 - 1] > H[i] + 1) {
cout << "No" << endl;
return 0;
}
if (H[i - 1] == H[i] + 1) {
H[i - 1]--;... | [
"control_flow.loop.for.initializer.change",
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 756,973 | 756,974 | u510383220 | cpp |
p02953 | //#pragma GCC optimize("Ofast")
//#pragma GCC optimize ("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma warning(disable : 4786)
#pragma warning(disable : 4996)
#include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <... | //#pragma GCC optimize("Ofast")
//#pragma GCC optimize ("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma warning(disable : 4786)
#pragma warning(disable : 4996)
#include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <... | [
"control_flow.continue.add"
] | 756,978 | 756,979 | u484505863 | cpp |
p02953 | #include <bits/stdc++.h>
#include <stdint.h>
#define ii pair<int, int>
#define mp make_pair
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define int long long int
using namespace std;
int32_t main() {
int n, x;
cin >> n;
int c = 0;
for (int i = 0; i < n; i++) {
cin >> x;
if (x < c) {
... | #include <bits/stdc++.h>
#include <stdint.h>
#define ii pair<int, int>
#define mp make_pair
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define int long long int
using namespace std;
int32_t main() {
int n, x;
cin >> n;
int c = 0;
for (int i = 0; i < n; i++) {
cin >> x;
if (x < c) {
... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 756,982 | 756,983 | u894807349 | cpp |
p02953 | #include <bits/stdc++.h>
#include <stdint.h>
#define ii pair<int, int>
#define mp make_pair
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define int long long int
using namespace std;
int32_t main() {
int n, x;
cin >> n;
int c = 0;
for (int i = 0; i < n; i++) {
cin >> x;
if (x < c) {
... | #include <bits/stdc++.h>
#include <stdint.h>
#define ii pair<int, int>
#define mp make_pair
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define int long long int
using namespace std;
int32_t main() {
int n, x;
cin >> n;
int c = 0;
for (int i = 0; i < n; i++) {
cin >> x;
if (x < c) {
... | [
"literal.string.change",
"io.output.change"
] | 756,984 | 756,983 | u894807349 | cpp |
p02953 | /*
Converted from Scratch by scratch2cpp
(https://github.com/yos1up/scratch2cpp).
*/
#include <algorithm>
#include <iostream>
#include <math.h>
#include <stdlib.h>
#include <string>
#include <vector>
#define debug \
cerr << "--" << __LINE__ << "-... | /*
Converted from Scratch by scratch2cpp
(https://github.com/yos1up/scratch2cpp).
*/
#include <algorithm>
#include <iostream>
#include <math.h>
#include <stdlib.h>
#include <string>
#include <vector>
#define debug \
cerr << "--" << __LINE__ << "-... | [] | 756,985 | 756,986 | u917972976 | cpp |
p02953 | #define sp ' '
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int a, b, i, ans, max;
cin >> a;
ans = 0;
max = 0;
for (i = 1; i <= a; i++) {
cin >> b;
if (max - b > 1) {
ans = -1;
}
if (b >= max) {
max = b;
}
}
if (ans == 0) {
cout << "... | #define sp ' '
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int a, b, i, ans, max;
cin >> a;
ans = 0;
max = 0;
for (i = 1; i <= a; i++) {
cin >> b;
if (max - b > 1) {
ans = -1;
}
if (b >= max) {
max = b;
}
}
if (ans == 0) {
cout << "... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 756,989 | 756,990 | u293317519 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N;
cin >> N;
vector<ll> H(N);
for (int i = 0; i < N; i++)
cin >> H[i];
for (int i = 0; i < N; i++) {
if (i == 0)
H[i]--;
else if (H[i] - H[i - 1] >= 1)
H[i]--;
if (H[i - 1] > H[i]) {
cout <... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N;
cin >> N;
vector<ll> H(N);
for (int i = 0; i < N; i++)
cin >> H[i];
for (int i = 0; i < N; i++) {
if (i == 0)
H[i]--;
else if (H[i] - H[i - 1] >= 1)
H[i]--;
if (i != 0 && H[i - 1] > H[i]) {
... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 756,999 | 757,000 | u839397805 | cpp |
p02953 |
#include <iomanip>
#include <iomanip>
#include <iostream>
#include <math.h>
using namespace std;
void C();
bool subC(int *, int);
int main() { C(); }
void C() {
int N;
cin >> N;
int *H = new int[N];
for (int i = 0; i < N; i++)
cin >> H[i];
if (subC(H, N))
cout << "yes" << endl;
else
cout <<... |
#include <iomanip>
#include <iomanip>
#include <iostream>
#include <math.h>
using namespace std;
void C();
bool subC(int *, int);
int main() { C(); }
void C() {
int N;
cin >> N;
int *H = new int[N];
for (int i = 0; i < N; i++)
cin >> H[i];
if (subC(H, N))
cout << "Yes" << endl;
else
cout <<... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 757,001 | 757,002 | u882535643 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define fs first
#define fst first
#define sc second
#define snd second
#define sz(X) (int)(X).size()
#define forn(i, n) for (int i = 0; i < int(n); i++)
#define fornr(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define forab(i, a... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define fs first
#define fst first
#define sc second
#define snd second
#define sz(X) (int)(X).size()
#define forn(i, n) for (int i = 0; i < int(n); i++)
#define fornr(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define forab(i, a... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 757,003 | 757,004 | u711540245 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, d = 1;
cin >> n;
int h[n];
for (int i = 0; i < n; i++)
cin >> h[i];
for (int i = n - 1; i > 0; i--) {
if (h[i] + 1 == h[i - 1])
h[i - 1]--;
else if (h[i] + 1 < h[i - 1])
d = 0;
}
if (d)
cout << "YES" << endl;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, d = 1;
cin >> n;
int h[n];
for (int i = 0; i < n; i++)
cin >> h[i];
for (int i = n - 1; i > 0; i--) {
if (h[i] + 1 == h[i - 1])
h[i - 1]--;
else if (h[i] + 1 < h[i - 1])
d = 0;
}
if (d)
cout << "Yes" << endl;
... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 757,005 | 757,006 | u397130503 | cpp |
p02953 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <stack>
#include <vector>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
const int MOD = 1000000007;
int main() {
int N;
cin >> N;
int maxn, curr;
cin >> maxn;
for (int i = 1; i < N; i++) {
cin >> cu... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <stack>
#include <vector>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
const int MOD = 1000000007;
int main() {
int N;
cin >> N;
int maxn, curr;
cin >> maxn;
for (int i = 1; i < N; i++) {
cin >> cu... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"expression.operation.unary.arithmetic.remove"
] | 757,010 | 757,011 | u554988565 | cpp |
p02953 | #include <algorithm>
#include <bits/stdc++.h>
#include <map>
#include <string>
#include <unordered_map>
typedef long long int ll;
using namespace std;
#define MAXN 10001
#define MOD 1000000007
#define X first
#define Y second
ll t, n, i, j;
int main() {
cin >> n;
vector<ll> v(n);
for (i = 0; i < n; i++)
cin >... | #include <algorithm>
#include <bits/stdc++.h>
#include <map>
#include <string>
#include <unordered_map>
typedef long long int ll;
using namespace std;
#define MAXN 10001
#define MOD 1000000007
#define X first
#define Y second
ll t, n, i, j;
int main() {
cin >> n;
vector<ll> v(n);
for (i = 0; i < n; i++)
cin >... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 757,018 | 757,019 | u929156598 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
#define db "knapsack"
#define fi first
#define se second
#define endl '\n'
const int INF = 1e9 + 1;
const int maxN = 1e5 + 2;
const int mod = 1e9 + 7;
typedef long long ll;
ty... | #include <bits/stdc++.h>
using namespace std;
#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
#define db "knapsack"
#define fi first
#define se second
#define endl '\n'
const int INF = 1e9 + 1;
const int maxN = 1e5 + 2;
const int mod = 1e9 + 7;
typedef long long ll;
ty... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 757,023 | 757,024 | u162854028 | cpp |
p02953 | /* ###########################
# Author : Pranay Garg #
# College : SGSITS #
###########################
*/
#include <bits/stdc++.h>
#define ll long long int
#define ironman \
ios_base::sync_with_stdio(false); ... | /* ###########################
# Author : Pranay Garg #
# College : SGSITS #
###########################
*/
#include <bits/stdc++.h>
#define ll long long int
#define ironman \
ios_base::sync_with_stdio(false); ... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 757,029 | 757,030 | u374444191 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
const int INF = 1e9;
int main() {
int n;
cin >> n;
int h[n];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
--h[0];
bool can = true;
for (int i = 1; i < n; i++) {
if (h[i - 1] < h[i])
--h[i];
el... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
const int INF = 1e9;
int main() {
int n;
cin >> n;
int h[n];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
--h[0];
bool can = true;
for (int i = 1; i < n; i++) {
if (h[i - 1] < h[i])
--h[i];
el... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 757,033 | 757,034 | u708258059 | cpp |
p02953 | #include <bits/stdc++.h>
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define endl "\n"
#define rep(i, n) ... | #include <bits/stdc++.h>
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define endl "\n"
#define rep(i, n) ... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 757,035 | 757,036 | u216772548 | cpp |
p02953 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> H;
while (N--) {
int h;
cin >> h;
H.push_back(h);
}
bool valid = true;
for (int i = H.size() - 1; i > 0; i--) {
int ldiff = H[i] - H[i - 1];
if (ldiff == -1) {
H[i]--;
} els... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> H;
while (N--) {
int h;
cin >> h;
H.push_back(h);
}
bool valid = true;
for (int i = H.size() - 1; i > 0; i--) {
int ldiff = H[i] - H[i - 1];
if (ldiff == -1) {
H[i - 1]--;
}... | [
"expression.operation.binary.add"
] | 757,037 | 757,038 | u074372598 | cpp |
p02953 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <tuple>
#include <vector>
typedef long long LL;
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
LL N;
cin >> N;
vector<LL> H(N);
rep(i, N) { cin >> H[i]; }
bool noflag = false;
for (int i ... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <tuple>
#include <vector>
typedef long long LL;
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
LL N;
cin >> N;
vector<LL> H(N);
rep(i, N) { cin >> H[i]; }
bool noflag = false;
for (int i ... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 757,039 | 757,040 | u758765597 | cpp |
p02953 | #include <iostream>
#include <vector>
using namespace std;
int solve(int N, std::vector<unsigned long long> &H) {
if (N == 1) {
return 0;
}
for (int i = N - 2; i >= 0; --i) {
if (H[i] > H[i + 1]) {
if (H[i] - H[i - 1] > 1) {
return -1;
} else {
H[i]--;
}
}
}
ret... | #include <iostream>
#include <vector>
using namespace std;
int solve(int N, std::vector<unsigned long long> &H) {
if (N == 1) {
return 0;
}
for (int i = N - 2; i >= 0; --i) {
if (H[i] > H[i + 1]) {
if (H[i] - H[i + 1] > 1) {
return -1;
} else {
H[i]--;
}
}
}
ret... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 757,043 | 757,044 | u463950771 | cpp |
p02953 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<int> data(N);
rep(i, N) { cin >> data.at(i); }
ll low = (ll)data.at(0);
for (int i = 1; i < N; i++) {
if (low < (ll)data.at(i)) {
if (low > (ll)(... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<int> data(N);
rep(i, N) { cin >> data.at(i); }
ll low = (ll)data.at(0);
for (int i = 1; i < N; i++) {
if (low < (ll)data.at(i)) {
if (low > (ll)(... | [
"assignment.change"
] | 757,051 | 757,052 | u728628785 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string ans = "Yes";
vector<int> h(n);
cin >> h.at(0);
for (int i = 1; i < n; i++) {
cin >> h.at(i);
if (h.at(i) == h.at(i - 1)) {
continue;
} else if (h.at(i) - 1 == h.at(i - 1)) {
h.at(i) += 1;
} else ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string ans = "Yes";
vector<int> h(n);
cin >> h.at(0);
for (int i = 1; i < n; i++) {
cin >> h.at(i);
if (h.at(i) == h.at(i - 1)) {
continue;
} else if (h.at(i) > h.at(i - 1)) {
h.at(i) -= 1;
} else {
... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"expression.operator.change"
] | 757,061 | 757,062 | u194421002 | 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 check = true;
for (int i = 0; i < N - 1; i++) {
if (H.at(N - 1 - i) >= H.at(N - 2 - i))
continue;
else if (H.at(N - 1 - i) >= H.at(N - 2 - 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.at(i);
bool check = true;
for (int i = 0; i < N - 1; i++) {
if (H.at(N - 1 - i) >= H.at(N - 2 - i))
continue;
else if (H.at(N - 1 - i) >= H.at(N - 2 - i) - 1)... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 757,067 | 757,068 | u700981792 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
scanf("%d", &N);
vector<int> H(N, 0);
for (int i = 0; i < N; i++) {
scanf("%d", &H.at(i));
}
for (int i = N - 1; i >= 0; i--) {
if (H.at(i) < H.at(i - 1)) {
H.at(i - 1)--;
}
if (H.at(i) < H.at(i - 1)) {
printf(... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
scanf("%d", &N);
vector<int> H(N, 0);
for (int i = 0; i < N; i++) {
scanf("%d", &H.at(i));
}
for (int i = N - 1; i > 0; i--) {
if (H.at(i) < H.at(i - 1)) {
H.at(i - 1)--;
}
if (H.at(i) < H.at(i - 1)) {
printf("... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 757,069 | 757,070 | u553129408 | cpp |
p02953 | #include <bits/stdc++.h>
int main(void) {
using namespace std;
int N, a = 1;
cin >> N;
int H[N];
for (int i = 0; i < N; i++)
cin >> H[i];
for (int i = N - 1; i > 0; i--) {
if (H[i] + 1 < H[i - 1])
break;
else if (H[i] + 1 == H[i - 1])
H[i - 1]--;
}
if (a == 1)
cout << "Yes" ... | #include <bits/stdc++.h>
int main(void) {
using namespace std;
int N, a = 1;
cin >> N;
int H[N];
for (int i = 0; i < N; i++)
cin >> H[i];
for (int i = N - 1; i > 0; i--) {
if (H[i] + 1 < H[i - 1]) {
a = 0;
break;
} else if (H[i] + 1 == H[i - 1])
H[i - 1]--;
}
if (a == 1)
... | [
"assignment.add"
] | 757,073 | 757,074 | u533334387 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<long long> H(N);
for (int i = 0; i < N; i++) {
cin >> H[i];
}
H[0]--;
for (int i = 1; i < N; i++) {
if (H[i - 1] < H[i]) {
H[i]--;
}
}
bool flag = true;
for (int i = 0; i < N - 1; i++) {
if (H... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<long long> H(N);
for (int i = 0; i < N; i++) {
cin >> H[i];
}
H[0]--;
for (int i = 1; i < N; i++) {
if (H[i - 1] < H[i]) {
H[i]--;
}
}
bool flag = true;
for (int i = 0; i < N - 1; i++) {
if (H... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 757,080 | 757,081 | u904123392 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mp make_pair
#define pb push_back
#define pii pair<int, int>
#define pll pair<LL, LL>
#define pi acos(-1)
#define sqr(x) ((x) * (x))
#define pdd pair<double, double>
#define MEMS(x) memset(x, -1, sizeof(x))
#define MEM(x) memset(x, 0, sizeof(x))... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mp make_pair
#define pb push_back
#define pii pair<int, int>
#define pll pair<LL, LL>
#define pi acos(-1)
#define sqr(x) ((x) * (x))
#define pdd pair<double, double>
#define MEMS(x) memset(x, -1, sizeof(x))
#define MEM(x) memset(x, 0, sizeof(x))... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 757,088 | 757,089 | u434248058 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mp make_pair
#define pb push_back
#define pii pair<int, int>
#define pll pair<LL, LL>
#define pi acos(-1)
#define sqr(x) ((x) * (x))
#define pdd pair<double, double>
#define MEMS(x) memset(x, -1, sizeof(x))
#define MEM(x) memset(x, 0, sizeof(x))... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mp make_pair
#define pb push_back
#define pii pair<int, int>
#define pll pair<LL, LL>
#define pi acos(-1)
#define sqr(x) ((x) * (x))
#define pdd pair<double, double>
#define MEMS(x) memset(x, -1, sizeof(x))
#define MEM(x) memset(x, 0, sizeof(x))... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 757,090 | 757,089 | u434248058 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef string str;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef map<str, int> mapsi;
typedef map<str, int>::iterator mapsitr;
typedef... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef string str;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef map<str, int> mapsi;
typedef map<str, int>::iterator mapsitr;
typedef... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 757,095 | 757,096 | u337775536 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
int n, a[100010];
int main() {
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = n - 1; i >= 1; i--) {
if (a[i] > a[i + 1])
a[i]--;
}
string res = "yes";
for (int i = 2; i <= n; i++) {
if (a[i] < a[i - 1]) {
res = "no";
... | #include <bits/stdc++.h>
using namespace std;
int n, a[100010];
int main() {
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = n - 1; i >= 1; i--) {
if (a[i] > a[i + 1])
a[i]--;
}
string res = "Yes";
for (int i = 2; i <= n; i++) {
if (a[i] < a[i - 1]) {
res = "No";
... | [
"literal.string.change",
"literal.string.case.change",
"variable_declaration.value.change",
"assignment.value.change"
] | 757,099 | 757,100 | u521078006 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
int n, a[100010];
int main() {
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = n - 1; i >= 1; i--) {
if (a[i] > a[i + 1])
a[i]--;
}
string res = "yes";
for (int i = 2; i <= n; i++) {
if (a[i] < a[i - 1]) {
res = "no";
... | #include <bits/stdc++.h>
using namespace std;
int n, a[100010];
int main() {
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = n - 1; i >= 1; i--) {
if (a[i] > a[i + 1])
a[i]--;
}
string res = "Yes";
for (int i = 2; i <= n; i++) {
if (a[i] < a[i - 1]) {
res = "No";
... | [
"literal.string.change",
"literal.string.case.change",
"variable_declaration.value.change",
"assignment.value.change"
] | 757,099 | 757,101 | u521078006 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define FOR(i, a, b) for (ll i = (a); i < (b); ++i)
#define FORR(i, a, b) for (ll i = (a); i > (b); --i)
#define REP(i, n) for (ll i = 0; i < (n); ++i)
#define REPR(i, n) for (ll i = n; i >= 0; i--)
#define FOREACH(x, a) for (auto &(x) : (a))
#define... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define FOR(i, a, b) for (ll i = (a); i < (b); ++i)
#define FORR(i, a, b) for (ll i = (a); i > (b); --i)
#define REP(i, n) for (ll i = 0; i < (n); ++i)
#define REPR(i, n) for (ll i = n; i >= 0; i--)
#define FOREACH(x, a) for (auto &(x) : (a))
#define... | [
"control_flow.branch.if.condition.change"
] | 757,102 | 757,103 | u139031151 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
// long long
using ll = long long;
//出力系
#define print(x) cout << x << endl
#define yes cout << "Yes" << endl
#define YES cout << "YES" << endl
#define no cout << "No" << endl
#define NO cout << "NO" << endl
// begin() end()
#define all(x) (x... | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
// long long
using ll = long long;
//出力系
#define print(x) cout << x << endl
#define yes cout << "Yes" << endl
#define YES cout << "YES" << endl
#define no cout << "No" << endl
#define NO cout << "NO" << endl
// begin() end()
#define all(x) (x... | [
"expression.operation.binary.add"
] | 757,104 | 757,105 | u832995587 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int i;
vector<int> H(N, 0);
for (i = 0; i < N; i++)
cin >> H.at(i);
int maxa = H.at(0) - 1;
bool ans = 1;
for (i = 0; i < N - 1; i++) {
if (H.at(i) - 1 > H.at(i + 1) || H.at(i + 1) - 1 < maxa) {
ans = 0;
br... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int i;
vector<int> H(N, 0);
for (i = 0; i < N; i++)
cin >> H.at(i);
int maxa = H.at(0) - 1;
bool ans = 1;
for (i = 0; i < N - 1; i++) {
if (H.at(i) - 1 > H.at(i + 1) || H.at(i + 1) < maxa) {
ans = 0;
break;... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 757,109 | 757,110 | u634999820 | cpp |
p02953 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include ... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include ... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 757,111 | 757,112 | u403813525 | cpp |
p02953 | #include <iostream>
using namespace std;
typedef long long INT;
bool f(INT N, INT H[]) {
INT a = H[0];
for (INT i = 1; i < N; ++i) {
INT b = H[i];
if (b < a - 1) {
return false;
}
a = max(a, b - 1);
}
return true;
}
int main() {
static INT N, H[100000];
cin >> N;
for (INT i ... | #include <iostream>
using namespace std;
typedef long long INT;
bool f(INT N, INT H[]) {
INT a = H[0];
for (INT i = 1; i < N; ++i) {
INT b = H[i];
if (b < a) {
return false;
}
a = max(a, b - 1);
}
return true;
}
int main() {
static INT N, H[100000];
cin >> N;
for (INT i = 0;... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 757,115 | 757,116 | u729417323 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
#define ld long double
#define ll long long
int main() {
/*#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
//freopen("test.txt","r",stdin);
//freopen("output.txt","w",stdout);
#endif*/
ios::sync_with_stdio(false);
cin.tie(0);
cout.precisi... | #include <bits/stdc++.h>
using namespace std;
#define ld long double
#define ll long long
int main() {
/*#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
//freopen("test.txt","r",stdin);
//freopen("output.txt","w",stdout);
#endif*/
ios::sync_with_stdio(false);
cin.tie(0);
cout.precisi... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 757,121 | 757,122 | u482034961 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
#define ld long double
#define ll long long
int main() {
/*#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
//freopen("test.txt","r",stdin);
//freopen("output.txt","w",stdout);
#endif*/
ios::sync_with_stdio(false);
cin.tie(0);
cout.precisi... | #include <bits/stdc++.h>
using namespace std;
#define ld long double
#define ll long long
int main() {
/*#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
//freopen("test.txt","r",stdin);
//freopen("output.txt","w",stdout);
#endif*/
ios::sync_with_stdio(false);
cin.tie(0);
cout.precisi... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 757,123 | 757,124 | u482034961 | cpp |
p02953 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <vector>
using namespace std;
int main(void) {
int N;
cin >> N;
vector<int> H(N);
vector<int> I(N);
if (N == 1) {
cout << "Yes";
} else {
for (int i = 0; i < N; i++) {
cin >> H[i];
}
for (int i = N - 1; i > 0; i--) {... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <vector>
using namespace std;
int main(void) {
int N;
cin >> N;
vector<int> H(N);
vector<int> I(N);
if (N == 1) {
cout << "Yes";
} else {
for (int i = 0; i < N; i++) {
cin >> H[i];
}
for (int i = N - 1; i > 0; i--) {... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 757,125 | 757,126 | u698598617 | cpp |
p02953 | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define mk make_pair
#define fr first
#define sc second
using namespace std;
int n, ans, x, y;
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> x;
if (x > y)
x--;
if (x < y) {
cout << "NO";
return 0;
... | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define mk make_pair
#define fr first
#define sc second
using namespace std;
int n, ans, x, y;
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> x;
if (x > y)
x--;
if (x < y) {
cout << "No";
return 0;
... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 757,129 | 757,130 | u080863136 | cpp |
p02953 | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int H[N], G[N - 1];
for (int i = 1; i <= N; i++)
cin >> H[i];
H[0] = H[1];
int ans = 0;
for (int i = N - 1; i > 0; i--) {
if (H[i] <= H[i + 1])
continue;
else if (H[i] == H[i + 1] + 1)
continue;
else
... | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int H[N], G[N - 1];
for (int i = 1; i <= N; i++)
cin >> H[i];
H[0] = H[1];
int ans = 0;
for (int i = N - 1; i > 0; i--) {
if (H[i] <= H[i + 1])
continue;
else if (H[i] == H[i + 1] + 1)
H[i]--;
else
... | [] | 757,137 | 757,138 | u057617112 | cpp |
p02953 | #include <bits/stdc++.h>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int a, s, v = 1;
cin >> a;
vector<int> z(a);
for (s = 0; s < a; s++) {
cin >> z.at(s);
}
reverse(z.begin(), z.end());
for (s = 0; s < a; s++) {
if (z.at(s) + 1 == z.at(s + 1)) {
z.at(s + 1) -= 1... | #include <bits/stdc++.h>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int a, s, v = 1;
cin >> a;
vector<int> z(a);
for (s = 0; s < a; s++) {
cin >> z.at(s);
}
reverse(z.begin(), z.end());
for (s = 0; s < a - 1; s++) {
if (z.at(s) + 1 == z.at(s + 1)) {
z.at(s + 1) ... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 757,145 | 757,146 | u116662310 | cpp |
p02953 | //#pragma comment(linker, "/stack:200000000") // (UNCOMMENT WHEN HAVING LOTS OF
//RECURSIONS)
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#pragma GCC optimize("unroll-loops") // $ (UNCOMMENT WHEN TRYING TO
//BRUTEFORCE WITH... | //#pragma comment(linker, "/stack:200000000") // (UNCOMMENT WHEN HAVING LOTS OF
//RECURSIONS)
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#pragma GCC optimize("unroll-loops") // $ (UNCOMMENT WHEN TRYING TO
//BRUTEFORCE WITH... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 757,154 | 757,155 | u392480834 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define RFOR(i, b, a) for (int i = (b)-1; i >= (a); --i)
#define REP(i, N) FOR(i, 0, N)
#define RREP(i, N) RFOR(i, N, 0)
#define FILL(A, value) memset(A, value, sizeof(A))
#define endl '\n'
#define ALL(V) V.begin(), V.e... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define RFOR(i, b, a) for (int i = (b)-1; i >= (a); --i)
#define REP(i, N) FOR(i, 0, N)
#define RREP(i, N) RFOR(i, N, 0)
#define FILL(A, value) memset(A, value, sizeof(A))
#define endl '\n'
#define ALL(V) V.begin(), V.e... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 757,160 | 757,161 | u372798233 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main() {
ll n, ans = 0;
cin >> n;
ll a[n];
for (ll i = 0; i < n; i++)
cin >> a[i];
for (ll i = n - 2; i >= 0; i--) {
if (a[i] > a[i + 1])
a[i]--;
if (a[i] > a[i - 1])
ans = 1;
}
if (ans == 1)
cout << "N... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main() {
ll n, ans = 0;
cin >> n;
ll a[n];
for (ll i = 0; i < n; i++)
cin >> a[i];
for (ll i = n - 2; i >= 0; i--) {
if (a[i] > a[i + 1])
a[i]--;
if (a[i] > a[i + 1])
ans = 1;
}
if (ans == 1)
cout << "N... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 757,168 | 757,169 | u240116138 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie... | [
"literal.string.change",
"literal.string.case.change",
"function.return_value.change"
] | 757,174 | 757,175 | u859773831 | 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);
}
int ans = 1;
for (int i = N; i > 0; i--) {
if (H.at(i) < H.at(i - 1)) {
H.at(i - 1) -= 1;
if (H.at(i) < H.at(i - 1)) {
ans = 0;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> H(N);
for (int i = 0; i < N; i++) {
cin >> H.at(i);
}
int ans = 1;
for (int i = N - 1; i > 0; i--) {
if (H.at(i) < H.at(i - 1)) {
H.at(i - 1) -= 1;
if (H.at(i) < H.at(i - 1)) {
ans = 0;
... | [
"control_flow.loop.for.initializer.change"
] | 757,176 | 757,177 | u727223350 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
#define pb push_back
#define fastIO \
ios_base::sync_with_stdio(false); \
cin.tie(nullptr);
#define endl '\n'
#d... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
#define pb push_back
#define fastIO \
ios_base::sync_with_stdio(false); \
cin.tie(nullptr);
#define endl '\n'
#d... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 757,180 | 757,181 | u702142173 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
const int MAXN = 1e5 + 7;
int arr[MAXN];
int main() {
ios::sync_with_stdio(0);
int n, flag = 0;
cin >> n;
arr[0] = 0;
for (int i = 1; i <= n; i++) {
cin >> arr[i];
}
for (int i = 1; i <= n; i++) {
if (arr[i - 1] - arr[i] == 1)
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
const int MAXN = 1e5 + 7;
int arr[MAXN];
int main() {
ios::sync_with_stdio(0);
// while(1){
int n, flag = 0;
cin >> n;
arr[0] = 0;
for (int i = 1; i <= n; i++) {
cin >> arr[i];
}
for (int i = 1; i <= n; i++) {
if (arr[i - 1] - ... | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 757,184 | 757,183 | u872015944 | cpp |
p02953 | #include <bits/stdc++.h>
typedef long long int ll;
using namespace std;
const ll mod = 1e9 + 7;
ll powmod(ll a, ll b) {
ll res = 1;
a %= mod;
assert(b >= 0);
for (; b; b >>= 1) {
if (b & 1)
res = res * a % mod;
a = a * a % mod;
}
return res;
}
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a;... | #include <bits/stdc++.h>
typedef long long int ll;
using namespace std;
const ll mod = 1e9 + 7;
ll powmod(ll a, ll b) {
ll res = 1;
a %= mod;
assert(b >= 0);
for (; b; b >>= 1) {
if (b & 1)
res = res * a % mod;
a = a * a % mod;
}
return res;
}
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a;... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 757,185 | 757,186 | u750836455 | cpp |
p02953 | #include <algorithm>
#include <stdio.h>
using namespace std;
int main() {
int h[100005], n, maxh;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &h[i]);
}
for (int i = n - 1; i >= 1; i--) {
if (h[i + 1] >= h[i]) {
continue;
} else if (h[i + 1] + 1 == h[i]) {
--h[i];
} e... | #include <algorithm>
#include <stdio.h>
using namespace std;
int main() {
int h[100005], n, maxh;
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &h[i]);
}
for (int i = n - 1; i >= 1; i--) {
if (h[i + 1] >= h[i]) {
continue;
} else if (h[i + 1] + 1 == h[i]) {
h[i]--;
} ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 757,195 | 757,196 | u477525609 | cpp |
p02953 | #include <algorithm>
#include <stdio.h>
using namespace std;
int main() {
int h[100005], n, maxh;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &h[i]);
}
for (int i = n - 1; i >= 1; i--) {
if (h[i + 1] >= h[i]) {
continue;
} else if (h[i + 1] + 1 == h[i]) {
h[i]--;
} e... | #include <algorithm>
#include <stdio.h>
using namespace std;
int main() {
int h[100005], n, maxh;
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &h[i]);
}
for (int i = n - 1; i >= 1; i--) {
if (h[i + 1] >= h[i]) {
continue;
} else if (h[i + 1] + 1 == h[i]) {
h[i]--;
} ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 757,197 | 757,196 | u477525609 | cpp |
p02953 | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define mod 1000000007
#define all(v) v.begin(), v.end()
#define MP make_pair
#define F first
#define S second
#define inf 10000000000000
#define vll vector<ll>
using namespace std;
const int N = 100005;
void solve() {
ll n, a[N], i;
cin >> n;
a[... | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define mod 1000000007
#define all(v) v.begin(), v.end()
#define MP make_pair
#define F first
#define S second
#define inf 10000000000000
#define vll vector<ll>
using namespace std;
const int N = 100005;
void solve() {
ll n, a[N], i;
cin >> n;
a[... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 757,206 | 757,207 | u850006519 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int x = a[n - 1];
for (int i = n - 1; i >= 0; i--) {
if (a[i] <= x) {
x = a[i];
} else {
if (a[i] - 1 <= x) {
x = a[i] - 1;
} else {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int x = a[n - 1];
for (int i = n - 1; i >= 0; i--) {
if (a[i] <= x) {
x = a[i];
} else {
if (a[i] - 1 <= x) {
x = a[i] - 1;
} else {
... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 757,208 | 757,209 | u888514242 | cpp |
p02953 | #include <iostream>
#include <vector>
#define re(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
re(i, n) cin >> a[i];
int p = -100;
re(i, n) {
if (p < a[i])
p = a[i] - 1;
else if (p = a[i])
p = a[i];
else
{
cout << "... | #include <iostream>
#include <vector>
#define re(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
re(i, n) cin >> a[i];
int p = -100;
re(i, n) {
if (p < a[i])
p = a[i] - 1;
else if (p == a[i])
p = a[i];
else {
cout << "No";... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 757,211 | 757,212 | u437083392 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
if (n == 1) {
cout << "Yes";
return 0;
}
int h[n];
for (int i = 0; i < n; i++)
cin >> h[i];
for (int i = 1; i < n; ++i) {
int pre = h[i - 1];
int cur = h[i];
if (cur > (pre + 1)) {
cur = cur - 1;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
if (n == 1) {
cout << "Yes";
return 0;
}
int h[n];
for (int i = 0; i < n; i++)
cin >> h[i];
for (int i = 1; i < n; ++i) {
int pre = h[i - 1];
int cur = h[i];
if (cur >= (pre + 1)) {
cur = cur - 1... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 757,221 | 757,222 | u331991493 | cpp |
p02953 | #include <bits/stdc++.h>
#include <cstdio>
using namespace std;
#define ll long long
#define PB push_back
#define ld long double
#define ff first
#define ss second
#define st(v) (v).begin(), (v).end()
#define pr pair<int, int>
const int dx[4] = {1, 0, 0, -1};
const int dy[4] = {0, -1, 1, 0};
void solve() {
int n;
c... | #include <bits/stdc++.h>
#include <cstdio>
using namespace std;
#define ll long long
#define PB push_back
#define ld long double
#define ff first
#define ss second
#define st(v) (v).begin(), (v).end()
#define pr pair<int, int>
const int dx[4] = {1, 0, 0, -1};
const int dy[4] = {0, -1, 1, 0};
void solve() {
int n;
c... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 757,225 | 757,226 | u082568020 | cpp |
p02953 | #include <iostream>
using namespace std;
int a[100002];
int suff[100002];
int main() {
int i;
int n;
cin >> n;
for (i = 1; i <= n; i++)
cin >> a[i];
suff[n] = a[n];
for (i = n - 1; i >= 1; i--)
suff[i] = min(suff[i + 1], a[i]);
bool ok = true;
for (i = 1; i <= n; i++)
if (a[i] - suff[i] >=... | #include <iostream>
using namespace std;
int a[100002];
int suff[100002];
int main() {
int i;
int n;
cin >> n;
for (i = 1; i <= n; i++)
cin >> a[i];
suff[n] = a[n];
for (i = n - 1; i >= 1; i--)
suff[i] = min(suff[i + 1], a[i]);
bool ok = true;
for (i = 1; i <= n; i++)
if (a[i] - suff[i] >=... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 757,227 | 757,228 | u359313068 | cpp |
p02953 | #include <iostream>
#include <string>
using namespace std;
int main(void) {
int n;
cin >> n;
int left, right;
right = 0;
cin >> left;
for (int i = 1; i < n; i++) {
cin >> right;
if (left - right > 0) {
cout << "NO";
return 0;
}
if (abs(right - left) >= 1) {
right--;
}
... | #include <iostream>
#include <string>
using namespace std;
int main(void) {
int n;
cin >> n;
int left, right;
right = 0;
cin >> left;
for (int i = 1; i < n; i++) {
cin >> right;
if (left - right > 0) {
cout << "No";
return 0;
}
if (abs(right - left) >= 1) {
right--;
}
... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 757,231 | 757,232 | u294138643 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
bool flag = true;
cin >> n;
vector<int> h(n);
for (int i = 0; i < n; i++) {
cin >> h.at(i);
}
for (int j = n - 1; j > 0; j--) {
if (h[j - 1] <= h[j]) {
} else if (h[j - 1] == h[j] + 1) {
h[j - 1]--;
} else
flag ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
bool flag = true;
cin >> n;
vector<int> h(n);
for (int i = 0; i < n; i++) {
cin >> h.at(i);
}
for (int j = n - 1; j > 0; j--) {
if (h[j - 1] <= h[j]) {
} else if (h[j - 1] == h[j] + 1) {
h[j - 1]--;
} else
flag ... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 757,233 | 757,234 | u501163846 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
int A[100005];
int main() {
ios::sync_with_stdio(0);
cin.tie(NULL), cout.tie(NULL);
int N;
cin >> N;
for (int i = 1; i <= N; i++)
cin >> A[i];
for (int i = N - 1; i >= 1; i--) {
if (A[i] > A[i - 1])
A[i]--;
if (A[i] > A[i - 1]) {
c... | #include <bits/stdc++.h>
using namespace std;
int A[100005];
int main() {
ios::sync_with_stdio(0);
cin.tie(NULL), cout.tie(NULL);
int N;
cin >> N;
for (int i = 1; i <= N; i++)
cin >> A[i];
for (int i = N - 1; i >= 1; i--) {
if (A[i] > A[i + 1])
A[i]--;
if (A[i] > A[i + 1]) {
c... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 757,245 | 757,246 | u363653022 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (int i = 0; i < (int)(N); i++)
int N;
int main() {
cin >> N;
int H[N + 1];
rep(i, N) cin >> H[i];
bool flg = true;
for (int i = N - 2; i >= 0; i--) {
if (H[i] == H[i + 1] + 1)
H[i] = H[i] - 1;
if (H[i] > H[i + 1] + 1) {
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (int i = 0; i < (int)(N); i++)
int N;
int main() {
cin >> N;
int H[N + 1];
rep(i, N) cin >> H[i];
bool flg = true;
for (int i = N - 2; i >= 0; i--) {
if (H[i] == H[i + 1] + 1)
H[i] = H[i] - 1;
if (H[i] > H[i + 1] + 1) {
... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 757,253 | 757,254 | u244391385 | cpp |
p02953 | #include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
int pre = -999;
rep(i, n) {
if (pre <= a[-1]) {
pre = a[i] - 1;
} else if (pre <= a[i]) {
pre = a[i];
} el... | #include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
int pre = -999;
rep(i, n) {
if (pre <= a[i] - 1) {
pre = a[i] - 1;
} else if (pre <= a[i]) {
pre = a[i];
}... | [
"control_flow.branch.if.condition.change"
] | 757,264 | 757,265 | u305810543 | cpp |
p02953 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
int pre = 999;
rep(i, n) {
if (pre <= a[i] - 1) {
pre = a[i] - 1;
} else if... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
int pre = -999;
rep(i, n) {
if (pre <= a[i] - 1) {
pre = a[i] - 1;
} else i... | [
"expression.operation.unary.arithmetic.add"
] | 757,268 | 757,269 | u743473047 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
main() {
int N;
cin >> N;
vector<int> H(N);
for (int i = 0; i < N; i++) {
cin >> H.at(i);
}
int pre = -999;
for (int i = 0; i < N; i++) {
if (pre <= H[i] - 1) {
pre = H[i] - 1;
} else if (pre <= H[i]) {
pre = H[i];
} else {
co... | #include <bits/stdc++.h>
using namespace std;
main() {
int N;
cin >> N;
vector<int> H(N);
for (int i = 0; i < N; i++) {
cin >> H.at(i);
}
int pre = -999;
for (int i = 0; i < N; i++) {
if (pre <= H[i] - 1) {
pre = H[i] - 1;
} else if (pre <= H[i]) {
pre = H[i];
} else {
co... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 757,272 | 757,271 | u103850114 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
main() {
int N;
cin >> N;
vector<int> H(N);
for (int i = 0; i < N; i++) {
cin >> H.at(i);
}
int pre = -999;
for (int i = 0; i < N; i++) {
if (pre <= H[i] - 1) {
pre = H[i];
} else if (pre <= H[i]) {
pre = H[i];
} else {
cout <... | #include <bits/stdc++.h>
using namespace std;
main() {
int N;
cin >> N;
vector<int> H(N);
for (int i = 0; i < N; i++) {
cin >> H.at(i);
}
int pre = -999;
for (int i = 0; i < N; i++) {
if (pre <= H[i] - 1) {
pre = H[i] - 1;
} else if (pre <= H[i]) {
pre = H[i];
} else {
co... | [
"assignment.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 757,273 | 757,271 | u103850114 | cpp |
p02953 | #include <bits/stdc++.h>
#define pb push_back
typedef long long ll;
using namespace std;
int main() {
int n;
cin >> n;
vector<int> h(n);
for (int &x : h)
cin >> x;
h[0]--;
for (int i = 1; i < n; i++) {
if (h[i - 1] > h[i]) {
cout << "NO\n";
return 0;
}
if (h[i - 1] < h[i])
... | #include <bits/stdc++.h>
#define pb push_back
typedef long long ll;
using namespace std;
int main() {
int n;
cin >> n;
vector<int> h(n);
for (int &x : h)
cin >> x;
h[0]--;
for (int i = 1; i < n; i++) {
if (h[i - 1] > h[i]) {
cout << "No\n";
return 0;
}
if (h[i - 1] < h[i])
... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 757,277 | 757,278 | u164054572 | cpp |
p02953 | #include "bits/stdc++.h"
#pragma GCC optimize "03"
using namespace std;
#define int long long int
#define pb push_back
#define pii pair<int, int>
#define fi first
#define se second
#define rep(i, a, b) for (int i = a; i < b; ++i)
#define dbg(x) \
{ cerr... | #include "bits/stdc++.h"
#pragma GCC optimize "03"
using namespace std;
#define int long long int
#define pb push_back
#define pii pair<int, int>
#define fi first
#define se second
#define rep(i, a, b) for (int i = a; i < b; ++i)
#define dbg(x) \
{ cerr... | [
"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",
"variable_access.subscript.ind... | 757,285 | 757,286 | u788280580 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#ifdef LOCAL_DEBUG
#include "LOCAL_DEBUG.hpp"
#endif
signed main() {
int n;
cin >> n;
vector<int> h(n);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
h[0]--;
for (int i = 0; i < n; i++) {
if (h[i - 1] < h[i]) {
h[i]--;
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#ifdef LOCAL_DEBUG
#include "LOCAL_DEBUG.hpp"
#endif
signed main() {
int n;
cin >> n;
vector<int> h(n);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
h[0]--;
for (int i = 1; i < n; i++) {
if (h[i - 1] < h[i]) {
h[i]--;
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 757,292 | 757,293 | u344122377 | cpp |
p02953 | #include <iostream>
using namespace std;
int main() {
int n, x = 0, z, m;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> z;
if (z > x) {
z--;
} else if (x > z) {
cout << "NO" << endl;
return 0;
}
x = z;
}
cout << "YES" << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int n, x = 0, z, m;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> z;
if (z > x) {
z--;
} else if (x > z) {
cout << "No" << endl;
return 0;
}
x = z;
}
cout << "Yes" << endl;
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 757,302 | 757,303 | u692047098 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
int f = 1;
a[0] = a[0] - 1;
for (int i = 1; i < n; i++) {
if (a[i - 1] < a[i])
a[i] = a[i] - 1;
}
for (int i = 1; i < n; i++) {
if (a[i - 1] <= a[i])
;... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
int f = 1;
a[0] = a[0] - 1;
for (int i = 1; i < n; i++) {
if (a[i - 1] < a[i])
a[i] = a[i] - 1;
}
for (int i = 1; i < n; i++) {
if (a[i - 1] <= a[i])
;... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 757,308 | 757,309 | u006069211 | cpp |
p02953 | #include <iomanip>
#include <iostream>
#include <math.h>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int n;
cin >> n;
int h[n];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
int flag = 0;
h[0]--;
for (int i = 1;... | #include <iomanip>
#include <iostream>
#include <math.h>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int n;
cin >> n;
int h[n];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
int flag = 0;
h[0]--;
for (int i = 1;... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 757,333 | 757,334 | u161609067 | cpp |
p02953 | #include <iomanip>
#include <iostream>
#include <math.h>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int n;
cin >> n;
int h[n];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
int flag = 0;
h[0]--;
for (int i = 1;... | #include <iomanip>
#include <iostream>
#include <math.h>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int n;
cin >> n;
int h[n];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
int flag = 0;
h[0]--;
for (int i = 1;... | [
"literal.number.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 757,335 | 757,334 | u161609067 | cpp |
p02953 | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
//#include <boost/multiprecision/cpp_int.hpp>
//#include <boost/math/common_factor_rt.hpp>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
// namespace mp = boost::multiprecision;
// namespace mt = boost::math
// using Bint = mp::cpp_int;
typedef ... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
//#include <boost/multiprecision/cpp_int.hpp>
//#include <boost/math/common_factor_rt.hpp>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
// namespace mp = boost::multiprecision;
// namespace mt = boost::math
// using Bint = mp::cpp_int;
typedef ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 757,338 | 757,339 | u201827503 | cpp |
p02953 | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
//#include <boost/multiprecision/cpp_int.hpp>
//#include <boost/math/common_factor_rt.hpp>
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
using namespace std;
// namespace mp = boost::multiprecision;
// namespace mt = boost::math
// using Bint =... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
//#include <boost/multiprecision/cpp_int.hpp>
//#include <boost/math/common_factor_rt.hpp>
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
using namespace std;
// namespace mp = boost::multiprecision;
// namespace mt = boost::math
// using Bint =... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 757,341 | 757,342 | u201827503 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
#define rec(i, n) for (i = 0; i < n; i++)
int main() {
int i, n;
bool ans = true;
cin >> n;
vector<int> height(n);
vector<int> flag(n);
flag.at(0) = 0;
rec(i, n) { cin >> height.at(i); }
rec(i, n - 1) {
if (height.at(i) - 1 == height.at(i + 1) && flag.a... | #include <bits/stdc++.h>
using namespace std;
#define rec(i, n) for (i = 0; i < n; i++)
int main() {
int i, n;
bool ans = true;
cin >> n;
vector<int> height(n);
vector<int> flag(n);
flag.at(0) = 0;
rec(i, n) { cin >> height.at(i); }
rec(i, n - 1) {
if (height.at(i) - 1 == height.at(i + 1) && flag.a... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 757,346 | 757,347 | u460608786 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int h[n + 10];
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]--;
for (int i = 0; i < n - 1; i++)
if (h[i] > h[i + 1]) {
cout << "No";
return 0;
}... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int h[n + 10];
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]--;
for (int i = 0; i < n - 1; i++)
if (h[i] > h[i + 1]) {
cout << "No";
return 0;
... | [
"control_flow.loop.for.initializer.change"
] | 757,368 | 757,369 | u957558006 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, s = 0, i = 0;
string F = "Yes";
cin >> N;
vector<int> H(N);
while (i < N) {
cin >> H.at(i);
i++;
}
while (s < N) {
if (s > 0) {
if (H.at(N - s) - H.at(N - s - 1) >= 2) {
F = "No";
break;
} else if (H... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, s = 0, i = 0;
string F = "Yes";
cin >> N;
vector<int> H(N);
while (i < N) {
cin >> H.at(i);
i++;
}
while (s < N) {
if (s > 0) {
if (H.at(N - s - 1) - H.at(N - s) >= 2) {
F = "No";
break;
} else if (H... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 757,372 | 757,373 | u820051975 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.