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 8
values |
|---|---|---|---|---|---|---|---|
p02958 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
int main() {
int n;
cin >> n;
vector<int> p(n);
REP(i, n) { cin >> p.at(i); }
vector<int> q = p;
sort(q.begin(), q.end());
vector<int> r;
bool res = false;
if (p == q) {
res = true;
}
int c, d;
REP(i,... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
int main() {
int n;
cin >> n;
vector<int> p(n);
REP(i, n) { cin >> p.at(i); }
vector<int> q = p;
sort(q.begin(), q.end());
vector<int> r;
bool res = false;
if (p == q) {
res = true;
}
int c, d;
REP(i,... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 763,192 | 763,193 | u231354686 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
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)
cout << "Yes" << endl;
else
cout << "No" <... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
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)
cout << "YES" << endl;
else
cout << "NO" <... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,196 | 763,197 | u150155436 | cpp |
p02958 | #include <iostream>
using namespace std;
int main() {
int N;
int a[N];
for (int i = 0; i < N; i++) {
cin >> a[i];
}
int k = 0;
for (int i = 0; i < N; i++) {
if (a[i] != i + 1)
k++;
}
if (k == 0 || k == 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int a[N];
for (int i = 0; i < N; i++) {
cin >> a[i];
}
int k = 0;
for (int i = 0; i < N; i++) {
if (a[i] != i + 1)
k++;
}
if (k == 0 || k == 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
... | [] | 763,204 | 763,205 | u908448907 | cpp |
p02958 | #include "bits/stdc++.h"
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define mFOR(i, a, b) for (int i = a; i > b; i--)
#define MP make_pair
#define PB push_back
#define ALL(v) v.begin(), v.end()
#define N 100007
#define INF 1000000007
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) { return b == 0 ... | #include "bits/stdc++.h"
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define mFOR(i, a, b) for (int i = a; i > b; i--)
#define MP make_pair
#define PB push_back
#define ALL(v) v.begin(), v.end()
#define N 100007
#define INF 1000000007
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) { return b == 0 ... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,208 | 763,209 | u803173123 | 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] = i + 1;
}
for (int i = 0; i < n; i++) {
for (int j = 0; i < n; j++) {
swap(p[i], p[j]);
if (p == q) {
cout << "YES" << endl;... | #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] = i + 1;
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
swap(p[i], p[j]);
if (p == q) {
cout << "YES" << endl;... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 763,213 | 763,214 | u578969098 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int p[60] = {0};
for (int i = 0; i < n; i++)
cin >> p[i];
// for(int i=0; i<n; i++) cout << p[i] << " ";
// cout << endl;
int a[60] = {0};
for (int i = 0; i < n; i++)
a[i] = i + 1;
// for(int i=0; i<n; i++) co... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int p[60] = {0};
for (int i = 0; i < n; i++)
cin >> p[i];
int a[60] = {0};
for (int i = 0; i < n; i++)
a[i] = i + 1;
int ans = 0;
for (int i = 0; i < n; i++) {
if (p[i] != a[i])
ans++;
}
if (ans <= 2)
... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,227 | 763,228 | u739489568 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int p[60] = {0};
for (int i = 0; i < n; i++)
cin >> p[i];
int a[60] = {0};
for (int i = 0; i < n; i++)
a[i] = i + 1;
int ans = 0;
for (int i = 0; i < n; i++) {
if (p[i] != a[i])
ans++;
}
if (ans <= 2)
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int p[60] = {0};
for (int i = 0; i < n; i++)
cin >> p[i];
int a[60] = {0};
for (int i = 0; i < n; i++)
a[i] = i + 1;
int ans = 0;
for (int i = 0; i < n; i++) {
if (p[i] != a[i])
ans++;
}
if (ans <= 2)
... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,229 | 763,228 | u739489568 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int c = 0;
for (int i = 0; i < n; i++) {
int p;
cin >> p;
c += (p != i + 1);
}
cout << (c <= 2 ? "Yes" : "No") << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int c = 0;
for (int i = 0; i < n; i++) {
int p;
cin >> p;
c += (p != i + 1);
}
cout << (c <= 2 ? "YES" : "NO") << endl;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,232 | 763,233 | u145855676 | 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> sortp(N);
sortp = p;
sort(sortp.begin(), sortp.end());
bool flag;
if (p == sortp)
flag = true;
else
flag = false;
vector<int> q(N);
... | #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> sortp(N);
sortp = p;
sort(sortp.begin(), sortp.end());
bool flag;
if (p == sortp)
flag = true;
else
flag = false;
vector<int> q(N);
... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,246 | 763,247 | u327750344 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
int count = 0;
for (int i = 0; i < N; i++) {
if (A.at(i) != i + 1) {
count++;
}
}
if (count <= 2) {
cout << "Yes" << endl;
} else {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
int count = 0;
for (int i = 0; i < N; i++) {
if (A.at(i) != i + 1) {
count++;
}
}
if (count <= 2) {
cout << "YES" << endl;
} else {
... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,250 | 763,251 | u896053584 | cpp |
p02958 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int in;
int cnt = 0;
for (int i = 0; i < n; i++) {
cin >> in;
if (i + 1 != in) {
cnt++;
}
}
if (cnt == 2 || cnt == 0) {
cout << "YES" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int in;
int cnt = 0;
for (int i = 0; i < n; i++) {
cin >> in;
if (i + 1 != in) {
cnt++;
}
}
if (cnt == 2 || cnt == 0) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,254 | 763,255 | u361948770 | cpp |
p02958 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int in;
int cnt = 0;
for (int i = 0; i < n; i++) {
cin >> in;
if (i + 1 != in) {
cnt++;
}
}
if (cnt == 2) {
cout << "YES" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int in;
int cnt = 0;
for (int i = 0; i < n; i++) {
cin >> in;
if (i + 1 != in) {
cnt++;
}
}
if (cnt == 2 || cnt == 0) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
} | [
"control_flow.branch.if.condition.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,256 | 763,255 | u361948770 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
vector<int> p(N);
for (int i = 0; i < N; i++) {
cin >> p[i];
}
bool ans = true;
for (int k = 0; k < N - 1; k++) {
if (p[k] > p[k + 1]) {
ans = false;
break;
}
}
if (ans == false) ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
vector<int> p(N);
for (int i = 0; i < N; i++) {
cin >> p[i];
}
bool ans = true;
for (int k = 0; k < N - 1; k++) {
if (p[k] > p[k + 1]) {
ans = false;
break;
}
}
if (ans == false) ... | [
"assignment.add"
] | 763,263 | 763,264 | u947382132 | cpp |
p02958 | #include "bits/stdc++.h"
#define rep(loop, N) for (int loop = 0; loop < N; loop++)
using namespace std;
struct Node {
Node *parent = NULL;
vector<Node *> child;
long long value = 0;
};
struct Edge {
int parent = 0;
int child = 0;
bool operator<(const Edge &right) const { return parent < right.parent; }
};... | #include "bits/stdc++.h"
#define rep(loop, N) for (int loop = 0; loop < N; loop++)
using namespace std;
struct Node {
Node *parent = NULL;
vector<Node *> child;
long long value = 0;
};
struct Edge {
int parent = 0;
int child = 0;
bool operator<(const Edge &right) const { return parent < right.parent; }
};... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,271 | 763,272 | u610752387 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int ans = 0;
for (int i = 1; i <= N; i++) {
int C;
cin >> C;
if (C != i)
ans++;
}
if (ans <= 2)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int ans = 0;
for (int i = 1; i <= N; i++) {
int C;
cin >> C;
if (C != i)
ans++;
}
if (ans <= 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,275 | 763,276 | u085235341 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
int main() {
int N;
cin >> N;
vector<int> A(N);
rep(i, N) { cin >> A.at(i); }
int count = 0;
rep(i, N) {
if (A.at(i) == i + 1) {
count++;
}
}
if (count <= 2) {
cout << "YES" << endl;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
int main() {
int N;
cin >> N;
vector<int> A(N);
rep(i, N) { cin >> A.at(i); }
int count = 0;
rep(i, N) {
if (A.at(i) != i + 1) {
count++;
}
}
if (count <= 2) {
cout << "YES" << endl;
... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 763,277 | 763,278 | u215100858 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, Z = 0;
for (int i = 1; i <= N; i++) {
int a;
cin >> a;
if (a != i) {
Z++;
}
}
if (Z == 0 || Z == 2) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, Z = 0;
cin >> N;
for (int i = 1; i <= N; i++) {
int a;
cin >> a;
if (a != i) {
Z++;
}
}
if (Z == 0 || Z == 2) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} | [] | 763,279 | 763,280 | u158290747 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, ans = 0;
cin >> n;
vector<int> p(n);
vector<int> q(n);
for (int i = 0; i < n; i++) {
cin >> p.at(i);
q.at(i) = i + 1;
}
for (int i = 0; i < n; i++) {
if (p.at(i) != q.at(i))
ans++;
}
if (ans > 2) {
cout << "No" <<... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, ans = 0;
cin >> n;
vector<int> p(n);
vector<int> q(n);
for (int i = 0; i < n; i++) {
cin >> p.at(i);
q.at(i) = i + 1;
}
for (int i = 0; i < n; i++) {
if (p.at(i) != q.at(i))
ans++;
}
if (ans > 2) {
cout << "NO" <<... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,286 | 763,287 | u363892646 | cpp |
p02958 | //
// Created on 2020/04/16.
//
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#includ... | //
// Created on 2020/04/16.
//
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#includ... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,298 | 763,299 | u723843066 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int sum = 0;
for (int i = 1; i <= N; i++) {
int A;
cin >> A;
if (A == i)
sum++;
}
if (sum <= 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int sum = 0;
for (int i = 1; i <= N; i++) {
int A;
cin >> A;
if (A != i)
sum++;
}
if (sum <= 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 763,304 | 763,305 | u101018317 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int p[50];
int main() {
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
int n;
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> p[i];
}
bool possible = true;
for (int i = 1; i < n; ++i) {
if (p[i] < p[i - 1]) {
po... | #include <bits/stdc++.h>
using namespace std;
int p[50];
int main() {
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
int n;
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> p[i];
}
bool possible = true;
for (int i = 1; i < n; ++i) {
if (p[i] < p[i - 1]) {
po... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,308 | 763,309 | u194015723 | cpp |
p02958 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> p(n);
vector<int> q(n);
rep(i, n) {
cin >> p[i];
q[i] = p[i];
}
int res = 0;
sort(q.rbegin(), q.rend());
rep(i, n) {
if (p[i] != q[... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> p(n);
vector<int> q(n);
rep(i, n) {
cin >> p[i];
q[i] = p[i];
}
int res = 0;
sort(q.begin(), q.end());
rep(i, n) {
if (p[i] != q[i]... | [
"call.function.change",
"call.arguments.change"
] | 763,310 | 763,311 | u816145694 | cpp |
p02958 | #include <algorithm>
#include <cmath>
#include <cstdint>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <type_traits>
#include <vector>
typedef long long ll;
using namespace std;
//素因数分解
void ... | #include <algorithm>
#include <cmath>
#include <cstdint>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <type_traits>
#include <vector>
typedef long long ll;
using namespace std;
//素因数分解
void ... | [
"control_flow.branch.if.condition.change"
] | 763,315 | 763,316 | u595446852 | 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 cnt = 0;
for (int i = 0; i < N; i++) {
if (A[i] == i + 1) {
cnt++;
}
}
if (cnt <= 2) {
cout << "YES" << endl;
} else {
cout << "NO" <... | #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 cnt = 0;
for (int i = 0; i < N; i++) {
if (A[i] != i + 1) {
cnt++;
}
}
if (cnt <= 2) {
cout << "YES... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 763,317 | 763,318 | u374187034 | cpp |
p02958 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, N) for (int i = 0; i < (int)(N); i++)
int main() {
int n;
cin >> n;
vector<int> p(n);
rep(i, n) cin >> p[i];
int count = 0;
string ans = "YES";
rep(i, n) {
if (p[i] != i + 1)
count++;
}
i... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, N) for (int i = 0; i < (int)(N); i++)
int main() {
int n;
cin >> n;
vector<int> p(n);
rep(i, n) cin >> p[i];
int count = 0;
string ans = "YES";
rep(i, n) {
if (p[i] != i + 1)
count++;
}
i... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 763,319 | 763,320 | u485925545 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int mas[n + 1];
int d = 0;
for (int i = 1; i <= n; i++) {
cin >> mas[i];
}
for (int i = 1; i <= n; i++) {
if (mas[i] != i) {
d++;
}
}
if (d > 2) {
cout << "No";
} else {
cout << "Yes";
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int mas[n + 1];
int d = 0;
for (int i = 1; i <= n; i++) {
cin >> mas[i];
}
for (int i = 1; i <= n; i++) {
if (mas[i] != i) {
d++;
}
}
if (d > 2) {
cout << "NO";
} else {
cout << "YES";
}
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,321 | 763,322 | u759632062 | cpp |
p02958 | #include <algorithm>
#include <iostream>
using namespace std;
void Judge(int x[], int y[], int N) {
int count = 0;
for (int i = 0; i < N; i++) {
if (x[i] != y[i])
count++;
}
if (count <= 2)
cout << "Yes";
if (count > 2)
cout << "No";
}
int main() {
int N;
cin >> N;
int p[N];
int pp... | #include <algorithm>
#include <iostream>
using namespace std;
void Judge(int x[], int y[], int N) {
int count = 0;
for (int i = 0; i < N; i++) {
if (x[i] != y[i])
count++;
}
if (count <= 2)
cout << "YES";
if (count > 2)
cout << "NO";
}
int main() {
int N;
cin >> N;
int p[N];
int pp... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,323 | 763,324 | u520026417 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(n) begin(n), end(n)
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> p(n);
rep(i, n) cin >> p[i];
int cnt = 0;
rep(i, n) {
if (p[i] !... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(n) begin(n), end(n)
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> p(n);
rep(i, n) cin >> p[i];
int cnt = 0;
rep(i, n) {
if (p[i] !... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,327 | 763,328 | u074488832 | cpp |
p02958 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
typedef long long ll;
#define all(x) (x).begin(), (x).end() // sortなどの引数を省略
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define max3(x, y, z) max(x, max(y, z))
#ifdef _MSC_FULL_VER //デバッグ出力
#define dout cout
#define de... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
typedef long long ll;
#define all(x) (x).begin(), (x).end() // sortなどの引数を省略
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define max3(x, y, z) max(x, max(y, z))
#ifdef _MSC_FULL_VER //デバッグ出力
#define dout cout
#define de... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 763,329 | 763,330 | u043964516 | cpp |
p02958 | #include <algorithm>
#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 Q[N];
for (int i = 0; i < N; i++)
Q[i] = P[i];
sort(Q, Q + N);
int counter = 0;
for (int i = 0; i < N; i++) {
if (P[i] == Q[i]) {
c... | #include <algorithm>
#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 Q[N];
for (int i = 0; i < N; i++)
Q[i] = P[i];
sort(Q, Q + N);
int counter = 0;
for (int i = 0; i < N; i++) {
if (P[i] != Q[i]) {
c... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 763,331 | 763,332 | u731665172 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> num(N);
for (int i = 0; i < N; i++)
cin >> num.at(i);
vector<int> num2(N);
for (int i = 0; i < N; i++)
num2.at(i) = num.at(i);
sort(num2.begin(), num2.end());
int count = 0;
for (int i = 0; i < N; i++) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> num(N);
for (int i = 0; i < N; i++)
cin >> num.at(i);
vector<int> num2(N);
for (int i = 0; i < N; i++)
num2.at(i) = num.at(i);
sort(num2.begin(), num2.end());
int count = 0;
for (int i = 0; i < N; i++) {
... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,335 | 763,336 | u987575170 | cpp |
p02958 | #include <bits/stdc++.h>
typedef long long int ll;
typedef long double ld;
using namespace std;
int main() {
ll n;
cin >> n;
ll p[n];
ll q[n];
for (ll i = 0; i < n; ++i) {
cin >> p[i];
q[i] = i + 1;
}
string ans = "No";
ll flag = 0;
for (ll i = 0; i < n; ++i) {
if (p[i] == q[i]) {
... | #include <bits/stdc++.h>
typedef long long int ll;
typedef long double ld;
using namespace std;
int main() {
ll n;
cin >> n;
ll p[n];
ll q[n];
for (ll i = 0; i < n; ++i) {
cin >> p[i];
q[i] = i + 1;
}
string ans = "NO";
ll flag = 0;
for (ll i = 0; i < n; ++i) {
if (p[i] == q[i]) {
... | [
"literal.string.change",
"literal.string.case.change",
"variable_declaration.value.change",
"assignment.value.change"
] | 763,347 | 763,348 | u473023730 | cpp |
p02958 | #include <algorithm>
#include <iostream>
#include <vector>
#define ll long long
using namespace std;
int main() {
int n;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; i++) {
cin >> p[i];
}
vector<int> psort(p.size());
copy(p.begin(), p.end(), psort.begin());
sort(psort.begin(), psort.end());
... | #include <algorithm>
#include <iostream>
#include <vector>
#define ll long long
using namespace std;
int main() {
int n;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; i++) {
cin >> p[i];
}
vector<int> psort(p.size());
copy(p.begin(), p.end(), psort.begin());
sort(psort.begin(), psort.end());
... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,351 | 763,352 | u476027087 | cpp |
p02958 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
int count = 0;
for (int i... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
int count = 0;
for (int i... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,354 | 763,355 | u607564800 | cpp |
p02958 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
int count = 0;
for (int i... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
int count = 0;
for (int i... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,356 | 763,355 | u607564800 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
vector<int> p(n);
for (int i = 0; i < n; i++) {
cin >> p[i];
}
int k = 0;
for (int i = 0; i < n; i++) {
if (p[i] != i + 1)
k++;
}
if (k <= 2)
cout << "YES";
else
cout << "NO";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; i++) {
cin >> p[i];
}
int k = 0;
for (int i = 0; i < n; i++) {
if (p[i] != i + 1)
k++;
}
if (k <= 2)
cout << "YES";
else
cout << "NO";
return 0;
}
| [] | 763,363 | 763,364 | u772661182 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define INF 1e9
#define PI 3.14159265359
#define MOD 1000000007
#define ALL(v) v.begin(), v.end()
#define ALLR(v) v.rbegin(), v.rend()
typedef long long ll;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1}... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define INF 1e9
#define PI 3.14159265359
#define MOD 1000000007
#define ALL(v) v.begin(), v.end()
#define ALLR(v) v.rbegin(), v.rend()
typedef long long ll;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1}... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,365 | 763,366 | u474760662 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> p;
int point = 0;
for (int i = 1; i < N + 1; i++) {
int a;
cin >> a;
if (a != i) {
point++;
}
}
if (point == 2 || point == 0) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> p;
int point = 0;
for (int i = 1; i < N + 1; i++) {
int a;
cin >> a;
if (a != i) {
point++;
}
}
if (point == 2 || point == 0) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,369 | 763,370 | u636018568 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define FASTINOUT \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define FASTINOUT \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,373 | 763,374 | u257571179 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
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 (i != p[i - 1]) {
cnt++;
// cout << i << " " << p[i-1] << endl;
}
}... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
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 (i != p[i - 1]) {
cnt++;
// cout << i << " " << p[i-1] << endl;
}
}... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,375 | 763,376 | u191484928 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int count = 0;
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());
for (int j = 0; j < N; ++j) {
if (A[j] != B[j])
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int count = 0;
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());
for (int j = 0; j < N; ++j) {
if (A[j] != B[j])
... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,378 | 763,379 | u846025219 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
const int MOD = 1000000007;
int main() {
int N;
cin >> N;
vector<int> p(N);
int count = 0;
int a, b;
bool can = false;
for (int i = 0; i < N; i++) {
cin >> p.at(i);
}
for (int i = 1; i < N + 1; i++) {
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
const int MOD = 1000000007;
int main() {
int N;
cin >> N;
vector<int> p(N);
int count = 0;
int a, b;
bool can = false;
for (int i = 0; i < N; i++) {
cin >> p.at(i);
}
for (int i = 1; i < N + 1; i++) {
... | [
"control_flow.branch.if.condition.change",
"variable_declaration.add"
] | 763,381 | 763,382 | u574687269 | cpp |
p02958 | #include <iostream>
#include <math.h>
using namespace std;
int main() {
int n;
cin >> n;
int p[60];
int c = 0;
for (int i = 0; i < n; i++) {
cin >> p[i];
if (p[i] != i + 1)
c++;
}
if (c > 2)
cout << "No" << endl;
else
cout << "Yes" << endl;
} | #include <iostream>
#include <math.h>
using namespace std;
int main() {
int n;
cin >> n;
int p[60];
int c = 0;
for (int i = 0; i < n; i++) {
cin >> p[i];
if (p[i] != i + 1)
c++;
}
if (c > 2)
cout << "NO" << endl;
else
cout << "YES" << endl;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,383 | 763,384 | u027762862 | 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 x = 0;
for (int i = 0; i < N; i++) {
if (p[i] != i + 1)
x++;
}
if (x == 0 && x == 2)
puts("YES");
else
puts("NO");
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> p(N);
for (int i = 0; i < N; i++)
cin >> p[i];
int x = 0;
for (int i = 0; i < N; i++) {
if (p[i] != i + 1)
x++;
}
if (x == 0 || x == 2)
puts("YES");
else
puts("NO");
} | [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 763,385 | 763,386 | u146788010 | 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 x = 0;
for (int i = 0; i < N; i++) {
if (p[i] != i + 1)
x++;
}
if (x == 2)
puts("YES");
else
puts("NO");
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> p(N);
for (int i = 0; i < N; i++)
cin >> p[i];
int x = 0;
for (int i = 0; i < N; i++) {
if (p[i] != i + 1)
x++;
}
if (x == 0 || x == 2)
puts("YES");
else
puts("NO");
} | [
"control_flow.branch.if.condition.change"
] | 763,387 | 763,386 | u146788010 | cpp |
p02958 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <string>
#include <vector>
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define ll long long
using namespace std;
int main() {
int n;
cin >> n;
ve... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <string>
#include <vector>
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define ll long long
using namespace std;
int main() {
int n;
cin >> n;
ve... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,388 | 763,389 | u294829559 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int i, p[n], w = 0;
for (i = 0; i < n; i++) {
cin >> p[i];
if (p[i] != (i + 1))
w++;
}
if (w > 2)
cout << "No" << endl;
else
cout << "Yes" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int i, p[n], w = 0;
for (i = 0; i < n; i++) {
cin >> p[i];
if (p[i] != (i + 1))
w++;
}
if (w > 2)
cout << "NO" << endl;
else
cout << "YES" << endl;
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,392 | 763,393 | u719967911 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> p(n);
int sum = 0;
for (int i = 0; i < n; i++) {
cin >> p[i];
if (p[i] != i + 1) {
sum++;
}
}
if (sum > 2) {
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> p(n);
int sum = 0;
for (int i = 0; i < n; i++) {
cin >> p[i];
if (p[i] != i + 1) {
sum++;
}
}
if (sum > 2) {
cout << "NO" << endl;
} else {
cout << "YES" << endl;
}
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,395 | 763,396 | u176218583 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> p(n);
int sum = 0;
for (int i = 0; i < n; i++) {
cin >> p[i];
if (p[i] == i + 1) {
sum++;
}
}
if (sum > 2) {
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> p(n);
int sum = 0;
for (int i = 0; i < n; i++) {
cin >> p[i];
if (p[i] != i + 1) {
sum++;
}
}
if (sum > 2) {
cout << "NO" << endl;
} else {
cout << "YES" << endl;
}
return 0;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,398 | 763,396 | u176218583 | cpp |
p02958 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
int p;
vector<int> ps;
for (int i = 0; i < N; ++i) {
cin >> p;
ps.push_back(p);
}
int cnt = 0;
... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
int p;
vector<int> ps;
for (int i = 0; i < N; ++i) {
cin >> p;
ps.push_back(p);
}
int cnt = 0;
... | [
"control_flow.branch.if.condition.change"
] | 763,399 | 763,400 | u319569229 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; i++) {
cin >> p.at(i);
}
for (int i = 0; i < n; i++) {
if (p.at(i) != i + 1) {
k++;
}
}
if (k == 2 || k == 0) {
cout << "YES" << endl;
} else {
cout << "NO... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
k = 0;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; i++) {
cin >> p.at(i);
}
for (int i = 0; i < n; i++) {
if (p.at(i) != i + 1) {
k++;
}
}
if (k == 2 || k == 0) {
cout << "YES" << endl;
} else {
co... | [
"assignment.add"
] | 763,401 | 763,402 | u233383925 | cpp |
p02958 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<char> p(n), s(n);
for (int i = 0; i < n; i++) {
cin >> p[i];
s[i] = p[i];
}
sort(s.begin(), s.end());
int cnt = 0;
for (int i = 0; i < n; i++) {
if (s[i] != p[i]) {
c... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> p(n), s(n);
for (int i = 0; i < n; i++) {
cin >> p[i];
s[i] = p[i];
}
sort(s.begin(), s.end());
int cnt = 0;
for (int i = 0; i < n; i++) {
if (s[i] != p[i]) {
cn... | [
"variable_declaration.type.primitive.change"
] | 763,407 | 763,408 | u011716617 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define st string
#define dl double
#define ve(i) vector<i>
#define repi(i, m, n) for (int i = (int)(m); i < (int)(n); i++)
#define rep(i, n) repi(i, 0, n)
#define sz(v) ((int)(v).size())
#define each(i, n) for (auto &&i : n)
#def... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define st string
#define dl double
#define ve(i) vector<i>
#define repi(i, m, n) for (int i = (int)(m); i < (int)(n); i++)
#define rep(i, n) repi(i, 0, n)
#define sz(v) ((int)(v).size())
#define each(i, n) for (auto &&i : n)
#def... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change"
] | 763,409 | 763,410 | u449573758 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define INF 999999999
#define rep(i, n) for (int i = 0; i < n; i++)
const int MOD = 1000000007;
ll cnt = 0;
int main() {
int n;
cin >> n;
vector<int> p(n);
rep(i, n) { cin >> p.at(i); }
for (int i = 0; i < n; i++) {
if (p.at(i) != i + 1)... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define INF 999999999
#define rep(i, n) for (int i = 0; i < n; i++)
const int MOD = 1000000007;
ll cnt = 0;
int main() {
int n;
cin >> n;
vector<int> p(n);
rep(i, n) { cin >> p.at(i); }
for (int i = 0; i < n; i++) {
if (p.at(i) != i + 1)... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,411 | 763,412 | u179593519 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define INF 999999999
#define rep(i, n) for (int i = 0; i < n; i++)
const int MOD = 1000000007;
ll cnt = 0;
int main() {
int n;
cin >> n;
vector<int> p(n);
rep(i, n) { cin >> p.at(i); }
for (int i = 0; i < n; i++) {
if (p.at(i) != i + 1)... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define INF 999999999
#define rep(i, n) for (int i = 0; i < n; i++)
const int MOD = 1000000007;
ll cnt = 0;
int main() {
int n;
cin >> n;
vector<int> p(n);
rep(i, n) { cin >> p.at(i); }
for (int i = 0; i < n; i++) {
if (p.at(i) != i + 1)... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,413 | 763,412 | u179593519 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const int MAX = 50;
int main() {
int n, a;
cin >> n;
int cnt = 0;
rep(i, n) {
cin >> a;
if (i != a - 1)
cnt++;
}
if (cnt == 2) {
cout << "YES" << endl;
} else {
cout << "NO" << endl... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const int MAX = 50;
int main() {
int n, a;
cin >> n;
int cnt = 0;
rep(i, n) {
cin >> a;
if (i != a - 1)
cnt++;
}
if (cnt == 2 || cnt == 0) {
cout << "YES" << endl;
} else {
cout << ... | [
"control_flow.branch.if.condition.change"
] | 763,416 | 763,417 | u621582427 | cpp |
p02958 | #include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#in... | #include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#in... | [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.branch.else.remove",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.ad... | 763,422 | 763,423 | u022688266 | cpp |
p02958 | #include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#in... | #include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#in... | [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"io.output.change"
] | 763,424 | 763,423 | u022688266 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
int n, A[10000], B[10000], c = 0;
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> A[i];
B[i] = A[i];
}
sort(B, B + n);
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 argc, char const *argv[]) {
int n, A[10000], B[10000], c = 0;
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> A[i];
B[i] = A[i];
}
sort(B, B + n);
for (int i = 0; i < n; ++i) {
if (A[i] != B[i]) {
c++;
}
}
if (c == 2 || c ... | [
"control_flow.branch.if.condition.change"
] | 763,425 | 763,426 | u022688266 | cpp |
p02958 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define strall(v) (v).cbegin(), (v).cend()
using namespace std;
using ll = long long;
using P = pair<int, int>;
using Graph = vector<vector<int>>;
template <class t, cl... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define strall(v) (v).cbegin(), (v).cend()
using namespace std;
using ll = long long;
using P = pair<int, int>;
using Graph = vector<vector<int>>;
template <class t, cl... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,433 | 763,434 | u106635407 | cpp |
p02958 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
int n, cnt = 0;
int p[50];
cin >> n;
for (int i = 0; i < n; i++) {
cin >> p[i];
}
for (int i = 0; i < n; i++) {
int min = i;
for (int j = i + 1; j < n; j++) {
if (p[j] < p[min]) {
min = j;
}
... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
int n, cnt = 0;
int p[50];
cin >> n;
for (int i = 0; i < n; i++) {
cin >> p[i];
}
for (int i = 0; i < n; i++) {
int min = i;
for (int j = i + 1; j < n; j++) {
if (p[j] < p[min]) {
min = j;
}
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"io.output.change"
] | 763,441 | 763,442 | u185935459 | cpp |
p02958 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
void security() {
string s;
cin >> s;
for (int i = 1; i < s.size(); ++i) {
if (s[i - 1] == s[i]) {
cout << "Bad\n";
return;
}
}
cout << "Good\n";
}
void fifty_fify() {
s... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
void security() {
string s;
cin >> s;
for (int i = 1; i < s.size(); ++i) {
if (s[i - 1] == s[i]) {
cout << "Bad\n";
return;
}
}
cout << "Good\n";
}
void fifty_fify() {
s... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,447 | 763,448 | u546641746 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
#define Fast \
ios_base::sync_with_stdio(0); \
cin.tie(0), cout.tie(0)
#define FO freopen("in.txt", "r", stdin)
#define FC freopen("out.txt", "w", stdout)
#... | #include <bits/stdc++.h>
using namespace std;
#define Fast \
ios_base::sync_with_stdio(0); \
cin.tie(0), cout.tie(0)
#define FO freopen("in.txt", "r", stdin)
#define FC freopen("out.txt", "w", stdout)
#... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,449 | 763,450 | u568082675 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> data(n);
for (int i = 0; i < n; i++) {
cin >> data.at(i);
}
int count = 0;
for (int i = 0; i < n; i++) {
if (i + 1 != data.at(i)) {
count++;
}
}
if (count < 3) {
cout << "Yes" << endl;
}... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> data(n);
for (int i = 0; i < n; i++) {
cin >> data.at(i);
}
int count = 0;
for (int i = 0; i < n; i++) {
if (i + 1 != data.at(i)) {
count++;
}
}
if (count < 3) {
cout << "YES" << endl;
}... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,451 | 763,452 | u164352406 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int count = 0;
vector<int> p(N);
for (int i = 0; i < N; i++) {
cin >> p[i];
}
for (int i = 0; i < N; i++) {
if (p[i] != i + 1)
count++;
}
if (count > 2)
cout << "No" << endl;
else
cout << "Yes" << en... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int count = 0;
vector<int> p(N);
for (int i = 0; i < N; i++) {
cin >> p[i];
}
for (int i = 0; i < N; i++) {
if (p[i] != i + 1)
count++;
}
if (count > 2)
cout << "NO" << endl;
else
cout << "YES" << en... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,453 | 763,454 | u796273093 | cpp |
p02958 | /*
このコード、と～おれ!
Be accepted!
∧＿∧
（｡･ω･｡)つ━☆・*。
⊂ ノ ・゜+.
しーＪ °。+ *´¨)
.· ´¸.·*´¨) ¸.·*¨)
(¸.·´ (¸.·'* ☆
*/
#include <algorithm>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <ios... | /*
このコード、と～おれ!
Be accepted!
∧＿∧
（｡･ω･｡)つ━☆・*。
⊂ ノ ・゜+.
しーＪ °。+ *´¨)
.· ´¸.·*´¨) ¸.·*¨)
(¸.·´ (¸.·'* ☆
*/
#include <algorithm>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <ios... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 763,460 | 763,461 | u917972976 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double ld;
#define for0(i, n) for (ll i = 0; i < (ll)(n); ++i) // 0 based indexing
#define for1(i, n) for (ll i = 1; i <= (ll)(n); ++i) // 1 based indexing
#define forc(i, l, r) \
for... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double ld;
#define for0(i, n) for (ll i = 0; i < (ll)(n); ++i) // 0 based indexing
#define for1(i, n) for (ll i = 1; i <= (ll)(n); ++i) // 1 based indexing
#define forc(i, l, r) \
for... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,471 | 763,472 | u155580903 | cpp |
p02958 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
using P = pair<int, int>;
typedef long long int ll;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
int main()... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
using P = pair<int, int>;
typedef long long int ll;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
int main()... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,479 | 763,480 | u729285002 | cpp |
p02958 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include ... | [
"literal.string.change",
"literal.string.case.change",
"variable_declaration.value.change",
"assignment.value.change"
] | 763,487 | 763,488 | u114137758 | cpp |
p02958 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <cstdint>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#incl... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <cstdint>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#incl... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,493 | 763,494 | u519950235 | cpp |
p02958 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <cstdint>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#incl... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <cstdint>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#incl... | [
"literal.number.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,495 | 763,494 | u519950235 | cpp |
p02958 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
auto p = vector<int>(n);
for (auto &p_i : p)
cin >> p_i;
int counter = 0;
for (int i = 0; i < n; i++) {
if (p[i] != i + 1)
counter++;
}
cout << (counter == 2 ? "YES" : "NO");
return 0;
}
| #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
auto p = vector<int>(n);
for (auto &p_i : p)
cin >> p_i;
int counter = 0;
for (int i = 0; i < n; i++) {
if (p[i] != i + 1)
counter++;
}
cout << (counter == 0 || counter == 2 ? "YES" : "NO");
retur... | [
"expression.operation.binary.add"
] | 763,498 | 763,499 | u723394740 | cpp |
p02958 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep2(i, s, n) for (int i = s; i < n; ++i)
#define all(a) a.begin(), a.end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
vector<int> p(n), ip(n);
rep(i, n) cin >> p[i];
ip = p;
sort(all(... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep2(i, s, n) for (int i = s; i < n; ++i)
#define all(a) a.begin(), a.end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> p(n), ip(n);
rep(i, n) cin >> p[i];
ip = p;... | [] | 763,502 | 763,503 | u853721692 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; i++) {
cin >> p.at(i);
}
int s = 1;
int tmp = 0;
int t = 0;
for (int i = 0; i < n; i++) {
if (p.at(i) == i + 1) {
continue;
} else if (s == 1)... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; i++) {
cin >> p.at(i);
}
int s = 1;
int tmp = 0;
int t = 0;
for (int i = 0; i < n; i++) {
if (p.at(i) == i + 1) {
continue;
} else if (s == 1)... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,504 | 763,505 | u316226687 | cpp |
p02958 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <forward_list>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
#define rep(i, s, g) for ((i) = (s); (i) < ... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <forward_list>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
#define rep(i, s, g) for ((i) = (s); (i) < ... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,510 | 763,511 | u880221923 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, a, n) for (ll i = a; i < (ll)(n); i++)
#define memi cout << endl
#define kono(n) cout << fixed << setprecision(n)
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define hina... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, a, n) for (ll i = a; i < (ll)(n); i++)
#define memi cout << endl
#define kono(n) cout << fixed << setprecision(n)
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define hina... | [] | 763,515 | 763,516 | u917049698 | cpp |
p02958 | // author:luckYrat(twitter:@luckYrat_)
//#include <bits/stdc++.h>
// def
#include <iostream>
#include <algorithm>
#include <cmath>
#include <iomanip>
// array
#include <climits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
using namespace std;
using ll = long... | // author:luckYrat(twitter:@luckYrat_)
//#include <bits/stdc++.h>
// def
#include <iostream>
#include <algorithm>
#include <cmath>
#include <iomanip>
// array
#include <climits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
using namespace std;
using ll = long... | [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove"
] | 763,519 | 763,520 | u466161487 | cpp |
p02958 | #include <bits/stdc++.h>
//登録しよう！→ https://www.youtube.com/channel/UCRXsI3FL_kvaVL9zoolBfbQ
using namespace std;
using ll = long long;
ll gcd(ll a, ll b) {
return b ? gcd(b, a % b) : a;
} // a,bの最大公約数(gcd)を求める
ll lcm(ll a, ll b) {
return abs(a * b) / gcd(a, b);
} // a,bの最小公倍数(lcm)を求める
vector<ll> enum_div(ll n) {
... | #include <bits/stdc++.h>
//登録しよう！→ https://www.youtube.com/channel/UCRXsI3FL_kvaVL9zoolBfbQ
using namespace std;
using ll = long long;
ll gcd(ll a, ll b) {
return b ? gcd(b, a % b) : a;
} // a,bの最大公約数(gcd)を求める
ll lcm(ll a, ll b) {
return abs(a * b) / gcd(a, b);
} // a,bの最小公倍数(lcm)を求める
vector<ll> enum_div(ll n) {
... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"io.output.change"
] | 763,521 | 763,522 | u890807039 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define INF 99999999
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
template <typename T> std::string to_string(const T &n) {
std::ostringstream stm;
stm << n;
return stm.str();
}
int main() {
int N... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define INF 99999999
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
template <typename T> std::string to_string(const T &n) {
std::ostringstream stm;
stm << n;
return stm.str();
}
int main() {
int N... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,523 | 763,524 | u730271001 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(c, i, n) for (int i = c; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
const int MOD = 1000000007;
int main() {
int N;
cin >> N;
vector<int> p(N);
int count = 0;
rep(0, i, N) {
cin >> p.at(i);
if (p.at(i) != i + 1)... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(c, i, n) for (int i = c; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
const int MOD = 1000000007;
int main() {
int N;
cin >> N;
vector<int> p(N);
int count = 0;
rep(0, i, N) {
cin >> p.at(i);
if (p.at(i) != i + 1)... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,533 | 763,534 | u124659583 | cpp |
p02958 | #include <iomanip>
#include <iostream>
#include <math.h>
#include <string>
using namespace std;
void B_135() {
int N;
cin >> N;
int count = 0;
for (int i = 1; i <= N; ++i) {
int p;
cin >> p;
if (i != p)
++count;
if (count > 2) {
cout << "No" << endl;
return;
}
}
cout... | #include <iomanip>
#include <iostream>
#include <math.h>
#include <string>
using namespace std;
void B_135() {
int N;
cin >> N;
int count = 0;
for (int i = 1; i <= N; ++i) {
int p;
cin >> p;
if (i != p)
++count;
if (count > 2) {
cout << "NO" << endl;
return;
}
}
cout... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,535 | 763,536 | u323542775 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vt(N, 0);
int count = 0;
for (int i = 0; i < N; i++) {
cin >> vt[i];
if (vt[i] != (i + 1)) {
count++;
}
}
if (count <= 2) {
cout << "YES" << endl;
} else {
cout << "N0" << endl;
}
retur... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vt(N, 0);
int count = 0;
for (int i = 0; i < N; i++) {
cin >> vt[i];
if (vt[i] != (i + 1)) {
count++;
}
}
if (count <= 2) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
retur... | [
"literal.string.change",
"io.output.change"
] | 763,537 | 763,538 | u084218424 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vt(N, 0);
int count = 0;
for (int i = 0; i < N; i++) {
cin >> vt[i];
if (vt[i] != i + 1) {
count++;
}
}
if (count <= 2) {
cout << "YES" << endl;
} else {
cout << "N0" << endl;
}
return ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vt(N, 0);
int count = 0;
for (int i = 0; i < N; i++) {
cin >> vt[i];
if (vt[i] != (i + 1)) {
count++;
}
}
if (count <= 2) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
retur... | [
"control_flow.branch.if.condition.change",
"literal.string.change",
"io.output.change"
] | 763,539 | 763,538 | u084218424 | cpp |
p02958 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> num;
num.clear();
int p;
for (int i = 1; i <= N; i++) {
cin >> p;
if (p != i) {
num.push_back(i... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> num;
num.clear();
int p;
for (int i = 1; i <= N; i++) {
cin >> p;
if (p != i) {
num.push_back(i... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,549 | 763,550 | u605901675 | cpp |
p02958 | #include <algorithm>
#include <iostream>
#include <string.h>
#include <vector>
using namespace std;
int syc(long i, long Min, long Max) {
if (Min <= i && i <= Max) {
return 1;
} else {
exit(1);
// return 0;
}
}
int shoujun(int a[], int size) {
int i, j;
for (i = 0; i < size - 1; i++) {
for (... | #include <algorithm>
#include <iostream>
#include <string.h>
#include <vector>
using namespace std;
int syc(long i, long Min, long Max) {
if (Min <= i && i <= Max) {
return 1;
} else {
exit(1);
// return 0;
}
}
int shoujun(int a[], int size) {
int i, j;
for (i = 0; i < size - 1; i++) {
for (... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,551 | 763,552 | u198469037 | cpp |
p02958 | #include <algorithm>
#include <iostream>
#include <string.h>
#include <vector>
using namespace std;
int syc(long i, long Min, long Max) {
if (Min <= i && i <= Max) {
return 1;
} else {
exit(1);
// return 0;
}
}
int shoujun(int a[], int size) {
int i, j;
for (i = 0; i < size - 1; i++) {
for (... | #include <algorithm>
#include <iostream>
#include <string.h>
#include <vector>
using namespace std;
int syc(long i, long Min, long Max) {
if (Min <= i && i <= Max) {
return 1;
} else {
exit(1);
// return 0;
}
}
int shoujun(int a[], int size) {
int i, j;
for (i = 0; i < size - 1; i++) {
for (... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,553 | 763,552 | u198469037 | cpp |
p02958 | #include <iostream>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
int cnt = 0;
for (int i = 1; i <= n; i++) {
int a;
cin >> a;
if (a != i)
cnt++;
}
if (cnt == 0 || cnt == 2)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
int cnt = 0;
for (int i = 1; i <= n; i++) {
int a;
cin >> a;
if (a != i)
cnt++;
}
if (cnt == 0 || cnt == 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,562 | 763,563 | u993074316 | 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);
///入力
bool Ans = false; ///回答の初期値入力"No"の状態
vector<int> q(N);
for (int i = 0; i < N; i++) {
q.at(i) += i + 1;
}
int count = 0; ///相違の数を取得する値
for ... | #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);
///入力
bool Ans = false; ///回答の初期値入力"No"の状態
vector<int> q(N);
for (int i = 0; i < N; i++) {
q.at(i) += i + 1;
}
int count = 0; ///相違の数を取得する値
for ... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,564 | 763,565 | u028906014 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, p, x = 0;
cin >> N;
for (int i = 1; i <= N; i++) {
cin >> p;
if (p == i)
x++;
}
if (x < 3)
cout << "YES" << endl;
else
cout << "NO" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, p, x = 0;
cin >> N;
for (int i = 1; i <= N; i++) {
cin >> p;
if (p != i)
x++;
}
if (x < 3)
cout << "YES" << endl;
else
cout << "NO" << endl;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 763,568 | 763,569 | u820224016 | cpp |
p02958 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
using namespace std;
int main() {
int n, sum;
scanf("%d", &n);
vector<int> p(n), q(n);
rep(i, n) scanf("%d", &p[i]);
q = p;
sort(all(q));
rep(i, n) if (p[i] != q[i]) sum++;
sum == 2 || sum ==... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
using namespace std;
int main() {
int n, sum = 0;
scanf("%d", &n);
vector<int> p(n), q(n);
rep(i, n) scanf("%d", &p[i]);
q = p;
sort(all(q));
rep(i, n) if (p[i] != q[i]) sum++;
sum == 2 || su... | [
"variable_declaration.value.change"
] | 763,570 | 763,571 | u018372223 | cpp |
p02958 | #include "bits/stdc++.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<P, ll> Pll;
typedef pair<P, P> PP;
#define rep(i, a, n) for (ll i = a; i < n; i++)
#define repr(i, a, n) for (ll i = n - 1; i >= a; i--)
#define LINF (ll)1e17
#define INF (int)1e9
#define MO... | #include "bits/stdc++.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<P, ll> Pll;
typedef pair<P, P> PP;
#define rep(i, a, n) for (ll i = a; i < n; i++)
#define repr(i, a, n) for (ll i = n - 1; i >= a; i--)
#define LINF (ll)1e17
#define INF (int)1e9
#define MO... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 763,575 | 763,576 | u129134470 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
vector<int> A(a);
for (int i = 0; i < a; i++) {
cin >> A.at(i);
if (A.at(i) = i + 1)
A.at(i) = 0;
else
A.at(i) = 1;
}
int count = 0;
for (int i = 0; i < a; i++)
count += A.at(i);
if (count == 0 || count == 2)
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
cin >> a;
vector<int> A(a);
for (int i = 0; i < a; i++) {
cin >> A.at(i);
if (A.at(i) == i + 1)
A.at(i) = 0;
else
A.at(i) = 1;
}
int count = 0;
for (int i = 0; i < a; i++)
count += A.at(i);
if (count == 0 || co... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 763,587 | 763,588 | u613960672 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int cnt = 0;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; i++) {
cin >> p.at(i);
}
for (int i = 0; i < n; i++) {
if (p.at(i) != i + 1)
cnt++;
}
if (cnt == 0 || cnt == 2) {
cout << "Yes" << endl;
} else {
c... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int cnt = 0;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; i++) {
cin >> p.at(i);
}
for (int i = 0; i < n; i++) {
if (p.at(i) != i + 1)
cnt++;
}
if (cnt == 0 || cnt == 2) {
cout << "YES" << endl;
} else {
c... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,591 | 763,592 | u503841284 | cpp |
p02958 | // 解けてない
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> p(N);
vector<int> sortP(N);
for (int i = 0; i < N; i++) {
cin >> p.at(i);
}
sortP = p;
sort(sortP.begin(), sortP.end());
int invalidCount = 0;
for (int i = 0; i < N; i++) {
if (p.at(i) != ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> p(N);
vector<int> sortP(N);
for (int i = 0; i < N; i++) {
cin >> p.at(i);
}
sortP = p;
sort(sortP.begin(), sortP.end());
int invalidCount = 0;
for (int i = 0; i < N; i++) {
if (p.at(i) != sortP.at(... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,593 | 763,594 | u455876837 | cpp |
p02958 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
cin.tie(0);
int n, c = 0;
cin >> n;
... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
cin.tie(0);
int n, c = 0;
cin >> n;
... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,597 | 763,598 | u388372553 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N = 110;
int n, a[N];
bool check() {
bool flag = true;
for (int i = 0; i < n - 1; i++)
if (a[i] > a[i + 1])
return false;
return true;
}
int main() {
int cnt = 0;
cin >> n;
for (int i = 0; i < n; i++)
cin >> a... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N = 110;
int n, a[N];
bool check() {
bool flag = true;
for (int i = 0; i < n - 1; i++)
if (a[i] > a[i + 1])
return false;
return true;
}
int main() {
int cnt = 0;
cin >> n;
for (int i = 0; i < n; i++)
cin >> a... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 763,603 | 763,604 | u866538547 | cpp |
p02958 | #include <bits/stdc++.h>
#define ford(i, a, b) for (int i = (a); i >= b; i--)
#define rep(i, a, b) for (int i = (a); (i) < (b); (i)++)
#define ll long long
using namespace std;
int a[55];
int main() {
int n, ans = 0;
cin >> n;
rep(i, 0, n) cin >> a[i];
rep(i, 0, n) if (a[i] != i) ans++;
if (ans == 2 || ans ==... | #include <bits/stdc++.h>
#define ford(i, a, b) for (int i = (a); i >= b; i--)
#define rep(i, a, b) for (int i = (a); (i) <= (b); (i)++)
#define ll long long
using namespace std;
int a[55];
int main() {
int n, ans = 0;
cin >> n;
rep(i, 1, n) cin >> a[i];
rep(i, 1, n) if (a[i] != i) ans++;
if (ans == 2 || ans =... | [
"expression.operator.compare.change",
"preprocessor.define.value.change",
"literal.number.change",
"call.arguments.change"
] | 763,616 | 763,617 | u796123030 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n, m;
cin >> n;
ll c = 0;
for (int i = 1; i <= n; i++) {
cin >> m;
if (m != i) {
c++;
}
}
if (c == 2 || c == 0) {
cout << "YES" << endl;
} else {
cout << "No" << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n, m;
cin >> n;
ll c = 0;
for (int i = 1; i <= n; i++) {
cin >> m;
if (m != i) {
c++;
}
}
if (c == 2 || c == 0) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,618 | 763,619 | u178957871 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n, m;
cin >> n;
ll c = 0;
for (int i = 1; i <= n; i++) {
cin >> m;
if (m == i) {
} else {
c++;
}
}
if (c == 2 || c == 0) {
cout << "YES" << endl;
} else {
cout << "No" << endl;
}
return ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n, m;
cin >> n;
ll c = 0;
for (int i = 1; i <= n; i++) {
cin >> m;
if (m != i) {
c++;
}
}
if (c == 2 || c == 0) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 763,620 | 763,619 | u178957871 | 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> C(N);
int count;
for (int i = 0; i < N; i++) {
if (P.at(0) != i + 1) {
count++;
}
}
if (count == 2 || count == 0) {
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.at(i);
}
vector<int> C(N);
int count = 0;
for (int i = 0; i < N; i++) {
if (P.at(i) != i + 1) {
count++;
}
}
if (count == 2 || count == 0) {
cou... | [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 763,630 | 763,631 | u428948252 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.