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 |
|---|---|---|---|---|---|---|---|
p03679 | #include <cstdio>
#include <iostream>
int main(void) {
std::int64_t X, A, B;
std::cin >> X;
std::cin >> A;
std::cin >> B;
if (B < A) {
std::cout << "delicious" << std::endl;
return 0;
} else if (B < A + X) {
std::cout << "safe" << std::endl;
return 0;
} else {
std::cout << "dangerous... | #include <cstdio>
#include <iostream>
int main(void) {
std::int64_t X, A, B;
std::cin >> X;
std::cin >> A;
std::cin >> B;
if (B <= A) {
std::cout << "delicious" << std::endl;
return 0;
} else if (B <= A + X) {
std::cout << "safe" << std::endl;
return 0;
} else {
std::cout << "dangero... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,354,831 | 1,354,832 | u235516118 | cpp |
p03679 | #include <cstdio>
#include <iostream>
int main(void) {
std::int64_t X, A, B;
std::cin >> X;
std::cin >> A;
std::cin >> B;
if (B < A) {
std::cout << "deliciious" << std::endl;
return 0;
} else if (B < A + X) {
std::cout << "safe" << std::endl;
return 0;
} else {
std::cout << "dangerou... | #include <cstdio>
#include <iostream>
int main(void) {
std::int64_t X, A, B;
std::cin >> X;
std::cin >> A;
std::cin >> B;
if (B <= A) {
std::cout << "delicious" << std::endl;
return 0;
} else if (B <= A + X) {
std::cout << "safe" << std::endl;
return 0;
} else {
std::cout << "dangero... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"expression.operation.binary.change"
] | 1,354,833 | 1,354,832 | u235516118 | cpp |
p03679 | // #define _CRT_SECURE_NO_WARNINGS
// #define _USE_MATH_DEFINES // M_PI=3.1415...
#include <algorithm>
#include <bitset> // bitset<8> bs1(131uL); // 10000011 bs1[0]は1 01stringからビット集合生成可
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iomanip> // 20桁出力 cout << setp... | // #define _CRT_SECURE_NO_WARNINGS
// #define _USE_MATH_DEFINES // M_PI=3.1415...
#include <algorithm>
#include <bitset> // bitset<8> bs1(131uL); // 10000011 bs1[0]は1 01stringからビット集合生成可
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iomanip> // 20桁出力 cout << setp... | [
"literal.string.change",
"assignment.value.change"
] | 1,354,834 | 1,354,835 | u211964883 | cpp |
p03679 | #include <cstdint>
#include <iostream>
using namespace std;
int32_t main() {
int32_t x, a, b;
cin >> x >> a >> b;
if (b <= a)
cout << "delicious" << endl;
else if (b <= (a + x))
cout << "dangerous" << endl;
else
cout << "safe" << endl;
return 0;
}
| #include <cstdint>
#include <iostream>
using namespace std;
int32_t main() {
int32_t x, a, b;
cin >> x >> a >> b;
if (b <= a)
cout << "delicious" << endl;
else if (b <= (a + x))
cout << "safe" << endl;
else
cout << "dangerous" << endl;
return 0;
}
| [
"control_flow.branch.else.remove",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 1,354,839 | 1,354,840 | u802614675 | cpp |
p03679 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <vector>
using namespace std;
int main() {
int a, b, x;
cin >> x >> a >> b;
if (b - a <= 0)
cout << "delicious" << endl;
else if (b - a >... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <vector>
using namespace std;
int main() {
int a, b, x;
cin >> x >> a >> b;
if (b - a <= 0)
cout << "delicious" << endl;
else if (b - a >... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,354,847 | 1,354,848 | u300752229 | cpp |
p03679 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <vector>
using namespace std;
int main() {
int a, b, x;
cin >> x >> a >> b;
if (b - a < 0)
cout << "delicious" << endl;
else if (b - a > ... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <vector>
using namespace std;
int main() {
int a, b, x;
cin >> x >> a >> b;
if (b - a <= 0)
cout << "delicious" << endl;
else if (b - a >... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,354,849 | 1,354,848 | u300752229 | cpp |
p03679 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <vector>
using namespace std;
int main() {
int a, b, x;
cin >> x >> a >> b;
if (b - a < 0)
cout << "delicious" << endl;
else if (b - a > ... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <vector>
using namespace std;
int main() {
int a, b, x;
cin >> x >> a >> b;
if (b - a <= 0)
cout << "delicious" << endl;
else if (b - a >... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"io.output.change"
] | 1,354,850 | 1,354,848 | u300752229 | cpp |
p03679 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <vector>
using namespace std;
int main() {
int a, b, x;
cin >> x >> a >> b;
if (b - a < 0)
cout << "delicious" << endl;
else if (b - a >=... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <vector>
using namespace std;
int main() {
int a, b, x;
cin >> x >> a >> b;
if (b - a <= 0)
cout << "delicious" << endl;
else if (b - a >... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"io.output.change"
] | 1,354,851 | 1,354,848 | u300752229 | cpp |
p03679 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <vector>
using namespace std;
int main() {
int a, b, x;
cin >> x >> a >> b;
if (b - a < 0)
cout << "delicious" << endl;
else if (b - a > ... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <vector>
using namespace std;
int main() {
int a, b, x;
cin >> x >> a >> b;
if (b - a <= 0)
cout << "delicious" << endl;
else if (b - a >... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"io.output.change"
] | 1,354,852 | 1,354,848 | u300752229 | cpp |
p03679 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
using namespace std;
int main() {
int X, A, B;
while (~scanf("%d%d%d", &X, &A, &B)) {
if (B < A)
printf("delicious\n");
else if (X + A >= B)
printf("safe\n");
else
printf("... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
using namespace std;
int main() {
int X, A, B;
while (~scanf("%d%d%d", &X, &A, &B)) {
if (B <= A)
printf("delicious\n");
else if (X + A >= B)
printf("safe\n");
else
printf(... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,354,857 | 1,354,858 | u489346725 | cpp |
p03679 | #include <iostream>
using namespace std;
//↑デフォルト文
int main() {
int x, a, b;
cin >> x >> a >> b;
/*
x=4 a=3 b=6の場合
賞味期限4日切れOK
5日以上はout
賞味期限3日前に買ってきて,6日後に食べた
賞味期限きれた三日目に食べたためセーフ
*/
if (-a + b <= 0) {
/*if文で一番最初にだすのは'delicious'
2番目'safe',最後に'dangerous'*/
cout << "dangerous" << endl;
}... | #include <iostream>
using namespace std;
//↑デフォルト文
int main() {
int x, a, b;
cin >> x >> a >> b;
/*
x=4 a=3 b=6の場合
賞味期限4日切れOK
5日以上はout
賞味期限3日前に買ってきて,6日後に食べた
賞味期限きれた三日目に食べたためセーフ
*/
if (-a + b <= 0) {
/*if文で一番最初にだすのは'delicious'
2番目'safe',最後に'dangerous'*/
cout << "delicious" << endl;
}... | [
"literal.string.change",
"io.output.change"
] | 1,354,859 | 1,354,860 | u905454963 | cpp |
p03679 | #include <stdio.h>
int main(void) {
int a;
int b;
int x;
int c;
scanf("%d%d%d", &x, &a, &b);
c = b - a;
if (x > c) {
printf("dangerous");
} else if (c <= 0) {
printf("delicious");
} else {
printf("safe");
}
} | #include <stdio.h>
int main(void) {
int a;
int b;
int x;
int c;
scanf("%d%d%d", &x, &a, &b);
c = b - a;
if (x < c) {
printf("dangerous");
} else if (c <= 0) {
printf("delicious");
} else {
printf("safe");
}
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,354,861 | 1,354,862 | u256692239 | cpp |
p03679 | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#incl... | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#incl... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,354,863 | 1,354,864 | u003873207 | cpp |
p03679 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int x, a, b;
cin >> x >> a >> b;
if (b <= a)
cout << "delicous" << endl;
else if (b > a && b <= a + x)
cout << "safe" << endl;
else
cout << "dangerous" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int x, a, b;
cin >> x >> a >> b;
if (b <= a)
cout << "delicious" << endl;
else if (b > a && b <= a + x)
cout << "safe" << endl;
else
cout << "dangerous" << endl;
return 0;
} | [
"literal.string.change",
"io.output.change"
] | 1,354,867 | 1,354,868 | u962598225 | cpp |
p03679 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = (0); (i) < (int)(n); ++(i))
using ll = long long;
using P = pair<int, int>;
int main() {
int x, a, b;
cin >> x >> a >> b;
if (a >= b)
cout << "delicious" << endl;
else {
if (b - a <= x + 1)
cout << "safe" << endl;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = (0); (i) < (int)(n); ++(i))
using ll = long long;
using P = pair<int, int>;
int main() {
int x, a, b;
cin >> x >> a >> b;
if (a >= b)
cout << "delicious" << endl;
else {
if (b - a <= x)
cout << "safe" << endl;
els... | [
"expression.operation.binary.remove"
] | 1,354,874 | 1,354,875 | u482544950 | cpp |
p03679 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = (0); (i) < (int)(n); ++(i))
using ll = long long;
using P = pair<int, int>;
int main() {
int x, a, b;
cin >> x >> a >> b;
if (a > b)
cout << "delicious" << endl;
else {
if (b - a <= x)
cout << "safe" << endl;
else... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = (0); (i) < (int)(n); ++(i))
using ll = long long;
using P = pair<int, int>;
int main() {
int x, a, b;
cin >> x >> a >> b;
if (a >= b)
cout << "delicious" << endl;
else {
if (b - a <= x)
cout << "safe" << endl;
els... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,354,876 | 1,354,875 | u482544950 | cpp |
p03679 | #include <bits/stdc++.h>
using namespace std;
int main() {
int x, a, b;
string ans;
cin >> x >> a >> b;
if (a >= b)
ans = "delicious";
else if (b - a < x)
ans = "safe";
else
ans = "dangerous";
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int x, a, b;
string ans;
cin >> x >> a >> b;
if (a >= b)
ans = "delicious";
else if (b - a < x + 1)
ans = "safe";
else
ans = "dangerous";
cout << ans << endl;
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 1,354,877 | 1,354,878 | u798086274 | cpp |
p03679 | #include <stdio.h>
int main() {
int X;
int A;
int B;
scanf("%d", &X);
scanf("%d", &A);
scanf("%d", &B);
if (A >= B) {
printf("delicious\n");
} else if (X >= B - A) {
printf("safe\n");
} else {
printf("dangeraous\n");
}
return 0;
} | #include <stdio.h>
int main() {
int X;
int A;
int B;
scanf("%d", &X);
scanf("%d", &A);
scanf("%d", &B);
if (A >= B) {
printf("delicious\n");
} else if (X >= B - A) {
printf("safe\n");
} else {
printf("dangerous\n");
}
return 0;
} | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 1,354,906 | 1,354,907 | u822450402 | cpp |
p03679 | #include <stdio.h>
int main() {
int X;
int A;
int B;
scanf("%d", &X);
scanf("%d", &A);
scanf("%d", &B);
if (A > B) {
printf("delicious");
} else if (X >= B - A) {
printf("safe");
} else {
printf("dangeraous");
}
return 0;
} | #include <stdio.h>
int main() {
int X;
int A;
int B;
scanf("%d", &X);
scanf("%d", &A);
scanf("%d", &B);
if (A >= B) {
printf("delicious\n");
} else if (X >= B - A) {
printf("safe\n");
} else {
printf("dangerous\n");
}
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"call.arguments.change",
"io.output.change",
"io.output.newline.add"
] | 1,354,908 | 1,354,907 | u822450402 | cpp |
p03679 | // 065A
#include <iostream>
using namespace std;
int main() {
int X, A, B;
cin >> X >> A >> B;
if (B - A >= 0)
cout << "delicious";
else if (X - (B - A) >= 0)
cout << "safe";
else
cout << "dangerous";
return 0;
} | // 065A
#include <iostream>
using namespace std;
int main() {
int X, A, B;
cin >> X >> A >> B;
if (B - A <= 0)
cout << "delicious";
else if (X - (B - A) >= 0)
cout << "safe";
else
cout << "dangerous";
return 0;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,354,922 | 1,354,923 | u354773735 | cpp |
p03679 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> c >> a >> b;
if (b <= a)
cout << "delicious" << endl;
else if (b - a <= c)
cout << "safe" << endl;
else
cout << "dengerous" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> c >> a >> b;
if (b <= a)
cout << "delicious" << endl;
else if (b - a <= c)
cout << "safe" << endl;
else
cout << "dangerous" << endl;
} | [
"literal.string.change",
"io.output.change"
] | 1,354,924 | 1,354,925 | u912359563 | cpp |
p03679 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> c >> a >> b;
if (b <= a)
cout << "delicious" << endl;
else if (b - a <= c + 1)
cout << "safe" << endl;
else
cout << "dengerous" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> c >> a >> b;
if (b <= a)
cout << "delicious" << endl;
else if (b - a <= c)
cout << "safe" << endl;
else
cout << "dangerous" << endl;
} | [
"expression.operation.binary.remove",
"literal.string.change",
"io.output.change"
] | 1,354,926 | 1,354,925 | u912359563 | cpp |
p03679 | #include <iostream>
using namespace std;
int main() {
int x, a, b;
cin >> x >> a >> b;
if (b - a < 0)
cout << "delicious";
else if (b - a <= x)
cout << "safe";
else
cout << "dangerous";
return 0;
} | #include <iostream>
using namespace std;
int main() {
int x, a, b;
cin >> x >> a >> b;
if (b - a <= 0)
cout << "delicious";
else if (b - a <= x)
cout << "safe";
else
cout << "dangerous";
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,354,927 | 1,354,928 | u362156930 | cpp |
p03679 | #include <bits/stdc++.h>
using namespace std;
int main() {
int x, a, b;
cin >> x >> a >> b;
if (b < a) {
cout << "delicious" << endl;
} else if (b <= a + x) {
cout << "safe" << endl;
} else {
cout << "dangerous" << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int x, a, b;
cin >> x >> a >> b;
if (b <= a) {
cout << "delicious" << endl;
} else if (b <= a + x) {
cout << "safe" << endl;
} else {
cout << "dangerous" << endl;
}
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,354,929 | 1,354,930 | u092665151 | cpp |
p03679 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAXN = (int)1e5 + 10;
int main() {
int a, b, x;
cin >> x >> a >> b;
if (b - a > x)
cout << "dangerous" << endl;
else {
if (a <= b)
cout << "delicious" << endl;
else
cout << "safe" << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAXN = (int)1e5 + 10;
int main() {
int a, b, x;
cin >> x >> a >> b;
if (b - a > x)
cout << "dangerous" << endl;
else {
if (a >= b)
cout << "delicious" << endl;
else
cout << "safe" << endl;
}
return 0;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,354,935 | 1,354,936 | u294642518 | cpp |
p03679 | #include <iostream>
using namespace std;
int main() {
int x, a, b;
cin >> x >> a >> b;
cout << (b < a ? "delicious" : b < a + x ? "safe" : "dangerous") << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int x, a, b;
cin >> x >> a >> b;
cout << (b <= a ? "delicious" : b <= a + x ? "safe" : "dangerous") << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"io.output.change"
] | 1,354,937 | 1,354,938 | u136553578 | cpp |
p03679 | #include <iostream>
using namespace std;
int main() {
int x, a, b;
cin >> x >> a >> b;
if (b < a) {
cout << "delicious" << endl;
} else if (b < x + a) {
cout << "safe" << endl;
} else {
cout << "dangerous" << endl;
}
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int x, a, b;
cin >> x >> a >> b;
if (b <= a) {
cout << "delicious" << endl;
} else if (b <= x + a) {
cout << "safe" << endl;
} else {
cout << "dangerous" << endl;
}
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,354,942 | 1,354,943 | u854191117 | 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 = 1;
for (int i = 1; i < N; i++) {
a = vec.at(a - 1);
if (a == 2) {
cout << i << endl;
return 0;
}
cout << -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 a = 1;
for (int i = 1; i < N; i++) {
a = vec.at(a - 1);
if (a == 2) {
cout << i << endl;
return 0;
}
}
cout << -1 << endl;
... | [] | 1,355,235 | 1,355,236 | u729119068 | cpp |
p03680 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int, int> ii;
typedef map<int, int> MPII;
typedef set<int> ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int, int> ii;
typedef map<int, int> MPII;
typedef set<int> ... | [
"literal.number.change",
"variable_access.subscript.index.change"
] | 1,355,257 | 1,355,258 | u886310677 | cpp |
p03680 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, cnt = 1;
cin >> N;
vector<int> a(N);
for (int nj = 0; nj < N; nj++) {
cin >> a.at(nj);
}
int ni = 0;
while (2 != a.at(ni)) {
cnt++;
ni = a.at(ni);
if (N == cnt) {
cout << -1 << endl;
return 0;
... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, cnt = 1;
cin >> N;
vector<int> a(N);
for (int nj = 0; nj < N; nj++) {
cin >> a.at(nj);
}
int ni = 0;
while (2 != a.at(ni)) {
cnt++;
ni = a.at(ni) - 1;
if (N == cnt) {
cout << -1 << endl;
return 0;
... | [
"assignment.change"
] | 1,355,266 | 1,355,267 | u807503905 | 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 a;
cin >> a;
a--;
A.push_back(a);
}
int ans = 0;
int sum = 0;
for (int i = 0; i < N; i++) {
if (ans == 1) {
cout << sum << endl;
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 a;
cin >> a;
a--;
A.push_back(a);
}
int ans = 0;
int sum = 0;
for (int i = 0; i <= N; i++) {
if (ans == 1) {
cout << sum << endl;
return 0;
}... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,355,272 | 1,355,273 | u274195948 | 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 = 0;
int ai = a.at(i);
for (i = 0; i < N - 1; i++) {
if (ai == 2) {
break;
}
ai = a.at(ai - 1);
}
if (i < N) {
cout << 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 i = 0;
int ai = a.at(i);
for (i = 0; i < N - 1; i++) {
if (ai == 2) {
break;
}
ai = a.at(ai - 1);
}
if (i < N - 1) {
cout ... | [
"control_flow.branch.if.condition.change"
] | 1,355,274 | 1,355,275 | u549663129 | cpp |
p03680 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
int x = 0;
int count = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
x = a[x] - 1;
if (x == 1) {
count = i;
break;
}
}
if (count != 0) {
cout ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
int x = 0;
int count = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
x = a[x] - 1;
if (x == 1) {
count = i + 1;
break;
}
}
if (count != 0) {
c... | [
"assignment.change",
"expression.operation.binary.remove"
] | 1,355,276 | 1,355,277 | u926006934 | cpp |
p03680 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
int x = 0;
int count = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
if (x != 0) {
x = a[x - 1];
if (x == 1) {
count = i + 1;
break;
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
int x = 1;
int count = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
if (x != 0) {
x = a[x - 1];
if (x == 2) {
count = i + 1;
break;
}
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.branch.if.condition.change",
"assignment.change"
] | 1,355,278 | 1,355,279 | u237390401 | 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 X = 1;
for (int i = 0; i < N; i++) {
if (a[X] == 2) {
cout << i + 1 << endl;
return 0;
} else {
X = a[X - 1];
}
}
cout << -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 X = 1;
for (int i = 0; i < N; i++) {
if (a[X - 1] == 2) {
cout << i + 1 << endl;
return 0;
} else {
X = a[X - 1];
}
}
cout <... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 1,355,280 | 1,355,281 | u237390401 | cpp |
p03680 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int a[N + 1];
for (int i = 1; i <= N; i++) {
cin >> a[i];
}
int i = 1;
int count = 0;
bool stop = false;
while (true) {
if (a[i] == 2) {
stop = true;
break;
}
if (count == N + 1) {
break;... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int a[N + 1];
for (int i = 1; i <= N; i++) {
cin >> a[i];
}
int i = 1;
int count = 0;
bool stop = false;
while (true) {
if (i == 2) {
stop = true;
break;
}
if (count == N - 1) {
break;
... | [
"control_flow.branch.if.condition.change",
"misc.opposites",
"expression.operator.arithmetic.change"
] | 1,355,285 | 1,355,286 | u221391729 | cpp |
p03680 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, i, k = 0;
cin >> N;
vector<int> a(N);
for (i = 0; i < N; ++i)
cin >> a.at(i);
i = 0;
do {
++k;
i = a.at(i) - 1;
if (i == 2)
break;
} while (--N);
if (N == 0)
cout << -1 << endl;
else
cout << k << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, i, k = 0;
cin >> N;
vector<int> a(N);
for (i = 0; i < N; ++i)
cin >> a.at(i);
i = 0;
do {
++k;
i = a.at(i) - 1;
if (i == 1)
break;
} while (--N);
if (N == 0)
cout << -1 << endl;
else
cout << k << endl;
}
| [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 1,355,290 | 1,355,291 | u830745382 | cpp |
p03680 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, i, k = 0;
cin >> N;
vector<int> a(N);
for (i = 0; i < N; ++i)
cin >> a.at(i);
i = 0;
do {
++k;
i = a.at(i - 1);
if (i == 2)
break;
} while (--N);
if (N == 0)
cout << -1 << endl;
else
cout << k << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, i, k = 0;
cin >> N;
vector<int> a(N);
for (i = 0; i < N; ++i)
cin >> a.at(i);
i = 0;
do {
++k;
i = a.at(i) - 1;
if (i == 1)
break;
} while (--N);
if (N == 0)
cout << -1 << endl;
else
cout << k << endl;
}
| [
"call.arguments.change",
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 1,355,292 | 1,355,291 | u830745382 | cpp |
p03680 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, i, k = 0;
cin >> N;
vector<int> a(N);
for (i = 0; i < N; ++i)
cin >> a.at(i);
i = 0;
do {
++k;
i = a.at(i);
if (i == 2)
break;
} while (--N);
if (N == 0)
cout << -1 << endl;
else
cout << k << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, i, k = 0;
cin >> N;
vector<int> a(N);
for (i = 0; i < N; ++i)
cin >> a.at(i);
i = 0;
do {
++k;
i = a.at(i) - 1;
if (i == 1)
break;
} while (--N);
if (N == 0)
cout << -1 << endl;
else
cout << k << endl;
}
| [
"assignment.change",
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 1,355,293 | 1,355,291 | u830745382 | cpp |
p03680 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i, s, n) for (int i = (s); i < (n); ++i)
#define ll long long
#define ld long double
#define P pair<ll, ll>
#define all(v) v.begin(), v.end()
const ll mod = 1e9 + 7;
const ll INF = 1e18;
const double pi = acos(-... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i, s, n) for (int i = (s); i < (n); ++i)
#define ll long long
#define ld long double
#define P pair<ll, ll>
#define all(v) v.begin(), v.end()
const ll mod = 1e9 + 7;
const ll INF = 1e18;
const double pi = acos(-... | [] | 1,355,295 | 1,355,296 | u025469035 | cpp |
p03680 |
#include <bits/stdc++.h>
#include <string>
using namespace std;
int X, N;
int A[2000010]{};
bool B[2000010]{};
int main() {
cin >> N;
for (int i = 0; i < N; i++)
cin >> A[i];
int count = 0;
for (int i = 0; count < N;) {
i = A[i] - 1;
count++;
if (i + 1 == N) {
cout << count;
retur... |
#include <bits/stdc++.h>
#include <string>
using namespace std;
int X, N;
int A[2000010]{};
bool B[2000010]{};
int main() {
cin >> N;
for (int i = 0; i < N; i++)
cin >> A[i];
int count = 0;
for (int i = 0; count < N;) {
i = A[i] - 1;
count++;
if (i == 1) {
cout << count;
return 0;... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"identifier.replace.remove",
"literal.replace.add",
"control_flow.branch.if.condition.change"
] | 1,355,307 | 1,355,308 | u935620673 | cpp |
p03680 |
#include <bits/stdc++.h>
#include <string>
using namespace std;
int X, N;
int A[2000010]{};
bool B[2000010]{};
int main() {
cin >> N;
for (int i = 0; i < N; i++)
cin >> A[i];
int count = 0;
for (int i = 0; count < N;) {
i = A[i] - 1;
count++;
if (i == N) {
cout << count;
return 0;... |
#include <bits/stdc++.h>
#include <string>
using namespace std;
int X, N;
int A[2000010]{};
bool B[2000010]{};
int main() {
cin >> N;
for (int i = 0; i < N; i++)
cin >> A[i];
int count = 0;
for (int i = 0; count < N;) {
i = A[i] - 1;
count++;
if (i == 1) {
cout << count;
return 0;... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.branch.if.condition.change"
] | 1,355,309 | 1,355,308 | u935620673 | cpp |
p03680 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
int j = 0;
for (int i = 0; i < n; i++) {
cin >> a.at(i);
}
for (int i = 0; i < n; i++) {
if (a.at(j) == 2) {
cout << i << endl;
return 0;
}
j = a.at(j - 1);
}
cout <<... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
int j = 1;
for (int i = 0; i < n; i++) {
cin >> a.at(i);
}
for (int i = 0; i < n; i++) {
if (a.at(j - 1) == 2) {
cout << i + 1 << endl;
return 0;
}
j = a.at(j - 1);
}
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 1,355,326 | 1,355,324 | u657538941 | cpp |
p03680 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
vector<int> lamp;
cin >> n;
for (int i = 0; i < n; i++) {
int newLamp;
cin >> newLamp;
lamp.push_back(newLamp);
}
int pos = 1;
int cnt = 0;
do {
pos = lamp[pos - 1];
cnt++;
pos = (pos == 1) ? -1 : pos;
} while... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
vector<int> lamp;
cin >> n;
for (int i = 0; i < n; i++) {
int newLamp;
cin >> newLamp;
lamp.push_back(newLamp);
}
int pos = 1;
int cnt = 0;
do {
pos = lamp[pos - 1];
cnt++;
pos = (pos == 1) ? -1 : pos;
} while... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"io.output.change"
] | 1,355,327 | 1,355,328 | u225268318 | cpp |
p03680 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vec(N);
int a;
for (int i = 0; i < N; i++) {
cin >> a;
vec.at(i) = a;
}
int counter = 0;
int b;
b = vec.at(0);
for (int i = 0; i < N + 1; i++) {
if (b == 2) {
counter++;
cout << counte... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vec(N);
int a;
for (int i = 0; i < N; i++) {
cin >> a;
vec.at(i) = a;
}
int counter = 0;
int b;
b = vec.at(0);
for (int i = 0; i < N + 1; i++) {
if (b == 2) {
counter++;
cout << counte... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 1,355,335 | 1,355,336 | u346942633 | 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 ans = 0;
int lamp = 1;
for (int i = 0; i < N; i++) {
lamp = a.at(lamp - 1);
ans++;
if (lamp == 2)
break;
if (lamp == 1) {
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.at(i);
int ans = 0;
int lamp = 1;
for (int i = 0; i < N; i++) {
lamp = a.at(lamp - 1);
ans++;
if (lamp == 2)
break;
else if (lamp == 1) {
ans ... | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove",
"control_flow.branch.else.add"
] | 1,355,337 | 1,355,338 | u097161601 | 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;
int count = 0, next = 1;
vector<int> a(n);
rep(i, n) { cin >> a.at(i); }
rep(i, n) {
next = a.at(next - 1);
count++;
if (next == 1) {
cout << count << endl;... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n;
cin >> n;
int count = 0, next = 1;
vector<int> a(n);
rep(i, n) { cin >> a.at(i); }
rep(i, n) {
next = a.at(next - 1);
count++;
if (next == 2) {
cout << count << endl;... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 1,355,341 | 1,355,342 | u412057008 | 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;
int count = 0, next = 0;
vector<int> a(n);
rep(i, n) { cin >> a.at(i); }
rep(i, n) {
next = a.at(next - 1);
count++;
if (next == 1) {
cout << count << endl;... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n;
cin >> n;
int count = 0, next = 1;
vector<int> a(n);
rep(i, n) { cin >> a.at(i); }
rep(i, n) {
next = a.at(next - 1);
count++;
if (next == 2) {
cout << count << endl;... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.branch.if.condition.change"
] | 1,355,343 | 1,355,342 | u412057008 | 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;
int count = 0, next = 0;
vector<int> a(n);
rep(i, n) { cin >> a.at(i); }
rep(i, n) {
next = a.at(next);
count++;
if (next == 1) {
cout << count << endl;
... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n;
cin >> n;
int count = 0, next = 1;
vector<int> a(n);
rep(i, n) { cin >> a.at(i); }
rep(i, n) {
next = a.at(next - 1);
count++;
if (next == 2) {
cout << count << endl;... | [
"literal.number.change",
"variable_declaration.value.change",
"assignment.change",
"control_flow.branch.if.condition.change"
] | 1,355,344 | 1,355,342 | u412057008 | cpp |
p03680 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, c, b, d;
b = 1;
c = 0;
d = 0;
cin >> N;
vector<int> botan(N);
for (int i = 0; i < N; i++) {
cin >> botan.at(i);
}
for (int i = 0; i < N; i++) {
if (botan.at(b - 1) == 2) {
d++;
break;
} else {
c++;
b... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, c, b, d;
b = 1;
c = 0;
d = 0;
cin >> N;
vector<int> botan(N);
for (int i = 0; i < N; i++) {
cin >> botan.at(i);
}
for (int i = 0; i < N; i++) {
if (botan.at(b - 1) == 2) {
d++;
c++;
break;
} else {
c... | [
"expression.unary.arithmetic.add"
] | 1,355,352 | 1,355,353 | u290475901 | 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 k = vec.at(0);
for (int i = 0; i < N; i++) {
if (k = 2) {
cout << i + 1 << endl;
break;
}
k == vec.at(k);
}
if (k != 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);
}
/* cout << vec.at(N-1) << endl;
*/
int k = vec.at(0);
for (int i = 0; i < N; i++) {
if (k == 2) {
cout << i + 1 << endl;
break;
... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo",
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"assignment.change"
] | 1,355,354 | 1,355,355 | u647504909 | 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 = a.at(0) - 1;
int count = 1;
for (;;) {
if (now == 1) {
cout << count << endl;
break;
}
if (count >= N) {
cout << -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 now = a.at(0);
int count = 1;
for (;;) {
if (now == 2) {
cout << count << endl;
break;
}
if (count >= N) {
cout << -1 << e... | [
"expression.operation.binary.remove",
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 1,355,356 | 1,355,357 | u301665419 | cpp |
p03680 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vec(N, 0);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
int s = 1;
int count = 0;
while (s != 2) {
s = vec.at(s);
count += 1;
if (count > N) {
break;
}
}
if (count < N) {
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 s = vec.at(1);
int count = 0;
for(int i=0;i<N-2;i++){
count += 1;
if (s != 2){
if(vec.at(s) != 2){
... | [
"assignment.change"
] | 1,355,360 | 1,355,361 | u120586196 | 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 s = 1;
int count = 0;
while (s != 2) {
s = vec.at(s);
count += 1;
if (count > N) {
break;
}
}
if (count < N) {
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 s = vec.at(1);
int count = 0;
for(int i=0;i<N-2;i++){
count += 1;
if (s != 2){
if(vec.at(s) != 2){
... | [
"call.arguments.add",
"assignment.change"
] | 1,355,362 | 1,355,361 | u120586196 | cpp |
p03680 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <string>
#include <vector>
#define intt long long
int main() {
intt N;
std::cin >> N;
std::vector<intt> a(N);
for (auto &r : a)
std::cin >> r;
intt count = 0;
intt t = 1;
while (... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <string>
#include <vector>
#define intt long long
int main() {
intt N;
std::cin >> N;
std::vector<intt> a(N);
for (auto &r : a)
std::cin >> r;
intt count = 0;
intt t = 1;
while (... | [
"assignment.change"
] | 1,355,372 | 1,355,373 | u917678406 | cpp |
p03680 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> train(N);
for (int i = 0; i < N; i++) {
cin >> train.at(i);
}
int s = train.at(0);
int n = 0;
for (int i = 0; i < N; i++) {
s = train.at(s - 1);
n++;
if (s == 2) {
cout << n << endl;
break... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> train(N);
for (int i = 0; i < N; i++) {
cin >> train.at(i);
}
int s = 1;
int n = 0;
for (int i = 0; i < N; i++) {
s = train.at(s - 1);
n++;
if (s == 2) {
cout << n << endl;
break;
} el... | [
"variable_declaration.value.change",
"identifier.replace.remove",
"literal.replace.add",
"call.remove"
] | 1,355,376 | 1,355,377 | u212093097 | cpp |
p03680 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> Light(N);
for (int i = 0; i < N; i++) {
cin >> Light.at(i);
}
int NEXT = 1;
int check = 0;
int kai = 1;
for (int i = 0; i < N; i++) {
if (Light.at(NEXT - 1) == 2) {
check = 1;
break;
} el... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> Light(N);
for (int i = 0; i < N; i++) {
cin >> Light.at(i);
}
int NEXT = 1;
int check = 0;
int kai = 1;
for (int i = 0; i < N; i++) {
if (Light.at(NEXT - 1) == 2) {
check = 1;
break;
} el... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 1,355,389 | 1,355,390 | u081974278 | cpp |
p03680 | #include <algorithm>
#include <climits>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
vector<int> vec(N + 1);
for (int i = 1; i < N + 1... | #include <algorithm>
#include <climits>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
vector<int> vec(N + 1);
for (int i = 1; i < N + 1... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"identifier.replace.add",
"literal.replace.remove"
] | 1,355,391 | 1,355,392 | u485538621 | cpp |
p03680 | // Practice
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroll-loops")
#include <bits/stdc++.h>
#define ll long long
using namespace std;
const ll N = 2e5 + 5;
const ll INF = 1e9 + 5;
const ll mxN = 1000000007;
const double E = 1e-9;
//-----------------------------------... | // Practice
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroll-loops")
#include <bits/stdc++.h>
#define ll long long
using namespace std;
const ll N = 2e5 + 5;
const ll INF = 1e9 + 5;
const ll mxN = 1000000007;
const double E = 1e-9;
//-----------------------------------... | [
"literal.number.change",
"io.output.change"
] | 1,355,397 | 1,355,398 | u406246381 | 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 here = 1;
for (int i = 0; i < N + 10; i++) {
if (here == 2) {
cout << i << endl;
break;
} else {
here = A.at(i - 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 here = 1;
for (int i = 0; i < N + 10; i++) {
if (here == 2) {
cout << i << endl;
break;
} else {
here = A.at(here - 1);
}
... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,355,405 | 1,355,406 | u821882713 | cpp |
p03680 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i; i < N; i++) {
cin >> A.at(i);
}
int here = 1;
for (int i = 0; i < N + 10; i++) {
if (here == 2) {
cout << i << endl;
break;
} else {
here = A.at(i - 1);
}
if... | #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 here = 1;
for (int i = 0; i < N + 10; i++) {
if (here == 2) {
cout << i << endl;
break;
} else {
here = A.at(here - 1);
}
... | [
"control_flow.loop.for.initializer.change",
"variable_declaration.value.change",
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,355,407 | 1,355,406 | u821882713 | cpp |
p03680 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++)
cin >> v[i];
int x = 1;
int count = 0;
for (int i = 0; i <= n; i++) {
count++;
if (v[x - 1] == 2)
break;
x = v[x - ... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++)
cin >> v[i];
int x = 1;
int count = 0;
for (int i = 0; i < n; i++) {
count++;
if (v[x - 1] == 2)
break;
x = v[x - 1... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,355,408 | 1,355,409 | u199441105 | cpp |
p03680 | #include <iostream>
#include <vector>
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 button = 1;
for (ans = 0; ans < N; ans++) {
if (button == 2)
break;
button = a[button];
}
if (ans >= N)
ans =... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> a(N + 1);
for (int i = 1; i <= N; i++) {
cin >> a[i];
}
int ans = 0;
int button = 1;
for (ans = 0; ans < N; ans++) {
if (button == 2)
break;
button = a[button];
}
if (ans >= N)
... | [
"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"
] | 1,355,419 | 1,355,420 | u016119075 | cpp |
p03680 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
int now = a[0];
bool ok = false;
int counts = 1;
rep(i, n) {
now = a[now - 1];
cou... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
int now = 1;
bool ok = false;
int counts = 0;
rep(i, n) {
now = a[now - 1];
counts... | [
"variable_declaration.value.change",
"identifier.replace.remove",
"literal.replace.add",
"literal.number.change"
] | 1,355,428 | 1,355,429 | u052656528 | cpp |
p03680 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<int> a(N + 1, 0);
rep(i, N) cin >> a[i + 1];
int now = 1, count = 0;
set<int> old;
old.insert(now);
bool flg = false;
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<int> a(N + 1, 0);
rep(i, N) cin >> a[i + 1];
int now = 1, count = 0;
set<int> old;
old.insert(now);
bool flg = false;
... | [
"control_flow.break.add"
] | 1,355,441 | 1,355,442 | u801083963 | cpp |
p03680 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b, cu, out;
cin >> n;
cu = 0;
out = 0;
vector<int> vec(0);
for (int i = 0; i < n; i++) {
cin >> a;
vec.push_back(a);
}
b = 1;
for (int i = 0; i < n; i++) {
cu++;
if (cu == n + 1) {
out = 1;
break;
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b, cu, out;
cin >> n;
cu = 0;
out = 0;
vector<int> vec(0);
for (int i = 0; i < n; i++) {
cin >> a;
vec.push_back(a);
}
b = 1;
for (int i = 0; i < n; i++) {
cu++;
if (cu == n) {
out = 1;
break;
}
i... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 1,355,443 | 1,355,444 | u408356872 | 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];
--a[i];
}
set<int> se;
se.insert(0);
int cur = 0;
while (true) {
cur = a[cur];
if (cur == 2)
break;
if (se.count(cur)) {
cout << -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];
--a[i];
}
set<int> se;
se.insert(0);
int cur = 0;
while (true) {
cur = a[cur];
if (cur == 1)
break;
if (se.count(cur)) {
cout << -1 ... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 1,355,449 | 1,355,450 | u692336506 | cpp |
p03680 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vec(N);
int a = 1;
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
for (int i = 0; i < N + 1; i++) {
a = vec.at(a - 1);
if (a == 2) {
a = i + 1;
cout << a << endl;
a = -1;
break... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vec(N);
int a = 1;
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
for (int i = 0; i < N + 1; i++) {
a = vec.at(a - 1);
if (a == 2) {
a = i + 1;
cout << a << endl;
a = -1;
break... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"identifier.replace.remove",
"literal.replace.add",
"io.output.change"
] | 1,355,453 | 1,355,454 | u179958942 | cpp |
p03680 | #include <bits/stdc++.h>
using namespace std;
int a[100050];
int main() {
cin.tie(0);
ios::sync_with_stdio(0);
int n;
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
int c = 1;
int cnt = 0;
for (int i = 0; i < n; i++) {
if (c == a[c - 1]) {
c = 1;
break;
}
c = a[c - ... | #include <bits/stdc++.h>
using namespace std;
int a[100050];
int main() {
cin.tie(0);
ios::sync_with_stdio(0);
int n;
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
int c = 1;
int cnt = 0;
for (int i = 0; i < n; i++) {
if (c == a[c - 1]) {
c = 1;
break;
}
c = a[c - ... | [
"control_flow.branch.if.condition.change"
] | 1,355,458 | 1,355,459 | u288035794 | cpp |
p03680 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N;
cin >> N;
int A[N];
for (int i = 0; i < N; i++) {
cin >> A[i];
}
int count = 0;
for (int c = 1; c != 2;) {
c = A[c];
count++;
if (count == N) {
cout << -1 << endl;
return 0;
}
}
cout << count << endl... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N;
cin >> N;
int A[N];
for (int i = 0; i < N; i++) {
cin >> A[i];
}
int count = 0;
for (int c = 1; c != 2;) {
c = A[c - 1];
count++;
if (count == N) {
cout << -1 << endl;
return 0;
}
}
cout << count << ... | [
"assignment.change"
] | 1,355,464 | 1,355,465 | u946082956 | cpp |
p03680 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N;
cin >> N;
int A[N];
for (int i = 0; i < N; i++) {
cin >> A[i];
}
int count = 0;
for (int c = 1; c != 2;) {
c = A[c];
count++;
if (count = N) {
cout << -1 << endl;
return 0;
}
}
cout << count << endl;... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N;
cin >> N;
int A[N];
for (int i = 0; i < N; i++) {
cin >> A[i];
}
int count = 0;
for (int c = 1; c != 2;) {
c = A[c - 1];
count++;
if (count == N) {
cout << -1 << endl;
return 0;
}
}
cout << count << ... | [
"assignment.change",
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 1,355,466 | 1,355,465 | u946082956 | cpp |
p03680 | #include <bits/stdc++.h>
#define rep(i, f, n) for (ll i = (f); i < (ll)(n); i++)
#define repe(i, f, n) for (ll i = (f); i <= (ll)(n); i++)
using namespace std;
using ll = long long;
using pint = pair<int, int>;
int main() {
int N;
cin >> N;
vector<int> a(N);
a[0] = 0;
rep(i, 0, N) {
cin >> a[i];
a[i]... | #include <bits/stdc++.h>
#define rep(i, f, n) for (ll i = (f); i < (ll)(n); i++)
#define repe(i, f, n) for (ll i = (f); i <= (ll)(n); i++)
using namespace std;
using ll = long long;
using pint = pair<int, int>;
int main() {
int N;
cin >> N;
vector<int> a(N);
a[0] = 0;
rep(i, 0, N) {
cin >> a[i];
a[i]... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 1,355,476 | 1,355,477 | u105302073 | cpp |
p03680 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, x = 0;
cin >> N;
int a[N] = {0};
for (int i = 0; i < N; i++) {
cin >> a[i];
}
for (int i = 0; i < N; i++) {
x = a[x] - 1;
// cout << x << endl;
if (x == 1) {
cout << i + 1 << endl;
break;
}
if (i >= N)... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, x = 0;
cin >> N;
int a[N] = {0};
for (int i = 0; i < N; i++) {
cin >> a[i];
}
for (int i = 0; i < N; i++) {
x = a[x] - 1;
// cout << x << endl;
if (x == 1) {
cout << i + 1 << endl;
break;
} else if (i == N... | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 1,355,478 | 1,355,479 | u073744003 | cpp |
p03680 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, x = 0;
cin >> N;
int a[N] = {0};
for (int i = 0; i < N; i++) {
cin >> a[i];
}
for (int i = 0; i < N; i++) {
x = a[x] - 1;
// cout << x << endl;
if (x == 1) {
cout << i + 1 << endl;
break;
}
if (i >= N)... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, x = 0;
cin >> N;
int a[N] = {0};
for (int i = 0; i < N; i++) {
cin >> a[i];
}
for (int i = 0; i < N; i++) {
x = a[x] - 1;
// cout << x << endl;
if (x == 1) {
cout << i + 1 << endl;
break;
} else if (i >= N... | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 1,355,478 | 1,355,481 | u073744003 | cpp |
p03680 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, count = 0, i = 1;
cin >> N;
vector<int> b(N);
for (int i = 0; i < N; i++) {
cin >> b.at(i);
}
while (count <= N) {
i = b.at(i - 1);
count++;
if (i == 2) {
count++;
cout << count << endl;
break;
}
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, count = 0, i = 1;
cin >> N;
vector<int> b(N);
for (int i = 0; i < N; i++) {
cin >> b.at(i);
}
while (count <= N) {
i = b.at(i - 1);
count++;
if (i == 2) {
cout << count << endl;
break;
}
}
if (i != 2) {
... | [
"expression.unary.arithmetic.remove"
] | 1,355,487 | 1,355,488 | u950831819 | cpp |
p03680 | /* HARD WORK FOREVER PAYS */
#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define turbo() \
{ \
ios_base::sync_with_std... | /* HARD WORK FOREVER PAYS */
#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define turbo() \
{ \
ios_base::sync_with_std... | [
"identifier.change",
"io.output.change"
] | 1,355,489 | 1,355,490 | u455696572 | cpp |
p03680 | #include <bits/stdc++.h>
using namespace std;
#define ll unsigned long long
#define inf 1e18
#define mod 1e9 + 7
#define w(x) \
int x; \
cin >> x; ... | #include <bits/stdc++.h>
using namespace std;
#define ll unsigned long long
#define inf 1e18
#define mod 1e9 + 7
#define w(x) \
int x; \
cin >> x; ... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 1,355,495 | 1,355,496 | u581884393 | cpp |
p03680 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
#define fast \
ios_base::sync_with_stdio(0); \
cin.tie(0); ... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
#define fast \
ios_base::sync_with_stdio(0); \
cin.tie(0); ... | [
"expression.operation.binary.add"
] | 1,355,499 | 1,355,500 | u299646335 | cpp |
p03680 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N; //ボタンの数
cin >> N;
vector<int> Botton(N); //次に光るボタンのi(番号)
for (int i = 0; i < N; i++) {
cin >> Botton.at(i);
}
int Ok = -1; //-1は不可能 正の数はボタンを押した回数
int I = 1; //光っているボタンの番号
for (int i = 1; i <= N; i++) {
if (Botton.at(I) == 2) ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N; //ボタンの数
cin >> N;
vector<int> Botton(N + 1); //次に光るボタンのi(番号)
for (int i = 1; i <= N; i++) {
cin >> Botton.at(i);
}
int Ok = -1; //-1は不可能 正の数はボタンを押した回数
int I = 1; //光っているボタンの番号
for (int i = 1; i <= N; i++) {
if (Botton.at(I) =... | [
"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"
] | 1,355,511 | 1,355,512 | u197218542 | 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> a(N);
bool discovered = false;
rep(i, N) { cin >> a.at(i); }
int numlight = 1;
rep(i, N) {
if (numlight == 2) {
discovered = true;
cout << i << en... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N;
cin >> N;
vector<int> a(N);
bool discovered = false;
rep(i, N) { cin >> a.at(i); }
int numlight = 1;
rep(i, N) {
if (numlight == 2) {
discovered = true;
cout << i << en... | [
"control_flow.break.add"
] | 1,355,513 | 1,355,514 | u171222170 | cpp |
p03680 | #include <bitset>
#include <iostream>
#include <vector>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
vector<int> a(n + 1);
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
int cur = 1, counter;
bitset<100005> b;
for (; cur != 2 && !b[cur]; ... | #include <bitset>
#include <iostream>
#include <vector>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
vector<int> a(n + 1);
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
int cur = 1, counter = 0;
bitset<100005> b;
for (; cur != 2 && !b[cu... | [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 1,355,517 | 1,355,518 | u445552854 | 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 sum = 0;
int num = 0;
for (int i = 0; i < n; i++) {
sum++;
if (a.at(num) == 2) {
cout << sum << endl;
break;
}
else if (... | #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 sum = 0;
int num = 0;
for (int i = 0; i < n; i++) {
sum++;
if (a.at(num) == 2) {
cout << sum << endl;
break;
}
else if (... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 1,355,521 | 1,355,522 | u606795899 | 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);
}
vector<int> x(N);
int count = 0;
bool can = false;
for (int i = 1; i < N + 1; i++) {
x.at(i) = a.at(x.at(i - 1)) - 1;
count++;
// cout << x.at... | #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);
}
vector<int> x(N);
int count = 0;
bool can = false;
for (int i = 1; i < N; i++) {
x.at(i) = a.at(x.at(i - 1)) - 1;
count++;
// cout << x.at(i) ... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 1,355,531 | 1,355,532 | u478911746 | 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);
}
vector<int> now(1);
now.at(0) = 1;
for (int i = 0; i < 100000; i++) {
now.push_back(a.at(now.at(i) - 1));
if (now.at(i + 1) == 2) {
cout <<... | #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);
}
vector<int> now(1);
now.at(0) = 1;
for (int i = 0; i < 100000; i++) {
now.push_back(a.at(now.at(i) - 1));
if (now.at(i + 1) == 2) {
cout <<... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 1,355,533 | 1,355,534 | u256587538 | cpp |
p03680 | #include <bits/stdc++.h>
#define ll long long
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
using namespace std;
int main() {
int n;
cin >> n;
vector<int> switches(n);
REP(i, n)
cin >> switches.at(i);
int cnt... | #include <bits/stdc++.h>
#define ll long long
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
using namespace std;
int main() {
int n;
cin >> n;
vector<int> switches(n);
REP(i, n)
cin >> switches.at(i);
int cnt... | [
"control_flow.break.remove",
"control_flow.return.add"
] | 1,355,547 | 1,355,548 | u093372948 | cpp |
p03680 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vec(N);
int a = 1;
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
for (int i = 0; i < N + 1; i++) {
a = vec.at(a - 1);
if (a == 1) {
cout << i + 1 << endl;
break;
}
if (i == N) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vec(N);
int a = 1;
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
for (int i = 0; i < N; i++) {
a = vec.at(a - 1);
if (a == 2) {
cout << i + 1 << endl;
break;
}
if (i == N - 1) {
... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"literal.number.change",
"control_flow.branch.if.condition.change",
"misc.off_by_one"
] | 1,355,549 | 1,355,550 | u044467039 | cpp |
p03680 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vec(N);
int a = 1;
for (int i = 0; i < N + 1; i++) {
cin >> vec.at(i);
}
for (int i = 0; i < N; i++) {
a = vec.at(a - 1);
if (a == 1) {
cout << i + 1 << endl;
break;
}
if (i == N) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vec(N);
int a = 1;
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
for (int i = 0; i < N; i++) {
a = vec.at(a - 1);
if (a == 2) {
cout << i + 1 << endl;
break;
}
if (i == N - 1) {
... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"literal.number.change",
"control_flow.branch.if.condition.change",
"misc.off_by_one"
] | 1,355,551 | 1,355,550 | u044467039 | cpp |
p03680 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vec(N);
int a = 1;
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
for (int i = 0; i < N; i++) {
a = vec.at(a - 1);
if (a == 1) {
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);
int a = 1;
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
for (int i = 0; i < N; i++) {
a = vec.at(a - 1);
if (a == 2) {
cout << i + 1 << endl;
break;
}
if (i == N - 1) {
... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 1,355,552 | 1,355,550 | u044467039 | cpp |
p03680 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vec(N);
int a = 1;
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
for (int i = 0; i < N + 1; i++) {
a = vec.at(a - 1);
if (a == 1) {
cout << i + 1 << endl;
break;
}
if (i == N) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vec(N);
int a = 1;
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
for (int i = 0; i < N + 1; i++) {
a = vec.at(a - 1);
if (a == 2) {
cout << i + 1 << endl;
break;
}
if (i == N) {
... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 1,355,549 | 1,355,553 | u044467039 | cpp |
p03680 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vec(N);
int a = 1;
for (int i = 0; i < N + 1; i++) {
cin >> vec.at(i);
}
for (int i = 0; i < N; i++) {
a = vec.at(a - 1);
if (a == 1) {
cout << i + 1 << endl;
break;
}
if (i == N) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vec(N);
int a = 1;
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
for (int i = 0; i < N + 1; i++) {
a = vec.at(a - 1);
if (a == 2) {
cout << i + 1 << endl;
break;
}
if (i == N) {
... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"misc.off_by_one",
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 1,355,551 | 1,355,553 | u044467039 | cpp |
p03680 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, i, b;
cin >> N;
vector<int> a(N);
for (i = 0; i < N; i++) {
cin >> a.at(i);
}
b = a.at(0);
for (i = 1; i < N; i++) {
if (b == 2) {
cout << i << endl;
break;
}
b = a.at(b - 1);
if (i == N) {
cout << -... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, i, b;
cin >> N;
vector<int> a(N);
for (i = 0; i < N; i++) {
cin >> a.at(i);
}
b = a.at(0);
for (i = 1; i < N; i++) {
if (b == 2) {
cout << i << endl;
break;
}
b = a.at(b - 1);
if (i == N - 1) {
cout ... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 1,355,556 | 1,355,557 | u929543200 | cpp |
p03680 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, i, b;
cin >> N;
vector<int> a(N);
for (i = 0; i < N; i++) {
cin >> a.at(i);
}
b = a.at(0);
for (i = 1; i < N; i++) {
if (b == 2) {
cout << i << endl;
break;
}
b = a.at(b - 1);
if (i = N) {
cout << -1... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, i, b;
cin >> N;
vector<int> a(N);
for (i = 0; i < N; i++) {
cin >> a.at(i);
}
b = a.at(0);
for (i = 1; i < N; i++) {
if (b == 2) {
cout << i << endl;
break;
}
b = a.at(b - 1);
if (i == N - 1) {
cout ... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 1,355,558 | 1,355,557 | u929543200 | cpp |
p03680 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, i, b;
cin >> N;
vector<int> a(N);
for (i = 0; i < N; i++) {
cin >> a.at(i);
}
b = a.at(0);
for (i = 1; i < N; i++) {
if (b = 2) {
cout << i << endl;
break;
}
b = a.at(b);
if (i = N) {
cout << -1 << e... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, i, b;
cin >> N;
vector<int> a(N);
for (i = 0; i < N; i++) {
cin >> a.at(i);
}
b = a.at(0);
for (i = 1; i < N; i++) {
if (b == 2) {
cout << i << endl;
break;
}
b = a.at(b - 1);
if (i == N - 1) {
cout ... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo",
"assignment.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 1,355,559 | 1,355,557 | u929543200 | cpp |
p03680 | #include <bits/stdc++.h>
using namespace std;
using pint = pair<int, int>;
const long long INFLL = 1LL << 60;
const int INFI = 1000000000;
int main() {
int N;
vector<int> a(N);
for (int i = 0; i < N; i++) {
cin >> a[i];
a[i]--;
}
int count = 0;
map<int, int> m{};
int idx = 0;
m[0]++;
while ... | #include <bits/stdc++.h>
using namespace std;
using pint = pair<int, int>;
const long long INFLL = 1LL << 60;
const int INFI = 1000000000;
int main() {
int N;
cin >> N;
vector<int> a(N);
for (int i = 0; i < N; i++) {
cin >> a[i];
a[i]--;
}
int count = 0;
map<int, int> m{};
int idx = 0;
m[0]... | [] | 1,355,567 | 1,355,568 | u583701239 | cpp |
p03680 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, count = 0, check;
cin >> N;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
for (int j = 0; j < N; j++) {
count++;
if (j == 0) {
check = vec.at(0);
if (check == 2) {
cout << count << en... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, count = 0, check;
cin >> N;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
for (int j = 0; j < N; j++) {
count++;
if (j == 0) {
check = vec.at(0);
if (check == 2) {
cout << count << en... | [
"control_flow.break.add"
] | 1,355,571 | 1,355,572 | u301395049 | cpp |
p03680 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, i = 1, now = 0;
cin >> n;
vector<int> a(n + 1), b(n + 1, 1);
for (int i = 1; i <= n; i++)
cin >> a[i];
now = 1;
while (b[now]) {
b[now] = 0;
now = a[now];
i++;
if (a[now] == 2) {
cout << i << ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, i = 0, now = 0;
cin >> n;
vector<int> a(n + 1), b(n + 1, 1);
for (int i = 1; i <= n; i++)
cin >> a[i];
now = 1;
while (b[now]) {
b[now] = 0;
now = a[now];
i++;
if (now == 2) {
cout << i << end... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.branch.if.condition.change"
] | 1,355,577 | 1,355,578 | u573433204 | cpp |
p03680 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
using P = pair<int, int>;
using ll = long long;
static const int INF = 1000000000;
static const ll MOD = 1000000007;
ll gcd(ll a, ll b) { return b != 0 ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
using P = pair<int, int>;
using ll = long long;
static const int INF = 1000000000;
static const ll MOD = 1000000007;
ll gcd(ll a, ll b) { return b != 0 ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b... | [
"control_flow.loop.condition.change",
"literal.number.change"
] | 1,355,581 | 1,355,582 | u741815956 | cpp |
p03680 | #include <algorithm>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
#define rep(i, a, n) fo... | #include <algorithm>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
#define rep(i, a, n) fo... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,355,592 | 1,355,593 | u407213771 | cpp |
p03680 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, pos;
cin >> n;
vector<int> data(n);
for (int i = 0; i < n; i++) {
cin >> data.at(i);
}
for (int count = 0; count < n; count++) {
if (count == 0) {
pos = data.at(0) - 1;
} else {
pos = data.at(pos) - 1;
}
if (p... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, pos;
cin >> n;
vector<int> data(n);
for (int i = 0; i < n; i++) {
cin >> data.at(i);
}
for (int count = 0; count < n; count++) {
if (count == 0) {
pos = data.at(0) - 1;
} else {
pos = data.at(pos) - 1;
}
if (p... | [
"expression.unary.arithmetic.remove"
] | 1,355,598 | 1,355,599 | u634967948 | cpp |
p03680 | #include <algorithm>
#include <cassert>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define ll long long int
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repp(i, n) for (int i = 1; i <= n; i++)
#define sort(v) sort((v).begin(), (... | #include <algorithm>
#include <cassert>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define ll long long int
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repp(i, n) for (int i = 1; i <= n; i++)
#define sort(v) sort((v).begin(), (... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,355,602 | 1,355,603 | u587801819 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.