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 |
|---|---|---|---|---|---|---|---|
p02684 | n, k = map(int, input().split())
a = list(map(lambda x: int(x) - 1, input().split()))
ls = [-1] * n
now = 0
cnt = 0
path = []
while 1:
if ls[now] != -1:
b = ls[now]
break
ls[now] = cnt
path.append(now)
now = a[now]
cnt += 1
loop = path[b:]
if k < b:
print(path[k])
else:
prin... | n, k = map(int, input().split())
a = list(map(lambda x: int(x) - 1, input().split()))
ls = [-1] * n
now = 0
cnt = 0
path = []
while 1:
if ls[now] != -1:
b = ls[now]
break
ls[now] = cnt
path.append(now)
now = a[now]
cnt += 1
loop = path[b:]
if k <= b:
print(path[k] + 1)
else:
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 413,224 | 413,223 | u823391732 | python |
p02684 | n,k = map(int,input().split())
alist = list(map(int,input().split()))
memo = []
p = 1
vis = ['.']*n
while vis[p-1] == '.':
memo.append(p)
vis[p-1] = 'v'
p = alist[p-1]
loop = memo.index(p)
if k < len(alist):
print(memo[k])
else:
print(memo[loop+(k-loop)%(len(memo)-loop)])
| n,k = map(int,input().split())
alist = list(map(int,input().split()))
memo = []
p = 1
vis = ['.']*n
while vis[p-1] == '.':
memo.append(p)
vis[p-1] = 'v'
p = alist[p-1]
loop = memo.index(p)
if k < len(memo):
print(memo[k])
else:
print(memo[loop+(k-loop)%(len(memo)-loop)])
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 413,234 | 413,235 | u946517952 | python |
p02684 | n,k = map(int,input().split())
alist = list(map(int,input().split()))
memo = []
p = 1
vis = ['.']*n
while vis[p-1] == '.':
memo.append(p)
vis[p-1] = 'v'
p = alist[p-1]
loopstart = memo.index(p)
if k < len(alist):
print(memo[k])
else:
print(memo[loopstart+(k-loopstart)%(len(memo)-loopstart)])
| n,k = map(int,input().split())
alist = list(map(int,input().split()))
memo = []
p = 1
vis = ['.']*n
while vis[p-1] == '.':
memo.append(p)
vis[p-1] = 'v'
p = alist[p-1]
loop = memo.index(p)
if k < len(memo):
print(memo[k])
else:
print(memo[loop+(k-loop)%(len(memo)-loop)])
| [
"assignment.variable.change",
"identifier.change",
"control_flow.branch.if.condition.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 413,236 | 413,235 | u946517952 | python |
p02684 | def main():
n, k = map(int, input().split())
a = list(map(int, input().split()))
if a[0] == 1:
print(1)
exit(0)
if a[0] == a[a[0]-1]:
print(a[0])
pos = a[0]
num = 1
nums = set([1])
while pos not in nums:
nums.add(pos)
num += 1
pos = a[pos-1... | def main():
n, k = map(int, input().split())
a = list(map(int, input().split()))
if a[0] == 1:
print(1)
exit(0)
if a[0] == a[a[0]-1]:
print(a[0])
exit(0)
pos = a[0]
num = 1
nums = set([1])
while pos not in nums:
nums.add(pos)
num += 1
... | [
"call.add"
] | 413,239 | 413,240 | u906501980 | python |
p02684 | N,K = map(int, input().split())
A = list(map(int, input().split()))
move = 1
l = [1]
flag = [False]*(N+1)
flag[1] = True
for i in range(N):
move = A[move-1]
if flag[move]:
break
flag[move] = True
l.append(move)
ind = l.index(move)
rest = (K-ind) % (len(l) - ind) + ind
print(l[rest])
| N,K = map(int, input().split())
A = list(map(int, input().split()))
move = 1
l = [1]
flag = [False]*(N+1)
flag[1] = True
for i in range(K):
move = A[move-1]
if flag[move]:
break
flag[move] = True
l.append(move)
ind = l.index(move)
rest = (K-ind) % (len(l) - ind) + ind
print(l[rest])
| [
"identifier.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 413,241 | 413,242 | u323859575 | python |
p02684 | #入力:N,M(int:整数)
def input2():
return map(int,input().split())
#入力:[n1,n2,...nk](int:整数配列)
def input_array():
return list(map(int,input().split()))
n,k=input2()
A=input_array()
# ある地点から循環に陥る
judge=[True]*n
tmps=[1] #循環手前
count=0 #参照地点
for i in range(2*(10**5)+1):
if judge[count]==True:
judge[count]=False
co... | #入力:N,M(int:整数)
def input2():
return map(int,input().split())
#入力:[n1,n2,...nk](int:整数配列)
def input_array():
return list(map(int,input().split()))
n,k=input2()
A=input_array()
# ある地点から循環に陥る
judge=[True]*n
tmps=[1] #循環手前
count=0 #参照地点
for i in range(2*(10**5)+1):
if judge[count]==True:
judge[count]=False
co... | [
"call.add",
"call.arguments.change"
] | 413,245 | 413,246 | u602773379 | python |
p02684 | n,k=map(int,input().split())
a=list(map(int,input().split()))
data=[0]*(n+1)
data[1]=1
ans=[1]
res=0
for i in range(n):
p=a[res]
if data[p]==0:
data[p]=1
ans.append(p)
res=p-1
else:
res=ans.index(p)
break
if len(ans)>=k:
print(ans[k])
else:
m=len(ans)-res
k-=res
d=k%m
print(ans[res+d... | n,k=map(int,input().split())
a=list(map(int,input().split()))
data=[0]*(n+1)
data[1]=1
ans=[1]
res=0
for i in range(n):
p=a[res]
if data[p]==0:
data[p]=1
ans.append(p)
res=p-1
else:
res=ans.index(p)
break
if len(ans)>k:
print(ans[k])
else:
m=len(ans)-res
k-=res
d=k%m
print(ans[res+d]... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 413,271 | 413,272 | u583507988 | python |
p02684 | n,k=map(int,input().split())
a=[int(i) for i in input().split()]
d=[0]
w=set([0])
x=0
for i in range(n):
if a[x]-1 not in w:
d.append(a[x]-1)
w.add(a[x]-1)
x=a[x]-1
else:
f=a[x]-1
break
#print(d)
if k<len(d):
print(d[k])
else:
x=k-len(d)
y=d.index(f)
z=le... | n,k=map(int,input().split())
a=[int(i) for i in input().split()]
d=[0]
w=set([0])
x=0
for i in range(n):
if a[x]-1 not in w:
d.append(a[x]-1)
w.add(a[x]-1)
x=a[x]-1
else:
f=a[x]-1
break
#print(d)
if k<len(d):
print(d[k]+1)
else:
x=k-len(d)
y=d.index(f)
z=... | [
"expression.operation.binary.add"
] | 413,286 | 413,287 | u123756661 | python |
p02684 | #!/usr/bin/env python3
import numpy as np
# def input():
# return sys.stdin.readline().rstrip()
def main():
n, k = map(int, input().split())
warps = list(map(int, input().split()))
warps = [0] + warps
warps = np.array(warps, dtype=int)
order_num = np.zeros(len(warps) + 1, dtype=int)
p... | #!/usr/bin/env python3
import numpy as np
# def input():
# return sys.stdin.readline().rstrip()
def main():
n, k = map(int, input().split())
warps = list(map(int, input().split()))
warps = [0] + warps
warps = np.array(warps, dtype=int)
order_num = np.zeros(len(warps) + 1, dtype=int)
p... | [
"expression.operation.binary.remove"
] | 413,288 | 413,289 | u562767072 | python |
p02684 | if __name__ == '__main__':
n,k = map(int,input().split())
A = [0]
AA= list(map(int,input().split()))
A = A + AA
B = set()
cnt = 0
ind = 1
startind = 0
D = []
while True:
if A[ind] not in B:
B.add(ind)
D.append(ind)
cnt += 1
... | if __name__ == '__main__':
n,k = map(int,input().split())
A = [0]
AA= list(map(int,input().split()))
A = A + AA
B = set()
cnt = 0
ind = 1
startind = 0
D = []
while True:
if A[ind] not in B:
B.add(ind)
D.append(ind)
cnt += 1
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 413,294 | 413,295 | u517797706 | python |
p02684 | N,K=map(int,input().split())
A=list(map(int,input().split()))
B=[0]*(N+1)
B[0]=1;c=0;d=0
if B[0] in A:c=B[0]
for i in range(1,N+1):
B[i]=A[B[i-1]-1]
# if c==B[i]:break
# if A.count(B[i])>1 and d==0:c=B[i];d+=1
d=B.index(B[-1])+1
#print(B.index(B[N-1]))
#print(B,d)
#print(d+1+(K-d-1)%(N-d-1))
#print(B[K],K,d,(K+1-... | N,K=map(int,input().split())
A=list(map(int,input().split()))
B=[0]*(N+1)
B[0]=1;c=0;d=0
if B[0] in A:c=B[0]
for i in range(1,N+1):
B[i]=A[B[i-1]-1]
# if c==B[i]:break
# if A.count(B[i])>1 and d==0:c=B[i];d+=1
d=B.index(B[-1])+1
#print(B.index(B[N-1]))
#print(B,d)
#print(d+1+(K-d-1)%(N-d-1))
#print(B[K],K,d,(K+1-... | [
"call.arguments.change"
] | 413,296 | 413,297 | u580273604 | python |
p02684 | #####################################################################################################
##### 深さ優先探索 幅優先探索 （グラフ）
#####################################################################################################
'''
キューに頂点を入れる回数は各々高々１回のみ。
各辺を使う回数は高々一回のみ（辺を戻るような探索は枝切りされている）
結果として、計算量はO(N + M)
'''
fr... | #####################################################################################################
##### 深さ優先探索 幅優先探索 （グラフ）
#####################################################################################################
'''
キューに頂点を入れる回数は各々高々１回のみ。
各辺を使う回数は高々一回のみ（辺を戻るような探索は枝切りされている）
結果として、計算量はO(N + M)
'''
fr... | [
"call.remove"
] | 413,334 | 413,335 | u367701763 | python |
p02684 | from collections import deque
N, K = map(int, input().split())
towns = [0] + list(map(int, input().split()))
checked = [-1 for _ in range(N+1)]
checked[1] = 0
next = towns[1]
count = 1
while(checked[next] < 0):
checked[next] = count
count += 1
next = towns[next]
loop = count - checked[next]
pos = 0
if K > c... | from collections import deque
N, K = map(int, input().split())
towns = [0] + list(map(int, input().split()))
checked = [-1 for _ in range(N+1)]
checked[1] = 0
next = towns[1]
count = 1
while(checked[next] < 0):
checked[next] = count
count += 1
next = towns[next]
loop = count - checked[next]
pos = 0
if K >= ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 413,348 | 413,349 | u626337957 | python |
p02684 | from collections import defaultdict
def main():
n, k = map(int, input().split(" "))
a = list(map(int, input().split(" ")))
s = []
ord = [-1]*(n)
u = 1
while ord[u] == -1:
ord[u] = len(s)
s.append(u)
u = a[u-1]
l = len(s) - ord[u]
if k < ord[u]:
print(s[k])... | from collections import defaultdict
def main():
n, k = map(int, input().split(" "))
a = list(map(int, input().split(" ")))
s = []
ord = [-1]*(n+1)
u = 1
while ord[u] == -1:
ord[u] = len(s)
s.append(u)
u = a[u-1]
l = len(s) - ord[u]
if k < ord[u]:
print(s[k... | [
"assignment.change"
] | 413,371 | 413,372 | u872271866 | python |
p02684 | from collections import defaultdict
def main():
n, k = map(int, input().split(" "))
a = list(map(int, input().split(" ")))
s = []
ord = [-1]*(n+1)
u = 1
while ord[u] == -1:
ord[u] = len(s)
s.append(u)
u = a[u-1]
l = len(s) - ord[u]
if k < l:
print(s[k])
... | from collections import defaultdict
def main():
n, k = map(int, input().split(" "))
a = list(map(int, input().split(" ")))
s = []
ord = [-1]*(n+1)
u = 1
while ord[u] == -1:
ord[u] = len(s)
s.append(u)
u = a[u-1]
l = len(s) - ord[u]
if k < ord[u]:
print(s[k... | [
"control_flow.branch.if.condition.change"
] | 413,373 | 413,372 | u872271866 | python |
p02684 | import sys
read = sys.stdin.read
readlines = sys.stdin.readlines
from collections import defaultdict
def main():
n, k, *a = map(int, read().split())
cur_town = 0
transits = set()
tran_time = defaultdict(int)
cnt = 0
while True:
if k == 0:
print(cur_town)
sys.exit... | import sys
read = sys.stdin.read
readlines = sys.stdin.readlines
from collections import defaultdict
def main():
n, k, *a = map(int, read().split())
cur_town = 0
transits = set()
tran_time = defaultdict(int)
cnt = 0
while True:
if k == 0:
print(cur_town + 1)
sys.... | [
"expression.operation.binary.add"
] | 413,376 | 413,377 | u072717685 | python |
p02684 | from copy import deepcopy
def main():
n, k = map(int, input().split())
a = [int(x)-1 for x in input().split()]
visited = set()
i = 0
cnt = 0
# 途中で前に行ったところに行ったら終わり
# kが小さくてcnt == kになってもおわり
while True:
if i in visited:
break
visited.add(i)
cnt += 1
... | from copy import deepcopy
def main():
n, k = map(int, input().split())
a = [int(x)-1 for x in input().split()]
visited = set()
i = 0
cnt = 0
# 途中で前に行ったところに行ったら終わり
# kが小さくてcnt == kになってもおわり
while True:
if i in visited:
break
visited.add(i)
cnt += 1
... | [
"call.arguments.change",
"io.output.change"
] | 413,383 | 413,384 | u243312682 | python |
p02684 | 259
N,K=map(int,input().split())
A=[0]+list(map(int,input().split()))
m=1
towns=[1]
flg=[0]*(N+1)
flg[1]=1
while 1:
m=A[m]
towns.append(m)
if flg[m]==1:
l=len(towns)-towns.index(m)-1
break
flg[m]=1
pl=towns.index(m)
if K<=pl:
print(pl)
else:
print(towns[(K-pl)%l+pl]) | 259
N,K=map(int,input().split())
A=[0]+list(map(int,input().split()))
m=1
towns=[1]
flg=[0]*(N+1)
flg[1]=1
while 1:
m=A[m]
towns.append(m)
if flg[m]==1:
l=len(towns)-towns.index(m)-1
break
flg[m]=1
pl=towns.index(m)
if K<=pl:
print(towns[K])
else:
print(towns[(K-pl)%l+pl]) | [
"call.arguments.change",
"io.output.change"
] | 413,385 | 413,386 | u842170774 | python |
p02684 | N,K = map(int,input().split())
A = list(map(int,input().split()))
A.insert(0,0)
B = {1:1}
x = A[1]
st = 0
while True:
if x not in B:
B[x] = 1
x = A[x]
else:
st = x
break
x = 1
t = 0
while x!=st:
x = A[x]
t += 1
x = st
x = A[x]
T = 1
while x!=st:
x = A[x]
T += 1
if... | N,K = map(int,input().split())
A = list(map(int,input().split()))
A.insert(0,0)
B = {1:1}
x = A[1]
st = 0
while True:
if x not in B:
B[x] = 1
x = A[x]
else:
st = x
break
x = 1
t = 0
while x!=st:
x = A[x]
t += 1
x = st
x = A[x]
T = 1
while x!=st:
x = A[x]
T += 1
if... | [
"identifier.change",
"control_flow.loop.condition.change"
] | 413,395 | 413,396 | u644907318 | python |
p02684 | N, K = map(int, input().split())
warp = list(map(int, input().split()))
warp = [i - 1 for i in warp]
visit = [0]
current_loc = 0
while warp[current_loc] != -1:
visit.append(warp[current_loc])
warp[current_loc] = -1
current_loc = visit[-1]
res = visit.index(visit[-1])
cycle = visit[res + 1:]
if K <= res:
prin... | N, K = map(int, input().split())
warp = list(map(int, input().split()))
warp = [i - 1 for i in warp]
visit = [0]
current_loc = 0
while warp[current_loc] != -1:
visit.append(warp[current_loc])
warp[current_loc] = -1
current_loc = visit[-1]
res = visit.index(visit[-1])
cycle = visit[res + 1:]
if K <= res:
prin... | [
"expression.operation.binary.add"
] | 413,397 | 413,398 | u617384447 | python |
p02684 | n, k = map(int, input().split())
a = list(map(int, input().split()))
rec = [0]
i = 0
flag = [0 for _ in range(n + 1)]
while True:
if flag[rec[i]] == 0:
flag[rec[i]] = 1
rec.append(a[rec[i]] - 1)
else:
start = rec.index(a[rec[i]] - 1)
loop = rec[start:]
pre = rec[:start]
... | n, k = map(int, input().split())
a = list(map(int, input().split()))
rec = [0]
i = 0
flag = [0 for _ in range(n + 1)]
while True:
if flag[rec[i]] == 0:
flag[rec[i]] = 1
rec.append(a[rec[i]] - 1)
else:
start = rec.index(a[rec[i]] - 1)
loop = rec[start:]
pre = rec[:start]
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 413,399 | 413,400 | u688219499 | python |
p02684 | # -*- coding: utf-8 -*-
"""
Created on Mon Sep 7 18:05:47 2020
@author: liang
"""
N, K = map(int, input().split())
A = [int(x) for x in input().split()]
visited = [-1]*N
loop = list()
cur = 1
cnt = 0
while visited[cur-1] == -1:
#while True:
visited[cur-1] = cnt
loop.append(cur)
cnt += 1
cur = A[cur-... | # -*- coding: utf-8 -*-
"""
Created on Mon Sep 7 18:05:47 2020
@author: liang
"""
N, K = map(int, input().split())
A = [int(x) for x in input().split()]
visited = [-1]*N
loop = list()
cur = 1
cnt = 0
while visited[cur-1] == -1:
#while True:
visited[cur-1] = cnt
loop.append(cur)
cnt += 1
cur = A[cur-... | [
"call.remove"
] | 413,406 | 413,407 | u628285938 | python |
p02684 | n,k = map(int,input().split())
A=list(map(int,input().split()) )
kyori = [-1] *len(A)
junban =[]
x=0
d=0
while kyori[x] == -1:
junban.append(x)
kyori[x]=d
d+=1
x=A[x]-1
roop_x = x
roop_d = d - kyori[x]
if k<d:
print(junban[k]+1)
else:
k0 = kyori[x]-1
k1 = (k-k0)... | n,k = map(int,input().split())
A=list(map(int,input().split()) )
kyori = [-1] *len(A)
junban =[]
x=0
d=0
while kyori[x] == -1:
junban.append(x)
kyori[x]=d
d+=1
x=A[x]-1
roop_x = x
roop_d = d - kyori[x]
# for k in range(100):
if k<d:
print(junban[k]+1)
else:
k0 = ky... | [
"expression.operation.binary.remove"
] | 413,410 | 413,411 | u474202990 | python |
p02684 | N,K = map(int,input().split())
A = list(map(lambda x:int(x)-1,input().split()))
i = 0
visited = set([0])
while K > 0:
i = A[i]
K -= 1
if i in visited:
break
visited.add(i)
if K == 0:
print(i)
exit(0)
ls = [i]
j = i
while True:
j = A[j]
if j == i:
break
ls.append(j)
p... | N,K = map(int,input().split())
A = list(map(lambda x:int(x)-1,input().split()))
i = 0
visited = set([0])
while K > 0:
i = A[i]
K -= 1
if i in visited:
break
visited.add(i)
if K == 0:
print(i+1)
exit(0)
ls = [i]
j = i
while True:
j = A[j]
if j == i:
break
ls.append(j)... | [
"expression.operation.binary.add"
] | 413,428 | 413,429 | u231095456 | python |
p02684 | def delete_head_zeros(n):
n = str(n)
l = len(n)
if "." in n:
l = n.find(".")
head_zeros = 0
for i in range(l - 1):
if n[i] == "0":
head_zeros += 1
else:
break
return n[head_zeros:]
# compare a, b
# a, b: int or string
def bigint_compare(a, b):
a = delete_head_zeros(a)
b = delete_head_zeros(b)
if ... | def delete_head_zeros(n):
n = str(n)
l = len(n)
if "." in n:
l = n.find(".")
head_zeros = 0
for i in range(l - 1):
if n[i] == "0":
head_zeros += 1
else:
break
return n[head_zeros:]
# compare a, b
# a, b: int or string
def bigint_compare(a, b):
a = delete_head_zeros(a)
b = delete_head_zeros(b)
if ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 413,430 | 413,431 | u739843002 | python |
p02684 | def delete_head_zeros(n):
n = str(n)
l = len(n)
if "." in n:
l = n.find(".")
head_zeros = 0
for i in range(l - 1):
if n[i] == "0":
head_zeros += 1
else:
break
return n[head_zeros:]
# compare a, b
# a, b: int or string
def bigint_compare(a, b):
a = delete_head_zeros(a)
b = delete_head_zeros(b)
if ... | def delete_head_zeros(n):
n = str(n)
l = len(n)
if "." in n:
l = n.find(".")
head_zeros = 0
for i in range(l - 1):
if n[i] == "0":
head_zeros += 1
else:
break
return n[head_zeros:]
# compare a, b
# a, b: int or string
def bigint_compare(a, b):
a = delete_head_zeros(a)
b = delete_head_zeros(b)
if ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 413,432 | 413,431 | u739843002 | python |
p02684 | n,k = map(int,input().split())
button = list(map(int,input().split()))
visit = [-1]*n
hisitory = [-1]
push = 0
f = 0
for i in range(k):
visit[push] = i+1
hisitory.append(push)
push = button[push] -1
if(visit[push] != -1):
f = 1
start = visit[push]
last=push
end = i+1
... | n,k = map(int,input().split())
button = list(map(int,input().split()))
visit = [-1]*n
hisitory = [-1]
push = 0
f = 0
for i in range(k):
visit[push] = i+1
hisitory.append(push)
push = button[push] -1
if(visit[push] != -1):
f = 1
start = visit[push]
last=push
end = i+1
... | [
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 413,438 | 413,439 | u802234211 | python |
p02684 | N, K = map(int, input().split())
A = list(map(int, input().split()))
A.insert(0, 0)
v = [-1] * (N + 1)
n = 1
f = 0
for i in range(N):
v[n] = i
n = A[n]
if v[n] != -1:
f = 1
s = n #ループのスタート
t = i
l = t - v[s] + 1
break
if t >= K:
print(v.index(K))
else:
K = ... | N, K = map(int, input().split())
A = list(map(int, input().split()))
A.insert(0, 0)
v = [-1] * (N + 1)
n = 1
f = 0
for i in range(N):
v[n] = i
n = A[n]
if v[n] != -1:
f = 1
s = n #ループのスタート
t = i
l = t - v[s] + 1
break
if t >= K:
print(v.index(K))
else:
K = ... | [
"call.arguments.change"
] | 413,451 | 413,452 | u990726146 | python |
p02684 | import sys
from collections import deque
N, K = map(int, sys.stdin.readline().strip().split())
tmp = list(map(int, sys.stdin.readline().strip().split()))
A = [a-1 for a in tmp]
visited = set()
loop = []
q = deque()
q.append(0)
start = float("inf")
end = float("inf")
count = 0
while q and count < K:
s_town = q.... | import sys
from collections import deque
N, K = map(int, sys.stdin.readline().strip().split())
tmp = list(map(int, sys.stdin.readline().strip().split()))
A = [a-1 for a in tmp]
visited = set()
loop = []
q = deque()
q.append(0)
start = float("inf")
end = float("inf")
count = 0
while q and count <= N:
s_town = q... | [] | 413,453 | 413,454 | u028973125 | python |
p02684 | N , K = map(int,input().split())
A = list(map(int,input().split()))
reach = [-1 for i in range(N)]
reach[0] = 0 #最初の町は0回でいく
now = 0
#loop = 1
dic ={}
dic[0] = 0
for i in range(N+1):
to = A[now]-1
if reach[to] != -1:
ini = i+1
#print(i,to,reach[to])
loop = i+1 - reach[to]
break
if i+1 not in dic:... | N , K = map(int,input().split())
A = list(map(int,input().split()))
reach = [-1 for i in range(N)]
reach[0] = 0 #最初の町は0回でいく
now = 0
#loop = 1
dic ={}
dic[0] = 0
for i in range(N):
to = A[now]-1
if reach[to] != -1:
ini = i+1
#print(i,to,reach[to])
loop = i+1 - reach[to]
break
if i+1 not in dic:... | [
"expression.operation.binary.remove",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 413,459 | 413,460 | u197457087 | python |
p02684 | N , K = map(int,input().split())
A = list(map(int,input().split()))
reach = [-1 for i in range(N)]
reach[0] = 0 #最初の町は0回でいく
now = 0
#loop = 1
dic ={}
dic[0] = 0
for i in range(N):
to = A[now]-1
if reach[to] != -1:
ini = i+1
#print(i,to,reach[to])
loop = i+1 - reach[to]
break
if i+1 not in dic:
... | N , K = map(int,input().split())
A = list(map(int,input().split()))
reach = [-1 for i in range(N)]
reach[0] = 0 #最初の町は0回でいく
now = 0
#loop = 1
dic ={}
dic[0] = 0
for i in range(N):
to = A[now]-1
if reach[to] != -1:
ini = i+1
#print(i,to,reach[to])
loop = i+1 - reach[to]
break
if i+1 not in dic:... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 413,461 | 413,460 | u197457087 | python |
p02684 | def resolve():
N, K = list(map(int, input().split()))
A = list(map(lambda x: int(x)-1, input().split()))
routes = [0]
current = 0
visited = [False for _ in range(N)]
visited[0] = True
while visited[A[current]] is False:
current = A[current]
routes.append(current)
visi... | def resolve():
N, K = list(map(int, input().split()))
A = list(map(lambda x: int(x)-1, input().split()))
routes = [0]
current = 0
visited = [False for _ in range(N)]
visited[0] = True
while visited[A[current]] is False:
current = A[current]
routes.append(current)
visi... | [
"expression.operation.binary.add"
] | 413,464 | 413,465 | u106797249 | python |
p02684 | #! /usr/bin/env python3
from math import gcd
# from math import gcd
from collections import Counter, deque, defaultdict
from heapq import heappush, heappop, heappushpop, heapify, heapreplace, merge
from bisect import bisect_left, bisect_right, bisect, insort_left, insort_right, insort
from itertools import accumulate,... | #! /usr/bin/env python3
from math import gcd
# from math import gcd
from collections import Counter, deque, defaultdict
from heapq import heappush, heappop, heappushpop, heapify, heapreplace, merge
from bisect import bisect_left, bisect_right, bisect, insort_left, insort_right, insort
from itertools import accumulate,... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 413,468 | 413,469 | u203669169 | python |
p02684 | #! /usr/bin/env python3
from math import gcd
# from math import gcd
from collections import Counter, deque, defaultdict
from heapq import heappush, heappop, heappushpop, heapify, heapreplace, merge
from bisect import bisect_left, bisect_right, bisect, insort_left, insort_right, insort
from itertools import accumulate,... | #! /usr/bin/env python3
from math import gcd
# from math import gcd
from collections import Counter, deque, defaultdict
from heapq import heappush, heappop, heappushpop, heapify, heapreplace, merge
from bisect import bisect_left, bisect_right, bisect, insort_left, insort_right, insort
from itertools import accumulate,... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 413,470 | 413,469 | u203669169 | python |
p02684 | N, K = map(int, input().split())
A = [0] + list(map(int, input().split()))
B = [-1 for i in range(N+1)]
B[1] = 0
n = 1
m = 0
while 1:
n = A[n]
m += 1
if m == K:
break
if B[n] == -1:
B[n] = m
else:
a = (K - m) % (m - B[n])
for i in range(a):
n = A[n]
print(n)
break | N, K = map(int, input().split())
A = [0] + list(map(int, input().split()))
B = [-1 for i in range(N+1)]
B[1] = 0
n = 1
m = 0
while 1:
n = A[n]
m += 1
if m == K:
print(n)
break
if B[n] == -1:
B[n] = m
else:
a = (K - m) % (m - B[n])
for i in range(a):
n = A[n]
print(n)
break | [
"call.add"
] | 413,473 | 413,474 | u666550725 | python |
p02684 | import copy
N, K = map(int, input().split())
A = list(map(int, input().split()))
routes = [0]
visited = [False] * N
visited[0] = True
now = 0
while True:
next_town = A[now] - 1
if visited[next_town]:
routes.append(next_town)
break
visited[next_town] = True
routes.append(next_town)
no... | import copy
N, K = map(int, input().split())
A = list(map(int, input().split()))
routes = [0]
visited = [False] * N
visited[0] = True
now = 0
while True:
next_town = A[now] - 1
if visited[next_town]:
routes.append(next_town)
break
visited[next_town] = True
routes.append(next_town)
no... | [
"expression.operation.binary.add"
] | 413,475 | 413,476 | u981931040 | python |
p02684 | n,k=map(int,input().split())
a=list(map(int,input().split()))
now=0
visited=set()
visited.add((0))
visited2=[0]
while True:
k-=1
now=a[now]-1
if k==0:
print(now-1)
exit()
if now in visited:
visited.add((now))
visited2.append(now)
break
visited.add((now))
visited2.append(now)... | n,k=map(int,input().split())
a=list(map(int,input().split()))
now=0
visited=set()
visited.add((0))
visited2=[0]
while True:
k-=1
now=a[now]-1
if k==0:
print(now+1)
exit()
if now in visited:
visited.add((now))
visited2.append(now)
break
visited.add((now))
visited2.append(now)
x... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 413,477 | 413,478 | u350093546 | python |
p02684 | n,k=map(int,input().split())
a=list(map(int,input().split()))
result=[1]
temp=1
for i in range(n):
temp=a[temp-1]
result.append(temp)
temp=result.index(result[len(result)-1])
c=len(result)-temp-1
if k<n:
print(result[k+1])
else:
print(result[temp+(k-temp)%c]) | n,k=map(int,input().split())
a=list(map(int,input().split()))
result=[1]
temp=1
for i in range(n):
temp=a[temp-1]
result.append(temp)
temp=result.index(result[len(result)-1])
c=len(result)-temp-1
if k<n:
print(result[k])
else:
print(result[temp+(k-temp)%c]) | [
"expression.operation.binary.remove"
] | 413,484 | 413,485 | u629350026 | python |
p02684 | import sys
INF = 1 << 60
MOD = 10**9 + 7 # 998244353
sys.setrecursionlimit(2147483647)
input = lambda:sys.stdin.readline().rstrip()
def resolve():
n, k = map(int, input().split())
f = list(map(lambda x : int(x) - 1, input().split()))
step = [-1] * n
step[0] = 0
now = 0
while step[f[now]] == -1:
... | import sys
INF = 1 << 60
MOD = 10**9 + 7 # 998244353
sys.setrecursionlimit(2147483647)
input = lambda:sys.stdin.readline().rstrip()
def resolve():
n, k = map(int, input().split())
f = list(map(lambda x : int(x) - 1, input().split()))
step = [-1] * n
step[0] = 0
now = 0
while step[f[now]] == -1:
... | [
"expression.operation.binary.add"
] | 413,494 | 413,495 | u440566786 | python |
p02684 | n, k = map(int, input().split())
num = list(map(int, input().split()))
t = [-1] * n
count = 0
s = 1
while t[s - 1] == -1:
if count == k:
break
t[s - 1] = count
count += 1
s = num[s - 1]
else:
z = (k - t[s - 1]) % (count - t[s - 1])
s = t.index(t[s - 1] + z + 1)
print(s)
| n, k = map(int, input().split())
num = list(map(int, input().split()))
t = [-1] * n
count = 0
s = 1
while t[s - 1] == -1:
if count == k:
break
t[s - 1] = count
count += 1
s = num[s - 1]
else:
z = (k - t[s - 1]) % (count - t[s - 1])
s = t.index(t[s - 1] + z) + 1
print(s)
| [
"call.arguments.change"
] | 413,496 | 413,497 | u250554058 | python |
p02684 | n, k = map(int, input().split())
num = list(map(int, input().split()))
t = [-1] * n
count = 0
s = 1
while t[s - 1] == -1:
if count == k:
break
t[s - 1] = count
count += 1
s = num[s - 1]
else:
z = (k - t[s - 1]) % (count - t[s - 1])
print(t.index(t[s - 1] + z) + 1)
| n, k = map(int, input().split())
num = list(map(int, input().split()))
t = [-1] * n
count = 0
s = 1
while t[s - 1] == -1:
if count == k:
break
t[s - 1] = count
count += 1
s = num[s - 1]
else:
z = (k - t[s - 1]) % (count - t[s - 1])
s = t.index(t[s - 1] + z) + 1
print(s)
| [
"call.add"
] | 413,498 | 413,497 | u250554058 | python |
p02684 | n, k = map(int, input().split())
q = list(map(int, input().split()))
v = [-1]*(n+1)
p = []
a = 1
c = 0
while 1:
if v[a] != -1:
l = c-v[a]
if k < c:
print(p[k])
else:
print(p[(k-v[a])%l+v[a]])
break
v[a] = c
c += 1
p.append(a)
a = q[a] | n, k = map(int, input().split())
q = list(map(int, input().split()))
v = [-1]*(n+1)
p = []
a = 1
c = 0
while 1:
if v[a] != -1:
l = c-v[a]
if k < c:
print(p[k])
else:
print(p[(k-v[a])%l+v[a]])
break
v[a] = c
c += 1
p.append(a)
a = q[a-1] | [
"assignment.change"
] | 413,500 | 413,501 | u531599639 | python |
p02684 | N, K = map(int, input().split())
A = list(map(int, input().split()))
visited = [False]*N
path = [0]
at = 0
loop = 0
visited[0]=True
for i in range(N):
at = A[at]-1
if visited[at]:
loop = i+1-path.index(at)
break
else:
visited[at]=True
path.append(at)
if K <= len(path):
pr... | N, K = map(int, input().split())
A = list(map(int, input().split()))
visited = [False]*N
path = [0]
at = 0
loop = 0
visited[0]=True
for i in range(N):
at = A[at]-1
if visited[at]:
loop = i+1-path.index(at)
break
else:
visited[at]=True
path.append(at)
if K < len(path):
pri... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 413,502 | 413,503 | u531599639 | python |
p02684 | n, k = map(int, input().split())
a = [int(x)-1 for x in input().split()]
v = []
vc = [0]*n
b = 0
c = 0
while True:
if vc[b]>0:
stop = v.index(b)
break
v.append(b)
vc[b] += 1
b = a[b]
c += 1
if k>c:
r = (k-stop)%(c-stop)
print(v[stop+r]+1)
else:
print(v[k]+1) | n, k = map(int, input().split())
a = [int(x)-1 for x in input().split()]
v = []
vc = [0]*n
b = 0
c = 0
while True:
if vc[b]>0:
stop = v.index(b)
break
v.append(b)
vc[b] += 1
b = a[b]
c += 1
if k>stop:
r = (k-stop)%(c-stop)
print(v[stop+r]+1)
else:
print(v[k]+1)
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 413,511 | 413,512 | u952773501 | python |
p02684 | n, k = map(int, input().split())
a = list(map(int, input().split()))
n_buf = [0 for i in range(n)]
path_buf = []
now = 1
while True:
n_buf[now - 1] = 1
_next = a[now - 1]
path_buf.append(now)
if n_buf[_next - 1] == 1:
path_buf.append(_next)
break
now = _next
index = path_buf.inde... | n, k = map(int, input().split())
a = list(map(int, input().split()))
n_buf = [0 for i in range(n)]
path_buf = []
now = 1
while True:
n_buf[now - 1] = 1
_next = a[now - 1]
path_buf.append(now)
if n_buf[_next - 1] == 1:
path_buf.append(_next)
break
now = _next
index = path_buf.inde... | [
"expression.operation.binary.remove"
] | 413,519 | 413,520 | u464627439 | python |
p02684 | n, k = map(int, input().split())
a = list(map(int, input().split()))
n_buf = [0 for i in range(n)]
path_buf = []
now = 1
while True:
n_buf[now - 1] = 1
_next = a[now - 1]
path_buf.append(now)
if n_buf[_next - 1] == 1:
path_buf.append(_next)
break
now = _next
index = path_buf.inde... | n, k = map(int, input().split())
a = list(map(int, input().split()))
n_buf = [0 for i in range(n)]
path_buf = []
now = 1
while True:
n_buf[now - 1] = 1
_next = a[now - 1]
path_buf.append(now)
if n_buf[_next - 1] == 1:
path_buf.append(_next)
break
now = _next
index = path_buf.inde... | [
"expression.operation.binary.remove"
] | 413,521 | 413,520 | u464627439 | python |
p02684 | n,k=list(map(int,input().split()))
a=[0]+ list(map(int,input().split()))
visited=[1]
for i in range(n):
next=a[visited[-1]]
visited.append(next)
loop_end=n
loop_start=n-1
while visited[loop_start]!=visited[loop_end]:
loop_start-=1
period=loop_end-loop_start
#print(visited)
#print("p:",period)
#print("k%peri... | n,k=list(map(int,input().split()))
a=[0]+ list(map(int,input().split()))
visited=[1]
for i in range(n):
next=a[visited[-1]]
visited.append(next)
loop_end=n
loop_start=n-1
while visited[loop_start]!=visited[loop_end]:
loop_start-=1
period=loop_end-loop_start
#print(visited)
#print("p:",period)
#print("(k-n)%... | [
"expression.operation.binary.remove"
] | 413,536 | 413,537 | u464205401 | python |
p02684 | N, K = map(int, input().split())
A = list(map(int, input().split()))
# mp = dict()
# for ix in range(N):
# mp[ix+1] = A[ix]
hist = []
exists = [0] * (N+1)
cur = 1
cnt = 0
# ここがおかしい?
# while True:
# cur = mp[cur]
# cnt += 1
# # K -= 1
# if exists[cur] != 0:
# break
# else:
# e... | N, K = map(int, input().split())
A = list(map(int, input().split()))
# mp = dict()
# for ix in range(N):
# mp[ix+1] = A[ix]
hist = []
exists = [0] * (N+1)
cur = 1
cnt = 0
# ここがおかしい?
# while True:
# cur = mp[cur]
# cnt += 1
# # K -= 1
# if exists[cur] != 0:
# break
# else:
# e... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 413,540 | 413,541 | u871841829 | python |
p02684 | N,K=map(int,input().split())
A=list(map(int,input().split()))
now=1
count=0
a=0
l=[1]
b=0
c=0
q=[True]*N
while a==0and count<K:
now=A[now-1]
count+=1
if q[now-1]:
a=1
else:
l.append(now)
q[now-1]=False
b=l.index(now)
c=count-b
if count==K:
print(now)
else:
n= ((K... | N,K=map(int,input().split())
A=list(map(int,input().split()))
now=1
count=0
a=0
l=[1]
b=0
c=0
q=[False]*N
while a==0and count<K:
now=A[now-1]
count+=1
if q[now-1]:
a=1
else:
l.append(now)
q[now-1]=True
b=l.index(now)
c=count-b
if count==K:
print(now)
else:
n= ((K... | [
"misc.opposites",
"assignment.value.change",
"expression.operation.binary.change"
] | 413,548 | 413,549 | u257265865 | python |
p02684 | N, K = map(int, input().split())
A_i = list(map(int, input().split()))
place = 1
road = [0 for i in range(N)]
cycle = 0
road[0] = 1
while K != 0:
place = A_i[place - 1]
K -= 1
if road[place - 1] == 1:
loop_place = place
break
road[place - 1] = 1
while K != 0:
loop_place = A_i[lo... | N, K = map(int, input().split())
A_i = list(map(int, input().split()))
place = 1
road = [0 for i in range(N)]
cycle = 0
road[0] = 1
while K != 0:
place = A_i[place - 1]
K -= 1
if road[place - 1] == 1:
loop_place = place
break
road[place - 1] = 1
while K != 0:
loop_place = A_i[loo... | [
"control_flow.branch.if.add"
] | 413,557 | 413,558 | u458315482 | python |
p02684 | n, k = map(int, input().split())
x = list(map(int, input().split()))
count = 1
machi = 0
machi_list = [0]
next_machi = x[machi] - 1
machi_dict = [0] * n
machi_dict[0] = 1
while True:
if machi_dict[next_machi] == 1:
break
count += 1
print(machi_dict)
machi_dict[next_machi] = 1
machi_list.appe... | n, k = map(int, input().split())
x = list(map(int, input().split()))
count = 1
machi = 0
machi_list = [0]
next_machi = x[machi] - 1
machi_dict = [0] * n
machi_dict[0] = 1
while True:
if machi_dict[next_machi] == 1:
break
count += 1
machi_dict[next_machi] = 1
machi_list.append(next_machi)
mac... | [
"call.remove"
] | 413,587 | 413,588 | u264312747 | python |
p02684 | N,K=map(int,input().split())
array=map(int,input().split())
A=list(array)
A.insert(0,0)
visit=0
root=[]
visited=1
once=0
while True:
if visit & (0b1<<visited):
break
root.append(visited)
visit|=0b1<<visited
once+=1
visited=A[visited]
roop=root[root.index(visited):]
if K<=once:
print(... | N,K=map(int,input().split())
array=map(int,input().split())
A=list(array)
A.insert(0,0)
visit=0
root=[]
visited=1
once=0
while True:
if visit & (0b1<<visited):
break
root.append(visited)
visit|=0b1<<visited
once+=1
visited=A[visited]
roop=root[root.index(visited):]
if K<once:
print(r... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 413,606 | 413,607 | u970598682 | python |
p02684 | N,K=map(int,input().split())
array=map(int,input().split())
A=list(array)
A.insert(0,0)
visit=0
root=[]
visited=1
once=0
while True:
if visit & (0b1<<visited):
break
root.append(visited)
visit|=0b1<<visited
once+=1
visited=A[visited]
roop=root[root.index(visited):]
print(roop)
if K<=once... | N,K=map(int,input().split())
array=map(int,input().split())
A=list(array)
A.insert(0,0)
visit=0
root=[]
visited=1
once=0
while True:
if visit & (0b1<<visited):
break
root.append(visited)
visit|=0b1<<visited
once+=1
visited=A[visited]
roop=root[root.index(visited):]
if K<once:
print(r... | [
"call.remove",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 413,608 | 413,607 | u970598682 | python |
p02684 | n, k = map(int, input().split())
a = list(map(int, input().split()))
for i in range(n):
a[i] -= 1
l = [-1]*(n + 1)
l[1] = 1
order = 1
now = 0
while k > 0:
k -= 1
now = a[now]
order += 1
if l[now] == -1:
l[now] = order
else:
loop = order - l[now] + 1
k %= loop
... | n, k = map(int, input().split())
a = list(map(int, input().split()))
for i in range(n):
a[i] -= 1
l = [-1]*(n + 1)
l[0] = 0
order = 0
now = 0
while k > 0:
k -= 1
now = a[now]
order += 1
if l[now] == -1:
l[now] = order
else:
loop = order - l[now]
k %= loop
brea... | [
"literal.number.integer.change",
"assignment.variable.change",
"variable_access.subscript.index.change",
"assignment.value.change",
"expression.operation.binary.remove"
] | 413,620 | 413,621 | u991567869 | python |
p02684 | N,K=map(int,(input().split()))
TO=list(map(int,input().split()))
visit_flag=[[0]*2 for i in [1]*N]
visit_count=0
first_visit=0
last_visit=0
next_town=1
visit_flag[0][0]=1
visit_flag[0][1]=0
for i in range(K):
visit_count+=1
next_town = TO[next_town-1]
if visit_flag[next_town-1][0]==0:
visit_flag[n... | N,K=map(int,(input().split()))
TO=list(map(int,input().split()))
visit_flag=[[0]*2 for i in [1]*N]
visit_count=0
first_visit=0
last_visit=0
next_town=1
visit_flag[0][0]=1
visit_flag[0][1]=0
for i in range(K):
visit_count+=1
next_town = TO[next_town-1]
if visit_flag[next_town-1][0]==0:
visit_flag[n... | [
"assignment.remove"
] | 413,627 | 413,628 | u446808186 | python |
p02684 | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(100000000)
stp = -1
def main():
n, k = map(int, readline().split())
a = [int(i)-1 for i in readline().split()]
order = []
ex = set()
def dfs(node):
glo... | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(100000000)
stp = -1
def main():
n, k = map(int, readline().split())
a = [int(i)-1 for i in readline().split()]
order = []
ex = set()
def dfs(node):
glo... | [
"expression.operation.binary.remove"
] | 413,644 | 413,645 | u775681539 | python |
p02684 | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(100000000)
stp = -1
def main():
n, k = map(int, readline().split())
a = [int(i)-1 for i in readline().split()]
order = []
ex = set()
def dfs(node):
glo... | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(100000000)
stp = -1
def main():
n, k = map(int, readline().split())
a = [int(i)-1 for i in readline().split()]
order = []
ex = set()
def dfs(node):
glo... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 413,646 | 413,645 | u775681539 | python |
p02684 | N, K = map(int, input().split())
A = list(map(int,input().split()))
moved = {}
now_city = 1
next_city = A[0]
i=0
while i < N:
moved[now_city] = i
if next_city in moved:
break
now_city = next_city
next_city = A[now_city-1]
i += 1
# i 回目の試行で、now_city から next_city に移ろうとしている
mod = i - moved... | N, K = map(int, input().split())
A = list(map(int,input().split()))
moved = {}
now_city = 1
next_city = A[0]
i=0
while i < N:
moved[now_city] = i
if next_city in moved:
break
now_city = next_city
next_city = A[now_city-1]
i += 1
# i 回目の試行で、now_city から next_city に移ろうとしている
mod = i - moved... | [
"expression.operation.binary.remove"
] | 413,654 | 413,655 | u877220920 | python |
p02684 | N,K = map(int,input().split())
A = list(map(int,input().split()))
visited = []
search = set()
now = 1#最初の街にいる
next_town = A[now-1]
count = 1
while(count<=N):
if next_town in search:#もし次の街が訪れたことがある場合
break#ループするので抜け出す
visited.append(now)#今いる街は訪れたこととなるので記録する
search.add(now)
next_town = A[now-1]#次に... | N,K = map(int,input().split())
A = list(map(int,input().split()))
visited = []
search = set()
now = 1#最初の街にいる
next_town = A[now-1]
count = 1
while(count<=N):
if next_town in search:#もし次の街が訪れたことがある場合
break#ループするので抜け出す
visited.append(now)#今いる街は訪れたこととなるので記録する
search.add(now)
next_town = A[now-1]#次に... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 413,667 | 413,668 | u811000506 | python |
p02684 | N,K = (int(i) for i in input().split())
A = [int(i) for i in input().split()]
A_done = [0]*N
A_route = []
point = 1
end_point = 0
while A_done[point-1]==0:
A_done[point-1] = 1
A_route.append(point)
point = A[point-1]
if A_done[point-1]==1:
end_point = point
cal = K%len(A_route)
roop = A_route.index(end_po... | N,K = (int(i) for i in input().split())
A = [int(i) for i in input().split()]
A_done = [0]*N
A_route = []
point = 1
end_point = 0
while A_done[point-1]==0:
A_done[point-1] = 1
A_route.append(point)
point = A[point-1]
if A_done[point-1]==1:
end_point = point
cal = K%len(A_route)
roop = A_route.index(end_po... | [
"call.arguments.change",
"io.output.change"
] | 413,669 | 413,670 | u573673983 | python |
p02684 | import numpy as np
def check_num_of_remaining_teleport(num_of_teleport, i):
if num_of_teleport == 0:
print(i)
exit()
num_of_town, num_of_teleport = map(int, input().split())
town = np.array(list(map(int, input().split())))
# 香り高い町の探索
i = 1
# テレポートの移動ルールに合わせて1始まりにする
fragranttown_index = 1
fragrant... | import numpy as np
def check_num_of_remaining_teleport(num_of_teleport, i):
if num_of_teleport == 0:
print(i)
exit()
num_of_town, num_of_teleport = map(int, input().split())
town = np.array(list(map(int, input().split())))
# 香り高い町の探索
i = 1
# テレポートの移動ルールに合わせて1始まりにする
fragranttown_index = 1
fragrant... | [
"expression.operation.binary.remove"
] | 413,677 | 413,678 | u036065030 | python |
p02684 | n,k=map(int,input().split())
a=list(map(lambda x:int(x)-1,input().split()))
lst=[0]
now=0
memo=0
town=[0]*n
town[0]=1
b=0
for i in range(k):
now=a[now]
if town[now]==1:
memo=now
b=1
break
lst.append(now)
town[now]=1
if b==1:
i=lst.index(memo)
l=len(lst)
if memo!=0:
lst=lst[i:]
l-=len(lst)
print(lst[(... | n,k=map(int,input().split())
a=list(map(lambda x:int(x)-1,input().split()))
lst=[0]
now=0
memo=0
town=[0]*n
town[0]=1
b=0
for i in range(k):
now=a[now]
if town[now]==1:
memo=now
b=1
break
lst.append(now)
town[now]=1
if b==1:
i=lst.index(memo)
l=len(lst)
if memo!=0:
lst=lst[i:]
l-=len(lst)
print(lst[(... | [
"expression.operation.binary.add"
] | 413,679 | 413,680 | u552201227 | python |
p02684 | num_town, num_move = map(int, input().split())
teleports = list(map(lambda x: int(x) - 1, input().split()))
current = 0
memo = {}
for i in range(num_move):
if memo.get(current) == 2:
break
if not memo.get(current):
memo[current] = 1
else:
memo[current] += 1
destination = telepor... | num_town, num_move = map(int, input().split())
teleports = list(map(lambda x: int(x) - 1, input().split()))
current = 0
memo = {}
for i in range(num_move):
if memo.get(current) == 2:
break
if not memo.get(current):
memo[current] = 1
else:
memo[current] += 1
destination = telepor... | [
"assignment.add"
] | 413,690 | 413,691 | u379601169 | python |
p02684 | N, K = map(int,input().split())
Map = list(map(int,input().split()))
Visited = [-1]*N
now = 1
Order = [0]*N
loopcount = 1
Order[0] = 1
Visited[0] = 1
for i in range(1,N):
nt = Map[now-1]
Order[i] = nt
loopcount += 1
if Visited[nt-1] == -1:
Visited[nt-1] = loopcount
else:
break
... | N, K = map(int,input().split())
Map = list(map(int,input().split()))
Visited = [-1]*N
now = 1
Order = [0]*N
loopcount = 1
Order[0] = 1
Visited[0] = 1
for i in range(1,N):
nt = Map[now-1]
Order[i] = nt
loopcount += 1
if Visited[nt-1] == -1:
Visited[nt-1] = loopcount
else:
break
... | [
"control_flow.branch.if.add"
] | 413,696 | 413,697 | u834224054 | python |
p02684 | n,k = map(int, input().split())
a = [int(x)-1 for x in input().split()]
visited = [False]*n
p = 0
visited[0] = True
cnt = 0
while True:
if visited[a[p]]:
rp = a[p]
cnt += 1
break
else:
visited[a[p]] = True
p = a[p]
cnt += 1
if cnt == k:
print(a[p]+1... | n,k = map(int, input().split())
a = [int(x)-1 for x in input().split()]
visited = [False]*n
p = 0
visited[0] = True
cnt = 0
while True:
if visited[a[p]]:
rp = a[p]
cnt += 1
break
else:
visited[a[p]] = True
p = a[p]
cnt += 1
if cnt == k:
print(p+1)
... | [
"call.arguments.change"
] | 413,722 | 413,723 | u906428167 | python |
p02684 | N,K = map(int,input().split())
A = list(map(int,input().split()))
rd = [-1 for _ in range(N)]
rd[0] = 1
def nomal_loop():
now_town = 1
for _ in range(K):
now_town = A[now_town]
print(now_town)
return 0
def else_loop():
next_town = A[0]
count = 1
K_count = K
while(1):
c... | N,K = map(int,input().split())
A = list(map(int,input().split()))
rd = [-1 for _ in range(N)]
rd[0] = 1
def nomal_loop():
now_town = 1
for _ in range(K):
now_town = A[now_town-1]
print(now_town)
return 0
def else_loop():
next_town = A[0]
count = 1
K_count = K
while(1):
... | [
"assignment.change"
] | 413,729 | 413,730 | u179443195 | python |
p02684 | # D - Teleporter
def main():
N, K, *A = map(int, open(0).read().split())
A = [0] + A
last_visit = [-1] * (N + 1)
last_visit[1] = 0
cur_pos, i = 1, 1
while True:
nxt_pos = A[cur_pos]
if i == K:
print(cur_pos)
break
elif (j := last_visit[nx... | # D - Teleporter
def main():
N, K, *A = map(int, open(0).read().split())
A = [0] + A
last_visit = [-1] * (N + 1)
last_visit[1] = 0
cur_pos, i = 1, 1
while True:
nxt_pos = A[cur_pos]
if i == K:
print(nxt_pos)
break
elif (j := last_visit[nxt_pos]) ... | [
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 413,737 | 413,738 | u077291787 | python |
p02684 | n, k = map(int, input().split())
a = list(map(int, input().split()))
idx = a[0]
hist = [1]
passed = [0] * n
flag = 0
for i, _ in enumerate(range(k), start=1):
if passed[idx-1] == 1:
hist.append(idx)
passed[idx-1] = 1
flag = 1
break
hist.append(idx)
passed[idx-1] = 1
idx ... | n, k = map(int, input().split())
a = list(map(int, input().split()))
idx = a[0]
hist = [1]
passed = [0] * n
flag = 0
for i, _ in enumerate(range(k), start=1):
if passed[idx-1] == 1:
hist.append(idx)
passed[idx-1] = 1
flag = 1
break
hist.append(idx)
passed[idx-1] = 1
idx ... | [
"call.arguments.change"
] | 413,742 | 413,743 | u466143662 | python |
p02684 | n, k = map(int, input().split())
a = list(map(int, input().split()))
idx = a[0]
hist = [1]
passed = [0] * n
flag = 0
for i, _ in enumerate(range(k), start=1):
if passed[idx-1] == 1:
hist.append(idx)
passed[idx-1] = 1
flag = 1
break
hist.append(idx)
passed[idx-1] = 1
idx ... | n, k = map(int, input().split())
a = list(map(int, input().split()))
idx = a[0]
hist = [1]
passed = [0] * n
flag = 0
for i, _ in enumerate(range(k), start=1):
if passed[idx-1] == 1:
hist.append(idx)
passed[idx-1] = 1
flag = 1
break
hist.append(idx)
passed[idx-1] = 1
idx ... | [
"call.arguments.change",
"io.output.change"
] | 413,744 | 413,743 | u466143662 | python |
p02684 | n,k,*a=map(int,open(0).read().split())
d=[2*k]*n
s=0
while k:s=a[s]-1;d[s]=k=-k%(~d[s]+k)
print(s+1) | n,k,*a=map(int,open(0).read().split())
d=[2*k]*n
s=0
while k:s=a[s]-1;d[s]=k=~-k%(d[s]+1-k)
print(s+1) | [
"expression.operation.unary.add",
"expression.operation.unary.bitwise.remove"
] | 413,749 | 413,750 | u729133443 | python |
p02684 | n,k,*a=map(int,open(0).read().split())
d=[2*k]*n
s=0
while k:s=a[s]-1;d[s]=k=~-k%(d[s]-k)
print(s+1) | n,k,*a=map(int,open(0).read().split())
d=[2*k]*n
s=0
while k:s=a[s]-1;d[s]=k=~-k%(d[s]+1-k)
print(s+1) | [
"assignment.change"
] | 413,751 | 413,750 | u729133443 | python |
p02684 | N, K = map(int, input().split())
A = list(map(int, input().split()))
NN = [-1] * N
NN[0] = 0
i = 0
num = 0
while True:
num += 1
i = A[i] - 1
if NN[i] != -1:
n1 = NN[i]
break
NN[i] = num
n_ = num - n1
if K > N:
K -= n1
t = NN.index(n1 + K % n_) + 1
print(t)
else:
t = ... | N, K = map(int, input().split())
A = list(map(int, input().split()))
NN = [-1] * N
NN[0] = 0
i = 0
num = 0
while True:
num += 1
i = A[i] - 1
if NN[i] != -1:
n1 = NN[i]
break
NN[i] = num
n_ = num - n1
if K > n1:
K -= n1
t = NN.index(n1 + K % n_) + 1
print(t)
else:
t =... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 413,755 | 413,756 | u375253797 | python |
p02684 | n,k=map(int,input().split())
a=list(map(int,input().split()))
s=[]
d=[-1]*(n+1)
v=1
while(d[v]==-1):
d[v]=len(s)
s.append(v)
v=a[v-1]
c=len(s)-d[v]
l=d[v]
if(k<l):print(s[k])
else:
k-=l
k%=c
print(k+l) | n,k=map(int,input().split())
a=list(map(int,input().split()))
s=[]
d=[-1]*(n+1)
v=1
while(d[v]==-1):
d[v]=len(s)
s.append(v)
v=a[v-1]
c=len(s)-d[v]
l=d[v]
if(k<l):print(s[k])
else:
k-=l
k%=c
print(s[k+l]) | [
"call.arguments.change"
] | 413,763 | 413,764 | u614162316 | python |
p02684 | def function():
_N,K = map(int, input().split())
teleportes = list(map(int, input().split()))
# ループを見つける
i,count = 0,0
visited = [-1] * len(teleportes) # 訪れた街にチェック
while True :
if visited[i] == -1: # 最初に訪れた
visited[i] = count # 何番目に訪れたかを記録
i = teleportes[i] - 1
... | def function():
_N,K = map(int, input().split())
teleportes = list(map(int, input().split()))
# ループを見つける
i,count = 0,0
visited = [-1] * len(teleportes) # 訪れた街にチェック
while True :
if visited[i] == -1: # 最初に訪れた
visited[i] = count # 何番目に訪れたかを記録
i = teleportes[i] - 1
... | [
"assignment.remove"
] | 413,769 | 413,770 | u696499790 | python |
p02684 | # -*- coding: utf-8 -*-
import sys
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
input=lambda: sys.stdin.readline().rstrip()
YesNo=lambda b: bool([print('Yes')] if b else print('No'))
YESNO=lambda b: bool([print('YES')] if b else print('NO'))
int1=lambda x:int(x)-1
def main():
N,K=map(int,input().split())
... | # -*- coding: utf-8 -*-
import sys
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
input=lambda: sys.stdin.readline().rstrip()
YesNo=lambda b: bool([print('Yes')] if b else print('No'))
YESNO=lambda b: bool([print('YES')] if b else print('NO'))
int1=lambda x:int(x)-1
def main():
N,K=map(int,input().split())
... | [
"literal.number.integer.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change",
"control_flow.branch.if.add"
] | 413,771 | 413,772 | u714642969 | python |
p02684 | n,k = map(int,input().split())
a = list(map(int,input().split()))
now = 1
ss = set([1])
sw = 0
x = 0
for i in range(k):
now = a[now-1]
ss.add(now)
if len(ss) != i+2:
b = now
x = i+1
sw = 1
break
y = 0
now2 = -1
for j in range(x-1):
if now2 == b:
y = j+1
now2 ... | n,k = map(int,input().split())
a = list(map(int,input().split()))
now = 1
ss = set([1])
sw = 0
x = 0
for i in range(k):
now = a[now-1]
ss.add(now)
if len(ss) != i+2:
b = now
x = i+1
sw = 1
break
y = 0
now2 = 1
for j in range(x-1):
if now2 == b:
y = j
break... | [
"expression.operation.unary.arithmetic.remove",
"expression.operation.binary.change"
] | 413,773 | 413,774 | u614181788 | python |
p02684 | if __name__ == "__main__":
n, k = map(int, input().split())
a = list(map(int, input().split()))
history = []
visited = [False] * n
for i in range(n):
a[i] -= 1
now = 0
while k > 0 and not visited[now]:
visited[now] = True
history.append(now)
now = a[no... | if __name__ == "__main__":
n, k = map(int, input().split())
a = list(map(int, input().split()))
history = []
visited = [False] * n
for i in range(n):
a[i] -= 1
now = 0
while k > 0 and not visited[now]:
visited[now] = True
history.append(now)
now = a[no... | [
"expression.operation.binary.add"
] | 413,775 | 413,776 | u679245300 | python |
p02684 | N, K = map(int, input().split())
X = list(map(int, input().split()))
town = []
dic = {}
i = 0
j = 0
while i not in dic and j < K:
dic[i] = j
town.append(i)
i = X[i] - 1
j += 1
if j == K:
print(town[K] + 1)
else:
num = dic[i]
loop = j - num
print(town[((K - num) % loop) + num] + 1)
| N, K = map(int, input().split())
X = list(map(int, input().split()))
town = []
dic = {}
i = 0
j = 0
while i not in dic and j < K:
dic[i] = j
town.append(i)
i = X[i] - 1
j += 1
if j == K:
print(i + 1)
else:
num = dic[i]
loop = j - num
print(town[((K - num) % loop) + num] + 1)
| [
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 413,781 | 413,782 | u325149030 | python |
p02684 | #!/usr/bin/env python
# -*- coding: utf-8 -*-
def main():
N, K = map(int, input().split())
A = list(map(int, input().split()))
R = [False] * (N + 1)
D = []
p = 1
while True:
if R[p]:
break
D.append(p)
R[p] = True
p = A[p - 1]
m = D.index(p)
... | #!/usr/bin/env python
# -*- coding: utf-8 -*-
def main():
N, K = map(int, input().split())
A = list(map(int, input().split()))
R = [False] * (N + 1)
D = []
p = 1
while True:
if R[p]:
break
D.append(p)
R[p] = True
p = A[p - 1]
m = D.index(p)
... | [
"call.arguments.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"io.output.change"
] | 413,800 | 413,801 | u143212659 | python |
p02684 | n, k = map(int, input().split())
A = list(map(int, input().split()))
order = [-1] * (n+1)
v = [0] * (n+1)
v[0] = 1
order[v[0]] = 0
# iは順番
for i in range(1, n+1):
v[i] = A[v[i-1] - 1]
if order[v[i]] != -1:
old_i = order[v[i]]
c = i - old_i
break
order[v[i]] = i
if k < old_i:
print... | n, k = map(int, input().split())
A = list(map(int, input().split()))
order = [-1] * (n+1)
v = [0] * (n+1)
v[0] = 1
order[v[0]] = 0
# iは順番
for i in range(1, n+1):
v[i] = A[v[i-1] - 1]
if order[v[i]] != -1:
old_i = order[v[i]]
c = i - old_i
break
order[v[i]] = i
if k < old_i:
print... | [
"expression.operation.binary.remove"
] | 413,804 | 413,805 | u531631168 | python |
p02684 | n, k = map(int, input().split())
lst = list(map(int, (input().split())))
lst = [_ - 1 for _ in lst]
visited = [0] * n
i = 0
now = 0
while True:
if visited[now] == 0:
i += 1
visited[now] = i
now = lst[now]
else:
lp = (i + 1) - visited[now]
st = i - lp
k_bk = k - ... | n, k = map(int, input().split())
lst = list(map(int, (input().split())))
lst = [_ - 1 for _ in lst]
visited = [0] * n
i = 0
now = 0
while k > i:
if visited[now] == 0:
i += 1
visited[now] = i
now = lst[now]
else:
break
lp = (i + 1) - visited[now]
st = i - lp
k_bk = k - st
k_bk ... | [
"control_flow.loop.condition.change",
"control_flow.break.add",
"control_flow.break.remove"
] | 413,808 | 413,809 | u606146341 | python |
p02684 | def main():
N, K, *A = map(int, open(0).read().split())
visited = [-1]*N
pos = A[0]
visited[0] = 0
visited[pos - 1] = 1
step = 2
order = 0
start = 0
step_to_start = 0
while True:
pos = A[pos - 1]
if visited[pos - 1] == -1:
visited[pos - 1] = step
... | def main():
N, K, *A = map(int, open(0).read().split())
visited = [-1]*N
pos = A[0]
visited[0] = 0
visited[pos - 1] = 1
step = 2
order = 0
start = 0
step_to_start = 0
while True:
pos = A[pos - 1]
if visited[pos - 1] == -1:
visited[pos - 1] = step
... | [
"literal.number.integer.change",
"assignment.value.change"
] | 413,812 | 413,813 | u838644735 | python |
p02684 | n, k = map(int, input().split())
a = list(map(int, input().split()))
s = 1
c = 0
d = {}
t = []
# 順番をdictで持つ
while not s in d.keys():
d[s] = c
t.append(s)
c += 1
s = a[s-1]
l = c - d[s]
m = len(d.keys()) - l
if m >= k:
print(t[m])
else:
print(t[(k - m) % l + m])
| n, k = map(int, input().split())
a = list(map(int, input().split()))
s = 1
c = 0
d = {}
t = []
# 順番をdictで持つ
while not s in d.keys():
d[s] = c
t.append(s)
c += 1
s = a[s-1]
l = c - d[s]
m = len(d.keys()) - l
if m >= k:
print(t[k])
else:
print(t[(k - m) % l + m])
| [
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"io.output.change"
] | 413,818 | 413,819 | u950825280 | python |
p02684 | import copy
N,K = list(map(int, input().split()))
A = list(map(int, input().split()))
count = [0]
Check = [0] * N
for i in range(K):
count.append(A[count[-1]]-1)
# print(count)
if(Check[count[-1]-1] == 1):
break
Check[count[-1]-1] = 1
i += 1
saisyo = count.index(count[-1]) + 1
#print(c... | import copy
N,K = list(map(int, input().split()))
A = list(map(int, input().split()))
count = [0]
Check = [0] * N
for i in range(K):
count.append(A[count[-1]]-1)
# print(count)
if(Check[count[-1]-1] == 1):
break
Check[count[-1]-1] = 1
i += 1
saisyo = count.index(count[-1]) + 1
#print(... | [
"expression.operation.binary.remove"
] | 413,828 | 413,829 | u655663334 | python |
p02684 | #167
#d
n,k = map(int, input().split())
ln = list(map(int, input().split()))# まちi にいるとき次に町ln[i-1]へいく
# n,k = 10*4,10**18
# ln = list(range(2,n+1))
# ln.append(1)
visit = [0]*n
now= 1 # 街iにいる
before =[] # ループに入る前（1回めのループ含む）
roop =[] # ループ内
while visit[now -1] != 2:
if visit[now -1] == 0:
before.append(no... | #167
#d
n,k = map(int, input().split())
ln = list(map(int, input().split()))# まちi にいるとき次に町ln[i-1]へいく
# n,k = 10*4,10**18
# ln = list(range(2,n+1))
# ln.append(1)
visit = [0]*n
now= 1 # 街iにいる
before =[] # ループに入る前（1回めのループ含む）
roop =[] # ループ内
while visit[now -1] != 2:
if visit[now -1] == 0:
before.append(no... | [
"expression.operation.binary.remove"
] | 413,834 | 413,835 | u816265237 | python |
p02684 | # -*- coding: utf-8 -*-
N, K=map(int, input().split())
A = list(map(int,input().split()))
now=0
rireki=[0]*N
isou=1
hazimete=0
for i in range(4*N):
if rireki[now]==0:
rireki[now]=1
startnum=i
start=now
else:
if hazimete==1:
startnum=i
start=now
ha... | # -*- coding: utf-8 -*-
N, K=map(int, input().split())
A = list(map(int,input().split()))
now=0
rireki=[0]*N
isou=1
hazimete=0
for i in range(4*N):
if rireki[now]==0:
rireki[now]=1
startnum=i
start=now
else:
if hazimete==1:
startnum=i
start=now
ha... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 413,838 | 413,839 | u268724304 | python |
p02684 | # -*- coding: utf-8 -*-
N, K=map(int, input().split())
A = list(map(int,input().split()))
now=0
rireki=[0]*N
isou=1
hazimete=0
for i in range(4*N):
if rireki[now]==0:
rireki[now]=1
startnum=i
start=now
else:
if hazimete==1:
startnum=i
start=now
ha... | # -*- coding: utf-8 -*-
N, K=map(int, input().split())
A = list(map(int,input().split()))
now=0
rireki=[0]*N
isou=1
hazimete=0
for i in range(4*N):
if rireki[now]==0:
rireki[now]=1
startnum=i
start=now
else:
if hazimete==1:
startnum=i
start=now
ha... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 413,840 | 413,839 | u268724304 | python |
p02684 | import sys
N, K = map(int, input().split())
As = [0] + list(map(int, input().split()))
d = [-1]*(N+1)
i = 1
step = 1
while step <= K:
next_i = As[i]
if d[next_i] != -1:
freq = step - d[next_i] +1
step = step + ((K - step) // freq)*freq
d[next_i] = step
step += 1
i = next_i
print(i) | import sys
N, K = map(int, input().split())
As = [0] + list(map(int, input().split()))
# print(As)
d = [-1]*(N+1)
i = 1
step = 1
while step <= K:
# print("step: {}, idx: {}".format(step,i))
next_i = As[i]
if d[next_i] != -1:
freq = step - d[next_i]
step = step + ((K - step) // freq)*freq
d[next_i] = step
step ... | [
"expression.operation.binary.remove"
] | 413,876 | 413,877 | u792078574 | python |
p02684 | from collections import deque
def main():
N, K = map(int, input().split())
A = list(map(int, input().split()))
A.insert(0, 0)
J = [-1] * (N + 1)
T = []
que = deque([1])
count = 0
l = 0
while que:
i = que.popleft()
if J[i] != -1:
l = J[i]
break
... | from collections import deque
def main():
N, K = map(int, input().split())
A = list(map(int, input().split()))
A.insert(0, 0)
J = [-1] * (N + 1)
T = []
que = deque([1])
count = 0
l = 0
while que:
i = que.popleft()
if J[i] != -1:
l = J[i]
break
... | [
"expression.operation.binary.add"
] | 413,882 | 413,883 | u031157253 | python |
p02684 | N,K=map(int,input().split())
P=list(map(int,input().split()))
A={k+1:P[k] for k in range(N)}
U=list()
S=set()
x=1
k=0
while (x not in S) and (k<=K):
U.append(x)
S.add(x)
x=A[x]
k+=1
if k>K:
print(U[-1])
else:
d=U.index(x)
V=U[d:]
print(V[(K-d)%len(V)])
print(U,V)
| N,K=map(int,input().split())
P=list(map(int,input().split()))
A={k+1:P[k] for k in range(N)}
U=list()
S=set()
x=1
k=0
while (x not in S) and (k<=K):
U.append(x)
S.add(x)
x=A[x]
k+=1
if k>K:
print(U[-1])
else:
d=U.index(x)
V=U[d:]
print(V[(K-d)%len(V)])
| [
"call.remove"
] | 413,884 | 413,885 | u779805689 | python |
p02684 | N,K=map(int,input().split())
P=list(map(int,input().split()))
A={k+1:P[k] for k in range(N)}
U=list()
S=set()
x=1
k=0
while (x not in S) and (k<K):
U.append(x)
S.add(x)
x=A[x]
k+=1
if k==K:
print(U[-1])
else:
d=U.index(x)
V=U[d:]
print(V[(K-d)%len(V)])
| N,K=map(int,input().split())
P=list(map(int,input().split()))
A={k+1:P[k] for k in range(N)}
U=list()
S=set()
x=1
k=0
while (x not in S) and (k<=K):
U.append(x)
S.add(x)
x=A[x]
k+=1
if k>K:
print(U[-1])
else:
d=U.index(x)
V=U[d:]
print(V[(K-d)%len(V)])
| [
"expression.operator.compare.change",
"control_flow.loop.condition.change",
"control_flow.branch.if.condition.change"
] | 413,886 | 413,885 | u779805689 | python |
p02684 | #N,K入力
N,K= map(int,input().split())
#街のテレポート先入力
A = [int(i)-1 for i in input().split()]
judge = [-1] * N
judge[0] = 0
#初期位置
a = 0
#移動回数
step = 1
while step != K:
#移動する街を決める
a = A[a]
if judge[a] > -1:
break
#何回目の移動なのか加える
judge[a] = step
step = step + 1
if step == K:
print(a+1)
... | #N,K入力
N,K= map(int,input().split())
#街のテレポート先入力
A = [int(i)-1 for i in input().split()]
judge = [-1] * N
judge[0] = 0
#初期位置
a = 0
#移動回数
step = 1
while step != K +1:
#移動する街を決める
a = A[a]
if judge[a] > -1:
break
#何回目の移動なのか加える
judge[a] = step
step = step + 1
if step == K +1:
print(a+1... | [
"control_flow.loop.condition.change",
"control_flow.branch.if.condition.change"
] | 413,887 | 413,888 | u139940813 | python |
p02684 | # -*- coding: utf-8 -*-
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
rem=k
nxt=1
visit=[]
visit_set={}
for i in range(k):
visit.append(nxt)
visit_set.add(nxt)
nxt=a[nxt-1]
# この判定をやめる
if nxt in visit_set:
break
rem-=1
if rem==0:
print(nxt)
else:
# pr... | # -*- coding: utf-8 -*-
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
rem=k
nxt=1
visit=[]
visit_set=set([])
for i in range(k):
visit.append(nxt)
visit_set.add(nxt)
nxt=a[nxt-1]
# この判定をやめる
if nxt in visit_set:
break
rem-=1
if rem==0:
print(nxt)
else:
# ... | [
"call.arguments.add"
] | 413,894 | 413,895 | u687574784 | python |
p02684 | N, K = map(int, input().split())
A = list(map(int, input().split()))
chk = [0]*(N+1)
town = 1
rt = []
roop = 0
while True:
if chk[town] == 1:
break
rt.append(town)
chk[town] = 1
town = A[town-1]
if K <= rt.index(town):
print(rt[K-1])
else:
roop = (K-rt.index(town)) % (len(rt)-rt.index... | N, K = map(int, input().split())
A = list(map(int, input().split()))
chk = [0]*(N+1)
town = 1
rt = []
roop = 0
while True:
if chk[town] == 1:
break
rt.append(town)
chk[town] = 1
town = A[town-1]
if K <= rt.index(town):
print(rt[K])
else:
roop = (K-rt.index(town)) % (len(rt)-rt.index(t... | [
"expression.operation.binary.remove"
] | 413,896 | 413,897 | u945199633 | python |
p02684 |
import sys
stdin=sys.stdin
ns = lambda:stdin.readline().rstrip()
ni = lambda:int(stdin.readline().rstrip())
nm = lambda:map(int,stdin.readline().split())
nl = lambda:list(map(int,stdin.readline().split()))
N,K=nm()
A=nl()
city_l=[0]
city_l.append(1)
city_c=[0]*(N+1)
city_c[1]+=1
n_city=A[0]
flag=True
r_... |
import sys
stdin=sys.stdin
ns = lambda:stdin.readline().rstrip()
ni = lambda:int(stdin.readline().rstrip())
nm = lambda:map(int,stdin.readline().split())
nl = lambda:list(map(int,stdin.readline().split()))
N,K=nm()
A=nl()
city_l=[0]
city_l.append(1)
city_c=[0]*(N+1)
city_c[1]+=1
n_city=A[0]
flag=True
r_... | [] | 413,898 | 413,899 | u525796732 | python |
p02684 | N, K = map(int, input().split())
A = [-1] + list(map(int, input().split()))
visited = set([1])
loop = [1]
now = 1
for _ in range(N):
now = A[now]
if now in visited:
break
else:
loop.append(now)
visited.add(now)
x = loop.index(now)
if K < x:
print(loop[x+1])
else:
K -= x
... | N, K = map(int, input().split())
A = [-1] + list(map(int, input().split()))
visited = set([1])
loop = [1]
now = 1
for _ in range(N):
now = A[now]
if now in visited:
break
else:
loop.append(now)
visited.add(now)
x = loop.index(now)
if K < x:
print(loop[K])
else:
K -= x
... | [
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change",
"expression.operation.binary.remove"
] | 413,913 | 413,914 | u886747123 | python |
p02684 | N, K = map(int, input().split())
A = [-1] + list(map(int, input().split()))
visited = set([1])
loop = [1]
now = 1
for _ in range(N):
now = A[now]
if now in visited:
break
else:
loop.append(now)
visited.add(now)
x = loop.index(now)
if K <= x:
print(loop[x+1])
else:
K -= x
... | N, K = map(int, input().split())
A = [-1] + list(map(int, input().split()))
visited = set([1])
loop = [1]
now = 1
for _ in range(N):
now = A[now]
if now in visited:
break
else:
loop.append(now)
visited.add(now)
x = loop.index(now)
if K < x:
print(loop[K])
else:
K -= x
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change",
"expression.operation.binary.remove"
] | 413,915 | 413,914 | u886747123 | python |
p02684 | def main():
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
warp_idx = [-1] * (len(A) + 1)
ans_list = []
c = 1
i = 0
while warp_idx[c] == -1:
warp_idx[c] = i
ans_list.append(c)
c = A[c - 1]
i += 1
start = warp_idx[c]
loop = ... | def main():
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
warp_idx = [-1] * (len(A) + 1)
ans_list = []
c = 1
i = 0
while warp_idx[c] == -1:
warp_idx[c] = i
ans_list.append(c)
c = A[c - 1]
i += 1
start = warp_idx[c]
loop = ... | [] | 413,920 | 413,921 | u630237503 | python |
p02684 | import math
def solve():
N, K = map(int,input().split())
A = list(map(int, input().split()))
state = 1
chklist = [0] * (N + 1)
chklist_flag = [False] * (N + 1)
chkmod = 0
chklist_flag[0] = True
for i in range(1, K + 1):
state = A[state - 1]
if chklist_flag[state - 1]:... | import math
def solve():
N, K = map(int,input().split())
A = list(map(int, input().split()))
state = 1
chklist = [0] * (N + 1)
chklist_flag = [False] * (N + 1)
chkmod = 0
chkrem = K
chklist_flag[0] = True
for i in range(1, K + 1):
state = A[state - 1]
if chklist... | [
"assignment.add"
] | 413,928 | 413,929 | u051358943 | python |
p02684 | def main():
N,K=map(int,input().split())
A=list(map(int,input().split()))
cal=0
time=[0]*N
town=[]
roop=[]
while time[cal]!=2:
if time[cal]==0:
town.append(cal)
else :
roop.append(cal)
time[cal]+=1
cal=A[cal]-1
if len(time)>K:
... | def main():
N,K=map(int,input().split())
A=list(map(int,input().split()))
cal=0
time=[0]*N
town=[]
roop=[]
while time[cal]!=2:
if time[cal]==0:
town.append(cal)
else :
roop.append(cal)
time[cal]+=1
cal=A[cal]-1
if len(town)>K:
... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 413,941 | 413,942 | u434296044 | python |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.