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 REP(i, n) for (int i = 0; i < n; i++)
int main() {
int n;
cin >> n;
vector<int> p(n);
REP(i, n) { cin >> p.at(i); }
vector<int> q = p;
sort(q.begin(), q.end());
vector<int> r;
bool res = false;
if (p == q) {
res = true;
}
int c, d;
REP(i, n - 1) {
for (int j = i + 1; j < n; j++) {
r = p;
c = r.at(i);
d = r.at(j);
r.at(i) = d;
r.at(j) = c;
if (r == p) {
res = true;
}
}
}
if (res) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
int main() {
int n;
cin >> n;
vector<int> p(n);
REP(i, n) { cin >> p.at(i); }
vector<int> q = p;
sort(q.begin(), q.end());
vector<int> r;
bool res = false;
if (p == q) {
res = true;
}
int c, d;
REP(i, n - 1) {
for (int j = i + 1; j < n; j++) {
r = p;
c = r.at(i);
d = r.at(j);
r.at(i) = d;
r.at(j) = c;
if (r == q) {
res = true;
}
}
}
if (res) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
}
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 763,192 | 763,193 | u231354686 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
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" << endl;
else
cout << "No" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
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" << endl;
else
cout << "NO" << endl;
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,196 | 763,197 | u150155436 | cpp |
p02958 | #include <iostream>
using namespace std;
int main() {
int N;
int a[N];
for (int i = 0; i < N; i++) {
cin >> a[i];
}
int k = 0;
for (int i = 0; i < N; i++) {
if (a[i] != i + 1)
k++;
}
if (k == 0 || k == 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int a[N];
for (int i = 0; i < N; i++) {
cin >> a[i];
}
int k = 0;
for (int i = 0; i < N; i++) {
if (a[i] != i + 1)
k++;
}
if (k == 0 || k == 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
}
| [] | 763,204 | 763,205 | u908448907 | cpp |
p02958 | #include "bits/stdc++.h"
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define mFOR(i, a, b) for (int i = a; i > b; i--)
#define MP make_pair
#define PB push_back
#define ALL(v) v.begin(), v.end()
#define N 100007
#define INF 1000000007
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) { return b == 0 ? a : gcd(b, a % b); }
ll fceil(ll a, ll b) { return (a % b == 0 ? a / b : a / b + 1); }
int main() {
int n, p, ctr = 0;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> p;
if (p != i)
ctr++;
}
cout << (ctr <= 2 ? "Yes" : "No") << endl;
return 0;
}
| #include "bits/stdc++.h"
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define mFOR(i, a, b) for (int i = a; i > b; i--)
#define MP make_pair
#define PB push_back
#define ALL(v) v.begin(), v.end()
#define N 100007
#define INF 1000000007
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) { return b == 0 ? a : gcd(b, a % b); }
ll fceil(ll a, ll b) { return (a % b == 0 ? a / b : a / b + 1); }
int main() {
int n, p, ctr = 0;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> p;
if (p != i)
ctr++;
}
cout << (ctr <= 2 ? "YES" : "NO") << endl;
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,208 | 763,209 | u803173123 | cpp |
p02958 | #include <bits/stdc++.h>
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] = i + 1;
}
for (int i = 0; i < n; i++) {
for (int j = 0; i < n; j++) {
swap(p[i], p[j]);
if (p == q) {
cout << "YES" << endl;
return 0;
} else
swap(p[i], p[j]);
}
}
cout << "NO" << endl;
return 0;
} | #include <bits/stdc++.h>
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] = i + 1;
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
swap(p[i], p[j]);
if (p == q) {
cout << "YES" << endl;
return 0;
} else
swap(p[i], p[j]);
}
}
cout << "NO" << endl;
return 0;
} | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 763,213 | 763,214 | u578969098 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int p[60] = {0};
for (int i = 0; i < n; i++)
cin >> p[i];
// for(int i=0; i<n; i++) cout << p[i] << " ";
// cout << endl;
int a[60] = {0};
for (int i = 0; i < n; i++)
a[i] = i + 1;
// for(int i=0; i<n; i++) cout << a[i] << " ";
// cout << endl;
int ans = 0;
for (int i = 0; i < n; i++) {
if (a[i] != p[i])
ans++;
// cout << ans << endl;
}
if (ans <= 2)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int p[60] = {0};
for (int i = 0; i < n; i++)
cin >> p[i];
int a[60] = {0};
for (int i = 0; i < n; i++)
a[i] = i + 1;
int ans = 0;
for (int i = 0; i < n; i++) {
if (p[i] != a[i])
ans++;
}
if (ans <= 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
} | [
"identifier.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,227 | 763,228 | u739489568 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int p[60] = {0};
for (int i = 0; i < n; i++)
cin >> p[i];
int a[60] = {0};
for (int i = 0; i < n; i++)
a[i] = i + 1;
int ans = 0;
for (int i = 0; i < n; i++) {
if (p[i] != a[i])
ans++;
}
if (ans <= 2)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int p[60] = {0};
for (int i = 0; i < n; i++)
cin >> p[i];
int a[60] = {0};
for (int i = 0; i < n; i++)
a[i] = i + 1;
int ans = 0;
for (int i = 0; i < n; i++) {
if (p[i] != a[i])
ans++;
}
if (ans <= 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,229 | 763,228 | u739489568 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int c = 0;
for (int i = 0; i < n; i++) {
int p;
cin >> p;
c += (p != i + 1);
}
cout << (c <= 2 ? "Yes" : "No") << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int c = 0;
for (int i = 0; i < n; i++) {
int p;
cin >> p;
c += (p != i + 1);
}
cout << (c <= 2 ? "YES" : "NO") << endl;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,232 | 763,233 | u145855676 | 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> sortp(N);
sortp = p;
sort(sortp.begin(), sortp.end());
bool flag;
if (p == sortp)
flag = true;
else
flag = false;
vector<int> q(N);
vector<int> sortq(N);
for (int i = 0; i < N - 1; i++)
for (int i2 = i + 1; i2 < N; i2++) {
q = p;
q.at(i) = p.at(i2);
q.at(i2) = p.at(i);
sortq = q;
sort(sortq.begin(), sortq.end());
if (q == sortq) {
flag = true;
break;
}
}
if (flag)
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> sortp(N);
sortp = p;
sort(sortp.begin(), sortp.end());
bool flag;
if (p == sortp)
flag = true;
else
flag = false;
vector<int> q(N);
vector<int> sortq(N);
for (int i = 0; i < N - 1; i++)
for (int i2 = i + 1; i2 < N; i2++) {
q = p;
q.at(i) = p.at(i2);
q.at(i2) = p.at(i);
sortq = q;
sort(sortq.begin(), sortq.end());
if (q == sortq) {
flag = true;
break;
}
}
if (flag)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,246 | 763,247 | u327750344 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
int count = 0;
for (int i = 0; i < N; i++) {
if (A.at(i) != i + 1) {
count++;
}
}
if (count <= 2) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
int count = 0;
for (int i = 0; i < N; i++) {
if (A.at(i) != i + 1) {
count++;
}
}
if (count <= 2) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,250 | 763,251 | u896053584 | cpp |
p02958 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int in;
int cnt = 0;
for (int i = 0; i < n; i++) {
cin >> in;
if (i + 1 != in) {
cnt++;
}
}
if (cnt == 2 || cnt == 0) {
cout << "YES" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int in;
int cnt = 0;
for (int i = 0; i < n; i++) {
cin >> in;
if (i + 1 != in) {
cnt++;
}
}
if (cnt == 2 || cnt == 0) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,254 | 763,255 | u361948770 | cpp |
p02958 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int in;
int cnt = 0;
for (int i = 0; i < n; i++) {
cin >> in;
if (i + 1 != in) {
cnt++;
}
}
if (cnt == 2) {
cout << "YES" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int in;
int cnt = 0;
for (int i = 0; i < n; i++) {
cin >> in;
if (i + 1 != in) {
cnt++;
}
}
if (cnt == 2 || cnt == 0) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
} | [
"control_flow.branch.if.condition.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,256 | 763,255 | u361948770 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
vector<int> p(N);
for (int i = 0; i < N; i++) {
cin >> p[i];
}
bool ans = true;
for (int k = 0; k < N - 1; k++) {
if (p[k] > p[k + 1]) {
ans = false;
break;
}
}
if (ans == false) {
for (int i = 0; i < N - 1; i++) {
for (int j = i + 1; j < N; j++) {
swap(p[i], p[j]);
for (int k = 0; k < N - 1; k++) {
if (p[k] > p[k + 1]) {
ans = false;
break;
}
}
if (ans == true)
break;
swap(p[i], p[j]);
}
if (ans == true)
break;
}
}
cout << (ans ? "YES" : "NO") << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
vector<int> p(N);
for (int i = 0; i < N; i++) {
cin >> p[i];
}
bool ans = true;
for (int k = 0; k < N - 1; k++) {
if (p[k] > p[k + 1]) {
ans = false;
break;
}
}
if (ans == false) {
for (int i = 0; i < N - 1; i++) {
for (int j = i + 1; j < N; j++) {
swap(p[i], p[j]);
for (int k = 0; k < N - 1; k++) {
ans = true;
if (p[k] > p[k + 1]) {
ans = false;
break;
}
}
if (ans == true)
break;
swap(p[i], p[j]);
}
if (ans == true)
break;
}
}
cout << (ans ? "YES" : "NO") << endl;
} | [
"assignment.add"
] | 763,263 | 763,264 | u947382132 | cpp |
p02958 | #include "bits/stdc++.h"
#define rep(loop, N) for (int loop = 0; loop < N; loop++)
using namespace std;
struct Node {
Node *parent = NULL;
vector<Node *> child;
long long value = 0;
};
struct Edge {
int parent = 0;
int child = 0;
bool operator<(const Edge &right) const { return parent < right.parent; }
};
struct Tree {
vector<Node> node;
Tree(int, vector<Edge>);
};
Tree::Tree(int nodeNum, vector<Edge> edge) {
node.resize(nodeNum);
for (Edge &it : edge) {
node[it.child].parent = &node[it.parent];
node[it.parent].child.push_back(&node[it.child]);
}
}
map<long long, int> factorization(long long N) {
map<long long, int> re;
while (true) {
if (N % 2 == 0) {
N /= 2;
re[2]++;
if (N == 1)
break;
} else {
break;
}
}
for (int loop = 3; (long long)loop * (long long)loop <= N; loop += 2) {
if (N % loop == 0) {
N /= loop;
re[loop]++;
loop -= 2;
if (N == 1)
break;
}
}
if (N > 1)
re[N]++;
return re;
}
struct Memo {
long long fact = 0;
long long fact_inv = 0;
long long inv = 0;
};
class Combination1 {
private:
long long m_module = 1000000007;
vector<struct Memo> memo;
public:
long long calculate(int, int);
Combination1(int, long long);
};
long long Combination1::calculate(int n, int k) {
return ((memo[n].fact * memo[k].fact_inv) % m_module * memo[n - k].fact_inv) %
m_module;
}
Combination1::Combination1(int memo_max, long long module = 1000000007) {
m_module = module;
memo.push_back({1, 1, 0});
memo.push_back({1, 1, 1});
for (int loop = 2; loop <= memo_max; loop++) {
struct Memo temp;
temp.fact = (memo[loop - 1].fact * loop) % m_module;
temp.inv = m_module -
(memo[m_module % loop].inv * int(m_module / loop)) % m_module;
temp.fact_inv = (memo[loop - 1].fact_inv * temp.inv) % m_module;
memo.push_back(temp);
}
}
class Combination2 {
private:
int size = 0;
bool add(int);
public:
vector<int> sequence;
bool next_combination(void);
Combination2(int, int);
};
bool Combination2::add(int index) {
if (index == (int)sequence.size() - 1 && sequence[index] == size - 1 ||
index < (int)sequence.size() - 1 &&
sequence[index] == sequence[index + 1] - 1) {
if (index == 0) {
return false;
} else {
bool re = add(index - 1);
sequence[index] = sequence[index - 1] + 1;
return re;
}
} else {
sequence[index]++;
return true;
}
}
bool Combination2::next_combination(void) {
return (sequence.size() == 0) ? false : add(sequence.size() - 1);
}
Combination2::Combination2(int n, int r) {
size = n;
for (int loop = 0; loop < r; loop++)
sequence.push_back(loop);
return;
}
void A_Harmony(void) {
int A, B;
cin >> A >> B;
if ((A + B) % 2 == 0)
cout << (A + B) / 2 << endl;
else
cout << "IMPOSSIBLE" << endl;
return;
}
void B(void) {
int N;
cin >> N;
vector<int> p(N);
for (int &it : p)
cin >> it;
int counter = 0;
rep(index, N) if (p[index] != index + 1) counter++;
cout << (counter <= 2 ? "Yes" : "No") << endl;
return;
}
int main(void) {
// A_Harmony();
B();
return 0;
}
| #include "bits/stdc++.h"
#define rep(loop, N) for (int loop = 0; loop < N; loop++)
using namespace std;
struct Node {
Node *parent = NULL;
vector<Node *> child;
long long value = 0;
};
struct Edge {
int parent = 0;
int child = 0;
bool operator<(const Edge &right) const { return parent < right.parent; }
};
struct Tree {
vector<Node> node;
Tree(int, vector<Edge>);
};
Tree::Tree(int nodeNum, vector<Edge> edge) {
node.resize(nodeNum);
for (Edge &it : edge) {
node[it.child].parent = &node[it.parent];
node[it.parent].child.push_back(&node[it.child]);
}
}
map<long long, int> factorization(long long N) {
map<long long, int> re;
while (true) {
if (N % 2 == 0) {
N /= 2;
re[2]++;
if (N == 1)
break;
} else {
break;
}
}
for (int loop = 3; (long long)loop * (long long)loop <= N; loop += 2) {
if (N % loop == 0) {
N /= loop;
re[loop]++;
loop -= 2;
if (N == 1)
break;
}
}
if (N > 1)
re[N]++;
return re;
}
struct Memo {
long long fact = 0;
long long fact_inv = 0;
long long inv = 0;
};
class Combination1 {
private:
long long m_module = 1000000007;
vector<struct Memo> memo;
public:
long long calculate(int, int);
Combination1(int, long long);
};
long long Combination1::calculate(int n, int k) {
return ((memo[n].fact * memo[k].fact_inv) % m_module * memo[n - k].fact_inv) %
m_module;
}
Combination1::Combination1(int memo_max, long long module = 1000000007) {
m_module = module;
memo.push_back({1, 1, 0});
memo.push_back({1, 1, 1});
for (int loop = 2; loop <= memo_max; loop++) {
struct Memo temp;
temp.fact = (memo[loop - 1].fact * loop) % m_module;
temp.inv = m_module -
(memo[m_module % loop].inv * int(m_module / loop)) % m_module;
temp.fact_inv = (memo[loop - 1].fact_inv * temp.inv) % m_module;
memo.push_back(temp);
}
}
class Combination2 {
private:
int size = 0;
bool add(int);
public:
vector<int> sequence;
bool next_combination(void);
Combination2(int, int);
};
bool Combination2::add(int index) {
if (index == (int)sequence.size() - 1 && sequence[index] == size - 1 ||
index < (int)sequence.size() - 1 &&
sequence[index] == sequence[index + 1] - 1) {
if (index == 0) {
return false;
} else {
bool re = add(index - 1);
sequence[index] = sequence[index - 1] + 1;
return re;
}
} else {
sequence[index]++;
return true;
}
}
bool Combination2::next_combination(void) {
return (sequence.size() == 0) ? false : add(sequence.size() - 1);
}
Combination2::Combination2(int n, int r) {
size = n;
for (int loop = 0; loop < r; loop++)
sequence.push_back(loop);
return;
}
void A_Harmony(void) {
int A, B;
cin >> A >> B;
if ((A + B) % 2 == 0)
cout << (A + B) / 2 << endl;
else
cout << "IMPOSSIBLE" << endl;
return;
}
void B(void) {
int N;
cin >> N;
vector<int> p(N);
for (int &it : p)
cin >> it;
int counter = 0;
rep(index, N) if (p[index] != index + 1) counter++;
cout << (counter <= 2 ? "YES" : "NO") << endl;
return;
}
int main(void) {
// A_Harmony();
B();
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,271 | 763,272 | u610752387 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int ans = 0;
for (int i = 1; i <= N; i++) {
int C;
cin >> C;
if (C != i)
ans++;
}
if (ans <= 2)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int ans = 0;
for (int i = 1; i <= N; i++) {
int C;
cin >> C;
if (C != i)
ans++;
}
if (ans <= 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,275 | 763,276 | u085235341 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
int main() {
int N;
cin >> N;
vector<int> A(N);
rep(i, N) { cin >> A.at(i); }
int count = 0;
rep(i, N) {
if (A.at(i) == i + 1) {
count++;
}
}
if (count <= 2) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
int main() {
int N;
cin >> N;
vector<int> A(N);
rep(i, N) { cin >> A.at(i); }
int count = 0;
rep(i, N) {
if (A.at(i) != i + 1) {
count++;
}
}
if (count <= 2) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 763,277 | 763,278 | u215100858 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, Z = 0;
for (int i = 1; i <= N; i++) {
int a;
cin >> a;
if (a != i) {
Z++;
}
}
if (Z == 0 || Z == 2) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, Z = 0;
cin >> N;
for (int i = 1; i <= N; i++) {
int a;
cin >> a;
if (a != i) {
Z++;
}
}
if (Z == 0 || Z == 2) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} | [] | 763,279 | 763,280 | u158290747 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, ans = 0;
cin >> n;
vector<int> p(n);
vector<int> q(n);
for (int i = 0; i < n; i++) {
cin >> p.at(i);
q.at(i) = i + 1;
}
for (int i = 0; i < n; i++) {
if (p.at(i) != q.at(i))
ans++;
}
if (ans > 2) {
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, ans = 0;
cin >> n;
vector<int> p(n);
vector<int> q(n);
for (int i = 0; i < n; i++) {
cin >> p.at(i);
q.at(i) = i + 1;
}
for (int i = 0; i < n; i++) {
if (p.at(i) != q.at(i))
ans++;
}
if (ans > 2) {
cout << "NO" << endl;
} else {
cout << "YES" << endl;
}
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,286 | 763,287 | u363892646 | cpp |
p02958 | //
// Created on 2020/04/16.
//
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <iomanip>
#include <ios>
#include <iostream> // cout, endl, cin
#include <map> // map
#include <math.h>
#include <numeric>
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <string> // string, to_string, stoi
#include <tuple> // tuple, make_tuple
#include <unordered_map> // unordered_map
#include <unordered_set> // unordered_set
#include <utility> // pair, make_pair
#include <vector> // vector
#define all(x) (x).begin(), (x).end()
typedef long long ll;
using namespace std;
const long long LINF = 1e18;
const int INF = 1e9;
int main() {
int n;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; ++i) {
cin >> p[i];
}
bool ok = true;
for (int k = 1; k < n; ++k) {
if (p[k - 1] > p[k]) {
ok = false;
break;
}
}
if (ok) {
cout << "Yes" << endl;
return 0;
}
for (int j = 0; j < n - 1; ++j) {
for (int i = j + 1; i < n; ++i) {
swap(p[j], p[i]);
ok = true;
for (int k = 1; k < n; ++k) {
if (p[k - 1] > p[k]) {
ok = false;
break;
}
}
if (ok) {
cout << "Yes" << endl;
return 0;
}
swap(p[j], p[i]);
}
}
cout << "No" << endl;
return 0;
}
| //
// Created on 2020/04/16.
//
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <iomanip>
#include <ios>
#include <iostream> // cout, endl, cin
#include <map> // map
#include <math.h>
#include <numeric>
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <string> // string, to_string, stoi
#include <tuple> // tuple, make_tuple
#include <unordered_map> // unordered_map
#include <unordered_set> // unordered_set
#include <utility> // pair, make_pair
#include <vector> // vector
#define all(x) (x).begin(), (x).end()
typedef long long ll;
using namespace std;
const long long LINF = 1e18;
const int INF = 1e9;
int main() {
int n;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; ++i) {
cin >> p[i];
}
bool ok = true;
for (int k = 1; k < n; ++k) {
if (p[k - 1] > p[k]) {
ok = false;
break;
}
}
if (ok) {
cout << "YES" << endl;
return 0;
}
for (int j = 0; j < n - 1; ++j) {
for (int i = j + 1; i < n; ++i) {
swap(p[j], p[i]);
ok = true;
for (int k = 1; k < n; ++k) {
if (p[k - 1] > p[k]) {
ok = false;
break;
}
}
if (ok) {
cout << "YES" << endl;
return 0;
}
swap(p[j], p[i]);
}
}
cout << "NO" << endl;
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,298 | 763,299 | u723843066 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int sum = 0;
for (int i = 1; i <= N; i++) {
int A;
cin >> A;
if (A == i)
sum++;
}
if (sum <= 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int sum = 0;
for (int i = 1; i <= N; i++) {
int A;
cin >> A;
if (A != i)
sum++;
}
if (sum <= 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 763,304 | 763,305 | u101018317 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int p[50];
int main() {
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
int n;
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> p[i];
}
bool possible = true;
for (int i = 1; i < n; ++i) {
if (p[i] < p[i - 1]) {
possible = false;
break;
} else if (p[i] > p[i - 1]) {
continue;
}
}
if (possible) {
cout << "Yes\n";
return 0;
}
for (int i = 0; i < n - 1; ++i) {
for (int j = i + 1; j < n; ++j) {
swap(p[i], p[j]);
possible = true;
for (int i = 1; i < n; ++i) {
if (p[i] < p[i - 1]) {
possible = false;
break;
} else if (p[i] > p[i - 1]) {
continue;
}
}
if (possible) {
cout << "Yes\n";
return 0;
} else {
swap(p[i], p[j]);
}
}
}
if (!possible)
cout << "No\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int p[50];
int main() {
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
int n;
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> p[i];
}
bool possible = true;
for (int i = 1; i < n; ++i) {
if (p[i] < p[i - 1]) {
possible = false;
break;
} else if (p[i] > p[i - 1]) {
continue;
}
}
if (possible) {
cout << "YES\n";
return 0;
}
for (int i = 0; i < n - 1; ++i) {
for (int j = i + 1; j < n; ++j) {
swap(p[i], p[j]);
possible = true;
for (int i = 1; i < n; ++i) {
if (p[i] < p[i - 1]) {
possible = false;
break;
} else if (p[i] > p[i - 1]) {
continue;
}
}
if (possible) {
cout << "YES\n";
return 0;
} else {
swap(p[i], p[j]);
}
}
}
if (!possible)
cout << "NO\n";
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,308 | 763,309 | u194015723 | cpp |
p02958 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> p(n);
vector<int> q(n);
rep(i, n) {
cin >> p[i];
q[i] = p[i];
}
int res = 0;
sort(q.rbegin(), q.rend());
rep(i, n) {
if (p[i] != q[i])
res++;
}
if (res <= 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> p(n);
vector<int> q(n);
rep(i, n) {
cin >> p[i];
q[i] = p[i];
}
int res = 0;
sort(q.begin(), q.end());
rep(i, n) {
if (p[i] != q[i])
res++;
}
if (res <= 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
| [
"call.function.change",
"call.arguments.change"
] | 763,310 | 763,311 | u816145694 | cpp |
p02958 | #include <algorithm>
#include <cmath>
#include <cstdint>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <type_traits>
#include <vector>
typedef long long ll;
using namespace std;
//素因数分解
void factoring(ll n, map<ll, ll> &mp) {
for (ll i = 2; i * i <= n; i++) {
while (n % i == 0) {
mp[i]++;
n /= i;
}
}
if (n != 1)
mp[n]++;
}
//絶対値
template <class T, class U = std::make_unsigned_t<T>> U SafeAbs(T x) {
return x < 0 ? -static_cast<uintmax_t>(x) : x;
}
//最大・最小
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
// xのn乗
ll mod_pow(ll x, ll n, ll mod) {
ll res = 1;
while (n > 0) {
if (n & 1)
res = res * x % mod;
x = x * x % mod;
n >>= 1;
}
return res;
}
// xの逆元
ll mod_inv(ll x, ll mod) { // O(log(mod))
return mod_pow(x, mod - 2, mod);
}
// nCr
ll ncr(ll n, ll r, ll mod) {
ll res = 1;
ll num = 1, den = 1;
for (ll i = n; i >= n - r + 1; i--) {
(den *= i) %= mod;
}
for (ll i = 1; i <= r; i++) {
(num *= i) %= mod;
}
res = den * mod_inv(num, mod);
return res % mod;
}
//二分探索
bool isOk(ll index, ll key, vector<ll> &a, bool g) {
if (g) {
if (a[index] < key) {
return true;
}
} else {
if (a[index] > key) {
return true;
}
}
return false;
}
ll bin_search(ll key, vector<ll> &a, bool g) {
ll l = -1;
ll r = a.size();
if (g) {
l = a.size();
r = -1;
}
while (abs(r - l) > 1) {
ll mid = (l + r) / 2;
if (isOk(mid, key, a, g)) {
r = mid;
} else {
l = mid;
}
}
return r;
}
int main() {
ll n;
cin >> n;
ll check = 0;
vector<ll> a(n, 0);
for (ll i = 0; i < n; i++) {
cin >> a[i];
if (a[i] != i + 1) {
check++;
}
}
if (check == 2) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
}
| #include <algorithm>
#include <cmath>
#include <cstdint>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <type_traits>
#include <vector>
typedef long long ll;
using namespace std;
//素因数分解
void factoring(ll n, map<ll, ll> &mp) {
for (ll i = 2; i * i <= n; i++) {
while (n % i == 0) {
mp[i]++;
n /= i;
}
}
if (n != 1)
mp[n]++;
}
//絶対値
template <class T, class U = std::make_unsigned_t<T>> U SafeAbs(T x) {
return x < 0 ? -static_cast<uintmax_t>(x) : x;
}
//最大・最小
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
// xのn乗
ll mod_pow(ll x, ll n, ll mod) {
ll res = 1;
while (n > 0) {
if (n & 1)
res = res * x % mod;
x = x * x % mod;
n >>= 1;
}
return res;
}
// xの逆元
ll mod_inv(ll x, ll mod) { // O(log(mod))
return mod_pow(x, mod - 2, mod);
}
// nCr
ll ncr(ll n, ll r, ll mod) {
ll res = 1;
ll num = 1, den = 1;
for (ll i = n; i >= n - r + 1; i--) {
(den *= i) %= mod;
}
for (ll i = 1; i <= r; i++) {
(num *= i) %= mod;
}
res = den * mod_inv(num, mod);
return res % mod;
}
//二分探索
bool isOk(ll index, ll key, vector<ll> &a, bool g) {
if (g) {
if (a[index] < key) {
return true;
}
} else {
if (a[index] > key) {
return true;
}
}
return false;
}
ll bin_search(ll key, vector<ll> &a, bool g) {
ll l = -1;
ll r = a.size();
if (g) {
l = a.size();
r = -1;
}
while (abs(r - l) > 1) {
ll mid = (l + r) / 2;
if (isOk(mid, key, a, g)) {
r = mid;
} else {
l = mid;
}
}
return r;
}
int main() {
ll n;
cin >> n;
ll check = 0;
vector<ll> a(n, 0);
for (ll i = 0; i < n; i++) {
cin >> a[i];
if (a[i] != i + 1) {
check++;
}
}
if (check == 2 || check == 0) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
}
| [
"control_flow.branch.if.condition.change"
] | 763,315 | 763,316 | u595446852 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int A[N] = {};
for (int i = 0; i < N; i++) {
cin >> A[i];
}
int cnt = 0;
for (int i = 0; i < N; i++) {
if (A[i] == i + 1) {
cnt++;
}
}
if (cnt <= 2) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
//配列に格納した要素について、ある要素番号の要素はその番号より１だけ大きい。
int main() {
int N;
cin >> N;
int A[N] = {};
for (int i = 0; i < N; i++) {
cin >> A[i];
}
int cnt = 0;
for (int i = 0; i < N; i++) {
if (A[i] != i + 1) {
cnt++;
}
}
if (cnt <= 2) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 763,317 | 763,318 | u374187034 | cpp |
p02958 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, N) for (int i = 0; i < (int)(N); i++)
int main() {
int n;
cin >> n;
vector<int> p(n);
rep(i, n) cin >> p[i];
int count = 0;
string ans = "YES";
rep(i, n) {
if (p[i] != i + 1)
count++;
}
if (count > 3)
ans = "NO";
cout << ans << endl;
} | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, N) for (int i = 0; i < (int)(N); i++)
int main() {
int n;
cin >> n;
vector<int> p(n);
rep(i, n) cin >> p[i];
int count = 0;
string ans = "YES";
rep(i, n) {
if (p[i] != i + 1)
count++;
}
if (count > 2)
ans = "NO";
cout << ans << endl;
}
| [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 763,319 | 763,320 | u485925545 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int mas[n + 1];
int d = 0;
for (int i = 1; i <= n; i++) {
cin >> mas[i];
}
for (int i = 1; i <= n; i++) {
if (mas[i] != i) {
d++;
}
}
if (d > 2) {
cout << "No";
} else {
cout << "Yes";
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int mas[n + 1];
int d = 0;
for (int i = 1; i <= n; i++) {
cin >> mas[i];
}
for (int i = 1; i <= n; i++) {
if (mas[i] != i) {
d++;
}
}
if (d > 2) {
cout << "NO";
} else {
cout << "YES";
}
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,321 | 763,322 | u759632062 | cpp |
p02958 | #include <algorithm>
#include <iostream>
using namespace std;
void Judge(int x[], int y[], int N) {
int count = 0;
for (int i = 0; i < N; i++) {
if (x[i] != y[i])
count++;
}
if (count <= 2)
cout << "Yes";
if (count > 2)
cout << "No";
}
int main() {
int N;
cin >> N;
int p[N];
int pp[N];
for (int i = 0; i < N; i++)
cin >> p[i];
for (int i = 0; i < N; i++)
pp[i] = p[i]; //配列をコピー
sort(pp, pp + N); //配列pp[]を昇順にソート
Judge(p, pp, N);
return 0;
}
| #include <algorithm>
#include <iostream>
using namespace std;
void Judge(int x[], int y[], int N) {
int count = 0;
for (int i = 0; i < N; i++) {
if (x[i] != y[i])
count++;
}
if (count <= 2)
cout << "YES";
if (count > 2)
cout << "NO";
}
int main() {
int N;
cin >> N;
int p[N];
int pp[N];
for (int i = 0; i < N; i++)
cin >> p[i];
for (int i = 0; i < N; i++)
pp[i] = p[i]; //配列をコピー
sort(pp, pp + N); //配列pp[]を昇順にソート
Judge(p, pp, N);
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,323 | 763,324 | u520026417 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(n) begin(n), end(n)
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> p(n);
rep(i, n) cin >> p[i];
int cnt = 0;
rep(i, n) {
if (p[i] != i + 1) {
cnt++;
}
}
if (cnt >= 3)
cout << "No" << endl;
else
cout << "Yes" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(n) begin(n), end(n)
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> p(n);
rep(i, n) cin >> p[i];
int cnt = 0;
rep(i, n) {
if (p[i] != i + 1) {
cnt++;
}
}
if (cnt >= 3)
cout << "NO" << endl;
else
cout << "YES" << endl;
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,327 | 763,328 | u074488832 | cpp |
p02958 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
typedef long long ll;
#define all(x) (x).begin(), (x).end() // sortなどの引数を省略
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define max3(x, y, z) max(x, max(y, z))
#ifdef _MSC_FULL_VER //デバッグ出力
#define dout cout
#define debug() if (true)
#define check(x) std::cout << "★" << #x << "の値:" << (x) << endl
#define pass(x) std::cout << "☆" << x << endl
#else
#define dout \
if (false) \
cout
#define debug() if (false)
#define check(x) \
if (false) \
cout << "★" << #x << "の値:" << (x) << endl
#define pass(x) \
if (false) \
cout << "☆" << x << endl
#endif
using namespace std;
int main() {
int N;
cin >> N;
int wa = 0;
int tmp;
for (int i = 0; i < N; i++) {
cin >> tmp;
if (tmp != i) {
wa++;
}
}
if (wa == 0 or wa == 2) {
cout << "YES";
} else {
cout << "NO";
}
}
/*
//よく使うやつ
int N;
cin >> N;
vector<int> list(N);
for (int i = 0; i < N; i++) {
cin >> list[i];
}
// for文
for (int i = 0; i < N; i++) {
}
//配列
vector<int> list;
list.at(i)
vector<vector<int>> list(10, vector<int>(10));
sort(all(list));
sort(all(list), greater<int>());
//配列の内容表示
dout << "====listの内容====\n";
for (int i = 0; i < N; i++) dout << list[i] << endl;
dout << "====ここまで====\n";
*/
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
typedef long long ll;
#define all(x) (x).begin(), (x).end() // sortなどの引数を省略
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define max3(x, y, z) max(x, max(y, z))
#ifdef _MSC_FULL_VER //デバッグ出力
#define dout cout
#define debug() if (true)
#define check(x) std::cout << "★" << #x << "の値:" << (x) << endl
#define pass(x) std::cout << "☆" << x << endl
#else
#define dout \
if (false) \
cout
#define debug() if (false)
#define check(x) \
if (false) \
cout << "★" << #x << "の値:" << (x) << endl
#define pass(x) \
if (false) \
cout << "☆" << x << endl
#endif
using namespace std;
int main() {
int N;
cin >> N;
int wa = 0;
int tmp;
for (int i = 0; i < N; i++) {
cin >> tmp;
if (tmp != i + 1) {
wa++;
}
}
if (wa == 0 or wa == 2) {
cout << "YES";
} else {
cout << "NO";
}
}
/*
//よく使うやつ
int N;
cin >> N;
vector<int> list(N);
for (int i = 0; i < N; i++) {
cin >> list[i];
}
// for文
for (int i = 0; i < N; i++) {
}
//配列
vector<int> list;
list.at(i)
vector<vector<int>> list(10, vector<int>(10));
sort(all(list));
sort(all(list), greater<int>());
//配列の内容表示
dout << "====listの内容====\n";
for (int i = 0; i < N; i++) dout << list[i] << endl;
dout << "====ここまで====\n";
*/
| [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 763,329 | 763,330 | u043964516 | cpp |
p02958 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int P[N];
for (int i = 0; i < N; i++) {
cin >> P[i];
}
int Q[N];
for (int i = 0; i < N; i++)
Q[i] = P[i];
sort(Q, Q + N);
int counter = 0;
for (int i = 0; i < N; i++) {
if (P[i] == Q[i]) {
counter++;
}
}
if (counter <= 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
| #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int P[N];
for (int i = 0; i < N; i++) {
cin >> P[i];
}
int Q[N];
for (int i = 0; i < N; i++)
Q[i] = P[i];
sort(Q, Q + N);
int counter = 0;
for (int i = 0; i < N; i++) {
if (P[i] != Q[i]) {
counter++;
}
}
if (counter <= 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 763,331 | 763,332 | u731665172 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> num(N);
for (int i = 0; i < N; i++)
cin >> num.at(i);
vector<int> num2(N);
for (int i = 0; i < N; i++)
num2.at(i) = num.at(i);
sort(num2.begin(), num2.end());
int count = 0;
for (int i = 0; i < N; i++) {
if (num.at(i) != num2.at(i))
count++;
}
if (count == 0)
cout << "Yes" << endl;
else if (count == 2)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> num(N);
for (int i = 0; i < N; i++)
cin >> num.at(i);
vector<int> num2(N);
for (int i = 0; i < N; i++)
num2.at(i) = num.at(i);
sort(num2.begin(), num2.end());
int count = 0;
for (int i = 0; i < N; i++) {
if (num.at(i) != num2.at(i))
count++;
}
if (count == 0)
cout << "YES" << endl;
else if (count == 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,335 | 763,336 | u987575170 | cpp |
p02958 | #include <bits/stdc++.h>
typedef long long int ll;
typedef long double ld;
using namespace std;
int main() {
ll n;
cin >> n;
ll p[n];
ll q[n];
for (ll i = 0; i < n; ++i) {
cin >> p[i];
q[i] = i + 1;
}
string ans = "No";
ll flag = 0;
for (ll i = 0; i < n; ++i) {
if (p[i] == q[i]) {
flag++;
}
}
if (flag >= n - 2) {
ans = "Yes";
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
typedef long long int ll;
typedef long double ld;
using namespace std;
int main() {
ll n;
cin >> n;
ll p[n];
ll q[n];
for (ll i = 0; i < n; ++i) {
cin >> p[i];
q[i] = i + 1;
}
string ans = "NO";
ll flag = 0;
for (ll i = 0; i < n; ++i) {
if (p[i] == q[i]) {
flag++;
}
}
if (flag >= n - 2) {
ans = "YES";
}
cout << ans << endl;
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"variable_declaration.value.change",
"assignment.value.change"
] | 763,347 | 763,348 | u473023730 | cpp |
p02958 | #include <algorithm>
#include <iostream>
#include <vector>
#define ll long long
using namespace std;
int main() {
int n;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; i++) {
cin >> p[i];
}
vector<int> psort(p.size());
copy(p.begin(), p.end(), psort.begin());
sort(psort.begin(), psort.end());
int cnt = 0;
for (int i = 0; i < p.size(); i++) {
if (p[i] != psort[i]) {
cnt++;
}
}
if (2 == cnt || 0 == cnt) {
cout << "Yes";
} else {
cout << "No";
}
return 0;
} | #include <algorithm>
#include <iostream>
#include <vector>
#define ll long long
using namespace std;
int main() {
int n;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; i++) {
cin >> p[i];
}
vector<int> psort(p.size());
copy(p.begin(), p.end(), psort.begin());
sort(psort.begin(), psort.end());
int cnt = 0;
for (int i = 0; i < p.size(); i++) {
if (p[i] != psort[i]) {
cnt++;
}
}
if (2 == cnt || 0 == cnt) {
cout << "YES";
} else {
cout << "NO";
}
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,351 | 763,352 | u476027087 | cpp |
p02958 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
int count = 0;
for (int i = 0; i < n; i++) {
if (a[i] != i + 1) {
count++;
}
}
if (count <= 2) {
cout << "YES" << endl;
} else {
cout << "No" << endl;
}
return 0;
}
| #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
int count = 0;
for (int i = 0; i < n; i++) {
if (a[i] != i + 1) {
count++;
}
}
if (count <= 2) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,354 | 763,355 | u607564800 | cpp |
p02958 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
int count = 0;
for (int i = 0; i < n - 1; i++) {
if (a[i] != i + 1) {
count++;
}
}
if (count <= 2) {
cout << "YES" << endl;
} else {
cout << "No" << endl;
}
return 0;
}
| #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
int count = 0;
for (int i = 0; i < n; i++) {
if (a[i] != i + 1) {
count++;
}
}
if (count <= 2) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
}
| [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,356 | 763,355 | u607564800 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
vector<int> p(n);
for (int i = 0; i < n; i++) {
cin >> p[i];
}
int k = 0;
for (int i = 0; i < n; i++) {
if (p[i] != i + 1)
k++;
}
if (k <= 2)
cout << "YES";
else
cout << "NO";
return 0;
}
| #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 k = 0;
for (int i = 0; i < n; i++) {
if (p[i] != i + 1)
k++;
}
if (k <= 2)
cout << "YES";
else
cout << "NO";
return 0;
}
| [] | 763,363 | 763,364 | u772661182 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define INF 1e9
#define PI 3.14159265359
#define MOD 1000000007
#define ALL(v) v.begin(), v.end()
#define ALLR(v) v.rbegin(), v.rend()
typedef long long ll;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
// isPrime
// modpow modinv
// getDigit
int main() {
cout << fixed << setprecision(10);
int n;
cin >> n;
vector<int> p(n);
vector<int> q(n);
rep(i, n) {
cin >> p.at(i);
q.at(i) = p.at(i);
}
sort(ALL(q));
int count = 0;
rep(i, n) {
if (p.at(i) != q.at(i))
count++;
}
if (count == 2 || count == 0) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define INF 1e9
#define PI 3.14159265359
#define MOD 1000000007
#define ALL(v) v.begin(), v.end()
#define ALLR(v) v.rbegin(), v.rend()
typedef long long ll;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
// isPrime
// modpow modinv
// getDigit
int main() {
cout << fixed << setprecision(10);
int n;
cin >> n;
vector<int> p(n);
vector<int> q(n);
rep(i, n) {
cin >> p.at(i);
q.at(i) = p.at(i);
}
sort(ALL(q));
int count = 0;
rep(i, n) {
if (p.at(i) != q.at(i))
count++;
}
if (count == 2 || count == 0) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,365 | 763,366 | u474760662 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> p;
int point = 0;
for (int i = 1; i < N + 1; i++) {
int a;
cin >> a;
if (a != i) {
point++;
}
}
if (point == 2 || point == 0) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> p;
int point = 0;
for (int i = 1; i < N + 1; i++) {
int a;
cin >> a;
if (a != i) {
point++;
}
}
if (point == 2 || point == 0) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,369 | 763,370 | u636018568 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define FASTINOUT \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
const ll mod = 1e9 + 7;
const int N = 2e5 + 9;
int main() {
FASTINOUT;
int x;
cin >> x;
int y[x];
int q[x];
for (int i = 0; i < x; i++) {
cin >> y[i];
q[i] = y[i];
}
sort(q, q + x);
int c = 0;
for (int i = 0; i < x; i++) {
if (q[i] != y[i])
c++;
}
if (c <= 2)
cout << "Yes";
else
cout << "No";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define FASTINOUT \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
const ll mod = 1e9 + 7;
const int N = 2e5 + 9;
int main() {
FASTINOUT;
int x;
cin >> x;
int y[x];
int q[x];
for (int i = 0; i < x; i++) {
cin >> y[i];
q[i] = y[i];
}
sort(q, q + x);
int c = 0;
for (int i = 0; i < x; i++) {
if (q[i] != y[i])
c++;
}
if (c <= 2)
cout << "YES";
else
cout << "NO";
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,373 | 763,374 | u257571179 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
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 = 1; i <= n; i++) {
if (i != p[i - 1]) {
cnt++;
// cout << i << " " << p[i-1] << endl;
}
}
if (cnt == 2 || cnt == 0)
cout << "Yes";
else
cout << "No";
cout << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
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 = 1; i <= n; i++) {
if (i != p[i - 1]) {
cnt++;
// cout << i << " " << p[i-1] << endl;
}
}
if (cnt == 2 || cnt == 0)
cout << "YES";
else
cout << "NO";
cout << endl;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,375 | 763,376 | u191484928 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int count = 0;
vector<int> A(N);
vector<int> B(N);
for (int i = 0; i < N; ++i)
cin >> A[i];
for (int i = 0; i < N; ++i)
B[i] = A[i];
sort(A.begin(), A.end());
for (int j = 0; j < N; ++j) {
if (A[j] != B[j])
count++;
}
if (count <= 2)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int count = 0;
vector<int> A(N);
vector<int> B(N);
for (int i = 0; i < N; ++i)
cin >> A[i];
for (int i = 0; i < N; ++i)
B[i] = A[i];
sort(A.begin(), A.end());
for (int j = 0; j < N; ++j) {
if (A[j] != B[j])
count++;
}
if (count <= 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,378 | 763,379 | u846025219 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
const int MOD = 1000000007;
int main() {
int N;
cin >> N;
vector<int> p(N);
int count = 0;
int a, b;
bool can = false;
for (int i = 0; i < N; i++) {
cin >> p.at(i);
}
for (int i = 1; i < N + 1; i++) {
if (p.at(i - 1) != i and count == 0) { //昇順ではない時
a = i; //来るべき値をaに保持
b = p.at(i - 1); //実際に入っていた値をbに保持
count++;
continue;
}
if (p.at(i - 1) != i and count == 1) { //二回目の昇順ではない時
if (i == b and p.at(i - 1) == a) {
can = true;
count++;
continue;
} else {
can = false;
break;
}
}
if (p.at(i - 1) != i and count == 2) {
can = false;
break;
}
}
if (can) {
cout << "YES";
} else {
cout << "NO";
}
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
const int MOD = 1000000007;
int main() {
int N;
cin >> N;
vector<int> p(N);
int count = 0;
int a, b;
bool can = false;
for (int i = 0; i < N; i++) {
cin >> p.at(i);
}
for (int i = 1; i < N + 1; i++) {
if (p.at(i - 1) != i and count == 0) { //昇順ではない時
a = i; //来るべき値をaに保持
b = p.at(i - 1); //実際に入っていた値をbに保持
count++;
continue;
}
if (p.at(i - 1) != i and count == 1) { //二回目の昇順ではない時
if (i == b and p.at(i - 1) == a) {
can = true;
count++;
continue;
} else {
can = false;
break;
}
}
if (p.at(i - 1) != i and count == 2) {
can = false;
break;
}
}
if (can or count == 0) {
cout << "YES";
} else {
cout << "NO";
}
} | [
"control_flow.branch.if.condition.change",
"variable_declaration.add"
] | 763,381 | 763,382 | u574687269 | cpp |
p02958 | #include <iostream>
#include <math.h>
using namespace std;
int main() {
int n;
cin >> n;
int p[60];
int c = 0;
for (int i = 0; i < n; i++) {
cin >> p[i];
if (p[i] != i + 1)
c++;
}
if (c > 2)
cout << "No" << endl;
else
cout << "Yes" << endl;
} | #include <iostream>
#include <math.h>
using namespace std;
int main() {
int n;
cin >> n;
int p[60];
int c = 0;
for (int i = 0; i < n; i++) {
cin >> p[i];
if (p[i] != i + 1)
c++;
}
if (c > 2)
cout << "NO" << endl;
else
cout << "YES" << endl;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,383 | 763,384 | u027762862 | 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 x = 0;
for (int i = 0; i < N; i++) {
if (p[i] != i + 1)
x++;
}
if (x == 0 && x == 2)
puts("YES");
else
puts("NO");
} | #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 x = 0;
for (int i = 0; i < N; i++) {
if (p[i] != i + 1)
x++;
}
if (x == 0 || x == 2)
puts("YES");
else
puts("NO");
} | [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 763,385 | 763,386 | u146788010 | 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 x = 0;
for (int i = 0; i < N; i++) {
if (p[i] != i + 1)
x++;
}
if (x == 2)
puts("YES");
else
puts("NO");
} | #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 x = 0;
for (int i = 0; i < N; i++) {
if (p[i] != i + 1)
x++;
}
if (x == 0 || x == 2)
puts("YES");
else
puts("NO");
} | [
"control_flow.branch.if.condition.change"
] | 763,387 | 763,386 | u146788010 | cpp |
p02958 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <string>
#include <vector>
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define ll long long
using namespace std;
int main() {
int n;
cin >> n;
vector<int> p(n);
vector<int> temp(n);
rep(i, n) {
cin >> p[i];
temp[i] = p[i];
}
sort(temp.begin(), temp.end());
bool ok = true;
int cnt = 0;
rep(i, n) {
if (!(p[i] == temp[i])) {
cnt++;
}
}
if (cnt >= 3)
ok = false;
if (ok)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <string>
#include <vector>
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define ll long long
using namespace std;
int main() {
int n;
cin >> n;
vector<int> p(n);
vector<int> temp(n);
rep(i, n) {
cin >> p[i];
temp[i] = p[i];
}
sort(temp.begin(), temp.end());
bool ok = true;
int cnt = 0;
rep(i, n) {
if (!(p[i] == temp[i])) {
cnt++;
}
}
if (cnt >= 3)
ok = false;
if (ok)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,388 | 763,389 | u294829559 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int i, p[n], w = 0;
for (i = 0; i < n; i++) {
cin >> p[i];
if (p[i] != (i + 1))
w++;
}
if (w > 2)
cout << "No" << endl;
else
cout << "Yes" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int i, p[n], w = 0;
for (i = 0; i < n; i++) {
cin >> p[i];
if (p[i] != (i + 1))
w++;
}
if (w > 2)
cout << "NO" << endl;
else
cout << "YES" << endl;
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,392 | 763,393 | u719967911 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> p(n);
int sum = 0;
for (int i = 0; i < n; i++) {
cin >> p[i];
if (p[i] != i + 1) {
sum++;
}
}
if (sum > 2) {
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> p(n);
int sum = 0;
for (int i = 0; i < n; i++) {
cin >> p[i];
if (p[i] != i + 1) {
sum++;
}
}
if (sum > 2) {
cout << "NO" << endl;
} else {
cout << "YES" << endl;
}
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,395 | 763,396 | u176218583 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> p(n);
int sum = 0;
for (int i = 0; i < n; i++) {
cin >> p[i];
if (p[i] == i + 1) {
sum++;
}
}
if (sum > 2) {
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> p(n);
int sum = 0;
for (int i = 0; i < n; i++) {
cin >> p[i];
if (p[i] != i + 1) {
sum++;
}
}
if (sum > 2) {
cout << "NO" << endl;
} else {
cout << "YES" << endl;
}
return 0;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,398 | 763,396 | u176218583 | cpp |
p02958 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
int p;
vector<int> ps;
for (int i = 0; i < N; ++i) {
cin >> p;
ps.push_back(p);
}
int cnt = 0;
for (int i = 1; i <= N; ++i) {
if (ps[i - 1] != i) {
cnt += 1;
}
}
if (cnt == 2) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
}
| #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
int p;
vector<int> ps;
for (int i = 0; i < N; ++i) {
cin >> p;
ps.push_back(p);
}
int cnt = 0;
for (int i = 1; i <= N; ++i) {
if (ps[i - 1] != i) {
cnt += 1;
}
}
if (cnt == 2 || cnt == 0) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 763,399 | 763,400 | u319569229 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; i++) {
cin >> p.at(i);
}
for (int i = 0; i < n; i++) {
if (p.at(i) != i + 1) {
k++;
}
}
if (k == 2 || k == 0) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
k = 0;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; i++) {
cin >> p.at(i);
}
for (int i = 0; i < n; i++) {
if (p.at(i) != i + 1) {
k++;
}
}
if (k == 2 || k == 0) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
} | [
"assignment.add"
] | 763,401 | 763,402 | u233383925 | cpp |
p02958 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<char> p(n), s(n);
for (int i = 0; i < n; i++) {
cin >> p[i];
s[i] = p[i];
}
sort(s.begin(), s.end());
int cnt = 0;
for (int i = 0; i < n; i++) {
if (s[i] != p[i]) {
cnt++;
}
}
if (cnt <= 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), s(n);
for (int i = 0; i < n; i++) {
cin >> p[i];
s[i] = p[i];
}
sort(s.begin(), s.end());
int cnt = 0;
for (int i = 0; i < n; i++) {
if (s[i] != p[i]) {
cnt++;
}
}
if (cnt <= 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
} | [
"variable_declaration.type.primitive.change"
] | 763,407 | 763,408 | u011716617 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define st string
#define dl double
#define ve(i) vector<i>
#define repi(i, m, n) for (int i = (int)(m); i < (int)(n); i++)
#define rep(i, n) repi(i, 0, n)
#define sz(v) ((int)(v).size())
#define each(i, n) for (auto &&i : n)
#define pr(n) cout << fixed << setprecision(n)
#define ci(n) cin >> n
#define ci2(n, o) cin >> n >> o
#define ci3(n, o, p) cin >> n >> o >> p
#define co(n) cout << n << endl
int main() {
int N, a = 0;
ci(N);
ve(int) p(N);
rep(i, N) { ci(p.at(i)); }
rep(i, N) {
if (p.at(i) != i + 1) {
a++;
}
}
if (a <= 2) {
co("Yes");
} else {
co("No");
}
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define st string
#define dl double
#define ve(i) vector<i>
#define repi(i, m, n) for (int i = (int)(m); i < (int)(n); i++)
#define rep(i, n) repi(i, 0, n)
#define sz(v) ((int)(v).size())
#define each(i, n) for (auto &&i : n)
#define pr(n) cout << fixed << setprecision(n)
#define ci(n) cin >> n
#define ci2(n, o) cin >> n >> o
#define ci3(n, o, p) cin >> n >> o >> p
#define co(n) cout << n << endl
int main() {
int N, a = 0;
ci(N);
ve(int) p(N);
rep(i, N) { ci(p.at(i)); }
rep(i, N) {
if (p.at(i) != i + 1) {
a++;
}
}
if (a <= 2) {
co("YES");
} else {
co("NO");
}
} | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change"
] | 763,409 | 763,410 | u449573758 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define INF 999999999
#define rep(i, n) for (int i = 0; i < n; i++)
const int MOD = 1000000007;
ll cnt = 0;
int main() {
int n;
cin >> n;
vector<int> p(n);
rep(i, n) { cin >> p.at(i); }
for (int i = 0; i < n; i++) {
if (p.at(i) != i + 1) {
cnt++;
}
}
if (cnt > 2) {
cout << "No" << endl;
return 0;
} else {
cout << "Yes" << endl;
return 0;
}
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define INF 999999999
#define rep(i, n) for (int i = 0; i < n; i++)
const int MOD = 1000000007;
ll cnt = 0;
int main() {
int n;
cin >> n;
vector<int> p(n);
rep(i, n) { cin >> p.at(i); }
for (int i = 0; i < n; i++) {
if (p.at(i) != i + 1) {
cnt++;
}
}
if (cnt > 2) {
cout << "NO" << endl;
return 0;
} else {
cout << "YES" << endl;
return 0;
}
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,411 | 763,412 | u179593519 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define INF 999999999
#define rep(i, n) for (int i = 0; i < n; i++)
const int MOD = 1000000007;
ll cnt = 0;
int main() {
int n;
cin >> n;
vector<int> p(n);
rep(i, n) { cin >> p.at(i); }
for (int i = 0; i < n; i++) {
if (p.at(i) != i + 1) {
cnt++;
}
}
if (cnt > 2) {
cout << "No" << endl;
return 0;
} else {
cout << "Yes" << endl;
return 0;
}
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define INF 999999999
#define rep(i, n) for (int i = 0; i < n; i++)
const int MOD = 1000000007;
ll cnt = 0;
int main() {
int n;
cin >> n;
vector<int> p(n);
rep(i, n) { cin >> p.at(i); }
for (int i = 0; i < n; i++) {
if (p.at(i) != i + 1) {
cnt++;
}
}
if (cnt > 2) {
cout << "NO" << endl;
return 0;
} else {
cout << "YES" << endl;
return 0;
}
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,413 | 763,412 | u179593519 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const int MAX = 50;
int main() {
int n, a;
cin >> n;
int cnt = 0;
rep(i, n) {
cin >> a;
if (i != a - 1)
cnt++;
}
if (cnt == 2) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const int MAX = 50;
int main() {
int n, a;
cin >> n;
int cnt = 0;
rep(i, n) {
cin >> a;
if (i != a - 1)
cnt++;
}
if (cnt == 2 || cnt == 0) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} | [
"control_flow.branch.if.condition.change"
] | 763,416 | 763,417 | u621582427 | cpp |
p02958 | #include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <vector>
#define inf 1000000000
#define mod 1e9 + 1
#pragma GCC optimization("O3")
using namespace std;
const long long int N = 6999999;
#define all(x) begin(x), end(x)
int main() {
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
// ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
int n, c = 0;
cin >> n;
vector<int> v(n), sv(n);
for (int i = 0; i < n; ++i) {
cin >> v[i];
sv[i] == v[i];
}
sort(sv.begin(), sv.end());
for (int i = 0; i < n; ++i) {
if (v[i] != sv[i]) {
c++;
}
}
if (c < 2)
cout << "YES";
else
cout << "NO";
return 0;
}
| #include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <vector>
#define inf 1000000000
#define mod 1e9 + 1
#pragma GCC optimization("O3")
using namespace std;
const long long int N = 6999999;
#define all(x) begin(x), end(x)
int main() {
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
// ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
int n, c = 0;
cin >> n;
vector<int> v(n), sv(n);
for (int i = 0; i < n; ++i) {
cin >> v[i];
sv[i] = v[i];
}
sort(sv.begin(), sv.end());
for (int i = 0; i < n; ++i) {
if (v[i] != sv[i]) {
c++;
}
}
if (c > 2)
cout << "NO";
else
cout << "YES";
return 0;
}
| [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo",
"misc.opposites",
"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"
] | 763,422 | 763,423 | u022688266 | cpp |
p02958 | #include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <vector>
#define inf 1000000000
#define mod 1e9 + 1
#pragma GCC optimization("O3")
using namespace std;
const long long int N = 6999999;
#define all(x) begin(x), end(x)
int main() {
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
// ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
int n, c = 0;
cin >> n;
vector<int> v(n), sv(n);
for (int i = 0; i < n; ++i) {
cin >> v[i];
sv[i] == v[i];
}
sort(sv.begin(), sv.end());
for (int i = 0; i < n; ++i) {
if (v[i] != sv[i]) {
c++;
}
}
if (c < 2)
cout << "Yes";
else
cout << "No";
return 0;
}
| #include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <vector>
#define inf 1000000000
#define mod 1e9 + 1
#pragma GCC optimization("O3")
using namespace std;
const long long int N = 6999999;
#define all(x) begin(x), end(x)
int main() {
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
// ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
int n, c = 0;
cin >> n;
vector<int> v(n), sv(n);
for (int i = 0; i < n; ++i) {
cin >> v[i];
sv[i] = v[i];
}
sort(sv.begin(), sv.end());
for (int i = 0; i < n; ++i) {
if (v[i] != sv[i]) {
c++;
}
}
if (c > 2)
cout << "NO";
else
cout << "YES";
return 0;
}
| [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"io.output.change"
] | 763,424 | 763,423 | u022688266 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
int n, A[10000], B[10000], c = 0;
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> A[i];
B[i] = A[i];
}
sort(B, B + n);
for (int i = 0; i < n; ++i) {
if (A[i] != B[i]) {
c++;
}
}
if (c == 2) {
cout << "YES\n";
} else
cout << "NO\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
int n, A[10000], B[10000], c = 0;
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> A[i];
B[i] = A[i];
}
sort(B, B + n);
for (int i = 0; i < n; ++i) {
if (A[i] != B[i]) {
c++;
}
}
if (c == 2 || c == 0) {
cout << "YES\n";
} else
cout << "NO\n";
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 763,425 | 763,426 | u022688266 | cpp |
p02958 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define strall(v) (v).cbegin(), (v).cend()
using namespace std;
using ll = long long;
using P = pair<int, int>;
using Graph = vector<vector<int>>;
template <class t, class u> void chmax(t &a, u b) {
if (a < b)
a = b;
}
template <class t, class u> void chmin(t &a, u b) {
if (b < a)
a = b;
}
// const long long INF = 1LL << 60;
int INF = 500000;
int MAX = 1e5 + 10;
ll mod = 1e9 + 7;
int main() {
int n, cnt = 0;
cin >> n;
vector<int> p(n, 0);
rep(i, n) cin >> p[i];
rep(i, n) {
if (i + 1 != p[i])
cnt++;
}
cout << ((cnt < 3) ? "Yes" : "No") << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define strall(v) (v).cbegin(), (v).cend()
using namespace std;
using ll = long long;
using P = pair<int, int>;
using Graph = vector<vector<int>>;
template <class t, class u> void chmax(t &a, u b) {
if (a < b)
a = b;
}
template <class t, class u> void chmin(t &a, u b) {
if (b < a)
a = b;
}
// const long long INF = 1LL << 60;
int INF = 500000;
int MAX = 1e5 + 10;
ll mod = 1e9 + 7;
int main() {
int n, cnt = 0;
cin >> n;
vector<int> p(n, 0);
rep(i, n) cin >> p[i];
rep(i, n) {
if (i + 1 != p[i])
cnt++;
}
cout << ((cnt < 3) ? "YES" : "NO") << endl;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,433 | 763,434 | u106635407 | cpp |
p02958 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
int n, cnt = 0;
int p[50];
cin >> n;
for (int i = 0; i < n; i++) {
cin >> p[i];
}
for (int i = 0; i < n; i++) {
int min = i;
for (int j = i + 1; j < n; j++) {
if (p[j] < p[min]) {
min = j;
}
}
if (min != i) {
swap(p[i], p[min]);
cnt++;
}
}
cout << (cnt <= 2 ? "YES" : "NO") << endl;
} | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
int n, cnt = 0;
int p[50];
cin >> n;
for (int i = 0; i < n; i++) {
cin >> p[i];
}
for (int i = 0; i < n; i++) {
int min = i;
for (int j = i + 1; j < n; j++) {
if (p[j] < p[min]) {
min = j;
}
}
if (min != i) {
swap(p[i], p[min]);
cnt++;
// cout << "swap" << endl;
}
}
cout << (cnt < 2 ? "YES" : "NO") << endl;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"io.output.change"
] | 763,441 | 763,442 | u185935459 | cpp |
p02958 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
void security() {
string s;
cin >> s;
for (int i = 1; i < s.size(); ++i) {
if (s[i - 1] == s[i]) {
cout << "Bad\n";
return;
}
}
cout << "Good\n";
}
void fifty_fify() {
string s;
cin >> s;
sort(s.begin(), s.end());
if (s[0] == s[1] && s[1] != s[2] && s[2] == s[3])
cout << "Yes\n";
else
cout << "No\n";
}
void dodecagon() {
int r;
cin >> r;
cout << 3 * r * r << "\n";
}
void harmony() {
int a, b;
cin >> a >> b;
if (a % 2 == b % 2)
cout << (a + b) / 2 << "\n";
else
cout << "IMPOSSIBLE\n";
}
void transfer() {
int a, b, c;
cin >> a >> b >> c;
cout << max(0, c - (a - b)) << "\n";
}
void A_137() {
int a, b;
cin >> a >> b;
cout << max(a + b, max(a - b, a * b)) << "\n";
}
void red_or_not() {
int a;
cin >> a;
string s;
cin >> s;
if (a >= 3200)
cout << s << "\n";
else
cout << "red\n";
}
void tenki() {
string s, t;
cin >> s >> t;
int cnt = 0;
for (int i = 0; i < 3; ++i) {
if (s[i] == t[i])
++cnt;
}
cout << cnt << "\n";
}
void password() {
int n;
cin >> n;
cout << pow(n, 3) << "\n";
}
void swap_0or1() {
int n;
cin >> n;
int cnt = 0;
for (int i = 1; i <= n; ++i) {
int p;
cin >> p;
if (p != i)
++cnt;
}
if (cnt <= 2)
cout << "YES\n";
else
cout << "No\n";
}
void uneven_numbers() {
int n;
cin >> n;
int ans = 0;
for (int i = 1; i <= n; ++i) {
string s = to_string(i);
if (s.size() % 2 == 1)
++ans;
}
cout << ans << "\n";
}
void one_clue() {
int k, x;
cin >> k >> x;
for (int i = x - k + 1; i < x + k; ++i) {
if (i == x + k - 1)
cout << i << "\n";
else
cout << i << " ";
}
}
void resistors_in_parallel() {
int n;
cin >> n;
vector<float> a(n);
for (int i = 0; i < n; ++i)
cin >> a[i];
float ans = 0.0;
for (int i = 0; i < n; ++i)
ans += 1.0 / a[i];
cout << 1.0 / ans << "\n";
}
void power_socket() {
int a, b;
cin >> a >> b;
if (b == 1)
cout << 0 << "\n";
int cnt = 1, tap = (a - 1) * cnt + 1;
while (tap < b) {
++cnt;
tap += a - 1;
}
cout << cnt << "\n";
}
void buffet() {
int n;
cin >> n;
vector<int> a(n), b(n), c(n - 1);
for (int i = 0; i < n; ++i)
cin >> a[i];
for (int i = 0; i < n; ++i)
cin >> b[i];
for (int i = 0; i < n - 1; ++i)
cin >> c[i];
int ans = 0;
for (int i = 0; i < n; ++i) {
ans += b[a[i] - 1];
if (i > 0 && a[i - 1] + 1 == a[i])
ans += c[a[i - 1] - 1];
}
cout << ans << "\n";
}
int main() {
// security();
// fifty_fify();
// dodecagon();
// harmony();
// transfer();
// A_137();
// red_or_not();
// tenki();
// password();
swap_0or1();
// uneven_numbers();
// one_clue();
// resistors_in_parallel();
// power_socket();
// buffet();
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
void security() {
string s;
cin >> s;
for (int i = 1; i < s.size(); ++i) {
if (s[i - 1] == s[i]) {
cout << "Bad\n";
return;
}
}
cout << "Good\n";
}
void fifty_fify() {
string s;
cin >> s;
sort(s.begin(), s.end());
if (s[0] == s[1] && s[1] != s[2] && s[2] == s[3])
cout << "Yes\n";
else
cout << "No\n";
}
void dodecagon() {
int r;
cin >> r;
cout << 3 * r * r << "\n";
}
void harmony() {
int a, b;
cin >> a >> b;
if (a % 2 == b % 2)
cout << (a + b) / 2 << "\n";
else
cout << "IMPOSSIBLE\n";
}
void transfer() {
int a, b, c;
cin >> a >> b >> c;
cout << max(0, c - (a - b)) << "\n";
}
void A_137() {
int a, b;
cin >> a >> b;
cout << max(a + b, max(a - b, a * b)) << "\n";
}
void red_or_not() {
int a;
cin >> a;
string s;
cin >> s;
if (a >= 3200)
cout << s << "\n";
else
cout << "red\n";
}
void tenki() {
string s, t;
cin >> s >> t;
int cnt = 0;
for (int i = 0; i < 3; ++i) {
if (s[i] == t[i])
++cnt;
}
cout << cnt << "\n";
}
void password() {
int n;
cin >> n;
cout << pow(n, 3) << "\n";
}
void swap_0or1() {
int n;
cin >> n;
int cnt = 0;
for (int i = 1; i <= n; ++i) {
int p;
cin >> p;
if (p != i)
++cnt;
}
if (cnt <= 2)
cout << "YES\n";
else
cout << "NO\n";
}
void uneven_numbers() {
int n;
cin >> n;
int ans = 0;
for (int i = 1; i <= n; ++i) {
string s = to_string(i);
if (s.size() % 2 == 1)
++ans;
}
cout << ans << "\n";
}
void one_clue() {
int k, x;
cin >> k >> x;
for (int i = x - k + 1; i < x + k; ++i) {
if (i == x + k - 1)
cout << i << "\n";
else
cout << i << " ";
}
}
void resistors_in_parallel() {
int n;
cin >> n;
vector<float> a(n);
for (int i = 0; i < n; ++i)
cin >> a[i];
float ans = 0.0;
for (int i = 0; i < n; ++i)
ans += 1.0 / a[i];
cout << 1.0 / ans << "\n";
}
void power_socket() {
int a, b;
cin >> a >> b;
if (b == 1)
cout << 0 << "\n";
int cnt = 1, tap = (a - 1) * cnt + 1;
while (tap < b) {
++cnt;
tap += a - 1;
}
cout << cnt << "\n";
}
void buffet() {
int n;
cin >> n;
vector<int> a(n), b(n), c(n - 1);
for (int i = 0; i < n; ++i)
cin >> a[i];
for (int i = 0; i < n; ++i)
cin >> b[i];
for (int i = 0; i < n - 1; ++i)
cin >> c[i];
int ans = 0;
for (int i = 0; i < n; ++i) {
ans += b[a[i] - 1];
if (i > 0 && a[i - 1] + 1 == a[i])
ans += c[a[i - 1] - 1];
}
cout << ans << "\n";
}
int main() {
// security();
// fifty_fify();
// dodecagon();
// harmony();
// transfer();
// A_137();
// red_or_not();
// tenki();
// password();
swap_0or1();
// uneven_numbers();
// one_clue();
// resistors_in_parallel();
// power_socket();
// buffet();
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,447 | 763,448 | u546641746 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
#define Fast \
ios_base::sync_with_stdio(0); \
cin.tie(0), cout.tie(0)
#define FO freopen("in.txt", "r", stdin)
#define FC freopen("out.txt", "w", stdout)
#define aise cout << "aise" << endl
#define pb push_back
#define mp make_pair
#define ll long long
#define mset(v, a) memset(v, a, sizeof(v))
#define pll pair<ll, ll>
#define pdd pair<double, double>
#define ff first
#define ss second
#define pi acos(-1.0)
#define mxN 2097162
#define inf 1e9
#define MOD 1000000007
int main() {
ll n, ch = 0;
vector<ll> v1, v2;
cin >> n;
for (ll i = 0; i < n; i++) {
ll x;
cin >> x;
v1.pb(x);
}
v2 = v1;
sort(v2.begin(), v2.end());
for (ll i = 0; i < v1.size(); i++) {
if (v1[i] != v2[i])
ch++;
}
if (ch > 2)
cout << "No";
else
cout << "Yes";
}
| #include <bits/stdc++.h>
using namespace std;
#define Fast \
ios_base::sync_with_stdio(0); \
cin.tie(0), cout.tie(0)
#define FO freopen("in.txt", "r", stdin)
#define FC freopen("out.txt", "w", stdout)
#define aise cout << "aise" << endl
#define pb push_back
#define mp make_pair
#define ll long long
#define mset(v, a) memset(v, a, sizeof(v))
#define pll pair<ll, ll>
#define pdd pair<double, double>
#define ff first
#define ss second
#define pi acos(-1.0)
#define mxN 2097162
#define inf 1e9
#define MOD 1000000007
int main() {
ll n, ch = 0;
vector<ll> v1, v2;
cin >> n;
for (ll i = 0; i < n; i++) {
ll x;
cin >> x;
v1.pb(x);
}
v2 = v1;
sort(v2.begin(), v2.end());
for (ll i = 0; i < v1.size(); i++) {
if (v1[i] != v2[i])
ch++;
}
if (ch > 2)
cout << "NO";
else
cout << "YES";
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,449 | 763,450 | u568082675 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> data(n);
for (int i = 0; i < n; i++) {
cin >> data.at(i);
}
int count = 0;
for (int i = 0; i < n; i++) {
if (i + 1 != data.at(i)) {
count++;
}
}
if (count < 3) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> data(n);
for (int i = 0; i < n; i++) {
cin >> data.at(i);
}
int count = 0;
for (int i = 0; i < n; i++) {
if (i + 1 != data.at(i)) {
count++;
}
}
if (count < 3) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,451 | 763,452 | u164352406 | 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];
}
for (int i = 0; i < N; i++) {
if (p[i] != i + 1)
count++;
}
if (count > 2)
cout << "No" << endl;
else
cout << "Yes" << endl;
} | #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];
}
for (int i = 0; i < N; i++) {
if (p[i] != i + 1)
count++;
}
if (count > 2)
cout << "NO" << endl;
else
cout << "YES" << endl;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,453 | 763,454 | u796273093 | cpp |
p02958 | /*
このコード、と～おれ!
Be accepted!
∧＿∧
（｡･ω･｡)つ━☆・*。
⊂ ノ ・゜+.
しーＪ °。+ *´¨)
.· ´¸.·*´¨) ¸.·*¨)
(¸.·´ (¸.·'* ☆
*/
#include <algorithm>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
/*多倍長整数/cpp_intで宣言
#include <boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
*/
#pragma gcc target("avx2")
#pragma gcc optimization("o3")
#pragma gcc optimization("unroll-loops")
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i <= (n); ++i)
#define rep2(i, n) for (int i = 2; i < (n); ++i)
#define repr(i, n) for (int i = n; i >= 0; --i)
#define reprm(i, n) for (int i = n - 1; i >= 0; --i)
#define printynl(a) printf(a ? "yes\n" : "no\n")
#define printyn(a) printf(a ? "Yes\n" : "No\n")
#define printYN(a) printf(a ? "YES\n" : "NO\n")
#define printim(a) printf(a ? "possible\n" : "imposible\n")
#define printdb(a) printf("%.50lf\n", a) //少数出力
#define printdbd(a) printf("%.16lf\n", a) //少数出力(桁少なめ)
#define prints(s) printf("%s\n", s.c_str()) // string出力
#define all(x) (x).begin(), (x).end()
#define allsum(a, b, c) ((a + b) * c / 2.0) //等差数列の和、初項,末項,項数
#define pb push_back
#define priq priority_queue
#define rpriq priq<int, vector<int>, greater<int>>
#define deg_to_rad(deg) (((deg) / 360.0) * 2.0 * PI)
#define rad_to_deg(rad) (((rad) / 2.0 / PI) * 360.0)
#define Please return
#define AC 0
#define addf(T) [](T a, T b) { return (a + b); }
#define minf(T) [](T a, T b) { return min(a, b); }
#define maxf(T) [](T a, T b) { return max(a, b); }
#define nopf(T) [](T a) { return a; }
#define manhattan_dist(a, b, c, d) \
(abs(a - c) + abs(b - d)) /*(a, b) から (c, d) のマンハッタン距離 */
using ll = long long;
constexpr int INF = 1073741823;
constexpr int MINF = -1073741823;
constexpr ll LINF = ll(4661686018427387903);
constexpr ll MOD = 1000000007;
const long double PI = acos(-1.0L);
using namespace std;
void scans(string &str) {
char c;
str = "";
scanf("%c", &c);
if (c == '\n')
scanf("%c", &c);
while (c != '\n' && c != -1 && c != ' ') {
str += c;
scanf("%c", &c);
}
}
void scanc(char &str) {
char c;
scanf("%c", &c);
if (c == -1)
return;
while (c == '\n') {
scanf("%c", &c);
}
str = c;
}
double acot(double x) { return PI / 2 - atan(x); }
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll number1, ll number2) {
return number1 / gcd(number1, number2) * number2;
}
ll LSB(ll n) { return (n & (-n)); }
/*-----------------------------------------ここからコード-----------------------------------------*/
int main() {
int n, a, f = 0;
scanf("%d", &n);
rep(i, n) {
scanf("%d", &a);
if (a != i + 1)
++f;
}
printYN(f < 2);
Please AC;
}
| /*
このコード、と～おれ!
Be accepted!
∧＿∧
（｡･ω･｡)つ━☆・*。
⊂ ノ ・゜+.
しーＪ °。+ *´¨)
.· ´¸.·*´¨) ¸.·*¨)
(¸.·´ (¸.·'* ☆
*/
#include <algorithm>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
/*多倍長整数/cpp_intで宣言
#include <boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
*/
#pragma gcc target("avx2")
#pragma gcc optimization("o3")
#pragma gcc optimization("unroll-loops")
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i <= (n); ++i)
#define rep2(i, n) for (int i = 2; i < (n); ++i)
#define repr(i, n) for (int i = n; i >= 0; --i)
#define reprm(i, n) for (int i = n - 1; i >= 0; --i)
#define printynl(a) printf(a ? "yes\n" : "no\n")
#define printyn(a) printf(a ? "Yes\n" : "No\n")
#define printYN(a) printf(a ? "YES\n" : "NO\n")
#define printim(a) printf(a ? "possible\n" : "imposible\n")
#define printdb(a) printf("%.50lf\n", a) //少数出力
#define printdbd(a) printf("%.16lf\n", a) //少数出力(桁少なめ)
#define prints(s) printf("%s\n", s.c_str()) // string出力
#define all(x) (x).begin(), (x).end()
#define allsum(a, b, c) ((a + b) * c / 2.0) //等差数列の和、初項,末項,項数
#define pb push_back
#define priq priority_queue
#define rpriq priq<int, vector<int>, greater<int>>
#define deg_to_rad(deg) (((deg) / 360.0) * 2.0 * PI)
#define rad_to_deg(rad) (((rad) / 2.0 / PI) * 360.0)
#define Please return
#define AC 0
#define addf(T) [](T a, T b) { return (a + b); }
#define minf(T) [](T a, T b) { return min(a, b); }
#define maxf(T) [](T a, T b) { return max(a, b); }
#define nopf(T) [](T a) { return a; }
#define manhattan_dist(a, b, c, d) \
(abs(a - c) + abs(b - d)) /*(a, b) から (c, d) のマンハッタン距離 */
using ll = long long;
constexpr int INF = 1073741823;
constexpr int MINF = -1073741823;
constexpr ll LINF = ll(4661686018427387903);
constexpr ll MOD = 1000000007;
const long double PI = acos(-1.0L);
using namespace std;
void scans(string &str) {
char c;
str = "";
scanf("%c", &c);
if (c == '\n')
scanf("%c", &c);
while (c != '\n' && c != -1 && c != ' ') {
str += c;
scanf("%c", &c);
}
}
void scanc(char &str) {
char c;
scanf("%c", &c);
if (c == -1)
return;
while (c == '\n') {
scanf("%c", &c);
}
str = c;
}
double acot(double x) { return PI / 2 - atan(x); }
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll number1, ll number2) {
return number1 / gcd(number1, number2) * number2;
}
ll LSB(ll n) { return (n & (-n)); }
/*-----------------------------------------ここからコード-----------------------------------------*/
int main() {
int n, a, f = 0;
scanf("%d", &n);
rep(i, n) {
scanf("%d", &a);
if (a != i + 1)
++f;
}
printYN(f < 3);
Please AC;
}
| [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 763,460 | 763,461 | u917972976 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double ld;
#define for0(i, n) for (ll i = 0; i < (ll)(n); ++i) // 0 based indexing
#define for1(i, n) for (ll i = 1; i <= (ll)(n); ++i) // 1 based indexing
#define forc(i, l, r) \
for (ll i = (ll)(l); i <= (ll)(r); \
++i) // closed interver from l to r r inclusive
#define forr0(i, n) for (ll i = (ll)(n)-1; i >= 0; --i) // reverse 0 based.
#define forr1(i, n) for (ll i = (ll)(n); i >= 1; --i) // reverse 1 based
#define ff first
#define ss second
#define pb push_back
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll n;
cin >> n;
ll x = 0;
vector<ll> num(n);
for0(i, n) {
cin >> num[i];
if (num[i] != i + 1)
x++;
}
if (x == 2 || x == 0)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double ld;
#define for0(i, n) for (ll i = 0; i < (ll)(n); ++i) // 0 based indexing
#define for1(i, n) for (ll i = 1; i <= (ll)(n); ++i) // 1 based indexing
#define forc(i, l, r) \
for (ll i = (ll)(l); i <= (ll)(r); \
++i) // closed interver from l to r r inclusive
#define forr0(i, n) for (ll i = (ll)(n)-1; i >= 0; --i) // reverse 0 based.
#define forr1(i, n) for (ll i = (ll)(n); i >= 1; --i) // reverse 1 based
#define ff first
#define ss second
#define pb push_back
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll n;
cin >> n;
ll x = 0;
vector<ll> num(n);
for0(i, n) {
cin >> num[i];
if (num[i] != i + 1)
x++;
}
if (x == 2 || x == 0)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,471 | 763,472 | u155580903 | cpp |
p02958 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
using P = pair<int, int>;
typedef long long int ll;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
int main() {
int n;
cin >> n;
vector<int> h(n), x(n);
rep(i, n) {
cin >> h[i];
x[i] = h[i];
}
sort(x.begin(), x.end());
int cnt = 0;
rep(i, n) {
if (h[i] != x[i]) {
cnt++;
}
}
if (cnt == 2 || cnt == 0)
cout << "Yes" << endl;
else
cout << "NO" << endl;
return 0;
}
| #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
using P = pair<int, int>;
typedef long long int ll;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
int main() {
int n;
cin >> n;
vector<int> h(n), x(n);
rep(i, n) {
cin >> h[i];
x[i] = h[i];
}
sort(x.begin(), x.end());
int cnt = 0;
rep(i, n) {
if (h[i] != x[i]) {
cnt++;
}
}
if (cnt == 2 || cnt == 0)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,479 | 763,480 | u729285002 | cpp |
p02958 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
typedef long double ld;
typedef pair<ld, ld> LDP;
typedef vector<vector<ll>> mat;
typedef vector<int> vec;
#define stop \
char nyaa; \
cin >> nyaa;
#define rep(i, n) for (int i = 0; i < n; i++)
#define per(i, n) for (int i = n - 1; i >= 0; i--)
#define Rep(i, sta, n) for (int i = sta; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define per1(i, n) for (int i = n; i >= 1; i--)
#define Rep1(i, sta, n) for (int i = sta; i <= n; i++)
#define all(v) (v).begin(), (v).end()
const ll mod = 1000000007;
const ll INF = mod * mod;
const ld eps = 1e-12;
const ld pi = acos(-1.0);
// int qp(int a,ll b){int
// ans=1;do{if(b&1)ans=1ll*ans*a%mo;a=1ll*a*a%mo;}while(b>>=1);return ans;}
ll qp(ll a, ll b, int mo) {
int ans = 1;
do {
if (b & 1)
ans = 1ll * ans * a % mo;
a = 1ll * a * a % mo;
} while (b >>= 1);
return ans;
}
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};
void solve() {
ll a, b, c, n, k, x;
string s, t;
ll ans = 0;
double dans = 0;
string sans = "Yes";
cin >> a;
ll co = 0;
rep(i, a) {
ll tmp;
cin >> tmp;
if (i + 1 != tmp)
co++;
if (co > 2) {
sans = "No";
break;
}
}
// std::cout << ans << endl;
std::cout << sans << endl;
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(10);
solve();
// stop
return 0;
} | #include <algorithm>
#include <bitset>
#include <cassert>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
typedef long double ld;
typedef pair<ld, ld> LDP;
typedef vector<vector<ll>> mat;
typedef vector<int> vec;
#define stop \
char nyaa; \
cin >> nyaa;
#define rep(i, n) for (int i = 0; i < n; i++)
#define per(i, n) for (int i = n - 1; i >= 0; i--)
#define Rep(i, sta, n) for (int i = sta; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define per1(i, n) for (int i = n; i >= 1; i--)
#define Rep1(i, sta, n) for (int i = sta; i <= n; i++)
#define all(v) (v).begin(), (v).end()
const ll mod = 1000000007;
const ll INF = mod * mod;
const ld eps = 1e-12;
const ld pi = acos(-1.0);
// int qp(int a,ll b){int
// ans=1;do{if(b&1)ans=1ll*ans*a%mo;a=1ll*a*a%mo;}while(b>>=1);return ans;}
ll qp(ll a, ll b, int mo) {
int ans = 1;
do {
if (b & 1)
ans = 1ll * ans * a % mo;
a = 1ll * a * a % mo;
} while (b >>= 1);
return ans;
}
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};
void solve() {
ll a, b, c, n, k, x;
string s, t;
ll ans = 0;
double dans = 0;
string sans = "YES";
cin >> a;
ll co = 0;
rep(i, a) {
ll tmp;
cin >> tmp;
if (i + 1 != tmp)
co++;
if (co > 2) {
sans = "NO";
break;
}
}
// std::cout << ans << endl;
std::cout << sans << endl;
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(10);
solve();
// stop
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"variable_declaration.value.change",
"assignment.value.change"
] | 763,487 | 763,488 | u114137758 | cpp |
p02958 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <cstdint>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define all(a) a.begin(), a.end()
#define fi first
#define se second
#define RNG(x, a, n) &((x)[a]), &((x)[n])
typedef pair<int, int> PII;
typedef long long ll;
template <typename T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return true;
}
return false;
}
const int inf = 1e9 + 7;
const ll longinf = 1LL << 60;
const ll mod = 1e9 + 7;
int p[55], tmp[55], n, cnt;
int main() {
cin >> n;
rep(i, n) {
cin >> p[i];
tmp[i] = i + 1;
}
rep(i, n) {
if (p[i] != tmp[i])
cnt++;
}
if (cnt > 2)
cout << "No" << endl;
else
cout << "Yes" << endl;
return 0;
}
| #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <cstdint>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define all(a) a.begin(), a.end()
#define fi first
#define se second
#define RNG(x, a, n) &((x)[a]), &((x)[n])
typedef pair<int, int> PII;
typedef long long ll;
template <typename T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return true;
}
return false;
}
const int inf = 1e9 + 7;
const ll longinf = 1LL << 60;
const ll mod = 1e9 + 7;
int p[55], tmp[55], n, cnt;
int main() {
cin >> n;
rep(i, n) {
cin >> p[i];
tmp[i] = i + 1;
}
rep(i, n) {
if (p[i] != tmp[i])
cnt++;
}
if (cnt > 2)
cout << "NO" << endl;
else
cout << "YES" << endl;
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,493 | 763,494 | u519950235 | cpp |
p02958 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <cstdint>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define all(a) a.begin(), a.end()
#define fi first
#define se second
#define RNG(x, a, n) &((x)[a]), &((x)[n])
typedef pair<int, int> PII;
typedef long long ll;
template <typename T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return true;
}
return false;
}
const int inf = 1e9 + 7;
const ll longinf = 1LL << 60;
const ll mod = 1e9 + 7;
int p[55], tmp[55], n, cnt;
int main() {
cin >> n;
rep(i, n) {
cin >> p[i];
tmp[i] = i + 1;
}
rep(i, n) {
if (p[i] != tmp[i])
cnt++;
}
if (cnt > 1)
cout << "No" << endl;
else
cout << "Yes" << endl;
return 0;
}
| #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <cstdint>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define all(a) a.begin(), a.end()
#define fi first
#define se second
#define RNG(x, a, n) &((x)[a]), &((x)[n])
typedef pair<int, int> PII;
typedef long long ll;
template <typename T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return true;
}
return false;
}
const int inf = 1e9 + 7;
const ll longinf = 1LL << 60;
const ll mod = 1e9 + 7;
int p[55], tmp[55], n, cnt;
int main() {
cin >> n;
rep(i, n) {
cin >> p[i];
tmp[i] = i + 1;
}
rep(i, n) {
if (p[i] != tmp[i])
cnt++;
}
if (cnt > 2)
cout << "NO" << endl;
else
cout << "YES" << endl;
return 0;
}
| [
"literal.number.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,495 | 763,494 | u519950235 | cpp |
p02958 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
auto p = vector<int>(n);
for (auto &p_i : p)
cin >> p_i;
int counter = 0;
for (int i = 0; i < n; i++) {
if (p[i] != i + 1)
counter++;
}
cout << (counter == 2 ? "YES" : "NO");
return 0;
}
| #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
auto p = vector<int>(n);
for (auto &p_i : p)
cin >> p_i;
int counter = 0;
for (int i = 0; i < n; i++) {
if (p[i] != i + 1)
counter++;
}
cout << (counter == 0 || counter == 2 ? "YES" : "NO");
return 0;
}
| [
"expression.operation.binary.add"
] | 763,498 | 763,499 | u723394740 | cpp |
p02958 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep2(i, s, n) for (int i = s; i < n; ++i)
#define all(a) a.begin(), a.end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
vector<int> p(n), ip(n);
rep(i, n) cin >> p[i];
ip = p;
sort(all(ip));
if (ip == p) {
cout << "YES" << endl;
return 0;
}
rep(i, n - 1) rep2(j, i + 1, n) {
vector<int> np(n);
np = p;
swap(np[i], np[j]);
if (np == ip) {
cout << "YES" << endl;
return 0;
}
}
cout << "NO" << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep2(i, s, n) for (int i = s; i < n; ++i)
#define all(a) a.begin(), a.end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> p(n), ip(n);
rep(i, n) cin >> p[i];
ip = p;
sort(all(ip));
if (ip == p) {
cout << "YES" << endl;
return 0;
}
rep(i, n - 1) rep2(j, i + 1, n) {
vector<int> np(n);
np = p;
swap(np[i], np[j]);
if (np == ip) {
cout << "YES" << endl;
return 0;
}
}
cout << "NO" << endl;
} | [] | 763,502 | 763,503 | u853721692 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; i++) {
cin >> p.at(i);
}
int s = 1;
int tmp = 0;
int t = 0;
for (int i = 0; i < n; i++) {
if (p.at(i) == i + 1) {
continue;
} else if (s == 1) {
tmp = p.at(i);
t = i;
s++;
} else {
if (tmp == i + 1 && p.at(i) == t + 1) {
p.at(i) = tmp;
} else {
cout << "No" << endl;
return 0;
}
}
}
cout << "Yes" << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; i++) {
cin >> p.at(i);
}
int s = 1;
int tmp = 0;
int t = 0;
for (int i = 0; i < n; i++) {
if (p.at(i) == i + 1) {
continue;
} else if (s == 1) {
tmp = p.at(i);
t = i;
s++;
} else {
if (tmp == i + 1 && p.at(i) == t + 1) {
p.at(i) = tmp;
} else {
cout << "NO" << endl;
return 0;
}
}
}
cout << "YES" << endl;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,504 | 763,505 | u316226687 | cpp |
p02958 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <forward_list>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
#define rep(i, s, g) for ((i) = (s); (i) < (g); ++(i))
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const ll MOD = 1e9 + 7;
const ll INF = (1ll << 60);
int main(void) {
int n;
int k = 0;
cin >> n;
vector<int> p(n), p1(n);
for (int i = 0; i < n; i++) {
cin >> p[i];
p1[i] = p[i];
}
sort(p.begin(), p.end());
for (int i = 0; i < n; i++) {
if (p[i] != p1[i]) {
k++;
}
}
if (k <= 2) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <forward_list>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
#define rep(i, s, g) for ((i) = (s); (i) < (g); ++(i))
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const ll MOD = 1e9 + 7;
const ll INF = (1ll << 60);
int main(void) {
int n;
int k = 0;
cin >> n;
vector<int> p(n), p1(n);
for (int i = 0; i < n; i++) {
cin >> p[i];
p1[i] = p[i];
}
sort(p.begin(), p.end());
for (int i = 0; i < n; i++) {
if (p[i] != p1[i]) {
k++;
}
}
if (k <= 2) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,510 | 763,511 | u880221923 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, a, n) for (ll i = a; i < (ll)(n); i++)
#define memi cout << endl
#define kono(n) cout << fixed << setprecision(n)
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define hina cout << ' '
#define in(n) cin >> n
#define in2(n, m) cin >> n >> m
#define in3(n, m, l) cin >> n >> m >> l
#define out(n) cout << n
const ll mei = (ll)1e9 + 7;
int main() {
ll a, b;
a = 0;
in(b);
vector<ll> c(b), d(b);
rep(i, b) {
in(c[i]);
d[i] = c[i];
}
sort(all(c));
rep(i, b) {
if (c[i] != d[i])
;
a++;
}
if (a <= 2)
out("YES");
else
out("NO");
memi;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, a, n) for (ll i = a; i < (ll)(n); i++)
#define memi cout << endl
#define kono(n) cout << fixed << setprecision(n)
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define hina cout << ' '
#define in(n) cin >> n
#define in2(n, m) cin >> n >> m
#define in3(n, m, l) cin >> n >> m >> l
#define out(n) cout << n
const ll mei = (ll)1e9 + 7;
int main() {
ll a, b;
a = 0;
in(b);
vector<ll> c(b), d(b);
rep(i, b) {
in(c[i]);
d[i] = c[i];
}
sort(all(c));
rep(i, b) {
if (c[i] != d[i])
a++;
}
if (a <= 2)
out("YES");
else
out("NO");
memi;
} | [] | 763,515 | 763,516 | u917049698 | cpp |
p02958 | // author:luckYrat(twitter:@luckYrat_)
//#include <bits/stdc++.h>
// def
#include <iostream>
#include <algorithm>
#include <cmath>
#include <iomanip>
// array
#include <climits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define anyfill(n, s) setw(n) << setfill(s)
#define loop(s) for (int i = 0; s > i; i++)
#define rep(i, q) for (int i = 0; (q) > i; i++)
#define repp(i, n, q) for (int i = n; (q) > i; i++)
#define dep(i, q) for (int i = (q); 0 < i; i--)
#define MAX 1000000000
const int mod = 1000000007;
#define EPS (1e-10)
#define pb push_back
#define fir first
#define scn second
#define ednl endl
#define YesNo(a) (a ? "Yes" : "No")
#define YESNO(a) (a ? "YES" : "NO")
#define yesno(a) (a ? "yes" : "no")
P ar4[4] = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}};
P ar8[8] = {{-1, -1}, {-1, 0}, {-1, 1}, {0, -1},
{0, 1}, {1, -1}, {1, 0}, {1, 1}};
/*
確認ポイント
cout << fixed << setprecision(n) << 小数計算//n桁の小数表記になる
vector.unique()は隣接した同じ要素を削除するので先にソートをする
計算量は変わらないが楽できるシリーズ
C++11以降でmin({a,b,c...})で複数個のmic,maxを処理できる
min(max)_element(iter,iter)で一番小さい(大きい)値のポインタが帰ってくる
count(iter,iter,int)でintがiterからiterの間にいくつあったかを取得できる
*/
__attribute__((constructor)) void initial() {
cin.tie(0);
ios::sync_with_stdio(false);
}
int main() {
int n;
cin >> n;
vector<int> A(n);
for (int i = 0; n > i; i++)
cin >> A[i];
for (int i = 0; n > i; i++) {
for (int j = i + 1; n > j; j++) {
swap(A[i], A[j]);
int z = A[0];
bool a = true;
for (int k = 1; n > k; k++) {
if (z > A[k]) {
a = false;
break;
}
z = A[k];
}
if (a) {
cout << "YES" << endl;
return 0;
}
swap(A[i], A[j]);
}
}
cout << "NO" << endl;
}
| // author:luckYrat(twitter:@luckYrat_)
//#include <bits/stdc++.h>
// def
#include <iostream>
#include <algorithm>
#include <cmath>
#include <iomanip>
// array
#include <climits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define anyfill(n, s) setw(n) << setfill(s)
#define loop(s) for (int i = 0; s > i; i++)
#define rep(i, q) for (int i = 0; (q) > i; i++)
#define repp(i, n, q) for (int i = n; (q) > i; i++)
#define dep(i, q) for (int i = (q); 0 < i; i--)
#define MAX 1000000000
const int mod = 1000000007;
#define EPS (1e-10)
#define pb push_back
#define fir first
#define scn second
#define ednl endl
#define YesNo(a) (a ? "Yes" : "No")
#define YESNO(a) (a ? "YES" : "NO")
#define yesno(a) (a ? "yes" : "no")
P ar4[4] = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}};
P ar8[8] = {{-1, -1}, {-1, 0}, {-1, 1}, {0, -1},
{0, 1}, {1, -1}, {1, 0}, {1, 1}};
/*
確認ポイント
cout << fixed << setprecision(n) << 小数計算//n桁の小数表記になる
vector.unique()は隣接した同じ要素を削除するので先にソートをする
計算量は変わらないが楽できるシリーズ
C++11以降でmin({a,b,c...})で複数個のmic,maxを処理できる
min(max)_element(iter,iter)で一番小さい(大きい)値のポインタが帰ってくる
count(iter,iter,int)でintがiterからiterの間にいくつあったかを取得できる
*/
__attribute__((constructor)) void initial() {
cin.tie(0);
ios::sync_with_stdio(false);
}
int main() {
int n;
cin >> n;
vector<int> A(n);
for (int i = 0; n > i; i++)
cin >> A[i];
for (int i = 0; n > i; i++) {
for (int j = i; n > j; j++) {
swap(A[i], A[j]);
int z = A[0];
bool a = true;
for (int k = 1; n > k; k++) {
if (z > A[k]) {
a = false;
break;
}
z = A[k];
}
if (a) {
cout << "YES" << endl;
return 0;
}
swap(A[i], A[j]);
}
}
cout << "NO" << endl;
}
| [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove"
] | 763,519 | 763,520 | u466161487 | cpp |
p02958 | #include <bits/stdc++.h>
//登録しよう！→ https://www.youtube.com/channel/UCRXsI3FL_kvaVL9zoolBfbQ
using namespace std;
using ll = long long;
ll gcd(ll a, ll b) {
return b ? gcd(b, a % b) : a;
} // a,bの最大公約数(gcd)を求める
ll lcm(ll a, ll b) {
return abs(a * b) / gcd(a, b);
} // a,bの最小公倍数(lcm)を求める
vector<ll> enum_div(ll n) {
vector<ll> ret;
for (int i = 1; i * i <= n; i++) {
if (n % i == 0) {
ret.push_back(i);
if (i != 1 && i * i != n)
ret.push_back(n / i);
}
}
ret.push_back(n);
return ret;
}
//↑nの約数を求める
vector<bool> IsPrime;
void sieve(size_t max) {
if (max + 1 > IsPrime.size())
IsPrime.resize(max + 1, true);
IsPrime[0] = false;
IsPrime[1] = false;
for (size_t i = 2; i * i <= max; ++i)
if (IsPrime[i])
for (size_t j = 2; i * j <= max; ++j)
IsPrime[i * j] = false;
}
//↑エラトステネスの篩で素数を求める
#define roundup(divisor, dividend) \
(divisor + (dividend - 1)) / dividend //切り上げ割り算
#define all(x) (x).begin(), (x).end() // xの初めから終わりまでのポインタ
#define size_t ll // size_tは自動でllに変換される
#define pb(x) push_back(x)
#define gre greater // sortを降順にする
#define pri_queue priority_queue //優先度付きキュー
#define syo(x) fixed << setprecision(x) // iostreamで小数をx桁表示
const string YES = "YES";
const string NO = "NO";
void solve(long long N, std::vector<long long> p) {
int a = 0;
for (int i = 0; i < N; i++) {
if (i + 1 == p[i])
a++;
}
cout << (a >= 2 ? YES : NO) << endl;
}
// Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools (tips: You
// use the default template now. You can remove this line by using your custom
// template)
int main() {
long long N;
scanf("%lld", &N);
std::vector<long long> p(N);
for (int i = 0; i < N; i++) {
scanf("%lld", &p[i]);
}
solve(N, std::move(p));
}
| #include <bits/stdc++.h>
//登録しよう！→ https://www.youtube.com/channel/UCRXsI3FL_kvaVL9zoolBfbQ
using namespace std;
using ll = long long;
ll gcd(ll a, ll b) {
return b ? gcd(b, a % b) : a;
} // a,bの最大公約数(gcd)を求める
ll lcm(ll a, ll b) {
return abs(a * b) / gcd(a, b);
} // a,bの最小公倍数(lcm)を求める
vector<ll> enum_div(ll n) {
vector<ll> ret;
for (int i = 1; i * i <= n; i++) {
if (n % i == 0) {
ret.push_back(i);
if (i != 1 && i * i != n)
ret.push_back(n / i);
}
}
ret.push_back(n);
return ret;
}
//↑nの約数を求める
vector<bool> IsPrime;
void sieve(size_t max) {
if (max + 1 > IsPrime.size())
IsPrime.resize(max + 1, true);
IsPrime[0] = false;
IsPrime[1] = false;
for (size_t i = 2; i * i <= max; ++i)
if (IsPrime[i])
for (size_t j = 2; i * j <= max; ++j)
IsPrime[i * j] = false;
}
//↑エラトステネスの篩で素数を求める
#define roundup(divisor, dividend) \
(divisor + (dividend - 1)) / dividend //切り上げ割り算
#define all(x) (x).begin(), (x).end() // xの初めから終わりまでのポインタ
#define size_t ll // size_tは自動でllに変換される
#define pb(x) push_back(x)
#define gre greater // sortを降順にする
#define pri_queue priority_queue //優先度付きキュー
#define syo(x) fixed << setprecision(x) // iostreamで小数をx桁表示
const string YES = "YES";
const string NO = "NO";
void solve(long long N, std::vector<long long> p) {
int a = 0;
for (int i = 0; i < N; i++) {
if (i + 1 != p[i]) {
a++;
}
}
cout << (a <= 2 ? YES : NO) << endl;
}
// Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools (tips: You
// use the default template now. You can remove this line by using your custom
// template)
int main() {
long long N;
scanf("%lld", &N);
std::vector<long long> p(N);
for (int i = 0; i < N; i++) {
scanf("%lld", &p[i]);
}
solve(N, std::move(p));
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"io.output.change"
] | 763,521 | 763,522 | u890807039 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define INF 99999999
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
template <typename T> std::string to_string(const T &n) {
std::ostringstream stm;
stm << n;
return stm.str();
}
int main() {
int N;
cin >> N;
vector<int> p(N);
rep(i, N) cin >> p[i];
int tmp;
rep(i, N) {
rep(j, N) {
tmp = p[i];
p[i] = p[j];
p[j] = tmp;
bool flag = true;
rep(k, N - 1) {
if (p[k] > p[k + 1])
flag = false;
}
if (flag) {
cout << "Yes" << endl;
return 0;
}
p[j] = p[i];
p[i] = tmp;
// rep(l,N) cout << p[l] << " ";
// cout << endl;
}
}
cout << "No" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define INF 99999999
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
template <typename T> std::string to_string(const T &n) {
std::ostringstream stm;
stm << n;
return stm.str();
}
int main() {
int N;
cin >> N;
vector<int> p(N);
rep(i, N) cin >> p[i];
int tmp;
rep(i, N) {
rep(j, N) {
tmp = p[i];
p[i] = p[j];
p[j] = tmp;
bool flag = true;
rep(k, N - 1) {
if (p[k] > p[k + 1])
flag = false;
}
if (flag) {
cout << "YES" << endl;
return 0;
}
p[j] = p[i];
p[i] = tmp;
// rep(l,N) cout << p[l] << " ";
// cout << endl;
}
}
cout << "NO" << endl;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,523 | 763,524 | u730271001 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(c, i, n) for (int i = c; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
const int MOD = 1000000007;
int main() {
int N;
cin >> N;
vector<int> p(N);
int count = 0;
rep(0, i, N) {
cin >> p.at(i);
if (p.at(i) != i + 1) {
count++;
}
}
if (count > 2) {
cout << "No" << endl;
} else {
cout << " Yes" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(c, i, n) for (int i = c; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
const int MOD = 1000000007;
int main() {
int N;
cin >> N;
vector<int> p(N);
int count = 0;
rep(0, i, N) {
cin >> p.at(i);
if (p.at(i) != i + 1) {
count++;
}
}
if (count > 2) {
cout << "NO" << endl;
} else {
cout << " YES" << endl;
}
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,533 | 763,534 | u124659583 | cpp |
p02958 | #include <iomanip>
#include <iostream>
#include <math.h>
#include <string>
using namespace std;
void B_135() {
int N;
cin >> N;
int count = 0;
for (int i = 1; i <= N; ++i) {
int p;
cin >> p;
if (i != p)
++count;
if (count > 2) {
cout << "No" << endl;
return;
}
}
cout << "Yes" << endl;
}
int main() {
// C_131();
// B_139();
// B_138();
// B_137();
// B_136();
B_135();
} | #include <iomanip>
#include <iostream>
#include <math.h>
#include <string>
using namespace std;
void B_135() {
int N;
cin >> N;
int count = 0;
for (int i = 1; i <= N; ++i) {
int p;
cin >> p;
if (i != p)
++count;
if (count > 2) {
cout << "NO" << endl;
return;
}
}
cout << "YES" << endl;
}
int main() {
// C_131();
// B_139();
// B_138();
// B_137();
// B_136();
B_135();
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,535 | 763,536 | u323542775 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vt(N, 0);
int count = 0;
for (int i = 0; i < N; i++) {
cin >> vt[i];
if (vt[i] != (i + 1)) {
count++;
}
}
if (count <= 2) {
cout << "YES" << endl;
} else {
cout << "N0" << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vt(N, 0);
int count = 0;
for (int i = 0; i < N; i++) {
cin >> vt[i];
if (vt[i] != (i + 1)) {
count++;
}
}
if (count <= 2) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
} | [
"literal.string.change",
"io.output.change"
] | 763,537 | 763,538 | u084218424 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vt(N, 0);
int count = 0;
for (int i = 0; i < N; i++) {
cin >> vt[i];
if (vt[i] != i + 1) {
count++;
}
}
if (count <= 2) {
cout << "YES" << endl;
} else {
cout << "N0" << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vt(N, 0);
int count = 0;
for (int i = 0; i < N; i++) {
cin >> vt[i];
if (vt[i] != (i + 1)) {
count++;
}
}
if (count <= 2) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
} | [
"control_flow.branch.if.condition.change",
"literal.string.change",
"io.output.change"
] | 763,539 | 763,538 | u084218424 | cpp |
p02958 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> num;
num.clear();
int p;
for (int i = 1; i <= N; i++) {
cin >> p;
if (p != i) {
num.push_back(i);
}
}
if (2 == num.size() || 0 == num.size()) {
cout << "YES" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> num;
num.clear();
int p;
for (int i = 1; i <= N; i++) {
cin >> p;
if (p != i) {
num.push_back(i);
}
}
if (2 == num.size() || 0 == num.size()) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,549 | 763,550 | u605901675 | cpp |
p02958 | #include <algorithm>
#include <iostream>
#include <string.h>
#include <vector>
using namespace std;
int syc(long i, long Min, long Max) {
if (Min <= i && i <= Max) {
return 1;
} else {
exit(1);
// return 0;
}
}
int shoujun(int a[], int size) {
int i, j;
for (i = 0; i < size - 1; i++) {
for (j = i + 1; j < size; j++) {
if (a[j] < a[i]) {
return 1;
}
}
}
return 0;
}
int main() {
int a;
int b[50];
int i, j, temp, count = 0;
cin >> a;
syc(a, 2, 50);
for (i = 0; i < a; i++) {
cin >> b[i];
}
if (shoujun(b, a) == 0) {
cout << "Yes" << endl;
return 0;
}
for (i = 0; i < a - 1; i++) {
for (j = i + 1; j < a; j++) {
if (b[j] < b[i]) {
temp = b[i];
b[i] = b[j];
b[j] = temp;
if (shoujun(b, a) == 0) {
cout << "YES" << endl;
return 0;
} else {
temp = b[i];
b[i] = b[j];
b[j] = temp;
}
}
}
}
cout << "NO" << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
#include <string.h>
#include <vector>
using namespace std;
int syc(long i, long Min, long Max) {
if (Min <= i && i <= Max) {
return 1;
} else {
exit(1);
// return 0;
}
}
int shoujun(int a[], int size) {
int i, j;
for (i = 0; i < size - 1; i++) {
for (j = i + 1; j < size; j++) {
if (a[j] < a[i]) {
return 1;
}
}
}
return 0;
}
int main() {
int a;
int b[50];
int i, j, temp, count = 0;
cin >> a;
syc(a, 2, 50);
for (i = 0; i < a; i++) {
cin >> b[i];
}
if (shoujun(b, a) == 0) {
cout << "YES" << endl;
return 0;
}
for (i = 0; i < a - 1; i++) {
for (j = i + 1; j < a; j++) {
if (b[j] < b[i]) {
temp = b[i];
b[i] = b[j];
b[j] = temp;
if (shoujun(b, a) == 0) {
cout << "YES" << endl;
return 0;
} else {
temp = b[i];
b[i] = b[j];
b[j] = temp;
}
}
}
}
cout << "NO" << endl;
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,551 | 763,552 | u198469037 | cpp |
p02958 | #include <algorithm>
#include <iostream>
#include <string.h>
#include <vector>
using namespace std;
int syc(long i, long Min, long Max) {
if (Min <= i && i <= Max) {
return 1;
} else {
exit(1);
// return 0;
}
}
int shoujun(int a[], int size) {
int i, j;
for (i = 0; i < size - 1; i++) {
for (j = i + 1; j < size; j++) {
if (a[j] < a[i]) {
return 1;
}
}
}
return 0;
}
int main() {
int a;
int b[50];
int i, j, temp, count = 0;
cin >> a;
syc(a, 2, 50);
for (i = 0; i < a; i++) {
cin >> b[i];
}
if (shoujun(b, a) == 0) {
cout << "Yes" << endl;
return 0;
}
for (i = 0; i < a - 1; i++) {
for (j = i + 1; j < a; j++) {
if (b[j] < b[i]) {
temp = b[i];
b[i] = b[j];
b[j] = temp;
if (shoujun(b, a) == 0) {
cout << "Yes" << endl;
return 0;
} else {
temp = b[i];
b[i] = b[j];
b[j] = temp;
}
}
}
}
cout << "No" << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
#include <string.h>
#include <vector>
using namespace std;
int syc(long i, long Min, long Max) {
if (Min <= i && i <= Max) {
return 1;
} else {
exit(1);
// return 0;
}
}
int shoujun(int a[], int size) {
int i, j;
for (i = 0; i < size - 1; i++) {
for (j = i + 1; j < size; j++) {
if (a[j] < a[i]) {
return 1;
}
}
}
return 0;
}
int main() {
int a;
int b[50];
int i, j, temp, count = 0;
cin >> a;
syc(a, 2, 50);
for (i = 0; i < a; i++) {
cin >> b[i];
}
if (shoujun(b, a) == 0) {
cout << "YES" << endl;
return 0;
}
for (i = 0; i < a - 1; i++) {
for (j = i + 1; j < a; j++) {
if (b[j] < b[i]) {
temp = b[i];
b[i] = b[j];
b[j] = temp;
if (shoujun(b, a) == 0) {
cout << "YES" << endl;
return 0;
} else {
temp = b[i];
b[i] = b[j];
b[j] = temp;
}
}
}
}
cout << "NO" << endl;
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,553 | 763,552 | u198469037 | cpp |
p02958 | #include <iostream>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
int cnt = 0;
for (int i = 1; i <= n; i++) {
int a;
cin >> a;
if (a != i)
cnt++;
}
if (cnt == 0 || cnt == 2)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
int cnt = 0;
for (int i = 1; i <= n; i++) {
int a;
cin >> a;
if (a != i)
cnt++;
}
if (cnt == 0 || cnt == 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,562 | 763,563 | u993074316 | 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);
///入力
bool Ans = false; ///回答の初期値入力"No"の状態
vector<int> q(N);
for (int i = 0; i < N; i++) {
q.at(i) += i + 1;
}
int count = 0; ///相違の数を取得する値
for (int i = 0; i < N; i++) {
if (p.at(i) != q.at(i))
count++;
}
if (count <= 2)
Ans = true;
if (Ans == true)
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);
///入力
bool Ans = false; ///回答の初期値入力"No"の状態
vector<int> q(N);
for (int i = 0; i < N; i++) {
q.at(i) += i + 1;
}
int count = 0; ///相違の数を取得する値
for (int i = 0; i < N; i++) {
if (p.at(i) != q.at(i))
count++;
}
if (count <= 2)
Ans = true;
if (Ans == true)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,564 | 763,565 | u028906014 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, p, x = 0;
cin >> N;
for (int i = 1; i <= N; i++) {
cin >> p;
if (p == i)
x++;
}
if (x < 3)
cout << "YES" << endl;
else
cout << "NO" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, p, x = 0;
cin >> N;
for (int i = 1; i <= N; i++) {
cin >> p;
if (p != i)
x++;
}
if (x < 3)
cout << "YES" << endl;
else
cout << "NO" << endl;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 763,568 | 763,569 | u820224016 | 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;
int main() {
int n, sum;
scanf("%d", &n);
vector<int> p(n), q(n);
rep(i, n) scanf("%d", &p[i]);
q = p;
sort(all(q));
rep(i, n) if (p[i] != q[i]) sum++;
sum == 2 || sum == 0 ? printf("%s", "YES") : printf("%s", "NO");
} | #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;
int main() {
int n, sum = 0;
scanf("%d", &n);
vector<int> p(n), q(n);
rep(i, n) scanf("%d", &p[i]);
q = p;
sort(all(q));
rep(i, n) if (p[i] != q[i]) sum++;
sum == 2 || sum == 0 ? printf("%s", "YES") : printf("%s", "NO");
} | [
"variable_declaration.value.change"
] | 763,570 | 763,571 | u018372223 | cpp |
p02958 | #include "bits/stdc++.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<P, ll> Pll;
typedef pair<P, P> PP;
#define rep(i, a, n) for (ll i = a; i < n; i++)
#define repr(i, a, n) for (ll i = n - 1; i >= a; i--)
#define LINF (ll)1e17
#define INF (int)1e9
#define MOD (ll)1e9 + 7
#define sMOD 1e5
#define fs first
#define sc second
ll gcd(ll a, ll b) {
if (!b)
return a;
return gcd(b, a % b);
}
bool check(ll n) {
rep(i, 1, sqrt(n) + 1) {
if (pow(i, 2) == n)
return true;
}
return false;
}
signed main() {
ll n, cnt = 0;
cin >> n;
ll p[n] = {};
rep(i, 0, n) {
cin >> p[i];
if (p[i] != n - i)
cnt++;
}
if (cnt == 2 || cnt == 0)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
} | #include "bits/stdc++.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<P, ll> Pll;
typedef pair<P, P> PP;
#define rep(i, a, n) for (ll i = a; i < n; i++)
#define repr(i, a, n) for (ll i = n - 1; i >= a; i--)
#define LINF (ll)1e17
#define INF (int)1e9
#define MOD (ll)1e9 + 7
#define sMOD 1e5
#define fs first
#define sc second
ll gcd(ll a, ll b) {
if (!b)
return a;
return gcd(b, a % b);
}
bool check(ll n) {
rep(i, 1, sqrt(n) + 1) {
if (pow(i, 2) == n)
return true;
}
return false;
}
signed main() {
ll n, cnt = 0;
cin >> n;
ll p[n] = {};
rep(i, 0, n) {
cin >> p[i];
if (p[i] != i + 1)
cnt++;
}
if (cnt == 2 || cnt == 0)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
} | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 763,575 | 763,576 | u129134470 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
vector<int> A(a);
for (int i = 0; i < a; i++) {
cin >> A.at(i);
if (A.at(i) = i + 1)
A.at(i) = 0;
else
A.at(i) = 1;
}
int count = 0;
for (int i = 0; i < a; i++)
count += A.at(i);
if (count == 0 || count == 2)
cout << "YES" << endl;
else {
cout << "NO" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
cin >> a;
vector<int> A(a);
for (int i = 0; i < a; i++) {
cin >> A.at(i);
if (A.at(i) == i + 1)
A.at(i) = 0;
else
A.at(i) = 1;
}
int count = 0;
for (int i = 0; i < a; i++)
count += A.at(i);
if (count == 0 || count == 2)
cout << "YES" << endl;
else {
cout << "NO" << endl;
}
}
| [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 763,587 | 763,588 | u613960672 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int cnt = 0;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; i++) {
cin >> p.at(i);
}
for (int i = 0; i < n; i++) {
if (p.at(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;
int cnt = 0;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; i++) {
cin >> p.at(i);
}
for (int i = 0; i < n; i++) {
if (p.at(i) != i + 1)
cnt++;
}
if (cnt == 0 || cnt == 2) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,591 | 763,592 | u503841284 | cpp |
p02958 | // 解けてない
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> p(N);
vector<int> sortP(N);
for (int i = 0; i < N; i++) {
cin >> p.at(i);
}
sortP = p;
sort(sortP.begin(), sortP.end());
int invalidCount = 0;
for (int i = 0; i < N; i++) {
if (p.at(i) != sortP.at(i))
invalidCount++;
}
cout << (invalidCount > 2 ? "No" : "Yes") << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> p(N);
vector<int> sortP(N);
for (int i = 0; i < N; i++) {
cin >> p.at(i);
}
sortP = p;
sort(sortP.begin(), sortP.end());
int invalidCount = 0;
for (int i = 0; i < N; i++) {
if (p.at(i) != sortP.at(i))
invalidCount++;
}
cout << (invalidCount > 2 ? "NO" : "YES") << endl;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,593 | 763,594 | u455876837 | cpp |
p02958 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
cin.tie(0);
int n, c = 0;
cin >> n;
vector<int> a(n), b(n);
rep(i, n) {
cin >> a[i];
b[i] = a[i];
}
sort(b.begin(), b.end());
rep(i, n) {
if (a[i] != b[i])
c++;
}
if (c <= 2) {
cout << "Yes" << endl;
return 0;
} else {
cout << "No" << endl;
}
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
cin.tie(0);
int n, c = 0;
cin >> n;
vector<int> a(n), b(n);
rep(i, n) {
cin >> a[i];
b[i] = a[i];
}
sort(b.begin(), b.end());
rep(i, n) {
if (a[i] != b[i])
c++;
}
if (c <= 2) {
cout << "YES" << endl;
return 0;
} else {
cout << "NO" << endl;
}
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,597 | 763,598 | u388372553 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N = 110;
int n, a[N];
bool check() {
bool flag = true;
for (int i = 0; i < n - 1; i++)
if (a[i] > a[i + 1])
return false;
return true;
}
int main() {
int cnt = 0;
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
if (check()) {
puts("Yes");
return 0;
}
for (int i = 0; i < n; i++)
for (int j = 0; j < i; j++) {
swap(a[i], a[j]);
if (check()) {
puts("Yes");
return 0;
}
swap(a[i], a[j]);
}
puts("No");
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N = 110;
int n, a[N];
bool check() {
bool flag = true;
for (int i = 0; i < n - 1; i++)
if (a[i] > a[i + 1])
return false;
return true;
}
int main() {
int cnt = 0;
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
if (check()) {
puts("YES");
return 0;
}
for (int i = 0; i < n; i++)
for (int j = 0; j < i; j++) {
swap(a[i], a[j]);
if (check()) {
puts("YES");
return 0;
}
swap(a[i], a[j]);
}
puts("NO");
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 763,603 | 763,604 | u866538547 | cpp |
p02958 | #include <bits/stdc++.h>
#define ford(i, a, b) for (int i = (a); i >= b; i--)
#define rep(i, a, b) for (int i = (a); (i) < (b); (i)++)
#define ll long long
using namespace std;
int a[55];
int main() {
int n, ans = 0;
cin >> n;
rep(i, 0, n) cin >> a[i];
rep(i, 0, n) if (a[i] != i) ans++;
if (ans == 2 || ans == 0)
cout << "YES";
else
cout << "NO";
return 0;
}
| #include <bits/stdc++.h>
#define ford(i, a, b) for (int i = (a); i >= b; i--)
#define rep(i, a, b) for (int i = (a); (i) <= (b); (i)++)
#define ll long long
using namespace std;
int a[55];
int main() {
int n, ans = 0;
cin >> n;
rep(i, 1, n) cin >> a[i];
rep(i, 1, n) if (a[i] != i) ans++;
if (ans == 2 || ans == 0)
cout << "YES";
else
cout << "NO";
return 0;
}
| [
"expression.operator.compare.change",
"preprocessor.define.value.change",
"literal.number.change",
"call.arguments.change"
] | 763,616 | 763,617 | u796123030 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n, m;
cin >> n;
ll c = 0;
for (int i = 1; i <= n; i++) {
cin >> m;
if (m != i) {
c++;
}
}
if (c == 2 || c == 0) {
cout << "YES" << endl;
} else {
cout << "No" << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n, m;
cin >> n;
ll c = 0;
for (int i = 1; i <= n; i++) {
cin >> m;
if (m != i) {
c++;
}
}
if (c == 2 || c == 0) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,618 | 763,619 | u178957871 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n, m;
cin >> n;
ll c = 0;
for (int i = 1; i <= n; i++) {
cin >> m;
if (m == i) {
} else {
c++;
}
}
if (c == 2 || c == 0) {
cout << "YES" << endl;
} else {
cout << "No" << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n, m;
cin >> n;
ll c = 0;
for (int i = 1; i <= n; i++) {
cin >> m;
if (m != i) {
c++;
}
}
if (c == 2 || c == 0) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,620 | 763,619 | u178957871 | 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> C(N);
int count;
for (int i = 0; i < N; i++) {
if (P.at(0) != 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;
cin >> N;
vector<int> P(N);
for (int i = 0; i < N; i++) {
cin >> P.at(i);
}
vector<int> C(N);
int count = 0;
for (int i = 0; i < N; i++) {
if (P.at(i) != i + 1) {
count++;
}
}
if (count == 2 || count == 0) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
}
| [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 763,630 | 763,631 | u428948252 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.