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 |
|---|---|---|---|---|---|---|---|
p02957 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define ld long double
#define show(x) cout << x << '\n'
#define showh(x) cout << x << ' '
#define go(i, a, n) for (ll i = a; i < n; i++)
#define gor(i, a, n) for (ll i = n - 1; i >= a; i--)
#define pb push_back
#define mp make_pair
#define mod 1000000007
bool prime[100001];
ll pre[2001][2001];
bool ispoweroftwo(ll x) { return x && !(x & (x - 1)); }
ll xorcal(ll n) {
if (n % 4 == 0)
return n;
if (n % 4 == 1)
return 1;
if (n % 4 == 2)
return n + 1;
if (n % 4 == 3)
return 0;
}
void sieve(ll n) {
memset(prime, true, sizeof(prime));
prime[0] = false;
prime[1] = false;
for (ll i = 2; i * i <= n; i++) {
if (prime[i] == true) {
for (ll j = i * i; j <= n; j += i) {
prime[j] = false;
}
}
}
}
bool isprime(ll n) {
if (n <= 1)
return false;
if (n <= 3)
return true;
if (n % 2 == 0 or n % 3 == 0)
return false;
for (ll i = 5; i * i <= n; i += 6) {
if (n % i == 0 or n % (i + 2) == 0)
return false;
}
return true;
}
ll modinverse(ll a, ll m) {
ll m0 = m;
ll y = 0, x = 1;
if (m == 1)
return 0;
while (a > 1) {
ll q = a / m;
ll t = m;
m = a % m;
a = t;
t = y;
y = x - q * y;
x = t;
}
if (x < 0)
x += m0;
return x;
}
ll gcd(ll a, ll b) {
if (a == 0) {
return b;
}
return (b % a, a);
}
ll power(ll A, ll B) {
if (A == 0)
return 0;
if (B == 0)
return 1;
ll y;
if (B % 2 == 0) {
y = power(A, B / 2);
y = (y * y) % mod;
}
else {
y = A % mod;
y = (y * power(A, B - 1) % mod) % mod;
}
return (ll)((y + mod) % mod);
}
ll fib(ll n) {
if (n <= 1) {
return n;
}
return fib(n - 1) + fib(n - 2);
}
void ncr() {
pre[0][0] = 1;
go(i, 1, 2001) {
pre[i][0] = 1;
go(j, 1, 2001) { pre[i][j] = pre[i - 1][j] + pre[i - 1][j - 1]; }
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll a, b;
cin >> a >> b;
ll ans = (a + b);
if (ans & 1)
show("impossible");
else
show((ans >> 1));
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define ld long double
#define show(x) cout << x << '\n'
#define showh(x) cout << x << ' '
#define go(i, a, n) for (ll i = a; i < n; i++)
#define gor(i, a, n) for (ll i = n - 1; i >= a; i--)
#define pb push_back
#define mp make_pair
#define mod 1000000007
bool prime[100001];
ll pre[2001][2001];
bool ispoweroftwo(ll x) { return x && !(x & (x - 1)); }
ll xorcal(ll n) {
if (n % 4 == 0)
return n;
if (n % 4 == 1)
return 1;
if (n % 4 == 2)
return n + 1;
if (n % 4 == 3)
return 0;
}
void sieve(ll n) {
memset(prime, true, sizeof(prime));
prime[0] = false;
prime[1] = false;
for (ll i = 2; i * i <= n; i++) {
if (prime[i] == true) {
for (ll j = i * i; j <= n; j += i) {
prime[j] = false;
}
}
}
}
bool isprime(ll n) {
if (n <= 1)
return false;
if (n <= 3)
return true;
if (n % 2 == 0 or n % 3 == 0)
return false;
for (ll i = 5; i * i <= n; i += 6) {
if (n % i == 0 or n % (i + 2) == 0)
return false;
}
return true;
}
ll modinverse(ll a, ll m) {
ll m0 = m;
ll y = 0, x = 1;
if (m == 1)
return 0;
while (a > 1) {
ll q = a / m;
ll t = m;
m = a % m;
a = t;
t = y;
y = x - q * y;
x = t;
}
if (x < 0)
x += m0;
return x;
}
ll gcd(ll a, ll b) {
if (a == 0) {
return b;
}
return (b % a, a);
}
ll power(ll A, ll B) {
if (A == 0)
return 0;
if (B == 0)
return 1;
ll y;
if (B % 2 == 0) {
y = power(A, B / 2);
y = (y * y) % mod;
}
else {
y = A % mod;
y = (y * power(A, B - 1) % mod) % mod;
}
return (ll)((y + mod) % mod);
}
ll fib(ll n) {
if (n <= 1) {
return n;
}
return fib(n - 1) + fib(n - 2);
}
void ncr() {
pre[0][0] = 1;
go(i, 1, 2001) {
pre[i][0] = 1;
go(j, 1, 2001) { pre[i][j] = pre[i - 1][j] + pre[i - 1][j - 1]; }
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll a, b;
cin >> a >> b;
ll ans = (a + b);
if (ans & 1)
show("IMPOSSIBLE");
else
show((ans >> 1));
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change"
] | 762,663 | 762,664 | u555125997 | cpp |
p02957 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = int(1e8) + 7;
void init() {}
void solve() {
ll a, b;
scanf("%lld &lld", &a, &b);
if ((a + b) % 2 == 0)
printf("%lld\n", (a + b) / 2);
else
printf("IMPOSSIBLE\n");
}
const bool mtc = false;
int main() {
int t;
if (mtc) {
scanf("%d", &t);
while (t--)
solve();
} else
solve();
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = int(1e8) + 7;
void init() {}
void solve() {
ll a, b;
scanf("%lld %lld", &a, &b);
if ((a + b) % 2 == 0)
printf("%lld\n", (ll)((a + b) / 2));
else
printf("IMPOSSIBLE\n");
}
const bool mtc = false;
int main() {
int t;
if (mtc) {
scanf("%d", &t);
while (t--)
solve();
} else
solve();
}
| [
"literal.string.change",
"call.arguments.change",
"call.add"
] | 762,679 | 762,680 | u800645121 | cpp |
p02957 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b;
cin >> a >> b;
if ((a - b) % 2 == 1) {
cout << "IMPOSSIBLE" << endl;
} else {
cout << (a + b) / 2 << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b;
cin >> a >> b;
if ((a + b) % 2 == 1) {
cout << "IMPOSSIBLE" << endl;
} else {
cout << (a + b) / 2 << endl;
}
}
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 762,681 | 762,682 | u952865396 | cpp |
p02957 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if ((a - b) % 2 == 1) {
cout << "IMPOSSIBLE" << endl;
} else {
cout << (a + b) / 2 << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b;
cin >> a >> b;
if ((a + b) % 2 == 1) {
cout << "IMPOSSIBLE" << endl;
} else {
cout << (a + b) / 2 << endl;
}
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 762,683 | 762,682 | u952865396 | cpp |
p02957 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
ll a, b;
int main() {
cin >> a >> b;
if (a > b)
swap(a, b);
if ((b - a) % 2 == 1)
cout << "IMPOSSIBLE";
else
cout << (b - a) / 2;
return 0;
}
| #include <bits/stdc++.h>
#define ll long long
using namespace std;
ll a, b;
int main() {
cin >> a >> b;
if (a > b)
swap(a, b);
if ((b - a) % 2 == 1)
cout << "IMPOSSIBLE";
else
cout << a + (b - a) / 2;
return 0;
}
| [
"expression.operation.binary.add"
] | 762,688 | 762,689 | u905164447 | cpp |
p02957 | #include <bits/stdc++.h>
using namespace std;
#define int long long
int32_t main() {
int a, b;
cin >> a >> b;
if (abs(b - a) % 2 == 0) {
cout << (max(a, b) - min(a, b)) / 2 << endl;
} else
cout << "IMPOSSIBLE" << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
int32_t main() {
int a, b;
cin >> a >> b;
if (abs(b - a) % 2 == 0) {
cout << (max(a, b) + min(a, b)) / 2 << endl;
} else
cout << "IMPOSSIBLE" << endl;
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 762,708 | 762,709 | u554964974 | cpp |
p02958 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int p[n];
for (int i = 0; i < n; i++) {
cin >> p[i];
}
int k = 0;
for (int i = 0; i < n; i++) {
if (p[i] != i + 1)
k++;
}
if (k <= 2)
cout << "Yes\n";
else
cout << "No\n";
} | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int p[n];
for (int i = 0; i < n; i++) {
cin >> p[i];
}
int k = 0;
for (int i = 0; i < n; i++) {
if (p[i] != i + 1)
k++;
}
if (k <= 2)
cout << "YES\n";
else
cout << "NO\n";
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 762,722 | 762,723 | u205280593 | cpp |
p02958 | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
using namespace std;
int main() {
int N;
cin >> N;
// 入力を入れるvector
vector<int> P(N);
rep(i, N) { cin >> P[i]; }
// 昇順の数列を入れるvector
vector<int> Q(N);
rep(i, N) { Q[i] = i + 1; }
// PとRの要素が同じかどうかを判断するboolを入れるvector
vector<bool> R(N);
rep(i, N) {
if (P[i] != Q[i])
R[i] = true;
else
R[i] = false;
}
// 異なっている箇所が2箇所以下であればOK
int sums;
rep(i, N) { sums += R[i]; }
if (sums <= 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
} | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
using namespace std;
int main() {
int N;
cin >> N;
// 入力を入れるvector
vector<int> P(N);
rep(i, N) { cin >> P[i]; }
// 昇順の数列を入れるvector
vector<int> Q(N);
rep(i, N) { Q[i] = i + 1; }
// PとRの要素が同じかどうかを判断するboolを入れるvector
vector<bool> R(N);
rep(i, N) {
if (P[i] != Q[i])
R[i] = true;
else
R[i] = false;
}
// 異なっている箇所が2箇所以下であればOK
int sums = 0;
rep(i, N) { sums += R[i]; }
if (sums <= 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
} | [
"variable_declaration.value.change"
] | 762,724 | 762,725 | u805392425 | cpp |
p02958 | #include <iostream>
#include <string>
using namespace std;
int main() {
int n, perm, ans = 0;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> perm;
if (perm != i) {
ans++;
}
}
if (ans < 3) {
cout << "Yes";
} else {
cout << "No";
}
return 0;
}
| #include <iostream>
#include <string>
using namespace std;
int main() {
int n, perm, ans = 0;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> perm;
if (perm != i) {
ans++;
}
}
if (ans < 3) {
cout << "YES";
} else {
cout << "NO";
}
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 762,737 | 762,738 | u529371621 | cpp |
p02958 | #include <iostream>
#include <string>
using namespace std;
int main() {
int n, perm, ans = 0;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> perm;
if (perm != 1) {
ans++;
}
}
if (ans < 3) {
cout << "Yes";
} else {
cout << "No";
}
return 0;
}
| #include <iostream>
#include <string>
using namespace std;
int main() {
int n, perm, ans = 0;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> perm;
if (perm != i) {
ans++;
}
}
if (ans < 3) {
cout << "YES";
} else {
cout << "NO";
}
return 0;
}
| [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 762,739 | 762,738 | u529371621 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
using P = pair<int, int>;
int main() {
int n, cnt = 0;
cin >> n;
vector<int> p(n), a(n);
rep(i, n) cin >> p[i];
for (int i = 1; i <= n; i++)
a[i - 1] = i;
rep(i, n) {
if (p[i] != a[i])
cnt++;
}
if (cnt == 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
using P = pair<int, int>;
int main() {
int n, cnt = 0;
cin >> n;
vector<int> p(n), a(n);
rep(i, n) cin >> p[i];
for (int i = 1; i <= n; i++)
a[i - 1] = i;
rep(i, n) {
if (p[i] != a[i])
cnt++;
}
if (cnt == 2 || cnt == 0)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
| [
"control_flow.branch.if.condition.change"
] | 762,746 | 762,747 | u681323954 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
int main() {
int n;
cin >> n;
int p[55];
rep(i, n) cin >> p[i];
int cnt = 0; //次に格納されている数が+1になってない回数
for (int i = 1; i < n; i++) {
if (p[i] - p[i - 1] != 1) {
cnt++;
}
}
if (cnt == 2 || cnt == 0) {
cout << "YES" << endl;
}
else {
cout << "NO" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
int main() {
int n;
cin >> n;
int p[55];
rep(i, n) cin >> p[i];
int cnt = 0; //次に格納されている数が+1になってない回数
for (int i = 0; i < n; i++) {
if (p[i] - i != 1) {
cnt++;
}
}
if (cnt == 2 || cnt == 0) {
cout << "YES" << endl;
}
else {
cout << "NO" << endl;
}
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.loop.for.condition.change"
] | 762,754 | 762,755 | u096030913 | cpp |
p02958 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using namespace std;
int main() {
int n;
cin >> n;
int p[n + 1];
int count = 0;
for (int i = 1; i <= n; i++) {
cin >> p[i];
if (p[i] != i) {
count++;
}
}
if (count <= 2) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using namespace std;
int main() {
int n;
cin >> n;
int p[n + 1];
int count = 0;
for (int i = 1; i <= n; i++) {
cin >> p[i];
if (p[i] != i) {
count++;
}
}
if (count <= 2) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 762,763 | 762,764 | u789673498 | cpp |
p02958 | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll N, c;
cin >> N;
vector<ll> vec(N);
for (ll i = 0; i < N; ++i)
cin >> vec[i];
const vector<ll> convec(vec);
sort(vec.begin(), vec.end());
ll diff = 0;
for (ll i = 0; i < N; ++i)
if (convec[i] != vec[i])
diff++;
if (diff < 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
} | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll N, c;
cin >> N;
vector<ll> vec(N);
for (ll i = 0; i < N; ++i)
cin >> vec[i];
const vector<ll> convec(vec);
sort(vec.begin(), vec.end());
ll diff = 0;
for (ll i = 0; i < N; ++i)
if (convec[i] != vec[i])
diff++;
if (diff <= 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 762,767 | 762,768 | u894339989 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(100);
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
int cnt = 0;
for (int i = 1; i <= n; i++) {
if (i != a[i])
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;
vector<int> a(n + 1);
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
int cnt = 0;
for (int i = 1; i <= n; i++) {
if (i != a[i])
cnt++;
}
if (cnt == 2 || cnt == 0)
cout << "YES" << endl;
else
cout << "NO" << endl;
} | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 762,771 | 762,772 | u587622858 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
int cnt = 0;
for (int i = 1; i <= n; i++) {
if (i != a[i])
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;
vector<int> a(n + 1);
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
int cnt = 0;
for (int i = 1; i <= n; i++) {
if (i != a[i])
cnt++;
}
if (cnt == 2 || cnt == 0)
cout << "YES" << endl;
else
cout << "NO" << endl;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 762,773 | 762,772 | u587622858 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
int cnt = 0;
for (int i = 1; i <= n; i++) {
if (i != a[i])
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;
vector<int> a(n + 1);
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
int cnt = 0;
for (int i = 1; i <= n; i++) {
if (i != a[i])
cnt++;
}
if (cnt == 2 || cnt == 0)
cout << "YES" << endl;
else
cout << "NO" << endl;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 762,774 | 762,772 | u587622858 | cpp |
p02958 | // Author: Fuadul Hasan(fuadul202@gmail.com)
// BSMRSTU,Gopalganj
#include <bits/stdc++.h>
using namespace std;
int tc = 1;
#define happy ios::sync_with_stdio(false);
#define coding cin.tie(0);
#define F first
#define S second
#define mp make_pair
#define ll long long
#define Pi atan(1) * 4
#define pb push_back
#define vpr vector<pr>
#define pr pair<int, int>
#define vi std::vector<int>
#define vll std::vector<ll>
#define YES printf("YES\n");
#define NO printf("NO\n");
#define Yes printf("Yes\n");
#define No printf("No\n");
#define all(n) n.begin(), n.end()
#define point(x) setprecision(x)
#define Test printf("Case %d: ", tc++);
#define Unique(c) (c).resize(unique(all(c)) - (c).begin())
#define vout(v) \
for (auto z : v) \
cout << z << " "; \
cout << endl;
#define error(args...) \
{ \
vector<string> _v = split(#args, ','); \
err(_v.begin(), args); \
cout << endl; \
}
vector<string> split(const string &s, char c) {
vector<string> v;
stringstream ss(s);
string x;
while (getline(ss, x, c))
v.emplace_back(x);
return move(v);
}
void err(vector<string>::iterator it) {}
template <typename T, typename... Args>
void err(vector<string>::iterator it, T a, Args... args) {
cout << it->substr((*it)[0] == ' ', it->length()) << " = " << a << " ";
err(++it, args...);
}
const int M = 1e9 + 7;
const ll Inf = (ll)2e18 + 5;
const int N = 2e5 + 5;
ll vis[N], res[N];
int solve() {
// happy coding
int n;
cin >> n;
int a[n], b[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
b[i] = a[i];
}
sort(a, a + n);
int cnt = 0;
for (int i = 0; i < n; i++) {
if (b[i] != a[i]) {
cnt++;
}
}
if (cnt == 2) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
}
int main() {
int test = 1;
// scanf("%d", &test);
while (test--)
solve();
return 0;
} | // Author: Fuadul Hasan(fuadul202@gmail.com)
// BSMRSTU,Gopalganj
#include <bits/stdc++.h>
using namespace std;
int tc = 1;
#define happy ios::sync_with_stdio(false);
#define coding cin.tie(0);
#define F first
#define S second
#define mp make_pair
#define ll long long
#define Pi atan(1) * 4
#define pb push_back
#define vpr vector<pr>
#define pr pair<int, int>
#define vi std::vector<int>
#define vll std::vector<ll>
#define YES printf("YES\n");
#define NO printf("NO\n");
#define Yes printf("Yes\n");
#define No printf("No\n");
#define all(n) n.begin(), n.end()
#define point(x) setprecision(x)
#define Test printf("Case %d: ", tc++);
#define Unique(c) (c).resize(unique(all(c)) - (c).begin())
#define vout(v) \
for (auto z : v) \
cout << z << " "; \
cout << endl;
#define error(args...) \
{ \
vector<string> _v = split(#args, ','); \
err(_v.begin(), args); \
cout << endl; \
}
vector<string> split(const string &s, char c) {
vector<string> v;
stringstream ss(s);
string x;
while (getline(ss, x, c))
v.emplace_back(x);
return move(v);
}
void err(vector<string>::iterator it) {}
template <typename T, typename... Args>
void err(vector<string>::iterator it, T a, Args... args) {
cout << it->substr((*it)[0] == ' ', it->length()) << " = " << a << " ";
err(++it, args...);
}
const int M = 1e9 + 7;
const ll Inf = (ll)2e18 + 5;
const int N = 2e5 + 5;
ll vis[N], res[N];
int solve() {
// happy coding
int n;
cin >> n;
int a[n], b[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
b[i] = a[i];
}
sort(a, a + n);
int cnt = 0;
for (int i = 0; i < n; i++) {
if (b[i] != a[i]) {
cnt++;
}
}
if (cnt == 2 || cnt == 0) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
}
int main() {
int test = 1;
// scanf("%d", &test);
while (test--)
solve();
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 762,777 | 762,778 | u526278960 | 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.at(i);
int cnt = 0;
rep(i, n) {
if (p.at(i) != n - i)
cnt++;
}
if (cnt == 2 || cnt == 0)
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> 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 || cnt == 0)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
}
| [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 762,791 | 762,792 | u442855610 | 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.at(i);
int cnt = 0;
rep(i, n) {
if (p.at(i) == n - i)
cnt++;
}
if (cnt == 2 || cnt == 0)
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> 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 || cnt == 0)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 762,793 | 762,792 | u442855610 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, p, i, c = 0;
cin >> n;
for (i = 1; i <= n; i++) {
cin >> p;
if (p != i)
c++;
}
if (c <= 2)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, p, i, c = 0;
cin >> n;
for (i = 1; i <= n; i++) {
cin >> p;
if (p != i)
c++;
}
if (c <= 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 762,794 | 762,795 | u114407770 | cpp |
p02958 | #include <iostream>
#include <vector>
using namespace std;
int main() {
long long N;
cin >> N;
vector<long long> b(N);
long long cnt = 0;
for (int i = 0; i < N; i++) {
cin >> b[i];
if (b[i] != i + 1)
cnt++;
}
if (cnt == 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
} | #include <iostream>
#include <vector>
using namespace std;
int main() {
long long N;
cin >> N;
vector<long long> b(N);
long long cnt = 0;
for (int i = 0; i < N; i++) {
cin >> b[i];
if (b[i] != i + 1)
cnt++;
}
if (cnt == 2 || cnt == 0)
cout << "YES" << endl;
else
cout << "NO" << endl;
} | [
"control_flow.branch.if.condition.change"
] | 762,809 | 762,810 | u503221936 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
long long int n, i, a[60], x;
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n;
for (i = 1; i < n + 1; i++)
cin >> a[i];
x = 0;
for (i = 1; i < n + 1; i++)
if (a[i] == n - i + 1)
x++;
if (x == n || x == n - 2)
cout << "YES";
else
cout << "NO";
}
| #include <bits/stdc++.h>
using namespace std;
long long int n, i, a[60], x;
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n;
for (i = 1; i < n + 1; i++)
cin >> a[i];
x = 0;
for (i = 1; i < n + 1; i++)
if (a[i] == i)
x++;
if (x == n || x == n - 2)
cout << "YES";
else
cout << "NO";
}
| [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 762,811 | 762,812 | u657815739 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; i++)
cin >> p.at(i);
int ans = 0;
for (int i = 0; i < n; i++) {
if (p.at(i) != i + 1)
ans++;
}
if (ans == 0 || ans == 2)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; i++)
cin >> p.at(i);
int ans = 0;
for (int i = 0; i < n; i++) {
if (p.at(i) != i + 1)
ans++;
}
if (ans == 0 || ans == 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 762,813 | 762,814 | u582684800 | cpp |
p02958 | //#include<bits/stdc++.h>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef double db;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef vector<pair<int, int>> vii;
const double pi = 2 * acos(0);
#define pf printf
#define sf scanf
#define pb(a) push_back(a)
#define mp make_pair
#define fi first
#define se second
#define for0(i, n) for (int i = 0; i < n; i++)
#define for1(i, n) for (int i = 1; i <= n; i++)
#define forab(i, a, b) for (int i = a; i <= b; i++)
#define lcm(a, b) ((a) * ((b) / gcd(a, b)))
#define sq(a) (a) * (a)
#define nw "\n"
#define abs(x) fabs(x)
#define pcase(z, x) cout << "Case " << z << ": " << x << "\n"
int main() {
int n, x, c = 0;
cin >> n;
for1(i, n) {
cin >> x;
if (x != i)
c++;
}
pf(c <= 2 ? "Yes" : "No");
return 0;
} | //#include<bits/stdc++.h>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef double db;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef vector<pair<int, int>> vii;
const double pi = 2 * acos(0);
#define pf printf
#define sf scanf
#define pb(a) push_back(a)
#define mp make_pair
#define fi first
#define se second
#define for0(i, n) for (int i = 0; i < n; i++)
#define for1(i, n) for (int i = 1; i <= n; i++)
#define forab(i, a, b) for (int i = a; i <= b; i++)
#define lcm(a, b) ((a) * ((b) / gcd(a, b)))
#define sq(a) (a) * (a)
#define nw "\n"
#define abs(x) fabs(x)
#define pcase(z, x) cout << "Case " << z << ": " << x << "\n"
int main() {
int n, x, c = 0;
cin >> n;
for1(i, n) {
cin >> x;
if (x != i)
c++;
}
pf(c <= 2 ? "YES" : "NO");
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change"
] | 762,819 | 762,820 | u339430228 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int p[N];
for (int i = 0; i < N; i++)
cin >> p[i];
int count = 0;
for (int i = 0; i < N; i++) {
if (p[i] != i + 1)
count++;
}
if (count <= 2) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int p[N];
for (int i = 0; i < N; i++)
cin >> p[i];
int count = 0;
for (int i = 0; i < N; i++) {
if (p[i] != i + 1)
count++;
}
if (count <= 2) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} | [] | 762,823 | 762,824 | u538808095 | 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>;
int main() {
int n;
cin >> n;
vector<int> p(n + 1);
rep(i, n) { cin >> p[i + 1]; }
int k;
k = 1;
rep(i, n) {
if (p[i + 1] != i + 1) {
if (k == 1 and p[p[i + 1]] == i + 1) {
k = 0;
swap(p[p[i + 1]], p[i + 1]);
} else {
k = 2;
break;
}
}
}
if (k == 2) {
cout << "No" << endl;
} else {
cout << "Yes" << 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>;
int main() {
int n;
cin >> n;
vector<int> p(n + 1);
rep(i, n) { cin >> p[i + 1]; }
int k;
k = 1;
rep(i, n) {
if (p[i + 1] != i + 1) {
if (k == 1 and p[p[i + 1]] == i + 1) {
k = 0;
swap(p[p[i + 1]], p[i + 1]);
} else {
k = 2;
break;
}
}
}
if (k == 2) {
cout << "NO" << endl;
} else {
cout << "YES" << endl;
}
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 762,828 | 762,829 | u992471673 | cpp |
p02958 | /*
* Author Name: Sourab Hossain
* Email: cpsourab@gmail.com
*/
#include <bits/stdc++.h>
using namespace std;
#define PI acos(-1)
#define DEGREE(radian) (radian * (180 / PI))
#define RADIAN(degree) ((degree * PI) / 180)
int dr[] = {+0, +0, +1, -1, -1, +1, -1, +1};
int dc[] = {-1, +1, +0, +0, +1, +1, -1, -1};
int main(int argc, char const *argv[]) {
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
// ios_base::sync_with_stdio(false);
// cin.tie(NULL);
// cout.tie(NULL);
int n;
scanf("%d", &n);
int data, cnt = 0;
for (int i = 0; i < n; i++) {
scanf("%d", &data);
if (data != i + 1) {
cnt++;
}
}
if (cnt < 2) {
puts("YES");
} else {
puts("NO");
}
return 0;
} | /*
* Author Name: Sourab Hossain
* Email: cpsourab@gmail.com
*/
#include <bits/stdc++.h>
using namespace std;
#define PI acos(-1)
#define DEGREE(radian) (radian * (180 / PI))
#define RADIAN(degree) ((degree * PI) / 180)
int dr[] = {+0, +0, +1, -1, -1, +1, -1, +1};
int dc[] = {-1, +1, +0, +0, +1, +1, -1, -1};
int main(int argc, char const *argv[]) {
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
// ios_base::sync_with_stdio(false);
// cin.tie(NULL);
// cout.tie(NULL);
int n;
scanf("%d", &n);
int data, cnt = 0;
for (int i = 0; i < n; i++) {
scanf("%d", &data);
if (data != i + 1) {
cnt++;
}
}
if (cnt < 3) {
puts("YES");
} else {
puts("NO");
}
return 0;
} | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 762,834 | 762,835 | u906625692 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
vector<int> b(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
b.at(i) = a.at(i);
}
sort(b.begin(), b.end());
int count = 0;
for (int i = 0; i < n; i++) {
if (a.at(i) != b.at(i))
count += 1;
else
count += 0;
}
if (count < 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
vector<int> b(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
b.at(i) = a.at(i);
}
sort(b.begin(), b.end());
int count = 0;
for (int i = 0; i < n; i++) {
if (a.at(i) != b.at(i))
count += 1;
else
count += 0;
}
if (count <= 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 762,836 | 762,837 | u436660228 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
vector<int> b(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
b.at(i) = a.at(i);
}
sort(b.begin(), b.end());
int count = 0;
for (int i = 0; i < n; i++) {
if (a.at(i) != b.at(i))
count += 1;
else
count += 0;
}
if (count < 2)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
vector<int> b(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
b.at(i) = a.at(i);
}
sort(b.begin(), b.end());
int count = 0;
for (int i = 0; i < n; i++) {
if (a.at(i) != b.at(i))
count += 1;
else
count += 0;
}
if (count <= 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 762,838 | 762,837 | u436660228 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define fr(i, n) for (int i = 0; i < (n); ++i)
#define Fr(i, n) for (int i = 1; i <= (n); ++i)
#define ifr(i, n) for (int i = (n)-1; i >= 0; --i)
#define iFr(i, n) for (int i = (n); i > 0; --i)
int main(void) {
int n;
cin >> n;
vector<int> p(n), q(n);
fr(i, n) {
int a;
p[i] = q[i] = a;
}
sort(q.begin(), q.end());
int c = 0;
fr(i, n) if (p[i] != q[i]) c++;
cout << (c <= 2 ? "YES" : "NO") << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define fr(i, n) for (int i = 0; i < (n); ++i)
#define Fr(i, n) for (int i = 1; i <= (n); ++i)
#define ifr(i, n) for (int i = (n)-1; i >= 0; --i)
#define iFr(i, n) for (int i = (n); i > 0; --i)
int main(void) {
int n;
cin >> n;
vector<int> p(n), q(n);
fr(i, n) {
int a;
cin >> a;
p[i] = q[i] = a;
}
sort(q.begin(), q.end());
int c = 0;
fr(i, n) if (p[i] != q[i]) c++;
cout << (c <= 2 ? "YES" : "NO") << endl;
return 0;
} | [] | 762,839 | 762,840 | u534417782 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define contains(v, t) (find(v.begin(), v.end(), t) != v.end())
#define MOD 1000000007
using ll = long long;
using ull = unsigned long long;
int main() {
int n;
cin >> n;
int cond = 0;
rep(i, n) {
int p;
cin >> p;
cond += (int)(i + 1 < p);
};
if (cond > 2)
cout << "NO";
else
cout << "YES";
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define contains(v, t) (find(v.begin(), v.end(), t) != v.end())
#define MOD 1000000007
using ll = long long;
using ull = unsigned long long;
int main() {
int n;
cin >> n;
int cond = 0;
rep(i, n) {
int p;
cin >> p;
cond += (int)(i + 1 != p);
};
if (cond > 2)
cout << "NO";
else
cout << "YES";
}
| [
"expression.operator.compare.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 762,850 | 762,851 | u459025138 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, nu = 0;
cin >> n;
vector<int> d(n);
for (int i = 0; i < n; i++) {
cin >> d[i];
}
for (int i = 0; i < n; i++) {
if (d[i] > d[i + 1]) {
nu++;
}
}
if (nu > 2) {
cout << "NO" << endl;
} else {
cout << "YES" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, nu = 0;
cin >> n;
vector<int> d(n);
for (int i = 0; i < n; i++) {
cin >> d[i];
}
for (int i = 0; i < n; i++) {
if (d[i] != i + 1) {
nu++;
}
}
if (nu > 2) {
cout << "NO" << endl;
} else {
cout << "YES" << endl;
}
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 762,860 | 762,861 | u834753207 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, nu = 0;
cin >> n;
vector<int> d(n);
for (int i = 0; i < n; i++) {
cin >> d[i];
}
for (int i = 0; i < n; i++) {
if (d[i] > d[i + 1]) {
nu++;
}
}
if (nu > 2) {
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, nu = 0;
cin >> n;
vector<int> d(n);
for (int i = 0; i < n; i++) {
cin >> d[i];
}
for (int i = 0; i < n; i++) {
if (d[i] != i + 1) {
nu++;
}
}
if (nu > 2) {
cout << "NO" << endl;
} else {
cout << "YES" << endl;
}
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 762,862 | 762,861 | u834753207 | cpp |
p02958 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <string>
#include <unordered_map>
#include <vector>
#define ll long long int
#define REP(i, n) for (int i = 0; i < n; i++)
#define v(T, n) vector<T> n
using namespace std;
const ll MOD = 1000000007;
const ll MAX = 65565;
ll fac[MAX], finv[MAX], inv[MAX];
using Graph = vector<vector<int>>;
/*
// BFS のためのデータ構造
vector<int> dist(N, -1); // 全頂点を「未訪問」に初期化
queue<int> que;
// 初期条件 (頂点 0 を初期ノードとする)
dist[0] = 0;
que.push(0); // 0 を橙色頂点にする
// BFS 開始 (キューが空になるまで探索を行う)
while (!que.empty()) {
int v = que.front(); // キューから先頭頂点を取り出す
que.pop();
// v から辿れる頂点をすべて調べる
for (int nv : G[v]) {
if (dist[nv] != -1) continue; // すでに発見済みの頂点は探索しない
// 新たな白色頂点 nv について距離情報を更新してキューに追加する
dist[nv] = dist[v] + 1;
que.push(nv);
}
}
*/
ll modpow(ll a, ll n) { //二分累乗法 a^n
ll ret = 1;
while (n > 0) {
if (n & 1)
ret = ret * a % MOD;
a = a * a % MOD;
n >>= 1;
}
return ret;
}
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
ll COM(int n, int k) { // nCk
// use COMinit() before use this.
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
void Main() {
int N;
cin >> N;
int p[N];
int ans = 0;
REP(i, N) {
cin >> p[i];
if (i + 1 != p[i]) {
ans++;
}
}
if (ans > 2) {
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
}
int main() {
std::cin.tie(nullptr);
std::ios_base::sync_with_stdio(false);
std::cout << std::fixed << std::setprecision(15);
COMinit();
Main();
} | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <string>
#include <unordered_map>
#include <vector>
#define ll long long int
#define REP(i, n) for (int i = 0; i < n; i++)
#define v(T, n) vector<T> n
using namespace std;
const ll MOD = 1000000007;
const ll MAX = 65565;
ll fac[MAX], finv[MAX], inv[MAX];
using Graph = vector<vector<int>>;
/*
// BFS のためのデータ構造
vector<int> dist(N, -1); // 全頂点を「未訪問」に初期化
queue<int> que;
// 初期条件 (頂点 0 を初期ノードとする)
dist[0] = 0;
que.push(0); // 0 を橙色頂点にする
// BFS 開始 (キューが空になるまで探索を行う)
while (!que.empty()) {
int v = que.front(); // キューから先頭頂点を取り出す
que.pop();
// v から辿れる頂点をすべて調べる
for (int nv : G[v]) {
if (dist[nv] != -1) continue; // すでに発見済みの頂点は探索しない
// 新たな白色頂点 nv について距離情報を更新してキューに追加する
dist[nv] = dist[v] + 1;
que.push(nv);
}
}
*/
ll modpow(ll a, ll n) { //二分累乗法 a^n
ll ret = 1;
while (n > 0) {
if (n & 1)
ret = ret * a % MOD;
a = a * a % MOD;
n >>= 1;
}
return ret;
}
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
ll COM(int n, int k) { // nCk
// use COMinit() before use this.
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
void Main() {
int N;
cin >> N;
int p[N];
int ans = 0;
REP(i, N) {
cin >> p[i];
if (i + 1 != p[i]) {
ans++;
}
}
if (ans > 2) {
cout << "NO" << endl;
} else {
cout << "YES" << endl;
}
}
int main() {
std::cin.tie(nullptr);
std::ios_base::sync_with_stdio(false);
std::cout << std::fixed << std::setprecision(15);
COMinit();
Main();
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 762,865 | 762,866 | u798944838 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
constexpr ll mod = 1e6;
int main() {
int n;
cin >> n;
vector<int> v(n + 1);
for (int i = 1; i <= n; ++i) {
cin >> v[i];
}
int c = 0;
for (int i = 1; i <= n; ++i)
if (v[i] != i)
c++;
if (c <= 2)
puts("Yes");
else
puts("No");
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
constexpr ll mod = 1e6;
int main() {
int n;
cin >> n;
vector<int> v(n + 1);
for (int i = 1; i <= n; ++i) {
cin >> v[i];
}
int c = 0;
for (int i = 1; i <= n; ++i)
if (v[i] != i)
c++;
if (c <= 2)
puts("YES");
else
puts("NO");
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 762,868 | 762,869 | u808671879 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
#define int long long int
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n;
cin >> n;
vector<int> v;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
v.push_back(x);
// copy.push_back(x);
}
int c = 0, d = 0;
for (int i = 0; i < n; i++) {
if (v[i] != i) {
c++;
}
}
if (c <= 2)
cout << "YES" << '\n';
else
cout << "NO" << '\n';
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long int
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n;
cin >> n;
vector<int> v;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
v.push_back(x);
// copy.push_back(x);
}
int c = 0, d = 0;
for (int i = 0; i < n; i++) {
if (v[i] != i + 1) {
c++;
}
}
if (c <= 2)
cout << "YES" << '\n';
else
cout << "NO" << '\n';
return 0;
}
| [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 762,870 | 762,871 | u396809531 | cpp |
p02958 | /* ______
_______ /\ |``\ | | /
| / \ |__/ |____ |/
| / _ _\ | \ | |\
| / \ | \ |______ | \
Dept. of CSE
Comilla University
*/
#include <bits/stdc++.h>
#define pi 2 * acos(0.0)
#define ll long long
#define FIO \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define Node struct node
#define spc " "
#define E 2.71828182845904523536
#define pb push_back
#define pp pop_back
#define valid(nx, ny) nx >= 0 && nx < n &&ny >= 0 && ny < m
#define ee endl
#define pii pair<int, int>
#define infinity 10000000000000000
#define mod 1000000007
int fx[] = {0, 0, +1, -1};
int fy[] = {+1, -1, 0, 0};
using namespace std;
/// check n=1;
/// check corner case;
const int maX = 1e5 + 1;
vector<ll> Graph[maX], cost[maX];
ll visit[maX];
ll x[10];
ll y[10];
int main() {
ll n, i, j, cc = 0;
cin >> n;
ll ara[n];
for (i = 0; i < n; i++)
cin >> ara[i];
for (i = 0; i < n; i++)
if (ara[i] != i + 1)
cc++;
if (cc <= 2)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
| /* ______
_______ /\ |``\ | | /
| / \ |__/ |____ |/
| / _ _\ | \ | |\
| / \ | \ |______ | \
Dept. of CSE
Comilla University
*/
#include <bits/stdc++.h>
#define pi 2 * acos(0.0)
#define ll long long
#define FIO \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define Node struct node
#define spc " "
#define E 2.71828182845904523536
#define pb push_back
#define pp pop_back
#define valid(nx, ny) nx >= 0 && nx < n &&ny >= 0 && ny < m
#define ee endl
#define pii pair<int, int>
#define infinity 10000000000000000
#define mod 1000000007
int fx[] = {0, 0, +1, -1};
int fy[] = {+1, -1, 0, 0};
using namespace std;
/// check n=1;
/// check corner case;
const int maX = 1e5 + 1;
vector<ll> Graph[maX], cost[maX];
ll visit[maX];
ll x[10];
ll y[10];
int main() {
ll n, i, j, cc = 0;
cin >> n;
ll ara[n];
for (i = 0; i < n; i++)
cin >> ara[i];
for (i = 0; i < n; i++)
if (ara[i] != i + 1)
cc++;
if (cc <= 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 762,875 | 762,876 | u164081575 | cpp |
p02958 | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <regex>
#include <set>
#include <string>
#include <vector>
using namespace std;
using ll = long long int;
using dd = long double;
const ll MOD = 1e9 + 7;
ll gcd(ll a, ll b) {
if (a % b == 0) {
return b;
}
return gcd(b, a % b);
}
int main() {
ll N;
cin >> N;
vector<ll> P(N);
for (ll i = 0; i < N; i++) {
cin >> P[i];
}
bool ok = false;
for (ll i = 0; i < N; i++) {
for (ll j = i + 1; j < N; j++) {
auto P_copy = P;
swap(P_copy[i], P_copy[j]);
bool asc = true;
for (ll k = 1; k < N; k++) {
if (P_copy[k - 1] > P_copy[k]) {
asc = false;
}
}
ok |= asc;
}
}
cout << (ok ? "YES" : "NO") << endl;
} | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <regex>
#include <set>
#include <string>
#include <vector>
using namespace std;
using ll = long long int;
using dd = long double;
const ll MOD = 1e9 + 7;
ll gcd(ll a, ll b) {
if (a % b == 0) {
return b;
}
return gcd(b, a % b);
}
int main() {
ll N;
cin >> N;
vector<ll> P(N);
for (ll i = 0; i < N; i++) {
cin >> P[i];
}
bool ok = false;
for (ll i = 0; i < N; i++) {
for (ll j = i; j < N; j++) {
auto P_copy = P;
swap(P_copy[i], P_copy[j]);
bool asc = true;
for (ll k = 1; k < N; k++) {
if (P_copy[k - 1] > P_copy[k]) {
asc = false;
}
}
ok |= asc;
}
}
cout << (ok ? "YES" : "NO") << endl;
} | [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove"
] | 762,877 | 762,878 | u789199225 | cpp |
p02958 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int n;
cin >> n;
vector<int> p(n);
rep(i, n) cin >> p.at(i);
int ans = 0;
rep(i, n) {
if (p.at(i) != i)
ans++;
}
if (ans <= 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int n;
cin >> n;
vector<int> p(n);
rep(i, n) cin >> p.at(i);
int ans = 0;
rep(i, n) {
if (p.at(i) != i + 1)
ans++;
}
if (ans <= 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
} | [
"control_flow.branch.if.condition.change"
] | 762,879 | 762,880 | u547099897 | cpp |
p02958 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
//#define cerr if(false) cerr
#ifdef DEBUG
#define show(...) cerr << #__VA_ARGS__ << " = ", debug(__VA_ARGS__);
#else
#define show(...) 42
#endif
using namespace std;
using ll = long long;
using pii = pair<int, int>;
template <typename T, typename S>
ostream &operator<<(ostream &os, pair<T, S> a) {
os << '(' << a.first << ',' << a.second << ')';
return os;
}
template <typename T> ostream &operator<<(ostream &os, vector<T> v) {
for (auto x : v)
os << x << ' ';
return os;
}
void debug() { cerr << '\n'; }
template <typename H, typename... T> void debug(H a, T... b) {
cerr << a;
if (sizeof...(b))
cerr << ", ";
debug(b...);
}
int main() {
int n;
cin >> n;
int cnt = 0;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
if (x != i + 1)
cnt++;
}
if (cnt == 2) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
}
| #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
//#define cerr if(false) cerr
#ifdef DEBUG
#define show(...) cerr << #__VA_ARGS__ << " = ", debug(__VA_ARGS__);
#else
#define show(...) 42
#endif
using namespace std;
using ll = long long;
using pii = pair<int, int>;
template <typename T, typename S>
ostream &operator<<(ostream &os, pair<T, S> a) {
os << '(' << a.first << ',' << a.second << ')';
return os;
}
template <typename T> ostream &operator<<(ostream &os, vector<T> v) {
for (auto x : v)
os << x << ' ';
return os;
}
void debug() { cerr << '\n'; }
template <typename H, typename... T> void debug(H a, T... b) {
cerr << a;
if (sizeof...(b))
cerr << ", ";
debug(b...);
}
int main() {
int n;
cin >> n;
int cnt = 0;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
if (x != i + 1)
cnt++;
}
if (cnt <= 2) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 762,885 | 762,886 | u628047647 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, i, a;
cin >> N;
vector<int> p(N), _p(N);
for (i = 0; i < N; i++) {
cin >> p.at(i);
_p.at(i) = p.at(i);
}
sort(_p.begin(), _p.end());
int count = 0;
for (i = 0; i < N; i++) {
if (_p.at(i) != p.at(i))
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, i, a;
cin >> N;
vector<int> p(N), _p(N);
for (i = 0; i < N; i++) {
cin >> p.at(i);
_p.at(i) = p.at(i);
}
sort(_p.begin(), _p.end());
int count = 0;
for (i = 0; i < N; i++) {
if (_p.at(i) != p.at(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"
] | 762,889 | 762,890 | u319965179 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, i, a;
cin >> N;
vector<int> p(N), _p(N);
for (i = 0; i < N; i++) {
cin >> p.at(i);
_p.at(i) = p.at(i);
}
sort(_p.begin(), _p.end());
int count = 0;
for (i = 0; i < N; i++) {
if (_p.at(i) != p.at(i))
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, i, a;
cin >> N;
vector<int> p(N), _p(N);
for (i = 0; i < N; i++) {
cin >> p.at(i);
_p.at(i) = p.at(i);
}
sort(_p.begin(), _p.end());
int count = 0;
for (i = 0; i < N; i++) {
if (_p.at(i) != p.at(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"
] | 762,891 | 762,890 | u319965179 | cpp |
p02958 | // Jai Bhole Ki
#include <bits/stdc++.h>
using namespace std;
#define fast \
static int fastline = []() { \
std::ios::sync_with_stdio(false); \
cin.tie(NULL); \
return 0; \
}();
#define ll long long
#define LL unsigned ll
#define pb push_back
#define pi pair<ll, ll>
#define debug(x) cout << x << "\n";
#define debug cout << "debugged\n";
#define minval -2e9
#define maxval 1e9
long double PI = 3.14159265358979323846;
const ll M = 1e12;
const ll inf = 1e18;
const ll ms = 10000000;
fast;
ll ans, n;
void solve() {
cin >> n;
for (int i = 1; i <= n; i++) {
ll a;
cin >> a;
if (a != i)
ans++;
}
if (ans < 3)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
int main() {
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
// int t;cin>>t;while(t--)
{ solve(); }
return 0;
}
| // Jai Bhole Ki
#include <bits/stdc++.h>
using namespace std;
#define fast \
static int fastline = []() { \
std::ios::sync_with_stdio(false); \
cin.tie(NULL); \
return 0; \
}();
#define ll long long
#define LL unsigned ll
#define pb push_back
#define pi pair<ll, ll>
#define debug(x) cout << x << "\n";
#define debug cout << "debugged\n";
#define minval -2e9
#define maxval 1e9
long double PI = 3.14159265358979323846;
const ll M = 1e12;
const ll inf = 1e18;
const ll ms = 10000000;
fast;
ll ans, n;
void solve() {
cin >> n;
for (int i = 1; i <= n; i++) {
ll a;
cin >> a;
if (a != i)
ans++;
}
if (ans < 3)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
int main() {
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
// int t;cin>>t;while(t--)
{ solve(); }
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 762,894 | 762,895 | u526639495 | cpp |
p02958 | #include <bits/stdc++.h>
//#define <- プログラムの文字列を置換する
// typedef <- 新しい型に名前を付けるためのキーワード
using namespace std;
#define MAX_N 1
typedef long long ll;
const double PI = 3.141592653589793;
const long long MOD = 1e9 + 7;
const long long INF = 1e15;
const int INF_INT = 1e9;
int main() {
int N;
cin >> N;
int a[N];
int count = 0;
for (int i = 0; i < N; i++) {
cin >> a[i];
if (a[i] != i + 1)
count++;
}
if (count <= 2)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | #include <bits/stdc++.h>
//#define <- プログラムの文字列を置換する
// typedef <- 新しい型に名前を付けるためのキーワード
using namespace std;
#define MAX_N 1
typedef long long ll;
const double PI = 3.141592653589793;
const long long MOD = 1e9 + 7;
const long long INF = 1e15;
const int INF_INT = 1e9;
int main() {
int N;
cin >> N;
int a[N];
int count = 0;
for (int i = 0; i < N; i++) {
cin >> a[i];
if (a[i] != i + 1)
count++;
}
if (count <= 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 762,898 | 762,899 | u705561278 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k = 0, i;
cin >> n;
int a[n];
for (i = 0; i < n; i++)
cin >> a[i];
for (i = 0; i < n; i++) {
if (a[i] != (i + 1))
k++;
}
if (k == 2 || k == 0)
cout << "Yes";
else {
cout << "No";
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k = 0, i;
cin >> n;
int a[n];
for (i = 0; i < n; i++)
cin >> a[i];
for (i = 0; i < n; i++) {
if (a[i] != (i + 1))
k++;
}
if (k == 2 || k == 0)
cout << "YES";
else {
cout << "NO";
}
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 762,900 | 762,901 | u018304601 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int count = 0;
cin >> N;
vector<int> p(N);
for (int a = 0; a < N; a++) {
cin >> p[a];
if (p[a] != N - a)
count++;
}
if (count <= 2) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int count = 0;
cin >> N;
vector<int> p(N);
for (int a = 0; a < N; a++) {
cin >> p[a];
if (p[a] != a + 1)
count++;
}
if (count <= 2) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change",
"misc.off_by_one"
] | 762,905 | 762,906 | u073895786 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define sz(x) (int)x.size()
#define all(x) (x).begin(), (x).end()
#define Red \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define rep(i, n) for (int i = 0; i < n; ++i)
#define Rep(i, a, b) for (int i = a; i <= b; i++)
#define pii pair<int, int>
typedef vector<int> vi;
typedef long long ll;
const int mod = 1e9 + 7;
const int N = (int)2e5 + 5;
void solve() {
int n;
cin >> n;
int a[n], b[n];
rep(i, n) cin >> a[i], b[i] = a[i];
sort(b, b + n);
int cnt = 0;
rep(i, n) {
if (b[i] != a[i])
cnt++;
}
if (cnt == 2)
cout << "YES";
else
cout << "NO";
}
int main() {
Red;
int t = 1;
// cin>>t;
while (t--)
solve();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define sz(x) (int)x.size()
#define all(x) (x).begin(), (x).end()
#define Red \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define rep(i, n) for (int i = 0; i < n; ++i)
#define Rep(i, a, b) for (int i = a; i <= b; i++)
#define pii pair<int, int>
typedef vector<int> vi;
typedef long long ll;
const int mod = 1e9 + 7;
const int N = (int)2e5 + 5;
void solve() {
int n;
cin >> n;
int a[n], b[n];
rep(i, n) cin >> a[i], b[i] = a[i];
sort(b, b + n);
int cnt = 0;
rep(i, n) {
if (b[i] != a[i])
cnt++;
}
if (cnt == 2 || cnt == 0)
cout << "YES";
else
cout << "NO";
}
int main() {
Red;
int t = 1;
// cin>>t;
while (t--)
solve();
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 762,909 | 762,910 | u002627851 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define sz(x) (int)x.size()
#define all(x) (x).begin(), (x).end()
#define Red \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define rep(i, n) for (int i = 0; i < n; ++i)
#define Rep(i, a, b) for (int i = a; i <= b; i++)
#define pii pair<int, int>
typedef vector<int> vi;
typedef long long ll;
const int mod = 1e9 + 7;
const int N = (int)2e5 + 5;
void solve() {
int n;
cin >> n;
int a[n], b[n];
rep(i, n) cin >> a[i], b[i] = a[i];
sort(b, b + n);
int cnt = 0;
rep(i, n) {
if (b[i] != a[i])
cnt++;
}
if (cnt == 1)
cout << "YES";
else
cout << "NO";
}
int main() {
Red;
int t = 1;
// cin>>t;
while (t--)
solve();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define sz(x) (int)x.size()
#define all(x) (x).begin(), (x).end()
#define Red \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define rep(i, n) for (int i = 0; i < n; ++i)
#define Rep(i, a, b) for (int i = a; i <= b; i++)
#define pii pair<int, int>
typedef vector<int> vi;
typedef long long ll;
const int mod = 1e9 + 7;
const int N = (int)2e5 + 5;
void solve() {
int n;
cin >> n;
int a[n], b[n];
rep(i, n) cin >> a[i], b[i] = a[i];
sort(b, b + n);
int cnt = 0;
rep(i, n) {
if (b[i] != a[i])
cnt++;
}
if (cnt == 2 || cnt == 0)
cout << "YES";
else
cout << "NO";
}
int main() {
Red;
int t = 1;
// cin>>t;
while (t--)
solve();
return 0;
} | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 762,911 | 762,910 | u002627851 | 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 k = 0;
for (int i = 0; i < n - 1; i++) {
if (vec[i] > vec[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;
vector<int> vec(n);
for (int i = 0; i < n; i++) {
cin >> vec[i];
}
int k = 0;
for (int i = 0; i < n; i++) {
if (vec[i] != i + 1) {
k++;
}
}
if (k <= 2) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
}
| [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 762,916 | 762,917 | u358615347 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<int> p(N);
for (int i = 0; i < N; i++) {
cin >> p[i];
}
int sum = 0;
for (int i = 0; i < N; i++) {
if (p[i] != i + 1)
sum++;
}
if (sum == 2)
cout << "YES";
else
cout << "NO";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<int> p(N);
for (int i = 0; i < N; i++) {
cin >> p[i];
}
int sum = 0;
for (int i = 0; i < N; i++) {
if (p[i] != i + 1)
sum++;
}
if (sum <= 2)
cout << "YES";
else
cout << "NO";
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 762,920 | 762,921 | u109191542 | cpp |
p02958 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
/*int main()
{
int n; cin>>n;
int a[n];
for(int i=0;i<n;i++) cin>>a[i];
sort(a,a+n);
// for(int i=0;i<n;i++) cout<<a[i];
int sum=0;
for(int i=n-1;i>1;i--)
{
for(int j=i-1;j>0;j--)
{
if(a[i]==a[j]) continue;
for(int k=j-1;k>=0;k--)
{
if(a[k]!=a[i] and a[k]!=a[j] and a[i] < (a[k] +
a[j]))
{
sum++;
}
if(a[k]!=a[i] and a[k]!=a[j] and a[i] >= (a[k] +
a[j]))
{
break;
}
}
}
}
cout<<sum;
}
int main()
{
int n,d,ans=0;
cin>>n>>d;
while(n--)
{
int a,b; cin>>a>>b;
long long int fl=a*a + b*b;
float sum=sqrt(fl);
if(sum<=d) ans++;
}
cout<<ans;
}
int main()
{
int n,k; cin>>n>>k;
int a[n],sum=0;
for(int i=0;i<n;i++) cin>>a[i];
sort(a,a+n);
for(int i=0;i<k;i++) sum+=a[i];
cout<<sum;
}
int main()
{
int n,k; cin>>n>>k;
k%2==0 and k>=2*n and k<=4*n ? cout<<"Yes" : cout<<"No";
}
int main()
{
int n; cin>>n;
int a[n];
for(int i=0;i<n;i++) cin>>a[i];
unsigned long long ans=1,ANS;
vector<int>v;
for(int i=0;i<n;i++)
{
ans*=a[i];
ANS=ans;
while(ANS)
{
v.push_back(ANS%10);
ANS/=10;
}
if(v.size()>1000000000000000000)
{
cout<<"HRE";
cout<<"-1";
return 0;
}
v.clear();
}
cout<<ans;
}
int main()
{
int n; cin>>n;
string s; cin>>s;
if(s.size()<=n) cout<<s;
else {
for(int i=0;i<n;i++) cout<<s[i];
cout<<"...";
}}
int main()
{
long long int a,b,c,d; cin>>a>>b>>c>>d;
long long int sum=0,count=0;
if(a<=d)
{
sum+=a;
d-=a;
if(d==0)
{
cout<<sum;
return 0;
}
}
else
{
cout<<d;
return 0;
}
if(b<=d)
{
d-=b;
if(d==0)
{
cout<<sum;
return 0;
}
}
else
{
cout<<d;
return 0;
}
if(c<=d)
{
sum-=c;
d-=c;
if(d==0)
{
cout<<sum;
return 0;
}
}
else
{
cout<<sum-d;
return 0;
}
}
int main()
{
int n,k; cin>>n>>k;
int a[n];
for(int i=0;i<n;i++) a[i]=0;
while(k--)
{
int d; cin>>d;
for(int i=0;i<d;i++)
{
int x; cin>>x;
a[x-1]++;
}
}
//cout<<a[2];
int ans=0;
for(int i=0;i<n;i++) if(a[i]==0) ans++; cout<<ans;
}
int main()
{
long long int n,year=0; cin>>n;
int a=100;
while(a<n)
{
float aa=(1.0/100)*a;
a+=floor(aa);
year++;
}
cout<<year;
}
int main()
{
long long int n,m; cin>>n>>m;
long long int sum=0,a[n];
for(long long int i=0;i<n;i++)
{
cin>>a[i];
sum+=a[i];
}
sort(a,a+n,greater<int>());
float min=sum*1.0/(4*m);
a[m-1]<min?cout<<"No": cout<<"Yes\n";
}
int main()
{
int n; cin>>n;
long long sum=(n/500)*1000 + ((n-(n/500)*500)/5)*5;
cout<<sum;
}
int main()
{
string s; cin>>s;
if(s.size()%2==0)
{
cout<<"No";
return 0;
}
if(s.size()==3)
{
cout<<"Yes";
return 0;
}
int si=s.size()/2;
for(int i=0;i<si/2;i++)
{
if(s[i]!=s[si-i-1])
{
cout<<"No";
return 0;
}
}
int aa=s.size();
for(int i=si+1;i<si+si/2+1;i++)
{
if(s[i]!=s[aa-1])
{
cout<<"No";
return 0;
}
aa--;
}
cout<<"Yes";
}
int main()
{
long long int n,a,b; cin>>n>>a>>b;
long long int sum=n/(a+b)*a;
n=n%(a+b);
if(n<=a) sum+=n;
else sum+=a;
cout<<sum;
}
int main()
{
int a[3][3];
for(int i=0;i<3;i++) for(int j=0;j<3;j++) cin>>a[i][j];
int n; cin>>n;
for(int i=0;i<n;i++)
{
int b;
cin>>b;
for(int i=0;i<3;i++) for(int j=0;j<3;j++) if(a[i][j]==b)
a[i][j]=0;
}
bool u=false;
for(int i=0;i<3;i++)
{
for(int j=0;j<3;j++)
{
if(a[i][j]!=0) break;
if(j==2) u=true;
}
}
if(u)
{
cout<<"Yes";
return 0;
}
for(int j=0;j<3;j++)
{
for(int i=0;i<3;i++)
{
if(a[i][j]!=0) break;
if(i==2) u=true;
}
}
if(u)
{
cout<<"Yes";
return 0;
}
if(a[2][0] == 0 and a[1][1] == 0 and a[0][2] == 0)
{
cout<<"Yes";
return 0;
}
if(a[0][0] == 0 and a[1][1] == 0 and a[2][2] == 0)
{
cout<<"Yes";
return 0;
}
cout<<"No";
}
int main()
{
int a,b,B,sum=1; cin>>a>>b;
B=b;
while(b<=a)
{
b*=B;
sum++;
}
cout<<sum;
}
if(a[0][0] == 0 and a[1][1] == 0 and a[2][2] == 0)
{
cout<<"Yes";
return 0;
int main()
{
int n; cin>>n;
int a[n];
for(int i=0;i<n;i++) cin>>a[i];
for(int i=0;i<n;i++)
{
if(a[i]&1) continue;
if(a[i]%3!=0 and a[i]%5!=0)
{
// cout<<a[i]<<" "<<a[i]%3<<"\n";
cout<<"DENIED"; return 0;
}
}
cout<<"APPROVED";
}
int main()
{
string s; cin>>s;
for(int i=0;s[i];i++) cout<<"x";
}
int main()
{
int a,n,sum=0; cin>>a>>n;
int aa[n];
for(int i=0;i<n;i++) {
cin>>aa[i];
sum+=aa[i];
}
sum>=a?cout<<"Yes": cout<<"No";
}
int main()
{
int a,b; cin>>a>>b;
for(int i=0;i<max(a,b);i++) cout<<min(a,b);
}
int main()
{
int n,sum=0,m,x; cin>>n>>m>>x;
int a[n-1];
for(int i=0;i<n-1;i++)
{
cin>>a[i];
sum+=a[i];
}
(sum+m)<(n*x)?cout<<-1:(((n*x)-sum)<0?cout<<"0" : cout<<(n*x)-sum);
}
int main()
{
int n; cin>>n;
string s,ss="ABC"; cin>>s;
int ans=0;
auto found=s.find(ss);
while(found!=string::npos)
{
ans++;
found=s.find("ABC",found+1,3);
}
cout<<ans;
}
int main()
{
long long int a,b,c; cin>>a>>b>>c;
(c<=a)?cout<<a-c<<" "<<b:cout<<"0 "<<b-(c-a);
}
int main()
{
int n; cin>>n;
string s,ss; cin>>s>>ss;
for(int i=0;i<n;i++)
{
cout<<s[i]<<ss[i];
}
}
int main()
{
int a=0;
string s; cin>>s;
for(int i=0;i<s.size()/2;i++)
{
if(s[i]!=s[s.size()-1-i]) a++;
}
cout<<a;
}
int main()
{
int n; cin>>n;
int a[n],sum=0;
for(int i=0;i<n;i++) cin>>a[i];
for(int i=1;i<n;i++)
{
if(a[i]<a[i-1])
{
sum+=a[i-1]-a[i];
a[i]=a[i-1];
}
}
cout<<sum;
}
int main()
{
long long int a,b,c; cin>>a>>b>>c;
a=abs(a)
if(a/c >= b)
{
cout<<a-(b*c); return 0;
}
b=b-(a/c);
a=a%c;
b&1?cout<<abs(a-c):cout<<a;
}
int main()
{
int n,m; cin>>m;
m%=26;
string s; cin>>s;
for(int i=0;s[i];i++)
{
n=s[i];
n+=m;
if(n<=90)
{
cout<<char(n);
}
else
{
n-=90;
cout<<char(64+n);
}
}
}
int main()
{
int n; cin>>n;
string s; cin>>s;
int si=s.size();
if(si&1)
{
cout<<"No";
return 0;
}
for(int i=0;i<si/2;i++)
{
if(s[i]!=s[si/2 + i])
{
cout<<"No";
return 0;
}
}
cout<<"Yes";
return 0;
}
int main()
{
int n; cin>>n;
((n%1==0 and n/1 <= 9) or (n%2==0 and n/2 <= 9) or (n%3==0 and n/3 <= 9)
or (n%4==0 and n/4 <= 9) or (n%5==0 and n/5 <= 9) or (n%6==0 and n/6 <= 9) or
(n%7==0 and n/7 <= 9) or (n%8==0 and n/8 <= 9) or (n%9==0 and n/9 <= 9)) ?
cout<<"Yes" : cout<<"No";
}
int main()
{
int n,k; cin>>n>>k;
int a[n],sum=0;
for(int i=0;i<n;i++)
{
cin>>a[i];
if(a[i]>=k) sum++;
}
cout<<sum;
}
int main()
{
string s; cin>>s;
for(int i=0;s[i];i+=2)
{
if(s[i]=='L')
{
cout<<"No";
return 0;
}
}
for(int i=1;s[i];i+=2)
{
if(s[i]=='R')
{
cout<<"No";
return 0;
}
}
cout<<"Yes";
}
int main()
{
int n; cin>>n;
int a[n],b[n],c[n-1];
for(int i=0;i<n;i++) cin>>a[i];
for(int i=0;i<n;i++) cin>>b[i];
for(int i=0;i<n-1;i++) cin>>c[i];
int sum=b[a[0]-1];
for(int i=1;i<n;i++)
{
sum+=b[a[i]-1];
if(a[i]-a[i-1]==1) sum+=c[a[i-1]-1];
}
cout<<sum;
}
int main()
{
int a,b; cin>>a>>b;
cout<<(b+a-1)/a;
}
int main()
{
int n; cin>>n;
float sum=0;
int a;
for(int i=0;i<n;i++)
{
cin>>a;
float aa=1.0/a;
sum+=aa;
}
float ans=1/sum;
cout<<ans;
}
int main()
{
int a,b; cin>>a>>b;
for(int i=b-a+1;i<=b+a-1;i++) cout<<i<<" ";
}
int main()
{
int n,sum=0; cin>>n;
if(n==100000) cout<<90909;
else if(n>=10000) cout<<(n-9999)+909;
else if(n>=1000) cout<<909;
else if(n>=100) cout<<n-99 + 9;
else if(n>=10) cout<<9;
else cout<<n;
}*/
int main() {
int n, sum = 0;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] != (i + 1))
sum++;
}
sum <= 2 ? cout << "Yes" : cout << "No";
}
| #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
/*int main()
{
int n; cin>>n;
int a[n];
for(int i=0;i<n;i++) cin>>a[i];
sort(a,a+n);
// for(int i=0;i<n;i++) cout<<a[i];
int sum=0;
for(int i=n-1;i>1;i--)
{
for(int j=i-1;j>0;j--)
{
if(a[i]==a[j]) continue;
for(int k=j-1;k>=0;k--)
{
if(a[k]!=a[i] and a[k]!=a[j] and a[i] < (a[k] +
a[j]))
{
sum++;
}
if(a[k]!=a[i] and a[k]!=a[j] and a[i] >= (a[k] +
a[j]))
{
break;
}
}
}
}
cout<<sum;
}
int main()
{
int n,d,ans=0;
cin>>n>>d;
while(n--)
{
int a,b; cin>>a>>b;
long long int fl=a*a + b*b;
float sum=sqrt(fl);
if(sum<=d) ans++;
}
cout<<ans;
}
int main()
{
int n,k; cin>>n>>k;
int a[n],sum=0;
for(int i=0;i<n;i++) cin>>a[i];
sort(a,a+n);
for(int i=0;i<k;i++) sum+=a[i];
cout<<sum;
}
int main()
{
int n,k; cin>>n>>k;
k%2==0 and k>=2*n and k<=4*n ? cout<<"Yes" : cout<<"No";
}
int main()
{
int n; cin>>n;
int a[n];
for(int i=0;i<n;i++) cin>>a[i];
unsigned long long ans=1,ANS;
vector<int>v;
for(int i=0;i<n;i++)
{
ans*=a[i];
ANS=ans;
while(ANS)
{
v.push_back(ANS%10);
ANS/=10;
}
if(v.size()>1000000000000000000)
{
cout<<"HRE";
cout<<"-1";
return 0;
}
v.clear();
}
cout<<ans;
}
int main()
{
int n; cin>>n;
string s; cin>>s;
if(s.size()<=n) cout<<s;
else {
for(int i=0;i<n;i++) cout<<s[i];
cout<<"...";
}}
int main()
{
long long int a,b,c,d; cin>>a>>b>>c>>d;
long long int sum=0,count=0;
if(a<=d)
{
sum+=a;
d-=a;
if(d==0)
{
cout<<sum;
return 0;
}
}
else
{
cout<<d;
return 0;
}
if(b<=d)
{
d-=b;
if(d==0)
{
cout<<sum;
return 0;
}
}
else
{
cout<<d;
return 0;
}
if(c<=d)
{
sum-=c;
d-=c;
if(d==0)
{
cout<<sum;
return 0;
}
}
else
{
cout<<sum-d;
return 0;
}
}
int main()
{
int n,k; cin>>n>>k;
int a[n];
for(int i=0;i<n;i++) a[i]=0;
while(k--)
{
int d; cin>>d;
for(int i=0;i<d;i++)
{
int x; cin>>x;
a[x-1]++;
}
}
//cout<<a[2];
int ans=0;
for(int i=0;i<n;i++) if(a[i]==0) ans++; cout<<ans;
}
int main()
{
long long int n,year=0; cin>>n;
int a=100;
while(a<n)
{
float aa=(1.0/100)*a;
a+=floor(aa);
year++;
}
cout<<year;
}
int main()
{
long long int n,m; cin>>n>>m;
long long int sum=0,a[n];
for(long long int i=0;i<n;i++)
{
cin>>a[i];
sum+=a[i];
}
sort(a,a+n,greater<int>());
float min=sum*1.0/(4*m);
a[m-1]<min?cout<<"No": cout<<"Yes\n";
}
int main()
{
int n; cin>>n;
long long sum=(n/500)*1000 + ((n-(n/500)*500)/5)*5;
cout<<sum;
}
int main()
{
string s; cin>>s;
if(s.size()%2==0)
{
cout<<"No";
return 0;
}
if(s.size()==3)
{
cout<<"Yes";
return 0;
}
int si=s.size()/2;
for(int i=0;i<si/2;i++)
{
if(s[i]!=s[si-i-1])
{
cout<<"No";
return 0;
}
}
int aa=s.size();
for(int i=si+1;i<si+si/2+1;i++)
{
if(s[i]!=s[aa-1])
{
cout<<"No";
return 0;
}
aa--;
}
cout<<"Yes";
}
int main()
{
long long int n,a,b; cin>>n>>a>>b;
long long int sum=n/(a+b)*a;
n=n%(a+b);
if(n<=a) sum+=n;
else sum+=a;
cout<<sum;
}
int main()
{
int a[3][3];
for(int i=0;i<3;i++) for(int j=0;j<3;j++) cin>>a[i][j];
int n; cin>>n;
for(int i=0;i<n;i++)
{
int b;
cin>>b;
for(int i=0;i<3;i++) for(int j=0;j<3;j++) if(a[i][j]==b)
a[i][j]=0;
}
bool u=false;
for(int i=0;i<3;i++)
{
for(int j=0;j<3;j++)
{
if(a[i][j]!=0) break;
if(j==2) u=true;
}
}
if(u)
{
cout<<"Yes";
return 0;
}
for(int j=0;j<3;j++)
{
for(int i=0;i<3;i++)
{
if(a[i][j]!=0) break;
if(i==2) u=true;
}
}
if(u)
{
cout<<"Yes";
return 0;
}
if(a[2][0] == 0 and a[1][1] == 0 and a[0][2] == 0)
{
cout<<"Yes";
return 0;
}
if(a[0][0] == 0 and a[1][1] == 0 and a[2][2] == 0)
{
cout<<"Yes";
return 0;
}
cout<<"No";
}
int main()
{
int a,b,B,sum=1; cin>>a>>b;
B=b;
while(b<=a)
{
b*=B;
sum++;
}
cout<<sum;
}
if(a[0][0] == 0 and a[1][1] == 0 and a[2][2] == 0)
{
cout<<"Yes";
return 0;
int main()
{
int n; cin>>n;
int a[n];
for(int i=0;i<n;i++) cin>>a[i];
for(int i=0;i<n;i++)
{
if(a[i]&1) continue;
if(a[i]%3!=0 and a[i]%5!=0)
{
// cout<<a[i]<<" "<<a[i]%3<<"\n";
cout<<"DENIED"; return 0;
}
}
cout<<"APPROVED";
}
int main()
{
string s; cin>>s;
for(int i=0;s[i];i++) cout<<"x";
}
int main()
{
int a,n,sum=0; cin>>a>>n;
int aa[n];
for(int i=0;i<n;i++) {
cin>>aa[i];
sum+=aa[i];
}
sum>=a?cout<<"Yes": cout<<"No";
}
int main()
{
int a,b; cin>>a>>b;
for(int i=0;i<max(a,b);i++) cout<<min(a,b);
}
int main()
{
int n,sum=0,m,x; cin>>n>>m>>x;
int a[n-1];
for(int i=0;i<n-1;i++)
{
cin>>a[i];
sum+=a[i];
}
(sum+m)<(n*x)?cout<<-1:(((n*x)-sum)<0?cout<<"0" : cout<<(n*x)-sum);
}
int main()
{
int n; cin>>n;
string s,ss="ABC"; cin>>s;
int ans=0;
auto found=s.find(ss);
while(found!=string::npos)
{
ans++;
found=s.find("ABC",found+1,3);
}
cout<<ans;
}
int main()
{
long long int a,b,c; cin>>a>>b>>c;
(c<=a)?cout<<a-c<<" "<<b:cout<<"0 "<<b-(c-a);
}
int main()
{
int n; cin>>n;
string s,ss; cin>>s>>ss;
for(int i=0;i<n;i++)
{
cout<<s[i]<<ss[i];
}
}
int main()
{
int a=0;
string s; cin>>s;
for(int i=0;i<s.size()/2;i++)
{
if(s[i]!=s[s.size()-1-i]) a++;
}
cout<<a;
}
int main()
{
int n; cin>>n;
int a[n],sum=0;
for(int i=0;i<n;i++) cin>>a[i];
for(int i=1;i<n;i++)
{
if(a[i]<a[i-1])
{
sum+=a[i-1]-a[i];
a[i]=a[i-1];
}
}
cout<<sum;
}
int main()
{
long long int a,b,c; cin>>a>>b>>c;
a=abs(a)
if(a/c >= b)
{
cout<<a-(b*c); return 0;
}
b=b-(a/c);
a=a%c;
b&1?cout<<abs(a-c):cout<<a;
}
int main()
{
int n,m; cin>>m;
m%=26;
string s; cin>>s;
for(int i=0;s[i];i++)
{
n=s[i];
n+=m;
if(n<=90)
{
cout<<char(n);
}
else
{
n-=90;
cout<<char(64+n);
}
}
}
int main()
{
int n; cin>>n;
string s; cin>>s;
int si=s.size();
if(si&1)
{
cout<<"No";
return 0;
}
for(int i=0;i<si/2;i++)
{
if(s[i]!=s[si/2 + i])
{
cout<<"No";
return 0;
}
}
cout<<"Yes";
return 0;
}
int main()
{
int n; cin>>n;
((n%1==0 and n/1 <= 9) or (n%2==0 and n/2 <= 9) or (n%3==0 and n/3 <= 9)
or (n%4==0 and n/4 <= 9) or (n%5==0 and n/5 <= 9) or (n%6==0 and n/6 <= 9) or
(n%7==0 and n/7 <= 9) or (n%8==0 and n/8 <= 9) or (n%9==0 and n/9 <= 9)) ?
cout<<"Yes" : cout<<"No";
}
int main()
{
int n,k; cin>>n>>k;
int a[n],sum=0;
for(int i=0;i<n;i++)
{
cin>>a[i];
if(a[i]>=k) sum++;
}
cout<<sum;
}
int main()
{
string s; cin>>s;
for(int i=0;s[i];i+=2)
{
if(s[i]=='L')
{
cout<<"No";
return 0;
}
}
for(int i=1;s[i];i+=2)
{
if(s[i]=='R')
{
cout<<"No";
return 0;
}
}
cout<<"Yes";
}
int main()
{
int n; cin>>n;
int a[n],b[n],c[n-1];
for(int i=0;i<n;i++) cin>>a[i];
for(int i=0;i<n;i++) cin>>b[i];
for(int i=0;i<n-1;i++) cin>>c[i];
int sum=b[a[0]-1];
for(int i=1;i<n;i++)
{
sum+=b[a[i]-1];
if(a[i]-a[i-1]==1) sum+=c[a[i-1]-1];
}
cout<<sum;
}
int main()
{
int a,b; cin>>a>>b;
cout<<(b+a-1)/a;
}
int main()
{
int n; cin>>n;
float sum=0;
int a;
for(int i=0;i<n;i++)
{
cin>>a;
float aa=1.0/a;
sum+=aa;
}
float ans=1/sum;
cout<<ans;
}
int main()
{
int a,b; cin>>a>>b;
for(int i=b-a+1;i<=b+a-1;i++) cout<<i<<" ";
}
int main()
{
int n,sum=0; cin>>n;
if(n==100000) cout<<90909;
else if(n>=10000) cout<<(n-9999)+909;
else if(n>=1000) cout<<909;
else if(n>=100) cout<<n-99 + 9;
else if(n>=10) cout<<9;
else cout<<n;
}*/
int main() {
int n, sum = 0;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] != (i + 1))
sum++;
}
sum <= 2 ? cout << "YES" : cout << "NO";
}
| [
"literal.string.change",
"literal.string.case.change",
"expression.operation.binary.change"
] | 762,927 | 762,928 | u329636341 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
/////////////////////////////////
int main() {
int n;
cin >> n;
int cnt = 0;
rep(i, n) {
int k;
cin >> k;
if (i + 1 != k)
cnt++;
}
if (cnt < 3)
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++)
typedef long long ll;
/////////////////////////////////
int main() {
int n;
cin >> n;
int cnt = 0;
rep(i, n) {
int k;
cin >> k;
if (i + 1 != k)
cnt++;
}
if (cnt < 3)
cout << "YES" << endl;
else
cout << "NO" << endl;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 762,931 | 762,932 | u019359540 | cpp |
p02958 | #include <algorithm>
#include <bitset>
#include <chrono>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <stack>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long;
const ll INF = (ll)1e18 + 1;
const ll DIV = 1000000007;
//#define TEST
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
#ifdef TEST
chrono::system_clock::time_point start, end;
start = chrono::system_clock::now();
#endif
long N;
cin >> N;
ll count = 0;
vector<long> p(N);
for (size_t i = 0; i < N; i++) {
cin >> p[i];
if (p[i] != i + 1)
count++;
}
if (count == 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
#ifdef TEST
end = chrono::system_clock::now();
cerr << static_cast<double>(
chrono::duration_cast<chrono::microseconds>(end - start).count() /
1000.0)
<< "[ms]" << endl;
#endif
return 0;
} | #include <algorithm>
#include <bitset>
#include <chrono>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <stack>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long;
const ll INF = (ll)1e18 + 1;
const ll DIV = 1000000007;
//#define TEST
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
#ifdef TEST
chrono::system_clock::time_point start, end;
start = chrono::system_clock::now();
#endif
long N;
cin >> N;
ll count = 0;
vector<long> p(N);
for (size_t i = 0; i < N; i++) {
cin >> p[i];
if (p[i] != i + 1)
count++;
}
if (count == 0 || count == 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
#ifdef TEST
end = chrono::system_clock::now();
cerr << static_cast<double>(
chrono::duration_cast<chrono::microseconds>(end - start).count() /
1000.0)
<< "[ms]" << endl;
#endif
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 762,937 | 762,938 | u645961531 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
int main() {
int n;
cin >> n;
vector<int> p(n);
rep(i, n) cin >> p[i];
vector<int> a(n);
rep(i, n) a[i] = i + 1;
int num = 0;
rep(i, n) {
if (p[i] != a[i]) {
++num;
}
}
if (num == 2 || num == 0) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
int main() {
int n;
cin >> n;
vector<int> p(n);
rep(i, n) cin >> p[i];
vector<int> a(n);
rep(i, n) a[i] = i + 1;
int num = 0;
rep(i, n) {
if (p[i] != a[i]) {
++num;
}
}
if (num == 2 || num == 0) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 762,941 | 762,942 | u321280590 | cpp |
p02958 | #include <iostream>
#include <string>
using namespace std;
#define rep(i, n) for ((i) = 0; (i) < (n); (i)++)
#define max(a, b) ((a) > (b) ? (a) : (b))
#define min(a, b) ((a) < (b) ? (a) : (b))
typedef long long ll;
typedef long double ld;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
int main() {
ll n, m, k, i, j, result = 0;
int a[200010] = {0};
string s;
cin >> n;
rep(i, n) cin >> a[i];
m = 0;
rep(i, n) {
if (a[i] != i + 1)
m++;
}
cout << (m <= 2 ? "Yes" : "No") << endl;
return 0;
} | #include <iostream>
#include <string>
using namespace std;
#define rep(i, n) for ((i) = 0; (i) < (n); (i)++)
#define max(a, b) ((a) > (b) ? (a) : (b))
#define min(a, b) ((a) < (b) ? (a) : (b))
typedef long long ll;
typedef long double ld;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
int main() {
ll n, m, k, i, j, result = 0;
int a[200010] = {0};
string s;
cin >> n;
rep(i, n) cin >> a[i];
m = 0;
rep(i, n) {
if (a[i] != i + 1)
m++;
}
cout << (m <= 2 ? "YES" : "NO") << endl;
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 762,946 | 762,947 | u091870478 | 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>;
int main() {
int n;
cin >> n;
int cnt = 0;
rep(i, n) {
int p;
cin >> p;
if (p != i + 1)
cnt++;
}
if (cnt == 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
int cnt = 0;
rep(i, n) {
int p;
cin >> p;
if (p != i + 1)
cnt++;
}
if (cnt == 2 || cnt == 0)
cout << "YES" << endl;
else
cout << "NO" << endl;
} | [
"control_flow.branch.if.condition.change"
] | 762,948 | 762,949 | u422506696 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
vector<int> a;
vector<int> b;
int n, tmp;
cin >> n;
rep(i, n) {
cin >> tmp;
a.push_back(tmp);
b.push_back(tmp);
}
sort(a.begin(), a.end());
int pre = 0;
rep(i, n) {
if (a[i] != b[i])
pre++;
}
if (pre == 0 || pre == 2) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
vector<int> a;
vector<int> b;
int n, tmp;
cin >> n;
rep(i, n) {
cin >> tmp;
a.push_back(tmp);
b.push_back(tmp);
}
sort(a.begin(), a.end());
int pre = 0;
rep(i, n) {
if (a[i] != b[i])
pre++;
}
if (pre == 0 || pre == 2) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 762,950 | 762,951 | u361777955 | 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);
int count = 0;
rep(i, n) {
cin >> p[i];
if (p[i] != i + 1)
count++;
}
if (count == 2 || count == 0)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n;
cin >> n;
vector<int> p(n);
int count = 0;
rep(i, n) {
cin >> p[i];
if (p[i] != i + 1)
count++;
}
if (count == 2 || count == 0)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 762,954 | 762,955 | u212063753 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> p(n), q(n);
for (int i = 0; i < n; i++)
cin >> p[i];
for (int i = 0; i < n; i++)
q[i] = i + 1;
int cnt = 0;
for (int i = 0; i < n; i++) {
if (p[i] != q[i])
cnt++;
if (cnt == 3)
break;
}
if (cnt == 3)
cout << "No" << endl;
else
cout << "Yes" << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> p(n), q(n);
for (int i = 0; i < n; i++)
cin >> p[i];
for (int i = 0; i < n; i++)
q[i] = i + 1;
int cnt = 0;
for (int i = 0; i < n; i++) {
if (p[i] != q[i])
cnt++;
if (cnt == 3)
break;
}
if (cnt == 3)
cout << "NO" << endl;
else
cout << "YES" << endl;
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 762,956 | 762,957 | u058106405 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
// n
int main() {
int n;
cin >> n;
vector<int> c;
vector<int> v;
while (n--) {
int i;
cin >> i;
c.push_back(i);
v.push_back(i);
}
sort(v.begin(), v.end());
int count = 0;
for (int i = 0; i < v.size(); i++) {
if (v[i] != c[i])
count++;
}
if (count > 2) {
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
// n
int main() {
int n;
cin >> n;
vector<int> c;
vector<int> v;
while (n--) {
int i;
cin >> i;
c.push_back(i);
v.push_back(i);
}
sort(v.begin(), v.end());
int count = 0;
for (int i = 0; i < v.size(); i++) {
if (v[i] != c[i])
count++;
}
if (count > 2) {
cout << "NO" << endl;
} else {
cout << "YES" << endl;
}
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 762,964 | 762,965 | u921044712 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> P(N);
for (int i = 0; i < N; i++) {
cin >> P.at(i);
}
vector<int> ans(N);
for (int i = 0; i < N; i++) {
ans.at(i) = i + 1;
}
int count = 0;
for (int i = 0; i < N; i++) {
if (ans.at(i) == P.at(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;
vector<int> P(N);
for (int i = 0; i < N; i++) {
cin >> P.at(i);
}
vector<int> ans(N);
for (int i = 0; i < N; i++) {
ans.at(i) = i + 1;
}
int count = 0;
for (int i = 0; i < N; i++) {
if (ans.at(i) != P.at(i)) {
count++;
}
}
if (count <= 2) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 762,966 | 762,967 | u856957535 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
// type
#define ll long long
typedef pair<int, int> P;
//定数
#define INF 1000000000000 // 10^12:∞
#define MOD 1000000007 // 10^9+7:合同式の法
#define MAXR 100000 // 10^5:配列の最大のrange
//略記
#define PB push_back //挿入
#define MP make_pair // pairのコンストラクタ
#define F first // pairの一つ目の要素
#define S second // pairの二つ目の要素
#define Z class
// OTHER
// xの二乗を返す (関数テンプレート版)
template <typename T> T square(T x) { return x * x; }
#define chmax(x, y) (x = max(x, y))
#define chmin(x, y) (x = min(x, y))
// loop
#define rep(i, n) for (int i = 0; i < (n); i++)
#define REPD(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = a; i <= ll(b); i++)
#define FORD(i, a, b) for (ll i = a; i >= ll(b); i--)
#define FORA(i, I) for (const auto &i : I)
// vector
#define ALL(x) x.begin(), x.end()
// output
#define YES() printf("YES\n")
#define NO() printf("NO\n")
#define isYES(x) printf("%s\n", (x) ? "YES" : "NO")
#define Yes() printf("Yes\n")
#define No() printf("No\n")
#define ln cout << '\n'
template <Z A> void pr(A a) {
cout << a;
ln;
}
template <Z A, Z B> void pr(A a, B b) {
cout << a << ' ';
pr(b);
}
int ans = 0;
// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
// * * * * * *
// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
// * * * * * *
int main() {
int ans = 0;
int n;
cin >> n;
vector<int> v(n);
vector<int> a(n);
rep(i, n) cin >> v[i];
a = v;
sort(v.begin(), v.end());
rep(i, n) {
if (a[i] != v[i])
ans++;
}
if (ans == 2 || ans == 0)
Yes();
else
No();
}
| #include <bits/stdc++.h>
using namespace std;
// type
#define ll long long
typedef pair<int, int> P;
//定数
#define INF 1000000000000 // 10^12:∞
#define MOD 1000000007 // 10^9+7:合同式の法
#define MAXR 100000 // 10^5:配列の最大のrange
//略記
#define PB push_back //挿入
#define MP make_pair // pairのコンストラクタ
#define F first // pairの一つ目の要素
#define S second // pairの二つ目の要素
#define Z class
// OTHER
// xの二乗を返す (関数テンプレート版)
template <typename T> T square(T x) { return x * x; }
#define chmax(x, y) (x = max(x, y))
#define chmin(x, y) (x = min(x, y))
// loop
#define rep(i, n) for (int i = 0; i < (n); i++)
#define REPD(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = a; i <= ll(b); i++)
#define FORD(i, a, b) for (ll i = a; i >= ll(b); i--)
#define FORA(i, I) for (const auto &i : I)
// vector
#define ALL(x) x.begin(), x.end()
// output
#define YES() printf("YES\n")
#define NO() printf("NO\n")
#define isYES(x) printf("%s\n", (x) ? "YES" : "NO")
#define Yes() printf("Yes\n")
#define No() printf("No\n")
#define ln cout << '\n'
template <Z A> void pr(A a) {
cout << a;
ln;
}
template <Z A, Z B> void pr(A a, B b) {
cout << a << ' ';
pr(b);
}
int ans = 0;
// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
// * * * * * *
// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
// * * * * * *
int main() {
int ans = 0;
int n;
cin >> n;
vector<int> v(n);
vector<int> a(n);
rep(i, n) cin >> v[i];
a = v;
sort(v.begin(), v.end());
rep(i, n) {
if (a[i] != v[i])
ans++;
}
if (ans == 2 || ans == 0)
YES();
else
NO();
}
| [
"identifier.change",
"call.function.change"
] | 762,970 | 762,971 | u506464494 | cpp |
p02958 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector<int> b(n);
for (int i = 0; i < n; i++) {
b[i] = i + 1;
}
int count = 0;
for (int i = 0; i < n; i++) {
if (a[i] != b[i])
count++;
}
if (count == 0 || count == 2)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector<int> b(n);
for (int i = 0; i < n; i++) {
b[i] = i + 1;
}
int count = 0;
for (int i = 0; i < n; i++) {
if (a[i] != b[i])
count++;
}
if (count == 0 || count == 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 762,972 | 762,973 | u199441105 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, N) \
for (int i = 0; i < N; i++) \
;
int main() {
int N;
cin >> N;
vector<int> P(N);
for (int i = 0; i < N; i++) {
cin >> P.at(i);
}
vector<int> A(N);
A = P;
sort(P.begin(), P.end());
int count = 0;
for (int i = 0; i < N; i++) {
if (P.at(i) == A.at(i)) {
} else
count++;
}
if (count < 2) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, N) \
for (int i = 0; i < N; i++) \
;
int main() {
int N;
cin >> N;
vector<int> P(N);
for (int i = 0; i < N; i++) {
cin >> P.at(i);
}
vector<int> A(N);
A = P;
sort(P.begin(), P.end());
int count = 0;
for (int i = 0; i < N; i++) {
if (P.at(i) == A.at(i)) {
} else {
count++;
}
}
if (count < 3) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
}
| [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 762,974 | 762,975 | u983563612 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
//定数
const long long MOD1 = 1000000007;
const long long MOD2 = 998244353;
const long double PI = 3.1415926535897932;
const long long MAXLL = 9223372036854775807;
const long long INF = 2305843009213693951;
const long long dx[] = {0, 1, 0, -1, 1, -1, 1, -1};
const long long dy[] = {1, 0, -1, 0, 1, 1, -1, -1};
//型名省略
#define ll long long
#define ull unsigned long long
#define ld long double
#define uld unsigned long double
#define pll pair<long long, long long>
#define tll(n) array<long long, (int)(n)>
#define pcc pair<char, char>
#define vl vector<long long>
#define vvl vector<vector<long long>>
#define vc vector<char>
#define vvc vector<vector<char>>
#define vb vector<bool>
#define vvb vector<vector<bool>>
#define vp vector<pair<long long, long long>>
#define vt(n) vector<array<long long, (int)(n)>>
#define umap unordered_map
#define uset unordered_set
#define Lqueue priority_queue<long long>
#define Squeue priority_queue<long long, vector<long long>, greater<long long>>
#define Fi first
#define Se second
#define mp make_pair
#define eb emplace_back
//マクロ
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define rbf(a, x) for (auto &a : x)
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define rep2(i, s, n) for (long long i = (s); i < (long long)(n); i++)
#define bitrep(i, s, n) for (long long i = (s); i < (1LL << (n)); i++)
#define Maxe(x) *max_element((x).begin(), (x).end())
#define Mine(x) *min_element((x).begin(), (x).end())
#define Size(x) ((long long)(x).size())
#define lin(s) getline(cin, (s))
// Yes,No
void Yes(bool a) { cout << (a ? "Yes" : "No") << endl; }
// YES.NO
void YES(bool a) { cout << (a ? "YES" : "NO") << endl; }
// MAX,MIN
template <class T, class U> auto max(T a, U b) { return a > b ? a : b; }
template <class T, class U> auto min(T a, U b) { return a < b ? a : b; }
//最大公約数,最小公倍数
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
//累乗
template <typename t> constexpr t mypow(t a, long long b) {
if (b == 0)
return 1;
if (a == 0)
return 0;
t x = 1;
while (b > 0) {
if (b & 1LL)
x *= a;
a *= a;
b >>= 1LL;
}
return x;
}
#define pow mypow
// chmin,chmax
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
//組み合わせ O(r)
template <typename t> constexpr t nCr(t n, long long r) {
if (r == 0)
return 1;
if (n == 0)
return 0;
if (n < r)
return 0;
t x = 1;
for (long long i = 1; i <= r; i++) {
x *= n - i + 1;
x /= i;
}
return x;
}
// main関数
signed main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
ll n;
cin >> n;
vl p(n);
rep(i, n) cin >> p[i];
ll cnt = 0;
rep(i, n) {
if (i + 1 != p[i])
cnt++;
}
Yes(cnt == 2 || cnt == 0);
} | #include <bits/stdc++.h>
using namespace std;
//定数
const long long MOD1 = 1000000007;
const long long MOD2 = 998244353;
const long double PI = 3.1415926535897932;
const long long MAXLL = 9223372036854775807;
const long long INF = 2305843009213693951;
const long long dx[] = {0, 1, 0, -1, 1, -1, 1, -1};
const long long dy[] = {1, 0, -1, 0, 1, 1, -1, -1};
//型名省略
#define ll long long
#define ull unsigned long long
#define ld long double
#define uld unsigned long double
#define pll pair<long long, long long>
#define tll(n) array<long long, (int)(n)>
#define pcc pair<char, char>
#define vl vector<long long>
#define vvl vector<vector<long long>>
#define vc vector<char>
#define vvc vector<vector<char>>
#define vb vector<bool>
#define vvb vector<vector<bool>>
#define vp vector<pair<long long, long long>>
#define vt(n) vector<array<long long, (int)(n)>>
#define umap unordered_map
#define uset unordered_set
#define Lqueue priority_queue<long long>
#define Squeue priority_queue<long long, vector<long long>, greater<long long>>
#define Fi first
#define Se second
#define mp make_pair
#define eb emplace_back
//マクロ
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define rbf(a, x) for (auto &a : x)
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define rep2(i, s, n) for (long long i = (s); i < (long long)(n); i++)
#define bitrep(i, s, n) for (long long i = (s); i < (1LL << (n)); i++)
#define Maxe(x) *max_element((x).begin(), (x).end())
#define Mine(x) *min_element((x).begin(), (x).end())
#define Size(x) ((long long)(x).size())
#define lin(s) getline(cin, (s))
// Yes,No
void Yes(bool a) { cout << (a ? "Yes" : "No") << endl; }
// YES.NO
void YES(bool a) { cout << (a ? "YES" : "NO") << endl; }
// MAX,MIN
template <class T, class U> auto max(T a, U b) { return a > b ? a : b; }
template <class T, class U> auto min(T a, U b) { return a < b ? a : b; }
//最大公約数,最小公倍数
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
//累乗
template <typename t> constexpr t mypow(t a, long long b) {
if (b == 0)
return 1;
if (a == 0)
return 0;
t x = 1;
while (b > 0) {
if (b & 1LL)
x *= a;
a *= a;
b >>= 1LL;
}
return x;
}
#define pow mypow
// chmin,chmax
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
//組み合わせ O(r)
template <typename t> constexpr t nCr(t n, long long r) {
if (r == 0)
return 1;
if (n == 0)
return 0;
if (n < r)
return 0;
t x = 1;
for (long long i = 1; i <= r; i++) {
x *= n - i + 1;
x /= i;
}
return x;
}
// main関数
signed main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
ll n;
cin >> n;
vl p(n);
rep(i, n) cin >> p[i];
ll cnt = 0;
rep(i, n) {
if (i + 1 != p[i])
cnt++;
}
YES(cnt == 2 || cnt == 0);
} | [
"identifier.change",
"call.function.change"
] | 762,976 | 762,977 | u190580703 | 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>;
int main() {
int n;
cin >> n;
vector<int> p(n);
rep(i, n) cin >> p[i];
int cnt = 0;
for (int i = 1; i <= n; i++) {
if (i != p[i - 1])
cnt++;
}
if (cnt <= 2)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> p(n);
rep(i, n) cin >> p[i];
int cnt = 0;
for (int i = 1; i <= n; i++) {
if (i != p[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"
] | 762,978 | 762,979 | u171400122 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
//宣言と入力、違いの和
int N, tigai;
cin >> N;
vector<int> p(N);
vector<int> tadasii(N);
for (int i = 0; i < N; i++) {
cin >> p[i];
tadasii[i] = i + 1;
if (p[i] != tadasii[i]) {
tigai++;
}
}
//判断、出力
if (tigai == 0 || tigai == 2) {
cout << "YES" << endl;
return 0;
}
cout << "NO" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
//宣言と入力、違いの和
int N, tigai = 0;
cin >> N;
vector<int> p(N);
vector<int> tadasii(N);
for (int i = 0; i < N; i++) {
cin >> p[i];
tadasii[i] = i + 1;
if (p[i] != tadasii[i]) {
tigai++;
}
}
//判断、出力
if (tigai == 0 || tigai == 2) {
cout << "YES" << endl;
return 0;
}
cout << "NO" << endl;
}
| [
"variable_declaration.value.change"
] | 762,987 | 762,988 | u187772564 | cpp |
p02958 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
const int INF = 1001001001;
const ll INF_LL = 1001001001001001001LL;
int main(void) {
int n;
cin >> n;
vector<int> p(n + 1);
for (int i = 1; i <= n; i++)
cin >> p[i];
int k = 0;
for (int i = 1; i <= n; i++) {
if (p[i] != i)
k++;
}
if (k > 2) {
cout << "No" << endl;
return 0;
} else {
cout << "Yes" << endl;
return 0;
}
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
const int INF = 1001001001;
const ll INF_LL = 1001001001001001001LL;
int main(void) {
int n;
cin >> n;
vector<int> p(n + 1);
for (int i = 1; i <= n; i++)
cin >> p[i];
int k = 0;
for (int i = 1; i <= n; i++) {
if (p[i] != i)
k++;
}
if (k > 2) {
cout << "NO" << endl;
return 0;
} else {
cout << "YES" << endl;
return 0;
}
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 762,999 | 763,000 | u420483676 | cpp |
p02958 | #include <bits/stdc++.h>
#define rep(i, n) for (long long i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> vec(n);
rep(i, n) { cin >> vec[i]; }
int ans = 0;
rep(i, n) {
if (vec[i] != i + 1) {
if (vec[vec[i] - 1] != i + 1) {
cout << "NO";
return 0;
}
ans++;
}
}
if (ans >= 2) {
cout << "NO";
} else {
cout << "YES";
}
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (long long i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> vec(n);
rep(i, n) { cin >> vec[i]; }
int ans = 0;
rep(i, n) {
if (vec[i] != i + 1) {
if (vec[vec[i] - 1] != i + 1) {
cout << "NO";
return 0;
}
ans++;
}
}
if (ans >= 3) {
cout << "NO";
} else {
cout << "YES";
}
return 0;
} | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 763,001 | 763,002 | u936966028 | cpp |
p02958 | #include <bits/stdc++.h>
#define rep(i, n) for (long long i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> vec(n);
rep(i, n) { cin >> vec[i]; }
int ans = 0;
rep(i, n) {
if (vec[i] != i + 1) {
if (vec[vec[i] - 1] != i + 1) {
cout << "No";
return 0;
}
ans++;
}
}
if (ans >= 2) {
cout << "No";
} else {
cout << "Yes";
}
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (long long i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> vec(n);
rep(i, n) { cin >> vec[i]; }
int ans = 0;
rep(i, n) {
if (vec[i] != i + 1) {
if (vec[vec[i] - 1] != i + 1) {
cout << "NO";
return 0;
}
ans++;
}
}
if (ans >= 3) {
cout << "NO";
} else {
cout << "YES";
}
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change",
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 763,003 | 763,002 | u936966028 | cpp |
p02958 | // nani?
#include <bits/stdc++.h>
#define pi acos(-1);
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define f(i, a, b) for (int i = a; i < b; i++)
#define sor(a) sort(a.begin(), a.end())
#define rsor(a) sort(a.rbegin(), a.rend())
#define fastio \
ios_base::sync_with_stdio(0); \
cin.tie(0)
//#define inf 1LL<<62
typedef long long ll;
typedef double ld;
using namespace std;
const ll inf = 1e10 + 6;
const ll MOD = 1e9 + 7;
const ll mod = 998244353;
// ac cmtr;
const int MAX_N = 1e6 + 5;
const int LG = 25;
#define TRACE
#ifdef TRACE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
cout << name << " : " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args) {
const char *comma = strchr(names + 1, ',');
cout.write(names, comma - names) << " : " << arg1 << " | ";
__f(comma + 1, args...);
}
#else
#define trace(...)
#endif
//---------------------------
ll a[MAX_N];
int main() {
fastio;
ll n;
cin >> n;
ll cnt = 0;
f(i, 0, n) cin >> a[i];
f(i, 0, n) {
if (a[i] == (i + 1))
cnt++;
}
if ((n - cnt) == 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
| // nani?
#include <bits/stdc++.h>
#define pi acos(-1);
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define f(i, a, b) for (int i = a; i < b; i++)
#define sor(a) sort(a.begin(), a.end())
#define rsor(a) sort(a.rbegin(), a.rend())
#define fastio \
ios_base::sync_with_stdio(0); \
cin.tie(0)
//#define inf 1LL<<62
typedef long long ll;
typedef double ld;
using namespace std;
const ll inf = 1e10 + 6;
const ll MOD = 1e9 + 7;
const ll mod = 998244353;
// ac cmtr;
const int MAX_N = 1e6 + 5;
const int LG = 25;
#define TRACE
#ifdef TRACE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
cout << name << " : " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args) {
const char *comma = strchr(names + 1, ',');
cout.write(names, comma - names) << " : " << arg1 << " | ";
__f(comma + 1, args...);
}
#else
#define trace(...)
#endif
//---------------------------
ll a[MAX_N];
int main() {
fastio;
ll n;
cin >> n;
ll cnt = 0;
f(i, 0, n) cin >> a[i];
f(i, 0, n) {
if (a[i] == (i + 1))
cnt++;
}
if ((n - cnt) <= 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 763,007 | 763,008 | u083187983 | cpp |
p02958 | // nani?
#include <bits/stdc++.h>
#define pi acos(-1);
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define f(i, a, b) for (int i = a; i < b; i++)
#define sor(a) sort(a.begin(), a.end())
#define rsor(a) sort(a.rbegin(), a.rend())
#define fastio \
ios_base::sync_with_stdio(0); \
cin.tie(0)
//#define inf 1LL<<62
typedef long long ll;
typedef double ld;
using namespace std;
const ll inf = 1e10 + 6;
const ll MOD = 1e9 + 7;
const ll mod = 998244353;
// ac cmtr;
const int MAX_N = 1e6 + 5;
const int LG = 25;
#define TRACE
#ifdef TRACE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
cout << name << " : " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args) {
const char *comma = strchr(names + 1, ',');
cout.write(names, comma - names) << " : " << arg1 << " | ";
__f(comma + 1, args...);
}
#else
#define trace(...)
#endif
//---------------------------
ll a[MAX_N];
int main() {
fastio;
ll n;
cin >> n;
ll cnt = 0;
f(i, 0, n) cin >> a[i];
f(i, 0, n) {
if (a[i] == (i + 1))
cnt++;
}
if (cnt == 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
| // nani?
#include <bits/stdc++.h>
#define pi acos(-1);
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define f(i, a, b) for (int i = a; i < b; i++)
#define sor(a) sort(a.begin(), a.end())
#define rsor(a) sort(a.rbegin(), a.rend())
#define fastio \
ios_base::sync_with_stdio(0); \
cin.tie(0)
//#define inf 1LL<<62
typedef long long ll;
typedef double ld;
using namespace std;
const ll inf = 1e10 + 6;
const ll MOD = 1e9 + 7;
const ll mod = 998244353;
// ac cmtr;
const int MAX_N = 1e6 + 5;
const int LG = 25;
#define TRACE
#ifdef TRACE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
cout << name << " : " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args) {
const char *comma = strchr(names + 1, ',');
cout.write(names, comma - names) << " : " << arg1 << " | ";
__f(comma + 1, args...);
}
#else
#define trace(...)
#endif
//---------------------------
ll a[MAX_N];
int main() {
fastio;
ll n;
cin >> n;
ll cnt = 0;
f(i, 0, n) cin >> a[i];
f(i, 0, n) {
if (a[i] == (i + 1))
cnt++;
}
if ((n - cnt) <= 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
| [
"control_flow.branch.if.condition.change"
] | 763,009 | 763,008 | u083187983 | 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 = p;
sort(q.begin(), q.end());
int cnt = 0;
for (int i = 0; i < n; i++) {
if (p[i] != q[i])
cnt++;
}
if (cnt == 2)
cout << "YES";
else
cout << "NO";
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; i++)
cin >> p[i];
vector<int> q = p;
sort(q.begin(), q.end());
int cnt = 0;
for (int i = 0; i < n; i++) {
if (p[i] != q[i])
cnt++;
}
if (cnt == 2 || cnt == 0)
cout << "YES";
else
cout << "NO";
} | [
"control_flow.branch.if.condition.change"
] | 763,030 | 763,031 | u948698924 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL << 62
#define inf 1000000007
int main() {
ll n;
cin >> n;
vector<ll> a;
for (ll i = 0; i < n; i++) {
ll now;
cin >> now;
a.push_back(now);
}
vector<ll> b = a;
sort(b.begin(), b.end());
if (a == b) {
cout << "Yes";
return 0;
}
for (ll i = 0; i < n; i++) {
for (ll j = i + 1; j < n; j++) {
vector<ll> c = a;
swap(c[i], c[j]);
if (c == b) {
cout << "Yes";
return 0;
}
}
}
cout << "No";
// your code goes here
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL << 62
#define inf 1000000007
int main() {
ll n;
cin >> n;
vector<ll> a;
for (ll i = 0; i < n; i++) {
ll now;
cin >> now;
a.push_back(now);
}
vector<ll> b = a;
sort(b.begin(), b.end());
if (a == b) {
cout << "YES";
return 0;
}
for (ll i = 0; i < n; i++) {
for (ll j = i + 1; j < n; j++) {
vector<ll> c = a;
swap(c[i], c[j]);
if (c == b) {
cout << "YES";
return 0;
}
}
}
cout << "NO";
// your code goes here
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,032 | 763,033 | u166378830 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL << 62
#define inf 1000000007
vector<ll> a, b;
int main() {
ll n;
cin >> n;
for (int i = 0; i < n; i++) {
int z;
cin >> z;
a.push_back(z);
b.push_back(z);
}
sort(b.begin(), b.end());
bool ans = true;
for (int i = 0; i < n; i++) {
if (a[i] != b[i]) {
ans = false;
break;
}
}
if (ans) {
cout << "YES";
return 0;
}
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
ans = true;
swap(a[i], a[j]);
for (int k = 0; k < n; k++) {
if (a[k] != b[k]) {
ans = false;
break;
}
}
if (ans) {
cout << "Yes";
return 0;
}
swap(a[i], a[j]);
}
}
cout << "NO";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL << 62
#define inf 1000000007
vector<ll> a, b;
int main() {
ll n;
cin >> n;
for (int i = 0; i < n; i++) {
int z;
cin >> z;
a.push_back(z);
b.push_back(z);
}
sort(b.begin(), b.end());
bool ans = true;
for (int i = 0; i < n; i++) {
if (a[i] != b[i]) {
ans = false;
break;
}
}
if (ans) {
cout << "YES";
return 0;
}
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
ans = true;
swap(a[i], a[j]);
for (int k = 0; k < n; k++) {
if (a[k] != b[k]) {
ans = false;
break;
}
}
if (ans) {
cout << "YES";
return 0;
}
swap(a[i], a[j]);
}
}
cout << "NO";
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,034 | 763,035 | u166378830 | cpp |
p02958 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
const double PI = 3.14159265358979323846;
int main() {
int n;
cin >> n;
vector<int> p(n);
vector<int> cmp(n);
rep(i, n) {
cin >> p[i];
cmp[i] = p[i];
}
sort(p.begin(), p.end());
int cnt = 0;
rep(i, n) {
if (cmp[i] != p[i])
cnt++;
}
bool flag = false;
if (cnt <= 2)
flag = true;
if (flag)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
const double PI = 3.14159265358979323846;
int main() {
int n;
cin >> n;
vector<int> p(n);
vector<int> cmp(n);
rep(i, n) {
cin >> p[i];
cmp[i] = p[i];
}
sort(p.begin(), p.end());
int cnt = 0;
rep(i, n) {
if (cmp[i] != p[i])
cnt++;
}
bool flag = false;
if (cnt <= 2)
flag = true;
if (flag)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,036 | 763,037 | u188332959 | cpp |
p02958 | #include <bits/stdc++.h>
#define pi 3.14159
using namespace std;
int main() {
int n, i, d, c = 0;
cin >> n;
int a[n], b[n];
for (i = 0; i < n; i++)
cin >> a[i];
for (i = 0; i < n; i++)
b[i] = a[i];
sort(a, a + n);
for (i = 0; i < n; i++) {
if (a[i] != b[i])
c++;
}
if (c <= 2)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | #include <bits/stdc++.h>
#define pi 3.14159
using namespace std;
int main() {
int n, i, d, c = 0;
cin >> n;
int a[n], b[n];
for (i = 0; i < n; i++)
cin >> a[i];
for (i = 0; i < n; i++)
b[i] = a[i];
sort(a, a + n);
for (i = 0; i < n; i++) {
if (a[i] != b[i])
c++;
}
if (c <= 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,045 | 763,046 | u246218976 | cpp |
p02958 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
using P = pair<int, int>;
int main() {
int N;
cin >> N;
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;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
using P = pair<int, int>;
int main() {
int N;
cin >> N;
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;
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,055 | 763,056 | u282403093 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
// Optimisations
#pragma GCC target("avx2")
#pragma GCC optimization("unroll-loops")
#pragma GCC optimize("O2")
// shortcuts for functions
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define all(v) v.begin(), v.end()
#define prec(n) fixed << setprecision(n)
#define n_l '\n'
// make it python
#define gcd __gcd
#define append push_back
#define str to_string
// utility functions shortcuts
#define max3(a, b, c) max(a, max(b, c))
#define min3(a, b, c) min(a, min(b, c))
#define sswap(a, b) \
{ \
a = a ^ b; \
b = a ^ b; \
a = a ^ b; \
}
#define swap(a, b) \
{ \
auto temp = a; \
a = b; \
b = temp; \
}
#define init(dp) memset(dp, -1, sizeof(dp));
#define set0(dp) memset(dp, 0, sizeof(dp));
#define bits(x) __builtin_popcount(x)
#define SORT(v) sort(all(v))
#define endl "\n"
#define forr(i, n) for (ll i = 0; i < n; i++)
// declaration shortcuts
typedef long long int ll;
#define int ll
// Constants
constexpr int dx[] = {-1, 0, 1, 0, 1, 1, -1, -1};
constexpr int dy[] = {0, -1, 0, 1, 1, -1, 1, -1};
constexpr ll INF = 1999999999999999997;
constexpr int inf = INT_MAX;
constexpr int MAXSIZE = int(1e6) + 5;
constexpr auto PI = 3.14159265358979323846L;
constexpr auto oo = numeric_limits<int>::max() / 2 - 2;
constexpr auto eps = 1e-6;
constexpr auto mod = 1000000007;
constexpr auto MOD = 1000000007;
constexpr auto MOD9 = 1000000009;
constexpr auto maxn = 100006;
// void IOfile(){
// freopen(file_name, reade_mode, stdin);
// freopen(file_name, write_mode, stdout);
//}
void fastio() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
}
int32_t main() {
fastio();
int n;
cin >> n;
int a[n];
forr(i, n) cin >> a[i];
if (is_sorted(a, a + n)) {
cout << "YES";
return 0;
}
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
swap(a[i], a[j]);
if (is_sorted(a, a + n)) {
cout << "YES";
return 0;
}
swap(a[i], a[i]);
}
}
cout << "NO";
} | #include <bits/stdc++.h>
using namespace std;
// Optimisations
#pragma GCC target("avx2")
#pragma GCC optimization("unroll-loops")
#pragma GCC optimize("O2")
// shortcuts for functions
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define all(v) v.begin(), v.end()
#define prec(n) fixed << setprecision(n)
#define n_l '\n'
// make it python
#define gcd __gcd
#define append push_back
#define str to_string
// utility functions shortcuts
#define max3(a, b, c) max(a, max(b, c))
#define min3(a, b, c) min(a, min(b, c))
#define sswap(a, b) \
{ \
a = a ^ b; \
b = a ^ b; \
a = a ^ b; \
}
#define swap(a, b) \
{ \
auto temp = a; \
a = b; \
b = temp; \
}
#define init(dp) memset(dp, -1, sizeof(dp));
#define set0(dp) memset(dp, 0, sizeof(dp));
#define bits(x) __builtin_popcount(x)
#define SORT(v) sort(all(v))
#define endl "\n"
#define forr(i, n) for (ll i = 0; i < n; i++)
// declaration shortcuts
typedef long long int ll;
#define int ll
// Constants
constexpr int dx[] = {-1, 0, 1, 0, 1, 1, -1, -1};
constexpr int dy[] = {0, -1, 0, 1, 1, -1, 1, -1};
constexpr ll INF = 1999999999999999997;
constexpr int inf = INT_MAX;
constexpr int MAXSIZE = int(1e6) + 5;
constexpr auto PI = 3.14159265358979323846L;
constexpr auto oo = numeric_limits<int>::max() / 2 - 2;
constexpr auto eps = 1e-6;
constexpr auto mod = 1000000007;
constexpr auto MOD = 1000000007;
constexpr auto MOD9 = 1000000009;
constexpr auto maxn = 100006;
// void IOfile(){
// freopen(file_name, reade_mode, stdin);
// freopen(file_name, write_mode, stdout);
//}
void fastio() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
}
int32_t main() {
fastio();
int n;
cin >> n;
int a[n];
forr(i, n) cin >> a[i];
if (is_sorted(a, a + n)) {
cout << "YES";
return 0;
}
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
swap(a[i], a[j]);
if (is_sorted(a, a + n)) {
cout << "YES";
return 0;
}
swap(a[i], a[j]);
}
}
cout << "NO";
} | [
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 763,061 | 763,062 | u397944802 | cpp |
p02958 | #include <iostream>
using namespace std;
int main() {
int n = 0;
cin >> n;
int difference = 0;
for (int i = 0; i < n; ++i) {
int x = 0;
cin >> x;
if (x != i + 1) {
difference++;
}
}
cout << (difference > 2 ? "No" : "Yes") << "\n";
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n = 0;
cin >> n;
int difference = 0;
for (int i = 0; i < n; ++i) {
int x = 0;
cin >> x;
if (x != i + 1) {
difference++;
}
}
cout << (difference > 2 ? "NO" : "YES") << "\n";
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,080 | 763,081 | u114053864 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, x) for (int i = 0; i < x; i++)
#define put(ans) cout << ans << endl;
int main() {
int n;
cin >> n;
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;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, x) for (int i = 0; i < x; i++)
#define put(ans) cout << ans << endl;
int main() {
int n;
cin >> n;
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;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 763,087 | 763,088 | u662871912 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
//マクロ
// forループ関係
//引数は、(ループ内変数,動く範囲)か(ループ内変数,始めの数,終わりの数)、のどちらか
// Dがついてないものはループ変数は1ずつインクリメントされ、Dがついてるものはループ変数は1ずつデクリメントされる
#define REP(i, n) for (ll i = 0; i < ll(n); i++)
#define REPD(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = a; i <= ll(b); i++)
#define FORD(i, a, b) for (ll i = a; i >= ll(b); i--)
// xにはvectorなどのコンテナ
#define ALL(x) x.begin(), x.end() // sortなどの引数を省略したい
#define SIZE(x) ll(x.size()) // sizeをsize_tからllに直しておく
//定数
#define INF 1000000000000 // 10^12:極めて大きい値,∞
#define MOD 1000000007 // 10^9+7:合同式の法
#define MAXR 100000 // 10^5:配列の最大のrange(素数列挙などで使用)
//略記
#define PB emplace_back // vectorヘの挿入
#define MP make_pair // pairのコンストラクタ
#define F first // pairの一つ目の要素
#define S second // pairの二つ目の要素
#define Umap unordered_map
#define Uset unordered_set
int main() {
ll n;
cin >> n;
vector<ll> p(n);
REP(i, n) cin >> p[i];
bool ok = true;
REP(i, n - 1) {
if (p[i] > p[i + 1]) {
ok = false;
break;
}
}
if (ok) {
cout << "Yes";
return 0;
}
REP(i, n - 1) {
ll tmp = p[i];
for (ll j = i + 1; j < n; j++) {
p[i] = p[j];
p[j] = tmp;
ok = true;
REP(i, n - 1) {
if (p[i] > p[i + 1]) {
ok = false;
break;
}
}
if (ok) {
cout << "Yes";
return 0;
} else {
p[j] = p[i];
p[i] = tmp;
}
}
}
cout << "No";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
//マクロ
// forループ関係
//引数は、(ループ内変数,動く範囲)か(ループ内変数,始めの数,終わりの数)、のどちらか
// Dがついてないものはループ変数は1ずつインクリメントされ、Dがついてるものはループ変数は1ずつデクリメントされる
#define REP(i, n) for (ll i = 0; i < ll(n); i++)
#define REPD(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = a; i <= ll(b); i++)
#define FORD(i, a, b) for (ll i = a; i >= ll(b); i--)
// xにはvectorなどのコンテナ
#define ALL(x) x.begin(), x.end() // sortなどの引数を省略したい
#define SIZE(x) ll(x.size()) // sizeをsize_tからllに直しておく
//定数
#define INF 1000000000000 // 10^12:極めて大きい値,∞
#define MOD 1000000007 // 10^9+7:合同式の法
#define MAXR 100000 // 10^5:配列の最大のrange(素数列挙などで使用)
//略記
#define PB emplace_back // vectorヘの挿入
#define MP make_pair // pairのコンストラクタ
#define F first // pairの一つ目の要素
#define S second // pairの二つ目の要素
#define Umap unordered_map
#define Uset unordered_set
int main() {
ll n;
cin >> n;
vector<ll> p(n);
REP(i, n) cin >> p[i];
bool ok = true;
REP(i, n - 1) {
if (p[i] > p[i + 1]) {
ok = false;
break;
}
}
if (ok) {
cout << "YES";
return 0;
}
REP(i, n - 1) {
ll tmp = p[i];
for (ll j = i + 1; j < n; j++) {
p[i] = p[j];
p[j] = tmp;
ok = true;
REP(i, n - 1) {
if (p[i] > p[i + 1]) {
ok = false;
break;
}
}
if (ok) {
cout << "YES";
return 0;
} else {
p[j] = p[i];
p[i] = tmp;
}
}
}
cout << "NO";
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,090 | 763,091 | u899592602 | cpp |
p02958 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> P;
for (int i = 0; i < N; i++) {
int p;
cin >> p;
P.push_back(p);
}
vector<int> P_rev = P;
sort(P_rev.begin(), P_rev.end());
int count = 0;
for (int i = 0; i < N; i++) {
if (P[i] != P_rev[i]) {
count++;
}
}
if (count == 2) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
}
| #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> P;
for (int i = 0; i < N; i++) {
int p;
cin >> p;
P.push_back(p);
}
vector<int> P_rev = P;
sort(P_rev.begin(), P_rev.end());
int count = 0;
for (int i = 0; i < N; i++) {
if (P[i] != P_rev[i]) {
count++;
}
}
if (count == 2 || count == 0) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
}
| [
"control_flow.branch.if.condition.change"
] | 763,100 | 763,101 | u312172322 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
vector<int> P(N);
for (int i = 0; i < N; i++) {
cin >> P.at(i);
}
vector<int> Q = P;
vector<int> R = P;
sort(P.begin(), P.end());
if (P == Q) {
cout << "YES" << endl;
return 0;
}
for (int i = 0; i < N; i++) {
for (int j = i + 1; j < N - i - 1; j++) {
swap(Q.at(i), Q.at(j));
if (P == Q) {
cout << "YES" << endl;
return 0;
}
swap(Q.at(i), Q.at(j));
}
}
cout << "NO" << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
vector<int> P(N);
for (int i = 0; i < N; i++) {
cin >> P.at(i);
}
vector<int> Q = P;
vector<int> R = P;
sort(P.begin(), P.end());
if (P == Q) {
cout << "YES" << endl;
return 0;
}
for (int i = 0; i < N - 1; i++) {
for (int j = i + 1; j < N; j++) {
swap(Q.at(i), Q.at(j));
if (P == Q) {
cout << "YES" << endl;
return 0;
}
swap(Q.at(i), Q.at(j));
}
}
cout << "NO" << endl;
} | [
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"expression.operation.binary.remove"
] | 763,104 | 763,103 | u199783079 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
#define FAST \
ios_base::sync_with_stdio(false); \
cin.tie(nullptr); \
cout.tie(nullptr);
#define ll long long int
void findAns() {
int n;
cin >> n;
int data[n + 1];
for (int i = 1; i <= n; i++)
cin >> data[i];
int count = 0;
for (int i = 0; i <= n; i++) {
if (data[i] != i)
count++;
}
if (count <= 2)
cout << "YES";
else
cout << "NO";
}
int main() {
// #ifndef ONLINE_JUDGE
// freopen("in.txt", "r", stdin);
// freopen("o1.txt", "w", stdout);
// cout << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s" <<
// "\n";
// #endif
FAST;
ll t = 1;
// cin >> t;
while (t--)
findAns();
}
| #include <bits/stdc++.h>
using namespace std;
#define FAST \
ios_base::sync_with_stdio(false); \
cin.tie(nullptr); \
cout.tie(nullptr);
#define ll long long int
void findAns() {
int n;
cin >> n;
int data[n + 1];
for (int i = 1; i <= n; i++)
cin >> data[i];
int count = 0;
for (int i = 1; i <= n; i++) {
if (data[i] != i)
count++;
}
if (count <= 2)
cout << "YES";
else
cout << "NO";
}
int main() {
// #ifndef ONLINE_JUDGE
// freopen("in.txt", "r", stdin);
// freopen("o1.txt", "w", stdout);
// cout << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s" <<
// "\n";
// #endif
FAST;
ll t = 1;
// cin >> t;
while (t--)
findAns();
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 763,115 | 763,116 | u939759717 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
const long long MOD = 1e9 + 7;
const long double Pi = acos(-1);
using P = pair<ll, ll>;
ll gcd(ll a, ll b) { // aとbの最大公約数を返す//計算量は0(log(max(a,b))
if (a % b == 0) {
return b;
} else {
return gcd(b, a % b);
}
}
ll lcm(ll a, ll b) { // aとbの最小公倍数を返す//計算量は0(log(max(a,b))
return a * b / gcd(a, b);
}
ll pow(ll x, ll y) { // x^yを返す//計算量は0(log(y))
ll tmp = x, res = 1;
while (y) {
if (y % 2) {
res = res * tmp % MOD;
}
y >>= 1;
tmp = tmp * tmp % MOD;
}
return res;
}
ll nature(ll a) { //絶対値を返す
if (a >= 0) {
return (a);
} else {
return (-1 * a);
}
}
ll prime(ll a) { //素数なら1を返す//計算量は0(sqrt(a))
if (a == 2) {
return 1;
} else if (a % 2 == 0 || a == 1) {
return 0;
}
for (ll i = 3; i * i <= a; i += 2) {
if (a % i == 0) {
return 0;
}
}
return 1;
}
vector<int> Z;
void z_algorithm(string str) { //計算量はO(str.size())
Z.resize(str.size());
Z.at(0) = str.size();
int m = 1, n = 0;
while (m < (int)str.size()) {
while (m + n < (int)str.size() && str.at(n) == str.at(m + n)) {
n++;
}
Z.at(m) = n;
if (n == 0) {
m++;
continue;
}
int k = 1;
while (k + Z.at(k) < n) {
Z.at(m + k) = Z.at(k);
k++;
}
m += k;
n -= k;
}
}
template <typename T> struct BIT {
//区間加算O(log(N))
//区間シグマ計算O(log(N))
//単点加算O(log(N))
//単点計算O(log(N))
int n; //元の数列のサイズ
vector<T> bit[2]; //データ収納用
vector<T> for_bubblesort;
void init(int n_) {
n = n_ + 1;
for (int j = 0; j < 2; j++) {
bit[j].assign(n, 0);
}
}
void add_sub(int p, int i, T x) {
for (int j = i; j < n; j += j & -j) {
bit[p][j] += x;
}
}
void add(int l, int r, T x) { //[l,r]に加算
add_sub(0, l, -x * (l - 1));
add_sub(0, r + 1, x * r);
add_sub(1, l, x);
add_sub(1, r + 1, -x);
}
T sum_sub(int p, int i) {
T s(0);
for (int j = i; j > 0; j -= j & -j) {
s += bit[p][j];
}
return s;
}
T sum(int i, int j) { //[i,j]のΣを計算
return sum_sub(0, j) + sum_sub(1, j) * j - sum_sub(0, i - 1) -
sum_sub(1, i - 1) * (i - 1);
}
//ここから二分探索関連
T binary_search_sum1(
int key) { // a_1+a_2+...+a_x>=keyとなるような最小のxを求める(ただしa_i>=0)
// key以上の値
if (key <= 0) {
return 0;
} else {
int x = 0, r = 1;
while (r < n) {
r = r << 1;
}
for (int length = r; length > 0;
length = length >> 1) { //長さlenは1段下るごとに半分に
if (x + length < n && sum(x + 1, x + length) < key) { //採用するとき
key -= sum(x + 1, x + length);
x += length;
}
}
return x + 1;
}
}
T binary_search_sum2(
int key) { // a_1+a_2+...+a_x<=keyとなるような最大のxを求める(ただしa_i>=0)
// key以下の値
key++;
if (key <= 0) {
return 0;
} else {
int x = 0, r = 1;
while (r < n) {
r = r << 1;
}
for (int length = r; length > 0;
length = length >> 1) { //長さlenは1段下るごとに半分に
if (x + length < n && sum(x + 1, x + length) < key) { //採用するとき
key -= sum(x + 1, x + length);
x += length;
}
}
return x;
}
}
//二分探索終わり
//ここからはbubblesort関連
void init_bubblesort(int n_) {
n = n_ + 1;
for_bubblesort.assign(n, 0);
}
void add_bubblesort(int i, T x) {
for (int j = i; j < n; j += j & -j) {
for_bubblesort[j] += x;
}
}
T calculate_bubblesort(int i) {
T s = 0;
for (int j = i; j > 0; j -= j & -j) {
s += for_bubblesort[j];
}
for (int j = i - 1; j > 0; j -= j & -j) {
s -= for_bubblesort[j];
}
return s;
}
T bubblesort() {
// bitとfor_bubblesort両方initしてadd_for_bubblesortしてから使う
int answer_for_bubblesort = 0;
int sum_for_bubblesort;
for (int i = 1; i <= n - 1; i++) {
sum_for_bubblesort = calculate_bubblesort(i);
answer_for_bubblesort += i - sum(1, sum_for_bubblesort) - 1;
add(sum_for_bubblesort, sum_for_bubblesort, 1);
}
return answer_for_bubblesort;
}
// bubblesort関連終わり
/*
使い方
BIT<int> rock;
rock.init(N); Nは加算などの操作を行う配列のサイズ
...(その後は適当に)
*/
};
template <typename T> struct BIT2D {
//単点に値たすO(1)
//[1,h][1,w]の総和O(log(h)*log(w))
//[h,hh][w,ww]の値の総和O(4*log(max(h,w,hh,ww)))
int H, W;
vector<vector<T>> bit;
void init(int H_, int W_) {
H = H_ + 1;
W = W_ + 1;
bit.assign(H, vector<T>(W, 0));
}
void add(int h, int w,
T x) { //(h,w)にxを足す0(log(h)*log(w)) (区間サイズnの場合O(N))
for (int i = h; i < H; i += i & -i) {
for (int j = w; j < W; j += j & -j) {
bit[i][j] += x;
}
}
}
T sum(int h, int w) { //[1,h][1,w]の総和O(log(h)*log(w))
T s = 0;
for (int i = h; i > 0; i -= i & -i) {
for (int j = w; j > 0; j -= j & -j) {
s += bit[i][j];
}
}
return s;
}
T partsum(int h, int w, int hh,
int ww) { //[h,hh][w,ww]の総和O(log(max(h,w,hh,ww)))
//前処理でsumを計算しておけば計算量減らせるかも
return sum(hh, ww) + sum(h - 1, w - 1) - sum(hh, w - 1) - sum(h - 1, ww);
}
};
int main() {
int N;
cin >> N;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
for (int i = 0; i < N; i++) {
for (int j = i; j < N; j++) {
int a = vec.at(i);
int b = vec.at(j);
vec.at(i) = b;
vec.at(j) = a;
int check = 0;
for (int k = 1; k < N; k++) {
if (vec.at(k) >= vec.at(k - 1)) {
check++;
}
}
if (check == N - 1) {
cout << "Yes" << endl;
return 0;
}
vec.at(i) = a;
vec.at(j) = b;
}
}
cout << "No" << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
const long long MOD = 1e9 + 7;
const long double Pi = acos(-1);
using P = pair<ll, ll>;
ll gcd(ll a, ll b) { // aとbの最大公約数を返す//計算量は0(log(max(a,b))
if (a % b == 0) {
return b;
} else {
return gcd(b, a % b);
}
}
ll lcm(ll a, ll b) { // aとbの最小公倍数を返す//計算量は0(log(max(a,b))
return a * b / gcd(a, b);
}
ll pow(ll x, ll y) { // x^yを返す//計算量は0(log(y))
ll tmp = x, res = 1;
while (y) {
if (y % 2) {
res = res * tmp % MOD;
}
y >>= 1;
tmp = tmp * tmp % MOD;
}
return res;
}
ll nature(ll a) { //絶対値を返す
if (a >= 0) {
return (a);
} else {
return (-1 * a);
}
}
ll prime(ll a) { //素数なら1を返す//計算量は0(sqrt(a))
if (a == 2) {
return 1;
} else if (a % 2 == 0 || a == 1) {
return 0;
}
for (ll i = 3; i * i <= a; i += 2) {
if (a % i == 0) {
return 0;
}
}
return 1;
}
vector<int> Z;
void z_algorithm(string str) { //計算量はO(str.size())
Z.resize(str.size());
Z.at(0) = str.size();
int m = 1, n = 0;
while (m < (int)str.size()) {
while (m + n < (int)str.size() && str.at(n) == str.at(m + n)) {
n++;
}
Z.at(m) = n;
if (n == 0) {
m++;
continue;
}
int k = 1;
while (k + Z.at(k) < n) {
Z.at(m + k) = Z.at(k);
k++;
}
m += k;
n -= k;
}
}
template <typename T> struct BIT {
//区間加算O(log(N))
//区間シグマ計算O(log(N))
//単点加算O(log(N))
//単点計算O(log(N))
int n; //元の数列のサイズ
vector<T> bit[2]; //データ収納用
vector<T> for_bubblesort;
void init(int n_) {
n = n_ + 1;
for (int j = 0; j < 2; j++) {
bit[j].assign(n, 0);
}
}
void add_sub(int p, int i, T x) {
for (int j = i; j < n; j += j & -j) {
bit[p][j] += x;
}
}
void add(int l, int r, T x) { //[l,r]に加算
add_sub(0, l, -x * (l - 1));
add_sub(0, r + 1, x * r);
add_sub(1, l, x);
add_sub(1, r + 1, -x);
}
T sum_sub(int p, int i) {
T s(0);
for (int j = i; j > 0; j -= j & -j) {
s += bit[p][j];
}
return s;
}
T sum(int i, int j) { //[i,j]のΣを計算
return sum_sub(0, j) + sum_sub(1, j) * j - sum_sub(0, i - 1) -
sum_sub(1, i - 1) * (i - 1);
}
//ここから二分探索関連
T binary_search_sum1(
int key) { // a_1+a_2+...+a_x>=keyとなるような最小のxを求める(ただしa_i>=0)
// key以上の値
if (key <= 0) {
return 0;
} else {
int x = 0, r = 1;
while (r < n) {
r = r << 1;
}
for (int length = r; length > 0;
length = length >> 1) { //長さlenは1段下るごとに半分に
if (x + length < n && sum(x + 1, x + length) < key) { //採用するとき
key -= sum(x + 1, x + length);
x += length;
}
}
return x + 1;
}
}
T binary_search_sum2(
int key) { // a_1+a_2+...+a_x<=keyとなるような最大のxを求める(ただしa_i>=0)
// key以下の値
key++;
if (key <= 0) {
return 0;
} else {
int x = 0, r = 1;
while (r < n) {
r = r << 1;
}
for (int length = r; length > 0;
length = length >> 1) { //長さlenは1段下るごとに半分に
if (x + length < n && sum(x + 1, x + length) < key) { //採用するとき
key -= sum(x + 1, x + length);
x += length;
}
}
return x;
}
}
//二分探索終わり
//ここからはbubblesort関連
void init_bubblesort(int n_) {
n = n_ + 1;
for_bubblesort.assign(n, 0);
}
void add_bubblesort(int i, T x) {
for (int j = i; j < n; j += j & -j) {
for_bubblesort[j] += x;
}
}
T calculate_bubblesort(int i) {
T s = 0;
for (int j = i; j > 0; j -= j & -j) {
s += for_bubblesort[j];
}
for (int j = i - 1; j > 0; j -= j & -j) {
s -= for_bubblesort[j];
}
return s;
}
T bubblesort() {
// bitとfor_bubblesort両方initしてadd_for_bubblesortしてから使う
int answer_for_bubblesort = 0;
int sum_for_bubblesort;
for (int i = 1; i <= n - 1; i++) {
sum_for_bubblesort = calculate_bubblesort(i);
answer_for_bubblesort += i - sum(1, sum_for_bubblesort) - 1;
add(sum_for_bubblesort, sum_for_bubblesort, 1);
}
return answer_for_bubblesort;
}
// bubblesort関連終わり
/*
使い方
BIT<int> rock;
rock.init(N); Nは加算などの操作を行う配列のサイズ
...(その後は適当に)
*/
};
template <typename T> struct BIT2D {
//単点に値たすO(1)
//[1,h][1,w]の総和O(log(h)*log(w))
//[h,hh][w,ww]の値の総和O(4*log(max(h,w,hh,ww)))
int H, W;
vector<vector<T>> bit;
void init(int H_, int W_) {
H = H_ + 1;
W = W_ + 1;
bit.assign(H, vector<T>(W, 0));
}
void add(int h, int w,
T x) { //(h,w)にxを足す0(log(h)*log(w)) (区間サイズnの場合O(N))
for (int i = h; i < H; i += i & -i) {
for (int j = w; j < W; j += j & -j) {
bit[i][j] += x;
}
}
}
T sum(int h, int w) { //[1,h][1,w]の総和O(log(h)*log(w))
T s = 0;
for (int i = h; i > 0; i -= i & -i) {
for (int j = w; j > 0; j -= j & -j) {
s += bit[i][j];
}
}
return s;
}
T partsum(int h, int w, int hh,
int ww) { //[h,hh][w,ww]の総和O(log(max(h,w,hh,ww)))
//前処理でsumを計算しておけば計算量減らせるかも
return sum(hh, ww) + sum(h - 1, w - 1) - sum(hh, w - 1) - sum(h - 1, ww);
}
};
int main() {
int N;
cin >> N;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
for (int i = 0; i < N; i++) {
for (int j = i; j < N; j++) {
int a = vec.at(i);
int b = vec.at(j);
vec.at(i) = b;
vec.at(j) = a;
int check = 0;
for (int k = 1; k < N; k++) {
if (vec.at(k) >= vec.at(k - 1)) {
check++;
}
}
if (check == N - 1) {
cout << "YES" << endl;
return 0;
}
vec.at(i) = a;
vec.at(j) = b;
}
}
cout << "NO" << endl;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,117 | 763,118 | u121974081 | cpp |
p02958 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
using ll = long long;
#define rep(i, j, n) for (int i = (j); i < (n); ++i)
#define rrep(i, j, n) for (int i = (n)-1; (j) <= i; --i)
constexpr ll MOD = 1000000007;
constexpr ll INF = 1LL << 60;
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
int n;
cin >> n;
vector<int> a(n);
rep(i, 0, n) cin >> a[i];
rep(i, 0, n) {
rep(j, i, n) {
swap(a[i], a[j]);
bool ok = true;
rep(k, 0, n - 1) {
if (a[k] > a[k + 1])
ok = false;
}
if (ok) {
cout << "Yes";
return 0;
}
swap(a[i], a[j]);
}
}
cout << "No";
return 0;
} | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
using ll = long long;
#define rep(i, j, n) for (int i = (j); i < (n); ++i)
#define rrep(i, j, n) for (int i = (n)-1; (j) <= i; --i)
constexpr ll MOD = 1000000007;
constexpr ll INF = 1LL << 60;
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
int n;
cin >> n;
vector<int> a(n);
rep(i, 0, n) cin >> a[i];
rep(i, 0, n) {
rep(j, i, n) {
swap(a[i], a[j]);
bool ok = true;
rep(k, 0, n - 1) {
if (a[k] > a[k + 1])
ok = false;
}
if (ok) {
cout << "YES";
return 0;
}
swap(a[i], a[j]);
}
}
cout << "NO";
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,127 | 763,128 | u843175622 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; i++)
cin >> p[i];
int cnt = 0;
for (int i = 0; i < n; i++) {
if (p[i] != i)
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);
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 <= 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
}
| [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 763,133 | 763,134 | u893584578 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, c = 0;
cin >> n;
vector<int> p(n), q(n);
for (int i = 0; i < n; i++)
cin >> p[i], q[i] = p[i];
sort(q.begin(), q.end());
for (int i = 0; i < n; i++)
if (p[i] != q[i])
c++;
cout << (c <= 2 ? "Yes" : "No");
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, c = 0;
cin >> n;
vector<int> p(n), q(n);
for (int i = 0; i < n; i++)
cin >> p[i], q[i] = p[i];
sort(q.begin(), q.end());
for (int i = 0; i < n; i++)
if (p[i] != q[i])
c++;
cout << (c <= 2 ? "YES" : "NO");
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,139 | 763,140 | u006472158 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rrep(i, n) for (int i = (int)(n)-1; i >= 0; --i)
#define For(i, a, b) for (auto i = (a); i <= (b); ++i)
#define rFor(i, a, b) for (auto i = (b); i >= (a); --i)
#define call(var) cerr << #var << "=" << var << "\n";
#define dup(x, y) (((x) + (y)-1) / (y))
#define all(x) (x).begin(), (x).end()
using ll = long long;
using vi = vector<int>;
using vl = vector<ll>;
using vb = vector<bool>;
using Graph = vector<vi>;
using P = pair<int, int>;
const int MOD = (int)1e9 + 7;
const int INF = (int)1e9;
const ll LINF = (ll)1e18;
const double pi = acos(-1);
template <class t, class u> inline bool chmax(t &a, u b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class t, class u> inline bool chmin(t &a, u b) {
if (b < a) {
a = b;
return true;
}
return false;
}
template <class T> istream &operator>>(istream &is, vector<T> &a) {
rep(i, a.size()) is >> a[i];
return is;
}
template <class T> ostream &operator<<(ostream &os, vector<T> &a) {
rep(i, a.size()) os << a[i] << " ";
return os;
}
template <class T, class U> istream &operator>>(istream &is, pair<T, U> &p) {
is >> p.first >> p.second;
return is;
}
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
template <class T, class U>
ostream &operator<<(ostream &os, const map<T, U> &mp) {
for (auto &t : mp)
os << t.first << " " << t.second << "\n";
return os;
}
int main() {
int n;
cin >> n;
vi p(n);
cin >> p;
vi ref(n);
iota(all(ref), 1);
if (ref == p) {
cout << "Yes\n";
return 0;
}
rep(i, n) {
for (int j = i + 1; j < n; ++j) {
swap(p[i], p[j]);
if (p == ref) {
cout << "Yes\n";
return 0;
}
swap(p[i], p[j]);
}
}
cout << "No\n";
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rrep(i, n) for (int i = (int)(n)-1; i >= 0; --i)
#define For(i, a, b) for (auto i = (a); i <= (b); ++i)
#define rFor(i, a, b) for (auto i = (b); i >= (a); --i)
#define call(var) cerr << #var << "=" << var << "\n";
#define dup(x, y) (((x) + (y)-1) / (y))
#define all(x) (x).begin(), (x).end()
using ll = long long;
using vi = vector<int>;
using vl = vector<ll>;
using vb = vector<bool>;
using Graph = vector<vi>;
using P = pair<int, int>;
const int MOD = (int)1e9 + 7;
const int INF = (int)1e9;
const ll LINF = (ll)1e18;
const double pi = acos(-1);
template <class t, class u> inline bool chmax(t &a, u b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class t, class u> inline bool chmin(t &a, u b) {
if (b < a) {
a = b;
return true;
}
return false;
}
template <class T> istream &operator>>(istream &is, vector<T> &a) {
rep(i, a.size()) is >> a[i];
return is;
}
template <class T> ostream &operator<<(ostream &os, vector<T> &a) {
rep(i, a.size()) os << a[i] << " ";
return os;
}
template <class T, class U> istream &operator>>(istream &is, pair<T, U> &p) {
is >> p.first >> p.second;
return is;
}
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
template <class T, class U>
ostream &operator<<(ostream &os, const map<T, U> &mp) {
for (auto &t : mp)
os << t.first << " " << t.second << "\n";
return os;
}
int main() {
int n;
cin >> n;
vi p(n);
cin >> p;
vi ref(n);
iota(all(ref), 1);
if (ref == p) {
cout << "YES\n";
return 0;
}
rep(i, n) {
for (int j = i + 1; j < n; ++j) {
swap(p[i], p[j]);
if (p == ref) {
cout << "YES\n";
return 0;
}
swap(p[i], p[j]);
}
}
cout << "NO\n";
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,141 | 763,142 | u607594286 | cpp |
p02958 |
#include <bits/stdc++.h>
using namespace std;
bool checkingAlgo(int koyta, int seq[]) {
int duplicate[koyta];
for (int i = 0; i < koyta; i++)
duplicate[i] = seq[i];
sort(duplicate, duplicate + koyta);
int swap = 0;
for (int i = 0; i < koyta; i++)
if (seq[i] != duplicate[i])
swap++;
if (swap == 0 || swap == 2)
return true;
else
return false;
}
int main() {
int koyta;
cin >> koyta;
int seq[koyta];
for (int i = 0; i < koyta; i++)
cin >> seq[i];
if (checkingAlgo(koyta, seq))
cout << "Yes";
else
cout << "No";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
bool checkingAlgo(int koyta, int seq[]) {
int duplicate[koyta];
for (int i = 0; i < koyta; i++)
duplicate[i] = seq[i];
sort(duplicate, duplicate + koyta);
int swap = 0;
for (int i = 0; i < koyta; i++)
if (seq[i] != duplicate[i])
swap++;
if (swap == 0 || swap == 2)
return true;
else
return false;
}
int main() {
int koyta;
cin >> koyta;
int seq[koyta];
for (int i = 0; i < koyta; i++)
cin >> seq[i];
if (checkingAlgo(koyta, seq))
cout << "YES";
else
cout << "NO";
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,143 | 763,144 | u290269504 | cpp |
p02958 | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#include <string.h>
using namespace std;
#define ll long long
#define vec vector<int>
#define vecll vector<ll>
#define vec2 vector<vector<int>>
#define vec2ll vector<vector<ll>>
#define vpair vector<pair<int, int>>
#define vpairll vector<pair<ll, ll>>
#define rep(i, n) for (ll i = (ll)0; i < (ll)n; i++)
#define REP(i, m, n) for (ll i = (ll)m; i < (ll)n; i++)
#define arr(var, n) \
vec var(n); \
rep(i, n) { cin >> var[i]; }
#define arrll(var, n) \
vecll var(n); \
rep(i, n) { cin >> var[i]; }
#define all(var) (var).begin(), (var).end()
#define sortall(var) sort(all(var))
#define mpair(v1, v2) make_pair(v1, v2)
#define pb(var) push_back(var)
#define prt(var) cout << var << "\n"
#define scn(var) cin >> var;
#define pYes() prt("Yes")
#define pNo() prt("No")
#define prtd(n, var) cout << fixed << setprecision(n) << var << "\n"
#define prt2(v1, v2) cout << v1 << " " << v2 << "\n"
#define prt3(v1, v2, v3) cout << v1 << " " << v2 << " " << v3 << "\n"
#define prtall(var) \
rep(i, var.size()) { cout << var[i] << " "; } \
cout << "\n"
//----------------------------------------------------
int main() {
int n;
cin >> n;
vec p(n);
int cnt = 0;
rep(i, n) {
cin >> p[i];
if (p[i] != i + 1)
cnt++;
}
if (cnt == 2 || cnt == 0)
cout << "Yes" << endl;
else
cout << "NO" << endl;
} | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#include <string.h>
using namespace std;
#define ll long long
#define vec vector<int>
#define vecll vector<ll>
#define vec2 vector<vector<int>>
#define vec2ll vector<vector<ll>>
#define vpair vector<pair<int, int>>
#define vpairll vector<pair<ll, ll>>
#define rep(i, n) for (ll i = (ll)0; i < (ll)n; i++)
#define REP(i, m, n) for (ll i = (ll)m; i < (ll)n; i++)
#define arr(var, n) \
vec var(n); \
rep(i, n) { cin >> var[i]; }
#define arrll(var, n) \
vecll var(n); \
rep(i, n) { cin >> var[i]; }
#define all(var) (var).begin(), (var).end()
#define sortall(var) sort(all(var))
#define mpair(v1, v2) make_pair(v1, v2)
#define pb(var) push_back(var)
#define prt(var) cout << var << "\n"
#define scn(var) cin >> var;
#define pYes() prt("Yes")
#define pNo() prt("No")
#define prtd(n, var) cout << fixed << setprecision(n) << var << "\n"
#define prt2(v1, v2) cout << v1 << " " << v2 << "\n"
#define prt3(v1, v2, v3) cout << v1 << " " << v2 << " " << v3 << "\n"
#define prtall(var) \
rep(i, var.size()) { cout << var[i] << " "; } \
cout << "\n"
//----------------------------------------------------
int main() {
int n;
cin >> n;
vec p(n);
int cnt = 0;
rep(i, n) {
cin >> p[i];
if (p[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"
] | 763,155 | 763,156 | u101048376 | cpp |
p02958 | #include <bits/stdc++.h>
#define f(i, a, b) for (ll i = a; i < b; i++)
#define af(i, a, b) for (ll i = a; i >= b; i--)
#define rep(i, a, b, k) for (ll i = a; i < b; i += k)
#define arep(i, a, b, k) for (ll i = a; i >= b; i -= k)
#define ones(x) \
(ll) __builtin_popcount(x); \
1
#define fs first
#define sc second
#define pb push_back
#define po pop_back
#define mp make_pair
#define sz(a) (ll) a.size()
#define all(a) a.begin(), a.end()
#define sor(a) sort(a.begin(), a.end())
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL)
#define ller \
ios::sync_with_stdio(false); \
cin.tie(nullptr); \
cout.tie(nullptr)
#define yes cout << "Yes\n"
#define no cout << "No\n"
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> ii;
typedef vector<ll> vi;
typedef vector<ii> vii;
const ll MAX = 10000000;
const ll inf = 5e18 - 1;
int main() {
fastio;
ll n, x, cont = 0;
cin >> n;
ll p[n], k[n];
f(i, 0, n) {
cin >> x;
p[i] = x;
}
f(i, 0, n) { k[i] = i + 1; }
f(i, 0, n) {
if (p[i] != k[i])
cont++;
}
if (cont == 2 || cont == 0)
yes;
else
no;
return 0;
} | #include <bits/stdc++.h>
#define f(i, a, b) for (ll i = a; i < b; i++)
#define af(i, a, b) for (ll i = a; i >= b; i--)
#define rep(i, a, b, k) for (ll i = a; i < b; i += k)
#define arep(i, a, b, k) for (ll i = a; i >= b; i -= k)
#define ones(x) \
(ll) __builtin_popcount(x); \
1
#define fs first
#define sc second
#define pb push_back
#define po pop_back
#define mp make_pair
#define sz(a) (ll) a.size()
#define all(a) a.begin(), a.end()
#define sor(a) sort(a.begin(), a.end())
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL)
#define ller \
ios::sync_with_stdio(false); \
cin.tie(nullptr); \
cout.tie(nullptr)
#define yes cout << "YES\n"
#define no cout << "NO\n"
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> ii;
typedef vector<ll> vi;
typedef vector<ii> vii;
const ll MAX = 10000000;
const ll inf = 5e18 - 1;
int main() {
fastio;
ll n, x, cont = 0;
cin >> n;
ll p[n], k[n];
f(i, 0, n) {
cin >> x;
p[i] = x;
}
f(i, 0, n) { k[i] = i + 1; }
f(i, 0, n) {
if (p[i] != k[i])
cont++;
}
if (cont == 2 || cont == 0)
yes;
else
no;
return 0;
} | [
"preprocessor.define.value.change"
] | 763,172 | 763,173 | u868863920 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
typedef long long ll;
#define _GLIBCXX_DEBUG
typedef vector<int> vec;
typedef vector<ll> lvec;
typedef vector<char> cvec;
typedef pair<ll, ll> LP;
typedef tuple<ll, ll, ll> LT;
typedef pair<int, int> P;
typedef tuple<int, int, int> T;
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 << "NO" << endl;
else
cout << "YES" << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
typedef long long ll;
#define _GLIBCXX_DEBUG
typedef vector<int> vec;
typedef vector<ll> lvec;
typedef vector<char> cvec;
typedef pair<ll, ll> LP;
typedef tuple<ll, ll, ll> LT;
typedef pair<int, int> P;
typedef tuple<int, int, int> T;
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;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.branch.else.remove",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 763,178 | 763,179 | u981759938 | cpp |
p02958 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#include <iostream>
typedef long long ll;
using namespace std;
int main() {
int n;
cin >> n;
int retu[n];
rep(i, n) cin >> retu[i];
int cnt = 0;
rep(i, n) {
if (i != retu[i])
cnt++;
}
if (cnt > 2)
cout << "NO" << endl;
else
cout << "YES" << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#include <iostream>
typedef long long ll;
using namespace std;
int main() {
int n;
cin >> n;
int retu[n];
rep(i, n) cin >> retu[i];
int cnt = 0;
rep(i, n) {
if (i + 1 != retu[i])
cnt++;
}
if (cnt > 2)
cout << "NO" << endl;
else
cout << "YES" << endl;
} | [
"control_flow.branch.if.condition.change"
] | 763,180 | 763,181 | u070779615 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define PI 3.14159265358979323846
constexpr int INF = numeric_limits<int>::max() / 2;
constexpr long long INFL = numeric_limits<long long>::max() / 2;
constexpr int MOD = 1000000007;
using Graph = vector<vector<int>>;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int N;
cin >> N;
int p[N];
rep(i, N) { cin >> p[i]; }
int count = 0;
rep(i, N) {
if (N - i != p[i])
count++;
}
if (count <= 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define PI 3.14159265358979323846
constexpr int INF = numeric_limits<int>::max() / 2;
constexpr long long INFL = numeric_limits<long long>::max() / 2;
constexpr int MOD = 1000000007;
using Graph = vector<vector<int>>;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int N;
cin >> N;
int p[N];
rep(i, N) { cin >> p[i]; }
int count = 0;
rep(i, N) {
if (i + 1 != p[i])
count++;
}
if (count <= 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
| [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 763,184 | 763,185 | u093973314 | cpp |
p02958 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
int main() {
ios::sync_with_stdio(false);
int n, tmp;
cin >> n;
vector<int> a(n), b(n);
rep(i, n) {
cin >> tmp;
a[i] = tmp;
b[i] = tmp;
}
sort(a.begin(), a.end());
int count = 0;
rep(i, n) {
if (a[i] != b[i])
count++;
}
if (count > 2)
cout << "No" << endl;
else
cout << "Yes" << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
int main() {
ios::sync_with_stdio(false);
int n, tmp;
cin >> n;
vector<int> a(n), b(n);
rep(i, n) {
cin >> tmp;
a[i] = tmp;
b[i] = tmp;
}
sort(a.begin(), a.end());
int count = 0;
rep(i, n) {
if (a[i] != b[i])
count++;
}
if (count > 2)
cout << "NO" << endl;
else
cout << "YES" << endl;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,186 | 763,187 | u415671616 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n), aux;
for (int i = 0; i < n; i++) {
cin >> v[i];
}
aux = v;
sort(aux.begin(), aux.end());
int c = 0;
for (int i = 0; i < n && c <= 2; i++) {
if (aux[i] != v[i]) {
c++;
}
}
if (c <= 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), aux;
for (int i = 0; i < n; i++) {
cin >> v[i];
}
aux = v;
sort(aux.begin(), aux.end());
int c = 0;
for (int i = 0; i < n && c <= 2; i++) {
if (aux[i] != v[i]) {
c++;
}
}
if (c <= 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,188 | 763,189 | u372416888 | 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);
vector<int> sP(N);
rep(i, N) {
cin >> P.at(i);
sP.at(i) = P.at(i);
}
sort(sP.begin(), sP.end());
int cnt = 0;
rep(i, N) {
if (P.at(i) != sP.at(i))
cnt++;
}
if (cnt < 3)
cout << "Yes" << endl;
else
cout << "No" << 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);
vector<int> sP(N);
rep(i, N) {
cin >> P.at(i);
sP.at(i) = P.at(i);
}
sort(sP.begin(), sP.end());
int cnt = 0;
rep(i, N) {
if (P.at(i) != sP.at(i))
cnt++;
}
if (cnt < 3)
cout << "YES" << endl;
else
cout << "NO" << endl;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,190 | 763,191 | u978308810 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.