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 |
|---|---|---|---|---|---|---|---|
p03680 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, s = 0;
cin >> n;
vector<int> vec(n);
bool b = true;
for (int i = 0; i < n; i++)
cin >> vec.at(i);
int x = 0;
for (int j = 0; j < n; j++) {
if (vec.at(x) == 2) {
s++;
cout << s << endl;
s = -1;
} else {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, s = 0;
cin >> n;
vector<int> vec(n);
bool b = true;
for (int i = 0; i < n; i++)
cin >> vec.at(i);
int x = 0;
for (int j = 0; j < n; j++) {
if (vec.at(x) == 2) {
s++;
cout << s << endl;
s = -1;
break;
... | [
"control_flow.break.add"
] | 1,356,074 | 1,356,075 | u533006396 | cpp |
p03680 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define reps(i, n) for (int i = 1, i##_len = (n); i <= i##_len; ++i)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; --i)
#define rreps(i, n) for (int i = ((int)(n)); i > 0; --i)
#define ALL(x) (x).begin(), (x).end()
#defi... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define reps(i, n) for (int i = 1, i##_len = (n); i <= i##_len; ++i)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; --i)
#define rreps(i, n) for (int i = ((int)(n)); i > 0; --i)
#define ALL(x) (x).begin(), (x).end()
#defi... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change",
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 1,356,084 | 1,356,085 | u272025855 | cpp |
p03680 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define reps(i, n) for (int i = 1, i##_len = (n); i <= i##_len; ++i)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; --i)
#define rreps(i, n) for (int i = ((int)(n)); i > 0; --i)
#define ALL(x) (x).begin(), (x).end()
#defi... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define reps(i, n) for (int i = 1, i##_len = (n); i <= i##_len; ++i)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; --i)
#define rreps(i, n) for (int i = ((int)(n)); i > 0; --i)
#define ALL(x) (x).begin(), (x).end()
#defi... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 1,356,084 | 1,356,086 | u272025855 | cpp |
p03680 | #include <iostream>
using namespace std;
int main(void) {
int N;
cin >> N;
int a[N];
bool b[N];
for (int i = 0; i < N; i++) {
cin >> a[i];
b[N] = true;
}
int n = 1, count = 0;
while (n != 2) {
n = a[n - 1];
if (b[n - 1]) {
b[n - 1] = false;
} else {
n = -1;
br... | #include <iostream>
using namespace std;
int main(void) {
int N;
cin >> N;
int a[N];
bool b[N];
for (int i = 0; i < N; i++) {
cin >> a[i];
b[i] = true;
}
int n = 1, count = 0;
while (n != 2) {
n = a[n - 1];
if (b[n - 1]) {
b[n - 1] = false;
} else {
n = -1;
br... | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 1,356,089 | 1,356,090 | u303563078 | cpp |
p03680 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
int a;
cin >> a;
vec.at(i) = a;
}
int j = 1;
int s = 0;
while (j == 2) {
j = vec.at(j - 1);
s++;
if (j == 2) {
cout << s << endl;
break;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
int a;
cin >> a;
vec.at(i) = a;
}
int j = 1;
int s = 0;
while (j != 2) {
j = vec.at(j - 1);
s++;
if (j == 2) {
cout << s << endl;
break;
... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 1,356,101 | 1,356,102 | u708911918 | cpp |
p03680 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, cou = 1, n, num = 1;
vector<int> vec;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a;
vec.push_back(a);
}
for (int j = 0; j < 2 * n; j++) {
num = vec[num - 1];
cou++;
if (num == 2) {
cout << cou << endl;
ret... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, cou = 0, n, num = 1;
vector<int> vec;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a;
vec.push_back(a);
}
for (int j = 0; j < 2 * n; j++) {
num = vec[num - 1];
cou++;
if (num == 2) {
cout << cou << endl;
ret... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,356,103 | 1,356,104 | u406060664 | cpp |
p03680 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, cou = 1, n, num = 1;
vector<int> vec;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a;
vec.push_back(a);
}
for (int j = 0; j < 2 * n; j++) {
num = vec[num - 1];
cou++;
if (vec[num - 1] == 2) {
cout << cou << endl;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, cou = 0, n, num = 1;
vector<int> vec;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a;
vec.push_back(a);
}
for (int j = 0; j < 2 * n; j++) {
num = vec[num - 1];
cou++;
if (num == 2) {
cout << cou << endl;
ret... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.condition.change"
] | 1,356,105 | 1,356,104 | u406060664 | cpp |
p03680 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <random>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
f... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <random>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
f... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.branch.if.condition.change"
] | 1,356,106 | 1,356,107 | u654115954 | cpp |
p03680 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, c = 1;
bool b = false;
cin >> N;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
int p = vec.at(0);
if (p == 2) {
cout << 1;
} else {
for (int i = 0; i < N - 1; i++) {
p = vec.at(p);
c++;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, c = 1;
bool b = false;
cin >> N;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
int p = vec.at(0);
if (p == 2) {
cout << 1;
} else {
for (int i = 0; i < N - 1; i++) {
p = vec.at(p - 1);
c+... | [
"assignment.change"
] | 1,356,112 | 1,356,113 | u386712304 | cpp |
p03680 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
bool can = false;
cin >> n;
int a[n + 1];
for (int i = 1; i <= n; i++)
cin >> a[i];
int j = 1, k = 0;
while (k <= n) {
if (j == 2) {
can = true;
break;
}
j = a[a[j]];
k++;
}
if (can)
cout << k << end... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
bool can = false;
cin >> n;
int a[n + 1];
for (int i = 1; i <= n; i++)
cin >> a[i];
int j = 1, k = 0;
while (k <= n) {
if (j == 2) {
can = true;
break;
}
j = a[j];
k++;
}
if (can)
cout << k << endl;
... | [] | 1,356,114 | 1,356,115 | u907518238 | cpp |
p03680 | #include <iostream>
using namespace std;
int main() {
int N, a[100001], b[100001];
int pos = 1, count = 0;
cin >> N;
for (int i = 1; i < N; ++i) {
cin >> a[i];
b[i] = 0;
}
while (pos != 2) {
count++;
b[pos] = 1;
pos = a[pos];
if (b[pos] == 1) {
count = -1;
break;
}... | #include <iostream>
using namespace std;
int main() {
int N, a[100001];
int b[100001]; // b[i]=1 : button i was ON.
int pos = 1, count = 0;
cin >> N;
for (int i = 1; i <= N; ++i) {
cin >> a[i];
b[i] = 0;
}
while (pos != 2) {
count++;
b[pos] = 1;
pos = a[pos];
if (b[pos] == 1) {
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,356,124 | 1,356,125 | u205975249 | cpp |
p03680 | #include <bits/stdc++.h>
#define REP(i, n) for (ll i = 0; i < (ll)n; i++)
#define FOR(i, a, b) for (ll i = (a); i < (ll)b; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1000000000000000
using namespace std;
typedef long long ll;
typedef double db;
typedef string str;
typedef pair<ll, ll> p;
constexpr int... | #include <bits/stdc++.h>
#define REP(i, n) for (ll i = 0; i < (ll)n; i++)
#define FOR(i, a, b) for (ll i = (a); i < (ll)b; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1000000000000000
using namespace std;
typedef long long ll;
typedef double db;
typedef string str;
typedef pair<ll, ll> p;
constexpr int... | [] | 1,356,128 | 1,356,129 | u824337972 | cpp |
p03680 | #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 = 1;
for (int i = 0; i < N; i++) {
count == A.at(count - 1);
if (count == 2) {
cout << i + 1 << endl;
break;
}
}
i... | #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 = 1;
for (int i = 0; i < N; i++) {
count = A.at(count - 1);
if (count == 2) {
cout << i + 1 << endl;
break;
}
}
if... | [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 1,356,132 | 1,356,133 | u530329977 | cpp |
p03680 | #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 = 1;
for (int i = 0; i < N; i++) {
count == A.at(count - 1);
if (count == 2) {
cout << count - 1 << endl;
break;
}
}... | #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 = 1;
for (int i = 0; i < N; i++) {
count = A.at(count - 1);
if (count == 2) {
cout << i + 1 << endl;
break;
}
}
if... | [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 1,356,134 | 1,356,133 | u530329977 | cpp |
p03680 | #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 j = 0;
int b = 1;
for (int i = 0; i < N + 1; i++) {
if (b == 2) {
break;
}
b = a[b - 1];
j++;
}
int c;
if (b <= N)
c = j;
else
... | #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 j = 0;
int b = 1;
for (int i = 0; i < N + 1; i++) {
if (b == 2) {
break;
}
b = a[b - 1];
j++;
}
int c;
if (j <= N)
c = j;
else
... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 1,356,174 | 1,356,175 | u357265888 | cpp |
p03680 | #include <iostream>
#include <math.h>
#include <set>
#include <string>
using namespace std;
int main(int argc, const char *argv[]) {
int a[10010];
int N;
int res = 0;
int nextNum;
set<int> bottuns;
cin >> N;
for (int i = 0; i < N; ++i) {
cin >> a[i];
}
nextNum = 1;
bottuns.insert(nextNum);
... | #include <iostream>
#include <math.h>
#include <set>
#include <string>
using namespace std;
int main(int argc, const char *argv[]) {
int a[100000];
int N;
int res = 0;
int nextNum;
set<int> bottuns;
cin >> N;
for (int i = 1; i <= N; ++i) {
cin >> a[i];
}
nextNum = 1;
bottuns.insert(nextNum);... | [
"literal.number.change",
"variable_declaration.array_dimensions.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"
] | 1,356,178 | 1,356,179 | u285492845 | cpp |
p03680 | #include <iostream>
using namespace std;
int f[110000], n;
void dfs(int lig, int tim) {
if (tim == n - 1) {
cout << -1 << endl;
return;
} else if (lig == 2) {
cout << tim;
return;
} else {
dfs(f[lig], tim + 1);
}
}
int main(void) {
// Your code here!
cin >> n;
for (int i = 1; i <= n; i... | #include <iostream>
using namespace std;
int f[110000], n;
void dfs(int lig, int tim) {
if (tim == n) {
cout << -1 << endl;
return;
} else if (lig == 2) {
cout << tim;
return;
} else {
dfs(f[lig], tim + 1);
}
}
int main(void) {
// Your code here!
cin >> n;
for (int i = 1; i <= n; i++) ... | [
"expression.operation.binary.remove"
] | 1,356,209 | 1,356,210 | u475007080 | cpp |
p03680 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(N);
}
int next = 1;
int count = 0;
while (next != 2) {
next = vec.at(next - 1);
count++;
if (count > N) {
cout << "-1" << endl;
return... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
int next = 1;
int count = 0;
while (next != 2) {
next = vec.at(next - 1);
count++;
if (count > N) {
cout << "-1" << endl;
return... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,356,215 | 1,356,216 | u550995059 | cpp |
p03680 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(N);
}
int next = 1;
int count = 0;
while (next == !2) {
next = vec.at(next - 1);
count++;
if (count > N) {
cout << "-1" << endl;
retur... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
int next = 1;
int count = 0;
while (next != 2) {
next = vec.at(next - 1);
count++;
if (count > N) {
cout << "-1" << endl;
return... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.loop.condition.change",
"expression.operation.unary.logical.remove"
] | 1,356,217 | 1,356,216 | u550995059 | cpp |
p03680 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <set>
#include <vector>
using namespace std;
int main() {
int N, count = 0, num = 0;
cin >> N;
vector<int> vc(N);
for (int i = 0; i < N; i++)
cin >> vc[i];
for (int i = 0;; i++) {
if (num == 2)
break;
num = ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <set>
#include <vector>
using namespace std;
int main() {
int N, count = 0, num = 0;
cin >> N;
vector<int> vc(N);
for (int i = 0; i < N; i++)
cin >> vc[i];
for (int i = 0;; i++) {
if (num == 1)
break;
num = ... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 1,356,233 | 1,356,234 | u855186748 | cpp |
p03680 | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int *a = new int[N];
for (int i = 0; i < N; i++) {
cin >> a[i];
}
int j = 1;
for (int i = 1; i <= N; i++) {
j = a[j];
if (j == 2) {
cout << i << endl;
return 0;
}
}
cout << -1 << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int *a = new int[N];
for (int i = 0; i < N; i++) {
cin >> a[i];
}
int j = 1;
for (int i = 1; i <= N; i++) {
j = a[j - 1];
if (j == 2) {
cout << i << endl;
return 0;
}
}
cout << -1 << endl;
return 0;
}... | [
"assignment.change"
] | 1,356,242 | 1,356,243 | u562016607 | cpp |
p03680 |
#include <algorithm>
#include <iostream>
#include <queue>
#include <string.h>
#include <vector>
using namespace std;
typedef long long ll;
const ll INF = 100000000000000LL;
int main() {
int n, a[100001];
cin >> n;
for (int i = 1; i <= n; ++i) {
cin >> a[i];
}
bool b[101];
int k = 1, s = 0;
bool h;
... |
#include <algorithm>
#include <iostream>
#include <queue>
#include <string.h>
#include <vector>
using namespace std;
typedef long long ll;
const ll INF = 100000000000000LL;
int main() {
int n, a[100001];
cin >> n;
for (int i = 1; i <= n; ++i) {
cin >> a[i];
}
bool b[100001];
int k = 1, s = 0;
bool ... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"variable_declaration.value.change"
] | 1,356,246 | 1,356,247 | u770256251 | cpp |
p03680 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
#define ll long long
#define INF (1 << 30)
#define INFLL (1LL << 60)
#define FOR(... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
#define ll long long
#define INF (1 << 30)
#define INFLL (1LL << 60)
#define FOR(... | [
"control_flow.break.add"
] | 1,356,248 | 1,356,249 | u486104022 | cpp |
p03680 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N, count = 0, ai;
bool fin = false;
vector<int> button;
cin >> N;
vector<bool> check(N, false);
for (int i = 0; i < N; i++) {
cin >> ai;
button.push_back(ai - 1);
}
for (int i = 0; !check[i]; i = button[i]) {
check[i] = true... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N, count = 0, ai;
bool fin = false;
vector<int> button;
cin >> N;
vector<bool> check(N, false);
for (int i = 0; i < N; i++) {
cin >> ai;
button.push_back(ai - 1);
}
for (int i = 0; !check[i]; i = button[i]) {
check[i] = true... | [
"control_flow.return.remove",
"control_flow.break.add"
] | 1,356,252 | 1,356,253 | u417936336 | cpp |
p03680 | #include <bits/stdc++.h>
#define r(i, n) for (int i = 0; i < n; i++)
using namespace std;
bool used[100001];
int main() {
int n, t = 0;
cin >> n;
int a[n];
r(i, n) cin >> a[i];
used[a[0]] = 1;
t++;
int p = a[0] - 1;
if (p == 1) {
cout << 1 << endl;
return 0;
}
while (1) {
if (used[a[p]])... | #include <bits/stdc++.h>
#define r(i, n) for (int i = 0; i < n; i++)
using namespace std;
bool used[100001];
int main() {
int n, t = 0;
cin >> n;
int a[n];
r(i, n) cin >> a[i];
used[a[0] - 1] = 1;
t++;
int p = a[0] - 1;
if (p == 1) {
cout << 1 << endl;
return 0;
}
while (1) {
if (used[a[... | [
"assignment.change",
"control_flow.branch.if.condition.change"
] | 1,356,256 | 1,356,255 | u777468981 | cpp |
p03680 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[100010];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int now = 0;
bool def = false;
for (int i = 1; i < n; i++) {
now = a[now];
if (now == 2) {
def = true;
break;
}
now--;
}
if (def) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[100010];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int now = 0;
bool def = false;
int i;
for (i = 1; i <= n; i++) {
now = a[now];
if (now == 2) {
def = true;
break;
}
now--;
}
if (d... | [
"variable_declaration.add",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"identifier.change",
"io.output.change"
] | 1,356,257 | 1,356,258 | u560670090 | cpp |
p03680 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, ans, now = -1;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
}
for (int i = 1; i <= n; i++) {
now = a.at(now - 1);
if (now == 2) {
ans = i;
break;
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, ans = -1, now = 1;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
}
for (int i = 1; i <= n; i++) {
now = a.at(now - 1);
if (now == 2) {
ans = i;
break;
}
}
cout << ans << endl;
}
| [
"variable_declaration.remove",
"variable_declaration.add"
] | 1,356,270 | 1,356,271 | u952865396 | cpp |
p03680 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, r = 1;
cin >> n;
vector<int> a(n + 1);
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = 1; i < n; i++) {
r = a[r];
if (r == 2) {
cout << r << endl;
break;
}
if (i == n - 1) {
cout << -1 << endl;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, r = 1;
cin >> n;
vector<int> a(n + 1);
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = 1; i < n; i++) {
r = a[r];
if (r == 2) {
cout << i << endl;
break;
}
if (i == n - 1) {
cout << -1 << endl;
... | [
"identifier.change",
"io.output.change"
] | 1,356,272 | 1,356,273 | u930561195 | cpp |
p03680 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> a;
for (int i = 0; i < N; i++) {
int temp;
scanf("%d", &temp);
temp--;
a.push_back(temp);
}
int now = 0;
for (int i = 0; i < N; i++) {
if (now == 1) {
cout << i + 1;
return 0;
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> a;
for (int i = 0; i < N; i++) {
int temp;
scanf("%d", &temp);
temp--;
a.push_back(temp);
}
int now = 0;
for (int i = 0; i < N; i++) {
if (now == 1) {
cout << i;
return 0;
}
now... | [
"expression.operation.binary.remove"
] | 1,356,276 | 1,356,277 | u653388379 | cpp |
p03680 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int N;
cin >> N;
int a[N];
rep(i, N) { cin >> a[i]; }
int n = a[0];
if (n == 2) {
cout << 0 << endl;
return 0;
}
rep(i, N) {
n = a[n - 1];
if (n == 2) {
c... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int N;
cin >> N;
int a[N];
rep(i, N) { cin >> a[i]; }
int n = a[0];
if (n == 2) {
cout << 1 << endl;
return 0;
}
rep(i, N) {
n = a[n - 1];
if (n == 2) {
c... | [
"literal.number.change",
"io.output.change"
] | 1,356,278 | 1,356,279 | u263654061 | cpp |
p03680 | #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 now = 0, c = 0;
for (;;) {
if (now == 2) {
cout << c << endl;
break;
}
if (c >= N) {
cout << -1 << endl;
break;
... | #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 now = 1, c = 0;
for (;;) {
if (now == 2) {
cout << c << endl;
break;
}
if (c >= N) {
cout << -1 << endl;
break;
... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,356,300 | 1,356,301 | u016424838 | cpp |
p03680 | using namespace std;
#include <bits/stdc++.h>
#define rep(i, s) for (int i = 0; i < s; ++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 all(v) (v.begin(), v.end())
#define EACH(i, s) \
for (__typeo... | using namespace std;
#include <bits/stdc++.h>
#define rep(i, s) for (int i = 0; i < s; ++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 all(v) (v.begin(), v.end())
#define EACH(i, s) \
for (__typeo... | [
"assignment.change",
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 1,356,315 | 1,356,316 | u535810324 | cpp |
p03680 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, count;
cin >> N;
count = 0;
int B = 1;
vector<int> A(N);
for (int i = 0; i <= N; i++) {
cin >> A.at(i);
}
for (int i = 0; i <= N; i++) {
if (B == 2) {
cout << count << endl;
break;
}
B = A.at(B - 1);
coun... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, count;
cin >> N;
count = 0;
int B = 1;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
for (int i = 0; i <= N; i++) {
if (B == 2) {
cout << count << endl;
break;
}
B = A.at(B - 1);
count... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,356,321 | 1,356,322 | u322177979 | cpp |
p03680 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, count;
cin >> N;
count = 0;
int B = 1;
vector<int> A(N);
for (int i = 0; i <= N; i++) {
cin >> A.at(i);
}
for (int i = 0; i < N; i++) {
if (B == 2) {
cout << count << endl;
break;
}
B = A.at(B - 1);
count... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, count;
cin >> N;
count = 0;
int B = 1;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
for (int i = 0; i <= N; i++) {
if (B == 2) {
cout << count << endl;
break;
}
B = A.at(B - 1);
count... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,356,323 | 1,356,322 | u322177979 | cpp |
p03680 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, count;
cin >> N;
count = 0;
int B = 1;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
for (int i = 0; i < 10000000; i++) {
if (B = 2) {
cout << count << endl;
break;
}
B = A.at(B - 1);
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, count;
cin >> N;
count = 0;
int B = 1;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
for (int i = 0; i <= N; i++) {
if (B == 2) {
cout << count << endl;
break;
}
B = A.at(B - 1);
count... | [
"control_flow.loop.for.condition.change",
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo",
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 1,356,324 | 1,356,322 | u322177979 | cpp |
p03680 | #include <iostream>
using namespace std;
int main() {
int N;
int a[110000] = {0};
bool flag = false;
int cnt = -1;
int pos = 1;
cin >> N;
for (int i = 1; i <= N; i++)
cin >> a[i];
for (int i = 1; i <= N; i++) {
pos = a[pos];
if (pos == 2) {
flag = true;
cnt = i;
}
}
c... | #include <iostream>
using namespace std;
int main() {
int N;
int a[110000] = {0};
bool flag = false;
int cnt = -1;
int pos = 1;
cin >> N;
for (int i = 1; i <= N; i++)
cin >> a[i];
for (int i = 1; i <= N; i++) {
pos = a[pos];
if (pos == 2) {
flag = true;
cnt = i;
break;
... | [
"control_flow.break.add"
] | 1,356,327 | 1,356,328 | u230066794 | cpp |
p03680 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
bool A = false;
int B = 0;
int answer;
for (int j = 0; j < N; j++) {
B = vec.at(B);
if (N == 1) {
A = true;
answer = j... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
bool A = false;
int B = 1;
int answer;
for (int j = 0; j < N; j++) {
B = vec.at(B - 1);
if (B == 2) {
A = true;
answer... | [
"literal.number.change",
"variable_declaration.value.change",
"assignment.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 1,356,331 | 1,356,332 | u322714721 | cpp |
p03680 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> s(n);
for (int i = 0; i < n; i++) {
cin >> s[i];
}
int ans = 0;
int first = 0;
for (int i = 0; i < n; i++) {
if (s[first] == 2) {
ans++;
break;
} else if (s[first] != 2) {
first = s[firs... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> s(n);
for (int i = 0; i < n; i++) {
cin >> s[i];
}
int ans = 0;
int first = 0;
for (int i = 0; i < n; i++) {
if (s[first] == 2) {
ans++;
break;
} else if (i < n - 1 && s[first] != 2) {
f... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 1,356,335 | 1,356,336 | u885523920 | cpp |
p03680 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, sh = 1, cnt = 0, flag = 0;
vector<int> a(100000);
cin >> n;
for (int i = 0; i < n; i++)
cin >> a.at(i);
for (int i = 0; i < n; i++) {
sh = a.at(sh);
cnt++;
if (sh == 2 && flag == 0) {
cout << cnt << endl;
flag = 1;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, sh = 1, cnt = 0, flag = 0;
vector<int> a(100010);
cin >> n;
for (int i = 0; i < n; i++)
cin >> a.at(i);
for (int i = 0; i < n; i++) {
sh = a.at(sh - 1);
cnt++;
if (sh == 2 && flag == 0) {
cout << cnt << endl;
flag =... | [
"literal.number.change",
"call.arguments.change",
"assignment.change"
] | 1,356,337 | 1,356,338 | u172873334 | cpp |
p03680 | #include <bits/stdc++.h>
using namespace std;
int main() {
int i, j, t, x, N;
t = 0;
x = 0;
j = 1;
cin >> N;
vector<int> a(N);
for (i = 0; i < N; i++) {
cin >> a.at(i);
}
for (i = 0; i < N; i++) {
j = a.at(j - 1);
t++;
if (j == 2) {
x++;
break;
}
}
if (x == 0) {... | #include <bits/stdc++.h>
using namespace std;
int main() {
int i, j, t, x, N;
t = 0;
x = 0;
j = 1;
cin >> N;
vector<int> a(N);
for (i = 0; i < N; i++) {
cin >> a.at(i);
}
for (i = 0; i < N; i++) {
j = a.at(j - 1);
t++;
if (j == 2) {
x++;
break;
}
}
if (x == 0) {... | [
"io.output.change"
] | 1,356,341 | 1,356,342 | u715253965 | cpp |
p03680 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> x(N);
for (int i = 1; i <= N; i++) {
cin >> x[i];
}
int b = 1, ans = 1, v;
while (x[b] != 2) {
if (x[b] = 1) {
ans = -1;
break;
} else {
v = b;
ans++;
b = x[b];
x[v] = 1... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> x(N);
for (int i = 1; i <= N; i++) {
cin >> x[i];
}
int b = 1, ans = 1, v;
while (x[b] != 2) {
if (x[b] == 1) {
ans = -1;
break;
} else {
v = b;
ans++;
b = x[b];
x[v] = ... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 1,356,343 | 1,356,344 | u990305162 | cpp |
p03680 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> x(N);
for (int i = 1; i <= N; i++) {
cin >> x[i];
}
int b = 1, ans = 0, v;
while (x[b] != 2) {
if (x[b] = 1) {
ans = -1;
break;
} else {
v = b;
ans++;
b = x[b];
x[v] = 1... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> x(N);
for (int i = 1; i <= N; i++) {
cin >> x[i];
}
int b = 1, ans = 1, v;
while (x[b] != 2) {
if (x[b] == 1) {
ans = -1;
break;
} else {
v = b;
ans++;
b = x[b];
x[v] = ... | [
"literal.number.change",
"variable_declaration.value.change",
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 1,356,345 | 1,356,344 | u990305162 | cpp |
p03680 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define ll long long
int main() {
int n;
cin >> n;
int a[n];
REP(i, n) { cin >> a[i]; }
int hantei... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define ll long long
int main() {
int n;
cin >> n;
int a[n];
REP(i, n) { cin >> a[i]; }
int hantei... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 1,356,352 | 1,356,353 | u127768253 | cpp |
p03680 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define ll long long
int main() {
int n;
cin >> n;
int a[n];
REP(i, n) { cin >> a[i]; }
int hantei... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define ll long long
int main() {
int n;
cin >> n;
int a[n];
REP(i, n) { cin >> a[i]; }
int hantei... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 1,356,354 | 1,356,353 | u127768253 | cpp |
p03680 | #include <bits/stdc++.h>
using namespace std;
signed main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; ++i) {
cin >> A[i];
A[i]--;
}
int cur = 0;
int ans = -1;
vector<bool> vis(N, false);
bool ok = false;
while (!vis[cur]) {
vis[cur] = true;
cur = A[cur];
ans++... | #include <bits/stdc++.h>
using namespace std;
signed main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; ++i) {
cin >> A[i];
A[i]--;
}
int cur = 0;
int ans = 0;
vector<bool> vis(N, false);
bool ok = false;
while (!vis[cur]) {
vis[cur] = true;
cur = A[cur];
ans++;... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,356,357 | 1,356,358 | u133129810 | cpp |
p03680 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> botton(N);
int i;
int next;
for (i = 0; i < N; i++) {
cin >> next;
botton.at(i) = next - 1;
}
int hop;
int light;
hop = 0;
light = 0;
for (i = 0; i < N; i++) {
if (botton.at(light) == 0) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> botton(N);
int i;
int next;
for (i = 0; i < N; i++) {
cin >> next;
botton.at(i) = next - 1;
}
int hop;
int light;
hop = 0;
light = 0;
for (i = 0; i < N; i++) {
if (botton.at(light) == 0) {
... | [
"assignment.variable.change",
"identifier.change",
"assignment.add"
] | 1,356,359 | 1,356,360 | u962164623 | cpp |
p03680 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int x = 0;
int k = 1;
vector<int> a(N);
for (int i = 0; i < N; i++) {
cin >> a[i];
}
for (int j = 0; j < 1000000; j++) {
k = a[k];
x++;
if (k == 2) {
cout << x << endl;
break;
} else if (j == N -... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int x = 0;
int k = 1;
vector<int> a(N);
for (int i = 0; i < N; i++) {
cin >> a[i];
}
for (int j = 0; j < N; j++) {
k = a[k - 1];
x++;
if (k == 2) {
cout << x << endl;
break;
} else if (j == N - 1... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"assignment.change"
] | 1,356,362 | 1,356,363 | u422506696 | cpp |
p03680 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int x = 0;
int k = 1;
vector<int> a(N);
for (int i = 0; i < N; i++) {
cin >> a[i];
}
for (int j = 0; j < N; j++) {
k = a[k];
x++;
if (k == 2) {
cout << x << endl;
break;
} else if (j == (N - 1)) ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int x = 0;
int k = 1;
vector<int> a(N);
for (int i = 0; i < N; i++) {
cin >> a[i];
}
for (int j = 0; j < N; j++) {
k = a[k - 1];
x++;
if (k == 2) {
cout << x << endl;
break;
} else if (j == N - 1... | [
"assignment.change",
"control_flow.branch.if.condition.change"
] | 1,356,364 | 1,356,363 | u422506696 | cpp |
p03680 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int x = 0;
int k = 1;
vector<int> a(N);
for (int i = 0; i < N; i++) {
cin >> a[i];
}
for (int j = 0; j < N; j++) {
k = a[k];
x++;
if (k == 2) {
cout << x << endl;
break;
} else if (j == N - 1) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int x = 0;
int k = 1;
vector<int> a(N);
for (int i = 0; i < N; i++) {
cin >> a[i];
}
for (int j = 0; j < N; j++) {
k = a[k - 1];
x++;
if (k == 2) {
cout << x << endl;
break;
} else if (j == N - 1... | [
"assignment.change"
] | 1,356,366 | 1,356,363 | u422506696 | cpp |
p03680 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N, a[100000], b[100000], ans;
cin >> N;
for (int i = 0; i < N; ++i)
cin >> a[i];
b[0] = 1;
bool X = false;
for (int i = 0; i < N; ++i) {
b[i + 1] = a[b[i]];
if (b[i] == 2) {
ans = i;
X = true;
break... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N, a[100000], b[100000], ans;
cin >> N;
for (int i = 0; i < N; ++i)
cin >> a[i];
b[0] = 1;
bool X = false;
for (int i = 0; i < N; ++i) {
b[i + 1] = a[b[i] - 1];
if (b[i] == 2) {
ans = i;
X = true;
b... | [
"assignment.change"
] | 1,356,382 | 1,356,383 | u041282550 | cpp |
p03680 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int num = a[0], count = 1;
while (count <= n) {
count++;
if (num == 2) {
break;
}
num = a[num - 1];
}
if (count ==... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int num = a[0], count = 0;
while (count <= n) {
count++;
if (num == 2) {
break;
}
num = a[num - 1];
}
if (count ==... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,356,384 | 1,356,385 | u003019316 | cpp |
p03680 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fw(p) for (int w = 0; w < (p); w++)
#define fx(p) for (int x = 0; x < (p); x++)
#define fy(p) for (int y = 0; y < (p); y++)
#define fz(p) for (int z = 0; z < (p); z++)
#define fyg(p, g) for (int y = (g); y < (p); y++)
#define fzg(p, g) for (int... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fw(p) for (int w = 0; w < (p); w++)
#define fx(p) for (int x = 0; x < (p); x++)
#define fy(p) for (int y = 0; y < (p); y++)
#define fz(p) for (int z = 0; z < (p); z++)
#define fyg(p, g) for (int y = (g); y < (p); y++)
#define fzg(p, g) for (int ... | [
"assignment.add"
] | 1,356,395 | 1,356,396 | u824327013 | cpp |
p03680 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, li = 1, ri;
cin >> n;
vector<int> vec(n);
for (int i = 0; i < n; i++) {
cin >> vec.at(i);
}
for (int i = 0; i < n; i++) {
ri = vec.at(li - 1);
li = ri + 1;
// cout<<li<<" ";
if (li == 2) {
cout << i + 1 << endl;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, li = 1, ri;
cin >> n;
vector<int> vec(n + 10);
for (int i = 0; i < n; i++) {
cin >> vec.at(i);
}
for (int i = 0; i < n; i++) {
ri = vec.at(li - 1);
li = ri;
// cout<<li<<" ";
if (li == 2) {
cout << i + 1 << endl;
... | [
"expression.operation.binary.remove"
] | 1,356,397 | 1,356,398 | u452009494 | cpp |
p03680 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
int main() {
int n;
cin >> n;
int a[n + 1];
int b[n + 1] = {};
for (int i = 1; i <= n; i++)
cin >> a[i];
n = 1;
b[n] = 1;
int count = 0;
wh... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
int main() {
int n;
cin >> n;
int a[n + 1];
int b[n + 1] = {};
for (int i = 1; i <= n; i++)
cin >> a[i];
n = 1;
b[n] = 1;
int count = 0;
wh... | [] | 1,356,401 | 1,356,402 | u310101703 | cpp |
p03680 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> a(N + 1);
for (int i = 1; i < N + 1; i++) {
cin >> a[i];
}
int b = 1;
for (int i = 1; i < N + 1; i++) {
b = a[b];
if (b == 2) {
cout << i << endl;
break;
return 0;
}
}
cout << -... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> a(N + 1);
for (int i = 1; i < N + 1; i++) {
cin >> a[i];
}
int b = 1;
for (int i = 1; i < N + 1; i++) {
b = a[b];
if (b == 2) {
cout << i << endl;
return 0;
}
}
cout << -1 << endl;
}... | [] | 1,356,422 | 1,356,420 | u685726857 | cpp |
p03680 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
int main() {
int n, now = 0, ans = 0;
vector<int> a(n);
vector<bool> b(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
a.at(i)--;
}
while (true) {
if (b.at(now))
break;
b.at(now) = true;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
int main() {
int n, now = 0, ans = 0;
cin >> n;
vector<int> a(n);
vector<bool> b(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
a.at(i)--;
}
while (true) {
if (b.at(now))
break;
b.at(n... | [] | 1,356,427 | 1,356,428 | u773916255 | cpp |
p03680 | #include <bits/stdc++.h>
using namespace std;
int main() {
// cin.tie(0);
// ios::sync_with_stdio(false);
int N;
cin >> N;
int a[N];
for (int i = 0; i < N; i++) {
cin >> a[i];
}
int ans = 0;
int count = 0;
int j = 0;
for (int i = 0; i < 100000; i++) {
count++;
if (j > N)
break;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
// cin.tie(0);
// ios::sync_with_stdio(false);
int N;
cin >> N;
int a[N];
for (int i = 0; i < N; i++) {
cin >> a[i];
}
int ans = 0;
int count = 0;
int j = 1;
for (int i = 0; i < 100000; i++) {
count++;
if (j > N)
break;
... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,356,431 | 1,356,432 | u158620769 | cpp |
p03680 | #include <bits/stdc++.h>
using namespace std;
int main() {
// cin.tie(0);
// ios::sync_with_stdio(false);
int N;
cin >> N;
int a[N];
for (int i = 0; i < N; i++) {
cin >> a[i];
}
int ans = 0;
int count = 0;
int j = 0;
for (int i = 0; i < 100000; i++) {
count++;
if (j > N)
break;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
// cin.tie(0);
// ios::sync_with_stdio(false);
int N;
cin >> N;
int a[N];
for (int i = 0; i < N; i++) {
cin >> a[i];
}
int ans = 0;
int count = 0;
int j = 1;
for (int i = 0; i < 100000; i++) {
count++;
if (j > N)
break;
... | [
"literal.number.change",
"variable_declaration.value.change",
"assignment.change"
] | 1,356,433 | 1,356,432 | u158620769 | cpp |
p03680 | #include <algorithm>
#include <stdio.h>
using namespace std;
#define REP(i, N) for (int(i) = 0; (i) < (N); i++)
#define MAX 1 << 20
int main() {
int n, a[100000];
scanf("%d", &n);
REP(i, n) scanf("%d", &a[i]);
int p = a[0], count = 0;
REP(i, n) {
count++;
if (p == 2)
break;
else if (i == n... | #include <algorithm>
#include <stdio.h>
using namespace std;
#define REP(i, N) for (int(i) = 0; (i) < (N); i++)
#define MAX 1 << 20
int main() {
int n, a[100005];
scanf("%d", &n);
REP(i, n) scanf("%d", &a[i]);
int p = a[0], count = 0;
REP(i, n) {
count++;
if (p == 2)
break;
else if (i == n... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"assignment.change"
] | 1,356,449 | 1,356,450 | u028582153 | cpp |
p03680 | #include <algorithm>
#include <climits>
#include <complex>
#include <cstdio>
#include <functional>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
// typedef pair<string,string> P;
// double dat[100][100];
// int dp[6][1010];//動的計画法
// int prime[10000001... | #include <algorithm>
#include <climits>
#include <complex>
#include <cstdio>
#include <functional>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
// typedef pair<string,string> P;
// double dat[100][100];
// int dp[6][1010];//動的計画法
// int prime[10000001... | [
"variable_declaration.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 1,356,451 | 1,356,452 | u559645647 | cpp |
p03680 | #include <algorithm>
#include <climits>
#include <complex>
#include <cstdio>
#include <functional>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
// typedef pair<string,string> P;
// double dat[100][100];
// int dp[6][1010];//動的計画法
// int prime[10000001... | #include <algorithm>
#include <climits>
#include <complex>
#include <cstdio>
#include <functional>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
// typedef pair<string,string> P;
// double dat[100][100];
// int dp[6][1010];//動的計画法
// int prime[10000001... | [
"variable_declaration.value.change",
"identifier.replace.remove",
"literal.replace.add",
"literal.number.change",
"assignment.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,356,453 | 1,356,452 | u559645647 | cpp |
p03680 | #include <iostream>
using namespace std;
int main() {
int c = 0, n, a[1 << 17];
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int l = 1; c < n; c++) {
l = a[l];
if (l == 2) {
cout << c << endl;
return 0;
}
}
cout << "-1" << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int c = 1, n, a[1 << 17];
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int l = 1; c < n * 2; c++) {
l = a[l];
if (l == 2) {
cout << c << endl;
return 0;
}
}
cout << "-1" << endl;
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.condition.change"
] | 1,356,454 | 1,356,455 | u601082779 | cpp |
p03680 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define LLINF 9223372036854775807
#define MOD ll(1e9 + 7)
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int pos = 0;
int cnt = 1;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define LLINF 9223372036854775807
#define MOD ll(1e9 + 7)
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int pos = 0;
int cnt = 1;
... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 1,356,456 | 1,356,457 | u677421794 | cpp |
p03680 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main(void) {
// Your code here!
int n;
cin >> n;
int a = 0, p = 0;
vector<int> s(n);
for (int i = 0; i < n; i++) {
cin >> s.at(i);
}
for (int i = 0; i < n; i++) {
a = s.at(a) - 1;
if (a == 1)
p = i + 1;
}
if (p !... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main(void) {
// Your code here!
int n;
cin >> n;
int a = 0, p = 0;
vector<int> s(n);
for (int i = 0; i < n; i++) {
cin >> s.at(i);
}
for (int i = 0; i < n; i++) {
a = s.at(a) - 1;
if (a == 1) {
p = i + 1;
break... | [
"control_flow.break.add"
] | 1,356,458 | 1,356,460 | u050428930 | cpp |
p03680 | #include <iostream>
#include <vector>
int main() {
int N;
std::cin >> N;
std::vector<int> a(N);
for (int i = 0; i < N; ++i) {
std::cin >> a[i];
}
int now = 0;
int cnt = 0;
while (true) {
if (now == 1) {
std::cout << cnt << std::endl;
break;
} else if (cnt >= N) {
std::cou... | #include <iostream>
#include <vector>
int main() {
int N;
std::cin >> N;
std::vector<int> a(N);
for (int i = 0; i < N; ++i) {
std::cin >> a[i];
}
int now = 0;
int cnt = 0;
while (true) {
if (now == 1) {
std::cout << cnt << std::endl;
break;
} else if (cnt >= N) {
std::cou... | [
"assignment.change"
] | 1,356,473 | 1,356,474 | u352314733 | cpp |
p03680 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, temp = 1, ans = 0, tem;
cin >> N;
vector<int> num(N + 1);
for (int i = 1; i <= N; i++) {
cin >> num.at(i);
}
for (int i = 0; i < N; i++) {
if (temp == 2) {
break;
}
tem = num.at(temp);
temp = tem;
ans++;
}
if... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, temp = 1, ans = 0, tem;
cin >> N;
vector<int> num(N + 1);
for (int i = 1; i <= N; i++) {
cin >> num.at(i);
}
for (int i = 0; i <= N; i++) {
if (temp == 2) {
break;
}
tem = num.at(temp);
temp = tem;
ans++;
}
i... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,356,482 | 1,356,483 | u833295869 | cpp |
p03680 | #include <iostream>
using namespace std;
int main() {
//入力
int n;
cin >> n;
int a[100000];
for (int i = 0; i < n; i++)
cin >> a[i];
//計算、出力
int s = 1;
for (int i = 0; i < n; i++) {
s = a[s - 1];
if (s == 2) {
cout << i + 1 << endl;
break;
}
if (i = n - 1)
cout <<... | #include <iostream>
using namespace std;
int main() {
//入力
int n;
cin >> n;
int a[100000];
for (int i = 0; i < n; i++)
cin >> a[i];
//計算、出力
int s = 1;
for (int i = 0; i < n; i++) {
s = a[s - 1];
if (s == 2) {
cout << i + 1 << endl;
break;
}
if (i == n - 1)
cout <... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 1,356,485 | 1,356,486 | u209767598 | cpp |
p03680 | #include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <set>
#include <stack>
#include <string>
#include <vector>
using ll = long long;
using namespace std;
int main() {
int n;
cin >> n;
int a[n + 1];
for (int i = 1; i <= n; i++)
cin >> a[i];
int cnt = 1, now ... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <set>
#include <stack>
#include <string>
#include <vector>
using ll = long long;
using namespace std;
int main() {
int n;
cin >> n;
int a[n + 1];
for (int i = 1; i <= n; i++)
cin >> a[i];
int cnt = 0, now ... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,356,491 | 1,356,493 | u318785595 | cpp |
p03680 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, m, n) for (int i = m; i < n; ++i)
vector<int> a, c;
int f(int i, int n) {
if (a[n] == 2)
return i;
if (c[n] == 1)
return -1;
c[n] == 1;
return f(i + 1, a[n] - 1);
}
int main() {
int N;
cin >> N;
a.resize(N);
c.resize(N);
rep(i, 0,... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, m, n) for (int i = m; i < n; ++i)
vector<int> a, c;
int f(int i, int n) {
if (a[n] == 2)
return i;
if (c[n] == 1)
return -1;
c[n] = 1;
return f(i + 1, a[n] - 1);
}
int main() {
int N;
cin >> N;
a.resize(N);
c.assign(N, 0);
rep(i, ... | [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo",
"call.function.change",
"call.arguments.add"
] | 1,356,481 | 1,356,484 | u756388720 | cpp |
p03680 | #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 s = 0, b = 1, c;
while (s != 2) {
if (a.at(s) == -1) {
b = -1;
break;
}
c = s;
s = a.at(s) - 1;
a.at(c) = -1;
b++;
}... | #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 s = 0, b = 0, c;
while (s != 1) {
if (a.at(s) == -1) {
b = -1;
break;
}
c = s;
s = a.at(s) - 1;
a.at(c) = -1;
b++;
}... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.condition.change"
] | 1,356,507 | 1,356,508 | u832995587 | cpp |
p03680 | #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 s = 0, b = 1, c;
while (s != 2) {
if (a.at(s) == -1) {
b = -1;
break;
}
c = s;
s = a.at(s);
a.at(c) = -1;
b++;
}
c... | #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 s = 0, b = 0, c;
while (s != 1) {
if (a.at(s) == -1) {
b = -1;
break;
}
c = s;
s = a.at(s) - 1;
a.at(c) = -1;
b++;
}... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.condition.change",
"assignment.change"
] | 1,356,509 | 1,356,508 | u832995587 | cpp |
p03680 | #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 s = 1, cnt = 1, tmp;
while (s != 2) {
if (A[s - 1] == -1) {
cout << -1 << "\n";
return 0;
}
tmp = s - 1;
s = A[s - 1];
A[tmp] = -1;
cnt+... | #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 s = 1, cnt = 0, tmp;
while (s != 2) {
if (A[s - 1] == -1) {
cout << -1 << "\n";
return 0;
}
tmp = s - 1;
s = A[s - 1];
A[tmp] = -1;
cnt+... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,356,512 | 1,356,513 | u501643136 | cpp |
p03680 | #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 s = 1, cnt = 1, tmp;
while (s == 2) {
if (A[s] == -1) {
cout << -1 << "\n";
return 0;
}
tmp = s - 1;
s = A[s - 1];
A[tmp] = -1;
cnt++;
... | #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 s = 1, cnt = 0, tmp;
while (s != 2) {
if (A[s - 1] == -1) {
cout << -1 << "\n";
return 0;
}
tmp = s - 1;
s = A[s - 1];
A[tmp] = -1;
cnt+... | [
"literal.number.change",
"variable_declaration.value.change",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.loop.condition.change",
"control_flow.branch.if.condition.change"
] | 1,356,514 | 1,356,513 | u501643136 | cpp |
p03680 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> t(N, 0);
for (int i = 0; i < N; i++)
cin >> t[i];
int cur = 0;
int cnt = 1;
for (int i = 0; i < N; i++) {
cur = t[cur] - 1;
cnt++;
if (cur == 1) {
cout << cnt << endl;
return 0;
}
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> t(N, 0);
for (int i = 0; i < N; i++)
cin >> t[i];
int cur = 0;
int cnt = 0;
for (int i = 0; i < N; i++) {
cur = t[cur] - 1;
cnt++;
if (cur == 1) {
cout << cnt << endl;
return 0;
}
}
... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,356,515 | 1,356,516 | u501643136 | cpp |
p03680 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
int i = 0;
int num = 1;
int out = -1;
while (i < N) {
num = vec.at(num - 1);
if (num == 2) {
out = i + 1;
}
i++;
}
cout ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
int i = 0;
int num = 1;
int shutsuryoku = -1;
while (i < N) {
num = vec.at(num - 1);
if (num == 2) {
shutsuryoku = i + 1;
break;
... | [
"variable_declaration.name.change",
"identifier.change",
"assignment.variable.change",
"control_flow.break.add",
"io.output.change"
] | 1,356,539 | 1,356,540 | u649915042 | cpp |
p03680 | #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 = 1;
int ans = 0;
bool t = false;
for (int i = 0; i < 1e6; i++) {
k = a[k - 1];
ans++;
if (k == 2) {
break;
t = true;
}
}
cout << (t ... | #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 = 1;
int ans = 0;
bool t = false;
for (int i = 0; i < 1e6; i++) {
k = a[k - 1];
ans++;
if (k == 2) {
t = true;
break;
}
}
cout << (t ... | [
"control_flow.break.add"
] | 1,356,547 | 1,356,548 | u179970156 | cpp |
p03680 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> v(N);
for (int i = 0; i < N; i++) {
cin >> v[i];
v[i]--;
}
for (int i = 0, next = v[0]; i < N; i++) {
if (v[0] == 1) {
cout << i + 1 << endl;
return 0;
}
next = v[next];
}
cout << -1 ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> v(N);
for (int i = 0; i < N; i++) {
cin >> v[i];
v[i]--;
}
for (int i = 0, next = v[0]; i < N; i++) {
if (next == 1) {
cout << i + 1 << endl;
return 0;
}
next = v[next];
}
cout << -1 ... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 1,356,549 | 1,356,550 | u401900157 | cpp |
p03680 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int n;
cin >> n;
vector<int> v;
for (int i = 0; i < n; i++) {
int z;
cin >> n;
z--;
v.push_back(z);
}
int now = 0, c = 0;
for (;;) {
... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int n;
cin >> n;
vector<int> v;
for (int i = 0; i < n; i++) {
int z;
cin >> z;
z--;
v.push_back(z);
}
int now = 0, c = 0;
for (;;) {
... | [
"identifier.change",
"expression.operation.binary.change"
] | 1,356,551 | 1,356,552 | u114838227 | cpp |
p03680 | #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;
int a = 0;
while (true) {
a = A.at(a);
count++;
if (a == 1) {
break;
} else if (count > N) {
count = -1;
br... | #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;
int a = 1;
while (true) {
a = A.at(a - 1);
count++;
if (a == 2) {
break;
} else if (count > N) {
count = -1;
... | [
"literal.number.change",
"variable_declaration.value.change",
"assignment.change",
"control_flow.branch.if.condition.change"
] | 1,356,565 | 1,356,566 | u408053343 | cpp |
p03680 | #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;
int a = 0;
while (true) {
a = A.at(a);
count++;
if (a == 2) {
break;
} else if (count > N) {
count = -1;
br... | #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;
int a = 1;
while (true) {
a = A.at(a - 1);
count++;
if (a == 2) {
break;
} else if (count > N) {
count = -1;
... | [
"literal.number.change",
"variable_declaration.value.change",
"assignment.change"
] | 1,356,567 | 1,356,566 | u408053343 | cpp |
p03680 | #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;
int a = 1;
while (true) {
a = A.at(a);
count++;
if (a == 2) {
break;
} else if (count > N) {
count = -1;
br... | #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;
int a = 1;
while (true) {
a = A.at(a - 1);
count++;
if (a == 2) {
break;
} else if (count > N) {
count = -1;
... | [
"assignment.change"
] | 1,356,568 | 1,356,566 | u408053343 | cpp |
p03680 | #include <array>
#include <iostream>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, pos = 0;
int p = -1;
array<int, 100000> a;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
pos = a[pos] - 1;
if (pos == 1) {
... | #include <array>
#include <iostream>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, pos = 0;
int p = -1;
array<int, 100000> a;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
pos = a[pos] - 1;
if (pos == 1) {
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,356,571 | 1,356,572 | u076506345 | cpp |
p03680 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> data(N);
for (int i = 0; i < N; i++) {
data.at(i);
}
int ans = -1, count = 1, a = data.at(0);
while (true) {
if (a == 2) {
ans = count;
break;
}
a = data.at(a);
count++;
if (count ==... | #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 ans = -1, count = 1, a = data.at(0);
while (true) {
if (a == 2) {
ans = count;
break;
}
a = data.at(a - 1);
count++;
i... | [
"assignment.change"
] | 1,356,583 | 1,356,584 | u239087789 | cpp |
p03680 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int N;
cin >> N;
int a[100002];
bool hist[100002];
int count = 0;
for (int i = 0; i < N; i++) {
cin >> a[i];
hist[i] = false;
}
int curbtn = 1;
while (!hist[curbtn - 1]) {
hist[curbtn - 1] = ... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int N;
cin >> N;
int a[100002];
bool hist[100002];
int count = 0;
for (int i = 0; i < N; i++) {
cin >> a[i];
hist[i] = false;
}
int curbtn = 1;
while (!hist[curbtn - 1]) {
hist[curbtn - 1] = ... | [] | 1,356,585 | 1,356,586 | u644070128 | cpp |
p03680 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int N;
cin >> N;
int a[100002];
bool hist[100002];
int count = 0;
for (int i = 0; i < N; i++) {
cin >> a[i];
hist[i] = false;
}
int curbtn = 1;
while (!hist[curbtn]) {
hist[curbtn - 1] = true... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int N;
cin >> N;
int a[100002];
bool hist[100002];
int count = 0;
for (int i = 0; i < N; i++) {
cin >> a[i];
hist[i] = false;
}
int curbtn = 1;
while (!hist[curbtn - 1]) {
hist[curbtn - 1] = ... | [
"control_flow.loop.condition.change"
] | 1,356,587 | 1,356,586 | u644070128 | cpp |
p03680 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> tinko(N);
int i = 0;
int j = 0;
for (; i < N; i++) {
cin >> tinko.at(i);
}
for (; j < N; j++) {
i = tinko.at(i - 1);
if (i == 1) {
break;
}
}
if (j == N) {
cout << -1 << endl;
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> tinko(N);
int i = 0;
int j = 0;
for (; i < N; i++) {
cin >> tinko.at(i);
}
for (int i = 0; j < N; j++) {
i = tinko.at(i) - 1;
if (i == 1) {
break;
}
}
if (j == N) {
cout << -1 << en... | [
"control_flow.loop.for.initializer.change",
"variable_declaration.add",
"call.arguments.change"
] | 1,356,590 | 1,356,591 | u100812801 | cpp |
p03680 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> a(N + 1);
int push = 1;
int cnt = 0;
for (int i = 1; i <= N; i++)
cin >> a.at(i);
while (cnt <= N) {
push = a.at(push);
if (push == 2) {
cnt++;
break;
} else if (push == 1) {
cnt = -1... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> a(N + 1);
int push = 1;
int cnt = 0;
for (int i = 1; i <= N; i++)
cin >> a.at(i);
while (cnt <= N) {
push = a.at(push);
if (push == 2) {
cnt++;
break;
} else if (push == 1) {
cnt = -1... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.return.add",
"control_flow.return.0.add"
] | 1,356,592 | 1,356,593 | u912522164 | cpp |
p03680 | // file_name:ABC65_B.cpp
#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()
#... | // file_name:ABC65_B.cpp
#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()
#... | [
"variable_declaration.array_dimensions.change",
"assignment.change",
"expression.operation.binary.add"
] | 1,356,594 | 1,356,595 | u791593901 | cpp |
p03680 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> buttons(N);
for (int i = 0; i < N; ++i) {
cin >> buttons.at(i);
}
int on = 0;
for (int i = 0; i <= N; ++i) {
if (on == 1) {
cout << i << endl;
return 0;
}
on = buttons.at(on);
}
cout <... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> buttons(N);
for (int i = 0; i < N; ++i) {
cin >> buttons.at(i);
}
int on = 1;
for (int i = 0; i <= N; ++i) {
if (on == 2) {
cout << i << endl;
return 0;
}
on = buttons.at(on - 1);
}
co... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.branch.if.condition.change",
"assignment.change"
] | 1,356,596 | 1,356,597 | u568326399 | cpp |
p03680 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> avec(N);
for (int i = 0; i < N; i++) {
cin >> avec.at(i);
}
int now = 1, cnt = 0;
while (1) {
if (now == 2) {
cout << cnt << endl;
break;
}
if (cnt >= N) {
cout << -1 << endl;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> avec(N);
for (int i = 0; i < N; i++) {
cin >> avec.at(i);
}
int now = 1, cnt = 0;
while (1) {
if (now == 2) {
cout << cnt << endl;
break;
}
if (cnt >= N) {
cout << -1 << endl;
... | [
"assignment.change"
] | 1,356,600 | 1,356,601 | u665871498 | cpp |
p03680 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> avec(N);
for (int i = 0; i < N; i++) {
cin >> avec.at(i);
}
int now = 1, cnt = 0;
while (1) {
if (now == 2) {
cout << cnt << endl;
break;
}
if (cnt >= N) {
cout << "-1" << endl;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> avec(N);
for (int i = 0; i < N; i++) {
cin >> avec.at(i);
}
int now = 1, cnt = 0;
while (1) {
if (now == 2) {
cout << cnt << endl;
break;
}
if (cnt >= N) {
cout << -1 << endl;
... | [
"assignment.change"
] | 1,356,602 | 1,356,601 | u665871498 | cpp |
p03680 | #include <iostream>
using namespace std;
int main() {
int N, i, j, k = 1;
cin >> N;
int a[N];
for (i = 0; i < N; i++) {
cin >> a[i];
}
i = 0;
while (N - i) {
j = a[k] - 1;
i++;
if (j == 1) {
cout << i << endl;
return 0;
}
k = j;
}
cout << "-1" << endl;
return... | #include <iostream>
using namespace std;
int main() {
int N, i, j, k = 0;
cin >> N;
int a[N];
for (i = 0; i < N; i++) {
cin >> a[i];
}
i = 0;
while (N - i) {
j = a[k] - 1;
i++;
if (j == 1) {
cout << i << endl;
return 0;
}
k = j;
}
cout << "-1" << endl;
return... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,356,603 | 1,356,604 | u912533549 | cpp |
p03680 | #include <iostream>
using namespace std;
int main() {
int N, i, j, k = 1;
cin >> N;
int a[N];
for (i = 0; i < N; i++) {
cin >> a[i];
}
i = 0;
while (N - i) {
j = a[k];
i++;
if (j == 1) {
cout << i << endl;
return 0;
}
k = j;
}
cout << "-1" << endl;
return 0;
... | #include <iostream>
using namespace std;
int main() {
int N, i, j, k = 0;
cin >> N;
int a[N];
for (i = 0; i < N; i++) {
cin >> a[i];
}
i = 0;
while (N - i) {
j = a[k] - 1;
i++;
if (j == 1) {
cout << i << endl;
return 0;
}
k = j;
}
cout << "-1" << endl;
return... | [
"literal.number.change",
"variable_declaration.value.change",
"assignment.change"
] | 1,356,605 | 1,356,604 | u912533549 | cpp |
p03680 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
using namespace std;
int main() {
bool ok = false;
int n, ans[110000];
cin >> n;
for (int j = 1; j < n; j++) {
cin >> ans[j];
}
int num, count = 1;
num = ans[1];
if (num == 2)
cout << 1 << endl;
... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
using namespace std;
int main() {
bool ok = false;
int n, ans[110000];
cin >> n;
for (int j = 1; j < n + 1; j++) {
cin >> ans[j];
}
int num, count = 1;
num = ans[1];
if (num == 2)
cout << 1 << endl... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 1,356,610 | 1,356,611 | u127856129 | cpp |
p03680 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
using namespace std;
int main() {
bool ok = false;
int n, ans[110000];
cin >> n;
for (int j = 1; j < n; j++) {
cin >> ans[j];
}
int num, count = 1;
num = ans[1];
if (num == 2)
cout << 1 << endl;
... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
using namespace std;
int main() {
bool ok = false;
int n, ans[110000];
cin >> n;
for (int j = 1; j < n + 1; j++) {
cin >> ans[j];
}
int num, count = 1;
num = ans[1];
if (num == 2)
cout << 1 << endl... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 1,356,612 | 1,356,611 | u127856129 | cpp |
p03680 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
using namespace std;
int main() {
bool ok = false;
int n, ans[110000];
cin >> n;
for (int j = 0; j < n; j++) {
cin >> ans[j];
}
int num, count = 1;
num = ans[0];
if (num == 2)
cout << 1 << endl;
... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
using namespace std;
int main() {
bool ok = false;
int n, ans[110000];
cin >> n;
for (int j = 1; j < n + 1; j++) {
cin >> ans[j];
}
int num, count = 1;
num = ans[1];
if (num == 2)
cout << 1 << endl... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"assignment.value.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.chang... | 1,356,613 | 1,356,611 | u127856129 | cpp |
p03680 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
int p = 1;
for (int i = 0; i < N; i++) {
p = vec.at(p - 1);
if (p == 2) {
cout << i + 1 << endl;
break;
}
if (i = N - 1) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
int p = 1;
for (int i = 0; i < N; i++) {
p = vec.at(p - 1);
if (p == 2) {
cout << i + 1 << endl;
break;
}
if (i == N - 1) {... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 1,356,623 | 1,356,624 | u233626335 | cpp |
p03680 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
int p = 1;
for (int i = 0; i < N; i++) {
p = vec.at(p);
if (p == 2) {
cout << i + 1 << endl;
break;
}
if (i = N - 1) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
int p = 1;
for (int i = 0; i < N; i++) {
p = vec.at(p - 1);
if (p == 2) {
cout << i + 1 << endl;
break;
}
if (i == N - 1) {... | [
"assignment.change",
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 1,356,625 | 1,356,624 | u233626335 | cpp |
p03680 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
#define FOR(I, A, B) for (in... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
#define FOR(I, A, B) for (in... | [
"literal.number.change",
"call.arguments.change"
] | 1,356,636 | 1,356,637 | u310790595 | cpp |
p03680 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <fstream>
#include <functional>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, i;
int b = 0;
cin >> N;
vector<int> a(N);
for (i = 0; i < N; i++) {
cin >>... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <fstream>
#include <functional>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, i;
int b = 1;
cin >> N;
vector<int> a(N);
for (i = 0; i < N; i++) {
cin >>... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,356,640 | 1,356,641 | u898651494 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.