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
|
|---|---|---|---|---|---|---|
import fractions
while True:
try:
a,b = map(int,input().split())
except:
break
print(fractions.gcd(a,b),a*b // fractions.gcd(a,b))
| import sys
def gcm(a,b):
return gcm(b,a%b) if b else a
for s in sys.stdin:
a,b=map(int,s.split())
c=gcm(a,b)
print c,a/c*b | 1 | 631,839,680 | null | 5 | 5 |
N = int(input())
print((1000 - N % 1000)%1000)
| n = int(input())
if n % 1000 == 0:
if n > 1000:
print(0)
else:
print(1000 - n)
else:
k = n % 1000
print(1000 - k) | 1 | 8,495,390,873,860 | null | 108 | 108 |
n,m=map(int,input().split());print('YNeos'[n!=m::2]) | print((lambda x:'Yes' if x[0] == x[1] else 'No')(input().split())) | 1 | 83,084,581,618,698 | null | 231 | 231 |
from fractions import gcd
from functools import reduce
import sys
def lcm_base(x, y):
return (x * y) // gcd(x, y)
def lcm_list(numbers):
return reduce(lcm_base, numbers, 1)
# def lcm_list(numbers, maxvalue):
# first = 1
# second = 1
# for i in numbers:
# second = i
# lcm_result = lcm_base(first, second)
# if lcm_result > maxvalue:
# return -1
# first = lcm_result
# return lcm_result
n, m = map(int, input().split())
A = list(map(int, input().split()))
max_value = 2 * m
try:
lcm = lcm_list(A)
except:
print("0")
sys.exit(0)
if lcm > max_value:
print("0")
sys.exit(0)
if lcm == -1:
print("0")
sys.exit(0)
if any((lcm / a) % 2 != 1 for a in A):
print("0")
sys.exit(0)
max_product = max_value // lcm
print((max_product + 1) // 2)
| n = int(input())
k = input()
a = k.count("R")
b = k[:a].count("W")
print(b) | 0 | null | 54,150,133,566,368 | 247 | 98 |
n = int(input())
from decimal import Decimal
def calc(n):
for i in range(60000):
if int(Decimal(i) * Decimal('1.08')) == n:
return i
return ':('
print(calc(n)) | K = int(input())
A, B = map(int, input().split())
ans = "NG"
for i in range(A, B + 1):
if i % K == 0:
ans = "OK"
break
print(ans) | 0 | null | 76,077,929,675,426 | 265 | 158 |
n = int(input())
print(max((n - 1)// 2, 0)) | d = int(input())
c = list(map(int,input().split()))
s = [list(map(int,input().split())) for i in range(d)]
t = [int(input()) for i in range(d)]
def calc_score(day, contest, score, last):
last[contest] = day + 1
contest_score = s[day][contest]
score += contest_score
dis = 0
for i in range(26):
dis += c[i] * ((day + 1) - last[i])
score -= dis
return score, last
score = 0
last = [0 for i in range(26)]
for day in range(d):
contest = t[day]
contest -= 1
score, last = calc_score(day, contest, score, last)
print(score) | 0 | null | 81,645,034,693,430 | 283 | 114 |
import re
S = input()
print(re.sub('[a-z]', 'x',S)) | print('x' * len(input()))
| 1 | 73,073,530,181,860 | null | 221 | 221 |
n, x, m = map(int, input().split())
P = [] # value of pre & cycle
sum_p = 0 # sum of pre + cycle
X = [-1] * m # for cycle check
for i in range(n):
if X[x] > -1:
cyc_len = len(P) - X[x]
nxt_len = (n - X[x]) % cyc_len
pre = sum(P[:X[x]])
cyc = (sum_p - pre) * ((n - X[x]) // cyc_len)
nxt = sum(P[X[x]: X[x] + nxt_len])
print(pre + cyc + nxt)
exit()
X[x] = i
P.append(x)
sum_p += x
x = x*x % m
print(sum_p)
| s = input()
ans = 'Yes'
num = len(s)
if num % 2 != 0:
ans = 'No'
pass
else:
for i in range(0, num, 2):
if s[i] + s[i+1] != 'hi':
ans = 'No'
print(ans) | 0 | null | 27,869,375,248,352 | 75 | 199 |
time = 0
def dfs_visit(g, u):
global time
time += 1
u[2] = time
u[1] = 'g'
for v in u[0]:
ch = g[v]
if ch[1] == 'w':
ch[4] = u[5]
dfs_visit(g, ch)
u[1] = 'b'
time += 1
u[3] = time
n = int(input())
g = {}
s = 0
stack = []
for i in range(n):
x = list(map(int, input().split()))
g[x[0]] = [x[2:], 'w', 0, 0, None, x[0]]
if i == 0:
s = x[0]
for k, v in g.items():
if v[1] == 'w':
dfs_visit(g, v)
for i in range(n):
node = g[i+1]
print("{} {} {}".format(i+1, node[2], node[3])) | from collections import OrderedDict
class Stack():
def __init__(self):
self.el = []
def add(self, el):
self.el.append(el)
def pop(self):
return self.el.pop()
def top(self):
return self.el[-1]
def isEmpty(self):
if self.el:
return False
return True
class Node():
def __init__(self, id, edge=[], flag=0, discover=0, finish=0):
self.id = id
self.edge = edge
self.flag = flag
self.discover = discover
self.finish = finish
def show(self):
print self.id, self.discover, self.finish
def notVisited(dic):
for i in dic.keys():
if dic[i].flag != 2:
return i
return None
n = int(raw_input())
dic = {}
for i in range(n):
tmp = map(int, raw_input().split())
if tmp[1] > 0:
dic[tmp[0]] = Node(tmp[0], tmp[2:])
else:
dic[tmp[0]] = Node(tmp[0])
dic = OrderedDict(dic)
start = 1
time = 1
st = Stack()
dic[start].flag = 1
dic[start].discover = time
st.add(dic[start])
while not st.isEmpty():
time += 1
u = st.top()
v = u.edge
if v:
for i in range(len(v)):
if dic[v[i]].flag == 0:
dic[v[i]].flag = 1
dic[v[i]].discover = time
if i != len(v)-1:
dic[u.id].edge = u.edge[i+1:]
else:
dic[u.id].edge = []
st.add(dic[v[i]])
break
else:
st.pop()
dic[u.id].flag = 2
dic[u.id].finish = time
else:
st.pop()
dic[u.id].flag = 2
dic[u.id].finish = time
if st.isEmpty() and notVisited(dic):
new = notVisited(dic)
dic[new].flag = 1
time += 1
dic[new].discover = time
st.add(dic[new])
for i in dic.keys():
dic[i].show() | 1 | 2,732,572,218 | null | 8 | 8 |
n = int(input())
lis = list(map(int, input().split()))
ans = 0
for i in range(0, n-1):
for t in range(i+1, n):
con = lis[i] * lis[t]
ans += con
print(ans) | a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())
if a == b:
print("NO")
As = v * t + a
Bs = w * t + b
if v > w:
if abs(a - b)/abs(v - w) <= t:
print("YES")
else:
print("NO")
else:
print("NO") | 0 | null | 91,768,480,854,438 | 292 | 131 |
import sys
from copy import copy
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
in_n = lambda: int(readline())
in_nn = lambda: map(int, readline().split())
in_nl = lambda: list(map(int, readline().split()))
in_na = lambda: map(int, read().split())
in_s = lambda: readline().rstrip().decode('utf-8')
INF = 10**9 + 7
def main():
H, W = in_nn()
s = [list(in_s()) for _ in range(H)]
dp = [INF] * W
if s[0][0] == '#':
dp[0] = 1
else:
dp[0] = 0
for x in range(W - 1):
if s[0][x] == '.' and s[0][x + 1] == '#':
dp[x + 1] = dp[x] + 1
else:
dp[x + 1] = dp[x]
for y in range(1, H):
next_dp = [INF] * W
for x in range(W):
if s[y - 1][x] == '.' and s[y][x] == '#':
next_dp[x] = min(next_dp[x], dp[x] + 1)
else:
next_dp[x] = min(next_dp[x], dp[x])
for x in range(1, W):
if s[y][x - 1] == '.' and s[y][x] == '#':
next_dp[x] = min(next_dp[x], next_dp[x - 1] + 1)
else:
next_dp[x] = min(next_dp[x], next_dp[x - 1])
dp = next_dp
print(dp[-1])
if __name__ == '__main__':
main()
| #!/usr/bin/python3
# -*- coding:utf-8 -*-
def main():
h, w = map(int, input().split())
grid = []
for _ in range(h):
grid.append(list(input().strip()))
dp = [[0]*(w) for _ in range(h)]
def cals_score(i, j):
score = 10**9 + 7
if i >= 1:
score = dp[i-1][j] + (1 if grid[i-1][j]!=grid[i][j] else 0)
if j >= 1:
score = min(score, dp[i][j-1] + (1 if grid[i][j-1]!=grid[i][j] else 0))
return score
dp[0][0] = 1
for i in range(1, w):
dp[0][i] = cals_score(0, i)
for i in range(1, h):
dp[i][0] = cals_score(i, 0)
for i in range(1, h):
for j in range(1, w):
dp[i][j] = cals_score(i, j)
print(dp[-1][-1]//2 + dp[-1][-1]%2 * (grid[0][0]=='#'))
if __name__=='__main__':
main()
| 1 | 49,398,912,369,510 | null | 194 | 194 |
import sys
sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def SI(): return sys.stdin.readline()[:-1]
def main():
inf=10**9
h,w=MI()
ss=[SI() for _ in range(h)]
cc=[[0]*w for _ in range(h)]
if ss[0][0]=="#":cc[0][0]=1
for i in range(h):
for j in range(w):
if (i,j)==(0,0):continue
u=l=inf
if i-1>=0:
u=cc[i-1][j]
if ss[i][j]=="#" and ss[i-1][j]==".":u+=1
if j-1>=0:
l=cc[i][j-1]
if ss[i][j]=="#" and ss[i][j-1]==".":l+=1
cc[i][j]=min(u,l)
print(cc[h-1][w-1])
main() | h, w = map(int, input().split())
g = [[0] * w for _ in range(h)]#白が1、黒が０
for i in range(h):
s = list(input())
for j in range(w):
if s[j] == '.':
g[i][j] = 1
INF = 10**9
dp = [[INF] * w for _ in range(h)]
if g[0][0] == 0:
dp[0][0] = 1
else:
dp[0][0] = 0
for i in range(h):
for j in range(w):
for dx, dy in ((1, 0), (0, 1)):
nx = j + dx
ny = i + dy
if ny >= h or nx >= w:
continue
add = 0
if g[ny][nx] == 0 and g[i][j] == 1:
add = 1
dp[ny][nx] = min(dp[ny][nx], dp[i][j] + add)
print(dp[h-1][w-1])
| 1 | 49,243,720,490,272 | null | 194 | 194 |
'''
参考
https://drken1215.hatenablog.com/entry/2020/06/21/224900
'''
N = int(input())
A = list(map(int, input().split()))
INF = 10 ** 5
cnt = [0] * (INF+1)
Q = int(input())
BC = []
for _ in range(Q):
BC.append(list(map(int, input().split())))
for a in A:
cnt[a] += 1
total = sum(A)
for b, c in BC:
total += (c-b) * cnt[b]
cnt[c] += cnt[b]
cnt[b] = 0
print(total)
| N=int(input())
A=list(map(int,input().split()))
Q=int(input())
S=[list(map(int,input().split())) for i in range(Q)]
l=[0]*10**6
total=0
for i in range(N) :
l[A[i]]+=1 #各数字の個数
total+=A[i] #初期総和
for i in range(Q) :
s0=S[i][0] #Bの値、交換した値
s1=S[i][1] #Cの値、交換する値
total+=s1*l[s0]-s0*l[s0]
l[s1]+=l[s0]
l[s0]=0
print(total) | 1 | 12,199,847,661,300 | null | 122 | 122 |
from enum import Enum
import sys
import math
BIG_NUM = 2000000000
MOD = 1000000007
EPS = 0.000000001
while True:
N = int(input())
if N == 0:
break
table = list(map(int,input().split()))
tmp_sum = 0
for i in range(len(table)):
tmp_sum += table[i]
B = tmp_sum/len(table) #平均
squared_sum = 0
for i in range(len(table)):
squared_sum += table[i]*table[i]
A = squared_sum/len(table)
print("%.10f"%(math.sqrt(A-B*B)))
| s=input()
ls=len(s)
m=[0]*(2019)
m[0]+=1
cnt = 0
b = 0
for i in range(ls):
a = (b + pow(10,cnt,2019)*int(s[ls - i -1])) % 2019
m[a] += 1
b = a
cnt += 1
ans = 0
for i in m:
if i <= 1:
continue
ans += i*(i-1)//2
print(ans)
| 0 | null | 15,627,019,860,562 | 31 | 166 |
N=int(input())
#N=5
n=N//2
print(1-n/N) | import sys
readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)
def main():
N = int(readline())
odd = 0
for i in range(1, N + 1):
if i % 2 == 1:
odd += 1
print(odd / N)
if __name__ == '__main__':
main()
| 1 | 177,397,272,025,778 | null | 297 | 297 |
kyu = [2000, 1800, 1600, 1400, 1200, 1000, 800, 600, 400, 0]
x = int(input())
for k, num in enumerate(kyu):
if num > x >= kyu[k+1]:
print(k + 1)
break | X = int(input())
rankArr=[2000,1800,1600,1400,1200,1000,800,600,400]
for i in range(1,len(rankArr)):
if rankArr[i] <= X and X < rankArr[i-1] :
print(i)
exit() | 1 | 6,705,639,925,308 | null | 100 | 100 |
# from pprint import pprint
n = int(input())
a = map(int, input().split())
a = sorted(((ax, x) for x, ax in enumerate(a)), reverse=True)
dp = [[-1] * (n+1) for _ in range(n+1)]
dp[0][0] = 0
for i, (ax, x) in enumerate(a):
for j in range(i+1):
dp[j+1][i-j] = max(dp[j+1][i-j], dp[j][i-j] + ax*abs(x-j))
dp[j][i-j+1] = max(dp[j][i-j+1], dp[j][i-j] + ax*abs(n-1-x-i+j))
# pprint(dp)
print(max(dp[i][n-i] for i in range(n+1)))
| import sys
stdin = sys.stdin
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
nn = lambda: list(stdin.readline().split())
ns = lambda: stdin.readline().rstrip()
sys.setrecursionlimit(10**6)
n = ni()
a = na()
b = []
for i in range(n):
b.append((a[i],i))
b.sort(reverse=True)
dp = [[0]*(n+1) for i in range(n+1)]
for i in range(1,n+1):
x,y = b[i-1]
for j in range(i+1):
left = dp[i-1][j-1] + x*abs(y-j+1) if j > 0 else -1
right = dp[i-1][j] + x*abs(n-i+j-y) if j < i else -1
dp[i][j] = max(left,right)
print(max(dp[-1])) | 1 | 33,666,863,340,358 | null | 171 | 171 |
def make_divisors(n):
lower_divisors, upper_divisors = [], []
i = 1
while i * i <= n:
if n % i == 0:
lower_divisors.append(i)
upper_divisors.append(n//i)
i += 1
return lower_divisors, upper_divisors
n = int(input())
low, up = make_divisors(n)
if len(low) != 1:
# ans = low[0] + up[0]
# for i in range(1, len(low)):
# tmp = low[i] + up[i]
# if tmp < ans:
# ans = tmp
print(low[-1] + up[-1] - 2)
else:
print(n - 1)
|
def solve():
ans = 10**12
for i in range(1, int(N**0.5)+1):
if N % i == 0:
ans = min(ans, i + (N//i) -2)
if N == 2:
print(1)
elif N == 3:
print(2)
else:
print(ans)
if __name__ == "__main__":
N = int(input())
solve()
| 1 | 161,355,149,112,160 | null | 288 | 288 |
def resolve():
import math as m
N = int(input())
nn = m.ceil(N / 1.08)
if m.floor(nn * 1.08) == N:
print(nn)
else:
print(":(")
resolve()
| #!/usr/bin/env python
def GCD(x,y):
while y!=0:
tmp=y
y=x%y
x=tmp
return x
if __name__ == "__main__":
x,y=list(map(int,input().split()))
if x<y:
tmp=x
x=y
y=tmp
print(GCD(x,y)) | 0 | null | 62,901,656,391,710 | 265 | 11 |
n = int(input())
ans = 0
for i in range(1, n + 1):
if i % 2 == 0:
continue
else:
ans += 1
print(ans / n)
| a = []
b = []
n, m, l = [int(n) for n in input().split()]
c = [[0 for i in range(l)] for j in range(n)]
for i in range(n):
a.append([int(n) for n in input().split()])
for i in range(m):
b.append([int(n) for n in input().split()])
for i in range(n):
for j in range(l):
for k in range(m):
c[i][j] += a[i][k] * b[k][j]
for num in c:
print(' '.join(str(n) for n in num)) | 0 | null | 89,297,405,095,018 | 297 | 60 |
# D
from collections import Counter
n = int(input())
c = list(input())
d = Counter(c)
# print(d)
# print(d["R"])
e=Counter(c[:d["R"]])
# print(e["R"])
print(d["R"]-e["R"]) | # print('input >>')
N, K = map(int,(input().split()))
ps = list(map(int,(input().split())))
ps.sort()
# print('-----output-----')
print(sum(ps[:K])) | 0 | null | 8,968,492,872,760 | 98 | 120 |
import sys,math
inputs = list()
for n in sys.stdin:
inputs.append(list(map(int,n.split())))
for n in inputs:
print(math.floor(math.log10(n[0]+n[1]))+1) | import sys
import math
for line in sys.stdin:
try:
a, b = [int(i) for i in line.split()]
print(int(math.log10(a + b) + 1))
except:
break | 1 | 123,902,830 | null | 3 | 3 |
x, y = map(int, input().split())
ans = 0
for i in range(x+1):
if 2 * i + 4*(x-i) == y:
ans = 1
print('Yes' if ans == 1 else 'No') | L = int(input())
L = L / 3
ans = L * L * L
print(ans) | 0 | null | 30,183,635,141,760 | 127 | 191 |
a,b=map(int,input().split())
list=[[0 for i in range(2)] for j in range(a)]
for i in range(a):
list[i]=input().split()
n=0
s=0
while n!=a:
if int(list[n][1])>b:
list[n][1]=int(list[n][1])-b
list.append(list[n])
list.pop(n)
s+=b
else:
print(list[n][0],s+int(list[n][1]))
s+=int(list[n][1])
n+=1
| n = int(input())
p = 10 ** 9 + 7
all_ptn = 10 ** n
anti_ptn = 2 * (9 ** n) - 8 ** n
print((all_ptn - anti_ptn) % p) | 0 | null | 1,612,992,549,992 | 19 | 78 |
str=input()
print(str.swapcase())
| I=raw_input()
O=str()
list_upper="ABCDEFGHIJKLMNOPQRSTUVWXYZ"
#list_lower="abcdefghijklmnopqrstuvwxyz"
for i in I:
if i in list_upper:
O+=i.lower()
else:
O+=i.upper()
print O | 1 | 1,485,405,328,640 | null | 61 | 61 |
# coding: utf-8
# Your code here!
S=list(input())
S=list(map(int,S))[::-1]
mod=[0]*2019
mod[0]+=1
ans=0
temp=0
p=1
for i in range(len(S)):
temp+=S[i]*p
p=p*10%2019
temp%=2019
ans+=mod[temp]
mod[temp]+=1
print(ans)
| s=list(input())
l=[0]*2019
t=0
ans=0
for i in range(len(s)):
t=(t+pow(10,i,2019)*int(s[-1-i]))%2019
l[t]+=1
for i in l:
ans+=(i*(i-1))//2
print(ans+l[0]) | 1 | 30,800,695,507,802 | null | 166 | 166 |
#! /usr/bin/env python
# -*- coding: utf-8 -*-
raw_list = sorted(map(int, raw_input().split()))
print("%d %d %d") % (raw_list[0], raw_list[1], raw_list[2]) | A = int(input())
B = int(input())
C = [i for i in range(1, 4) if i != A and i != B]
print(*C) | 0 | null | 55,324,428,474,630 | 40 | 254 |
def main():
S, W = map(int, input().split(' '))
if S > W:
print('safe')
else:
print('unsafe')
main() | s,w = [int(x) for x in input().split()]
if s > w:
print("safe")
else:
print("unsafe") | 1 | 29,035,781,751,620 | null | 163 | 163 |
N = int(input())
x = int(N/1.08)
for i in range(x, x+2):
if N == int(i*1.08):
print(i)
break
else:
print(":(") | import sys
input = sys.stdin.readline
def main():
N = int(input())
X = input()
popcount_X = X.count("1")
if popcount_X == 0:
ans = [1] * N
elif popcount_X == 1:
ans = [1] * N
ans[-1] = 2
ans[X.index("1")] = 0
else:
X_mod_popcount_X_p = int(X, 2) % (popcount_X + 1)
X_mod_popcount_X_m = int(X, 2) % (popcount_X - 1)
ans = [0] * N
for i in range(N):
if X[i] == "0":
Y = X_mod_popcount_X_p + pow(2, N - 1 - i, mod=popcount_X + 1)
Y = Y % (popcount_X + 1)
else:
Y = X_mod_popcount_X_m - pow(2, N - 1 - i, mod=popcount_X - 1)
Y = Y + (popcount_X - 1)
Y = Y % (popcount_X - 1)
count = 1
while Y > 0:
popcount = bin(Y).count("1")
Y = Y % popcount
count += 1
ans[i] = count
print("\n".join(map(str, ans)))
if __name__ == "__main__":
main()
| 0 | null | 66,899,904,796,702 | 265 | 107 |
x = int(input())
#import fractions
import math
from functools import reduce
def lcm_base(x, y):
#return (x * y) // fractions.gcd(x, y)
return (x * y) // math.gcd(x, y)
l = lcm_base(x, 360)
print(l//x)
| # -*- coding: utf-8 -*-
x=int(input())
a=360
b=x
r=a%b
while r!=0:
a=b
b=r
r=a%b
lcm=x*360/b
k=int(lcm/x)
print(k) | 1 | 13,159,508,956,154 | null | 125 | 125 |
n = input()
s = set(input().split())
q = input()
t = set(input().split())
print(len(s & t)) | def main():
n = input()
S = map(int,raw_input().split())
q = input()
T = map(int,raw_input().split())
m = 0
for i in range(q):
t = T.pop()
for j in range(n):
s = S[j]
if t == s:
m += 1
break
print m
if __name__ == "__main__":
main() | 1 | 66,489,787,940 | null | 22 | 22 |
x,n = map(int,input().split())
if n == 0:
print(x)
else:
p = list(map(int,input().split()))
k = [i for i in range(-200,201)]
for i in range(n):
if p[i] in set(k):
k.remove(p[i])
minimum = 99999
ans = 0
for i in range(len(k)):
if abs(k[i] - x ) < minimum :
minimum = abs(k[i] - x)
ans = k[i]
print(ans) | H, W = map(int, input().split())
S = [[i for i in input()] for j in range(H)]
dp = [[0 for i in range(W)] for j in range(H)]
if S[0][0] == "#":
dp[0][0] = 1
for i in range(1, H):
if S[i-1][0] == "." and S[i][0] == "#":
dp[i][0] = dp[i-1][0] + 1
else:
dp[i][0] = dp[i-1][0]
for j in range(1, W):
if S[0][j-1] == "." and S[0][j] == "#":
dp[0][j] = dp[0][j-1] + 1
else:
dp[0][j] = dp[0][j-1]
for h in range(1, H):
for w in range(1, W):
if S[h][w] == "#":
if S[h-1][w] == ".":
c1 = dp[h-1][w] + 1
else:
c1 = dp[h-1][w]
if S[h][w-1] == ".":
c2 = dp[h][w-1] + 1
else:
c2 = dp[h][w-1]
dp[h][w] = min(c1, c2)
else:
dp[h][w] = min(dp[h-1][w], dp[h][w-1])
print(dp[H-1][W-1]) | 0 | null | 31,764,292,136,080 | 128 | 194 |
import sys
input = sys.stdin.readline
R,C,K = map(int,input().split())
lis = [[0] * (C+1) for i in range(R+1)]
for _ in range(K):
r,c,v = map(int,input().split())
lis[r][c] = v
dp = [[[0] * (C+1) for _ in range(R+1)] for _ in range(4)]
#print(dp)
for i in range(1,R+1):
for j in range(1,C+1):
for k in range(4):
dp[0][i][j] = max(dp[0][i][j],dp[k][i-1][j])
dp[1][i][j] = max(dp[1][i][j],dp[k][i-1][j] + lis[i][j])
dp[k][i][j] = max(dp[k][i][j],dp[k][i][j-1])
if k > 0:
dp[k][i][j] = max(dp[k][i][j],dp[k-1][i][j-1] + lis[i][j])
# print(dp[0])
# print(dp[1])
# print(dp[2])
# print(dp[3])
print(max(dp[0][R][C],dp[1][R][C],dp[2][R][C],dp[3][R][C]))
| R, C, K, *RCV = [int(_) for _ in open(0).read().split()]
RCV = sorted([(r, -c, v) for r, c, v in zip(RCV[::3], RCV[1::3], RCV[2::3])])
class SegmentTree():
def __init__(self, array, f, ti):
"""
Parameters
----------
array : list
to construct segment tree from
f : func
binary operation of the monoid
ti :
identity element of the monoid
"""
self.f = f
self.ti = ti
self.n = n = 2**(len(array).bit_length())
self.dat = dat = [ti] * n + array + [ti] * (n - len(array))
for i in range(n - 1, 0, -1): # build
dat[i] = f(dat[i << 1], dat[i << 1 | 1])
def update(self, p, v): # set value at position p (0-indexed)
f, n, dat = self.f, self.n, self.dat
p += n
dat[p] = v
while p > 1:
p >>= 1
dat[p] = f(dat[p << 1], dat[p << 1 | 1])
def operate_right(self, p, v): # apply operator from the right side
f, n, dat = self.f, self.n, self.dat
p += n
dat[p] = f(dat[p], v)
while p > 1:
p >>= 1
dat[p] = f(dat[p << 1], dat[p << 1 | 1])
def operate_left(self, p, v): # apply operator from the left side
f, n, dat = self.f, self.n, self.dat
p += n
dat[p] = f(v, dat[p])
while p > 1:
p >>= 1
dat[p] = f(dat[p << 1], dat[p << 1 | 1])
def query(self, l, r): # result on interval [l, r) (0-indexed)
f, ti, n, dat = self.f, self.ti, self.n, self.dat
vl = vr = ti
l += n
r += n
while l < r:
if l & 1:
vl = f(vl, dat[l])
l += 1
if r & 1:
r -= 1
vr = f(dat[r], vr)
l >>= 1
r >>= 1
return f(vl, vr)
dp1 = SegmentTree([0] * (C + 1), max, -1)
dp2 = SegmentTree([0] * (C + 1), max, -1)
dp3 = SegmentTree([0] * (C + 1), max, -1)
rnow = 0
rcv = {}
for r, c, v in RCV:
if rnow != r:
rnow = r
rcv[r] = []
rcv[r] += [(-c, v)]
for r in sorted(rcv.keys()):
cv = rcv[r]
for c, v in cv:
dp1.update(c, dp3.query(0, c + 1) + v)
for c, v in cv:
dp2.update(c, max(dp1.query(c, c + 1), dp1.query(0, c) + v))
for c, v in cv:
dp3.update(c, max(dp2.query(c, c + 1), dp2.query(0, c) + v))
ans = dp3.query(0, C + 1)
print(ans)
| 1 | 5,505,085,019,982 | null | 94 | 94 |
a = input()
print(a.replace('P?', 'PD').replace('?D', 'PD').replace('??', 'PD').replace('?', 'D'))
| raw_data = input()
data = raw_data.replace('?', 'D')
print(data) | 1 | 18,380,887,637,210 | null | 140 | 140 |
N = int(input())
sqrt_N = int(N ** 0.5)
dividers_for_N = []
ans_list = []
for i in range(1, sqrt_N + 1):
if (N - 1) % i == 0:
ans_list.append(i)
if i != (N - 1) // i:
ans_list.append((N - 1) // i)
if N % i == 0:
dividers_for_N.append(i)
if i != N // i:
dividers_for_N.append(N // i)
dividers_for_N.remove(1)
ans_list.remove(1)
for i in dividers_for_N:
num = N
while num % i == 0:
num //= i
if num % i == 1:
ans_list.append(i)
ans = len(ans_list)
print(ans) |
x1,y1,x2,y2=map(float,input().split())
import math
A=math.sqrt((x2-x1)**2+(y2-y1)**2)
B=float('{:.8f}'.format(A))
print(B)
| 0 | null | 20,882,176,375,808 | 183 | 29 |
import sys
input = sys.stdin.readline
H,W,K=map(int,input().split())
CO=[[0 for i in [0]*W] for j in [0]*H]
DO=[[0 for i in [0]*W] for j in [0]*H]
for i in range(H):
C=input()
for j in range(W):
DO[i][j]=int(C[j])
CO[H-1]=DO[H-1]
F=1000000
for s in range(2**(H-1)):
D=0
E=0
Sui=[0]*(H-1)
for t in range(H-1):
if ((s >> t) & 1):
Sui[t]+=1
for m in range(H-1):
E+=Sui[m]
for k in range(H-1):
if Sui[k]==0:
for i in range(W):
CO[H-k-2][i]=DO[H-k-2][i]+CO[H-k-1][i]
else:
for i in range(W):
CO[H-k-2][i]=DO[H-k-2][i]
lst=[0]*H
for h in range(W):
c=max(CO[x][h] for x in range(H))
d=max(lst[y]+CO[y][h] for y in range(H))
if c>K:
E=1000000
break
elif d>K:
D+=1
lst=[0]*H
for z in range(H):
lst[z]+=CO[z][h]
F=min(F,D+E)
print(F) | '''
'''
INF = float('inf')
def main():
H, W, K = map(int, input().split())
S = [input() for _ in range(H)]
S = [''.join(S[row][col] for row in range(H)) for col in range(W)]
ans = INF
for b in range(0, 2**H, 2):
sections = [(0, H)]
for shift in range(1, H):
if (1<<shift) & b:
sections.append((sections.pop()[0], shift))
sections.append((shift, H))
t_ans = len(sections) - 1
count = {(l, r): 0 for l, r in sections}
for col in range(W):
if any(count[(l, r)] + S[col][l:r].count('1') > K for l, r in sections):
for key in count.keys():
count[key] = 0
t_ans += 1
for l, r in sections:
count[(l, r)] += S[col][l:r].count('1')
if max(count.values()) > K:
t_ans = INF
break
ans = min(ans, t_ans)
print(ans)
main()
| 1 | 48,612,023,421,110 | null | 193 | 193 |
a,b,m = map(int,input().split())
A = list(map(int,input().split()))
B = list(map(int,input().split()))
ans = []
ans.append(min(A)+min(B))
for i in range(m):
M = list(map(int,input().split()))
tmp = A[M[0]-1] + B[M[1]-1] -M[2]
ans.append(tmp)
print(min(ans))
| A, B, M = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
result = min(a) + min(b)
for _ in range(M):
x, y, c = map(int, input().split())
discount = a[x-1] + b[y-1] - c
result = min(result, discount)
print(result) | 1 | 54,027,034,985,330 | null | 200 | 200 |
A,B,K=map(int, input().split())
if A >= K:
print(f'{A-K} {B}')
elif (A+B) >= K:
print(f'0 {B-(K-A)}')
else:
print('0 0') | K=int(input())
A,B=map(int,input().split())
for x in range(A,B+1):
if x%K==0:
print("OK")
break
else:
print("NG")
| 0 | null | 65,578,533,929,858 | 249 | 158 |
# coding: utf-8
scores = []
grades = []
while (1):
one = list(map(int, input().split()))
if sum(one) <= -3:
break
scores.append(one)
for s in scores:
# ??????????¨??????????????¨????????????????????¬???? -> F
if (s[0] == -1 or s[1] == -1):
grades.append('F')
continue
# ??????????¨???¨??????????¨????????¨??????°???80?????\??? -> A
if (s[0] + s[1] >= 80):
grades.append('A')
continue
# ??????????¨???¨??????????¨????????¨??????°???65?????\???80????????? -> B
if (s[0] + s[1] >= 65):
grades.append('B')
continue
# ??????????¨???¨??????????¨????????¨??????°???50?????\???65????????? -> C
if (s[0] + s[1] >= 50):
grades.append('C')
continue
# ??????????¨???¨??????????¨????????¨??????°???30?????\???50?????????
if (s[0] + s[1] >= 30):
if (s[2] >= 50):
grades.append('C')
continue
else:
grades.append('D')
continue
grades.append('F')
for g in grades:
print(g) | while(1):
m, f, r = map(int, input().split())
if m == -1 and f == -1 and r == -1:
break
score = m + f
if m == -1 or f == -1:
print("F")
continue
if score >= 80:
print("A")
continue
if score >= 65 and score < 80:
print("B")
continue
if score >= 50 and score < 65:
print("C")
continue
if score >= 30 and score < 50:
if r >= 50:
print("C")
else:
print("D")
continue
if score < 30:
print("F") | 1 | 1,226,951,250,490 | null | 57 | 57 |
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time, copy,bisect
#from operator import itemgetter
#from heapq import heappush, heappop
#import numpy as np
#from scipy.sparse.csgraph import breadth_first_order, depth_first_order, shortest_path, floyd_warshall, dijkstra, bellman_ford, johnson
#from scipy.sparse import csr_matrix
#from decimal import Decimal, ROUND_HALF_UP, ROUND_HALF_EVEN
import sys
sys.setrecursionlimit(10**7)
inf = 10**20
mod = 10**9 + 7
stdin = sys.stdin
ni = lambda: int(ns())
nf = lambda: float(ns())
na = lambda: list(map(int, stdin.readline().split()))
nb = lambda: list(map(float, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip() # ignore trailing spaces
X, N = na()
p = na()
kouho = []
for i in range(-100, 200):
if i in p:
continue
kouho.append((abs(X - i), i))
print(min(kouho)[1]) | import sys
x,n = map(int,input().split())
p = list(map(int,input().split()))
s = 100
min_i = -1
if x not in p:
print(x)
sys.exit()
for i in range(-1,102):
if i not in p and abs(i-x) < s:
s = abs(i-x)
min_i = i
print(min_i)
| 1 | 14,072,240,147,680 | null | 128 | 128 |
n, m = map(int, input().split())
mat = [map(int,input().split()) for i in range(n)]
vec = [int(input()) for i in range(m)]
for row in mat:
print(sum([a*b for (a,b) in zip(row, vec)])) | x, y = [int(i) for i in input().split()]
date = [[int(i) for i in input().split()]for i in range(1,x+1)]
date2 =[int(input())for i in range(1,y+1)]
date3 =[]
for a in range(0,x):
for b in range(0,y,):
date3 += [date2[b]*date[a][b]]
for d in range(0,len(date3),y):
print(sum(date3[d:d+y])) | 1 | 1,153,371,080,940 | null | 56 | 56 |
import sys
read = sys.stdin.buffer.read
INF = 1 << 60
def main():
H, N, *AB = map(int, read().split())
dp = [INF] * (H + 1)
dp[0] = 0
for a, b in zip(*[iter(AB)] * 2):
for i in range(H + 1):
if dp[i] > dp[max(i - a, 0)] + b:
dp[i] = dp[max(i - a, 0)] + b
print(dp[H])
return
if __name__ == '__main__':
main()
| import sys
sys.setrecursionlimit(10**6) #再帰関数の上限
import math
#import queue
from copy import copy, deepcopy
from operator import itemgetter
import bisect#2分探索
#bisect_left(l,x), bisect(l,x)
from collections import deque
#deque(l), pop(), append(x), popleft(), appendleft(x)
##listでqueの代用をするとO(N)の計算量がかかってしまうので注意
#dequeを使うときはpython3を使う、pypyはダメ
from collections import Counter#文字列を個数カウント辞書に、
#S=Counter(l),S.most_common(x),S.keys(),S.values(),S.items()
from itertools import accumulate#累積和
#list(accumulate(l))
from heapq import heapify,heappop,heappush
#q=heapq.heapify(l),heappush(q,a),heappop(q)
def input(): return sys.stdin.readline()[:-1]
def printl(li): print(*li, sep="\n")
def argsort(s): return sorted(range(len(s)), key=lambda k: s[k])
#mod = 10**9+7
#N = int(input())
N, P = map(int, input().split())
S=input()
#L = [int(input()) for i in range(N)]
#A = list(map(int, input().split()))
#S = [inputl() for i in range(H)]
#q = queue.Queue() #q.put(i) #q.get()
#q = queue.LifoQueue() #q.put(i) #q.get()
#a= [[0]*3 for i in range(5)] #2次元配列はこう準備、[[0]*3]*5だとだめ
#b=copy.deepcopy(a) #2次元配列はこうコピーする
#w.sort(key=itemgetter(1),reversed=True) #二個目の要素で降順並び替え
#素数リスト
# n = 100
# primes = set(range(2, n+1))
# for i in range(2, int(n**0.5+1)):
# primes.difference_update(range(i*2, n+1, i))
# primes=list(primes)
#bisect.bisect_left(a, 4)#aはソート済みである必要あり。aの中から4未満の位置を返す。rightだと以下
#bisect.insort_left(a, 4)#挿入
if P!=2 and P!=5:
pc=[0]*P
pc[0]=1
count=0
ans=0
p10=1
for i in range(1,N+1):
count+=int(S[N-i])*p10
count%=P
ans+=pc[count]
pc[count]+=1
p10*=10
p10%=P
print(ans)
else:
ans=0
for i in range(1,N+1):
if int(S[N-i])%P==0:
ans+=N-i+1
print(ans)
| 0 | null | 69,590,436,710,268 | 229 | 205 |
import numpy as np
from numba import njit
@njit
def get_div_nums(n):
divs = np.ones(n+1, dtype=np.int64)
for i in range(2, n):
divs[i::i] += 1
return divs
def main():
N = int(input())
divs = get_div_nums(N)
ans = divs[:N].sum()-1
print(ans)
#print(divs[:20])
if __name__ == "__main__":
main() | tmp = (input().split(' '))
n = int(tmp[0])
k = int(tmp[1])
tmp = input().split(' ')
map_tmp = map(int,tmp)
grades = list(map_tmp)
j = k
while j < n:
curr_res = grades[j]
prev_res = grades[j-k]
if curr_res > prev_res:
print('Yes')
else:
print('No')
j+=1 | 0 | null | 4,888,953,814,948 | 73 | 102 |
import sys
input = sys.stdin.readline
INF = 10**18
sys.setrecursionlimit(10**6)
import itertools as it
import collections as cl
from collections import deque
import math
from functools import reduce
from collections import defaultdict
MOD = 998244353
def li():
return [int(x) for x in input().split()]
N, K = li()
L, R = [], []
for _ in range(K):
l, r = li()
L.append(l)
R.append(r)
# dp[i]: i番目のマスにいく場合の数
dp = [0] * (N+1)
dp[1] = 1
# 区間 [left, right)の和はdpsum[right] - dpsum[left]
# 区間 [left, right]の和はdpsum[right+1] - dpsum[left]
# マス a~bは区間だと[a-1,b-1]に対応。よってマスliからriの和はdpsum[right] - dpsum[left - 1]
dpsum = [0] * (N+1)
dpsum[1] = 1
for i in range(2, N+1):
for j in range(K):
li = max(i - R[j], 1)
ri = i - L[j]
if ri >= 0:
dp[i] += dpsum[ri] - dpsum[li-1]
dp[i] %= MOD
dpsum[i] = dpsum[i-1] + dp[i]
dpsum[i] %= MOD
print(dp[N])
| # 解説を見て解き直し
N, K = [int(x) for x in input().split()]
ranges = [tuple(int(x) for x in input().split()) for _ in range(K)]
ranges.sort()
p = 998244353
dp = [0] * (N + 1)
dpsum = [0] * (N + 1)
dp[1] = 1
dpsum[1] = 1
for i in range(2, N + 1):
for l, r in ranges:
rj = i - l
lj = max(1, i - r) # 1以上
if rj <= 0: continue
dp[i] += dpsum[rj] - dpsum[lj - 1]
dp[i] %= p
dpsum[i] = dpsum[i - 1] + dp[i]
dpsum[i] %= p
print(dp[N]) | 1 | 2,709,986,539,860 | null | 74 | 74 |
H, N = map(int, input().split())
A = []
B = []
for n in range(N):
a, b = map(int, input().split())
A.append(a)
B.append(b)
INF = float('inf')
dp = [INF] * (H + max(A))
dp[0] = 0
# dp[i]を、HP iを減らすために必要な最小の魔力とする
for hp in range(1, H+1):
for n in range(N):
dp[hp] = min(dp[max(hp-A[n],0)] + B[n], dp[hp])
print(dp[H]) | x = input()
if x == "RRR":
print(3)
elif x == "RRS":
print(2)
elif x == "SRR":
print(2)
elif x == "SSS":
print(0)
else:
print(1) | 0 | null | 42,917,192,660,216 | 229 | 90 |
_, s, _, t = [[*map(int, o.split())] for o in open(0)]
print(sum(i in s for i in t))
| n,m=map(int,input().split())
q=[list(map(int,input().split())) for _ in range(m)]
for i in range(10**n):
i=str(i)
if len(i)!=n:
continue
f=1
for j in q:
if i[j[0]-1]!=str(j[1]):
f=0
break
if f:
print(i)
exit()
print("-1") | 0 | null | 30,427,036,384,162 | 22 | 208 |
"""
Template written to be used by Python Programmers.
Use at your own risk!!!!
Owned by enraged(rating - 5 star at CodeChef and Specialist at Codeforces).
"""
import sys
import bisect
import heapq
# from math import *
from collections import defaultdict as dd # defaultdict(<datatype>) Free of KeyError.
from collections import deque # deque(list) append(), appendleft(), pop(), popleft() - O(1)
from collections import Counter as c # Counter(list) return a dict with {key: count}
from itertools import combinations as comb
from bisect import bisect_left as bl, bisect_right as br, bisect
# sys.setrecursionlimit(2*pow(10, 6))
# sys.stdin = open("input.txt", "r")
# sys.stdout = open("output.txt", "w")
mod = pow(10, 9) + 7
mod2 = 998244353
def data(): return sys.stdin.readline().strip()
def out(var): sys.stdout.write(var)
def l(): return list(map(int, data().split()))
def sl(): return list(map(str, data().split()))
def sp(): return map(int, data().split())
def ssp(): return map(str, data().split())
def l1d(n, val=0): return [val for i in range(n)]
def l2d(n, m, val=0): return [[val for i in range(n)] for j in range(m)]
n, p = sp()
s = data()
answer = 0
if p == 2:
for i in range(n):
if (ord(s[i])-ord('0')) % 2 == 0:
answer += (i+1)
elif p == 5:
for i in range(n):
if int(s[i]) % 5 == 0:
answer += (i+1)
else:
dp = dd(int)
dp[0] += 1
a, tens = 0, 1
for i in range(n-1, -1, -1):
a = (a + int(s[i]) * tens) % p
answer += dp[a]
dp[a] += 1
tens = (tens * 10) % p
out(str(answer))
exit(0)
| a,b = input().split(' ')
print('Yes' if a == b else 'No') | 0 | null | 70,850,902,040,490 | 205 | 231 |
s = input()
if len(s) == 1:
print(0)
exit()
ans = 0
for i in range(len(s)//2):
if s[i] != s[(-1)*(i+1)]:
ans += 1
else:
pass
print(ans)
| N,M = map(int,input().split())
Alist = list(map(int,input().split()))
Alist = sorted(Alist,reverse=True)
#print (sum(Alist))
Ans = "No"
for i in range(M):
#print (Alist[i])
#print((sum(Alist)/4*M))
if Alist[i]>=(sum(Alist)/(4*M)):
Ans ="Yes"
else:
Ans = "No"
print (Ans) | 0 | null | 79,593,428,863,072 | 261 | 179 |
from collections import deque
def main():
s = list(input())
q = int(input())
query = []
que = deque(s)
f = False
for i in range(q):
query.append(input().split(" "))
for i in range(q):
if query[i][0] == '1':
f = not f
else:
if f:
if query[i][1] == '2':
que.appendleft(query[i][2])
else:
que.append(query[i][2])
else:
if query[i][1] == '1':
que.appendleft(query[i][2])
else:
que.append(query[i][2])
if f:
que.reverse()
print("".join(que))
if __name__ == "__main__":
main() | # coding: utf-8
n = int(input())
A = list(map(int, input().split()))
print(" ".join(map(str,A)))
for i in range(1,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(" ".join(map(str,A)))
| 0 | null | 28,585,781,053,228 | 204 | 10 |
#!/usr/bin/env python3
def main():
N = int(input())
A = list(map(int, input().split()))
p = 10**9 + 7
digit_0 = [0] * 60
digit_1 = [0] * 60
for i in range(N):
for j in range(60):
if (A[i] >> j) & 1:
digit_1[j] += 1
else:
digit_0[j] += 1
ans = 0
for j in range(60):
ans += ((digit_0[j] * digit_1[j] % p) * pow(2,j,p) % p)
ans %= p
print(ans)
if __name__ == "__main__":
main()
| import numpy as np
n = int(input())
a = list(map(int,input().split()))
a = np.array(a,dtype=np.int64)
point = 0
mod = 10**9+7
b = [((a>>i)&1).sum() for i in range(61)]
c = [n-b[i] for i in range(61)]
d = [c[i]*b[i]%mod for i in range(61)]
point = 0
now = 1
for i in range(61):
point += now*d[i]
point %= mod
now *= 2
now %= mod
print(point) | 1 | 122,768,929,063,610 | null | 263 | 263 |
n = int(input())
ans = 0
for i in range(1, n + 1):
if i % 2 == 0:
continue
else:
ans += 1
print(ans / n)
| # -*- coding: utf-8 -*-
"""
Created on Sun Jun 18 09:48:56 2017
@author: syaga
"""
if __name__ == "__main__":
N = int(input())
A = list(map(int, input().split()))
num = 0
for i in range(0, N):
minj = i
for j in range(i, N):
if A[j] < A[minj]:
minj = j
temp = A[i]
A[i] = A[minj]
A[minj] = temp
if minj != i:
num += 1
print(" ".join(map(str, A)))
print(num) | 0 | null | 88,578,138,841,818 | 297 | 15 |
'''
参考
https://yamakasa.net/atcoder-abc-173-d/
図
https://github.com/ymo999/AtCoder/blob/master/2020/20200705_ABC173/ABC173_D.pdf
'''
import math
N = int(input())
A = list(map(int, input().split()))
A.sort(reverse=True)
ans = 0
for i in range(1, N):
idx = math.floor(i/2) # 心地よさの和を算出するためのindex
ans += A[idx]
print(ans)
| #!/usr/bin/python3
# -*- coding:utf-8 -*-
def main():
n = int(input())
la = list(map(int, input().strip().split()))
la.sort(reverse=True)
ans = sum(la[:(n+1)//2]) * 2 - la[0] - (la[(n+1)//2-1] if n%2==1 else 0)
print(ans)
if __name__=='__main__':
main()
| 1 | 9,157,100,535,090 | null | 111 | 111 |
a, b, k = map(int, input().split())
takahasi = max(0, a - k)
aoki = max(0, b - max(0, k - a))
print(takahasi, aoki) | a = list(map(int,input().split()))
print("bust" if sum(a) >= 22 else "win") | 0 | null | 111,257,388,454,612 | 249 | 260 |
N = int(input())
A = list(map(int, input().split()))
dct = dict(enumerate(A))
ad = sorted(dct.items(), key=lambda x:x[1])
ans = []
for i in ad:
j = i[0] + 1
ans.append(j)
a = map(str, ans)
b = ' '.join(a)
print(b) | import numpy as np
n = int(input())
a = np.array(list(map(int,input().split())))
ans = np.argsort(a)
print(*ans + 1) | 1 | 181,061,944,092,172 | null | 299 | 299 |
from itertools import combinations
n = int(input())
def dfs(s):
if len(s) == n:
print(s)
return 0
for i in range(ord('a'), ord(max(s))+2):
t = s
t += chr(i)
dfs(t)
dfs('a') | import sys
from collections import deque
sys.setrecursionlimit(10 ** 6)
INF = float("inf")
MOD = 10 ** 9 + 7
def input():
return sys.stdin.readline().strip()
def bfs(N):
q = deque(["a"])
res = []
while q:
s = q.popleft()
if len(s) == N:
res.append(s)
continue
n = len(set(list(s)))
for i in range(n + 1):
c = chr(ord("a") + i)
q.append(s + c)
return res
def main():
N = int(input())
ans = bfs(N)
print(*ans, sep="\n")
if __name__ == "__main__":
main()
| 1 | 52,457,506,653,370 | null | 198 | 198 |
def main():
S = input().rstrip()
if S[-1] == "s":
S = S + "es"
else:
S = S + "s"
print(S)
main()
| if __name__ == '__main__':
s = str(input())
if s[-1] != 's':
print(f'{s}s')
else:
print(f'{s}es') | 1 | 2,386,819,427,708 | null | 71 | 71 |
m1, d1 = map(int, input().split())
m2, d2 = map(int, input().split())
if m1 + 1 == m2 and d2 == 1:
print(1)
else:
print(0) | M1, D1 = map(int, input().split())
M2, D2 = map(int, input().split())
print(1 if M1 != M2 else 0) | 1 | 124,702,413,244,630 | null | 264 | 264 |
S,T = input().split()
a,b = map(int,input().split())
u = input()
if u == S:
a -= 1
elif u ==T:
b -= 1
print("{} {}".format(a,b)) | #!/usr/bin/env python3
import sys
def read_int_list(sep=" "):
return [int(s) for s in sys.stdin.readline().rstrip().split(sep)]
def dprint(*args, **kwargs):
return
print(*args, **kwargs)
facto = None
ifacto = None
def precompute_facto(n, mod):
global facto, ifacto
facto = [1] * (n + 1)
for i in range(1, n + 1):
facto[i] = (facto[i - 1] * i) % mod
ifacto = [1] * (n + 1)
ifacto[n] = mod_inv(1, facto[n], mod)
for i in range(0, n):
p = n - i
ifacto[p - 1] = ifacto[p] * p % mod
def mod_inv(a, b, mod):
return (a * pow(b, mod - 2, mod)) % mod
def choose(a, b, mod):
return facto[a] * ifacto[a - b] % mod * ifacto[b] % mod
def multi_choose(a, b, mod):
return choose(a + b - 1, b, mod)
def main():
mod = 1000000007
n, k = read_int_list()
precompute_facto(n, mod)
ans = 0
for i in range(0, min(k, n - 1) + 1):
ans = (ans + choose(n, i, mod) * multi_choose(n - i, i, mod)) % mod
print(ans)
if __name__ == "__main__":
main()
| 0 | null | 69,714,106,661,550 | 220 | 215 |
a, b = map(int, input().split())
print(int(a / b), (a % b), "%.10f" % (a / b)) | N = int(input())
A = list(map(int, input().split()))
max_list = []
m = 0
ans = 0
for a in A:
ans += max(m - a, 0)
max_list.append(m)
m = max(m, a)
print(ans) | 0 | null | 2,620,438,639,196 | 45 | 88 |
def main():
a,b,c = map(int,input().split(" "))
if (c-a-b)**2 > a*b*4 and c > a + b:
print("Yes")
else:
print("No")
main() | # Author: cr4zjh0bp
# Created: Mon Mar 23 15:10:04 UTC 2020
import sys
stdin = sys.stdin
inf = 1 << 60
mod = 1000000007
ni = lambda: int(ns())
nin = lambda y: [ni() for _ in range(y)]
na = lambda: list(map(int, stdin.readline().split()))
nan = lambda y: [na() for _ in range(y)]
nf = lambda: float(ns())
nfn = lambda y: [nf() for _ in range(y)]
nfa = lambda: list(map(float, stdin.readline().split()))
nfan = lambda y: [nfa() for _ in range(y)]
ns = lambda: stdin.readline().rstrip()
nsn = lambda y: [ns() for _ in range(y)]
ncl = lambda y: [list(ns()) for _ in range(y)]
nas = lambda: stdin.readline().split()
from decimal import *
a, b, c = na()
d, e, f = Decimal(a), Decimal(b), Decimal(c)
if d.sqrt() + e.sqrt() < f.sqrt():
print("Yes")
else:
print("No") | 1 | 51,559,685,077,380 | null | 197 | 197 |
N = int(input())
t = ""
while N > 0:
t += chr((N-1)%26 + 97)
N = (N-1)//26
print(t[::-1]) | x,y = map(int,input().split())
if (x+y)%3!=0:print(0);exit()
mod = 10**9+7
n = (x+y)//3
m = min(x-n,y-n)
frac = [1]*(n+1)
finv = [1]*(n+1)
for i in range(n):
frac[i+1] = (i+1)*frac[i]%mod
finv[-1] = pow(frac[-1],mod-2,mod)
for i in range(1,n+1):
finv[n-i] = finv[n-i+1]*(n-i+1)%mod
def nCr(n,r):
if n<0 or r<0 or n<r: return 0
r = min(r,n-r)
return frac[n]*finv[n-r]*finv[r]%mod
print(nCr(n,m)%mod) | 0 | null | 81,099,052,287,408 | 121 | 281 |
s=input()
print(('RRR'in s)+('RR'in s)+('R'in s)) | input_number = int(raw_input())
answer = input_number * input_number * input_number
print answer | 0 | null | 2,566,787,947,362 | 90 | 35 |
import numpy as np
import numba
from numba import njit, b1, i4, i8, f8
@njit((i8, i8, i8, i8[:,:]), cache=True)
def solve(R,C,K,item):
dp = np.zeros((C+1,5), dtype=np.int64)
for i in range(1,R+1):
new_dp = np.zeros((C+1,5), dtype=np.int64)
#上からアイテムを取らずに移動
new_dp[:,0] = dp[:,-1]
#上からアイテムを取って移動
new_dp[1:,1] = np.maximum(new_dp[1:,1],dp[1:,-1]+item[i-1])
for j in range(1,C+1):
#横からアイテムを取らずに移動
new_dp[j] = np.maximum(new_dp[j],new_dp[j-1])
#横からアイテムを取って移動
for k in range(1,4):
new_dp[j,k] = max(new_dp[j,k],new_dp[j-1,k-1]+item[i-1,j-1])
for k in range(4):
new_dp[:,-1] = np.maximum(new_dp[:,-1],new_dp[:,k])
dp = new_dp
ans = dp[-1,-1]
return ans
R, C, K = map(int, input().split())
item = np.zeros((R,C), dtype=np.int64)
for i in range(K):
r,c,v = map(int, input().split())
item[r-1,c-1] = v
print(solve(R,C,K,item)) | # -*- coding: utf-8 -*-
import sys
from collections import defaultdict
R,C,K=map(int, sys.stdin.readline().split())
value=defaultdict(lambda: 0)
value=[ [0 for _ in range(C+1)] for __ in range(R+1) ]
for _ in range(K):
r,c,v=map(int, sys.stdin.readline().split())
value[r][c]=v
dp0=[0]*(C+1)
dp1=[0]*(C+1)
dp2=[0]*(C+1)
dp3=[0]*(C+1)
for r in range(1,R+1):
for c in range(1,C+1):
#今のマスにアイテムがある場合
if 0<value[r][c]:
dp3[c]=max( dp3[c-1], dp2[c-1]+value[r][c] )
dp2[c]=max( dp2[c-1], dp1[c-1]+value[r][c] )
#dp1[c]=max( dp1[c-1], dp0[c-1]+value[r][c], dp0[c]+value[r][c] )
dp1[c]=max( dp1[c-1], dp0[c]+value[r][c] )
#dp0[c]=max( dp0[c-1], dp0[c] )
dp0[c]=dp0[c]
#今のマスにアイテムがない場合
else:
#dp0[c]=max( dp0[c-1], dp0[c] )
#dp1[c]=max( dp1[c-1], dp1[c] )
#dp2[c]=max( dp2[c-1], dp2[c] )
#dp3[c]=max( dp3[c-1], dp3[c] )
dp0[c]=dp0[c]
dp1[c]=dp1[c-1]
dp2[c]=dp2[c-1]
dp3[c]=dp3[c-1]
#上の行にアイテムをコピー
for c in range(1,C+1):
dp0[c]=max( dp0[c], dp1[c], dp2[c], dp3[c] )
dp1=[0]*(C+1)
dp2=[0]*(C+1)
dp3=[0]*(C+1)
print dp0[C]
| 1 | 5,505,661,037,030 | null | 94 | 94 |
a,b,c,k = map(int,input().split())
print(k if k<a else a if a+b>k else a-(k-a-b))
| import sys
ans=0
A, B, C, K = (int(x) for x in input().split())
if A>K:
print(K)
sys.exit(0)
else:
K-=A
ans+=A
if B>K:
print(ans)
sys.exit(0)
else:K-=B
if C>K:
print(ans-K)
sys.exit()
else:
ans-=C
print(ans) | 1 | 21,930,926,176,422 | null | 148 | 148 |
n = int(input())
S=[]
for i in range(n):
S.append(input())
S.sort()
c=1
for i in range(n-1):
if S[i]!=S[i+1] :
c+=1
print( c ) | l = []
for i in range(int(input())): l.append(input())
print(len(set(l))) | 1 | 30,186,129,886,172 | null | 165 | 165 |
import sys
input = sys.stdin.readline
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def main():
N=I()
L=[]
R=[]
for i in range(N):
a,b=MI()
L.append(a)
R.append(b)
L.sort()
R.sort()
#中央値の最小値は，Lの中央値．中央値の最大値はRの中央値
#間は全部埋められそう?
if N%2==0:
Lm=(L[N//2]+L[N//2-1])
Rm=(R[N//2]+R[N//2-1])
else:
Lm=L[N//2]
Rm=R[N//2]
ans=Rm-Lm+1
print(ans)
main()
| n,k=map(int,input().split());print(len([i for i in list(map(int,input().split())) if i>=k])) | 0 | null | 98,217,305,583,940 | 137 | 298 |
s = input()
if s == "SUN":
print(7)
if s == "MON":
print(6)
if s == "TUE":
print(5)
if s == "WED":
print(4)
if s == "THU":
print(3)
if s == "FRI":
print(2)
if s == "SAT":
print(1) |
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def main():
mod=10**9+7
N,M=MI()
S=list(input())
S2=S[::-1]
now=0
ans=[]
while now!=N:
nxt=now+M
if nxt>N:
nxt=N
while S2[nxt]=="1":
nxt-=1
if now==nxt:
ans=[-1]
break
ans.append(nxt-now)
now=nxt
print(' '.join(map(str, ans[::-1])))
main()
| 0 | null | 136,698,300,421,320 | 270 | 274 |
import math
n = input()
x = map(float, raw_input().split())
y = map(float, raw_input().split())
temp = p1 = p2 = p3 = pinf = 0
for i,j in zip(x, y):
temp = math.fabs(i - j)
p1 += temp
p2 += temp ** 2
p3 += temp ** 3
if temp > pinf:
pinf = temp
print u"%f\n%f\n%f\n%f" % (p1, p2**(1.0/2), p3**(1.0/3), pinf) | n = int(input())
ans = 0
if n % 2 == 0:
for i in range(1, 36):
k = 5**i*2
ans += n//k
print(ans)
else:
print(ans) | 0 | null | 58,071,502,651,492 | 32 | 258 |
import math
N = int(input())
total = N/2*(N+1)
f = math.floor(N/3)
f = (3*f+3)*f/2
b = math.floor(N/5)
b = (5*b+5)*b/2
fb = math.floor(N/15)
fb = (15*fb+15)*fb/2
print(int(total-f-b+fb))
| sm=0
for i in range(1,int(input())+1):
if (i%3)*(i%5)>0:
sm+=i
print(sm) | 1 | 34,804,585,330,116 | null | 173 | 173 |
n = int(input())
s = input()
if n % 2 != 0:
print("No")
else:
t = s[:int((n / 2))]
u = t + t
print("Yes" if s == u else "No") | n = int(input())
s = input()
if len(s) % 2 == 0:
if s[:int(n/2)] == s[int(n/2):]:
print("Yes")
else:
print("No")
else:
print("No") | 1 | 146,983,585,894,948 | null | 279 | 279 |
n=int(input())
s=input()
ans=""
for i in s:
ans+=chr(ord("A")+(ord(i)-ord("A")+n)%26)
print(ans) | import sys
def input(): return sys.stdin.readline().strip()
def mapint(): return map(int, input().split())
sys.setrecursionlimit(10**9)
N = int(input())
S = list(input())
lis = []
for s in S:
idx = ord(s)
if idx+N>90:
idx -= 26
lis.append(chr(idx+N))
print(''.join(lis)) | 1 | 133,896,308,705,490 | null | 271 | 271 |
n = int(input())
s = input()
ans = 0
for i in range(n-2):
if s[i:i+3] == "ABC":
ans += 1
print(ans) | def resolve():
import sys
input = sys.stdin.readline
# 整数 1 つ
n = int(input())
s = input()
# 整数複数個
# a, b = map(int, input().split())
# 整数 N 個 (改行区切り)
# N = [int(input()) for i in range(N)]
# 整数 N 個 (スペース区切り)
# N = list(map(int, input().split()))
# 整数 (縦 H 横 W の行列)
# A = [list(map(int, input().split())) for i in range(H)]
cnt = 0
for i in range(n-2):
if s[i]+s[i+1]+s[i+2] == "ABC":
cnt += 1
print(cnt)
resolve() | 1 | 99,367,723,461,200 | null | 245 | 245 |
import collections
n,k=map(int,input().split())
a=list(map(int,input().split()))
m=[0]
for i in range(n):
m.append((m[-1]+a[i]))
for i in range(n+1):
m[i]-=i
m[i]%=k
ans=0
dict=collections.defaultdict(int)
for i in range(1,n+1):
x=m[i]
if i<=k-1:
dict[m[i-1]]+=1
else:
dict[m[i-1]]+=1
dict[m[i-k]]-=1
ans+=dict[x]
print(ans) | N, K = map(int, input().split())
vec = [0] * N
for _ in range(K):
d = int(input())
A = list(map(int, input().split()))
for i in range(d):
vec[A[i]-1] += 1
print(vec.count(0))
| 0 | null | 81,046,282,377,180 | 273 | 154 |
n = int(input())
a = 0
w = 0
t = 0
r = 0
for i in range(n):
s = input()
if s == 'AC':
a+=1
elif s =='WA':
w +=1
elif s =='TLE':
t +=1
else:
r+=1
print('AC x '+str(a))
print('WA x '+str(w))
print('TLE x '+str(t))
print('RE x '+str(r)) | n=int(input())
ans=[]
for i in range(n):
ans.append(input())
def func(ans,moji):
num=ans.count(moji)
print(moji,"x",str(num))
mojis=["AC","WA","TLE","RE"]
for moji in mojis:
func(ans,moji) | 1 | 8,700,646,440,858 | null | 109 | 109 |
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
def main():
R = int(input())
print(int(R**2))
if __name__ == "__main__":
main()
| val = input()
print(val*val) | 1 | 145,054,910,764,182 | null | 278 | 278 |
n,m=map(int,input().split())
aa=[[] for i in range(n)]
for x in range(m):
a,b=input().split()
d=int(a)-1
aa[d].append(b)
ans_ac=0
ans_wa=0
for y in range(n):
ans1=0
ans2=0
for z in range(len(aa[y])):
if aa[y][z]=='WA':
ans1+=1
else:
ans2+=1
break
if ans2==1:
ans_wa+=ans1
ans_ac+=1
print(str(ans_ac)+' '+str(ans_wa))
| import numpy as np
def solve():
dp = np.zeros((2, N+1))
# print(dp)
ac = 0
wa = 0
for i in range(M):
if (dp[0][S[i][0]] == 0):
if(S[i][1] == "WA"):
dp[1][S[i][0]] += 1
elif(S[i][1] == "AC"):
ac += 1
dp[0][S[i][0]] = 1
wa += dp[1][S[i][0]]
print(ac, int(wa))
if __name__=="__main__":
N, M = list(map(int, input().split()))
S = []
for i in range(M):
a,b = input().split()
S.append([int(a), b])
# print(S)
solve()
| 1 | 93,238,148,050,138 | null | 240 | 240 |
n = int(input())
d = {}
t = 0
for i in range(n):
s = input()
d[s] = d.get(s, 0) + 1
t = max(t, d[s])
for key in sorted(d):
if d[key] == t:
print(key) | n = int(input())
# 入力データ受取り時に、辞書に追加していくやり方
s_dict = {}
for i in range(n):
s = input()
if s not in s_dict:
s_dict[s] = 1
s_dict[s] += 1
max_value = max(s_dict.values())
ans = []
for key, value in s_dict.items():
if value == max_value:
ans.append(key)
ans.sort()
for i in ans:
print(i) | 1 | 70,230,382,581,726 | null | 218 | 218 |
n, k = map(int, input().split())
a = list(map(int, input().split()))
s = [0] * (n+1)
for i in range(n):
s[i+1] = s[i] + a[i]
s[i] = (s[i] - i) % k
s[n] = (s[n] - n) % k
count = dict()
for i in range(min(k-1, n+1)):
if not s[i] in count:
count[s[i]] = 0
count[s[i]] += 1
ans = 0
for i in range(k-1, n+1):
if not s[i] in count:
count[s[i]] = 0
count[s[i]] += 1
count[s[i-k+1]] -= 1
ans += count[s[i-k+1]]
for i in count.values():
ans += i * (i - 1) // 2
print(ans) | n, k = map(int, input().split())
nums = list(map(int, input().split()))
# (sums[j] - sums[i]) % K = j - i
# (sums[j] - j) % K = (sums[i] - i) % K
# 1, 4, 2, 3, 5
# 0, 1, 5, 7, 10, 15
# 0, 0, 3, 0, 2, 2
sums = [0]
for x in nums:
sums.append(sums[-1] + x)
a = [(sums[i] - i) % k for i in range(len(sums))]
res = 0
memo = {}
i = 0
for j in range(len(a)):
memo[a[j]] = memo.get(a[j], 0) + 1
if j - i + 1 > k:
memo[a[i]] -= 1
i += 1
res += memo[a[j]] - 1
print(res) | 1 | 137,479,429,508,960 | null | 273 | 273 |
import sys
input = sys.stdin.readline
from collections import deque
N = int(input())
G = [[] for _ in range(N)] # 辺の相手を保存
for i in range(N-1):
a, b = map(lambda x: int(x) - 1, input().split())
G[a].append([b, i])
G[b].append([a, i])
stack = deque([[0, 0]])
visited = [0] * N
visited[0] = 1
ans = [0] * (N-1)
while stack:
i, pc = stack.pop()
c = 1
for ni, ln in G[i]:
if not visited[ni]:
visited[ni] = 1
if c == pc:
c += 1
ans[ln] = c
c += 1
stack.append([ni, ans[ln]])
print(max(ans))
for c in ans:
print(c)
| n = int(input())
A = []
g =[[] for _ in range(n+1)]
ans = {}
for _ in range(n-1):
a,b = map(int,input().split())
g[a].append(b)
A.append([a,b])
from collections import deque
q = deque()
q.append(1)
color = [-1]*(n+1)
color[1] = 0
cnt = 0
while q:
v = q.popleft()
p = 1
for u in g[v]:
if p==color[v]:
p += 1
color[u] = p
ans[v,u] = p
q.append(u)
cnt = max(cnt,p)
p += 1
print(cnt)
for i in range(n-1):
tmp = (A[i][0],A[i][1])
print(ans[tmp]) | 1 | 136,234,735,568,320 | null | 272 | 272 |
# -*- coding: utf-8 -*-
n = int(input())
A = [int(n) for n in input().split()]
q = int(input())
M = [int(n) for n in input().split()]
numbers = [0]
for a in A:
numbers = numbers + [n+a for n in numbers]
for m in M:
if m in numbers:
print("yes")
else:
print("no") | from itertools import combinations
n=int(input())
a=list(map(int,input().split()))
q=int(input())
m=list(map(int,input().split()))
s=set()
for i in range(1,n+1):
for j in combinations(a,i):
s.add(sum(j))
for i in m:
if i in s:
print("yes")
else:
print("no")
| 1 | 96,900,948,008 | null | 25 | 25 |
n, m, l = map(int, input().split())
a = [[int(num) for num in input().split()] for i in range(n)]
b = [[int(num) for num in input().split()] for i in range(m)]
c = [[0 for i in range(l)] for j in range(n)]
for i in range(l):
for j in range(n):
for k in range(m):
c[j][i] += a[j][k] * b[k][i]
for i in range(n):
for j in range(l):
if j == l - 1:
print(c[i][j])
else:
print("{0} ".format(c[i][j]), end = "") | n, m, l = map(int, input().split())
A = [list(map(int, input().split())) for _ in range(n)]
B = [list(map(int, input().split())) for _ in range(m)]
ans = []
for i in range(n):
new_row = []
for j in range(l):
tmp_ans = 0
for k in range(m):
tmp_ans += A[i][k] * B[k][j]
new_row.append(tmp_ans)
ans.append(new_row)
for i in range(n):
print(' '.join(str(x) for x in ans[i])) | 1 | 1,427,048,280,798 | null | 60 | 60 |
dice = list(input().split(' '))
a = list('NNNNWNNNWNNNENNNENNNWNNN')
for _ in range(int(input())):
aa,bb = input().split(' ')
for i in a:
if i == 'W':
dice = [dice[2],dice[1],dice[5],dice[0],dice[4],dice[3]]
elif i == 'S':
dice = [dice[4],dice[0],dice[2],dice[3],dice[5],dice[1]]
elif i == 'N':
dice = [dice[1],dice[5],dice[2],dice[3],dice[0],dice[4]]
elif i == 'E':
dice = [dice[3],dice[1],dice[0],dice[5],dice[4],dice[2]]
if dice[0] == aa and dice[1] == bb:
print(dice[2])
| N = int(input())
S = [None] * N
for i in range(N):
S[i] = input()
S = set(S)
print(len(S))
| 0 | null | 15,341,612,723,328 | 34 | 165 |
def main():
H, W, M = map(int, input().split())
hw = [tuple(list(map(int, input().split()))) for _ in [0]*M]
hw_set = set(hw)
h_count = [0 for i in range(H+1)]
w_count = [0 for i in range(W+1)]
for h, w in hw:
h_count[h] += 1
w_count[w] += 1
h_m = max(h_count)
w_m = max(w_count)
h_list = []
w_list = []
for i in range(H+1):
if h_count[i] == h_m:
h_list.append(i)
for i in range(W+1):
if w_count[i] == w_m:
w_list.append(i)
#print(h_list, w_list)
for i in h_list:
for j in w_list:
if (i, j) not in hw_set:
print(h_m+w_m)
return
print(h_m+w_m-1)
main()
| H, W, M = map(int, input().split())
h_list = [0] * H
w_list = [0] * W
target = []
for _ in range(M):
h, w = map(int, input().split())
h_list[h-1] += 1
w_list[w-1] += 1
target += [[h-1,w-1]]
h_max = max(h_list)
w_max = max(w_list)
h_max_list = set([i for i, v in enumerate(h_list) if v == h_max])
w_max_list = set([i for i, v in enumerate(w_list) if v == w_max])
place = len(h_max_list) * len(w_max_list)
candidate = 0
for h,w in target:
if (h in h_max_list) and (w in w_max_list):
candidate +=1
print(h_max+w_max-(place == candidate)) | 1 | 4,734,075,498,838 | null | 89 | 89 |
def floyd_warshall(G):
for k in range(N):
for i in range(N):
for j in range(N):
G[i][j]=min(G[i][j],G[i][k]+G[k][j])
import sys
input=sys.stdin.readline
INF=10**30
N,M,L=map(int,input().split())
dp1=[[INF]*N for i in range(N)]
for i in range(N):
dp1[i][i]=0
for _ in range(M):
A,B,C=map(int,input().split())
A,B=A-1,B-1
dp1[A][B]=C
dp1[B][A]=C
floyd_warshall(dp1)
dp2=[[INF]*N for i in range(N)]
for i in range(N):
for j in range(N):
if i==j:
dp2[i][j]=0
else:
dp2[i][j]=1 if dp1[i][j]<=L else INF
floyd_warshall(dp2)
Q=int(input())
for _ in range(Q):
s,t=map(lambda x:int(x)-1,input().split())
print (dp2[s][t]-1 if dp2[s][t]!=INF else -1) | import sys
from copy import deepcopy
def main():
INF = 10**18
input = sys.stdin.readline
N, M, L = [int(x) for x in input().split()]
d = [set() for _ in range(N+1)]
ds = [[INF] * (N+1) for _ in range(N+1)]
bs = [[INF] * (N+1) for _ in range(N+1)]
for _ in range(M):
A, B, C = [int(x) for x in input().split()]
A, B = sorted([A, B])
d[A].add(B)
if L >= C:
ds[A][B] = C
nes = set()
for k in range(1, N+1):
for i in range(1, N+1):
for j in range(i+1, N+1):
ds[i][j] = min(ds[i][j], ds[min(i, k)][max(i, k)] + ds[min(k, j)][max(k, j)])
if ds[i][j] <= L:
bs[i][j] = 1
for k in range(1, N+1):
for i in range(1, N+1):
for j in range(i+1, N+1):
bs[i][j] = min(bs[i][j], bs[min(i, k)][max(i, k)] + bs[min(k, j)][max(k, j)])
Q, = [int(x) for x in input().split()]
for _ in range(Q):
s, t = sorted(int(x) for x in input().split())
print(bs[s][t]-1 if bs[s][t] < INF else -1)
if __name__ == '__main__':
main()
| 1 | 173,689,239,619,576 | null | 295 | 295 |
# -*- coding: utf-8 -*-
from sys import stdin
input = stdin.readline
MOD = 10**9+7
def main():
n = int(input().strip())
buf = 9**n
ans = 10**n - buf - buf + 8**n
print(ans%MOD)
if __name__ == "__main__":
main()
| def BubbleSort(C, N):
for i in xrange(0, N):
for j in reversed(xrange(i+1, N)):
if C[j][1] < C[j-1][1]:
C[j], C[j-1] = C[j-1], C[j]
def SelectionSort(C, N):
for i in xrange(N):
minj = i
for j in xrange(i, N):
if C[j][1] < C[minj][1]:
minj = j
C[i], C[minj] = C[minj], C[i]
def isStable(C, N):
flag = 0
for i in xrange(1, 14):
Ct = [C[j] for j in xrange(N) if C[j][1] == str(i)]
if len(Ct) > 1:
for k in xrange( len(Ct)-1 ):
if Ct[k][2] > Ct[k+1][2]:
flag = 1
if flag == 0: print "Stable"
else: print "Not stable"
# MAIN
N = input()
C = []
Ct = map(str, raw_input().split())
for i in xrange(N):
C.append([Ct[i][0], Ct[i][1::], i])
Ct = list(C)
BubbleSort(Ct, N)
print " ".join([Ct[i][0]+Ct[i][1] for i in xrange(N)])
isStable(Ct, N)
Ct = list(C)
SelectionSort(Ct, N)
print " ".join([Ct[i][0]+Ct[i][1] for i in xrange(N)])
isStable(Ct, N) | 0 | null | 1,609,660,959,888 | 78 | 16 |
import sys
sys.setrecursionlimit(10 ** 9)
class UnionFind():
def __init__(self, n):
self.n = n
self.root = [-1]*(n+1)
self.rank = [0]*(n+1)
def find(self, x):#親となる要素を探索
if self.root[x] < 0:
return x
else:
self.root[x] = self.find(self.root[x])#再帰
return self.root[x]
def unite(self, x, y):
x = self.find(x)
y = self.find(y)
if x == y:
return
elif self.rank[x] > self.rank[y]:#深い木に連結
self.root[x] += self.root[y]
self.root[y] = x#yの親をxとする
else:
self.root[y] += self.root[x]
self.root[x] = y
if self.rank[x] == self.rank[y]:
self.rank[y] += 1
def issame(self, x, y):#x, yが同じ集合か判定
return self.find(x) == self.find(y)
def count(self, x):#要素の個数
return (-1)*self.root[self.find(x)]
n, m = map(int, input().split())
uf = UnionFind(n)
for i in range(m):
a, b = map(int, input().split())
uf.unite(a-1, b-1)
ans = set()
for i in range(n):
ans.add(uf.find(i))
print(len(ans)-1) | import sys
N,K=map(int,input().split())
if N<K:
print(1)
sys.exit()
M=K
R=1
while M<=N:
M*=K
R+=1
print(R) | 0 | null | 33,286,628,276,870 | 70 | 212 |
r,_=map(int,input().split())
m=[list(map(int,input().split()))for _ in[0]*r]
for s in m:s.append(sum(s))or print(*s)
print(*[sum(c)for c in zip(*m)])
| n, m = map(int, input().split())
a = []
b = []
for i in range(n):
a += [list(map(int, input().split()))]
a[i] += [sum(a[i])]
for i in range(m+1):
b += [sum(x[i] for x in a)]
a += [b]
for i in range(n+1):
print(*a[i])
| 1 | 1,352,982,449,960 | null | 59 | 59 |
n = int(input())
card = ['' for i in range(n)]
score1 = 0
score2 = 0
def win(score):
score += 3
return score
def draw(score):
score += 1
return score
for i in range(n):
card[i] = [j for j in input().split()]
for i in range(n):
if card[i][0] == card[i][1]:
score1 = draw(score1)
score2 = draw(score2)
else:
if card[i][0] > card[i][1]:
score1 = win(score1)
else:
score2 = win(score2)
print(score1,score2) | N=int(input())
for x in range(1,N+1):
if int(1.08*x)==N:
print(x)
break
if x==N:
print(":(")
| 0 | null | 63,792,281,063,588 | 67 | 265 |
n, m = list(map(int,input().split()))
array = [list(map(int,input().split())) for i in range(n)]
b = [int(input()) for i in range(m)]
array_2 = [[0 for i in range(m)] for j in range(n)]
for i in range(n):
d = 0
for j in range(m):
c = array[i][j]*b[j]
d += c
print(d) | from statistics import median
#import collections
#aa = collections.Counter(a) # list to list || .most_common(2)で最大の2個とりだせるお a[0][0]
from fractions import gcd
from itertools import combinations # (string,3) 3回
from collections import deque
from collections import defaultdict
import bisect
#
# d = m - k[i] - k[j]
# if kk[bisect.bisect_right(kk,d) - 1] == d:
#
#
#
# pythonで無理なときは、pypyでやると正解するかも！！
#
#
import sys
sys.setrecursionlimit(10000000)
mod = 10**9 + 7
def readInts():
return list(map(int,input().split()))
def I():
return int(input())
dic = {'SUN':0,'MON':1,'TUE':2,'WED':3,'THU':4,'FRI':5,'SAT':6}
print(7 - dic[input()])
| 0 | null | 66,961,778,507,582 | 56 | 270 |
import sys
def main():
n = int(sys.stdin.readline())
i = 1
while i <= n:
x = i
if x % 3 == 0:
print(' {}'.format(i), end='')
else:
while x > 1:
if int(x) % 10 == 3:
print(' {}'.format(i), end='')
break
x /= 10
i += 1
print()
return
if __name__ == '__main__':
main()
| def main():
N = int(input())
def enum_divisors(n):
# 約数列挙
divs = []
for i in range(1, n+1):
if i*i > n:
break
if n % i == 0:
divs.append(i)
if n//i != i:
# i が平方数でない
divs.append(n//i)
return divs
ans = 0
for k in enum_divisors(N-1):
if 2 <= k:
ans += 1
for k in enum_divisors(N):
if 2 <= k:
n = N
while n > 1 and n % k == 0:
n //= k
if n % k == 1:
ans += 1
print(ans)
if __name__ == '__main__':
main()
| 0 | null | 20,986,960,910,630 | 52 | 183 |
import sys
def isEmpty(S):
if len(S) == 0:
return True
def isFull(S):
if len(S) >= 101:
return True
def push(x):
if isFull(S):
print 'Error'
S.append(x)
def pop(top):
if isEmpty(S):
print 'error'
k = S[top]
S.pop()
return k
S = []
top = -1
x = sys.stdin.readline().strip()
x_list = x.split(" ")
for i in range(0, len(x_list)):
if x_list[i] == '*':
a = int(pop(top))
top -= 1
b = int(pop(top))
top -= 1
push(a * b)
top += 1
elif x_list[i] == '+':
a = int(pop(top))
top -= 1
b = int(pop(top))
top -= 1
push(a + b)
top += 1
elif x_list[i] == '-':
a = int(pop(top))
top -= 1
b = int(pop(top))
top -= 1
push(b - a)
top += 1
else:
push(x_list[i])
top += 1
a = int(pop(top))
print a | from itertools import permutations
if __name__ == "__main__":
N = int(input())
P = tuple(map(int,input().split()))
Q = tuple(map(int,input().split()))
arr = [i for i in range(1,N+1)]
pattern_arr = list(permutations(arr))
a,b = -1,-1
for i,pattern in enumerate(pattern_arr):
if pattern == P:
a = i
if pattern == Q:
b = i
print(abs(a-b)) | 0 | null | 50,245,596,972,814 | 18 | 246 |
n = int(input())
a = list(map(int,input().split()))
dota = 1
if 0 in set(a):
dota = 0
else:
for ai in a:
dota *= ai
if dota > 10**18:
dota = -1
break
print(dota) | def solve():
N = int(input())
A = [int(i) for i in input().split()]
ans = 1
for i in range(N):
if ans == -1 and A[i] != 0:
continue
ans *= A[i]
if ans > 10**18:
ans = -1
print(ans)
if __name__ == "__main__":
solve() | 1 | 16,321,342,042,098 | null | 134 | 134 |
N,M,K = map(int, input().split())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
a = [0]
b = [0]
for i in range(N):
a.append(a[i] + A[i])
for j in range(M):
b.append(b[j] + B[j])
ans = 0
j = M
for i in range(N+1):
if a[i] > K:
break
while a[i] + b[j] > K:
j -= 1
ans = max(ans, i+j)
print(ans) | def main():
N, M, K = map(int, input().split())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
total_T_in_A = [0] * (N+1)
total_T_in_B = [0] * (M+1)
for i in range(1, N+1):
total_T_in_A[i] = total_T_in_A[i-1] + A[i-1]
for i in range(1, M+1):
total_T_in_B[i] = total_T_in_B[i-1] + B[i-1]
result = 0
for i in range(N+1):
# A から i 冊読むときにかかる時間
i_A_T = total_T_in_A[i]
if K < i_A_T:
continue
if K == i_A_T:
result = max(result, i)
continue
rem_T = K - i_A_T
# total_T_in_B は累積和を格納した、ソート済の配列
# B_i <= rem_T < B_i+1 となるような B_i を二分探索によって探す
first = total_T_in_B[1]
last = total_T_in_B[M]
if rem_T < first:
result = max(result, i)
continue
if last <= rem_T:
result = max(result, i + M)
continue
# assume that first <= rem_T <= last
first = 1
last = M
while first < last:
if abs(last - first) <= 1:
break
mid = (first + last) // 2
if rem_T < total_T_in_B[mid]:
last = mid
else:
first = mid
result = max(result, i + first)
print(result)
main()
| 1 | 10,758,702,465,330 | null | 117 | 117 |
#ciが R のとき赤、W のとき白です。
#入力
#N
#c1...cN
N = int(input())
C = input()
Rednum = C.count('R')
#print(Rednum)
#Rの数 - 左にある赤の数が答
NewC = C[:Rednum]
#print(NewC)
Whinum = NewC.count('R')
print(Rednum - Whinum)
| N = int(input())
C = input()
f = 0
b = N - 1
ans = 0
while True:
while f <= N -1 and C[f] == "R":
f += 1
while b >= 0 and C[b] == "W":
b -= 1
if f > b:
print(ans)
break
ans += 1
f += 1
b -= 1 | 1 | 6,361,564,821,560 | null | 98 | 98 |
print(8 - (int(input()) - 400) // 200)
| s = input()
t = ["x" for _ in range(len(s))]
print(''.join(t))
| 0 | null | 39,970,584,254,942 | 100 | 221 |
def solve(n):
if n % 2 == 1:
return 0
div_2 = 0
cur = 2
while cur <= n:
div_2 += (n // cur)
cur = cur * 2
div_5 = 0
cur = 5
while cur <= n:
div_5 += (n // cur) // 2
cur = cur * 5
return min(div_2, div_5)
n = int(input())
print(solve(n))
| N = int(input())
if N % 2 == 1:
print(0)
else:
n = 0
i = 1
while True:
if N < 2*5**i:
break
n += (N // 5**i // 2)
i += 1
print(n)
| 1 | 116,007,260,142,782 | null | 258 | 258 |
from functools import reduce
n = int(input())
a = list(map(int,input().split()))
b = [0]*n
a_xor=reduce(lambda x,y : x^y,a)
for i in range(n):
b[i]=a[i]^a_xor
## b[i] = reduce(lambda x,y : x^y,a[0:i+1]+a[i:])
print(" ".join(list(map(str,b)))) | from functools import reduce
n = input()
a = list(map(int, input().split()))
s = int(reduce(lambda i,j: i^j, a))
print(' '.join(list(map(lambda x: str(x^s), a)))) | 1 | 12,456,092,638,078 | null | 123 | 123 |
N = int(input())
u = []
v = []
for _ in range(N):
x,y = map(int,input().split())
u.append(x+y)
v.append(x-y)
umax = max(u)
umin = min(u)
vmax = max(v)
vmin = min(v)
print(max(umax-umin,vmax-vmin))
| def main():
n = int(input())
X, Y = [], []
for _ in range(n):
x, y = map(int, input().split())
X.append(x + y)
Y.append(x - y)
X.sort()
Y.sort()
print(max(X[-1] - X[0], Y[-1] - Y[0]))
if __name__ == '__main__':
main()
| 1 | 3,418,050,956,612 | null | 80 | 80 |
A = int(input())
B = int(input())
print(*(set([1,2,3])-set([A,B]))) | from collections import deque
from bisect import bisect_left
n = int(input())
l = sorted(map(int, input().split()))
ld = deque(l)
cnt = 0
for a in range(n - 2):
l_a = ld.popleft()
for b in range(a + 1, n - 1):
cnt += bisect_left(l, l_a + l[b]) - b - 1
print(cnt) | 0 | null | 140,950,186,673,952 | 254 | 294 |
#!/usr/bin/env python
# -*- coding: utf-8 -*-
N, M, K = map(int, input().split())
result = 0 # max
a_time = list(map(int, input().split()))
b_time = list(map(int, input().split()))
sum = 0
a_num = 0
for i in range(N):
sum += a_time[i]
a_num += 1
if sum > K:
sum -= a_time[i]
a_num -= 1
break
i = a_num
j = 0
while i >= 0:
while sum < K and j < M:
sum += b_time[j]
j += 1
if sum > K:
j -= 1
sum -= b_time[j]
if result < i + j:
result = i + j
i -= 1
sum -= a_time[i]
print(result)
| # 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)
| 1 | 10,733,740,805,832 | null | 117 | 117 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.