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>
#define _GLIBCXX_DEBUG
using namespace std;
#define int int64_t
#define pcnt __builtin_popcount
#define pb push_back
#define ALL(x) (x).begin(), (x).end()
#define vec vector<int>
#define mat vector<vector<int>> // mat データ名(縦,vec(横));
#define F first
#define S second
int INF = 100000000000000000... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
#define int int64_t
#define pcnt __builtin_popcount
#define pb push_back
#define ALL(x) (x).begin(), (x).end()
#define vec vector<int>
#define mat vector<vector<int>> // mat データ名(縦,vec(横));
#define F first
#define S second
int INF = 100000000000000000... | [
"control_flow.loop.for.condition.change"
] | 1,355,604 | 1,355,605 | u782064792 | 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 = vec.at(0);
for (int i = 0; i < N; i++) {
if (i == N) {
cout << -1 << endl;
} else if (p == 2) {
cout << i + 1 << endl;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
int p = vec.at(0);
for (int i = 0; i < N; i++) {
if (i == N - 1) {
cout << -1 << endl;
} else if (p == 2) {
cout << i + 1 << endl;
... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 1,355,617 | 1,355,618 | u337644669 | 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;
int count = 0;
for (int i = 0; i < N; i = now) {
now = a.at(i) - 1;
count++;
if (now == 1) {
cout << count << endl;
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 now = 0;
int count = 0;
for (int i = 0; i < N; i = now) {
now = a.at(i) - 1;
count++;
if (now == 1) {
cout << count << endl;
br... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 1,355,625 | 1,355,626 | u730710086 | 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;
int count = 0;
for (int i = 0; i < N; i = now) {
now = a.at(i) - 1;
count++;
if (now = 1) {
cout << count << endl;
bre... | #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;
int count = 0;
for (int i = 0; i < N; i = now) {
now = a.at(i) - 1;
count++;
if (now == 1) {
cout << count << endl;
br... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 1,355,627 | 1,355,626 | u730710086 | cpp |
p03680 | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define FAST_IO \
ios_base::sync_with_stdio(false), cin.... | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define FAST_IO \
ios_base::sync_with_stdio(false), cin.... | [
"control_flow.return.add",
"literal.number.change",
"assignment.value.change"
] | 1,355,630 | 1,355,631 | u835705414 | cpp |
p03680 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> botton(N);
int A = 1; //ボタン番号
int number = 0; //回数
for (int i = 0; i < N; i++) {
cin >> botton.at(i);
}
for (int i = 0; i < N; i++) {
A = botton.at(A - 1);
number++;
if (A == 2) {
cout <<... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> botton(N);
int A = 1; //ボタン番号
int number = 0; //回数
for (int i = 0; i < N; i++) {
cin >> botton.at(i);
}
for (int i = 0; i < N; i++) {
A = botton.at(A - 1);
number++;
if (A == 2) {
cout <<... | [
"expression.operation.binary.remove"
] | 1,355,632 | 1,355,633 | u216112336 | cpp |
p03680 | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
using namespace std;
using ll = long long;
using vi = vector<int>;
using vii = vector<vi>;
int main() {
int N;
cin >> N;
vi a(N);
for (int i = 0; i < N; i++) {
cin >> a[i];
}
int on = 0;
ll cnt = 0;
while (1) {
if (cnt >= N) {
... | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
using namespace std;
using ll = long long;
using vi = vector<int>;
using vii = vector<vi>;
int main() {
int N;
cin >> N;
vi a(N);
for (int i = 0; i < N; i++) {
cin >> a[i];
}
int on = 0;
ll cnt = 0;
while (1) {
if (cnt >= N) {
... | [
"assignment.change"
] | 1,355,634 | 1,355,635 | u274758786 | cpp |
p03680 | #include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> v(n + 1);
for (int i = 1; i <= n; i++) {
int a;
cin >> a;
v[i] = a;
}
int s = v[1];
int ans = 1;
whi... | #include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> v(n + 1);
for (int i = 1; i <= n; i++) {
int a;
cin >> a;
v[i] = a;
}
int s = v[1];
int ans = 0;
whi... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.branch.if.condition.change"
] | 1,355,652 | 1,355,653 | u651235280 | cpp |
p03680 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
a.push_back(--x);
}
int y = 0;
int ans = 0;
vector<bool> used(n, false);
while (y != 1 && !used[y]) {
used[y] = true;
y = a[y];
... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
a.push_back(--x);
}
int y = 0;
int ans = 0;
vector<bool> used(n, false);
while (y != 1 && !used[y]) {
used[y] = true;
y = a[y];
... | [
"control_flow.branch.if.condition.change"
] | 1,355,665 | 1,355,666 | u858670323 | cpp |
p03680 | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
int main(void) {
int n;
cin >> n;
int a[n];
int cnt = 1;
int now = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int j = 0; j < n + 1; j++) {
if (now == 1) {
cout << cnt << endl;
break;
}
if (cnt >= n... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
int main(void) {
int n;
cin >> n;
int a[n];
int cnt = 0;
int now = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int j = 0; j < n + 1; j++) {
if (now == 1) {
cout << cnt << endl;
break;
}
if (cnt >= n... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,355,667 | 1,355,668 | u163874353 | cpp |
p03680 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int order[N];
for (int i = 0; i < N; i++) {
cin >> order[i];
--order[i];
}
int k = 1;
int ans = -1;
int count = 0;
for (int i = 0; i < 10e6; i++) {
k = order[k];
++count;
if (k == 2) {
... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int order[N];
for (int i = 0; i < N; i++) {
cin >> order[i];
--order[i];
}
int k = 0;
int ans = -1;
int count = 0;
for (int i = 0; i < 10e6; i++) {
k = order[k];
++count;
if (k == 1) {
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.branch.if.condition.change"
] | 1,355,675 | 1,355,676 | u366135682 | cpp |
p03680 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, temp;
int count = 0;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> temp;
temp--;
a[i] = temp;
}
int now = 0;
for (int i = 0; i < n; i++) {
count++;
now = a[a[now]];
if (now == 1) {
cout ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, temp;
int count = 0;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> temp;
temp--;
a[i] = temp;
}
int now = 0;
for (int i = 0; i < n; i++) {
count++;
now = a[now];
if (now == 1) {
cout << ... | [] | 1,355,690 | 1,355,691 | u416491205 | cpp |
p03680 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define vv(a, b, c, d) vector<vector<d>>(a, vector<d>(b, c))
#define vvi vector<vector<int>>
#define vvl vector<vector<ll>... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define vv(a, b, c, d) vector<vector<d>>(a, vector<d>(b, c))
#define vvi vector<vector<int>>
#define vvl vector<vector<ll>... | [
"assignment.change"
] | 1,355,696 | 1,355,697 | u816587940 | 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);
bool can_finish = false;
int count = 1;
int next = 1;
while (can_finish != true) {
if (count >= N) {
count = -1;
break;
}
if (a.at(next... | #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);
bool can_finish = false;
int count = 0;
int next = 1;
while (can_finish != true) {
if (count >= N) {
count = -1;
break;
}
if (a.at(next... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,355,698 | 1,355,699 | u258503681 | cpp |
p03680 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> v;
for (int i = 0; i < N; i++) {
int n;
cin >> n;
v.push_back(n);
}
int now = 0, c = 0;
for (;;) {
if (now == 1) {
cout << c << endl;
break;
}
i... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> v;
for (int i = 0; i < N; i++) {
int n;
cin >> n;
v.push_back(--n);
}
int now = 0, c = 0;
for (;;) {
if (now == 1) {
cout << c << endl;
break;
}
... | [
"call.arguments.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 1,355,709 | 1,355,710 | u376892863 | cpp |
p03680 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, i, j, k;
cin >> N;
vector<int> a(N);
for (i = 0; i < N; i++) {
cin >> a.at(i);
}
j = a.at(0);
for (i = 0; i < N; i++) {
if (j == 2) {
break;
}
j = a.at(j - 1);
}
if (i < N - 2) {
cout << i + 1 << endl;
} els... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, i, j, k;
cin >> N;
vector<int> a(N);
for (i = 0; i < N; i++) {
cin >> a.at(i);
}
j = a.at(0);
for (i = 0; i < N; i++) {
if (j == 2) {
break;
}
j = a.at(j - 1);
}
if (i < N - 1) {
cout << i + 1 << endl;
} els... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 1,355,713 | 1,355,714 | u018890850 | cpp |
p03680 | #include <bits/stdc++.h>
using namespace std;
int main() {
int nums;
cin >> nums;
vector<int> buttons(nums);
for (int i = 0; i < nums; i++) {
cin >> buttons.at(i);
}
bool flag = false;
int count = 0;
int current = 0;
for (int i = 0; i < nums; i++) {
count++;
int tmp = buttons.at(current... | #include <bits/stdc++.h>
using namespace std;
int main() {
int nums;
cin >> nums;
vector<int> buttons(nums);
for (int i = 0; i < nums; i++) {
cin >> buttons.at(i);
}
bool flag = false;
int count = 0;
int current = 0;
for (int i = 0; i < nums; i++) {
count++;
int tmp = buttons.at(current... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 1,355,718 | 1,355,719 | u157933935 | cpp |
p03680 | #include <iostream>
using namespace std;
#define MAX_N 11000
int main() {
int N;
cin >> N;
int a[N];
for (int i = 1; i <= N; i++)
cin >> a[i];
bool seen[N];
int cur = 1, cnt = 0;
while (a[cur] != 2) {
seen[cur] = true;
cur = a[cur];
cnt++;
if (cnt > N)
break;
}
if (seen[2]... | #include <iostream>
using namespace std;
#define MAX_N 11000
int main() {
int N;
cin >> N;
int a[N];
for (int i = 1; i <= N; i++)
cin >> a[i];
bool seen[N];
int cur = 1, cnt = 0;
while (a[cur] != 2) {
seen[cur] = true;
cur = a[cur];
cnt++;
if (cnt > N)
break;
}
if (a[cur] ... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change"
] | 1,355,723 | 1,355,724 | u329706129 | 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 index = 1;
int num = 0;
for (int i = 0; i < N; i++) {
if (index == 2) {
cout << num << endl;
break;
} else if (i == N) {
co... | #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 index = 1;
int num = 0;
for (int i = 0; i < N; i++) {
if (index == 2) {
cout << num << endl;
break;
} else if (i == N - 1) {
... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 1,355,725 | 1,355,726 | u156815136 | 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 light = 1;
int count = 0;
for (int i = 0; i < N; i++) {
if (light == 2) {
cout << count << endl;
break;
}
if (count >= N) {
... | #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 light = 1;
int count = 0;
for (int i = 0; i < N + 1; i++) {
if (light == 2) {
cout << count << endl;
break;
}
if (count >= N) {... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 1,355,743 | 1,355,744 | u387624291 | 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 light = 1;
int count = 0;
for (int i = 0; i < N + 5; i++) {
if (light == 2) {
cout << count << endl;
break;
}
if (count > N) {
... | #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 light = 1;
int count = 0;
for (int i = 0; i < N + 1; i++) {
if (light == 2) {
cout << count << endl;
break;
}
if (count >= N) {... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"assignment.change"
] | 1,355,745 | 1,355,744 | u387624291 | 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 light = 1;
int count = 0;
for (int i = 0; i < N; i++) {
if (light == 2) {
cout << count << endl;
break;
}
if (count > N) {
... | #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 light = 1;
int count = 0;
for (int i = 0; i < N + 1; i++) {
if (light == 2) {
cout << count << endl;
break;
}
if (count >= N) {... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"assignment.change"
] | 1,355,746 | 1,355,744 | u387624291 | cpp |
p03680 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, j;
cin >> n;
int a[n];
for (i = 0; i < n; i++) {
cin >> a[i];
}
int b = 1, c, cnt = 0;
for (i = 0; i < n; i++) {
b = a[b];
cnt++;
if (b == 2) {
cout << cnt;
return 0;
}
}
cout << -1;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, j;
cin >> n;
int a[n];
for (i = 0; i < n; i++) {
cin >> a[i];
}
int b = 1, cnt = 0;
for (i = 0; i < n; i++) {
b = a[b - 1];
cnt++;
if (b == 2) {
cout << cnt;
return 0;
}
}
cout << -1;
} | [
"variable_declaration.remove",
"assignment.change"
] | 1,355,749 | 1,355,750 | u952130512 | cpp |
p03680 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int a[100001], initial[100001];
for (int i = 1; i <= N; i++) {
cin >> a[i];
}
bool can = false;
int cur = 1;
for (int i = 1; i <= N; i++) {
cur = a[cur];
if (cur == 2) {
cout << i << endl;
can = true;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int a[100001], initial[100001];
for (int i = 1; i <= N; i++) {
cin >> a[i];
}
bool can = false;
int cur = 1;
for (int i = 1; i <= N; i++) {
cur = a[cur];
if (cur == 2) {
cout << i << endl;
can = true;
... | [
"control_flow.break.add"
] | 1,355,751 | 1,355,752 | u241312295 | cpp |
p03680 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, n, count = 1;
cin >> n;
vector<int> vec(n);
for (int i = 0; i < n; i++) {
cin >> vec.at(i);
}
a = vec.at(0);
while (a != 2) {
a = vec.at(a - 1);
count++;
if (count >= n) {
cout << -1 << endl;
break;
}
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, n, count = 1;
cin >> n;
vector<int> vec(n);
for (int i = 0; i < n; i++) {
cin >> vec.at(i);
}
a = vec.at(0);
while (a != 2) {
a = vec.at(a - 1);
count++;
if (count >= n) {
cout << -1 << endl;
return 0;
}
... | [
"control_flow.break.remove",
"control_flow.return.add",
"function.return_value.change"
] | 1,355,761 | 1,355,762 | u646412073 | cpp |
p03680 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, n, count = 1;
cin >> n;
vector<int> vec(n);
for (int i = 0; i < n; i++) {
cin >> vec.at(i);
}
a = vec.at(0);
while (a != 2) {
a = vec.at(a);
count++;
if (count >= n) {
cout << -1 << endl;
break;
}
}
cou... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, n, count = 1;
cin >> n;
vector<int> vec(n);
for (int i = 0; i < n; i++) {
cin >> vec.at(i);
}
a = vec.at(0);
while (a != 2) {
a = vec.at(a - 1);
count++;
if (count >= n) {
cout << -1 << endl;
return 0;
}
... | [
"assignment.change",
"control_flow.break.remove",
"control_flow.return.add",
"function.return_value.change"
] | 1,355,763 | 1,355,762 | u646412073 | cpp |
p03680 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
int main() {
int n;
cin >> n;
int b = 1;
vector<int> a(n);
REP(i, n) cin >> a[i];
for (int i = 1; i < 100002; i++) {
b = a[b - 1];
if (b == 2) {
cout << i + 1;
return 0;
}
}
cout << -1;
... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
int main() {
int n;
cin >> n;
int b = 1;
vector<int> a(n);
REP(i, n) cin >> a[i];
for (int i = 1; i < 100002; i++) {
b = a[b - 1];
if (b == 2) {
cout << i;
return 0;
}
}
cout << -1;
retu... | [
"expression.operation.binary.remove"
] | 1,355,764 | 1,355,765 | u469451657 | cpp |
p03680 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
int main() {
int N;
vector<int> a(100001), b(100001);
cin >> N;
rep(i, N) { cin >> a.at(i); }
b.at(0) = a.at(0);
rep(j, N) {
if (j > 0) {
b.at(j) = a.at(b.at(j - 1) - 1);
}
if (b.at(j) == 2) {... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
int main() {
int N;
vector<int> a(100001), b(100001);
cin >> N;
rep(i, N) { cin >> a.at(i); }
b.at(0) = a.at(0);
rep(j, N) {
if (j > 0) {
b.at(j) = a.at(b.at(j - 1) - 1);
}
if (b.at(j) == 2) {... | [
"control_flow.break.add"
] | 1,355,770 | 1,355,769 | u571152872 | cpp |
p03680 | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(NULL);
ios::sync_with_stdio(false);
int n, now = 1;
cin >> n;
int bot[n + 1];
bool push[n + 1];
for (int i = 1; i <= n; i++) {
cin >> bot[i];
}
int sum = 1;
while (true) {
if (bot[now] == 2) {
cout << sum;
break;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(NULL);
ios::sync_with_stdio(false);
int n, now = 1;
cin >> n;
int bot[n + 1];
bool push[n + 1] = {false};
for (int i = 1; i <= n; i++) {
cin >> bot[i];
}
int sum = 1;
while (true) {
if (bot[now] == 2) {
cout << sum;
... | [
"variable_declaration.value.change"
] | 1,355,771 | 1,355,772 | u623468376 | cpp |
p03680 | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(NULL);
ios::sync_with_stdio(false);
int n, now = 1;
cin >> n;
int bot[n + 1];
bool push[n + 1];
for (int i = 1; i <= n; i++) {
cin >> bot[i];
}
int sum = 1;
while (true) {
if (bot[now] == 2) {
cout << sum;
break;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(NULL);
ios::sync_with_stdio(false);
int n, now = 1;
cin >> n;
int bot[n + 1];
bool push[n + 1] = {false};
for (int i = 1; i <= n; i++) {
cin >> bot[i];
}
int sum = 1;
while (true) {
if (bot[now] == 2) {
cout << sum;
... | [
"variable_declaration.value.change",
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 1,355,773 | 1,355,772 | u623468376 | cpp |
p03680 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int ind = 1;
int ans = 0;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v.at(i);
}
while (ans <= n) {
ind = v.at(ind - 1);
ans++;
if (ind == 2)
break;
}
if (ans > n)
cout << -1 << endl;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int ind = 1;
int ans = 0;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v.at(i);
}
while (ans <= n) {
ind = v.at(ind - 1);
ans++;
if (ind == 2)
break;
}
if (ans > n) {
cout << -1 << endl;
... | [
"control_flow.branch.else.add"
] | 1,355,786 | 1,355,787 | u836939578 | 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 j = 0;
for (int i = 0; i < N; i++) {
j = vec.at(j) - 1;
if (j == 1) {
break;
}
}
if (j == 1) {
cout << j + 1 << endl;
} ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
int j = 0;
int i = 0;
for (; i < N; i++) {
j = vec.at(j) - 1;
if (j == 1) {
break;
}
}
if (j == 1) {
cout << i + 1 << endl;
... | [
"control_flow.loop.for.remove",
"identifier.change",
"io.output.change"
] | 1,355,788 | 1,355,789 | u096112930 | 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 cnt = 0;
int now = 0;
int success = 0;
for (int i = 0; i < N + 1; i++) {
now = A.at(now) - 1;
cnt++;
if (now == 1) {
cout << cnt <... | #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 cnt = 0;
int now = 0;
int success = 0;
for (int i = 0; i < N + 1; i++) {
now = A.at(now) - 1;
cnt++;
if (now == 1) {
cout << cnt <... | [
"control_flow.break.add"
] | 1,355,790 | 1,355,791 | u726397961 | 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 cnt = 0;
int now = 0;
int success = 0;
for (int i = 0; i < N; i++) {
now = A.at(now) - 1;
cnt++;
if (now == 1) {
cout << cnt << en... | #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 cnt = 0;
int now = 0;
int success = 0;
for (int i = 0; i < N + 1; i++) {
now = A.at(now) - 1;
cnt++;
if (now == 1) {
cout << cnt <... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 1,355,792 | 1,355,791 | u726397961 | cpp |
p03680 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <s... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <s... | [
"identifier.change",
"control_flow.loop.condition.change"
] | 1,355,795 | 1,355,796 | u861345985 | cpp |
p03680 | #include "bits/stdc++.h"
using namespace std;
/*第二引数で第一引数を割ったときの切り上げの計算*/
long long int maxtime(long long int x, long long int y) {
return (x + y - 1) / y;
}
/*最大公約数*/
long long int lcm(long long int number1, long long int number2) {
long long int m = number1;
long long int n = number2;
if (number2 > number1)... | #include "bits/stdc++.h"
using namespace std;
/*第二引数で第一引数を割ったときの切り上げの計算*/
long long int maxtime(long long int x, long long int y) {
return (x + y - 1) / y;
}
/*最大公約数*/
long long int lcm(long long int number1, long long int number2) {
long long int m = number1;
long long int n = number2;
if (number2 > number1)... | [
"literal.number.change",
"io.output.change"
] | 1,355,800 | 1,355,801 | u473116917 | cpp |
p03680 | #define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <stdio.h>
#include <string>
using namespace std;
int main(void) {
int n;
cin >> n;
int a[n];
int b, c, d;
c = 1;
d = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
b = a[0];
for (int i = 0; i < n; i++) {
if (b == 2) {
d = ... | #define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <stdio.h>
#include <string>
using namespace std;
int main(void) {
int n;
cin >> n;
int a[n];
int b, c, d;
c = 1;
d = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
b = a[0];
for (int i = 0; i < n; i++) {
if (b == 2) {
d = ... | [
"assignment.change"
] | 1,355,806 | 1,355,807 | u395634329 | cpp |
p03680 | #define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <stdio.h>
#include <string>
using namespace std;
int main(void) {
int n;
cin >> n;
int a[n];
int b, c, d;
c = 1;
d = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
b = a[0];
for (int i = 0; i < n + 1; i++) {
if (b == 2) {
... | #define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <stdio.h>
#include <string>
using namespace std;
int main(void) {
int n;
cin >> n;
int a[n];
int b, c, d;
c = 1;
d = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
b = a[0];
for (int i = 0; i < n; i++) {
if (b == 2) {
d = ... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 1,355,808 | 1,355,807 | u395634329 | cpp |
p03680 | #define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <stdio.h>
#include <string>
using namespace std;
int main(void) {
int n;
cin >> n;
int a[n];
int b, c, d;
c = 1;
d = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
b = a[0];
for (int i = 0; i < n; i++) {
if (b == 2) {
d = ... | #define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <stdio.h>
#include <string>
using namespace std;
int main(void) {
int n;
cin >> n;
int a[n];
int b, c, d;
c = 1;
d = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
b = a[0];
for (int i = 0; i < n; i++) {
if (b == 2) {
d = ... | [
"control_flow.break.add"
] | 1,355,809 | 1,355,807 | u395634329 | cpp |
p03680 | #define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <stdio.h>
#include <string>
using namespace std;
int main(void) {
int n;
cin >> n;
int a[n];
int b, c, d;
c = 1;
d = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
b = a[0];
for (int i = 0; i < n; i++) {
if (b == 2) {
d = ... | #define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <stdio.h>
#include <string>
using namespace std;
int main(void) {
int n;
cin >> n;
int a[n];
int b, c, d;
c = 1;
d = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
b = a[0];
for (int i = 0; i < n; i++) {
if (b == 2) {
d = ... | [
"assignment.change"
] | 1,355,810 | 1,355,807 | u395634329 | cpp |
p03680 | #include <bits/stdc++.h>
#include <string>
using namespace std;
int sum(vector<int> vec) {
int sum = 0;
for (int i = 0; i < vec.size(); i++) {
if (vec.at(i) == 1) {
sum++;
}
}
return sum;
}
int main() {
int N;
cin >> N;
vector<int> vec(N);
vector<int> memo(N);
for (int i = 0; i < N; i+... | #include <bits/stdc++.h>
#include <string>
using namespace std;
int sum(vector<int> vec) {
int sum = 0;
for (int i = 0; i < vec.size(); i++) {
if (vec.at(i) == 1) {
sum++;
}
}
return sum;
}
int main() {
int N;
cin >> N;
vector<int> vec(N);
vector<int> memo(N);
for (int i = 0; i < N; i+... | [
"control_flow.branch.if.condition.change",
"assignment.change"
] | 1,355,813 | 1,355,814 | u790816087 | cpp |
p03680 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(100);
for (int i; i < n; i++) {
cin >> a.at(i);
}
bool check = false;
int count = 0;
int tmp = a.at(0);
for (int i = 0; i < n; i++) {
count++;
if (tmp == 2) {
check = true;
break;
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(100000);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
}
bool check = false;
int count = 0;
int tmp = a.at(0);
for (int i = 0; i < n; i++) {
count++;
if (tmp == 2) {
check = true;
break;
... | [
"literal.number.change",
"call.arguments.change",
"control_flow.loop.for.initializer.change",
"variable_declaration.value.change"
] | 1,355,822 | 1,355,820 | u644110877 | cpp |
p03680 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(100);
for (int i; i < n; i++) {
cin >> a.at(i);
}
bool check = false;
int count = 0;
int tmp = a.at(0);
for (int i = 0; i < n; i++) {
count++;
if (tmp == 2) {
check = true;
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);
}
bool check = false;
int count = 0;
int tmp = a.at(0);
for (int i = 0; i < n; i++) {
count++;
if (tmp == 2) {
check = true;
break;
}
... | [
"call.arguments.change",
"control_flow.loop.for.initializer.change",
"variable_declaration.value.change"
] | 1,355,822 | 1,355,823 | u644110877 | cpp |
p03680 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int N;
int count = 0;
int lamp = 1;
cin >> N;
vector<int> a(N);
rep(i, N) cin >> a.at(i);
while (lamp == 2) {
lamp = a.at(lamp - 1);
count++;
if (lamp == 2) {
cout << count << endl;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int N;
int count = 0;
int lamp = 1;
cin >> N;
vector<int> a(N);
rep(i, N) cin >> a.at(i);
while (1) {
lamp = a.at(lamp - 1);
count++;
if (lamp == 2) {
cout << count << endl;
br... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.condition.change",
"expression.operation.binary.remove"
] | 1,355,824 | 1,355,825 | u174671936 | cpp |
p03680 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int N;
int count = 0;
int lamp = 1;
cin >> N;
vector<int> a(N);
rep(i, N) cin >> a.at(i);
while (lamp == 2) {
lamp = a.at(lamp);
count++;
if (lamp == 2) {
cout << count << endl;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int N;
int count = 0;
int lamp = 1;
cin >> N;
vector<int> a(N);
rep(i, N) cin >> a.at(i);
while (1) {
lamp = a.at(lamp - 1);
count++;
if (lamp == 2) {
cout << count << endl;
br... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.condition.change",
"expression.operation.binary.remove",
"assignment.change"
] | 1,355,826 | 1,355,825 | u174671936 | 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[i];
}
int ans = 0;
int turn = 1;
while (0 == 0) {
ans++;
turn = a[turn];
if (turn == 2) {
break;
}
if (ans > N * 2) {
ans = -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[i];
}
int ans = 0;
int turn = 1;
while (0 == 0) {
ans++;
turn = a[turn - 1];
if (turn == 2) {
break;
}
if (ans > N * 2) {
ans = -1;
... | [
"assignment.change"
] | 1,355,827 | 1,355,828 | u083494782 | 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[i];
}
int ans = 0;
int turn = 1;
while (0 == 0) {
ans++;
turn = a[turn];
if (a[turn] == 2) {
break;
}
if (ans > N * 2) {
ans = -1;
... | #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[i];
}
int ans = 0;
int turn = 1;
while (0 == 0) {
ans++;
turn = a[turn - 1];
if (turn == 2) {
break;
}
if (ans > N * 2) {
ans = -1;
... | [
"assignment.change",
"control_flow.branch.if.condition.change"
] | 1,355,829 | 1,355,828 | u083494782 | cpp |
p03680 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, cnt = 0, tmp;
cin >> N;
vector<int> Button(N);
for (int i = 0; i < N; i++) {
cin >> Button.at(i);
}
//入力層終わり
for (cnt = 0; cnt < N; cnt++) {
if (cnt == 0)
tmp = 1;
if (tmp == 2) {
break;
}
tmp = Button.... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, cnt = 0, tmp;
cin >> N;
vector<int> Button(N);
for (int i = 0; i < N; i++) {
cin >> Button.at(i);
}
//入力層終わり
for (cnt = 0; cnt < N; cnt++) {
if (cnt == 0)
tmp = 1;
if (tmp == 2) {
break;
}
tmp = Button.... | [
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.remove"
] | 1,355,839 | 1,355,838 | u867529029 | cpp |
p03680 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k = 0, d = 0;
cin >> n;
int a[n + 1];
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
while (d < n + 1) {
d++;
k = a[k];
if (k == 2) {
cout << d;
return 0;
}
}
cout << -1;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k = 1, d = 0;
cin >> n;
int a[n + 1];
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
while (d < n + 1) {
d++;
k = a[k];
if (k == 2) {
cout << d;
return 0;
}
}
cout << -1;
}
| [
"literal.number.change",
"variable_declaration.value.change"
] | 1,355,845 | 1,355,846 | u222643545 | cpp |
p03680 | #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... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 1,355,847 | 1,355,848 | u917049698 | 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 A = vec.at(0);
int B = 0;
int j;
for (j = 0; j < N - 2; j++) {
B++;
if (A == 2) {
break;
}
A = vec.at(A - 1);
}
if (j... | #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 A = vec.at(0);
int B = 0;
int j;
for (j = 0; j < N; j++) {
B++;
if (A == 2) {
break;
}
A = vec.at(A - 1);
}
if (j == ... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 1,355,853 | 1,355,854 | u530865816 | cpp |
p03680 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define pb push_back
#define sort(s) sort(s.begin(), s.end())
#define reverse(s) reverse(s.begin(), s.end())
#define rep(i, n) for (ll(i) = 0; (i) < (n); (i)++)
const ll mod = 1e9 + 7;
//最大公約数
ll gcd(ll a, ll b) { return b ?... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define pb push_back
#define sort(s) sort(s.begin(), s.end())
#define reverse(s) reverse(s.begin(), s.end())
#define rep(i, n) for (ll(i) = 0; (i) < (n); (i)++)
const ll mod = 1e9 + 7;
//最大公約数
ll gcd(ll a, ll b) { return b ?... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,355,855 | 1,355,856 | u584787460 | cpp |
p03680 | // B - Trained? 2017/06/24
#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 ans = 1;
int cnt = 0;
for (int i = 0; i < n;) {
if (a[i] == 2)
break;
i = a[i];
++cnt;
if (cnt == n + 1) {
cout <<... | // B - Trained? 2017/06/24
#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 ans = 1;
int cnt = 0;
for (int i = 1; i <= n;) {
if (a[i - 1] == 2)
break;
i = a[i - 1];
++cnt;
if (cnt == n + 1) {
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change",
"misc.of... | 1,355,872 | 1,355,873 | u699111690 | cpp |
p03680 | // B - Trained? 2017/06/24
#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 ans = 1;
int cnt = 0;
for (int i = 1; i <= n;) {
if (a[i] == 2)
break;
i = a[i];
++cnt;
if (cnt == n + 1) {
cout <... | // B - Trained? 2017/06/24
#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 ans = 1;
int cnt = 0;
for (int i = 1; i <= n;) {
if (a[i - 1] == 2)
break;
i = a[i - 1];
++cnt;
if (cnt == n + 1) {
... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"assignment.change"
] | 1,355,874 | 1,355,873 | u699111690 | cpp |
p03680 | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#incl... | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#incl... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 1,355,879 | 1,355,880 | u043443359 | cpp |
p03680 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> bot(N);
for (int i = 0; i < N; i++)
cin >> bot.at(i);
int a = 1, count = 0;
for (int i = 0; i < N; i++) {
a = bot.at(a);
count++;
if (a == 2)
break;
}
if (count == 0)
count = -1;
co... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> bot(N);
for (int i = 0; i < N; i++)
cin >> bot.at(i);
int a = 1, count = 0;
for (int i = 0; i < N; i++) {
a = bot.at(a - 1);
count++;
if (a == 2)
break;
}
if (a != 2)
count = -1;
co... | [
"assignment.change"
] | 1,355,881 | 1,355,882 | u767614219 | cpp |
p03680 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> botan(N);
for (int i = 0; i < N; i++) {
int a;
cin >> a;
botan.at(i) = a - 1;
}
int sum = 0;
for (int i = 0; i <= N; i++) {
sum = botan.at(sum);
if (sum == 1) {
cout << i + 1 << endl;
} e... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> botan(N);
for (int i = 0; i < N; i++) {
int a;
cin >> a;
botan.at(i) = a - 1;
}
int sum = 0;
for (int i = 0; i <= N; i++) {
sum = botan.at(sum);
if (sum == 1) {
cout << i + 1 << endl;
b... | [
"control_flow.break.add"
] | 1,355,883 | 1,355,884 | u559169025 | cpp |
p03680 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N;
int n = 1;
cin >> N;
vector<int> vec(N);
rep(i, N) { cin >> vec.at(i); }
rep(i, N) {
n = vec.at(n - 1);
if (n == 2) {
cout << i + 1 << endl;
break;
}
if (i == N... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N;
int n = 1;
cin >> N;
vector<int> vec(N);
rep(i, N) { cin >> vec.at(i); }
rep(i, N) {
n = vec.at(n - 1);
if (n == 2) {
cout << i + 1 << endl;
break;
}
if (i == N... | [
"control_flow.branch.if.condition.change"
] | 1,355,886 | 1,355,887 | u564204618 | cpp |
p03680 | #include <bits/stdc++.h>
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define all(x) (x).begin(), (x).end()
#define PRINT(V) cout << V << "\n"
#define SORT(V... | #include <bits/stdc++.h>
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define all(x) (x).begin(), (x).end()
#define PRINT(V) cout << V << "\n"
#define SORT(V... | [
"literal.number.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 1,355,888 | 1,355,889 | u892687772 | cpp |
p03680 | #include <bits/stdc++.h>
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define all(x) (x).begin(), (x).end()
#define PRINT(V) cout << V << "\n"
#define SORT(V... | #include <bits/stdc++.h>
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define all(x) (x).begin(), (x).end()
#define PRINT(V) cout << V << "\n"
#define SORT(V... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 1,355,890 | 1,355,889 | u892687772 | cpp |
p03680 | #include <iostream>
using namespace std;
main(void) {
int n, c = 0;
cin >> n;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < n;) {
if (a[i] == 2) {
cout << c;
return 0;
} else if (c > n) {
cout << -1;
return 0;
} else {
i = a[i] - 1;
... | #include <iostream>
using namespace std;
main(void) {
int n, c = 1;
cin >> n;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < n;) {
if (a[i] == 2) {
cout << c;
return 0;
} else if (c > n) {
cout << -1;
return 0;
} else {
i = a[i] - 1;
... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,355,894 | 1,355,895 | u467710662 | cpp |
p03680 | #include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORR(i, a, b) for (ll i = (a); i <= (b); i++)
#define repR(i, n) for (ll i = n; i >= 0; i--... | #include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORR(i, a, b) for (ll i = (a); i <= (b); i++)
#define repR(i, n) for (ll i = n; i >= 0; i--... | [
"literal.number.change",
"variable_declaration.value.change",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 1,355,900 | 1,355,901 | u103850114 | cpp |
p03680 | // https://atcoder.jp/contests/abc065/tasks/abc065_b
#define CIN_ONLY
#define DECIMAL_DIGITS 10
#define STATIC_MOD 1e9 + 7
#ifdef BTK
/*<head>*/
#include "Template.hpp"
/*</head>*/
#else
/*<body>*/
/* #region auto includes */
/* #region stl */
/*<stl>*/
#include <bits/stdc++.h>
#include <sys/types.h>
#include <unistd.... | // https://atcoder.jp/contests/abc065/tasks/abc065_b
#define CIN_ONLY
#define DECIMAL_DIGITS 10
#define STATIC_MOD 1e9 + 7
#ifdef BTK
/*<head>*/
#include "Template.hpp"
/*</head>*/
#else
/*<body>*/
/* #region auto includes */
/* #region stl */
/*<stl>*/
#include <bits/stdc++.h>
#include <sys/types.h>
#include <unistd.... | [] | 1,355,902 | 1,355,903 | u613658617 | cpp |
p03680 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int n, temp, ans = -1;
cin >> n;
vector<int> a(n);
rep(i, n) {
cin >> temp;
a.at(i) = temp - 1;
}
temp = 0;
rep(i, n) {
if (temp == 1) {
ans = i + 1;
break;
}
temp = a.... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int n, temp, ans = -1;
cin >> n;
vector<int> a(n);
rep(i, n) {
cin >> temp;
a.at(i) = temp - 1;
}
temp = 0;
rep(i, n) {
if (temp == 1) {
ans = i;
break;
}
temp = a.at(t... | [
"expression.operation.binary.remove"
] | 1,355,904 | 1,355,905 | u675751622 | cpp |
p03680 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int n, temp, ans = -1;
cin >> n;
vector<int> a(n);
rep(i, n) {
cin >> temp;
a.at(i) = temp - 1;
}
temp = 0;
rep(i, n) {
if (temp == 2) {
ans = i + 1;
break;
}
temp = a.... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int n, temp, ans = -1;
cin >> n;
vector<int> a(n);
rep(i, n) {
cin >> temp;
a.at(i) = temp - 1;
}
temp = 0;
rep(i, n) {
if (temp == 1) {
ans = i;
break;
}
temp = a.at(t... | [
"literal.number.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 1,355,906 | 1,355,905 | u675751622 | cpp |
p03680 | #include <iostream>
using namespace std;
int main(void) {
int n;
cin >> n;
int b[n];
for (int i = 0; i < n; i++) {
cin >> b[i];
}
int now = 1;
int min = -1;
for (int i = 0; i < n; i++) {
now = b[now];
if (now == 2) {
min = i + 1;
i = n;
}
}
cout << min << endl;
r... | #include <iostream>
using namespace std;
int main(void) {
int n;
cin >> n;
int b[n];
for (int i = 0; i < n; i++) {
cin >> b[i];
}
int now = 0;
int min = -1;
for (int i = 0; i < n; i++) {
now = b[now] - 1;
if (now == 1) {
min = i + 1;
i = n;
}
}
cout << min << endl;
... | [
"literal.number.change",
"variable_declaration.value.change",
"assignment.change",
"control_flow.branch.if.condition.change"
] | 1,355,907 | 1,355,908 | u050947191 | cpp |
p03680 | #include <bits/stdc++.h>
#define FOR(i, begin, end) for (int i = (begin); i < (end); i++)
#define REP(i, n) FOR(i, 0, n)
#define IFOR(i, begin, end) for (int i = (begin); i > (end); i--)
#define IREP(i, n) IFOR(i, 0, n)
#define SORT(a) sort(a.begin(), a.end())
#define REVERSE(a) reverse(a.begin(), a.end())
#define pb ... | #include <bits/stdc++.h>
#define FOR(i, begin, end) for (int i = (begin); i < (end); i++)
#define REP(i, n) FOR(i, 0, n)
#define IFOR(i, begin, end) for (int i = (begin); i > (end); i--)
#define IREP(i, n) IFOR(i, 0, n)
#define SORT(a) sort(a.begin(), a.end())
#define REVERSE(a) reverse(a.begin(), a.end())
#define pb ... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"identifier.replace.add",
"literal.replace.remove"
] | 1,355,926 | 1,355,927 | u973797979 | cpp |
p03680 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
//ボタン情報をえる
vector<int> button(N);
for (int i = 0; i < N; i++) {
cin >> button.at(i);
}
//押していく
int A = 1;
for (int i = 0; i < N; i++) {
A = button.at(A);
if (A == 2) {
cout << -1 << endl;
break;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
//ボタン情報をえる
vector<int> button(N);
for (int i = 0; i < N; i++) {
cin >> button.at(i);
}
//押していく
int A = 1;
for (int i = 0; i < N; i++) {
A = button.at(A - 1);
if (A == 2) {
cout << i + 1 << endl;
brea... | [
"assignment.change",
"identifier.replace.add",
"literal.replace.remove",
"io.output.change",
"identifier.replace.remove",
"literal.replace.add"
] | 1,355,928 | 1,355,929 | u701231431 | cpp |
p03680 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n], b[n] = {}, i = 0, j = 1;
while (cin >> a[i])
i++;
i = 0;
while (a[i] != 2) {
if (b[i] == 1) {
i = -1;
break;
}
b[i] = 1;
i = a[i] - 1;
j++;
}
cout << j;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n], b[n] = {}, i = 0, j = 1;
while (cin >> a[i])
i++;
i = 0;
while (a[i] != 2) {
if (b[i] == 1) {
j = -1;
break;
}
b[i] = 1;
i = a[i] - 1;
j++;
}
cout << j;
} | [
"assignment.variable.change",
"identifier.change"
] | 1,355,942 | 1,355,943 | u018372223 | cpp |
p03680 | //そもそも2があるかどうか、
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
int count = 1;
int j = 0;
while (true) {
if (vec.at(j) == 2 || count == N)
break;
else {
j = vec.at(j);
count... | //そもそも2があるかどうか、
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
int count = 1;
int j = 0;
while (true) {
if (vec.at(j) == 2 || count == N)
break;
else {
j = vec.at(j) - 1;
c... | [
"assignment.change",
"expression.operation.binary.remove"
] | 1,355,952 | 1,355,953 | u855378574 | cpp |
p03680 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a[110000];
cin >> n;
for (int i = 1; i < n; i++)
cin >> a[i];
int t = a[1], cnt = 1;
for (int i = 0; i < n; i++) {
if (t == 2) {
cout << cnt;
return 0;
}
t = a[t];
cnt++;
}
cout << "-1";
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a[110000];
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
int t = a[1], cnt = 1;
for (int i = 0; i < n; i++) {
if (t == 2) {
cout << cnt;
return 0;
}
t = a[t];
cnt++;
}
cout << "-1";
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,355,955 | 1,355,956 | u639300218 | 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 button = 1;
int count = 0;
for (int j = 0; j < N; j++) {
button = a.at(button - 1);
count++;
if (button == 2) {
cout << count << endl;
... | #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 button = 1;
int count = 0;
for (int j = 0; j < N + 10; j++) {
button = a.at(button - 1);
count++;
if (button == 2) {
cout << count << e... | [
"control_flow.loop.for.condition.change"
] | 1,355,959 | 1,355,960 | u938025024 | 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 button = 1;
int count = 0;
for (int j = 0; j < N + 10; j++) {
button = a.at(button - 1);
count++;
if (button == 2) {
cout << count << e... | #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 button = 1;
int count = 0;
for (int j = 0; j < N + 10; j++) {
button = a.at(button - 1);
count++;
if (button == 2) {
cout << count << e... | [
"control_flow.loop.for.condition.change"
] | 1,355,961 | 1,355,960 | u938025024 | 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 button = 1;
int count = 0;
for (int j = 0; j < N + 10; j++) {
button = a.at(button - 1);
count++;
if (button == 2) {
cout << count << e... | #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 button = 1;
int count = 0;
for (int j = 0; j < N + 10; j++) {
button = a.at(button - 1);
count++;
if (button == 2) {
cout << count << e... | [
"control_flow.loop.for.condition.change"
] | 1,355,963 | 1,355,960 | u938025024 | cpp |
p03680 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int a = 1, b = 0;
cin >> N;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
while (true) {
a = vec.at(a);
b += 1;
if (a == 2) {
cout << b << endl;
break;
}
if (b >= N) {
cout ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int a = 1, b = 0;
cin >> N;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
while (true) {
a = vec.at(a - 1);
b += 1;
if (a == 2) {
cout << b << endl;
break;
}
if (b >= N) {
c... | [
"assignment.change"
] | 1,355,975 | 1,355,976 | u688571051 | cpp |
p03680 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n, i, a[100000], b[100000], k, cnt;
int main() {
for (cin >> n; i < n; i++)
cin >> a[i];
while (true) {
k = a[k] - 1;
cnt++;
b[k]++;
if (b[k] > 1)
cout << -1 << endl;
break;
if (k == 1)
cout << cnt << endl... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n, i, a[100000], b[100000], k, cnt;
int main() {
for (cin >> n; i < n; i++)
cin >> a[i];
while (true) {
k = a[k] - 1;
cnt++;
b[k]++;
if (b[k] > 1) {
cout << -1 << endl;
break;
}
if (k == 1) {
cout <<... | [] | 1,355,978 | 1,355,979 | u303621502 | 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.at(i);
}
vector<int> W(N, 0);
W.at(0) = 1;
int t = 0;
for (int i = 0; i < N - 1; i++) {
W.at(i + 1) = V.at(W.at(i) - 1);
if (W.at(i) == 2) {
t = 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.at(i);
}
vector<int> W(N + 1, 0);
W.at(0) = 1;
int t = 0;
for (int i = 0; i < N; i++) {
W.at(i + 1) = V.at(W.at(i) - 1);
if (W.at(i) == 2) {
t = 1;
... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 1,355,986 | 1,355,987 | u730960654 | 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.at(i);
}
vector<int> W(N, 0);
W.at(0) = 1;
int t = 0;
for (int i = 0; i < N; i++) {
W.at(i + 1) = V.at(W.at(i) - 1);
if (W.at(i) == 2) {
t = 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.at(i);
}
vector<int> W(N + 1, 0);
W.at(0) = 1;
int t = 0;
for (int i = 0; i < N; i++) {
W.at(i + 1) = V.at(W.at(i) - 1);
if (W.at(i) == 2) {
t = 1;
... | [
"assignment.change"
] | 1,355,988 | 1,355,987 | u730960654 | 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 x = 1;
int sum = 0;
while (x != 2) {
x = vec.at(x - 1);
sum++;
if (sum == 100) {
break;
}
}
if (sum == 100) {
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 x = 1;
int sum = 0;
while (x != 2) {
x = vec.at(x - 1);
sum++;
if (sum == 100000) {
break;
}
}
if (sum == 100000) {
... | [
"literal.number.change",
"control_flow.branch.if.condition.change",
"identifier.change",
"io.output.change"
] | 1,355,991 | 1,355,990 | u898554892 | cpp |
p03680 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,355,996 | 1,355,997 | u631558039 | 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 tmp = 0;
int cnt = 0;
bool flag = true;
while (flag) {
tmp = a.at(tmp);
cnt++;
if (cnt == n || tmp == 1)
flag = false;
}
if (tmp == 1... | #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 tmp = 0;
int cnt = 0;
bool flag = true;
while (flag) {
tmp = a.at(tmp) - 1;
cnt++;
if (cnt == n || tmp == 1)
flag = false;
}
if (tmp ... | [
"assignment.change"
] | 1,356,003 | 1,356,004 | u513850599 | cpp |
p03680 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, sum, vek;
cin >> N;
sum = 0;
vek = 1;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
for (int i = 0;; i++) {
if (sum < N) {
if (vek != 2) {
vek = vec.at(vek);
sum++;
} else {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, sum, vek;
cin >> N;
sum = 0;
vek = 1;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
for (int i = 0;; i++) {
if (sum < N) {
if (vek != 2) {
vek = vec.at(vek - 1);
sum++;
} else... | [
"assignment.change"
] | 1,356,010 | 1,356,011 | u274883254 | cpp |
p03680 | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define fo(a, b) for (int a = 0; a < b; a++)
#define Sort(a) sort(a.begin(), a.end())
#define rev(a) reverse(a.begin(), a.end())
#define fi first
#define se second
#define pb push_back
#define pp() pop_ba... | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define fo(a, b) for (int a = 0; a < b; a++)
#define Sort(a) sort(a.begin(), a.end())
#define rev(a) reverse(a.begin(), a.end())
#define fi first
#define se second
#define pb push_back
#define pp() pop_ba... | [
"expression.operation.binary.add"
] | 1,356,016 | 1,356,017 | u790461875 | cpp |
p03680 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define _USE_MATH_DEFINES
#include <assert.h>
#include <bitset>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#in... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define _USE_MATH_DEFINES
#include <assert.h>
#include <bitset>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#in... | [
"expression.operation.binary.remove"
] | 1,356,021 | 1,356,022 | u317177661 | 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[i];
int i = 0;
for (int total = 0; total < n; total++) {
if (a[i] == 2) {
total++;
cout << total << endl;
return 0;
}
if (a[i] != 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[i];
int i = 0;
for (int total = 0; total < n; total++) {
if (a[i] == 2) {
total++;
cout << total << endl;
return 0;
}
if (a[i] != i + 1) {
... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 1,356,037 | 1,356,038 | u520146174 | cpp |
p03680 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A[100000];
cin >> N;
for (int i = 0; i < N; i++) {
cin >> A[i];
}
int num[100000] = {0};
int t = 1;
for (int i = 0; i < N; ++i) {
num[t]++;
if (num[t] >= 2) {
cout << -1 << endl;
break;
}
t = A[t];
if (t... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A[100000];
cin >> N;
for (int i = 0; i < N; i++) {
cin >> A[i];
}
int num[100000] = {0};
int t = 1;
for (int i = 0; i < N; ++i) {
num[t]++;
if (num[t] >= 2) {
cout << -1 << endl;
break;
}
t = A[t - 1];
i... | [
"assignment.change"
] | 1,356,042 | 1,356,040 | u526894223 | cpp |
p03680 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A[100000];
cin >> N;
for (int i = 0; i < N; i++) {
cin >> A[i];
}
int num[100000] = {0};
int t = 1;
for (int i = 0; i < N; ++i) {
num[t]++;
if (num[t] >= 2) {
cout << -1 << endl;
break;
}
t = A[t];
if (t... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A[100000];
cin >> N;
for (int i = 0; i < N; i++) {
cin >> A[i];
}
int num[100000] = {0};
int t = 1;
for (int i = 0; i < N; ++i) {
num[t]++;
if (num[t] >= 2) {
cout << -1 << endl;
break;
}
t = A[t - 1];
i... | [
"assignment.change"
] | 1,356,043 | 1,356,040 | u526894223 | cpp |
p03680 | #include <cstdio>
bool c[100000];
int main() {
int b[100000];
int n;
scanf("%d", &n);
for (int i = 0; i < n; ++i) {
scanf("%d", b + i);
}
int ans = 1;
for (int i = 0; !c[i]; i = b[i] - 1, ++ans) {
c[i] = true;
if (b[i] == 2) {
printf("%d\n", i);
return 0;
}
}
puts("-1");... | #include <cstdio>
bool c[100000];
int main() {
int b[100000];
int n;
scanf("%d", &n);
for (int i = 0; i < n; ++i) {
scanf("%d", b + i);
}
int ans = 1;
for (int i = 0; !c[i]; i = b[i] - 1, ++ans) {
c[i] = true;
if (b[i] == 2) {
printf("%d\n", ans);
return 0;
}
}
puts("-1"... | [
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 1,356,045 | 1,356,046 | u931819817 | 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 button = 1;
for (int i = 0; i < N; i++) {
button = a[button];
if (button == 2) {
cout << i + 1;
return 0;
}
}
cout << -1 << 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 button = 1;
for (int i = 0; i < N; i++) {
button = a[button - 1];
if (button == 2) {
cout << i + 1;
return 0;
}
}
cout << -1 << endl;
return 0;
}... | [
"assignment.change"
] | 1,356,049 | 1,356,050 | u660112829 | 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 x = 1;
int a = 0, b = 0;
for (int j = 0; j < N; ++j) {
x = vec.at(x - 1);
if (x == 2) {
a = 1;
b = j + 1;
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) {
cin >> vec.at(i);
}
int x = 1;
int a = 0, b = 0;
for (int j = 0; j < N; ++j) {
x = vec.at(x - 1);
if (x == 2) {
a = 1;
b = j + 1;
break;
}
}
... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 1,356,051 | 1,356,052 | u042113240 | 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 x = 0;
int a = 0, b = 0;
for (int j = 0; j < N; ++j) {
x = vec.at(x - 1);
if (x == 2) {
a = 1;
b = j + 1;
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) {
cin >> vec.at(i);
}
int x = 1;
int a = 0, b = 0;
for (int j = 0; j < N; ++j) {
x = vec.at(x - 1);
if (x == 2) {
a = 1;
b = j + 1;
break;
}
}
... | [
"literal.number.change",
"variable_declaration.value.change",
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 1,356,053 | 1,356,052 | u042113240 | 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 x = 0;
int a = 0, b = 0;
for (int j = 0; j < N; ++j) {
x = vec.at(x);
if (x == 2) {
a = 1;
b = j + 1;
break;
}
}
if... | #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 x = 1;
int a = 0, b = 0;
for (int j = 0; j < N; ++j) {
x = vec.at(x - 1);
if (x == 2) {
a = 1;
b = j + 1;
break;
}
}
... | [
"literal.number.change",
"variable_declaration.value.change",
"assignment.change",
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 1,356,054 | 1,356,052 | u042113240 | cpp |
p03680 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int count = 0;
int temp0 = 1;
int temp1 = 1;
cin >> N;
vector<int> a(N);
for (int i = 0; i < N; i++) {
cin >> a.at(i);
}
while (temp1 != -1 || temp1 != 2) {
temp1 = a.at(temp0 - 1);
a.at(temp0 - 1) = -1;
temp0 = temp1;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int count = 0;
int temp0 = 1;
int temp1 = 1;
cin >> N;
vector<int> a(N);
for (int i = 0; i < N; i++) {
cin >> a.at(i);
}
while (temp1 != -1 && temp1 != 2) {
temp1 = a.at(temp0 - 1);
a.at(temp0 - 1) = -1;
temp0 = temp1;
... | [
"misc.opposites",
"control_flow.loop.condition.change"
] | 1,356,055 | 1,356,056 | u737370221 | cpp |
p03680 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int count = 0;
int temp0 = 1;
int temp1 = 1;
cin >> N;
vector<int> a(N);
for (int i = 0; i < N; i++) {
cin >> a.at(i);
}
while (temp1 != -1 || temp1 != 2) {
temp1 = a.at(temp0);
a.at(temp0) = -1;
temp0 = temp1;
coun... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int count = 0;
int temp0 = 1;
int temp1 = 1;
cin >> N;
vector<int> a(N);
for (int i = 0; i < N; i++) {
cin >> a.at(i);
}
while (temp1 != -1 && temp1 != 2) {
temp1 = a.at(temp0 - 1);
a.at(temp0 - 1) = -1;
temp0 = temp1;
... | [
"misc.opposites",
"control_flow.loop.condition.change",
"assignment.change"
] | 1,356,058 | 1,356,056 | u737370221 | 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 i = 1;
int cnt = 0;
bool b = false;
while (cnt < n) {
cnt++;
i = a.at(i - 1);
if (i == n - 1) {
b = true;
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 i = 1;
int cnt = 0;
bool b = false;
while (cnt < n) {
cnt++;
i = a.at(i - 1);
if (i == 2) {
b = true;
break;
}
}
if (... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 1,356,059 | 1,356,060 | u215743476 | cpp |
p03680 | #include <bits/stdc++.h>
#define REPI(i, n) for (int i = 0; i < n; i++)
#define REPJ(j, n) for (int j = 0; j < n; j++)
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> vc;
REPI(i, n) {
int x;
cin >> x;
vc.push_back(x);
}
int a = 0;
... | #include <bits/stdc++.h>
#define REPI(i, n) for (int i = 0; i < n; i++)
#define REPJ(j, n) for (int j = 0; j < n; j++)
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> vc;
REPI(i, n) {
int x;
cin >> x;
vc.push_back(x);
}
int a = 0;
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 1,356,061 | 1,356,062 | u505466816 | cpp |
p03680 | #include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <numeric>
#include <queue>
#include <sstream>
#include <string.h>
#include <string>
#include <tuple>
#include <vector>
#define REP(i, x) for (int i{0}; i < (int)(x); i++)
#define REPC(i, x) for (int i{0}; i <= (int)(x); i++)
#define RR... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <numeric>
#include <queue>
#include <sstream>
#include <string.h>
#include <string>
#include <tuple>
#include <vector>
#define REP(i, x) for (int i{0}; i < (int)(x); i++)
#define REPC(i, x) for (int i{0}; i <= (int)(x); i++)
#define RR... | [
"identifier.change",
"call.function.change"
] | 1,356,067 | 1,356,068 | u815659544 | cpp |
p03680 | #include <bits/stdc++.h>
#define loop(i, n) for (int i = 0; i < int(n); i++)
#define rep(i, begin, end) for (int i = int(begin); i < int(end); i++)
using namespace std;
int main() {
int N, next = 0;
cin >> N;
vector<int> btn(N);
loop(i, N) cin >> btn.at(i);
loop(i, N) {
next = btn.at(next);
if (nex... | #include <bits/stdc++.h>
#define loop(i, n) for (int i = 0; i < int(n); i++)
#define rep(i, begin, end) for (int i = int(begin); i < int(end); i++)
using namespace std;
int main() {
int N, next = 1;
cin >> N;
vector<int> btn(N);
loop(i, N) cin >> btn.at(i);
loop(i, N) {
next = btn.at(next - 1);
if ... | [
"literal.number.change",
"variable_declaration.value.change",
"assignment.change",
"io.output.change"
] | 1,356,069 | 1,356,070 | u007207224 | cpp |
p03680 | #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> l(n), r(n);
rep(i, n) { cin >> l.at(i); }
r.at(0) = l.at(0);
if (l.at(0) == 2) {
cout << 2;
return 0;
}
int min = 1;
for (int j = 1; j < n; j++) {
r.... | #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> l(n), r(n);
rep(i, n) { cin >> l.at(i); }
r.at(0) = l.at(0);
if (l.at(0) == 2) {
cout << 1;
return 0;
}
int min = 1;
for (int j = 1; j < n; j++) {
r.... | [
"literal.number.change",
"io.output.change"
] | 1,356,071 | 1,356,072 | u747427153 | cpp |
p03680 | #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> l(n), r(n);
rep(i, n) { cin >> l.at(i); }
r.at(0) = l.at(0);
if (l.at(0) == 2) {
cout << 2;
return 0;
}
int min = 1;
for (int j = 1; j < n; j++) {
r.... | #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> l(n), r(n);
rep(i, n) { cin >> l.at(i); }
r.at(0) = l.at(0);
if (l.at(0) == 2) {
cout << 1;
return 0;
}
int min = 1;
for (int j = 1; j < n; j++) {
r.... | [
"literal.number.change",
"io.output.change",
"assignment.change"
] | 1,356,073 | 1,356,072 | u747427153 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.