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 1000... | #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 1000... | [
"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 ... | #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;... | [
"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<in... | #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<in... | [
"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[... | #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[... | [
"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++;
}
}
... | #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 (cn... | [
"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... | #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... | [
"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 (c... | #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 (c... | [
"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" ... | #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... | [
"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... | #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... | [
"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" <<... | #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... | [
"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... | // 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... | [
"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
... | #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
... | [
"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
... | #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
... | [
"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" << end... | [
"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)
... | #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... | [
"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;
... | #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;
... | [
"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 ... | //#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 ... | [
"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... | #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... | [
"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};
in... | /*
* 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};
in... | [
"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 += ... | #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 += ... | [
"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 += ... | #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 += ... | [
"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),... | #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),... | [] | 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 ... | #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 ... | [
"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" << end... | #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" << end... | #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... | #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... | [
"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... | #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... | [
"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... | #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... | [
"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
#defin... | /* ______
_______ /\ |``\ | | /
| / \ |__/ |____ |/
| / _ _\ | \ | |\
| / \ | \ |______ | \
Dept. of CSE
Comilla University
*/
#include <bits/stdc++.h>
#define pi 2 * acos(0.0)
#define ll long long
#defin... | [
"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 (... | #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 (... | [
"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" << end... | [
"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>
#includ... | #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>
#includ... | [
"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++;
}
i... | #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++;
}
i... | [
"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++;
}
i... | #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++;
}
i... | [
"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(NUL... | // Jai Bhole Ki
#include <bits/stdc++.h>
using namespace std;
#define fast \
static int fastline = []() { \
std::ios::sync_with_stdio(false); \
cin.tie(NUL... | [
"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];
... | #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];
... | [
"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); ... | #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); ... | [
"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); ... | #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); ... | [
"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 {
cou... | #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... | [
"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 << ... | #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 << ... | [
"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--)
... | #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--)
... | [
"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... | #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... | [
"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... | #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... | [
"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... | #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... | [
"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... | #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... | [
"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
... | #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" << end... | [
"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... | #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... | [
"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 <... | #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 <... | [
"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;
}
... | #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;
}
... | [
"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])
cou... | #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])
cou... | [
"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)) {
... | #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)) {
... | [
"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 ... | #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 ... | [
"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++)... | #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++)... | [
"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++) ... | #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++) ... | [
"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 ... | #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 ... | [
"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 ... | #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 ... | [
"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) {... | #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 == ... | [
"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;
f... | #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;
f... | [
"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] !=... | #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] !=... | [
"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] !=... | #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] !=... | [
"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 ... | // 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 ... | [
"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 ... | // 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 ... | [
"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";
... | #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... | [
"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... | #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... | [
"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 (i... | #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 (i... | [
"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())... | #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())... | [
"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)
co... | #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)
co... | [
"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" << e... | #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 << "Y... | [
"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 <<... | #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 <<... | [
"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;
els... | #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;
el... | [
"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 (... | #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 (... | [
"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; ... | #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; ... | [
"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... | #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... | [
"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... | #include <bits/stdc++.h>
using namespace std;
#define FAST \
ios_base::sync_with_stdio(false); \
cin.tie(nullptr); \
cout.tie(nullptr);
#define ll... | [
"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(... | #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(... | [
"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 = 100000... | #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 = 100000... | [
"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 ... | [
"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";... | #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";... | [
"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 (swa... |
#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 (swa... | [
"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... | #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... | [
"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) __... | #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) __... | [
"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;
typ... | #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;
typ... | [
"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" <... | #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 << "N... | [
"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>>;
in... | #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>>;
in... | [
"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 cou... | #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 cou... | [
"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)
... | #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)
... | [
"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) ... | #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) ... | [
"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.