problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k ⌀ | fixed_code stringlengths 12 526k ⌀ | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M ⌀ | fixed_submission_id int64 2 1.54M ⌀ | user_id stringlengths 10 10 ⌀ | language stringclasses 9
values |
|---|---|---|---|---|---|---|---|
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> p(N);
for (int i = 0; i < N; i++) {
cin >> p[i];
}
int tmp = 0;
for (int i = 0; i < N; i++) {
if (p[i] != i) {
tmp++;
}
}
if (tmp > 2) {
cout << "NO" << endl;
} else {
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];
}
int tmp = 0;
for (int i = 0; i < N; i++) {
if (p[i] != i + 1) {
tmp++;
}
}
if (tmp > 2) {
cout << "NO" << endl;
} else {
cout << "YES"... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 764,632 | 764,633 | u520129469 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
template <typename _Ty>
ostream &operator<<(ostream &ostr, const vector<_Ty> &v) {
if (v.empty()) {
ostr << "{ }";
return ostr;
}
ostr << "{" << v.front();
for (auto itr = ++v.begin(); itr != v.end(); itr++) {
ostr << ", " << *itr;
}
ostr << "}";
... | #include <bits/stdc++.h>
using namespace std;
template <typename _Ty>
ostream &operator<<(ostream &ostr, const vector<_Ty> &v) {
if (v.empty()) {
ostr << "{ }";
return ostr;
}
ostr << "{" << v.front();
for (auto itr = ++v.begin(); itr != v.end(); itr++) {
ostr << ", " << *itr;
}
ostr << "}";
... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 764,644 | 764,645 | u388497015 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, N, ans;
cin >> N;
vector<int> AA(N);
vector<int> BB(N);
ans = 0;
for (int i = 0; i < N; i++) {
cin >> A;
AA.at(i) = A;
BB.at(i) = A;
}
sort(AA.begin(), AA.end());
for (int i = 0; i < N; i++) {
if (AA.at(i) != BB.at... | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, N, ans;
cin >> N;
vector<int> AA(N);
vector<int> BB(N);
ans = 0;
for (int i = 0; i < N; i++) {
cin >> A;
AA.at(i) = A;
BB.at(i) = A;
}
sort(AA.begin(), AA.end());
for (int i = 0; i < N; i++) {
if (AA.at(i) != BB.at... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 764,652 | 764,651 | u041855176 | cpp |
p02958 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < n; i++)
#define ALL(a) (a).begin(), (a).end()
int main() {
int n;
cin >> n;
vector<int> p(n);
int count = 0;
rep(i, n) {
cin >> p[... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < n; i++)
#define ALL(a) (a).begin(), (a).end()
int main() {
int n;
cin >> n;
vector<int> p(n);
int count = 0;
rep(i, n) {
cin >> p[... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 764,653 | 764,654 | u969116807 | cpp |
p02958 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < n; i++)
#define ALL(a) (a).begin(), (a).end()
int main() {
int n;
cin >> n;
vector<int> p(n);
int count = 0;
rep(i, n) {
cin >> p[... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < n; i++)
#define ALL(a) (a).begin(), (a).end()
int main() {
int n;
cin >> n;
vector<int> p(n);
int count = 0;
rep(i, n) {
cin >> p[... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 764,655 | 764,654 | u969116807 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
int p[N];
vector<int> a(N);
for (int i = 0; i < N; i++) {
cin >> p[i];
a[i] = p[i];
}
sort(a.begin(), a.end());
int cnt = 0;
for (int i = 0; i < N; i++) {
if (a[i] != p[i])
cnt++;
}
if (cnt <= 2... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
int p[N];
vector<int> a(N);
for (int i = 0; i < N; i++) {
cin >> p[i];
a[i] = p[i];
}
sort(a.begin(), a.end());
int cnt = 0;
for (int i = 0; i < N; i++) {
if (a[i] != p[i])
cnt++;
}
... | [] | 764,659 | 764,660 | u634209474 | cpp |
p02958 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
int p[N];
int m = 0;
int l;
for (int i = 0; i < N; i++) {
cin >> l;
if (l != i) {
m++;
}
if (m > 2) {
break;
}
}
if (m > 2 || m == 1)... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
int p[N];
int m = 0;
int l;
for (int i = 0; i < N; i++) {
cin >> l;
if (l != (i + 1)) {
m++;
}
if (m > 2) {
break;
}
}
if (m > 2 || m... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 764,664 | 764,665 | u236809838 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, a;
a = 0;
cin >> N;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec[i];
if (vec[i] != i + 1) {
a++;
}
}
if (a == 0 || a == 2) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, a;
a = 0;
cin >> N;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec[i];
if (vec[i] != i + 1) {
a++;
}
}
if (a == 0 || a == 2) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 764,672 | 764,673 | u121538479 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, a;
a = 0;
cin >> N;
vector<char> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec[i];
if (vec[i] != i + 1) {
a++;
}
}
if (a == 0 || a == 2) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, a;
a = 0;
cin >> N;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec[i];
if (vec[i] != i + 1) {
a++;
}
}
if (a == 0 || a == 2) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} | [
"variable_declaration.type.primitive.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 764,674 | 764,673 | u121538479 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int a[N];
for (int i = 0; i < N; i++)
cin >> a[i];
int a_copy[N];
copy(a, a + N, a_copy);
bool order = false;
bool reverse = false;
for (int k = 0; k < N - 1; k++) {
if (a[k] >= a[k + 1]) {
reverse = true;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int a[N];
for (int i = 0; i < N; i++)
cin >> a[i];
int a_copy[N];
copy(a, a + N, a_copy);
bool order = false;
bool reverse = false;
for (int k = 0; k < N - 1; k++) {
if (a[k] >= a[k + 1]) {
reverse = true;
... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 764,680 | 764,681 | u932868389 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a;
cin >> n;
a = 0;
vector<pair<int, int>> p(n);
for (int i = 0; i < n; i++) {
cin >> p.at(i).first;
p.at(i).second = i + 1;
if (p.at(i).first != p.at(i).second) {
a++;
}
}
if (a > 1) {
cout << "NO" << endl;
} el... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a;
cin >> n;
a = 0;
vector<pair<int, int>> p(n);
for (int i = 0; i < n; i++) {
cin >> p.at(i).first;
p.at(i).second = i + 1;
if (p.at(i).first != p.at(i).second) {
a++;
}
}
if (a > 2) {
cout << "NO" << endl;
} el... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 764,684 | 764,685 | u222866518 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a;
cin >> n;
a = 0;
vector<pair<int, int>> p(n);
for (int i = 0; i < n; i++) {
cin >> p.at(i).first;
p.at(i).second = i + 1;
if (p.at(i).first != p.at(i).second) {
a++;
}
}
if (a % 1 != 0) {
cout << "NO" << endl;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a;
cin >> n;
a = 0;
vector<pair<int, int>> p(n);
for (int i = 0; i < n; i++) {
cin >> p.at(i).first;
p.at(i).second = i + 1;
if (p.at(i).first != p.at(i).second) {
a++;
}
}
if (a > 2) {
cout << "NO" << endl;
} el... | [
"expression.operation.binary.remove"
] | 764,686 | 764,685 | u222866518 | cpp |
p02958 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int temp;
int count = 0;
for (int i = 1; i <= n; i++) {
cin >> temp;
if (temp != i)
count++;
}
if (count == 2)
cout << "YES\n";
else
cout << "NO\n";
} | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int temp;
int count = 0;
for (int i = 1; i <= n; i++) {
cin >> temp;
if (temp != i)
count++;
}
if (count == 2 or count == 0)
cout << "YES\n";
else
cout << "NO\n";
}
| [
"control_flow.branch.if.condition.change"
] | 764,689 | 764,690 | u812922761 | cpp |
p02958 | #include <stdio.h>
int main() {
int n;
scanf("%d", &n);
int *a = new int[n];
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
int cnt = 0;
for (int i = 0; i < n; i++) {
if (a[i] != i)
cnt++;
}
if (cnt > 2)
printf("NO\n");
else
printf("YES\n");
delete[] a;
return 0;... | #include <stdio.h>
int main() {
int n;
scanf("%d", &n);
int *a = new int[n];
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
int cnt = 0;
for (int i = 0; i < n; i++) {
if (a[i] != i + 1)
cnt++;
}
if (cnt > 2)
printf("NO\n");
else
printf("YES\n");
delete[] a;
retur... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 764,691 | 764,692 | u220152525 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N;
cin >> N;
vector<long long> p;
p.reserve(N);
for (int i = 0; i < N; i++) {
long long tmp;
cin >> tmp;
p.push_back(tmp);
}
int count = 0;
for (int i = 0; i < N - 1; i++) {
if (p[i] > p[i + 1]) {
count++;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N;
cin >> N;
vector<long long> p;
p.reserve(N);
for (int i = 0; i < N; i++) {
long long tmp;
cin >> tmp;
p.push_back(tmp);
}
int count = 0;
for (int i = 0; i < N - 1; i++) {
if (p[i] > p[i + 1]) {
count++;
... | [] | 764,699 | 764,700 | u293072892 | cpp |
p02958 | #include <algorithm>
#include <iostream>
#include <utility>
#include <vector>
int main() {
auto v = std::vector<int>();
int n;
std::cin >> n;
for (int i = 0; i < n; i++) {
int num;
std::cin >> num;
v.push_back(num);
}
auto v2 = v;
std::sort(v.begin(), v.end());
int count = 0;
for (int i ... | #include <algorithm>
#include <iostream>
#include <utility>
#include <vector>
int main() {
auto v = std::vector<int>();
int n;
std::cin >> n;
for (int i = 0; i < n; i++) {
int num;
std::cin >> num;
v.push_back(num);
}
auto v2 = v;
std::sort(v2.begin(), v2.end());
int count = 0;
for (int ... | [
"identifier.change",
"call.arguments.change",
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 764,742 | 764,743 | u533749093 | cpp |
p02958 | #include "bits/stdc++.h"
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
//-----------------------------------------------------------------------------------
int n, a, m;
m = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a;
if (a != i + 1) {
m += 1;
}
... | #include "bits/stdc++.h"
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
//-----------------------------------------------------------------------------------
int n, a, m;
m = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a;
if (a != i + 1) {
m += 1;
}
... | [
"literal.string.change",
"io.output.change"
] | 764,747 | 764,748 | u373796790 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
// freopen("in.txt", "r", stdin); freopen("out.txt", "w", stdout);
int q;
cin >> q;
while (q--) {
int n;
cin >> n;
int a[n + 1], c = 0;
for (int i = 1; i <= n; i++) {
cin >> a[i];
if (a[i] != i)
c++;
}
if (c ... | #include <bits/stdc++.h>
using namespace std;
int main() {
// freopen("in.txt", "r", stdin); freopen("out.txt", "w", stdout);
int q = 1;
// cin >> q;
while (q--) {
int n;
cin >> n;
int a[n + 1], c = 0;
for (int i = 1; i <= n; i++) {
cin >> a[i];
if (a[i] != i)
c++;
}
... | [
"expression.operation.binary.remove"
] | 764,749 | 764,750 | u384737962 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
// freopen("in.txt", "r", stdin); freopen("out.txt", "w", stdout);
int q = 1;
while (q--) {
int n;
cin >> n;
int a[n + 1], c = 0;
for (int i = 1; i <= n; i++) {
cin >> a[i];
if (a[i] != i)
c++;
}
if (c == 2)
... | #include <bits/stdc++.h>
using namespace std;
int main() {
// freopen("in.txt", "r", stdin); freopen("out.txt", "w", stdout);
int q = 1;
// cin >> q;
while (q--) {
int n;
cin >> n;
int a[n + 1], c = 0;
for (int i = 1; i <= n; i++) {
cin >> a[i];
if (a[i] != i)
c++;
}
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 764,751 | 764,750 | u384737962 | cpp |
p02958 | #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 == 0 || count == N) {
cout << "YES" << endl;
} else {
cou... | #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 || count == 0) {
cout << "YES" << endl;
} else {
cout <<... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove",
"literal.number.change",
"identifier.replace.remove",
"literal.replace.add"
] | 764,752 | 764,753 | u703472020 | cpp |
p02958 | #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 == 1 || count == N) {
cout << "YES" << endl;
} else {
cou... | #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 || count == 0) {
cout << "YES" << endl;
} else {
cout <<... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove",
"literal.number.change",
"identifier.replace.remove",
"literal.replace.add"
] | 764,754 | 764,753 | u703472020 | cpp |
p02958 | // Sani buyuk Osman Pasa Plevneden cikmam diyor.
// FatihSultanMehmedHan
// Abdulhamid Han
// Bismillahirrahmanirrahim
//█▀█─█──█──█▀█─█─█
//█▄█─█──█──█▄█─█▄█
//█─█─█▄─█▄─█─█─█─█
#pragma GCC optimize("O3")
#pragma GCC target("sse4")
#include <bits/stdc++.h>
using namespace std;
typedef long long int lo;
typedef pai... | // Sani buyuk Osman Pasa Plevneden cikmam diyor.
// FatihSultanMehmedHan
// Abdulhamid Han
// Bismillahirrahmanirrahim
//█▀█─█──█──█▀█─█─█
//█▄█─█──█──█▄█─█▄█
//█─█─█▄─█▄─█─█─█─█
#pragma GCC optimize("O3")
#pragma GCC target("sse4")
#include <bits/stdc++.h>
using namespace std;
typedef long long int lo;
typedef pai... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 764,755 | 764,756 | u050607149 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define ll long long
#define maxn 200005
#define fr(i, j, k) for (int i = j; i < k; i++)
#define f(n) fr(i, 0, n)
#define f1(n) fr(i, 1, n + 1)
#define ms(i) memset(i, 0, sizeof(i));
#define ms1(i) memset(i, -1, sizeof(i));
#define F first
#define S se... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define ll long long
#define maxn 200005
#define fr(i, j, k) for (int i = j; i < k; i++)
#define f(n) fr(i, 0, n)
#define f1(n) fr(i, 1, n + 1)
#define ms(i) memset(i, 0, sizeof(i));
#define ms1(i) memset(i, -1, sizeof(i));
#define F first
#define S se... | [
"expression.operation.binary.remove"
] | 764,759 | 764,760 | u308590217 | cpp |
p02958 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, ans = 0;
vector<int> input, sorted;
cin >> n;
for (int i = 0; i < n; ++i) {
input.emplace_back();
cin >> input.back();
}
sorted = input;
sort(sorted.begin(), sorted.end());
for (int i = 0; ... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, ans = 0;
vector<int> input, sorted;
cin >> n;
for (int i = 0; i < n; ++i) {
input.emplace_back();
cin >> input.back();
}
sorted = input;
sort(sorted.begin(), sorted.end());
for (int i = 0; ... | [] | 764,766 | 764,767 | u033687371 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define ll long long
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n;
cin >> n;
ll p[n];
REP(i, n) { cin >> p[i]; }
ll cnt = 0;
REP(i, n) {
if (p[i] != i + 1) {
cnt++;
}
if (cnt > 3... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define ll long long
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n;
cin >> n;
ll p[n];
REP(i, n) { cin >> p[i]; }
ll cnt = 0;
REP(i, n) {
if (p[i] != i + 1) {
cnt++;
}
if (cnt >= ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 764,775 | 764,776 | u608499300 | cpp |
p02958 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, a;
vector<int> vec;
cin >> n;
while (cin >> a) {
vec.push_back(a);
}
for (int i = 0; i < n; i++) {
if (i + 1 != vec[i]) {
for (int j = n - 1; j > i; j--) {
if (j + 1 != vec[j]) {
... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, a;
vector<int> vec;
cin >> n;
while (cin >> a) {
vec.push_back(a);
}
for (int i = 0; i < n; i++) {
if (i + 1 != vec[i]) {
for (int j = n - 1; j > i; j--) {
if (j + 1 != vec[j]) {
... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"expression.operation.binary.add",
"control_flow.return.add",
"control_flow.return.0.add"
] | 764,784 | 764,785 | u667375816 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
#define int long long
template <class T> istream &operator>>(istream &is, vector<T> &st) {
for (size_t i = 0; i < st.size(); ++i)
is >> st[i];
return is;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &st) {
for (size_t i = 0; i < st.size()... | #include <bits/stdc++.h>
using namespace std;
#define int long long
template <class T> istream &operator>>(istream &is, vector<T> &st) {
for (size_t i = 0; i < st.size(); ++i)
is >> st[i];
return is;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &st) {
for (size_t i = 0; i < st.size()... | [
"expression.operation.unary.logical.remove",
"control_flow.branch.if.condition.change"
] | 764,802 | 764,803 | u904833081 | cpp |
p02958 | #include <iostream>
#include <math.h> // double fmod(double x, double y);
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
int hairetu[n];
for (int i = 0; i < n; i++) {
int c;
cin >> c;
hairetu[i] = c;
}
int count = 0;
for (int i = 0; i < n; i++) {
... | #include <iostream>
#include <math.h> // double fmod(double x, double y);
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
int hairetu[n];
for (int i = 0; i < n; i++) {
int c;
cin >> c;
hairetu[i] = c;
}
int count = 0;
for (int i = 0; i < n; i++) {
... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 764,804 | 764,805 | u259590403 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int n, i, a, b, c, nr, ok, v[100005];
long long sum;
int main() {
cin >> n;
for (i = 1; i <= n; i++) {
cin >> v[i];
if (i != v[i]) {
nr++;
}
}
if (nr == 0 || nr == 2) {
cout << "Yes";
} else {
cout << "No";
}
}
| #include <bits/stdc++.h>
using namespace std;
int n, i, a, b, c, nr, ok, v[100005];
long long sum;
int main() {
cin >> n;
for (i = 1; i <= n; i++) {
cin >> v[i];
if (i != v[i]) {
nr++;
}
}
if (nr == 0 || nr == 2) {
cout << "YES";
} else {
cout << "NO";
}
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 764,814 | 764,815 | u094768815 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, fault = 0;
cin >> N;
vector<int> order(N);
for (int i = 0; i < N; i++) {
cin >> order.at(i);
}
for (int j = 0; j < N; j++) {
if (order.at(j) + 1 != j + 1)
fault++;
}
if (fault <= 2)
cout << "YES" << endl;
else {
co... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, fault = 0;
cin >> N;
vector<int> order(N);
for (int i = 0; i < N; i++) {
cin >> order.at(i);
}
for (int j = 0; j < N; j++) {
if (order.at(j) != j + 1)
fault++;
}
if (fault <= 2)
cout << "YES" << endl;
else {
cout <... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 764,818 | 764,819 | u962609087 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, fault = 0;
cin >> N;
vector<int> order(N);
for (int i = 0; i < N; i++) {
cin >> order.at(i);
}
for (int j = 0; j < N - 1; j++) {
if (order.at(j) + 1 != j + 1)
fault++;
}
if (fault <= 2)
cout << "YES" << endl;
else {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, fault = 0;
cin >> N;
vector<int> order(N);
for (int i = 0; i < N; i++) {
cin >> order.at(i);
}
for (int j = 0; j < N; j++) {
if (order.at(j) != j + 1)
fault++;
}
if (fault <= 2)
cout << "YES" << endl;
else {
cout <... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 764,820 | 764,819 | u962609087 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, fault = 0;
cin >> N;
vector<int> order(N);
for (int i = 0; i < N; i++) {
cin >> order.at(i);
}
for (int j = 0; j < N - 1; j++) {
if (order.at(j) + 1 != j + 1)
fault++;
}
if (fault > 2)
cout << "YES" << endl;
else {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, fault = 0;
cin >> N;
vector<int> order(N);
for (int i = 0; i < N; i++) {
cin >> order.at(i);
}
for (int j = 0; j < N; j++) {
if (order.at(j) != j + 1)
fault++;
}
if (fault <= 2)
cout << "YES" << endl;
else {
cout <... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 764,821 | 764,819 | u962609087 | cpp |
p02958 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <istream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
#define rep0(i, n) for (long long int i = 0; i <= (n); ++i)
#define rep1(i, n) for (lo... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <istream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
#define rep0(i, n) for (long long int i = 0; i <= (n); ++i)
#define rep1(i, n) for (lo... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 764,822 | 764,823 | u820341516 | cpp |
p02958 | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define int long long
#define vec(a, n) vector<int>(a)((n));
#define Vec(a, n) vector<string>(a)((n));
#define twovec(a, n, m) vector<vector<int>> a(n, vector<int>(m, 0));
#define Twovec(a, n, m... | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define int long long
#define vec(a, n) vector<int>(a)((n));
#define Vec(a, n) vector<string>(a)((n));
#define twovec(a, n, m) vector<vector<int>> a(n, vector<int>(m, 0));
#define Twovec(a, n, m... | [] | 764,824 | 764,825 | u607741489 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
#define X first
#define Y second
#define eps 1e-5
#define gcd __gcd
#define pb push_back
#define PI acos(-1.0)
#define lowbit(x) (x) & (-x)
#define bug printf("!!!!!\n");
#define mem(x, y) memset(x, y, sizeof(x))
typedef long long LL;
typedef long double LD;
typedef pair... | #include <bits/stdc++.h>
using namespace std;
#define X first
#define Y second
#define eps 1e-5
#define gcd __gcd
#define pb push_back
#define PI acos(-1.0)
#define lowbit(x) (x) & (-x)
#define bug printf("!!!!!\n");
#define mem(x, y) memset(x, y, sizeof(x))
typedef long long LL;
typedef long double LD;
typedef pair... | [
"control_flow.return.add"
] | 764,826 | 764,827 | u030866862 | cpp |
p02958 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include... | [
"call.arguments.change"
] | 764,837 | 764,838 | u212904724 | cpp |
p02958 | #include <algorithm>
#include <bits/stdc++.h>
#include <cstdio>
using namespace std;
#define MAX_N 50
int main() {
int N;
int p[MAX_N], p2[MAX_N];
int cnt = 0;
scanf("%d", &N);
for (int i = 0; i < N; i++) {
scanf("%d", &p[i]);
p2[i] = p[i];
}
sort(p, p + N);
for (int i = 0; i < N; i++) {
... | #include <algorithm>
#include <bits/stdc++.h>
#include <cstdio>
using namespace std;
#define MAX_N 50
int main() {
int N;
int p[MAX_N], p2[MAX_N];
int cnt = 0;
scanf("%d", &N);
for (int i = 0; i < N; i++) {
scanf("%d", &p[i]);
p2[i] = p[i];
}
sort(p, p + N);
for (int i = 0; i < N; i++) {
... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 764,849 | 764,850 | u835561357 | cpp |
p02958 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int N, count = 0;
cin >> N;
vector<int> data(N);
vector<int> seisuu(N);
for (int i = 0; i < N; i++) {
cin >> data.at(i);
seisuu.at(i) = i + 1;
}
rep(i, N - 1) {
if ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int N, count = 0;
cin >> N;
vector<int> data(N);
vector<int> seisuu(N);
for (int i = 0; i < N; i++) {
cin >> data.at(i);
seisuu.at(i) = i + 1;
}
rep(i, N) {
if (dat... | [
"expression.operation.binary.remove"
] | 764,853 | 764,854 | u728628785 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, i, k;
cin >> N;
vector<int> vec(N);
for (i = 0; i < N; i++)
cin >> vec[i];
for (i = 0; i < N; i++) {
if (vec[i] != i) {
k++;
}
}
if (k <= 2) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, i, k;
cin >> N;
k = 0;
vector<int> vec(N);
for (i = 0; i < N; i++)
cin >> vec[i];
for (i = 0; i < N; i++) {
if (vec[i] != i + 1) {
k++;
}
}
if (k <= 2) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
... | [
"assignment.add",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 764,860 | 764,861 | u840958781 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int d = 0;
for (int i = 1; i <= n; i++) {
int p;
cin >> p;
if (p != i)
d++;
}
cout << (d <= 2 ? "Yes" : "No") << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int d = 0;
for (int i = 1; i <= n; i++) {
int p;
cin >> p;
if (p != i)
d++;
}
cout << (d <= 2 ? "YES" : "NO") << endl;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 764,864 | 764,865 | u820225607 | cpp |
p02958 | // #include <iostream>
// #include <string>
// #include <math.h>
// #include <map>
// #include <vector>
// #include <tuple>
// #include <algorithm>
// #include <queue>
#include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define vi vector<int>
#define vlli vector<lli>
#define pii pair<int, int>
#defi... | // #include <iostream>
// #include <string>
// #include <math.h>
// #include <map>
// #include <vector>
// #include <tuple>
// #include <algorithm>
// #include <queue>
#include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define vi vector<int>
#define vlli vector<lli>
#define pii pair<int, int>
#defi... | [
"literal.string.change",
"literal.string.case.change",
"variable_declaration.value.change",
"assignment.value.change"
] | 764,866 | 764,867 | u201489353 | cpp |
p02958 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long double ld;
typedef long long int ll;
ty... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long double ld;
typedef long long int ll;
ty... | [
"control_flow.branch.if.condition.change"
] | 764,869 | 764,870 | u961198482 | cpp |
p02958 | #include <bits/stdc++.h>
#include <unordered_map>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
typedef long long ll;
int main() {
int n = 0;
cin >> n;
vector<int> p(n);
rep(i, n) cin >> p[i];
int countWrong = 0;
rep(i, n - 1) {
if (p[i] != i + 1)
countWrong++;
}
if (co... | #include <bits/stdc++.h>
#include <unordered_map>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
typedef long long ll;
int main() {
int n = 0;
cin >> n;
vector<int> p(n);
rep(i, n) cin >> p[i];
int countWrong = 0;
rep(i, n) {
if (p[i] != i + 1)
countWrong++;
}
if (countW... | [
"expression.operation.binary.remove"
] | 764,878 | 764,879 | u999669171 | cpp |
p02958 | #include <iostream>
using namespace std;
bool is_sorted(int n, int *arr) {
for (int i = 1; i < n; i++) {
if (arr[i] < arr[i - 1]) {
return false;
}
}
return true;
}
int main() {
int n;
scanf("%d", &n);
int a[n];
for (int i = 0; i < n; i++) {
scanf("%d", a + i);
}
for (int i = 0; i... | #include <iostream>
using namespace std;
bool is_sorted(int n, int *arr) {
for (int i = 1; i < n; i++) {
if (arr[i] < arr[i - 1]) {
return false;
}
}
return true;
}
int main() {
int n;
scanf("%d", &n);
int a[n];
for (int i = 0; i < n; i++) {
scanf("%d", a + i);
}
for (int i = 0; i... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 764,880 | 764,881 | u625436307 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int ans, n, a[1000000], mx, b[1000000];
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
if (a[i] != i)
ans++;
}
if (ans <= 2)
cout << "Yes";
else
cout << "No";
}
| #include <bits/stdc++.h>
using namespace std;
int ans, n, a[1000000], mx, b[1000000];
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
if (a[i] != i)
ans++;
}
if (ans <= 2)
cout << "YES";
else
cout << "NO";
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 764,889 | 764,890 | u087818812 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, l, r) for (int i = (int)(l); i < (int)(r); i++)
typedef long long ll;
ll MOD = 1000000007;
int main() {
int N, cnt = 0;
cin >> N;
vector<int> a(N, 0);
rep(i, 0, N) {
cin >> a[i];
if (i != a[i])
cnt++;
}
if (cnt > 2)
cout << "NO... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, l, r) for (int i = (int)(l); i < (int)(r); i++)
typedef long long ll;
ll MOD = 1000000007;
int main() {
int N, cnt = 0;
cin >> N;
vector<int> a(N, 0);
rep(i, 0, N) {
cin >> a[i];
if (i + 1 != a[i])
cnt++;
}
if (cnt > 2)
cout <<... | [
"control_flow.branch.if.condition.change"
] | 764,893 | 764,894 | u831873811 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int p, n, k;
int main() {
scanf("%d", n);
for (int i = 1; i <= n; i++) {
scanf("%d", &p);
if (p != i) {
k++;
}
}
if (k > 2) {
printf("NO");
} else
printf("YES");
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int p, n, k;
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &p);
if (p != i) {
k++;
}
}
if (k > 2) {
printf("NO");
} else
printf("YES");
return 0;
}
| [
"expression.operation.unary.reference.add"
] | 764,899 | 764,900 | u623089552 | 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 p[n], p2[n];
rep(i, n) {
cin >> p[i];
p2[i] = p[i];
}
sort(p, p + n);
int count = 0;
rep(i, n) {
if (p[i] != p2[i]) {
/* code */
... | #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 p[n], p2[n];
rep(i, n) {
cin >> p[i];
p2[i] = p[i];
}
sort(p, p + n);
int count = 0;
rep(i, n) {
if (p[i] != p2[i]) {
/* code */
... | [
"literal.string.change",
"io.output.change"
] | 764,929 | 764,930 | u376859266 | 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 p[n], p2[n];
rep(i, n) {
cin >> p[i];
p[i] = p2[i];
}
sort(p, p + n);
int count = 0;
rep(i, n) {
if (p[i] != p2[i]) {
/* code */
... | #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 p[n], p2[n];
rep(i, n) {
cin >> p[i];
p2[i] = p[i];
}
sort(p, p + n);
int count = 0;
rep(i, n) {
if (p[i] != p2[i]) {
/* code */
... | [
"assignment.variable.change",
"identifier.change",
"assignment.value.change",
"literal.string.change",
"io.output.change"
] | 764,931 | 764,930 | u376859266 | cpp |
p02958 |
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int p[n];
for (int i = 0; i < n; i++) {
cin >> n;
}
int a;
int count = 0;
for (int i = 0; i < n; i++) {
if (p[i] != i + 1) {
count++;
}
}
if (count <= 2) {
cout << "YES" << endl;
} else {
cout << ... |
#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 a;
int count = 0;
for (int i = 0; i < n; i++) {
if (p[i] != i + 1) {
count++;
}
}
if (count <= 2) {
cout << "YES" << endl;
} else {
cout ... | [
"expression.operation.binary.change"
] | 764,936 | 764,937 | u289709148 | cpp |
p02958 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using lli = int_fast64_t;
using ulli = uint_fast64_t;
#define debug(x) cerr << #x << " : " << x << endl
#define debugv(... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using lli = int_fast64_t;
using ulli = uint_fast64_t;
#define debug(x) cerr << #x << " : " << x << endl
#define debugv(... | [
"control_flow.branch.if.condition.change"
] | 764,938 | 764,939 | u031593168 | 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.at(i);
}
int count = 0;
for (int i = 0; i < N; i++) {
if (vec.at(i) != i) {
count += 1;
}
}
if (count == 0 or 2) {
cout << "YES" << endl;
} ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
int count = 0;
for (int i = 0; i < N; i++) {
if (vec.at(i) != i + 1) {
count += 1;
}
}
if (count == 0 || count == 2) {
cout << "YES" ... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 764,946 | 764,947 | u579355226 | cpp |
p02958 | #include <algorithm>
#include <cstdio>
using namespace std;
int N, x, cnt;
int main() {
scanf("%d", &N);
for (int i = 1; i <= N; i++) {
scanf("%d", &x);
if (x != i)
cnt++;
}
puts(cnt > 2 ? "No" : "Yes");
return 0;
} | #include <algorithm>
#include <cstdio>
using namespace std;
int N, x, cnt;
int main() {
scanf("%d", &N);
for (int i = 1; i <= N; i++) {
scanf("%d", &x);
if (x != i)
cnt++;
}
puts(cnt > 2 ? "NO" : "YES");
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 764,948 | 764,949 | u962441451 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> vec(n);
int cnt;
for (int i = 0; i < n; i++) {
cin >> vec[i];
if (i + 1 != vec[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> vec(n);
int cnt = 0;
for (int i = 0; i < n; i++) {
cin >> vec[i];
if ((i + 1) != vec[i]) {
cnt++;
}
}
if (cnt <= 2) {
cout << "YES";
} else {
cout << "NO";
}
}
| [
"variable_declaration.value.change",
"control_flow.branch.if.condition.change"
] | 764,960 | 764,961 | u529813812 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> vec(n);
int cnt;
for (int i = 0; i < n; i++) {
cin >> vec[i];
if ((i + 1) != vec[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> vec(n);
int cnt = 0;
for (int i = 0; i < n; i++) {
cin >> vec[i];
if ((i + 1) != vec[i]) {
cnt++;
}
}
if (cnt <= 2) {
cout << "YES";
} else {
cout << "NO";
}
}
| [
"variable_declaration.value.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 764,962 | 764,961 | u529813812 | cpp |
p02958 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, cnt = 0;
int a[53];
int x[53], y[53];
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
x[i] = a[i];
}
sort(a, a + n);
for (int i = 0; i < n; i++) {
y[i] = a[i];
if (x[i] == y[i]) {
cnt++;
}
... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, cnt = 0;
int a[53];
int x[53], y[53];
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
x[i] = a[i];
}
sort(a, a + n);
for (int i = 0; i < n; i++) {
y[i] = a[i];
if (x[i] != y[i]) {
cnt++;
}
... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 764,973 | 764,974 | u403331159 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) REP(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for (int i = x; i < n; i++)
#define OP(m) cout << m << endl;
int main() {
int N;
cin >> N;
int p[N];
rep(i, N) { cin >> p[i]; }
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) REP(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for (int i = x; i < n; i++)
#define OP(m) cout << m << endl;
int main() {
int N;
cin >> N;
int p[N];
rep(i, N) { cin >> p[i]; }
... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change"
] | 764,979 | 764,980 | u016189984 | cpp |
p02958 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int p[60];
for (int i = 0; i < N; ++i) {
cin >> p[i];
}
int count = 0;
for (int i = 0; i < N - 1; i++) {
if (i != p[i]) {
count += 1;
}
}
if (count <= 2) {
cout << "YES" << endl;
} ... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int p[60];
for (int i = 0; i < N; ++i) {
cin >> p[i];
}
int count = 0;
for (int i = 0; i < N; i++) {
if ((i + 1) != p[i]) {
count += 1;
}
}
if (count <= 2) {
cout << "YES" << endl;
... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 764,986 | 764,987 | u922524000 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; i++)
cin >> p.at(i);
int count = 0;
for (int i = 0; i < n; i++) {
if (p.at(i) == i + 1)
count++;
}
if (count < 3)
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.at(i);
int count = 0;
for (int i = 0; i < n; i++) {
if (p.at(i) != i + 1)
count++;
}
if (count < 3)
cout << "YES";
else
cout << "NO";
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 764,992 | 764,993 | u389766217 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; i++) {
cin >> p[i];
}
int count = 0;
for (int i = 0; i < n; i++) {
if (p[i] != i + 1)
count++;
}
if (count == 2 || count == 0)
cout << "Yes" << endl;
else
cout <... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; i++) {
cin >> p[i];
}
int count = 0;
for (int i = 0; i < n; i++) {
if (p[i] != i + 1)
count++;
}
if (count == 2 || count == 0)
cout << "YES" << endl;
else
cout <... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 764,998 | 764,999 | u544165468 | cpp |
p02958 | #include <iostream>
using namespace std;
int n, i = 0, cnt = 0;
int a[50] = {};
int main() {
cin >> n;
for (i; i < n; i++) {
cin >> a[i];
if (a[i] != i)
cnt++;
}
if (cnt == 0 || 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
}
| #include <iostream>
using namespace std;
int n, i = 0, cnt = 0;
int a[50] = {};
int main() {
cin >> n;
for (i; i < n; i++) {
cin >> a[i];
if (a[i] != i + 1)
cnt++;
}
if (cnt == 0 || 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"
] | 765,010 | 765,011 | u332153950 | cpp |
p02958 | #include <iostream>
using namespace std;
int main(void) {
int N, count = 0;
cin >> N;
int p[N];
for (int i = 0; i < N; i++) {
cin >> p[i];
if (p[i] != i) {
count++;
}
}
if (count <= 2) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main(void) {
int N, count = 0;
cin >> N;
int p[N];
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;
}
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 765,012 | 765,013 | u572193732 | cpp |
p02958 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
#define CHMAX(a, b) a = std::max(a, b)
#define CHMIN(a, b) a = std::min(a, b)
#define CHABS(a) a = std::abs(a)
#define COUT(a) std::cout << a << std::endl
#define CERR(a) std... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
#define CHMAX(a, b) a = std::max(a, b)
#define CHMIN(a, b) a = std::min(a, b)
#define CHABS(a) a = std::abs(a)
#define COUT(a) std::cout << a << std::endl
#define CERR(a) std... | [
"control_flow.branch.if.condition.change"
] | 765,018 | 765,019 | u155216115 | cpp |
p02958 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#include <cmath>
typedef long long ll;
using namespace std;
vector<int> arr;
stack<int> st;
queue<int> qu;
queue<pair<int, int>> qu2;
priority_queue<int> pq;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, n) for (int i = 1; i <= (int)(n); i++)
typede... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#include <cmath>
typedef long long ll;
using namespace std;
vector<int> arr;
stack<int> st;
queue<int> qu;
queue<pair<int, int>> qu2;
priority_queue<int> pq;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, n) for (int i = 1; i <= (int)(n); i++)
typede... | [
"literal.string.change",
"io.output.change"
] | 765,020 | 765,021 | u300866293 | cpp |
p02958 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#include <cmath>
typedef long long ll;
using namespace std;
vector<int> arr;
stack<int> st;
queue<int> qu;
queue<pair<int, int>> qu2;
priority_queue<int> pq;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, n) for (int i = 1; i <= (int)(n); i++)
typede... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#include <cmath>
typedef long long ll;
using namespace std;
vector<int> arr;
stack<int> st;
queue<int> qu;
queue<pair<int, int>> qu2;
priority_queue<int> pq;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, n) for (int i = 1; i <= (int)(n); i++)
typede... | [
"control_flow.branch.if.condition.change",
"literal.string.change",
"io.output.change"
] | 765,022 | 765,021 | u300866293 | cpp |
p02958 | //
// Created by yamunaku on 2019/07/30.
//
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repl(i, l, r) for (int i = (l); i < (r); i++)
#define per(i, n) for (int i = ((n)-1); i >= 0; i--)
#define perl(i, l, r) for (int i = ((r)-1); i >= (l); i--)
#define all(x... | //
// Created by yamunaku on 2019/07/30.
//
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repl(i, l, r) for (int i = (l); i < (r); i++)
#define per(i, n) for (int i = ((n)-1); i >= 0; i--)
#define perl(i, l, r) for (int i = ((r)-1); i >= (l); i--)
#define all(x... | [
"expression.operation.binary.remove"
] | 765,044 | 765,045 | u405923605 | cpp |
p02958 | #include <algorithm>
#include <iostream>
#include <vector>
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[i];
}
for (int i = 0; i < N; ++i) {
B[i] = A[i];
}
sort(A.begin(), A.end());
int count = 0;
for (int i ... | #include <algorithm>
#include <iostream>
#include <vector>
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[i];
}
for (int i = 0; i < N; ++i) {
B[i] = A[i];
}
sort(A.begin(), A.end());
int count = 0;
for (int i ... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 765,058 | 765,059 | u799815347 | cpp |
p02958 | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
// #define USE_LLONG_AS_INT
#ifdef USE_LLONG_AS_INT
#define int long long
#define inf (1ll << 60)
#else
#define inf (1 << 30)
#endif
#define rep(i, n) for (int i = 0; i < n; i++)
#define Rep(i, a, b) for (int i = a; i < b; i++)
#define REP(i, a, b) for (int i = a; i <=... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
// #define USE_LLONG_AS_INT
#ifdef USE_LLONG_AS_INT
#define int long long
#define inf (1ll << 60)
#else
#define inf (1 << 30)
#endif
#define rep(i, n) for (int i = 0; i < n; i++)
#define Rep(i, a, b) for (int i = a; i < b; i++)
#define REP(i, a, b) for (int i = a; i <=... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change",
"identifier.change",
"call.function.change"
] | 765,082 | 765,083 | u128527648 | cpp |
p02958 | #include <iostream>
using namespace std;
int main() {
int N, c = 0;
cin >> N;
for (int i = 0; i < N; i++) {
int tmp;
cin >> tmp;
if (tmp != i)
c++;
}
if (c <= 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int N, c = 0;
cin >> N;
for (int i = 1; i <= N; i++) {
int tmp;
cin >> tmp;
if (tmp != i)
c++;
}
if (c <= 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 765,084 | 765,085 | u660918420 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int n, a, cnt = 0;
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a;
if (a != 1)
cnt++;
}
if (cnt <= 2)
cout << "YES";
else
cout << "NO";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int n, a, cnt = 0;
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a;
if (a != i)
cnt++;
}
if (cnt <= 2)
cout << "YES";
else
cout << "NO";
return 0;
} | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 765,096 | 765,097 | u625749244 | cpp |
p02958 | #pragma GCC optimize(2)
#include <bits/stdc++.h>
#define ULL unsigned long long
#define LL long long
#define Max 1000005
#define mem(a, b) memset(a, b, sizeof(a));
#define pb push_back
#define mp make_pair
#define input \
ios::sync_with_stdio(false); ... | #pragma GCC optimize(2)
#include <bits/stdc++.h>
#define ULL unsigned long long
#define LL long long
#define Max 1000005
#define mem(a, b) memset(a, b, sizeof(a));
#define pb push_back
#define mp make_pair
#define input \
ios::sync_with_stdio(false); ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 765,098 | 765,099 | u319460075 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
long long int mod = 1e9 + 7;
int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};
//////////////////////////////////
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
vector<int> b ... | #include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
long long int mod = 1e9 + 7;
int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};
//////////////////////////////////
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
vector<int> b ... | [
"control_flow.branch.if.condition.change"
] | 765,103 | 765,104 | u543657872 | cpp |
p02958 | #include <iostream>
using namespace std;
int main() {
int n, cnt = 0;
int *x;
cin >> n;
x = new int[n];
for (int i = 0; i < n; i++) {
cin >> x[i];
if (x[i] != i)
cnt++;
}
if (cnt <= 2)
cout << "YES\n";
else
cout << "NO\n";
delete[] x;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n, cnt = 0;
int *x;
cin >> n;
x = new int[n];
for (int i = 0; i < n; i++) {
cin >> x[i];
if (x[i] != i + 1)
cnt++;
}
if (cnt <= 2)
cout << "YES\n";
else
cout << "NO\n";
delete[] x;
return 0;
} | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 765,113 | 765,114 | u518383459 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> mao(n);
for (int i = 0; i < n; i++) {
cin >> mao.at(i);
}
vector<int> mao2 = mao;
sort(mao2.begin(), mao2.end());
int z = 0;
for (int i = 0; i < n; i++) {
if (mao.at(i) == mao2.at(i)) {
z++;
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> mao(n);
for (int i = 0; i < n; i++)
cin >> mao.at(i);
vector<int> mao2 = mao;
sort(mao2.begin(), mao2.end());
int z = 0;
for (int i = 0; i < n; i++) {
if (mao.at(i) != mao2.at(i)) {
z++;
}
}
... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 765,119 | 765,120 | u107406081 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> mao(n);
for (int i = 0; i < n; i++) {
cin >> mao.at(i);
}
vector<int> mao2 = mao;
sort(mao2.begin(), mao2.end());
int z = 0;
for (int i = 0; i < n; i++) {
if (mao.at(i) == mao2.at(i)) {
z++;
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> mao(n);
for (int i = 0; i < n; i++) {
cin >> mao.at(i);
}
vector<int> mao2 = mao;
sort(mao2.begin(), mao2.end());
int z = 0;
for (int i = 0; i < n; i++) {
if (mao.at(i) != mao2.at(i)) {
z++;
}
... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 765,119 | 765,121 | u107406081 | cpp |
p02958 | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
ios_base::sync_with_stdio(0);
int N;
cin >> N;
vector<int> p;
for (int i = 0; i < N; i++) {
int a;... | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
ios_base::sync_with_stdio(0);
int N;
cin >> N;
vector<int> p;
for (int i = 0; i < N; i++) {
int a;... | [] | 765,122 | 765,123 | u854904794 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, c = 0;
cin >> n;
vector<int> a, b;
for (int i = 0; i < n; i++) {
cin >> x;
a.push_back(x);
b.push_back(x);
}
sort(a.begin(), a.end());
for (int i = 0; i < n; i++) {
if (a[i] != b[i]) {
c++;
}
}
if (c != 2 |... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, c = 0;
cin >> n;
vector<int> a, b;
for (int i = 0; i < n; i++) {
cin >> x;
a.push_back(x);
b.push_back(x);
}
sort(a.begin(), a.end());
for (int i = 0; i < n; i++) {
if (a[i] != b[i]) {
c++;
}
}
// cout<<"c:... | [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 765,126 | 765,127 | u934614238 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = n; i >= 0; i++)
#define REP(i, m, n) for (int i = m; i < n; i++)
#define SORT(v) sort((v).begin(), (v).end())
#define REV(v) sort((v).begin(), (v).end(... | #include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = n; i >= 0; i++)
#define REP(i, m, n) for (int i = m; i < n; i++)
#define SORT(v) sort((v).begin(), (v).end())
#define REV(v) sort((v).begin(), (v).end(... | [
"control_flow.branch.if.condition.change"
] | 765,128 | 765,129 | u681869152 | cpp |
p02958 | //↓template↓
#include "bits/stdc++.h"
using namespace std;
/*#define Would
#define you
#define all(n) n.begin(),n.end()
#define rall(n) n.rbegin(),n.rend()*/
typedef long long ll;
// typedef complex<double>P;
/*const ll INF = 1e18;
const ll MOD = 1e9 + 7;
const double EPS = 1e-10;
const double pi = acos(-1);//3.14159... | //↓template↓
#include "bits/stdc++.h"
using namespace std;
/*#define Would
#define you
#define all(n) n.begin(),n.end()
#define rall(n) n.rbegin(),n.rend()*/
typedef long long ll;
// typedef complex<double>P;
/*const ll INF = 1e18;
const ll MOD = 1e9 + 7;
const double EPS = 1e-10;
const double pi = acos(-1);//3.14159... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 765,130 | 765,131 | u539402331 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> arr(n + 1);
for (int i = 1; i <= n; i++) {
cin >> arr[i];
}
int cnt = 0;
for (int i = 1; i <= n; i++) {
if (arr[i] != i) {
cnt++;
}
}
if (cnt <= 1)
cout << "YES" << endl;
else
cout... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> arr(n + 1);
for (int i = 1; i <= n; i++) {
cin >> arr[i];
}
int cnt = 0;
for (int i = 1; i <= n; i++) {
if (arr[i] != i) {
cnt++;
}
}
if (cnt <= 2)
cout << "YES" << endl;
else
cout... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 765,132 | 765,133 | u798647946 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> p(n);
int diff_num = 0;
int diff[n];
for (int i = 0; i < n; i++) {
cin >> p.at(i);
if (i + 1 != p.at(i)) {
diff[diff_num] = i;
diff_num++;
}
}
if (diff_num == 0) {
cout << "YES" << en... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> p(n);
int diff_num = 0;
int diff[n];
for (int i = 0; i < n; i++) {
cin >> p.at(i);
if (i + 1 != p.at(i)) {
diff[diff_num] = i;
diff_num++;
}
}
if (diff_num == 0) {
cout << "YES" << en... | [
"control_flow.branch.if.condition.change"
] | 765,139 | 765,140 | u469502684 | cpp |
p02958 | #include <bits/stdc++.h>
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define REPR(i, n) for (int(i) = (n); (i) >= 0; (i)--)
#define FOR(i, m, n) for (int(i) = (m); (i) < (n); (i)++)
#define INF 1e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
bool compare_by_b(pair<int, int> a,... | #include <bits/stdc++.h>
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define REPR(i, n) for (int(i) = (n); (i) >= 0; (i)--)
#define FOR(i, m, n) for (int(i) = (m); (i) < (n); (i)++)
#define INF 1e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
bool compare_by_b(pair<int, int> a,... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 765,143 | 765,144 | u276682785 | cpp |
p02958 | #include <iostream>
#include <vector>
using namespace std;
int main(void) {
int n;
int cnt = 0;
vector<int> v;
cin >> n;
int buf;
for (int i = 0; i < n; i++) {
cin >> buf;
v.push_back(buf);
}
for (int i = 0; i < n; i++) {
if (v[i] != i + 1)
cnt++;
if (cnt > 3) {
cout << "N... | #include <iostream>
#include <vector>
using namespace std;
int main(void) {
int n;
int cnt = 0;
vector<int> v;
cin >> n;
int buf;
for (int i = 0; i < n; i++) {
cin >> buf;
v.push_back(buf);
}
for (int i = 0; i < n; i++) {
if (v[i] != i + 1)
cnt++;
if (cnt >= 3) {
cout << "... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 765,147 | 765,148 | u610897920 | cpp |
p02958 | #include <bits/stdc++.h> //B
using namespace std;
int main() {
int n, temp, sign = 0;
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &temp);
if (temp != i)
sign++;
}
if (sign == 0 || sign == 2)
printf("Yes\n");
else
printf("No\n");
return 0;
} | #include <bits/stdc++.h> //B
using namespace std;
int main() {
int n, temp, sign = 0;
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &temp);
if (temp != i)
sign++;
}
if (sign == 0 || sign == 2)
printf("YES\n");
else
printf("NO\n");
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 765,149 | 765,150 | u286704543 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main(void) {
int n;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; i++) {
cin >> p[i];
}
bool flag = true;
for (int i = 0; i < n; i++) {
for (int j = i; j < n; j++) {
vector<int> tmp(n);
for (int k = 0; k < n;... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main(void) {
int n;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; i++) {
cin >> p[i];
}
bool flag = true;
for (int i = 0; i < n; i++) {
for (int j = i; j < n; j++) {
vector<int> tmp(n);
for (int k = 0; k < n;... | [
"assignment.add"
] | 765,153 | 765,154 | u030848580 | cpp |
p02958 | #include <bits/stdc++.h>
#include <cstdlib>
#include <ctime>
#define rep(i, N) for (long i = 0; i < (N); i++)
#define swap(a, b) (a += b, b = a - b, a -= b)
using namespace std;
int main() {
int N;
cin >> N;
vector<int> p(N), q(N), key(2);
int sum = 0;
rep(i, N) {
cin >> p[i];
if (p[i] != i + 1) {
... | #include <bits/stdc++.h>
#include <cstdlib>
#include <ctime>
#define rep(i, N) for (long i = 0; i < (N); i++)
#define swap(a, b) (a += b, b = a - b, a -= b)
using namespace std;
int main() {
int N;
cin >> N;
vector<int> p(N), q(N), key(2);
int sum = 0;
rep(i, N) {
cin >> p[i];
if (p[i] != i + 1) {
... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 765,155 | 765,156 | u466393447 | cpp |
p02958 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> p(N);
for (int i = 0; i < N; i++) {
cin >> p.at(i);
}
int cnt = 0;
vector<int> a(2);
for (int i = 0; i < N - 1; i++) {
if (p.at(i + 1) < p.at(i)) {
... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> p(N);
for (int i = 0; i < N; i++) {
cin >> p.at(i);
}
int cnt = 0;
vector<int> a(3);
for (int i = 0; i < N - 1; i++) {
if (p.at(i + 1) < p.at(i)) {
... | [
"literal.number.change",
"call.arguments.change"
] | 765,169 | 765,170 | u628134373 | cpp |
p02958 | #include <iostream>
using namespace std;
int N, p[51], s = 0;
int main(void) {
cin >> N;
for (int i = 1; i <= N; i++) {
cin >> p[i];
if (i > 1 && p[i] != i)
s++;
}
if (s > 2)
cout << "NO";
else
cout << "YES";
return 0;
} | #include <iostream>
using namespace std;
int N, p[51], s = 0;
int main(void) {
cin >> N;
for (int i = 1; i <= N; i++) {
cin >> p[i];
if (p[i] != i)
s++;
}
if (s > 2)
cout << "NO";
else
cout << "YES";
return 0;
} | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 765,171 | 765,172 | u882276885 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N;
cin >> N;
int a[N];
for (int i = 0; i < N; i++) {
cin >> a[i];
}
vector<int> pos;
for (int i = 0; i < N; i++) {
if (a[i] != (i + 1))
pos.push_back(i);
}
if (pos.size() <= 1)
cout << "YES\n";
el... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N;
cin >> N;
int a[N];
for (int i = 0; i < N; i++) {
cin >> a[i];
}
vector<int> pos;
for (int i = 0; i < N; i++) {
if (a[i] != (i + 1))
pos.push_back(i);
}
if (pos.size() <= 2)
cout << "YES\n";
el... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 765,175 | 765,176 | u753615145 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, count = 0;
cin >> n;
int arr[n], a[n];
for (i = 0; i < n; i++)
cin >> arr[i];
for (i = 0; i < n; i++)
a[i] = arr[i];
sort(a, a + n);
for (i = 0; i < n; i++)
;
{
if (a[i] == arr[i])
count++;
}
if (count < 3)
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, count = 0;
cin >> n;
int arr[n], a[n];
for (i = 0; i < n; i++)
cin >> arr[i];
for (i = 0; i < n; i++)
a[i] = arr[i];
sort(a, a + n);
for (i = 0; i < n; i++) {
if (a[i] != arr[i])
count++;
}
if (count < 3)
c... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 765,177 | 765,178 | u364260098 | cpp |
p02958 | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
using ll = long long;
using namespace std;
int main() {
int n;
cin >> n;
vector<int> p(n);
int c = 0;
REP(i, n) cin >> p[i];
R... | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
using ll = long long;
using namespace std;
int main() {
int n;
cin >> n;
vector<int> p(n);
int c = 0;
REP(i, n) cin >> p[i];
R... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 765,186 | 765,187 | u063896502 | cpp |
p02958 | #include "stdio.h"
#include <stdlib.h>
int main() {
int N;
int a, b, c;
scanf("%d", &N);
int array[N + 1];
bool issorted = true;
for (int i = 1; i <= N; i++) {
scanf("%d", &array[i]);
}
for (int i = 2; i <= N; i++) {
if (array[i] < array[i - 1]) {
issorted = false;
}
}
if (issorte... | #include "stdio.h"
#include <stdlib.h>
int main() {
int N;
int a, b, c;
scanf("%d", &N);
int array[N + 1];
bool issorted = true;
for (int i = 1; i <= N; i++) {
scanf("%d", &array[i]);
}
for (int i = 2; i <= N; i++) {
if (array[i] < array[i - 1]) {
issorted = false;
}
}
if (issorte... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 765,196 | 765,197 | u339419997 | cpp |
p02958 | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int p[N - 1];
int no;
no = 0;
for (int i = 0; i < N; i++) {
cin >> p[i];
if (p[i] == i + 1)
continue;
else
no = no + 1;
}
if (no < 3)
cout << "Yes";
else
cout << "No";
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int p[N - 1];
int no;
no = 0;
for (int i = 0; i < N; i++) {
cin >> p[i];
if (p[i] == i + 1)
continue;
else
no = no + 1;
}
if (no < 3)
cout << "YES";
else
cout << "NO";
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 765,198 | 765,199 | u057617112 | cpp |
p02958 | #include <stdio.h>
int main(void) {
int n, i, j, count;
count = 1;
scanf("%d", &n);
int p[n], a[n];
for (i = 1; i <= n; i++) {
scanf("%d", &p[i]);
a[i] = i;
}
for (j = 1; j <= n; j++) {
if (a[j] == p[j]) {
count++;
}
}
if (count > 2) {
printf("YES");
} else {
printf("NO... | #include <stdio.h>
int main(void) {
int n, i, j, count;
count = 1;
scanf("%d", &n);
int p[n], a[n];
for (i = 1; i <= n; i++) {
scanf("%d", &p[i]);
a[i] = i;
}
for (j = 1; j <= n; j++) {
if (a[j] == p[j]) {
count++;
}
}
if (count > n - 2) {
printf("YES");
} else {
printf... | [
"control_flow.branch.if.condition.change"
] | 765,204 | 765,205 | u343635596 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> pa(N);
for (int i = 0; i < N; i++) {
cin >> pa.at(i);
}
vector<int> check(N);
check = pa;
sort(check.begin(), check.end());
if (check == pa) {
cout << "YES";
}
int count = 0;
for (int i = 0; i <... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> pa(N);
for (int i = 0; i < N; i++) {
cin >> pa.at(i);
}
vector<int> check(N);
check = pa;
sort(check.begin(), check.end());
if (check == pa) {
cout << "YES";
}
int count = 0;
for (int i = 0; i <... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"identifier.replace.remove",
"literal.replace.add"
] | 765,206 | 765,207 | u628597699 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, t = 0;
cin >> N;
for (int i = 0; i < N; i++) {
int p;
cin >> p;
if (p - 1 == i) {
t++;
}
}
if (t == 0 || t == 2) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, t = 0;
cin >> N;
for (int i = 0; i < N; i++) {
int p;
cin >> p;
if (p - 1 != i) {
t++;
}
}
if (t == 0 || t == 2) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 765,214 | 765,215 | u857619742 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define sz(x) ((int)(x).size())
#define in(x) \
int x; \
cin >> x
#define bit(n) (1 << (n))
#define out(x) co... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define sz(x) ((int)(x).size())
#define in(x) \
int x; \
cin >> x
#define bit(n) (1 << (n))
#define out(x) co... | [
"call.arguments.change",
"call.arguments.add"
] | 765,223 | 765,224 | u245407321 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
int n, cnt = 0;
cin >> n;
vector<int> p(n);
for (size_t i = 0; i < n; i++)
cin >> p[i];
vector<int> tmp(p);
sort(tmp.begin(), tmp.end());
for (size_t i = 0; i < n; i++)
if (tmp[i] != p[i])
cnt++;
if ... | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
int n, cnt = 0;
cin >> n;
vector<int> p(n);
for (size_t i = 0; i < n; i++)
cin >> p[i];
vector<int> tmp(p);
sort(tmp.begin(), tmp.end());
for (size_t i = 0; i < n; i++)
if (tmp[i] != p[i])
cnt++;
if ... | [
"control_flow.branch.if.condition.change"
] | 765,225 | 765,226 | u998379501 | cpp |
p02958 | #include <algorithm>
#include <cstring>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <unordered_map>
#include <vector>
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define ... | #include <algorithm>
#include <cstring>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <unordered_map>
#include <vector>
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define ... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 765,234 | 765,235 | u450733728 | cpp |
p02958 | #include <stdio.h>
int main(void) {
int n, i, count = 0;
int a[50];
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
if (a[i] != i + 1) {
count += 1;
}
}
if (count == 0 || count == 2) {
printf("yes");
} else {
printf("no");
}
return 0;
}
| #include <stdio.h>
int main(void) {
int n, i, count = 0;
int a[50];
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
if (a[i] != i + 1) {
count += 1;
}
}
if (count == 0 || count == 2) {
printf("YES");
} else {
printf("NO");
}
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 765,240 | 765,241 | u280441001 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.