input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
s, c = list(map(int, input().split()))
ans = 0
if 2*s >= c:
ans = c // 2
else:
while 2*s < c and 2*(s+1) <= c-2:
c -= 2
s += 1
ans = s
print(ans) | s, c = list(map(int, input().split()))
ans = 0
#手持ちのSで作れる分だけSccを作る
if c <= 2*s:
ans += c // 2
c = c%2
s = 0
else:
ans += s
c = c - 2*s
s = 0
#print(s)
#print(c)
#print(ans)
#まだcが余ってたらSccを作る
if c >= 4:
ans += c // 4
print(ans) | p03797 |
nums = input().split()
N = int(nums[0])
M = int(nums[1])
sum = 0
while N > 0:
if M >= 2:
sum += 1
M -= 2
N -= 1
while M >= 4:
sum += 1
M -= 4
print(sum) | nums = input().split()
N = int(nums[0])
M = int(nums[1])
sum = 0
if 2*N <= M:
sum += N
M -= 2*N
if M >= 4:
sum += M // 4
else:
sum += M // 2
print(sum) | p03797 |
n, m = list(map(int, input().split()))
c = 0
while n > 0 and m > 2:
n -= 1
m -= 2
c += 1
while m >= 4:
m -= 4
c += 1
print(c)
| n, m = list(map(int, input().split()))
if n <= m // 2:
m -= n * 2
print((n + m//4))
else:
print((m//2))
| p03797 |
N, M = list(map(int, input().split()))
if 2*N < M:
extra = (M - 2*N) // 4
ans = N + extra
else:
ans = M // 2
print(ans) | N, M = list(map(int, input().split()))
print((M//2 if 2*N > M else N + (M-2*N)//4)) | p03797 |
n, m = list(map(int, input().split()))
if 2*n >= m:
print((int(m/2)))
else:
while True:
if 2*n < m:
n = n + 1
m = m - 2
else:
print((int(m/2)))
break
| n, m = list(map(int, input().split()))
if 2*n >= m:
print((int(m/2)))
else:
print(((2*n + m)//4))
| p03797 |
N, M = list(map(int, input().split()))
import sys
for scc in range(M//2, -1, -1):
excess_c = M - scc*2
if excess_c//2 + N >= scc:
print(scc)
sys.exit(0)
print((0)) | N, M = list(map(int, input().split()))
if N < M//2:
scc_min = max(1, N)
else:
scc_min = M//2
scc_max = N + M//2
while scc_min < scc_max:
scc = (scc_min + scc_max) // 2
excess_c = M - scc*2
if scc_min + 1 == scc_max:
break
if excess_c > 0 and excess_c//2 + N >= scc:
scc_min = scc
else:
scc_max = scc - 1
excess_c = M - scc_max*2
if excess_c > 0 and excess_c//2 + N >= scc_max:
print(scc_max)
else:
print(scc_min) | p03797 |
N, M = list(map(int, input().split()))
if M / N > 2:
while True:
M -= 2
N += 1
if M / N < 2:
M += 2
N -= 1
break
Scc = N
else:
Scc = M // 2
print((str(Scc))) | N, M = list(map(int, input().split()))
if M == 0:
Scc = M // 4
elif M / N >= 2:
M -= N * 2
Scc = N + (M // 4)
else:
Scc = M // 2
print((str(Scc))) | p03797 |
n, m = list(map(int, input().split()))
res = 0
for i in range(n):
if m-2 > 0:
m -= 2
res += 1
else:
break
print((res+m//4)) | n, m = list(map(int, input().split()))
res = 0
pair_m = m//2
if pair_m >= n:
print((n + (m-n*2)//4))
else:
print(pair_m)
| p03797 |
n,m = list(map(int,input().split()))
s = n
c = m
while True:
if s * 2 < c:
s += 1
c -= 2
else:
break
ans = min(s, c//2)
print(ans) | n,m = list(map(int,input().split()))
s = n
c = m
if 2 * s < c:
add = (c - 2*s) // 4
ans = s + add
elif 2 * s == c:
ans = s
else:
ans = c // 2
print(ans)
| p03797 |
s,c = list(map(int,input().split()))
ans = 0
while s>=1 and c>=2:
s -= 1
c -= 2
ans += 1
print((ans + c//4)) | s,c = list(map(int,input().split()))
ans = min(s,c//2)
c -= ans*2
print((ans + c//4)) | p03797 |
def slove(n, m):
while True:
if (m - n*2) >= 0:
break
n -= 1
if (m - n*2) >= 0:
tmp = (m - n * 2) // 4 + n
else:
tmp = 0
return tmp
if __name__ == "__main__":
n, m = [int(i) for i in input().split()]
print((slove(n, m)))
| def slove(n, m):
tmp = n if n < m // 2 else m // 2
tmp2 = (m - tmp * 2) // 4
return tmp + tmp2
if __name__ == "__main__":
n, m = [int(i) for i in input().split()]
print((slove(n, m)))
| p03797 |
n, m = list(map(int, input().split()))
count = 0
while n >= 1 and m >=2:
n -= 1
m -= 2
count += 1
if m == 0:
print(count)
else:
count += m//4
print(count) | n, m = list(map(int, input().split()))
if 2 * n > m:
ans = m // 2
print(ans)
else:
ans = n
m -= 2 * n
ans += m//4
print(ans) | p03797 |
s,c = list(map(int,input().split()))
ass = 0
while True:
if s > 0 and c > 1:
ass += 1
s -= 1
c -=2
elif s == 0 and c >= 4:
ass += 1
c -= 4
else:
break
print(ass) | s,c = list(map(int,input().split()))
ass = 0
if s >= c//2:
print((c//2))
else:
ass += s
c -= s*2
ass += c//4
print(ass) | p03797 |
N , M = list(map(int, input().split()))
answer = 0
if M >= 2 * N:
M -= 2 * N
answer = N
if M >= 4:
answer += M // 4
else:
for i in range(1, N+1):
if 2 * i < M:
answer += 1
else:
break
print(answer) | N , M = list(map(int, input().split()))
answer = 0
if M >= 2 * N:
M -= 2 * N
answer = N
if M >= 4:
answer += M // 4
else:
answer += M // 2
print(answer) | p03797 |
N, M = list(map(int,input().split()))
ans = 0
while True:
if 1 <= N and 2 <= M:
N -= 1
M -= 2
ans += 1
continue
if N == 0 and 4 <= M:
M -= 4
ans += 1
else:
break
print(ans) | N, M = list(map(int,input().split()))
ans = 0
if M - 2*N < 0:
print((M//2))
else:
print((N+((M-2*N)//4)))
| p03797 |
n,m=list(map(int,input().split()))
k=n
ans=0
for i in range(k):
if m>=2:
n-=1
m-=2
ans+=1
k=m
for i in range(k):
if m>=4:
m-=4
ans+=1
print(ans)
| n,m=list(map(int,input().split()))
ans=0
if 2*n<=m:
ans+=n
n=0
m-=2*ans
elif 1<=n and 2<=m:
ans+=m//2
n-=m
m-=(m//2)*2
ans+=m//4
print(ans)
| p03797 |
n, m = list(map(int, input().split()))
comb = 0
while m >= 2 and n >= 1:
comb += 1
m -= 2
n -= 1
comb += m // 4
print(comb)
| n, m = list(map(int, input().split()))
comb = 0
if 2 * n >= m:
comb += m // 2
m -= comb * 2
else:
comb += n
m -= 2 * n
comb += m // 4
print(comb)
| p03797 |
N, M = list(map(int, input().split()))
ans = 0
while N >= 1 and M >= 2:
N -= 1
M -= 2
ans += 1
while M >= 4:
M -= 4
ans += 1
print(ans) | N, M = list(map(int, input().split()))
n = min(N, M //2)
m = max((M - 2 * N) // 4, 0)
print((n + m)) | p03797 |
import math
n,m = list(map(int,input().split()))
Cpiece = m-m%2
ans = 0
if n*2 <= Cpiece:
ans = math.floor(n+(Cpiece-n*2-(Cpiece-n*2)%4)/4)
else:
ans = math.floor(Cpiece/2)
print(ans)
| n,m = list(map(int,input().split()))
Cpiece = m-m%2
ans = 0
if n*2 <= Cpiece:
ans = n+(Cpiece-n*2-(Cpiece-n*2)%4)//4
else:
ans = Cpiece//2
print(ans)
| p03797 |
n, m = list(map(int, input().split()))
num_without_s = m/4
num_with_s = 0
m_tmp = m
n_tmp = n
while m_tmp > 1 and n_tmp > 0:
num_with_s += 1
m_tmp = m_tmp - 2
n_tmp = n_tmp - 1
if m_tmp > 3:
num_with_s = num_with_s + int(m_tmp / 4)
if num_with_s > num_without_s:
print((int(num_with_s)))
else:
print((int(num_without_s)))
| n, m = list(map(int, input().split()))
num_without_s = m/4
num_with_s = 0
m_tmp = m
n_tmp = n
""" while m_tmp > 1 and n_tmp > 0:
num_with_s += 1
m_tmp = m_tmp - 2
n_tmp = n_tmp - 1
"""
if m >= (2 * n):
num_with_s = n
if (m_tmp - 2*n) > 3:
num_with_s = num_with_s + int(((m_tmp - 2*n) / 4))
else:
num_with_s = int(m/2)
if num_with_s > num_without_s:
print((int(num_with_s)))
else:
print((int(num_without_s)))
| p03797 |
N, M = list(map(int, input().split()))
ans = 0
while N>=1 and M>=2 or M>=4:
if N >=1 and M >= 2:
N -= 1
M -= 2
ans += 1
elif M >=4:
M -= 4
ans += 1
print(ans) | N, M = list(map(int, input().split()))
ans = 0
if M <= 1:
ans = 0
elif N >= M:
ans = M//2
elif N < M:
if N*2 >= M:
ans = M//2
else:
ans += N
ans += (M-N*2)//4
print(ans) | p03797 |
S, C = list(map(int,input().split()))
ans = 0
flag = True
while flag:
if S >= 1 and C >= 2:
S -= 1
C -= 2
elif C >= 4:
C -= 4
else:
break
ans += 1
print(ans) | S, C = list(map(int, input().split()))
ans = 0
if S*2 <= C:
ans += S
C -= S*2
ans += C//4
else:
ans += C//2
print(ans) | p03797 |
N, M = list(map(int, input().split()))
ans = 0
if N * 2 <= M:
ans += N
M = M -2 * N
ans += M//4
else:
ans = min(N, M//2)
print(ans) | N, M = list(map(int, input().split()))
ans = 0
if 2 * N == M:
ans = N
elif 2 * N > M:
ans = M // 2
else:
ans += N
M -= 2*N
ans += M // 4
print(ans) | p03797 |
S = list(map(int,input().split()))
N=S[0]
M=S[1]
count = 0
for i in range(N):
if N ==0 or M<=1:
break
N=N-1
M=M-2
count += 1
if N==0:
for i in range(M):
if M>=4:
M -= 4
count += 1
print(count) | S = list(map(int,input().split()))
N=S[0]
M=S[1]
N1=0
M1=0
count = 0
if 2*N<=M:
count = N
N1=0
M1=M-2*N
count+=M1//4
elif M<2*N:
count += M//2
print(count) | p03797 |
import sys
def makePuzzle():
count_Scc = 0
tmp = sys.stdin.readlines()
num_s, num_c = tmp[0].split(" ")
num_s = int(num_s)
num_c = int(num_c)
while num_s>=0 and num_c>=0:
if num_s>=1 and num_c>=2:
num_s = num_s - 1
num_c = num_c - 2
count_Scc = count_Scc + 1
elif num_c>=4:
num_c = num_c - 4
count_Scc = count_Scc + 1
else:
break
return count_Scc
if __name__=="__main__":
print((makePuzzle())) | import sys
def makePuzzle():
count_Scc = 0
tmp = sys.stdin.readlines()
num_s, num_c = tmp[0].split(" ")
num_s = int(num_s)
num_c = int(num_c)
if num_c-num_s*2>=0:
count_Scc = num_s
num_c = num_c - num_s*2
count_Scc = count_Scc + num_c//4
else:
count_Scc = num_c//2
return count_Scc
if __name__=="__main__":
print((makePuzzle())) | p03797 |
n,m=list(map(int,input().split()))
if n*2>=m:
print((m//2))
else:
while m-n*2>=4:
n+=1
m-=2
print(n) | n,m=list(map(int,input().split()))
if n*2>=m:
print((m//2))
else:
d=m-n*2
print((n+d//4)) | p03797 |
N,M = list(map(int,input().split()))
cnt = 0
while N >= 0 or M > 1:
if N >= 1:
if M >= 2:
M -= 2
N -= 1
cnt += 1
else:
print(cnt)
exit()
else:
if M >= 4:
M -= 4
cnt += 1
else:
print(cnt)
exit() | N,M = list(map(int,input().split()))
cnt = 0
m = int(M/2)
if N >= m:
cnt = m
elif m > N:
cnt = N
M -= 2*N
cnt += int(M/4)
print(cnt) | p03797 |
n,m=list(map(int,input().split()))
if n>=m//2:
print((m//2))
else:
print((n+(m-2*n)//4))
|
n,m=list(map(int,input().split()))
if 2*n>=m:
print((m//2))
else:
m2=m-2*n
print((n+m2//4))
| p03797 |
n,m = list(map(int,input().split()))
if n*2 >= m:
print((m//2))
else:
print(((m+2*n)//2//2))
| n,m = list(map(int,input().split()))
if n*2 >= m:
print((m//2))
else:
print((n+(m-n*2)//4))
| p03797 |
n, m = list(map(int, input().split()))
import sys
if n > int(m / 2):
print((int(m / 2)))
sys.exit(0)
while True:
if n > (m - 2) / 2:
break
else:
n += 1
m -= 2
print((int(m / 2))) | n, m = list(map(int, input().split()))
import sys
if n > int(m / 2):
print((int(m / 2)))
sys.exit(0)
print((n + int((m - n * 2) / 4))) | p03797 |
n,m=list(map(int,input().split()));a=0
while n and m>1:
n-=1;m-=2;a+=1
print((a+m//4)) | n,m=list(map(int,input().split()))
print((min((m+2*n)//4,m//2))) | p03797 |
n,m=list(map(int,input().split()))
print((min((m+2*n)//4,m//2))) | n,m=list(map(int,input().split()))
print(((min(2*n,m)+m)//4)) | p03797 |
n,m=list(map(int,input().split()))
ans=0
while True:
if n<=0 or m<=2:
break
n-=1
m-=2
ans+=1
print((ans+m//4))
| n,m=list(map(int,input().split()))
if n*2>=m:
print((m//2))
else:
print((n+(m-2*n)//4)) | p03797 |
import sys, os, math, bisect, itertools, collections, heapq, queue, copy, array
# from scipy.sparse.csgraph import csgraph_from_dense, floyd_warshall
# from decimal import Decimal
# from collections import defaultdict, deque
sys.setrecursionlimit(10000000)
ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
fl = lambda: list(map(float, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]
iss = lambda: sys.stdin.buffer.readline().decode().rstrip()
sl = lambda: list(map(str, sys.stdin.buffer.readline().decode().split()))
isn = lambda n: [sys.stdin.buffer.readline().decode().rstrip() for _ in range(n)]
lcm = lambda x, y: (x * y) // math.gcd(x, y)
MOD = 10 ** 9 + 7
INF = float('inf')
def main():
if os.getenv("LOCAL"):
sys.stdin = open("input.txt", "r")
N, M = il()
ret = 0
while M >= 2:
if N >= 1 and M >= 2:
ret += 1
M -= 2
N -= 1
if N == 0 and M >= 2:
N += 1
M -= 2
print(ret)
if __name__ == '__main__':
main()
| import sys, os, math, bisect, itertools, collections, heapq, queue, copy, array
# from scipy.sparse.csgraph import csgraph_from_dense, floyd_warshall
# from decimal import Decimal
# from collections import defaultdict, deque
sys.setrecursionlimit(10000000)
ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
fl = lambda: list(map(float, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]
iss = lambda: sys.stdin.buffer.readline().decode().rstrip()
sl = lambda: list(map(str, sys.stdin.buffer.readline().decode().split()))
isn = lambda n: [sys.stdin.buffer.readline().decode().rstrip() for _ in range(n)]
lcm = lambda x, y: (x * y) // math.gcd(x, y)
MOD = 10 ** 9 + 7
INF = float('inf')
def main():
if os.getenv("LOCAL"):
sys.stdin = open("input.txt", "r")
N, M = il()
ret = 0
if N * 2 <= M:
ret += N
ret += (M - N * 2) // 4
else:
ret += M // 2
print(ret)
if __name__ == '__main__':
main()
| p03797 |
N,M = list(map(int,input().split()))
ans = 0
while True:
if N == 0 or M == 1 or M == 0:
break
N -= 1
M -= 2
ans += 1
if N == 0:
while True:
M -= 4
if M >= 0:
ans += 1
else:
break
print(ans)
| import math
N,M = list(map(int,input().split()))
ans = 0
if N*2 <= M:
ans += N
M -= 2*N
N = 0
if M >= 4:
ans += math.floor(M / 4)
else:
ans += M/2
print((int(ans)))
| p03797 |
def main():
n, m = list(map(int, input().split()))
if m - 2 * n >= 0:
m -= 2 * n
ans = n
n = 0
while True:
if 2 * n >= m:
ans += m // 2
break
else:
n += 1
m -= 2
else:
ans = m // 2
print(ans)
if __name__ == '__main__':
main() | def main():
n, m = list(map(int, input().split()))
if m - 2 * n >= 0:
m -= 2 * n
ans = n
n = 0
if (m - 2 * n) % 4 == 0:
tmp = (m - 2 * n) // 4
else:
tmp = (m - 2 * n) // 4 + 1
ans += (m - 2 * tmp) // 2
else:
ans = m // 2
print(ans)
if __name__ == '__main__':
main() | p03797 |
N,M = list(map(int,input().split()))
ans = 0
for i in range(0,M+1,2):
ans = max(ans, min((M-i)//2,N+i//2))
print(ans) | N,M = list(map(int,input().split()))
if 2*N >= M:
print((M//2))
exit()
else:
cnum = M-2*N
print((N+cnum//4)) | p03797 |
n,m = list(map(int,input().split()))
ans = 0
if n >= m//2:
ans = m//2
else:
while n <= m//2:
n += 1
m -= 2
else:
ans = n-1
print(ans)
| n,m = list(map(int,input().split()))
ans = 0
if n >= m//2:
ans = m//2
else:
ans = n + (m//2-n)//2
print(ans)
| p03797 |
s,c = list(map(int,input().split(" ")))
counter = 0
temp = min(c // 2,s)
counter += temp
s -= temp
c -= temp * 2
temp = 0
while True:
if c >= 2 and s >= 1:
s -= 1
c -= 2
counter += 1
#print("counter:",counter)
#print("s:",s)
#print("c:",c)
if s == 0 and c >= 2:
c -= 2
s += 1
if c <= 1:
break
print(counter)
|
n,m=list(map(int,input().split()))
first=min(n,m//2)
n -=first
m-=first*2
second = m//4
print((second+first)) | p03797 |
n,m=list(map(int,input().split()))
first=min(n,m//2)
n -=first
m-=first*2
second = m//4
print((second+first)) |
def main():
n,m = list(map(int,input().split()))
s = n
c = m
scc = 0
#sを全部使い切る
take = min(s,c//2) #Sの個数とcを2で割った個数。小さい方を選んでSを使い切る
scc += take
s -= take
c -= take * 2
#残ったCでsccを作る（s=cが2個 cc=cが2個 合計4個必要）
take = c // 4
scc += take
print(scc)
if __name__ == '__main__':
main()
| p03797 |
N,M = list(map(int, input().split()))
s = N
c = M
while 2*s<c:
s = s+1
c = c-2
print((c//2)) | N,M = list(map(int, input().split()))
s = N
c = M
if 2*N>=M:
print((M//2))
else:
t = 2*s+c
print((t//4)) | p03797 |
N,M = list(map(int,input().split()))
ans = 0
for x in range(M+1):
if x%2 == 0:
ans = max(ans,min(N+x//2,(M-x)//2))
print(ans) | N,M = list(map(int,input().split()))
if M-2*N >= 0:
print((N + (M-2*N)//4))
else:
print((M//2)) | p03797 |
n,m=list(map(int,input().split()))
ans=0
for i in range(n):
m-=2
n-=1
if m<0 or n<0:
break
ans+=1
if n<0 or m<0:
print(ans)
exit()
while m>0:
if n>0:
m-=2
n-=1
else:
m-=4
if m<0:
break
ans+=1
print(ans) | n,m=list(map(int,input().split()))
if n>m//2:
print((m//2))
else:
ans=n
tmp=m-(n*2)
ans+=tmp//4
print(ans) | p03797 |
N, M = list(map(int,input().split()))
while M - 2 * N > 0:
M -= 2
N += 1
print((M // 2)) | N, M = list(map(int,input().split()))
x = M - 2 * N
if x > 0:
N += x // 4
print((min(N, M // 2))) | p03797 |
s,c = list(map(int,input().split()))
scc = 0
for i in range(s):
if c > 0:
c -= 2
s -= 1
scc += 1
if s == 0:
break
scc += c // 4
print(scc) | s,c = list(map(int,input().split()))
scc = 0
tmp = c // 2
scc += min(s,tmp)
c -= scc*2
scc += c // 4
print(scc) | p03797 |
s, c = list(map(int, input().split()))
if s*2 > c:
print((c//2))
else:
print((s + (c-s*2)//4))
| n,m=list(map(int,input().split()));m//=2;a=min(n,m);print((a+(m-a)//2)) | p03797 |
n, m = list(map(int,input().split()))
ans = 0
while n >= 1 and m >= 2:
n -= 1
m -= 2
ans += 1
if n < 1:
ans += (m // 4)
print(ans) | n, m = list(map(int,input().split()))
print(((min(n * 2, m) + m) // 4)) | p03797 |
# -*- coding:utf-8 -*-
N, M = list(map(int, input().split()))
if M > 0:
if N*2 <= M:
print(((N+M//2)//2))
else:
ans = 0
while True:
N -= 1
M -= 2
if M >= 0 and N >= 0:
ans += 1
else:
break
print(ans)
else:
print((0)) | # -*- coding:utf-8 -*-
N, M = list(map(int, input().split()))
if M > 0:
if N*2 <= M:
print(((N+M//2)//2))
else:
print((M//2))
else:
print((0)) | p03797 |
N, M = list(map(int, input().split()))
if N >= M // 2:
print((M // 2))
else :
print((N + (M - N * 2) // 4))
| N, M = list(map(int, input().split()))
if M < 2 * N :
print((M // 2))
else :
print((N + (M - 2*N) // 4)) | p03797 |
a = list(map(int, input().split()))
b, c = a[0], a[1]
ans = 0
while c > 0:
if c > 1 and b > 0:
ans += 1
b -= 1
c -= 2
elif c > 3:
c -= 4
ans += 1
else:
break
print(ans) | a = list(map(int, input().split()))
b, c = a[0], a[1]
ans = min(b, c // 2)
if b > c // 2:
c = c % 2
else:
c -= b * 2
b -= min(b, c // 2)
if c > 3:
ans += c // 4
print(ans)
| p03797 |
S, C = list(map(int, input().split()))
if S * 2 >= C:
print((C//2))
exit()
i = 0
while (C - 2*i)/(S + i) >= 2:
i += 1
print((S + i - 1))
| S, C = list(map(int, input().split()))
if S * 2 >= C:
print((C//2))
exit()
i = (C - 2 * S) // 4
print((S + i))
| p03797 |
s, c = list(map(int, input().split()))
cnt = 0
while s >= 1 and c >= 2:
s -= 1
c -= 2
cnt += 1
if c > 3:
cnt += c // 4
print(cnt) | s, c = list(map(int, input().split()))
x = c // 2
cnt = min(s, x)
c -= cnt * 2
if c > 3:
cnt += c // 4
print(cnt) | p03797 |
N = int(eval(input()))
a = []
for _ in range(N):
a.append(int(eval(input())))
cnt = 0
s = a[0]
if s == 2:
print((cnt + 1))
else:
for i in range(N):
s = a[s-1]
cnt += 1
if s == 2:
print((cnt + 1))
break
if i == N-1:
print('-1') | N = int(eval(input()))
a = []
for _ in range(N):
a.append(int(eval(input())))
s = a[0]
cnt = 1
for i in range(N):
if s == 2:
print(cnt)
exit()
cnt += 1
s = a[s-1]
print((-1)) | p03680 |
N = int(eval(input()))
a = []
for _ in range(N):
a.append(int(eval(input())))
s = a[0]
cnt = 1
for i in range(N):
if s == 2:
print(cnt)
exit()
cnt += 1
s = a[s-1]
print((-1)) | import sys
N = int(eval(input()))
a = [int(i) for i in sys.stdin]
s = a[0]
cnt = 1
for i in range(N):
if s == 2:
print(cnt)
exit()
cnt += 1
s = a[s-1]
print((-1)) | p03680 |
n=int(eval(input()))
a=[int(eval(input())) for i in range(n)]
b=a[0];c=1;d=[b]
while b!=2 and b!=1 and len(set(d))==len(d):
b=a[b-1]
c+=1
d.append(b)
if b==2:print(c)
else:print((-1)) | n=int(eval(input()))
a=[int(eval(input())) for i in range(n)]
b=a[0];c=1
while b!=2 and c<=n:
b=a[b-1]
c+=1
if b==2:print(c)
else:print((-1)) | p03680 |
n = int(eval(input()))
a = []
for i in range(n):
a.append(int(eval(input())))
visited = set()
count = 0
next = 1
while True:
count += 1
visited.add(next)
next = a[next-1]
if next == 2:
print(count)
exit(0)
if next in visited:
print((-1))
exit(0) | n = int(eval(input()))
a = [int(eval(input())) for i in range(n)]
b = a[0]
cnt = 1
while b != 2 and cnt <= n:
b = a[b-1]
cnt += 1
if b == 2:
print(cnt)
else:
print((-1))
| p03680 |
def main():
buttons = int(eval(input()))
next_lighten_up = [int(eval(input())) for _ in range(buttons)]
searched = [1]
answer = 1
while True:
if next_lighten_up[searched[-1] - 1] == 2:
break
elif next_lighten_up[searched[-1] - 1] in searched:
answer = -1
break
else:
answer += 1
searched.append(next_lighten_up[searched[-1] - 1])
print(answer)
if __name__ == '__main__':
main()
| def main():
buttons = int(eval(input()))
next_lighten_up = [int(eval(input())) for _ in range(buttons)]
searched = [False] * (buttons + 1)
answer = 1
index = 1
while True:
if next_lighten_up[index - 1] == 2:
break
elif searched[next_lighten_up[index - 1]]:
answer = -1
break
else:
searched[next_lighten_up[index - 1]] = True
answer += 1
index = next_lighten_up[index - 1]
print(answer)
if __name__ == '__main__':
main()
| p03680 |
def main():
buttons = int(eval(input()))
next_lighten_up = [int(eval(input())) for _ in range(buttons)]
searched = [False] * (buttons + 1)
answer = 1
index = 1
while True:
if next_lighten_up[index - 1] == 2:
break
elif searched[next_lighten_up[index - 1]]:
answer = -1
break
else:
searched[next_lighten_up[index - 1]] = True
answer += 1
index = next_lighten_up[index - 1]
print(answer)
if __name__ == '__main__':
main()
| def main():
n = int(eval(input()))
a = [0] + [int(eval(input())) for _ in range(n)]
checked = [False for _ in range(n + 1)]
answer = 0
ind = 1
while True:
answer += 1
checked[ind] = True
ind = a[ind]
if checked[ind]:
answer = -1
break
elif ind == 2:
break
print((answer if answer > -1 else -1))
if __name__ == '__main__':
main()
| p03680 |
def main():
N = int(eval(input()))
a = [0 for i in range(N)]
for i in range(N):
a[i] = int(eval(input()))
d = [1]
ans = 0
for i in range(N):
if a[d[i]-1] == 2:
ans += 1
break
elif a[d[i]-1] in d or i == N - 1:
ans = -1
break
else:
d.append(a[d[i]-1])
ans += 1
print(ans)
main()
| def main():
N = int(eval(input()))
a = [0 for i in range(N)]
for i in range(N):
a[i] = int(eval(input()))
now = 1
for i in range(N):
if a[now - 1] == 2:
break
elif i == N - 1:
i = -2
else:
now = a[now - 1]
#print('{}: {}'.format(i, now))
print((i + 1))
main()
| p03680 |
N = int(eval(input()))
next = []
for i in range(N):
next.append(int(eval(input())))
count = 0
history = [1]
while True:
light = next[history[-1] - 1]
if light in history:
print((-1))
exit()
count += 1
if light == 2:
print(count)
exit()
else:
history.append(light) | N = int(eval(input()))
next = []
for i in range(N):
next.append(int(eval(input())))
count = 0
light = 1
for i in range(N):
light = next[light - 1]
count += 1
if light == 2:
print(count)
exit()
print((-1)) | p03680 |
import sys
nums = int(eval(input()))
bottom = list(range(nums))
check = {}
count = 0
a = 0
for i in range(nums):
bottom[i] = int(eval(input()))
check[i] = 0
while True:
if bottom[a] == 2:
count += 1
break
if check[a] == 1:
print("-1")
sys.exit()
check[a] = 1
a = bottom[a] - 1
count += 1
print(count) | a = [int(eval(input())) for _ in range(int(eval(input())))]
c,s = 1,a[0]
for i in range(len(a)):
if s ==2:
print(c)
break
c,s = c+1, a[s-1]
else:print((-1)) | p03680 |
import sys
import itertools
# import numpy as np
import time
import math
from heapq import heappop, heappush
from collections import defaultdict
from collections import Counter
from collections import deque
sys.setrecursionlimit(10 ** 7)
INF = 10 ** 18
MOD = 10 ** 9 + 7
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
# map(int, input().split())
N = int(eval(input()))
A = [0] + [int(eval(input())) for _ in range(N)]
cur = 1
ans = 0
pushed = [False] * (N + 1)
pushed[1] = True
ok = True
while True:
ans += 1
cur = A[cur]
if cur == 2:
break
if pushed[cur]:
ok = False
break
if ok:
print(ans)
else:
print((-1))
| import sys
import itertools
# import numpy as np
import time
import math
from heapq import heappop, heappush
from collections import defaultdict
from collections import Counter
from collections import deque
sys.setrecursionlimit(10 ** 7)
INF = 10 ** 18
MOD = 10 ** 9 + 7
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
# map(int, input().split())
N = int(eval(input()))
A = [0] + [int(eval(input())) for _ in range(N)]
cur = 1
ans = 0
pushed = [False] * (N + 1)
pushed[1] = True
ok = True
while True:
pushed[cur] = True
ans += 1
cur = A[cur]
if cur == 2:
break
if pushed[cur]:
ok = False
break
if ok:
print(ans)
else:
print((-1))
| p03680 |
N = int(eval(input()))
a = [int(eval(input())) for _ in range(N)]
cnt, i = 0, 0
for j in range(10 ** 6):
cnt += 1
if a[i] == 2:
print(cnt)
#break
quit()
else:
i = a[i] - 1
print((-1)) | N = int(eval(input()))
a = [int(eval(input())) for _ in range(N)]
cnt, i = 0, 0
for j in range(len(a)):
cnt += 1
if a[i] == 2:
print(cnt)
#break
quit()
else:
i = a[i] - 1
print((-1)) | p03680 |
def main():
n = int(eval(input()))
As = [int(eval(input())) for _ in range(n)]
move = []
i = 0
ans = 1
while As[i] != 2:
if As[i] not in move:
move.append(As[i])
ans += 1
i = As[i]-1
else:
ans = -1
break
print(ans)
if __name__ == "__main__":
main()
| def main():
n = int(eval(input()))
As = [int(eval(input())) for _ in range(n)]
x = [0]*n
i = 0
ans = 0
while x[i] == 0:
ans += 1
x[i] = 1
i = As[i] - 1
if i == 1:
print(ans)
exit()
print((-1))
if __name__ == "__main__":
main()
| p03680 |
N = int(eval(input()))
A = [int(eval(input()))-1 for i in range(N)]
light = 0
first = 0
ans = 0
while True:
if light == A[light]:
print((-1))
exit()
light = A[light]
ans += 1
if light == 1:
print(ans)
exit()
if light == first:
print((-1))
exit()
| N = int(eval(input()))
A = [int(eval(input()))-1 for _ in range(N)]
p = 0
for i in range(N):
if p == 1:
print(i)
break
p = A[p]
else:
print((-1)) | p03680 |
N = int(eval(input()))
a = []
for i in range(N):
a.append(int(eval(input())))
history = []
now = 0
cnt = 0
while(True):
if now in history:
cnt = -1
break
else:
cnt += 1
history.append(now)
now = a[now]-1
if now == 1:
break
print(cnt) | N = int(eval(input()))
a = []
for i in range(N):
a.append(int(eval(input())))
history = set()
now = 0
cnt = 0
while(True):
if now in history:
cnt = -1
break
else:
cnt += 1
history.add(now)
now = a[now]-1
if now == 1:
break
print(cnt) | p03680 |
n = int(eval(input()))
a = [0]*n
for i in range(n):
a[i] = int(eval(input()))
fp = [a[0]]
now = a[0]
cnt = 0
while now != 2:
cnt += 1
now = a[now-1]
if now in fp:
print((-1))
exit()
fp.append(now)
if now == 2:
cnt += 1
print(cnt) | n = int(eval(input()))
a = [0]*n
for i in range(n):
a[i] = int(eval(input()))
now = a[0]
cnt = 0
while cnt <= n:
cnt += 1
if now == 2:
print(cnt)
exit()
now = a[now-1]
print((-1)) | p03680 |
import sys
def input(): return sys.stdin.readline().strip()
def resolve():
n=int(eval(input()))
edge = [[] * n for i in range(n)] # rangeに頂点の数。繋がっている頂点を投入するリスト
for i in range(n): # rangeに辺の数
x, y = i,int(eval(input()))
y = y - 1
edge[x].append(y)
sagasu=0
cnt=0
while True:
a=edge[sagasu]
if a==[1]:
print((cnt+1))
break
else:
if cnt>n:
print((-1))
break
else:
cnt+=1
sagasu=a[0]
resolve() | import sys
def input(): return sys.stdin.readline().strip()
def resolve():
n=int(eval(input()))
l=[int(eval(input())) for i in range(n)]
light=0
cnt=0
while True:
if l[light]==2:
cnt+=1
print(cnt)
break
else:
if cnt>n:
print((-1))
break
else:
light=l[light]-1
cnt+=1
resolve()
| p03680 |
n = int(eval(input()))
t = [int(eval(input())) for i in range(n)]
res = [1]
i = 1
while i <= n:
res.append(t[res[-1]-1])
if res[-1] == 2:
print((len(res)-1))
break
elif len(res) != len(set(res)):
print((-1))
break
i += 1
| n = int(eval(input()))
t = [int(eval(input())) for i in range(n)]
x = 1
res = -1
for i in range(n):
x = t[x-1]
if x == 2:
res = i + 1
break
print(res) | p03680 |
# coding: utf-8
import sys
N = int(eval(input()))
lst = [int(eval(input())) for _ in range(N)]
btn = 1
cnt = 0
for a in lst:
btn = lst[btn-1]
cnt += 1
if btn == 2:
print(cnt)
sys.exit()
print((-1)) | # coding: utf-8
import sys
N = int(eval(input()))
lst = [int(i) for i in sys.stdin]
btn = 1
cnt = 0
for a in lst:
btn = lst[btn-1]
cnt += 1
if btn == 2:
print(cnt)
sys.exit()
print((-1)) | p03680 |
N = int(eval(input()))
a_list = [int(eval(input())) for _ in range(N)]
button_history = [1]
while True:
next_button = a_list[button_history[-1] - 1]
if next_button == 2:
print((len(button_history)))
break
elif next_button in button_history:
print((-1))
break
else:
button_history.append(next_button)
| N = int(eval(input()))
a_list = [int(eval(input())) for _ in range(N)]
button_history = [1]
current_button = 1
num_manipulation = -1
for i in range(1, N + 1):
current_button = a_list[current_button - 1]
if current_button == 2:
num_manipulation = i
break
print(num_manipulation)
| p03680 |
n = int(eval(input()))
a = [0]
tmp = [int(eval(input())) for _ in range(n)]
a = a + tmp
r = -1
cnt = 1
next = a[1]
while cnt < n:
if next == 2:
r = cnt
break
else:
next = a[next]
cnt += 1
print(r) | import sys
read = sys.stdin.read
readlines = sys.stdin.readlines
def main():
n, *a = list(map(int, read().split()))
r = 0
x = 1
while x != 2:
r += 1
x = a[x - 1]
if x == 1 or r >= n:
r = -1
break
print(r)
if __name__ == '__main__':
main() | p03680 |
# ABC065B - Trained?
n = int(eval(input()))
lst = list(map(int, [input().rstrip() for _ in range(n)]))
button = lst[0]
count = 0
for _ in range(n):
count += 1
if button == 2:
break
button = lst[button - 1]
else:
count = -1
print(count) | # ABC065B - Trained?
import sys
input = sys.stdin.readline
n = int(eval(input()))
lst = list(map(int, [input().rstrip() for _ in range(n)]))
button = lst[0]
count = 0
for _ in range(n):
count += 1
if button == 2:
break
button = lst[button - 1]
else:
count = -1
print(count) | p03680 |
N = int(eval(input()))
a = []
for i in range(N):
a.append(int(eval(input())))
def get_ans(a):
mods = list()
if 2 not in a:
print((-1))
return True
count = 0
mod = 1
while(True):
mod = a[mod-1]
count += 1
if (mod == 2):
print(count)
return True
elif mod in mods:
print((-1))
return True
else:
mods.append(mod)
ret = get_ans(a) | N = int(eval(input()))
a = []
for i in range(N):
a.append(int(eval(input()))-1)
index = 0
#indexが1になったら（２ボタンを押したら）おしまい
flag = False
count = 0
for i in range(N):
count+=1
index=a[index]
if(index == 1):
flag = True
break
if(flag):
print(count)
else:
print((-1))
| p03680 |
n = int(eval(input()))
a = [int(eval(input())) for i in range(n)]
record = []
index = 0
count = 0
tf = True
while True:
index=a[index]-1
record.append(index)
if record.count(index) == 2:
print((-1))
tf = False
break
else:
count += 1
if index == 1:
break
if tf:
print(count)
| n = int(eval(input()))
a = [int(eval(input())) for i in range(n)]
index = 0
count = 1
tf = False
while True:
if a[index]==2:
tf = True
break
else:
index=a[index]-1
if count == n:
break
else:
count += 1
if tf:
print(count)
else:
print((-1))
| p03680 |
N = int(eval(input()))
data = [int(eval(input())) for i in range(N)]
i = 0
a_i = None
res = 1
pre_i = 0
while data[i] != 2:
a_i = data[i]
if pre_i == a_i:
res = -1
break
pre_i = i + 1
i = data[i] -1
res += 1
print(res)
| N = int(eval(input()))
data = [int(eval(input())) for i in range(N)]
i = 0
a_i = None
res = 1
pre_i = 0
time = -1
while data[i] != 2:
a_i = data[i]
if pre_i == a_i or time == N:
res = -1
break
pre_i = i + 1
i = data[i] -1
time += 1
res += 1
print(res)
| p03680 |
def solve():
n = int(eval(input()))
l = []
for i in range(n):
l.append(int(eval(input())))
a = 1
hist = []
while(True):
if(a-1 in hist):
return -1
if(a-1 == 1):
return len(hist)
hist.append(a-1)
a = l[a-1]
if(__name__ == "__main__"):
print((solve()))
| def solve():
n = int(eval(input()))
l = []
for i in range(n):
l.append(int(eval(input())))
a = 1
hist = set([])
while(True):
if(a-1 in hist):
return -1
if(a-1 == 1):
return len(hist)
hist.add(a-1)
a = l[a-1]
if(__name__ == "__main__"):
print((solve()))
| p03680 |
def resolve():
N = int(eval(input()))
A = [int(eval(input())) - 1 for _ in range(N)]
pressed = []
i = 0
t = 0
while i != 1:
i = A[i]
if i in pressed:
t = -1
break
pressed.append(i)
t += 1
print(t)
resolve() | def resolve():
N = int(eval(input()))
A = [int(eval(input())) - 1 for _ in range(N)]
pressed = 0
i = 0
t = 0
while i != 1:
i = A[i]
if pressed > N:
t = -1
break
pressed += 1
t += 1
print(t)
resolve() | p03680 |
n = int(eval(input()))
li = [int(eval(input())) for _ in range(n)]
idx_li = []
count = 1
bu = li[0]
idx_li.append(bu)
if bu == 2:
print(count)
exit()
while True:
bu = li[bu - 1]
count += 1
if bu == 2:
print(count)
exit()
if bu in idx_li:
print((-1))
exit()
else:
idx_li.append(bu)
| n = int(eval(input()))
li = [int(eval(input())) for _ in range(n)]
light = 1
count = 0
for i in range(n):
light = li[light - 1]
count+=1
if light == 2:
print(count)
exit()
print((-1)) | p03680 |
def resolve():
N = int(eval(input()))
A = [int(eval(input())) for i in range(N)]
idx = 0
target = 1
cnt = 1
passed = []
while True:
if idx >= N:
print((-1))
return
if A[idx]-1 == target:
print(cnt)
return
if A[idx]-1 in passed:
print((-1))
return
passed.append(idx)
idx = A[idx]-1
cnt += 1
if '__main__' == __name__:
resolve() | def resolve():
N = int(eval(input()))
A = [int(eval(input())) for i in range(N)]
idx = 0
target = 1
cnt = 1
passed = [False]*N
while True:
if idx >= N:
print((-1))
return
if A[idx]-1 == target:
print(cnt)
return
if passed[A[idx]-1]:
print((-1))
return
passed[idx] = True
idx = A[idx]-1
cnt += 1
if '__main__' == __name__:
resolve() | p03680 |
n=int(eval(input()))
a=[int(eval(input())) for i in range(n)]
c,s=1,a[0]
while s!=2 and c<n:c,s=c+1,a[s-1]
print((c if c<n else -1)) | N = int(eval(input()))
a = [int(eval(input())) for i in range(N)]
b = a[0]
count = 0
for i in range(N-1):
count += 1
if b == 2:
print(count)
break
b = a[b-1]
else:
print((-1)) | p03680 |
n = int(eval(input()))
a = [int(eval(input())) for i in range(n)]
check = [0 for i in range(n)]
check[0] = 1
i = 0
cnt = 0
while True:
cnt += 1
x = a[i]
if x-1 == 1:
print (cnt)
exit()
if check[x-1] == 1:
print((-1))
exit()
else:
check[x-1] = 1
i = x-1 | n = int(eval(input()))
a = [int(eval(input())) for i in range(n)]
chk = [False for i in range(n)]
c = 0
d = 0
while True:
if chk[c]:
print((-1))
exit()
else:
chk[c] = True
if c == 1:
print (d)
exit()
c = a[c]-1
d += 1 | p03680 |
g = [[] for _ in range(int(eval(input())))]
for gv in g:
gv.append(int(eval(input())) - 1)
q = [[0]]
while q:
path = q.pop(0)
n = path[-1]
if n == 1:
print((len(path) - 1))
exit()
else:
for x in g[n]:
if x not in path:
new_path = path[:]
new_path.append(x)
q.append(new_path)
print((-1)) | n=int(eval(input()))
a = [int(eval(input())) for x in [0]*n]
k=0
for i in range(n):
if k==1:
print(i)
break
k=a[k]-1
else:
print((-1)) | p03680 |
n=int(eval(input()))
a=[]
ans=1
for i in range(n):
b=int(eval(input()))
a.append(b)
c=a[0]
if(c==2):
print(ans)
else:
while(c!=2):
ans+=1
c=a[c-1]
if(ans>len(a)):
print((-1))
exit()
print(ans) | a=[int(eval(input())) for _ in range(int(eval(input())))]
ans=1
c=a[0]
if(c==2):
print(ans)
else:
while(c!=2):
ans+=1
c=a[c-1]
if(ans>len(a)):
print((-1))
exit()
print(ans) | p03680 |
N = int(eval(input()))
a = [int(eval(input())) for _ in range(N)]
i = 0
cnt = 1
while True:
if a[i] == 1:
cnt = -1
break
elif a[i] == 2:
break
else:
i = a[i] - 1
cnt += 1
print(cnt) | N = int(eval(input()))
a = [int(eval(input())) for _ in range(N)]
i = 0
cnt = 1
while True:
if cnt > len(a):
cnt = -1
break
if a[i] == 1:
cnt = -1
break
elif a[i] == 2:
break
else:
i = a[i] - 1
cnt += 1
print(cnt)
| p03680 |
n = int(eval(input()))
a = [int(eval(input())) for _ in range(n)]
L = []
cnt = 0
i = 0
while True:
if i in L:
print((-1))
break
else:
L.append(i)
i = a[i] - 1
cnt += 1
if i == 1:
print(cnt)
break
| n = int(eval(input()))
a = [int(eval(input())) for _ in range(n)]
L = [0] * n
cnt = 0
i = 0
while True:
if L[i] == 1:
print((-1))
break
else:
L[i] = 1
i = a[i] - 1
cnt += 1
if i == 1:
print(cnt)
break
| p03680 |
n = int(eval(input()))
arr = []
for i in range(n):
arr.append(int(eval(input())))
visited = []
i = 0
c = 0
while i != 1 and i not in visited:
visited.append(i)
i = arr[i]-1
c += 1
if i == 1:
print(c)
else:
print((-1)) | n = int(eval(input()))
arr = []
for i in range(n):
arr.append(int(eval(input()))-1)
now = 0
c = 0
while True:
if now == 1:
print(c)
break
if c >= n:
print((-1))
break
c += 1
now = arr[now] | p03680 |
n=int(eval(input()))
a=[int(eval(input()))for i in range(n)]
vis=[0]*n
i=0
cnt=0
while True:
next=a[i]
cnt+=1
if vis[next-1]==1:
print((-1))
exit()
vis[next-1]=1
if next==2:
break
i=next-1
print(cnt) | n=int(eval(input()))
a=[int(eval(input()))for i in range(n)]
vis=[0]*n
i=0
cnt=0
while True:
next=a[i]
cnt+=1
if vis[next-1]==1:#一度来たことがある点であればbreak
print((-1))
exit()
vis[next-1]=1#一度光った点は記録
if next==2:
break
i=next-1
print(cnt)
| p03680 |
n=int(eval(input()))
a=[int(eval(input()))for i in range(n)]
vis=[0]*n
i=0
cnt=0
while True:
next=a[i]
cnt+=1
if vis[next-1]==1:#一度来たことがある点であればbreak
print((-1))
exit()
vis[next-1]=1#一度光った点は記録
if next==2:
break
i=next-1
print(cnt)
| n=int(eval(input()))
a=[int(eval(input()))for i in range(n)]
a.insert(0,-1)
cnt=0
pos=1
for _ in range(n):
now=a[pos]
cnt+=1
if now==2:
print(cnt)
exit()
pos=now
print((-1))
| p03680 |
n = int(eval(input()))
ls = []
for i in range(n):
ls.append(int(eval(input())) - 1)
count = 0
if (1 not in ls):
count = -1
else:
used = []
x = 0
count = 0
while (x != 1):
used.append(x)
x = ls[x]
count += 1
if (x in used):
count = -1
break
print(count)
| n = int(eval(input()))
ls = []
for i in range(n):
ls.append([int(eval(input()))-1,False])
count = 0
x = 0
while (x != 1):
if ls[x][1]:
count = -1
break
else:
count += 1
ls[x][1] = True
x = ls[x][0]
print(count) | p03680 |
n = int(eval(input()))
a = [int(eval(input())) for _ in range(n)]
i = a[0]
cnt = 1
while cnt<=n and i!=2:
i = a[i-1]
cnt += 1
if cnt==n+1:print((-1))
else:print(cnt)
| n = int(eval(input()))
a = [int(eval(input())) for i in range(n)]
used = [False]*n
f = True
cur = 0
cnt = 0
while f:
cnt += 1
cur = a[cur]-1
if cur == 1:
break
if used[cur]:
f = False
cnt = -1
else:
used[cur] = True
print(cnt) | p03680 |
n = int(eval(input()))
alist = [int(eval(input()))-1 for _ in range(n)]
visitedlist = [0]
from_ = 0
for _ in range(n):
to = alist[from_]
if to in visitedlist:
print((-1))
break
elif to == 1:
print((len(visitedlist)))
break
else:
visitedlist.append(to)
from_ = to | n = int(eval(input()))
alist = [int(eval(input()))-1 for _ in range(n)]
now = 0
count = 0
while True:
if now == 1:
print(count)
break
elif count >= n:
print((-1))
break
else:
count += 1
now = alist[now] | p03680 |
def process(a):
tmp = a[0]
pushed = []
cnt = 1
while not tmp in pushed:
if tmp == 2:
return cnt
pushed.append(tmp)
tmp = a[tmp - 1]
cnt += 1
return -1
if __name__ == '__main__':
a = [int(input().strip()) for _ in range(int(input().strip()))]
print((process(a))) | def process(a):
tmp = a[0]
pushed = set()
cnt = 1
while not tmp in pushed:
if tmp == 2:
return cnt
pushed.add(tmp)
tmp = a[tmp - 1]
cnt += 1
return -1
if __name__ == '__main__':
a = [int(input().strip()) for _ in range(int(input().strip()))]
print((process(a))) | p03680 |
def process(a):
tmp = a[0]
pushed = set()
cnt = 1
while not tmp in pushed:
if tmp == 2:
return cnt
pushed.add(tmp)
tmp = a[tmp - 1]
cnt += 1
return -1
if __name__ == '__main__':
a = [int(input().strip()) for _ in range(int(input().strip()))]
print((process(a))) | import sys
def process(a):
tmp = a[1]
pushed = set()
cnt = 1
while not tmp in pushed:
if tmp == 2:
return cnt
pushed.add(tmp)
tmp = a[tmp]
cnt += 1
return -1
if __name__ == '__main__':
# a = [int(input().strip()) for _ in range(int(input().strip()))]
a = list(map(int, sys.stdin))
print((process(a))) | p03680 |
n = int(eval(input()))
a = [0] + [int(eval(input())) for i in range(n)]
match = []
counter = 0
now = 1
for i in range(n):
if now == 2:
print(counter)
exit()
elif now not in match:
match += [now]
now = a[now]
counter += 1
else:
print("-1")
exit() | n = int(eval(input()))
a = [0] + [int(eval(input())) for i in range(n)]
match = []
counter = 0
now = 1
for i in range(n):
if now == 2:
print(counter)
exit()
else:
now = a[now]
counter += 1
print("-1") | p03680 |
n=int(eval(input()))
data=[int(eval(input())) for i in range(n)]
x=1
was=set()
now=1
while x==1:
if now==2:
print((len(was)))
break
if now in was:
print('-1')
break
was|={now,}
now=data[now-1]
| N=int(eval(input()))
A=[int(eval(input())) for i in range(N)]
cnt=0
now=1
for i in range(N+1):
if now==2:
break
cnt+=1
now=A[now-1]
if cnt>N:print((-1))
else:print(cnt) | p03680 |
N = int(eval(input()))
A = [0]
for i in range(N):
A.append(int(eval(input())))
old = []
bo = 1
ind = 1
while True:
if A[bo] == 2:
print(ind)
exit()
else:
ind += 1
if bo in old:
print((-1))
exit()
old.append(bo)
bo = A[bo]
| N = int(eval(input()))
A = [0]
for i in range(N):
A.append(int(eval(input())))
old = []
bo = 1
ind = 1
while ind <= N:
if A[bo] == 2:
print(ind)
exit()
else:
ind += 1
bo = A[bo]
print((-1))
| p03680 |
n = int(eval(input()))
a = [int(eval(input())) for i in range(n)]
v = [False for i in range(n)]
v[0] = True
cd = 0
count = 0
while(True) :
cd = a[cd] - 1
count += 1
if cd == 1 :
print(count)
break
if v[cd] :
print((-1))
break | n = int(eval(input()))
a = [int(eval(input())) for i in range(n)]
cd = 0
count = 0
while(True) :
cd = a[cd] - 1
count += 1
if cd == 1 :
print(count)
break
if count >= n :
print((-1))
break | p03680 |
# -*- coding: utf-8 -*-
n = int(eval(input()))
a = []
for i in range(n):
a.append(int(eval(input())))
if 2 not in a:
print((-1))
else:
cnt = 0
before_num = 1
lighted_bottons = []
while True:
cnt += 1
if a[before_num - 1] == 2:
print(cnt)
break
else:
if a[before_num - 1] in lighted_bottons:
print((-1))
break
before_num = a[before_num - 1]
lighted_bottons.append(before_num) | # -*- coding: utf-8 -*-
n = int(eval(input()))
a = []
for i in range(n):
a.append(int(eval(input())))
if 2 not in a:
print((-1))
else:
cnt = 0
before_num = 1
lighted_bottons = [0 for i in range(n + 1)]
while True:
cnt += 1
if a[before_num - 1] == 2:
print(cnt)
break
else:
if lighted_bottons[a[before_num - 1]] == 1:
print((-1))
break
before_num = a[before_num - 1]
lighted_bottons[before_num] = 1 | p03680 |
N = int(eval(input()))
light_rule = {n:int(eval(input()))-1 for n in range(N)}
light = "1"+"0"*(N-1)
target = "0"+"1"+"0"*(N-2)
searched = {light:1}
flag = 0
num = 0
bottun = 0
while True:
if light == target:
flag = 1
break
num += 1
idx = bottun
light = light[:idx]+"0"+light[idx+1:]
idx = light_rule[bottun]
light = light[:idx]+"1"+light[idx+1:]
bottun = light_rule[bottun]
if searched.get(light):
break
else:
searched[light] = 1
if flag:
print(num)
else:
print((-1)) | N = int(eval(input()))
light_rule = {n:int(eval(input()))-1 for n in range(N)}
light = ["1"]+["0"]*(N-1)
target = ["0"]+["1"]+["0"]*(N-2)
searched = {"".join(light):1}
flag = 0
num = 0
bottun = 0
while True:
if light == target:
flag = 1
break
num += 1
# print(bottun, light_rule[bottun])
light[bottun] = "0"
light[light_rule[bottun]] = "1"
bottun = light_rule[bottun]
# print(light)
if searched.get("".join(light)):
break
else:
searched["".join(light)] = 1
if flag:
print(num)
else:
print((-1)) | p03680 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.