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 <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vNum(N, 0);
vector<int> vNumSort(N, 0);
for (int i = 0; i < N; i++) {
int s... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vNum(N, 0);
vector<int> vNumSort(N, 0);
for (int i = 0; i < N; i++) {
int s... | [
"expression.operation.binary.remove",
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 765,251 | 765,252 | u376998218 | cpp |
p02958 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vNum(N, 0);
vector<int> vNumSort(N, 0);
for (int i = 0; i < N; i++) {
int s... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vNum(N, 0);
vector<int> vNumSort(N, 0);
for (int i = 0; i < N; i++) {
int s... | [
"expression.operation.binary.remove",
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 765,253 | 765,252 | u376998218 | cpp |
p02958 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using pi = pair<int, int>;
constexpr ll mod = 1000000007;
v... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using pi = pair<int, int>;
constexpr ll mod = 1000000007;
v... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 765,256 | 765,257 | u752288070 | cpp |
p02958 | #include <bits/stdc++.h>
#define ll long long
#define lb long double
#define FOR(i, n) for (int i = 0; i < n; i++)
#define DEBUG(x) cout << x
#define RUN \
ios_base::sync_with_stdio(false); \
cin.tie(0); ... | #include <bits/stdc++.h>
#define ll long long
#define lb long double
#define FOR(i, n) for (int i = 0; i < n; i++)
#define DEBUG(x) cout << x
#define RUN \
ios_base::sync_with_stdio(false); \
cin.tie(0); ... | [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo",
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 765,269 | 765,270 | u494803454 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, count = 0;
cin >> n;
vector<int> vec1(n, 0);
vector<int> vec2(n, 0);
for (int i = 0; i < n; i++) {
cin >> vec1.at(i);
vec2.at(i) = n - i;
if (vec1.at(i) != vec2.at(i))
count++;
}
if (count == 2 || count == 0)
cout << ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, count = 0;
cin >> n;
vector<int> vec1(n, 0);
vector<int> vec2(n, 0);
for (int i = 0; i < n; i++) {
cin >> vec1.at(i);
vec2.at(i) = i + 1;
if (vec1.at(i) != vec2.at(i))
count++;
}
if (count == 2 || count == 0)
cout << ... | [
"expression.operation.binary.remove",
"assignment.change"
] | 765,286 | 765,287 | u192280767 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int N;
vector<int> P;
bool isSorted() {
for (int i = 1; i < N; ++i) {
if (P[i - 1] > P[i]) {
return false;
}
}
return true;
}
int main() {
cin >> N;
P.resize(N);
for (int i = 0; i < N; ++i) {
cin >> P[i];
}
if (isSorted()) {
cout <... | #include <bits/stdc++.h>
using namespace std;
int N;
vector<int> P;
bool isSorted() {
for (int i = 1; i < N; ++i) {
if (P[i - 1] > P[i]) {
return false;
}
}
return true;
}
int main() {
cin >> N;
P.resize(N);
for (int i = 0; i < N; ++i) {
cin >> P[i];
}
if (isSorted()) {
cout <... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 765,294 | 765,295 | u159619403 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
const int N = 110;
int n, a[N];
int main() {
scanf("%d", &n);
int ans = 0;
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
if (a[i] == i)
continue;
else
ans++;
}
if (ans == 2)
printf("YES\n");
else
printf("NO\n");
return 0;
... | #include <bits/stdc++.h>
using namespace std;
const int N = 110;
int n, a[N];
int main() {
scanf("%d", &n);
int ans = 0;
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
if (a[i] == i)
continue;
else
ans++;
}
if (ans == 2 || ans == 0)
printf("YES\n");
else
printf("NO\n");
... | [
"control_flow.branch.if.condition.change"
] | 765,296 | 765,297 | u962383502 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
scanf("%d", &n);
int cnt = 0;
for (int i = 1; i <= n; i++) {
int t;
scanf("%d", &t);
if (t != i)
cnt++;
}
if (cnt <= 1)
printf("YES");
else
printf("NO");
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
scanf("%d", &n);
int cnt = 0;
for (int i = 1; i <= n; i++) {
int t;
scanf("%d", &t);
if (t != i)
cnt++;
}
if (cnt <= 2)
printf("YES");
else
printf("NO");
return 0;
} | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 765,298 | 765,299 | u098251832 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> p(N);
for (auto &k : p)
cin >> k;
int check = 0;
for (int i = 0; i < N; i++) {
if (p[i] != i)
check++;
}
if (check == 2 || check == 0)
cout << "YES" << endl;
else
cout << "NO" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> p(N);
for (auto &k : p)
cin >> k;
int check = 0;
for (int i = 0; i < N; i++) {
if (p[i] != i + 1)
check++;
}
if (check == 2 || check == 0)
cout << "YES" << endl;
else
cout << "NO" << endl;... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 765,304 | 765,305 | u507188501 | 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> a(n);
for (int i = 1; i <= n; i++) {
a.at(i) = i;
}
int cnt = 0;
for (int i = 0; i < n; i++) {
if (a.at(i) != p.at(i))
cnt++... | #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> a(n);
for (int i = 0; i < n; i++) {
a.at(i) = i + 1;
}
int cnt = 0;
for (int i = 0; i < n; i++) {
if (a.at(i) != p.at(i))
cn... | [
"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",
"assignment.change"
] | 765,306 | 765,307 | u653482689 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
#define watch(x) cout << (#x) << " is " << (x) << endl
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define openfile ... | #include <bits/stdc++.h>
using namespace std;
#define watch(x) cout << (#x) << " is " << (x) << endl
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define openfile ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 765,314 | 765,315 | u544532249 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, c = 0, i;
cin >> n;
long long a[n], b[n];
for (i = 0; i < n; i++) {
cin >> a[i];
b[i] = a[i];
}
sort(b, b + n);
for (i = 0; i < n; i++) {
if (a[i] == b[i])
c++;
}
if (c == n - 2)
cout << "YES" << endl;
else... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, c = 0, i;
cin >> n;
long long a[n], b[n];
for (i = 0; i < n; i++) {
cin >> a[i];
b[i] = a[i];
}
sort(b, b + n);
for (i = 0; i < n; i++) {
if (a[i] == b[i])
c++;
}
if (c == n - 2 || c == n)
cout << "YES" << en... | [
"control_flow.branch.if.condition.change"
] | 765,318 | 765,319 | u304756372 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
scanf("%d", &n);
int cont = 0;
for (int i = 1; i <= n; i++) {
int x;
scanf("%d", &x);
if (x == i)
cont++;
}
if (cont <= 2)
puts("YES");
else
puts("NO");
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
scanf("%d", &n);
int cont = 0;
for (int i = 1; i <= n; i++) {
int x;
scanf("%d", &x);
if (x != i)
cont++;
}
if (cont <= 2)
puts("YES");
else
puts("NO");
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 765,322 | 765,323 | u100131109 | cpp |
p02958 | #include <bits/stdc++.h>
#include <cmath>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> p(N);
for (int i = 1; i < N + 1; i++) {
cin >> p.at(i - 1);
}
int count = 0;
for (int i = 1; i < N + 1; i++) {
if (p.at(i - 1) == i) {
count++;
}
}
if (count == N or count =... | #include <bits/stdc++.h>
#include <cmath>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> p(N);
for (int i = 1; i < N + 1; i++) {
cin >> p.at(i - 1);
}
int count = 0;
for (int i = 1; i < N + 1; i++) {
if (p.at(i - 1) == i) {
count++;
}
}
if (count == N or count =... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 765,326 | 765,327 | u944905289 | cpp |
p02958 | #include <iostream>
using namespace std;
int main() {
int n, count = 0;
cin >> n;
for (int i = 0, num; i < n; i++) {
cin >> num;
count += (i != num);
}
cout << (count == 0 || count == 2) ? "YES" : "NO";
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n, count = 0;
cin >> n;
for (int i = 0, num; i < n; i++) {
cin >> num;
count += (i + 1 != num);
}
cout << ((count == 0 || count == 2) ? "YES" : "NO");
return 0;
} | [
"assignment.change"
] | 765,328 | 765,329 | u930860452 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, tem, p[51], ans = 0;
bool flg;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> p[i];
}
for (int k = 0; k < n; k++) {
// cout<<p[k]<<" ";
if (p[k] != k + 1)
flg = false;
}
if (flg) {
ans = 1;
// cout<<"YES"<<endl... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, tem, p[51], ans = 0;
bool flg = true;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> p[i];
}
for (int k = 0; k < n; k++) {
// cout<<p[k]<<" ";
if (p[k] != k + 1)
flg = false;
}
if (flg) {
ans = 1;
// cout<<"YES... | [
"variable_declaration.value.change"
] | 765,336 | 765,337 | u244391385 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> p(n), q(n);
for (int i = 0; i < n; ++i) {
cin >> p[i];
q[i] = p[i];
}
sort(p.begin(), p.end());
int cnt = 0;
for (int i = 0; i < n; ++i) {
cnt += p[i] != q[i];
}
if (cnt < 2) {
cout << "YES" << en... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> p(n), q(n);
for (int i = 0; i < n; ++i) {
cin >> p[i];
q[i] = p[i];
}
sort(p.begin(), p.end());
int cnt = 0;
for (int i = 0; i < n; ++i) {
cnt += p[i] != q[i];
}
if (cnt <= 2) {
cout << "YES" << e... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 765,339 | 765,340 | u005469124 | cpp |
p02958 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
#define rep(i, s) for (int i = 0; i < s; ++i)
#define all(v) (v.begin(), v.end... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
#define rep(i, s) for (int i = 0; i < s; ++i)
#define all(v) (v.begin(), v.end... | [
"variable_declaration.value.change"
] | 765,341 | 765,342 | u275934251 | cpp |
p02958 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
#define rep(i, s) for (int i = 0; i < s; ++i)
#define all(v) (v.begin(), v.end... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
#define rep(i, s) for (int i = 0; i < s; ++i)
#define all(v) (v.begin(), v.end... | [
"variable_declaration.value.change"
] | 765,341 | 765,343 | u275934251 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
vector<int> p(N);
int c = 0;
for (int i = 0; i < N; i++) {
cin >> p.at(i);
if (p.at(i) != i + 1) {
c++;
}
}
if (c <= 2) {
cout << "YES\n";
} else {
cout << "NO\n";
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> p(N);
int c = 0;
for (int i = 0; i < N; i++) {
cin >> p.at(i);
if (p.at(i) != i + 1) {
c++;
}
}
if (c <= 2) {
cout << "YES\n";
} else {
cout << "NO\n";
}
}
| [] | 765,346 | 765,347 | u602544363 | cpp |
p02958 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <regex>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
int p[50] = {};
int P[50] = {};
for (int i = 0; i < N; i++) {
cin >> p[i];
P[i] = p[i];
}
sort(P, P + N);... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <regex>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
int p[50] = {};
int P[50] = {};
for (int i = 0; i < N; i++) {
cin >> p[i];
P[i] = p[i];
}
sort(P, P + N);... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 765,348 | 765,349 | u451206510 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
const int MAX_N = 100001;
int main() {
int N, a;
int b[MAX_N];
a = 0;
cin >> N;
for (int i = 0; i < N; i++) {
scanf("%d", &b[i]);
}
for (int i = 0; i < N; i++) {
if (b[i] != i + 1) {
a += 1;
}
}
printf((a < 3) ? "Yes\n" : "No\n");
} | #include <bits/stdc++.h>
using namespace std;
const int MAX_N = 100001;
int main() {
int N, a;
int b[MAX_N];
a = 0;
cin >> N;
for (int i = 0; i < N; i++) {
scanf("%d", &b[i]);
}
for (int i = 0; i < N; i++) {
if (b[i] != i + 1) {
a += 1;
}
}
printf((a < 3) ? "YES\n" : "NO\n");
} | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 765,350 | 765,351 | u336489291 | cpp |
p02958 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n);
vector<int> c(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
c[i] = v[i];
}
int cnt = 0;
sort(v.begin(), v.end());
for (int i = 0; i < n; i++) {
if (v[i] != c[i]... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n);
vector<int> c(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
c[i] = v[i];
}
int cnt = 0;
sort(v.begin(), v.end());
for (int i = 0; i < n; i++) {
if (v[i] != c[i]... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 765,352 | 765,353 | u765789766 | cpp |
p02958 | #include <algorithm>
#include <iostream>
#include <tuple>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> P(N);
for (auto &p : P)
cin >> p;
auto test = [&]() {
for (int i = 0; i < N; i++) {
if (P[i] > P[i + 1])
return false;
}
return true;
};
... | #include <algorithm>
#include <iostream>
#include <tuple>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> P(N);
for (auto &p : P)
cin >> p;
auto test = [&]() {
for (int i = 0; i < N - 1; i++) {
if (P[i] > P[i + 1])
return false;
}
return true;
... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 765,359 | 765,360 | u587172770 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
template <class T> inline T updmax(T &a, T b) { return a = max(a, b); }
template <class T> inline T updmin(T &a, T b) { return a = min(a, b); }
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int n;
vector<int> a(n, 0);
for (int i = 0; i < n; i... | #include <bits/stdc++.h>
using namespace std;
template <class T> inline T updmax(T &a, T b) { return a = max(a, b); }
template <class T> inline T updmin(T &a, T b) { return a = min(a, b); }
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
vector<int> a(n, 0);
for (int i =... | [] | 765,372 | 765,373 | u614497125 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, ans;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; i++) {
cin >> p.at(i);
}
for (int j = 0; j < n; j++) {
if (p.at(j) != j + 1) {
ans++;
}
}
if (ans < 3) {
cout << "YES" << endl;
} else {
cout << "NO" << ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, ans;
cin >> n;
ans = 0;
vector<int> p(n);
for (int i = 0; i < n; i++) {
cin >> p.at(i);
}
for (int j = 0; j < n; j++) {
if (p.at(j) != j + 1) {
ans++;
}
}
if (ans < 3) {
cout << "YES" << endl;
} else {
cou... | [
"assignment.add"
] | 765,374 | 765,375 | u536015544 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, ans;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; i++) {
cin >> p.at(i);
}
for (int j = 0; j < n; j++) {
if (p.at(j) != j + 1) {
ans++;
}
}
if (ans < 3) {
cout << "YES" << endl;
} else {
cout << "NO" <... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, ans;
cin >> n;
ans = 0;
vector<int> p(n);
for (int i = 0; i < n; i++) {
cin >> p.at(i);
}
for (int j = 0; j < n; j++) {
if (p.at(j) != j + 1) {
ans++;
}
}
if (ans < 3) {
cout << "YES" << endl;
} else {
cou... | [
"assignment.add"
] | 765,376 | 765,375 | u536015544 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, ans;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; i++) {
cin >> p.at(i);
}
for (int j = 0; j < n; j++) {
if (p.at(j) != j + 1) {
ans++;
}
}
if (ans < 3) {
cout << "YES" << endl;
} else {
cout << "NO" << ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, ans;
cin >> n;
ans = 0;
vector<int> p(n);
for (int i = 0; i < n; i++) {
cin >> p.at(i);
}
for (int j = 0; j < n; j++) {
if (p.at(j) != j + 1) {
ans++;
}
}
if (ans < 3) {
cout << "YES" << endl;
} else {
cou... | [
"assignment.add"
] | 765,377 | 765,375 | u536015544 | cpp |
p02958 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> p(N), p_sorted(N);
for (int i = 0; i < N; i++) {
cin >> p[i];
p_sorted[i] = p[i];
}
sort(p_sorted.begin(), p_sorted.end());
int cnt = 0... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> p(N), p_sorted(N);
for (int i = 0; i < N; i++) {
cin >> p[i];
p_sorted[i] = p[i];
}
sort(p_sorted.begin(), p_sorted.end());
int cnt = 0... | [
"control_flow.branch.if.condition.change"
] | 765,378 | 765,379 | u937950774 | cpp |
p02958 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, cnt = 0;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; i++)
cin >> p[i];
if (is_sorted(p.begin(), p.end())) {
cout << "YES\n";
return 0;
}
for (int i = 0; i < n - 1; i++) {
for (int j ... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, cnt = 0;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; i++)
cin >> p[i];
if (is_sorted(p.begin(), p.end())) {
cout << "YES\n";
return 0;
}
for (int i = 0; i < n - 1; i++) {
for (int j ... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 765,384 | 765,385 | u053360288 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int countDifference = 0;
for (int i = 0; i < N; i++) {
int tmp;
cin >> tmp;
if (tmp != (i + 1))
countDifference++;
}
if (countDifference < 2) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int countDifference = 0;
for (int i = 0; i < N; i++) {
int tmp;
cin >> tmp;
if (tmp != (i + 1))
countDifference++;
}
if (countDifference <= 2) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 765,386 | 765,387 | u016092854 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
int swap, ans = 0;
for (int i = 0; i < n; i++) {
cin >> a[n];
// cout<<a[n]<<endl;
}
for (int i = 0; i < n - 1; i++) {
// cout<<a[i]<<endl;
if (a[i] < a[i + 1])
ans = 1;
else if (a[i] > a[i + 1]... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
int swap, ans = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
// cout<<a[i]<<endl;
}
// for(int i=0;i<n;i++) cout<<a[i]<<endl;
for (int i = 0; i < n - 1; i++) {
// cout<<a[i]<<endl;
if (a[i] < a[i + 1])... | [
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 765,390 | 765,391 | u236011566 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int i, N, count = 0;
cin >> N;
int a[N], b[N];
for (i = 0; i < N; i++) {
a[i] = i + 1;
}
for (i = 0; i < N; i++) {
cin >> b[i];
if (a[i] == b[i]) {
} else {
count++;
}
}
if (count == 2 || count == 0) {
cout << "Yes... | #include <bits/stdc++.h>
using namespace std;
int main() {
int i, N, count = 0;
cin >> N;
int a[N], b[N];
for (i = 0; i < N; i++) {
a[i] = i + 1;
}
for (i = 0; i < N; i++) {
cin >> b[i];
if (a[i] == b[i]) {
} else {
count++;
}
}
if (count == 2 || count == 0) {
cout << "YES... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 765,395 | 765,396 | u886921509 | cpp |
p02958 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int p[N];
int q[N];
for (int i = 0; i < N; i++) {
cin >> p[i];
q[i] = p[i];
}
sort(p, p + N);
int count = 0;
for (int i = 0; i < N; i++) {
if (q[i] != p[i])
count++;
}
if (count == 2... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int p[N];
int q[N];
for (int i = 0; i < N; i++) {
cin >> p[i];
q[i] = p[i];
}
sort(p, p + N);
int count = 0;
for (int i = 0; i < N; i++) {
if (q[i] != p[i])
count++;
}
if (count == 2... | [
"control_flow.branch.if.condition.change"
] | 765,399 | 765,400 | u951403082 | cpp |
p02958 | #include <algorithm>
#include <cstdint>
#include <cstring>
#include <functional>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
#define SIZE_OF_ARRAY(array) (sizeof(array) / sizeof(array[0]))
using namespace std;
int main() {
int N;
cin >> N;
int p[50];
int c[50];
for (int i = ... | #include <algorithm>
#include <cstdint>
#include <cstring>
#include <functional>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
#define SIZE_OF_ARRAY(array) (sizeof(array) / sizeof(array[0]))
using namespace std;
int main() {
int N;
cin >> N;
int p[255];
int c[255];
for (int i ... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"call.arguments.change",
"variable_declaration.value.change"
] | 765,409 | 765,408 | u913604515 | cpp |
p02958 | #include <algorithm>
#include <cstdint>
#include <cstring>
#include <functional>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
#define SIZE_OF_ARRAY(array) (sizeof(array) / sizeof(array[0]))
using namespace std;
int main() {
int N;
cin >> N;
int p[50];
int c[50];
for (int i = ... | #include <algorithm>
#include <cstdint>
#include <cstring>
#include <functional>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
#define SIZE_OF_ARRAY(array) (sizeof(array) / sizeof(array[0]))
using namespace std;
int main() {
int N;
cin >> N;
int p[255];
int c[255];
for (int i ... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"call.arguments.change",
"control_flow.branch.if.condition.change"
] | 765,410 | 765,408 | u913604515 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, cnt;
cnt = 0;
cin >> n;
int a[n], d[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
d[i] = i + 1;
}
for (int i = 0; i < n; i++) {
if (a[i] == d[i])
cnt++;
}
if (cnt == 2)
cout << "YES" << endl;
else
cout << "... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, cnt;
cnt = 0;
cin >> n;
int a[n], d[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
d[i] = i + 1;
}
for (int i = 0; i < n; i++) {
if (a[i] != d[i])
cnt++;
}
if (cnt <= 2)
cout << "YES" << endl;
else
cout << "... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 765,417 | 765,418 | u018434698 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, count = 0, last, a;
cin >> n;
int p[n];
for (int i = 0; i < n; i++) {
cin >> p[i];
}
for (int i = 0; i < n; i++) {
if (p[i] != (i + 1)) {
count++;
if (count == 1) {
a = i + 1;
}
}
}
if (count == ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, count = 0, last, a;
cin >> n;
int p[n];
for (int i = 0; i < n; i++) {
cin >> p[i];
}
for (int i = 0; i < n; i++) {
if (p[i] != (i + 1)) {
count++;
if (count == 1) {
a = i + 1;
}
}
}
if (count == ... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 765,419 | 765,420 | u779636842 | 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.at(i);
Q.at(i) = P.at(i);
}
sort(Q.begin(), Q.end());
int count = 0;
for (int i = 0; i < N; i++) {
if (Q.at(i) == P.at(i)) {
} else
count++;
... | #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.at(i);
Q.at(i) = P.at(i);
}
sort(Q.begin(), Q.end());
int count = 0;
for (int i = 0; i < N; i++) {
if (Q.at(i) == P.at(i)) {
} else
count++;
... | [
"control_flow.branch.if.condition.change"
] | 765,431 | 765,432 | u700314924 | cpp |
p02958 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
int diff = 0;
cin >> N;
int p[N];
int sortedP[N];
for (int i = 0; i < N; i++) {
int P;
cin >> P;
p[i] = P;
sortedP[i] = P;
}
sort(sortedP, sortedP + ... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
int diff = 0;
cin >> N;
int p[N];
int sortedP[N];
for (int i = 0; i < N; i++) {
int P;
cin >> P;
p[i] = P;
sortedP[i] = P;
}
sort(sortedP, sortedP + ... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 765,445 | 765,446 | u332258971 | cpp |
p02958 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
int count = 0;
for (int i = 0; i < n; ++i) {
int b;
cin >> b;
if (b != n + 1)
count = count + 1;
}
if (count <= 2)
cout << "YES" << endl;
else
cout << "N... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
int count = 0;
for (int i = 0; i < n; ++i) {
int b;
cin >> b;
if (b != i + 1)
count = count + 1;
}
if (count <= 2)
cout << "YES" << endl;
else
cout << "N... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 765,447 | 765,448 | u571305142 | cpp |
p02958 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
int count = 0;
for (int i = 0; i < n; ++i) {
int b;
cin >> b;
if (b != n + 1)
count = count + 1;
}
if (count >= 2)
cout << "YES" << endl;
else
cout << "N... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
int count = 0;
for (int i = 0; i < n; ++i) {
int b;
cin >> b;
if (b != i + 1)
count = count + 1;
}
if (count <= 2)
cout << "YES" << endl;
else
cout << "N... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"misc.opposites",
"expression.operator.compare.change"
] | 765,449 | 765,448 | u571305142 | cpp |
p02958 | #include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
int main() {
int n;
ll ans = 0;
vector<int> a;
cin >> n;
for (int ... | #include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
int main() {
int n;
ll ans = 0;
vector<int> a;
cin >> n;
for (int ... | [
"literal.number.change",
"assignment.value.change"
] | 765,468 | 765,469 | u227764848 | cpp |
p02958 | #include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
int main() {
int n;
ll ans = 0;
vector<int> a;
cin >> n;
for (int ... | #include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
int main() {
int n;
ll ans = 0;
vector<int> a;
cin >> n;
for (int ... | [
"literal.number.change",
"assignment.value.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 765,470 | 765,469 | u227764848 | cpp |
p02958 | #include <iostream>
using namespace std;
int main() {
int n, i, count = 0;
cin >> n;
int p[n];
for (i = 0; i < n; i++) {
cin >> p[i];
}
for (i = 0; i < n; i++) {
if (p[i] != i + 1) {
count++;
}
}
if (count <= 2) {
cout << "YES";
} else if (count > 3) {
cout << "NO";
}
r... | #include <iostream>
using namespace std;
int main() {
int n, i, count = 0;
cin >> n;
int p[n];
for (i = 0; i < n; i++) {
cin >> p[i];
}
for (i = 0; i < n; i++) {
if (p[i] != i + 1) {
count++;
}
}
if (count <= 2) {
cout << "YES";
} else if (count > 2) {
cout << "NO";
}
r... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 765,473 | 765,474 | u709752172 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, cnt = 0;
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)) {
cnt++;
}
}
cout << (cnt > 2 ? "No" : "Yes") << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, cnt = 0;
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)) {
cnt++;
}
}
cout << (cnt <= 2 ? "YES" : "NO") << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"io.output.change",
"literal.string.change"
] | 765,475 | 765,476 | u948459352 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, cnt = 0;
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) {
cnt++;
}
}
cout << (cnt > 2 ? "No" : "Yes") << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, cnt = 0;
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)) {
cnt++;
}
}
cout << (cnt <= 2 ? "YES" : "NO") << endl;
return 0;
}
| [
"control_flow.branch.if.condition.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"io.output.change",
"literal.string.change"
] | 765,477 | 765,476 | u948459352 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REP2(i, x, n) for (int i = x; i < (n); i++)
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; } //最大公約数
int lcm(int a, int b) { return a * b / gcd(a, b); } //最小公倍数
int main() {
int n;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REP2(i, x, n) for (int i = x; i < (n); i++)
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; } //最大公約数
int lcm(int a, int b) { return a * b / gcd(a, b); } //最小公倍数
int main() {
int n;
... | [
"control_flow.branch.if.condition.change"
] | 765,482 | 765,483 | u110681742 | cpp |
p02958 | #include <algorithm>
#include <iostream>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
typedef long long int64;
int main(void) {
int64 N;
cin >> N;
int64 cnt = 0;
vector<int64> p(N);
for (int64 i = 0; i < N; i++) {
cin >> p[i];
if (p[i] != i) {
cnt++;
}
}
... | #include <algorithm>
#include <iostream>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
typedef long long int64;
int main(void) {
int64 N;
cin >> N;
int64 cnt = 0;
vector<int64> p(N);
for (int64 i = 0; i < N; i++) {
cin >> p[i];
if (p[i] != i + 1) {
cnt++;
}
... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 765,484 | 765,485 | u647569169 | cpp |
p02958 | #include <algorithm>
#include <iostream>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
typedef long long int64;
int main(void) {
int64 N;
cin >> N;
int64 cnt = 0;
vector<int64> p(N);
for (int64 i = 0; i < N; i++) {
cin >> p[i];
if (p[i] != N - i) {
cnt++;
}
... | #include <algorithm>
#include <iostream>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
typedef long long int64;
int main(void) {
int64 N;
cin >> N;
int64 cnt = 0;
vector<int64> p(N);
for (int64 i = 0; i < N; i++) {
cin >> p[i];
if (p[i] != i + 1) {
cnt++;
}
... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change",
"misc.off_by_one"
] | 765,486 | 765,485 | u647569169 | cpp |
p02958 | #include <iostream>
using namespace std;
int main() {
int N, p[60], z = 0;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> p[i];
}
for (int i = 0; i < N; i++) {
if (p[i] == i + 1) {
z = z + 1;
}
}
if (z == N) {
cout << "YES";
}
if (z == N - 2) {
cout << "YES";
} else {
... | #include <iostream>
using namespace std;
int main() {
int N, p[60], z = 0;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> p[i];
}
for (int i = 0; i < N; i++) {
if (p[i] == i + 1) {
z = z + 1;
}
}
if (z == N) {
cout << "YES";
} else {
if (z == N - 2) {
cout << "YES";
... | [
"control_flow.branch.else.add"
] | 765,489 | 765,490 | u428229036 | cpp |
p02958 | #include <iostream>
using namespace std;
int main() {
int N, p[60], z = 0;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> p[i];
}
for (int i = 0; i < N; i++) {
if (p[i] == i) {
z = z + 1;
}
}
if (z == N) {
cout << "YES";
}
if (z == N - 2) {
cout << "YES";
} else {
co... | #include <iostream>
using namespace std;
int main() {
int N, p[60], z = 0;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> p[i];
}
for (int i = 0; i < N; i++) {
if (p[i] == i + 1) {
z = z + 1;
}
}
if (z == N) {
cout << "YES";
} else {
if (z == N - 2) {
cout << "YES";
... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"control_flow.branch.else.add"
] | 765,491 | 765,490 | u428229036 | cpp |
p02958 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define N (1000000000 + 7)
#define INF 1e16
typedef pair<int, int> P;
typedef long long ll;
int main(void) {
int n, num = 0;
;
cin ... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define N (1000000000 + 7)
#define INF 1e16
typedef pair<int, int> P;
typedef long long ll;
int main(void) {
int n, num = 0;
;
cin ... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 765,496 | 765,497 | u744305661 | cpp |
p02958 | #include <iostream>
#include <numeric>
#include <vector>
using namespace std;
bool judge(const vector<int> &v);
int main() {
size_t n;
cin >> n;
vector<int> p(n);
for (size_t i = 0; i < n; ++i)
cin >> p[i];
cout << (judge(p) ? "YES" : "NO") << std::endl;
return 0;
}
bool judge(const vector<int> &v)... | #include <iostream>
#include <numeric>
#include <vector>
using namespace std;
bool judge(const vector<int> &v);
int main() {
size_t n;
cin >> n;
vector<int> p(n);
for (size_t i = 0; i < n; ++i)
cin >> p[i];
cout << (judge(p) ? "YES" : "NO") << std::endl;
return 0;
}
bool judge(const vector<int> &v)... | [
"literal.number.change",
"call.arguments.change"
] | 765,500 | 765,501 | u937545465 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e5 + 10;
int a[maxn];
int b[maxn];
int main() {
int m, n;
cin >> n;
int k = 0;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = 1; i <= n; i++) {
if (a[i] != i)
k++;
}
if (k == 2 || k == 0)
puts(... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e5 + 10;
int a[maxn];
int b[maxn];
int main() {
int m, n;
cin >> n;
int k = 0;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = 1; i <= n; i++) {
if (a[i] != i)
k++;
}
if (k == 2 || k == 0)
puts(... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 765,506 | 765,507 | u914135866 | cpp |
p02958 | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <iostream> // cout, endl, cin
#include <map> // map
#include <queue> // queue, priority_... | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <iostream> // cout, endl, cin
#include <map> // map
#include <queue> // queue, priority_... | [
"control_flow.branch.if.condition.change"
] | 765,514 | 765,515 | u384161668 | cpp |
p02958 | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> P(N, 0);
for (int i = 0; i < N; ++i) {
cin >> P[i];
}
int ans = 0;
for (int i = 0; i < N; ++i) {
if (P[i] != i + 1) {
++ans;
}
}
if (ans >= 3) {
cout << "No" <<... | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> P(N, 0);
for (int i = 0; i < N; ++i) {
cin >> P[i];
}
int ans = 0;
for (int i = 0; i < N; ++i) {
if (P[i] != i + 1) {
++ans;
}
}
if (ans >= 3) {
cout << "NO" <<... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 765,518 | 765,519 | u894555185 | cpp |
p02958 | #include <bits/stdc++.h>
#include <cstdio>
#include <iostream>
using namespace std;
int n;
int a[55];
int main() {
// freopen("B.in","r",stdin);
// freopen("B.out","w",stdout);
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
}
int cnt = 0;
for (int i = 1; i <= n; i++) {
if (a[i... | #include <bits/stdc++.h>
#include <cstdio>
#include <iostream>
using namespace std;
int n;
int a[55];
int main() {
// freopen("B.in","r",stdin);
// freopen("B.out","w",stdout);
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
}
int cnt = 0;
for (int i = 1; i <= n; i++) {
if (a[i... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 765,521 | 765,522 | u275399185 | cpp |
p02958 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> p, p_a;
int num;
for (int i = 0; i < N; i++) {
cin >> num;
p.push_back(num);
p_a.push_back(num);
}
sort(p_a.begin(), p_a.end());
int counter = 0;
for (int i = ... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> p, p_a;
int num;
for (int i = 0; i < N; i++) {
cin >> num;
p.push_back(num);
p_a.push_back(num);
}
sort(p_a.begin(), p_a.end());
int counter = 0;
for (int i = ... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 765,534 | 765,535 | u827923574 | cpp |
p02958 | #include <iostream>
using namespace std;
int main() {
int N, cnt = 0;
cin >> N;
int p[N];
for (int i = 0; i < N; i++) {
cin >> p[i];
}
for (int i = 0; i < N; i++) {
if (i + 1 == p[i])
continue;
else {
int num = p[i];
if (i + 1 == p[num]) {
cnt++;
continue;
... | #include <iostream>
using namespace std;
int main() {
int N, cnt = 0;
cin >> N;
int p[N];
for (int i = 0; i < N; i++) {
cin >> p[i];
}
for (int i = 0; i < N; i++) {
if (i + 1 == p[i])
continue;
else {
int num = p[i];
if (i + 1 == p[num - 1]) {
cnt++;
continue;
... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 765,538 | 765,539 | u267666635 | cpp |
p02958 | #include <iostream>
using namespace std;
int main() {
int N, cnt = 0;
cin >> N;
int p[N];
for (int i = 0; i < N; i++) {
cin >> p[i];
}
for (int i = 0; i < N; i++) {
if (i + 1 == p[i])
continue;
else {
int num = p[i];
if (i + 1 == p[num]) {
cnt++;
continue;
... | #include <iostream>
using namespace std;
int main() {
int N, cnt = 0;
cin >> N;
int p[N];
for (int i = 0; i < N; i++) {
cin >> p[i];
}
for (int i = 0; i < N; i++) {
if (i + 1 == p[i])
continue;
else {
int num = p[i];
if (i + 1 == p[num - 1]) {
cnt++;
continue;
... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"literal.number.change"
] | 765,540 | 765,539 | u267666635 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, j;
cin >> n;
int p[n];
vector<int> v, v1;
for (int i = 1; i <= n; i++) {
cin >> p[i];
v.push_back(p[i]);
v1.push_back(p[i]);
}
sort(v.begin(), v.end());
int c = 0;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, j;
cin >> n;
int p[n];
vector<int> v, v1;
for (int i = 0; i < n; i++) {
cin >> p[i];
v.push_back(p[i]);
v1.push_back(p[i]);
}
sort(v.begin(), v.end());
int c = 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,543 | 765,544 | u547164704 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, j;
cin >> n;
int p[n];
vector<int> v, v1;
for (int i = 0; i < n; i++) {
cin >> p[i];
v.push_back(p[i]);
v1.push_back(p[i]);
}
sort(v.begin(), v.end());
int c = 0;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, j;
cin >> n;
int p[n];
vector<int> v, v1;
for (int i = 0; i < n; i++) {
cin >> p[i];
v.push_back(p[i]);
v1.push_back(p[i]);
}
sort(v.begin(), v.end());
int c = 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,545 | 765,544 | u547164704 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, p, cnt = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> p;
if (i + 1 != p)
cnt++;
}
cout << (cnt > 3 ? "NO" : "YES") << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, p, cnt = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> p;
if (i + 1 != p)
cnt++;
}
cout << (cnt > 2 ? "NO" : "YES") << endl;
}
| [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"io.output.change"
] | 765,549 | 765,550 | u598050616 | cpp |
p02958 | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
main() {
int n;
cin >> n;
vector<int> p(n);
for (auto &&s : p) {
cin >> s;
}
int count = 0;
for (int i = 0; i < n; i++) {
if (p.at(i) != i) {
count++;
}
}
if (count == 0 || count == 2) {
cout << "YES" << en... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
main() {
int n;
cin >> n;
vector<int> p(n);
for (auto &&s : p) {
cin >> s;
}
int count = 0;
for (int i = 0; i < n; i++) {
if (p.at(i) != i + 1) {
count++;
}
}
if (count == 0 || count == 2) {
cout << "YES" <... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 765,553 | 765,554 | u040700157 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n;
ll p[100];
ll p2[100];
bool comp2(const ll left, const ll right) { return (left <= right); }
int main() {
cin >> n;
for (ll i = 0; i < n; i++)
cin >> p[i];
for (ll i = 0; i < n; i++)
p2[i] = p[i];
sort(p2, p2 + n, comp2);
ll ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n;
ll p[100];
ll p2[100];
bool comp2(const ll left, const ll right) { return (left <= right); }
int main() {
cin >> n;
for (ll i = 0; i < n; i++)
cin >> p[i];
for (ll i = 0; i < n; i++)
p2[i] = p[i];
sort(p2, p2 + n, comp2);
ll ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 765,557 | 765,558 | u172369914 | cpp |
p02958 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n];
int able = 0;
for (int i = 0; i < n; i++)
cin >> arr[i];
for (int i = 0; i < n; i++) {
if (arr[i] != n - i) {
able++;
}
}
if (able == 2 || able == 0)
cout << "YES";
else
cout << "NO";
} | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n];
int able = 0;
for (int i = 0; i < n; i++)
cin >> arr[i];
for (int i = 0; i < n; i++) {
if (arr[i] != i + 1) {
able++;
}
}
if (able == 2 || able == 0)
cout << "YES";
else
cout << "NO";
} | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change",
"misc.off_by_one"
] | 765,575 | 765,576 | u222252114 | cpp |
p02958 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n];
int able = 0;
for (int i = 0; i < n; i++)
cin >> arr[i];
for (int i = 0; i < n; i++) {
if (arr[i] != i + 1) {
able++;
}
}
if (able == 2)
cout << "YES";
else
cout << "NO";
} | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n];
int able = 0;
for (int i = 0; i < n; i++)
cin >> arr[i];
for (int i = 0; i < n; i++) {
if (arr[i] != i + 1) {
able++;
}
}
if (able == 2 || able == 0)
cout << "YES";
else
cout << "NO";
} | [
"control_flow.branch.if.condition.change"
] | 765,577 | 765,576 | u222252114 | cpp |
p02958 | // Created by liszt on 2019/07/27.
#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 = 1; i <= n; i++) {
if (p[i] != i)
cnt++;
}
if (cnt > 2) {
cout << "NO" << endl;
retu... | // Created by liszt on 2019/07/27.
#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 << "NO" << endl;
r... | [
"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",
"control_flow.branch.if.condition.change",
"misc.of... | 765,583 | 765,584 | u370447425 | cpp |
p02958 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
using namespace std;
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("O3")
#pragma GCC optimize("O2")
#pragma GCC optimize("Ofast")
#prag... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
using namespace std;
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("O3")
#pragma GCC optimize("O2")
#pragma GCC optimize("Ofast")
#prag... | [
"assignment.value.change"
] | 765,585 | 765,586 | u777824330 | cpp |
p02958 | #include <iostream>
using namespace std;
int main() {
int a[51];
int n;
int sum = 0;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
if (a[i] != i) {
sum++;
}
}
if (sum == 2 || sum == 0) {
cout << "Yes" << endl;
} else {
cout << "NO" << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a[51];
int n;
int sum = 0;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
if (a[i] != i) {
sum++;
}
}
if (sum == 2 || sum == 0) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 765,590 | 765,591 | u482429476 | cpp |
p02958 | #include <iostream>
using namespace std;
main() {
int n, a[100], k;
bool suc;
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
k = -1;
suc = 1;
for (int i = 1; i <= n; i++) {
if (a[i] != i) {
if (k == -1)
k = i;
else if (k == -2) {
suc = 0;
break;
} el... | #include <iostream>
using namespace std;
main() {
int n, a[100], k;
bool suc;
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
k = -1;
suc = 1;
for (int i = 1; i <= n; i++) {
if (a[i] != i) {
if (k == -1)
k = i;
else if (k == -2) {
suc = 0;
break;
} el... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 765,595 | 765,596 | u771099984 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N;
K = 0;
std::vector<int> P(N);
for (size_t i = 0; i < N; ++i) {
cin >> P[i];
}
for (size_t t = 0; t < N; ++t) {
if (P[t] != t) {
K += 1;
}
}
if (K <= 2) {
cout << "YES" << endl;
} else {
cout ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N;
K = 0;
std::vector<int> P(N);
for (size_t i = 0; i < N; ++i) {
cin >> P[i];
}
for (size_t t = 0; t < N; ++t) {
if (P[t] != t + 1) {
K += 1;
}
}
if (K <= 2) {
cout << "YES" << endl;
} else {
c... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 765,601 | 765,602 | u006521935 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int a[n], b[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
b[i] = a[i];
}
sort(b, b + n);
int cnt = 0;
for (int i = 0; i < n; i++) {
if (a[i] != b[i])
cnt++;
}
if (cnt == 0 || cnt == 2)
cout << "YES";
else
co... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n], b[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
b[i] = a[i];
}
sort(b, b + n);
int cnt = 0;
for (int i = 0; i < n; i++) {
if (a[i] != b[i])
cnt++;
}
if (cnt == 0 || cnt == 2)
cout << "YES";
... | [] | 765,608 | 765,609 | u573529926 | cpp |
p02958 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
bool was = false;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; i++) {
cin >> p[i];
}
vector<int> cp(n);
for (int i = 0; i < n; i++) {
cp[i] = i + 1;
}
int count = 0;
for (int i = 0;... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
bool was = false;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; i++) {
cin >> p[i];
}
vector<int> cp(n);
for (int i = 0; i < n; i++) {
cp[i] = i + 1;
}
int count = 0;
for (int i = 0;... | [
"control_flow.branch.if.condition.change"
] | 765,616 | 765,617 | u224348558 | cpp |
p02958 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int a[n + 1];
int co = 0;
for (int i = 1; i <= n; i++) {
cin >> a[i];
if (a[i] != i) {
co++;
}
}
if (co == 2 || co == 0) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int a[n + 1];
int co = 0;
for (int i = 1; i <= n; i++) {
cin >> a[i];
if (a[i] != i) {
co++;
}
}
if (co == 2 || co == 0) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 765,622 | 765,623 | u525008368 | cpp |
p02958 | #include <stdio.h>
int main() {
int N;
int i;
int current;
int cnt = 0;
scanf("%d", &N);
for (i = 0; i < N; i++) {
scanf("%d", ¤t);
if (i != current) {
cnt++;
}
}
if (cnt > 2) {
printf("NO\n");
} else {
printf("YES\n");
}
return 0;
} | #include <stdio.h>
int main() {
int N;
int i;
int current;
int cnt = 0;
scanf("%d", &N);
for (i = 0; i < N; i++) {
scanf("%d", ¤t);
if ((i + 1) != current) {
cnt++;
}
}
if (cnt > 2) {
printf("NO\n");
} else {
printf("YES\n");
}
return 0;
} | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 765,634 | 765,635 | u251610528 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
#define all(a) a.begin(), a.end()
#define fori(i, n) for (int i = 0; i < n; i++)
#define forb(i, s, t) for (int i = s; i < t; i++)
#define fore(e, v) for (auto &e : v)
#define maxv(v) *max_element(all(v))
#define uniques(v) ... | #include <bits/stdc++.h>
using namespace std;
#define all(a) a.begin(), a.end()
#define fori(i, n) for (int i = 0; i < n; i++)
#define forb(i, s, t) for (int i = s; i < t; i++)
#define fore(e, v) for (auto &e : v)
#define maxv(v) *max_element(all(v))
#define uniques(v) ... | [
"variable_declaration.value.change"
] | 765,636 | 765,637 | u041284359 | cpp |
p02958 | // mOzis_
/////*31022618*/////
//****//MONU KUMAR\****//
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define ull unsigned long long
#define p1(x) cout << x << "\n"
#define p2(x, y) cout << x << " " << y << "\n"
#define p3(x, y, z) cout << x << " " << y << " " << z << "\n"
#define nL cout << "... | // mOzis_
/////*31022618*/////
//****//MONU KUMAR\****//
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define ull unsigned long long
#define p1(x) cout << x << "\n"
#define p2(x, y) cout << x << " " << y << "\n"
#define p3(x, y, z) cout << x << " " << y << " " << z << "\n"
#define nL cout << "... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 765,642 | 765,643 | u504609235 | cpp |
p02958 | /*
lakshaygpt28
Lakshay Gupta
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
using ll = long long;
using db = double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vll = vector<ll>;
template <typ... | /*
lakshaygpt28
Lakshay Gupta
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
using ll = long long;
using db = double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vll = vector<ll>;
template <typ... | [
"expression.operation.binary.add"
] | 765,661 | 765,662 | u295509734 | cpp |
p02958 |
#include <bits/stdc++.h>
using namespace std;
int a[100];
int main() {
int n;
int now = 0;
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = 1; i <= n; i++) {
if (a[i] != i)
now++;
}
if (now != 2) {
puts("NO");
return 0;
}
puts("YES");
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int a[100];
int main() {
int n;
int now = 0;
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = 1; i <= n; i++) {
if (a[i] != i)
now++;
}
if (now > 2) {
puts("NO");
return 0;
}
puts("YES");
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 765,663 | 765,664 | u206489571 | cpp |
p02958 | #include <bits/stdc++.h>
#include <random>
using namespace std;
namespace _ {
bool rEOF = 1; //为0表示文件结尾
inline char nc() {
static char buf[100000], *p1 = buf, *p2 = buf;
return p1 == p2 && rEOF &&
(p2 = (p1 = buf) + fread(buf, 1, 100000, stdin), p1 == p2)
? (rEOF = 0, EOF)
... | #include <bits/stdc++.h>
#include <random>
using namespace std;
namespace _ {
bool rEOF = 1; //为0表示文件结尾
inline char nc() {
static char buf[100000], *p1 = buf, *p2 = buf;
return p1 == p2 && rEOF &&
(p2 = (p1 = buf) + fread(buf, 1, 100000, stdin), p1 == p2)
? (rEOF = 0, EOF)
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 765,665 | 765,666 | u066917439 | cpp |
p02958 | #include <bits/stdc++.h>
#include <random>
using namespace std;
namespace _ {
bool rEOF = 1; //为0表示文件结尾
inline char nc() {
static char buf[100000], *p1 = buf, *p2 = buf;
return p1 == p2 && rEOF &&
(p2 = (p1 = buf) + fread(buf, 1, 100000, stdin), p1 == p2)
? (rEOF = 0, EOF)
... | #include <bits/stdc++.h>
#include <random>
using namespace std;
namespace _ {
bool rEOF = 1; //为0表示文件结尾
inline char nc() {
static char buf[100000], *p1 = buf, *p2 = buf;
return p1 == p2 && rEOF &&
(p2 = (p1 = buf) + fread(buf, 1, 100000, stdin), p1 == p2)
? (rEOF = 0, EOF)
... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 765,667 | 765,666 | u066917439 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<ll> vl;
typedef vector<pair<ll, ll>> vp;
#define rep(i, n) for (ll i = 0; i < ll(n); i++)
#define MMOD(i) ((i % MOD) + MOD) % MOD;
#define all(v) v.begin(), v.end()
#define vec(i, j) vector<vector<ll>>(i, vector<ll>(j, 0))
#define in... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<ll> vl;
typedef vector<pair<ll, ll>> vp;
#define rep(i, n) for (ll i = 0; i < ll(n); i++)
#define MMOD(i) ((i % MOD) + MOD) % MOD;
#define all(v) v.begin(), v.end()
#define vec(i, j) vector<vector<ll>>(i, vector<ll>(j, 0))
#define in... | [
"control_flow.branch.if.condition.change"
] | 765,668 | 765,669 | u268571052 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
#define vi vector<int>
#define vvi vector<vector<int>>
int main(void) {
int n, ans = 0;
cin >> n;
for (int i = 1; i <= n; i++) {
int a;
cin >> a;
if (a != i) {
ans++;
}
}
if (ans == 2) {
cout << "YES" << endl;
} else {
cout << "NO" ... | #include <bits/stdc++.h>
using namespace std;
#define vi vector<int>
#define vvi vector<vector<int>>
int main(void) {
int n, ans = 0;
cin >> n;
for (int i = 1; i <= n; i++) {
int a;
cin >> a;
if (a != i) {
ans++;
}
}
if (ans == 2 || ans == 0) {
cout << "YES" << endl;
} else {
c... | [
"control_flow.branch.if.condition.change"
] | 765,670 | 765,671 | u360441331 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld double
#define pii pair<ll, ll>
#define vl vector<ll>
#define vb vector<bool>
#define vs vector<string>
#define vp vector<pii>
#define pb push_back
#define mp make_pair
#define sc(a) scanf("%lld", &a);
#define sd(a) scanf("%lf", &a);
#define... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld double
#define pii pair<ll, ll>
#define vl vector<ll>
#define vb vector<bool>
#define vs vector<string>
#define vp vector<pii>
#define pb push_back
#define mp make_pair
#define sc(a) scanf("%lld", &a);
#define sd(a) scanf("%lf", &a);
#define... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 765,672 | 765,673 | u378150841 | cpp |
p02958 | #include <algorithm>
#include <cctype>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define rep(i, p, q) for (ll i = p; i < q; ++i)
#define ll long long
using namespace s... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define rep(i, p, q) for (ll i = p; i < q; ++i)
#define ll long long
using namespace s... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 765,676 | 765,677 | u693569496 | cpp |
p02958 | #include <algorithm>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <stdio.h>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
using lst = list<ll>;
ll MAX = 1000000000;
int main() {... | #include <algorithm>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <stdio.h>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
using lst = list<ll>;
ll MAX = 1000000000;
int main() {... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 765,678 | 765,679 | u765606693 | cpp |
p02958 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <ios>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <ios>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 765,682 | 765,683 | u937608388 | cpp |
p02958 | #include <bits/stdc++.h>
//#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")
#define pb push_back
#define IOS \
ios_base::sync_wi... | #include <bits/stdc++.h>
//#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")
#define pb push_back
#define IOS \
ios_base::sync_wi... | [] | 765,685 | 765,686 | u524492594 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int n, a[100], b[100], c = 0;
int main() {
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i], b[i] = a[i];
sort(a, a + n);
for (int i = 0; i < n; i++)
if (a[i] != b[i])
c++;
if (c == 2)
cout << "YES";
else
cout << "NO";
} | #include <bits/stdc++.h>
using namespace std;
int n, a[100], b[100], c = 0;
int main() {
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i], b[i] = a[i];
sort(a, a + n);
for (int i = 0; i < n; i++)
if (a[i] != b[i])
c++;
if (c <= 2)
cout << "YES";
else
cout << "NO";
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 765,689 | 765,690 | u709966987 | cpp |
p02958 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
#define ALL(a) a.begin(), a.end()
#define RALL(a) a.rbegin(), a.rend()
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
const ll INF = MOD * MOD;
int main() {
int n, cnt = 0;
cin >> n;
vector<int> a(n);
REP(i, n) {
... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
#define ALL(a) a.begin(), a.end()
#define RALL(a) a.rbegin(), a.rend()
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
const ll INF = MOD * MOD;
int main() {
int n, cnt = 0;
cin >> n;
vector<int> a(n);
REP(i, n) {
... | [
"control_flow.branch.if.condition.change"
] | 765,691 | 765,692 | u538125576 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int f[55], p[55];
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> f[i];
p[i] = f[i];
}
sort(&f[0], &f[n]);
int cnt = 0;
for (int i = 0; i < n; i++) {
if (f[i] != p[i])
cnt++;
}
cout << (cnt <= 1 ? "YES" : "NO") << end... | #include <bits/stdc++.h>
using namespace std;
int main() {
int f[55], p[55];
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> f[i];
p[i] = f[i];
}
sort(&f[0], &f[n]);
int cnt = 0;
for (int i = 0; i < n; i++) {
if (f[i] != p[i])
cnt++;
}
cout << (cnt <= 2 ? "YES" : "NO") << end... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"io.output.change"
] | 765,693 | 765,694 | u354271781 | cpp |
p02958 | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin()... | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin()... | [
"control_flow.branch.if.condition.change"
] | 765,697 | 765,698 | u526630579 | cpp |
p02958 | #include <algorithm>/*toupperとかが入っている*/
#include <cmath>
#include <iostream>
#include <string>
#include <vector>/*可変長配列vectorのインクルード*/
const int MOD =
1000000007; /* 1,000,000,007 で割った余りを出力する のとき使う*/
using namespace std; /*標準名前空間を利用する。cinやcoutはこれによって利用可能になる*/
int N;
int P[55];
long long int A, B;
int main(void) ... | #include <algorithm>/*toupperとかが入っている*/
#include <cmath>
#include <iostream>
#include <string>
#include <vector>/*可変長配列vectorのインクルード*/
const int MOD =
1000000007; /* 1,000,000,007 で割った余りを出力する のとき使う*/
using namespace std; /*標準名前空間を利用する。cinやcoutはこれによって利用可能になる*/
int N;
int P[55];
long long int A, B;
int main(void) ... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 765,699 | 765,700 | u607444339 | cpp |
p02958 | #include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int(i) = 0; (i) < (... | #include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int(i) = 0; (i) < (... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 765,706 | 765,707 | u239409893 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define start_routine() int begtime = clock();
#def... | #include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define start_routine() int begtime = clock();
#def... | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change",
"assignment.value.change"
] | 765,716 | 765,717 | u851993789 | cpp |
p02958 |
#include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vec(N, 0);
for (int i = 0; i < N; i++) {
cin >> vec[i];
}
int res = 0;
for (int j = 0; j < N; j++) {
if (vec[j] != j + 1) {
re... |
#include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vec(N, 0);
for (int i = 0; i < N; i++) {
cin >> vec[i];
}
int res = 0;
for (int j = 0; j < N; j++) {
if (vec[j] != j + 1) {
re... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 765,718 | 765,719 | u910757347 | cpp |
p02958 | #include <bits/stdc++.h>
#define mp make_pair
#define F first
#define S second
#define ll long long
using namespace std;
const int LIM = 3e5 + 3;
int cost[LIM + 3], d[LIM + 3];
ll INF = 1e18;
ll Ans = 0;
void solve(int l, int r) {
if (l >= r)
return;
int mid = (l + r) / 2;
vector<pair<int, ll>> V, W;
int m... | #include <bits/stdc++.h>
#define mp make_pair
#define F first
#define S second
#define ll long long
using namespace std;
const int LIM = 3e5 + 3;
int cost[LIM + 3], d[LIM + 3];
ll INF = 1e18;
ll Ans = 0;
void solve(int l, int r) {
if (l >= r)
return;
int mid = (l + r) / 2;
vector<pair<int, ll>> V, W;
int m... | [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove"
] | 765,727 | 765,728 | u540045035 | cpp |
p02958 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
using namespace std;
#define MOD 1000000007
#define EPS 10e-8
int main() {
int N, p[100], c;
cin >> N;
rep(i, N) {
cin >> p[i... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
using namespace std;
#define MOD 1000000007
#define EPS 10e-8
int main() {
int N, p[100], c;
cin >> N;
rep(i, N) {
cin >> p[i... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 765,729 | 765,730 | u008229752 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.