code1
stringlengths 17
427k
| code2
stringlengths 17
427k
| similar
int64 0
1
| pair_id
int64 2
181,637B
⌀ | question_pair_id
float64 3.7M
180,677B
⌀ | code1_group
int64 1
299
| code2_group
int64 1
299
|
|---|---|---|---|---|---|---|
from collections import Counter as C
n=int(input())
S=list(input())
a=1
L=C(S).most_common(3)
for l in L:
a*=l[1]
for i in range(1,n):
for j in range(n-2*i):
if len(set((S[j],S[j+i],S[j+2*i])))==3:
a-=1
print(a if len(L)>2 else 0) | import math
n, k = map(int, input().split())
print(int(math.floor(math.log(n, k) + 1))) | 0 | null | 50,105,801,413,370 | 175 | 212 |
# coding: utf-8
import sys
#from operator import itemgetter
sysread = sys.stdin.readline
#from heapq import heappop, heappush
#from collections import defaultdict
sys.setrecursionlimit(10**7)
import math
#from itertools import combinations
def run():
n,k = map(int, input().split())
mod = 10 ** 9 + 7
ret = 0
inv = generate_inv(n, mod)
if k >= n-1:
k = n-1
left = 1
right = 1
ret = 1
for h in range(1, k+1):
right *= (n - h) * inv[h]
right %= mod
left *= (n - h + 1) * inv[h]
left %= mod
ret += right * left
ret %= mod
print(ret)
def generate_inv(n,mod):
"""
逆元行列
n >= 2
"""
ret = [0, 1]
for i in range(2,n+1):
next = -ret[mod%i] * (mod // i)
next %= mod
ret.append(next)
return ret
def comb_mod(n, a, mod):
"""
return: [n, a] % mod
Note: mod must be a prime number
"""
up = 1
down = 1
for i in range(a):
up *= n - i
up %= mod
down *= i + 1
down %= mod
down = pow_mod(down, mod - 2, mod)
return (up * down) % mod
def pow_mod(n, k, mod):
res = 1
while True:
if k // 2 >= 1:
if k % 2 == 1:
res = (res * n) % mod
n = (n ** 2) % mod
k = k // 2
else:
break
return (n * res) % mod
if __name__ == "__main__":
run() | N,K=map(int, input().split())
def cmb(n, r, p):
if (r < 0) or (n < r):
return 0
r = min(r, n - r)
return fact[n] * factinv[r] * factinv[n-r] % p
p = 10 ** 9 + 7
n= 2*10 ** 5 # N は必要分だけ用意する
fact = [1, 1] # fact[n] = (n! mod p) 階乗のmod
factinv = [1, 1] # factinv[n] = ((n!)^(-1) mod p)
inv = [0, 1] # factinv 計算用
for i in range(2, n + 1):
fact.append((fact[-1] * i) % p)
inv.append((-inv[p % i] * (p // i)) % p)
factinv.append((factinv[-1] * inv[-1]) % p)
#0の数
zeros=min(K, N-1)
ans=1
for i in range(1,zeros+1):
ans+=(cmb(N,i,p)*cmb(i+N-i-1, i, p))%p
#print(pow(N-i, i, p))
ans%=p
print(ans) | 1 | 67,215,490,026,870 | null | 215 | 215 |
N, K = map(int, input().split())
A = list(map(int, input().split()))
l = 0
r = l + K
while r < N:
ans = 'Yes' if A[l] < A[r] else 'No'
print(ans)
l += 1
r += 1
| x = int(input())
xSum = 0
cnt = 1
while True:
xSum += x
if xSum%360 == 0:
break
cnt += 1
print(cnt) | 0 | null | 10,138,270,624,006 | 102 | 125 |
x, n = map(int, input().split())
p = list(map(int, input().split()))
n = list(i for i in range(-1, 110) if i not in p)
diff = 110
ans = 0
for i in n:
if diff > abs(x-i):
diff = abs(x-i)
ans = i
print(ans) | import numpy as np
r=int(input())
print(np.pi*2.0*r) | 0 | null | 22,838,840,014,858 | 128 | 167 |
from bisect import bisect_right
def bisectsearch_right(L,a):
i=bisect_right(L,a)
return(i)
N,M,K= list(map(int, input().split()))
A= list(map(int, input().split()))
B= list(map(int, input().split()))
Asum=[0]*N
Bsum=[0]*M
Asum[0]=A[0]
Bsum[0]=B[0]
for i in range(1,N):
Asum[i]=Asum[i-1]+A[i]
for j in range(1,M):
Bsum[j]=Bsum[j-1]+B[j]
# print(Asum)
# print(Bsum)
ans=[0]*(N+1)
ans[0]=bisectsearch_right(Bsum,K)
# print(ans[0])
for i in range(1,N+1):
if Asum[i-1]>K:
continue
j=bisectsearch_right(Bsum,K-Asum[i-1])
# print(j)
ans[i]=i+j
# print(ans)
print(max(ans))
| import itertools
N,M,K=map(int,input().split())
A=list(map(int,input().split()))
B=list(map(int,input().split()))
A_=[0]+list(itertools.accumulate(A))
B_=[0]+list(itertools.accumulate(B))
ans=0
j=M
for i in range(N+1):
a=A_[i]
K_a=K-a
while (j>=0 and B_[j]>K_a):
j-=1
if a+B_[j]<=K:
ans=max(ans,i+j)
print(ans)
| 1 | 10,738,166,336,380 | null | 117 | 117 |
S = input()
K = int(input())
def func(S):
inner = 0
S = list(S)
for i in range(len(S) - 1):
if S[i] == S[i + 1]:
S[i + 1] = '#'
inner += 1
return inner
if len(set(list(S))) == 1:
print(len(S) * K // 2)
else:
inner = func(S)
inter = func(S * 2) - func(S) * 2
print(inner * K + inter * (K - 1)) | def cal(S):
tmp, a, cnt = S[0], 1, 0
flag = True
for s in S[1:]:
if S[0]!=s: flag=False
if flag: a+=1
if tmp[-1]==s:
s = '*'
cnt += 1
tmp += s
return a, cnt
S = input().replace('\n', '')
k = int(input())
ans = 0
if len(list(set(S)))==1:
ans = len(S)*k//2
else:
a, cnt = cal(S)
b, _ = cal(S[::-1])
ans = cnt*k
if S[0]==S[-1]:
ans -= ((a//2)+(b//2)-((a+b)//2))*(k-1)
print(ans) | 1 | 174,956,311,965,302 | null | 296 | 296 |
#abc149-d
n,k=map(int,input().split())
s,p,r=map(int,input().split())
f={'s':s,'p':p,'r':r}
t=str(input())
ans=0
for i in range(k):
a=i+k
last=t[i]
ans+=f[last]
while a<n-k:
if t[a]==last:
if t[a+k]==last:
if last=='s':
last='r'
else:
last='s'
else:
if last=='s':
if t[a+k]=='r':
last='p'
else:
last='r'
elif last=='r':
if t[a+k]=='s':
last='p'
else:
last='s'
else:
if t[a+k]=='r':
last='s'
else:
last='r'
else:
last=t[a]
ans+=f[last]
a+=k
if a<n:
if t[a]!=last:
ans+=f[t[a]]
print(ans) | # coding=UTF-8
from collections import deque
from operator import itemgetter
from bisect import bisect_left, bisect
import itertools
import sys
import math
import numpy as np
import time
sys.setrecursionlimit(10**6)
input = sys.stdin.readline
def main():
n, k = map(int, input().split())
r, s, p = map(int, input().split())
t = input()
myhand = [None] * n
point = 0
for i in range(n):
if t[i] == "r":
if myhand[i] != "np":
point += p
if i+k < n:
myhand[i+k] = "np"
else:
if i+k < n:
myhand[i + k] = None
elif t[i] == "s":
if myhand[i] != "nr":
point += r
if i+k < n:
myhand[i+k] = "nr"
else:
if i+k < n:
myhand[i + k] = None
elif t[i] == "p":
if myhand[i] != "ns":
point += s
if i+k < n:
myhand[i+k] = "ns"
else:
if i+k < n:
myhand[i + k] = None
print(point)
if __name__ == '__main__':
main()
| 1 | 107,237,798,131,290 | null | 251 | 251 |
import sys
input = sys.stdin.readline
# sys.setrecursionlimit(100000)
def main():
n, m = [int(i) for i in input().strip().split()]
accepted = [False] * (n + 1)
WA_cnt = [0] * (n + 1)
for _ in range(m):
p, s = input().strip().split()
p = int(p)
if accepted[p]:
continue
else:
if s == "AC":
accepted[p] = True
elif s == "WA":
WA_cnt[p] += 1
ac = 0
wa = 0
for res, cnt in zip(accepted, WA_cnt):
if res:
ac += 1
wa += cnt
print(ac, wa)
return
if __name__ == "__main__":
main()
| from collections import defaultdict as dic
n, m = map(int, input().split())
ac = 0
pena = 0
d = dic(list)
for i in range(m):
pi, si = input().split()
d[pi].append(si)
for (k, v) in d.items():
pe = 0
flag = False
for aw in v:
if aw == 'WA':
pe += 1
else:
ac += 1
flag = True
break
if flag:
pena += pe
print(ac, pena)
| 1 | 93,534,239,092,368 | null | 240 | 240 |
import copy
N = int(input())
A = input().split()
B = copy.copy(A)
boo = 1
while boo:
boo = 0
for i in range(N-1):
if A[i][1] > A[i+1][1]:
A[i], A[i+1] = A[i+1], A[i]
boo = 1
print(*A)
print("Stable")
for i in range(N):
mi = i
for j in range(i,N):
if B[mi][1] > B[j][1]:
mi = j
B[i], B[mi] = B[mi], B[i]
if A==B:
print(*B)
print("Stable")
else:
print(*B)
print("Not stable")
| H,W,N = map(int, open(0).read().split())
ans = 0
while N > 0:
A = max(H, W)
tmp = N // A
N = N % A
if tmp == 0 and N:
N = 0
ans += 1
break
if H == A:
W -= tmp
else:
H -= tmp
ans += tmp
print(ans) | 0 | null | 44,565,570,959,572 | 16 | 236 |
n = int(input())
dic_A = set()
dic_C = set()
dic_G = set()
dic_T = set()
for i in range(n) :
p, string = input().split()
if p == 'insert' :
if string[0] == 'A' :
dic_A.add(string)
elif string[0] == 'C' :
dic_C.add(string)
elif string[0] == 'G' :
dic_G.add(string)
else :
dic_T.add(string)
else :
if string[0] == 'A' :
if string in dic_A :
print('yes')
else :
print('no')
elif string[0] == 'C' :
if string in dic_C :
print('yes')
else :
print('no')
elif string[0] == 'G' :
if string in dic_G :
print('yes')
else :
print('no')
else :
if string in dic_T :
print('yes')
else :
print('no')
| # -*- coding: utf-8 -*-
def main():
dictionary = {}
input_num = int(raw_input())
counter = 0
while counter < input_num:
command, key = raw_input().split(' ')
if command == 'insert':
dictionary[key] = True
else:
if key in dictionary:
print 'yes'
else:
print 'no'
counter += 1
if __name__ == '__main__':
main() | 1 | 77,071,942,570 | null | 23 | 23 |
n,k=map(int,input().split())
#k以下のn個の数字
ans=[0]*(k+1)
p=10**9+7
result=0
for i in range(k):
num=k-i
ans[num]=pow(k//num,n,p)
j=2
while num*j<=k:
ans[num]-=ans[num*j]
j+=1
result+=((ans[num]*num)%p)
#print(num,ans)
print(result%p) | n, k = map(int, input().split())
g = [1] * k
mod = 10 ** 9 + 7
for i in range(k, 0, -1):
x = k // i
m = n
while m > 0:
if m & 1:
g[i-1] = g[i-1] * x % mod
x = x * x % mod
m >>= 1
y = 2
while i * y <= k:
g[i-1] -= g[i*y-1]
y += 1
ans = 0
for i in range(k):
ans = (ans + g[i] * (i + 1)) % mod
print(ans)
| 1 | 37,008,980,079,200 | null | 176 | 176 |
i=0
while True:
i+=1
a=input()
if a==0:
break
else:
print("Case "+str(i)+": "+str(a)) | i=0
while True:
i+=1
x=raw_input()
if x=='0':
break
print 'Case %d: %s' % (i,x) | 1 | 481,705,908,772 | null | 42 | 42 |
#! /usr/bin/env python
# -*- coding: utf-8 -*-
import sys
def judge(W, H, x, y, r):
if (x - r) >= 0 and (y - r) >= 0 and\
(x + r) <= W and (y + r) <= H:
print "Yes"
else:
print "No"
W, H, x, y, r = map(int, raw_input().split())
if -100 <= x <= 100 and -100 <= y <= 100 and \
0 < W <= 100 and 0 < H <= 100 and 0 < r <= 100:
judge(W, H, x, y, r)
else:
print "error!!"
sys.exit(0) | x = input()
y = x.split(" ")
y = [int(z) for z in y]
w = y[0]
h = y[1]
x = y[2]
r = y[4]
y = y[3]
if (x <= w-r and x >= r) and (y <= h-r and y >= r):
print("Yes")
else:
print("No") | 1 | 452,513,108,348 | null | 41 | 41 |
from collections import deque
N, D, A = map(int, input().split())
mons = []
for _ in range(N):
X, H = map(int, input().split())
mons.append((X, (H + A - 1) // A))
mons.sort()
ans = 0
q = deque([])
tot = 0
for x, h in mons:
while q:
x0, h0 = next(iter(q))
if x - 2 * D <= x0:
break
tot -= h0
q.popleft()
h = max(0, h - tot)
ans += h
tot += h
q.append((x, h))
print(ans)
| import math
import collections
import itertools
def resolve():
S=input()
if("RRR" in S):
print(3)
elif("RR" in S):
print(2)
elif("R" in S):
print(1)
else:
print(0)
resolve() | 0 | null | 43,317,942,130,748 | 230 | 90 |
a_list = []
for i in range(10):
while True:
a = input()
a = int(a)
if 0<=a and a<=10000:break
a_list.append(a)
for i in range(3):
print(max(a_list))
a_list.remove(max(a_list))
| n = int(input())
sum = 0
for num in range(1,n+1):
if num%3 !=0 and num%5 != 0:
sum += num
print(sum) | 0 | null | 17,582,091,372,890 | 2 | 173 |
"RPN using stack for AOJ ALDS1_3_A: Stack"
# coding: utf-8
def rpn(exp):
"""
rpn calculation
>>> rpn(['1', '2', '+', '3', '4', '-', '*'])
-3
"""
stack = []
for elem in exp:
if elem == '+':
stack.append(int(stack.pop()) + int(stack.pop()))
elif elem == '-':
stack.append(-int(stack.pop()) + int(stack.pop()))
elif elem == '*':
stack.append(int(stack.pop()) * int(stack.pop()))
elif elem == '/':
stack.append(int(stack.pop()) / int(stack.pop()))
else:
stack.append(elem)
print(stack.pop())
def main():
"main function"
exp = list(input().split(' '))
rpn(exp)
if __name__ == '__main__':
# import doctest
# doctest.testmod()
main() | S = []
A = raw_input().split()
for i in A:
if i == '+':
S.append(int(S.pop()) + int(S.pop()))
elif i == '-':
S.append(-int(S.pop()) + int(S.pop()))
elif i == '*':
S.append(int(S.pop()) * int(S.pop()))
else:
S.append(i)
print S[0] | 1 | 36,661,772,110 | null | 18 | 18 |
val = raw_input().split()
ret = 'No'
if val[0] < val[1] < val[2]:
ret = 'Yes'
print(ret) | s = input().rstrip().split(' ')
a = int(s[0])
b = int(s[1])
c = int(s[2])
if a < b and b < c:
print("Yes")
else:
print("No") | 1 | 386,104,722,168 | null | 39 | 39 |
import bisect
H=int(input())
A=[2**x for x in range(51)]
if H==1:
print(1)
elif H==2:
print(3)
else:
index=bisect.bisect_right(A,H)
print(sum(A[:index])) | a, b, m = map(int, input().split())
reizo = list(map(int, input().split()))
renji = list(map(int, input().split()))
p = [list(map(int,input().split())) for i in range(m)]
ans = []
for i in range(m):
cost = reizo[p[i][0] - 1] + renji[p[i][1] - 1] - p[i][2]
ans.append(cost)
ans.append(min(reizo) + min(renji))
print(min(ans)) | 0 | null | 67,316,479,544,340 | 228 | 200 |
H, N = list(map(int, input().split()))
A = [[0]*2 for _ in range(N)]
for _ in range(N):
A[_][0], A[_][1] = list(map(int, input().split()))
# print(A)
# A.sort(key=lambda x: x[1])
INF = float('inf')
dp = [INF]*(H+1)
dp[0] = 0
for i in range(H):
if dp[i] == INF:
continue
for j in range(N):
a = A[j][0]
b = A[j][1]
if i+a >= H:
dp[H] = min(dp[H], dp[i]+b)
else:
dp[i+a] = min(dp[i+a], dp[i]+b)
print(dp[H]) | # -*- coding: utf-8 -*-
list = map(int, raw_input().split())
a = list[0]
b = list[1]
if a < b:
print "a < b"
elif a > b:
print "a > b"
else:
print "a == b" | 0 | null | 40,522,451,030,042 | 229 | 38 |
N = int(input())
A = list(map(int, input().split()))
subordinate_cnt = [0] * N
for boss_num in A:
subordinate_cnt[boss_num - 1] += 1
print("\n".join(map(str, subordinate_cnt))) | import sys
def main():
N=int(sys.stdin.readline())
A=tuple(map(int,sys.stdin.readline().split()))
R=[0 for _ in range(N)]
for a in A:R[a-1]+=1
for r in R:print(r)
if __name__=='__main__':main() | 1 | 32,573,892,510,880 | null | 169 | 169 |
x, k, d = map(int, input().split())
x = abs(x)
k_ = min(k, x // d)
k = k - k_
x = x-k_*d
if k % 2 != 0:
x = abs(x-d)
print(x)
| n,m,x=map(int,input().split())
A=[list(map(int,input().split())) for _ in range(n)]
a=[]
ans=[]
for i in range(2**n):
b=bin(i)[2:].zfill(n)
a.append(b)
for bit in a:
Skills=[]
for i in range(1,1+m):
skill=0
for j in range(n):
if bit[j]=="1":
skill+=A[j][i]
Skills.append(skill)
cost=0
if min(Skills)>=x:
for j in range(n):
if bit[j]=="1":
cost+=A[j][0]
ans.append(cost)
if len(ans)==0:
ans.append(-1)
print(min(ans)) | 0 | null | 13,700,306,105,340 | 92 | 149 |
#!/usr/bin python3
# -*- coding: utf-8 -*-
h, n = map(int, input().split())
ab = [list(map(int, input().split())) for _ in range(n)]
#DP[i] = i までの魔法でモンスターの体力を減らすため消耗する魔力の最小値
dp = [0] * 20001
for i in range(h):
dp[i] = min(dp[i-a] + b for a, b in ab)
print(dp[h-1])
| n = int(input())
dic = {}
for i in range(n):
req = input().split()
if(req[0] == "insert"):
dic[req[1]] = i
elif(req[0] == "find"):
if(req[1] in dic):
print("yes")
else:
print("no")
| 0 | null | 40,386,972,746,890 | 229 | 23 |
while True:
l = input().split()
if l[1] == '?':
break
print(int(eval(l[0]+l[1]+l[2]))) | N,K,C = map(int,input().split())
S = input()
L = []
R = []
i = 0
while i < N:
if S[i] == "o":
L.append(i)
if len(L) == K:
break
i += C+1
else:
i += 1
i = N-1
while i >= 0:
if S[i] == "o":
R.append(i)
if len(R) == K:
break
i -= C+1
else:
i -= 1
R.reverse()
for i in range(K):
if L[i] == R[i]:
print(L[i]+1)
| 0 | null | 20,642,385,758,168 | 47 | 182 |
a=[int(x) for x in input().split()]
print("{0} {1} {2:.5f}".format(a[0]//a[1],a[0]%a[1],a[0]/a[1])) | a,b = map(int, input().split())
print(f"{a//b} {a%b} {a/b:.5f}")
| 1 | 599,795,565,710 | null | 45 | 45 |
N = [int(_) for _ in list(input())]
a, b = 0, 1
for n in N:
a, b = min(a+n, b+10-n), min(a+(n+1), b+10-(n+1))
print(a)
| x = list(map(int,list(input())))
n = len(x)
dp = [[0,1] for _ in range(n+1)]
for i in range(n):
dp[i+1][0] = min(dp[i][0]+x[i],dp[i][1]+10-x[i])
dp[i+1][1] = min(dp[i][0]+x[i]+1,dp[i][1]+9-x[i])
print(dp[n][0])
| 1 | 71,277,799,237,578 | null | 219 | 219 |
a = int(input())
s = 100000
for i in range(a):
s = s * 1.05
if s % 1000:
s = s - (s % 1000) + 1000
print(int(s))
| debt = 100000.0
a = int(input())
for i in range(a):
debt = debt * 1.05
if(debt % 1000):
debt = (debt // 1000) * 1000 + 1000
print(int(debt))
| 1 | 1,130,180,700 | null | 6 | 6 |
import sys
import heapq
import math
import fractions
import bisect
import itertools
from collections import Counter
from collections import deque
from operator import itemgetter
def input(): return sys.stdin.readline().strip()
def mp(): return map(int,input().split())
def lmp(): return list(map(int,input().split()))
s=input()
n=len(s)
ans=0
for i in range(n//2):
if s[i]!=s[-1-i]:
ans+=1
print(ans) | s = input()
n = len(s)
cnt = 0
i = 0
j = -1
d = 0
while d != n//2:
if s[i] != s[j]:
cnt += 1
i+=1
j-=1
d+=1
print(cnt) | 1 | 120,431,210,617,340 | null | 261 | 261 |
t = list(input())
a = 0
b = 0
for i in range(len(t)):
if i == 0 and t[i] == '?':
t[i] = 'D'
if 0 < i < len(t) - 1 and t[i] == '?':
if t[i-1] == 'P':
t[i] = 'D'
elif t[i+1] == 'P':
t[i] = 'D'
else:
t[i] = 'P'
if i == len(t) -1 and t[i] == '?':
t[i] = 'D'
print(''.join(t)) | t=list(input())
if t[0]=='?':
t[0]=t[0].replace('?','D')
for i in range(1,len(t)-1):
if t[i]=='?' and t[i+1]=='D' and t[i-1]=='P':
t[i]=t[i].replace('?','D')
elif t[i]=='?' and t[i+1]=='P' and t[i-1]=='P':
t[i]=t[i].replace('?','D')
elif t[i]=='?' and t[i+1]=='D' and t[i-1]=='D':
t[i]=t[i].replace('?','P')
elif t[i]=='?' and t[i+1]=='P' and t[i-1]=='D':
t[i]=t[i].replace('?','D')
elif t[i]=='?' and t[i+1]=='?' and t[i-1]=='D':
t[i]=t[i].replace('?','P')
elif t[i]=='?' and t[i+1]=='?' and t[i-1]=='P':
t[i]=t[i].replace('?','D')
if t[-1]=='?':
t[-1]=t[-1].replace('?','D')
for i in t:
print(i,end='') | 1 | 18,469,712,495,080 | null | 140 | 140 |
a,v=map(int,input().split())
b,w=map(int,input().split())
t=int(input())
gap=abs(a-b)
if v>w:
c=gap/(v-w)
if t>=c:
print('YES')
else:
print('NO')
else:
print('NO') | import queue
N=int(input())
G=[[] for index1 in range(N+1)]
for index in range(1,N):
a,b=map(int,input().split())
G[a].append((b,index))
G[b].append((a,index))
#A[i]=辺iの色
A=[0]*N
q=queue.Queue()
#bfs
#(ノード、色、親)
q.put((1,0,0))
while not q.empty():
now=q.get()
i=1 #色
for next in G[now[0]]:
if next[0]==now[2]: #親
continue
else:
if i==now[1]:
i+=1
A[next[1]]=i #色を定める
q.put((next[0],i,now[0]))
i+=1
#print(now,(next[0],i,now[0]))
print(max(A))
for j in range(N-1):
print(A[j+1])
| 0 | null | 75,745,827,878,152 | 131 | 272 |
l = []
while True:
i = str(input())
if i == '0':
break
else:
l.append(i)
t = 0
for i in l:
t += 1
print('Case '+str(t)+': '+i)
| i=0
while True:
i=i+1
x=int(input())
if x==0:
break
print("Case "+str(i)+": "+str(x))
| 1 | 481,212,069,128 | null | 42 | 42 |
n = input()
l = map(int,raw_input().split())
print min(l), max(l), sum(l) | #!/usr/bin/env python3
from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_cache
import sys
sys.setrecursionlimit(10000)
INF = float("inf")
YES, Yes, yes, NO, No, no = "YES", "Yes", "yes", "NO", "No", "no"
dy4, dx4 = [0, 1, 0, -1], [1, 0, -1, 0]
dy8, dx8 = [0, -1, 0, 1, 1, -1, -1, 1], [1, 0, -1, 0, 1, 1, -1, -1]
def inside(y, x, H, W):
return 0 <= y < H and 0 <= x < W
def ceil(a, b):
return (a + b - 1) // b
def sum_of_arithmetic_progression(s, d, n):
return n * (2 * s + (n - 1) * d) // 2
def gcd(a, b):
if b == 0:
return a
return gcd(b, a % b)
def lcm(a, b):
g = gcd(a, b)
return a / g * b
def ok(t, s):
N = len(t)
for i in range(N):
if t[i]:
for x, y in s[i]:
if y == 1:
if not t[x]:
return False
elif y == 0:
if t[x]:
return False
return True
def solve():
N = int(input())
s = defaultdict(list)
for i in range(N):
A = int(input())
for _ in range(A):
X, Y = map(int, input().split())
X -= 1
s[i].append((X, Y))
ans = 0
for b in range(2 ** N):
t = [0] * N
num = 0
for i in range(N):
if (b >> i) & 1:
t[i] = 1
num += 1
if ok(t, s):
ans = max(ans, num)
print(ans)
def main():
solve()
if __name__ == '__main__':
main()
| 0 | null | 60,845,078,078,642 | 48 | 262 |
import math
def main():
"""
/|
b / | h
/ |
/??????|???_
<- a -->
??????a, ??????b, a??¨b??????????§?C(???)
C???????????????radian????±???????
??????1????????????: x
??????: h (b?????????????????¨????????????sin????????¨???????±???????
??¢???: S (??????)
L (x + a + b): ??????????????????????????¨??????
x = sqrt(a_ ** 2 + h ** 2)
??????a??????????????????h?????§???????????? a_ ??¨????????¨
a_ = a - b * cos(rad)
??? ??????????????¨?????????????????? ??§??°??°??£??????????????????
"""
a, b, C = map(int, input().split())
# ????§???¢????????? 0 < C < 180
rad = math.pi * C / 180
sin = math.sin(rad)
h = b * sin
S = a * h / 2
a_ = a - b * math.cos(rad)
len_d = math.sqrt(a_ ** 2 + h ** 2)
print("{:.8f}".format(S))
print("{:.8f}".format(a + b + len_d))
print("{:.8f}".format(h))
if __name__ == "__main__":
main() | def main():
S = input()
if S == "SUN":
print(7)
exit(0)
elif S == "MON":
print(6)
exit(0)
elif S == "TUE":
print(5)
exit(0)
elif S == "WED":
print(4)
exit(0)
elif S == "THU":
print(3)
exit(0)
elif S == "FRI":
print(2)
exit(0)
else:
print(1)
exit(0)
if __name__ == "__main__":
main()
| 0 | null | 66,952,689,862,430 | 30 | 270 |
k = int(input())
a, b = map(int, input().split())
x = 0
while True:
x += k
if a <= x <= b:
print('OK')
break
if x > b:
print('NG')
break | # -*- coding: utf-8 -*-
import sys
import os
def input_to_list():
return list(map(int, input().split()))
H, W = input_to_list()
M = []
for i in range(H):
M.append(input_to_list())
v = []
for i in range(W):
v.append(int(input()))
# M x v
for i in range(H):
all = 0
for j in range(W):
all += M[i][j] * v[j]
print(all) | 0 | null | 13,850,302,905,372 | 158 | 56 |
def main():
target_word = str(input()).lower()
texts_tuple = tuple()
while True:
text = input()
if text == 'END_OF_TEXT': break
texts_tuple += tuple(text.lower().split())
print(texts_tuple.count(target_word))
main() | n = int(input())
li = ["#"*20 if i%4==0 else "0"*10 for i in range(1, 16)]
for _ in range(n):
b, f, r, v = map(int, input().split())
h = 4*b-(4-f)-1
li[h] = li[h].replace(li[h], ''.join([str(int(list(li[h])[r-1])+v) if i == r-1 else list(li[h])[i] for i in range(10)]))
li = [' '+' '.join(li[i]) if (i+1)%4!=0 else li[i] for i in range(len(li))]
print('\n'.join(li))
| 0 | null | 1,449,079,907,370 | 65 | 55 |
X, Y = map(int, input().split())
def cmb(n, r, mod):
if ( r<0 or r>n ):
return 0
r = min(r, n-r)
return g1[n] * g2[r] * g2[n-r] % mod
mod = 10**9+7
N = 10**6
g1 = [1, 1] # 元テーブル
g2 = [1, 1] #逆元テーブル
inverse = [0, 1] #逆元テーブル計算用テーブル
for i in range( 2, N + 1 ):
g1.append( ( g1[-1] * i ) % mod )
inverse.append( ( -inverse[mod % i] * (mod//i) ) % mod )
g2.append( (g2[-1] * inverse[-1]) % mod )
step1_cnt = 0
step2_cnt = 0
if Y == X:
if Y % 3 == 0:
step1_cnt = step2_cnt = Y//3
print(cmb(step1_cnt+step2_cnt,step1_cnt,mod))
else:
print(0)
if Y > X:
step1_cnt = Y-X
Y = Y - step1_cnt*2
X = X - step1_cnt
if Y % 3 == 0:
step1_cnt += Y//3
step2_cnt += Y//3
print(cmb(step1_cnt+step2_cnt,step1_cnt,mod))
else:
print(0)
if X > Y:
step2_cnt = X - Y
Y = Y - step2_cnt
X = X - step2_cnt*2
if Y % 3 == 0:
step1_cnt += Y//3
step2_cnt += Y//3
print(cmb(step1_cnt+step2_cnt,step1_cnt,mod))
else:
print(0)
| mod = 10 ** 9 + 7
x, y = map(int, input().split())
if (x + y) % 3 != 0 or x * 2 < y or y * 2 < x:
print(0)
exit()
l = [1]
for i in range(1, (x + y) // 3 + 100):
l.append(l[-1] * i % mod)
def comb(n, r, m):
return l[n] * pow(l[r], m - 2, m) * pow(l[n - r], m - 2, m) % m
a, b = y - (x + y) // 3, x - (x + y) // 3
print(comb(a + b, a, mod) % mod) | 1 | 150,564,833,160,580 | null | 281 | 281 |
N = int(input())
A = list(map(int, input().split()))
ans = [0] * N
for i, a in enumerate(A):
ans[a-1] = i + 1
print(' '.join(map(str, ans)))
| import numpy as np
N = int(input())
A = list(map(int, input().split()))
A = np.argsort(A)
for a in A:
print(a+1, end=" ") | 1 | 180,675,104,193,920 | null | 299 | 299 |
#! /usr/lib/python3
import fractions
while True:
try:
a, b=map(int, input().split())
s=fractions.gcd(a,b)
print("{0} {1:.0f}".format(s,a*b/s))
except:
break | def main():
n = int(input())
for _ in range(n):
len_list = map(int, input().split())
check_tri(len_list)
def check_tri(len_list):
import itertools
import math
flag = False
for tmp in list(itertools.permutations(len_list)):
if (pow(tmp[0], 2) + pow(tmp[1], 2)) == pow(tmp[2], 2):
flag = True
break
if flag == True:
print('YES')
else:
print('NO')
if __name__ == '__main__':
main() | 0 | null | 408,462,432 | 5 | 4 |
import math
while True:
n = int(input())
if n == 0:
break
Student=list(map(float,input().split()))
#print(n)
#print(Student)
#m=average
average=sum(Student)/n
#print(m)
#a^2=dispersion
s=0.0
for i in Student:
s+=(i-average)**2
dispersion=s/n
print("%.6f"%(math.sqrt(dispersion))) | from math import gcd
def solve():
N = int(input())
A = list(map(int, input().split()))
all = 0
for a in A:
all = gcd(all, a)
if all != 1:
return "not coprime"
M = 10 ** 6
B = dict()
for a in A:
if a in B:
B[a] += 1
else:
B[a] = 1
for i in range(2, M + 1):
cnt = 0
for j in range(i, M, i):
if j in B:
cnt += B[j]
if cnt > 1:
return "setwise coprime"
return "pairwise coprime"
print(solve())
| 0 | null | 2,120,688,922,030 | 31 | 85 |
def main():
sw = list(map(int, input().split()))
print('unsafe' if sw[0] <= sw[1] else 'safe')
if __name__ == '__main__':
main() | def f(n):
if n == 1:
return 1
else:
return n * f(n - 1)
n = int(input())
X = []
Y = []
for i in range(n):
x, y = map(int,input().split())
X.append(x)
Y.append(y)
total = 0
for i in range(n):
for j in range(n):
total += ((X[i] - X[j])**2 + (Y[i] - Y[j])**2)**0.5
print(total/n)
| 0 | null | 88,725,709,927,040 | 163 | 280 |
n = int(input())
adjacency_list = []
for i in range(n):
input_list = list(map(int, input().split()))
adjacency_list.append(input_list[2:])
checked_set = set()
dfs_stack = []
v =[0 for i in range(n)]
f =[0 for i in range(n)]
time = 1
for i in range(n):
if i not in checked_set:
dfs_stack = []
dfs_stack.append(i)
while dfs_stack:
current = dfs_stack.pop()
if current not in checked_set:
checked_set.add(current)
v[current] = time
dfs_stack.append(current)
for ad in reversed(adjacency_list[current]):
if ad-1 not in checked_set:
dfs_stack.append(ad-1)
time +=1
elif f[current] == 0:
f[current] = time
time +=1
for i in range(n):
print(f'{i+1} {v[i]} {f[i]}')
| N = int(input())
Adj = [[0 for i in range(N)] for j in range(N)]
for i in range(N):
u = list(map(int, input().split()))
if u[1] > 0:
for k in u[2: 2+u[1]]:
Adj[u[0] - 1][k - 1] = 1
color = [0] * N #1: visited, 0: not visited, 2: completed
s = [0] * N # start
f = [0] * N # finish
time = 0
def DFS(u):
global time
color[u-1] = 1
time += 1
s[u-1] = time
for i in range(1, N+1):
if Adj[u-1][i-1] == 1 and color[i-1] == 0:
DFS(i)
color[u-1] = 2
time += 1
f[u-1] = time
for i in range(1, N+1):
if color[i-1] == 0:
DFS(i)
for i in range(N):
print('{} {} {}'.format(i+1, s[i], f[i])) | 1 | 3,005,883,770 | null | 8 | 8 |
count = int(input())
if count % 10 == 3:
print("bon")
elif count % 10 in [0, 1, 6, 8]:
print("pon")
else:
print("hon") | K = int(input())
A, B = map(int, input().split())
for i in range(1000):
if A <= K * i <= B:
print('OK')
break
else:
print('NG')
| 0 | null | 22,890,868,597,620 | 142 | 158 |
from itertools import permutations
n=int(input())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
l=[i+1 for i in range(n)]
perm = permutations(l)
perm=list(perm)
p=[]
for i in perm:
k=(''.join(map(str,i)))
p.append(int(k))
a=''.join(map(str,a))
b=''.join(map(str,b))
idx1=p.index(int(a))
idx2=p.index(int(b))
print(abs(idx1-idx2)) | import itertools
N=int(input())
P=tuple(map(int,input().split()))
Q=tuple(map(int,input().split()))
prm = list(itertools.permutations(range(1,N+1)))
i = 0
for t in prm:
i += 1
if t == P:
a = i
if t == Q:
b = i
print(abs(a-b))
| 1 | 100,286,927,076,802 | null | 246 | 246 |
from collections import deque
n = int(input())
l = list(map(int,input().split()))
l.sort()
largest = l[-1]
que = deque(l)
cnt = n
ans = 0
while cnt > 0:
x = que.pop()
ans += x
cnt -= 1
if cnt != 0:
ans += x
cnt -= 1
print(ans-largest) | import sys,math
for x,y in (line.split() for line in sys.stdin):print(int(math.log10(int(x)+int(y))+1)) | 0 | null | 4,602,544,198,628 | 111 | 3 |
# https://atcoder.jp/contests/abc146/submissions/8617148
def solve(N, M, S):
from collections import namedtuple
from heapq import heappop, heappush
INF = N * 2
V = namedtuple('V', 'cnt index')
cnt_from_N = [INF] * (N + 1)
cnt_from_N[N] = 0
parent = [0] * (N + 1)
h = [V(cnt=0, index=N)]
for j in range(N - 1, -1, -1):
# S[j]に到達する最小回数とその経路を求める
if S[j]:
continue
while h:
cnt, par = h[0]
if par > j + M:
# jまで移動できない(距離>M)
heappop(h)
continue
break
# jまで最小回数で到達できる頂点par
# parまでの回数cnt
if not h:
return -1,
# jまで到達できる頂点がない
cnt_from_N[j] = cnt + 1
parent[j] = par
heappush(h, V(cnt=cnt + 1, index=j))
ret = []
curr = 0
while curr < N:
par = parent[curr]
ret.append(par - curr)
curr = par
return ret
def main():
N, M = map(int, input().split())
*S, = map(int, input())
print(*solve(N, M, S))
if __name__ == '__main__':
main()
| n,m=map(int,input().split())
s=input()
ans=[]
w=n
while w:
x=0
for i in range(1,m+1):
if w-i>=0 and s[w-i]=='0':
x=i
if x==0:
print(-1)
exit()
else:
ans.append(x)
w-=x
print(*ans[::-1])
| 1 | 139,355,429,144,232 | null | 274 | 274 |
import sys
def input(): return sys.stdin.readline().strip()
def resolve():
x,y=map(int, input().split())
ans=0
if x<=3:
ans+=100000
if x<=2:
ans+=100000
if x==1:
ans+=100000
if y<=3:
ans+=100000
if y<=2:
ans+=100000
if y==1:
ans+=100000
if x==1 and y==1:
ans+=400000
print(ans)
resolve()
| def p(n):
if n == 1:
return 300000
elif n == 2:
return 200000
elif n == 3:
return 100000
else:
return 0
x, y = map(int, input().split())
ans = 0
if x == y == 1:
ans += 400000
ans += p(x) + p(y)
print(ans)
| 1 | 140,404,490,782,390 | null | 275 | 275 |
A = int(input())
B = int(input())
for i in range(1, 4):
if i in [A, B]:
continue
else:
print(i)
break | a=int(input())
b=int(input())
l=[]
l.append(a)
l.append(b)
if 1 not in l:
print(1)
elif 2 not in l:
print(2)
else:
print(3)
| 1 | 110,818,241,631,484 | null | 254 | 254 |
# -*- coding: utf-8 -*-
N = int(raw_input())
for i in range(N):
a, b, c = map(int, raw_input().split())
if a > c:
a, c = c, a
if b > c:
b, c = c, b
if a*a+b*b == c*c:
print "YES"
else:
print "NO" | for i in range(input()):
q = map(int,raw_input().split())
q.sort()
a = "YES" if q[0]**2 + q[1]**2 == q[2]**2 else "NO"
print a | 1 | 206,504,452 | null | 4 | 4 |
A, B, m = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
x = []
y = []
c = []
for i in range(m):
xx, yy, cc = map(int, input().split())
x.append(xx)
y.append(yy)
c.append(cc)
ans = min(a) + min(b)
for i in range(m):
ans = min(ans,a[x[i]-1] + b[y[i]-1] - c[i])
print (ans) | size = [int(i) for i in input().split()]
sheet =[ [0 for i in range(size[1])] for j in range(size[0])]
for gyou in range(size[0]):
x = [int(i) for i in input().split()]
sheet[gyou] = x
sheet[gyou].append(sum(sheet[gyou]))
for gyou in range(size[0]):
for retsu in range(size[1]+1):
print(sheet[gyou][retsu],end="")
if retsu != size[1]:
print(" ",end="")
print("")
for retsu in range(size[1]+1):
sum2 = 0
for gyou in range(size[0]):
sum2 += sheet[gyou][retsu]
print(sum2, end="")
if retsu != size[1]:
print(" ",end="")
print("")
| 0 | null | 27,801,376,066,496 | 200 | 59 |
X = int(input())
a = X // 500 # 500円硬貨の枚数
X = X % 500 # 端数
b = X // 5 # 5円硬貨の枚数
print(a*1000+b*5) | # -*- coding: utf-8 -*-
w = raw_input().upper()
c = 0
while 1:
t = raw_input()
if t=="END_OF_TEXT": break
c += t.upper().split().count(w)
print c | 0 | null | 22,280,351,241,148 | 185 | 65 |
#!/usr/bin python3
# -*- coding: utf-8 -*-
h, w, k = map(int, input().split())
a = [list(map(int, list(input()))) for _ in range(h)]
ret = 100000
for i in range(2 ** (h-1)):
hi = [0] * h
for j in range(h-1):
hi[j+1] += hi[j] + (i >> j & 1)
cnt = max(hi)
pj = 0
x = []
while pj < w:
s = [0] * 10
fg = False
for j in range(pj, w):
for t in range(h):
s[hi[t]] += a[t][j]
if max(s)>k:
if j == pj:
cnt = 100000
fg = True
break
else:
x.append(j)
cnt += 1
pj = j
break
if j == w-1:
pj = w
break
if fg:
break
ret = min(ret, cnt)
print(ret) | from collections import defaultdict
from itertools import product
H, W, K = map(int, input().split())
S = [input() for _ in range(H)]
C = [[int(s[i]) for s in S] for i in range(W)]#列を一括りにする
total = sum(sum(c) for c in C)#すべての値の合計を算出
if total <= K:
answer = 0
else:
answer = H * W
for X in product([False, True], repeat=H-1):#Hは行数
#あるXについて一回目のfor文が回る
ans = sum(X)#Trueの数を換算
if ans > answer:
continue
M = [[0]]
for i, x in enumerate(X):
if x:#Trueなら実行
M.append([])#Trueの数の配列が作成される
M[-1].append(i+1)#一番最後にその番目をappendする
D = [0] * len(M)#初期値を設定
for c in C:
for k, m in enumerate(M):
D[k] += sum(c[i] for i in m)#k番目の要素に足していく
#Dにどんどん代入することによってどの列まで足すことができるか算出することができる
if any(d > K for d in D):#一つでもKを超えていたら
ans += 1
if ans > answer:
break
D = [sum(c[i] for i in m) for m in M]#Dの更新(1番最初のDに戻る)
if any(d > K for d in D):#一つでもKを超えていたら
ans = answer + 1#ansの更新
break
answer = min(answer, ans)
print(answer) | 1 | 48,476,533,498,040 | null | 193 | 193 |
def isPrime(x):
if x==2:
return True
if x<2 or x%2==0:
return False
for n in range(3,int(x**0.5)+1,2):
if x%n==0:
return False
return True
n=int(input())
num=[int(input()) for i in range(n)]
i=0
for nm in num:
if isPrime(nm):
i+=1
print(i) | n, k, s = map(int, input().split())
ans = []
for i in range(k):
ans.append(s)
if s == pow(10, 9):
s = 0
for j in range(k, n):
ans.append(s+1)
print(' '.join(list(map(str, ans)))) | 0 | null | 45,408,995,949,660 | 12 | 238 |
n = int(input())
s = str(input())
count = 0
if n % 3 == 1 or n % 3 == 0:
for i in range(n-1):
if s[i] == 'A' and s[i+1] == 'B' and s[i+2] == 'C':
count += 1
elif n % 3 == 2:
for i in range(n-2):
if s[i] == 'A' and s[i+1] == 'B' and s[i+2] == 'C':
count += 1
print(count)
| from itertools import permutations
input()
P = int(''.join(input().split()))
Q = int(''.join(input().split()))
s = sorted(permutations(str(P)))
pi = s.index(tuple(str(P)))
qi = s.index(tuple(str(Q)))
print(abs(pi - qi)) | 0 | null | 99,749,554,017,568 | 245 | 246 |
a,b = map(int,input().split())
k = str(a)
l = str(b)
X = k*b
Y = l*a
if (X < Y):
print(X)
else:
print(Y) | import re
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
import functools
def v(): return input()
def k(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def X(): return list(input())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 9)
mod = 10**9+7
cnt = 0
ans = 1
inf = float("inf")
al = "abcdefghijklmnopqrstuvwxyz"
a,b = I()
A = str(a)*b
B = str(b)*a
print(min(A,B)) | 1 | 84,331,992,368,220 | null | 232 | 232 |
from collections import defaultdict
N, K = map(int, input().split())
A = list(map(int, input().split()))
cum = [0]*(N+1)
for i in range(1,N+1):
cum[i] = cum[i-1] + A[i-1]
ans = 0
dic = defaultdict(int)
v_by_indx = defaultdict(int)
for i in range(N+1):
if i-K >= 0:
dic[v_by_indx[i-K]] -= 1
diff = (cum[i]-i)%K
ans += dic[diff]
dic[diff] += 1
v_by_indx[i] = diff
print(ans)
| from collections import defaultdict
from bisect import bisect_left
n, k = map(int, input().split())
a = [0] + list(map(int, input().split()))
for i in range(1, n + 1):
a[i] -= 1
for i in range(n):
a[i + 1] += a[i]
a[i] %= k
a[i + 1] %= k
c = defaultdict(list)
for i in range(n + 1):
c[a[i]].append(i)
ans = 0
for v in c.values():
for i in range(len(v)):
ans += bisect_left(v, v[i] + k) - i - 1
print(ans)
| 1 | 137,892,456,160,690 | null | 273 | 273 |
from collections import deque
# 隣り合ったマスへ移動するためのテーブル
dx = [0, 0, 1, -1]
dy = [1, -1, 0, 0]
H, W = map(int, input().split())
maze = [input() for _ in range(H)]
# 全ての"."の地点からBFSしてスタートからの各地点への移動回数(深さ)を調べ、最大のものを出力する
def solve():
ans = 0
for i in range(H):
for j in range(W):
# スタートが壁の場合
if maze[i][j] == "#":
continue
# BFSの初期化、初期条件
dist = [[-1] * W for _ in range(H)]
dist[i][j] = 0
que = deque()
que.append([i, j])
# BFSループ
while que:
y, x = que.popleft()
for k in range(4):
nx = x + dx[k]
ny = y + dy[k]
# 迷路から外れる場合
if nx >= W or nx < 0 or ny >= H or ny < 0:
continue
# 既に探索済みの場合
if dist[ny][nx] != -1:
continue
# 隣が壁の場合
if maze[ny][nx] == "#":
continue
dist[ny][nx] = dist[y][x] + 1
que.append([ny, nx])
ans = max(ans, max(max(steps) for steps in dist))
print(ans)
if __name__ == "__main__":
solve()
| from collections import deque
import numpy as np
# (sx, sy) から (gx, gy) への最短距離を求める
# 辿り着けないと INF
def bfs(sx, sy):
# すべての点を INF で初期化
d = [[float("-inf")] * m for i in range(n)]
# 移動4方向のベクトル
dx = [1, 0, -1, 0]
dy = [0, 1, 0, -1]
# スタート地点をキューに入れ、その点の距離を0にする
que = deque([])
que.append((sx, sy))
d[sx][sy] = 0
# キューが空になるまでループ
while que:
# キューの先頭を取り出す
p = que.popleft()
# 取り出してきた状態がゴールなら探索をやめる
#if p[0] == gx and p[1] == gy:
# break
# 移動4方向をループ
for i in range(4):
# 移動した後の点を (nx, ny) とする
nx = p[0] + dx[i]
ny = p[1] + dy[i]
# 移動が可能かの判定とすでに訪れたことがあるかの判定
# d[nx][ny] != INF なら訪れたことがある
if 0 <= nx < n and 0 <= ny < m and maze[nx][ny] != "#" and d[nx][ny] == float("-inf"):
# 移動できるならキューに入れ、その点の距離を p からの距離 +1 で確定する
que.append((nx, ny))
d[nx][ny] = d[p[0]][p[1]] + 1
a = np.max(d)
return a
n, m = map(int, input().split())
maze = [list(input()) for i in range(n)]
ans = 1
for x in range(n):
for y in range(m):
sx = x
sy = y
if maze[sx][sy] == "#":
continue
A = bfs(sx, sy)
ans = max(A, ans)
print(int(ans)) | 1 | 94,295,417,591,520 | null | 241 | 241 |
N = int(input())
table = [[int(i) for i in input().split()] for N in range(N)]
a = -1
b = 10**10
c = -10**10
d = 10**10
for i in range(N):
p = table[i][0]
q = table[i][1]
if a < p+q:
a = p+q
if b > p+q:
b = p+q
if c < p-q:
c = p-q
if d > p-q:
d = p-q
print(max(a-b,c-d))
| N=int(input())
A=[]
B=[]
for _ in range(N):
x,y=map(int, input().split())
A.append(x+y)
B.append(x-y)
A=sorted(A)
B=sorted(B)
print(max(A[-1]-A[0],B[-1]-A[0],A[-1]-A[0],B[-1]-B[0])) | 1 | 3,405,075,202,958 | null | 80 | 80 |
# ========== //\\ //|| ||====//||
# || // \\ || || // ||
# || //====\\ || || // ||
# || // \\ || || // ||
# ========== // \\ ======== ||//====||
# code
# 1 -> 1,2 2,1 3,
# 2 -> 1,1
def solve():
n = int(input())
cnt = 0
for i in range(1, n + 1):
k = n // i
if n % i:
cnt += k
else:
cnt += max(0, k - 1)
print(cnt)
return
def main():
t = 1
# t = int(input())
for _ in range(t):
solve()
if __name__ == "__main__":
main() | n = int(input())
z = []
w = []
for i in range(n):
x,y = map(int,input().split())
z.append(x+y)
w.append(x-y)
zmax = max(z)-min(z)
wmax = max(w)-min(w)
print(max(zmax,wmax)) | 0 | null | 2,996,206,767,450 | 73 | 80 |
n = int(input())
a = list(map(int,input().split()))
even_list = []
for i in range(n):
if a[i] % 2 == 0:
even_list.append(a[i])
x = 0
for m in range(len(even_list)):
if even_list[m] % 3 == 0 or even_list[m] % 5 == 0:
x += 1
if x == len(even_list):
print('APPROVED')
else:
print('DENIED') | n = int(input().rstrip())
print(str(n ** 3)) | 0 | null | 34,548,769,024,588 | 217 | 35 |
import math
a,b,x = list(map(int,input().split()))
theta = math.degrees(math.atan(a*b*b/2/x))
if(b/math.tan(math.radians(theta)) > a):
theta = math.degrees(math.atan((2*a*a*b-2*x)/a/a/a))
print('{:.7f}'.format(theta))
| from math import tan, pi, degrees
a, b, x = map(int, input().split())
def solve(isOK):
ng, ok = pi/2, 0
while abs(ok-ng) > 10**-12:
mid = (ng+ok) / 2
if isOK(mid):
ok = mid
else:
ng = mid
# print('ok:', ok)
print(degrees(ok))
def isOK1(theta):
return a*a*tan(theta)/2 + x/a <= a*b
def isOK2(theta):
return b*b/tan(theta)/2 >= x/a
if x/a >= a*b/2:
solve(isOK1)
else:
solve(isOK2)
| 1 | 163,013,915,080,710 | null | 289 | 289 |
n=input().split()
if int(n[0])==int(n[1]):
print("Yes")
else:
print("No") | from sys import stdin
N, M = [int(x) for x in stdin.readline().rstrip().split()]
if N == M:
print("Yes")
else:
print("No")
| 1 | 83,603,666,518,392 | null | 231 | 231 |
n=int(input())
a=n*n
print(int(a)) | import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def main():
r = int(readline())
print(r * r)
return
if __name__ == '__main__':
main()
| 1 | 145,127,820,542,860 | null | 278 | 278 |
def main():
a = input()
print a**3
return 0
main() | n = int(input())
if n>= 30:print('Yes')
else:print('No') | 0 | null | 3,001,441,089,020 | 35 | 95 |
poland = input().split()
num = []
for p in poland:
if p.isdigit():
num.append(int(p))
else:
b = num.pop()
a = num.pop()
if p == '*':
num.append(a * b)
elif p == '/':
num.append(a / b)
elif p == '+':
num.append(a + b)
elif p == '-':
num.append(a - b)
print(num.pop()) | class Stack:
# ???????????????????????§??????top??????????????????????????????Max???isFull??¨????????????stack???????????????????????§???
def __init__(self):
self.top = 0
self.Max = 100
self.stack = [None]
def isEmpty(self):
return self.top == 0
def isFull(self):
return self.top >= self.Max
def push(self, x):
if self.isFull():
print("Stack overflow!")
else:
self.top += 1
self.stack.append(x)
def pop(self):
if self.isEmpty():
print("Stack underflow!")
else:
self.top -= 1
return self.stack.pop()
d_e = input().split()
accumlator = Stack()
for i in d_e:
if i in "+-*":
post_op = accumlator.pop()
pre_op = accumlator.pop()
ans = eval(pre_op + i + post_op)
accumlator.push(str(ans))
else:
accumlator.push(i)
print(int(accumlator.pop())) | 1 | 35,863,371,840 | null | 18 | 18 |
n=int(input())
a=list(map(int,input().split()))
mod=10**9+7
from math import gcd
ans=a[0]
for i in range(1,n):
ans=ans*a[i]//gcd(ans,a[i])
s=sum(pow(x,mod-2,mod) for x in a)
print(s*ans%mod)
| import sys
import bisect
import itertools
import collections
import fractions
import heapq
import math
from operator import mul
from functools import reduce
from functools import lru_cache
def solve():
readline = sys.stdin.buffer.readline
mod = 10 ** 9 + 7
N = int(readline())
A = list(map(int, readline().split()))
lcmnum = 1
def gcd(a, b):
if (a == 0):
return b
return gcd(b%a, a)
def lcm(x, y):
return (x * y) // gcd(x, y)
for a in A:
lcmnum = lcm(lcmnum, a)
ans = 0
for a in A:
a = lcmnum // a
ans += a
ans %= mod
print(ans)
if __name__ == '__main__':
solve()
| 1 | 87,717,229,523,960 | null | 235 | 235 |
n=int(input())
l=""
for i in range(1,n+1):
if i % 3==0 or i % 10 == 3 or (i % 100)//10 == 3 or (i % 1000)//100 == 3 or (i % 10000)//1000 == 3:
l+=" "+str(i)
print(l)
| def nabeatsu(n):
if(n % 3 == 0):
return True
temp = n
while(temp > 0):
if(temp % 10 == 3):
return True
temp = temp // 10
return False
x = int(input())
for i in range(x):
if(nabeatsu(i + 1)):
print(' ', end = '')
print(i + 1, end = '')
print()
| 1 | 927,732,128,068 | null | 52 | 52 |
a,b = map(int,input().split())
ans = b if a >= 10 else b + 100 * (10-a)
print(ans) | # coding: utf-8
# Your code here!
import math
while True:
n = int(input())
if n == 0:
break
s = list(map(int,input().split()))
sum = 0
for i in range(len(s)):
sum += s[i]
m = sum/len(s)
a = 0
for i in range(len(s)):
a += s[i]*s[i]
a = a/len(s)
print("{0:.8f}".format(math.sqrt(a-m*m)))
| 0 | null | 31,936,594,390,194 | 211 | 31 |
from collections import Counter,defaultdict,deque
from heapq import heappop,heappush,heapify
from bisect import bisect_left,bisect_right
import sys,math,itertools,fractions,pprint
sys.setrecursionlimit(10**8)
mod = 10**9+7
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
n = inp()
res = [0]*(n+1)
for i in range(1,n+1):
for j in range(1,n+1):
if i*j > n: break
res[i*j] += 1
print(sum(i*x for i,x in enumerate(res))) | n = int(input())
times_ls = [0] * (n+1)
for base in range(1,n+1):
for j in range(1,n+1):
if base * j <= n:
times_ls[base * j] += 1
else:
break
ans = 0
for i in range(1,n+1):
ans += i * times_ls[i]
print(ans)
| 1 | 10,943,567,547,640 | null | 118 | 118 |
a, b = map(int, input().split())
x = 300000
y = 200000
z = 100000
A = [x, y, z]
for i in range(1000):
A.append(0)
a_ = A[a-1]
b_ = A[b-1]
if a == 1 and b == 1:
print(a_ + b_ + 400000)
else:
print(a_ + b_) | x, y = map(int, input().split())
s = [400000, 300000, 200000, 100000]
if x == 1 and y == 1:
print(sum(s))
elif x <= 3 and y <= 3:
print(s[x] + s[y])
elif x <= 3:
print(s[x])
elif y <= 3:
print(s[y])
else:
print(0) | 1 | 140,951,506,978,244 | null | 275 | 275 |
n,x,m=map(int,input().split())
sm=[-1 for i in range(m)]+[0]
w=[-1 for i in range(m)]
d=[m]
a=x
t=0
s=0
while True:
s+=a
if w[a]!=-1:
inter=t-w[a]
fv=w[a]
ls=d[(n-fv)%inter+fv]
lls=d[w[a]]
print(sm[lls]+(n-fv)//inter*(s-sm[a])+(sm[ls]-sm[lls]))
break
w[a]=t
d.append(a)
sm[a]=s
t+=1
a=(a*a)%m | x,y = map(int, raw_input().split())
while y > 0:
x,y = y,x%y
print x | 0 | null | 1,427,455,679,730 | 75 | 11 |
a = list(map(int,input().split()))
if a[0] == a[1]:print("Yes")
else:print("No") | n = int(input())
data = list(map(int, input().split()))
def insertionsort(a, n):
for i in range(n):
v = a[i]
j = i - 1;
while (j >= 0 and a[j] > v):
a[j+1] = a[j]
j -= 1
a[j+1] = v
print(*a)
insertionsort(data, n) | 0 | null | 41,388,664,763,380 | 231 | 10 |
import bisect
N = int(input())
L = sorted(map(int, input().split(' ')))
ans = 0
for i in range(len(L)):
for j in range(i + 1, len(L)):
a = L[i]
b = L[j]
ans += max(0, bisect.bisect_right(L, a + b - 1) - (j + 1))
print(ans)
| while True:
x, y = list(map(int, input().split(" ")))
if (x, y) == (0, 0):
break
elif (x < y):
print(x, y)
else:
print(y, x) | 0 | null | 86,106,702,849,440 | 294 | 43 |
s = input()
t = input()
ans = len(t)
c = 0
for i in range(len(s)-len(t)+1):
c = 0
for j in range(len(t)):
if s[i+j] != t[j]:
c += 1
if ans > c:
ans = c
print(ans)
| import sys
import itertools
def resolve(in_):
return len(set(s.strip() for s in itertools.islice(in_, 1, None)))
def main():
answer = resolve(sys.stdin.buffer)
print(answer)
if __name__ == '__main__':
main() | 0 | null | 16,895,766,499,040 | 82 | 165 |
N = int(input())
result = False
count = 0
for i in range(N):
D1,D2 = map(int,input().split())
if D1 == D2:
count += 1
else:
count = 0
if count > 2:
result = True
break
if result:
print('Yes')
else:
print('No')
| n=int(input())
count=0
maxs=0
for _ in range(n):
d1,d2=map(int,input().split())
if d1==d2:
count+=1
else:
maxs=max(maxs,count)
count=0
maxs=max(count,maxs)
if maxs>=3:
print("Yes")
else:
print("No") | 1 | 2,481,861,600,864 | null | 72 | 72 |
x = int(input())
j = 0
for i in range(360):
j += x
j %= 360
if j == 0:
print(i+1)
exit() | n=int(input())
a=list(map(int,input().split()))
X=[]
b=a[0]
for i in range(1,n) :
b^=a[i]
for i in range(n) :
x=b^a[i]
X.append(x)
for i in X :
print(i,end=" ")
| 0 | null | 12,881,055,826,336 | 125 | 123 |
if __name__ == "__main__":
s, t = input().split()
print(t+s) | n=int(input())
xy=[list(map(int, input().split())) for i in range(n)]
z=list(map(lambda x: x[0]+x[1], xy))
w=list(map(lambda x: x[0]-x[1], xy))
print(max(max(z)-min(z), max(w)-min(w))) | 0 | null | 53,102,400,639,552 | 248 | 80 |
import sys,math
n=0
max_v=-math.pow(10,10)
s=math.pow(10,10)
for line in sys.stdin:
l=int(line)
if n == 0:
n=l
continue
diff=l-s
if diff>max_v:
max_v=diff
if diff<0:
s=l
print max_v | import sys
input = sys.stdin.readline
INF = 10**18
sys.setrecursionlimit(10**6)
def li():
return [int(x) for x in input().split()]
N = int(input())
xs, ys = [], []
for i in range(N):
x, y = li()
xs.append(x)
ys.append(y)
def get_max_manhattan_distanse(xs, ys):
X = [xs[i] + ys[i] for i in range(len(xs))]
Y = [xs[i] - ys[i] for i in range(len(xs))]
# return max(max(X) - min(X), max(Y) - min(Y))
X.sort()
Y.sort()
return max(X[-1] - X[0], Y[-1] - Y[0])
ans = get_max_manhattan_distanse(xs, ys)
print(ans) | 0 | null | 1,735,525,841,870 | 13 | 80 |
def main():
H, W = map(int, input().split())
if H == 1 or W == 1:
print(1)
return
B = W // 2
A = W - B
D = H // 2
C = H - D
print(C * A + D * B)
main() | import math
h , w = map(int , input().strip().split())
if h != 1 and w != 1:
print(math.ceil(h * w / 2))
else:
print(1)
| 1 | 50,845,155,216,736 | null | 196 | 196 |
n = int(input())
dic = {"AC":0, "WA":0, "TLE":0, "RE":0}
for i in range(n):
s = input()
dic[s] += 1
print("AC x " + str(dic["AC"]))
print("WA x " + str(dic["WA"]))
print("TLE x " + str(dic["TLE"]))
print("RE x " + str(dic["RE"])) | n = int(input())
aa = []
bb = []
for _ in range(n):
a, b = map(int, input().split())
aa.append(a)
bb.append(b)
aa.sort()
bb.sort()
if n % 2 == 1:
ac = aa[n // 2]
bc = bb[n // 2]
print(abs(ac - bc) + 1)
else:
ac1 = aa[n // 2 - 1]
bc1 = bb[n // 2 - 1]
ac2 = aa[n // 2]
bc2 = bb[n // 2]
print((bc2 + bc1) - (ac2 + ac1) + 1)
| 0 | null | 13,094,485,366,268 | 109 | 137 |
d = int(input())
*C, = map(int, input().split())
S = [list(map(int, input().split())) for i in range(d)]
X = [int(input()) - 1 for i in range(d)]
L = [-1 for j in range(26)]
score = 0
for i in range(d):
L[X[i]] = i
score += S[i][X[i]]
score -= sum([C[j] * (i - L[j]) for j in range(26)])
print(score)
| D = int(input())
c = list(map(int, input().split()))
s = []
for i in range(D):
s.append(list(map(int, input().split())))
t = []
for i in range(D):
t.append(int(input())-1)
v = 0
last = [-1 for _ in range(26)]
for d in range(D):
v += s[d][t[d]]
last[t[d]]=d
for i in range(26):
v -= c[i] * (d - last[i])
print(v)
| 1 | 10,051,402,509,092 | null | 114 | 114 |
n = input()
lis = []
bot = 0
for i in xrange(n):
com = raw_input()
if com[0] == 'i':
lis.append(com[7:])
elif com[6] == ' ':
try:
lis.pop(~lis[::-1].index(com[7:]))
except:
pass
elif com[6] == 'F':
lis.pop()
else:
bot += 1
print ' '.join( map(str, reversed(lis[bot:])) ) | while True:
[a,b] = raw_input().split()
a = int(a)
b = int(b)
if a == 0 and b == 0:
break
if a < b:
print a,b
else:
print b,a | 0 | null | 281,919,686,808 | 20 | 43 |
N,M=input().split()
N=int(N); M=int(M);
if(N==M):
print("Yes")
else:
print("No") | import sys
def solve():
readline = sys.stdin.buffer.readline
mod = 10 ** 9 + 7
n, m = list(map(int, readline().split()))
print("Yes" if n == m else "No")
if __name__ == '__main__':
solve()
| 1 | 83,383,562,599,150 | null | 231 | 231 |
list = [input().split()]
r = int(list[0][0])
c = int(list[0][1])
i = 0
k = 0
sum2 = 0
list3 = [0] * c
while i < r:
sum = 0
list2 = [input().split()]
for j in list2[0]:
print(j, end=' '),
sum += int(j)
for k in range(c):
list3[k] += int(list2[0][k])
print(sum)
sum2 += sum
i += 1
for l in list3:
print(l, end=' ')
print(sum2) | r_c_str=input().split()
r_c=list(map(lambda i :int(i),r_c_str))
r=r_c[0]
c=r_c[1]
s_str=[input() for i in range(r)]
s_str=[i.split() for i in s_str]
s=[]
for i in s_str:
s.append(list(map(lambda j :int(j),i)))
for i in range(r):
s[i].append(sum(s[i]))
s.append([])
for i in range(c+1):
s[-1].append(0)
for i in range(c):
for j in range(r):
s[r][i]+=s[j][i]
s[-1][-1]+=sum(s[r])
for i in s:
print(*i)
| 1 | 1,359,008,004,660 | null | 59 | 59 |
a=input()
print(a.replace('?','D')) | #!/usr/bin/env pytho3
n = int(input())
a = list(map(int,input().split()))
# ３種類の値をもち、自分より前に同じ色の人がa[i]となる組み合わせ
# コーナーケースとして、全部同じ色なら3通り、あとは*6したらいい
# n<=10**5
# 先頭を色１、次にa[i] == 0になった点を色2,3にしてしていい。前から埋める
# 前から見ていって、それぞれの色の今の人数をcolorとして
# color.count(a[i]) == 2 ならans *= 2, ==3 ans *= 3
# 2ケースのみRE
mod = 10**9 + 7
if a == list(range(n)): print(3)
else:
k = 0
ans = 6
color = [0,0,0]
for person in range(n):
#print(color,person)
bit = 0#すでにcolor == a[i]が出てきているか?
if a[person] == 0:
if k == 3:#REになるケース
print(0)
exit()
color[k] = 1
k += 1
continue
for num in range(3):
if color[num] == a[person]:
bit += 1
if bit == 1:
color[num] += 1
if num == 2:
ans *= bit
ans = ans % mod
print(ans)
| 0 | null | 74,602,391,660,908 | 140 | 268 |
N = int(input())
A = list(map(int, input().split()))
if len(A) > len(set(A)):
print("NO")
else:
print("YES") | n=int(input())
a=list(map(int,input().split()))
a.sort()
for i in range(n-1):
if a[i]==a[i+1]:
print("NO")
exit()
print("YES") | 1 | 74,178,664,527,292 | null | 222 | 222 |
def func(N,X,T):
result = -(-N // X) * T
return result
if __name__ == "__main__":
N,X,T = map(int,input().split())
print(func(N,X,T)) | import sys
sys.setrecursionlimit(2*10**5)
n, u, v = map(int, input().split())
edge = [tuple(map(int, input().split())) for _ in range(n-1)]
u -= 1
v -= 1
connect = [set() for _ in range(n)]
for a, b in edge:
connect[a-1].add(b-1)
connect[b-1].add(a-1)
du = [0] * n
dv = [0] * n
def dfs(v, dis, ng, d):
d[v] = dis
ng.add(v)
for w in connect[v]:
if w not in ng:
dfs(w, dis+1, ng, d)
dfs(u, 0, set(), du)
dfs(v, 0, set(), dv)
ans = 0
for i in range(n):
if du[i] < dv[i]:
ans = max(ans, dv[i]-1)
print(ans) | 0 | null | 61,154,810,188,950 | 86 | 259 |
N=int(input())
A=list(map(int, input().split()))
if N==2:
print(max(A))
exit()
dp=[[0,0,0] for i in range(N)]
dp[0][0]=A[0]
dp[1][1]=A[1]
dp[2][2]=A[2]
for i in range(N):
if i>1:
dp[i][0]=dp[i-2][0]+A[i]
if i>2:
dp[i][1]=max(dp[i-3][0],dp[i-2][1])+A[i]
if i>3 :
dp[i][2]=max(dp[i-4][0],dp[i-3][1],dp[i-2][2])+A[i]
if N%2==1:
ans=max(dp[-1][2],dp[-2][1],dp[-3][0])
else:
ans=max(dp[-1][1],dp[-2][0])
print(ans) | N = int(input())
A = [int(x) for x in input().split()]
S = [0] * (N+1) #累積和用のリスト
s = 0
CONST = 10**9+7
#前準備として累積和を計算
for i in range(N):
S[i+1] = S[i] + A[i]
#積の総和を計算
for i in range(N-1):
s += A[i] * ((S[N] - S[i+1]) % CONST)
s %= CONST
print(s) | 0 | null | 20,601,214,345,242 | 177 | 83 |
N=int(input())
A=list(map(int,input().split()))
A.sort(reverse=True)
cnt=2
ans=A[0]
i=1
while cnt<N:
ans+=A[i]
if (cnt+1)%2==0:
i+=1
cnt+=1
print(ans) | # ABC158
# D - String Formation
from collections import deque
def ChangeState(Is_normal):
if Is_normal==True:
return False
else:
return True
S=deque(input().split())
Q=int(input())
Is_normal=True
for _ in range(Q):
q = input()
if len(q)== 1 :
Is_normal = ChangeState(Is_normal)
else:
if q[2]=='1':
if Is_normal==True:
# S=q[4]+S
S.appendleft(q[4])
else :
# S=S+q[4]
S.append(q[4])
else :
if Is_normal==True:
# S=S+q[4]
S.append(q[4])
else:
# S=q[4]+S
S.appendleft(q[4])
# print(Is_normal, S)
S=''.join(S)
if Is_normal==False:
S=S[::-1]
print(S)
| 0 | null | 33,248,193,625,960 | 111 | 204 |
while True:
s = input().rstrip().split(" ")
h=int(s[0])
w=int(s[1])
if (h == 0) & (w == 0):
break
for i in range(h):
print("#"*w)
print() | b = []
c = []
while True:
a = input().split()
a[0] = int(a[0])
a[1] = int(a[1])
if a[0] == 0 and a[1] == 0:
break
else:
b.append("#"*a[1])
c.append(a[0])
for i in range(len(c)):
for j in range(c[i]):
print(b[i])
print("\n",end="")
| 1 | 786,549,888,260 | null | 49 | 49 |
def selectionsort(A, N):
count = 0
for i in range(N):
minj = i
for j in range(i, N):
if A[j] < A[minj]:
minj = j
A[i], A[minj] = A[minj], A[i]
if (A[i] != A[minj]):
count += 1
return count
def main():
n = int(input())
data = list(map(int, input().split()))
c = selectionsort(data, n)
print(*data)
print(c)
if __name__ == "__main__":
main() | N = int(input())
A = [int(i) for i in input().split()]
cnt = 0
for i in range(0, N):
for j in range(i+1, N)[::-1]:
if A[j] < A[j-1]:
A[j], A[j-1] = A[j-1], A[j]
cnt = cnt + 1
print(' '.join([str(item) for item in A]))
print(cnt) | 0 | null | 19,242,874,308 | 15 | 14 |
def resolve():
S, T = input().split()
A, B = list(map(int, input().split()))
U = input()
if S == U:
A -= 1
else:
B -= 1
print(A, B)
if '__main__' == __name__:
resolve() | S,T = input().split()
A,B = (int(x) for x in input().split())
U = input()
if U == S:
A -= 1
print(('{} {}'.format(A,B)))
else:
B -= 1
print(('{} {}'.format(A,B))) | 1 | 72,096,587,993,572 | null | 220 | 220 |
def main():
labels = list(map(int, input().split(' ')))
n = int(input())
for i in range(n):
dice = Dice(labels)
t, f = map(int, input().split(' '))
for j in range(8):
if j%4 == 0:
dice.toE()
if f == dice.front:
break
dice.toN()
for j in range(4):
if t == dice.top:
break
dice.toE()
print(dice.right)
class Dice:
def __init__(self, labels):
self.labels = labels
self._tb = (0, 5)
self._fb = (1, 4)
self._lr = (3, 2)
def toN(self):
tb = self._tb
self._tb = self._fb
self._fb = tuple(reversed(tb))
return self
def toS(self):
tb = self._tb
self._tb = tuple(reversed(self._fb))
self._fb = tb
return self
def toW(self):
tb = self._tb
self._tb = tuple(reversed(self._lr))
self._lr = tb
return self
def toE(self):
tb = self._tb
self._tb = self._lr
self._lr = tuple(reversed(tb))
return self
def get_top(self):
return self.labels[self._tb[0]]
def get_front(self):
return self.labels[self._fb[0]]
def get_right(self):
return self.labels[self._lr[1]]
top = property(get_top)
front = property(get_front)
right = property(get_right)
if __name__ == '__main__':
main() | def roll(i):
global u, s, e, w, n, d
if i == 'N':
u, s, n, d = s, d, u, n
elif i == 'E':
u, e, w, d = w, u, d, e
elif i == 'S':
u, s, n, d = n, u, d, s
elif i == 'W':
u, e, w, d = e, d, u, w
u, s, e, w, n, d = input().split()
q = int(input())
for i in range(q):
u1, s1 = input().split()
if u1 == s:
roll('N')
elif u1 == e:
roll('W')
elif u1 == w:
roll('E')
elif u1 == n:
roll('S')
elif u1 == d:
roll('N')
roll('N')
if s1 == s:
print(e)
elif s1 == e:
print(n)
elif s1 == n:
print(w)
elif s1 == w:
print(s) | 1 | 248,823,763,968 | null | 34 | 34 |
s = input()
l = ["x" for i in range(len(s))]
print("".join(l)) | def main():
n = int(stdinput())
st = [None] * (4**12)
for _ in range(n):
cmd, value = stdinput().split()
if cmd == 'insert':
st[get_hash(value)] = 1
elif cmd == 'find':
if st[get_hash(value)] == 1:
print('yes')
else:
print('no')
CODES = {'A' : 1, 'C' : 2, 'G' : 3, 'T' : 4}
def get_hash(s):
base = 1
h = 0
for c in s:
code = CODES[c]
h += code * base
base *= 4
return h
def stdinput():
from sys import stdin
return stdin.readline().strip()
if __name__ == '__main__':
main()
# import cProfile
# cProfile.run('main()')
| 0 | null | 36,287,667,500,700 | 221 | 23 |
import math
x = int(input())
now = 100
ans = 0
while(now < x):
ans += 1
now += now//100
print(ans)
| st = input()
list = (st.split())
print(list[1]+list[0])
| 0 | null | 65,184,975,527,060 | 159 | 248 |
N, K = [int(x) for x in input().split()]
R, S, P = [int(x) for x in input().split()]
T = input()
point = {'r':P, 's':R, 'p':S}
win = [False] * N
total = 0
for i in range(N):
if i < K or T[i] != T[i - K] or win[i - K] == False:
total += point[T[i]]
win[i] = True
print(total) | # compiled by pythran
"""
#pythran export main2()
import numpy as np
i4 = np.int32
i8 = np.int64
def main(in_file):
stdin = open(in_file)
N, M, K = [int(x) for x in stdin.readline().split()]
a = np.array([int(x) for x in stdin.readline().split()])
b = np.array([int(x) for x in stdin.readline().split()])
sum_ = 0
i = 0
while i < N:
sum_ += a[i]
if sum_ > K:
sum_ -= a[i]
break
i += 1
sum_ = K - sum_
j = 0
ans = 0
while True:
while True:
if sum_ < 0:
ans = max(ans, i + j - 1)
break
else:
if j == M:
ans = max(ans, i + j)
break
sum_ -= b[j]
j += 1
if i == 0 or j == M:
break
i -= 1
sum_ += a[i]
print(ans)
def main2():
main('/dev/stdin')
"""
import os, sys
p = os.path.dirname(__file__)
pymain = os.path.join(p, "a.out")
if len(sys.argv) == 1:
import subprocess
if p == "":
pymain = "./" + pymain
subprocess.call(pymain)
else:
import gzip, base64, stat
gz = b'H4sIAHaqVF8C/+19C3wU1dX47GY32RDILvIwPIQVF0xEwm4ekOVlAlmZ1QUiCYivTpZkA6ubbExmISBqNIGyjWtppa3Vtp/1s61t7VdsqbXUR3gjaov4wicoCLMEBRURFdj/Offe2Z2d7EBI0f//9/99q+HOPXPuued1zz33zutul+dqvU7Hyb80bhqHtTVjaL2UwRc8E0cBWAmXCf+O5EZw6VA3KPDU5UldcmmK90PblehpXV0O55JLnaI0ctq/d5YklxxnjbdDXnOXUWjuMmtSeSydwi2m5HZ61s6ygp1fYU0uGb9yKTc3sL8qBleX5VxyaWBlxUdiLR6/tIjW1eUWXXIpt7sO2qVzPf9ZWDmX9aellz2MqFzKdhgf8C+cUDQ+UDsu4G8ItYxrKZkwbkJRfnMwv4DwZGG4M2fPi9tbr5B1IIPheWH+5bN+2VF4ULdl+Nr6lzrsxd+3/hXPTVPY7boSe2na49kEhr41A/7+8KMpm/76buHrTc+kT7ryU+F7t/1k/bhfDW98OpAzvnzgg31n9LUePvPSsMNnOi4+fEZLD0+AwS5KAd/DpYYvSk8NX2dMDb81LTV8pCE1fEAmx41KAd+vweeXGvBqfWr4V7rU8JAG3KZB/1YN+GYN+HINvbVnpIaf0aBzWAPeoMH/EA24MTM1/AsNO16lYcefacj1Fw0+L9Kwy0kN+G816EzR4P/P8Nc/BbyvBv5tGvK+otHvwxp8ztTQzxMa+CUa/j9Kg589Gvy8qNHvexr4X2nY6xuNfkdp6O0hjfiwXEOuAg0/vEaDn5HxGSj5F9GQ6+ca46hOg58rNOTakJbafywa/EzWgPfR0GeWBj/zNfQwT0PPO4HOpdxgrmS5VTFbw/zJ4NUMnsPgr+oovHRZMv66dJQX8JdZk+a3Z9Mpfguj08rg9RyFL16WDH+A0ZcYvEL2wwykP5SztrJ8gXVwKAPjfDZnvZ7Wixj+nWmp4TMZfjWDl8mKgHm4WaytGTsW594JnCAsqg82CM2it0kUBE5wV80San1NvkX+ZtHXVDVrRiDY4KvyLgz46LnUZ26cXSmW+IPNwkJvs6/I3eAXyx2uJQCvml8pOooB6q+BPpp83vqFoTp3DQAdNYu9TYLY5PWLze4alws5aWkRGn1NzcEGb8AvLhOW2AmF2Q67INS0tHgX+pc4CuC42S/UBLzNzYK4rNEn+Bvqgi7KwkSC53A4nLTHIHTpb1hEO07Va6UXu2a8zq4MOoVZQK/Z1yS6Ay7X3MpglUApM4IgYkrmi2sCPm+TC84UCG5QA/yJXhEVUxuoQNqVIjIuLm4KLhUCvoZF4mLB19QUbKq4tobK2GvmXUzL5+CQQ+pewRsIBGuAM8HXUuNrFP3BBsKcY4JA+oOeZPlTEZkLsMIEd8hXlVBlF1yVE4SKaysLhQChVuRrqA2cNwGq6AnIX8Anm+RahV4K4m4EatFWiKOwzt9QK9T5m5pFIVjnAhXX16v8o6ekCsAfaoINgBeqEV31Ncyg9dSiRbJFgyHsSWjyNizyCXX1InS5XDUoyguYjyWYKFYyoTEskhy0yg1mVhquFyJNbPKBeZf4XChDw9L6uaBhZ0OQyiFSZ5goy7XQW0s9ZkmqIT4jwZWjsCnUIPrrfdSr2ZiJsyoL3xtrTlRYE/hUWrSq6j8bNshPgsmipYu9Yjcj9ZRNu4CxsTHgrQHV1iOHPQocRX5QpKsidZB0CK7ecYNhzNvYCMPQxTgBS/fWABOIASDeqvVPAgpxlKShO0OOpgl3mUHtD10440EwuAg6V8TA2d28iHk9sMz8s1uk7PkIcqXsAVide20v9Ovq/Ui2o0xEc3VNvuQw3EtD14DDiD7X3HoalYpqIBr1nr+C3o4A4nPNzf5FDaDTyiKBhUpVfIHsY1ENEMPkw8EJ8xqWonPN9TWH6n14soZmJXVBcF6uTvQFYEbB5KTmNqFm8W1CndePAOgHpihaA77EYICr8wXruLpFPrEZITDFyhOe6Gvxi1y9r76mvpEUjcu4uppAsNnH1ZPYJpvDj1nHch/i1AeXwNwtID8sM6r3+oEfsBg3c8YMoTDfzs30uKfPWLAAjovyC+wcHJZNdwuO/MJ8Z9I5p+JUciOHskqPhQLFkSNxWJBfTPZDDFwa+UuDY/wvjTMyCD1OJ2UG+dcEf5lwbCCYRgLDvz6Mip79GchZA2kP+XacGt2Fof8ZFCX+6ch/NP/VcXebEvl+xZhlWUilLFPe/0knmHi+Ef9O/gxWeH04dyaFLXvlz1m4C7aA1cN358H5DM7H6q/+GVecRq6Z1W8n7Q3cXawu5v3YhHxG4v2lcb8wJfarBvr9/TjQw88Z/tof/TQdd4j+m9VDQ/2ZqNn/yUzez5L35Rovp6VdBa9m+50lKrid4XN3qPDraJmjgj/C4FYV/CRbR9hV8H0Mv0QFt7A6r4Jb2T5ghQqey+rVaj4Z/mIN/BY1/wy/VQUvZfU1GnI9qMYvYPRU8M5CWj6tgi9g9U4VvNVByx1quYqZ/lTwRlaXVHCO9XtMBV/DFlim1mS4XOdWJNaF5Yr1pEkBn67YT5X1oWNreIvKnmp4rga8VAO+QAPeqAE3KeATFevnxxXwSQr4Lg34SQ34jrspHPdoM5R0FPAhyn0cBbxAAd+ngE9QwCUFvEQBP6aAO5V8KuBTlfsXrQn+8xVweT/AqLhmQfxLAS9TwBcr4DOUfCrg5cp9ruUJ+DQlfQX8KgW8RQGfroDL+wcIdynp30XhGYq9CyKXAq5XwHkFPE0Br1DADQr4AgVced2lWgFXXndYrICbFPBGBTxTKa8C3kcBb1XAsxTw1Qp4XwV8jQLeTwF/UAHPVsAfUcDNynGhgFuU+/sKuHJ/7GkFXLlP1amAD1COFwV8oHK8KOCDlONFAR+sHC8K+MVKP1TAc5TjRQEfqhwvCvgw5Qbb3Qn4cAXYpIBfohxfCvgIBTxHAVfuE1oV8EsV8FwFXHkdxK6AX6b0fwXcpvR/BXy00v8V8DFK/1fAL1f6vwKeq/R/BTxP6f8K+BVK/1fAxyr9XwG/Uun/Cvg4pf8r4OOV/q+A25X+r4A7lP6vgBcq/V8BL1L6vwJerPR/BXyy0v8V8ClK/bcdMfEdxnqvleNXdor62C6+bYtpc/x8rPjHgpWLjV4L/5pHlsIR1hfjqei+GPxG/wDrGOqiu0j9XqxjiIt2kvpyrGNoi64j9SasY0iLPkLqt2IdQ1l0DakvxDqGsGgrqd+IdWQ72kjqc7GOoSxaTerXYB1DWLSC1KdjHUNXtJTUJ2EdQ1bUTuoFWMdQFbWS+hVYxxAVtZD6KKxjaIpypD4U6xiSosfOYP0irFuI/KTeB+v9ifykrsf6RUR+Uv/6e1AfQOQn9c+wPpDIT+qHsT6IyE/qH2J9MJGf1N/G+sVEflLfjfUcIj+p78T6ECI/qW/C+lAiP6lvwPowIj+p/wXrw4n8pP4HrF9C5Cf1R7E+gshP6g9hfSSR/zTWf4x1K5Gf1H+A9UuJ/KR+L9ZHEflJfTnWLyPyk3oT1m1EflK/FeujifykvhDrY4j8pH4j1i8n8pP6XKznEvlJ/Rqs5xH5SX061q8g8pP6JKyPJfKTegHWryTyk/oVWB9H5Cf1UVjPJ/KT+lCsjyfynyL2x7qdyE/qfbDuIPKTuh7qdWvi46tjMr8yJhql/UCMD+/lI8XLrrdykkiqR6UVMRm8EMG3MLAPwR0rbFYpKxOJrLCZpI3glHxkhc0u4UVmaCRdhViR4lxoiVWUB1Et0hsE4ag0gpGx8G1bLbzzKPBxEyB5woc84Y8pPrQrOUU7Rf/mOwa5bwFykeLdQBUQpZ0IDW/tep2P3GGSVkAQcneU2yRPuNZm94RFgx3gjZ7wE7ZHcLobzmg9RmhNsSU6/vAU7W3nN4QB6V7EQJJ5SpJWvqNfKZHHY7BSyuttqE1p0zeU8jWEMtNq5JSsvsvmg/pGsN7fgHiBfUw7g30dlQaTvozCApRsUE42UR8fToN2+1HtB1EToNpS6Rek5ZfS2gyq4nfjZts0D7nqkjYAH60rbJdz4pvULn5A7XoRuxNYo+1Msc8zln9GyBe3zkONHpVaANz1ECL8iiEsOc10cUmhShdF81Pp4qmvabtpp9VaXvEN7br2a6rl4dTc0pZ06hFXkvqX0npWHw747sjdpdJ/AwAOSqSH6IFd+hE9sEqSkRxYpLvTOSLA0nQq5/OniFpN1xO1buxLSPJhF7pPB9rjfkToeMa2DuYDd9sWi8d5SAxLe4C3rnsBJ1hlJUwsogDi711IOwJNYEqR/pVFnd8ibSFHU2wSXhhGUK70a3aUI/2d8BWTrmJ8XX5KHj2/ZNT2IbXWOLUlWfKgegKIdP0DNTQXj36DRw8i4UjxK5WUuxe+isWie8go2OyO3GWRWuB8dPsZ2keO5EynLnNpnOjFWVRPcxCxJkZt9Rcg0/U8GW9GqvtW0P28SpiBc2v5DsNojGl8uNyW4+jkIzfDmI0YT5ZQT42INhOeMkmnmIhFNloegZkU8DuqbDm1fOFAQiSUAXN47k23bJae+4qM3egq4KHOPLKczfeRqdtuBOtUoBd1TL3nBpATJn0w4aobyNB/HM5GR0HbujWOj93hV77Hhz/k2w4cq6jyRIx/KETt9CskxdQpOEcOGgPtjlP6kanXESLGa7BwnhQHQXpxZgFNLzJj+8wjySXazawE/Etpp0OxyDvDbzyTxoeP8Rulq3jdNv6VM+JAIPA6I2CK7aNyyO1bp34F7bjQ+Hl829RVgAVa+UjsC2JtgIpUDyJKi4HFbcZXAE93y2ZV/9E7UDX55pHtNG2rBE72XIeG/+Z5DPJSFioJer6Mj1RY+O2lZBHFhy3bSi0cVK2Y+UCZS8FpN23GLClBEOmtZvQQR/rnV5TeSGhEFjR15qOdcJzDCJE0zdyf0qpbQ+3VbyusnTdUE30VlxUQtY2CZbk09ctYbE3dmkR/DH8Q4t9A8ftT/M8gTZT6aeD7piTwP3AQ/E2I/96J1PihyQl+nqT4P0b8P2ngb52UwL+H4i9E/Ds18AdNSvBzHcUvQPxZavyyeWVVZAzl8B3poFdz+5+IIU67w188j7r0dFQDwWJDBcTesVZpykkyjgnmao7OEtIJhN1sM31uvqucDTR++4wcZlLzYKhvm2EC68wgtwuY+7sgSM+DuotYkF+5W5zEd1wDiXQBH97J533Gh9/kN8bAj++EsPwv8SIYXjl8ePtNt5TdXHZLlAcjIIRWN0sktmynuwgg+1sTE7qaZyeyT4ApUrruC5Cd6Wce4gymOD+nOF9DIY0DHPNIrrv+wVk2DKL4XmZfKKTTx1X6JLoEQUbyK98Rr+TbbjPpQqNBnfEZdzL08FwOR6PP7C8UnEMIgZizJtn/k+iNA3oWXWhMgl566x0mThz+nJURRH5UBCUndNL13hoWvzouRnXzfNutVl2oDMiHv6E9jOdXfgyjquNOEM4Fat8OzDYAuefsHA23vya00xSkQVNqfgk9nA8fILnVHSXSD+iBXbqHHlipvSJ3WG6KNsRQ3aXd9f0T1PcpHdF3lNpnCQxDKfL5ufSdo9L3H6HFc7lMPe9/fi59l813h8+QSENGBh/+AjjImGXlKqWyLxKu/zMyMupBnfUmFoAscuDZ+BE4rjQrUjsOjk+micv5DTH6G8k7dy0Noi5dyIhuK6ZQ4dsss5xHxCI+vM0TjvId/fnwYDSRkW+bbtXxbRtNfNs2k9v5Umj/rLwj7kiV7SS/8TCkXuW7YKjNICONxr4ZJPa5wyPowCj73mZHZ9fPpbc+pZPYk+irKJU7fByEKvBYOZDvNAnTJAIkzaImR6c057gssbhgVofNxkdKLcDyrJUHzO2PssHfAdTdYZDEAFnUSfPS76Hm207qQq4y81MG2+oMIGpDGLC6zZBB2GTssph/C2gR+oPpl/Yemq8Y3Nj3li5bXdw/wgcdu9GUD6AGw9tRg9hBeIbFEz7sCR+UHkJxaZ9dPwC/6QNrD8kHQOkYU8RLn6PXMXtfz4c/RaOfYJEw/DkmFHxH0OSBIRGG3DAsefKinjwJjWluH6tHbyzi3Nu3nESHdh4zrzqkI7rgw5BFQLIJaYaPMAFHJLNwh7dfE4EUFNRqmRVZROLcdj01VpHZ4+wyt/+SxJbKk+7IHBAEejzMh9/gN36S5na+7I7MspSaH9judv7b/MDGUtO/ze3P4tBo+9piXvVXMkju0jl2Ez8Mn+RfAU73Gdj8/HmZOVg1iCsz9x94MfxTPgiabYLRvSn0ER/+mm/78Awf6fs6YSVS3o/z6L7inW+K/fgOMHR/fjvREbjyl9CkSwzx4cN83tt822ET4w5cUwfOam6fh2yEP2VcvBLlN35gwJH1uTnYd4C5v2EAdN53IO17ZyjKhz/Dvj2RItL3tZG+RW7d+7zzDbGfu2MwdO3enk67th33hLvczo/FGSx+ZfErX8BI6If4NcbTUThr5QlxhLtjmjsy34K8G6Wnj7KohVll11GcLDabgP/QplkQ4kyYWf7kqOwkkM56wivkuQuXDSBbi4VMWjiaSSZIh1OZsHkN/3RiLG8zfz8dQ9nKE6FLyp7BxMblgPACRiaZES6a1jyHvu6J2L4goDdPy3mkJ/w1kweGdyf8bYJurzkJceQkcXPn5tCBaBtZfn0QjSIl2q5sPvNTGq8hU63P0YmZ8REPQQnc6xZwrFNu53viNL5jAAaTcTTeJ+vrahblV3+i0Nc/P6H6gtahTWQ2IGG09pN4GIX1GFTc2w1kf7KrPTmfmA+pq/kaK0cDzSnkNAiiZSi4HXATDBbGcPSdo2TGjfMNTLug3hO+d32s4DstmW8IKjAhmDBS/P5jsoAg3EvvQkXZ/c1HMUtX8T/H3XP+h/Wef4uS/xkfa/EfPaLgf7iK/198koL/H/I95/+mT3rNf8URBf9tR7T4z1Pyf/ORZP7RHt34//dMqzz9nq70dCxC/mHSEU3utoANBBiFTvgoagLp4miTyZ3uQmlgnMzqCNhM7o7hNhTIo8gveiBXS5dCrj92KeRCgnG5rutiQwKnwXaoRHHXqVs+AfLEru6BPLuPpJBn3IWQ5/HDCnneOawlzz2HFfKsP3wWecb3RB59KnluOXwB5NkTVciTpSnPk1GFPAeiTB7Su0Ke6+MRFWb+e46sJiEO5gPcM+CTMqIW3Fcw9snFmmgjszkPWZitlKQhEPWl/zohb63BDG3AGfpuE2deOTYND2dCMgeE7XQHRTxOtrT+NN3K0XXt/sM9XNdiVuF4xxMpbrscOdEhCyVk3wOPKvAo1xOptkSfwvU43/aNzrzyDBCBdMzFrS63VXvC+3C1tgC6z8fuUZPbDDmcVE1ZMLf/juQUsFwPWzB/qfA4PzS37yYzPAFU8+EKcrCg+wq+wkQVgykd31FCdFGLCuhYauInL7WY23+OhDoQB/JaPnz1ST68FCZeWIacBtwXdHQXyE5aZqWh+U78w0Bovy29LKGGRZCVTtwiir5VGvMF3Uyijd7Q0w5KiTAG0jkPzNghfZGGgSN4wPlKISnDdGCMu60ePG2kG6Y6d3zhEzoUd7Gj0uOHkHq5zc7SH6TapGdUnW+Z7w3rEbEWFNWRy+e95da9xztf4c1XvwKZHK/bxYdfFTOhL1g2YCvQPYj+jdm8SjhDpbGSDTnHbuk5Il4VnA8TUxJVv+0JfwIuJm08iCdvprqtiJacwciJ6QZPB84KNNQhc/s9cEJaD8jRpWfQ30keiEZf+Y65XQ+grj8m/L/OHPTYqs39eUt0LGYZ2LtVOnhc7grb4HUSWFlZwZHmsc3jyAymKM9Bsl/KdPWNtALraMiVE8/QPWG7tPpTqj8T+m4L5Pl9yZgyr/wV2vqeLTjmFDlWwnSiLm46UI73EEnfYXEBNv6f+LUBc/tcndLeVyUa8W07Y1KfQ3SB0pFGTlvporLoKub5ng6rtOhQfJ0zx922VYfrHLfuiDvvY1heeMIBG+9uO21eWovBKbwLjnWhUrq60SOI+DJZ3uhTLG9uttmjplOyLt6FqBj96ptYDH1vK12yoHEPHEAdDej6C/EHusRZdzDuDbBMrLR07YKV8TdXJHY3lo4kK+MFl0H8aAYC0q9IqvM2nLrtMnJq6ijc3pRWfYT993s+L7ErNJm2HY5tJ2Lnkan7LoXjyUhnDNCRNgKr0jMHiGqifz5IyycP0jXU1oN05R6PnvccwR1nRcBstz2uo3urGUTxC8iIycG1OW7HbujD1uQ7sQfnzTaTOJbvuI80UrjI5XriIkg7nuNiv7jDa/dExt08FTc/72iUNn+I43r0lGlW6NNxAqNnHfDQikuzjuJxADb3b7et1nGkfFCH1wlW4HUCeuGF1+0lV2T47e22FnbjiSc8URpOVGP8DXRDAnLkjlIcm+BanbkoI2kbMZ6eYiVzRIk5D/wQ/6nAf6ql4UTzxo8Jm80mGK0tFjaflCDfMJKqkU4r8RlgkF332tZOrlRw0sP7Y7ENedRmv7NSlU3cj47h4oheOeLvuTzGl20sQT/xAVrpE3KRZpNkQnTQecYGHdX5tnJbxuXSp6Cx5wkzkQDMSJ9BGzgBfAKTOXRxuoVsBeHchk5eTfq7lwwaDE8wmhd4nJ1LJvN5Oxy7HSegZ3e4U3LvJ53jrHvX/uTrZ+b2d9G9Loaeo7sPYPxyx5tK/QG5a5u8r03ibUcLxM+9HUutbf/SSbfD+WgR2zECZVZgo5uB664fSYNg6pIsH5KRHr3mAC2nH6C++jCU0WWssuQArqWS5n+YSwdNxozGHT5N93zQnR9Xu/OD1J3B8cjFJOm6fcTjdk5O9rhGYg/jPydTj2thHrc64XH0IhTzOCtafTHzOMijpD98QDymcHKyx1k9kZZcgD8wiXparif8DKGDfmZPuJ30hw9J+zsmxz1usexxuQmPK7c1op1bmK8RnUvjP6CXWv6+V+k+L+zD2kfbcF2LbegOPnEMXECjJ6Bf3KCjflGKfsGDX5i/fxqdKGFgO5Gs+B9OFnqlox+whKOLYwkHugnmGANtvPOwuf0EF885LHLOYUqVc7jDLg5W8MbTKDVomUgZ19Bg48doDVCPlc5aP91LdDTTSYIH0W8usSe5dki01NHvK6eVoxbC64fxa4fL38dFuYSx6kFlrAoFIE49rkueypIGhh06iH6juLDrlrcicWRMBc+WTgPxaCG52gTzsoXMyxlk35S6ez2efxon+Mv2opNviUY/oH79KStNH1L48x+QndKyeaDx+y8BR2erwRT7fKCJW4hXfYTrROjlEJmuii0lcnJ69b7E1udPqerjOerzJpqYSre/j5JdaQNDmtiMxYcxLuFWpguz38oUm5UQ+OWlqVUnDlNtBRYotwKTtqZffU+xNZ0OXXdtwc67/iRlvk+H/8Uf0LLwA7KK6Zbv33OkxaAa4ovJ1UDzU1fnQqJ8eTtIO8qATJ7hO+6y414wphsfQkLp2P0PPY3Jc4aDfiag6CQv6W+gy5LjZD53WYnK7sMUFAJwqSdSixmdiCNRxHxSxMuUJImFKTE6GGOFHP/wVAdZiBh/Nozayi5NPYw+ms2vfMHcfiNJbK/DqzN1E9iQ4iPTY7xuE/TKm3lYhvcvNz91pV5a9X7CfpgPQyyxlJmfe/05OiFs94RLpM/epVlaSbcUBlv9i8zeYMCOLJfjY35yhcncvkOXMKTH+RWuuv4tTX43kRBKDe/SPLIEF2WjSQ4ZGpGUP/Z9N27GvdJVUHG1f2xeOZnEUKa92aRry3OcgS7lhrzHosZJagF/sRxP/us9murhyTKyT1sKa4T9GBwgTWvbbIjcGztz5syXuy/dNboVfmI0vGnjYcvvW0Hl5vJNfKRSz5vL3w5v5Dbybe+kefL2Y/pWSpL1748iARwmXbKiMqCpnoL8fLUFBSzFM+7wLSZcSMGwJgqEkigQFq+YRJYS71lJyMyDtW+Ik0a8TfVTKl+9sOLVC6V+jryt0M/Id+L5fFw7dqKqEmk/nMP6ZnJLw3riyjCOikbTFfAx88rbabaNTq8IUYwe+EnAdjnZys0jEQqc89+4l50j/eMtupeds7KzzLx2azTzDNnEZOt1XCCkQYTqupTtZ4q4ksFl06fv0PS1FPXvDs+zhN9q+8bUfEnbfkMosPKF0Jy44qKbzsj7om4M/ZEWE6bFbYdgaWgJv+3u8AyEI4/lJJ93MtI3jc/btjGa9jn/mwQBXPNARj7QttpyYqNe/E2Z+e9Vfc/UhatMZ7oeLAOaYUtZR1XfUwA41fV9aTCZI/v9eUQiHx47kOTDfSHzkS4HiaVNZLbq16HAyUAcmAFL2ZX3vRcD8td7WBolrdvDLklsllZ+DXF6J7izdMdb7DSO/QXSfXtIaB2ew64YbIbhva8Ig2+a1PglzdNK8VYWnHlKyeoOXUmq/YjehzKF5qOni8gtI9lH6N015E6c2wEm3fw2zdNb3qXTwW/epfVnWTmfwRdD2fUGHnUwyBPvYj7G8iFjwfnnQ2VvknxoQ0HKfOiPBb3Mhx4iGjNeVpA6H2pznCMfeugt0v62gvPPh0buUeTZexR5doeOzjv3v6FMlB55s0eJ0rLuiRK+sEiRKGVQJ1ljlwPbtj0s5B3VSJQG684zUXqtIHWitKUgKVGqf4Mob4RdmSjlvpmcKO2yp0yUrns9daJkXkk22c6RLKVBJ9EvtZIlJyZLu6CD6PgYnbasyYuFcmwePJOUSB06k0ikbNj2QUyk3oYj6fX36CD4+1s0ezr0Fq1vY/XoW2wnVLlf+A2MCgm3fiLP2EpJ+YRtjXqU7NHjKPFAChExRgeQDSUEI74U/JDcPGZBly/Vxxd+PB5Kf8FxKV9tuhtRqvXyqGi30dV0O+kP6416MlFjqgVGx80OALYkAyPF0/JljxLfoJspcPYKnCbJcpylA+QWNOnD18i1cuZBdCZL9PiErVXPUoOXTGQXBUNB8XvjoANcPJa1TrHNM6/tdOu2SKZEX7We8GO2R3AARB4jt6jxkfW0DrGtGiMu9EDgZJMNb8OEmYht3dSY6FS3ADkDFrHNlXsJlybGpUXmsprYY73Noqfcknr4S9QKgqSq92lf1bIUZX1wk7aEM7fXk26eISoFa+C92Doyde/PUCZ+8y/C+4deY4nfyn+ze/seJsuDM3i4BnclI+1Mvk/YNrFJWh2lfT/CbGeRefg13v/YVpqjw30S3C7CDeMcPvwLW46e3omD6stF/g+8rdzxDGdiDwf5vPfx9i/pdyhLRwBPQrCqILdkPkaDbAfdV0DqJTA0WA2ynEb8pxpn1EbkaZe8N9jI5+3B1q10Q8Cc127rJFH2PrL34d54Kg0ZXEfIwEhd2Xm3tetaxfX6dLLNi1dgwyGTu+2IThyHucxmslWF6WZHyMRPDllCr5FoBnrbQUyxmSCHXsVsOp3tI5ikUx/SO1KL3pP3ZFFxYWIyiHqlJj5vF16ox1sQzKuuxLv9Om6F7k/qze0j0qlPNBJ7QE5/I2SHX+Imskk68Dm1FdkvCp+Ib+m/e4jaqpXZap/sm/hiJWIrcH3Uj0SieqNJeUWAxEJ8U5xU/BYVgOaAbxOLnPDkHSTmOkkGECSIZI8Yb8vEdhYdNRcpwVw8mGMtqWF3x6h9fkEOELCPbMvQE8joOh0lg9tDnrx95ry1tlKcZcLbzHm/sFkZGcwe3eSOQWq6S7p4dp8QtZu7bQtMGWi3T8BuOOCyjlC78ZDAmtxxu6FNLJnkLlWCDHYjG9ug0jVkCG5nk/QJKfwWvYW2DAOcfG+p7QP53uuhH8i2rniH2sTC7IU0DDbJ+RkF08y3yBa3lf0gtZVdl1ABsZXbkGyrpxW2qlDaClc0UvhNykAFsVV+epKtPBnUVhXEVl+kUSW3Mlu1MlstANM8xnzpMVu1jtjqCXKAgAodtVW1IgAgmUbZVo8RpRBb0SlFDpvUVrgqBGPldJWvSWWnfLRTzWFqpwVKO1XZyN0PizIUhtpNDEXiMWHjENroozepjX75NrURuZu4da9soyV76bws/ekt5TAcmEaHIVkdSmSGKuBXnjDf30jCF0Q8KGcB5v1BPY2xD+LsuJvvMPPOF++8LHqdHjVF7o9wbgK7ESzDm7xuB+/cvKIvH4Z12SYd7/wstBeXwKunA1tPk9C/cd9VFMv8y05ct5O4nvciJqL88/IzSO74dKpcv7QM5Z1bxQbMU57GVmOHQy+dEPLfWXYQxGoxe6DbvI288xXzfW8QA/fV886vzO3k/rS2KPDzL97s+RSvW85CUjzfdljHT15LxDVH2ohz3Edk5dOGv9LVgdfXgfBg/h/x6Z3RX4K4ul28cxtQPAZLDA9MqNKXL5H9+VI8nvwSXQjsZ16aK731pnwn9dE9eC4mLYUSN96fIdkHJF5TWOI1hy4B0TTKxCuRZVAV/qqT7DHhzdqYGlroRJhD0pJhMOO1PkNmRZgrX1dMt8QFvtbTOXrgi+h+7WSyIlFMn7iRnO9Ya7Pq6X63VZHTYApkfop2tJqmQdi0gsSPtaykIVgqepOOdaSPfMo5kTQME7/mk6CA3Y4XonthNQzFHvJ8QL+RWbCWO0MvAHVkkiXc8Uy8/gHMShdBliLdCa2lHa/KK7r3d7IV3Vbpr3jhZs4uOO0EDUhr8Z8/Y+r40IuE9v5+iTsWJ5oI7S1I+52d5LTBnLhs00nuj5/6azz9zM748pAOQOlWgIC2O/XsisDTcQ1tdUdwJx4jG1ENzYpmkQS40YTLybZtA6XDLybljWMpBZgBLzKvmgb8bRhAudiRSbOuh17A9pTWEGKdCrx2hqfufoGsQ0w2OWuc9hK9SO3HNYg74rHRRchaypBzJ4x6ecd2LZGArkXWUhZw+REhCxTWQCFdQmLVmoU9/SCHSaoCsjZ5hXBnfHS0lQRoXE1D2joZLzbCJE8cLXInyZjIMXSGczRZTQ9+gw6iT14jJP5MSHxJ2r9DQIPWk8mp+JLR9BkGI3qIZTcZhsvButJrO8jSYj3h2ty/0RIdhEuSZ1+Bf/jddK295eXk8jVWXvEvWk5i5QxW7mDl7aycB2V0O6tEVEjjWdnBymWsfIWVU1i5npUX/Yvc5wPSei+z0tt0wxl8x908LAAXUIW27iDacIwii70SvIM+OuUF5e39dWvg/KVa7Utp+08vjbeXTu+gu4H4wONNUWGHkhjNM+L30ylWVng3Ot5d9zviAOP5jpkW7I/egsk7jzUNSWwLkwiWIOrpuNvkiRSR2+1mhU/jJdyVJ8QbcC57ZTs6ehYksW7nUTHHEz5Mr1LROzY/3yHfsbnyBbqTeft2dJLLZuk+mqU77gnfBq5UY1F1DPNv1OU40PUn8At8cYf0zLZkfZVd7w6/yYc/Q9nIdoo7fJw+s8J3zCF3XYd38HmHefn20lNkcE7h3Nu30dtLT5pXPc2xtQsZO8hs+na6tWahHIc3u3Xb3B0Z7vC/PRHPANOsPBDKMODaiMFJVhxu5xFz+0NkZOJehQe39ZCQRTq9nUpt8eAGn9v5kjjNE/4alhIeUEDFNhztH4fG4tLAQm6QtMwKh+i9kWV4F7/q7kj0LxgsJdCu68U6lX3BR8zfL4Yjl+OE4x2SW7lx3/Aiuu/nfCm0sutHa56n90sWnSb3S6bHkh2Grr9Bo+gonsjoCSPxHubIuGlQVpbhQwuQqH1E7gjfeDpNErYQAUSr4524f6B0J8rDR8tiA9+FRQZM3u+FDtN7wRNWTfT5+WZ2Tzp7qlfH3j4wfnGw3je+wX+rf3y9v8FfE2yo9RaO9zUsaR7vFWuCtb4mfKPw+MZl4uJgQ2F+yfhmv+gb1+ituc27yNdM4E3eBnbeXzM+JPoDzeObF3ubfLVCk68uf3Fj47fRT7DR1+QVg03C+ObQQrkTfBYcfgutU6z2POtV1lyvdcpUa7NYO2lSQ6je1+SvEQL+er/YPKXWVxPAtxrmLsybNmlSvbclN8861rowzzrJmtsDfH8DxUfy3jz4WceMsY4KLvE11QWCS601i301t43ivl25vbW13eSeNrU3go87T8HH9UDwCy038tAMTZpFKrTyZVmTJilfH2htCAUC1oagaF3iDfhrmX5GN0+yCkJjsNmau3Sxv2ax1d9sHb08lGedZhUX+5vHTWv2L/eBbMlnOc7fQKhYA8BekzdgrQs2WQPBhkWAutQvLrbia9esDvsk+d0EF1puf0NNIFTrY/IDsaYm7zKF3e1oCT9awQ9eTyy4yCdOsU/LFWAQNvrkdyDU++opbgPiNgBurVf0ymJz1j7wf79MlVphaMGhCqisce7xc6zUJf3BBiv8T974VWut8wd8XNNY7mooiS3wRWNEeU0+by22TCZK36LHzQiGArUNl8vo2JgbX+tbMh4E8zdwS3w14PqTJrF3K57tPeqy31phXBDXsN7hbQg2LKsPhprvnDRJ1u+kSUSx4PZUs1OqrrQ2Vk67Ig+dIm/ctPNpNGlSnbdZzPXDoDi/ZvKYvumWXHQtq79BzLNSpsdYbyJuVmWdapXPTYZWUD17H6QH8lLAKXK7K62OK8/RSgw1BnwCjOZmMOe0ydb/u1pMiDzmFrV95TNaDMXjJKiitjY3oYO4hs/+Hv7zoA+j5PzpV12hRZnMoEA1PoVOqVL4yLhpubJvJDzj7Ppt8i4VqIZl3qbdwp29CcZZ0i1072vyNdT4rD1skNKXU/nweTOQ7A1VY3qnvytSqI9ETRpbFIOFQNl7fBUnplmn3XKh7dcLBr61/s9uF4jX3Rg7ZwumsmT/v9D2Y6/RTJ6fpuAbNLt3foH7P7sCBJzGbvlWx38vFHDFbEeBMNMzZ3qZRxBmC44SmYFiwrajcDpMHS75ramu823vPEvTnvVfKXpxYqh14Qtkz7t/xwRXwxJ/U7Ch3tcgpiJxrvb2+d5AyKfR+bnbT3TPSbTVDUub3Kmj7/nb8lQs1heWXsf/EYsV4Rs2N8Ri+wyQv0NZbeS4q6AcbuK4VVBuwQvv/wR4JsfdCOXTUN4PZVUfjst/JhbrhHI1lLl9OW7gc7HYWihtUJZCuRbKJ6DcAuW70Pf652MxD/bXGYvhnmc5lO1QilDihu5jUOI3IV6DEreCDBtjsdegLIISt1lroTwFZdUmoJPGce1QVkO5Hsq1UBo2Qzsoq6A8gnAoc0Cu41AWQWnDJSyUIpSNUFZtjcVO4q09sMbG92gMfAHkhXI9lPjiOnEn9ANl0YvAH5THoTwA5ZaXYjFrBsj3cix2M5S1/4LzUD72aixWAfqqfQPkhbL8LaAL+qp6OxbbBaW4NxYLgL7WfhiLPZYF8KPAF+CthXIPwA9AeRzKLcdisQVwfuBnwA/orx3Kvv0S74TTLZ/L6VosumF9M0xrdBmWgew9bPvADsr3h6XGp+9CQ/x162MxOz6Dnm25OjvnGnPWUlMrd9XQyVcU2kbJ7fF9hU//PRZTvq8Pr0nfjO85ezYWI+8hLMu2tOn1pdkmeg5v/FgL56bFz63AU/SdrEgPzpH3tJVnWxD2OPy9poLhJ6WOqWB4HbXvc8mwA7juVMHwXrZyBcyD7UDuaoDhTR/c9GxLRD89O+e+tLJs6ypDWXZum7E8u1T/SJ/s3PJsa1l2DmBMzza5ssoBUqaAlGUxOW7GvZXnk/vFS07DFbD496mWV3iIBTIefnaglRsm2yGXvZcuB9rgeyQNd2cSfa3SQ39tacBJS3YO1MtAe4i7C9pMAVw302sCb1kfGREZRFzcPa8G3OvIC+ziuDOzrU0yavnmbdReuO+/FnAL4vYKxO1VDueeVsiE/OK1gdcYz1r8lrIXap4CvL0o2+9MRO/366/JzomkTc+23od6X2W8Ntvelq5/gup5epKec7vr784Bcf1hu1XG+wyRtPv11FdxW33432Ix5NFAX45C3i+Ht0dVQUzBGxsMdpPS/tei/d2y/SPdrW3rzsNXFyV4KG0zrjLclxbRD2Tv6OuEMYUvSDPspm88xeeJVsMYOwD9/15Pfe+Held2zv1prmxrxDA9O/c+Y1m2fVV6WXZJW8bM7Oq0fvo+2SUAAvVMV6hkeha+4/Q1vCwI8ewB5sf3oxxKfZahXiq6qRP5sECsewLaro+3dcfblsfbVtFBEG/LZ+nrVRD0f6Bl3XJhaD0OtNZeAFqon+NAywRxfWMKWkQ/5UjrFqDlVrS8hujWDrH/F71sG4C29m3n3xa/BZMLPG+BtlOAhuFRI/OR6egj01P4yDXZnbo0MS2lk5Bxc2V3n3VZEj7bqWvLWJV+nzFiuD/th3oW5/F9jsP+EovNRN+9yhiP8+Uw3+UcgnmKODPGhkUkNuC8gDmDB+bEv+FcPcB4Fn+cmb0vTX9zH8Ku0i9dWSnG+M/NCV73pSkGuTzGNzwZiy1HPl81xL+ng/pvhfn4PeTlRYNSh27UoSuuw3I6zvalpRXrz0uHumS+UuvwQeDtRuSt1hCPPybMGf4di2Vg/KkysPjjxvhTnjT/rOsef5BuOzR56ElqA8OohMzVQHfFrlhsBPrNRYZz+c3M7HWZaV+klpnXkLlfdkLmdZkaMhcAb3j/koG+0Ibwhu8G416PxYZhXvZ0Wo/sMfcs9sC+1uK9H7J+I2lxH5XAIdcfYPMR8VGR+CheIjbghWE49xq5YHFW/ZRnV9SkZODaLH2tRkgm8R3f+In3FE/XyfGdj/dB5CxX9FGt35GSVnkW0RvmgxLkj89C3md4Un/uWPBIetrfTOflx86+CZs+kq5h0wXrYrH70F/X0Ws0SGcX8PYu6P9W1Osf9Mlzf6m+SpmEWLv3uzFLOW+mrSJzJo7/FqCJuYZhoT6etz4DefA+gOezvON6sCjGnNfwfjbQtY/jlLpJzKU86oZH3czKLm1KpReS1wwH5TQCHeX7r2MxHf4Z625/kxwYRhoJMH2HrrBVTyAXUcglHii3pr2se6IP95N042N9uIczjev7cB9l2gGCiJeOIYj2vTrjI0Zun974JyN3XH/t40buxwbjg0bulwbjGiO3kxwfNhgBHiPH0KZvHq7BjOVciHY25Ec648tG7j69cauRe1RvfNbIdel36F8nyIZLphKkPkVG4P5W45eU8/G0afFzOuOBTO7nemN7H25TmvG+PlzEaDyVyR1ONx7P5A6ajD8lrN/fh/t7pvFIJrc3kzY0DsNnK+BgNHTekY6df2Pk/qk3PpDOtaeF9W3p3HYjVg4ZjXCMXRZeThrcjaqJ6ow7crh39MY9OVxbmjEyhPujwbgvh9tsMP5pCPeYcYvudA73Zobxb0O4oxnGL3K4V00v634zhLs3yyjlcA9nGVcO4WJZO3W7crjjlv4/GcL97iLjsRzu5ADjL4dwvx5U0ZnDPXKxcV0Ot/Vi4+M53ImLjU/ncN/PMQIcWMheACwsM+7Qc8d0VBwT6mOicSFhNMvI/e/vf38X7id/N0T+Toj98v/Vyf8PP/k7Luqf/B0X+XsenOp7LfL3PDjVd1lyVfBqDbj8nZVSFVzuT/5+Smdhav7k74DI30epLtbwW5l+YfL3TrR+Oo3yblNy/ResLn+DoZG99F/+9kLVjbSUv/0hf4dnmOJ7opziWwTyd3fk/RR5L+qLM7EgeY89m8TluN7JPiIhf3tCYuflb0hsYOezFPtZnOrbCpziGxhW9h0EOVdYZ0jeX5O/bSJ/a6FzSDJ838Bkvvex9pmq/keo5PsmRuXTMdAZVrcMlPMVWpf5PMbqy9lHJb5i9ZxvaXzI3zlX/37LBHmKldtY+QYrD7LyBCvTR9JyMCvHsHICK69m5XxW1rFyCStXsfKnrPwtK59i5TZWvsHKg6w8wcp0JsZgVo5h5QRWXs3K+aysY+USVq5i5U9Z+VtWPsXKbax8g5UHWXmClensIxeDWTmGlRNYeTUr57OyjpVLWLmKlT9l5W9Z+dSlF8bO8e8dsd/MGTMmWXPnLQw1iCFrSX5Rvn2cI0RqjrscJfn2ojwK7Qlt/L5YiT4VXM9VpYSncWJKuCEeB5Lhxvj4T4anx+NEMjwjPn6S4ab4uEuGZ8bHdzK8TzwOJMOz4vEwGd6XW5MS3o/rvDQVPJvblRJujsfXZLiFq04J78+9tCgV/CJujT8VfAB3TEwFHxiP48nwQfH4nQxPfG85GX5xyriSBlFMjsPJcFByayp44rvKyfBhKec1A/dprJvfk5ifzbWyfE7+5tJSDfhBBt/F4PI3nfD73qngdzG4hW2Cyd+uOUFurbZw+9jdRUEGD+kpfqkKf6ee4lcz/NsZfEwaxW9U4f8qjdFnN6Y1MPglBor/iAr/XgPFtzL8Jxn8E4a/S4U/w0jxH6lh+QGD/5eR4ssfxZHxjzN8K8O/S/7uTjrFtzP8owz+fDrj38ueRWHwURmp8X/E4NYrkvvdmkHptDI68je7TCaKX6HCn2JifKrw72b4rQxf/ibYKwy+i8Hd8nXbTMYPu1h3nZz3MXgrg8vfQNupAT/O4J1jk/m8og/zh4VMXwze0IfiHxubzOdGBi9lm0V7GXx2FuOfxRn5WsgBBreyjw+ZWOJ3fV8KP35pcj70at/U+Ff3Y/ZiH137PYvTOxh8H5tBHmB0xmYzPbC8dj2D35yN8g7mVrN8Vt5T/qEGfieDy3m0DD+uAc81M78tTIbP04Dfy+Byfr6RwZ9icDnPluH7GVzO02X4QAvTD/vo3RSW4N7J4FnsI1gzGf5RBm9kH1v6G9Pn0P4UPpfhL5fty+B2FpDeY/gPM/hLDF+eNj7VwJ92EYtjzKEymH3vZ/AxzDHl5cUhBreywDmCyTVmALXjHpUd5zK4vF6R89m7BlA6NzL6j8jv+2L461R0TjD4AhWdMQOZ3Zkih7GE+nYG//qyZD1sZfDqa2j9WbbQGTeIjrtSgY1/podHB1H8KjaA7mPwAYOZn49OXvdcyuDyfoL8TcLiwUh/KOe4x5q03iofTOWS14eyXEsHszjA1qVyQvYHhm9R6WEPw5fXt/K9BOkXU/xcFb7zYhaHVfQDDL9Uhf8ow5fXw/LydQ+Dy+th+ZtmphzGD4PLtzMW5aSer6/KYeNuTDK8jMGPqeBVDK7er7k1h+rZrtLzMgLvns88wug0qug8QfC750Va/L9I8C/ijqTIr1Lhv0UU2z1/O0LodM+jvsihq1Y1/+lDKFzN55AhSKd73jV+SPL3DOXf9CH4vb5EXie3CmngbxuCPj+Ey1HlaS8PQakGx7+zKev/kAadjKH4PcBsbt31tP6aPK6HpsbHL4ZZU+SNd2jgPzwU+Unkz/I3MP+ggb9raPL3CeN20cDHlDQV3D4Y4eC3LD7cKs8LGvg3a8Dv0YA/oQHXDwd59UO6rfvMw1PjO4ZTu8vfP5Xzsds08FchPtC3qL6r+6gG/ksa8LTRCO++3vlYAx8/SpkKPlQDnq8Bn38JlVf+rmuFHPes1F5rxiTHz99q0NmgAX9ZA75fA545gvIjf09WttoNI1LjXzwK4d3XoaER1O7q8XiPBp33NeDFI1PDeQ34jSNxfCXWaxY24G8fmfw91fj+kgadDSNpHFizgMUjRmegNTU+7uNYUsQBHYlLQ7mSe5LhzVZK33p9cj6zToP+Fg34h1ZKX63nTzTwL700NfxODfijGvBvNOD9RlG/3XcDrcsPtVwyKjV+vQa8VQP+vgZ86mWp4XMvS63nH2rgr9OA481qqeA3aMBvtyV/h1b+RTTwf6MB/8pG9VnB4pK8/ZQ5OjX+FRpw9+jU/r9odGo+l2jA12jQ/9toGjeqVXnjHgaXvzctx3PbmNR0XGOovaqvT15X3quB/4gGnKtx5Nc0NnLCjZo3NpMb0x32xI3p7tmV4kR227mjQHnbubumUnQ48N5zQWzy+sVmd42r0gv/wG9GgfsaKMob51QJ30V3jt52VylOoM9EuANALPAfsZ6Cloqva79lPTSKriX5/uYmb35xSX6jt0nML3ZCv99Nxy6HUxAq5rqqqm4Qrp43e0aVe85s4fzFtgv07vpi8kyFy1Xrk2WaYKcyTXCcv0ypqF4ghnuhLoVMBUymwu/EThdM7ISvJ3RbCP1jT5XFQpIvTpjAZJx4vjL2rJcLLJA8eBMCTJxIBZhY0nsBlFS/JYYTXjXRSRkusf/nDJ/dZc7+gAx76tMdmF3pEBz2xPOq7oCn3uEi0MKk51HZ5DEXTxXhA4LIwxKXiwbQXg56Z/zpyB6Y4FuRyKElkVZ3zvizp4XNoYWuQIAZlA6hnjY6bykVFLy1tYluS3rYLW10/srtScieWOtvbgw2x53cWdRbiip/6Ea4+DtIWdSdOgqLz+l9RaiI8gLXkh5iOnqCyVzS3+JixnYUF53N2t2bXQhzd4873RRUUtxbklqTB6Z6c8FEE/wNftHvDfiX+5oEIhg9TxM31r29MJ88ktnYFGzMLygo+n+KGagFauGg+DvK7edWXFvzXeb3qi5lcSd8R2sLtbgKa551lMQtXAgWdEwUZgEb5Jlqwd/Q7GsS3deQM64ls2EELWoIEd6AxYZgU703IJDXkWAvFYBGvOA/WpVoeV73UDTxnGFD+ewsi0hV88/zcePz6qMnsUzVQ48ipbpNT/qRH/ztUQdx5N5IYD+fDnqCnKTTszcoWRjyB0RwVPSW4ubGgF90zb1W5UQIKBScDcEGn4BQmERYtLYrI5Sj8DvrSI4NE8+aT8cJ1ywJUC30EFUmX9ITgZzxp/+xvbuswClAHOkm2VmH9PkTk1l09orqhPNnMaXvYsxmPELYYnwlpqzCC02PSV1o71lyVILvKAr4G9CRlP7j6EEkSzz4D7junuP+J2zJ4vWEv+QXG5ybRzX++TqNyltcLphXeunVWqRk8QvkoSqwt2gJNY6iei++QasnczH17CIEuKsEl8PR5GsOBUQaUeZUTmT5VYGdbVXM/TZWg2fPmb8L4WRtFnJIXa5BSiv3AMtHwS3gSWCpUvSUCII/iIlpT7yp+zxfVXn+Tdw9f/nIuTtwnhftbi8m6YkE3Zu4z//1JT3oqHet1BGhsqdRq6ZJbBZDdXX5NVytr8m3CBYksC4R64WaAEzFzZwg1AaFRYHgQshXayHLbBa8oRauJlgPTi/6avMnOp0TUyPBsr7BT5fhAsjStIyra/LW+4TaUH39MmiiqAnoekmognD13LJZLsE1uxyHjTBz9jzBxTMgXz6XE8pvmF02yz0DziU1rk0GNIuw5I37/Zyrr650VQlVZdM9LoGrE32BQGnpTI97+gyhIL8gv5jE3krRSdcO/mBzqoWDizVZsEAozC+iy4X4soM1DdJ1B/zr89Zrrz4wZ0yiBjMBJ/jwrX5kXE5sCEKcCC5N0WMJcEdC0YwCFY3kBQxbbk9kr9tz1asY7uE6yQlrG/p+Pxesleq7M53EU3l3ntxzBPL+PyHU7KslwuFCiEgHTWoFsmxSNwIevehGZLWcbClgOOBrSIbV++pr6hvVFq0Ui4DtQEpT4oK8MGEyNBa4h11wVU4QUvHCXpjlE3xyvCktBYyy6W7BkV9IOiuwy2IBf4vExYIPBxoo7Wxucz5WaG72L2qAlK2ySOhuBqG2OSgshkgV8EEXtYGKJYAoOpkfCaKaCXR3R3G8d1DAwlBdT7we+YAVrlDn9avGUPn1+fjOWFjwtrQIjTAtBtF+4jJhiZ3a3RlXUHARdKuhH2r7Jp+WrtHYjcsSXTviNhJ9LX5R7QWoiu4WCKJG2Vo9gO4QrFIp1UnzsV4PcVc3G9WR12uq+WtYWq9mD1muV8pMmJmNLtsUahD9ED198sqzm12rLiTLAsbRmtuEmsW3qQyOSq+aNUOO02jeCYI8lmTNnu/Iq7gWloKB7nboxYiBWVDxWllXfU13c+BrSpOtgV6XIorUBEMpxs9sh53w5F3oX+LAwd/sh7kTRgfJy0AFdUFXsuOSIKKm3z1kp9xPCvRkNykAeWnSbtY5JrQinDBdFakjAZBSj0ycn+SZNckoxUqjaAQSNvPh1grgicFAKk1glKUb3Oq+F4Ji5a4h2BbJsQRsIwTrBEiqF/mEunoRAspyla3JyvHaXvhQIUxBtTAPNTVjH2QCPNcMWOQGlc5wpJyaz7t/O3GExoC3Bubv+pTzb50vWKdSpBDwL6wRappDAkvse9F1Im3o3uMin9icwnaq4AQ6wK2d89+YTaXg3hhvAjEeDEgRBspZ7AfzSX1wiS+FRL1xb7IZmGIGVKULvZJoosIdzypST8Z+cU3A521ywZkCwQ3OC38izKCpJmOWiioFcFfNEhLLBpgIcNFQ5V2I2ce8hqXI51xYpNYjvRkzgJa994lPDcQk0eeam0rQhK/jooMJ7lNuFKsFIg1IICHL4G7LALeSgLrxovpgA2ssUCWkVgGxb4JM0dLFXjHFXO3uNmpSTDO98sNUowgyjbPnhL10ebbbHI/eGtEvOUR2D/FcfvOyetG7EEqYHki5WD7yN4CKG7l8YN2XD044TvQuYjWYD/Nxz6l2nL+WI7XF3ubFXH7tsgagR0uxiZ5hezVJFQHONfkCXkRkR40BEbuE2ImH+YuCcAC5JfxLnCy/KUgWavm+xWwtu7i2KVED6jU1LHcVROIP+YmFKaUhHyMd7BNIEk699f4aCuXyYcLj8mG9jfsBF+i582HsmQD5vkr5+WG5HK7x3gL5dxl7Nl9uLz9nLJfWbs9eqO53V7WXn0eWS9s52uN7jE7EYkG5vfzcslzK95MbVe8DkH+z2bsL9Kr3G8jlnvTE+w90ivby/Z3z2TsD9Kr3Jcjlhsyz6+977N0Dcnv5eWm5/LGKf72qvI29y0Cuy89Vy+UuLsF/Wgr5lzOd6lXvV4iXhtT6k+VvZ+2nq97XIJfrFO1zUrS/n+kkXfV+C7m8+Bz2D6vay899y6U9TXUfs6pcq2ovPx8ul6YUzzEry1+q2svPd8rlvSWp+5d//61qLz9/IZeZ55D/96rxKz9XI5f+fsn46vH4pKq9/PyTXG7Rnb3/51Xt5efc5bI6K7X+5N8Lqvby8/By2aU7+/h5B/6yFe/tkJ+7yl2WWt9q+x3CZ3EU7eXnuUqW9cz+nzOe5Pby81qlrP0u/dntj43TFe3l58wsK1hdnxi/yn5lOg+q+pefL7OyB7/36c7Of6YuuX38+Y3W5HGqZT8ze6FKvH/WPkdurzu7/w1k/atfcCG3z9OYf5SlPtXzMax97sD440rkWXh1/MlUyq74Na5lz6eOObv/9ddoX/xP1u85/Pf/ADu6WgIYxAAA'
bin = gzip.decompress(base64.b64decode(gz))
with open(pymain, "wb") as f:
f.write(bin)
os.chmod(pymain, 0o775)
| 0 | null | 58,805,677,057,590 | 251 | 117 |
import sys
N = int(sys.stdin.readline().rstrip())
A = list(map(int, sys.stdin.readline().rstrip().split()))
mod = 10**9 + 7
ans = 1
cnt = [0] * N
for a in A:
if a > 0:
ans *= (cnt[a - 1] - cnt[a])
cnt[a] += 1
ans %= mod
for i in range(cnt[0]):
ans *= 3 - i
print(ans % mod) | N = int(input())
A = list(map(int, input().split()))
mod = 10**9+7
color = [0]*3
ans = 1
for i in range(N):
if A[i] not in color:
ans = 0
break
ind = color.index(A[i])
ans *= len([c for c in color if c == A[i]])
ans %= mod
color[ind] += 1
#ans = rec(color,0)
print(ans) | 1 | 130,308,223,581,990 | null | 268 | 268 |
A, B, K = map(int, input().split())
if A <= K:
B -= K - A
if B < 0:
B = 0
A = 0
else:
A -= K
print(A, B)
| a, b, k = map(int, input().split())
if k <= a:
a -= k
elif a < k <= a + b:
temp = a
a = 0
b -= k - temp
else:
a = 0
b = 0
print('{} {}'.format(a, b)) | 1 | 104,224,924,008,128 | null | 249 | 249 |
def bubbleSort( cards ):
n = len( cards )
for i in range( 0, n ):
for j in range( n-1 , i, -1 ):
if int( cards[j][1] ) < int( cards[ j-1 ][1] ):
cards[j], cards[ j-1 ] = cards[ j-1 ], cards[j]
print( " ".join( map( str, cards ) ) )
def selectionSort( cards ):
n = len( cards )
for i in range( 0, n ):
mini = i
for j in range( i , n ):
if int( cards[j][1] ) < int( cards[ mini ][1] ):
mini = j
if mini != i:
cards[i], cards[ mini ] = cards[ mini ], cards[i]
print( " ".join( map( str, cards ) ) )
n = int( raw_input( ) )
cards = raw_input( ).split( " " )
cards2 = list( cards )
bubbleSort( cards )
print( "Stable" )
selectionSort( cards2 )
if cards2 == cards:
print( "Stable" )
else:
print( "Not stable" ) | n=int(input())
r=input().split()
def BubbleSort(c, n):
for i in range(n):
for j in range(n-1, i, -1):
if int(c[j][-1]) < int(c[j-1][-1]):
c[j], c[j-1]=c[j-1],c[j]
return c
def SelectionSort(c, n):
for i in range(n):
m=i
for j in range(i, n):
if int(c[j][-1]) < int(c[m][-1]):
m=j
c[i],c[m]=c[m],c[i]
return c
l=list(r)
a=BubbleSort(l, n)
print(*a)
print('Stable')
l=list(r)
b=SelectionSort(l, n)
print(*b)
if a==b:
print('Stable')
else:
print('Not stable')
| 1 | 23,818,731,800 | null | 16 | 16 |
S = input()
Q = int(input())
rev = False
l, r = "", ""
for _ in range(Q):
query = input()
if query[0] == "1":
rev = not rev
else:
T, F, C = query.split()
if F == "1":
if rev:
r += C
else:
l = C + l
else:
if rev:
l = C + l
else:
r += C
res = l + S + r
if rev:
res = res[::-1]
print(res) | ini = lambda : int(input())
inm = lambda : map(int,input().split())
inl = lambda : list(map(int,input().split()))
gcd = lambda x,y : gcd(y,x%y) if x%y else y
def factorization(n):
arr = []
temp = n
for i in range(2, int(-(-n**0.5//1))+1):
if temp%i==0:
cnt=0
while temp%i==0:
cnt+=1
temp //= i
arr.append([i, cnt])
if temp!=1:
arr.append([temp, 1])
if arr==[]:
arr.append([n, 1])
return arr
def make_divisors(n):
divisors = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n//i)
divisors.sort()
return divisors
#maincode-------------------------------------------------
s = input()
q = ini()
mae = ''
bac = s
for i in range(q):
a = input()
if a[0] == '1':
temp = mae
mae = bac
bac = temp
else:
if a[2] == '1':
mae = mae + a[4]
else:
bac = bac + a[4]
mae = mae[::-1]
print(mae + bac) | 1 | 57,347,379,737,340 | null | 204 | 204 |
import sys
s = sys.stdin.readline()
print(s.swapcase(),end='')
| S = input()
S = str.swapcase(S)
print(S)
| 1 | 1,490,815,688,452 | null | 61 | 61 |
#import sys
#import numpy as np
import math
#from fractions import Fraction
import itertools
from collections import deque
from collections import Counter
#import heapq
#from fractions import gcd
#input=sys.stdin.readline
import bisect
n=input()
l=len(n)
ans=0
d=[(0,0)]*l
d[0]=min(int(n[0]),10-int(n[0])+1),min(int(n[0])+1,10-int(n[0]))
for i in range(1,l):
ori=min(int(n[i])+d[i-1][0],10-int(n[i])+d[i-1][1])
ori_1=min(int(n[i])+1+d[i-1][0],10-int(n[i])-1+d[i-1][1])
d[i]=ori,ori_1
print(d[l-1][0]) | INT = lambda: int(input())
INTM = lambda: map(int,input().split())
STRM = lambda: map(str,input().split())
STR = lambda: str(input())
LIST = lambda: list(map(int,input().split()))
LISTS = lambda: list(map(str,input().split()))
from collections import deque
class Graph():
def __init__(self, v):
from heapq import heappop, heappush
self.v = v
self.graph = [[] for _ in range(v)]
self.INF = 10 ** 9
def addEdge(self, start, end, edge):
self.graph[start].append((end, edge))
self.graph[end].append((start, edge))
def do():
n=INT()
g=Graph(n)
for i in range(n-1):
a,b=INTM()
a-=1
b-=1
g.addEdge(a,b,i)
que=deque()
check=[True]*n
clrs=[0]*(n-1)
que.append([0,0])
check[0]=False
while que:
clr=1
now,clr_f=que.popleft()
if clr_f==1:
clr=2
for next,i in g.graph[now]:
if check[next]:
check[next]=False
que.append([next,clr])
clrs[i]=clr
clr+=1
if clr==clr_f:
clr+=1
print(max(clrs))
for i in range(n-1):
print(clrs[i])
if __name__=='__main__':
do() | 0 | null | 103,300,020,083,768 | 219 | 272 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.