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 < (int)(n); i++)
int main() {
int n;
int p;
int count = 0;
cin >> n;
rep(i, n) {
cin >> p;
if (p - (i + 1) != 0)
count++;
}
if (count == 2 || count == 0)
cout << "Yes";
else
cout << "No";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n;
int p;
int count = 0;
cin >> n;
rep(i, n) {
cin >> p;
if (p - (i + 1) != 0)
count++;
}
if (count == 2 || count == 0)
cout << "YES";
else
cout << "NO";
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,634 | 763,635 | u001327021 | cpp |
p02958 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
auto s = v;
sort(v.begin(), v.end());
int count = 0;
for (int i = 0; i < n; i++) {
if (v[i] != s[i])
count++;
}
if (count == 2 || count == 0) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
}
| #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
auto s = v;
sort(v.begin(), v.end());
int count = 0;
for (int i = 0; i < n; i++) {
if (v[i] != s[i])
count++;
}
if (count == 2 || count == 0) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,640 | 763,641 | u411418267 | cpp |
p02958 | #include <bits/stdc++.h>
#include <iostream>
#include <math.h>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
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" << endl;
else
cout << "No" << endl;
return 0;
} | #include <bits/stdc++.h>
#include <iostream>
#include <math.h>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
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" << endl;
else
cout << "NO" << endl;
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,642 | 763,643 | u448922807 | cpp |
p02958 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define mod 1000000007
#define ten5 100005
#define ten52 200005
#define ten6 1000005
#define PI 3.1415926
typedef long long int ll;
// ll chk[55];
ll num[55];
// ll num2[55];
// ll num[ten5];
// ll num2[ten5];
// char cmap[10][10];
// priority_queue<long long int> pq; //big at front
// stack<int> stk;
// vector<pair<ll,ll>> vint;
// vector<ll> vtime;
// deque<ll> deq[55];
// list<int> li;
// set<int> sint;
// set<ll> sll;
// map<ll,ll> mp;
int main() {
// double ans=0.0,half;
// float f,g,h;
long long int sum, sum2, n1, n2, n3;
long long int m, n, o, i, j, k = 1;
long long int a, a1, a2, a3, a4, a5, a6;
sum = sum2 = n1 = n2 = n3 = 0;
a = a1 = a2 = a3 = a4 = a5 = a6 = 0;
// string s,s1;
// char now,pre,c;
cin >> n;
for (i = 1; i <= n; i++) {
cin >> a;
if (a != i)
sum++;
if (sum > 2) {
cout << "No";
return 0;
}
}
cout << "Yes";
return 0;
}
| #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define mod 1000000007
#define ten5 100005
#define ten52 200005
#define ten6 1000005
#define PI 3.1415926
typedef long long int ll;
// ll chk[55];
ll num[55];
// ll num2[55];
// ll num[ten5];
// ll num2[ten5];
// char cmap[10][10];
// priority_queue<long long int> pq; //big at front
// stack<int> stk;
// vector<pair<ll,ll>> vint;
// vector<ll> vtime;
// deque<ll> deq[55];
// list<int> li;
// set<int> sint;
// set<ll> sll;
// map<ll,ll> mp;
int main() {
// double ans=0.0,half;
// float f,g,h;
long long int sum, sum2, n1, n2, n3;
long long int m, n, o, i, j, k = 1;
long long int a, a1, a2, a3, a4, a5, a6;
sum = sum2 = n1 = n2 = n3 = 0;
a = a1 = a2 = a3 = a4 = a5 = a6 = 0;
// string s,s1;
// char now,pre,c;
cin >> n;
for (i = 1; i <= n; i++) {
cin >> a;
if (a != i)
sum++;
if (sum > 2) {
cout << "NO";
return 0;
}
}
cout << "YES";
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,647 | 763,648 | u763410402 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> p(n);
vector<int> p_org(n);
for (int i = 0; i < n; i++) {
cin >> p[i];
p_org[i] = p[i];
}
sort(p.begin(), p.end());
int cnt = 0;
for (int i = 0; i < n; i++) {
// cout << p[i] << endl;
if (p[i] != p_org[i]) {
cnt++;
}
}
if (cnt / 2 >= 2) {
cout << "NO" << endl;
} else {
cout << "YES" << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> p(n);
vector<int> p_org(n);
for (int i = 0; i < n; i++) {
cin >> p[i];
p_org[i] = p[i];
}
sort(p.begin(), p.end());
int cnt = 0;
for (int i = 0; i < n; i++) {
// cout << p[i] << endl;
if (p[i] != p_org[i]) {
cnt++;
}
}
if (cnt >= 3) {
cout << "NO" << endl;
} else {
cout << "YES" << endl;
}
return 0;
}
| [
"expression.operation.binary.remove",
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 763,661 | 763,662 | u596311864 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int tmp = 0;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
if (a == i + 1) {
tmp++;
}
}
if (tmp > 2) {
cout << "NO" << endl;
} else {
cout << "YES" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int tmp = 0;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
if (a != i + 1) {
tmp++;
}
}
if (tmp > 2) {
cout << "NO" << endl;
} else {
cout << "YES" << endl;
}
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 763,666 | 763,667 | u785492958 | cpp |
p02958 | #include <iostream>
using namespace std;
int main() {
int N;
int wrong = 0;
for (int i = 1; i <= N; i++) {
int p;
cin >> p;
if (i != p)
wrong++;
}
if (wrong <= 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int wrong = 0;
for (int i = 1; i <= N; i++) {
int p;
cin >> p;
if (i != p)
wrong++;
}
if (wrong <= 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
} | [] | 763,670 | 763,671 | u016119075 | cpp |
p02958 | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define RFOR(i, a, b) for (int i = (a); i >= (b); i--)
#define LFOR(i, a, b) for (long long int i = (a); i <= (b); i++)
#define LRFOR(i, a, b) for (long long int i = (a); i >= (b); i--)
#define MOD 1000000007
#define INF 1000000000 // 2000000000
#define LINF 1000000000000000000 // 9000000000000000000
#define DINF 1000000000000000.0
#define PI 3.14159265358979
//.size()はunsigned int 0-1をするとオーバーフローする
using namespace std;
typedef long long int ll;
typedef pair<long long int, long long int> P;
int dy[5] = {-1, 0, 1, 0, 0};
int dx[5] = {0, -1, 0, 1, 0};
int main(void) {
int n;
int count = 0;
cin >> n;
vector<int> p(n + 1);
FOR(i, 1, n) {
cin >> p[i];
if (p[i] != i) {
count++;
}
}
if (count == 2) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
}
| #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define RFOR(i, a, b) for (int i = (a); i >= (b); i--)
#define LFOR(i, a, b) for (long long int i = (a); i <= (b); i++)
#define LRFOR(i, a, b) for (long long int i = (a); i >= (b); i--)
#define MOD 1000000007
#define INF 1000000000 // 2000000000
#define LINF 1000000000000000000 // 9000000000000000000
#define DINF 1000000000000000.0
#define PI 3.14159265358979
//.size()はunsigned int 0-1をするとオーバーフローする
using namespace std;
typedef long long int ll;
typedef pair<long long int, long long int> P;
int dy[5] = {-1, 0, 1, 0, 0};
int dx[5] = {0, -1, 0, 1, 0};
int main(void) {
int n;
int count = 0;
cin >> n;
vector<int> p(n + 1);
FOR(i, 1, n) {
cin >> p[i];
if (p[i] != i) {
count++;
}
}
if (count == 2 || count == 0) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
}
| [
"control_flow.branch.if.condition.change"
] | 763,675 | 763,676 | u057611820 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int D = 0;
cin >> N;
vector<int> p(N);
for (int i = 0; i < N; i++) {
cin >> p.at(i);
if (p.at(i) == i + 1) {
} else {
D += 1;
}
}
// cout << D;
if (D <= 2) {
cout << "YES";
} else {
cout << "No";
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int D = 0;
cin >> N;
vector<int> p(N);
for (int i = 0; i < N; i++) {
cin >> p.at(i);
if (p.at(i) == i + 1) {
} else {
D += 1;
}
}
// cout << D;
if (D <= 2) {
cout << "YES";
} else {
cout << "NO";
}
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,677 | 763,678 | u767481489 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N;
cin >> N;
int p[N], tmp = 0;
for (int i = 0; i < N; i++) {
cin >> p[i];
}
for (int i = 0; i < N; i++) {
if (p[i] != i + 1) {
tmp++;
}
}
if (tmp == 0 || tmp == 2) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N;
cin >> N;
int p[N], tmp = 0;
for (int i = 0; i < N; i++) {
cin >> p[i];
}
for (int i = 0; i < N; i++) {
if (p[i] != i + 1) {
tmp++;
}
}
if (tmp == 0 || tmp == 2) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,684 | 763,685 | u459930111 | 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);
}
string S = "Yes";
bool judge = true;
for (int i = 0; i < N; i++) {
if (p.at(i) != i + 1) {
if (judge == true) {
judge = false;
for (int j = 0; j < N; j++) {
if (p.at(j) == i + 1) {
swap(p.at(i), p.at(j));
}
}
} else {
S = "No";
break;
}
}
}
cout << S << 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);
}
string S = "YES";
bool judge = true;
for (int i = 0; i < N; i++) {
if (p.at(i) != i + 1) {
if (judge == true) {
judge = false;
for (int j = 0; j < N; j++) {
if (p.at(j) == i + 1) {
swap(p.at(i), p.at(j));
}
}
} else {
S = "NO";
break;
}
}
}
cout << S << endl;
} | [
"literal.string.change",
"literal.string.case.change",
"variable_declaration.value.change",
"assignment.value.change"
] | 763,703 | 763,704 | u160347785 | cpp |
p02958 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int size, number, num_swap = 0, count = 0;
cin >> size;
for (int i = 1; i <= size; i++) {
cin >> number;
if (number != i)
count++;
}
if (count <= 2)
cout << "Yes" << endl;
cout << "NO" << endl;
} | #include <iostream>
#include <vector>
using namespace std;
int main() {
int size, number, num_swap = 0, count = 0;
cin >> size;
for (int i = 1; i <= size; i++) {
cin >> number;
if (number != i)
count++;
}
if (count <= 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 763,712 | 763,713 | u123055429 | cpp |
p02958 | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <set>
#include <stdlib.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
// cout << << endl;
typedef long long int ll;
typedef long double ld;
const ll INF = 1LL << 60;
#define MOD 1000000007
#define MAX_V 100010
#define MAX_N 100010
bool pairCompare(const pair<double, ll> &firstElof,
const pair<double, ll> &secondElof) {
return firstElof.second < secondElof.second;
}
ll gcd(ll a, ll b) {
if (a % b == 0)
return (b);
else
return (gcd(b, a % b));
}
ll junnretu(ll n) {
ll ans = 1;
for (ll i = 1; i <= n; i++) {
ans *= i;
}
return ans;
}
int main() {
ll n, c = 0;
cin >> n;
ll x[n], y[n];
for (ll i = 0; i < n; i++) {
cin >> x[i];
y[i] = x[i];
}
sort(x, x + n);
for (ll i = 0; i < n; i++) {
if (x[i] != y[i])
c++;
}
if (c == 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
}
| #include <algorithm>
#include <bitset>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <set>
#include <stdlib.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
// cout << << endl;
typedef long long int ll;
typedef long double ld;
const ll INF = 1LL << 60;
#define MOD 1000000007
#define MAX_V 100010
#define MAX_N 100010
bool pairCompare(const pair<double, ll> &firstElof,
const pair<double, ll> &secondElof) {
return firstElof.second < secondElof.second;
}
ll gcd(ll a, ll b) {
if (a % b == 0)
return (b);
else
return (gcd(b, a % b));
}
ll junnretu(ll n) {
ll ans = 1;
for (ll i = 1; i <= n; i++) {
ans *= i;
}
return ans;
}
int main() {
ll n, c = 0;
cin >> n;
ll x[n], y[n];
for (ll i = 0; i < n; i++) {
cin >> x[i];
y[i] = x[i];
}
sort(x, x + n);
for (ll i = 0; i < n; i++) {
if (x[i] != y[i])
c++;
}
if (c == 2 || c == 0)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
}
| [
"control_flow.branch.if.condition.change"
] | 763,715 | 763,716 | u273928723 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define be begin
#define en end
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define ALL(a) (a).be(), (a).en()
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++) // repeat n times
#define REP2(i, s, n) for (int(i) = (s); (i) < (n); (i)++) // repeat from s to n
#define REPD(i, n) for (int(i) = (n); (i) >= 0; (i)--) // repeat from n to 0
#define REPD2(i, s, e) \
for (int(i) = (s); (i) >= (e); (i)--) // repeat from s to e
#define RANGE(i, v) for (auto &(i) : v) // repeat range
#define ASIZE(a) (sizeof(a) / sizeof(a[0])) // array size
using LL = long long;
template <typename T> using V = vector<T>;
using Vi = V<int>;
using Vll = V<LL>;
using Vs = V<string>;
int main() {
int n;
cin >> n;
Vi p(n);
REP(i, n) cin >> p[i];
Vi q = p;
sort(ALL(q));
int cnt = 0;
REP(i, n) {
if (p[i] != q[i])
cnt++;
}
if (cnt > 2) {
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define be begin
#define en end
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define ALL(a) (a).be(), (a).en()
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++) // repeat n times
#define REP2(i, s, n) for (int(i) = (s); (i) < (n); (i)++) // repeat from s to n
#define REPD(i, n) for (int(i) = (n); (i) >= 0; (i)--) // repeat from n to 0
#define REPD2(i, s, e) \
for (int(i) = (s); (i) >= (e); (i)--) // repeat from s to e
#define RANGE(i, v) for (auto &(i) : v) // repeat range
#define ASIZE(a) (sizeof(a) / sizeof(a[0])) // array size
using LL = long long;
template <typename T> using V = vector<T>;
using Vi = V<int>;
using Vll = V<LL>;
using Vs = V<string>;
int main() {
int n;
cin >> n;
Vi p(n);
REP(i, n) cin >> p[i];
Vi q = p;
sort(ALL(q));
int cnt = 0;
REP(i, n) {
if (p[i] != q[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,719 | 763,720 | u129220625 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
long k;
cin >> k;
int cnt = 0;
for (int i = 0; i < k; i++) {
int x;
cin >> x;
if (x != (i + 1)) {
cnt++;
}
}
if (cnt > 2) {
cout << "No";
} else if (cnt <= 2) {
cout << "Yes";
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long k;
cin >> k;
int cnt = 0;
for (int i = 0; i < k; i++) {
int x;
cin >> x;
if (x != (i + 1)) {
cnt++;
}
}
if (cnt > 2) {
cout << "NO";
} else if (cnt <= 2) {
cout << "YES";
}
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,725 | 763,726 | u815587547 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, cnt = 0;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; i++) {
cin >> p.at(i);
if (i != p.at(i) - 1)
cnt++;
}
if (cnt == 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, cnt = 0;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; i++) {
cin >> p.at(i);
if (i != p.at(i) - 1)
cnt++;
}
if (cnt == 0 || cnt == 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
} | [
"control_flow.branch.if.condition.change"
] | 763,734 | 763,735 | u113298224 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, p, f = 0;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> p;
if (p != i)
f++;
}
if (f > 2)
cout << "No";
else
cout << "Yes";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, p, f = 0;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> p;
if (p != i)
f++;
}
if (f > 2)
cout << "NO";
else
cout << "YES";
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,740 | 763,741 | u983711104 | cpp |
p02958 | #include "bits/stdc++.h"
using namespace std;
int main() {
int n;
cin >> n;
int cnt = 0;
for (int i = 0; i < n; i++) {
int p_in;
cin >> p_in;
if (p_in != i + 1) {
cnt++;
}
}
string ans = "Yes";
if (cnt > 2) {
ans = "No";
}
cout << ans << endl;
}
| #include "bits/stdc++.h"
using namespace std;
int main() {
int n;
cin >> n;
int cnt = 0;
for (int i = 0; i < n; i++) {
int p_in;
cin >> p_in;
if (p_in != i + 1) {
cnt++;
}
}
string ans = "YES";
if (cnt > 2) {
ans = "NO";
}
cout << ans << endl;
}
| [
"literal.string.change",
"literal.string.case.change",
"variable_declaration.value.change",
"assignment.value.change"
] | 763,742 | 763,743 | u418785081 | cpp |
p02958 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> p(n);
rep(i, n) cin >> p[i];
int c = 0;
rep(i, n) if (p[i] != i + 1) c++;
if (c == 0 || c == 2)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> p(n);
rep(i, n) cin >> p[i];
int c = 0;
rep(i, n) if (p[i] != i + 1) c++;
if (c == 0 || c == 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,746 | 763,747 | u115838990 | cpp |
p02958 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> p(n);
rep(i, n) cin >> p[i];
int c = 0;
rep(i, n) if (p[i] != i) c++;
if (c == 0 || c == 2)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> p(n);
rep(i, n) cin >> p[i];
int c = 0;
rep(i, n) if (p[i] != i + 1) c++;
if (c == 0 || c == 2)
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,748 | 763,747 | u115838990 | cpp |
p02958 | #include <algorithm> //辞書順はnext_permutation
#include <cmath>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stdio.h>
#include <string.h>
#include <string>
#include <time.h>
#include <utility> //swap(数値交換)
#include <vector>
#define rt "\n"
#define rep(i, n) for (int i = 0; i < n; i++)
#define rop(i, n) for (int i = 1; i <= n; i++)
#define drep(i, n) for (int i = n - 1; 0 <= i; i--)
#define yes(ans) \
if (ans) \
cout << "yes" << rt; \
else \
cout << "no" << rt;
#define Yes(ans) \
if (ans) \
cout << "Yes" << rt; \
else \
cout << "No" << rt;
#define YES(ans) \
if (ans) \
cout << "YES" << rt; \
else \
cout << "NO" << rt;
#define sort(s) sort(s.begin(), s.end())
#define reve(s) reverse(s.begin(), s.end())
#define asas int ans = 0
#define cncn int cnt = 0
#define please return
#define AC 0
using namespace std;
typedef vector<int> vint;
typedef vector<string> vstr;
typedef vector<char> vcha;
typedef long long int llint;
typedef pair<int, int> pint;
typedef pair<llint, llint> pllint;
typedef vector<llint> vllint;
typedef vector<pint> vpint;
typedef vector<pair<llint, llint>> vpllint;
typedef vector<vector<int>> vvint;
typedef vector<vector<llint>> vvllint;
typedef vector<vector<pint>> vvpint;
typedef vector<bool> vbool;
//最大公約数（GCD）を求めるよ
//最小公倍数（LCM）は＜＜ （A＋B）÷ GCD ＞＞で求まるよ
long long GCD(long long a, long long b) {
if (b == 0)
return a;
else
return GCD(b, a % b);
}
int main(void) {
int n;
cin >> n;
vint p(n);
rep(i, n) cin >> p[i];
asas;
rep(i, n) {
if (i + 1 != p[i])
ans++;
}
YES(ans == 2);
please AC;
}
// abc : 141 , aoj : ITP1_6_D
// sort, abs, swap, reverse, max, min
//__gcd, sbstring, erase, push_back,stoll、stoi | #include <algorithm> //辞書順はnext_permutation
#include <cmath>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stdio.h>
#include <string.h>
#include <string>
#include <time.h>
#include <utility> //swap(数値交換)
#include <vector>
#define rt "\n"
#define rep(i, n) for (int i = 0; i < n; i++)
#define rop(i, n) for (int i = 1; i <= n; i++)
#define drep(i, n) for (int i = n - 1; 0 <= i; i--)
#define yes(ans) \
if (ans) \
cout << "yes" << rt; \
else \
cout << "no" << rt;
#define Yes(ans) \
if (ans) \
cout << "Yes" << rt; \
else \
cout << "No" << rt;
#define YES(ans) \
if (ans) \
cout << "YES" << rt; \
else \
cout << "NO" << rt;
#define sort(s) sort(s.begin(), s.end())
#define reve(s) reverse(s.begin(), s.end())
#define asas int ans = 0
#define cncn int cnt = 0
#define please return
#define AC 0
using namespace std;
typedef vector<int> vint;
typedef vector<string> vstr;
typedef vector<char> vcha;
typedef long long int llint;
typedef pair<int, int> pint;
typedef pair<llint, llint> pllint;
typedef vector<llint> vllint;
typedef vector<pint> vpint;
typedef vector<pair<llint, llint>> vpllint;
typedef vector<vector<int>> vvint;
typedef vector<vector<llint>> vvllint;
typedef vector<vector<pint>> vvpint;
typedef vector<bool> vbool;
//最大公約数（GCD）を求めるよ
//最小公倍数（LCM）は＜＜ （A＋B）÷ GCD ＞＞で求まるよ
long long GCD(long long a, long long b) {
if (b == 0)
return a;
else
return GCD(b, a % b);
}
int main(void) {
int n;
cin >> n;
vint p(n);
rep(i, n) cin >> p[i];
asas;
rep(i, n) {
if (i + 1 != p[i])
ans++;
}
YES(ans == 2 || ans == 0);
please AC;
}
// abc : 141 , aoj : ITP1_6_D
// sort, abs, swap, reverse, max, min
//__gcd, sbstring, erase, push_back,stoll、stoi | [
"expression.operation.binary.add"
] | 763,751 | 763,752 | u742306624 | cpp |
p02958 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <stdio.h>
#include <string>
#include <utility> //swapでaとbの値を入れ替える
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define ll long long
#define sort(s) sort(s.begin(), s.end())
#define r(s) reverse(s.begin(), s.end())
using namespace std;
int main() {
int a;
int ans = 0;
cin >> a;
vector<int> s(a);
rep(i, a) cin >> s[i];
rep(i, a) {
if (s[i] + 1 != s[i + 1])
ans++;
}
if (ans == 0 || ans == 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <stdio.h>
#include <string>
#include <utility> //swapでaとbの値を入れ替える
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define ll long long
#define sort(s) sort(s.begin(), s.end())
#define r(s) reverse(s.begin(), s.end())
using namespace std;
int main() {
int a;
int ans = 0;
cin >> a;
vector<int> s(a);
rep(i, a) cin >> s[i];
rep(i, a) {
if (i + 1 != s[i])
ans++;
}
if (ans == 0 || ans == 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
} | [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 763,753 | 763,754 | u407213771 | cpp |
p02958 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> ps(N + 1, 0);
for (int i = 1; i <= N; ++i) {
cin >> ps[i];
}
int dc = 0;
for (int i = 1; i <= N; ++i) {
if (i != ps[i]) {
dc++;
}
}
if (dc <= 2) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> ps(N + 1, 0);
for (int i = 1; i <= N; ++i) {
cin >> ps[i];
}
int dc = 0;
for (int i = 1; i <= N; ++i) {
if (i != ps[i]) {
dc++;
}
}
if (dc <= 2) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,757 | 763,758 | u231541008 | 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.at(i);
}
for (int i = 0; i < n; i++) {
if (p.at(i) != i + 1) {
count++;
}
}
if (count == 0 || count == 2) {
cout << "Yes";
} else {
cout << "No";
}
cout << 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.at(i);
}
for (int i = 0; i < n; i++) {
if (p.at(i) != i + 1) {
count++;
}
}
if (count == 0 || count == 2) {
cout << "YES";
} else {
cout << "NO";
}
cout << endl;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,767 | 763,768 | u569361260 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); ++i)
typedef long long ll;
typedef pair<int, int> P;
const ll INF = 1ll << 60;
ll MOD = 998244353;
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 == 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); ++i)
typedef long long ll;
typedef pair<int, int> P;
const ll INF = 1ll << 60;
ll MOD = 998244353;
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 == 2 || cnt == 0)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 763,769 | 763,770 | u833549197 | cpp |
p02958 | #include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> p(n);
rep(i, n) cin >> p[i];
int dif = 0;
rep(i, n) if (p[i] != i + 1)++ dif;
if (dif <= 2)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
| #include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> p(n);
rep(i, n) cin >> p[i];
int dif = 0;
rep(i, n) if (p[i] != i + 1)++ dif;
if (dif <= 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,786 | 763,787 | u984643753 | cpp |
p02958 | #include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> p(n);
rep(i, n) cin >> p[i];
int dif = 0;
rep(i, n) {
if (p[i] != i + 1)
++dif;
}
if (dif <= 2)
cout << "Yes" << endl;
else {
cout << "No" << endl;
}
return 0;
}
| #include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> p(n);
rep(i, n) cin >> p[i];
int dif = 0;
rep(i, n) if (p[i] != i + 1)++ dif;
if (dif <= 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,788 | 763,787 | u984643753 | cpp |
p02958 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int p[51];
int j[51];
for (int i = 0; i < n; i++) {
cin >> p[i];
j[i] = p[i];
}
sort(p, p + n);
int counter = 0;
for (int i = 0; i < n; i++) {
if (p[i] != j[i]) {
counter++;
}
}
if (counter <= 2) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int p[51];
int j[51];
for (int i = 0; i < n; i++) {
cin >> p[i];
j[i] = p[i];
}
sort(p, p + n);
int counter = 0;
for (int i = 0; i < n; i++) {
if (p[i] != j[i]) {
counter++;
}
}
if (counter <= 2) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,795 | 763,796 | u043125923 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int count = 0;
for (int i = 1; i <= N; i++) {
int p;
cin >> p;
if (p != i) {
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;
for (int i = 1; i <= N; i++) {
int p;
cin >> p;
if (p != i) {
count++;
}
}
if (count <= 2) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,797 | 763,798 | u046482892 | 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);
}
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;
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.at(i);
}
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;
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,799 | 763,800 | u868205915 | cpp |
p02958 | #include <iostream>
#include <string.h>
using namespace std;
int main(void) {
int n;
cin >> n;
int p[n];
int count = 0;
for (int i = 0; i < n; i++) {
cin >> p[i];
if (p[i] != i)
count++;
}
if (count == 0 || count == 2) {
cout << "YES\n";
} else {
cout << "NO\n";
}
} | #include <iostream>
#include <string.h>
using namespace std;
int main(void) {
int n;
cin >> n;
int p[n];
int count = 0;
for (int i = 0; i < n; i++) {
cin >> p[i];
if (p[i] != i + 1)
count++;
}
if (count == 0 || count == 2) {
cout << "YES\n";
} else {
cout << "NO\n";
}
} | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 763,809 | 763,810 | u500544894 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, count;
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)
count++;
}
if (count <= 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, count;
cin >> N;
count = 0;
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)
count++;
}
if (count <= 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
} | [
"assignment.add"
] | 763,815 | 763,816 | u079022693 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const long long INF = 1LL << 60;
typedef pair<ll, ll> pairs;
vector<pairs> p;
bool pairCompare(const pair<double, ll> &firstElof,
const pair<double, ll> &secondElof) {
return firstElof.first < secondElof.first;
}
#define MAX_N 1000100
bool x[MAX_N];
ll num[MAX_N];
ll fibl[MAX_N] = {0};
ll fib(ll a) {
if (fibl[a] != 0)
return fibl[a];
if (a == 0) {
return 0;
} else if (a == 1) {
return 1;
}
return fibl[a] = fib(a - 1) + fib(a - 2);
}
ll eratosthenes(ll n) {
int p = 0;
for (ll i = 0; i <= n; ++i)
x[i] = true;
x[0] = x[1] = false;
for (int i = 2; i <= n; ++i) {
if (x[i]) {
p++;
for (int j = 2 * i; j <= n; j += i)
x[j] = false;
}
num[i] = p;
}
return p;
}
ll gcd(ll a, ll b) {
if (a % b == 0)
return (b);
else
return (gcd(b, a % b));
}
ll keta(ll N) {
int tmp{};
while (N > 0) {
tmp += (N % 10);
N /= 10;
}
N = tmp;
return N;
}
int main() {
ll n;
cin >> n;
vector<ll> p(n);
for (ll i = 0; i < n; i++) {
cin >> p[i];
}
ll miss = 0;
for (ll i = 0; i < n; i++) {
if (i + 1 != p[i]) {
miss++;
}
}
if (miss == 0 || miss == 2)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const long long INF = 1LL << 60;
typedef pair<ll, ll> pairs;
vector<pairs> p;
bool pairCompare(const pair<double, ll> &firstElof,
const pair<double, ll> &secondElof) {
return firstElof.first < secondElof.first;
}
#define MAX_N 1000100
bool x[MAX_N];
ll num[MAX_N];
ll fibl[MAX_N] = {0};
ll fib(ll a) {
if (fibl[a] != 0)
return fibl[a];
if (a == 0) {
return 0;
} else if (a == 1) {
return 1;
}
return fibl[a] = fib(a - 1) + fib(a - 2);
}
ll eratosthenes(ll n) {
int p = 0;
for (ll i = 0; i <= n; ++i)
x[i] = true;
x[0] = x[1] = false;
for (int i = 2; i <= n; ++i) {
if (x[i]) {
p++;
for (int j = 2 * i; j <= n; j += i)
x[j] = false;
}
num[i] = p;
}
return p;
}
ll gcd(ll a, ll b) {
if (a % b == 0)
return (b);
else
return (gcd(b, a % b));
}
ll keta(ll N) {
int tmp{};
while (N > 0) {
tmp += (N % 10);
N /= 10;
}
N = tmp;
return N;
}
int main() {
ll n;
cin >> n;
vector<ll> p(n);
for (ll i = 0; i < n; i++) {
cin >> p[i];
}
ll miss = 0;
for (ll i = 0; i < n; i++) {
if (i + 1 != p[i]) {
miss++;
}
}
if (miss == 0 || miss == 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,827 | 763,828 | u474551232 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int p[n];
int k;
for (int i = 0; i < n; i++) {
cin >> p[i];
if (p[i] != i + 1) {
k++;
}
}
if (k <= 2) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int p[n];
int k = 0;
for (int i = 0; i < n; i++) {
cin >> p[i];
if (p[i] != i + 1) {
k++;
}
}
if (k <= 2) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
}
| [
"variable_declaration.value.change"
] | 763,829 | 763,830 | u697641414 | cpp |
p02958 | #include <iostream>
#include <vector>
using namespace std;
int main(int argc, char const *argv[]) {
int n;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; i++) {
cin >> p[i];
}
int cnt = 0;
for (int i = 0; i < n; i++) {
if (p[i] != i + 1) {
cnt++;
}
}
if (cnt == 0 || cnt == 2) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | #include <iostream>
#include <vector>
using namespace std;
int main(int argc, char const *argv[]) {
int n;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; i++) {
cin >> p[i];
}
int cnt = 0;
for (int i = 0; i < n; i++) {
if (p[i] != i + 1) {
cnt++;
}
}
if (cnt == 0 || cnt == 2) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,833 | 763,834 | u748577909 | 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];
vector<int> q(n);
for (int i = 0; i < n; ++i)
q[i] = p[i];
sort(q.begin(), q.end());
int sum = 0;
for (int i = 0; i < n; ++i) {
if (p[i] != q[i])
++sum;
}
if (sum >= 3)
cout << "No" << endl;
else
cout << "Yes" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; ++i)
cin >> p[i];
vector<int> q(n);
for (int i = 0; i < n; ++i)
q[i] = p[i];
sort(q.begin(), q.end());
int sum = 0;
for (int i = 0; i < n; ++i) {
if (p[i] != q[i])
++sum;
}
if (sum >= 3)
cout << "NO" << endl;
else
cout << "YES" << endl;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,837 | 763,838 | u417563928 | cpp |
p02958 | #include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int cnt = 0;
for (int i = 1; i <= n; i++) {
cin >> k;
if (k != i)
cnt++;
}
if (cnt <= 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
} | #include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n;
int cnt = 0;
for (int i = 1; i <= n; i++) {
cin >> k;
if (k != i)
cnt++;
}
if (cnt <= 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
} | [
"expression.operation.binary.remove"
] | 763,841 | 763,842 | u094619686 | cpp |
p02958 | #include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int cnt = 0;
for (int i = 1; i < n; i++) {
cin >> k;
if (k != i)
cnt++;
}
if (cnt <= 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
} | #include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n;
int cnt = 0;
for (int i = 1; i <= n; i++) {
cin >> k;
if (k != i)
cnt++;
}
if (cnt <= 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
} | [
"expression.operation.binary.remove",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 763,843 | 763,842 | u094619686 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a;
vector<int> vec(a);
vector<int> vecT(a);
for (int i = 0; i < a; i++) {
cin >> vec.at(i);
}
for (int i = 0; i < a; i++) {
vecT.at(i) = i + 1;
}
b = 0;
for (int i = 0; i < a; i++) {
if (vec.at(i) != vecT.at(i))
b++;
}
if (b == 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a;
vector<int> vec(a);
vector<int> vecT(a);
for (int i = 0; i < a; i++) {
cin >> vec.at(i);
}
for (int i = 0; i < a; i++) {
vecT.at(i) = i + 1;
}
b = 0;
for (int i = 0; i < a; i++) {
if (vec.at(i) != vecT.at(i))
b++;
}
if (b == 2 || b == 0)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
}
| [
"control_flow.branch.if.condition.change"
] | 763,854 | 763,855 | u365870732 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int i, n, c = 0;
cin >> n;
int a[n], b[n];
for (i = 0; i < n; i++) {
cin >> a[i];
b[i] = a[i];
}
sort(b, b + n);
for (i = 0; i < n; i++) {
if (a[i] != b[i])
c++;
}
if (c == 2 || c == 0)
cout << "Yes";
else
cout << "NO";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int i, n, c = 0;
cin >> n;
int a[n], b[n];
for (i = 0; i < n; i++) {
cin >> a[i];
b[i] = a[i];
}
sort(b, b + n);
for (i = 0; i < n; i++) {
if (a[i] != b[i])
c++;
}
if (c == 2 || c == 0)
cout << "YES";
else
cout << "NO";
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,860 | 763,861 | u185011403 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a[100], n, sum;
scanf("%d", &n);
sum = 0;
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
}
for (int i = 1; i <= n; i++) {
if (a[i] != i) {
sum++;
}
}
if (n <= 2) {
printf("YES\n");
} else {
if (sum == 2) {
printf("YES\n");
} else {
printf("NO\n");
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a[100], n, sum;
scanf("%d", &n);
sum = 0;
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
}
for (int i = 1; i <= n; i++) {
if (a[i] != i) {
sum++;
}
}
if (n <= 2) {
printf("YES\n");
} else {
if (sum == 2 || sum == 0) {
printf("YES\n");
} else {
printf("NO\n");
}
}
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 763,866 | 763,867 | u922191260 | cpp |
p02958 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
std::cout << std::fixed << std::setprecision(10);
int N;
cin >> N;
vector<int> P(N);
rep(i, N) cin >> P[i];
int count = 0;
rep(i, N) {
if (P[i] != i + 1) {
count += 1;
}
if (count >= 2) {
cout << "NO" << endl;
return 0;
}
}
cout << "YES" << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
std::cout << std::fixed << std::setprecision(10);
int N;
cin >> N;
vector<int> P(N);
rep(i, N) cin >> P[i];
int count = 0;
rep(i, N) {
if (P[i] != i + 1) {
count += 1;
}
if (count >= 3) {
cout << "NO" << endl;
return 0;
}
}
cout << "YES" << endl;
return 0;
} | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 763,868 | 763,869 | u495903598 | cpp |
p02957 | #include <bits/stdc++.h>
#include <stdio.h>
using namespace std;
#define int long long
bool codejam = 0;
typedef long long li;
typedef long double ld;
void solve();
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout << fixed << setprecision(20);
#ifdef LOCAL
freopen("input.txt", "r", stdin);
#endif
int t = 1;
// cin >> t;
int tt = t;
while (t--) {
if (codejam)
cout << "Case #" << tt - t << ": ";
solve();
}
return 0;
}
void solve() {
int a, b;
cin >> a >> b;
if ((a + b) % 2) {
cout << "Impossible";
} else {
cout << (a + b) / 2;
}
} | #include <bits/stdc++.h>
#include <stdio.h>
using namespace std;
#define int long long
bool codejam = 0;
typedef long long li;
typedef long double ld;
void solve();
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout << fixed << setprecision(20);
#ifdef LOCAL
freopen("input.txt", "r", stdin);
#endif
int t = 1;
// cin >> t;
int tt = t;
while (t--) {
if (codejam)
cout << "Case #" << tt - t << ": ";
solve();
}
return 0;
}
void solve() {
int a, b;
cin >> a >> b;
if ((a + b) % 2) {
cout << "IMPOSSIBLE";
} else {
cout << (a + b) / 2;
}
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,870 | 763,871 | u345794450 | cpp |
p02958 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define lower(s) transform(s.begin(), s.end(), s.begin(), ::tolower)
using namespace std;
using ll = long long;
int INF = 1001001001;
int main() {
int n;
cin >> n;
vector<int> p(n);
vector<int> sp(n);
rep(i, n) {
int v;
cin >> v;
p[i] = sp[i] = v;
}
sort(sp.begin(), sp.end());
int cnt = 0;
rep(i, n) {
if (p[i] != sp[i])
cnt++;
if (cnt >= 3) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define lower(s) transform(s.begin(), s.end(), s.begin(), ::tolower)
using namespace std;
using ll = long long;
int INF = 1001001001;
int main() {
int n;
cin >> n;
vector<int> p(n);
vector<int> sp(n);
rep(i, n) {
int v;
cin >> v;
p[i] = sp[i] = v;
}
sort(sp.begin(), sp.end());
int cnt = 0;
rep(i, n) {
if (p[i] != sp[i])
cnt++;
if (cnt >= 3) {
cout << "NO" << endl;
return 0;
}
}
cout << "YES" << endl;
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,872 | 763,873 | u112887319 | cpp |
p02958 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int n;
cin >> n;
vector<int> vec(n);
rep(i, n) { cin >> vec.at(i); }
auto vec2 = vec;
sort(vec2.begin(), vec2.end());
string ans = "No";
if (vec == vec2)
ans = "Yes";
else {
for (int i = 0; i < n - 1; i++) {
for (int j = i + 1; j < n; j++) {
swap(vec.at(i), vec.at(j));
if (vec == vec2)
ans = "Yes";
else
swap(vec.at(i), vec.at(j));
}
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int n;
cin >> n;
vector<int> vec(n);
rep(i, n) { cin >> vec.at(i); }
auto vec2 = vec;
sort(vec2.begin(), vec2.end());
string ans = "NO";
if (vec == vec2)
ans = "YES";
else {
for (int i = 0; i < n - 1; i++) {
for (int j = i + 1; j < n; j++) {
swap(vec.at(i), vec.at(j));
if (vec == vec2)
ans = "YES";
else
swap(vec.at(i), vec.at(j));
}
}
}
cout << ans << endl;
} | [
"literal.string.change",
"literal.string.case.change",
"variable_declaration.value.change",
"assignment.value.change"
] | 763,874 | 763,875 | u184943320 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
long N, x = 0, a = 0, b = 0, flag = 0;
string ans = "Yes";
cin >> N;
for (int i = 1; i <= N; i++) {
cin >> x;
if (i != x && flag == 2)
break;
if (i != x && flag == 1) {
if (x == a && i == b)
ans = "Yes";
flag = 2;
}
if (i != x && flag == 0) {
a = i;
b = x;
flag = 1;
ans = "No";
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long N, x = 0, a = 0, b = 0, flag = 0;
string ans = "YES";
cin >> N;
for (int i = 1; i <= N; i++) {
cin >> x;
if (i != x && flag == 2)
break;
if (i != x && flag == 1) {
if (x == a && i == b)
ans = "YES";
flag = 2;
}
if (i != x && flag == 0) {
a = i;
b = x;
flag = 1;
ans = "NO";
}
}
cout << ans << endl;
} | [
"literal.string.change",
"literal.string.case.change",
"variable_declaration.value.change",
"assignment.value.change"
] | 763,878 | 763,879 | u589209721 | cpp |
p02958 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
#define rep(i, N) for (int i = 0; i < N; i++) // 0から
typedef long long ll;
ll binary_search(vector<ll> a, ll n, ll key) {
ll right = n, left = -1;
ll md = (right + left) / 2;
while (right - left > 1) {
if (a[md] <= key) {
right = md;
} else {
left = md;
}
md = (right + left) / 2;
}
if (left == -1)
return -1; //無い場合
return right;
}
vector<ll> prime;
void Prime(ll n) { //線形篩,素数列挙
vector<ll> p(n, 0);
p[0] = 1;
p[1] = 1;
for (ll i = 2; i < n; i++) {
if (p[i] == 0) {
prime.push_back(i);
p[i] = i;
}
ll k = prime.size();
for (ll j = 0; j < k && i * prime[j] < n && prime[j] <= p[i]; j++) {
p[i * prime[j]] = prime[j];
}
}
}
ll gcd(ll a, ll b) {
if (a < b) {
swap(a, b);
}
// a>=b
ll r = a % b;
while (r != 0) {
a = b;
b = r;
r = a % b;
}
return b;
}
#define MOD ((ll)1e+9 + 7)
// cout<<fixed<<setprecision(10);
int main() {
ll n;
cin >> n;
vector<ll> p(n);
rep(i, n) { cin >> p[i]; }
int cnt = 0;
rep(i, n) {
if (p[i] != i + 1) {
cnt++;
}
}
if (cnt < 2) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
}
| #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
#define rep(i, N) for (int i = 0; i < N; i++) // 0から
typedef long long ll;
ll binary_search(vector<ll> a, ll n, ll key) {
ll right = n, left = -1;
ll md = (right + left) / 2;
while (right - left > 1) {
if (a[md] <= key) {
right = md;
} else {
left = md;
}
md = (right + left) / 2;
}
if (left == -1)
return -1; //無い場合
return right;
}
vector<ll> prime;
void Prime(ll n) { //線形篩,素数列挙
vector<ll> p(n, 0);
p[0] = 1;
p[1] = 1;
for (ll i = 2; i < n; i++) {
if (p[i] == 0) {
prime.push_back(i);
p[i] = i;
}
ll k = prime.size();
for (ll j = 0; j < k && i * prime[j] < n && prime[j] <= p[i]; j++) {
p[i * prime[j]] = prime[j];
}
}
}
ll gcd(ll a, ll b) {
if (a < b) {
swap(a, b);
}
// a>=b
ll r = a % b;
while (r != 0) {
a = b;
b = r;
r = a % b;
}
return b;
}
#define MOD ((ll)1e+9 + 7)
// cout<<fixed<<setprecision(10);
int main() {
ll n;
cin >> n;
vector<ll> p(n);
rep(i, n) { cin >> p[i]; }
int cnt = 0;
rep(i, n) {
if (p[i] != i + 1) {
cnt++;
}
}
if (cnt <= 2) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 763,880 | 763,881 | u000113982 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, c = 0;
cin >> n;
int a[n + 2], b[n + 2];
for (i = 0; i < n; i++) {
cin >> a[i];
b[i] = a[i];
}
sort(b, b + n);
for (i = 0; i < n; i++) {
if (b[i] != a[i]) {
c++;
}
}
if (c <= 2) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, c = 0;
cin >> n;
int a[n + 2], b[n + 2];
for (i = 0; i < n; i++) {
cin >> a[i];
b[i] = a[i];
}
sort(b, b + n);
for (i = 0; i < n; i++) {
if (b[i] != a[i]) {
c++;
}
}
if (c <= 2) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,884 | 763,885 | u816631826 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> numVec;
int ct;
cin >> ct;
int counter = 0;
for (int i = 0; i < ct; i++) {
int temp;
cin >> temp;
numVec.push_back(temp);
}
for (int i = 0; i < ct; i++) {
if (numVec.at(i) != i + 1)
counter++;
}
if (counter <= 2)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> numVec;
int ct;
cin >> ct;
int counter = 0;
for (int i = 0; i < ct; i++) {
int temp;
cin >> temp;
numVec.push_back(temp);
}
for (int i = 0; i < ct; i++) {
if (numVec.at(i) != i + 1)
counter++;
}
if (counter <= 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,886 | 763,887 | u816631826 | cpp |
p02958 | #include <bits/stdc++.h>
int main() {
int n, count = 0;
std::cin >> n;
int ara[n];
int arb[n];
for (int i = 0; i < n; i++) {
std::cin >> ara[i];
arb[i] = ara[i];
}
std::sort(ara, ara + n);
for (int i = 0; i < n; i++)
if (ara[i] != arb[i])
count++;
if (count == 2 || count == 0)
std::cout << "YES";
else
std::cout << "No";
}
| #include <bits/stdc++.h>
int main() {
int n, count = 0;
std::cin >> n;
int ara[n];
int arb[n];
for (int i = 0; i < n; i++) {
std::cin >> ara[i];
arb[i] = ara[i];
}
std::sort(ara, ara + n);
for (int i = 0; i < n; i++)
if (ara[i] != arb[i])
count++;
if (count == 2 || count == 0)
std::cout << "YES";
else
std::cout << "NO";
}
| [
"literal.string.change",
"literal.string.case.change",
"expression.operation.binary.change"
] | 763,892 | 763,893 | u018679195 | cpp |
p02958 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int num, diff = 0;
cin >> num;
vector<int> v(num);
for (int i = 0; i < num; ++i)
cin >> v[i];
vector<int> v2(v);
sort(v.begin(), v.end());
for (int i = 0; i < num; ++i) {
if (v[i] != v2[i])
diff++;
}
if (diff == 2)
cout << "YES";
else
cout << "NO";
system("pause");
return 0;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int num, diff = 0;
cin >> num;
vector<int> v(num);
for (int i = 0; i < num; ++i)
cin >> v[i];
vector<int> v2(v);
sort(v.begin(), v.end());
for (int i = 0; i < num; ++i) {
if (v[i] != v2[i])
diff++;
}
if (diff == 2 || diff == 0)
cout << "YES";
else
cout << "NO";
system("pause");
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 763,894 | 763,895 | u863370423 | cpp |
p02958 | #include <bits/stdc++.h>
int main() {
int n, count = 0;
std::cin >> n;
int *ara = new int[n];
int *arb = new int[n];
for (int i = 0; i < n; i++) {
std::cin >> ara[i];
arb[i] = ara[i];
}
std::sort(ara, ara + n);
for (int i = 0; i < n; i++)
if (ara[i] != arb[i])
count++;
if (count == 2 || count == 0)
std::cout << "Yes";
else
std::cout << "No";
} | #include <bits/stdc++.h>
int main() {
int n, count = 0;
std::cin >> n;
int *ara = new int[n];
int *arb = new int[n];
for (int i = 0; i < n; i++) {
std::cin >> ara[i];
arb[i] = ara[i];
}
std::sort(ara, ara + n);
for (int i = 0; i < n; i++)
if (ara[i] != arb[i])
count++;
if (count == 2 || count == 0)
std::cout << "YES";
else
std::cout << "NO";
} | [
"literal.string.change",
"literal.string.case.change",
"expression.operation.binary.change"
] | 763,896 | 763,897 | u353919145 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, j = 0;
cin >> N;
for (int i = 1; i <= N; i++) {
int p;
cin >> p;
if (p != i)
j++;
}
if (j <= 2)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, j = 0;
cin >> N;
for (int i = 1; i <= N; i++) {
int p;
cin >> p;
if (p != i)
j++;
}
if (j <= 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,921 | 763,922 | u306482197 | cpp |
p02958 | #include <iostream>
#include <vector>
int main(void) {
int n;
std::cin >> n;
std::vector<int> p(n);
for (int i = 0; i < n; i++) {
std::cin >> p[i];
}
bool flag, flag2;
flag2 = 0;
for (int k = 0; k < n - 1; k++) {
if (p[k] > p[k + 1]) {
flag = 1;
break;
}
}
if (!flag) {
std::cout << "YES" << std::endl;
flag2 = 1;
}
if (!flag) {
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
flag = 0;
std::swap(p[i], p[j]);
for (int k = 0; k < n - 1; k++) {
if (p[k] > p[k + 1]) {
std::swap(p[i], p[j]);
flag = 1;
break;
}
}
if (!flag) {
std::cout << "YES" << std::endl;
flag2 = 1;
}
}
}
}
if (!flag2) {
std::cout << "NO" << std::endl;
}
return 0;
} | #include <iostream>
#include <vector>
int main(void) {
int n;
std::cin >> n;
std::vector<int> p(n);
for (int i = 0; i < n; i++) {
std::cin >> p[i];
}
bool flag, flag2;
flag = 0;
flag2 = 0;
for (int k = 0; k < n - 1; k++) {
if (p[k] > p[k + 1]) {
flag = 1;
break;
}
}
if (!flag) {
std::cout << "YES" << std::endl;
flag2 = 1;
}
if (!flag2) {
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
flag = 0;
std::swap(p[i], p[j]);
for (int k = 0; k < n - 1; k++) {
if (p[k] > p[k + 1]) {
std::swap(p[i], p[j]);
flag = 1;
break;
}
}
if (!flag) {
std::cout << "YES" << std::endl;
flag2 = 1;
}
}
}
}
if (!flag2) {
std::cout << "NO" << std::endl;
}
return 0;
} | [
"assignment.add",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 763,930 | 763,929 | u275256557 | cpp |
p02958 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
using p = pair<int, int>;
using Graph = vector<vector<int>>;
int main(int argc, const char *argv[]) {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
int p[n];
rep(i, n) { cin >> p[i]; }
int cnt = 0;
rep(i, n) {
if (p[i] != i + 1) {
cnt++;
}
}
if (cnt == 2 || cnt == 0)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
using p = pair<int, int>;
using Graph = vector<vector<int>>;
int main(int argc, const char *argv[]) {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
int p[n];
rep(i, n) { cin >> p[i]; }
int cnt = 0;
rep(i, n) {
if (p[i] != i + 1) {
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,933 | 763,934 | u843929518 | cpp |
p02958 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> P;
for (int i = 0; i < N; i++) {
P.push_back(i + 1);
}
int num = 0;
for (int i = 0; i < N; i++) {
int p;
cin >> p;
if (p != i + 1) {
num++;
}
}
if ((num == 0) || (num == 2)) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> P;
for (int i = 0; i < N; i++) {
P.push_back(i + 1);
}
int num = 0;
for (int i = 0; i < N; i++) {
int p;
cin >> p;
if (p != i + 1) {
num++;
}
}
if ((num == 0) || (num == 2)) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,935 | 763,936 | u359465883 | cpp |
p02958 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, a[50], b[50], i, j, k, f, m;
cin >> n;
for (i = 0; i < n; i++) {
cin >> a[i];
}
f = 0;
for (i = 0; i < n - 1; i++) {
if (a[i] > a[i + 1])
f = 1;
}
if (f == 0) {
cout << "YES" << endl;
return 0;
}
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++) {
for (k = 0; k < n; k++) {
b[k] = a[k];
}
m = b[i];
b[i] = b[j];
b[j] = m;
f = 0;
for (k = 0; k < n - 1; k++) {
if (b[k] > b[k + 1]) {
f = 1;
break;
}
}
if (f == 0) {
cout << "YES" << endl;
return 0;
}
}
}
cout << "No" << endl;
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, a[50], b[50], i, j, k, f, m;
cin >> n;
for (i = 0; i < n; i++) {
cin >> a[i];
}
f = 0;
for (i = 0; i < n - 1; i++) {
if (a[i] > a[i + 1])
f = 1;
}
if (f == 0) {
cout << "YES" << endl;
return 0;
}
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++) {
for (k = 0; k < n; k++) {
b[k] = a[k];
}
m = b[i];
b[i] = b[j];
b[j] = m;
f = 0;
for (k = 0; k < n - 1; k++) {
if (b[k] > b[k + 1]) {
f = 1;
break;
}
}
if (f == 0) {
cout << "YES" << endl;
return 0;
}
}
}
cout << "NO" << endl;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,947 | 763,948 | u491376630 | cpp |
p02958 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define PI 3.14159265358979323846264338327950L
using namespace std;
using P = pair<int, int>;
using ll = long long;
using namespace std;
int main(void) {
int n;
cin >> n;
int b[n];
int a[n];
rep(i, n) {
cin >> a[i];
b[i] = a[i];
}
int cnt = 0;
sort(b, b + n);
rep(i, n) {
for (int j = i + 1; j < n; ++j) {
swap(a[i], a[j]);
rep(k, n) {
if (a[k] == b[k]) {
++cnt;
}
}
if (cnt == n) {
cout << "YES" << endl;
return 0;
}
swap(a[i], a[j]);
cnt = 0;
}
}
cout << "NO" << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define PI 3.14159265358979323846264338327950L
using namespace std;
using P = pair<int, int>;
using ll = long long;
using namespace std;
int main(void) {
int n;
cin >> n;
int b[n];
int a[n];
rep(i, n) {
cin >> a[i];
b[i] = a[i];
}
int cnt = 0;
sort(b, b + n);
rep(i, n) {
for (int j = i; j < n; ++j) {
swap(a[i], a[j]);
rep(k, n) {
if (a[k] == b[k]) {
++cnt;
}
}
if (cnt == n) {
cout << "YES" << endl;
return 0;
}
swap(a[i], a[j]);
cnt = 0;
}
}
cout << "NO" << endl;
return 0;
} | [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove"
] | 763,954 | 763,955 | u963343620 | cpp |
p02958 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define PI 3.14159265358979323846264338327950L
using namespace std;
using P = pair<int, int>;
using ll = long long;
using namespace std;
int main(void) {
int n;
cin >> n;
int b[n];
int a[n];
rep(i, n) {
cin >> a[i];
b[i] = a[i];
}
int cnt = 0;
sort(b, b + n);
rep(i, n) {
for (int j = i; j < n; ++j) {
swap(a[i], a[j]);
rep(k, n) {
if (a[k] == b[k]) {
++cnt;
}
}
if (cnt == n) {
cout << "YES" << endl;
return 0;
}
swap(a[i], a[j]);
}
}
cout << "NO" << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define PI 3.14159265358979323846264338327950L
using namespace std;
using P = pair<int, int>;
using ll = long long;
using namespace std;
int main(void) {
int n;
cin >> n;
int b[n];
int a[n];
rep(i, n) {
cin >> a[i];
b[i] = a[i];
}
int cnt = 0;
sort(b, b + n);
rep(i, n) {
for (int j = i; j < n; ++j) {
swap(a[i], a[j]);
rep(k, n) {
if (a[k] == b[k]) {
++cnt;
}
}
if (cnt == n) {
cout << "YES" << endl;
return 0;
}
swap(a[i], a[j]);
cnt = 0;
}
}
cout << "NO" << endl;
return 0;
} | [
"assignment.add"
] | 763,956 | 763,955 | u963343620 | cpp |
p02958 | #include <iostream>
using namespace std;
int main() {
int a, b, ans = 0;
cin >> a;
for (int i = 0; i < a; i++) {
cin >> b;
if (b != (i - 1))
ans++;
}
if (ans < 3)
cout << "YES";
else
cout << "NO";
} | #include <iostream>
using namespace std;
int main() {
int a, b, ans = 0;
cin >> a;
for (int i = 0; i < a; i++) {
cin >> b;
if (b != (i + 1))
ans++;
}
if (ans < 3)
cout << "YES";
else
cout << "NO";
}
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 763,963 | 763,964 | u079532978 | cpp |
p02958 | #include <iostream>
using namespace std;
int main() {
int n, cnt = 0;
cin >> n;
for (int i = 0; i < n; i++) {
int p;
cin >> p;
if (p != i + 1)
cnt++;
}
cout << (cnt == 2 || cnt == 0 ? "Yes" : "No") << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n, cnt = 0;
cin >> n;
for (int i = 0; i < n; i++) {
int p;
cin >> p;
if (p != i + 1)
cnt++;
}
cout << (cnt == 2 || cnt == 0 ? "YES" : "NO") << endl;
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,975 | 763,976 | u553321223 | cpp |
p02958 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(i, x, n) for (int i = x; i < n; i++)
#define repr(i, n) for (int i = n; i >= 0; i--)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
int p[n];
int c[n];
rep(i, n) cin >> p[i];
repr(i, n) c[i - 1] = i;
int cnt = 0;
rep(i, n) {
if (p[i] != c[i])
cnt++;
}
if (cnt == 0 or cnt == 2)
cout << "Yes";
else
cout << "No";
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(i, x, n) for (int i = x; i < n; i++)
#define repr(i, n) for (int i = n; i >= 0; i--)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
int p[n];
int c[n];
rep(i, n) cin >> p[i];
repr(i, n) c[i - 1] = i;
int cnt = 0;
rep(i, n) {
if (p[i] != c[i])
cnt++;
}
if (cnt == 0 or cnt == 2)
cout << "YES";
else
cout << "NO";
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,977 | 763,978 | u269786286 | cpp |
p02958 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(i, x, n) for (int i = x; i < n; i++)
#define repr(i, n) for (int i = n; i >= 0; i--)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
int p[n];
int c[n];
rep(i, n) cin >> p[i];
repr(i, n) c[i - 1] = i;
int cnt = 0;
rep(i, n) {
if (p[i] != c[i])
cnt++;
}
if (cnt == 0 or cnt == 1)
cout << "Yes";
else
cout << "No";
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(i, x, n) for (int i = x; i < n; i++)
#define repr(i, n) for (int i = n; i >= 0; i--)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
int p[n];
int c[n];
rep(i, n) cin >> p[i];
repr(i, n) c[i - 1] = i;
int cnt = 0;
rep(i, n) {
if (p[i] != c[i])
cnt++;
}
if (cnt == 0 or cnt == 2)
cout << "YES";
else
cout << "NO";
return 0;
} | [
"literal.number.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,979 | 763,978 | u269786286 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, n) for (int i = 1; i <= (int)(n); i++)
int main() {
int N;
cin >> N;
int num;
int cnt = 0;
for (int i = 1; i <= N; i++) {
cin >> num;
if (num != i)
cnt += 1;
}
cout << (cnt <= 2 ? "Yes" : "No") << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, n) for (int i = 1; i <= (int)(n); i++)
int main() {
int N;
cin >> N;
int num;
int cnt = 0;
for (int i = 1; i <= N; i++) {
cin >> num;
if (num != i)
cnt += 1;
}
cout << (cnt <= 2 ? "YES" : "NO") << endl;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,982 | 763,983 | u127228093 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll N = 1e5 + 100;
int main() {
ll n;
while (~scanf("%lld", &n)) {
ll x, sum = 0;
for (int i = 1; i <= n; i++) {
scanf("%lld", &x);
if (x != i)
sum++;
}
if (sum == 0 || sum == 2)
printf("Yes\n");
else
printf("No\n");
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll N = 1e5 + 100;
int main() {
ll n;
while (~scanf("%lld", &n)) {
ll x, sum = 0;
for (int i = 1; i <= n; i++) {
scanf("%lld", &x);
if (x != i)
sum++;
}
if (sum == 0 || sum == 2)
printf("YES\n");
else
printf("NO\n");
}
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 763,986 | 763,987 | u013103635 | cpp |
p02958 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
int a[50];
int cnt = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] != i + 1)
cnt++;
}
if (cnt > 2)
cout << "No" << endl;
else
cout << "Yes" << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
int a[50];
int cnt = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] != i + 1)
cnt++;
}
if (cnt > 2)
cout << "NO" << endl;
else
cout << "YES" << endl;
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,990 | 763,991 | u338520482 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
using 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.at(i);
int cnt = 0;
rep(i, n) {
if (p.at(i) != i + 1)
cnt++;
}
if (cnt > 2)
cout << "No" << endl;
else
cout << "Yes" << endl;
} | #include <bits/stdc++.h>
using namespace std;
using 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.at(i);
int cnt = 0;
rep(i, n) {
if (p.at(i) != i + 1)
cnt++;
}
if (cnt > 2)
cout << "NO" << endl;
else
cout << "YES" << endl;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,992 | 763,993 | u335384647 | cpp |
p02958 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, cnt;
vector<int> v, w;
cin >> n;
v.resize(n);
w.resize(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
w[i] = v[i];
}
sort(v.begin(), v.end());
cnt = 0;
for (int i = 0; i < n; i++) {
if (v[i] != w[i]) {
cnt++;
}
}
if (cnt < 3) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, cnt;
vector<int> v, w;
cin >> n;
v.resize(n);
w.resize(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
w[i] = v[i];
}
sort(v.begin(), v.end());
cnt = 0;
for (int i = 0; i < n; i++) {
if (v[i] != w[i]) {
cnt++;
}
}
if (cnt < 3) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,994 | 763,995 | u440276250 | cpp |
p02958 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, cnt;
vector<int> v, w;
cin >> n;
v.resize(n);
w.resize(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
w[i] = v[i];
}
sort(v.begin(), v.end());
cnt = 0;
for (int i = 0; i < n; i++) {
if (v[i] != w[i]) {
// cout<<v[i]<<" "<<w[i]<<endl;
cnt++;
}
}
if (cnt < 3) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, cnt;
vector<int> v, w;
cin >> n;
v.resize(n);
w.resize(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
w[i] = v[i];
}
sort(v.begin(), v.end());
cnt = 0;
for (int i = 0; i < n; i++) {
if (v[i] != w[i]) {
cnt++;
}
}
if (cnt < 3) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,996 | 763,995 | u440276250 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n;
cin >> n;
int a[n], b[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
b[i] = a[i];
}
sort(b, b + n);
int c = 0;
for (int i = 0; i < n; i++) {
if (a[i] != b[i])
c++;
}
if (c > 2)
cout << "No";
else
cout << "Yes";
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n;
cin >> n;
int a[n], b[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
b[i] = a[i];
}
sort(b, b + n);
int c = 0;
for (int i = 0; i < n; i++) {
if (a[i] != b[i])
c++;
}
if (c > 2)
cout << "NO";
else
cout << "YES";
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 764,002 | 764,003 | u512624048 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec[i];
}
int diff = 0;
for (int i = 0; i < N; i++) {
if (vec[i] == i + 1) {
continue;
} else {
diff++;
}
}
if (diff == 0) {
cout << "yes" << endl;
} else if (diff == 2) {
cout << "yes" << endl;
} else {
cout << "no" << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec[i];
}
int diff = 0;
for (int i = 0; i < N; i++) {
if (vec[i] == i + 1) {
continue;
} else {
diff++;
}
}
if (diff == 0) {
cout << "YES" << endl;
} else if (diff == 2) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 764,004 | 764,005 | u045368371 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, ex = 0;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] != i + 1)
ex++;
}
if (ex == 0 || ex == 2)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, ex = 0;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] != i + 1)
ex++;
}
if (ex == 0 || ex == 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 764,006 | 764,007 | u089151327 | 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> pi;
rep(i, N) {
int tmp_pi;
cin >> tmp_pi;
pi.push_back(tmp_pi);
}
bool ans = false;
int miscnt = 0;
rep(i, N) {
if (pi.at(i) != (i + 1))
miscnt++;
}
if (miscnt > 2) {
ans = false;
} else {
ans = true;
}
if (ans) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
}
| #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> pi;
rep(i, N) {
int tmp_pi;
cin >> tmp_pi;
pi.push_back(tmp_pi);
}
bool ans = false;
int miscnt = 0;
rep(i, N) {
if (pi.at(i) != (i + 1))
miscnt++;
}
if (miscnt > 2) {
ans = false;
} else {
ans = true;
}
if (ans) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 764,010 | 764,011 | u503640463 | cpp |
p02958 | #include <bits/stdc++.h>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 1; i <= n; i++)
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> p(n);
rep(i, n) { cin >> p[i]; }
int count = 0;
rep(i, n) {
if (p[i] != i)
count++;
}
if (count == 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
| #include <bits/stdc++.h>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> p(n);
rep(i, n) { cin >> p[i]; }
int count = 0;
rep(i, n) {
if (p[i] != i + 1)
count++;
}
if (count <= 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
| [
"preprocessor.define.value.change",
"literal.integer.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 764,016 | 764,015 | u902803949 | cpp |
p02958 | #include <bits/stdc++.h>
#define M_PI 3.14159265358979323846 // pi
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef pair<ll, ll> P;
#define rep(a, n) for (int a = 0; a < n; a++)
#define repi(a, b, n) for (int a = b; a < n; a++)
const ll mod = 1000000007;
int main(void) {
ll n;
cin >> n;
vector<ll> p(n);
rep(i, n) cin >> p[i];
for (int i = 0; i < n - 1; i++) {
for (int j = i + 1; j < n; j++) {
swap(p[i], p[j]);
int prev = -1;
bool ok = true;
rep(k, n) {
if (p[k] != k + 1) {
ok = false;
break;
}
}
if (ok) {
cout << "YES" << endl;
return 0;
}
swap(p[i], p[j]);
}
}
cout << "NO" << endl;
return 0;
}
| #include <bits/stdc++.h>
#define M_PI 3.14159265358979323846 // pi
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef pair<ll, ll> P;
#define rep(a, n) for (int a = 0; a < n; a++)
#define repi(a, b, n) for (int a = b; a < n; a++)
const ll mod = 1000000007;
int main(void) {
ll n;
cin >> n;
vector<ll> p(n);
rep(i, n) cin >> p[i];
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
swap(p[i], p[j]);
int prev = -1;
bool ok = true;
rep(k, n) {
if (p[k] != k + 1) {
ok = false;
break;
}
}
if (ok) {
cout << "YES" << endl;
return 0;
}
swap(p[i], p[j]);
}
}
cout << "NO" << endl;
return 0;
}
| [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"variable_declaration.value.change",
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 764,021 | 764,022 | u834771741 | 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 counter = 0;
for (int i = 0; i < n; i++) {
if (p[i] != i + 1) {
counter += 1;
}
}
if (counter <= 2)
cout << "Yes" << endl;
if (counter > 2)
cout << "No" << endl;
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 counter = 0;
for (int i = 0; i < n; i++) {
if (p[i] != i + 1) {
counter += 1;
}
}
if (counter <= 2)
cout << "YES" << endl;
if (counter > 2)
cout << "NO" << endl;
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 764,025 | 764,026 | u180716041 | 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];
vector<int> P(N);
for (int i = 0; i < N; i++)
P[i] = N - i;
int s = 0;
for (int i = 0; i < N; i++) {
if (p[i] != P[i])
s++;
}
if (s == 0 || s == 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> p(N);
for (int i = 0; i < N; i++)
cin >> p[i];
vector<int> P(N);
for (int i = 0; i < N; i++)
P[i] = i + 1;
int s = 0;
for (int i = 0; i < N; i++) {
if (p[i] != P[i])
s++;
}
if (s == 0 || s == 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
| [
"expression.operation.binary.remove",
"assignment.change"
] | 764,027 | 764,028 | u089578476 | 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> p(n);
rep(i, n) cin >> p[i];
int k = 0;
rep(i, n) if (p[i] != i + 1) k++;
if (k >= 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> p(n);
rep(i, n) cin >> p[i];
int k = 0;
rep(i, n) if (p[i] != i + 1) k++;
if (k <= 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 764,029 | 764,030 | u147556624 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int issorted(vector<int> res) {
for (int i = 0; i < res.size(); i++) {
if (res[i] != i + 1) {
return 0;
}
}
return 1;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
vector<int> vc;
cin >> n;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
vc.push_back(x);
}
int stock1 = 0, stock2 = 0;
int num1 = -1, num2 = -1;
for (int i = 0; i < n; i++) {
if (vc[i] != i + 1) {
stock2 = stock1;
stock1 = vc[i];
num2 = num1;
num1 = i;
}
}
if (num1 != -1 && num2 != -1) {
swap(vc[num1], vc[num2]);
}
int res;
res = issorted(vc);
if (res == 1) {
cout << "Yes" << '\n';
} else {
cout << "No" << '\n';
}
} | #include <bits/stdc++.h>
using namespace std;
int issorted(vector<int> res) {
for (int i = 0; i < res.size(); i++) {
if (res[i] != i + 1) {
return 0;
}
}
return 1;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
vector<int> vc;
cin >> n;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
vc.push_back(x);
}
int stock1 = 0, stock2 = 0;
int num1 = -1, num2 = -1;
for (int i = 0; i < n; i++) {
if (vc[i] != i + 1) {
stock2 = stock1;
stock1 = vc[i];
num2 = num1;
num1 = i;
}
}
if (num1 != -1 && num2 != -1) {
swap(vc[num1], vc[num2]);
}
int res;
res = issorted(vc);
if (res == 1) {
cout << "YES" << '\n';
} else {
cout << "NO" << '\n';
}
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 764,031 | 764,032 | u017829818 | cpp |
p02958 | #include <bits/stdc++.h>
#include <string>
using namespace std;
int main() {
int count = 0;
int N;
cin >> N;
vector<int> P(N);
for (int i = 0; i < N; i++) {
cin >> P[i];
if ((P[i] - 1) != i) {
count++;
}
}
if (count <= 2) {
cout << "Yes";
} else {
cout << "No";
}
} | #include <bits/stdc++.h>
#include <string>
using namespace std;
int main() {
int count = 0;
int N;
cin >> N;
vector<int> P(N);
for (int i = 0; i < N; i++) {
cin >> P[i];
if ((P[i] - 1) != i) {
count++;
}
}
if (count <= 2) {
cout << "YES";
} else {
cout << "NO";
}
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 764,033 | 764,034 | u573537453 | cpp |
p02958 | #include <bits/stdc++.h>
#include <string>
using namespace std;
int main() {
int count = 0;
int N;
cin >> N;
vector<int> P(N);
for (int i = 0; i < N; i++) {
cin >> P[i];
if (P[i] - 1 != i) {
count++;
}
}
if (count <= 2) {
cout << "Yes";
} else {
cout << "No";
}
}
| #include <bits/stdc++.h>
#include <string>
using namespace std;
int main() {
int count = 0;
int N;
cin >> N;
vector<int> P(N);
for (int i = 0; i < N; i++) {
cin >> P[i];
if ((P[i] - 1) != i) {
count++;
}
}
if (count <= 2) {
cout << "YES";
} else {
cout << "NO";
}
}
| [
"control_flow.branch.if.condition.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 764,035 | 764,034 | u573537453 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int s[51];
for (int i = 0; i < n; i++)
cin >> s[i];
bool flag1 = 0;
bool flag2 = 0;
bool flag3 = 0;
// int num = 0;
for (int i = 0; i < n; i++) {
/*
if (flag1 ==0 && num>s[i]) flag1 = 1;
else if (flag1 ==1 && num>s[i]) flag2 = 1;
else if (flag1 ==1 && flag2 ==1
&& flag3 == 0 && num>s[i])
flag3 = 1;
*/
if (!flag1 && i != s[i])
flag1 = 1;
else if (flag1 && !flag2 && i != s[i])
flag2 = 1;
else if (flag1 && flag2 && !flag3 && i != s[i])
flag3 = 1;
// num = s[i];
}
if ((flag1 && !flag2) || flag3)
cout << "NO" << endl;
else
cout << "YES" << endl;
// cout << flag1 << " " << flag2 << " " << flag3 << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int s[51];
for (int i = 0; i < n; i++)
cin >> s[i];
bool flag1 = 0;
bool flag2 = 0;
bool flag3 = 0;
// int num = 0;
for (int i = 0; i < n; i++) {
/*
if (flag1 ==0 && num>s[i]) flag1 = 1;
else if (flag1 ==1 && num>s[i]) flag2 = 1;
else if (flag1 ==1 && flag2 ==1
&& flag3 == 0 && num>s[i])
flag3 = 1;
*/
if (!flag1 && i + 1 != s[i])
flag1 = 1;
else if (flag1 && !flag2 && i + 1 != s[i])
flag2 = 1;
else if (flag1 && flag2 && !flag3 && i + 1 != s[i])
flag3 = 1;
// num = s[i];
}
if ((flag1 && !flag2) || flag3)
cout << "NO" << endl;
else
cout << "YES" << endl;
// cout << flag1 << " " << flag2 << " " << flag3 << endl;
return 0;
} | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 764,039 | 764,040 | u785334194 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int cnt = 0;
vector<int> vec(n);
for (int i = 0; i < n; i++) {
cin >> vec.at(i);
}
for (int i = 0; i < n; i++) {
if (vec.at(i) != i + 1) {
cnt++;
}
}
if (cnt == 2 || cnt == 0) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int cnt = 0;
vector<int> vec(n);
for (int i = 0; i < n; i++) {
cin >> vec.at(i);
}
for (int i = 0; i < n; i++) {
if (vec.at(i) != i + 1) {
cnt++;
}
}
if (cnt == 2 || cnt == 0) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 764,049 | 764,050 | u796877631 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> V(N), W(N);
for (int i = 0; i < N; i++)
cin >> V.at(i);
W = V;
sort(W.begin(), W.end());
int A = 0;
for (int i = 0; i < N; i++) {
if (V.at(i) == W.at(i))
A++;
}
if (A == N || A == N - 2)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> V(N), W(N);
for (int i = 0; i < N; i++)
cin >> V.at(i);
W = V;
sort(W.begin(), W.end());
int A = 0;
for (int i = 0; i < N; i++) {
if (V.at(i) == W.at(i))
A++;
}
if (A == N || A == N - 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 764,052 | 764,053 | u429665788 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
scanf("%d", &n);
int p[n];
vector<int> vec1;
vector<int> vec2;
for (int i = 0; i < n; i++)
scanf("%d", &p[i]);
for (int i = 0; i < n; i++)
vec1.push_back(p[i]);
for (int i = 0; i < n; i++)
vec2.push_back(p[i]);
sort(vec1.begin(), vec1.end());
for (int i = 0; i < n; i++) {
for (int j = i; j < n; j++) {
int save = vec2[i];
vec2[i] = vec2[j];
vec2[j] = save;
if (vec2 == vec1) {
printf("YES\n");
return 0;
} else {
vec2[i] = save;
vec2[i] = vec2[j];
vec2[j] = save;
}
}
}
printf("NO\n");
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
scanf("%d", &n);
int p[n];
vector<int> vec1;
vector<int> vec2;
for (int i = 0; i < n; i++)
scanf("%d", &p[i]);
for (int i = 0; i < n; i++)
vec1.push_back(p[i]);
for (int i = 0; i < n; i++)
vec2.push_back(p[i]);
sort(vec1.begin(), vec1.end());
for (int i = 0; i < n; i++) {
for (int j = i; j < n; j++) {
int save = vec2[i];
vec2[i] = vec2[j];
vec2[j] = save;
if (vec2 == vec1) {
printf("YES\n");
return 0;
} else {
save = vec2[i];
vec2[i] = vec2[j];
vec2[j] = save;
}
}
}
printf("NO\n");
} | [
"assignment.change"
] | 764,058 | 764,059 | u224590796 | cpp |
p02958 | #include <algorithm>
#include <bitset>
#include <functional>
#include <initializer_list>
#include <iostream>
#include <map>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long int ll;
int main() {
ll N;
cin >> N;
vector<ll> P(N);
ll Count = 0;
for (ll i = 0; i < N; i++) {
cin >> P[i];
if (i + 1 != P[i])
Count++;
}
if (Count > 2)
cout << "NO";
else
cout << "Yes";
}
| #include <algorithm>
#include <bitset>
#include <functional>
#include <initializer_list>
#include <iostream>
#include <map>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long int ll;
int main() {
ll N;
cin >> N;
vector<ll> P(N);
ll Count = 0;
for (ll i = 0; i < N; i++) {
cin >> P[i];
if (i + 1 != P[i])
Count++;
}
if (Count > 2)
cout << "NO";
else
cout << "YES";
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 764,060 | 764,061 | u924785929 | cpp |
p02958 | //#include <bits/stdc++.h>
#include <algorithm>
#include <cmath>
#include <complex>
#include <iomanip>
#include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
//定数
#define MOD 1000000007
//マクロ
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define reprev(i, n) for (int(i) = (n - 1); (i) >= 0; (i)--)
#define max3(a, b, c) max(a, max(b, c))
#define min3(a, b, c) min(a, min(b, c))
#define vsort(v) sort((v).begin(), (v).end());
typedef unsigned long long int ull;
typedef long long lint;
using namespace std;
int main() {
int N;
int count = 0;
//入力
cin >> N;
vector<pair<int, int>> p(N);
rep(i, N) cin >> p[i].first, p[i].second = i;
sort(p.begin(), p.end());
rep(i, N) if (p[i].second - i != 0) count++;
if (count == 2 || count == 0)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | //#include <bits/stdc++.h>
#include <algorithm>
#include <cmath>
#include <complex>
#include <iomanip>
#include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
//定数
#define MOD 1000000007
//マクロ
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define reprev(i, n) for (int(i) = (n - 1); (i) >= 0; (i)--)
#define max3(a, b, c) max(a, max(b, c))
#define min3(a, b, c) min(a, min(b, c))
#define vsort(v) sort((v).begin(), (v).end());
typedef unsigned long long int ull;
typedef long long lint;
using namespace std;
int main() {
int N;
int count = 0;
//入力
cin >> N;
vector<pair<int, int>> p(N);
rep(i, N) cin >> p[i].first, p[i].second = i;
sort(p.begin(), p.end());
rep(i, N) if (p[i].second - i != 0) count++;
if (count == 2 || count == 0)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 764,062 | 764,063 | u212083331 | cpp |
p02958 | #include <bits/stdc++.h>
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define size_t unsigned long long
#define ll long long
#define rep(i, a) for (int i = 0; i < (a); i++)
#define repr(i, a) for (int i = (int)(a)-1; i >= 0; i--)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define FORR(i, a, b) for (int i = (int)(b)-1; i >= a; i--)
#define ALL(a) a.begin(), a.end()
using namespace std;
int si() {
int x;
scanf("%d", &x);
return x;
}
long long sl() {
long long x;
scanf("%lld", &x);
return x;
}
string ss() {
string x;
cin >> x;
return x;
}
void pi(int x) { printf("%d ", x); }
void pl(long long x) { printf("%lld ", x); }
void pd(double x) { printf("%.15f ", x); }
void ps(const string &s) { printf("%s ", s.c_str()); }
void br() { putchar('\n'); }
const ll MOD = 1e9 + 7;
const ll INF = 1e9 + 5;
struct mint {
int n;
mint(int n_ = 0) : n(n_) {}
};
mint operator+(mint a, mint b) {
a.n += b.n;
if (a.n >= MOD)
a.n -= MOD;
return a;
}
mint operator-(mint a, mint b) {
a.n -= b.n;
if (a.n < 0)
a.n += MOD;
return a;
}
mint operator*(mint a, mint b) { return (long long)a.n * b.n % MOD; }
mint &operator+=(mint &a, mint b) { return a = a + b; }
mint &operator-=(mint &a, mint b) { return a = a - b; }
mint &operator*=(mint &a, mint b) { return a = a * b; }
typedef pair<int, int> P;
const ll N = 1e6 + 5;
string s;
vector<ll> v[N];
ll n, r;
ll a[N], b[N];
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cin >> n;
rep(i, n) {
cin >> a[i];
b[i] = a[i];
}
SORT(b, n);
// reverse(b,b+n);
rep(i, n) {
// cout << b[i] << endl;
if (a[i] != b[i])
r++;
}
if (r == 2 || r == 0)
s = "Yes";
else
s = "No";
cout << s << endl;
}
| #include <bits/stdc++.h>
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define size_t unsigned long long
#define ll long long
#define rep(i, a) for (int i = 0; i < (a); i++)
#define repr(i, a) for (int i = (int)(a)-1; i >= 0; i--)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define FORR(i, a, b) for (int i = (int)(b)-1; i >= a; i--)
#define ALL(a) a.begin(), a.end()
using namespace std;
int si() {
int x;
scanf("%d", &x);
return x;
}
long long sl() {
long long x;
scanf("%lld", &x);
return x;
}
string ss() {
string x;
cin >> x;
return x;
}
void pi(int x) { printf("%d ", x); }
void pl(long long x) { printf("%lld ", x); }
void pd(double x) { printf("%.15f ", x); }
void ps(const string &s) { printf("%s ", s.c_str()); }
void br() { putchar('\n'); }
const ll MOD = 1e9 + 7;
const ll INF = 1e9 + 5;
struct mint {
int n;
mint(int n_ = 0) : n(n_) {}
};
mint operator+(mint a, mint b) {
a.n += b.n;
if (a.n >= MOD)
a.n -= MOD;
return a;
}
mint operator-(mint a, mint b) {
a.n -= b.n;
if (a.n < 0)
a.n += MOD;
return a;
}
mint operator*(mint a, mint b) { return (long long)a.n * b.n % MOD; }
mint &operator+=(mint &a, mint b) { return a = a + b; }
mint &operator-=(mint &a, mint b) { return a = a - b; }
mint &operator*=(mint &a, mint b) { return a = a * b; }
typedef pair<int, int> P;
const ll N = 1e6 + 5;
string s;
vector<ll> v[N];
ll n, r;
ll a[N], b[N];
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cin >> n;
rep(i, n) {
cin >> a[i];
b[i] = a[i];
}
SORT(b, n);
// reverse(b,b+n);
rep(i, n) {
// cout << b[i] << endl;
if (a[i] != b[i])
r++;
}
if (r == 2 || r == 0)
s = "YES";
else
s = "NO";
cout << s << endl;
}
| [
"literal.string.change",
"literal.string.case.change",
"assignment.value.change"
] | 764,066 | 764,067 | u284848973 | cpp |
p02958 | #include <iostream>
#include <vector>
using namespace std;
bool upOrder(vector<int> s) {
for (int i = 0; i < s.size() - 1; i++) {
if (s[i] > s[i + 1])
return false;
}
return true;
}
void swap(int *a, int *b) {
int t;
t = *a;
*a = *b;
*b = t;
}
int main() {
int n;
vector<int> p;
cin >> n;
for (int i = 0; i < n; i++) {
int tp;
cin >> tp;
p.push_back(tp);
}
bool flag = upOrder(p);
for (int i = 0; i < n - 1; i++) {
for (int j = i + 1; j < n; j++) {
swap(p[i], p[j]);
if (upOrder(p)) {
flag = true;
break;
}
swap(p[i], p[j]);
}
}
if (flag)
printf("Yes\n");
else
printf("No\n");
}
| #include <iostream>
#include <vector>
using namespace std;
bool upOrder(vector<int> s) {
for (int i = 0; i < s.size() - 1; i++) {
if (s[i] > s[i + 1])
return false;
}
return true;
}
void swap(int *a, int *b) {
int t;
t = *a;
*a = *b;
*b = t;
}
int main() {
int n;
vector<int> p;
cin >> n;
for (int i = 0; i < n; i++) {
int tp;
cin >> tp;
p.push_back(tp);
}
bool flag = upOrder(p);
for (int i = 0; i < n - 1; i++) {
for (int j = i + 1; j < n; j++) {
swap(p[i], p[j]);
if (upOrder(p)) {
flag = true;
break;
}
swap(p[i], p[j]);
}
}
if (flag)
printf("YES\n");
else
printf("NO\n");
}
| [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 764,072 | 764,073 | u632679464 | cpp |
p02958 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
long long int gcd(long long int x, long long int y) {
if (y == 0) {
return x;
}
return gcd(y, x % y);
}
int main(void) {
int p[60], n, i, count = 0;
cin >> n;
for (i = 0; i < n; i++) {
cin >> p[i];
}
i = p[0];
for (int j = 0; j < n; j++) {
if (p[j] != i) {
count++;
}
i++;
}
if (count <= 2) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
}
| #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
long long int gcd(long long int x, long long int y) {
if (y == 0) {
return x;
}
return gcd(y, x % y);
}
int main(void) {
int p[60], n, i, count = 0;
cin >> n;
for (i = 0; i < n; i++) {
cin >> p[i];
}
i = 1;
for (int j = 0; j < n; j++) {
if (p[j] != i) {
count++;
}
i++;
}
if (count <= 2) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
} | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 764,074 | 764,075 | u114838227 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int 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 <bits/stdc++.h>
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;
} | [] | 764,085 | 764,086 | u615258936 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
// your code goes here
long long int n = 0, m = 0, a = 0, b = 0, c = 0;
cin >> n;
vector<long long> s(n), t(n);
for (int i = 0; i < n; i++) {
cin >> s.at(i);
t.at(i) = s.at(i);
}
sort(t.begin(), t.end());
for (int i = 0; i < n; i++) {
if (t.at(i) != s.at(i)) {
a++;
}
}
if (a == 0 || 2) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
// your code goes here
long long int n = 0, m = 0, a = 0, b = 0, c = 0;
cin >> n;
vector<long long> s(n), t(n);
for (int i = 0; i < n; i++) {
cin >> s.at(i);
t.at(i) = s.at(i);
}
sort(t.begin(), t.end());
for (int i = 0; i < n; i++) {
if (t.at(i) != s.at(i)) {
a++;
}
}
// cout << a << endl;
if (a == 0 || a == 2) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 764,087 | 764,088 | u053227023 | 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 == n || count == n - 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 == n || count == n - 2) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 764,097 | 764,098 | u356701928 | cpp |
p02958 | // This file is a "Hello, world!" in C++ language by GCC for wandbox.
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
int p[n];
int cnt = 0;
for (int i = 0; i < n; i++) {
cin >> p[i];
if (p[i] != i + 1) {
cnt++;
}
}
if (cnt <= 2)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| // This file is a "Hello, world!" in C++ language by GCC for wandbox.
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
int p[n];
int cnt = 0;
for (int i = 0; i < n; i++) {
cin >> p[i];
if (p[i] != i + 1) {
cnt++;
}
}
if (cnt <= 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 764,109 | 764,110 | u841354647 | cpp |
p02958 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main() {
int count = 0;
int N;
cin >> N;
vector<int> p(N);
REP(i, N) cin >> p[i];
REP(i, N) if (p[i] != N - i)++ count;
if (count == 0 || count == 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
} | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main() {
int count = 0;
int N;
cin >> N;
vector<int> p(N);
REP(i, N) cin >> p[i];
REP(i, N) if (p[i] != i + 1)++ count;
if (count == 0 || count == 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
} | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 764,111 | 764,112 | u108484707 | cpp |
p02958 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main() {
int count = 0;
int N;
cin >> N;
vector<int> p(N);
REP(i, N) cin >> p[i];
REP(i, N) if (p[i] != N - i)++ count;
if (count == 0 || count == 2)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main() {
int count = 0;
int N;
cin >> N;
vector<int> p(N);
REP(i, N) cin >> p[i];
REP(i, N) if (p[i] != i + 1)++ count;
if (count == 0 || count == 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
} | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 764,113 | 764,112 | u108484707 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, cou = 0;
cin >> n;
vector<int> a(n);
vector<int> p(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
p.at(i) = a.at(i);
}
sort(p.begin(), p.end());
for (int i = 0; i < n; i++) {
if (p.at(i) != a.at(i)) {
cou++;
}
}
if (cou <= 2) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, cou = 0;
cin >> n;
vector<int> a(n);
vector<int> p(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
p.at(i) = a.at(i);
}
sort(p.begin(), p.end());
for (int i = 0; i < n; i++) {
if (p.at(i) != a.at(i)) {
cou++;
}
}
if (cou <= 2) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 764,114 | 764,115 | u442754977 | cpp |
p02958 | #include "bits/stdc++.h"
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef vector<PII> VPII;
typedef long long LL;
typedef priority_queue<int> PQ_DESC;
typedef priority_queue<int, vector<int>, greater<int>> PQ_ASC;
typedef priority_queue<PII> PQ_DESC_PII;
typedef priority_queue<PII, vector<PII>, greater<PII>> PQ_ASC_PII;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
typedef vector<VVLL> VVVLL;
#define SORT_ASC(c) sort((c).begin(), (c).end())
#define SORT_DESC(c) \
sort((c).begin(), (c).end(), greater<typeof((c).begin())>())
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define SIZE(a) int((a).size())
const double EPS = 1e-10;
const double PI = acos(-1.0);
const int INT_LARGE = 1000000100;
// debug func
template <typename T> void vecprint(vector<T> v) {
for (auto x : v) {
cerr << x << " ";
}
cerr << endl;
}
template <typename T> void vecvecprint(vector<vector<T>> vv) {
REP(i, SIZE(vv)) {
REP(j, SIZE(vv[i])) { cerr << vv[i][j] << " "; }
cerr << endl;
}
}
template <typename T> void pqprint(priority_queue<T> q) {
while (!q.empty()) {
cerr << q.top() << " ";
q.pop();
}
cerr << endl;
}
template <typename T> void qprint(queue<T> q) {
while (!q.empty()) {
cerr << q.front() << " ";
q.pop();
}
cerr << endl;
}
template <typename T> void vecqprint(vector<queue<T>> v) {
for (int i = 0; i < v.size(); i++) {
qprint(v[i]);
}
}
template <typename Iterator>
inline bool next_combination(const Iterator first, Iterator k,
const Iterator last) {
/* Credits: Thomas Draper */
if ((first == last) || (first == k) || (last == k))
return false;
Iterator itr1 = first;
Iterator itr2 = last;
++itr1;
if (last == itr1)
return false;
itr1 = last;
--itr1;
itr1 = k;
--itr2;
while (first != itr1) {
if (*--itr1 < *itr2) {
Iterator j = k;
while (!(*itr1 < *j))
++j;
iter_swap(itr1, j);
++itr1;
++j;
itr2 = k;
rotate(itr1, j, last);
while (last != j) {
++j;
++itr2;
}
rotate(k, itr2, last);
return true;
}
}
rotate(first, k, last);
return false;
}
inline double get_time_sec(void) {
return static_cast<double>(chrono::duration_cast<chrono::nanoseconds>(
chrono::steady_clock::now().time_since_epoch())
.count()) /
1000000000;
}
template <typename T> T gcd(T a, T b) {
if (a > b)
swap(a, b);
if (a == 0)
return b;
else
return gcd(b % a, a);
}
template <typename T> map<T, T> prime_list(T n) {
map<T, T> ret;
for (T i = 2; i * i <= n; i++) {
if (n % i == 0) {
ret[i] = 0;
while (n % i == 0) {
n /= i;
ret[i]++;
}
}
}
if (n != 1)
ret[n]++;
return ret;
}
int main(void) {
int n;
cin >> n;
VI vp(n, 0);
REP(i, n) cin >> vp[i];
VI vc(vp);
sort(vc.begin(), vc.end());
if (vp == vc) {
cout << "Yes" << endl;
return 0;
}
REP(i, n) {
REP(j, n) {
if (i < j)
continue;
VI vi(vp);
swap(vi[i], vi[j]);
if (vc == vi) {
cout << "Yes" << endl;
return 0;
}
}
}
cout << "No" << endl;
} | #include "bits/stdc++.h"
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef vector<PII> VPII;
typedef long long LL;
typedef priority_queue<int> PQ_DESC;
typedef priority_queue<int, vector<int>, greater<int>> PQ_ASC;
typedef priority_queue<PII> PQ_DESC_PII;
typedef priority_queue<PII, vector<PII>, greater<PII>> PQ_ASC_PII;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
typedef vector<VVLL> VVVLL;
#define SORT_ASC(c) sort((c).begin(), (c).end())
#define SORT_DESC(c) \
sort((c).begin(), (c).end(), greater<typeof((c).begin())>())
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define SIZE(a) int((a).size())
const double EPS = 1e-10;
const double PI = acos(-1.0);
const int INT_LARGE = 1000000100;
// debug func
template <typename T> void vecprint(vector<T> v) {
for (auto x : v) {
cerr << x << " ";
}
cerr << endl;
}
template <typename T> void vecvecprint(vector<vector<T>> vv) {
REP(i, SIZE(vv)) {
REP(j, SIZE(vv[i])) { cerr << vv[i][j] << " "; }
cerr << endl;
}
}
template <typename T> void pqprint(priority_queue<T> q) {
while (!q.empty()) {
cerr << q.top() << " ";
q.pop();
}
cerr << endl;
}
template <typename T> void qprint(queue<T> q) {
while (!q.empty()) {
cerr << q.front() << " ";
q.pop();
}
cerr << endl;
}
template <typename T> void vecqprint(vector<queue<T>> v) {
for (int i = 0; i < v.size(); i++) {
qprint(v[i]);
}
}
template <typename Iterator>
inline bool next_combination(const Iterator first, Iterator k,
const Iterator last) {
/* Credits: Thomas Draper */
if ((first == last) || (first == k) || (last == k))
return false;
Iterator itr1 = first;
Iterator itr2 = last;
++itr1;
if (last == itr1)
return false;
itr1 = last;
--itr1;
itr1 = k;
--itr2;
while (first != itr1) {
if (*--itr1 < *itr2) {
Iterator j = k;
while (!(*itr1 < *j))
++j;
iter_swap(itr1, j);
++itr1;
++j;
itr2 = k;
rotate(itr1, j, last);
while (last != j) {
++j;
++itr2;
}
rotate(k, itr2, last);
return true;
}
}
rotate(first, k, last);
return false;
}
inline double get_time_sec(void) {
return static_cast<double>(chrono::duration_cast<chrono::nanoseconds>(
chrono::steady_clock::now().time_since_epoch())
.count()) /
1000000000;
}
template <typename T> T gcd(T a, T b) {
if (a > b)
swap(a, b);
if (a == 0)
return b;
else
return gcd(b % a, a);
}
template <typename T> map<T, T> prime_list(T n) {
map<T, T> ret;
for (T i = 2; i * i <= n; i++) {
if (n % i == 0) {
ret[i] = 0;
while (n % i == 0) {
n /= i;
ret[i]++;
}
}
}
if (n != 1)
ret[n]++;
return ret;
}
int main(void) {
int n;
cin >> n;
VI vp(n, 0);
REP(i, n) cin >> vp[i];
VI vc(vp);
sort(vc.begin(), vc.end());
if (vp == vc) {
cout << "YES" << endl;
return 0;
}
REP(i, n) {
REP(j, n) {
if (i < j)
continue;
VI vi(vp);
swap(vi[i], vi[j]);
if (vc == vi) {
cout << "YES" << endl;
return 0;
}
}
}
cout << "NO" << endl;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 764,118 | 764,119 | u637983859 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> p(n);
int cnt = 0;
for (int i = 0; i < n; ++i) {
cin >> p[i];
if (p[i] != i + 1)
++cnt;
}
if (cnt <= 2)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> p(n);
int cnt = 0;
for (int i = 0; i < n; ++i) {
cin >> p[i];
if (p[i] != i + 1)
++cnt;
}
if (cnt <= 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 764,120 | 764,121 | u561007032 | cpp |
p02958 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> p(N);
for (int i = 0; i < N; i++) {
cin >> p[i];
}
int cnt = 0;
for (int i = 0; i < N; i++) {
if (i + 1 != p[i])
cnt++;
}
if (cnt > 2)
cout << "No" << endl;
else
cout << "Yes" << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> p(N);
for (int i = 0; i < N; i++) {
cin >> p[i];
}
int cnt = 0;
for (int i = 0; i < N; i++) {
if (i + 1 != p[i])
cnt++;
}
if (cnt > 2)
cout << "NO" << endl;
else
cout << "YES" << endl;
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 764,125 | 764,126 | u813559924 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.