input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
N=int(input())
A=[]
I=[]
for n in range(N):
a=int(input())
A.append(a)
I.append(1)
def t(I):
#while 2 not in I:
while 1:
a=A[I[-1]-1]
if a in I:
return print(-1)
if a==2:
return print(len(I))
I.append(a)
t(I)
| N=int(input())
A=[int(input()) for n in range(N)]
def t(N,A):
i=1
for n in range(1,N+1):
a=A[i-1]
if a==2:
return print(n)
i=a
return print(-1)
t(N,A)
| p03680 |
#Trained?
N = int(eval(input()))
a = [int(eval(input())) for _ in range(N)]
judge2 = 0
judgeloop = 0
now = 1
tugi = a[0]
rireki = []
n = 1
if tugi == 2:
judge2 += 1
while judge2 == 0 and judgeloop == 0:
n += 1
rireki.append(now)
now = tugi
tugi = a[tugi-1]
if tugi in rireki:
... | #Trained?
N = int(eval(input()))
a = [int(eval(input())) for _ in range(N)]
now = 1
L = [0]*N
for i in range(N):
L[i] = now
now = a[now-1]
judge = 1
for i in range(N):
if L[i] == 2:
print(i)
judge = 0
break
else:
pass
if judge == 1:
print((-1)) | p03680 |
n = int(eval(input()))
a=[0]
for i in range(n):
a.append(int(eval(input())))
c = 1
k = a[1]
while k != 1:
if k == 2:
print(c)
exit()
k = a[k]
c += 1
print((-1)) | n = int(eval(input()))
a=[0]
for i in range(n):
a.append(int(eval(input())))
c = 1
k = a[1]
while c <= n:
if k == 2:
print(c)
exit()
k = a[k]
c += 1
print((-1)) | p03680 |
N = int(eval(input()))
a = [int(eval(input())) for _ in range(N)]
a = [0] + a
hist = [1, ]
count = 0
i = 1
while i != 2:
i = a[i]
count += 1
if i in hist:
count = -1
break
hist.append(i)
print(count) | N = int(eval(input()))
a = [int(eval(input())) for _ in range(N)]
a = [0] + a
count = 0
i = 1
while i != 2:
j = i
i = a[i]
a[j] = -1
count += 1
if i == -1:
count = -1
break
print(count) | p03680 |
N = int(eval(input()))
a = [int(eval(input())) for _ in range(N)]
a = [0] + a
count = 0
i = 1
while i != 2:
j = i
i = a[i]
a[j] = -1
count += 1
if i == -1:
count = -1
break
print(count) | n = int(eval(input()))
A = [int(eval(input())) for _ in range(n)]
count = 0
i = 1
for _ in range(n):
i = A[i - 1]
count += 1
if i == 2:
print(count)
exit()
print((-1)) | p03680 |
n=int(eval(input()))
a=[int(eval(input())) for _ in range(n)]
b=a[0]
c=1
ans=-1
for i in range(10**5):
if b==2:
ans=c
break
b=a[b-1]
c+=1
print(ans) | n,*a=list(map(int,open(0).read().split()))
i=ans=1
while a[i-1]!=2 and ans<=n:
ans+=1
i=a[i-1]
print((ans if ans<=n else -1)) | p03680 |
n=int(eval(input()))
a=[]
for i in range(n):
a.append(int(eval(input())))
b=['']*n
b[0]='hoge'
c=0
x=0
while True:
c+=1
x=a[x]-1
if b[x]=='hoge':
c=-1
break
else:
b[x]='hoge'
if x==1:
break
print(c)
| # 入力
N=int(eval(input()))
l=[]
for i in range(N):
l.append(int(eval(input())))
# 押してない：0
# 押した：1
l2=[0]*N
# 1番目は「押した：1」にしておく
l2[0]=1
# 回数カウント
c=0
i=1
while True:
# 回数をインクリメント
c+=1
# 次のボタン番号を取得
i=l[i-1]
# 2番目のライトが光る場合は回数を出力して終了
if i==2:
print(c)
exit()
if l2[... | p03680 |
#!/usr/bin/env python3
import sys
INF = float("inf")
def solve(N: int, a: "List[int]"):
visited = [False]*N
curr = 1
counter = 0
while curr != 2:
curr = a[curr-1]
counter += 1
if curr == 1:
print((-1))
return
print(counter)
retu... | #!/usr/bin/env python3
import sys
INF = float("inf")
def solve(N: int, a: "List[int]"):
visited = [False]*N
curr = 1
counter = 0
while curr != 2:
if visited[curr-1]:
print((-1))
return
visited[curr-1] = True
curr = a[curr-1]
counte... | p03680 |
n = int(eval(input()))
a = [int(eval(input())) for i in range(n)]
T = [False for i in range(n)]
tmp = 1
T[0] = True
count = 1
while True:
tmp = a[tmp-1]
if T[tmp -1]:
print((-1))
exit()
if tmp == 2:
print(count)
break
count+=1 | n = int(eval(input()))
a = [int(eval(input())) for i in range(n)]
T = [False for i in range(n)]
tmp = 1
T[0] = True
count = 1
while True:
tmp = a[tmp-1]
if T[tmp -1]:
print((-1))
exit()
T[tmp-1] = True
if tmp == 2:
print(count)
break
count+=1 | p03680 |
n = int(eval(input()))
a = [int(eval(input())) for i in range(n)]
b = [0]*n
b[0] = 1
count = 0
c = a[0]
for i in range(n):
if b[c-1] == 0:
b[c-1] = 1
if c == 2:
print((count+1))
break
else:
print((-1))
break
c = a[c-1]
count += 1 | 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)) | p03680 |
def solve():
N = int(input())
arr = []
for i in range(N):
arr.append(int(input()))
turning_on = 1
count = 0
turned_on_set = [1]
while turning_on != 2:
count += 1
turning_on = arr[turning_on - 1]
if turning_on in turned_on_set:
count = -... | def solve():
N = int(input())
arr = []
for i in range(N):
arr.append(int(input()))
turning_on = 1
count = 0
while turning_on != 2:
count += 1
turning_on = arr[turning_on - 1]
if count > N + 1:
count = -1
break
print(str(cou... | p03680 |
n = int(eval(input()))
a = []
for i in range(n):
a.append(int(eval(input())))
b = a[0]
c = []
while True:
if b == 2:
print((len(c)+1))
exit()
elif b in c:
print((-1))
exit()
else:
c.append(b)
b = a[c[-1]-1] | n = int(eval(input()))
a = []
for i in range(n):
a.append(int(eval(input())))
b = a[0]
c = []
while True:
if b == 2:
print((len(c)+1))
exit()
if len(c)> n:
print((-1))
exit()
else:
c.append(b)
b = a[c[-1]-1] | p03680 |
# ABC065 B - Trained?
N = int(eval(input()))
A = [[int(eval(input())),False] for i in range(N)]
idx = 0
A[0][1] == True
cnt = 1
while cnt != N+1:
if A[idx][1]:
print((-1))
exit()
if A[idx][0] == 2:
print(cnt)
exit()
A[idx][1] = True
idx = A[idx][0]-1
... | n=int(eval(input()))
a=[int(eval(input())) for i in range(n)]
btn=[0]*n
ans=1
i=0
while True:
if btn[i]==1:
print((-1))
exit()
if a[i]==2:
print(ans)
exit()
btn[i]=1
i=a[i]-1
ans+=1
| p03680 |
n = int(eval(input()))
A = [int(eval(input())) for i in range(n)]
B = []
for i, a in enumerate(A):
B.append([i + 1, a])
idx = 1
for i in range(n):
x = B[idx - 1][1]
if x == 2:
print((i + 1))
break
else:
idx = x
else:
print((-1)) | n = int(eval(input()))
A = [int(eval(input())) for i in range(n)]
cnt = 1
x = A[0]
while x != 2 and cnt != n:
x = A[x - 1]
cnt += 1
if cnt == n:
print((-1))
else:
print(cnt) | p03680 |
n = int(eval(input()))
nxt_btn = {i: int(eval(input())) for i in range(1, n + 1)}
num = 0
crr_btn = 1
while True:
num += 1
if nxt_btn[crr_btn] == 1:
num = -1
break
if nxt_btn[crr_btn] == 2:
break
crr_btn = nxt_btn[crr_btn]
print(num)
| n = int(eval(input()))
nxt_btn = {i: int(eval(input())) for i in range(1, n + 1)}
num = -1
crr_btn = 1
for i in range(1, n + 1):
if nxt_btn[crr_btn] == 2:
num = i
break
crr_btn = nxt_btn[crr_btn]
print(num)
| p03680 |
n = int(eval(input()))
a = [int(eval(input())) for i in range(n)]
i = a[0]
num = [1, i]
for k in range(n):
if 2 in num:
print((len(num) - 1))
break
j = a[i-1]
if j in num:
print((-1))
break
num.append(j)
if 2 in num:
print((len(num) - 1))
... | n = int(eval(input()))
a = [int(eval(input())) for i in range(n)]
i = a[0]
for j in range(n):
if i == 2:
print((j + 1))
break
i = a[i-1]
else:
print((-1)) | p03680 |
N = int(eval(input()))
A = [0]
for i in range(N):
a = int(eval(input()))
A.append(a)
ans = 1
now = A[1]
while now != 1 and now != 2:
ans += 1
now = A[now]
if now == 1:
print((-1))
else:
print(ans) | N = int(eval(input()))
A = [0]
for i in range(N):
a = int(eval(input()))
A.append(a)
#print(A)
ans = 1
now = A[1]
visited = {}
while (not now in visited) and now != 2:
ans += 1
visited[now] = 1
now = A[now]
#print(visited)
if now != 2:
print((-1))
else:
print(ans) | p03680 |
n=int(eval(input()))
Alist=[0]+[int(eval(input())) for i in range(n)]
now=1
count=0
Hist=[1]
while now!=2:
now=Alist[now]
count+=1
if now in Hist:
count=-1
break
Hist.append(now)
print(count) | n=int(eval(input()))
Alist=[0]+[int(eval(input())) for i in range(n)]
now=1
count=0
for _ in range(n):
now=Alist[now]
count+=1
if now==2:
print(count)
exit()
print((-1)) | p03680 |
n=int(eval(input()))
Alist=[0]+[int(eval(input())) for i in range(n)]
now=1
Hist=[1]
for i in range(n):
now=Alist[now]
if now==2:
print((i+1))
break
if now in Hist:
print((-1))
break
Hist.append(now) | n=int(eval(input()))
Alist=[0]+[int(eval(input())) for i in range(n)]
now=1
Hist={1}
for i in range(n):
now=Alist[now]
if now==2:
print((i+1))
break
if now in Hist:
print((-1))
break
Hist.add(now) | p03680 |
# https://beta.atcoder.jp/contests/abc065/tasks/abc065_b
import sys
def model():
e = list(map(int, sys.stdin))
cur = e[1]
for i in range(e[0]):
if cur == 2:
print((i + 1))
break
cur = e[cur]
else:
print((-1))
def input_lines():
"... | # https://beta.atcoder.jp/contests/abc065/tasks/abc065_b
import sys
def model():
e = list(map(int, sys.stdin))
cur = e[1]
for i in range(e[0]):
if cur == 2:
print((i + 1))
break
cur = e[cur]
else:
print((-1))
def input_lines():
"... | p03680 |
n=int(eval(input()))
a=[]
for i in range(n):
a.append(int(eval(input()))-1)
'''
#TLEチーンコ
i=0
j=0
b=[]
while True:
j+=1
if a[i]==1:
print(j)
break
elif a[i] in b:
print(-1)
break
else:
b.append(a[i])
i=a[i]
'''
i=0
j=0
while True:... | n=int(eval(input()))
a=[int(eval(input()))-1 for i in range(n)]
now=0
x=[0]*n
i=0
while x[now]==0:
i+=1
x[now]=1
now=a[now]
if now==1:
print(i)
break
else:
print((-1))
| p03680 |
n = int(eval(input()))
a = []
l = [0]*(n + 1)
cnt = 0
now = 1
for i in range(n):
a.append(int(eval(input())))
for i in range(n):
cnt += 1
now = a[now - 1]
if now == 2:
print(cnt)
exit()
print((-1)) | import sys
input = sys.stdin.readline
def main():
n = int(eval(input()))
a = []
l = [0]*(n + 1)
cnt = 0
now = 1
for i in range(n):
a.append(int(eval(input())))
for i in range(n):
cnt += 1
now = a[now - 1]
if now == 2:
print(cnt)... | p03680 |
import sys
input = sys.stdin.readline
def main():
n = int(eval(input()))
a = []
l = [0]*(n + 1)
cnt = 0
now = 1
for i in range(n):
a.append(int(eval(input())))
for i in range(n):
cnt += 1
now = a[now - 1]
if now == 2:
print(cnt)... | import sys
input = sys.stdin.readline
def main():
n = int(eval(input()))
a = []
l = [0]*(n + 1)
now = 0
for i in range(n):
a.append(int(eval(input())) - 1)
for i in range(n):
now = a[now]
if now == 1:
print((i + 1))
exit()
p... | p03680 |
# import bisect
# import copy
# import fractions
# import math
# import numpy as np
# from collections import Counter, deque
# from itertools import accumulate,permutations, combinations,combinations_with_replacement,product
def resolve():
N=int(eval(input()))
A=[int(eval(input())) for i in range(N... | # import bisect
# import copy
# import fractions
# import math
# import numpy as np
# from collections import Counter, deque
# from itertools import accumulate,permutations, combinations,combinations_with_replacement,product
def resolve():
N=int(eval(input()))
A=[int(eval(input())) for i in range(N... | p03680 |
#/usr/bin/env python
n = int(eval(input()))
a = [int(eval(input())) for _ in range(n)]
lighted = [0]
ans = 0
while True:
u = lighted[-1]
v = a[u]-1
ans += 1
if v == 1:
print(ans)
exit()
if v not in lighted:
lighted.append(v)
else:
print((-1)... | #/usr/bin/env python
n = int(eval(input()))
a = [int(eval(input())) for _ in range(n)]
lighted = [0]
ans = 0
for i in range(n):
u = lighted[-1]
v = a[u]-1
ans += 1
if v == 1:
print(ans)
exit()
lighted.append(v)
print((-1))
| p03680 |
#/usr/bin/env python
n = int(eval(input()))
a = [int(eval(input())) for _ in range(n)]
lighted = [0]
ans = 0
for i in range(n):
u = lighted[-1]
v = a[u]-1
ans += 1
if v == 1:
print(ans)
exit()
lighted.append(v)
print((-1))
| #/usr/bin/env python
n = int(eval(input()))
a = [int(eval(input())) for _ in range(n)]
ans = 0
v = 0
for i in range(n):
v = a[v]-1
ans += 1
if v == 1:
print(ans)
exit()
print((-1))
| p03680 |
N, K = list(map(int, input().split()))
# スコア行列[K, K]
# 白チェッカー左下を(x, y)としたときの正解数-誤答数
score_matrix = [[0 for x in range(K+1)] for y in range(K+1)]
base_hope = 0
for i in range(N):
x, y, c = input().split()
x2, y2 = int(x) // K, int(y) // K
x_coord, y_coord = int(x) % K, int(y) % K
# 正解
... | N, K = list(map(int, input().split()))
score = [[0 for x in range(K+1)] for y in range(K+1)]
base_hope = 0
for i in range(N):
x, y, c = input().split()
x2, y2 = int(x) // K, int(y) // K
x_coord, y_coord = int(x) % K + 1, int(y) % K + 1
if ((x2 + y2) % 2 == 0 and c == "W") or ((x2 + y2) % 2 ==... | p03458 |
N, K = list(map(int, input().split()))
score = [[0 for x in range(K+1)] for y in range(K+1)]
base_hope = 0
for i in range(N):
x, y, c = input().split()
x2, y2 = int(x) // K, int(y) // K
x_coord, y_coord = int(x) % K + 1, int(y) % K + 1
if ((x2 + y2) % 2 == 0 and c == "W") or ((x2 + y2) % 2 ==... | N, K = list(map(int, input().split()))
score = [[0] * (K+1) for y in range(K+1)]
base_hope = 0
for i in range(N):
x, y, c = input().split()
x2, y2 = int(x) // K, int(y) // K
x_coord, y_coord = int(x) % K + 1, int(y) % K + 1
if ((x2 + y2) % 2 == 0 and c == "W") or ((x2 + y2) % 2 == 1 and c == ... | p03458 |
#!/usr/bin/env python3
def main():
na = list(map(int, input().split()))
N = na[0]
K = na[1]
x = []
y = []
c = []
for i in range(N):
sa = input().split()
x.append(int(sa[0]))
y.append(int(sa[1]))
c.append(True if sa[2] == 'W' else False)
ho... | #!/usr/bin/env python3
def main():
na = list(map(int, input().split()))
N = na[0]
K = na[1]
x = []
y = []
c = []
for i in range(N):
sa = input().split()
x.append(int(sa[0]))
y.append(int(sa[1]))
c.append(True if sa[2] == 'W' else False)
ho... | p03458 |
n, k = list(map(int, input().split()))
mp1 = [[0] * k for _ in range(k)]
mp2 = [[0] * k for _ in range(k)]
for _ in range(n):
x, y, c = input().split()
t = int(x) // k + int(y) // k
x = int(x) % k
y = int(y) % k
if c == "B":
t += 1
if t % 2:
mp1[y][x] += 1
else:
mp2[y][x] += 1
... | def main():
n, k = list(map(int, input().split()))
mp1 = [[0] * k for _ in range(k)]
mp2 = [[0] * k for _ in range(k)]
for _ in range(n):
x, y, c = input().split()
t = int(x) // k + int(y) // k
x = int(x) % k
y = int(y) % k
if c == "B":
t += 1
if t % 2:
mp1[y][x] ... | p03458 |
n,k=list(map(int,input().split()))
grid=[[0]*k for _ in range(k)]
for i in range(n):
x,y,c=[x for x in input().split()]
x,y=int(x),int(y)
p=(x//k+y//k)%2
if (p==0 and c=="B")|(p==1 and c=="W"): grid[x%k][y%k]+=1
else: grid[x%k][y%k]-=1
for i in range(k):
for j in range(1,k):
... | n,k=list(map(int,input().split()))
grid=[[0]*k for _ in range(k)]
for i in range(n):
x,y,c=[x for x in input().split()]
x,y=int(x),int(y)
p=(x//k+y//k)%2
if (p==0 and c=="B")|(p==1 and c=="W"): grid[x%k][y%k]+=1
else: grid[x%k][y%k]-=1
for i in range(k):
for j in range(1,k):
... | p03458 |
n,k=list(map(int,input().split()))
grid=[[0]*k for _ in range(k)]
for i in range(n):
x,y,c=[x for x in input().split()]
x,y=int(x),int(y)
p=(x//k+y//k)%2
if (p==0 and c=="B")|(p==1 and c=="W"): grid[x%k][y%k]+=1
else: grid[x%k][y%k]-=1
for i in range(k):
for j in range(1,k):
... | def main():
n,k=list(map(int,input().split()))
grid=[[0]*k for _ in range(k)]
for i in range(n):
x,y,c=[x for x in input().split()]
x,y=int(x),int(y)
p=(x//k+y//k)%2
if (p==0 and c=="B")|(p==1 and c=="W"): grid[x%k][y%k]+=1
else: grid[x%k][y%k]-=1
for i... | p03458 |
n,k=list(map(int,input().split()))
a=[(2*k+1)*[0]for _ in range(2*k+1)]
for _ in range(n):
x,y,c=input().split()
x=int(x)
y=int(y)
if c=="B":y+=k
x%=2*k
y%=2*k
a[x+1][y+1]+=1
ans=0
for i in range(1,2*k+1):
for j in range(1,2*k+1):a[i][j]+=a[i-1][j]+a[i][j-1]-a[i-1][j-1]
for i in range(k,2*k... | n,k=list(map(int,input().split()));m=2*k;a=[(m+1)*[0]for _ in[0]*(m+1)];z=lambda i,j:(a[i][j]-a[i-k][j]-a[i][j-k]+a[i-k][j-k])*2+a[m][m]-a[i][m]-a[m][j]+a[i-k][m]+a[m][j-k]
for _ in[0]*n:x,y,c=input().split();x=int(x);y=int(y)+k*(c=="B");a[x%m+1][y%m+1]+=1
for i in range(m):
for j in range(m):a[i+1][j+1]+=a[i][j+1... | p03458 |
ri = lambda: int(input())
rl = lambda: list(map(int,input().split()))
rr = lambda N: [ri() for _ in range(N)]
YN = lambda b: print('YES') if b else print('NO')
INF = 10**18
N,K=rl()
W = [[0 for _ in range(2*K+3)] for _ in range(2*K+3)]
for i in range(N):
x,y,c=input().split()
x = int(x)%(2*K)
... | ri = lambda: int(input())
rl = lambda: list(map(int,input().split()))
rr = lambda N: [ri() for _ in range(N)]
YN = lambda b: print('YES') if b else print('NO')
INF = 10**18
N,K=rl()
W = [[0 for _ in range(K+3)] for _ in range(K+3)]
for i in range(N):
x,y,c=input().split()
x = int(x)%(2*K)
y ... | p03458 |
import sys
input = sys.stdin.readline
def cumsum_2d(inlist,h,w):
outlist = [ [ inlist[i-1][j-1] if i != 0 and j != 0 else 0 for i in range(k+1) ] for j in range(k+1) ]
for i in range(1,h+1):
tmp = 0
for j in range(1,w+1):
tmp += outlist[i][j]
outlist[i][j] = tmp... | import sys
input = sys.stdin.readline
def cumsum_2d(inlist,h,w):
outlist = [ [ inlist[i-1][j-1] if i != 0 and j != 0 else 0 for i in range(k+1) ] for j in range(k+1) ]
for i in range(1,h+1):
tmp = 0
for j in range(1,w+1):
tmp += outlist[i][j]
outlist[i][j]... | p03458 |
n, k = list(map(int, input().split()))
favor = [tuple(input().split()) for _ in range(n)]
square = [[0 for _ in range(k)] for _ in range(k)]
initscore = 0
for xc, yc, c in favor:
x = int(xc)
y = int(yc)
x %= 2*k
y %= 2*k
if (x in range(k) and y in range(k)) or (x in range(k, 2*k) and y in r... | n, k = list(map(int, input().split()))
favor = [tuple(input().split()) for _ in range(n)]
square = [[0 for _ in range(k)] for _ in range(k)]
initscore = 0
for xc, yc, c in favor:
x = int(xc)
y = int(yc)
x %= 2*k
y %= 2*k
if (x in range(k) and y in range(k)) or (x in range(k, 2*k) and y in r... | p03458 |
def examA():
N = DI()/dec(7)
ans = N
print(N)
return
def examB():
ans = 0
print(ans)
return
def examC():
ans = 0
print(ans)
return
def examD():
N = I()
n = (N-1).bit_length()
V = [[-1]*(1<<n) for i in range(1<<n)]
#print(V)
for i in ran... | def examA():
N = DI()/dec(7)
ans = N
print(N)
return
def examB():
ans = 0
print(ans)
return
def examC():
ans = 0
print(ans)
return
def examD():
N = I()
n = (N-1).bit_length()
V = [[-1]*(1<<n) for i in range(1<<n)]
#print(V)
for i in ran... | p02930 |
import sys
from collections import defaultdict
if __name__ == '__main__':
n, v = list(map(int, sys.stdin.readline().split()))
a = list(map(int, sys.stdin.readline().split()))
b = list(map(int, sys.stdin.readline().split()))
c = list(map(int, sys.stdin.readline().split()))
d = list(map(int, ... | import sys
from collections import defaultdict
if __name__ == '__main__':
n, v = list(map(int, sys.stdin.readline().split()))
a = tuple(map(int, sys.stdin.readline().split()))
b = tuple(map(int, sys.stdin.readline().split()))
c = tuple(map(int, sys.stdin.readline().split()))
d = tuple(map(i... | p02329 |
# -*- coding: utf-8 -*-
"""
http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=DPL_4_A
AC
"""
import sys
from sys import stdin
from bisect import bisect_right, bisect_left
input = stdin.readline
def main(args):
N, V = list(map(int, input().split()))
A = [int(x) for x in input().split()]
... | # -*- coding: utf-8 -*-
"""
http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=DPL_4_A
AC
"""
import sys
from sys import stdin
from bisect import bisect_right, bisect_left
input = stdin.readline
def main(args):
N, V = list(map(int, input().split()))
A = [int(x) for x in input().split()]
... | p02329 |
from enum import Enum
class Color(Enum):
BLACK = 0
RED = 1
@staticmethod
def flip(c):
return [Color.RED, Color.BLACK][c.value]
class Node:
__slots__ = ('key', 'left', 'right', 'size', 'color', 'value')
def __init__(self, key, value):
self.key = key
... |
from enum import Enum
class Color(Enum):
BLACK = 0
RED = 1
@staticmethod
def flip(c):
return [Color.RED, Color.BLACK][c.value]
class Node:
__slots__ = ('key', 'left', 'right', 'size', 'color', 'value')
def __init__(self, key, value):
self.key = key
... | p02458 |
A = list(map(int, input().split()))
B = list(map(int, input().split()))
max_sum = max([sum(A), sum(B)])
print(max_sum) | A, B = [list(map(int, input().split())) for _ in range(2)]
print((max([sum(A), sum(B)]))) | p00433 |
#!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
input:
2 20
5 9
4 10
output:
9
1 ??? N ??? 100
1 ??? vi ??? 100
1 ??? wi ??? 10,000,000
1 ??? W ??? 1,000,000,000
"""
import sys
from collections import namedtuple
MAX_N, MAX_V = 100, 100
def solve():
dp = [[float('inf')] * (MAX_N * M... | #!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
input:
2 20
5 9
4 10
output:
9
1 ??? N ??? 100
1 ??? vi ??? 100
1 ??? wi ??? 10,000,000
1 ??? W ??? 1,000,000,000
"""
import sys
from collections import namedtuple
MAX_V = 100
def solve():
dp = [[float('inf')] * (c_items * MAX_V + 1) ... | p02319 |
n, k = list(map(int, input().split()))
d = [11, 16, 10, 25, 9, 24, 19, 13, 18, 12, 17]
print((len([x for x in range(d[k], 7 * (n - 1), 11) if x % 7 > 1])))
| n, k = list(map(int, input().split()))
d = [11, 16, 10, 25, 9, 24, 19, 13, 18, 12, 17]
e = 7 * (n - 1)
r = (e - d[k] - 1) // 77
print((5 * r + len([x for x in range(d[k] + 77 * r, e, 11) if x % 7 > 1])))
| p03929 |
n, k = list(map(int, input().split()))
c = 0
for i in range(2, n):
for j in range(2, 7):
if (7 * i + j - 7) * 9 % 11 == k:
c += 1
print(c) | n, k = list(map(int, input().split()))
p = int((n - 2) / 11)
c = p * 5
for i in range(2 + p * 11 , n):
for j in range(2, 7):
if (7 * i + j - 7) * 9 % 11 == k:
c += 1
print(c) | p03929 |
n,k=list(map(int,input().split()))
#(i,j)=7i+j-7
x=0
for i in range(11):
if (9*i)%11==k:
x=i
break
ans=0
for i in range((7*n)//11+1):
s=11*i+x
if s>7*n-7:
continue
if s<=7:
continue
if s%7==0 or s%7==1:
continue
else:
ans+=1
print... | n,k=list(map(int,input().split()))
#(i,j)=7i+j-7
x=0
for i in range(11):
if (9*i)%11==k:
x=i
break
K=0
L=0
for i in range(1,78):
if i%11!=x:
continue
if i%7<=1:
continue
K+=1
if i<=7:
L+=1
P=0
for i in range(1,7*(n%11)+1):
if i%11!=x:
... | p03929 |
n,k = list(map(int,input().split()))
count = 0
for i in range(1,6):
for j in range(1,n-1):
if (9*i+9+63*j)%11 == k:
count += 1
print(count) | n,k = list(map(int,input().split()))
a = 4;b = 2;c = 0;d = 9;e = 7
f = [a,b,c,d,e]
ans = 0
for i in range((n-2)%11):
if k in (a,b,c,d,e):
ans += 1
a = (a+8)%11
b = (b+8)%11
c = (c+8)%11
d = (d+8)%11
e = (e+8)%11
print((ans+((n-2)//11)*5)) | p03929 |
#! /usr/bin/env python3
n, k = list(map(int, input().split()))
M = [[(7*i+j-7)%11 for j in range(1, 7+1)] for i in range(1, n+1)]
cnt = 0
f = lambda i, j : sum(M[i+y][j+x] for y in range(3) for x in range(3)) % 11 == k
h = [0] * 11
for i in range(min(n-2, 11)):
for j in range(7-2):
if f(i, j) :
... | #! /usr/bin/env python3
n, k = list(map(int, input().split()))
M = [[7*i+j-7 for j in range(1, 7+1)] for i in range(1, min(n+1, 14))]
cnt = 0
f = lambda i, j : sum(M[i+y][j+x] for y in range(3) for x in range(3)) % 11 == k
h = [0] * 11
for i in range(min(max(0, n-2), 11)):
for j in range(7-2):
if ... | p03929 |
#! /usr/bin/env python3
n, k = list(map(int, input().split()))
n = max(0, n-2)
ans = 0
f = lambda i, j : sum(7*(i+x//3+1)+(j+x%3+1)-7 for x in range(9)) % 11 == k
h = [0] * 11
for i in range(min(n, 11)):
h[i] = sum(1 for x in range(5) if f(i, x))
ans = sum(h) * (n // 11) + sum(h[i] for i in range(n % 11))... | #! /usr/bin/env python3
n, k = list(map(int, input().split()))
n = max(0, n-2)
ans = 0
h = [sum((63*i+9*j+81) % 11 == k for j in range(5))for i in range(min(n, 11))]
ans = sum(h) * (n // 11) + sum(h[i] for i in range(n % 11))
print(ans) | p03929 |
#!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
input:
3
abcbdab
bdcaba
abc
abc
abc
bc
output:
4
3
2
"""
import sys
sys.setrecursionlimit(int(1e5))
def lcs(A, B):
m, n = len(A), len(B)
count_list = tuple([[0] * (n + 1) for _ in range(m + 1)])
for i in range(1, m + 1):
... | #!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
input:
3
abcbdab
bdcaba
abc
abc
abc
bc
output:
4
3
2
"""
import sys
sys.setrecursionlimit(int(1e5))
def lcs(A, B):
m, n = len(A), len(B)
dp = tuple([[0] * (n + 1) for _ in range(m + 1)])
max_l = 0
for i in range(1, m + 1):... | p02235 |
import sys
n = int(eval(input()))
primary = [0] * 1000
secondary = [0] * 1000
for i in range(n):
s1 = sys.stdin.readline().strip()
s2 = sys.stdin.readline().strip()
len1 = len(s1)
len2 = len(s2)
for i in range(len1):
primary[i] = 0
secondary[i] = 0
for... | import sys
def len_lcs(s1, s2):
"""Find length of the longest common sequence(LCS) of strings s1 and s2.
The complexity is ~MN.
>>> len_lcs("abc", "abc")
3
>>> len_lcs("abcbdaba", "bdcaba")
5
"""
results = [0] * len(s1)
for i, c2 in enumerate(s2):
sec1, pr1... | p02235 |
import sys
def len_lcs(s1, s2):
"""Find length of the longest common sequence(LCS) of strings s1 and s2.
The complexity is ~MN.
>>> len_lcs("abc", "abc")
3
>>> len_lcs("abcbdaba", "bdcaba")
5
"""
results = [0] * len(s1)
for i, c2 in enumerate(s2):
sec1, pr1... | import sys
def len_lcs(s1, s2):
"""Find length of the longest common sequence(LCS) of strings s1 and s2.
The complexity is ~MN.
>>> len_lcs("abc", "abc")
3
>>> len_lcs("abcbdaba", "bdcaba")
5
"""
results = [0] * len(s1)
for i, c2 in enumerate(s2):
sec1, pr1... | p02235 |
e=input
for _ in[0]*int(e()):
X,z=e(),[]
for y in e():
s=i=0
for k in z:
t=X.find(y,s)+1
if t<1:break
if t<k:z[i]=t
s=k;i+=1
else:
t=X.find(y,s)+1
if t:z+=[t]
print((len(z)))
| e=input
a=[]
for _ in[0]*int(e()):
X,z=e(),[]
for y in e():
s=i=0
for k in z:
t=X.find(y,s)+1
if t<1:break
if t<k:z[i]=t
s=k;i+=1
else:
t=X.find(y,s)+1
if t:z+=[t]
a+=[len(z)]
print(*a,sep='\n')
| p02235 |
e=input
a=[]
for _ in[0]*int(e()):
X,z=e(),[]
for y in e():
s=i=0
for k in z:
t=X.find(y,s)+1
if t<1:break
if t<k:z[i]=t
s=k;i+=1
else:
t=X.find(y,s)+1
if t:z+=[t]
a+=[len(z)]
print(*a,sep='\n')
| e=input
a=''
for _ in[0]*int(e()):
X,z=e(),[]
for y in e():
s=i=0
for k in z:
t=X.find(y,s)+1
if t<1:break
if t<k:z[i]=t
s=k;i+=1
else:
t=X.find(y,s)+1
if t:z+=[t]
a+=f'\n{len(z)}'
print((a[1:]))
| p02235 |
e=input
a=[]
for _ in[0]*int(e()):
X,z=e(),[]
for y in e():
s=i=0
for k in z:
t=X.find(y,s)+1
if t<1:break
if t<k:z[i]=t
s=k;i+=1
else:
t=X.find(y,s)+1
if t:z+=[t]
a+=[z]
print(('\n'.join(map(str,list(map(len,a))))))
| e=input
a=[]
for _ in[0]*int(e()):
X,z=e(),[]
for y in e():
s=i=0
for k in z:
t=X.find(y,s)+1
if t<1:break
if t<k:z[i]=t
s=k;i+=1
else:
t=X.find(y,s)+1
if t:z+=[t]
a+=[z]
print(*map(len,a),sep='\n')
| p02235 |
def lcs(X, Y):
X = " " + X
Y = " " + Y
c = [[0 for j in range(len(Y))] for i in range(len(X))]
maxl = 0
for i in range(1,len(X)):
for j in range(1,len(Y)):
if X[i] == Y[j]:
c[i][j] = c[i - 1][j - 1] + 1
else:
c[i][j] = m... | def lcs(X, Y):
X = " " + X
Y = " " + Y
#c = [[0 for j in range(len(Y))] for i in range(len(X))]
c = [[0] * len(Y) for i in range(len(X))]
maxl = 0
for i in range(1,len(X)):
for j in range(1,len(Y)):
if X[i] == Y[j]:
c[i][j] = c[i - 1][j - 1] + 1... | p02235 |
def lcs(X, Y):
X = " " + X
Y = " " + Y
#c = [[0 for j in xrange(len(Y))] for i in xrange(len(X))]
c = [[0] * len(Y) for i in range(len(X))]
maxl = 0
for i in range(1,len(X)):
for j in range(1,len(Y)):
if X[i] == Y[j]:
c[i][j] = c[i - 1][j - 1] +... | def lcs(X, Y):
#X = " " + X
#Y = " " + Y
#c = [[0 for j in xrange(len(Y))] for i in xrange(len(X))]
c2 = [0 for i in range(len(Y) + 1)]
#maxl = 0
for i in range(len(X)):
c1 = c2 + []
for j in range(len(Y)):
if X[i] == Y[j]:
c2[j + 1] =... | p02235 |
#dj 16D8101012J ito jun
import sys
def search(a,b):
na=len(a)
nb=len(b)
array = [[0]*(nb+1) for _ in range(na+1)]
for i,x in enumerate(a,1):
prerow=array[i-1]
row=array[i]
for j,y in enumerate(b,1):
if x == y:
row[j]=prerow[j-1]+1
... | #dj 16D8101012J ito jun
import sys
def search(a,b):
na=len(a)
nb=len(b)
array = [[0]*(nb+1) for _ in range(na+1)]
for i,x in enumerate(a,1):
prerow=array[i-1]
row=array[i]
for j,y in enumerate(b,1):
if x == y:
row[j]=prerow[j-1]+1
... | p02235 |
def lcs_hs(s1, s2):
from bisect import bisect_left
p = []
append_p = p.append
for i, c in enumerate(s1):
j = s2.find(c)+1
while j:
append_p((i, -j))
j = s2.find(c, j)+1
lis, result = [], 0
append_lis = lis.append
for _, y in sorted(p):
... | def lcs_hs(s1, s2):
from bisect import bisect_left
s2 = s2[::-1]
lis, result = [], 0
append = lis.append
for c in s1:
i = s2.find(c)+1
while i:
j = bisect_left(lis, -i)
if j >= result:
append(-i)
result += 1
... | p02235 |
def lcs_hs(s1, s2):
from bisect import bisect_left
s2 = s2[::-1]
lis, result = [], 0
append = lis.append
for c in s1:
i = s2.find(c)+1
while i:
j = bisect_left(lis, -i)
if j >= result:
append(-i)
result += 1
... | def lcs_hs(s1, s2):
from bisect import bisect_left
s2, lis, result = s2[::-1], [], 0
find, append = s2.find, lis.append
for c in s1:
i = find(c)+1
while i:
j = bisect_left(lis, -i)
if j >= result:
append(-i)
result += ... | p02235 |
from itertools import chain
from sys import stdin
def lcs(x, y):
m = len(x)
n = len(y)
c = [[0] * 1001 for i in range(1002)]
# x = " " + x
# y = " " + y
for i in range(1, m + 1):
for j in range(1, n + 1):
if x[i-1] == y[j-1]:
c[i][j] = c[i - 1][j - ... |
from sys import stdin
def lcs(x, y):
m = len(x)
n = len(y)
c = [[0]*(n + 1) for a in range(m + 2)]
for i in range(1, m + 1):
for j in range(1, n + 1):
if x[i-1] == y[j-1]:
c[i][j] = c[i - 1][j - 1] + 1
else:
c[i][j] = max(c[i - ... | p02235 |
def lcs(x, y):
a = len(x)
b = len(y)
c1 = [0] * (b + 1)
for i in range(a):
c2 = c1[:]
for j in range(b):
if x[i] == y[j]:
c1[j+1] = c2[j] + 1
elif c1[j+1] < c1[j]:
c1[j+1] = c1[j]
return c1[-1]
n = int(input().r... | def lcs(x, y):
a = len(x)
b = len(y)
c1 = [0] * (b + 1)
for i in range(a):
e1 = x[i]
c2 = c1[:]
for j in range(b):
if e1 == y[j]:
c1[j+1] = c2[j] + 1
elif c1[j+1] < c1[j]:
c1[j+1] = c1[j]
return c1[-1]
... | p02235 |
q = int(input().rstrip())
ans = []
for i in range(q):
x = input().rstrip()
y = input().rstrip()
n = len(x)
m = len(y)
dp1 = [0]*(m+1)
for i in range(n):
s = x[i]
dp2 = dp1[:]
for j in range(m):
if s == y[j]:
dp1[j+1] = dp2[j]+1
... | def calc(x,y):
n = len(x)
m = len(y)
dp1 = [0]*(m+1)
for i in range(n):
s = x[i]
dp2 = dp1[:]
for j in range(m):
if s == y[j]:
dp1[j+1] = dp2[j]+1
elif dp1[j+1] < dp1[j]:
dp1[j+1] = dp1[j]
return dp1[-1]
q... | p02235 |
"""
problem statment url: http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ALDS1_10_C
"""
def lcs():
s1 = input()
s2 = input()
la, lb = len(s1), len(s2)
dp1 = [0 for _ in range(lb + 1)]
for i in range(la):
dp2 = dp1 + []
for j in range(lb):
if s1[i] == s2[j]:
dp1[j + 1] = dp2[j... | """
problem statment url: http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ALDS1_10_C
"""
def lcs():
s1 = input()
s2 = input()
la, lb = len(s1), len(s2)
dp1 = [0 for _ in range(lb + 1)]
for i in range(la):
dp2 = dp1 + []
for j in range(lb):
if s1[i] == s2[j]:
dp1[j + 1] = dp2[j... | p02235 |
def lcs(X, Y):
m = len(X) + 1
n = len(Y) + 1
c = [[0] * n for _ in range(m)]
X = ' ' + X
Y = ' ' + Y
maxl = 0
for i in range(1,m):
for j in range(1,n):
if X[i] == Y[j]:
c[i][j] = c[i-1][j-1] + 1
#elif c[i-1][j] >= c[i][j-1]:
... | def lcs(x,y):
a, b = len(x), len(y)
x1 = [0 for k in range(b+1)]
for i in range(a):
e = x[i]
x2 = x1+[]
for j in range(b):
if e == y[j]:
x1[j+1] = x2[j] + 1
elif x1[j+1] < x1[j]:
x1[j+1] = x1[j]
print(max(x1))
... | p02235 |
import sys
readline = sys.stdin.readline
from collections import defaultdict
from bisect import bisect_left, bisect, insort_left, insort
INF = 10000
def lcs(s1, s2):
c = defaultdict(list)
for i, s in enumerate(s1):
c[s].append(i)
for s in set(s2):
c[s].append(INF)
dp = []
... | import sys
readline = sys.stdin.readline
for _ in range(int(eval(input()))):
a = readline().strip()
b = readline().strip()
indices = []
for cb in b:
bgn_idx = 0
for i, cur_idx in enumerate(indices):
chr_idx = a.find(cb, bgn_idx) + 1
if not chr_idx:
... | p02235 |
# coding: utf-8
def array2d(d1, d2, init = None):
return [[init for _ in range(d2)] for _ in range(d1)]
def solve():
x = input().strip()
y = input().strip()
# dp[i][j]: x[:i], y[:j] ???LCS
# dp[i][j] = max(dp[i-1][j], dp[i][j-1], dp[i-1][j-1]+1(if x[i]==y[j]))
dp = array2d(len(x)... | # coding: utf-8
def array2d(d1, d2, init = None):
return [[init for _ in range(d2)] for _ in range(d1)]
def solve():
x = input().strip()
y = input().strip()
# dp[i][j]: x[:i], y[:j] ???LCS
# dp[i][j] = max(dp[i-1][j], dp[i][j-1], dp[i-1][j-1]+1(if x[i]==y[j]))
dp = array2d(len(x)... | p02235 |
import sys
def findLCS(X, Y):
C = [[0 for i in range(1001)] for j in range(1001)]
X, Y = " " + X, " " + Y
m, n, maxl = len(X), len(Y), 0
for i in range(1, m):
for j in range(1, n):
if X[i] == Y[j]:
C[i][j] = C[i - 1][j - 1] + 1
else:
... | import sys
def findLCS(X, Y):
m, n = len(X), len(Y)
C = [0] * (n + 1)
for i in range(m):
tmp = C[:]
for j in range(n):
if X[i] == Y[j]:
C[j + 1] = tmp[j] + 1
elif C[j + 1] < C[j]:
C[j + 1] = C[j]
return C[-1]
lin... | p02235 |
def LCS():
x = input()
y = input()
i = len(x)
j = len(y)
dsp = [[0 for col in range(j+1)] for row in range(i+1)]
for i in range(1,i+1):
for j in range(1,j+1):
if x[i-1] == y[j-1]:
dsp[i][j] = dsp[i-1][j-1]+1
else:
dsp[i][j] = max(dsp[i-1][j],dsp[i][j-1])
return dsp[i][j]
q = eval... | def LCS():
x = input()
y = input()
i, j = len(x), len(y)
dsp = [[0 for col in range(j+1)] for row in range(i+1)]
for i in range(1,i+1):
for j in range(1,j+1):
if x[i-1] == y[j-1]:
dsp[i][j] = dsp[i-1][j-1]+1
else:
dsp[i][j] = max(dsp[i-1][j],dsp[i][j-1])
print(dsp[i][j])
q = eval(i... | p02235 |
def LCS():
x = input()
y = input()
i, j = len(x), len(y)
dsp = [[0 for col in range(j+1)] for row in range(i+1)]
for i in range(1,i+1):
for j in range(1,j+1):
if x[i-1] == y[j-1]:
dsp[i][j] = dsp[i-1][j-1]+1
else:
dsp[i][j] = max(dsp[i-1][j],dsp[i][j-1])
print(dsp[-1][-1])
q = eval... | def LCS():
x = input()
y = input()
a, b = len(x), len(y)
dsp1 = [0 for i in range(b+1)]
for i in range(a):
dsp2 = dsp1+[]
for j in range(b):
if x[i] == y[j]:
dsp1[j+1] = dsp2[j] + 1
elif dsp1[j+1] < dsp1[j]:
dsp1[j+1] = dsp1[j]
print(max(dsp1))
n = eval(input())
for a in range(... | p02235 |
def lcs(x,y):
x = " " + x
y = " " + y
c = [[0 for i in range(len(x))] for j in range(len(y))]
for i in range (1,len(y)):
for j in range (1,len(x)):
if x[j] == y[i]:
a = 1
else:
a = 0
c[i][j] = max(c[i][j-1],c[i-1][j],c... | def lcs(x,y):
x = " " + x
y = " " + y
c = [[0 for i in range(len(x))] for j in range(len(y))]
for i in range (1,len(y)):
for j in range (1,len(x)):
if x[j] == y[i]:
c[i][j] = c[i-1][j-1] + 1
else:
c[i][j] = max(c[i][j-1],c[i-1][j])... | p02235 |
def lcs(x,y):
x = " " + x
y = " " + y
c = [[0 for i in range(len(x))] for j in range(len(y))]
for i in range (1,len(y)):
for j in range (1,len(x)):
if x[j] == y[i]:
c[i][j] = c[i-1][j-1] + 1
else:
c[i][j] = max(c[i][j-1],c[i-1][j])... | def lcs(x,y):
x = " " + x
y = " " + y
c = [[0 for i in range(len(x))] for j in range(len(y))]
for i in range (1,len(y)):
for j in range (1,len(x)):
if x[j] == y[i]:
c[i][j] = c[i-1][j-1] + 1
elif c[i-1][j] >= c[i][j-1]:
c[i][j] = c... | p02235 |
n = eval(input())
for i in range (n):
x = input()
y = input()
x = " " + x
y = " " + y
c = [[0 for i in range(len(x))] for j in range(len(y))]
for i in range (1,len(y)):
for j in range (1,len(x)):
if x[j] == y[i]:
c[i][j] = c[i-1][j-1] + 1
... | def lcs(x,y):
x = " " + x
y = " " + y
c = [[0 for i in range(len(x))] for j in range(len(y))]
for i in range (1,len(y)):
for j in range (1,len(x)):
if x[j] == y[i]:
c[i][j] = c[i-1][j-1] + 1
elif c[i-1][j] >= c[i][j-1]:
c[i][j] = c... | p02235 |
def lcs(x,y):
x = " " + x
y = " " + y
c = [[0 for i in range(len(x))] for j in range(len(y))]
for i in range (1,len(y)):
for j in range (1,len(x)):
if x[j] == y[i]:
c[i][j] = c[i-1][j-1] + 1
elif c[i-1][j] >= c[i][j-1]:
c[i][j] = c... | def solve():
x = input()
y = input()
a, b = len(x), len(y)
x1 = [0 for k in range(b+1)]
for i in range(a):
e1 = x[i]
x2 = x1+[]
for j in range(b):
if e1 == y[j]:
x1[j+1] = x2[j] + 1
elif x1[j+1] < x1[j]:
x... | p02235 |
def lcs():
x, y = input(), input()
x1 = [0 for k in range(len(y)+1)]
for i in range(len(x)):
e = x[i]
x2 = x1 + []
for j in range(len(y)):
if e == y[j]:
x1[j+1] = x2[j] + 1
elif x1[j+1] < x1[j]:
x1[j+1] = x1[j]
pr... | def lcs():
x, y = input(), input()
b1 = [0 for k in range(len(y)+1)]
for i in range(len(x)):
a = x[i]
b2 = b1 + []
for j in range(len(y)):
if a == y[j]:
b1[j+1] = b2[j] + 1
elif b1[j+1] < b1[j]:
b1[j+1] = b1[j]
pr... | p02235 |
# -*- coding: utf-8 -*-
def lcs(x, y):
dp = {(0, 0): 0}
for i in range(1, len(x) + 1):
dp[(i, 0)] = 0
for j in range(1, len(y) + 1):
dp[(0, j)] = 0
for i in range(1, len(x) + 1):
for j in range(1, len(y) + 1):
if x[i - 1] == y[j - 1]:
dp[(i, ... | # -*- coding: utf-8 -*-
def lcs_sol(x, y):
n = len(x)
m = len(y)
dp = [0 for j in range(m + 1)]
for i in range(1, n + 1):
dp_prev = dp[:]
for j in range(1, m + 1):
if x[i - 1] == y[j - 1]:
dp[j] = dp_prev[j - 1] + 1
else:
... | p02235 |
# -*- coding: utf-8 -*-
def lcs_sol(x, y):
n = len(x)
m = len(y)
dp = [0 for j in range(m + 1)]
for i in range(1, n + 1):
dp_prev = dp[:]
for j in range(1, m + 1):
if x[i - 1] == y[j - 1]:
dp[j] = dp_prev[j - 1] + 1
elif dp_prev[j] < dp... | # -*- coding: utf-8 -*-
def lcs_sol(x, y):
n = len(x)
m = len(y)
dp = [0 for j in range(m + 1)]
for i in range(1, n + 1):
dp_prev = dp[:]
for j in range(1, m + 1):
if x[i - 1] == y[j - 1]:
dp[j] = dp_prev[j - 1] + 1
elif dp_prev[j] < dp... | p02235 |
# -*- coding: utf-8 -*-
def lcs_sol(x, y):
n = len(x)
m = len(y)
dp = [0 for j in range(m + 1)]
for i in range(1, n + 1):
dp_prev = dp[:]
for j in range(1, m + 1):
if x[i - 1] == y[j - 1]:
dp[j] = dp_prev[j - 1] + 1
elif dp_prev[j] < dp... | # -*- coding: utf-8 -*-
def lcs_sol(x, y):
n = len(x)
m = len(y)
dp = [0 for j in range(m + 1)]
for i in range(1, n + 1):
dp_prev = dp[:]
for j in range(1, m + 1):
if x[i - 1] == y[j - 1]:
dp[j] = dp_prev[j - 1] + 1
elif dp_prev[j] < dp... | p02235 |
import sys
q = int(sys.stdin.readline().strip())
for _ in range(q):
x = sys.stdin.readline().strip()
y = sys.stdin.readline().strip()
n = len(x)
m = len(y)
dp = [0 for j in range(m + 1)]
for i in range(1, n + 1):
dp_prev = dp[:]
for j in range(1, m + 1):
... | # -*- coding: utf-8 -*-
def lcs(x, y):
n = len(x)
m = len(y)
dp = [0 for j in range(m + 1)]
for i in range(1, n + 1):
dp_prev = dp[:]
for j in range(1, m + 1):
if x[i - 1] == y[j - 1]:
dp[j] = dp_prev[j - 1] + 1
elif dp_prev[j] < dp[j -... | p02235 |
# -*- coding: utf-8 -*-
def lcs(x, y):
n = len(x)
m = len(y)
dp = [0 for j in range(m + 1)]
for i in range(1, n + 1):
dp_prev = dp[:]
for j in range(1, m + 1):
if x[i - 1] == y[j - 1]:
dp[j] = dp_prev[j - 1] + 1
elif dp_prev[j] < dp[j -... | def m():
e=input
a=''
for _ in[0]*int(e()):
X,z=e(),[]
for y in e():
s=i=0
for k in z:
t=X.find(y,s)+1
if t<1:break
if t<k:z[i]=t
s=k;i+=1
else:
t=X.find(y,s)+1
if t:z+=[t]
a+=f'\n{len(z)}'
print((a[1:]))
if'__main__'==__name__:m()
| p02235 |
def lcs(s, t):
dp = {}
slen = len(s)
tlen = len(t)
for i in range(slen + 1):
dp[i] = {0: 0}
for j in range(tlen + 1):
dp[0][j] = 0
for i in range(1, slen + 1):
for j in range(1, tlen + 1):
if s[i-1] == t[j-1]:
dp[i][j] = dp[i-1][j-1] + 1
else:
dp[i][j... | def lcs(s, t):
slen = len(s)
tlen = len(t)
dp = [None] * (slen + 1)
for i in range(slen + 1):
dp[i] = [0] * (tlen + 1)
for i in range(1, slen + 1):
for j in range(1, tlen + 1):
if s[i-1] == t[j-1]:
dp[i][j] = dp[i-1][j-1] + 1
else:
dp[i][j] = max(dp[i][j-1], ... | p02235 |
DP_MAX = 1000
dp = [0] * (DP_MAX + 1)
for i in range(DP_MAX + 1):
dp[i] = [0] * (DP_MAX + 1)
def lcs(s, t):
slen = len(s)
tlen = len(t)
dp_i = dp[0]
for i in range(1, slen + 1):
dp_i_1 = dp_i
dp_i = dp[i]
for j in range(1, tlen + 1):
if s[i-1] == t[j-1]:
dp_i[j] ... | def lcs(s, t):
slen = len(s)
tlen = len(t)
dp = [0] * (slen + 1)
dp[0] = [0] * (tlen + 1)
for i in range(1, slen + 1):
dp_prev = dp[i-1]
dp_cur = [0] * (tlen + 1)
c = s[i-1]
for j in range(1, tlen + 1):
if c == t[j-1]:
dp_cur[j] = dp_prev[j-1] + 1
else:
... | p02235 |
#!/usr/bin/env python
from sys import stdin
def main():
n = int(stdin.readline())
for _ in range(n):
x = stdin.readline().rstrip()
y = stdin.readline().rstrip()
m = len(x)
n = len(y)
#assert 1 <= m <= 1000
#assert 1 <= n <= 1000
c = ... | #!/usr/bin/env python
from sys import stdin
def main():
n = int(stdin.readline())
for _ in range(n):
x = stdin.readline().rstrip()
y = stdin.readline().rstrip()
m = len(x)
n = len(y)
c = [[0]*(n+1) for _ in range(m+1)]
cim1 = c[0]
... | p02235 |
#!/usr/bin/env python
from sys import stdin
def main():
num = int(stdin.readline())
c = [list(range(1001)) for _ in range(1001)]
for _ in range(num):
x = stdin.readline().rstrip()
y = stdin.readline().rstrip()
m = len(x)
n = len(y)
for i in ran... | #!/usr/bin/env python
from sys import stdin
def main():
num = int(stdin.readline())
for _ in range(num):
x = stdin.readline().rstrip()
y = stdin.readline().rstrip()
n = len(y) + 1
cim1 = [0] * n
for i, xi in enumerate(x, start=1):
ci = [0... | p02235 |
def main():
n = eval(input())
for i in range(n):
X = input()
Y = input()
print(lcs(X,Y))
def lcs(X,Y):
m = len(X)
n = len(Y)
c = [[0] for i in range(m+1)]
c[0] += [0]*n
for i in range(m):
for j in range(n):
if X[i] == Y[j]:
... | def main():
n = eval(input())
for i in range(n):
X = input()
Y = input()
print(lcs(X,Y))
def lcs(X,Y):
m = len(X)
n = len(Y)
r1 = [0 for i in range(n+1)]
for i in range(m):
r0 = r1[:]
for j in range(n):
if X[i] == Y[j]:
... | p02235 |
# -*- coding: utf-8 -*-
"""
http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ALDS1_10_C
????????±?????¨??????
"""
import sys
from sys import stdin
input = stdin.readline
C = []
def calc_lcs4(X, Y):
global C
X = ' ' + X
Y = ' ' + Y
m = len(X)
n = len(Y)
C = [[0]*(n+... | # -*- coding: utf-8 -*-
"""
http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ALDS1_10_C
????????±?????¨??????
"""
import sys
from sys import stdin
input = stdin.readline
C = []
def calc_lcs4(X, Y):
global C
X = ' ' + X
Y = ' ' + Y
m = len(X)
n = len(Y)
C = [[0]*(n+... | p02235 |
# -*- coding: utf-8 -*-
"""
http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ALDS1_10_C
????????±?????¨??????
"""
import sys
from sys import stdin
input = stdin.readline
C = []
def calc_lcs4(X, Y):
global C
X = ' ' + X
Y = ' ' + Y
m = len(X)
n = len(Y)
C = [[0]*(n+... | # -*- coding: utf-8 -*-
"""
http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ALDS1_10_C
????????±?????¨??????
"""
import sys
from sys import stdin
input = stdin.readline
def calc_lcs4(X, Y):
X = ' ' + X
Y = ' ' + Y
m = len(X)
n = len(Y)
C = [[0]*(n+1) for _ in range(m+... | p02235 |
q = int(input())
lcs = {}
for i in range(1010):
lcs[i] = {}
for j in range(1010):
lcs[i][j] = 0
for i in range(q):
X = input()
Y = input()
for i in range(len(X)):
for j in range(len(Y)):
if X[i] == Y[j]:
lcs[i+1][j+1] = lcs[i][j] + 1
... | q = int(input())
lcs = [[0 for j in range(1010)] for i in range(1010)]
for i in range(q):
X = input()
Y = input()
for i in range(len(X)):
for j in range(len(Y)):
if X[i] == Y[j]:
lcs[i+1][j+1] = lcs[i][j] + 1
elif lcs[i][j+1] > lcs[i+1][j]:
... | p02235 |
q = int(input())
lcs = [[0 for j in range(1010)] for i in range(1010)]
for i in range(q):
X = input()
Y = input()
for i in range(len(X)):
for j in range(len(Y)):
if X[i] == Y[j]:
lcs[i+1][j+1] = lcs[i][j] + 1
elif lcs[i][j+1] > lcs[i+1][j]:
... | q = int(input())
for i in range(q):
X = input()
Y = input()
lcs1 = [0 for i in range(len(Y)+1)]
for i in range(len(X)):
lcs2 = lcs1+[]
for j in range(len(Y)):
if X[i] == Y[j]:
lcs2[j+1] = lcs1[j] + 1
elif lcs1[j+1] > lcs2[j]:
... | p02235 |
ans = {}
roop = eval(input())
for k in range(roop):
str1 = input()
str2 = input()
len1 = len(str1)
len2 = len(str2)
for i in range (-1, len1):
for j in range(-1, len2):
if(i == -1 or j == -1):
ans[i, j] = 0
else:
... | roop = eval(input())
for k in range(roop):
str1 = input()
str2 = input()
len1 = len(str1) + 1
len2 = len(str2) + 1
ans = [None] * (len1)
for i in range(len1):
ans[i] = [None] * (len2)
for i in range(len1):
ans[i][0] = 0
for j in range(len2):
ans[0][j] ... | p02235 |
ans = [None] * 1001
for i in range(1001):
ans[i] = [None] * 1001
for i in range(1001):
ans[i][0] = 0
for j in range(1001):
ans[0][j] = 0
roop = eval(input())
for k in range(roop):
str1 = input()
str2 = input()
len1 = len(str1) + 1
len2 = len(str2) + 1
for i in range (1... | n = eval(input())
for k in range(n):
str1 = input()
str2 = input()
after = [0] * (len(str2) + 1)
for i in range(1, len(str1) + 1):
before = after + []
for j in range(1, len(str2) + 1):
if str1[i - 1] == str2[j - 1]:
after[j] = before[j - 1... | p02235 |
n = eval(input())
for k in range(n):
str1 = input()
str2 = input()
after = [0] * (len(str2) + 1)
for i in range(1, len(str1) + 1):
before = after + []
for j in range(1, len(str2) + 1):
if str1[i - 1] == str2[j - 1]:
after[j] = before[j - 1... | n = eval(input())
for k in range(n):
str1 = input()
str2 = input()
after = [0] * (len(str2) + 1)
for i in range(1, len(str1) + 1):
before = after + []
for j in range(1, len(str2) + 1):
if str1[i - 1] == str2[j - 1]:
after[j] = before[j - 1... | p02235 |
import sys
def lcs(X, Y):
c = [0 for _ in range(len(Y) + 1)]
for i in X:
tmp = c[:]
for ji, yc in enumerate(Y):
j = ji + 1
if i == yc:
c[j] = tmp[j - 1] + 1
else:
c[j] = max(tmp[j], c[j - 1])
return c[-1]
n =... | import sys
def lcs(X, Y):
c = [0 for _ in range(len(Y) + 1)]
for i in X:
tmp = c[:]
for ji, yc in enumerate(Y):
j = ji + 1
if i == yc:
c[j] = tmp[j - 1] + 1
elif c[j] < c[j - 1]:
c[j] = c[j - 1]
return c[-1]
... | p02235 |
import sys
n = eval(input())
for i2 in range(n):
seq1 = input()
seq2 = input()
a,b = len(seq1)+1, len(seq2)+1
length = [[0 for i in range(b)] for j in range(a)]
for i in range(a):
for j in range(b):
if i==0 or j==0:
length[i][j]=0
... | import sys
def longestcommonsubsequence(seq1, seq2):
a,b = len(seq1)+1, len(seq2)+1
length = [[0 for i in range(b)] for j in range(a)]
for i in range(a):
for j in range(b):
if i==0 or j==0:
pass
length[i][j]=0
else:
... | p02235 |
import sys
def longestcommonsubsequence(seq1, seq2):
a,b = len(seq1), len(seq2)
length = [[0 for i in range(b+1)] for j in range(a+1)]
for i in range(a):
e1 = seq1[i]
tmp = length[i]
x = [0 for i2 in range(b+1)]
for j in range(b):
if e1 == seq2[j]:
... | import sys
def longestcommonsubsequence(seq1, seq2):
a,b = len(seq1), len(seq2)
x1 = [0 for i in range(b+1)]
for i in range(a):
e1 = seq1[i]
x2 = x1
x1 = [0]
for j in range(b):
if e1 == seq2[j]:
x1.append(x2[j] + 1)
else:
... | p02235 |
import sys
def longestcommonsubsequence(seq1, seq2):
a,b = len(seq1), len(seq2)
x1 = [0 for i in range(b+1)]
for i in range(a):
e1 = seq1[i]
x2 = x1
x1 = [0]
for j in range(b):
if e1 == seq2[j]:
x1.append(x2[j] + 1)
else:
... | import sys
def longestcommonsubsequence(seq1, seq2):
a,b = len(seq1), len(seq2)
x1 = [0 for i in range(b+1)]
for i in range(a):
e1 = seq1[i]
x2 = x1
x1 = [0 for i in range(b+1)]
for j in range(b):
if e1 == seq2[j]:
x1[j+1]=x2[j] + 1
... | p02235 |
import sys
n = eval(input())
for i2 in range(n):
seq1 = input()
seq2 = input()
a,b = len(seq1), len(seq2)
x1 = [0 for i in range(b+1)]
for i in range(a):
e1 = seq1[i]
x2 = x1
x1 = [0 for i in range(b+1)]
for j in range(b):
if e1 == seq2[j]:... | import sys
def longestcommonsubsequence():
seq1 = input()
seq2 = input()
a,b = len(seq1), len(seq2)
x1 = [0 for i in range(b+1)]
for i in range(a):
e1 = seq1[i]
x2 = x1
x1 = [0 for i in range(b+1)]
for j in range(b):
if e1 == seq2[j]:
... | p02235 |
import sys
def longestcommonsubsequence():
seq1 = input()
seq2 = input()
a,b = len(seq1), len(seq2)
x1 = [0 for i in range(b+1)]
i=0
for e1 in seq1:
x2 = x1
x1 = [0 for i in range(b+1)]
j=0
for e2 in seq2:
if e1 == e2:
... | import sys
def longestcommonsubsequence():
seq1 = input()
seq2 = input()
a,b = len(seq1), len(seq2)
x1 = [0 for i in range(b+1)]
i=0
for e1 in seq1:
x2 = x1
x1 = [0 for i in range(b+1)]
j=0
for j in range(b):
if e1 == seq2[j]:
... | p02235 |
import sys
def longestcommonsubsequence():
seq1 = input()
seq2 = input()
a,b = len(seq1), len(seq2)
x1 = [0 for i in range(b+1)]
for i in range(a):
e1 = seq1[i]
x2 = x1
x1 = [0 for i2 in range(b+1)]
tmp = 0
for j in range(b):
if e1 ... | import sys
def longestcommonsubsequence():
seq1 = input()
seq2 = input()
a, b = len(seq1), len(seq2)
x1 = [0 for i in range(b+1)]
for i in range(a):
e1 = seq1[i]
x2 = x1+[]
#x1 = [0 for i2 in range(b+1)]
for j in range(b):
if e1 == seq2[j]:
... | p02235 |
import sys
def longestcommonsubsequence():
seq1 = input()
seq2 = input()
a, b = len(seq1), len(seq2)
x1 = [0 for i in range(b+1)]
for i in range(a):
e1 = seq1[i]
x2 = x1+[]
#x1 = [0 for i2 in range(b+1)]
for j in range(b):
if e1 == seq2[j]:
... | import sys
def longestcommonsubsequence():
seq1 = input()
seq2 = input()
a, b = len(seq1), len(seq2)
x1 = [0 for i in range(b+1)]
for i in range(a):
e1 = seq1[i]
x2 = x1+[]
#x1 = [0 for i2 in range(b+1)]
for j in range(b):
if e1 == seq2[j]:
... | p02235 |
# -*- coding:utf-8 -*-
import sys
def search(x, y):
x_length = len(x)
y_length = len(y)
memo = [[0] * y_length for i in range(x_length)]
for i in range(x_length):
for j in range(y_length):
if i == 0 or j == 0:
if x[i] == y[j]:
memo[i]... | # -*- coding:utf-8 -*-
import sys
def search(x, y):
x_length = len(x)
y_length = len(y)
memo = [[0] * (y_length + 1) for i in range(x_length + 1)]
for i, ch_x in enumerate(x, 1):
row = memo[i]
pre_row = memo[i-1]
for j, ch_y in enumerate(y, 1):
if ch_x =... | p02235 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.