input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
N = int(eval(input()))
A = list(map(int, input().split()))
candidates=set()
for i in range(len(A)):
candidates.add(A[i])
candidates.add(A[i]-1)
candidates.add(A[i]+1)
# 渡された配列内に，±1で数xに出来る数がいくつあるか判定
def neigh(array, x):
cnt = 0
for a in array:
if a == x:
cnt+=1
elif a-1 == x:
... | N = int(eval(input()))
A = list(map(int, input().split()))
cnt=dict()
# a内の数とその±1をdict型の配列に入れながら個数をカウント
for a in A:
cnt[a] = cnt.setdefault(a,0) + 1
cnt[a-1] = cnt.setdefault(a-1,0) + 1
cnt[a+1] = cnt.setdefault(a+1,0) + 1
# カウントした数字で昇順にソート
cnt_sort = sorted(list(cnt.items()), key=lambda x:x[... | p03611 |
from collections import Counter
N = int(eval(input()))
a = list(map(int, input().split()))
ac = Counter(a)
ans = 0
for i in list(ac.keys()):
ans = max(ans, ac[i] + ac[i + 1] + ac[i - 1])
print(ans) | N = int(eval(input()))
a = list(map(int, input().split()))
b = [0] * (10 ** 5 + 2)
for i in a:
b[i - 1] += 1
b[i] += 1
b[i + 1] += 1
print((max(b))) | p03611 |
N = int(eval(input()))
A = list(map(int, input().split()))
L = [0 for i in range(max(A) + 1)]
for a in A:
L[a] += 1
if a != 0:
L[a - 1] += 1
if a != max(A):
L[a + 1] += 1
print((max(L)))
| N = int(eval(input()))
A = list(map(int, input().split()))
L = [0 for i in range(max(A) + 10)]
for a in A:
L[a] += 1
L[a - 1] += 1
L[a + 1] += 1
print((max(L)))
| p03611 |
import collections
N = int(eval(input()))
A = [int(T) for T in input().split()]
Num = [0]*(max(A)-min(A)+3)
for T in range(0,N):
Num[A[T]-min(A)+1] += 1
MAX = 0
for T in range(0,max(A)-min(A)+1):
if MAX<sum(Num[T:T+3]):
MAX = sum(Num[T:T+3])
print(MAX) | import collections
N = int(eval(input()))
Num,Count = list(zip(*sorted(collections.Counter(int(T) for T in input().split()).most_common())))
DisN = ((min(Num)-1),)+Num+((max(Num)+1),)
DisC = (0,)+Count+(0,)
MAX = 0
for T in range(1,len(Num)+1):
Dis = DisC[T]
if DisN[T-1]==DisN[T]-1:
Dis += DisC... | p03611 |
import collections
n = int(eval(input()))
a = list(map(int, input().split()))
s =set(a)
ans = []
for x in s:
x -= 1
for _ in range(2):
l = []
x += 1
for i in a:
if i == x - 1:
l.append(i+1)
elif i == x:
l.append(i)... | from collections import Counter
n = int(eval(input()))
a = list(map(int, input().split()))
sa =set(a)
ca = Counter(a)
ans = 0
for x in sa:
# カウンタオブジェクトは存在しない要素に０を返す
tmp = ca[x-1] + ca[x] + ca[x+1]
if ans < tmp:
ans = tmp
print(ans) | p03611 |
import collections
n = int(eval(input()))
A = list(map(int, input().split()))
x = []
x_append = x.append
for a in A:
x_append(a-1)
x_append(a)
x_append(a+1)
X = collections.Counter(x)
print((X.most_common()[0][1])) | from collections import Counter
N = int(eval(input()))
A = list(map(int, input().split()))
B = []
for a in A:
B.append(a-1)
B.append(a)
B.append(a+1)
C = Counter(B)
print((C.most_common()[0][1])) | p03611 |
# -*- coding: utf-8 -*-
import collections
n = int(eval(input()))
a = [int(i) for i in input().split()]
ans = 0
c = collections.Counter(a)
#print(c)
#print(set(a))
b = list(set(a))
for i in range(len(b)):
tmp = c[b[i] - 1] + c[b[i]] + c[b[i] + 1]
#print(tmp)
if ans < tmp:
ans = tmp
p... | # -*- coding: utf-8 -*-
import collections
n = int(eval(input()))
a = [int(i) for i in input().split()]
ans = 0
c = collections.Counter(a)
b = list(set(a))
for i in range(len(b)):
tmp = c[b[i] - 1] + c[b[i]] + c[b[i] + 1]
if tmp > ans:
ans = tmp
print(ans)
| p03611 |
import bisect
n=int(eval(input()))
a=sorted([int(i) for i in input().split()])
ma=0
for i in range(10**5):
ma=max(bisect.bisect_right(a,i+1)-bisect.bisect_left(a,i-1),ma)
print(ma)
| import bisect
n=int(eval(input()))
a=[int(i) for i in input().split()]
b=[0]*(10**5)
for i in range(n):
b[a[i]]+=1
ma=0
for i in range(1,10**5-1):
ma=max(b[i-1]+b[i]+b[i+1],ma)
print(ma)
#累積和でやると早い
| p03611 |
from collections import Counter, deque
# from copy import copy, deepcopy
# from fractions import gcd
# from functools import reduce
# from itertools import accumulate, permutations, combinations, combinations_with_replacement, groupby, product
# import math
# import numpy as np
import sys
sys.setrecursionlimit(... | from collections import Counter, deque
# from copy import copy, deepcopy
# from fractions import gcd
# from functools import reduce
# from itertools import accumulate, permutations, combinations, combinations_with_replacement, groupby, product
# import math
# import numpy as np
# from operator import xor
import... | p03611 |
A1,A2,A3=list(map(int,input().split()))
A=[A1,A2,A3]
A.append(A1)
def A_(i):
if A[i]-A[i+1]>=0:
return A[i]-A[i+1]
else:
return A[i+1]-A[i]
B=[A_(i) for i in range(3)]
B.append(A_(0))
B.append(A_(1))
def sum(j):
return B[j]+B[j+1]
C=[sum(j) for j in range(3)]
print((min(C))) | A1,A2,A3=list(map(int,input().split()))
A_1=abs(A1-A2)+abs(A2-A3)
A_2=abs(A1-A3)+abs(A2-A3)
A_3=abs(A1-A2)+abs(A1-A3)
print((min(A_1,A_2,A_3))) | p03292 |
array = sorted([int(x) for x in input().split()])
tmp = array[0]
ans = 0
for i in array[1:]:
ans += i-tmp
tmp = i
print(ans) | a, a2, a3 = sorted([int(x) for x in input().split()])
print((abs(a2-a)+abs(a3-a2))) | p03292 |
a = list(map(int, input().split()))
r = max(a)
a.remove(max(a))
ans = 0
ans += abs(r - max(a)) + abs(a[0] - a[1])
print(ans)
| a, b, c = list(map(int, input().split()))
l = [a ,b, c]
l.sort()
ans = []
p = l.pop()
ans.append(abs(p-l[0]) + abs(l[0]-l[1]))
ans.append(abs(p-l[1]) + abs(l[1]-l[0]))
print((min(ans))) | p03292 |
a1,a2,a3 = list(map(int,input().split(" ")))
a12 = abs(a1 - a2)
a13 = abs(a1 - a3)
a23 = abs(a2 - a3)
max_num = max(a12,a13, a23)
print((a12 + a13 + a23 - max_num))
| a_lst = list(map(abs, list(map(int, input().split(" ")))))
a_lst.sort()
total = 0
previous = a_lst[0]
for i in a_lst[1:]:
total += (i - previous)
previous = i
print(total)
| p03292 |
A1, A2, A3 = list(map(int, input().split()))
ans = 1000
for x in range(6):
temp = 0
if x == 0:
temp += abs(A2 - A1)
temp += abs(A3 - A2)
elif x == 1:
temp += abs(A3 - A1)
temp += abs(A2 - A3)
elif x == 2:
temp += abs(A1 - A2)
temp += abs(A3 - A... | a,b,c = sorted(map(int, input().split()))
print((c-a)) | p03292 |
a,b,c = list(map(int,input().split()))
print((max(a,b,c)-min(a,b,c))) | t = list(map(int,input().split()))
print((max(t)-min(t))) | p03292 |
a, b, c =sorted(map(int, input().split()), reverse=True)
print(((a-b)+(b-c))) | a = list(map(int, input().split()))
a.sort()
print((abs(a[2]-a[1])+abs(a[1]-a[0])))
| p03292 |
a = list(map(int, input().split()))
a.sort()
print((a[2]-a[1]+a[1]-a[0]))
| a, b, c = sorted(map(int, input().split()))
print((c-a))
| p03292 |
X = list(map(int,input().split()))
X.sort()
print((X[1]-X[0] + X[2]-X[1])) | X = list(map(int,input().split()))
print((max(X)-min(X))) | p03292 |
a = sorted(list(map(int,input().split())))
print((a[2] - a[0])) | a = list(map(int,input().split()))
print((max(a) - min(a))) | p03292 |
A = list(map(int,input().split()))
A.sort()
ans = A[2]-A[1] + A[1]-A[0]
print(ans) | A = list(map(int,input().split()))
A.sort()
ans = A[2]-A[0]
print(ans)
| p03292 |
A = [int(i) for i in input().split()]
ans = 0
A.sort()
for i in range(len(A)-1):
ans += A[i+1] - A[i]
print(ans) | A = [int(i) for i in input().split()]
print((max(A)-min(A))) | p03292 |
A,B,C=list(map(int,input().split()))
l_list=[A,B,C]
l_list.sort()
print((int(l_list[2])-(l_list[0]))) | a,b,c=sorted(map(int,input().split()))
print((abs(a-b)+abs(b-c))) | p03292 |
n = list(map(int, input().split()))
n.sort()
print((n[2]-n[0]))
| n = [int(i) for i in input().split()]
n.sort()
print((int(n[2]-n[0])))
| p03292 |
# -*- coding: utf-8 -*-
import sys
import itertools
# 標準入力を取得
A = list(map(int, input().split()))
# 求解処理
ans = sys.maxsize
for A_1, A_2, A_3 in itertools.permutations(A, r=3):
ans = min(ans, abs(A_2 - A_1) + abs(A_3 - A_2))
# 結果出力
print(ans)
| # -*- coding: utf-8 -*-
# 標準入力を取得
A = list(map(int, input().split()))
# 求解処理
ans = max(A) - min(A)
# 結果出力
print(ans)
| p03292 |
A123 = list(map(int, input().split()))
ans = 1000
for i, a in enumerate(A123):
for j, b in enumerate(A123):
for k, c in enumerate(A123):
if i != j and j != k and k != i:
tmp = abs(b - a) + abs(c - b)
if tmp < ans:
ans = tmp
print(a... | A1, A2, A3 = list(map(int, input().split()))
ans = max(A1, A2, A3) - min(A1, A2, A3)
print(ans) | p03292 |
*a,=list(map(int,input().split()))
print((max(a)-min(a))) | A,B,C=sorted(map(int,input().split()))
print((C-A))
| p03292 |
A = list(map(int,input().split()))
A.sort()
print((A[2] - A[0])) | A = sorted(list(map(int,input().split())))
print((A[2] - A[0])) | p03292 |
c = list(map(int,input().split()))
x = max(c)
c.remove(x)
y = max(c)
c.remove(y)
z = max(c)
c.remove(z)
print((x - z)) | *a, = list(map(int,input().split()))
print((max(a)-min(a))) | p03292 |
A1, A2, A3 = sorted(map(int, input().split()))
print((A3-A1)) | A = sorted(map(int, input().split()))
print((A[-1]-A[0])) | p03292 |
A=list(map(int,input().split()))
print((max(A)-min(A))) | A1,A2,A3=sorted(map(int,input().split()))
print((A3-A1)) | p03292 |
A1, A2, A3 = list(map(int,input().split()))
if A1>A2>A3 or A3>A2>A1:
x = abs(A1-A3)
print(x)
elif A2>A1>A3 or A3>A1>A2:
x = abs(A2-A3)
print(x)
else:
x = abs(A1-A2)
print(x) | a = list(map(int,input().split()))
print((max(a) - min(a)))
| p03292 |
a,b,c = sorted(map(int,input().split()))
print((c-b + b-a)) | *a, = list(map(int,input().split()))
print((max(a)-min(a)))
| p03292 |
def i1():
return int(eval(input()))
def i2():
return [int(i) for i in input().split()]
a=i2()
a.sort()
a=a[::-1]
print((a[0]-a[2])) | def i1():
return int(eval(input()))
def i2():
return [int(i) for i in input().split()]
a=i2()
b=[]
a.sort()
print((abs(a[0]-a[1])+abs(a[2]-a[1])))
| p03292 |
a = sorted(list(map(int, input().split())), reverse=True)
res = 0
for i in range(3 - 1):
res += a[i] - a[i + 1]
print(res) | a = list(map(int, input().split()))
a.sort()
print((a[-1] - a[0])) | p03292 |
a,_,b=sorted(map(int,input().split()));print((b-a)) | *a,=list(map(int,input().split()));print((max(a)-min(a))) | p03292 |
li = list(map(int,input().split()))
li = sorted(li)
answer = -li[0]+li[2]
print(answer) | L = sorted(map(int, input().split()))
print((abs(L[0] - L[1]) + abs(L[1] - L[2]))) | p03292 |
a=list(map(int,input().split()))
b=max(a)
c=min(a)
print((b-c)) | a,b,c=list(map(int,input().split()))
d=max(a,b,c)
e=min(a,b,c)
print((d-e)) | p03292 |
a = list(map(int, input().split()))
a.sort()
cost = 0
for i in range(1, len(a)):
cost += a[i] - a[i-1]
print(cost)
| a = list(map(int, input().split()))
a.sort()
c = 0
for i in range(1, len(a)):
c += abs(a[i] - a[i-1])
print(c)
| p03292 |
a,b,c = input().split(' ')
A = abs(int(a)-int(b))
B = abs(int(b)-int(c))
C = abs(int(c)-int(a))
N = A + B + C -max(A, B, C)
print(N) | *a,= list(map(int, input().split( )))
print((max(*a)-min(*a))) | p03292 |
a,b,c = list(map(int,input().split()))
ans = 9999
ans = min(ans, abs(a-b) + abs(b-c), abs(a-c) + abs(c-b))
ans = min(ans, abs(b-a) + abs(a-c), abs(b-c) + abs(c-a))
ans = min(ans, abs(c-a) + abs(a-b), abs(c-b) + abs(b-a))
print(ans) | a,b,c = list(map(int,input().split()))
print((max(a,b,c) - min(a,b,c))) | p03292 |
A = list(map(int, input().split()))
A_sort = sorted(A)
print((abs(A_sort[1] - A_sort[0]) + (A_sort[2] - A_sort[1])))
| a,b,c=sorted(map(int,input().split()))
print((c-a))
| p03292 |
List = sorted([int(i) for i in input().split()])
print((List[2] - List[0])) | a1, a2, a3 = sorted(list(map(int, input().split())))
print((a3-a1)) | p03292 |
a,b,c=list(map(int,input().split()))
d=[abs(a-b),abs(b-c),abs(c-a)]
print((sum(d)-max(d))) | l = list(map(int,input().split()))
print((max(l)-min(l)))
| p03292 |
a,b,c = sorted(map(int,input().split()))
print(( c - a)) | A = list(map(int, input().split()))
print((max(A)-min(A))) | p03292 |
# -*- coding: utf-8 -*-
list = list(map(int,input().split()))
list.sort()
sum = list[2]-list[1]+list[1]-list[0]
print(sum)
| # -*- coding: utf-8 -*-
list = list(map(int,input().split()))
list.sort()
sum = list[2]-list[0]
print(sum)
| p03292 |
a = list(map(int,input().split()))
ti = min(a)
da = max(a)
print((da-ti)) | a = list(map(int,input().split()))
ti = min(a)
da = max(a)
print((int(da-ti))) | p03292 |
A, B, C = sorted(map(int,input().split()))
print((abs(B-C)+abs(A-B))) | A, B, C = sorted(map(int,input().split()))
print((abs(C - B) + abs(B - A))) | p03292 |
a, b, c = sorted(map(int,input().split()))
print((b-a+c-b)) | A, B, C = sorted(map(int,input().split()))
print((C-B+B-A)) | p03292 |
a=list(map(int,input().split()))
a.sort()
ans=0 if len(set(a))==1 else a[2]-a[0]
print(ans) | a = [int(x) for x in input().split()]
print((max(a) - min(a))) | p03292 |
a, b, c = sorted(map(int, input().split()))
print((c - a))
| a, b, c = list(map(int, input().split()))
print((max(a, b, c) - min(a, b, c))) | p03292 |
l=sorted(list(map(int,input().split())))
print((l[2]-l[0])) | l=sorted(list(map(int,input().split())))
print((max(l)-min(l))) | p03292 |
A=list(map(int,input().split()))
A.sort()
print((A[2]-A[0]))
| A=list(map(int,input().split()))
print((max(A)-min(A))) | p03292 |
n=10000000
p=[1]*(n+1)
p[0],p[1]=0,0
for i in range(2,int(n**0.5)+1):
if p[i]:
for j in range(i*i,n+1,i):
p[j]=0
#p=[i for i in range(n+1) if p[i]==1]
while 1:
n=int(eval(input()))
if n==0: break
for i in range(n,2,-1):
if (p[i],p[i-2],p[i-6],p[i-8])==(1,1... | n=10000000
p=[1]*(n+1)
p[0],p[1]=0,0
for i in range(2,int(n**0.5)+1):
if p[i]:
for j in range(i*i,n+1,i):
p[j]=0
#p=[i for i in range(n+1) if p[i]==1]
while 1:
n=int(eval(input()))
if n==0: break
if n<19:print((13))
else:
for i in range((n+1)//10*10-1... | p00222 |
primes = [0, 0] + [1] * 9999999
for i in range(2, 3163):
if primes[i]:
for j in range(i*i, 10000001, i):
primes[j] = 0
while True:
n = int(eval(input()))
if n == 0:
break
while not (primes[n-8] & primes[n-6] & primes[n-2] & primes[n]):
n -= 1
print(n) | primes = [0, 0] + [1] * 9999999
for i in range(2, 3163):
if primes[i]:
for j in range(i*i, 10000001, i):
primes[j] = 0
while True:
n = int(eval(input()))
if n == 0:
break
for i in range(5, n+1)[::-1]:
if primes[i-8] & primes[i-6] & primes[i-2] & primes[i]:... | p00222 |
def isP(n):
for i in prime:
if i >= n:
break
if n%i == 0:
return False
return True
r = int(10000001**0.5)
s = int(r**0.5)
p = [1]*r
p[0] = p[1] = 0
for i in range(2,s):
if p[i]:
p[2*i::i] = [0 for x in range(2*i,r,i)]
prime = []
for i in range(r):
if p[i]:
prime.append(i)
while... | def isP(n):
for i in prime:
if i >= n:
break
if n%i == 0:
return False
return True
r = int(10000001**0.5)
s = int(r**0.5)
p = [1]*r
p[0] = p[1] = 0
for i in range(2,s):
if p[i]:
p[2*i::i] = [0 for x in range(2*i,r,i)]
prime = []
for i in range(r):
if p[i]:
prime.append(i)
while 1... | p00222 |
def isP(n):
for i in prime:
if i >= n:
break
if n%i == 0:
return False
return True
r = int(10000001**0.5)
s = int(r**0.5)
p = [1]*r
p[0] = p[1] = 0
for i in range(2,s):
if p[i]:
p[2*i::i] = [0 for x in range(2*i,r,i)]
prime = []
for i in range(r):
if p[i]:
prime.append(i)
while 1... | def isP(n):
for i in prime:
if i >= n:
break
if n%i == 0:
return False
return True
r = int(10000001**0.5)
s = int(r**0.5)
p = [1]*r
p[0] = p[1] = 0
for i in range(2,s):
if p[i]:
p[2*i::i] = [0 for x in range(2*i,r,i)]
prime = []
for i in range(r):
if p[i]:
prime.append(i)
while 1... | p00222 |
r =10000001
p = [1]*r
p[0]= p[1] = 0
for i in range(int(r**0.5)):
if p[i]:
p[2*i::i] = [0 for j in range(2*i,r,i)]
while 1:
try:
n = eval(input())
if n == 0: break
n -= 1-n%2
while any(not p[n-i] for i in [0,2,6,8]):
n -= 2
print(n)
except:
pass | r =10000001
p = [1]*r
p[0]= p[1] = 0
for i in range(int(r**0.5)):
if p[i]:
p[2*i::i] = [0 for j in range(2*i,r,i)]
while 1:
try:
n = eval(input())
if n == 0: break
n -= 1-n%2
while any(not p[n-i] for i in [0,2,6,8]):
n -= 2 + (2 + 4*(1-p[n-6]))*(1-p[n-2])
print(n)
except:
pass | p00222 |
r =10000001
p = [1]*r
p[0]= p[1] = 0
for i in range(int(r**0.5)):
if p[i]:
p[2*i::i] = [0 for j in range(2*i,r,i)]
while 1:
try:
n = eval(input())
if n == 0: break
n -= 1-n%2
while any(not p[n-i] for i in [0,2,6,8]):
n -= 2 + (2 + 4*(1-p[n-6]))*(1-p[n-2])
print(n)
except:
pass | ref = [[[10,8],[4,4]],[[10,2],[4,2]]]
r =10000001
p = [1]*r
p[0]= p[1] = 0
for i in range(int(r**0.5)):
if p[i]:
p[2*i::i] = [0 for j in range(2*i,r,i)]
while 1:
try:
n = eval(input())
if n == 0: break
n -= 1-n%2
while any(not p[n-i] for i in [0,2,6,8]):
n -= ref[p[n-2]][p[n-6]][p[n-8]]
... | p00222 |
ref = [[[10,8],[4,4]],[[10,2],[4,2]]]
r =10000001
p = [1]*r
p[0]= p[1] = 0
for i in range(int(r**0.5)):
if p[i]:
p[2*i::i] = [0 for j in range(2*i,r,i)]
while 1:
try:
n = eval(input())
if n == 0: break
n -= 1-n%2
while any(not p[n-i] for i in [0,2,6,8]):
n -= ref[p[n-2]][p[n-6]][p[n-8]]
... | ref = [[[10,8],[4,4]],[[10,2],[4,2]]]
r =10000001
p = [1]*r
p[0]= p[1] = 0
for i in range(int(r**0.5)):
if p[i]:
p[2*i::i] = [0]*len(p[2*i::i])
while 1:
try:
n = eval(input())
if n == 0: break
n -= 1-n%2
while any(not p[n-i] for i in [0,2,6,8]):
n -= ref[p[n-2]][p[n-6]][p[n-8]]
print(... | p00222 |
import sys
import random
sys.setrecursionlimit(10**6)
input = sys.stdin.readline
INF = 10**6
class RMQ:
def __init__(self, a):
self.n = len(a)
self.size = 2**(self.n - 1).bit_length()
self.data = [(INF, INF) for _ in range(2*self.size-1)]
self.initialize(a)
# ... | import sys
import random
sys.setrecursionlimit(10**6)
input = sys.stdin.readline
INF = 10**6
class RMQ:
def __init__(self, a):
self.n = len(a)
self.size = 2**(self.n - 1).bit_length()
self.data = [(INF, INF) for _ in range(2*self.size-1)]
self.initialize(a)
# ... | p02986 |
import sys
import random
sys.setrecursionlimit(10**6)
input = sys.stdin.readline
INF = 10**6
class RMQ:
def __init__(self, a):
self.n = len(a)
self.size = 2**(self.n - 1).bit_length()
self.data = [(INF, INF) for _ in range(2*self.size-1)]
self.initialize(a)
# ... | import sys
sys.setrecursionlimit(10**6)
input = sys.stdin.readline
INF = 10**6
class RMQ:
def __init__(self, a):
self.n = len(a)
self.size = 2**(self.n - 1).bit_length()
self.data = [(INF, INF) for _ in range(2*self.size-1)]
self.initialize(a)
# Initialize data... | p02986 |
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import defaultdict
N,Q = list(map(int,input().split()))
graph = [[] for _ in range(N+1)]
for _ in range(N-1):
a,b,c,d = list(map(int,input().split()))
graph[a].append((b,c,d))
graph[b].append((a,c,d))
query = [[i... | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import defaultdict
N,Q = list(map(int,input().split()))
graph = [[] for _ in range(N+1)]
for _ in range(N-1):
a,b,c,d = list(map(int,input().split()))
graph[a].append((b,c,d))
graph[b].append((a,c,d))
query = [[i... | p02986 |
import sys
from bisect import bisect
sys.setrecursionlimit(10**6)
def input():
return sys.stdin.buffer.readline()[:-1]
class LCA():
def __init__(self, adj_given, root_given):
self.adj = adj = adj_given
self.root = root_given
self.n = n = len(adj)
self.maxlog = 0
while (1 << self.maxlog) < n:
... | import sys
from bisect import bisect
sys.setrecursionlimit(10**6)
def input():
return sys.stdin.buffer.readline()[:-1]
class LCA():
def __init__(self, adj_given, root_given):
self.adj = adj = adj_given
self.root = root_given
self.n = n = len(adj)
self.maxlog = 0
while (1 << self.maxlog) < n:
... | p02986 |
import sys
from bisect import bisect
sys.setrecursionlimit(10**6)
def input():
return sys.stdin.buffer.readline()[:-1]
class LCA():
def __init__(self, adj_given, root_given):
self.adj = adj = adj_given
self.root = root_given
self.n = n = len(adj)
self.maxlog = 0
while (1 << self.maxlog) < n:
... | import sys
from bisect import bisect
sys.setrecursionlimit(10**6)
def input():
return sys.stdin.buffer.readline()[:-1]
class LCA():
def __init__(self, adj_given, root_given):
self.adj = adj = adj_given
self.root = root_given
self.n = n = len(adj)
self.maxlog = 0
while (1 << self.maxlog) < n:
... | p02986 |
import sys
from collections import defaultdict
sys.setrecursionlimit(10 ** 5 + 5)
def solve(n, links, queries):
def _query(a, b, data, m0, INF):
yield INF
a += m0
b += m0
while a < b:
if b & 1:
b -= 1
yield data[b - 1]
... | import sys
from collections import defaultdict
sys.setrecursionlimit(10 ** 5 + 5)
def solve(n, links, queries):
def _query(a, b, data, m0, INF):
yield INF
a += m0
b += m0
while a < b:
if b & 1:
b -= 1
yield data[b - 1]
... | p02986 |
from collections import defaultdict
from math import log2
import sys
sys.setrecursionlimit(10**6)
def f(n,q):
def dfs(i, oi=-1, dpt=0):
depth[i] = dpt
parent_2k[0][i] = oi
for ki, c, d in to[i]:
if ki == oi: continue
dfs(ki, i, dpt + 1)
return
... | from collections import defaultdict
from math import log2
import sys
sys.setrecursionlimit(10**6)
input=sys.stdin.readline
def f(n,q):
def dfs(i, oi=-1, dpt=0):
depth[i] = dpt
parent_2k[0][i] = oi
for ki, c, d in to[i]:
if ki == oi: continue
dfs(ki, i, dp... | p02986 |
import sys
sys.setrecursionlimit(10**5+5)
from collections import defaultdict,deque
input = sys.stdin.readline
def bfs():
q = deque([1])
while q:
now = q.popleft()
for nex,c,w in e[now]:
if depth[nex]>= 0:
continue
depth[nex] = depth[now]+1
... | import sys
sys.setrecursionlimit(10**5+5)
from collections import defaultdict,deque
input = sys.stdin.readline
class LCA:
def __init__(self,n):
self.size = n+1
self.bitlen = n.bit_length()
self.lca = [[0]*self.size for i in range(self.bitlen)]
self.depth = [-1]*self.size
... | p02986 |
import sys
sys.setrecursionlimit(10**6+1) #再帰関数の上限,10**5以上の場合python
def input():
x=sys.stdin.readline()
return x[:-1] if x[-1]=="\n" else x
def printe(*x):print("## ",*x,file=sys.stderr)
def printl(li): _=print(*li, sep="\n") if li else None
#N, Q = map(int, input().split())
N, Q = map(int, inp... | import sys
sys.setrecursionlimit(10**6+1) #再帰関数の上限,10**5以上の場合python
def input():
x=sys.stdin.readline()
return x[:-1] if x[-1]=="\n" else x
def printe(*x):print("## ",*x,file=sys.stderr)
def printl(li): _=print(*li, sep="\n") if li else None
#N, Q = map(int, input().split())
N, Q = map(int, inp... | p02986 |
import sys
input=sys.stdin.readline
sys.setrecursionlimit(10**7)
N,Q=list(map(int,input().split()))
edge=[[] for i in range(N)]
for i in range(N-1):
a,b,c,d=list(map(int,input().split()))
edge[a-1].append((b-1,c,d))
edge[b-1].append((a-1,c,d))
prv=[-1]*N
depth=[0]*N
def dfs(v,pv):
prv[... | import sys
input=sys.stdin.readline
sys.setrecursionlimit(10**7)
N,Q=list(map(int,input().split()))
edge=[[] for i in range(N)]
for i in range(N-1):
a,b,c,d=list(map(int,input().split()))
edge[a-1].append((b-1,c,d))
edge[b-1].append((a-1,c,d))
prv=[-1]*N
depth=[0]*N
dist=[0 for i in range(N... | p02986 |
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
n,q = list(map(int,readline().split()))
data = list(map(int,read().split()))
abcd = data[:4*(n-1)]
xyuv = data[4*(n-1):]
root = 1
dbl_max = 20
dbl = [[0] * dbl_max for _ in range(n+1)]
de... | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
n,q = list(map(int,readline().split()))
data = list(map(int,read().split()))
abcd = data[:4*(n-1)]
xyuv = data[4*(n-1):]
root = 1
dbl_max = 20
dbl = [[0] * dbl_max for _ in range(n+1)]
dept... | p02986 |
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import math
import bisect
import random
from itertools import permutations, accumulate, combinations, product
import sys
from pprint import pprint
from copy import deepcopy
import string
from bisect import bisect_... | from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import math
import bisect
import random
from itertools import permutations, accumulate, combinations, product
import sys
from pprint import pprint
from copy import deepcopy
import string
from bisect import bisect_... | p02986 |
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import math
import bisect
import random
from itertools import permutations, accumulate, combinations, product
import sys
from pprint import pprint
from copy import deepcopy
import string
from bisect import bisect_... | from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import math
import bisect
import random
from itertools import permutations, accumulate, combinations, product
import sys
from pprint import pprint
from copy import deepcopy
import string
from bisect import bisect_... | p02986 |
import math
N, Q = list(map(int, input().split()))
edge = [[] for i in range(N+1)]
for i in range(N-1):
a, b, c, d = list(map(int, input().split()))
edge[a].append((b, c, d))
edge[b].append((a, c, d))
depth = [0] * (N+1)
dist_sum = [0] * (N+1)
parent = list(range(N+1))
U = 17
do... | import sys
sys.setrecursionlimit(10**7)
N, Q = list(map(int, input().split()))
edge = [[] for _ in range(N+1)]
for _ in range(N-1):
a, b, c, d = list(map(int, input().split()))
edge[a].append((b, c, d))
edge[b].append((a, c, d))
depth = [0] * (N+1)
U = 17
ancestor = [[0] * ... | p02986 |
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**8)
class Tree():
def __init__(self, n, graph, v_root):
self.n = n # number of nodes
self.graph = graph # adjacent list of graph
self.v_root = v_root # root node
self.logn = (self.n - 1).bit_length()
... | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**8)
class Tree():
def __init__(self, n, graph, v_root):
self.n = n # number of nodes
self.graph = graph # adjacent list of graph
self.v_root = v_root # root node
self.logn = (self.n - 1).bit_length()
... | p02986 |
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**8)
class Tree():
def __init__(self, n, graph, v_root):
self.n = n # number of nodes
self.graph = graph # adjacent list of graph
self.v_root = v_root # root node
self.logn = (self.n - 1).bit_length()
... | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**8)
class Tree():
def __init__(self, n, graph, v_root):
self.n = n # number of nodes
self.graph = graph # adjacent list of graph
self.v_root = v_root # root node
self.logn = (self.n - 1).bit_length()
... | p02986 |
import sys,bisect,string,math,time,functools,random
from heapq import heappush,heappop,heapify
from collections import deque,defaultdict,Counter
from itertools import permutations,combinations,groupby
def Golf():*a,=map(int,open(0))
def I():return int(input())
def S_():return input()
def IS():return input().spli... | import sys,bisect,string,math,time,functools,random
from heapq import heappush,heappop,heapify
from collections import deque,defaultdict,Counter
from itertools import permutations,combinations,groupby
def Golf():*a,=map(int,open(0))
def I():return int(input())
def S_():return input()
def IS():return input().spli... | p02986 |
import sys,bisect,string,math,time,functools,random
from heapq import heappush,heappop,heapify
from collections import deque,defaultdict,Counter
from itertools import permutations,combinations,groupby
def Golf():*a,=map(int,open(0))
def I():return int(input())
def S_():return input()
def IS():return input().spli... | import sys,bisect,string,math,time,functools,random
from heapq import heappush,heappop,heapify
from collections import deque,defaultdict,Counter
from itertools import permutations,combinations,groupby
def Golf():*a,=map(int,open(0))
def I():return int(input())
def S_():return input()
def IS():return input().spli... | p02986 |
import sys,bisect,string,math,time,functools,random
from heapq import heappush,heappop,heapify
from collections import deque,defaultdict,Counter
from itertools import permutations,combinations,groupby
def Golf():*a,=map(int,open(0))
def I():return int(input())
def S_():return input()
def IS():return input().spli... | import sys,bisect,string,math,time,functools,random
from heapq import heappush,heappop,heapify
from collections import deque,defaultdict,Counter
from itertools import permutations,combinations,groupby
def Golf():*a,=map(int,open(0))
def I():return int(input())
def S_():return input()
def IS():return input().spli... | p02986 |
import sys,bisect,string,math,time,functools,random
from heapq import heappush,heappop,heapify
from collections import deque,defaultdict,Counter
from itertools import permutations,combinations,groupby
def Golf():*a,=map(int,open(0))
def I():return int(input())
def S_():return input()
def IS():return input().spli... | import sys,bisect
from collections import deque
def I():return int(eval(input()))
def LI():return [int(i) for i in input().split()]
def LI_():return [int(i)-1 for i in input().split()]
def GI(V,E,ls=None,Directed=False,index=1):
org_inp=[];g=[[] for i in range(V)]
FromStdin=True if ls==None else False
... | p02986 |
# verified: ABC014-D
# calculate LCA O(logN) for each query
# kprev[k][i]: 2^k parent of node i
# if there is no node returns "None"
# Depth[i]: Depth of node i from rootNode
class Doubling():
def __init__(self, graph, rootNode=0):
self.graph = graph
self.N = len(graph)
self.Lo... | # verified: ABC014-D
# calculate LCA O(logN) for each query
# kprev[k][i]: 2^k parent of node i
# if there is no node returns "None"
# Depth[i]: Depth of node i from rootNode
class Doubling():
def __init__(self, graph, rootNode=0):
self.graph = graph
self.N = len(graph)
self.Lo... | p02986 |
# verified: ABC014-D
# calculate LCA O(logN) for each query
# kprev[k][i]: 2^k parent of node i
# if there is no node returns "None"
# Depth[i]: Depth of node i from rootNode
class Doubling():
def __init__(self, graph, Depth, prev, rootNode=0):
self.graph = graph
self.N = len(graph)
... | # verified: ABC014-D
# calculate LCA O(logN) for each query
# kprev[k][i]: 2^k parent of node i
# if there is no node returns "None"
# Depth[i]: Depth of node i from rootNode
class Doubling():
def __init__(self, graph, Depth, prev, rootNode=0):
self.graph = graph
self.N = len(graph)
... | p02986 |
import sys
input = sys.stdin.readline
N,Q=list(map(int,input().split()))
EDGE=[list(map(int,input().split())) for i in range(N-1)]
Query=[list(map(int,input().split())) for i in range(Q)]
mod=10**9+7
EDGELIST=[dict() for i in range(N+1)]
for x,y,c,l in EDGE:
EDGELIST[x][y]=(c,l)
EDGELIST[y][x]=(c,l... | import sys
input = sys.stdin.readline
N,Q=list(map(int,input().split()))
EDGE=[list(map(int,input().split())) for i in range(N-1)]
Query=[list(map(int,input().split())) for i in range(Q)]
mod=10**9+7
EDGELIST=[dict() for i in range(N+1)]
for x,y,c,l in EDGE:
EDGELIST[x][y]=(c,l)
EDGELIST[y][x]=(c,l... | p02986 |
import sys
sys.setrecursionlimit(10**7)
n,q=list(map(int,input().split()))
abcd=[list(map(int,input().split())) for _ in range(n-1)]
xyuv=[list(map(int,input().split())) for _ in range(q)]
g=[[] for _ in range(n)]
for a,b,c,d in abcd:
a,b=a-1,b-1
g[a].append((b,c,d))
g[b].append((a,c,d))
# LCAを求める。自作す... | import sys
sys.setrecursionlimit(10**7)
n,q=list(map(int,input().split()))
abcd=[list(map(int,input().split())) for _ in range(n-1)]
xyuv=[list(map(int,input().split())) for _ in range(q)]
g=[[] for _ in range(n)]
for a,b,c,d in abcd:
a,b=a-1,b-1
g[a].append((b,c,d))
g[b].append((a,c,d))
# LCAを求める。自作す... | p02986 |
import sys
sys.setrecursionlimit(10**7)
n,q=list(map(int,input().split()))
abcd=[list(map(int,input().split())) for _ in range(n-1)]
xyuv=[list(map(int,input().split())) for _ in range(q)]
g=[[] for _ in range(n)]
for a,b,c,d in abcd:
a,b=a-1,b-1
g[a].append((b,c,d))
g[b].append((a,c,d))
# LCAを求める。自作す... | import sys
sys.setrecursionlimit(10**7)
def main0(n,g,xyuv):
# LCAを求める。自作する。
# 各頂点の深さ。根は深さ0
depth=[0]*n
tour=[]
hatsu=[0]*n
dist=[0]*n
tmp=0
def et(p,v,tour,tmp,pc,pd):
hatsu[v]=len(tour)-1
for nv,c,d in g[v]:
if nv==p:continue
depth[nv]=depth[v]+1
tmp+=d
... | p02986 |
import sys
input=sys.stdin.readline
sys.setrecursionlimit(10**9)
class LCA:
def __init__(self,V,edges,root=0):
self.edges=edges
self.maxLog=18
self.parent=[[-1]*V for _ in range(self.maxLog+1)]
self.depth=[0]*V
self.__dfs(-1,root,0)
for i in range(self.maxLo... | import sys
input=sys.stdin.readline
sys.setrecursionlimit(10**9)
class LCA:
def __init__(self,V,edges,depth,parent,root=0):
self.edges=edges
self.maxLog=18
self.parent=[[-1]*V for _ in range(self.maxLog+1)]
self.parent[0]=parent
self.depth=depth
for i in ran... | p02986 |
import sys
sys.setrecursionlimit(1000000)
from bisect import bisect_right as br
N, K = list(map(int, input().split()))
X = [[] for i in range(N)]
for i in range(N-1):
x, y, c, d = list(map(int, input().split()))
X[x-1].append((y-1, c-1, d))
X[y-1].append((x-1, c-1, d))
P = [(-1, 0, 0)] * N
Q =... | import sys
sys.setrecursionlimit(1000000)
input = sys.stdin.readline
from bisect import bisect_right as br
N, K = list(map(int, input().split()))
X = [[] for i in range(N)]
for i in range(N-1):
x, y, c, d = list(map(int, input().split()))
X[x-1].append((y-1, c-1, d))
X[y-1].append((x-1, c-1, d))
... | p02986 |
from collections import deque
N, Q = list(map(int, input().split()))
adj = [[] for _ in range(N+1)]
for i in range(N-1):
a, b, c, d = list(map(int, input().split()))
adj[a].append([b, c, d])
adj[b].append([a, c, d])
queue = deque()
queue.append(1)
height = [0] * (N+1)
height[1] = 1
cdp = [0] ... | def main():
import sys
from bisect import bisect_left
input = sys.stdin.buffer.readline
# クエリは0-indexedで[l, r)
class SparseTable():
def __init__(self, A):
# A: 処理したい数列
self.N = len(A)
self.K = self.N.bit_length() - 1
self.table = [[... | p02986 |
import sys
from collections import defaultdict
sys.setrecursionlimit(10**7)
readline = sys.stdin.readline
N, Q = list(map(int, readline().split()))
S = [0]*(2*N)
F = [0]*N
depth = [0]*N
depthh = [0]*N
mmn = [[0] for _ in range(N)]
msn = [[0] for _ in range(N)]
iin = [[] for _ in range(N)]
w2i = [0]*(2*N)... | import sys
from collections import defaultdict
readline = sys.stdin.readline
N, Q = list(map(int, readline().split()))
def process():
INF = (N, None)
M = 2*N
M0 = 2**(M-1).bit_length()
data = [INF]*(2*M0)
lnc = [0]*N
G = [[] for _ in range(N)]
dp = {}
for v in range(N-... | p02986 |
import sys
from collections import defaultdict
readline = sys.stdin.readline
N, Q = list(map(int, readline().split()))
class SegTree:
def __init__(self, init_val, n, ide_ele, seg_func):
self.segfunc = seg_func
self.num = 2**(n-1).bit_length()
self.ide_ele = ide_ele
self.se... | import sys
from collections import defaultdict
readline = sys.stdin.readline
N, Q = list(map(int, readline().split()))
class SegTree:
def __init__(self, init_val, n, ide_ele, seg_func):
self.segfunc = seg_func
self.num = 2**(n-1).bit_length()
self.ide_ele = ide_ele
self.se... | p02986 |
# ABC133 オイラーツアー
import sys
from collections import defaultdict
readline = sys.stdin.readline
N, Q = list(map(int, readline().split()))
vs = set()
def dfs_w(v, d):
S, F, depth, depthh = [], [None]+[0]*N, [-1] + [0]*N, [0] + [0]*N
iin = [[(0, 0, 0)] for _ in range(N)]
pvs, stack, path = set(),... | # ABC133 オイラーツアー
import sys
from collections import defaultdict
readline = sys.stdin.readline
N, Q = list(map(int, readline().split()))
vs = set()
def dfs_w(v, d):
S, F, depth, depthh = [], [None]+[0]*N, [-1] + [0]*N, [0] + [0]*N
iin = [[(0, 0, 0)] for _ in range(N)]
stack, path = [(1, 0, 0)]... | p02986 |
# ABC133 オイラーツアー
import sys
from collections import defaultdict
readline = sys.stdin.readline
N, Q = list(map(int, readline().split()))
def dfs_w(v, d):
vs = set([1])
S, F, depth, depthh = [], [None]+[0]*N, [-1] + [0]*N, [0] + [0]*N
iin = [[(0, 0, 0)] for _ in range(N)]
stack, path = [(1, 0... | # ABC133 オイラーツアー
import sys
from collections import defaultdict
readline = sys.stdin.readline
N, Q = list(map(int, readline().split()))
def dfs_w(v, d):
vs = set([1])
S, F, depth, depthh = [], [None]+[0]*N, [-1] + [0]*N, [0] + [0]*N
iin = [[(0, 0, 0)] for _ in range(N)]
stack, path = [(1, 0... | p02986 |
import sys
input=sys.stdin.readline
# 整数 n を m 進数 k 桁で表現した文字列
# ex. bins(3,2,2) => 11
def bins(n, m, k):
# n がマイナスだったり、k桁で収まらない場合やばそう
s = ""
while n > 0:
s = str(n%m) + s
n //= m
s = "0"*(k-len(s)) + s
return s
def main():
s = input().strip()
n = len(s)-1 # ... | import sys
input=sys.stdin.readline
def main():
s = input().strip()
n = len(s)-1
ans = 0
for i in range(1<<n):
t = s[0]
for j in range(n):
if ((i >> j) & 1) == 1:
t += "+"
t += s[j+1]
ans += eval(t)
print(ans)
if __nam... | p03999 |
import sys
from itertools import combinations
s = list(sys.stdin.readline().rstrip())
l = len(s)
def main():
res = 0
cand = list(range(1, l))
for inser_cnt in range(l):
for idces in combinations(cand, inser_cnt):
t = s.copy()
idces = list(idces)
for... | import sys
s = sys.stdin.readline().rstrip()
n = len(s)
def c(n):
return pow(2, max(0, n - 1))
def main():
res = 0
for l in range(n):
for r in range(l, n):
res += int(s[l:r+1]) * c(l) * c(n - 1 - r)
print(res)
if __name__ == '__main__':
main() | p03999 |
import sys
def debug(x, table):
for name, val in table.items():
if x is val:
print('DEBUG:{} -> {}'.format(name, val), file=sys.stderr)
return None
def solve():
S = input()
N = len(S) - 1
ans = 0
for i in range(2**N):
bi = bin(i)[2:].zfill(N)
... | import sys
from itertools import accumulate
def debug(x, table):
for name, val in table.items():
if x is val:
print('DEBUG:{} -> {}'.format(name, val), file=sys.stderr)
return None
def solve():
S = [int(i) for i in input()]
N = len(S)
sac = [0] + list(accumu... | p03999 |
S = str(eval(input()))
ans = 0
N = len(S)
for i in range(2**N):
pattern = bin(i)[2:].zfill(N)
formula = ''
for j in range(N):
mark = ''
if pattern[j] == '1' and j < N-1:
mark = '+'
formula += S[j]+mark
ans += eval(formula)
print((ans//2)) | S = str(eval(input()))
ans = 0
N = len(S)
for i in range(2**(N-1)):
pattern = bin(i)[2:].zfill((N-1))
formula = ''
for j in range(N):
mark = ''
if j < N-1:
if pattern[j] == '1':
mark = '+'
formula += S[j]+mark
ans += eval(formula)
print(ans) | p03999 |
S = input().strip()
answer = 0
for n in range(2**(len(S)-1)):
A = [0]
for d in range(9):
if n & (1 << d):
A.append(d+1)
T = []
#print("A", A)
for l, r in zip(A, A[1:]):
T.append(int("".join(S[l:r])))
T.append(int("".join(S[A[-1]:])))
answer += sum(... | from itertools import combinations
S = input().strip()
N = len(S)
answer = int(S)
for c in range(1,N):
for t in combinations(list(range(1,N)), c):
i = 0
for j in t:
answer += int(S[i:j])
i = j
j = N
answer += int(S[i:j])
print(answer)
| p03999 |
from itertools import combinations, chain
from functools import reduce
def eval_str(string):
s = string.split("+")
return int(reduce(lambda x,y: int(x)+int(y), s))
mystr = input()
allsubsets = lambda n: list(chain(*[combinations(list(range(1,n)), ni) for ni in range(n+1)]))
l = allsubsets(len(mystr))
... | def eval(d,mask):
s = ''
for i in range(len(mask)):
s += d[i]
if mask[i] == '1':
s += '+'
s += d[-1]
l = s.split('+')
res = sum(map(int,l))
return res
d = list(input())
tot = 0
for i in range(2**(len(d)-1)):
mask = bin(2**(len(d)-1)+i)[3:]
tot ... | p03999 |
import sys
sys.setrecursionlimit(10 ** 5 + 10)
def input(): return sys.stdin.readline().strip()
def resolve():
S = str(eval(input()))
ls=len(S)
# bit全探索
# https://qiita.com/gogotealove/items/11f9e83218926211083a#%E4%BE%8B%E9%A1%8C-1
n = ls-1
# 昇順での探索だよ
val = 0
for i in... | import sys
sys.setrecursionlimit(10 ** 5 + 10)
def input(): return sys.stdin.readline().strip()
def resolve():
def main():
S=str(eval(input()))
# bit全探索
# https://qiita.com/gogotealove/items/11f9e83218926211083a#%E4%BE%8B%E9%A1%8C-1
n = len(S)-1
if n==0:
... | p03999 |
while 1:
n=int(eval(input()))
if n==0:break
a=1;s='123456'
for _ in[0]*n:
s=[s[int(e)]for e in{'N':"152304",'E':"310542",'W':"215043",'S':"402351",'R':"024135",'L':"031425"}[input()[0]]]
a+=int(s[0])
print(a)
| import sys
d=sys.stdin
while 1:
n=int(d.readline())
if n==0:break
a=1;s='123456'
for _ in[0]*n:
s=[s[int(e)]for e in{'N':"152304",'E':"310542",'W':"215043",'S':"402351",'R':"024135",'L':"031425"}[d.readline()[0]]]
a+=int(s[0])
print(a)
| p00425 |
import sys
d=sys.stdin.readline
p={'N':(1,5,2,3,0,4),'E':(3,1,0,5,4,2),'W':(2,1,5,0,4,3),
'S':(4,0,2,3,5,1),'R':(0,2,4,1,3,5),'L':(0,3,1,4,2,5)}
while 1:
n=int(d())
if n==0:break
a=1;s='123456'
for _ in[0]*n:
s=[s[e]for e in p[d()[0]]]
a+=int(s[0])
print(a)
| import sys
d=sys.stdin.readline
p={'N':(1,5,2,3,0,4),'E':(3,1,0,5,4,2),'W':(2,1,5,0,4,3),
'S':(4,0,2,3,5,1),'R':(0,2,4,1,3,5),'L':(0,3,1,4,2,5)}
while 1:
n=int(d())
if n==0:break
a=[1];s='123456'
for _ in[0]*n:
s=[s[e]for e in p[d()[0]]]
a+=[s[0]]
print((sum(map(int,a))))
| p00425 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.