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
|
|---|---|---|---|---|---|---|
D,T,S = map(int, input().split())
if T-D/S >= 0:
print("Yes")
else:
print("No") | n = int(input())
s = input()
if n % 2 == 1:
print('No')
else:
head = s[:n // 2]
tail = s[n // 2:]
if head == tail:
print('Yes')
else:
print('No')
| 0 | null | 74,912,470,341,760 | 81 | 279 |
N,M = map(int, input().split())
S = list(input())
S.reverse()
ans = []
i = 0
while i < N:
num = 0
for j in range(min(N, i+M), i, -1):
if S[j] == "0":
num = j-i
i = j
break
if num == 0:
ans = -1
break
ans.append(num)
if ans == -1:
print(ans)
else:
ans.reverse()
print(*ans) | dice = list(map(int, input().split()))
q = int(input())
class Dice():
def __init__(self, dice, top, front):
self.dice = dice
self.top = top
self.front = front
def get_right(self):
right_list =[
(1, 2, 4, 3), #0
(0, 3, 5, 2), #1
(0, 1, 5, 4), #2
(0, 4, 5, 1), #3
(0, 2, 5, 3), #4
(1, 3, 4, 2) #5
]
for i in range(6):
if self.dice[i] == self.top:
for j in range(4):
if self.dice[right_list[i][j]] == self.front:
print(self.dice[right_list[i][j-3]])
for i in range(q):
top, front = map(int, input().split())
dice_right = Dice(dice, top, front)
dice_right.get_right()
| 0 | null | 69,624,462,193,260 | 274 | 34 |
h,a=map(int,input().split())
wa=list(map(int,input().split()))
if sum(wa)>=h:
print("Yes")
else:
print("No") | s,t = map(str,input().split())
print(t+s) | 0 | null | 91,065,802,657,620 | 226 | 248 |
from collections import defaultdict
from collections import deque
from collections import Counter
import itertools
import math
def readInt():
return int(input())
def readInts():
return list(map(int, input().split()))
def readChar():
return input()
def readChars():
return input().split()
n,k = readInts()
r,s,p = readInts()
t = list(input())
his = ["-1"]
ans = 0
for i in range(len(t)):
if t[i]=="r":
me = "p"
point = p
elif t[i]=="s":
me = "r"
point = r
else:
me = "s"
point = s
if his[max(0,i-k+1)]==me:
his.append(i)
else:
ans+=point
his.append(me)
print(ans) | D=int(input())
c=list(map(int,input().split()))
s=[]
for i in range(D):
s.append(list(map(int,input().split())))
last=[0]*26
ans=0
for d in range(1,D+1):
t=int(input())
last[t-1]=d
temp=0
for i in range(26):
if i==t-1:
temp=s[d-1][t-1]
else:
temp=-c[i]*(d-last[i])
ans+=temp
print(ans)
| 0 | null | 58,229,463,754,668 | 251 | 114 |
import sys
input = sys.stdin.readline
n = int(input())
num = list(map(int, input().split()))
mod = 10**9+7
num = tuple(num)
def gcd(a, b):
while b: a, b = b, a % b
return a
def isPrimeMR(n):
d = n - 1
d = d // (d & -d)
L = [2]
for a in L:
t = d
y = pow(a, t, n)
if y == 1: continue
while y != n - 1:
y = (y * y) % n
if y == 1 or t == n - 1: return 0
t <<= 1
return 1
def findFactorRho(n):
m = 1 << n.bit_length() // 8
for c in range(1, 99):
f = lambda x: (x * x + c) % n
y, r, q, g = 2, 1, 1, 1
while g == 1:
x = y
for i in range(r):
y = f(y)
k = 0
while k < r and g == 1:
ys = y
for i in range(min(m, r - k)):
y = f(y)
q = q * abs(x - y) % n
g = gcd(q, n)
k += m
r <<= 1
if g == n:
g = 1
while g == 1:
ys = f(ys)
g = gcd(abs(x - ys), n)
if g < n:
if isPrimeMR(g): return g
elif isPrimeMR(n // g): return n // g
return findFactorRho(g)
def primeFactor(n):
i = 2
ret = {}
rhoFlg = 0
while i * i <= n:
k = 0
while n % i == 0:
n //= i
k += 1
if k: ret[i] = k
i += i % 2 + (3 if i % 3 == 1 else 1)
if i == 101 and n >= 2 ** 20:
while n > 1:
if isPrimeMR(n):
ret[n], n = 1, 1
else:
rhoFlg = 1
j = findFactorRho(n)
k = 0
while n % j == 0:
n //= j
k += 1
ret[j] = k
if n > 1: ret[n] = 1
if rhoFlg: ret = {x: ret[x] for x in sorted(ret)}
return ret
lcd = dict()
for i in num:
j = primeFactor(i)
for x,y in j.items():
if not x in lcd.keys():
lcd[x] = y
else:
lcd[x] = max(lcd[x],y)
lc = 1
for i,j in lcd.items():
lc *= pow(i,j,mod)
ans =0
for i in range(n):
ans += lc*pow(num[i], mod-2, mod)
ans %= mod
print(ans) | N=int(input())
A=list(map(int,input().split()))
B=[]
for k in range(N):
B.append([A[k],k+1])
B.sort(key=lambda x: x[0], reverse=True)
dp=[[0 for k in range(N+1)]for k in range(N+1)]
dp[1][0]=dp[0][0]+B[0][0]*(B[0][1]-1)
dp[0][1]=dp[0][0]+B[0][0]*(N-B[0][1])
for k in range(1,N):
#j=0
dp[0][k+1]=dp[0][k]+B[k][0]*(N-k-B[k][1])
dp[1][k]=max(dp[0][k]+B[k][0]*(B[k][1]-1), dp[1][k-1]+B[k][0]*(N-k+1-B[k][1]))
#j=k
dp[k+1][0]=dp[k][0]+B[k][0]*(B[k][1]-k-1)
dp[k][1]=max(dp[k-1][+1]+B[k][0]*(B[k][1]-k), dp[k][0]+B[k][0]*(N-B[k][1]))
for j in range(1,k):
dp[j+1][k-j]=max(dp[j][k-j]+B[k][0]*(B[k][1]-j-1), dp[j+1][k-j-1]+B[k][0]*(N-k+j+1-B[k][1]))
dp[j][k-j+1]=max(dp[j-1][k-j+1]+B[k][0]*(B[k][1]-j), dp[j][k-j]+B[k][0]*(N-k+j-B[k][1]))
ans=[]
for k in range(N+1):
ans.append(dp[k][N-k])
print(max(ans)) | 0 | null | 60,497,972,904,132 | 235 | 171 |
from itertools import permutations
def distance(a, b):
return ((a[0]-b[0])**2 + (a[1]-b[1])**2)**0.5
n = int(input())
xy = [list(map(int, input().split())) for _ in range(n)]
d = 0
cnt = 0
for per in permutations(list(range(n)), n):
cnt += 1
for i in range(n-1):
a = xy[per[i]]
b = xy[per[i+1]]
d += distance(a, b)
print(d/cnt) | import math
X=list()
Y=list()
s=0
N=int(input())
for i in range(N):
x,y=map(int,input().split())
X.append(x)
Y.append(y)
for i in range(N):
for j in range(N):
s+=math.sqrt(((X[i]-X[j])**2)+((Y[i]-Y[j])**2))
print(s*(1/N)) | 1 | 147,895,778,140,034 | null | 280 | 280 |
N = int(input())
a = list(map(int, input().split()))
x = 0
for r in a:
x ^= r
print(' '.join([str(x^r) for r in a])) | s = input()
l = len(s)
S = list(s)
ans = 0
for i in range(l//2):
if S[i] != S[l-i-1]:
S[i-1] = S[l-i-1]
ans += 1
print(ans) | 0 | null | 66,019,211,989,978 | 123 | 261 |
import sys
read = sys.stdin.read
readlines = sys.stdin.readlines
from collections import defaultdict
def main():
s = tuple(map(int, input()))
lens = len(s)
d1 = defaultdict(int)
ss = 0
num10 = 1
for se in s[::-1]:
ss += (int(se) * num10) % 2019
ss = ss % 2019
d1[ss] += 1
num10 = (num10 * 10) % 2019
r = d1[0]
for v in d1.values():
r += v * (v - 1) // 2
print(r)
if __name__ == '__main__':
main() | S=input()
ans,n=0,len(S)
dp=[0]*(2019)
s,dp[0],k=0,1,1
for i in range(1,n+1):
s=(s+int(S[-i])*k)%2019
k=(k*10)%2019
ans+=dp[s]
dp[s]+=1
print(ans) | 1 | 31,046,086,765,082 | null | 166 | 166 |
n = int(input())
p = list(map(int, input().split()))
m = p[0]
ans = 0
for i in p:
if (m >= i):
ans += 1
m = min(i,m)
print(ans) | import math
from math import gcd
INF = float("inf")
import sys
input=sys.stdin.readline
import itertools
from collections import Counter
def main():
n = int(input())
p = list(map(int, input().split()))
min = p[0]
cnt = 0
for i in p:
if i <= min:
cnt += 1
min = i
else:
pass
print(cnt)
if __name__=="__main__":
main()
| 1 | 85,500,444,292,588 | null | 233 | 233 |
def main():
n = int(input())
xym, xyM, x_ym, x_yM = 10**9, -10**9, 10**9, -10**9
for _ in range(n):
x, y = map(int, input().split())
xy, x_y = x+y, x-y
xym, xyM, x_ym, x_yM = min(xym, xy), max(xyM, xy), min(x_ym, x_y), max(x_yM, x_y)
print(max(xyM-xym, x_yM-x_ym))
if __name__ == "__main__":
main() | import sys
H, N = map(int, input().split())
data = [int(i) for i in input().split()]
DATA = sorted(data, reverse=True)
count = 0
for i in range(N):
H = H - DATA[i]
if H <= 0:
print("Yes")
sys.exit()
else:
print("No") | 0 | null | 40,688,639,291,012 | 80 | 226 |
from collections import deque
d = deque()
for a in range(int(input())):
com = input().split()
if com[0] == "insert":
d.appendleft(com[1])
elif com[0] == "delete":
if com[1] in d:
d.remove(com[1])
elif com[0] == "deleteFirst":
d.popleft()
elif com[0] == "deleteLast":
d.pop()
else:
break
print(*d)
| from sys import stdin
n = int(stdin.readline())
q = []
bottom = 0
for i in range(n):
cmd = stdin.readline()[:-1]
if cmd[0] == 'i':
q.append(cmd[7:])
elif cmd[6] == ' ':
try:
q.pop(~q[::-1].index(cmd[7:]))
except:
pass
elif cmd[6] == 'F':
q.pop()
else:
bottom += 1
print(' '.join(q[bottom:][::-1])) | 1 | 51,068,630,018 | null | 20 | 20 |
import math
from math import gcd
INF = float("inf")
import sys
input=sys.stdin.readline
import itertools
from collections import Counter
def main():
n = int(input())
s = input().rstrip()
ans = [s[0]]
now = s[0]
for i in s[1:]:
if i != now:
ans.append(i)
now = i
print(len(ans))
if __name__=="__main__":
main()
| N = int(input())
A = input().split(" ")
def bubble_sort(A):
N = len(A)
for i in range(N):
for j in range(N - 1, i, -1):
if int(A[j][1]) < int(A[j - 1][1]):
A[j - 1], A[j] = A[j], A[j - 1]
return A
def selection_sort(A):
N = len(A)
for i in range(N):
mini = i
for j in range(i + 1, N):
if int(A[j][1]) < int(A[mini][1]):
mini = j
if mini != i:
A[mini], A[i] = A[i], A[mini]
return A
def is_stable(A, B):
map_a = {}
map_b = {}
for i in range(len(A)):
s_a = A[i][0]
s_b = B[i][0]
v_a = A[i][1]
v_b = B[i][1]
if v_a in map_a:
map_a[v_a].append(s_a)
else:
map_a[v_a] = [s_a]
if v_b in map_b:
map_b[v_b].append(s_b)
else:
map_b[v_b] = [s_b]
result = True
for k in map_a:
if len(map_a[k]) > 1:
result = result and (map_a[k] == map_b[k])
return result
A_sorted = bubble_sort(A[:])
print(" ".join(A_sorted))
print("Stable") if is_stable(A, A_sorted) else print("Not stable")
A_sorted = selection_sort(A[:])
print(" ".join(A_sorted))
print("Stable") if is_stable(A, A_sorted) else print("Not stable") | 0 | null | 85,196,056,294,050 | 293 | 16 |
def main():
N = input_int()
S = input()
count = 1
for i in range(1, N):
if S[i-1] != S[i]:
count += 1
print(count)
def input_int():
return int(input())
# def input_int_tuple():
# return map(int, input().split())
# def input_int_list():
# return list(map(int, input().split()))
main()
| a=[]
for i in range(2):
m=input().split()
a.append(m)
list_1=[int(l) for l in a[0]]
list_2=[int(l) for l in a[1]]
total=0
largest=list_2[0]
smallest=list_2[0]
for x in range(list_1[0]):
if largest<list_2[x]:
largest=list_2[x]
if smallest>list_2[x]:
smallest=list_2[x]
for x in list_2:
total+=x
print(smallest,largest,total) | 0 | null | 85,625,410,019,930 | 293 | 48 |
from itertools import accumulate
from bisect import bisect
n, m, k = map(int, input().split())
a = [0] + list(map(int, input().split()))
b = [0] + list(map(int, input().split()))
a = list(accumulate(a))
b = list(accumulate(b))
ans = 0
for i in range(n+1):
if a[i] > k:
break
ans = max(ans, i+bisect(b, k-a[i])-1)
print(ans) | from bisect import bisect
N, M, K = map(int, input().split())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
SA = [0] * (N + 1)
SB = [0] * (M + 1)
for i in range(N):
SA[i+1] = SA[i] + A[i]
for i in range(M):
SB[i+1] = SB[i] + B[i]
result = 0
for x in range(N+1):
if SA[x] > K:
break
y = bisect(SB, K - SA[x]) - 1
result = max(result, x + y)
print(result) | 1 | 10,651,840,170,260 | null | 117 | 117 |
from sys import stdin
import sys
import math
from functools import reduce
import itertools
n = int(stdin.readline().rstrip())
a = [int(x) for x in stdin.readline().rstrip().split()]
if len(set(a)) == n:
print('YES')
else:
print('NO') | n = int(input())
li = list(map(int, input().split()))
ans_li = [0] * n
for i in li:
ans_li[i-1] += 1
for i in ans_li:
print(i) | 0 | null | 52,983,632,412,700 | 222 | 169 |
N,K=map(int,input().split())
p=list(map(int,input().split()))
for i in range(N):
p[i]=(p[i]+1)/2
a=[0]
for i in range(N):
a.append(a[-1]+p[i])
ans=0
for i in range(N-K+1):
ans=max(ans,a[i+K]-a[i])
print(ans)
| N, K = map(int, input().split())
p = list(map(int, input().split()))
tmp = sum(p[:K])
maxsum = tmp
#print(p[:K])
for i in range(1,N-K+1):
#print(p[i:i+K])
tmp = tmp - p[i-1] + p[i+K-1]
maxsum = max(maxsum, tmp)
ans = (maxsum + K) / 2
print(ans) | 1 | 74,469,230,408,410 | null | 223 | 223 |
# 与えられた数値の桁数と桁値の総和を計算する.
def calc_digit_sum(num):
digits = sums = 0
while num > 0:
digits += 1
sums += num % 10
num //= 10
return digits, sums
a, b = map(int, input().split())
if 1 <= a <= 9 and 1 <= b <= 9:
print(a * b)
exit()
print(-1) | """
N = list(map(int,input().split()))
S = [str(input()) for _ in range(N)]
S = [list(map(int,list(input()))) for _ in range(h)]
print(*S,sep="")
"""
import sys
sys.setrecursionlimit(10**6)
input = lambda: sys.stdin.readline().rstrip()
inf = float("inf") # 無限
a,b = map(int,input().split())
if 0<a<10 and 0<b<10:
print(a*b)
else:
print(-1) | 1 | 158,720,195,450,508 | null | 286 | 286 |
class Stack(object):
def __init__(self, _max):
if type(_max) == int:
self._array = [None for i in range(0, _max)]
self._next = 0
def push(self, value):
if self.isFull():
raise IndexError
self._array[self._next] = value
self._next += 1
def pop(self):
if self.isEmpty():
raise IndexError
self._next -= 1
value = self._array[self._next]
self._array[self._next] = None
return value
def isEmpty(self):
return self._next <= 0
def isFull(self):
return self._next >= len(self._array)
def calculator(exp):
stack = Stack(100)
ope = ["+", "-", "*"]
for item in exp:
if item in ope:
val1 = stack.pop()
val2 = stack.pop()
if item == "+":
stack.push(val2 + val1)
elif item == "-":
stack.push(val2 - val1)
elif item == "*":
stack.push(val2 * val1)
else:
raise ValueError
else:
stack.push(int(item))
return stack.pop()
if __name__ == "__main__":
exp = input().split()
print(calculator(exp)) | operand = ["+", "-", "*"]
src = [x if x in operand else int(x) for x in input().split(" ")]
stack = []
for s in src:
if isinstance(s, int):
stack.append(s)
continue
b, a = stack.pop(), stack.pop()
if s == "+":
stack.append(a+b)
elif s == "-":
stack.append(a-b)
elif s == "*":
stack.append(a*b)
print(stack[0]) | 1 | 35,871,166,660 | null | 18 | 18 |
import sys
def gcd(a, b):
while b:
a, b = b, a % b
return a
def lcm(a, b):
return a * b / gcd(a, b)
for s in sys.stdin:
a, b = map(int, s.split())
print "%d %d"%(gcd(a, b), lcm(a, b)) | import sys
import itertools
# import numpy as np
import time
import math
sys.setrecursionlimit(10 ** 7)
from collections import defaultdict
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
A, B, K = map(int, input().split())
ansA = A
ansB = B
ansA -= min(A, K)
K -= A - ansA
ansB -= min(B, K)
print(ansA, ansB) | 0 | null | 52,041,761,483,460 | 5 | 249 |
import sys
uppers = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'
lowers = 'abcdefghijklmnopqrstuvwxyz'
s = []
for line in sys.stdin:
s += line
for i in range(26):
print(lowers[i] + ' : ' + str(s.count(uppers[i]) + s.count(lowers[i]))) | import sys
stdin = sys.stdin
def ni(): return int(ns())
def na(): return list(map(int, stdin.readline().split()))
def naa(N): return [na() for _ in range(N)]
def ns(): return stdin.readline().rstrip() # ignore trailing spaces
A, B = na()
print(A * B)
| 0 | null | 8,744,483,426,450 | 63 | 133 |
N=int(input())
P=list(map(int,input().split()))
m=N
ans=0
for i in range(N):
if m>=P[i]:
ans+=1
m=min(m,P[i])
print(ans)
| input_str = input()
translate_num = (int(input_str))**3
print(translate_num) | 0 | null | 42,869,876,681,060 | 233 | 35 |
import sys
input = sys.stdin.readline
def main():
N = int( input())
U = []
V = []
for _ in range(N):
x, y = map( int, input().split())
u, v = x+y, x-y
U.append(u)
V.append(v)
U.sort()
V.sort()
print( max(U[-1]-U[0], V[-1]-V[0]))
if __name__ == '__main__':
main()
| from collections import deque
def marge_ponds(lx, area_of_pond):
global ponds
if ponds and ponds[-1][0] > lx:
return marge_ponds(lx, area_of_pond + ponds.pop()[1])
return area_of_pond
terrains = input().strip()
x, last_x, ponds = 0, deque(), deque()
for terrain in terrains:
if terrain == '\\':
last_x.append(x)
elif terrain == '/':
if last_x:
lx = last_x.pop()
ponds.append((lx, marge_ponds(lx, x - lx)))
x += 1
print(sum(pond[1] for pond in ponds))
ponds.appendleft((0, len(ponds)))
print(' '.join(map(str, [pond[1] for pond in ponds]))) | 0 | null | 1,719,182,539,900 | 80 | 21 |
N = int(input())
S = []
for _ in range(N):
S.append(input())
ans = set(S)
print(len(ans)) | N = int(input())
S = [str(input()) for _ in range(N)]
S = set(S)
print(len(S)) | 1 | 30,081,759,605,768 | null | 165 | 165 |
s = str(input())
t = str(input())
sx = len(s)
tx = len(t)
n = sx - tx + 1
amax = 0
for i in range(n):
x = 0
for j in range(tx):
if s[i+j] == t[j]:
x += 1
else:
pass
if x > amax:
amax = x
print(tx - amax) | s = input()
t = input()
ans = len(t)
for i in range(len(s)-len(t)+1):
count = 0
for j in range(len(t)):
if s[i+j]!=t[j]:
count += 1
# print(count)
ans = min(ans, count)
print(ans)
| 1 | 3,659,496,535,494 | null | 82 | 82 |
n, x, m = map(int, input().split())
ans = []
flag = False
for i in range(n):
if x in ans:
v = x
flag = True
break
ans.append(x)
x = x**2 % m
if flag:
p = ans.index(v)
l = len(ans) - p
d, e = divmod(n-p, l)
print(sum(ans[:p]) + d*sum(ans[p:]) + sum(ans[p:p+e]))
else:
print(sum(ans))
| N,X,M = map(int, input().split())
A = [X]
S = set(A)
cnt = 0
i = 0
for i in range(1, N):
A.append(A[i-1] ** 2 % M)
if A[i] in S:
break
else:
S.add(A[i])
roup_cycle = i - A.index(A[i])
before_roup_sums = sum(A[:A.index(A[i])])
roup_sums = sum(A[A.index(A[i]):i])
if roup_cycle != 0:
roup_amount = (N - A.index(A[i])) // roup_cycle
roup_mod = (N - A.index(A[i])) % roup_cycle
print(before_roup_sums + roup_sums * roup_amount + sum(A[A.index(A[i]):(A.index(A[i]) + roup_mod)]))
else:
print(sum(A)) | 1 | 2,838,631,435,788 | null | 75 | 75 |
a = int(input())
b = int(input())
num = [a, b]
for i in range(1, 4):
if i not in num:
print(i)
break | n,m = map(int,input().split())
#行列a、ベクトルb、行列積cの初期化
a = [0 for i in range(n)]
b = [0 for j in range(m)]
c = []
#a,bの読み込み
for i in range(n):
a[i] = input().split()
a[i] = [int(x) for x in a[i]]
for j in range(m):
b[j] = int(input())
#行列積計算
temp = 0
for i in range(n):
for j in range(m):
temp += a[i][j]*b[j]
c.append(temp)
temp = 0
#結果の表示
for num in c:print(num)
| 0 | null | 56,089,088,057,632 | 254 | 56 |
n, s = map(int, input().split())
a = list(map(int, input().split()))
mod = 998244353
temp = [1] + [0] * s
for i in range(n):
temp2 = [0] * (s + 1)
for j in range(s + 1):
temp2[j] += temp[j] * 2
temp2[j] %= mod
for j in range(s + 1 - a[i]):
temp2[j + a[i]] += temp[j]
temp2[j + a[i]] %= mod
temp = temp2
print(temp[s]) | N, S = map(int, input().split())
MOD = 998244353
A = list(map(int, input().split()))
dp = [[0]*(S+1) for i in range(N+1)]
dp[0][0] = 1
for i, a in enumerate(A, 1):
for s in range(S+1):
dp[i][s] = 2*dp[i-1][s]
if a <= s:
dp[i][s] += dp[i-1][s-a]
dp[i][s] %= MOD
print(dp[-1][-1]) | 1 | 17,839,951,807,470 | null | 138 | 138 |
import itertools as it
a,b,c = map(int,input().split())
k = int(input())
allcase = list(it.product([0,1,2,3],repeat=k))
for case in allcase:
nums = [a,b,c]
for step in case:
if step == 3:
continue
nums[step] *= 2
if nums[0] < nums[1] and nums[1] < nums[2]:
print('Yes')
exit()
print('No') | a, b, c, k = map(int, input().split())
ans = 0
if a >= k:
ans = k
elif a < k and a+b >= k:
ans = a
else:
ans = a - (k-(a+b))
print(ans) | 0 | null | 14,368,124,114,400 | 101 | 148 |
N=input()
A=input()
Alist=A.split()
counts=0
for i in Alist:
if int(i)%2==1:
counts=counts
elif int(i)%3==0:
counts=counts
elif int(i)%5==0:
counts=counts
else:
counts=counts+1
if counts>=1:
print("DENIED")
else:
print("APPROVED") | import sys
input = sys.stdin.readline
N,M,L = map(int,input().split())
ABC = [tuple(map(int,input().split())) for i in range(M)]
Q = int(input())
ST = [tuple(map(int,input().split())) for i in range(Q)]
INF = float('inf')
ds = [[INF]*N for i in range(N)]
for a,b,c in ABC:
a,b = a-1,b-1
ds[a][b] = ds[b][a] = c
for i in range(N):
ds[i][i] = 0
for k in range(N):
for i in range(N):
for j in range(N):
ds[i][j] = min(ds[i][j], ds[i][k]+ds[k][j])
ls = [[INF]*N for i in range(N)]
for i in range(N-1):
for j in range(i+1,N):
if ds[i][j] <= L:
ls[i][j] = ls[j][i] = 1
for i in range(N):
ls[i][i] = 0
for k in range(N):
for i in range(N):
for j in range(N):
ls[i][j] = min(ls[i][j], ls[i][k]+ls[k][j])
ans = []
for s,t in ST:
ans.append(-1 if ls[s-1][t-1]==INF else ls[s-1][t-1] - 1)
print(*ans, sep='\n') | 0 | null | 121,827,813,957,410 | 217 | 295 |
a, b = map(int, input().split())
result_multiplication = a * b
print(result_multiplication) | import sys, math
input = sys.stdin.readline
H, N = map(int, input().split())
ab = [list(map(int, input().split())) for _ in range(N)]
max_a = max([a for a, b in ab])
dp = [math.inf] * (H+max_a+1)
dp[0] = 0
for i in range(H + 1):
for a, b in ab:
dp[i + a] = min(dp[i + a], dp[i] + b)
print(min(dp[H:]))
| 0 | null | 48,328,621,110,240 | 133 | 229 |
N,K,C=list(map(int,input().split()))
S=input()
R=[]
L=[]
i=0
while i<N:
if S[i]=="o":
R.append(i)
i+=C+1
else:
i+=1
i=N-1
while i>=0:
if S[i]=="o":
L.append(i)
i-=(C+1)
else:
i-=1
R=R[:K+1]
L=L[:K+1]
L.reverse()
for i in range(K):
if R[i]==L[i]:
print(str(R[i]+1),end=" ")
| import sys
stdin = sys.stdin
sys.setrecursionlimit(10 ** 7)
def LI(): return list(map(int, stdin.readline().split()))
def LS(): return list(stdin.readline())
n,m = LI()
print('Yes' if n==m else 'No') | 0 | null | 61,988,624,752,352 | 182 | 231 |
n, k = map(int, input().split())
r, s, p = map(int, input().split())
t = input()
def score(hand):
if hand == 's':
return r
if hand == 'p':
return s
if hand == 'r':
return p
ans = 0
changed = [0] * n
for i in range(n):
if i >= k and t[i] == t[i - k] and changed[i - k] == 0:
changed[i] = 1
continue
ans += score(t[i])
print(ans)
| N = int(input())
A = list(int(x) for x in input().split())
ans = 0
for i in range(N):
if i == N - 1:
break
if A[i] > A[i+1]:
sa = A[i] - A[i+1]
A[i+1] += sa
ans = ans + sa
print(ans)
| 0 | null | 55,955,726,974,588 | 251 | 88 |
def main():
N,P = map(int,input().split())
S = [int(s) for s in list(input().strip())][::-1]
num = 0
ans = 0
if P == 2 or P == 5:
for i in range(N):
if S[i]%P == 0:
ans += N-i
print(ans)
return
L = [0]*P
L[0]=1
t = 0
s = 1
for z in S:
t = (z*s+t)%P
L[t]+=1
s=s*10%P
for l in L:
ans += l * (l - 1) // 2
print(ans)
if __name__ == '__main__':
main()
| N = int(input())
x = list(input())[::-1]
num = 0
nump = 0
numm = 0
pop_num = 0
for i in range(N):
if x[i] == "1":
pop_num += 1
for i in range(N):
if x[i] == "1":
num += pow(2,i,pop_num)
num %= pop_num
nump += pow(2,i,pop_num+1)
nump %= pop_num + 1
if pop_num-1 != 0:
numm += pow(2,i,pop_num - 1)
numm %= pop_num - 1
def popcnt(n):
c = (n & 0x5555555555555555) + ((n>>1) & 0x5555555555555555)
c = (c & 0x3333333333333333) + ((c>>2) & 0x3333333333333333)
c = (c & 0x0f0f0f0f0f0f0f0f) + ((c>>4) & 0x0f0f0f0f0f0f0f0f)
c = (c & 0x00ff00ff00ff00ff) + ((c>>8) & 0x00ff00ff00ff00ff)
c = (c & 0x0000ffff0000ffff) + ((c>>16) & 0x0000ffff0000ffff)
c = (c & 0x00000000ffffffff) + ((c>>32) & 0x00000000ffffffff)
return c
x = x[::-1]
def calc(i,depth,n):
if depth == 0:
if x[i] == "1":
tmp = numm
if pop_num - 1 != 0:
tmp -= pow(2,N-i-1,pop_num-1)
tmp %= (pop_num - 1)
else:
return 0
return calc(i,depth+1,tmp)
else:
tmp = nump
tmp += pow(2,N-i-1,pop_num+1)
tmp %= (pop_num + 1)
return calc(i,depth+1,tmp)
else:
if n == 0: return depth
return calc(i,depth+1, n % popcnt(n))
for i in range(N):
print(calc(i,0,0))
| 0 | null | 33,162,001,881,460 | 205 | 107 |
n, m = map(int, input().split())
num = [-1 for _ in range(n)]
for _ in range(m):
s, c = map(int, input().split())
s -= 1
if n >= 2 and s == 0 and c == 0:
print(-1)
exit()
elif num[s] != -1 and num[s] != c:
print(-1)
exit()
else:
num[s] = c
if num[0] == -1 and n != 1:
num[0] = 1
elif num[0] == -1 and n == 1:
num[0] = 0
num = ["0" if n == -1 else str(n) for n in num]
print("".join(num)) | #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,permutations,accumulate # (string,3) 3回
#from collections import deque
from collections import deque,defaultdict,Counter
import decimal
import re
#import bisect
#
# d = m - k[i] - k[j]
# if kk[bisect.bisect_right(kk,d) - 1] == d:
#
#
#
# pythonで無理なときは、pypyでやると正解するかも！！
#
#
# my_round_int = lambda x:np.round((x*2 + 1)//2)
# 四捨五入
import sys
sys.setrecursionlimit(10000000)
mod = 10**9 + 7
#mod = 9982443453
def readInts():
return list(map(int,input().split()))
def I():
return int(input())
n,m = readInts()
base = []
if n == 1 and m == 0:
print(0)
exit()
elif n == 2 and m == 0:
print(10)
exit()
elif n == 3 and m == 0:
print(100)
exit()
if n >= 1:
base.append('1')
if n >= 2:
base.append('0')
if n == 3:
base.append('0')
dic = defaultdict(int)
for i in range(m):
s,c = readInts()
s -= 1
if dic[s] != 0:
if int(base[s]) == c:
pass
else:
print(-1)
exit()
else:
dic[s] = 1
base[s] = str(c)
if s == 0 and c == 0 and n >= 2:
print(-1)
exit()
print(*base,sep='')
| 1 | 60,567,861,318,720 | null | 208 | 208 |
s=input()
count=0
for i in range(0,len(list(s))-1):
if(s[i]!=s[i+1]):
count+=1
elif(s[i]==s[i+1]):
count+=0
if(count>1 or count==1):
print("Yes")
else:
print("No")
| a = input()
if a == 'AAA' or a == 'BBB' :
print('No')
else :
print('Yes') | 1 | 54,816,963,424,028 | null | 201 | 201 |
import sys
stdin = sys.stdin
def main():
N = int(stdin.readline().rstrip())
A = list(map(int,stdin.readline().split()))
mod = 10**9+7
ans = 0
for i in range(61):
bits = 0
for x in A:
if (x>>i)&1:
bits += 1
ans += ((bits*(N-bits))* 2**i) %mod
ans %= mod
print(ans)
main() | def getN():
return int(input())
def getNM():
return map(int, input().split())
def getList():
return list(map(int, input().split()))
from collections import defaultdict, deque
from sys import exit
import math
import copy
from bisect import bisect_left, bisect_right
from heapq import *
import sys
# sys.setrecursionlimit(1000000)
INF = 10 ** 17
MOD = 1000000007
from fractions import *
def inverse(f):
# return Fraction(f.denominator,f.numerator)
return 1 / f
def combmod(n, k, mod=MOD):
ret = 1
for i in range(n - k + 1, n + 1):
ret *= i
ret %= mod
for i in range(1, k + 1):
ret *= pow(i, mod - 2, mod)
ret %= mod
return ret
MOD = 10 ** 9 + 7
def solve():
n = getN()
bit_array = [[0, 0] for i in range(61)]
nums = getList()
for num in nums:
digit = 0
while(digit < 61):
if num % 2 == 0:
bit_array[digit][0] += 1
else:
bit_array[digit][1] += 1
digit += 1
num //= 2
# print(bit_array)
ans = 0
for i, tgt in enumerate(bit_array):
ans += pow(2, i, MOD) * tgt[0] * tgt[1]
ans %= MOD
print(ans )
def main():
n = getN()
for _ in range(n):
solve()
if __name__ == "__main__":
solve() | 1 | 122,680,665,042,012 | null | 263 | 263 |
import sys,math,copy,queue,itertools,bisect
LI = lambda : [int(x) for x in sys.stdin.readline().split()]
_LI = lambda : [int(x)-1 for x in sys.stdin.readline().split()]
NI = lambda : int(sys.stdin.readline())
MOD = 10**9 + 7
INF = 10**15
N = NI()
A = LI()
ans = 0
if N % 2 == 0:
for i in range(1,N,2):
ans += A[i]
x = ans
for i in range(0,N,2):
x = x + A[i] - A[i+1]
ans = max(ans,x)
else:
dp = [0 for _ in range(3)]
for i in range(N):
ai = A[i]
if i % 2 == 0:
dp[1] = max(dp[0],dp[1])
dp[0] = dp[0] + ai
if i % 2 == 1:
dp[2] = max(dp[1],dp[2])
dp[1] += ai
if i % 2 == 0 and i > 0:
dp[2] += ai
ans = max(dp[1],dp[2])
print (ans)
| N=int(input())
P=list(map(int,input().split()))
count=0
min=2*10**5
for i in range(N):
if P[i]<=min:
min=P[i]
count+=1
print(count)
| 0 | null | 61,308,555,724,988 | 177 | 233 |
n, k = map(int, input().split())
arr = list(map(int, input().split()))
expected = []
cumsum = []
for x in arr:
sum = (x * (x + 1)) // 2
ex = sum / x
expected.append(ex)
sum = 0
maxi = 0
taken = 0
bad = 0
for x in expected:
sum += x
taken += 1
if taken == k:
maxi = max(maxi, sum)
elif taken > k:
sum -= expected[bad]
bad += 1
maxi = max(maxi, sum)
print(maxi) | #!/usr/bin/env python
# coding: utf-8
# In[43]:
N,K = map(int, input().split())
p = list(map(int, input().split()))
# In[44]:
le = [(x+1)/2 for x in p]
e = sum(le[:K])
ans = e
for i in range(N-K):
e -= le[i]
e += le[i+K]
ans = max(ans ,e)
print(ans)
# In[ ]:
| 1 | 74,985,728,354,052 | null | 223 | 223 |
n=int(input())
a=1000
i=1
while n>a:
i=i+1
a=a+1000
print(a-n)
| import sys
input = sys.stdin.readline
from collections import *
N, P = map(int, input().split())
S = input()[:-1]
if P in [2, 5]:
ans = 0
for i in range(N):
if int(S[i])%P==0:
ans += i+1
print(ans)
exit()
cnt = defaultdict(int)
cnt[0] = 1
now = 0
ans = 0
for i in range(N-1, -1, -1):
now = (int(S[i])*pow(10, N-1-i, P)+now)%P
ans += cnt[now]
cnt[now] += 1
print(ans) | 0 | null | 33,168,272,107,542 | 108 | 205 |
import sys
R, C, K = list(map(int, input().split()))
d = [[[0] * (C+1) for _ in range(R+1)] for _ in range(4)]
t = [[0] * (C+1) for _ in range(R+1)]
for i in range(K):
r,c,v = list(map(int, input().split()))
t[r][c] = v
for i in range(R+1):
for j in range(C+1):
for k in range(4):
if i!=0:
d[0][i][j] = max(d[0][i][j], d[k][i-1][j])
d[1][i][j] = max(d[1][i][j], d[k][i-1][j] + t[i][j])
if j!=0:
d[k][i][j] = max(d[k][i][j], d[k][i][j-1])
if k != 0:
d[k][i][j] = max(d[k][i][j], d[k-1][i][j-1] + t[i][j])
a = 0
for i in range(4):
a = max(a, d[i][-1][-1])
print(a)
| s = input()
q = []
for i in s:
q.append(int(i))
if sum(q)%9 == 0:
print('Yes')
else:print('No') | 0 | null | 4,984,636,425,732 | 94 | 87 |
import math
a = int(input())
b = a /1000
B = math.ceil(b)
print(B * 1000 -a) | N = int(input())
if N%1000==0:
q = N//1000-1
else:
q = N//1000
ans = 1000*(q+1)-N
print(ans)
| 1 | 8,395,738,674,092 | null | 108 | 108 |
number, base = map(int, input().split())
result_list = []
while number / base > 0:
mod = number % base
result_list.append(str(mod))
number = number // base
result_list.reverse()
result = "".join(result_list)
print(len(result))
| n,k = map(int,input().split())
keta = 1
while True:
if n >= k:
n = n//k
keta += 1
else:
break
print(keta)
| 1 | 64,661,360,726,298 | null | 212 | 212 |
m,n,o=map(int,raw_input().split())
print'Yes'if m<n<o else'No' | X, K, D = map(int, input().split())
X = abs(X)
point = X % D
q = X // D
ans = 0
if q >= K:
ans = abs(X-D*K)
elif (K - q) % 2 == 0:
ans = point
else:
ans = D-point
print(ans) | 0 | null | 2,796,722,712,212 | 39 | 92 |
A, B = map(int, input().split())
ans = A*B if max(A,B)<=9 else -1
print(ans) | import sys
n = int(raw_input())
#n = 30
for i in range(1, n+1):
if i % 3 == 0:
sys.stdout.write(" {:}".format(i))
elif str(i).find('3') > -1:
sys.stdout.write(" {:}".format(i))
print("") | 0 | null | 79,131,190,152,708 | 286 | 52 |
s = input()
s = s[::-1]
n = len(s)
m = [0] * 2019
m[0] = 1
a = 0
d = 1
for i in range(n):
a = (a + int(s[i]) * d) % 2019
d = (d * 10) % 2019
m[a] += 1
print(sum([int(x * (x - 1) / 2) for x in m if x > 1]))
| # row = [int(x) for x in input().rstrip().split(" ")]
# n = int(input().rstrip())
# s = input().rstrip()
def resolve():
import sys
input = sys.stdin.readline
n = int(input().rstrip())
s_list = [input().rstrip() for _ in range(n)]
from collections import Counter
c = Counter(s_list)
max_count = c.most_common()[0][1]
words = [word for word, count in c.most_common() if count == max_count]
words.sort()
print("\n".join(words))
if __name__ == "__main__":
resolve()
| 0 | null | 50,443,119,948,782 | 166 | 218 |
a=int(input())
b=a//3
c=a//5
d=a//15
z=0
y=0
w=0
v=0
for x in range(a+1):
z=z+x
for x in range(b+1):
y=y+x*3
for x in range(c+1):
w=w+x*5
for x in range(d+1):
v=v+x*15
print(z-y-w+v) | def check(x, A, K):
import math
sumA = 0
for a in A:
if a > x:
sumA += math.ceil(a / x) - 1
if sumA <= K:
return True
else:
return False
def resolve():
_, K = [int(i) for i in input().split()]
A = [int(i) for i in input().split()]
ok = max(A) # maxVal when minimize
ng = -1 # maxVal when maximize
while abs(ok - ng) > 1:
mid = (ok + ng) // 2
if mid > 0 and check(mid, A, K):
ok = mid
else:
ng = mid
print(ok)
resolve()
| 0 | null | 20,611,744,114,482 | 173 | 99 |
s = list(input())
l2r = [0]
r2l = [0]
n = len(s)
for i in range(n):
if s[i] == '<':
l = l2r[i]
l2r.append(l+1)
else:
l2r.append(0)
for j in range(n):
if s[n-1-j] == '>':
r2l.append(r2l[j]+1)
else:
r2l.append(0)
invr2l = r2l[::-1]
ans = []
for i in range(n+1):
m = max(l2r[i],invr2l[i])
ans.append(m)
print(sum(ans))
| import sys
S = list(input())
lis = [0] * (len(S)+1)
if len(S) == 1:
print(1)
sys.exit()
#最初は < を処理する
for i in range(len(S)):
if S[i] == "<":
lis[i+1] = lis[i] + 1
for j in range(len(S)-1,-1,-1):
if S[j] == ">":
lis[j] = max(lis[j],lis[j+1] + 1)
print(sum(lis)) | 1 | 156,393,729,392,450 | null | 285 | 285 |
def bfs(n,e,fordfs,D):
#点の数、スタートの点、有向グラフ
W = [-1]*(n-1)
#各点の状態量、最短距離とか,見たかどうかとか
used = defaultdict(bool)
que = deque()
que.append(e)
while que:
now = que.popleft()
i = 1
for ne in fordfs[now]:
l = min(now,ne); r = max(now,ne)
if W[D[(l,r)]] == -1:
while(True):
if not used[(now,i)]:
used[(now, i)] = True
used[(ne, i)] = True
break
i +=1
que.append(ne)
W[D[(l,r)]] = i
return W
def examD():
N = I()
V = [[]for _ in range(N)]
d = defaultdict(int)
for i in range(N-1):
a, b = LI()
V[a-1].append(b-1)
V[b-1].append(a-1)
d[(a-1,b-1)] = i
ans = bfs(N,0,V,d)
print(max(ans))
for v in ans:
print(v)
return
def examF():
N, M = LI()
S = SI()
ans = []
cur = N
while(cur>0):
k = min(M,cur)
while(S[cur-k]=="1"):
k -=1
if k==0:
print("-1")
return
ans.append(k)
cur -=k
for v in ans[::-1]:
print(v)
return
import sys,copy,bisect,itertools,heapq,math
from heapq import heappop,heappush,heapify
from collections import Counter,defaultdict,deque
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
def LSI(): return list(map(str,sys.stdin.readline().split()))
def LS(): return sys.stdin.readline().split()
def SI(): return sys.stdin.readline().strip()
global mod,mod2,inf,alphabet
mod = 10**9 + 7
mod2 = 998244353
inf = 10**18
alphabet = [chr(ord('a') + i) for i in range(26)]
if __name__ == '__main__':
examF()
| #coding:utf-8
ans = []
for i in xrange(20000):
a, op, b = raw_input().split()
if op == "?":
break
else:
if op == "+":
ans.append(int(a) + int(b))
elif op == "-":
ans.append(int(a) - int(b))
elif op == "*":
ans.append(int(a) * int(b))
else:
ans.append(int(a) / int(b))
for n in xrange(len(ans)):
print(ans[n]) | 0 | null | 70,021,313,469,940 | 274 | 47 |
A, B, C, K = map(int, input().split())
count_A = 0
count_B = 0
count_C = 0
count = 0
if A >= K:
count_A += K
else: # A < K
K -= A
count_A += A
if B >= K:
count_B += K
else:
K -= B
count_B += B
count_C += K
print(count_A - count_C)
| N = int(input())
data = [input() for _ in range(N)]
def f(s):
c = len([x for x in data if x in s])
print(f"{s} x {c}")
f("AC")
f("WA")
f("TLE")
f("RE")
| 0 | null | 15,226,700,232,640 | 148 | 109 |
x = input()
a = x[::-1]
b = 0
c = 0
d = int(len(x))
while b + 1 <= d:
if x[b] == a[b]:
c = c
b = b + 1
else:
c = c + 1
b = b + 1
c = int(c/2)
print(c) | n = int(input())
a = list(map(int, input().split()))
mod = 10**9 + 7
s = sum(a)
ans = 0
for i in range(n):
s -= a[i]
ans = (ans + a[i]*s) % mod
print(ans) | 0 | null | 61,785,002,538,622 | 261 | 83 |
import math
while True:
N = int(input())
if N == 0:
break
S = list(map(int, input().split()))
S2 = [x ** 2 for x in S]
V = sum(S2)/N - (sum(S)/N) ** 2
print(math.sqrt(V)) | while True:
n = int(input())
if n == 0:
break
si = list(map(int, input().split()))
m = sum(si) / n
func = (lambda x: (x - m) ** 2)
print((sum(map(func, si)) / n) ** .5)
| 1 | 193,601,417,942 | null | 31 | 31 |
array = [[10*[0] for _ in [0]*3] for _ in [0]*4]
n = int(input())
for _ in range(n):
a,b,c,d = map(int,input().split())
array[a-1][b-1][c-1] += d
for i in range(4):
for j in range(3): print('',*array[i][j])
if i<3: print('#'*20)
| H,W = map(int,input().split())
if H == 1 or W == 1:
print(1)
a = H * W
b = a // 2
if b != a / 2:
b += 1
if H != 1 and W != 1:
print(b)
| 0 | null | 25,888,174,998,692 | 55 | 196 |
s = input()
n = len(s)
c = 0
for i in range((n+1)//2):
if s[i] != s[n-i-1]:
c += 1
print(c) | from collections import Counter
N, K = map(int, input().split())
R, S, P = map(int, input().split())
T = input()
result = []
for i in range(K):
result.append(T[i])
for j in range(K, N):
if result[j-K] == T[j]:
result.append("d")
else:
result.append(T[j])
result = Counter(result)
print(result["r"]*P+result["s"]*R+result["p"]*S)
| 0 | null | 113,270,007,452,340 | 261 | 251 |
import numpy as np
N = input()
K = int(input())
n = len(N)
dp0 = np.zeros((n, K+1), np.int64)
dp1 = np.zeros((n, K+1), np.int64)
dp0[0, 0] = 1
dp0[0, 1] = int(N[0]) - 1
dp1[0, 1] = 1
for i, d in enumerate(N[1:]):
dp0[i+1] += dp0[i]
dp0[i+1, 1:] += dp0[i, :-1] * 9
if int(d) == 0:
dp1[i+1] = dp1[i]
elif int(d) == 1:
dp0[i+1] += dp1[i]
dp1[i+1, 1:] = dp1[i, :-1]
elif int(d) >= 2:
dp0[i+1] += dp1[i]
dp0[i+1, 1:] += dp1[i, :-1] * (int(d) - 1)
dp1[i+1, 1:] = dp1[i, :-1]
print(dp0[-1, K] + dp1[-1, K])
| import sys
# import numba as nb
import numpy as np
input = sys.stdin.readline
# @nb.njit("i8(i8[:],i8,i8)", cache=True)
def solve(N, K, L):
dp = np.zeros(shape=(L + 1, 2, K + 1), dtype=np.int64)
dp[0][0][0] = 1
for i in range(L):
D = N[i]
for j in range(2):
d_max = 9 if j == 1 else D
for k in range(K + 1):
if k < K:
for d in range(d_max + 1):
dp[i + 1][int(j or (d < D))][k + int(d > 0)] += dp[i][j][k]
else:
dp[i + 1][j][k] += dp[i][j][k]
return dp[L][0][K] + dp[L][1][K]
def main():
N = np.array(list(input().rstrip()), dtype=np.int64)
K = int(input())
L = N.shape[0]
ans = solve(N, K, L)
print(ans)
if __name__ == "__main__":
main()
| 1 | 76,280,082,231,484 | null | 224 | 224 |
s=input()
ans = 0
for i in range(len(s)):
j = len(s)-i-1
if i > j: break
if s[i] != s[j]: ans += 1
print(ans) | N = int(input())
P = list(map(int,input().split()))
a = 0
s = 10**6
for p in P:
if p<s:
a+=1
s = min(s,p)
print(a) | 0 | null | 102,702,356,754,778 | 261 | 233 |
import math
r = float(raw_input())
print "%.8f %.8f" % (r*r*math.pi, 2*r*math.pi)
| ###2分探索
import sys
N,K = map(int,input().split())
A = list(map(int,input().split()))
p = 0###無理（そこまで小さくできない）
q = max(A)###可能
if K == 0:
print(q)
sys.exit(0)
while q-p > 1:
r = (p+q)//2
count = 0
for i in range(N):
if A[i]/r == A[i]//r:
count += A[i]//r - 1
else:
count += A[i]//r
if count > K:
p = r
else:
q = r
#print(p,q)
print(q) | 0 | null | 3,614,519,461,438 | 46 | 99 |
from collections import Counter
from sys import exit
N = int(input())
A = list(map(int,input().split()))
cnt = Counter(A)
for i in cnt.values():
if i != 1:
print("NO")
exit(0)
print("YES") | from collections import deque
infinity=10**6
import sys
input = sys.stdin.readline
N,u,v = map(int,input().split())
u -= 1
v -= 1
G=[[] for i in range(N)]
for i in range(N-1):
A,B = map(int,input().split())
A -= 1
B -= 1
G[A].append(B)
G[B].append(A)
ends = []
for i in range(N):
if len(G[i]) == 1:
ends.append(i)
#幅優先探索
def BFS (s):
queue = deque()
d = [infinity]*N
queue.append(s)
d[s]= 0
while len(queue)!=0:
u = queue.popleft()
for v in G[u]:
if d[v] == infinity:
d[v] = d[u]+1
queue.append(v)
return d
d_nigeru = BFS(u)
d_oni = BFS(v)
ans=0
for u in ends:
if d_nigeru[u] < d_oni[u]:
ans = max(ans,d_oni[u]-1)
print(ans) | 0 | null | 95,334,028,227,100 | 222 | 259 |
K = int(input())
S = input()
print(S[:K]+(K<len(S))*"...") | N,K=map(int,input().split())
l=[False for x in range(N)]
for i in range(K):
d=int(input())
A=list(map(int,input().split()))
for j in A:
l[j-1]=True
print(l.count(False)) | 0 | null | 22,059,167,669,138 | 143 | 154 |
count = 0
n, d = map(int, input().split())
for _ in range(n):
l, m = map(int, input().split())
z = (l ** 2 + m ** 2) ** 0.5
if z <= d:
count += 1
print(count)
| def solve():
MOD = 10**9 + 7
N = int(input())
As = list(map(int, input().split()))
ans = 0
for d in range(60):
mask = 1<<d
num1 = len([1 for A in As if A & mask])
ans += num1 * (N-num1) * mask
ans %= MOD
print(ans)
solve()
| 0 | null | 64,435,673,984,122 | 96 | 263 |
while 1:
w,h=map(int,input().split())
if w==0 and h==0: break
for a in range(w):
print('#'*h)
print()
| # coding: utf-8
# Your code here!
while(1):
H,W=map(int,input().split(" "))
if H==0 and W==0:
break
else:
for i in range(H):
for j in range(W):
print("#",end="")
print("")
print("")
| 1 | 775,350,110,640 | null | 49 | 49 |
from collections import deque
s = deque(list(input()))
q = int(input())
# -1がnotReverse, 1がReverser
isR = -1
for i in range(q):
line = list(input().split())
t = int(line[0])
if t == 1:
isR *= -1
else:
f = int(line[1])
if isR + f == 0 or isR + f == 3:
s.appendleft(line[2])
else:
s.append(line[2])
if isR == 1:
s.reverse()
print("".join(s)) | s = input()
q = int(input())
count = 0
a = []
b = []
for _ in range(q):
Q = list(map(str, input().split()))
if Q[0] == "1":
count += 1
else:
if (int(Q[1])+count)%2 == 1:
a.append(Q[2])
else:
b.append(Q[2])
a = "".join(a[::-1])
b = "".join(b)
s = a + s + b
if count%2 == 1 and count != 0:
s = s[::-1]
print("".join(s)) | 1 | 57,403,735,106,290 | null | 204 | 204 |
# ABC159C
# 縦，横，高さの合計が len である直方体のうち，体積が最大のものの体積はいくつか
def f(len):
print((len / 3) ** 3)
f(int(input()))
| L = int(input())
ans = (L/3)**3
print("{:.10f}".format(ans))
| 1 | 46,863,459,670,032 | null | 191 | 191 |
def main():
import numpy as np
n,m=map(int,input().split())
A=list(map(int,input().split()))
A.sort()
A=np.array(A)
def cnt_shake(x): #握手の組であって合計パワーがx以上となる組みの数
return n**2-np.searchsorted(A,x-A).sum()
right=10**10*1
left=-10**10-1
while right-left>1:
mid=(left+right)//2
if cnt_shake(mid)<m:
right=mid
else:
left=mid
border=left #border以上の握手をする
C=n-np.searchsorted(A,border+1-A)
B=np.cumsum(A[::-1])
#print(border,A,B,C)
s,cnt=0,0
for i in range(n):
if C[i]>0:
cnt+=C[i]
s+=B[C[i]-1]+A[i]*C[i]
s+=border*(m-cnt)
print(s)
if __name__=='__main__':
main()
| import numpy as np
n, m = map(int,input().split())
a = list(map(int,input().split()))
na = np.zeros(2**18)
for i in a:
na[i] += 1
fa = np.fft.fft(na)
c = np.round(np.fft.ifft(fa*fa)).astype(int)
ans = 0
cm = 0
for i in range(2**18 - 1, 1, -1):
cm += c[i]
ans += i*c[i]
if cm > m:
ans -= i * (cm - m)
if cm >= m:
break
print(ans)
| 1 | 108,080,517,243,622 | null | 252 | 252 |
mod=10**9+7
import math
import sys
from collections import deque
import heapq
import copy
import itertools
from itertools import permutations
from itertools import combinations
import bisect
def mi() : return map(int,sys.stdin.readline().split())
def ii() : return int(sys.stdin.readline().rstrip())
def i() : return sys.stdin.readline().rstrip()
a,b=mi()
if (a+b)%3!=0:
print(0)
sys.exit()
s=(a+b)//3
a-=s
b-=s
if a<0 or b<0:
print(0)
sys.exit()
fac=[1]*700000
for i in range(1,700000):
fac[i]=(fac[i-1]*i)%mod
m=a+b
n=min(a,b)
c=1
for j in range(m,m-n,-1):
c*=j
c=c%mod
print((c*pow(fac[n],mod-2,mod))%mod) | N = int(input())
XL = [list(map(int, input().split())) for x in range(N)]
XL = sorted(XL, key=lambda x: x[0]+x[1])
cnt = 0
prev_right = -10**9+10
for x, l in XL:
left = x - l
right = x + l
if left >= prev_right:
cnt += 1
prev_right = right
print(cnt)
| 0 | null | 120,005,414,595,078 | 281 | 237 |
mod = 998244353
N, S, *A = map(int, open(0).read().split())
dp = [1] + [0] * S
for i, a in enumerate(A, 1):
dp = [(2 * dp[j] + (dp[j - a] if j >= a else 0)) % mod for j in range(S + 1)]
print(dp[S]) | N, S = map(int,input().split())
A = list(map(int,input().split()))
mod = 998244353
dp = [0 for j in range(S + 1)]
dp[0] = 1
for i in range(N) :
for j in range(S, -1, -1) :
if j + A[i] <= S :
dp[j + A[i]] += dp[j]
dp[j + A[i]] %= mod
dp[j] *= 2
dp[j] %= mod
print(dp[S])
| 1 | 17,720,404,689,630 | null | 138 | 138 |
import math
N, D = map(int, input().split())
count = 0
for i in range(N):
x, y = map(int, input().split())
d = math.sqrt(x**2 + y**2)
if d<=D:
count += 1
print(count)
| s= input()
x = "x" * len(s)
print(x) | 0 | null | 39,661,838,326,040 | 96 | 221 |
n=int(input())
dic={}
for i in range(1,50001):
p=int(i*1.08)
dic[p]=i
if n in dic:
print(dic[n])
else:
print(":(") | import itertools
N = int(input())
l = list(itertools.permutations(range(1,N+1)))
A = tuple(map(int, input().split()))
B = tuple(map(int, input().split()))
print(abs(l.index(A) - l.index(B))) | 0 | null | 113,175,905,608,324 | 265 | 246 |
#!/usr/bin/env python3
import sys
import collections as cl
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 main():
N = II()
print((N/3)**3)
main()
| K = int(input())
if K % 2 == 0 or K % 5 == 0:
print(-1)
exit()
start = j = 7 % K
count = 1
#無限ループ
while True:
#0の時
if j == 0:
print(count)
exit()
j = 10 * j + 7
j = j % K
count += 1
#同じ数のループしているかチェック
if j == start:
print(-1)
exit() | 0 | null | 26,540,764,481,480 | 191 | 97 |
def main():
N, M, X = map(int,input().split())
cost = []
effect = []
for _ in range(N):
t = list(map(int,input().split()))
cost.append(t[0])
effect.append(t[1:])
res = float("inf")
for bits in range(1<<N):
f = True
total = 0
ans = [0] * M
for flag in range(N):
if (1<< flag) & (bits):
total += cost[flag]
for idx, e in enumerate(effect[flag]):
ans[idx] += e
for a in ans:
if a < X: f = False
if f:
res = min(res, total)
print(res if res != float("inf") else -1)
if __name__ == "__main__":
main()
| import numpy as np
N,M,X = map(int,input().split())
C = []
A = []
for _ in range(N):
l = list(map(int,input().split()))
C.append(l[0])
A.append(np.array(l[1:]))
ans = 10**100
for i in range(2**N):
rikaido = np.zeros(M)
c = 0
for j in range(N):
if (i >> j) & 1:
c += C[j]
rikaido += A[j]
if all([x >= X for x in rikaido]):
ans = min(ans, c)
print(ans if ans != 10**100 else -1) | 1 | 22,095,705,004,032 | null | 149 | 149 |
import math
n = int(input())
a,b = 1,n
for i in range(1,int(math.sqrt(n)+1)):
if n%i == 0:
q = n//i
if abs(a-b) > abs(q-i):
a,b = i,q
print((a-1) + (b-1)) | def make_divisors(n):
lower_divisors , upper_divisors = [], []
i = 1
while i*i <= n:
if n % i == 0:
lower_divisors.append(i)
if i != n // i:
upper_divisors.append(n//i)
i += 1
return lower_divisors + upper_divisors[::-1]
n=int(input())
lis=make_divisors(n)
#print(lis)
ans=float('inf')
l=len(lis)
for i in range(l//2):
ans=min(ans,lis[i]+lis[-1*(i+1)]-2)
if l%2:
ans=min(ans,2*(lis[l//2]-1))
print(ans) | 1 | 161,938,418,075,648 | null | 288 | 288 |
import sys
#input = sys.stdin.buffer.readline
def main():
N,M = map(int,input().split())
s = str(input())
s = list(reversed(s))
ans = []
now = 0
while now < N:
for i in reversed(range(min(M,N-now))):
i += 1
if s[now+i] == "0":
now += i
ans.append(i)
break
if i == 1:
print(-1)
exit()
print(*reversed(ans))
if __name__ == "__main__":
main()
| S=list(str(input()))
a=0
if len(S)%2==0:
for i in range((len(S))//2):
if S[i]!=S[len(S)-i-1]:
a+=1
if len(S)%2==1:
for i in range((len(S)-1)//2):
if S[i]!=S[len(S)-i-1]:
a+=1
print(a) | 0 | null | 129,525,356,745,568 | 274 | 261 |
a,b,m=map(int,input().split())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
ans = 123456789012345
for i in range(m):
x,y,c=map(int,input().split())
ans = min(ans, a[x-1]+b[y-1]-c)
a.sort()
b.sort()
ans = min(ans,a[0]+b[0])
print(ans) | import sys
input = lambda : sys.stdin.readline().rstrip()
sys.setrecursionlimit(max(1000, 10**9))
write = lambda x: sys.stdout.write(x+"\n")
n,k = list(map(int, input().split()))
a = list(map(int, input().split()))
f = list(map(int, input().split()))
a.sort()
f.sort(reverse=True)
def sub(x):
val = 0
for aa,ff in zip(a,f):
val += max(0, aa - (x//ff))
return val<=k
if sub(0):
ans = 0
else:
l = 0
r = sum(aa*ff for aa,ff in zip(a,f))
while l+1<r:
m = (l+r)//2
if sub(m):
r = m
else:
l = m
ans = r
print(ans) | 0 | null | 109,966,048,874,920 | 200 | 290 |
n,m,l=map(int,input().split())
g=[[999999999999 if i!=j else 0 for j in range(n)] for i in range(n)]
for i in range(m):
a,b,c=map(int,input().split())
a,b=a-1,b-1
if c>l:
continue
g[a][b]=c
g[b][a]=c
for k in range(n):
for i in range(n):
for j in range(n):
if g[i][j]>g[i][k]+g[k][j]:
g[i][j] = g[i][k]+g[k][j]
for i in range(n):
for j in range(n):
if g[i][j]<=l:
g[i][j]=1
for k in range(n):
for i in range(n):
for j in range(n):
if g[i][j]>g[i][k]+g[k][j]:
g[i][j] = g[i][k]+g[k][j]
for i in range(int(input())):
s,t=map(int,input().split())
s-=1
t-=1
print(g[s][t]-1 if g[s][t]-1<99999999999 else -1)
| import sys
n = int(input())
minv = int(input())
v = int(input())
maxv = v-minv
if v < minv: minv = v
for r in map(int,sys.stdin.readlines()):
m = r-minv
if maxv < m < 0:
maxv = m
minv = r
elif maxv < m:
maxv = m
elif m < 0:
minv = r
print(maxv) | 0 | null | 86,586,438,394,338 | 295 | 13 |
def main():
N = int(input())
*P, = map(int, input().split())
mi = N + 1
ret = 0
for x in P:
if mi > x:
mi = x
ret += 1
print(ret)
if __name__ == '__main__':
main()
# import sys
# input = sys.stdin.readline
#
# sys.setrecursionlimit(10 ** 7)
#
# (int(x)-1 for x in input().split())
# rstrip()
#
# def binary_search(*, ok, ng, func):
# while abs(ok - ng) > 1:
# mid = (ok + ng) // 2
# if func(mid):
# ok = mid
# else:
# ng = mid
# return ok
| n=int(input())
p=list(map(int,input().split()))
min_val=10**18
ans=0
for i in range(n):
if i==0:
min_val=p[i]
ans+=1
continue
if min_val>=p[i]:
min_val=p[i]
ans+=1
print(ans)
| 1 | 85,746,422,193,612 | null | 233 | 233 |
s = input()
n = len(s) + 1
t = [0]*n
for i in range(n-1):
if s[i] == '<':
t[i+1] = t[i] + 1
for i in range(n-2,-1,-1):
if s[i] == '>':
t[i] = max(t[i],t[i+1]+1)
print(sum(t)) | ope = list(input().split())
stack = []
for o in ope:
if o == '+':
b, a = stack.pop(), stack.pop()
stack.append(a + b)
elif o == '-':
b, a = stack.pop(), stack.pop()
stack.append(a - b)
elif o == '*':
b, a = stack.pop(), stack.pop()
stack.append(a * b)
else:
stack.append(int(o))
print(stack[0])
| 0 | null | 78,661,758,379,006 | 285 | 18 |
n,k = map(int,input().split())
l = list(map(int,input().split()))
l.sort()
cnt = 0
s = 0
while(cnt < k):
s = s+l[cnt]
cnt = cnt+1
print(s)
| # -*- coding: utf-8 -*-
# input
a, b = map(int, input().split())
x = list(map(int, input().split()))
x.sort()
o = 0
for i in range(b):
o = o+x[i]
print(o)
| 1 | 11,637,131,644,384 | null | 120 | 120 |
N = int(input())
ss = ['a']
for i in range(1, N):
tmp = []
# length i+1
for s in ss:
newc = ord(max(s)) + 1
for j in range(ord('a'), newc+1):
tmp.append(s + chr(j))
ss = tmp
for s in sorted(ss):
print(s)
| from collections import deque
n=int(input())
alpha=['a','b','c','d','e','f','g','h','i','j','k']
q=deque(['a'])
for i in range(n-1):
qi_ans=[]
while(len(q)>0):
qi=q.popleft()
qiword_maxind=0
for j in range(len(qi)):
qi_ans.append(qi+qi[j])
qij_ind=alpha.index(qi[j])
if(qiword_maxind<qij_ind):
qiword_maxind=qij_ind
else:
qi_ans.append(qi+alpha[qiword_maxind+1])
qi_ans=sorted(list(set(qi_ans)))
# print(qi_ans)
q.extend(qi_ans)
lenq=len(q)
for i in range(lenq):
print(q.popleft())
| 1 | 52,176,873,315,050 | null | 198 | 198 |
n = int(input())
cnt = [0] * (n+100)
A = list(map(int, input().split()))
for a in A:
cnt[a] += 1
for i in range(n):
print(cnt[i+1])
| 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
N = int(input())
if N == 1:
print("0")
exit()
factors = factorization(N)
ans = 0
for factor in factors:
num = factor[1]
x = 1
for i in range(num+1):
if i**2 + i > 2*num:
x = i-1
break
# print(num,x)
ans += x
print(ans)
| 0 | null | 24,611,746,153,862 | 169 | 136 |
_, S = input(), input().split()
_, T = input(), input().split()
print(sum(t in S for t in T))
| n = input()
S = list(map(int,input().split()))
n = input()
T = list(map(int,input().split()))
count = 0
for i in T:
if i in S:
count+= 1
print(count) | 1 | 68,820,859,752 | null | 22 | 22 |
A, B, M = [int(_) for _ in input().split()]
a = [int(_) for _ in input().split()]
b = [int(_) for _ in input().split()]
xyc = [[int(_) for _ in input().split()] for i in range(M)]
rets = [min(a) + min(b)]
for x, y, c in xyc:
rets += [a[x-1] + b[y-1] - c]
print(min(rets)) | x,y = map(int,input().split(" "))
while y != 0:
x,y=y,x%y
print(x)
| 0 | null | 26,974,100,040,096 | 200 | 11 |
a = int(raw_input())
h = a / 3600
m = (a % 3600) / 60
s = a % 60
print "{0}:{1}:{2}".format(h, m, s) | '''
Auther: ghoshashis545 Ashis Ghosh
College: jalpaiguri Govt Enggineering College
'''
from os import path
import sys
from heapq import heappush,heappop,heapify
from functools import cmp_to_key as ctk
from collections import deque,defaultdict as dd
from bisect import bisect,bisect_left,bisect_right,insort,insort_left,insort_right
from itertools import permutations
from datetime import datetime
from math import ceil,sqrt,log,gcd
def ii():return int(input())
def si():return input().rstrip()
def mi():return map(int,input().split())
def li():return list(mi())
abc='abcdefghijklmnopqrstuvwxyz'
mod=1000000007
# mod=998244353
inf = float("inf")
vow=['a','e','i','o','u']
dx,dy=[-1,1,0,0],[0,0,1,-1]
def b(i):
# ord(i) -> Ascii value of i
return ord(i)-ord('a')
file = 1
def solve():
x=[599,799,999,1199,1399,1599,1799,1999]
n=ii()
for i in range(8):
if n<=x[i]:
print(8-i)
break
if __name__ =="__main__":
if(file):
if path.exists('input.txt'):
sys.stdin=open('input.txt', 'r')
sys.stdout=open('output.txt','w')
else:
input=sys.stdin.readline
solve() | 0 | null | 3,486,595,472,352 | 37 | 100 |
n = int(input())
cnt = 0
for i in range(1, n//2+1):
if i != n - i and n - i > 0:
cnt += 1
print(cnt)
| a = int(input())
if a < 2:
print(0)
elif a % 2 == 0:
print(int(a / 2 - 1) )
else:
print(int(a/2)) | 1 | 152,882,000,156,240 | null | 283 | 283 |
N = int(input())
C1 = input().split()
C2 = C1[:]
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]):
tmp = C[j]
C[j] = C[j-1]
C[j-1] = tmp
i += 1
return C
def selectionSort(C, N):
for i in range(N):
minj = i
for j in range(i, N):
if int(C[j][1]) < int(C[minj][1]):
minj = j
if minj != i:
tmp = C[minj]
C[minj] = C[i]
C[i] = tmp
i += 1
return C
bubbleSort_result = ' '.join(bubbleSort(C1, N))
selectionSort_result = ' '.join(selectionSort(C2, N))
print(bubbleSort_result)
print('Stable')
print(selectionSort_result)
if bubbleSort_result == selectionSort_result:
print('Stable')
else:
print('Not stable') | nm = input().split(" ")
n = int(nm[0])
m = int(nm[1])
if n == m:
print("Yes")
else:
print("No") | 0 | null | 41,584,801,855,310 | 16 | 231 |
n, q = (int(x) for x in input().split())
process = [input().split() for _ in range(n)]
time = 0
while process:
p = process.pop(0)
if int(p[1]) <= q:
time += int(p[1])
print(p[0], time)
else:
time += q
process.append([p[0], int(p[1]) - q]) | N = int(input())
XY = []
for _ in range(N):
A = int(input())
xy = []
for _ in range(A):
x, y = map(int, input().split())
x -= 1
xy.append((x, y))
XY.append(xy)
ans = 0
for s in range(1<<N):
for i in range(N):
if s>>i&1:
for x, y in XY[i]:
if s>>x&1 != y:
break
else:
continue
break
else:
ans = max(ans, bin(s).count("1"))
print(ans)
| 0 | null | 60,728,680,545,760 | 19 | 262 |
def main():
K = int(input())
A, B = map(int, input().split())
for i in range(A, B+1):
if i % K == 0:
print("OK")
return
print("NG")
main()
| n, k = map(int, input().split())
nbase = ''
tmp = n
while tmp > 0:
nbase += str(tmp % k)
tmp = int(tmp / k)
print(len(nbase))
| 0 | null | 45,504,695,436,124 | 158 | 212 |
N = int(input().rstrip())
A = list(map(int, input().rstrip().split()))
flag = True
c = 0
while flag:
flag = False
for j in reversed(range(1, N)):
if A[j - 1] > A[j]:
A[j - 1], A[j] = A[j], A[j - 1]
c += 1
flag = True
print(' '.join(map(str, A)))
print(c) | # 2:01
X = int(input())
ans = 0
ans += X // 500 * 1000
X %= 500
ans += X // 5 * 5
print(ans)
| 0 | null | 21,354,680,554,968 | 14 | 185 |
n,m,x = map(int,input().split())
c = [list(map(int,input().split())) for _ in range(n)]
ans = []
#n冊の本において買うか買わないかの2通りなので2**n
for i in range(2**n):
#リストの中身は値段1と理解度m個
a = [0]*m
price = 0
for j in range(n):
#n冊あるうちj冊目を買うか買わないかを判定
if ((i >> j) & 1):
for k in range(m):
a[k] += c[j][k+1]
#j冊めを買うので、合計金額を増やす
price += c[j][0]
if all(j >= x for j in a):
ans.append(price)
if len(ans) == 0:
print("-1")
else:
print(min(ans)) | A, V = map(int, input().split())
B, W = map(int, input().split())
T = int(input())
d = abs(A-B)
if d-(V-W)*T<=0:
print("YES")
else:
print("NO") | 0 | null | 18,755,228,729,450 | 149 | 131 |
for i in range(1,10000):
a = list(map(int,input().split()))
if a[0]+a[1] == 0:
break
a.sort()
print("{0[0]} {0[1]}".format(a))
| i=0
while 1:
i+=1
x,y=map(int, raw_input().split())
if x==0 and y==0:
break
print min(x,y),max(x,y) | 1 | 526,777,492,160 | null | 43 | 43 |
#n=int(input())
#a,b,n=map(int,input().split())
#al=list(map(int,input().split()))
#l=[list(map(int,input().split())) for i in range(n)]
s=list(input())
print("".join(s[0:3]))
| if __name__ == "__main__":
s = input()
print(s[0:3]) | 1 | 14,633,289,822,260 | null | 130 | 130 |
import itertools
N = int(input())
D = list(input().split())
a = itertools.combinations(D,2)
sum= 0
for i,j in a:
sum += eval("{} * {}".format(i,j))
print(sum) | N = int(raw_input())
num_list = map(int, raw_input().split())
c = 0
for i in range(0,N,1):
flag =0
minj =i
for j in range(i,N,1):
if num_list[j] < num_list[minj]:
minj = j
flag = 1
c += flag
num_list[i], num_list[minj] = num_list[minj], num_list[i]
print " ".join(map(str,num_list))
print c | 0 | null | 84,170,617,387,780 | 292 | 15 |
# Merge Sort
N = int(input())
lst = list(map(int, input().split()))
INF = 10**9 + 1
cnt = 0
def merge(A, left, mid, right):
global cnt
n1 = mid - left
n2 = right - mid
L = A[left:mid]
L.append(INF) # 番兵
R = A[mid:right]
R.append(INF) # 番兵
i, j = 0, 0
for k in range(left, right):
cnt += 1
if (L[i] <= R[j]):
A[k] = L[i]
i += 1
else:
A[k] = R[j]
j += 1
def merge_sort(A, left, right):
if (right - left > 1):
mid = (left + right) // 2
merge_sort(A, left, mid)
merge_sort(A, mid, right)
merge(A, left, mid, right)
merge_sort(lst, 0, len(lst))
print(*lst)
print(cnt)
| def merge(a, left, mid, right):
L = a[left:mid] + [INF]
R = a[mid:right] + [INF]
i = 0
j = 0
for k in range(left, right):
global idx
idx += 1
if( L[i] <= R[j] ):
a[k] = L[i]
i += 1
else:
a[k] = R[j]
j += 1
def merge_sort(a, left, right):
if( left + 1 < right ):
mid = (left + right) // 2
merge_sort(a, left, mid)
merge_sort(a, mid, right)
merge(a, left, mid, right)
INF = 1000000000
idx = 0
n = int(input())
a = [int(i) for i in input().split()]
merge_sort(a,0,len(a))
print(*a)
print(idx)
| 1 | 114,978,357,022 | null | 26 | 26 |
n=list(input())
N=len(n)
k=int(input())
dp1=[[0 for i in range(k+1)] for j in range(N+1)]
dp2=[[0 for i in range(k+1)] for j in range(N+1)]
dp1[0][0]=1
for i in range(1,N+1):
x=int(n[i-1])
if i!=N and x!=0:
for j in range(k+1):
if j==0:
dp2[i][j]=dp1[i-1][j]+dp2[i-1][j]
else:
dp1[i][j]=dp1[i-1][j-1]
dp2[i][j]=dp1[i-1][j]+dp1[i-1][j-1]*(x-1)+dp2[i-1][j]+dp2[i-1][j-1]*9
elif i!=N and x==0:
for j in range(k+1):
if j==0:
dp1[i][j]=dp1[i-1][j]
dp2[i][j]=dp2[i-1][j]
else:
dp1[i][j]=dp1[i-1][j]
dp2[i][j]=dp2[i-1][j]+dp2[i-1][j-1]*9
elif i==N and x!=0:
for j in range(k+1):
if j==0:
dp2[i][j]=dp1[i-1][j]+dp2[i-1][j]
else:
dp2[i][j]=dp1[i-1][j]+dp1[i-1][j-1]*x+dp2[i-1][j]+dp2[i-1][j-1]*9
else:
for j in range(k+1):
if j==0:
dp2[i][j]=dp2[i-1][j]
else:
dp2[i][j]=dp1[i-1][j]+dp2[i-1][j]+dp2[i-1][j-1]*9
print(dp2[N][k]) | import sys
from functools import lru_cache
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def com(n, r):
if n < r or n < 0 or r < 0:
return 0
r = min(r, n - r)
numer = denom = 1
for i in range(n - r + 1, n + 1):
numer = numer * i
for i in range(1, r + 1):
denom = denom * i
return numer // denom
def main():
N, K = map(int, read().split())
S = str(N)
L = len(S)
@lru_cache(maxsize=None)
def rec(i, k, smaller):
if i == L:
if k == 0:
return 1
else:
return 0
if k == 0:
return 1
if smaller:
return com(L - i, k) * pow(9, k)
if S[i] == '0':
return rec(i + 1, k, False)
ans = 0
ans += rec(i + 1, k, True)
ans += rec(i + 1, k - 1, True) * (int(S[i]) - 1)
ans += rec(i + 1, k - 1, False)
return ans
ans = rec(0, K, False)
print(ans)
return
if __name__ == '__main__':
main()
| 1 | 75,774,704,303,346 | null | 224 | 224 |
n,k = map(int,input().split())
mod = 10**9+7
from itertools import accumulate
N = list(range(n+1))
N_acc = [0]+list(accumulate(N))
ans = 0
for i in range(k,n+2):
ans += ((N_acc[-1]-N_acc[-i-1])-N_acc[i]+1)%mod
print(ans%mod) | import math
def main():
h,w = map(int, input().split())
if h == 1 or w == 1:
print(1)
else:
print(math.ceil(h*w/2))
if __name__ == "__main__":
main() | 0 | null | 42,123,054,547,108 | 170 | 196 |
# coding=utf-8
from __future__ import division
from math import sqrt
def main():
d = input()
x = map(int, raw_input().split())
y = map(int, raw_input().split())
z = [x - y for x, y in zip(x, y)]
print sum([abs(w) for w in z])
print sqrt(sum([w ** 2 for w in z]))
print sum([abs(w) ** 3 for w in z]) ** (1 / 3)
print max([abs(w) for w in z])
if __name__ == '__main__':
main() | N=int(input())
if N==0:
print("Yes")
exit()
P=[]
M=[]
for i in range(N):
s=input()
f=0
m=0
cnt=0
for j in range(len(s)):
if s[j]=="(":
cnt+=1
else:
cnt-=1
if cnt<m:
m=cnt
if cnt>=0:
P.append([m,cnt])
else:
M.append([m-cnt,-cnt])
P.sort(reverse=True)
M.sort(reverse=True)
#print(P)
#print(M)
SUM=0
for i,j in P:
SUM+=j
for i,j in M:
SUM-=j
if SUM!=0:
print("No")
exit()
SUMP=0
for i,j in P:
if SUMP>=(-i):
SUMP+=j
else:
print("No")
exit()
SUMM=0
for i,j in M:
if SUMM>=(-i):
SUMM+=j
else:
print("No")
exit()
print("Yes") | 0 | null | 11,847,608,750,098 | 32 | 152 |
n = int(input())
pair = [1, 1]
for i in range(n - 1):
pair[i % 2] = sum(pair)
print(pair[n % 2])
| S = input()
acc = 0
for ch in S:
acc += int(ch)
print('Yes' if acc % 9 == 0 else 'No') | 0 | null | 2,238,700,403,170 | 7 | 87 |
N,M,K = map(int,input().split())
A = list(map(int,input().split()))
B = list(map(int,input().split()))
SA = [0]
SB = [0]
tmp_A, tmp_B = 0 ,0
for i in range(N):
tmp_A += A[i]
if tmp_A <= K:
SA.append(tmp_A)
else:
break
for i in range(M):
tmp_B += B[i]
if tmp_B <= K:
SB.append(tmp_B)
else:
break
ans = 0
cursol_B = len(SB) - 1
for i in range(len(SA)):
while SA[i] + SB[cursol_B] > K:
cursol_B -= 1
ans = max(ans, i + cursol_B)
print(ans) | # 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,749,296,253,850 | null | 117 | 117 |
from bisect import bisect_left
X, N = list(map(int, input().split()))
P = list(map(int, input().split()))
P.sort()
S = set(P)
if N == 0:
print(X)
exit()
def bisectsearch_left(L, a):
i = bisect_left(L, a)
return(i)
k = bisectsearch_left(P, X)
if X != P[k]:
print(X)
else:
ct = 0
while True:
ct += 1
if X-ct not in S:
print(X-ct)
break
elif X+ct not in S:
print(X+ct)
break | l = raw_input()
print l.swapcase()
| 0 | null | 7,883,021,446,730 | 128 | 61 |
#!/usr/bin/env python3
import sys
from itertools import chain
from bisect import bisect_right
# from collections import Counter
# import numpy as np
def solve(N: int, M: int, K: int, A: "List[int]", B: "List[int]"):
A = [0] + A
for i in range(1, N + 1):
A[i] = A[i] + A[i - 1]
B = [0] + B
for i in range(1, M + 1):
B[i] = B[i] + B[i - 1]
answer = 0
for n in range(N+1):
ka = A[n]
if ka > K:
break
kb = K - ka # ak > K だから kb >= 0 bisect_right > 0
m = bisect_right(B, kb) - 1
if n + m > answer:
answer = n + m
return answer
def main():
tokens = chain(*(line.split() for line in sys.stdin))
# N, M, K, A, B = map(int, line.split())
N = int(next(tokens)) # type: int
M = int(next(tokens)) # type: int
K = int(next(tokens)) # type: int
A = [int(next(tokens)) for _ in range(N)] # type: "List[int]"
B = [int(next(tokens)) for _ in range(M)] # type: "List[int]"
answer = solve(N, M, K, A, B)
print(answer)
if __name__ == "__main__":
main()
| from bisect import bisect_right as br
from itertools import accumulate as ac
n,m,k=map(int,input().split())
a=list(ac([0]+list(map(int,input().split()))))
b=list(ac([0]+list(map(int,input().split()))))
l=0
for i in range(n+1):
if k<a[i]:
break
else:
l=max(l,i+br(b,k-a[i])-1)
print(l) | 1 | 10,702,227,755,068 | null | 117 | 117 |
H, W = map(int, input().split())
S = [0]*(H+2)
S[0] = ''.join(['#']*(W+2))
S[-1] = ''.join(['#']*(W+2))
for i in range(1,H+1):
S[i] = '#'+input()+'#'
maxd = 0
import queue
dy = [1,0,-1,0]
dx = [0,1,0,-1]
for h in range(1,H+1):
for w in range(1,W+1):
if S[h][w]=='.':
visited = [[False]*(W+2) for _ in range(H+2)]
q = queue.Queue()
visited[h][w] = True
q.put([h,w,0])
while not q.empty():
a,b,c = q.get()
#print(a,b,c)
for i in range(4):
y,x = a+dy[i], b+dx[i]
if S[y][x]=='.' and visited[y][x]==False:
q.put([y,x,c+1])
visited[y][x]=True
maxd = max(maxd,c)
print(maxd)
| from collections import deque
def input_bordered_grid(h, w, wall):
grid = [wall * (w + 2)]
for _ in range(1, h+1):
grid.append(wall + input() + wall)
grid.append(wall * (w + 2))
return grid
h, w = map(int, input().split())
grid = input_bordered_grid(h, w, '#')
move = [(-1, 0), (1, 0), (0, -1), (0, 1)]
longest = 0
for sy in range(1, h+1):
for sx in range(1, w+1):
if grid[sy][sx] == '#':
continue
dist = [[-1] * (w+2) for _ in range(h+2)]
dist[sy][sx] = 0
q = deque()
q.append((sy, sx))
while q:
y, x = q.popleft()
longest = max(longest, dist[y][x])
for dy, dx in move:
yy = y + dy
xx = x + dx
if dist[yy][xx] == -1 and grid[yy][xx] == '.':
q.append((yy, xx))
dist[yy][xx] = dist[y][x] + 1
print(longest)
| 1 | 94,342,358,297,568 | null | 241 | 241 |
search_s = input()
cnt = 0
while True:
s = input()
if s == "END_OF_TEXT": break
word_list = s.lower().split()
for word in word_list:
if word == search_s:cnt += 1
print(cnt) | import math
def hensa(n, S):
m = sum(S)/n
x = 0
for i in S:
x += (i - m) ** 2
hensa = math.sqrt(x / n)
return hensa
n = int(input())
while n != 0:
S = list(map(int, input().split()))
print("{0:04f}".format(hensa(n, S)))
n = int(input()) | 0 | null | 1,007,217,167,498 | 65 | 31 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.