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;
if (p != i + 1)
count++;
}
if (count <= 2)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | #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;
if (p != i + 1)
count++;
}
if (count <= 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
} | [
"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;
ll ct = 0;
for (ll i = 1; i <= n; i++) {
ll x;
cin >> x;
if (x ^ i)
++ct;
}
if (ct ^ 2)
cout << "No";
else
cout << "Yes";
cerr << "\nTime elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
}
// g++ main.cpp -o main.exe -std=c++11 -pipe -O2 -s -static -Wall -Wshadow
/* stuff you should look for
* array bounds
* special cases (n=1?), set tle
* do sth instead of nothing and stay organized
* check for variables with close names
*/ | #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;
ll ct = 0;
for (ll i = 1; i <= n; i++) {
ll x;
cin >> x;
if (x ^ i)
++ct;
}
if (ct && ct ^ 2)
cout << "NO";
else
cout << "YES";
cerr << "\nTime elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
}
// g++ main.cpp -o main.exe -std=c++11 -DEVAL -pipe -O2 -s -static -Wall
// -Wshadow
/* stuff you should look for
* array bounds
* special cases (n=1?), set tle
* do sth instead of nothing and stay organized
* check for variables with close names
*/ | [
"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++) {
chk += (S[i] == P[i]) ? 0 : 1;
}
if (chk == 0 || chk == 2) {
ans = "Yes";
} else {
ans = "No";
}
std::cout << ans << std::endl;
return 0;
} | #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++) {
chk += (S[i] == P[i]) ? 0 : 1;
}
if (chk == 0 || chk == 2) {
ans = "YES";
} else {
ans = "NO";
}
std::cout << ans << std::endl;
return 0;
} | [
"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 endl '\n'
typedef long long ll;
typedef pair<int, int> pii;
const int N = 50 + 5;
const int INF = 1e9;
const int MOD = 1e9 + 7;
int n;
vector<int> a;
bool ok(int i, int j) {
vector<int> b(a);
swap(b[i], b[j]);
for (int k = 0; k < n; k++) {
if (b[k] == k + 1)
continue;
return false;
}
return true;
}
int main() {
IOS
// freopen("input.txt", "r", stdin);
cin >>
n;
a.resize(n);
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
if (ok(i, j))
return 0 * puts("YES");
}
}
puts("NO");
return 0;
}
| #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 endl '\n'
typedef long long ll;
typedef pair<int, int> pii;
const int N = 50 + 5;
const int INF = 1e9;
const int MOD = 1e9 + 7;
int n;
vector<int> a;
bool ok(int i, int j) {
vector<int> b(a);
swap(b[i], b[j]);
for (int k = 0; k < n; k++) {
if (b[k] == k + 1)
continue;
return false;
}
return true;
}
int main() {
IOS
// freopen("input.txt", "r", stdin);
cin >>
n;
a.resize(n);
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < n; i++) {
for (int j = i; j < n; j++) {
if (ok(i, j))
return 0 * puts("YES");
}
}
puts("NO");
return 0;
}
| [
"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 = false;
if (ans)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | #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 = false;
if (ans)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
} | [
"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;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
int t;
t = p[i];
p[i] = p[j];
p[j] = t;
flg |= isAscending(p, n); // cout << endl;
t = p[i];
p[i] = p[j];
p[j] = t;
}
}
cout << (flg ? "YES" : "NO") << endl;
return 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 = isAscending(p, n);
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
int t;
t = p[i];
p[i] = p[j];
p[j] = t;
flg |= isAscending(p, n); // cout << endl;
t = p[i];
p[i] = p[j];
p[j] = t;
}
}
cout << (flg ? "YES" : "NO") << endl;
return 0;
}
| [
"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++) {
for (int j = i + 1; j < n; j++) {
int t;
t = p[i];
p[i] = p[j];
p[j] = t;
flg |= isAscending(p, n);
t = p[i];
p[i] = p[j];
p[j] = t;
}
}
cout << (flg ? "YES" : "NO") << endl;
return 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 = isAscending(p, n);
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
int t;
t = p[i];
p[i] = p[j];
p[j] = t;
flg |= isAscending(p, n); // cout << endl;
t = p[i];
p[i] = p[j];
p[j] = t;
}
}
cout << (flg ? "YES" : "NO") << endl;
return 0;
}
| [
"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) {
cout << "NO" << endl;
} else {
cout << "YES" << endl;
}
return 0;
} | #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) {
cout << "NO" << endl;
} else {
cout << "YES" << endl;
}
return 0;
}
| [
"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 ll longinf = 1LL << 60;
const ll mod = 1e9 + 7;
int main() {
int N;
cin >> N;
vector<int> p;
vector<int> q;
int temp;
REP(i, 0, N) {
cin >> temp;
p.push_back(temp);
q.push_back(temp);
}
sort(p.begin(), p.end());
int diff = 0;
REP(i, 0, N) {
if (p[i] != q[i])
diff++;
}
if ((diff == 2) or (diff == 0))
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
| #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 ll longinf = 1LL << 60;
const ll mod = 1e9 + 7;
int main() {
int N;
cin >> N;
vector<int> p;
vector<int> q;
int temp;
REP(i, 0, N) {
cin >> temp;
p.push_back(temp);
q.push_back(temp);
}
sort(p.begin(), p.end());
int diff = 0;
REP(i, 0, N) {
if (p[i] != q[i])
diff++;
}
if ((diff == 2) or (diff == 0))
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
}
| [
"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;
}
}
//何かしら交換してたらループぬける
if (tmp_min != 0) {
int tmp_i = h[i];
h[i] = h[tmp_min];
h[tmp_min] = tmp_i;
break;
}
}
/* 失敗条件
* 一度交換しても昇順にならない
* ex)2 3 5 4 1など
*
* それ以外なら成功
* */
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]) {
return false;
}
}
}
return true;
}
int main(void) {
/*input*/
int n;
cin >> n;
int h[n];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
/*calc*/
int judge;
judge = judge_yes_or_no(h, n);
/*output*/
if (judge == true) {
cout << "yes" << endl;
} else {
cout << "no" << endl;
}
return 0;
}
| #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;
}
}
//何かしら交換してたらループぬける
if (tmp_min != 0) {
int tmp_i = h[i];
h[i] = h[tmp_min];
h[tmp_min] = tmp_i;
break;
}
}
/* 失敗条件
* 一度交換しても昇順にならない
* ex)2 3 5 4 1など
*
* それ以外なら成功
* */
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]) {
return false;
}
}
}
return true;
}
int main(void) {
/*input*/
int n;
cin >> n;
int p[n];
for (int i = 0; i < n; i++) {
cin >> p[i];
}
/*calc*/
bool judge;
judge = judge_yes_or_no(p, n);
/*output*/
if (judge == true) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
} | [
"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])
count++;
}
if (count <= 2) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | #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])
count++;
}
if (count <= 2) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} | [
"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++;
continue;
} else if (flag == 1 && v.at(i) > v.at(i + 1)) {
k = i + 1;
break;
}
}
if (j != k) {
swap(v.at(j), v.at(k));
}
bool flag = true;
for (int i = 0; i < n; i++) {
if (v.at(i) != i + 1) {
cout << "No";
flag = false;
break;
}
}
if (flag) {
cout << "Yes";
}
return 0;
} | #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++;
continue;
} else if (flag == 1 && v.at(i) > v.at(i + 1)) {
k = i + 1;
break;
}
}
if (j != k) {
swap(v.at(j), v.at(k));
}
bool flag = true;
for (int i = 0; i < n; i++) {
if (v.at(i) != i + 1) {
cout << "NO";
flag = false;
break;
}
}
if (flag) {
cout << "YES";
}
return 0;
} | [
"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) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} | #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) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} | [
"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;
cin >> n;
vector<int> vec(n);
for (int i = 0; i < n; ++i) {
cin >> a;
vec.at(i) = a;
}
vector<int> bacKUp = vec;
for (int j = 0; j < n; ++j) {
for (int i = j; i < n; ++i) {
swap(vec.at(j), vec.at(i));
if (isAllUp(vec)) {
test = true;
break;
} else {
test = false;
}
vec = bacKUp;
}
}
if (test) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| #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;
cin >> n;
vector<int> vec(n);
for (int i = 0; i < n; ++i) {
cin >> a;
vec.at(i) = a;
}
vector<int> bacKUp = vec;
for (int j = 0; j < n; ++j) {
for (int i = j; i < n; ++i) {
swap(vec.at(j), vec.at(i));
if (isAllUp(vec)) {
test = true;
break;
} else {
test = false;
}
vec = bacKUp;
}
}
if (test) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
}
| [
"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 <vector>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, i, j, k, ct;
vector<int> a(n);
ct = 0;
for (i = 0; i < n; i++) {
cin >> a[i];
if (a[i] != i + 1)
ct++;
}
if (ct <= 2)
cout << "YES\n";
else
cout << "NO\n";
return 0;
}
| #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 <vector>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, i, j, k, ct;
cin >> n;
vector<int> a(n);
ct = 0;
for (i = 0; i < n; i++) {
cin >> a[i];
if (a[i] != i + 1)
ct++;
}
if (ct <= 2)
cout << "YES\n";
else
cout << "NO\n";
return 0;
}
| [] | 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++;
}
}
if (cnt == 2 || cnt == 0) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | #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++;
}
}
if (cnt == 2 || cnt == 0) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} | [
"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(i, N) cin >> P[i];
int counter = 0;
string ans = "Yes";
rep(i, N) {
if (P[i] != (i + 1)) {
counter++;
if (2 < counter) {
ans = "No";
break;
}
}
}
cout << ans << endl;
return 0;
} | #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(i, N) cin >> P[i];
int counter = 0;
string ans = "YES";
rep(i, N) {
if (P[i] != (i + 1)) {
counter++;
if (2 < counter) {
ans = "NO";
break;
}
}
}
cout << ans << endl;
return 0;
} | [
"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) {
if (a[i] != p[i])
x++;
}
if (x == 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
} | #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) {
if (a[i] != p[i])
x++;
}
if (x > 2)
cout << "NO" << endl;
else
cout << "YES" << endl;
} | [
"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, N) {
cin >> p[i];
if (p[i] != i + 1) {
++cnt;
}
}
if (cnt <= 2) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
} | #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(i, N) {
cin >> p[i];
if (p[i] != i + 1) {
++cnt;
}
}
if (cnt <= 2) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
}
| [] | 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++) {
if (p[i] != rp[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;
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++) {
if (p[i] != rp[i])
cnt++;
}
if (cnt == 2 || cnt == 0)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
} | [
"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)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
} | #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++) {
if (p[i] != rp[i])
cnt++;
}
if (cnt == 2 || cnt == 0)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
} | [
"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(i, a, b) for (int i = (a), _b = (b); i < (_b); ++i)
#define fort(i, a, b) for (int i = (a), _b = (b); i <= (_b); ++i)
#define ford(i, a, b) for (int i = (a), _b = (b); i >= (_b); --i)
using namespace std;
typedef long long LL;
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ii> vii;
typedef vector<vii> vvii;
const int INF = 1e9 + 3;
const int MOD = 1e9 + 7;
int main() {
if (DEBUG) {
freopen("CP.inp", "r", stdin);
// freopen("CP.out", "w", stdout);
}
ios_base::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vi a(n);
for (int &x : a)
cin >> x;
vi b(a.begin(), a.end());
sort(b.begin(), b.end());
int cnt = 0;
fore(i, 0, n) cnt += (a[i] != b[i]);
if (cnt == 2)
cout << "YES\n";
else
cout << "NO\n";
return 0;
}
| #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(i, a, b) for (int i = (a), _b = (b); i < (_b); ++i)
#define fort(i, a, b) for (int i = (a), _b = (b); i <= (_b); ++i)
#define ford(i, a, b) for (int i = (a), _b = (b); i >= (_b); --i)
using namespace std;
typedef long long LL;
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ii> vii;
typedef vector<vii> vvii;
const int INF = 1e9 + 3;
const int MOD = 1e9 + 7;
int main() {
if (DEBUG) {
freopen("CP.inp", "r", stdin);
// freopen("CP.out", "w", stdout);
}
ios_base::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vi a(n);
for (int &x : a)
cin >> x;
vi b(a.begin(), a.end());
sort(b.begin(), b.end());
int cnt = 0;
fore(i, 0, n) cnt += (a[i] != b[i]);
if (cnt == 2 || cnt == 0)
cout << "YES\n";
else
cout << "NO\n";
return 0;
}
| [
"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(i, a, b) for (int i = (a), _b = (b); i < (_b); ++i)
#define fort(i, a, b) for (int i = (a), _b = (b); i <= (_b); ++i)
#define ford(i, a, b) for (int i = (a), _b = (b); i >= (_b); --i)
using namespace std;
typedef long long LL;
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ii> vii;
typedef vector<vii> vvii;
const int INF = 1e9 + 3;
const int MOD = 1e9 + 7;
int main() {
if (DEBUG) {
freopen("CP.inp", "r", stdin);
// freopen("CP.out", "w", stdout);
}
ios_base::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vi a(n);
for (int &x : a)
cin >> x;
vi b(a.begin(), a.end());
sort(b.begin(), b.end());
int cnt = 0;
fore(i, 0, n) cnt += (a[i] != b[i]);
if (cnt == 2)
cout << "YES\n";
else
cout << "NO\n";
return 0;
}
| #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(i, a, b) for (int i = (a), _b = (b); i < (_b); ++i)
#define fort(i, a, b) for (int i = (a), _b = (b); i <= (_b); ++i)
#define ford(i, a, b) for (int i = (a), _b = (b); i >= (_b); --i)
using namespace std;
typedef long long LL;
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ii> vii;
typedef vector<vii> vvii;
const int INF = 1e9 + 3;
const int MOD = 1e9 + 7;
int main() {
if (DEBUG) {
freopen("CP.inp", "r", stdin);
// freopen("CP.out", "w", stdout);
}
ios_base::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vi a(n);
for (int &x : a)
cin >> x;
vi b(a.begin(), a.end());
sort(b.begin(), b.end());
int cnt = 0;
fore(i, 0, n) cnt += (a[i] != b[i]);
if (cnt == 2 || cnt == 0)
cout << "YES\n";
else
cout << "NO\n";
return 0;
}
| [
"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) sort(all(x)), (x).resize(unique(all(x)) - (x).begin())
#define rep(i, x) for (int i = 0; i < (x); i++)
#define rrep(i, x) for (int i = (x - 1); i >= 0; i--)
#define sqrt(x) sqrt(abs(x))
#define y1 y1_1234413
#define j1 j1_235
#define y0 y0_235
#define j0 j0_256
#define fi first
#define se second
#define re return
#define prev PREV
#define next NEXT
#define sz(x) ((int)x.size())
template <typename T> T sqr(T a) { re a *a; }
template <typename T> T gcd(T a, T b) { re b ? gcd(b, a % b) : a; }
template <typename T> T sgn(T a) { re a > 0 ? 1 : (a < 0 ? -1 : 0); }
template <typename T> T abs(T a) { re a > 0 ? a : -a; }
const int inf = 2e9;
const ld st = 0.000001;
const ld pi = acos((ld)-1);
const int MAXN = 100000;
#define FILENAME ""
int main() {
ios::sync_with_stdio(0);
cin.tie(NULL);
// freopen(FILENAME ".in", "r", stdin);
// freopen(FILENAME ".out", "w", stdout);
ll n;
cin >> n;
vector<ll> a;
for (int i = 0; i < n; i++) {
ll x;
cin >> x;
a.pb(x);
}
vector<ll> b = a;
sort(b.rbegin(), b.rend());
ll ans = 0;
for (int i = 0; i < n; i++) {
if (a[i] != b[i])
ans++;
}
if (ans == 2 || ans == 0) {
cout << "YES";
} else {
cout << "NO";
}
return 0;
} | #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) sort(all(x)), (x).resize(unique(all(x)) - (x).begin())
#define rep(i, x) for (int i = 0; i < (x); i++)
#define rrep(i, x) for (int i = (x - 1); i >= 0; i--)
#define sqrt(x) sqrt(abs(x))
#define y1 y1_1234413
#define j1 j1_235
#define y0 y0_235
#define j0 j0_256
#define fi first
#define se second
#define re return
#define prev PREV
#define next NEXT
#define sz(x) ((int)x.size())
template <typename T> T sqr(T a) { re a *a; }
template <typename T> T gcd(T a, T b) { re b ? gcd(b, a % b) : a; }
template <typename T> T sgn(T a) { re a > 0 ? 1 : (a < 0 ? -1 : 0); }
template <typename T> T abs(T a) { re a > 0 ? a : -a; }
const int inf = 2e9;
const ld st = 0.000001;
const ld pi = acos((ld)-1);
const int MAXN = 100000;
#define FILENAME ""
int main() {
ios::sync_with_stdio(0);
cin.tie(NULL);
// freopen(FILENAME ".in", "r", stdin);
// freopen(FILENAME ".out", "w", stdout);
ll n;
cin >> n;
vector<ll> a;
for (int i = 0; i < n; i++) {
ll x;
cin >> x;
a.pb(x);
}
vector<ll> b = a;
sort(b.begin(), b.end());
ll ans = 0;
for (int i = 0; i < n; i++) {
if (a[i] != b[i])
ans++;
}
if (ans == 2 || ans == 0) {
cout << "YES";
} else {
cout << "NO";
}
return 0;
} | [
"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" << endl;
return 0;
}
}
}
cout << "Yes" << endl;
} | #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" << endl;
return 0;
}
}
}
cout << "YES" << endl;
} | [
"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 FOR(i, a, b) for (int i = a; i < b; i++)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define speed \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
const int INF = 1e9 + 5;
int main() {
int n, x;
cin >> n;
vi v;
for (int i = 0; i < n; i++) {
cin >> x;
v.pb(x);
}
int ans = 0;
for (int i = 0; i < n; i++) {
if (v[i] != (i + 1)) {
ans++;
}
}
if ((ans == 2) || (ans == 0)) {
cout << "Yes";
} else {
cout << "No";
}
} | #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 FOR(i, a, b) for (int i = a; i < b; i++)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define speed \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
const int INF = 1e9 + 5;
int main() {
int n, x;
cin >> n;
vi v;
for (int i = 0; i < n; i++) {
cin >> x;
v.pb(x);
}
int ans = 0;
for (int i = 0; i < n; i++) {
if (v[i] != (i + 1)) {
ans++;
}
}
if ((ans == 2) || (ans == 0)) {
cout << "YES";
} else {
cout << "NO";
}
} | [
"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 = 0; i < n; i++) {
if (arr[arr[i] - 1] != i + 1) {
cnt++;
}
}
// cout<<cnt<<endl;
if (cnt <= 2) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
}
signed main() {
#ifdef _DEBUG
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios::sync_with_stdio(false);
cin.tie(0);
int t = 1;
// cin>>t;
while (t--) {
solve();
}
return 0;
} | #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 = 0; i < n; i++) {
if (arr[i] != i + 1) {
cnt++;
}
}
// cout<<cnt<<endl;
if (cnt <= 2) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
}
signed main() {
#ifdef _DEBUG
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios::sync_with_stdio(false);
cin.tie(0);
int t = 1;
// cin>>t;
while (t--) {
solve();
}
return 0;
} | [
"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)) {
count++;
}
}
if (count == 2) {
cout << "YES" << endl;
return 0;
}
cout << "NO" << endl;
return 0;
} | #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)) {
count++;
}
}
if (count == 2 || count == 0) {
cout << "YES" << endl;
return 0;
}
cout << "NO" << endl;
return 0;
} | [
"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++;
}
if (n - 2 == count or n == count)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | #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++;
}
if (n - 2 == count or n == count)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
} | [
"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 = i + 1; j < n; j++) {
if (min > a[j]) {
min = a[j];
mpoint = j;
}
}
if (a[i] > min) {
if (flag) {
a[i] = a[i] + a[mpoint];
a[mpoint] = a[i] - a[mpoint];
a[i] = a[i] - a[mpoint];
i -= 1;
flag = false;
} else {
cout << "No" << endl;
return 0;
}
}
}
cout << "Yes" << endl;
return 0;
} | #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 = i + 1; j < n; j++) {
if (min > a[j]) {
min = a[j];
mpoint = j;
}
}
if (a[i] > min) {
if (flag) {
a[i] = a[i] + a[mpoint];
a[mpoint] = a[i] - a[mpoint];
a[i] = a[i] - a[mpoint];
i -= 1;
flag = false;
} else {
cout << "NO" << endl;
return 0;
}
}
}
cout << "YES" << endl;
return 0;
} | [
"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) { vecvec.at(i) = i + 1; }
rep(i, n) { cin >> vec.at(i); }
rep(i, n) {
if (vec.at(i) != vecvec.at(i)) {
count++;
}
}
if (count == 0 || count == 2) {
cout << "YES" << endl;
} else {
cout << "No" << endl;
}
return 0;
}
| #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) { vecvec.at(i) = i + 1; }
rep(i, n) { cin >> vec.at(i); }
rep(i, n) {
if (vec.at(i) != vecvec.at(i)) {
count++;
}
}
if (count == 0 || count == 2) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
}
| [
"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()
#define SZ(x) ((int)(x).size())
#define pb push_back
#define mp make_pair
#define INF (1 << 29)
using namespace std;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
typedef pair<int, P> PP;
typedef pair<ll, LP> LPP;
int dy[] = {0, 0, 1, -1, 0};
int dx[] = {1, -1, 0, 0, 0};
template <class T = int> T in() {
T x;
cin >> x;
return (x);
}
template <class T> void print(T &x) { cout << x << '\n'; }
const int MOD = (int)1e9 + 7;
const int MAX = 510000;
ll fac[MAX], finv[MAX], inv[MAX];
void COMint() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
ll COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
ll gcd(ll a, ll b) {
if (b == 0)
return a;
if (a > b) {
swap(a, b);
}
return gcd(a, b % a);
}
ll lcm(ll a, ll b) {
ll g;
g = gcd(a, b);
return a * b / g;
}
bool compare_by_b(pair<int, int> a, pair<int, int> b) {
if (a.second != b.second) {
return a.second < b.second;
} else {
return a.first < b.first;
}
}
bool compare_by_a(pair<int, int> a, pair<int, int> b) {
if (a.first != b.first) {
return a.first < b.first;
} else {
return a.second < b.second;
}
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N = in();
int cnt;
cnt = 0;
int val;
REP(i, N) {
cin >> val;
if (val != i + 1) {
cnt++;
}
}
if (cnt == 0 || cnt == 2) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
}
| #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()
#define SZ(x) ((int)(x).size())
#define pb push_back
#define mp make_pair
#define INF (1 << 29)
using namespace std;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
typedef pair<int, P> PP;
typedef pair<ll, LP> LPP;
int dy[] = {0, 0, 1, -1, 0};
int dx[] = {1, -1, 0, 0, 0};
template <class T = int> T in() {
T x;
cin >> x;
return (x);
}
template <class T> void print(T &x) { cout << x << '\n'; }
const int MOD = (int)1e9 + 7;
const int MAX = 510000;
ll fac[MAX], finv[MAX], inv[MAX];
void COMint() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
ll COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
ll gcd(ll a, ll b) {
if (b == 0)
return a;
if (a > b) {
swap(a, b);
}
return gcd(a, b % a);
}
ll lcm(ll a, ll b) {
ll g;
g = gcd(a, b);
return a * b / g;
}
bool compare_by_b(pair<int, int> a, pair<int, int> b) {
if (a.second != b.second) {
return a.second < b.second;
} else {
return a.first < b.first;
}
}
bool compare_by_a(pair<int, int> a, pair<int, int> b) {
if (a.first != b.first) {
return a.first < b.first;
} else {
return a.second < b.second;
}
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N = in();
int cnt;
cnt = 0;
int val;
REP(i, N) {
cin >> val;
if (val != i + 1) {
cnt++;
}
}
if (cnt == 0 || cnt == 2) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
}
| [
"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 < n - 1; i++) {
for (int j = i + 1; j < n; j++) {
p = r;
int a = p.at(i);
p.at(i) = p.at(j);
p.at(j) = a;
if (p == q) {
ans = true;
break;
}
}
}
if (ans) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | #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 < n - 1; i++) {
for (int j = i + 1; j < n; j++) {
p = r;
int a = p.at(i);
p.at(i) = p.at(j);
p.at(j) = a;
if (p == q) {
ans = true;
break;
}
}
}
if (ans) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} | [
"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" << endl;
else
cout << "NO" << endl;
return 0;
}
| #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; i++)
cin >> p[i];
int diff = 0;
for (int i = 1; i <= n; i++) {
if (p[i - 1] != i)
diff++;
}
if (diff <= 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
}
| [
"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" << endl;
return 0;
}
| #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; i++)
cin >> p[i];
int diff = 0;
for (int i = 1; i <= n; i++) {
if (p[i - 1] != i)
diff++;
}
if (diff <= 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
}
| [
"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" << endl;
} | #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" << endl;
} | [
"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 data[], int len); // data[]を降順ソート
void printIntArray(int data[], int len); // data[]をprint
int *inputArray(
int n); //文字列を受け取り数値を抽出、n個の数値(int)を格納した配列のポインタをreturn
int *cpyArray(int data[], int len); //配列(int)を複製した配列のポインタをreturn
void strInit(char str[]) {
int len = strlen(str);
for (int i = 0; i < len; i++) {
str[i] = 0;
}
}
void extIntStr(char str[], int data[]) {
int length = strlen(str);
str[length - 1] = ' ';
char buff[12];
int j, index;
index = j = 0;
for (int i = 0; i < length; i++) {
if (str[i] != ' ') {
buff[j++] = str[i];
} else {
data[index++] = atoi(buff);
strInit(buff);
j = 0;
}
}
}
void incsort(int data[], int len) {
for (int i = 0; i < len - 1; i++) {
for (int j = i + 1; j < len; j++) {
if (data[i] > data[j]) {
int tmp = data[i];
data[i] = data[j];
data[j] = tmp;
}
}
}
}
void decsort(int data[], int len) {
for (int i = 0; i < len - 1; i++) {
for (int j = i + 1; j < len; j++) {
if (data[i] < data[j]) {
int tmp = data[i];
data[i] = data[j];
data[j] = tmp;
}
}
}
}
void printIntArray(int data[], int len) {
for (int i = 0; i < len; i++) {
printf("%d\n", data[i]);
}
}
int *inputArray(int n) {
int *data;
data = (int *)malloc(sizeof(int) * n);
char *get;
get = (char *)malloc(sizeof(char) * 11 * n + 1);
fgets(get, 11 * n + 1, stdin);
extIntStr(get, data);
free(get);
return data;
}
int *cpyArray(int data[], int len) {
int *cp;
cp = (int *)malloc(sizeof(int) * len);
for (int i = 0; i < len; i++) {
cp[i] = data[i];
}
return cp;
}
// temp##############################################
// don't forget free(data);
int main() {
int n;
scanf("%d ", &n);
int *data;
int *cpy;
data = inputArray(n);
cpy = cpyArray(data, n);
int q = 0;
int i, j;
int min = 0;
incsort(cpy, n);
for (int i = 0; i < n; i++) {
if (cpy[i] != data[i])
q++;
}
if (q > 3)
printf("NO");
else
printf("YES");
return 0;
} | // 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 data[], int len); // data[]を降順ソート
void printIntArray(int data[], int len); // data[]をprint
int *inputArray(
int n); //文字列を受け取り数値を抽出、n個の数値(int)を格納した配列のポインタをreturn
int *cpyArray(int data[], int len); //配列(int)を複製した配列のポインタをreturn
void strInit(char str[]) {
int len = strlen(str);
for (int i = 0; i < len; i++) {
str[i] = 0;
}
}
void extIntStr(char str[], int data[]) {
int length = strlen(str);
str[length - 1] = ' ';
char buff[12];
int j, index;
index = j = 0;
for (int i = 0; i < length; i++) {
if (str[i] != ' ') {
buff[j++] = str[i];
} else {
data[index++] = atoi(buff);
strInit(buff);
j = 0;
}
}
}
void incsort(int data[], int len) {
for (int i = 0; i < len - 1; i++) {
for (int j = i + 1; j < len; j++) {
if (data[i] > data[j]) {
int tmp = data[i];
data[i] = data[j];
data[j] = tmp;
}
}
}
}
void decsort(int data[], int len) {
for (int i = 0; i < len - 1; i++) {
for (int j = i + 1; j < len; j++) {
if (data[i] < data[j]) {
int tmp = data[i];
data[i] = data[j];
data[j] = tmp;
}
}
}
}
void printIntArray(int data[], int len) {
for (int i = 0; i < len; i++) {
printf("%d\n", data[i]);
}
}
int *inputArray(int n) {
int *data;
data = (int *)malloc(sizeof(int) * n);
char *get;
get = (char *)malloc(sizeof(char) * 11 * n + 1);
fgets(get, 11 * n + 1, stdin);
extIntStr(get, data);
free(get);
return data;
}
int *cpyArray(int data[], int len) {
int *cp;
cp = (int *)malloc(sizeof(int) * len);
for (int i = 0; i < len; i++) {
cp[i] = data[i];
}
return cp;
}
// temp##############################################
// don't forget free(data);
int main() {
int n;
scanf("%d ", &n);
int *data;
int *cpy;
data = inputArray(n);
cpy = cpyArray(data, n);
int q = 0;
int i, j;
int min = 0;
incsort(cpy, n);
for (int i = 0; i < n; i++) {
if (cpy[i] != data[i])
q++;
}
if (q > 2)
printf("NO");
else
printf("YES");
return 0;
} | [
"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";
} else {
cout << "NO";
}
return 0;
}
| #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 << "YES";
} else {
cout << "NO";
}
return 0;
}
| [
"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 namespace std;
int main() {
int N;
cin >> N;
int P[N];
int mismatch = 0;
rep(i, N) cin >> P[i];
rep(i, N) {
if (P[i] != i + 1)
mismatch += 1;
}
if (mismatch > 1)
cout << "NO" << endl;
else
cout << "YES" << endl;
}
| // 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 namespace std;
int main() {
int N;
cin >> N;
int P[N];
int mismatch = 0;
rep(i, N) cin >> P[i];
rep(i, N) {
if (P[i] != i + 1)
mismatch += 1;
}
if (mismatch > 2)
cout << "NO" << endl;
else
cout << "YES" << endl;
}
| [
"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 = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
int temp;
temp = b[i];
b[i] = b[j];
b[j] = temp;
e = true;
for (int i = 0; i < n - 1; i++) {
if (b[i] > b[i + 1]) {
e = false;
break;
}
}
if (e == true) {
cout << "YES";
return 0;
} else {
for (int l = 0; l < n; l++) {
b[l] = a[l];
}
}
}
}
}
if (e == true) {
cout << "Yes";
return 0;
}
cout << "NO";
return 0;
} | #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 = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
int temp;
temp = b[i];
b[i] = b[j];
b[j] = temp;
e = true;
for (int i = 0; i < n - 1; i++) {
if (b[i] > b[i + 1]) {
e = false;
break;
}
}
if (e == true) {
cout << "YES";
return 0;
} else {
for (int l = 0; l < n; l++) {
b[l] = a[l];
}
}
}
}
}
if (e == true) {
cout << "YES";
return 0;
}
cout << "NO";
return 0;
} | [
"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 (int i = (int)(a); i <= (int)(b); ++i)
using namespace std;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pii> vpi;
typedef vector<vi> vvi;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef pair<ll, ll> pll;
typedef double ld;
template <class T> bool uin(T &a, T b) { return a > b ? (a = b, true) : false; }
template <class T> bool uax(T &a, T b) { return a < b ? (a = b, true) : false; }
int main() {
int n;
scanf("%d", &n);
int store[n + 1];
for1(i, n) scanf("%d", &store[i]);
int off = 0;
for (int i = 1; i <= n; i++) {
if (store[i] != i)
off++;
}
off == 2 || off == 0 ? printf("%s", "Yes") : printf("%s", "No");
return 0;
} | #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 (int i = (int)(a); i <= (int)(b); ++i)
using namespace std;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pii> vpi;
typedef vector<vi> vvi;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef pair<ll, ll> pll;
typedef double ld;
template <class T> bool uin(T &a, T b) { return a > b ? (a = b, true) : false; }
template <class T> bool uax(T &a, T b) { return a < b ? (a = b, true) : false; }
int main() {
int n;
scanf("%d", &n);
int store[n + 1];
for1(i, n) scanf("%d", &store[i]);
int off = 0;
for (int i = 1; i <= n; i++) {
if (store[i] != i)
off++;
}
off == 2 || off == 0 ? printf("%s", "YES") : printf("%s", "NO");
return 0;
} | [
"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 {
cout << "YES" << endl;
}
}
| #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 {
cout << "YES" << endl;
}
}
| [
"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>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <utility>
#include <vector>
#define ios ios_base::sync_with_stdio(0), cout.tie(0), cin.tie(0);
#define S second
#define F first
#define pb push_back
#define nl '\n'
#define NL cout << '\n';
#define EX exit(0)
#define all(s) s.begin(), s.end()
#define FOR(i, start, finish, k) for (int i = start; i <= finish; i += k)
const int MXN = 1e6 + 200;
const long long MNN = 2e3 + 200;
const long long MOD = 1e9 + 7;
const long long INF = 1e18;
const int OO = 1e9 + 500;
typedef long long llong;
typedef unsigned long long ullong;
using namespace std;
llong n, b[MXN], a[MXN], cnt;
int main() {
ios;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> b[i];
a[i] = b[i];
}
sort(a + 1, a + n + 1);
for (int i = 1; i <= n; i++) {
if (a[i] == b[i])
cnt++;
}
if (cnt <= 2)
cout << "YES";
else
cout << "NO";
return 0;
}
| //
// 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>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <utility>
#include <vector>
#define ios ios_base::sync_with_stdio(0), cout.tie(0), cin.tie(0);
#define S second
#define F first
#define pb push_back
#define nl '\n'
#define NL cout << '\n';
#define EX exit(0)
#define all(s) s.begin(), s.end()
#define FOR(i, start, finish, k) for (int i = start; i <= finish; i += k)
const int MXN = 1e6 + 200;
const long long MNN = 2e3 + 200;
const long long MOD = 1e9 + 7;
const long long INF = 1e18;
const int OO = 1e9 + 500;
typedef long long llong;
typedef unsigned long long ullong;
using namespace std;
llong n, b[MXN], a[MXN], cnt;
int main() {
ios;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> b[i];
a[i] = b[i];
}
sort(a + 1, a + n + 1);
for (int i = 1; i <= n; i++) {
if (a[i] != b[i])
cnt++;
}
if (cnt <= 2)
cout << "YES";
else
cout << "NO";
return 0;
}
| [
"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>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <utility>
#include <vector>
#define ios ios_base::sync_with_stdio(0), cout.tie(0), cin.tie(0);
#define S second
#define F first
#define pb push_back
#define nl '\n'
#define NL cout << '\n';
#define EX exit(0)
#define all(s) s.begin(), s.end()
#define FOR(i, start, finish, k) for (int i = start; i <= finish; i += k)
const int MXN = 3e5 + 200;
const long long MNN = 2e3 + 200;
const long long MOD = 1e9 + 7;
const long long INF = 1e18;
const int OO = 1e9 + 500;
typedef long long llong;
typedef unsigned long long ullong;
using namespace std;
llong n, b[MXN], a[MXN], cnt;
int main() {
ios;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> b[i];
a[i] = b[i];
}
sort(a + 1, a + n + 1);
for (int i = 1; i <= n; i++) {
if (a[i] == b[i])
cnt++;
}
if (cnt <= 2)
cout << "Yes";
else
cout << "No";
return 0;
}
| //
// 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>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <utility>
#include <vector>
#define ios ios_base::sync_with_stdio(0), cout.tie(0), cin.tie(0);
#define S second
#define F first
#define pb push_back
#define nl '\n'
#define NL cout << '\n';
#define EX exit(0)
#define all(s) s.begin(), s.end()
#define FOR(i, start, finish, k) for (int i = start; i <= finish; i += k)
const int MXN = 1e6 + 200;
const long long MNN = 2e3 + 200;
const long long MOD = 1e9 + 7;
const long long INF = 1e18;
const int OO = 1e9 + 500;
typedef long long llong;
typedef unsigned long long ullong;
using namespace std;
llong n, b[MXN], a[MXN], cnt;
int main() {
ios;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> b[i];
a[i] = b[i];
}
sort(a + 1, a + n + 1);
for (int i = 1; i <= n; i++) {
if (a[i] != b[i])
cnt++;
}
if (cnt <= 2)
cout << "YES";
else
cout << "NO";
return 0;
}
| [
"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 {
cout << "NO" << endl;
}
}
| #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 << "NO" << endl;
}
}
| [
"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 {
cout << "NO" << endl;
}
}
| #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 << "NO" << endl;
}
}
| [
"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 {
cout << "No" << endl;
}
return 0;
}
| #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 {
cout << "NO" << endl;
}
return 0;
}
| [
"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 < n; ++i) {
if (p[i] != i + 1) {
count++;
}
if (count >= 4) {
ans = "NO";
break;
}
}
cout << ans << endl;
return 0;
}
| #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 < n; ++i) {
if (p[i] != i + 1) {
count++;
}
if (count >= 3) {
ans = "NO";
break;
}
}
cout << ans << endl;
return 0;
}
| [
"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 ans = 0;
int n, p;
for (int i = 1; i <= n; i++) {
cin >> p;
if (p != i)
ans++;
}
if (ans <= 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
} | //自称高知能系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 ans = 0;
int n, p;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> p;
// cout << p << i << endl;
if (p != i)
ans++;
}
if (ans <= 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
} | [] | 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 (int i = s - 1; i >= 0; i--)
#define all(a) begin((a)), end((a))
#define uniq(c) (c).erase(unique(all((c))), end((c)))
int main() {
int N;
cin >> N;
int cnt = 0;
rrep(i, 1, N) {
int p;
cin >> p;
if (i != p)
++cnt;
}
if (cnt / 2 <= 1)
cout << "YES" << endl;
else
cout << "NO" << endl;
} | #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 (int i = s - 1; i >= 0; i--)
#define all(a) begin((a)), end((a))
#define uniq(c) (c).erase(unique(all((c))), end((c)))
int main() {
double N;
cin >> N;
double cnt = 0;
rrep(i, 1, N) {
int p;
cin >> p;
if (i != p)
++cnt;
}
if (cnt / 2 <= 1)
cout << "YES" << endl;
else
cout << "NO" << endl;
} | [
"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
cout << "NO" << endl;
return 0;
} | #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
cout << "NO" << endl;
return 0;
} | [
"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" << endl;
else
cout << "NO" << endl;
} | // 昇順配列のうち間違いが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 << "YES" << endl;
else
cout << "NO" << endl;
} | [
"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;
if((A+B)%2==1){
std::cout << "IMPOSSIBLE" <<std::endl;
}
else{
std::cout << (A+B)/2 << std::endl;
}
return 0;
}
*/
int main() {
int N;
std::cin >> N;
int a[N];
int flg = 0;
for (int i = 0; i < N; i++) {
std::cin >> a[i];
}
for (int i = 0; i < N; i++) {
if (a[i] != i + 1) {
flg++;
}
if (flg == 3) {
std::cout << "No" << std::endl;
return 0;
}
}
std::cout << "Yes" << std::endl;
return 0;
}
| #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;
if((A+B)%2==1){
std::cout << "IMPOSSIBLE" <<std::endl;
}
else{
std::cout << (A+B)/2 << std::endl;
}
return 0;
}
*/
int main() {
int N;
std::cin >> N;
int a[N];
int flg = 0;
for (int i = 0; i < N; i++) {
std::cin >> a[i];
}
for (int i = 0; i < N; i++) {
if (a[i] != i + 1) {
flg++;
}
if (flg == 3) {
std::cout << "NO" << std::endl;
return 0;
}
}
std::cout << "YES" << std::endl;
return 0;
}
| [
"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;
typedef vector<vs> vvs;
typedef vector<pair<int, int>> vpi;
typedef vector<tuple<int, int, int>> vti;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
vpi p(n);
for (int i = 0; i < n; i++) {
int t;
cin >> t;
p[i] = make_pair(t, i);
}
sort(p.begin(), p.end());
int cnt = 0;
for (int i = 0; i < n; i++) {
if (i != p[i].second)
cnt++;
}
if (cnt == 2 || cnt == 0)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| #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;
typedef vector<vs> vvs;
typedef vector<pair<int, int>> vpi;
typedef vector<tuple<int, int, int>> vti;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
vpi p(n);
for (int i = 0; i < n; i++) {
int t;
cin >> t;
p[i] = make_pair(t, i);
}
sort(p.begin(), p.end());
int cnt = 0;
for (int i = 0; i < n; i++) {
if (i != p[i].second)
cnt++;
}
if (cnt == 2 || cnt == 0)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
| [
"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) \
int a; \
int b; \
cin >> a >> b;
#define inputInt3(a, b, c) \
int a; \
int b; \
int c; \
cin >> a >> b >> c;
#define inputLong(a) \
long a; \
cin >> a;
#define inputIntArray(a, N) \
int a[N]; \
for (int i = 0; i < N; i++) { \
cin >> a[i]; \
}
#define inputLongArray(a, N) \
long a[N]; \
for (int i = 0; i < N; i++) { \
cin >> a[i]; \
}
#define inputIntArray2(a, b, N) \
int a[N]; \
int b[N]; \
for (int i = 0; i < N; i++) { \
cin >> a[i] >> b[i]; \
}
#define output(answer) cout << answer << endl;
#define fN(i, N) for (int i = 0; i < N; i++)
#define fSE(i, s, e) for (int i = s; i <= e; i++)
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
int main() {
// input
int N;
vector<int> p(N, 0);
for (int i = 0; i < N; i++) {
cin >> p[i];
}
// main
int count = 0;
for (int i = 0; i < N; i++) {
if (p[i] != i + 1) {
count++;
}
}
// output
if (count <= 2) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
}
| #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) \
int a; \
int b; \
cin >> a >> b;
#define inputInt3(a, b, c) \
int a; \
int b; \
int c; \
cin >> a >> b >> c;
#define inputLong(a) \
long a; \
cin >> a;
#define inputIntArray(a, N) \
int a[N]; \
for (int i = 0; i < N; i++) { \
cin >> a[i]; \
}
#define inputLongArray(a, N) \
long a[N]; \
for (int i = 0; i < N; i++) { \
cin >> a[i]; \
}
#define inputIntArray2(a, b, N) \
int a[N]; \
int b[N]; \
for (int i = 0; i < N; i++) { \
cin >> a[i] >> b[i]; \
}
#define output(answer) cout << answer << endl;
#define fN(i, N) for (int i = 0; i < N; i++)
#define fSE(i, s, e) for (int i = s; i <= e; i++)
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
int main() {
// input
int N;
cin >> N;
vector<int> p(N, 0);
for (int i = 0; i < N; i++) {
cin >> p[i];
}
// main
int count = 0;
for (int i = 0; i < N; i++) {
if (p[i] != i + 1) {
count++;
}
}
// output
if (count <= 2) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
}
| [] | 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 << "YES" << endl;
return 0;
}
swap(p[i], p[j]);
}
cout << "NO" << endl;
return 0;
}
| #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) {
cout << "YES" << endl;
return 0;
}
swap(p[i], p[j]);
}
cout << "NO" << endl;
return 0;
}
| [
"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 (count < 3)
cout << "YES";
else
cout << "No";
cout << endl;
} | #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 (count < 3)
cout << "YES";
else
cout << "NO";
cout << endl;
}
| [
"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" : "NO") << endl;
} | #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 ? "YES" : "NO") << endl;
} | [
"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";
return 0;
} | #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";
return 0;
} | [
"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" << endl;
return 0;
}
| #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" << endl;
return 0;
}
| [
"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; i++) {
cin >> v[i];
if (v[i] != i + 1) {
nr++;
}
}
if (nr != 2) {
cout << "NO";
} else {
cout << "YES";
}
return 0;
}
| #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; i++) {
cin >> v[i];
if (v[i] != i + 1) {
nr++;
}
}
if (nr != 2 && nr != 0) {
cout << "NO";
} else {
cout << "YES";
}
return 0;
}
| [
"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";
}
return 0;
} | #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";
}
return 0;
} | [
"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) memset((x), b, sizeof((x)))
#define fill2D(x, r, c, b) memset((x), b, sizeof(x[0][0]) * r * c)
#define whatIs(a) cout << #a << " is : " << a << endl
typedef long long ll;
typedef vector<ll> vi;
typedef vector<ll> vll;
typedef vector<vi> vvi;
typedef vector<vll> vvll;
typedef vector<string> vs;
typedef vector<vs> vvs;
const ll mod = 1e9 + 7;
clock_t t1, t2;
ll binPow(ll a, ll b) {
ll x = 1, y = a;
while (b) {
if (b & 1)
x = (x * y) % mod;
y = (y * y) % mod;
b >>= 1;
}
return x % mod;
}
ll inverserEuler(ll n) { return binPow(n, mod - 2); }
ll C(ll k, ll n) {
vll f(n + 1, 1);
for (ll i = 2; i <= n; i++)
f[i] = (f[i - 1] * i) % mod;
return (f[n] * ((inverserEuler(f[k]) * inverserEuler(f[n - k])) % mod) %
mod) %
mod;
}
/* Extend Euclid: ax + by = c;
ll x, y;
void extendEuclid(ll a, ll b){if(b == 0){x = 1;y =
0;return;}extendEuclid(b,a%b);ll x1 = y, y1 = x - (a/b) * y;x = x1;y = y1;}
// nghiem : x + (b/d)*k, y - (a/d) * k;
*/
/*--------------------------------------------------------------------------------------------------*/
void trunghieu() {
int n;
cin >> n;
vi a(n);
int i, j;
forn(i, n) cin >> a[i];
auto b = a;
sort(all(b));
forn(i, n) {
for (j = i + 1; j < n; j++) {
auto c = a;
swap(c[i], c[j]);
if (c == b) {
cout << "YES";
return;
}
}
}
cout << "NO";
}
int main() {
ios::sync_with_stdio(false);
cin.tie();
#ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt","w",stdout);
#endif
trunghieu();
return 0;
} | #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) memset((x), b, sizeof((x)))
#define fill2D(x, r, c, b) memset((x), b, sizeof(x[0][0]) * r * c)
#define whatIs(a) cout << #a << " is : " << a << endl
typedef long long ll;
typedef vector<ll> vi;
typedef vector<ll> vll;
typedef vector<vi> vvi;
typedef vector<vll> vvll;
typedef vector<string> vs;
typedef vector<vs> vvs;
const ll mod = 1e9 + 7;
clock_t t1, t2;
ll binPow(ll a, ll b) {
ll x = 1, y = a;
while (b) {
if (b & 1)
x = (x * y) % mod;
y = (y * y) % mod;
b >>= 1;
}
return x % mod;
}
ll inverserEuler(ll n) { return binPow(n, mod - 2); }
ll C(ll k, ll n) {
vll f(n + 1, 1);
for (ll i = 2; i <= n; i++)
f[i] = (f[i - 1] * i) % mod;
return (f[n] * ((inverserEuler(f[k]) * inverserEuler(f[n - k])) % mod) %
mod) %
mod;
}
/* Extend Euclid: ax + by = c;
ll x, y;
void extendEuclid(ll a, ll b){if(b == 0){x = 1;y =
0;return;}extendEuclid(b,a%b);ll x1 = y, y1 = x - (a/b) * y;x = x1;y = y1;}
// nghiem : x + (b/d)*k, y - (a/d) * k;
*/
/*--------------------------------------------------------------------------------------------------*/
void trunghieu() {
int n;
cin >> n;
vi a(n);
int i, j;
forn(i, n) cin >> a[i];
auto b = a;
sort(all(b));
forn(i, n) {
for (j = i; j < n; j++) {
auto c = a;
swap(c[i], c[j]);
if (c == b) {
cout << "YES";
return;
}
}
}
cout << "NO";
}
int main() {
ios::sync_with_stdio(false);
cin.tie();
#ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt","w",stdout);
#endif
trunghieu();
return 0;
} | [
"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_VER
#include <ppl.h>
#endif
using namespace std;
#define DUMPOUT std::cerr
#define dump(...) \
DUMPOUT << " "; \
DUMPOUT << #__VA_ARGS__ << " :[" << __LINE__ << ":" << __FUNCTION__ << "]" \
<< std::endl; \
DUMPOUT << " "; \
dump_func(__VA_ARGS__)
typedef unsigned uint;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
typedef pair<string, string> pss;
template <typename _KTy, typename _Ty>
ostream &operator<<(ostream &o, const pair<_KTy, _Ty> &m) {
o << "{" << m.first << ", " << m.second << "}";
return o;
}
template <typename _KTy, typename _Ty>
ostream &operator<<(ostream &o, const map<_KTy, _Ty> &m) {
if (m.empty()) {
o << "{ }";
return o;
}
o << "{" << *m.begin();
for (auto itr = ++m.begin(); itr != m.end(); itr++) {
o << ", " << *itr;
}
o << "}";
return o;
}
template <typename _KTy, typename _Ty>
ostream &operator<<(ostream &o, const unordered_map<_KTy, _Ty> &m) {
if (m.empty()) {
o << "{ }";
return o;
}
o << "{" << *m.begin();
for (auto itr = ++m.begin(); itr != m.end(); itr++) {
o << ", " << *itr;
}
o << "}";
return o;
}
template <typename _Ty> ostream &operator<<(ostream &o, const vector<_Ty> &v) {
if (v.empty()) {
o << "{ }";
return o;
}
o << "{" << v.front();
for (auto itr = ++v.begin(); itr != v.end(); itr++) {
o << ", " << *itr;
}
o << "}";
return o;
}
template <typename _Ty> ostream &operator<<(ostream &o, const set<_Ty> &s) {
if (s.empty()) {
o << "{ }";
return o;
}
o << "{" << *(s.begin());
for (auto itr = ++s.begin(); itr != s.end(); itr++) {
o << ", " << *itr;
}
o << "}";
return o;
}
template <typename _Ty>
ostream &operator<<(ostream &o, const unordered_set<_Ty> &s) {
if (s.empty()) {
o << "{ }";
return o;
}
o << "{" << *(s.begin());
for (auto itr = ++s.begin(); itr != s.end(); itr++) {
o << ", " << *itr;
}
o << "}";
return o;
}
template <typename _Ty> ostream &operator<<(ostream &o, const stack<_Ty> &s) {
if (s.empty()) {
o << "{ }";
return o;
}
stack<_Ty> t(s);
o << "{" << t.top();
t.pop();
while (!t.empty()) {
o << ", " << t.top();
t.pop();
}
o << "}";
return o;
}
template <typename _Ty> ostream &operator<<(ostream &o, const list<_Ty> &l) {
if (l.empty()) {
o << "{ }";
return o;
}
o << "{" << l.front();
for (auto itr = ++l.begin(); itr != l.end(); ++itr) {
o << ", " << *itr;
}
o << "}";
return o;
}
template <typename _KTy, typename _Ty>
istream &operator>>(istream &is, pair<_KTy, _Ty> &m) {
is >> m.first >> m.second;
return is;
}
template <typename _Ty> istream &operator>>(istream &is, vector<_Ty> &v) {
for (size_t i = 0; i < v.size(); i++)
is >> v[i];
return is;
}
namespace aux { // print tuple
template <typename Ty, unsigned N, unsigned L> struct tp {
static void print(ostream &os, const Ty &v) {
os << get<N>(v) << ", ";
tp<Ty, N + 1, L>::print(os, v);
}
};
template <typename Ty, unsigned N> struct tp<Ty, N, N> {
static void print(ostream &os, const Ty &v) { os << get<N>(v); }
};
} // namespace aux
template <typename... Tys>
ostream &operator<<(ostream &os, const tuple<Tys...> &t) {
os << "{";
aux::tp<tuple<Tys...>, 0, sizeof...(Tys) - 1>::print(os, t);
os << "}";
return os;
}
template <typename A, size_t N, typename T>
inline void Fill(A (&array)[N], const T &val) {
std::fill((T *)array, (T *)(array + N), val);
}
void dump_func() { DUMPOUT << std::endl; }
template <class Head, class... Tail>
void dump_func(Head &&head, Tail &&...tail) {
DUMPOUT << head;
if (sizeof...(Tail) == 0) {
DUMPOUT << " ";
} else {
DUMPOUT << ", ";
}
dump_func(std::move(tail)...);
}
template <typename Ty> Ty modpow(Ty n, Ty e, Ty m) {
Ty result = 1;
while (e > 0) {
if (e & 1)
result = (result * n) % m;
e >>= 1;
n = (n * n) % m;
}
return result;
}
#define PI 3.14159265358979323846
#define EPS 1e-10
#define FOR(i, a, n) for (int i = (a); i < (n); ++i)
#define REP(i, n) FOR(i, 0, n)
#define all(j) (j).begin(), (j).end()
#define SZ(j) ((int)(j).size())
#define fake false
class timer {
public:
double t = 0;
timer() {}
void measure() { t = time() - t; }
static double time() {
#ifdef _MSC_VER
return __rdtsc() / 2.8e9;
#else
unsigned long long a, d;
__asm__ volatile("rdtsc" : "=a"(a), "=d"(d));
return (d << 32 | a) / 2.8e9;
#endif
}
} timer;
struct Xorshift {
uint64_t x = 88172645463325252LL;
unsigned nextUInt() {
x = x ^ (x << 7);
return x = x ^ (x >> 9);
}
unsigned nextUInt(unsigned mod) {
x = x ^ (x << 7);
x = x ^ (x >> 9);
return x % mod;
}
unsigned nextUInt(unsigned l, unsigned r) {
x = x ^ (x << 7);
x = x ^ (x >> 9);
return x % (r - l + 1) + l;
}
double nextDouble() { return double(nextUInt()) / UINT_MAX; }
} rnd;
int main() {
timer.measure();
cin.tie(0);
ios::sync_with_stdio(false);
int N;
vector<int> p(N);
cin >> p;
int d = 0;
REP(i, N) if (p[i] != i + 1) d++;
cout << (d <= 2 ? "YES" : "NO") << endl;
return 0;
}
| #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_VER
#include <ppl.h>
#endif
using namespace std;
#define DUMPOUT std::cerr
#define dump(...) \
DUMPOUT << " "; \
DUMPOUT << #__VA_ARGS__ << " :[" << __LINE__ << ":" << __FUNCTION__ << "]" \
<< std::endl; \
DUMPOUT << " "; \
dump_func(__VA_ARGS__)
typedef unsigned uint;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
typedef pair<string, string> pss;
template <typename _KTy, typename _Ty>
ostream &operator<<(ostream &o, const pair<_KTy, _Ty> &m) {
o << "{" << m.first << ", " << m.second << "}";
return o;
}
template <typename _KTy, typename _Ty>
ostream &operator<<(ostream &o, const map<_KTy, _Ty> &m) {
if (m.empty()) {
o << "{ }";
return o;
}
o << "{" << *m.begin();
for (auto itr = ++m.begin(); itr != m.end(); itr++) {
o << ", " << *itr;
}
o << "}";
return o;
}
template <typename _KTy, typename _Ty>
ostream &operator<<(ostream &o, const unordered_map<_KTy, _Ty> &m) {
if (m.empty()) {
o << "{ }";
return o;
}
o << "{" << *m.begin();
for (auto itr = ++m.begin(); itr != m.end(); itr++) {
o << ", " << *itr;
}
o << "}";
return o;
}
template <typename _Ty> ostream &operator<<(ostream &o, const vector<_Ty> &v) {
if (v.empty()) {
o << "{ }";
return o;
}
o << "{" << v.front();
for (auto itr = ++v.begin(); itr != v.end(); itr++) {
o << ", " << *itr;
}
o << "}";
return o;
}
template <typename _Ty> ostream &operator<<(ostream &o, const set<_Ty> &s) {
if (s.empty()) {
o << "{ }";
return o;
}
o << "{" << *(s.begin());
for (auto itr = ++s.begin(); itr != s.end(); itr++) {
o << ", " << *itr;
}
o << "}";
return o;
}
template <typename _Ty>
ostream &operator<<(ostream &o, const unordered_set<_Ty> &s) {
if (s.empty()) {
o << "{ }";
return o;
}
o << "{" << *(s.begin());
for (auto itr = ++s.begin(); itr != s.end(); itr++) {
o << ", " << *itr;
}
o << "}";
return o;
}
template <typename _Ty> ostream &operator<<(ostream &o, const stack<_Ty> &s) {
if (s.empty()) {
o << "{ }";
return o;
}
stack<_Ty> t(s);
o << "{" << t.top();
t.pop();
while (!t.empty()) {
o << ", " << t.top();
t.pop();
}
o << "}";
return o;
}
template <typename _Ty> ostream &operator<<(ostream &o, const list<_Ty> &l) {
if (l.empty()) {
o << "{ }";
return o;
}
o << "{" << l.front();
for (auto itr = ++l.begin(); itr != l.end(); ++itr) {
o << ", " << *itr;
}
o << "}";
return o;
}
template <typename _KTy, typename _Ty>
istream &operator>>(istream &is, pair<_KTy, _Ty> &m) {
is >> m.first >> m.second;
return is;
}
template <typename _Ty> istream &operator>>(istream &is, vector<_Ty> &v) {
for (size_t i = 0; i < v.size(); i++)
is >> v[i];
return is;
}
namespace aux { // print tuple
template <typename Ty, unsigned N, unsigned L> struct tp {
static void print(ostream &os, const Ty &v) {
os << get<N>(v) << ", ";
tp<Ty, N + 1, L>::print(os, v);
}
};
template <typename Ty, unsigned N> struct tp<Ty, N, N> {
static void print(ostream &os, const Ty &v) { os << get<N>(v); }
};
} // namespace aux
template <typename... Tys>
ostream &operator<<(ostream &os, const tuple<Tys...> &t) {
os << "{";
aux::tp<tuple<Tys...>, 0, sizeof...(Tys) - 1>::print(os, t);
os << "}";
return os;
}
template <typename A, size_t N, typename T>
inline void Fill(A (&array)[N], const T &val) {
std::fill((T *)array, (T *)(array + N), val);
}
void dump_func() { DUMPOUT << std::endl; }
template <class Head, class... Tail>
void dump_func(Head &&head, Tail &&...tail) {
DUMPOUT << head;
if (sizeof...(Tail) == 0) {
DUMPOUT << " ";
} else {
DUMPOUT << ", ";
}
dump_func(std::move(tail)...);
}
template <typename Ty> Ty modpow(Ty n, Ty e, Ty m) {
Ty result = 1;
while (e > 0) {
if (e & 1)
result = (result * n) % m;
e >>= 1;
n = (n * n) % m;
}
return result;
}
#define PI 3.14159265358979323846
#define EPS 1e-10
#define FOR(i, a, n) for (int i = (a); i < (n); ++i)
#define REP(i, n) FOR(i, 0, n)
#define all(j) (j).begin(), (j).end()
#define SZ(j) ((int)(j).size())
#define fake false
class timer {
public:
double t = 0;
timer() {}
void measure() { t = time() - t; }
static double time() {
#ifdef _MSC_VER
return __rdtsc() / 2.8e9;
#else
unsigned long long a, d;
__asm__ volatile("rdtsc" : "=a"(a), "=d"(d));
return (d << 32 | a) / 2.8e9;
#endif
}
} timer;
struct Xorshift {
uint64_t x = 88172645463325252LL;
unsigned nextUInt() {
x = x ^ (x << 7);
return x = x ^ (x >> 9);
}
unsigned nextUInt(unsigned mod) {
x = x ^ (x << 7);
x = x ^ (x >> 9);
return x % mod;
}
unsigned nextUInt(unsigned l, unsigned r) {
x = x ^ (x << 7);
x = x ^ (x >> 9);
return x % (r - l + 1) + l;
}
double nextDouble() { return double(nextUInt()) / UINT_MAX; }
} rnd;
int main() {
timer.measure();
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<int> p(N);
cin >> p;
int d = 0;
REP(i, N) if (p[i] != i + 1) d++;
cout << (d <= 2 ? "YES" : "NO") << endl;
return 0;
}
| [] | 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" << endl;
return 0;
}
| #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" << endl;
return 0;
}
| [
"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";
} else {
cout << "NO";
}
}
| #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 << "YES";
} else {
cout << "NO";
}
}
| [
"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;
for (int i = 0; i < N; i++) {
cin >> p[i];
m[i] = i + 1;
if (p[i] == m[i])
count++;
}
if (count == N - 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
} | #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;
for (int i = 0; i < N; i++) {
cin >> p[i];
m[i] = i + 1;
if (p[i] == m[i])
count++;
}
if (count == N - 2 || count == N)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
} | [
"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 << "YES";
return 0;
}
| #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 << "YES";
return 0;
}
| [
"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 = 0; i < (n); ++i)
#define all(x) x.begin(), x.end()
const ll mod = 1e9 + 7;
const ll INF = 1e9;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int main() {
int n;
cin >> n;
vector<int> p(n);
rep(i, n) cin >> p[i], p[i]--;
int cnt = 0;
rep(i, n) if (p[i] != i) cnt++;
cout << (cnt == 2 ? "YES" : "NO") << endl;
return 0;
} | #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 = 0; i < (n); ++i)
#define all(x) x.begin(), x.end()
const ll mod = 1e9 + 7;
const ll INF = 1e9;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int main() {
int n;
cin >> n;
vector<int> p(n);
rep(i, n) cin >> p[i], p[i]--;
int cnt = 0;
rep(i, n) if (p[i] != i) cnt++;
cout << (cnt == 2 || cnt == 0 ? "YES" : "NO") << endl;
return 0;
} | [
"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 >> n;
vector<int> p(n);
REP(i, n) { cin >> p[i]; }
int count = 0;
REP(i, n) {
if (p[i] == i + 1) {
count++;
}
}
if (count == n || count == n - 2) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | #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 >> n;
vector<int> p(n);
REP(i, n) { cin >> p[i]; }
int count = 0;
REP(i, n) {
if (p[i] == i + 1) {
count++;
}
}
if (count == n || count == n - 2) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} | [
"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));
// 関数：
string incvec(vec p) {
int lg = p.size();
string ans = "YES";
rep(i, lg - 1) {
if (p.at(i) > p.at(i + 1))
ans = "NO";
}
return (ans);
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
vec p(N);
rep(i, N) cin >> p.at(i);
string ans = incvec(p);
if (ans == "YES") {
cout << ans << endl;
return 0;
}
rep(i, N - 1) for (int j = i + 1; j < N; j++) {
vec rt = p;
int tp = rt.at(i);
rt.at(i) = rt.at(j);
rt.at(j) = tp;
if (incvec(rt) == "YES") {
cout << ans << endl;
return 0;
}
}
cout << "NO" << endl;
return 0;
}
// std::string str;
// str = std::to_string(int i);
// bitset<3> s(N);
| #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));
// 関数：
string incvec(vec p) {
int lg = p.size();
string ans = "YES";
rep(i, lg - 1) {
if (p.at(i) > p.at(i + 1))
ans = "NO";
}
return (ans);
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
vec p(N);
rep(i, N) cin >> p.at(i);
string ans = incvec(p);
if (ans == "YES") {
cout << ans << endl;
return 0;
}
rep(i, N - 1) for (int j = i + 1; j < N; j++) {
vec rt = p;
int tp = rt.at(i);
rt.at(i) = rt.at(j);
rt.at(j) = tp;
if (incvec(rt) == "YES") {
cout << "YES" << endl;
return 0;
}
}
cout << ans << endl;
return 0;
}
// std::string str;
// str = std::to_string(int i);
// bitset<3> s(N);
| [
"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));
// 関数：
string incvec(vec p) {
int lg = p.size();
string ans = "YES";
rep(i, lg - 1) {
if (p.at(i) > p.at(i + 1))
ans = "NO";
}
return (ans);
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
vec p(N);
rep(i, N) cin >> p.at(i);
string ans = incvec(p);
if (ans == "YES") {
cout << ans << endl;
return 0;
}
rep(i, N - 1) for (int j = i + 1; j < N; j++) {
vec rt = p;
int tp = rt.at(i);
rt.at(i) = rt.at(j);
rt.at(j) = tp;
if (incvec(rt) == "YES") {
cout << ans << endl;
return 0;
}
}
cout << ans << endl;
return 0;
}
// std::string str;
// str = std::to_string(int i);
// bitset<3> s(N);
| #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));
// 関数：
string incvec(vec p) {
int lg = p.size();
string ans = "YES";
rep(i, lg - 1) {
if (p.at(i) > p.at(i + 1))
ans = "NO";
}
return (ans);
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
vec p(N);
rep(i, N) cin >> p.at(i);
string ans = incvec(p);
if (ans == "YES") {
cout << ans << endl;
return 0;
}
rep(i, N - 1) for (int j = i + 1; j < N; j++) {
vec rt = p;
int tp = rt.at(i);
rt.at(i) = rt.at(j);
rt.at(j) = tp;
if (incvec(rt) == "YES") {
cout << "YES" << endl;
return 0;
}
}
cout << ans << endl;
return 0;
}
// std::string str;
// str = std::to_string(int i);
// bitset<3> s(N);
| [
"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() {
bool flag = 0;
cin >> n;
REP(i, n) cin >> a.at(i);
if (check())
flag = 1;
REP(i, n - 1) for (int j = i + 1; j < n; j++) {
sw(i, j);
if (check())
flag = 1;
sw(i, j);
}
cout << (flag ? "YES" : "NO");
} | #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() {
bool flag = 0;
cin >> n;
REP(i, n) cin >> a.at(i);
if (check())
flag = 1;
REP(i, n - 1) for (int j = i + 1; j < n; j++) {
sw(i, j);
if (check())
flag = 1;
sw(i, j);
}
cout << (flag ? "YES" : "NO");
} | [
"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());
int cnt = 0;
r(i, n) {
if (p.at(i) != s.at(i))
cnt++;
}
if (cnt > 2)
cout << "NO" << endl;
else
cout << "Yes" << endl;
return 0;
}
| #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());
int cnt = 0;
r(i, n) {
if (p.at(i) != s.at(i))
cnt++;
}
if (cnt > 2)
cout << "NO" << endl;
else
cout << "YES" << endl;
return 0;
}
| [
"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 || count == 0) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} | #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 == 0) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} | [
"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" << endl;
} else {
cout << "NO" << endl;
}
} | #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) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} | [
"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, def) vector<vector<int>>((n), vector<int>((m), (def)))
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define per(i, n) for (int i = (n)-1 i >= 0; --i)
int main() {
int N;
cin >> N;
vi p(N);
rep(i, N) {
int P;
cin >> P;
p[i] = P;
}
int cnt = 0;
rep(i, N) {
if (p[i] != i) {
++cnt;
}
}
cout << (cnt >= 3 ? "NO" : "YES") << endl;
}
| #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, def) vector<vector<int>>((n), vector<int>((m), (def)))
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define per(i, n) for (int i = (n)-1 i >= 0; --i)
int main() {
int N;
cin >> N;
vi p(N);
rep(i, N) {
int P;
cin >> P;
p[i] = P;
}
int cnt = 0;
rep(i, N) {
if (p[i] != i + 1) {
++cnt;
}
}
cout << (cnt >= 3 ? "NO" : "YES") << endl;
}
| [
"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 < 3)
cout << "Yes";
else
cout << "No";
}
| #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 < 3)
cout << "YES";
else
cout << "NO";
}
| [
"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 0;
}
| #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 0;
}
| [
"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
cout << "NO" << 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;
else
cout << "NO" << 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;
else
cout << "NO" << 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;
else
cout << "NO" << 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;
else
cout << "NO" << 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;
else
cout << "NO" << 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); ++i)
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
using namespace std;
typedef pair<int, int> P;
const int INF = 1e15;
const int MOD = 1e9 + 7;
template <typename T> using vector2 = vector<vector<T>>;
template <typename T> vector2<T> initVec2(size_t n0, size_t n1, T e = T()) {
return vector2<T>(n0, vector<T>(n1, e));
}
template <typename T> using vector3 = vector<vector<vector<T>>>;
template <typename T>
vector3<T> initVec3(size_t n0, size_t n1, size_t n2, T e = T()) {
return vector3<T>(n0, vector2<T>(n1, vector<T>(n2, e)));
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> p(n);
rep(i, n) cin >> p[i];
vector<int> q = p;
sort(q.begin(), q.end());
int cnt = 0;
rep(i, n) {
if (p[i] != q[i]) {
cnt++;
}
}
cout << (cnt == 2 ? "YES" : "NO") << endl;
return 0;
}
| #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); ++i)
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
using namespace std;
typedef pair<int, int> P;
const int INF = 1e15;
const int MOD = 1e9 + 7;
template <typename T> using vector2 = vector<vector<T>>;
template <typename T> vector2<T> initVec2(size_t n0, size_t n1, T e = T()) {
return vector2<T>(n0, vector<T>(n1, e));
}
template <typename T> using vector3 = vector<vector<vector<T>>>;
template <typename T>
vector3<T> initVec3(size_t n0, size_t n1, size_t n2, T e = T()) {
return vector3<T>(n0, vector2<T>(n1, vector<T>(n2, e)));
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> p(n);
rep(i, n) cin >> p[i];
vector<int> q = p;
sort(q.begin(), q.end());
int cnt = 0;
rep(i, n) {
if (p[i] != q[i]) {
cnt++;
}
}
cout << (cnt == 2 || cnt == 0 ? "YES" : "NO") << endl;
return 0;
}
| [
"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 == 0)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
| #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 || counter == 0)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
| [
"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> copyv;
cin >> N;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
v.push_back(a);
}
copyv = v;
sort(v.begin(), v.end());
int cnt = 0;
for (int i = 0; i < N; i++) {
if (v[i] != copyv[i])
cnt++;
}
if (cnt <= 2)
cout << "Yes";
else
cout << "No";
} | #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> copyv;
cin >> N;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
v.push_back(a);
}
copyv = v;
sort(v.begin(), v.end());
int cnt = 0;
for (int i = 0; i < N; i++) {
if (v[i] != copyv[i])
cnt++;
}
if (cnt <= 2)
cout << "YES";
else
cout << "NO";
} | [
"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.