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 |
|---|---|---|---|---|---|---|---|
p02958 | #include <bits/stdc++.h>
using namespace std;
#define ALL(obj) obj.begin(), obj.end()
#define pb(obj) push_back(obj)
#define REP(i, N) for (ll i = 0; i < N; i++)
typedef long long ll;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
int p;
int count = 0;
REP(i, N) {
cin >> p;
... | #include <bits/stdc++.h>
using namespace std;
#define ALL(obj) obj.begin(), obj.end()
#define pb(obj) push_back(obj)
#define REP(i, N) for (ll i = 0; i < N; i++)
typedef long long ll;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
int p;
int count = 0;
REP(i, N) {
cin >> p;
... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 764,132 | 764,133 | u892438699 | cpp |
p02958 | #include <stdio.h>
int main() {
int N;
scanf("%d", &N);
int p[N];
int i;
int f = 0;
for (i = 1; i <= N; i++) {
scanf("%d", &p[i]);
if (p[i] != i)
f++;
}
if (f > 2) {
printf("No");
} else {
printf("Yes");
}
return 0;
} | #include <stdio.h>
int main() {
int N;
scanf("%d", &N);
int p[N];
int i;
int f = 0;
for (i = 1; i <= N; i++) {
scanf("%d", &p[i]);
if (p[i] != i)
f++;
}
if (f > 2) {
printf("NO");
} else {
printf("YES");
}
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 764,134 | 764,135 | u692258787 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
#define TASKNAME main
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
// freopen(TASKNAME".inp", "r", stdin);
// freopen(TASKNAME".out", "w", stdout);
ll n;
cin >> n;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
#define TASKNAME main
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
// freopen(TASKNAME".inp", "r", stdin);
// freopen(TASKNAME".out", "w", stdout);
ll n;
cin >> n;
... | [
"control_flow.branch.if.condition.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 764,169 | 764,170 | u657419921 | cpp |
p02958 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
int main() {
int N = 0;
std::string ans;
std::cin >> N;
std::vector<int> P(N), S(N);
for (int i = 0; i < N; i++) {
std::cin >> P[i];
}
S = P;
std::sort(P.begin(), P.end());
int chk = 0;
for (int i = 0; i < N; i++) {
... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
int main() {
int N = 0;
std::string ans;
std::cin >> N;
std::vector<int> P(N), S(N);
for (int i = 0; i < N; i++) {
std::cin >> P[i];
}
S = P;
std::sort(P.begin(), P.end());
int chk = 0;
for (int i = 0; i < N; i++) {
... | [
"literal.string.change",
"literal.string.case.change",
"assignment.value.change"
] | 764,171 | 764,172 | u659222664 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
#define what_is(x) cerr << #x << " is " << x << endl;
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(0);
#define st first
#define nd second
#define e... | #include <bits/stdc++.h>
using namespace std;
#define what_is(x) cerr << #x << " is " << x << endl;
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(0);
#define st first
#define nd second
#define e... | [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove"
] | 764,181 | 764,182 | u411771230 | cpp |
p02958 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < int(n); i++)
using namespace std;
int main() {
int n;
cin >> n;
vector<int> p(n);
rep(i, n) cin >> p[i];
int count = 0;
bool ans = true;
for (int i = 0; i < n; i++) {
if (p[i] - 1 != i) {
count++;
}
}
if (count > 2)
ans =... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < int(n); i++)
using namespace std;
int main() {
int n;
cin >> n;
vector<int> p(n);
rep(i, n) cin >> p[i];
int count = 0;
bool ans = true;
for (int i = 0; i < n; i++) {
if (p[i] - 1 != i) {
count++;
}
}
if (count > 2)
ans =... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 764,183 | 764,184 | u679159704 | cpp |
p02958 | #include <iostream>
using namespace std;
int isAscending(int *a, int n) {
for (int i = 0; i < n - 1; i++) {
// cout << a[i] << " ";
if (a[i] > a[i + 1])
return 0;
}
return 1;
}
int main(void) {
int n, p[100];
int flg;
cin >> n;
for (int i = 0; i < n; i++)
cin >> p[i];
flg = 0;
... | #include <iostream>
using namespace std;
int isAscending(int *a, int n) {
for (int i = 0; i < n - 1; i++) {
// cout << a[i] << " ";
if (a[i] > a[i + 1])
return 0;
}
return 1;
}
int main(void) {
int n, p[100];
int flg;
cin >> n;
for (int i = 0; i < n; i++)
cin >> p[i];
flg = isAsc... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.add"
] | 764,187 | 764,188 | u023463844 | cpp |
p02958 | #include <iostream>
using namespace std;
int isAscending(int *a, int n) {
for (int i = 0; i < n - 1; i++) {
if (a[i] > a[i + 1])
return 0;
}
return 1;
}
int main(void) {
int n, p[100];
int flg;
cin >> n;
for (int i = 0; i < n; i++)
cin >> p[i];
flg = 1;
for (int i = 0; i < n; i++) {
... | #include <iostream>
using namespace std;
int isAscending(int *a, int n) {
for (int i = 0; i < n - 1; i++) {
// cout << a[i] << " ";
if (a[i] > a[i + 1])
return 0;
}
return 1;
}
int main(void) {
int n, p[100];
int flg;
cin >> n;
for (int i = 0; i < n; i++)
cin >> p[i];
flg = isAsc... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.add"
] | 764,189 | 764,188 | u023463844 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007;
const long long INF = 9999999999999999;
using ll = long long;
int main() {
int N;
cin >> N;
int a[N];
int ans = 0;
for (int i = 0; i < N; i++) {
cin >> a[i];
if ((i + 1) != a[i]) {
ans++;
}
}
if (ans >= 2) {
... | #include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007;
const long long INF = 9999999999999999;
using ll = long long;
int main() {
int N;
cin >> N;
int a[N];
int ans = 0;
for (int i = 0; i < N; i++) {
cin >> a[i];
if ((i + 1) != a[i]) {
ans++;
}
}
if (ans > 2) {
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 764,190 | 764,191 | u833295869 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define REPL(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i++)
#define repl(i, n) REP(i, 0, n)
#define all(v) v.begin(), v.end()
const int inf = 1e9 + 7;
const l... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define REPL(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i++)
#define repl(i, n) REP(i, 0, n)
#define all(v) v.begin(), v.end()
const int inf = 1e9 + 7;
const l... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 764,192 | 764,193 | u764013649 | cpp |
p02958 | #include <iostream>
using namespace std;
bool judge_yes_or_no(int *h, int n) {
int tmp_min = 0;
/*
* 交換場所の決定
* */
for (int i = 0; i < n - 1; i++) {
for (int next_i = i + 1; next_i < n; next_i++) {
if (h[i] > h[next_i] && tmp_min < next_i) {
tmp_min = next_i;
}
}
//何かしら交換してた... | #include <iostream>
using namespace std;
bool judge_yes_or_no(int *h, int n) {
int tmp_min = 0;
/*
* 交換場所の決定
* */
for (int i = 0; i < n - 1; i++) {
for (int next_i = i + 1; next_i < n; next_i++) {
if (h[i] > h[next_i] && tmp_min < next_i) {
tmp_min = next_i;
}
}
//何かしら交換してた... | [
"identifier.change",
"variable_declaration.array_dimensions.change",
"expression.operation.binary.change",
"variable_declaration.type.primitive.change",
"assignment.value.change",
"call.arguments.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 764,194 | 764,195 | u087468647 | cpp |
p02958 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> p(n), q(n);
for (int i = 0; i < n; i++) {
cin >> p[i];
q[i] = p[i];
}
int count = 0;
sort(q.begin(), q.end());
for (int i = 0; i < n; i++) {
if (p[i] != q[i])
cou... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> p(n), q(n);
for (int i = 0; i < n; i++) {
cin >> p[i];
q[i] = p[i];
}
int count = 0;
sort(q.begin(), q.end());
for (int i = 0; i < n; i++) {
if (p[i] != q[i])
cou... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 764,196 | 764,197 | u358388458 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
v.push_back(x);
}
int j = 0, k = 0;
for (int i = 0, flag = 0; i < n - 1; i++) {
if (flag == 0 && v.at(i) > v.at(i + 1)) {
j = i;
flag++;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
v.push_back(x);
}
int j = 0, k = 0;
for (int i = 0, flag = 0; i < n - 1; i++) {
if (flag == 0 && v.at(i) > v.at(i + 1)) {
j = i;
flag++;
... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 764,203 | 764,204 | u094746828 | cpp |
p02958 | #include <iostream>
using namespace std;
int main() {
int n, cnt;
cin >> n;
cnt = 0;
for (int i = 0; i < n; i++) {
int p1;
cin >> p1;
if (p1 != i + 1) {
cnt++;
}
}
if (cnt <= 2) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int n, cnt;
cin >> n;
cnt = 0;
for (int i = 0; i < n; i++) {
int p1;
cin >> p1;
if (p1 != i + 1) {
cnt++;
}
}
if (cnt <= 2) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 764,206 | 764,207 | u351547048 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> p(N);
for (int i = 0; i < N; i++) {
cin >> p[i];
}
int judge = 0;
for (int i = 0; i < N; i++) {
if ((p[i] - i - 1) != 0) {
judge++;
}
if (judge > 2) {
break;
}
}
if (judge == 2)... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> p(N);
for (int i = 0; i < N; i++) {
cin >> p[i];
}
int judge = 0;
for (int i = 0; i < N; i++) {
if ((p[i] - i - 1) != 0) {
judge++;
}
if (judge > 2) {
break;
}
}
if (judge <= 2)... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 764,208 | 764,209 | u267265758 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
bool isAllUp(vector<int> vec) {
bool test = false;
for (int i = 0; i < vec.size() - 1; ++i) {
if (vec.at(i) < vec.at(i + 1)) {
test = true;
} else {
test = false;
break;
}
}
return test;
}
int main() {
bool test = false;
int a, n... | #include <bits/stdc++.h>
using namespace std;
bool isAllUp(vector<int> vec) {
bool test = false;
for (int i = 0; i < vec.size() - 1; ++i) {
if (vec.at(i) < vec.at(i + 1)) {
test = true;
} else {
test = false;
break;
}
}
return test;
}
int main() {
bool test = false;
int a, n... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 764,214 | 764,215 | u433852402 | cpp |
p02958 | #include <algorithm>
#include <bitset>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <ve... | #include <algorithm>
#include <bitset>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <ve... | [] | 764,216 | 764,217 | u696290869 | cpp |
p02958 | #include <bits/stdc++.h>
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<int> P(N);
forn(i, N) cin >> P[i];
vector<int> Q = P;
sort(P.begin(), P.end());
int cnt = 0;
forn(i, N) {
if (P[i] != Q[i]) {
cnt++;
... | #include <bits/stdc++.h>
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<int> P(N);
forn(i, N) cin >> P[i];
vector<int> Q = P;
sort(P.begin(), P.end());
int cnt = 0;
forn(i, N) {
if (P[i] != Q[i]) {
cnt++;
... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 764,222 | 764,223 | u934402094 | cpp |
p02958 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
int N;
cin >> N;
vector<int> P(N);
rep... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
int N;
cin >> N;
vector<int> P(N);
rep... | [
"literal.string.change",
"literal.string.case.change",
"variable_declaration.value.change",
"assignment.value.change"
] | 764,225 | 764,226 | u999332340 | cpp |
p02958 | #include <bits/stdc++.h>
#define rep(i, n, k) for (int i = k; i < n; ++i)
#define drep(i, n, k) for (int i = k; i >= n; --i)
using namespace std;
int main() {
int n;
cin >> n;
vector<int> p(n), a(n);
rep(i, n, 0) {
cin >> p[i];
a[i] = p[i];
}
sort(a.begin(), a.end());
int x = 0;
rep(i, n, 0) {
... | #include <bits/stdc++.h>
#define rep(i, n, k) for (int i = k; i < n; ++i)
#define drep(i, n, k) for (int i = k; i >= n; --i)
using namespace std;
int main() {
int n;
cin >> n;
vector<int> p(n), a(n);
rep(i, n, 0) {
cin >> p[i];
a[i] = p[i];
}
sort(a.begin(), a.end());
int x = 0;
rep(i, n, 0) {
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.branch.else.remove",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 764,234 | 764,235 | u961052574 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> S(N);
int A = 0;
for (int i = 0; i < N; i++) {
cin >> S.at(i);
if ((i + 1) != S.at(i))
A++;
}
if (A == 0 || A == 2)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> S(N);
int A = 0;
for (int i = 0; i < N; i++) {
cin >> S.at(i);
if ((i + 1) != S.at(i))
A++;
}
if (A == 0 || A == 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 764,236 | 764,237 | u083447997 | cpp |
p02958 | #include <iostream>
#include <string>
using namespace std;
int main() {
int N;
int A;
cin >> N;
int counter = 0;
for (int i = N; i > 0; --i) {
cin >> A;
if (A != i)
counter++;
}
if (counter == 2 || counter == 0)
cout << "YES" << endl;
else
cout << "NO" << endl;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
int N;
int A;
cin >> N;
int counter = 0;
for (int i = 1; i <= N; ++i) {
cin >> A;
if (A != i)
counter++;
}
if (counter == 2 || counter == 0)
cout << "YES" << endl;
else
cout << "NO" << endl;
} | [
"variable_declaration.value.change",
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.initializer.change",
"control_flow.loop.for.condition.change"
] | 764,243 | 764,244 | u419501474 | cpp |
p02958 | #include <stdio.h>
using namespace std;
int main() {
int n;
scanf("%d", &n);
int p[100010];
for (int i = 0; i < n; i++) {
scanf("%d", &p[i]);
}
int k = 0;
for (int i = 0; i < n; i++) {
if (p[i] != i + 1)
k++;
}
if (k <= 2) {
printf("Yes");
} else {
printf("No");
}
return 0... | #include <stdio.h>
using namespace std;
int main() {
int n;
scanf("%d", &n);
int p[100010];
for (int i = 0; i < n; i++) {
scanf("%d", &p[i]);
}
int k = 0;
for (int i = 0; i < n; i++) {
if (p[i] != i + 1)
k++;
}
if (k <= 2) {
printf("YES");
} else {
printf("NO");
}
return 0... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 764,245 | 764,246 | u195269284 | cpp |
p02958 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main(int argc, const char *argv[]) {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<int> p;
int cnt = 0;
rep(i,... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main(int argc, const char *argv[]) {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<int> p(N);
int cnt = 0;
rep... | [] | 764,252 | 764,253 | u848433916 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> p(N);
for (int i = 0; i < N; i++) {
cin >> p[i];
}
int count;
for (int i = 0; i < N; i++)
if (p[i] != i + 1)
count++;
if (count <= 2)
cout << "YES\n";
else
cout << "NO\n";
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> p(N);
for (int i = 0; i < N; i++) {
cin >> p[i];
}
int count = 0;
for (int i = 0; i < N; i++)
if (p[i] != i + 1)
count++;
if (count <= 2)
cout << "YES\n";
else
cout << "NO\n";
}
| [
"variable_declaration.value.change"
] | 764,258 | 764,259 | u127348287 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> p(N);
for (int i = 0; i < N; i++) {
cin >> p[i];
}
int count;
for (int i = 0; i < N; i++)
if (p[i] != i + 1)
count++;
if (count <= 1)
cout << "YES\n";
else
cout << "NO\n";
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> p(N);
for (int i = 0; i < N; i++) {
cin >> p[i];
}
int count = 0;
for (int i = 0; i < N; i++)
if (p[i] != i + 1)
count++;
if (count <= 2)
cout << "YES\n";
else
cout << "NO\n";
}
| [
"variable_declaration.value.change",
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 764,260 | 764,259 | u127348287 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> p(n), rp(n);
for (int i = 0; i < n; i++) {
cin >> p[i];
rp[i] = p[i];
}
sort(p.begin(), p.end());
// for(int i=0; i<n; i++){
// cout << p[i] << endl;;
// }
int cnt = 0;
for (int i = 0; i < n; i+... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> p(n), rp(n);
for (int i = 0; i < n; i++) {
cin >> p[i];
rp[i] = p[i];
}
sort(p.begin(), p.end());
// for(int i=0; i<n; i++){
// cout << p[i] << endl;;
// }
int cnt = 0;
for (int i = 0; i < n; i+... | [
"control_flow.branch.if.condition.change"
] | 764,267 | 764,268 | u568419568 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> p(n), rp(n);
for (int i = 0; i < n; i++) {
cin >> p[i];
rp[i] = p[i];
}
sort(p.begin(), p.end());
int cnt = 0;
for (int i = 0; i < n; i++) {
if (p[i] == rp[i])
cnt++;
}
if (cnt == 2)
cou... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> p(n), rp(n);
for (int i = 0; i < n; i++) {
cin >> p[i];
rp[i] = p[i];
}
sort(p.begin(), p.end());
// for(int i=0; i<n; i++){
// cout << p[i] << endl;;
// }
int cnt = 0;
for (int i = 0; i < n; i+... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 764,269 | 764,268 | u568419568 | cpp |
p02958 | #include <iostream>
using namespace std;
int main() {
int n, p, c = 0;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> p;
if (p != i)
c++;
}
if (c == 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n, p, c = 0;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> p;
if (p != i)
c++;
}
if (c == 2 || c == 0)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 764,275 | 764,276 | u110383054 | cpp |
p02958 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define DEBUG 0
#define fi first
#define se second
#define pb push_back
#define fore(... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define DEBUG 0
#define fi first
#define se second
#define pb push_back
#define fore(... | [
"control_flow.branch.if.condition.change"
] | 764,293 | 764,294 | u334141868 | cpp |
p02958 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define DEBUG 1
#define fi first
#define se second
#define pb push_back
#define fore(... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define DEBUG 0
#define fi first
#define se second
#define pb push_back
#define fore(... | [
"preprocessor.define.value.change",
"literal.integer.change",
"control_flow.branch.if.condition.change"
] | 764,295 | 764,294 | u334141868 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int count = 0;
vector<int> p(N);
for (int i = 0; i < N; i++) {
cin >> p[i];
if (p[i] != i + 1) {
count++;
}
}
if (count == 0 && count == 2) {
cout << "YES";
} else {
cout << "NO";
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int count = 0;
vector<int> p(N);
for (int i = 0; i < N; i++) {
cin >> p[i];
if (p[i] != i + 1) {
count++;
}
}
if (count == 0 || count == 2) {
cout << "YES";
} else {
cout << "NO";
}
}
| [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 764,296 | 764,297 | u707810208 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
using ull = unsigned long long;
using ll = long long;
using ld = long double;
using D = double;
using ii = pair<int, int>;
using vi = vector<int>;
using vii = vector<ii>;
#define pb push_back
#define mp make_pair
#define all(x) x.begin(), x.end()
#define makeunique(x) sor... | #include <bits/stdc++.h>
using namespace std;
using ull = unsigned long long;
using ll = long long;
using ld = long double;
using D = double;
using ii = pair<int, int>;
using vi = vector<int>;
using vii = vector<ii>;
#define pb push_back
#define mp make_pair
#define all(x) x.begin(), x.end()
#define makeunique(x) sor... | [
"call.function.change",
"call.arguments.change"
] | 764,300 | 764,301 | u494447443 | cpp |
p02958 | #include <iostream>
#include <vector>
// https://atcoder.jp/contests/abc135/tasks/abc135_b
using namespace std;
int main() {
int n;
int count = 0;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; i++) {
cin >> p[i];
if (p[i] != i + 1) {
count += 1;
if (count > 2) {
cout << "NO" ... | #include <iostream>
#include <vector>
// https://atcoder.jp/contests/abc135/tasks/abc135_b
using namespace std;
int main() {
int n;
int count = 0;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; i++) {
cin >> p[i];
if (p[i] != i + 1) {
count += 1;
if (count > 2) {
cout << "NO" ... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 764,302 | 764,303 | u659823532 | cpp |
p02958 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<string> vs;
typedef vector<ll> vl;
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define in insert
#define F... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<string> vs;
typedef vector<ll> vl;
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define in insert
#define F... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 764,315 | 764,316 | u583511881 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define endl "\n"
#define inf 1000000007
//#define for(i, a, b) for(int i=a; i<b; i++)
int dp[1000001] = {0};
void solve() {
int n, cnt = 0;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++)
cin >> arr[i];
for (int i... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define endl "\n"
#define inf 1000000007
//#define for(i, a, b) for(int i=a; i<b; i++)
int dp[1000001] = {0};
void solve() {
int n, cnt = 0;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++)
cin >> arr[i];
for (int i... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 764,326 | 764,327 | u515638999 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, count;
cin >> n;
count = 0;
vector<int> p(n);
vector<int> p_s(n);
for (int i = 0; i < n; i++) {
cin >> p.at(i);
p_s.at(i) = p.at(i);
}
sort(p_s.begin(), p_s.end());
for (int i = 0; i < n; i++) {
if (p.at(i) != p_s.at(i)) ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, count;
cin >> n;
count = 0;
vector<int> p(n);
vector<int> p_s(n);
for (int i = 0; i < n; i++) {
cin >> p.at(i);
p_s.at(i) = p.at(i);
}
sort(p_s.begin(), p_s.end());
for (int i = 0; i < n; i++) {
if (p.at(i) != p_s.at(i)) ... | [
"control_flow.branch.if.condition.change"
] | 764,328 | 764,329 | u770009793 | cpp |
p02958 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int n, count = 0;
cin >> n;
vector<int> p(n);
vector<int> q(n);
rep(i, n) cin >> p[i];
rep(i, n) q[i] = p[i];
sort(q.begin(), q.end());
rep(i, n) {
if (p[i] == q[i])
count++;
}
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int n, count = 0;
cin >> n;
vector<int> p(n);
vector<int> q(n);
rep(i, n) cin >> p[i];
rep(i, n) q[i] = p[i];
sort(q.begin(), q.end());
rep(i, n) {
if (p[i] == q[i])
count++;
}
... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 764,335 | 764,336 | u532401120 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
// 整数の入力
int n;
int a[50], max, min, mpoint;
int count = 0;
bool flag = true;
unsigned int ans = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n - 1; i++) {
max = 0;
min = 1000000;
for (int j... | #include <bits/stdc++.h>
using namespace std;
int main() {
// 整数の入力
int n;
int a[50], max, min, mpoint;
int count = 0;
bool flag = true;
unsigned int ans = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n - 1; i++) {
max = 0;
min = 1000000;
for (int j... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 764,339 | 764,340 | u761994361 | cpp |
p02958 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
int main() {
int n;
cin >> n;
vector<int> vec(n);
vector<int> vecvec(n);
int count = 0;
rep(i, n)... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
int main() {
int n;
cin >> n;
vector<int> vec(n);
vector<int> vecvec(n);
int count = 0;
rep(i, n)... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 764,356 | 764,357 | u852449189 | cpp |
p02958 | #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... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 764,377 | 764,378 | u311671153 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int cnt = 0;
for (int i = 0; i << n; i++) {
int x;
cin >> x;
if (x != i + 1)
cnt++;
}
if (cnt == 0 || cnt == 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int cnt = 0;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
if (x != i + 1)
cnt++;
}
if (cnt == 0 || cnt == 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
} | [
"misc.typo",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 764,379 | 764,380 | u013408661 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; i++) {
cin >> p.at(i);
}
vector<int> r(n);
r = p;
vector<int> q(n);
sort(p.begin(), p.end());
q = p;
bool ans = false;
if (r == q) {
ans = true;
}
for (int i = 0; i ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; i++) {
cin >> p.at(i);
}
vector<int> r(n);
r = p;
vector<int> q(n);
sort(p.begin(), p.end());
q = p;
bool ans = false;
if (r == q) {
ans = true;
}
for (int i = 0; i ... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 764,385 | 764,386 | u111600809 | cpp |
p02958 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; i++)
cin >> p[i];
int diff = 0;
for (int i = 1; i <= n; i++) {
if (p[i] != i)
diff++;
}
// it could be p is already ascend
if (diff <= 2)
cout << "YES... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; i++)
cin >> p[i];
int diff = 0;
for (int i = 1; i <= n; i++) {
if (p[i - 1] != i)
diff++;
}
if (diff <= 2)
cout << "YES" << endl;
else
cout << "NO... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 764,389 | 764,390 | u886790158 | cpp |
p02958 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; i++)
cin >> p[i];
int diff = 0;
for (int i = 1; i <= n; i++) {
if (p[i] != i)
diff++;
}
if (diff == 2)
cout << "YES" << endl;
else
cout << "NO" <<... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; i++)
cin >> p[i];
int diff = 0;
for (int i = 1; i <= n; i++) {
if (p[i - 1] != i)
diff++;
}
if (diff <= 2)
cout << "YES" << endl;
else
cout << "NO... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"expression.operator.compare.change"
] | 764,391 | 764,390 | u886790158 | cpp |
p02958 | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int n, x, ans;
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> x;
if (x != i)
ans++;
}
if (ans > 1)
printf("NO");
else
printf("YES");
} | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int n, x, ans;
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> x;
if (x != i)
ans++;
}
if (ans > 2)
printf("NO");
else
printf("YES");
} | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 764,392 | 764,393 | u307700000 | cpp |
p02958 | #include "bits/stdc++.h"
using namespace std;
int main() {
int N;
cin >> N;
vector<int> P(N);
for (int i = 0; i < N; i++)
cin >> P[i];
int cnt = 0;
for (int i = 0; i < N; i++) {
if (P[i] == i + 1)
cnt++;
}
if (cnt == 0 || cnt == 2)
cout << "YES" << endl;
else
cout << "NO" << en... | #include "bits/stdc++.h"
using namespace std;
int main() {
int N;
cin >> N;
vector<int> P(N);
for (int i = 0; i < N; i++)
cin >> P[i];
int cnt = 0;
for (int i = 0; i < N; i++) {
if (P[i] != i + 1)
cnt++;
}
if (cnt == 0 || cnt == 2)
cout << "YES" << endl;
else
cout << "NO" << en... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 764,397 | 764,398 | u365956698 | cpp |
p02958 | // temp##############################################
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
void strInit(char str[]); // str[]を0で初期化
void extIntStr(char str[],
int data[]); // str[]から数値(int)を抽出しdata[]に順次格納
void incsort(int data[], int len); // data[]を昇順ソート
void decsort(int da... | // temp##############################################
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
void strInit(char str[]); // str[]を0で初期化
void extIntStr(char str[],
int data[]); // str[]から数値(int)を抽出しdata[]に順次格納
void incsort(int data[], int len); // data[]を昇順ソート
void decsort(int da... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 764,401 | 764,402 | u493708099 | cpp |
p02958 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
int n;
cin >> n;
vector<int> vec(n);
rep(i, n) { cin >> vec.at(i); }
int dif = 0;
rep(i, n) {
if ((vec.at(i) - (i + 1)) == 0)
continue;
dif++;
}
if (dif == 2) {
cout << "YES";
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
int n;
cin >> n;
vector<int> vec(n);
rep(i, n) { cin >> vec.at(i); }
int dif = 0;
rep(i, n) {
if ((vec.at(i) - (i + 1)) == 0)
continue;
dif++;
}
if (dif == 2 || dif == 0) {
cout ... | [
"control_flow.branch.if.condition.change"
] | 764,403 | 764,404 | u741134767 | cpp |
p02958 | // templates
#include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <unordered_map>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define ALL(x) (x).begin(), (x).end()
#define pb push_back
#define SZ(x) ((int)(x).size())
typedef long long ll;
using nam... | // templates
#include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <unordered_map>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define ALL(x) (x).begin(), (x).end()
#define pb push_back
#define SZ(x) ((int)(x).size())
typedef long long ll;
using nam... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 764,409 | 764,410 | u970738863 | cpp |
p02958 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int a[n], b[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
b[i] = a[i];
}
bool e = true;
for (int i = 0; i < n - 1; i++) {
if (a[i] > a[i + 1]) {
e = false;
break;
}
}
if (e == false) {
for (int i = ... | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int a[n], b[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
b[i] = a[i];
}
bool e = true;
for (int i = 0; i < n - 1; i++) {
if (a[i] > a[i + 1]) {
e = false;
break;
}
}
if (e == false) {
for (int i = ... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 764,411 | 764,412 | u834488582 | cpp |
p02958 | #include <bits/stdc++.h>
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
#define for1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define ford(i, n) for (int i = (int)(n)-1; i >= 0; --i)
#define fore(i, a, b) for (i... | #include <bits/stdc++.h>
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
#define for1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define ford(i, n) for (int i = (int)(n)-1; i >= 0; --i)
#define fore(i, a, b) for (i... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 764,413 | 764,414 | u837233010 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vec(N);
for (int i; i < N; i++) {
cin >> vec.at(i);
}
int count;
for (int i = 0; i < N; i++) {
if (vec.at(i) != (i + 1)) {
count++;
}
}
if (count >= 3) {
cout << "NO" << endl;
} else {
c... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
int count = 0;
for (int i = 0; i < N; i++) {
if (vec.at(i) != (i + 1)) {
count++;
}
}
if (count >= 3) {
cout << "NO" << endl;
} else... | [
"control_flow.loop.for.initializer.change",
"variable_declaration.value.change"
] | 764,415 | 764,416 | u025287757 | cpp |
p02958 | //
// ROIGold.cpp
// Main calisma
//
// Created by Rakhman on 05/02/2019.
// Copyright © 2019 Rakhman. All rights reserved.
//
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#... | //
// ROIGold.cpp
// Main calisma
//
// Created by Rakhman on 05/02/2019.
// Copyright © 2019 Rakhman. All rights reserved.
//
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 764,425 | 764,426 | u796195598 | cpp |
p02958 | //
// ROIGold.cpp
// Main calisma
//
// Created by Rakhman on 05/02/2019.
// Copyright © 2019 Rakhman. All rights reserved.
//
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#... | //
// ROIGold.cpp
// Main calisma
//
// Created by Rakhman on 05/02/2019.
// Copyright © 2019 Rakhman. All rights reserved.
//
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#... | [
"literal.number.change",
"expression.operation.binary.change",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 764,427 | 764,426 | u796195598 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> p(N);
int num = 0;
for (int i = 0; i < N; i++) {
cin >> p[i];
}
for (int i = 0; i < N; ++i) {
if (!(p[i] == p[i + 1] - 1)) {
num++;
}
}
if (num <= 3) {
cout << "YES" << endl;
} else {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> p(N);
int num = 0;
for (int i = 0; i < N; i++) {
cin >> p[i];
}
for (int i = 0; i < N; ++i) {
if (!(p[i] == i + 1)) {
num++;
}
}
if (num <= 2) {
cout << "YES" << endl;
} else {
cout... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 764,428 | 764,429 | u091026689 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> p(N);
int num = 0;
for (int i = 0; i < N; i++) {
cin >> p[i];
}
for (int i = 0; i < N; ++i) {
if (!(p[i] == p[i + 1] - 1)) {
num++;
}
}
if (num <= 2) {
cout << "YES" << endl;
} else {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> p(N);
int num = 0;
for (int i = 0; i < N; i++) {
cin >> p[i];
}
for (int i = 0; i < N; ++i) {
if (!(p[i] == i + 1)) {
num++;
}
}
if (num <= 2) {
cout << "YES" << endl;
} else {
cout... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 764,430 | 764,429 | u091026689 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int n;
cin >> n;
int c = 0;
vector<int> p(n);
for (int i = 0; i < n; i++) {
cin >> p[i];
}
for (int i = 0; i < n; i++) {
if (p[i] != i + 1) {
c++;
}
}
if (c <= 2) {
cout << "Yes" << endl;
} else {
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int n;
cin >> n;
int c = 0;
vector<int> p(n);
for (int i = 0; i < n; i++) {
cin >> p[i];
}
for (int i = 0; i < n; i++) {
if (p[i] != i + 1) {
c++;
}
}
if (c <= 2) {
cout << "YES" << endl;
} else {
... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 764,431 | 764,432 | u550014122 | cpp |
p02958 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repr(i, n) for (int i = (n)-1; i >= 0; i--)
using namespace std;
typedef long long ll;
const int INF = 1e9;
int n;
int p[51];
int main() {
cin >> n;
rep(i, n) cin >> p[i];
int count = 0;
string ans = "YES";
for (int i = 0; i < ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repr(i, n) for (int i = (n)-1; i >= 0; i--)
using namespace std;
typedef long long ll;
const int INF = 1e9;
int n;
int p[51];
int main() {
cin >> n;
rep(i, n) cin >> p[i];
int count = 0;
string ans = "YES";
for (int i = 0; i < ... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 764,435 | 764,436 | u620269708 | cpp |
p02958 | //自称高知能系Vtuberの高井茅乃です。
// Twitter: https://twitter.com/takaichino
// YouTube: https://www.youtube.com/channel/UCTOxnI3eOI_o1HRgzq-LEZw
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1999999999
#define REP(i, n) for (int i = 0; i < n; i++)
#define MODA 1000000007
int main() {
int an... | //自称高知能系Vtuberの高井茅乃です。
// Twitter: https://twitter.com/takaichino
// YouTube: https://www.youtube.com/channel/UCTOxnI3eOI_o1HRgzq-LEZw
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1999999999
#define REP(i, n) for (int i = 0; i < n; i++)
#define MODA 1000000007
int main() {
int an... | [] | 764,437 | 764,438 | u450007962 | cpp |
p02958 | #include <bits/stdc++.h>
typedef long long ll;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
using namespace std;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, a, b) for (int i = a; i <= b; i++)
#define revrep(i, s) for (int i = s - 1; i > 0; i--)
#define revrrep(i, s) for (in... | #include <bits/stdc++.h>
typedef long long ll;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
using namespace std;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, a, b) for (int i = a; i <= b; i++)
#define revrep(i, s) for (int i = s - 1; i > 0; i--)
#define revrrep(i, s) for (in... | [
"variable_declaration.type.primitive.change"
] | 764,445 | 764,446 | u729217226 | cpp |
p02958 | #include <algorithm>
#include <iostream>
using namespace std;
int main(void) {
int n, i, a[60], b[60], s = 0;
cin >> n;
for (i = 0; i < n; i++) {
cin >> a[i];
b[i] = a[i];
}
sort(b, b + n);
for (i = 0; i < n; i++)
if (a[i] != b[i])
s++;
if (s < 2)
cout << "YES" << endl;
else
co... | #include <algorithm>
#include <iostream>
using namespace std;
int main(void) {
int n, i, a[60], b[60], s = 0;
cin >> n;
for (i = 0; i < n; i++) {
cin >> a[i];
b[i] = a[i];
}
sort(b, b + n);
for (i = 0; i < n; i++)
if (a[i] != b[i])
s++;
if (s <= 2)
cout << "YES" << endl;
else
c... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 764,447 | 764,448 | u088895504 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, cnt = 0;
for (int i = 1; i <= n; ++i) {
int p;
cin >> p;
if (p != i)
++cnt;
}
if (cnt <= 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, cnt = 0;
cin >> n;
for (int i = 1; i <= n; ++i) {
int p;
cin >> p;
if (p != i)
++cnt;
}
if (cnt <= 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
} | [] | 764,451 | 764,452 | u726604439 | cpp |
p02958 | // 昇順配列のうち間違いが2であれば, それをswapすることで元の昇順配列に戻る
#include <iostream>
using namespace std;
int main() {
int n, memo[51], memo_index[51], cnt = 0;
int a[51];
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
if (i + 1 != a[i])
cnt++;
if (cnt == 2)
cout << "YES" << end... | // 昇順配列のうち間違いが2であれば, それをswapすることで元の昇順配列に戻る
#include <iostream>
using namespace std;
int main() {
int n, memo[51], memo_index[51], cnt = 0;
int a[51];
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
if (i + 1 != a[i])
cnt++;
if (cnt == 2 || cnt == 0)
cout << ... | [
"control_flow.branch.if.condition.change"
] | 764,464 | 764,465 | u522506260 | cpp |
p02958 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
using std::swap;
// priceをキーに降順でソート
// sort(fruits.begin(), fruits.end(),
// [](const fruit& x, const fruit& y) { return x.price > y.price;});
/*
int main() {
int A,B;
std:cin >> A >> B;
... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
using std::swap;
// priceをキーに降順でソート
// sort(fruits.begin(), fruits.end(),
// [](const fruit& x, const fruit& y) { return x.price > y.price;});
/*
int main() {
int A,B;
std:cin >> A >> B;
... | [
"literal.string.change",
"literal.string.case.change",
"expression.operation.binary.change"
] | 764,481 | 764,482 | u786283792 | cpp |
p02958 | #include <bits/stdc++.h>
#include <iostream>
#include <queue>
#include <stdio.h>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<string> vs;
type... | #include <bits/stdc++.h>
#include <iostream>
#include <queue>
#include <stdio.h>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<string> vs;
type... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 764,491 | 764,492 | u977925575 | cpp |
p02958 | #include <bits/stdc++.h>
#include <iomanip>
#include <ios>
#include <stdio.h>
using namespace std;
#define inputInt(a) \
int a; \
cin >> a;
#define inputInt2(a, b) ... | #include <bits/stdc++.h>
#include <iomanip>
#include <ios>
#include <stdio.h>
using namespace std;
#define inputInt(a) \
int a; \
cin >> a;
#define inputInt2(a, b) ... | [] | 764,493 | 764,494 | u135358384 | cpp |
p02958 | #include <iostream>
using namespace std;
int main() {
int N, i, p[51], counter = 0;
cin >> N;
for (i = 1; i <= N; i++) {
cin >> p[i];
if (i == p[i]) {
counter++;
}
}
if (counter <= 2) {
cout << "YES";
} else {
cout << "NO";
}
} | #include <iostream>
using namespace std;
int main() {
int N, i, p[51], counter = 0;
cin >> N;
for (i = 1; i <= N; i++) {
cin >> p[i];
if (i != p[i]) {
counter++;
}
}
if (counter <= 2) {
cout << "YES";
} else {
cout << "NO";
}
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 764,503 | 764,504 | u544511937 | cpp |
p02958 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
int n;
cin >> n;
vector<int> p(n);
rep(i, n) cin >> p[i];
rep(j, n) rep(i, j) {
swap(p[i], p[j]);
bool ok = true;
rep(k, n - 1) if (p[k] > p[k + 1]) ok = false;
if (ok) {
cout <... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
int n;
cin >> n;
vector<int> p(n);
rep(i, n) cin >> p[i];
rep(j, n) rep(i, j + 1) {
swap(p[i], p[j]);
bool ok = true;
rep(k, n - 1) if (p[k] > p[k + 1]) ok = false;
if (ok) {
co... | [
"expression.operation.binary.add"
] | 764,507 | 764,508 | u781095600 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, count = 0;
cin >> n;
vector<int> num(n), base(n);
for (int i = 0; i < n; i++) {
cin >> num[i];
base[i] = num[i];
}
sort(num.begin(), num.end());
for (int i = 0; i < n; i++) {
if (num[i] != base[i])
count++;
}
if (coun... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, count = 0;
cin >> n;
vector<int> num(n), base(n);
for (int i = 0; i < n; i++) {
cin >> num[i];
base[i] = num[i];
}
sort(num.begin(), num.end());
for (int i = 0; i < n; i++) {
if (num[i] != base[i])
count++;
}
if (coun... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 764,522 | 764,523 | u351265848 | cpp |
p02958 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, i, tmp, tmp1, tmp2, res = 0;
vector<int> p;
cin >> n;
res = 0;
for (i = 0; i < n; i++) {
cin >> tmp;
p.push_back(tmp);
}
for (i = 0; i < n; i++) {
if (p[i] != i + 1)
res++;
}
cout << (res == 2 ? "YES" : "N... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, i, tmp, tmp1, tmp2, res = 0;
vector<int> p;
cin >> n;
res = 0;
for (i = 0; i < n; i++) {
cin >> tmp;
p.push_back(tmp);
}
for (i = 0; i < n; i++) {
if (p[i] != i + 1)
res++;
}
cout << (res == 2 || res == 0 ... | [
"expression.operation.binary.add"
] | 764,526 | 764,527 | u331302877 | cpp |
p02958 | #include <iostream>
using namespace std;
const int N = 1e5 + 10;
int main() {
ios::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
int n, cnt = 0, x;
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> x;
if (x != i + 1) {
cnt++;
}
}
if (cnt > 2)
cout << "No";
else
cout << "Yes";
ret... | #include <iostream>
using namespace std;
const int N = 1e5 + 10;
int main() {
ios::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
int n, cnt = 0, x;
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> x;
if (x != i + 1) {
cnt++;
}
}
if (cnt > 2)
cout << "NO";
else
cout << "YES";
ret... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 764,528 | 764,529 | u313596497 | cpp |
p02958 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main(void) {
int n;
cin >> n;
vector<int> p(n);
rep(i, n) cin >> p[i];
int cnt = 0;
rep(i, n - 1) {
if (p[i] > p[i + 1])
cnt++;
}
if (cnt <= 2)
cout << "YES" << endl;
else
cout << "NO" ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main(void) {
int n;
cin >> n;
vector<int> p(n);
rep(i, n) cin >> p[i];
int cnt = 0;
rep(i, n) {
if (p[i] != i + 1)
cnt++;
}
if (cnt <= 2)
cout << "YES" << endl;
else
cout << "NO" << end... | [
"expression.operation.binary.remove",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 764,530 | 764,531 | u980485808 | cpp |
p02958 | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
ll euclid(ll a, ll b) {
int nr = 0;
while (b != 0) {
int c = b;
b = a % b;
a = c;
nr++;
}
return nr;
}
int main() {
int n;
cin >> n;
vector<int> v(n);
int nr = 0;
for (int i = 0; i < n; ... | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
ll euclid(ll a, ll b) {
int nr = 0;
while (b != 0) {
int c = b;
b = a % b;
a = c;
nr++;
}
return nr;
}
int main() {
int n;
cin >> n;
vector<int> v(n);
int nr = 0;
for (int i = 0; i < n; ... | [
"control_flow.branch.if.condition.change"
] | 764,532 | 764,533 | u391340825 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int s;
int N;
cin >> N;
vector<int> p(N);
s = 0;
for (int i = 0; i < N; ++i) {
cin >> p[i];
}
for (int i = 0; i < N; ++i) {
if (p[i] != i + 1) {
++s;
}
}
if (s <= 2) {
cout << "Yes";
} else {
cout << "No";
}
r... | #include <bits/stdc++.h>
using namespace std;
int main() {
int s;
int N;
cin >> N;
vector<int> p(N);
s = 0;
for (int i = 0; i < N; ++i) {
cin >> p[i];
}
for (int i = 0; i < N; ++i) {
if (p[i] != i + 1) {
++s;
}
}
if (s <= 2) {
cout << "YES";
} else {
cout << "NO";
}
r... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 764,536 | 764,537 | u699600793 | cpp |
p02958 | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define forn(i, n) for (i = 0; i < n; ++i)
#define for1(i, n) for (i = 1; i <= n; ++i)
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define fill(x, b) mems... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define forn(i, n) for (i = 0; i < n; ++i)
#define for1(i, n) for (i = 1; i <= n; ++i)
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define fill(x, b) mems... | [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove"
] | 764,538 | 764,539 | u798074794 | cpp |
p02958 | #define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
#include <climits>
#include <cstring>
#include <fstream>
#include <immintrin.h>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <random>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#ifdef _MSC_VE... | #define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
#include <climits>
#include <cstring>
#include <fstream>
#include <immintrin.h>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <random>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#ifdef _MSC_VE... | [] | 764,542 | 764,543 | u034865202 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, c = 1, owo = 0;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
for (int i = 0; i < n; i++) {
if (c != v[i])
owo++;
c++;
}
if (owo <= 2)
cout << "Yes" << endl;
else
cout << "NO" << end... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, c = 1, owo = 0;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
for (int i = 0; i < n; i++) {
if (c != v[i])
owo++;
c++;
}
if (owo <= 2)
cout << "YES" << endl;
else
cout << "NO" << end... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 764,547 | 764,548 | u245688165 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
long long n;
long long k;
long long a[2000006];
int main() {
cin >> n;
int count = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 1; i <= n; i++) {
if (a[i] != i) {
count++;
}
}
if (count == 0 || count == 2) {
cout << "YES";... | #include <bits/stdc++.h>
using namespace std;
long long n;
long long k;
long long a[2000006];
int main() {
cin >> n;
int count = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 1; i <= n; i++) {
if (a[i - 1] != i) {
count++;
}
}
if (count == 0 || count == 2) {
cout << "Y... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 764,549 | 764,550 | u266105150 | cpp |
p02958 | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, p[50], m[50], count = 0;
cin >> N;
f... | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, p[50], m[50], count = 0;
cin >> N;
f... | [
"control_flow.branch.if.condition.change"
] | 764,551 | 764,552 | u531752502 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long int n, i, t = 0;
cin >> n;
int a[n + 1];
for (i = 1; i <= n; i++) {
cin >> a[i];
if (a[i] != i)
t++;
}
if (t != 2)
cout << "NO";
else
cout << "... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long int n, i, t = 0;
cin >> n;
int a[n + 1];
for (i = 1; i <= n; i++) {
cin >> a[i];
if (a[i] != i)
t++;
}
if (t > 2)
cout << "NO";
else
cout << "Y... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 764,555 | 764,556 | u687342084 | cpp |
p02958 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
#define rep(i, n) for (int i =... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
#define rep(i, n) for (int i =... | [
"expression.operation.binary.add"
] | 764,559 | 764,560 | u700986952 | cpp |
p02958 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
const int INF = 100000000;
int main() {
int n;
cin >>... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
const int INF = 100000000;
int main() {
int n;
cin >>... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 764,565 | 764,566 | u489117389 | cpp |
p02958 | #include <bits/stdc++.h>
#define int int64_t
#define rep(i, N) for (int i = 0; i < N; i++)
using namespace std;
using pair = pair<int, int>;
using tup = tuple<int, int, int>;
using vec = vector<int>;
using vvec = vector<vec>;
// プロトタイプ宣言
// int myfunc(int, vvec);
// グローバル変数
// int N, M;
// vvec data(N, vec(M));
// 関... | #include <bits/stdc++.h>
#define int int64_t
#define rep(i, N) for (int i = 0; i < N; i++)
using namespace std;
using pair = pair<int, int>;
using tup = tuple<int, int, int>;
using vec = vector<int>;
using vvec = vector<vec>;
// プロトタイプ宣言
// int myfunc(int, vvec);
// グローバル変数
// int N, M;
// vvec data(N, vec(M));
// 関... | [
"io.output.change"
] | 764,567 | 764,568 | u881160582 | cpp |
p02958 | #include <bits/stdc++.h>
#define int int64_t
#define rep(i, N) for (int i = 0; i < N; i++)
using namespace std;
using pair = pair<int, int>;
using tup = tuple<int, int, int>;
using vec = vector<int>;
using vvec = vector<vec>;
// プロトタイプ宣言
// int myfunc(int, vvec);
// グローバル変数
// int N, M;
// vvec data(N, vec(M));
// 関... | #include <bits/stdc++.h>
#define int int64_t
#define rep(i, N) for (int i = 0; i < N; i++)
using namespace std;
using pair = pair<int, int>;
using tup = tuple<int, int, int>;
using vec = vector<int>;
using vvec = vector<vec>;
// プロトタイプ宣言
// int myfunc(int, vvec);
// グローバル変数
// int N, M;
// vvec data(N, vec(M));
// 関... | [
"io.output.change"
] | 764,569 | 764,568 | u881160582 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int degit(int a);
int main() {
int N;
cin >> N;
int p[N];
for (int i = 0; i < N; i++) {
cin >> p[i];
}
int c = 0;
for (int i = 0; i < N; i++) {
if (i + 1 != p[i])
c++;
}
cout << ((c == 2) ? "YES" : "NO") << endl;
} | #include <bits/stdc++.h>
using namespace std;
int degit(int a);
int main() {
int N;
cin >> N;
int p[N];
for (int i = 0; i < N; i++) {
cin >> p[i];
}
int c = 0;
for (int i = 0; i < N; i++) {
if (i + 1 != p[i])
c++;
}
cout << ((c == 2 || c == 0) ? "YES" : "NO") << endl;
} | [
"expression.operation.binary.add"
] | 764,570 | 764,571 | u423656246 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int(i) = 0; i < (n); i++)
int n;
vector<int> a(n, 0);
bool check() {
bool f = 1;
REP(i, n - 1) if (a.at(i) > a.at(i + 1)) f = 0;
return f;
}
void sw(int i, int j) {
int tmp = a.at(i);
a.at(i) = a.at(j);
a.at(j) = tmp;
}
int main() {
b... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int(i) = 0; i < (n); i++)
int n;
vector<int> a(50, 0);
bool check() {
bool f = 1;
REP(i, n - 1) if (a.at(i) > a.at(i + 1)) f = 0;
return f;
}
void sw(int i, int j) {
int tmp = a.at(i);
a.at(i) = a.at(j);
a.at(j) = tmp;
}
int main() {
... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change"
] | 764,574 | 764,575 | u082801599 | cpp |
p02958 | #include <algorithm>
#include <bits/stdc++.h>
#include <stdio.h>
using namespace std;
#define r(i, n) for (int i = 0; i < n; i++)
#define rn(i, n) for (int i = 1; i <= n; i++)
int main(void) {
int n;
cin >> n;
vector<int> p(n);
vector<int> s(n);
r(i, n) { cin >> p.at(i); }
s = p;
sort(p.begin(), p.end()... | #include <algorithm>
#include <bits/stdc++.h>
#include <stdio.h>
using namespace std;
#define r(i, n) for (int i = 0; i < n; i++)
#define rn(i, n) for (int i = 1; i <= n; i++)
int main(void) {
int n;
cin >> n;
vector<int> p(n);
vector<int> s(n);
r(i, n) { cin >> p.at(i); }
s = p;
sort(p.begin(), p.end()... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 764,581 | 764,582 | u748823501 | cpp |
p02958 | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int p[N];
for (int i = 1; i <= N; i++) {
cin >> p[i];
}
int k = 0;
for (int j = 1; j <= N; j++) {
if (j != p[j])
k += 1;
}
if (k <= 2)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int p[N];
for (int i = 1; i <= N; i++) {
cin >> p[i];
}
int k = 0;
for (int j = 1; j <= N; j++) {
if (j != p[j])
k += 1;
}
if (k <= 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 764,585 | 764,586 | u434355956 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int count = 0;
cin >> N;
vector<int> vec(N + 1);
vec.at(N) = N + 1;
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
for (int i = 0; i < N; i++) {
if (vec.at(i) > vec.at(i + 1)) {
count++;
}
}
if (count == 2 || co... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int count = 0;
cin >> N;
vector<int> vec(N + 1);
vec.at(N) = N + 1;
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
for (int i = 0; i < N; i++) {
if (vec.at(i) != i + 1) {
count++;
}
}
if (count == 2 || count == ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"call.remove"
] | 764,591 | 764,592 | u274435144 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
// int N が既に与えられているとする.
int main() {
int N;
cin >> N;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
int cnt = 0;
for (int i = 0; i < N; i++) {
if (i + 1 != vec.at(i)) {
cnt++;
}
}
if (cnt == 2) {
cout << "YES... | #include <bits/stdc++.h>
using namespace std;
// int N が既に与えられているとする.
int main() {
int N;
cin >> N;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
int cnt = 0;
for (int i = 0; i < N; i++) {
if (i + 1 != vec.at(i)) {
cnt++;
}
}
if (cnt == 2 || cnt == 0) {
... | [
"control_flow.branch.if.condition.change"
] | 764,597 | 764,598 | u667084803 | cpp |
p02958 | #include <bits/stdc++.h>
#include <cstdio>
using namespace std;
typedef long long int ll; // Long long
#define vi vector<int>
#define vii vector<vector<int>>
#define vi_(n) vector<int>((n))
#define vii_(n, m) vector<vector<int>>((n), vector<int>((m)))
#define vi_def(n, def) vector<int>((n), (def))
#define vii_def(n, m... | #include <bits/stdc++.h>
#include <cstdio>
using namespace std;
typedef long long int ll; // Long long
#define vi vector<int>
#define vii vector<vector<int>>
#define vi_(n) vector<int>((n))
#define vii_(n, m) vector<vector<int>>((n), vector<int>((m)))
#define vi_def(n, def) vector<int>((n), (def))
#define vii_def(n, m... | [
"control_flow.branch.if.condition.change"
] | 764,601 | 764,602 | u492047031 | cpp |
p02958 | #include "bits/stdc++.h"
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
const int MOD = 1e9 + 7;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N, num, count = 0;
int a[50];
cin >> N;
rep(i, N) {
cin >> num;
if (i + 1 != num)
count++;
}
if (count <... | #include "bits/stdc++.h"
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
const int MOD = 1e9 + 7;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N, num, count = 0;
int a[50];
cin >> N;
rep(i, N) {
cin >> num;
if (i + 1 != num)
count++;
}
if (count <... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 764,603 | 764,604 | u554988565 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int p[n];
int i, j = 0;
for (i = 0; i < n; i++) {
cin >> p[i];
if (p[i] != n - i) {
j++;
}
}
string ans;
if (j == 0 || j == 2) {
ans = "YES";
} else {
ans = "NO";
}
cout << ans << endl;
return ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int p[n];
int i, j = 0;
for (i = 0; i < n; i++) {
cin >> p[i];
if (p[i] != i + 1) {
j++;
}
}
string ans;
if (j == 0 || j == 2) {
ans = "YES";
} else {
ans = "NO";
}
cout << ans << endl;
return ... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change",
"misc.off_by_one"
] | 764,605 | 764,606 | u122874387 | cpp |
p02958 | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <string>
using namespace std;
int MOD = 1000000007;
int main() {
int N, co = 0;
cin >> N;
int p[N];
for (int i = 0; i < N; i++) {
cin >> p[i];
if (p[i] != i)
co += 1;
}
if (co <= 2)
cout << "YES" << endl;
else... | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <string>
using namespace std;
int MOD = 1000000007;
int main() {
int N, co = 0;
cin >> N;
int p[N];
for (int i = 0; i < N; i++) {
cin >> p[i];
if (p[i] != i + 1)
co += 1;
}
if (co <= 2)
cout << "YES" << endl;
... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 764,612 | 764,613 | u500026208 | cpp |
p02958 | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <string>
using namespace std;
int MOD = 1000000007;
int main() {
int N, co = 0;
cin >> N;
char p[N];
for (int i = 0; i < N; i++) {
cin >> p[i];
if (p[i] != i)
co += 1;
}
if (co <= 2)
cout << "YES" << endl;
els... | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <string>
using namespace std;
int MOD = 1000000007;
int main() {
int N, co = 0;
cin >> N;
int p[N];
for (int i = 0; i < N; i++) {
cin >> p[i];
if (p[i] != i + 1)
co += 1;
}
if (co <= 2)
cout << "YES" << endl;
... | [
"variable_declaration.type.primitive.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 764,614 | 764,613 | u500026208 | cpp |
p02958 | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <string>
using namespace std;
int MOD = 1000000007;
int main() {
int N, co = 0;
cin >> N;
char p[N];
for (int i = 0; i < N; i++) {
cin >> p[i];
if (p[i] != i + 1)
co += 1;
}
if (co <= 2)
cout << "YES" << endl;
... | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <string>
using namespace std;
int MOD = 1000000007;
int main() {
int N, co = 0;
cin >> N;
int p[N];
for (int i = 0; i < N; i++) {
cin >> p[i];
if (p[i] != i + 1)
co += 1;
}
if (co <= 2)
cout << "YES" << endl;
... | [
"variable_declaration.type.primitive.change"
] | 764,615 | 764,613 | u500026208 | cpp |
p02958 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <utility>
#include <vector>
#define int long long int
#define rep(i, n) for (int i = 0; i < (n)... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <utility>
#include <vector>
#define int long long int
#define rep(i, n) for (int i = 0; i < (n)... | [
"expression.operation.binary.add"
] | 764,622 | 764,623 | u558092537 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n + 5], frr[n + 5];
for (int i = 0; i < n; i++)
cin >> arr[i], frr[i];
sort(frr, frr + n);
int counter = 0;
for (int i = 0; i < n; i++) {
if (arr[i] != frr[i])
counter++;
}
if (counter == 2 || counter ==... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n + 5], frr[n + 5];
for (int i = 0; i < n; i++)
cin >> arr[i], frr[i] = arr[i];
sort(frr, frr + n);
int counter = 0;
for (int i = 0; i < n; i++) {
if (arr[i] != frr[i])
counter++;
}
if (counter == 2 || c... | [
"assignment.change"
] | 764,624 | 764,625 | u837843177 | cpp |
p02958 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
vector<int> v;
vector<int> cop... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
vector<int> v;
vector<int> cop... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 764,630 | 764,631 | u931191237 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.