code1
stringlengths 16
24.5k
| code2
stringlengths 16
24.5k
| similar
int64 0
1
| pair_id
int64 2
181,637B
⌀ | question_pair_id
float64 3.71M
180,628B
⌀ | code1_group
int64 1
299
| code2_group
int64 1
299
|
|---|---|---|---|---|---|---|
'''
Created on 2020/08/31
@author: harurun
'''
def main():
import sys
pin=sys.stdin.readline
pout=sys.stdout.write
perr=sys.stderr.write
N=int(pin())
ans=""
while N:
N-=1
ans+=chr(97+N%26)
N=N//26
print(ans[::-1])
return
main()
#解説AC | import sys
import numpy as np
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
""" どのパワー以上の組み合わせまで握手するのか二分探索で調べる
同じパワーとなる組み合わせに注意 """
N, M = lr()
A = np.array(lr())
A.sort()
def check(x):
# x以上の幸福度で握手した時、M回以下だとTrueを返す
Y = np.searchsorted(A, x - A)
return N*N - Y.sum() <= M
ok = 10 ** 6; ng = 0
while abs(ng-ok) > 1:
mid = (ok+ng) // 2
if check(mid):
ok = mid
else:
ng = mid
Acum = np.zeros(N+1, np.int64)
Acum[1:] = A.cumsum()
Y = np.searchsorted(A, ok-A)
answer = (Acum[-1] - Acum[Y]).sum() + (A * (N-Y)).sum()
answer += ng * (M - (N-Y).sum())
print(answer)
# 24 | 0 | null | 60,279,610,476,712 | 121 | 252 |
n, x, y = map(int,input().split())
x, y = x-1, y-1
d=[0 for i in range(n)]
for i in range(n):
for j in range(i+1,n):
m = min(abs(i-j), abs(x-i)+abs(y-j)+1, abs(x-j)+abs(y-i)+1)
d[m] += 1
for i in range(n-1):
print(d[i+1]) | #６回目、2020-0612
#2重ループ ＋O(1)
#場合分けを近道と通常のみ（絶対値を使う）
#初期入力
N, x, y = map(int, input().split())
normal =0
short =0
ans ={i:0 for i in range(1,N)}
for i in range(1,N):
for j in range(i+1,N+1):
normal =j -i
short =abs(x-i) +1 +abs(j-y)
dist =min(normal,short)
ans[dist] +=1
#答え出力
for i in range(1,N):
print(ans[i]) | 1 | 43,911,059,836,192 | null | 187 | 187 |
import itertools
N, K = [int(_) for _ in input().split()]
A = [int(_) for _ in input().split()]
for _ in range(K):
cumsum = [0] * (N + 2)
for i, a in enumerate(A):
i += 1
cumsum[max(0, i - a)] += 1
cumsum[min(i + a + 1, N + 1)] -= 1
A = list(itertools.accumulate(cumsum))[1:N + 1]
if min(A) == N:
break
print(' '.join(map(str, A)))
| N, K = map(int, input().split())
d = 0;
A = []
okashi = [0] * N
ans = 0
for i in range(K):
d = int(input())
A = list(map(int, input().split()))
for j in range(d):
okashi[A[j] - 1] += 1
for num in okashi:
if num == 0:
ans += 1
print(ans) | 0 | null | 20,033,074,224,900 | 132 | 154 |
N = input()
K = int(input())
L = len(N)
dp =[[[ 0 for _ in range(2)] for _ in range(5)] for _ in range(len(N)+1)]
# dp[i][j][flg] i+1桁目までで0以外の個数がj個
# flg = 1 -> N 以下が確定している
dp[0][1][1] = int(N[0])-1
dp[0][1][0] = 1
dp[0][0][1]=1
for i in range(1,L):
for j in range(4):
b = i-1 # hitotumae
now = int(N[i])
## N上限に張り付いてる方
if now == 0:
dp[i][j][0] += dp[b][j][0]
else:
dp[i][j][1] += dp[b][j][0]
dp[i][j+1][1] += dp[b][j][0] * (now-1)
dp[i][j+1][0] += dp[b][j][0]
## 張り付いてない方
dp[i][j][1] += dp[b][j][1]
dp[i][j+1][1] += dp[b][j][1] * 9
print(dp[L-1][K][0] + dp[L-1][K][1])
| import sys
read = sys.stdin.read
def main():
N, K = map(int, read().split())
dp1 = [0] * (K + 1)
dp2 = [0] * (K + 1)
dp1[0] = 1
for x in map(int, str(N)):
for j in range(K, -1, -1):
if j > 0:
dp2[j] += dp2[j - 1] * 9
if x != 0:
dp2[j] += dp1[j - 1] * (x - 1) + dp1[j]
dp1[j] = dp1[j - 1]
else:
dp1[j] = 0
dp2[j] = 1
print(dp1[K] + dp2[K])
return
if __name__ == '__main__':
main() | 1 | 76,171,342,919,460 | null | 224 | 224 |
l = [int(x) for x in input().split()]
X, N = l[0], l[1]
p = [int(x) for x in input().split()]
delta = 0
while True:
if not X - delta in p:
print(X-delta)
break
if not X + delta in p:
print(X + delta)
break
delta += 1 | x, n = map(int, input().split())
p = set(map(int, input().split()))
ans = 1000
ans = min(abs(x-i) for i in range(102) if i not in p)
print(x + ans if x - ans in p else x - ans)
| 1 | 14,099,563,149,372 | null | 128 | 128 |
class Node:
def __init__(self,key):
self.key = key
self.prev = None
self.next = None
class DoublyLinkedList:
def __init__(self):
self.nil = Node(None)
self.nil.prev = self.nil
self.nil.next = self.nil
def insert(self,key):
new = Node(key)
new.next = self.nil.next
self.nil.next.prev = new
self.nil.next = new
new.prev = self.nil
def listSearch(self,key):
cur = self.nil.next
while cur != self.nil and cur.key != key:
cur = cur.next
return cur
def deleteNode(self, t):
if t == self.nil:
return
t.prev.next = t.next
t.next.prev = t.prev
def deleteFirst(self):
self.deleteNode(self.nil.next)
def deleteLast(self):
self.deleteNode(self.nil.prev)
def deleteKey(self, key):
self.deleteNode(self.listSearch(key))
if __name__ == '__main__':
import sys
input = sys.stdin.readline
n = int(input())
d = DoublyLinkedList()
for _ in range(n):
c = input().rstrip()
if c[0] == "i":
d.insert(c[7:])
elif c[6] == "F":
d.deleteFirst()
elif c[6] =="L":
d.deleteLast()
else:
d.deleteKey(c[7:])
ans = []
cur = d.nil.next
while cur != d.nil:
ans.append(cur.key)
cur = cur.next
print(" ".join(ans))
| import sys
from collections import deque
n = int(sys.stdin.readline())
que = deque()
for i in range(n):
line = sys.stdin.readline()
op = line.rstrip().split()
if "insert" == op[0]:
que.appendleft(op[1])
elif "delete" == op[0]:
if op[1] in que:
que.remove(op[1])
elif "deleteFirst" == op[0]:
que.popleft()
else:
que.pop()
print(*que) | 1 | 50,703,752,750 | null | 20 | 20 |
n = input()
s = []
h = []
c = []
d = []
for i in range(n):
spare = raw_input().split()
if spare[0]=='S':
s.append(int(spare[1]))
elif spare[0]=='H':
h.append(int(spare[1]))
elif spare[0]=='C':
c.append(int(spare[1]))
else :
d.append(int(spare[1]))
for j in range(1,14):
judge = True
for k in range(len(s)):
if j==s[k] :
judge = False
break
if judge :
print 'S %d' %j
for j in range(1,14):
judge = True
for k in range(len(h)):
if j==h[k] :
judge = False
break
if judge :
print 'H %d' %j
for j in range(1,14):
judge = True
for k in range(len(c)):
if j==c[k] :
judge = False
break
if judge :
print 'C %d' %j
for j in range(1,14):
judge = True
for k in range(len(d)):
if j==d[k] :
judge = False
break
if judge :
print 'D %d' %j | S,H,C,D = [],[],[],[]
def adding(card):
if card[0] == 'S':
S.append(int(card[1]))
else:
if card[0] == 'H':
H.append(int(card[1]))
else:
if card[0] == 'C':
C.append(int(card[1]))
else:
if card[0] == 'D':
D.append(int(card[1]))
def sort():
S.sort()
H.sort()
C.sort()
D.sort()
def check(pattern,cards):
answer=[]
for i in range(1,13+1):
if not (i in cards):
print pattern,i
if __name__ == '__main__':
number = input()
for i in range(number):
card = map(str,raw_input().split())
adding(card)
sort()
check('S',S)
check('H',H)
check('C',C)
check('D',D) | 1 | 1,038,006,857,384 | null | 54 | 54 |
n,k = map(int,input().split())
r,s,p = map(int,input().split())
points = {'r':r, 's':s, 'p':p}
hands = {'r':'p', 's':'r', 'p':'s'}
t = list(input())
rpsList = ['']*n
ans = 0
for i,hand in enumerate(t):
rpsList[i] += hands[hand]
if i>=k and rpsList[i]==rpsList[i-k]:
last_hand= rpsList[i-k]
next_hand = hands[t[i+k]] if i+k<n else ''
for j in ['r','s','p']:
if j!=last_hand and j!=next_hand:
rpsList[i] = j
else:
ans += points[hands[hand]]
print(ans) | #!/usr/bin/env python3
import collections as cl
import sys
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 battle(enemy, r, s, p):
if enemy == "r":
return p
if enemy == "s":
return r
if enemy == "p":
return s
def main():
N, K = MI()
r, s, p = MI()
t = input()
splited_t = [[] for i in range(K)]
for i in range(N):
amari = i % K
splited_t[amari].append(t[i])
ans = 0
for i in range(K):
targets = splited_t[i]
score = battle(targets[0], r, s, p)
ans += score
won = True
for j in range(1, len(targets)):
if targets[j] == targets[j - 1] and won:
won = False
continue
score = battle(targets[j], r, s, p)
won = True
ans += score
print(ans)
main()
| 1 | 106,774,127,274,220 | null | 251 | 251 |
import sys
from functools import reduce
n=int(input())
s=[input() for i in range(n)]
t=[2*(i.count("("))-len(i) for i in s]
if sum(t)!=0:
print("No")
sys.exit()
st=[[t[i]] for i in range(n)]
for i in range(n):
now,mi=0,0
for j in s[i]:
if j=="(":
now+=1
else:
now-=1
mi=min(mi,now)
st[i].append(mi)
now2=sum(map(lambda x:x[0],filter(lambda x:x[1]>=0,st)))
v,w=list(filter(lambda x:x[1]<0 and x[0]>=0,st)),list(filter(lambda x:x[1]<0 and x[0]<0,st))
v.sort(reverse=True,key=lambda z:z[1])
w.sort(key=lambda z:z[0]-z[1],reverse=True)
#print(now2)
for vsub in v:
if now2+vsub[1]<0:
print("No")
sys.exit()
now2+=vsub[0]
for wsub in w:
if now2+wsub[1]<0:
print("No")
sys.exit()
now2+=wsub[0]
print("Yes") | h = int(input())
w = int(input())
n = int(input())
ma = max(h, w)
print(n // ma) if n // ma == n / ma else print(n // ma + 1) | 0 | null | 56,481,674,850,382 | 152 | 236 |
#
import sys
input=sys.stdin.readline
def main():
N,K=map(int,input().split())
A=list(map(lambda x: int(x)-1,input().split()))
latest=[-1]*N
latest[0]=0
now=0
while(K>0):
K-=1
to=A[now]
if latest[A[now]]!=-1:
K%=latest[now]-latest[A[now]]+1
latest[A[now]]=latest[now]+1
now=to
print(now+1)
if __name__=="__main__":
main()
| n, k = map(int, input().split())
a = [0] + list(map(int, input().split()))
cheak = [0] * (2*(10**5) + 1)
point = 1
dev = [1]
flag = 0
for i in range(1, k + 1):
if cheak[point]:
loop = i -cheak[point]
pre_loop = cheak[point]
flag = 1
break
else:
cheak[point] = i
point = a[point]
#dev.append(point)
if flag:
rest = (k + 1- pre_loop) % loop
for j in range(rest):
point = a[point]
#dev.append(point)
print(point) | 1 | 22,709,984,623,316 | null | 150 | 150 |
n = list(map(str,input()))
ans = sum(list(map(int,list(n))))
if ans % 9 == 0:
print('Yes')
else:
print('No') | x,y = map(int,raw_input().split())
if x==y:
print x
else:
if y>x:
tmp = x
x = y
y = tmp
i=2
ans = 1
al = []
while i*i<=x:
if x % i ==0:
if y % i==0:
al.append(i)
x = x/i
y = y/i
continue
i+=1
if len(al)==0:
pass
else:
for j in al:
ans *= j
print ans | 0 | null | 2,244,869,528,860 | 87 | 11 |
a, b, c, d = [int(i) for i in input().split()]
res = float("-inf")
for i in [a,b]:
for j in [c,d]:
res = max(i * j, res)
print(res) | n, k =map(int,input().split())
ans1 = n%k
ans2 = k-ans1
print(min(ans1,ans2)) | 0 | null | 21,233,235,052,652 | 77 | 180 |
n,a,b = map(int,input().split())
if a < b:
a,b = b,a
if (a - b) %2 == 0:
print((a-b)//2)
else:
print(min(a-1,n-b)+1+(b-a)//2) | bilding = [[[0 for x in range(10)] for x in range(3)]for x in range(4)]
n = int(input())
for k in range(n):
b, f, r, v = map(int, raw_input().split())
bilding[b-1][f-1][r-1] += v
for b in range(4):
for f in range(3):
print(" "+" ".join(map(str, bilding[b][f])))
if b < 3:
print("#"*20) | 0 | null | 55,027,518,356,824 | 253 | 55 |
import sys
N = int(sys.stdin.readline().rstrip())
A = list(map(int, sys.stdin.readline().rstrip().split()))
mod = 10**9 + 7
color = A.count(0)
ans = 1
cnt = [0] * N
for a in A:
if a > 0:
ans *= (cnt[a - 1] - cnt[a])
cnt[a] += 1
ans %= mod
for i in range(cnt[0]):
ans *= 3 - i
print(ans % mod) | # -*- coding: utf-8 -*-
def get_input() -> str:
"""
標準入力を取得する.
Returns:\n
str: 標準入力
"""
S = input()
return S
def main(S: str) -> None:
"""
メイン処理.
Args:\n
S (str): 文字列(1 <= |S| <= 1000, 英子文字のみ)
"""
# 求解処理
ans = S
if S[-1] == "s":
ans += "es"
else:
ans += "s"
# 結果出力
print(ans)
if __name__ == "__main__":
# 標準入力を取得
S = get_input()
# メイン処理
main(S)
| 0 | null | 66,232,960,405,600 | 268 | 71 |
N = int(input())
S = input()
R = []
G = []
B = []
for i in range(N):
if S[i] == 'R':
R.append(i+1)
elif S[i] == 'G':
G.append(i+1)
elif S[i] == 'B':
B.append(i+1)
lenb = len(B)
cnt = 0
for r in R:
for g in G:
up = max(r, g)
down = min(r, g)
diff = up - down
chk = 0
if up + diff <= N:
if S[up+diff-1] == 'B':
chk += 1
if down-diff >= 1:
if S[down-diff-1] == 'B':
chk += 1
if diff%2 == 0:
if S[int(up-diff/2-1)] == 'B':
chk += 1
cnt += lenb - chk
print(cnt)
| #!/usr/bin/env python
def f(x: int) -> int:
"""
>>> f(0)
1
>>> f(1)
0
"""
if x == 1:
return 0
else:
return 1
if __name__ == '__main__':
x = int(input())
print(f(x)) | 0 | null | 19,611,200,437,248 | 175 | 76 |
import numpy as np
#import math
#from decimal import *
#from numba import njit
#@njit
def main():
(N, K) = map(int, input().split())
A = np.array([0] + list(map(int, input().split())))
B = [1]
s = [True]*(N+1)
s[1] = False
nextTown = A[1]
while s[nextTown]:
B += nextTown,
s[nextTown] = False
nextTown = A[nextTown]
B = np.array(B)
loopIndex = np.where(B == nextTown)[0][0]
loopLen = len(B) - loopIndex
if K >= loopIndex:
print(B[(K-loopIndex)%loopLen + loopIndex])
else:
print(B[K])
main()
| N, K = map(int, input().split())
A = [0] + list(map(int, input().split()))
B = [-1 for i in range(N+1)]
B[1] = 0
n = 1
m = 0
while 1:
n = A[n]
m += 1
if m == K:
print(n)
break
if B[n] == -1:
B[n] = m
else:
a = (K - m) % (m - B[n])
for i in range(a):
n = A[n]
print(n)
break | 1 | 22,754,316,981,060 | null | 150 | 150 |
n,k=map(int,input().split())
d=0
for i in range(k,n+2):
b=i*(i-1)/2
c=i*(2*n-i+1)/2
d+=(c-b+1)
print(int(d)%(10**9+7)) | # https://drken1215.hatenablog.com/entry/2020/04/20/003900
# k 個足してできる最小の整数を求める (a とする)
# k 個足してできる最大の整数を求める (b とする)
# 出来上がる整数は b−a+1 個である
N, K = map(int, input().split())
mod = 10 ** 9 + 7
ans = 0
for k in range(K, N+2):
mx = k * (2 * N - k + 1) / 2
mi = k * (k - 1) / 2
add = mx - mi + 1
ans += add
ans %= mod
print(int(ans)) | 1 | 33,334,713,042,512 | null | 170 | 170 |
S = input()
n = len(S) + 1
A = []
mini = 0
for i in range(n-1):
if i==0:
if S[i]=="<":
A.append([1,0])
else:
A.append([0,1])
else:
if S[i]=="<" and S[i-1]==">":
A.append([1,0])
elif S[i]=="<":
A[-1][0] += 1
else:
A[-1][1] += 1
summ = 0
for x in A:
ma = max(x)
mi = min(x)
summ += (ma+1)*ma//2
summ += (mi-1)*mi//2
print(summ) |
import math
def main():
s = str(input())
first = s[0]
cnt_l = []
tmp_cnt = 1
prev_s = first
for curr_s in s[1:]:
if prev_s != curr_s:
cnt_l.append(tmp_cnt)
tmp_cnt = 1
else:
tmp_cnt+=1
prev_s = curr_s
cnt_l.append(tmp_cnt)
ans_l = []
last_num = 0
if first == '>':
down_cnt = cnt_l[0]
for d in range(down_cnt):
ans_l.append(down_cnt-d)
cnt_l = cnt_l[1:]
# if first == '<':
# print(cnt_l)
ans_l.append(0)
last_num = 0
for i in range(math.ceil(len(cnt_l)/2)):
# print('i',i)
up_cnt = cnt_l[i*2]
if i*2+1 >= len(cnt_l):
down_cnt = 0
else:
down_cnt = cnt_l[i*2+1]
# print(up_cnt,down_cnt)
# print()
for u in range(up_cnt):
if u != up_cnt-1:
last_num+=1
ans_l.append(last_num)
else:
last_num = max(last_num+1, down_cnt)
ans_l.append(last_num)
for d in range(down_cnt):
if d==0:
if last_num > down_cnt:
last_num = down_cnt-1
else:
last_num-=1
ans_l.append(last_num)
else:
last_num-=1
ans_l.append(last_num)
# print(ans_l)
print(sum(ans_l))
if __name__ == "__main__":
main() | 1 | 156,591,430,512,902 | null | 285 | 285 |
s = []
while True:
hoge = input()
if hoge == '-':
break
num = int(input())
for i in range(num):
h = int(input())
hoge = hoge.replace(hoge,hoge[h:] + hoge[:h])
s += [hoge]
for i in s: print(i) | N = int(input())
S = input().rstrip()
res = 1
s0 = S[0]
for s in S[1:]:
if s != s0:
res += 1
s0 = s
print(res) | 0 | null | 86,174,524,609,180 | 66 | 293 |
h1, m1, h2, m2, k = map(int, input().split())
H = h2 - h1
if m1 <= m2:
M = m2 - m1
else:
M = 60 - m1 + m2
H -= 1
print(H*60 + M - k) | h1,m1,h2,m2,k=map(int,raw_input().split())
print max(h2*60+m2-h1*60-m1-k,0) | 1 | 17,992,653,949,952 | null | 139 | 139 |
while True:
H,W = map(int,raw_input().split())
if (H,W) == (0,0):
break
for k in range(H):
if k==0 or k==H-1:
print "#"*W
else:
print "#" + "." * (W-2) + "#"
print "" | import sys
sys.setrecursionlimit(4100000)
import math
INF = 10**9
def main():
n = int(input())
s,t = input().split()
ans = ''
for i in range(n):
ans += s[i] + t[i]
print(ans)
if __name__ == '__main__':
main()
| 0 | null | 56,285,072,264,400 | 50 | 255 |
s = input()
if s[2] == s[3] and s[4] == s[5]:
print('Yes')
else:
print('No') | s=input().strip()
print("Yes"if s[2] == s[3] and s[4] == s[5] else "No") | 1 | 42,013,080,922,192 | null | 184 | 184 |
N= int(input())
N1=N%10
if N1 in (2,4,5,7,9):
print("hon")
elif N1 in (0,1,6,8):
print("pon")
else:
print("bon") | s = input()
a = list(s)
for i in range(len(s)):
a[i] = 'x'
ans = "".join(a)
print(ans) | 0 | null | 45,977,745,712,150 | 142 | 221 |
N = int(input())
total = 0
for n in range(1, N+1):
if (n % 3 > 0) and (n % 5 > 0):
# print(n)
total += n
print(total) |
N,M = map(int, input().split())
S = input()
cnt = 0
for s in S:
if s == "0":
cnt = 0
else:
cnt += 1
if cnt >= M:
print(-1)
exit()
"""
辞書順最小
・より少ない回数でゴール
・同じ回数なら、低い数字ほど左にくる
N歩先がゴール → 出目の合計がNになったらOK
iマス目を踏むとゲームオーバー → 途中で出目の合計がiになるとアウト
ただ、辞書順が厄介
N=4, 00000があったとして、M=3の場合、3->1より1->3の方が辞書順で若い。なので、スタート地点から貪欲に進めるだけ進む、は条件を満たさない。
→ ゴールからスタートに帰る。移動方法は貪欲にする。
"""
ans = []
rS = S[::-1]
l = 0
r = 1
while l < N:
r = l + 1
stoppable = l
while r - l <= M and r <= N:
if rS[r] == "0":
stoppable = r
r += 1
ans.append(stoppable - l)
l = stoppable
print(*ans[::-1]) | 0 | null | 86,838,651,843,444 | 173 | 274 |
import math
X = int(input())
if X >= math.ceil((X % 100) / 5) * 100:
print(1)
else:
print(0)
| n=int(input())
for i in range(50000):
if int(i*1.08)==n:
print(i)
exit()
if i*1.08>n:
break
print(":(") | 0 | null | 126,404,012,071,322 | 266 | 265 |
t1,t2=map(int,input().split())
a1,a2=map(int,input().split())
b1,b2=map(int,input().split())
a=a1-b1
b=a2-b2
if a<=0:
a *= -1
b *= -1
X=t1*a
Y=t2*b
if X+Y==0:
print('infinity')
elif X+Y>0:
print(0)
else:
T=X//abs(X+Y)
if X%abs(X+Y)==0:
print(T*2)
else:
print(T*2+1)
| import bisect,collections,copy,itertools,math,string
import sys
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())
def main():
n = I()
a = LI()
acc = 0
for i in a:
acc ^= i
ans_lst = []
for i in a:
ans = acc^i
ans_lst.append(ans)
print(*ans_lst)
main()
| 0 | null | 72,417,171,472,752 | 269 | 123 |
#!/usr/bin/env python3
import math
a, b, x = [int(s) for s in input().split()]
b_w = x / (a * a)
x1 = 2 * b_w - b
if x1 >= 0:
print(math.atan((b - x1) / a) / (2*math.pi) * 360)
else:
print(math.atan(b * a * b / x / 2) / (2*math.pi) * 360)
| from collections import defaultdict
MOD = 2019
def main():
S = input()
dp = [0] * (len(S)+1)
ex = 1
for i in range(len(S)):
dp[i+1] = (int(S[-1-i])*ex + dp[i]) % MOD
ex *= 10
ex %= MOD
d = defaultdict(int)
for i in range(len(S)+1):
d[dp[i]] += 1
output = 0
for i in d.keys():
output += (d[i] * (d[i]-1) // 2)
print(output)
return
if __name__ == '__main__':
main()
| 0 | null | 96,937,612,236,388 | 289 | 166 |
def main():
N = int(input())
A = list(map(int,input().split()))
buka_num = [0]*(N+1)
for i in range(N-1):
buka_num[A[i]] += 1
for i in range(1,N+1,1):
print(buka_num[i])
main()
| N=int(input())
A=list(map(int,input().split()))
result=[0]*N
for a in A:
result[a-1]+=1
print("\n".join(map(str,result)))
| 1 | 32,446,324,051,870 | null | 169 | 169 |
from fractions import gcd
N=int(input())
d={}
#l=[]
MOD = 1000000007
nz=0
for _ in range(N):
a,b=map(int,input().split())
if a==0 and b==0:
nz+=1
#p=(0,0)
continue
elif a==0:
p=(0,1)
elif b==0:
p=(1,0)
else:
c=gcd(a,b)
a,b=a//c,b//c
if b > 0:
p=(a,b)
else: # b < 0
p=(-a,-b)
#l.append(p)
if p in d:
d[p]+=1
else:
d[p] = 1
ans=1
#for p in l:
while len(d) > 0:
p,np=d.popitem()
if p==(1,0):
q=(0,1)
elif p==(0,1):
q=(1,0)
else:
pa,pb=p
if pa > 0:
q=(-pb,pa)
else: #pa < 0
q=(pb,-pa)
if q in d:
nq=d.pop(q)
else:
nq=0
ans *= ((2**np + 2**nq - 1) % MOD)
ans %= MOD
ans -= 1
ans += nz
ans %= MOD
print(ans) | a=int(input())
b=int(input())
ans = set()
ans.add(a)
ans.add(b)
all = {1,2,3}
print((all-ans).pop()) | 0 | null | 65,458,637,429,152 | 146 | 254 |
#!/usr/bin/env python3
def main():
import sys
input = sys.stdin.readline
A, B, N = map(int, input().split())
x = min(B - 1, N)
print((A * x) // B - A * (x // B))
if __name__ == '__main__':
main()
| s,t = input(), input()
S = list(s)
T = list(t)
N = len(s) - 1
i = 0
counter = 0
while N + 1 != i:
if S[i] != T[i]:
S[i] = T[i]
counter += 1
i += 1
print(counter) | 0 | null | 19,402,616,668,192 | 161 | 116 |
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7
M1, D1 = MAP()
M2, D2 = MAP()
print(0 if M1==M2 else 1)
| while True:
H,W = list(map(int, input().split()))
if (H == 0) and (W == 0):
break
else:
for n in range(0, H):
s = ""
for m in range(0, W):
s += "#"
print(s)
print("") | 0 | null | 62,759,452,259,240 | 264 | 49 |
H=int(input())
if H==1:
print(1)
else:
i=1
count=1
while H//2!=1:
i*=2
count+=i
H=H//2
i*=2
count+=i
print(count)
| h = int(input())
cnt = 0
while h > 1:
h //= 2
cnt += 1
print(2**(cnt+1)-1) | 1 | 80,260,031,234,900 | null | 228 | 228 |
A,B = map(int,input().split())
for n in range(10000):
if int(0.08*n)==A and int(0.10*n)==B:
print(n)
exit()
print(-1) | N, M = map(int, input().split(' '))
result = 0
if N > 1:
result += N * (N - 1) / 2
if M > 1:
result += M * (M - 1) / 2
print(int(result)) | 0 | null | 51,137,200,589,048 | 203 | 189 |
n = int(input())
fib = []
ans = 0
for i in range(n+1):
if i == 0 or i == 1:
ans = 1
fib.append(ans)
else:
ans = fib[i-1] + fib[i-2]
fib.append(ans)
print(ans)
| n = int(input())
fib = []
fib.append(1)
fib.append(1)
for _ in range(n - 1):
fib.append(fib[-2] + fib[-1])
print(fib[-1])
| 1 | 1,839,266,652 | null | 7 | 7 |
# -*- coding:utf-8 -*-
import sys
data = []
count = 0
for i in sys.stdin:
data.append(int(i))
count = count+1
if count == 10:
break
N = len(data)
m = 100
for i in range(m):
for n in range(N-1):
a = data[n]
b = data[n+1]
if a <= b:
data[n] = b
data[n+1] = a
else:
pass
for i in range(3):
print(data[i]) | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
in_n = lambda: int(readline())
in_nn = lambda: map(int, readline().split())
in_s = lambda: readline().rstrip().decode('utf-8')
in_nl = lambda: list(map(int, readline().split()))
in_nl2 = lambda H: [in_nl() for _ in range(H)]
in_map = lambda: [s == ord('.') for s in readline() if s != ord('\n')]
in_map2 = lambda H: [in_map() for _ in range(H)]
in_all = lambda: map(int, read().split())
def main():
T1, T2 = in_nn()
A1, A2 = in_nn()
B1, B2 = in_nn()
if A1 > B1:
A1, B1 = B1, A1
A2, B2 = B2, A2
da1 = T1 * A1
da2 = T2 * A2
db1 = T1 * B1
db2 = T2 * B2
if da1 == db1:
if db1 == db2:
ans = "infinity"
else:
ans = 1
else:
if da1 + da2 == db1 + db2:
ans = "infinity"
elif da1 + da2 < db1 + db2:
ans = 0
else:
d1 = db1 - da1
d2 = (da1 + da2) - (db1 + db2)
ans = 1 + (d1 // d2) * 2
if d1 % d2 == 0:
ans -= 1
print(ans)
if __name__ == '__main__':
main()
| 0 | null | 65,929,475,976,298 | 2 | 269 |
h = int(input())
counter = 0
while h > 0 :
h //= 2
counter += 1
print(pow(2, counter) - 1) | h = int(input())
count = 1
while(h > 1):
count += 1
h = int(h/2)
print(2**count - 1) | 1 | 80,098,905,690,828 | null | 228 | 228 |
A,B=map(int,input().split())
print("safe" if A>B else "unsafe") | S, W = map(int, input().split(' '))
if S <= W:
print('unsafe')
else:
print('safe') | 1 | 29,155,506,796,588 | null | 163 | 163 |
print((int(input()) + 1) // 2) | #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でやると正解するかも！！
#
#
import sys
sys.setrecursionlimit(10000000)
mod = 10**9 + 7
#mod = 9982443453
def readInts():
return list(map(int,input().split()))
def I():
return int(input())
import math
print(math.ceil(I()/2))
| 1 | 59,084,637,076,698 | null | 206 | 206 |
H = []
while True:
try:
H.append(input())
except EOFError:
break
H.sort()
print(H[-1])
print(H[-2])
print(H[-3]) | count = 0
for i in range(1, int(input()) + 1):
if not(i % 5 == 0) and not(i % 3 == 0):
count = count + i
print(count)
| 0 | null | 17,317,696,211,630 | 2 | 173 |
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())
d = input()
x = d[0]
count = 1
for i in d:
if i != x:
count += 1
x = i
print(count) | 1 | 170,391,234,200,068 | null | 293 | 293 |
class Factorial():
def __init__(self, mod=10**9 + 7):
self.mod = mod
self._factorial = [1]
self._size = 1
self._factorial_inv = [1]
self._size_inv = 1
def __call__(self, n):
return self.fact(n)
def fact(self, n):
''' n! % mod '''
if n >= self.mod:
return 0
self._make(n)
return self._factorial[n]
def fact_inv(self, n):
''' n!^-1 % mod '''
if n >= self.mod:
raise ValueError('Modinv is not exist! arg={}'.format(n))
self._make(n)
if self._size_inv < n+1:
self._factorial_inv += [-1] * (n+1-self._size_inv)
self._size_inv = n+1
if self._factorial_inv[n] == -1:
self._factorial_inv[n] = self.modinv(self._factorial[n])
return self._factorial_inv[n]
def comb(self, n, r):
''' nCr % mod '''
if r > n:
return 0
t = self.fact_inv(n-r)*self.fact_inv(r) % self.mod
return self(n)*t % self.mod
def comb_with_repetition(self, n, r):
''' nHr % mod '''
t = self.fact_inv(n-1)*self.fact_inv(r) % self.mod
return self(n+r-1)*t % self.mod
def perm(self, n, r):
''' nPr % mod '''
if r > n:
return 0
return self(n)*self.fact_inv(n-r) % self.mod
@staticmethod
def xgcd(a, b):
'''
Return (gcd(a, b), x, y) such that a*x + b*y = gcd(a, b)
'''
x0, x1, y0, y1 = 0, 1, 1, 0
while a != 0:
(q, a), b = divmod(b, a), a
y0, y1 = y1, y0 - q * y1
x0, x1 = x1, x0 - q * x1
return b, x0, y0
def modinv(self, n):
g, x, _ = self.xgcd(n, self.mod)
if g != 1:
raise ValueError('Modinv is not exist! arg={}'.format(n))
return x % self.mod
def _make(self, n):
if n >= self.mod:
n = self.mod
if self._size < n+1:
for i in range(self._size, n+1):
self._factorial.append(self._factorial[i-1]*i % self.mod)
self._size = n+1
def _make_inv(self, n):
if n >= self.mod:
n = self.mod
self._make(n)
if self._size_inv < n+1:
for i in range(self._size_inv, n+1):
self._factorial_inv.append(self.modinv(self._factorial[i]))
self._size_inv = n+1
x, y = sorted(map(int, input().split()))
q, r = divmod(x+y, 3)
if r != 0:
print(0)
else:
comb = Factorial().comb
print(comb(q, y-q))
| import sys
from functools import reduce
X, Y = map(int, input().split())
mod = 10**9 + 7
if (X+Y)%3 != 0:
print(0)
sys.exit()
if 2 * min(X, Y) < max(X, Y):
print(0)
sys.exit()
def f(n, A):
if A == 0:
return 1
bunsi = reduce(lambda x, y: x*y%mod, range(n, n-A, -1))
bunbo = reduce(lambda x, y: x*y%mod, range(1, A+1))
return bunsi * pow(bunbo, mod-2, mod) % mod
ans = 0
r, d = 0, 0
if X == Y:
r, d = X//3, Y//3
ans = f(r+d, d)%mod
else:
r = abs(X-Y) + ((X+Y) - 3*abs(X-Y))//6
d = ((X+Y) - 3*abs(X-Y))//6
ans = f(r+d, d)%mod
print(ans) | 1 | 150,201,418,711,542 | null | 281 | 281 |
N = int(input())
A = list(map(int, input().split()))
ans = 0
B = []
C = []
maA = max(A) + N -1
for k in range(N):
if A[k] + k <= maA:
B.append(A[k]+k)
if -A[k] + k >0:
C.append(-A[k]+k)
B.sort()
C.sort()
c = 0
b = 0
while b < len(B) and c < len(C):
if B[b] == C[c]:
s = 0
t = 0
j = float('inf')
k = float('inf')
for j in range(b, len(B)):
if B[b] == B[j]:
s += 1
else:
break
for k in range(c, len(C)):
if C[c] == C[k]:
t +=1
else:
break
ans += s*t
b = j
c = k
continue
elif B[b] > C[c]:
c += 1
else:
b += 1
#print(B)
#print(C)
print(ans)
| from heapq import heappop, heappush
MOD = int(1e9+7)
def div(a, b):
return a * pow(b, MOD-2, MOD) % MOD
def main():
N, K = map(int, input().split())
A = list(map(int, input().split()))
q = []
numneg = 0
for a in A:
if a < 0:
heappush(q, [a, "n"])
numneg += 1
elif a >= 0:
heappush(q, [-a, "p"])
if K % 2 == 1 and numneg == N or N == K:
ans = 1
A.sort(reverse=True)
for i in range(K):
ans = (ans * A[i]) % MOD
print(ans)
return
ans = 1
is_positive = True
prevpos = None
prevneg = None
for i in range(K):
num, posneg = heappop(q)
ans = (ans * -num) % MOD
if posneg == "n":
is_positive = not is_positive
prevneg = num
else:
prevpos = num
if ans != 0 and not is_positive:
nextpos = None
nextneg = None
while len(q) and (nextneg is None or nextpos is None):
num, posneg = heappop(q)
if posneg == "p" and nextpos is None:
nextpos = num
elif posneg == "n" and nextneg is None:
nextneg = num
# nextneg / prevpos < nextpos / prevneg
if prevpos is None or nextneg is None:
ans = div(ans * nextpos, prevneg)
elif prevneg is None or nextpos is None:
ans = div(ans * nextneg, prevpos)
else:
if nextneg * prevneg < nextpos * prevpos:
ans = div(ans * nextpos, prevneg)
else:
ans = div(ans * nextneg, prevpos)
print(ans)
if __name__ == "__main__":
main()
| 0 | null | 17,741,241,023,822 | 157 | 112 |
n = int(input())
a = [int(i) for i in input().split()]
num = 0
is_swapped = True
i = 0
while is_swapped:
is_swapped = False
for j in range(n-1, i, -1):
if a[j] < a[j-1]:
tmp = a[j]
a[j] = a[j-1]
a[j-1] = tmp
is_swapped = True
num += 1
i += 1
print(' '.join([str(i) for i in a]))
print(num)
| S = input()
T = input()
S = S + T[-1]
print("Yes" if S == T else "No")
| 0 | null | 10,772,262,862,780 | 14 | 147 |
import collections
n = int(input())
a = list(map(int, input().split()))
b = [0] * n
c = [0] * n
for i in range(n):
b[i] = a[i] + (i + 1)
c[i] = (i + 1) - a[i]
ans = 0
cCc = collections.Counter(c)
# print(cCc)
for k, v in collections.Counter(b).items():
if v != 0 and k in cCc:
# print(k,v,cCc[k])
ans += v * cCc[k]
print(ans)
| import collections
N = int(input())
A = list(map(int,input().split()))
Cn_A = collections.Counter(A)
ans_list = [0]*len(Cn_A)
ans = 0
for i,j in enumerate(Cn_A.values()):
ans+=j*(j-1)//2
for i in A:
j = Cn_A[i]
print(ans-(j*(j-1)//2)+((j-1)*(j-2)//2))
| 0 | null | 37,046,861,215,738 | 157 | 192 |
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))
| n = int(input())
p, q = [], []
for _ in range(n):
x, y = map(int, input().split())
p.append(x + y)
q.append(x - y)
p.sort()
q.sort()
print(max(max(p) - min(p), max(q) - min(q))) | 1 | 3,410,685,519,748 | null | 80 | 80 |
from collections import defaultdict
import bisect
n,k=map(int,input().split())
a=[1]+list(map(int,input().split()))
d = defaultdict(list)
for i in range(n+1):
a[i]-=1
d[a[0]%k].append(0)
for i in range(n):
a[i + 1] += a[i]
d[a[i+1]%k].append(i+1)
ans=0
for l in d.values():
for i, idx in enumerate(l):
ans += bisect.bisect_left(l,idx+k)-i-1
print(ans)
| n,k = map(int,input().split())
a = [0]+list(map(int,input().split()))
for i in range(n):
a[i+1] += a[i]
a[i+1] %=k
cnt = {}
ans = 0
for i in range(n+1):
left = i-k
if left >=0:
ldiff = (a[left] - left)%k
cnt[ldiff] -= 1
x = (a[i] - i)%k
if x <0:x+=k
if x not in cnt:cnt[x] = 0
ans+= cnt[x]
cnt[x] +=1
print(ans)
| 1 | 137,615,190,149,870 | null | 273 | 273 |
H, _ = map(int, input().split())
A = list(map(int, input().split()))
if H <= sum(A):
print('Yes')
else:
print('No') | n = int(input())
a = list(map(int, input().split()))
if 1 in a:
num = 1
for i in range(n):
if a[i] == num:
a[i] = 0
num += 1
else:
a[i] = 1
print(sum(a))
else:
print(-1) | 0 | null | 96,434,539,674,502 | 226 | 257 |
s1 = input()
s2 = input()
while len(s1) <= 100:
s1 = s1 + s1
if s2 in s1:
print("Yes")
else:
print("No")
| s=input()
p=input()
result="No"
for i in range(len(s)):
r=s[i:]+s[:i]
if r[0:len(p)]==p:
result="Yes"
break
print(result) | 1 | 1,714,764,611,000 | null | 64 | 64 |
s = int(input())
hh = int(s/3600)
mm = int(s%3600/60)
ss = int(s%3600%60)
print(str(hh) + ":" + str(mm) + ":" + str(ss))
| X = int(input())
if 30 <= X:
print('Yes')
else:
print('No') | 0 | null | 3,003,921,404,870 | 37 | 95 |
import math
def myceil(x,n):
return math.pow(10,-n)*math.ceil(x*math.pow(10,n))
def debt(principal,w):
if w==1:
return int(myceil(principal*1.05,-3))
else:
return int(debt(myceil(principal*1.05,-3),w-1))
w=int(input())
print(debt(100000,w)) | n=int(input())
a=list(map(int,input().split()))
a.sort()
am=max(a)
dp=[[True,0] for _ in range(am+1)]
count=0
for i in a:
if dp[i][0]==False:
continue
else:
if dp[i][1]==1:
dp[i][0]=False
count-=1
else:
dp[i][1]=1
count+=1
for j in range(2*i,am+1,i):
dp[j][0]=False
print(count) | 0 | null | 7,150,735,777,922 | 6 | 129 |
import subprocess
import gzip, base64, os
import stat
gz = b'H4sIALJZrl0C/+19a2BTVbbwyaMlvJqAiBVQgkZoVUpDC7SA2gKBE0iBoRVRgZC2Ca2kTUxOSnHkoW0dYqgyfupwZ3SGe8fx+jlzPx+jiMhAy6MFHBVQFGFQxAcJFcEHWBXIt9be+6TnnOQUGO+93/fjRuk+a521915r7bXXXvtxzllpc0zVajSc+NNyt3IIvTS4iMBFDL+6IUECuAKuJ/wdyg3h0gFOk9AVcUWytJMVLaYGRqeDf3r4V6ClcIG2SJYOYXRiqpGkaZz0VyRLhWWcLOU4cyIf8npwOcUeXL5Ilpr0FJ/bQ55Py/J1snydjF5MOS0nS0X59OxfGcOXMbnEdAqjmyKhx9/sz4VKvD54L+Pz3iJZ+jije1yR7xeQL5279J+JpXPE+lT0ksX4F1OxHUZ5q8vH5o/yVo70VteG6kfWF4wdOTY/J+jLGU14MjHaaTNvl+kxk/E8gNkA3n+c+z+O332513+2Neo4t6tuxVu3jVmJ9wpZPmySplpTlX5YT62Gy+dWQdF4byL8K4Z/L/8j70CvB9Y6n674285HauK7VjdVDHyvdH3DmjuLvh75tXNhhrkuN8t2wNFyYnjLgHV9Jv9+iH/jMvuSDd3p501goH8K/CZtavxATWq8KWFJ8t9QFfyGtNTlVKrgv1PBv8ylxgsq9Lekp8Z/pULvUKGv1afGz1YpZ7BKOUNV9PyUCj5DpZw8FT3PVClnoUo5H6rQD1Chn6VS7/9SaZcvVfATVOr9VxV706rwM02FfooK/REV+zeolNOs0u7rVfD/qlL+ChU9VKvoM0uF/0UqeuupQv+EilxlKnyOVSnnXRX+zSrl7FTRz90q+JdU+Dyg0r8yVPTwukr5r6rwOUpF3mdU6u0F5QzjBnEvPkjHkUyG/0FL8acbFsnGoYw0iucaKX4ew3/DyuFYOasYfg2rd+3VRbJ6c5h+Fg2S40dDOf2gnKOsfNGWXHqK55oWyca3Fg2td9WDcvqzrPxcRb3j0mg56x+Ul2Nh5R9leBO7kaOn5S9qVMjF9H9awT8H421QqKy46SYcY8dyTufiGl+tMyi4AoLTyTmn1znnuBdXBwV3YLLXFQy6g5zTXlbirHQHGLqsZLLXV+suc5V73fRe6jtOv1AVcLsqnUvcy5wVcCUgsqLe5fQE3G6nu77C7ReqfbWc866ZpcF8qNZvzXViTUEh4FtmmzOj1GWvsOHtGaXCmAphmd8NsDUPaJZWV7prndW11YKtDghKBes4pxOq8y11lkONLq/XV1FHcwateZ7q2kqnpzoQFJw+j232jIqaGlKpb4zHGwpWiUWMlRZR4QoKpAS4kRcI1QrVNcBzIOALTLFKMviAV7erBlgJugOCvQKw1ooqV8ApBFzVQhD4tc3BEspdweoKkdpe5izLddpKxzpnzyjNc3qZWkjlpORCUGZNdS1ojLIQnGxFdQQJ32VlUGBhV4HVtYtZsSlqJyq0UTkKqn1BkC3ozreD4pgYgB8LynJ53V0IhcCs8gQnoEBJ2xBUjQwjMO6gvpQaGVPhdbsCNrgz2mkHnuCfQKwDRB+dK7aCL4TN5Qy4ahe7oUqxNceS1gTTFJy1PnmD4u1xksZW3C+zA2dSs0OEQlbWFOVg0bVgA0JFlcQ8gbdSp7vGLywDk/dDn/EFXIvdooVax1CpaZOUhzzq7ZEHNKhs5+L6eqffHQj6al3eaii2LpcpMMHmlNGsVYKgrBInKG6JE0qsFLFjXX6/u7aSCAmYSu/sOmgKoRBkJ1oUUM65l8UdaYf8CtB/cl4wM5W8mK12aQ3JPI7VLtFdIaiOOgFbTY3MWBJmSUUl+icdGGgVXsKX5w8JtgpmpZfXB8BKsbWJwc0CldX4Kt1EvpngdaDSeld5dZ0VzS9Y7axA1+dEjwM92+OzSX2UFSRh/dPLhE7SOBCPC7jBJdSBuKl632TW2WZI2zp/aZVLUDYs63rYsOi7a6jbhqvFFdAiCFk55+21S9Hs57iDoRo33qygZB4flAE6RUcO/t3jqvZyoCjB5+U8bp+H8yx2C0HEeAkZUb3grq8WuBp3TUWNnyT+ZZynwusLurka0i6IrPHVoTfHmtjYUeOqruXQs3PTJk925uXkctMc9kmTnaNzrPmJy9E5Y7jJ8+YVT7I7rTl5FD1vHlDn5xTKIKtVCpL5m5ZNjTHVwdwP/+J/FKZ/OXatS+TA6zR2XwszRy2ZPVKadEadzu72YKlBQp38XzoblzVce1rXvGz28GW9cYZZkS7Ob7XcZ+x+Ls6zf/1kOs7ql6RTXGhQdU/koy5BrydjvRjHvPvCkjSc6T7I6MMrs7W4YtHMYFfnb7Q4A/4dg4Xsxwwo8/OsvM6VNB5Il8ztyY/FD2ls3iv+VknwxdK4W4KfLMG/KMEXSvBHJfgpErwYpyF+vJSfxi78BGncLcHbpOVL8LdJy2nqwksjnsxVFN9DEkuROEyC10rnARK8ToLPleCl+iyQ4KXrJkUSfA8JnpfgDdJ5rQTfU4KfJ8H3kupHgu8twVdJ8H0keL8E31eCr5fgM6T2IMEbJfjVErxJgl8rwfeT4NdJ8NL4fr0Ef4UE/5wEP0lqbxL8lRL8Rgl+oATfIsFfJcHvkuAzJfi9EvwgCf6gBH+L1A4l+MESfFSCHyK1fwn+Ggm+U4K/VmrPD3Thh0rnzRK8dB5rkuCHSe1fgr9Oav8S/PVS+5fgLVL7l+BvkNq/BD9cav8S/K1S+5fgs6T2L8FnS+1fgr9Rav8S/E1S+5fgb5bavwQ/Umr/EnyO1P4l+FFS+5fgp0rtX4LPldq/BG+V2r8EP1pq/xJ8ntT+Jfh8qf1L8GOk9i/Bj5XavwQ/Tmr/EnyBtL0avjTwkbQrq8wc39QipEVLCXKHYbt8WhkfowWS+A16+GscWgRXCFfhrdjROPxu+HExwOiCY3sJ/A3C6HpjLQQ+gTC63NiLBD6GMLra2HoCH0IY3XtsLYH3I4wuN7aKwHsQRvZjfgJvQxhdbGwRgTchjK41NpvALyOMLjVWRODnEUZXGssl8L8hjC40ZibwbxFG1xkzEfgxhNFlxjgCP4wwusrY6QsIP4iwichP4PsQ7kfkJ3AA4f5EfgLfg/AVRH4ClyM8gMhP4LsQvpLIT+A5CA8k8hN4OsJXEfkJPAnhTCI/gccjfDWRn8CjER5E5CfwjQgPJvIT+DqEhxD5CTwI4WuI/ATuj/C1RH4C90J4KJH/PMJahM1EfgL/6AF4GJGfwN8gfB2Rn8AnEL6eyE/gYwhbiPwEPoTwDUR+Au9HeDiRn8B7EB5B5CfwNoSziPwE3oRwNpGfwC8jfCORn8DPI3wTkZ/A/4bwzUR+Av8W4ZFEfgI/hnAOkZ/ADyM8ish/jrQ/wrlEfgLfh7CVyE/gAMKjifwEvgfhPCI/gcsRzifyE/guhMcQ+Qk8B+GxRH4CT0d4HJEf4Nlb9RARRc/A5VZcY9qC4Kaj0MujxcDuvO3Wk/bwvoV8+Bjf8Nnp2WX29pb1VUUc396aS5L29UOKuOgXkP0741AI5Daegqy38yOjkPANnRl8+POl2gXbNxIfAY7huwVb8Vb8qHEoWYLaGJXQt3bqgJ4Pb+NbT9zGa/by+zpDkHkTzbwfMvPhNpr/GMu/6pbn0XhC/W6HnNEVIOCCtrTfAErz7Xb0L3zDLfUuIBCuTbAw4Patp5dDbeHP43sXxH4JWYxDuViQprcX31E8t/j24rJS/oEvM6Gbb8WusQXDxqgZpOTD223Ws3zTYSGLb37cMhsc1ZbTqInwx1FsL759Mi5Zg2Ymk7DHHv5IUsJHP2EJO/mmk8JUzD4Ps/PVmP1U9Ncku41k49sbLVksDuXDf7EUaBBnM6AfhFsvMm/acb2MEK4L2PWLmjAls550hF+xFAG6pOmsoLfHpxoQ0cLJRLP9xESLo2gj+eY1lkXIG5a2qRdh4uPoqp9SyfexI7zZwgPOEQkRXp/DUPzhHEnpx3+Mx+3hHRLMgR+JIqyHURWji40bdjZ03h7S2eNtqBZ0/6ARR/hs9H5Sp43VyZQT7uAjfyEi8JHl8C8vejupQW9B7nvx8RkGY6MBfKK9fYqFZMULktcRfoboy94w0cIZG/uCabQ1WnIBo4lQhTW28JGniBCh67Gk0DV8RMc310dfxzkFX/iOsck9hCpk5Q/AHAhg4eMlhtC1fMTGyQnnDiaCROciYfNmC67G8s2vEA6imjEIbLZkMiTejH45kiLNDIk3o9/f1EUZnT4NxX6KlgXijiJMZicxaRhMmTzUiRpstIgrwTzISUqPQIsV8JEiA89MZas50T5jfiD2YG3BGm50hOO88YU433pcFz2MxYV1bZMNxAaYLWTSdjnIh6dYCuxbuM96k41oRySrpClufGQ0ml+4095w9FxJM3/O3hrT2uOt1v1bcFzeipQeoy9tPY9lHLAbXzgFud4g24eCI9zJQzYKuUqadgtGR3g33/CJppj4BWHAt8XGlVNOcjQxFW/CWMDe8IM2kGtv7jPa3jz/LWj1Vkf2PvQH3xpXTt6Lf47in9PwR8c3bC/iG1o7Q5+CxPbCj4WQI/wDn/0h1KHD2rMPCmk81DuKb/hBI1wLf7VCH765z00lYeEtjo9vl11rjsDlSXLZ0KkPZNMSeM1P9mbvEW6tIxw6Df864R9wFTLwDTvNfEPLudAXfHybQ3PBoYk7Cn80Nn0HYyV2rOdIGLWZ9njjI38ARVoPO5qfsXTijea/WHC22mGHIjpfpw5ut3D16xhonDa2GsJrLAPAh0Vo0tEjYmj+RTxsatq98j5icYCMnvg+Hu9YYhzaSPdZw8cTBrpoNOuGX0RvZxZoID3zq6g7G9OnaB8EA391CjVKwlU3RlkWR+v5OGo7S42yU9zejTxDyrZHJlr4SA8+MsvgiMwygTRbqM0+TjVhnPmNo3lKRvxvHIVOgEN/g10f4pvn6+JbGPQNWOwhh2Z7SdhxBFifkg4d0NEX7XgPr2kF7FvgED8TbrDHHZZM6LtNcQha/88Z1Prx6LNnKHuGRJ9hokKrTniKNAbqvpM4wC/FZjCu2XKB9vPTnKSfX22lukNk9P5iVNhOLPD0RXQVuop24KsZM6eZriTd9JEzkm46gm+eeJLMLceduVgfhVidw26/Sl7eranLO/5d9+WB38XipljqwRviELCaGOtYILRZP+Obn7IcxDYGHRzFQWvGZVvr0oS1TgQOO6o8OaK9goISin5xFNovcPpR9E9ZeOsIqj1KrPpC9OXh5G601yTangcvov47mKn+9luq/oNcly1ESTqBWOoaosTpYf0nfGQa6NVhqScAFA3jwoyEbc35lpY3nZUXZeXZ4zscE54hKoOBzbjmRqjXEaE932M31rYbB7YQJ/osyDizuc95zGSztpSET0C84gh3WE96pPo4Bf4z7tC0gxoc4f3gyjwe6f2I1q6bch5ETF8BwVY637ANfFCbgY/vBv8X3+nQvOkoPB/aaI+3lGj2lBR2hp4WBwxHhLNCeV/JyiOcraUXQgZ11hoSaoH04b3AS7s94tjJ2SfwJkf465Vpr5PhOAyojeSqIa4NlGKrZbfzzTe3WQ97FPxOOQKZiyDz6ZVpJAsY2hGCNyTjQZbtWr7w41A7cadvE186DzRqs+4vCXd4wP/GsAqJvo7geOPQHODD7zjCBx3hHxX159p16M8Lx6G+xoHpQh3toK89qK/tDs1uR+FPqK9tJZo3Swp/DD3d0VuiMXukygS8WgrIrJhvKDJpWV8xQ+Ou2OEx1rR4eOOK7ZJeuPFrDGbaoIkhYhsBNgMcnouWE2x6cdtUA4QzU000rJmaSb32aSwyl48YoEsZG/+YiZLNt1SBFZaEP3XAZZbxkZtgVgxqaDpMfKTdaP+WDwuWIuPjLfbCb42PbzdsXz3fMmt6s/4Ijeza7K0XdMC3w8h/w4cdlkV88zKtvXmBCeUj7rhZv5MqcYplNvIAAzVeZ/INX5zDsk0gWu3nxoGfGbNG7i8Cn3DH58bsZ4j/hAF/zDtFyLrXMg9L95P5Aw4qa0mRmy3rSPq4ZT1JPwAt/ISqXMRrOtF3oUM2Nr40AG3vsLGxvx4VvplQO4wv0A606n7LLCAarqFEj5zUIZHDUlSCapqoxfr38A3HzpWEd2F0QrySsRHdFK/5gNfdD7UBJ1iVdTeKvY55AMJjBCWU26vRNOXN00ZTnzeNd+w0Zu31GD3veYz+Q+s9xjpoa3/LGY/x8Ha42A8XHXD78PvGO94yZrUCId4/iIR/h4vdSPgmy9EBtw+3eYw79+tbjxk8xhUfFBk3xHt+4DHu+AAUuWK/J1xmuAD397L77Yn77Xh/myc8AKy2Vc8Xvm1suhMdTLjVXggaOAIaiI3DsSvRn8/CiGZ8pBRuzGgGR2FsxKM/jvC3fMOnoKXTJIYLf4MjMmqlmGnsU7QYzcdwx559iNd8zId/5HVllkWkDFRUZpfWaMt6SHsbTZNBXb3/S7R1Qt/6OWpjn3HD7p4xUMY+VMY+T3gW6mqXvvUTvLsTdHWy51tweyfebvWEjdDB9eBIIDBrO0f1VQIBZAQ6UQkosBH1FXuSmcQUSxFOWLP38Nm7BHCnxzTCMLvmnRmF3vOcqCTjH7R8vBU8EloziSMaOrXGBxeRKHwKmH+zfhcfKYOSsvdYd8v9T+HNcOsVVow+gy/07jIY/zAlQwPtCZ5uT+hILJNE14kmcYT38d9D9PrDBb69DcdWiIbetjcLvTR8+Hu+4Th06bMY0caFiXxDXCMMh79aweQoNCOf6N/i2+zxPReD+YYL+sAoinUULgKmJmkgNUGKcCakOnvDtnOQAxS5TV/StH/lPkf485LCj96gIV+lxb/cqeg/6PLGzWiemC8K7Qh/UxL+vgTG9JdOxuPoNf5lIqgia+SDJKHOpCT8bUn4QonmO4fmW3uz/lpH4cH7X6X+JML8ByifGZ4DrDNhi+C4eA148fkWP6/BpphQZqmC2AunnXCzCpzOdnRpVQjlohPX8/Ei8IBgz17AiiHSjg4yxeXDUetJoFqxEJJwK8Y3GXx4V9egeLX15KoJnND3b9R968naOR2+cMoyYtVEHSf0gKnslzAYr7pfpwEnW6RJYPh4C1/YGvpQMlo83IGj21lkbZAjbG4rwiCtiAVpRZnMlaN5wRi0vyRyK/ZGM8YpuSjLJBOqPN/esMLEhUbaw9/x4XdxLDcWr1ph4EIGDJl+04Ee4/vooycwhDkEEwKSHaWr5yPFJj6+iw8Xm0Jj7eH3+Eghmla/Vcsgd28+/Gb0zg7M9SGMrwjNOEEhyOYIH6O8sOw309pZCSZSQq/oIMxOqgu/E+3bxUHTfiGPj083UaYj42mt99Fa341+Silh3EDoQKwr30mYRpERJYYzPIx1T9IJ3q1wjVO8ESSFLmGH+K5d35ZoInukTzsg3iYdM96iAPmG8/oAz2fvtDdPac9k61N8hI8maCL8acl1Z9e1IXFJOsvOc6F2aBVc5MCwUMiyx2eaQteBIHZoPpCzD22ctOj5GG2ZM1EqLSgFLHUSbZFJptBNyYrZE5MqZjPLKMkzIjnPk7I8q1meMJjU1qyEIWqACDwi2OH1HuOpFphaE0PkmCEygzTTgKGVh2h/LwnBoT2iGjo9+ESLoe1ZnFAdhUv75sXUPXg67rjcOYPx0VpxXQXnDXpgLjYfMB5lfEknQdMj+tM0do/0+RqqoGuO4IPYtPN9XrMHRHudzS7fhhmlASeTbbxmrz1StrMTAkLo/Gt5cL7Q2yCa+P5LiH/51uhtfOuPWl6zjV+y7ezDT2muxdW+5qma1ddCNNUTXG//pW9CffXp1t0dGZ61bdxIuKslUXIbBiFv84VnIKwODqHj5cMZD8+Orx64mo/zcbh1Gr1D4IRkZe2Xx8kUDgI/wit4d5ghhb/CZbWjvUARN0WTF/FI71xj2cXRiepeNntFOPq7XBrw7LrIdGn+BTq9WfIFnd7sSkxv2hwTXqEzwjWPAJGE13e+kK46kgXVKPC4Jd9HF1RXHk+54FgSGVHccD/MvmGqblz9KEfndVpo4cSd+mWIOgWy2iO3dfiSuH20B51b/+1zdC5P0SVB1cVCHuPLPeiHcGWxqYV4pAl0WtdxnModhJJizxJHedwBdrOX+IuMkshccKHv89lv8xBMC8t53cqoPXy+JPtzaD8YXM44CvcZG/8Dx7DmSZ327F321qgOJl/WFvvruF0Cv9tKhrUaG3/DguIXqbgQpe8Wg2AHxB8Nxy7wzfdc4PedtB6GcUK4D4wRR53QvaBdm/VwrFG+4Fv2OZ3pnySyLdZjiz9uMUBX2TKGaV/zRSpLORIbr+/iJDZb0wVALc2k12j4yJ1khSEymI/cHeV1/mjxG1rSeBCAnNcGr8BpM2V9F8zN7eF4x9zpzVM+zHRkHwJA1j/Bf0bqoW/25CO38bp7oTRnlHhPXLyUIWmgcS70pqR0HuIizSF7YUvIwIffj/0rwX7AZ78DMV4n33pKx8dhpoyzVh2OoXEcCVqEQgjQNMJ1GKbB+I3ycLxuNtTQaugWgoZuiOsDt8JFwv8DwS+IMkALMPumCYyZIqY4U7xsaDWDNYT+jn2wsxe2yBrL6V44Z4umfUaXA1uIVeWQpTa40/BLMPUrRfponFkzAvbITANf+JaxcRiZ5LxCo6CIDdrgKzGMAbZy0YieI+HYiiiO+1fxuKL/Y3TyZ1hWI8vGGxy4gjnV4CikEZfQly+EpjsTWhhbiyZQuAuiNGNjI1wXb8FuFuuvIcPZ5S303Jtw2KWfxuMd5WuRW1wua2TL/bmEvRPRZz7F3r7CgCzr7fFpBntknCPiieKaXp/pzRNvguAiuhKJgOB6e3yWIXQNDucyL7CAzITi0dc+ATrNlw7Np/aGNjK7xd7rmOCHrnva2FQPZLHnuX9CnHkJcRqPgTh2z9qS8Hl7uN0eqTFg2AGNYINGCHEi672JeMeiO4/RnYWhZGfhanFnwVH4vbGpjixMnYpqgGvC8k4Jy1XAcjT0L+IWBvpVtV2MV/TUB75+VOaUx3+S2KMaheUSSwzbyO4SXndifsWOzEZEdvQSya0ncSJOGkxW4z4y4VlAuBqEVS+EurbiUTA+/BHMoqJbAO6A2DTt1elmoCyK8s0b8XbkRa5hEdfwtiY6ERUTSXtCvB9ZtxfuECfWDj591S8LOCHt4cmTO67G8jOOIrUOKHO3sF2s+F7jltOkzmgLlhVuj9Z/cpFtnKu1dJX70Y+JPfEwE4RWu9mialgDtXRMWvgxXQ/Gton+eiSJdsCtxEtMoSFk6wqMs/eq5SSUG32UNuuNmAcUNAyazRQazAaa3qt+Saj6HKXDjf5jOkEh60ojIBowhYahRyRxWz2N27ZHP0IqXKFtj777EfUNZrZtNIKsTQ5LjGN//YgW/OeP6PhtFpe+gX2yuvrNcGjYFv6BHbgrenfx/OIFxQuLnQu2X35g9sN51MorFjyQFl0CLMaOI0ZSjrERd+RUyooNVngWY+P13VBnJFEP7IZak0Tdsxvq7zgl9TlOnfp4EvWpbqgPJVEf64b6LbgnUbH5e6pi4nsM0KSxDMBICDyfSgiOHwGCsk9lBK1SgjYkeEFO4DouIfgTEsw6LiPYc05C0IgEG8/JCA5JCSqQYJecYN0xCcEkJHjomNxQLs3gBv4kKefHf0A5+p/IEmvs1TQyO+4w4RQZLB23caLRbNlmlrHx0TSc4GHo14RXCkfaWHLZ9rh1MswCtvx+SRG3CQ8vvv4lXEV/cZjy1KaX84SLkdGybNmuhbERH3SjPD2pT8HTiSTraenGev4sLhIk4nxj4+hEBVmpKtiUVMFa9Qo6VkDpZHhBF9MJgsbe1UkMdmXfRPPcfZj6oesPyXcIY730qTPcyDJ886F8nya2QqWGHw7RDK0fymcqsSLIsBXHs+hDpCna8a5fw4Y8HBUiGKW1DcBWQXz0kQ+pf0dgywyImzfhwazoCAlaXMeKPvgP2TD77odkwQgGfWPTGR2diPrphllsALWA2DKd3BLo/v8I2f6/sbFUJzaUXZeioR7UKRtqnk7dEibTKmP43CuziNOiRazWihWt0Kao6M9JFT3QTUVendgNpsOfTR9ij3kcrqLTD8bj0TT4ExvVSToErhA0FqO0MDwbm8ZpaBwrr7xHUh880o297xLtnepcXtSdacqi0rXqRX2tIUUljHswtGvsSE8ac7dw0punohdQrMU95cgYIAmAO8//QIrj0P4x4j5h4D4xnBrBJASODMdIpD16YHhq277mIA0iPn8fAimTlK+GgzQWXkhClnmKkEW47bJj265Kn/uAhtH+9yXRzh8t2Ex4IqcFAyuIT67F+ARXJrqimVs/oF1x7Ps0mjEkqIEwKfYxMWrD+5LYR7XsY+9T6kMHug98Nh2gdC8fUAl8frgGG/P76L0HZYMTPuHZNf5BZTGzisNZzTiZfUB+EqfjKdEAydElibNJXoogEbasxfyyFpuu1mIFqTg6y2Te8p78aEHsTxckMkoy7IQM9vYei+4tInpZhf6OeMqbP8AlliF48Co0kiymke6JkftmPV5HXtGvhwRj91VolNejd0nX0KnHwgPUYkgmOgV44wAdq1draBPUYxPUvS/znb95T5yiGJsGaajvRDrryViBhvXstP63mukRB0LQd/CtbMYQXkP4QrGxDhPOPnD6pPADP6tHPMn0ihX4ScPBdAgFuYV1kYMImA7QfpMF6V81OBI0fkhWzBwW8HNvk6k+2IXMOb2YNOw+1M2wK4iaESdw9ZpuJnDyms4m1fT3bjzqa1xq21/zLj1RU7Y/Hm88LJDtBP49esKB19DzA42v4mADbsnY9Ge8+k90TX3fpSo+sI82CM+6XmySNjW//9hP5pcHJsiM56MJ/43Gc+d+FePh3pMYz7tAJVl8b9wnObkzw3hHi7GfTly024qn26OPvUsO8fDNvIEPzzCh7+zDh7O6liHCMwx4qoct97F1+oP28DQDGYE/5sQR+ACXagR+LclemruxzF+STspc8Li9bAQk/nofmY0bGz/BAZBU+AFeJVX4jlZZ4Z+6GafXqjR4x146Yv71HeLh1oKH25ILfzb5FxeROfwJoll6rFU6oI7eR8eVIjau3EOWWSoVYdHPsoRZe6mbvuodahFFkuNoBf911R58h1a7/m1abYGk2izJKGqQjKKfMVa9LI94JjlxqDYUTJwaifOGkDsBRf7zes5QZJwdnYoeewuninQZihNmJpYQsfairgVFee3TZLUPU6vdiPGAa2/qsfJf3qZckKh//lt0gy5/Lz3Tczg24MfU2crfZus/kCP2+Q94Gn0KJz2P3vBlJh/+lg+fl3T75rdw8zeOnXkY6fSqW24wnXGE77eAA14O5nuzhSyLZdLjvxBj8IXbjY2DU+yPQZvuysTsO+yROwz2CXeYhMG4zahzhK/Dw2P28B2G2LbEeY6SyCg+vNeRHcXD/CAw2chyGKd8bde0GR9rcYS/5ltjtxifaDW08hvp/kZ8qMNoO13SdPZvbMMqgbcXti395fTmiWfIFvs+oqCdUANy4sg+YQ9/YG+N63CbreFoJ6+JIlNmDHJ7k2OrX0VXgHpmNt9/3lACXg5EPxX9+5tipBnOcoTrgf326c1TzoB800x8w3YDXzjfYjI2pUH12Mrno4Oh1hiuAHcMJOFsw45MyeIXUJCw8yR2iBISVtJVvbRo+Zu0Pe8iNWJ8l1DoiLexdcn+gKx959nDZ3lopExJrPPnNyUn5W/gm8sss7fk+egTA86/pzwcL8ldQ3PbcJ+HZc9KZDenyG4Pn8Q9ZhiCG+qjnLHxeRKFhKCjzIxa90effpPMWu0N52DYfoajp8xMJMdQXItmlHz7NmzAaM4eYvUShv6xhzFEfTwJcpqnaoq3krC3cEdXqQay5e7IPgqWg3znWs9iR4qQArY7mn+ZaW+4oAndRVrzYa54dY+OhYQbUnZcqONxVyAc76ghWAkP8/YkOs0voFVoPFTE1FDE1NDeMQZPJUYE7DLfRF8BXW2kXmK7sektsr67nEvW3im0NIudLCTbkxaSR5N8p6JTd8sG7/bd4s75RTox7ptH8Hxd2GCzni3ejAU7mr0Ws0dyXhI6cyQXWwH4R9azqcohrHIU+qPGB8eQeDDmyP6ab77fUuAIX0CqhjdlIXb+7jhR0CjcFIepFYQGMOFKparXydp/RmK/C8ghCsEDjnzzsqij8HiohI+ATWN/nNkfKebDraR9CSR0Yue4cRdaJWSn5yHOxx3NIY2x6XrchPk1QbV2Jp7luWIj89AaqBBl52Fk0DTPjof7NbWs/BXfLFiKoobdrAvLnPsVXc7dYUG2edma4b1IT7LvBoZi5QBuHevD9QkEN18g/SD2Eg1hhaFkVn21InQNeTCAuLM9TrYMTCj0UCL01YrhOrQQJc9tp74pE5zMPLUVdl8y2xUyAm8ywSIZQbWUwAwE5o4FLFJ0hPMeTvsh18xNWj0lLzN29XnZjHfSeVElG4DTWJ78br+EwtbhXW1cdncIu8tH78O7feN0caPvQDK0dHjx7FTEi4ZxUnCSfZg7lRGfMPbS229lL8pK33bqhA/slBoVmmNUO4A23e2k6WYpZx3/RGXr2+hko2onPbGEjy8I8/i43RCag/vA4Td/bg23ttEoK30nnVV91E7MMLGU9Ps2im8jYqNnltx8AG7GKpniHx9AF5LWDCANkCCa34bLROCZJwChnUTfVrz6T2iLBwjTp6L2HcDHPy7gEFgkf97O0AOZOcOHJ1qKcVcM5sO4EhpZbtqSCV3Puv91PEQQnYf6beiEEQjfgiVxWit3iH50kIpfJw4UxmL0n/GOnp619gfaOZxdiDHHSnuzvgd/S1yHZULlxUbH90T4iAm9pSl69w7iGI2ND8oPVOh2iOduaBiTRZ5MEMAI8FRLOrD90o6U5ykIP7h69VXU2UY3Im8kHcCSvBH5d/pgXDR9Ox6FxHiL8lYQzQedAFdNhVq67OaI5Noj6XykKgoFik/IHGmo7+Tqe+Mw+t5ObNR0EhLyzY5r4g8PMUikGbNdXGEp3kzEucm45d0t9JT9KXIuASXybU8VQHxZEj4lKerENoVixOM9qJhOLGbd9pSKoc8C3RHF5wpLmmuj9glzoyEjPhQ4YgcR9vHtHVoaF2UShfUnA7S9cGdoHirpk1Y05c+EHmRBRbiy8XBJ+HzHSHl8q1xhAZLQJOxCf2zFBQsHuAqDsfF9cHWxj8jjCm1dg08VHXyKja3p4UaLvgeZ7WCiOK3mkU4jCBlNOspkZIvUyGYWR9Kb+XhxOAOEfnQYObRwimyg9sD9D9BvrI/c206Isx1WJOiJBNlygtfOSwiiIGrsT+dZmPrADuyGkuFHXILfm1gAaEu5AHBb0nz8SsV8XCJUjKMbDB3LJUvhHUukE+x9rP3uJu0XKkteDPsmadF/l0a9xr8qVurvbWUSwzQIRuZqMjJXXMZEWtpGyvkoUeyjLdRd37FVNgXA/meBRqF7TYNaaf9o14mrq2a9uLr6ditd8SGYn2qLuE34oH30Ny209cjGHO4LQRqd0yoL4IJbyRYWrq813a2la6RIB34vtlQrbnQ93aKsfHWaWPkvWOUEMxg3t64i/LLK16bRyldBGj3QIqv87JauyqexypEOK69IXoghyirfyua/W3CYSl6HJkS3bKUDXBoS3QZEHWS3qjyx6jskiy7cmcmeZd8bsroW7ggKlyb0XQt3fr1y9+elpGWsX3GqNtURorU+O4LWuppsD/d9YURXrQQFtaK6xFoPpimWC1fKjOxOtdqmpVIJ6ksUS1wuXIQGsW8rbb96BJ4Bqo5bU+U/8TeaHxkU8+/CNv01y38Ugcot1JTvZ2njFrquMX8rPSaWSbYse2BBeEk3MaaxPYxpamvMLyQpu6kbZQdFM2IV4eUlVvT3JE/xb914imZNahPdupksDm+8QWZjrTdcno39LJcycbNKa3/6N0lrb9gsm18ufoOuIZCj7iVkimlLDNh0dVjA7LhJQJaHS+jysCNckDhfB0iYA9rYdNTGpqMg9GQDWcOvTKzh35W8hm9svCVpcLiim8HhAj5h84BKKxS+QVphtEXW5yZYLrPP/ZxW2LBJpc8s2CzpM7lvyFrhk9cv2gpfvfEzW6GPRmwFrSZFK3ye1N/eUO9vsWfFXXJxSevRjYl1+lPR0ZvIhjIUimdpSJ2H8UpZ5/NJda7qpo/XplL3tNfpxMq4EdWua8E1+lX+Iq7j5lTUVzPqT14j1PIVffRdmZtSDy5HN9KMz0HGmPEn8j6Q4rlk4dUevmCPLCTLFjeROOGGpOOUz7PFvXtew42EqXTRNbIws7s8v2F5xtI8mSyPqbs8jSyPluahQXfkWsxyHckyJLEoP+t16qw/2ICk6XRBBdcvF8rXFG6XTt/0MH3TK94o8AspQR8g6NNhkxHMlBIMAIIBHZMk4eZn5Ln4fEt0Oar2/QuyWPSnC3RpwBB14t0vL6RcVjBFi19jywrS+F2+Pm4Pf++IjCqJuA0lE9wmwYzhYwZYJO6v29vJ+/XsDTsMJWG3IYYnTvgt4lJzCR7CDX+Ci2KtP+jI01m80RbjNW8ZH2vlwyf41hO3GJ/YZtgD2K9oF76WLzxj/NW/kq0/9hRYzkY8lQzTFeDAEf7CkX2WD3/NN3zSyWtahb72yFV8uB/jo6TwC2Pj70mLtHXyrV/p+HibYKTkGpimOsLfwCwW+j9ky4D5Kms/e/NcA/UOuIbdcEEbmCVfr4fG6IvHzMMavl1LzzFMAuq38SFvwcRH7gNgGfiQSQb2vBF5/NteuAOrDm8LbSmBaW5nSfb39tZTuo7ZtJ7meYbYr5QHoK9IbnOJsxxDG23NqxB3ZEvnW8RShxNLNSuXwf6A1pr9SsJaYbplKCn8LkSeszRMb57faQLVkhc3GDAMvPBXtppvD+PB9gXAqT4K1ybFMn309g2J/ZS5uNKwigSMF8gUORMdAL5yJvGimxHANF/4FEEKfWBGhOTQaxZs55vnWwwkPEa6UVDqln/HsDybYc6/QqbVdEqBPZG8agFPQ9yvN0QEfRaeg6hHnWSS8w+voHHjFJydfwa4rdGyFKobQfHAGkKb0CCjf3hFnDR8/go9GkUXGCZaomVQZtGrGuxkGJY9AYqxntyCb9/chK8mR9ywV2msH0n7foiZY2+B6Ku7Rhw3HXqyyGuiIyZ5LPXShsv7NcR/Y5I0XJLjG7/6K119M9Gx8n4LH81/lUq+KNrrFeqk+lP2OhYQHuVTvZ9Ve0+ovagRJrDaOI1ZdwEiduaC4n1Ps8EeSiK3kiGN7PXGZ2Uam35PbHaoPeIz8IUdQh1dc+8oUO8J1H9KOBlBPF/Dy9DoQ9Y6IjfhDsF1ZIdgiD1xrv946D9wbWzkS2TMol0Td6OOhN6C6rHLGFBJfV+iQ1TaS1KPbpCYumL/rpQP/5SY3f3SEO1D32pxd+yvLxP5lfe/ZI9xPf4yo/vdi/F4N+VtZvSVIv2S7unXMPp8kX4C0ifI186OboI70SdeYv0VmiccL55rD58tvt0ePlBc5mi+Ye2VZu52vnnkOkhLHdmfWw/zred1+AbCaOgFuoJ2bdf7bE44wmenQBnxAf8AlWqgFUMniM4WiErbLuH32+3sXYbs1YUa2Vtf4cfebJRIu16lv0r53SDyHYNKd92ooFBZXcvdt6x+aV1ICAbu9ftqa7xL7qmuWuxxV1aUuwoLxo0dk5832pprHZ2XP2bsuIJCV3lFpduzuKr6niXemlqf/95AUAjVLa1fdh9XHvJ43AFuVCgYGEVeyY7fxhnlXyZU+WrzcvJHVVYHhZF+V8US12J3kOADrlp2v7piFL6tOjiqttIVCLiW5VT5/Vydr7rSnOWq9dUuq/GFguZaV407CAW4s8ePF7ONH0/yjR/PMk4s9/m8N19yLn+wyuV3T/T6ahffbMa/t5pvHT8eX8xf7fJW3+d2egK+Gqe73h/IqvDVBgWzzTw823x3mfkWM63IXwqX/3xtN0OBl56/NlTjX0a4mXjRLD6/O+ASfAHn+PGeUG0FXI0fv1i4+bL1SZn9Ofq89NzlAZ+rEr9cIC9gwc+1KaK2atQbsSsJPLH4VvPwy1M/zUet4b/fOM3Db+1q21tkRlkcWAy29P+Osf+PbflnN9zP7wXQcP8JHaG6tg78UqXZWy2ASrxmjy9AbmZlm5dWC1VmfEG/2Zo7fgQn/VzC+PH49QIUPBCqEMy1Ia/XXOsTzKQszj5qlplquNpXa4b/ycvyK82eaq+bC9zETYXUPAxJakl9+FEUKJQz91JUEgyVwyU32RfyVtaOEFgOzM1xM62jndMcsyYVO5zOmU5rgSjyGCKxNXeuyxty2/ATFvRt6RehzysVXNg2lWKW7ukLbeI3CsR3sV+s/EmgSGkmE3tv+2lfkex98In3V7P7Ley+2V+U8v5adr9I5f4idn+R4n73/I6zz5Lo7hLkG2urrasOwHDvrhUUOeX87PWn5ke8v57hTfcWpfx+nKgHXOMg8ovp1anpc++V07dchH6VovzTCnrNYN2Ex9k73bOejcfxoaWN/zseL4BY9kNI8RDgrufjcTwXOO/DeBzffVNwOB5fh+mxeBxP0B78Kh43Q1BVfxoCdkif+yYer4d043fx+HpI152Jxw8iDOlpSKOQGqD8zLOQD9J5kM6GdBek69hL+QeI8dh9czhNvUkzuE8Pw1pND9MA9t71YcCb9H3hqenpO86RvuhP8fhaLDvDNDUjc7qx91LDKu62QRNuzLNcJ/1+pO6+2Q5SQg8dflpJJ5aTz96Xvg7qjeRwnH5NqIgrzjBNysiclGGelJE1KSO3OKNgWsbegQ091qQ3pz2if1T3kJbkm496/yAex5ULvX9pqnxTMmbLspF82C7rQOfnYL6g/4tKvrWapPrwvPeio/H4030gH1+fms+WDFm+AQn55fobwnTz4pfx+OMYHE/KMBVnZE7JyG3QPcL4xO9M5IIN3ISB9SXIxjFdClBeFthMX/zShXmZyGdxhnlaxnpdg/4RoMbyn8L+Aza1j0tZfnFGUXL5KM97aMuQ7xqWr0FL8fgNvRbA36DA69GWU+CHAP50Cnw+4OuhzwxjePE7nWuQh2/jcTdH9fWo1paR+YjOlmFu1tsystak8Rm5D6XzGQUNPUoyirwoAciRRWQCyUA+A+UfysmCchQzGS6uO9KwahWne093E/tawhhU5z0MmI4APqmBL/8eiG+4xhV5fMBtMd7BZX4kC6Pd+xjwawQaGfDkdexLGyhRB77y25RGv0LxLQKD2Z1OBCal0zx6fLP3HexjJX0QeLEHBVbiimpLD1rArxB4swdlZw0CHwHwnfgli/0D6J15RKVX0qJ/RLL7GRBGETZcST+u8QgAmt0M+B0CPw6kZG8hWWMm/TbEkwi8kkk/jIHPN2laAXhJVGtgMMfhwxhrketOAEaKH/q44Tr68ZMTeOeh6+nXRwhZBP78Rvx+yHUj6LcvyvHt5HePoB8u2YHAb+HPeJHsvRvpJz6qsdX0N9M883NYI4W0shloXLcBmzgfJ6ePwT98gSyHr2ZYIlrBcg2V+2G80wR/yrrsY51G96hmFPskBzYRV8uAuxD4C/vYiACA5n32BZD7ERjOPlvXiGR4ftwiTojna+kHRH7SA9lyLW1bHSrkcy3VrAGBv+ho0W+g1Bvgz1SdQq53H+B0ewlwSGT4ELNcH74CuCeT64865iIQOI/A/9bQb3pokexbDc1jRADfr20QKzKxT/4VoQzXpdHvRExHYGaa5KMyzWkS9fyBkbUg8CYAr4mlPdiTCjQI/+B7VjBdj7bcHw+WaxI638vpZpIv7IoV4IUfbyHQKv0+yrvsIzC/x9wfsy99/FHDaDM03P/8/uf3P7//+f3X//xD2HyAfcd99hD5PEKjkv4tTQ63K+DPGCyO7AevouWK36Z6porCV4v32XfExW8tid+eEr/VFGX3xThd/LbWmQtxH/kOj7Yo8X0w8p2dnkWJ76PRwJbC4je2NrAb4re1xG9FXanQT+IbYew7TuIoXZQmn3eI3wATv0W1rn+RDL+2X5GMb/EN5T0V9V+IU3lOmyh9nMEiH6cZvNBU9N9qJ4nv2Ct+AzMpH8NZOpalU1k6l6Ueltax9CGWPsnSZ1m6gaVtLH2fpV+w9CxL09n8dSBLh7N0LEunsnQuSz0srWPpQyx9kqXPsnQDS9tY+j5Lv2DpWZams+/uDmTpcJaOZelUls5lqYeldSx9iKVPsvRZlm5gaRtL32fpFyw9y9J01l8HsnQ4S8eydCpL57LUw9I6lj40OLX9TJs8ebw56/byUK0QMufnFOTkjxwdIpB1hTU/Jzc/Jz+b4jlGVOF11S4217kDQVwey8sZk5M7Mp9mGb1CCISCwrLR5izBtTg4ao7NYSsutTnzxuSO8uD3NbPNWbgiV4mrag7H3BKaPZvjcoLLagRXOaRCgKZV4lV1reAO+LmcWp/gzimeZB8JRTNocW0opzxU7a0cWV3JEajKFaziciqX1UJ5NBUC9A5jWAY44V7A7XUhIbvyewWsshr+Cu56+At8V8M9X6VLcHE57iqnJ+CqcTurKgNdEBRaUcG+beoUyOeSSRlOslhKyxCv76kIEMZcNdUVkM8nkD+0XlpHeTDI5VT4anAt6mf348HMR4t+rID5zQKGGKKgV8ai13PybyqWsfzipppZQa9XwFZFfoHlFyTrAt3lx/n1WfCBYn7R769jiEqGT1OME4l1P+bztYpxQXSwz7FxIZ3JblD457mMVKsYZ57rKR9X1PS3kPl0Mb/oxxeyAe8RBf9aRbqEjREiLI4Tp1n+9VwX/7oU8t/HdKpVjEtr+8nHJaX+RPkbFfnFcW5df/m4mMbGfmX+R5hO0hVxwcGr5OO9WvuHFfk5Nh6IFazVKdZpFenjivxi3LOWBR79S1LnF3+/VeQX45hnquTjuRr/6xX970WW/0WWP6tn9/U/p8h/kK0HH7y3S77u6t+gyO8PsPXhAOv/Cv0p7adFkR+XQWnK4jRd9/Xv5+gygk4R9x1cnlpeZf0fsdUKnSIujC5PTa+ETzD+E/EUy3/6EvOfkvQtaVzUuVzeUdMV+UW5OhX1i9/x7VzZff1iel6RX4xLxdMMBzXd58d1QWn+g+y7kAcfuDT992ELMon62feAoyy/QdH+yvGgH6s/V4EX8z+kMv6IaT9O/t1e8Vf7IPMfmu79r9R2pT8+QtN69jFc/PDh7BT+q6dK/S2/pWlT/+7r7+6nA2pxPJbjtYlxVo7XJcZPOV6fGBfl+LSu8U6GT0+MY3J8j5TzDB1o5XRKfM/EeCLH90qME3J874T/l+P7dPl1Gb5vwl/L8RkJPyzHGxP+VY43JfymHN8v4Q/l+P4JPyfHX5HwX3L8gIRfkuOvTPgbOX5gyvmVDmaTon+Q4zO7+r0Mf3WiP8vxgxL9VI4fnITTEJ/9dVyJp9/UTdbDbQyP21rS3y8Y/i8KfAXD47aU9BdieNwGkv5+RfprV7sPk42jg7g09l1wsZ+9w+jFfc4bJIKRchT4fIYX90fFbzdXMfyLiyj+cVbBYww/u5zib2LO5AOGb1GUr9eyej0Uv4/h5zG8qYTiz7EB41sRX0bxT7MFFNwXRXzuDIr/kPFzi57iV1Wy9RXGD35ZF/WjV+hnKcEbE/vCol/7d4Y3K/CHGH6RAt83jeLFfW0RP5nhcxV4H8MXKcp5muHFfX3xm85vMbx4niDxjeZ0il+rwOcxvLgfL35zuZrhxX148ZvUTzC8eB5B3EvezvAv3iun/5bhZyvww3swfSrwc3qk7kcLCH2yH7inB23Howr/tpLhTYp1uccYXrle91wP2u4aRbu/RvDJfukjVo5fUc4JQp/s39Tk6mlA+n7caoV/uMqQWl5Oxc9cT+iT/VshGYivSOJ/OsMr+VxAykn2qx4DxiTJfvJeg/z79eJvrQp+M8H35daz8UWMKf7O8C8p2vFdA/quLj/MwjWuf8/U5Y/rmRw7kXUdFfxdKuXUquAjKvhnVfAfEHzyOHtEhV7bKzV+oAo+WwXPq+AFFfwTKvgXVPAHVfC63hx3nbYvZ2byiuvEg3rTdlzF2lFsiwW9U5fjZ/hcxfmcJ3qnbseXemOM2xW3iPOnFpXyP1bBf62Cv7ZPavzoPqn5cfTBOUFyf7lTpZwmhleeR3pehf7dPijvIG79g3J/9UMfqucXGV4cL4b0BXrt1VxUwU9WXxX76UvLP8rKEd/h6VShv5+Vf1RRfliF/um+tL/nsvZyM/x/qND3ykiNH5pB5RXPzYnzsFtU6J0ZSDMoSQ9LVOgfYuVz7FzaPIZ/Q4X+sAoeJ9+p8MNU8JOMqe3qDka/aJDcTparlPNrFfwhFfyXKni9ierN0CTXW09TavqZKvhyE9Xnoka5P39KhX6bidlho9xvfK1Cb+xH+52yfQf2o/SnFXob1y91Oc0q+PUq+M0q+PdU8N/0o3JxinijT//U9Deo4HkV/N0q+Pv6s/GXxS14Jo/ESwSfYl45KuDzCaP8y1xCha/SHRjlD/jKve6a4ChXeYU1P2+UbVSNq7o2L6fC78dNENnqfW4SxpqEGZ2EyUvCjOMSZ06DoXKn3dlVpfMutROpVqvTiZsaQnWt0+nIn+mrddu6IU8+MDwl11Z38QzyE73/VJ7Rl5AnH887Xxqltzoo2GeWWp15QSFgsxX6Q8EqZ7mrYom9NM9ps9XNKnNetBDx4O/F5AkJ1V5QWrDKFXBXOgNuj71UGFvnxqP0wEKuk5ZGGCl12UvHQP02UYoZl9JwmHUcO5w/Juj3VgsVXvt0RdFYaFmFNxhQL8NGMwf9SAaISts4jy+w1BWotJc5bR4/Ycw/q7TAecmskSYReSvA0+ve6lo3sjeniz9CdDEGKVGiiIsyWXjpTIr85dW4/FRzo5351bWC0ybhkVnMWKeoze7ZtWFhF2WyuFsmu1qvos5L7KFUcBQ4ndU+smnovKvMfjlH+y+BXnn0/lKyKJ4GuIQsKQ7AXzxX1zH7i9MWykUovUwtlV6+lkovX0ul/5SWSi9DS6WXpaW5l6mluZevpbmXynxFQAgKIY8np4JzOqdPnuN02EvLnE4OBlf3YuiI7oBTqHFWeGG8CnIpUE5npc+52Osrd3mdldCzg05XqJ6r8NX4vW7BXZkztrBgdGoiZ9f+uRMUH1jG0T34ylBNzTLIIoGcXdvujNTpnDqnuMQGfmMKMEs5Z9dM6llTp5baypxlxZMcNqSQFVEpRwQFVwB6+ZQ7ZxaX2CdzuGEv4u6aWRoc6/L7IY9t9oyKmqKiaQ77pMnz5jnzcvKJSykFAwJRKp1eV1Bw1voEp89DSJW0Tm91eYWzIhgiknOJGsrmlgrWMdKHjMpDHnsFIK0VMJI5hYALhgp7BY5ZFTabkgOgG+t0ClUB31IYVyud+EBVnbLqxTW+Wlohqmh6nXMOa8rJwHUQ2/GuSu/suiTpSoPjAu6gO1DntiWJgxmhPI+r2stuOUfnjM4ZQ7UijKlAUwOOrXnOEufS6kp3LdG5TV5LjtXKMYVAdUJBtS/oxNMk+XagnWxVUHM1Lq/XVyGvz4OPYClYoMqmEmN8lsRhaTAflOAvxGfGYKgTQMCaOTOIipVaqF2Kd4RCaFuiZUGpiYp6lxNKqK8WkqsRrHmBUK1QDbbsxi4HIkFhweRWHJ0rtqIvhDbkDLhqF7vBkJJqw6M60MxerxMasKa6FqpGMyqDugqpGfmoHcFft6vmUk3Js9gtBFMIIG+SKUlN4rSXlTi7/EVZyWR0DWXkwIzTPstJnr92hoLuSqp30EBNRUpVewJudwpTClrHkQ7mqQ5028NAXG+SISBzqVlzKvs5MQhrrhOlgbJ8y2wqBoHmXegWHW7+0iqXYKtL6RnyJIyruIWumq1gi6xFvUl1ltmTTElpGCCe6ASZnqE+FRFKhfwKsLNkdGHCppKcSGXQ56yCwRWUh8e4fN6UfQ4dHIuaqGvyUTMEJPqLVNZom4OydZkuGi247lynDaLA2TNgouCV+4xCrsZdU+OrS7IW1FJXyyilQxfXfU8uDwYlFuEb4/HCdCW5bXF8zcV+X+8qr66zYtcNVmPHhOzo9UBWjw90DjmKJ9md1pw8RVfCWUdKL4LeDXTvlMigLKRLPrVSsB+pleD0g+gQ2juXuJcxz5fSTyX3c1B5RY0/hYNgTgdkS9m4Yyq8bhfMuAQISewgP/wToFZF13f7PEpzQlFIO8klIMM36YOXMWqSuYRCIA95BDjJhOTDMdiiSsGpRuJx0pGYNGadWncHoyl1umv8wjLwT36oyhdwLXbbUrVnOfivWvD4QkWVQhXkbCEM7/X1Tr87EPSB56iGAutyk83mMscG8B5oE6TFZsH4WuOrdKcYGFNIx0a4JEd3e+1SdIZz3MFQDRY1eTLgcylzY8lrD9wpBhfQ6jjWXZPr8uX5Q4KtIgUTYGslTrC7JeCxYC6QwpT9y7pa3povj/SSR2iMITjq1/4v/cPAH0WtAAA='
bin = gzip.decompress(base64.b64decode(gz))
p = os.path.dirname(__file__)
pymain = os.path.join(p, "a.out")
with open(pymain, "wb") as f:
f.write(bin)
os.chmod(pymain, stat.S_IRUSR | stat.S_IWUSR | stat.S_IXUSR)
if p == "":
pymain = "./" + pymain
subprocess.call(pymain)
# compiled by pythran
'''
#pythran export main2()
import numpy as np
i8 = np.int64
i4 = np.int32
def floyd_warshall(graph):
n = graph.shape[0]
for k in range(n):
for i in range(n):
for j in range(n):
if graph[i, j] > graph[i, k] + graph[k, j]:
graph[i, j] = graph[i, k] + graph[k, j]
def clac(graph, L, inf):
for i in range(graph.shape[0]):
for j in range(graph.shape[1]):
graph[i, j] = inf if graph[i, j] > L else 1
def main2():
inf = 10**10
stdin = open('/dev/stdin')
N, M, L = map(int, stdin.readline().split())
graph = np.empty((N, N), i8)
for i in range(N):
for j in range(N):
graph[i, j] = inf
for _ in range(M):
a, b, c = map(int, stdin.readline().split())
graph[a - 1, b - 1] = c
graph[b - 1, a - 1] = c
Q = int(stdin.readline())
s = np.empty(Q, i8)
t = np.empty(Q, i8)
for i in range(Q):
s[i], t[i] = map(int, stdin.readline().split())
floyd_warshall(graph)
clac(graph, L, inf)
floyd_warshall(graph)
graph[graph > L] = 0
x = []
for i in range(Q):
x.append(str(graph[s[i] - 1, t[i] - 1] - 1))
print('\n'.join(x))
'''
| from networkx import *
N,M = map(int,input().split())
if M==0:
print(1)
exit()
else:
A = [list(map(int,input().split())) for m in range(M)]
G = Graph()
G.add_edges_from(A)
print(len(max(connected_components(G),key=len))) | 0 | null | 88,472,467,521,240 | 295 | 84 |
l = [1,2,3]
A = int(input())
B = int(input())
for i in range(3):
if l[i]!=A and l[i]!=B:
print(l[i]) | from collections import Counter,defaultdict,deque
from heapq import heappop,heappush
from bisect import bisect_left,bisect_right
import sys,math,itertools,fractions
sys.setrecursionlimit(10**8)
mod = 10**9+7
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
n = inp()
s,t = input().split()
print(''.join([s[i] + t[i] for i in range(n)])) | 0 | null | 111,187,044,312,160 | 254 | 255 |
"""
AtCoder :: Beginner Contest 175 :: C - Walking Takahashi
https://atcoder.jp/contests/abc175/tasks/abc175_c
"""
import sys
def solve(X, K, D):
"""Solve puzzle."""
# print('solve X', X, 'K', K, 'D', D)
if D == 0:
return X
X = abs(X)
soln = abs(X - (K * D))
steps_to_zero = abs(X) // D
# print('steps to zero', steps_to_zero, K - steps_to_zero)
# print('to zero', abs(X - (steps_to_zero * D)))
# Undershoot or get directly on to zero.
if steps_to_zero <= K and ((K - steps_to_zero) % 2 == 0):
soln = min(soln, abs(X - (steps_to_zero * D)))
# Overshoot by one step
steps_past_zero = steps_to_zero + 1
# print('steps past zero', steps_past_zero, K - steps_past_zero)
# print('past zero', abs(X - (steps_past_zero * D)))
if steps_past_zero <= K and ((K - steps_past_zero) % 2 == 0):
soln = min(soln, abs(X - (steps_past_zero * D)))
# Overshoot and return by one
steps_back_zero = steps_past_zero + 1
# print('steps back zero', steps_back_zero, K - steps_back_zero)
# print('back zero', abs(X - (steps_back_zero * D)))
if steps_back_zero <= K and ((K - steps_back_zero) % 2 == 0):
soln = min(soln, abs(X - (steps_back_zero * D)))
return soln
def main():
"""Main program."""
X, K, D = (int(i) for i in sys.stdin.readline().split())
print(solve(X, K, D))
if __name__ == '__main__':
main()
| X, K, D = map(int, input().split())
ans = abs(abs(X) - D*K)
a = abs(X)//D
b = abs(X)%D
if (K - a)%2 == 1 and a < K:
ans = D - b
elif (K - a)%2 == 0 and a < K:
ans = b
print(ans) | 1 | 5,182,891,540,482 | null | 92 | 92 |
a,b,m = map(int,input().split())
al = list(map(int,input().split()))
bl = list(map(int,input().split()))
disc = [[]]*m
for i in range(m):
disc[i] = list(map(int,input().split()))
mina = 100000
minb = 100000
for i in range(a):
mina = min(mina,al[i])
for i in range(b):
minb = min(minb,bl[i])
total = mina+minb
for i in range(m):
total = min(total,al[disc[i][0]-1]+bl[disc[i][1]-1]-disc[i][2])
print(total) | A,B,C=map(int,input().split())
K=int(input())
i=0
while i<K:
if A>=B:
i+=1
B*=2
else:
break
while i<K:
if B>=C:
i+=1
C*=2
else:
break
print('YNeos'[(A>=B)or(B>=C)::2]) | 0 | null | 30,461,788,994,518 | 200 | 101 |
#!/usr/bin/env python
from __future__ import division, print_function
from sys import stdin
from collections import deque
n = int(stdin.readline())
dll = deque()
fcode = ord('F')
lcode = ord('L')
while n:
n -= 1
cmd = stdin.readline().rstrip()
if cmd.startswith('i'):
dll.appendleft(int(cmd[7:]))
elif cmd.startswith('d'):
c = ord(cmd[6])
if c == fcode:
dll.popleft()
elif c == lcode:
dll.pop()
else:
try:
dll.remove(int(cmd[7:]))
except ValueError:
pass
print(*dll) | n,k = map(int,input().split())
l = list(map(int,input().split()))
# xは求める長さ
def C(x):
num = 0
for i in range(n):
# (a[i]-1)//x 回切る必要がある
num += (l[i]-1)//x
# k回以内に収まるか
return num <= k
lb,ub = 0,max(l)
while ub-lb > 1:
mid = (lb + ub) // 2
# 条件を満たすならxを小さくしていく
if C(mid):
ub = mid
else:
lb = mid
# print(lb,ub)
print(ub) | 0 | null | 3,293,745,553,728 | 20 | 99 |
A = list(map(int, input().split()))
print("bust" if sum(A)>=22 else "win")
| def koch(d,p0,p1):
#終了条件
if d == n:
return
#内分点：s,t
s=[(2*p0[0]+p1[0])/3,(2*p0[1]+p1[1])/3]
t=[(2*p1[0]+p0[0])/3,(2*p1[1]+p0[1])/3]
#正三角形の頂点:u
u=[(p0[0]+p1[0])/2-(p1[1]-p0[1])*(3**(1/2)/6),(p1[1]+p0[1])/2+(p1[0]-p0[0])*(3**(1/2)/6)]
koch(d+1,p0,s)
print(*s)
# point.append(s)
koch(d+1,s,u)
print(*u)
# point.append(u)
koch(d+1,u,t)
print(*t)
# point.append(t)
koch(d+1,t,p1)
p0=[0,0]
p1=[100,0]
n=int(input())
print(*p0)
koch(0,p0,p1)
print(*p1)
| 0 | null | 59,175,288,781,658 | 260 | 27 |
import numpy as np
a1 = [int(x.strip()) for x in input().split()]
a2 = [int(x.strip()) for x in input().split()]
a3 = [int(x.strip()) for x in input().split()]
a = np.array([a1,a2,a3])
n = int(input())
bingo = 0
for i in range(n):
b = int(input())
if b in a:
ch = np.argwhere(a==b)
a[ch[0][0]][ch[0][1]] = 0 #該当する文字をゼロでパンチング
sum_col = np.sum(a, axis=0)
sum_row = np.sum(a, axis=1)
bingo = np.count_nonzero(sum_col==0) + np.count_nonzero(sum_row==0)
if a[0,0]==0 and a[1,1]==0 and a[2,2]==0:
bingo += 1
if a[2,0]==0 and a[1,1]==0 and a[0,2]==0:
bingo += 1
if bingo > 0:
ans = 'Yes'
else:
ans = 'No'
print(ans) | a = [list(map(int,input().split())) for i in range(3)]
n = int(input())
b = [int(input()) for i in range(n)]
for i in range(3):
for j in range(3):
if a[i][j] in b:
a[i][j] = "o"
for i in range(3):
if a[i][0] == a[i][1] == a[i][2]:
print("Yes")
exit()
elif a[0][i] == a[1][i] == a[2][i]:
print("Yes")
exit()
elif a[0][0] == a[1][1] == a[2][2]:
print("Yes")
exit()
elif a[0][2] == a[1][1] == a[2][0]:
print("Yes")
exit()
elif i == 2:
print("No") | 1 | 59,888,957,215,362 | null | 207 | 207 |
import math
n = int(input())
x = list(map(int, input().split()))
y = list(map(int, input().split()))
d_1 = 0
d_2 = 0
d_3 = 0
d_4 = []
for i in range(n):
d_1 += abs(x[i] - y[i])
d_2 += abs(x[i] - y[i]) ** 2
d_3 += abs(x[i] - y[i]) ** 3
d_4.append(abs(x[i] - y[i]))
print("{0:8f}".format(d_1))
print("{0:8f}".format(math.sqrt(d_2)))
print("{0:8f}".format(d_3 ** (1/3)))
print("{0:8f}".format(max(d_4))) | from math import sqrt
n = int(input())
x = list(map(int, input().split()))
y = list(map(int, input().split()))
p_1 = 0
p_2 = 0
p_3 = 0
p_inf = 0
for i, j in zip(x, y):
p_1 += abs(i - j)
p_2 += (i - j) ** 2
p_3 += abs((i - j)) ** 3
p_inf = max(p_inf, abs(i - j))
print(p_1)
print(sqrt(p_2))
print(p_3 ** (1 / 3))
print(p_inf)
| 1 | 213,457,747,428 | null | 32 | 32 |
N = int(input())
a = [int(i) for i in input().split()]
count = 0
for i in range(N):
minj = i
for j in range(i,N):
if a[j] < a[minj]:
minj = j
if i != minj:
count += 1
a[i], a[minj] = a[minj], a[i]
print(" ".join(map(str, a)))
print(count) | def main():
n,k = map(int,input().split())
A = list(map(int,input().split()))
MOD = 10**9+7
B = []
flg_m = 0
flg_p = 0
for a in A:
if a < 0:
B.append([abs(a),-1])
flg_m = 1
else:
B.append([abs(a),1])
flg_p = 1
b = 0
ans = -10**9
if k == 1:
for a in A:
ans = max(ans,a)
print(ans)
exit()
B.sort(reverse=True)
# print(B)
if flg_p == 0 and k%2 == 1:
B.sort()
L = B[:k]
ans = cal_ans(L)
ans *=-1
print(ans%MOD)
exit()
elif flg_p * flg_m == 0:
L = B[:k]
ans = cal_ans(L)
print(ans)
exit()
flg_p = 0
flg_m = 0
flg_lm = 0
flg_lp = 0
# print(B)
for i,(n,sign) in enumerate(B):
if i < k:
if sign == -1:
flg_lp = 1
last_m = n
else:
flg_lm = 1
last_p = n
else:
if sign == -1:
if flg_m == 0:
first_m = n
flg_m = 1
else:
if flg_p == 0:
first_p = n
flg_p = 1
L = B[:k]
ans = cal_ans(L)
c = 0
for n,sign in L:
if sign == -1:
c += 1
if c % 2 == 0:
print(ans)
exit()
if flg_p == 1 and flg_m == 1 and flg_lp == 1 and flg_lm == 1:
if first_p * last_p >= first_m*last_m:
a = first_p
b = last_m
else:
a = first_m
b = last_p
elif flg_p == 1:
a = first_p
b = last_m
elif flg_m == 1:
a = first_m
b = last_p
else:
ans = 1
for a in A:
ans *= a
ans %= MOD
print(ans)
exit()
ans *= a
ans %= MOD
ans *= pow(b,MOD-2,MOD)
ans %= MOD
print(ans)
def cal_ans(L):
MOD = 10**9+7
ans = 1
for i,j in L:
ans *= i
ans %= MOD
return ans
main() | 0 | null | 4,681,656,429,622 | 15 | 112 |
#16D8101023J 久保田凌弥 kubotarouxxx python3
x,y=map(int, input().split())
if x>y:
while 1:
if (x%y)==0:
print(y)
break
a=x%y
x=y
y=a
else:
while 1:
if (y%x)==0:
print(x)
break
a=y%x
y=x
x=a
| a, b = map(int, input().split())
def gcd(a, b):
big = max(a, b)
small = min(a, b)
while not big % small == 0:
big, small = small, big%small
return small
print(gcd(a, b))
| 1 | 7,533,853,160 | null | 11 | 11 |
h, a = map(int, input().split())
print( - ( - h // a))
| H,A = map(int,input().split())
cnt = 0
while(True) :
H = H - A
cnt += 1
if H <= 0 :
break
print(cnt) | 1 | 76,818,861,737,240 | null | 225 | 225 |
N = int(input())
S,T = input().split()
for i in range(N):
print(S[i],end = "")
print(T[i],end = "")
| N = int(input())
S, T = input().split()
ans = ''
for s, t in zip(S, T):
ans += s
ans += t
print(ans)
| 1 | 111,766,658,960,448 | null | 255 | 255 |
import math
def main():
n,m = map(int,input().split())
a = list(map(int,input().strip().split()))
if n >= sum(a):
print(n-sum(a))
return
else:
print(-1)
return
main()
| N = int(input())
ab = [list(map(int, input().split())) for i in range(N)]
al = []
bl = []
for a,b in ab:
al.append(a)
bl.append(b)
al.sort()
bl.sort()
if N%2 == 0:
ans = (bl[N//2] + bl[N//2 -1]) - (al[N//2] + al[N//2 -1]) +1
else:
ans = bl[N//2] - al[N//2] +1
print(ans) | 0 | null | 24,685,741,075,958 | 168 | 137 |
import math
a, b, c = map(float, input().split(' '))
c = c / 180 * math.pi
s = a * b * math.sin(c) / 2
l = a + b + pow((pow(a, 2) + pow(b, 2) - 2 * a * b * math.cos(c)), 0.5)
h = b * math.sin(c)
print('{0:.8f}'.format(s) + '\n' + '{0:.8f}'.format(l) + '\n' + '{0:.8f}'.format(h))
| import math
a, b, C = map(int, input().split())
C = math.radians(C)
S = a * b * math.sin(C) * 0.5
c = math.sqrt(a * a + b * b - 2 * a * b * math.cos(C))
L = a + b + c
h = 2 * S / a
print(S, L, h)
| 1 | 176,052,988,830 | null | 30 | 30 |
x=input()
y=x.split(" ")
n=int(y[0])
g=input()
h=g.split(" ")
su=0
for b in h:
su+=int(b)
if(su>n):
print(-1)
else:
print(n-su)
| N, M = map(int, input().split())
A = list(map(int, input().split()))
w = sum(A)
ans = N - w
if ans >= 0:
print(ans)
else:
print(-1) | 1 | 31,753,316,756,098 | null | 168 | 168 |
n = int(input())
def prime_factorize(n):
a = []
while n % 2 == 0:
a.append(2)
n //= 2
f = 3
while f * f <= n:
if n % f == 0:
a.append(f)
n //= f
else:
f += 2
if n != 1:
a.append(n)
return a
import collections
c = collections.Counter(prime_factorize(n))
ans = 0
for _,value in c.items():
i = 0
while value>i:
i += 1
value -= i
ans += i
print(ans) | def knapsack_weight(single=True):
"""
重さが小さい時のナップサックDP
:param single: True = 重複なし
"""
""" dp[weight <= W] = 重さ上限を固定した時の最大価値 """
dp_min = 0 # 総和価値の最小値
dp = [dp_min] * (W + 1)
for item in range(N):
if single:
S = range(W, weight_list[item] - 1, -1)
else:
S = range(weight_list[item], W + 1)
for weight in S:
if weight - weight_list[item] < T:
dp[weight] = max2(dp[weight], dp[weight - weight_list[item]] + price_list[item])
return max(dp[T:])
import sys
input = sys.stdin.readline
def max2(x, y):
return x if x > y else y
def min2(x, y):
return x if x < y else y
N, T = map(int, input().split()) # N: 品物の種類 W: 重量制限
price_list = []
weight_list = []
data = []
for _ in range(N):
weight, price = map(int, input().split())
data.append((weight, price))
data.sort()
for weight, price in data:
price_list.append(price)
weight_list.append(weight)
max_weight = max(weight_list)
W = T + max_weight - 1
print(knapsack_weight(single=True)) | 0 | null | 84,081,984,597,600 | 136 | 282 |
#!/usr/bin/env python
# -*- coding: utf-8 -*-
def main():
values = []
total = 0
open_chars = 0
close_chars = 0
for _ in range(int(input())):
s = input().strip()
open_required = len(s)
close_required = len(s)
open_close = 0
for i, c in enumerate(s):
if c == '(':
open_required = min(i, open_required)
open_close += 1
else:
close_required = min(len(s) - i - 1, close_required)
open_close -= 1
if open_required == 0 and close_required == 0 and open_close == 0:
continue
elif open_close == len(s):
open_chars += len(s)
continue
elif -open_close == len(s):
close_chars += len(s)
continue
total += open_close
values.append([open_required, close_required, open_close, 0])
if total + open_chars - close_chars != 0:
print('No')
return
fvals = values.copy()
bvals = values
fvals.sort(key=lambda x: (x[0], -x[2]))
bvals.sort(key=lambda x: (x[1], x[2]))
findex = 0
bindex = 0
while True:
while findex < len(fvals) and fvals[findex][3] != 0:
findex += 1
while bindex < len(bvals) and bvals[bindex][3] != 0:
bindex += 1
if findex >= len(fvals) and bindex >= len(bvals):
break
fvals[findex][3] = 1
bvals[bindex][3] = -1
values = [v for v in fvals if v[3] == 1] + [v for v in bvals if v[3] == -1][::-1]
open_close_f = 0
open_close_b = 0
for (oreq_f, _, ocval_f, _), (_, creq_b, ocval_b, _) in zip(values, values[::-1]):
if oreq_f > open_close_f + open_chars:
print('No')
return
if creq_b > open_close_b + close_chars:
print('No')
return
open_close_f += ocval_f
open_close_b -= ocval_b
print('Yes')
if __name__ == '__main__':
main()
| import sys
readline = sys.stdin.readline
N,X,M = map(int,readline().split())
nex = [(i ** 2) % M for i in range(M)]
cum = [i for i in range(M)]
ans = 0
while N:
if N & 1:
ans += cum[X]
X = nex[X]
cum = [cum[i] + cum[nex[i]] for i in range(M)]
nex = [nex[nex[i]] for i in range(M)]
N >>= 1
print(ans) | 0 | null | 13,322,179,706,852 | 152 | 75 |
S = str(input())
N = len(S)
sList = [str(s) for s in S]
isPalindrome = 1
str1 = ''
str2 = ''
str3 = ''
str4 = ''
for i in range(N):
if (sList[i] != sList[N - 1 - i]):
isPalindrome = 0
if isPalindrome == 1:
for i in range(int((N - 1) / 2)):
str1 += sList[i]
str2 += sList[int((N - 1) / 2 - 1 - i)]
str3 += sList[int((N + 3) / 2 - 1 + i)]
str4 += sList[N - 1 - i]
if str1 != str2:
isPalindrome = 0
if str3 != str4:
isPalindrome = 0
if isPalindrome == 0:
print('No')
else:
print('Yes') | def resolve():
X = int(input())
dp = [0 for _ in range(X + 110)]
dp[0] = 1
for i in range(X + 1):
if dp[i] == 0:
continue
dp[i + 100] = 1
dp[i + 101] = 1
dp[i + 102] = 1
dp[i + 103] = 1
dp[i + 104] = 1
dp[i + 105] = 1
print(dp[X])
resolve()
| 0 | null | 86,952,243,304,962 | 190 | 266 |
n,a,b=map(int,input().split())
t=a+b
if n%t<=a:
diff=n%t
else:
diff=a
print(a*(n//t)+diff) | import math
def main():
v = list(map(int, input().split()))
n = v[0]
a = v[1]
b = v[2]
answer = 0
if n < a:
answer = n
elif n < a+b:
answer = a
elif a == 0 and b == 0:
answer = 0
else:
answer += math.floor(n / (a+b)) * a
rest = n % (a+b)
if rest <= a:
answer += rest
else:
answer += a
print(answer)
if __name__ == "__main__":
main()
| 1 | 55,661,456,419,410 | null | 202 | 202 |
n=int(input())
x=input()
val=int(x,2)
cnt=x.count("1")
p_cnt=cnt+1
m_cnt=cnt-1
p_amari,m_amari=0,0
p_amari=val%(cnt+1)
if cnt-1!=0:
m_amari=val%(cnt-1)
else:
m_amari=0
for i in range(n):
ans=0
if x[i]=="0":
amari=p_amari+pow(2,n-i-1,p_cnt)
amari%=p_cnt
elif x[i]=="1":
if cnt-1==0:
print(0)
continue
amari=m_amari-pow(2,n-i-1,m_cnt)
amari%=m_cnt
ans+=1
while amari!=0:
amari%=bin(amari).count("1")
ans+=1
print(ans)
| a = int(input())
b = int(input())
num = [a, b]
for i in range(1, 4):
if i not in num:
print(i)
break | 0 | null | 59,664,652,902,362 | 107 | 254 |
import math
def solve():
N = int(input())
ans = 0
for i in range(2, int(math.sqrt(N)) + 2):
n = 1
cnt = 0
while N % i == 0:
N //= i
cnt += 1
if cnt == n:
cnt = 0
n += 1
ans += 1
if N != 1:
ans += 1
return ans
print(solve())
| n,m = map(int,input().split())
c = [int(i) for i in input().split()]
dp = [[float("INF")]*(n+1) for _ in range(m+1)]
dp[0][0] = 0
for i in range(m):
for yen in range(n+1):
if yen - c[i] < 0: dp[i+1][yen] = dp[i][yen]
else: dp[i+1][yen] = min(dp[i][yen],dp[i+1][yen-c[i]]+1)
print(dp[m][n])
| 0 | null | 8,558,812,016,334 | 136 | 28 |
n=int(input())
if n==0:
print(n+1)
if n==1:
print(n-1) | #!/usr/bin python3
# -*- coding: utf-8 -*-
n = int(input())
print(int(not n))
| 1 | 2,901,539,015,790 | null | 76 | 76 |
from operator import itemgetter
N = int(input())
def checkNonnegative(brankets):
curup = 0
for (minup , up) in sorted(brankets , key= itemgetter(0) , reverse = True):
if curup + minup < 0:
return False
curup += up
return True
def canArrangeBranket(brankets):
totup = 0
left_brankets = []
right_brankets = []
for branket in brankets:
up = 0
minup = 0
for c in list(branket):
if c == '(':
up += 1
else:
up -= 1
minup = min(minup , up)
totup += up
if up >= 0:
left_brankets.append((minup , up))
else:
right_brankets.append((minup - up , - up))
if totup != 0:
return False
return checkNonnegative(left_brankets) and checkNonnegative(right_brankets)
branketList = []
for i in range(N):
l = input()
branketList.append(l)
if canArrangeBranket(branketList):
print("Yes")
else:
print("No")
|
def binary_search(border, b):
ok = b
ng = n
while (abs(ok - ng) > 1):
mid = (ok + ng) // 2
if L[mid] < border:
ok = mid
else:
ng = mid
return ok
n = int(input())
L = sorted(list(map(int, input().split())))
ans = 0
for a in range(0,n-1):
for b in range(a+1, n):
a_b = L[a] + L[b]
ans += binary_search(a_b, b) - b
print(ans) | 0 | null | 97,467,388,426,656 | 152 | 294 |
n = int(input())
st = []
for _ in range(n):
si, ti = input().split()
st.append((si, int(ti)))
name = input()
count = 0
flag = False
for i in range(n):
if flag:
count += st[i][1]
if st[i][0] == name:
flag = True
print(count) | n = int(input())
s = [input().split() for i in range(n)]
b = sum([int(s[i][1]) for i in range(n)])
x = input()
c = 0
for i in range(n):
c+=int(s[i][1])
if s[i][0] == x:
break
print(b-c) | 1 | 96,496,860,025,890 | null | 243 | 243 |
N=int(input())
print(int((N+2-1)/2))
| a,b=sorted(list(map(int, input().split())))
m=b%a
while m>=1:
b=a
a=m
m=b%a
print(a) | 0 | null | 29,359,086,940,360 | 206 | 11 |
N = int(input())
chars = "Xabcdefghijklmnopqrstuvwxyz"
result = ""
n_1 = N
while True:
x = n_1 % 26
if x == 0:
x = 26
result += chars[x]
n_1 -= x
if n_1 == 0:
break
n_1 //= 26
print(result[::-1])
| str = input()
n = int(len(str) / 2)
cnt = 0
for i in range(n):
if str[i] != str[-1-i]:
cnt += 1
print(cnt) | 0 | null | 66,253,513,200,522 | 121 | 261 |
n = int(input())
x = 100000
for i in range(n):
x = x * 1.05
if x % 1000 != 0:
x=x+1000-(x%1000)
print(int(x))
| n,m,l = [int(x) for x in input().split()]
A = [[int(x) for x in input().split()] for _ in range(n)]
B = [[int(x) for x in input().split()] for _ in range(m)]
ans = []
for i in range(n):
blocks = []
for j in range(l):
block = 0
for k in range(m):
block += A[i][k]*B[k][j]
blocks.append(block)
ans.append(blocks)
for _ in ans:
print(*_)
| 0 | null | 703,425,205,702 | 6 | 60 |
#import sys
#import numpy as np
import math
#from fractions import Fraction
import itertools
from collections import deque
from collections import Counter
import heapq
#from fractions import gcd
#input=sys.stdin.readline
import bisect
s=input()
t=input()
n=len(s)
ans=0
for i in range(n):
if s[i]!=t[i]:
ans+=1
print(ans) | def main():
s = input()
t = input()
ans = 0
for i, char in enumerate(s):
if char != t[i]:
ans += 1
print(ans)
if __name__ == '__main__':
main()
| 1 | 10,479,377,014,368 | null | 116 | 116 |
total = 0
for ch in input().strip():
total = (total + int(ch)) % 9
print('No' if total else 'Yes') | import numpy as np
data = np.array([int(x) for x in str(input())])
if data.sum() % 9 == 0:
print("Yes")
else:
print("No")
| 1 | 4,428,149,715,498 | null | 87 | 87 |
n = int(input())
ans, tmp = 0, 5
if n % 2 == 0:
n //= 2
while tmp <= n:
ans += n // tmp
tmp *= 5
print(ans)
| n=int(input())
ans=0
d=5
for i in range(36):
ans+=n//d//2
d*=5
print(0 if n%2 else ans) | 1 | 116,187,241,136,332 | null | 258 | 258 |
N=int(input())
S=input()
kouho=[]
for n in range(1000):
st=str(n)
if len(st)<=2:
st='0'*(3-len(st))+st
kouho.append(st)
ans=0
for k in kouho:
number=0
for s in S:
if k[number]==s:
number+=1
if number==3:
break
if number == 3:
ans += 1
print(ans)
| n = int(input())
s = input()
cnt = 0
for i in range(10):
a = s.find(str(i))
if a == -1:
continue
for j in range(10):
b = s.find(str(j), a + 1)
if b == -1:
continue
for k in range(10):
c = s.find(str(k), b + 1)
if c != -1:
cnt += 1
print(cnt) | 1 | 128,288,343,189,280 | null | 267 | 267 |
a, b = map(int, input().split())
x = str(a) * b
y = str(b) * a
x, y = sorted([x, y])
print(x)
| n = int(input())
a = list(map(str, input().split()))
a.reverse()
for i in range(n):
if i == n - 1:
print(a[i], end='')
else:
print(a[i] + ' ', end='')
print('') | 0 | null | 42,681,030,771,742 | 232 | 53 |
import cmath
def f():
global d
p=[]
for i in range(len(d)-1):
a,b=d[i],d[i+1]
r=(b-a)/3
p+=[a,a+r,a+r+r*cmath.rect(1,cmath.pi/3),b-r]
d=p+[d[-1]]
d=[0j,100+0j]
for _ in[0]*int(input()):f()
for e in d:print(e.real,e.imag)
| def koch(n, p1, p2):
if n == 0:
return
s_x = p1[0] * 2/3 + p2[0] * 1/3
s_y = p1[1] * 2/3 + p2[1] * 1/3
t_x = p1[0] * 1/3 + p2[0] * 2/3
t_y = p1[1] * 1/3 + p2[1] * 2/3
u_x = (t_x - s_x) * 1/2 - (t_y - s_y) * 3 ** 0.5 / 2 + s_x
u_y = (t_x - s_x) * 3 ** 0.5 / 2 + (t_y - s_y) / 2 + s_y
s, t, u = (s_x, s_y), (t_x, t_y), (u_x, u_y)
koch(n - 1, p1, s)
print(' '.join(str(i) for i in s))
koch(n - 1, s, u)
print(' '.join(str(i) for i in u))
koch(n - 1, u, t)
print(' '.join(str(i) for i in t))
koch(n - 1, t, p2)
S, G = (0, 0), (100, 0)
print(' '.join(str(i) for i in S))
koch(int(input()), S, G)
print(' '.join(str(i) for i in G))
| 1 | 129,473,262,820 | null | 27 | 27 |
from itertools import combinations
n = int(input())
xy = [list(map(int, input().split())) for _ in range(n)]
ans = 0
for i, j in combinations(xy, 2):
ans += ((i[0] - j[0]) ** 2 + (i[1] - j[1]) ** 2) ** 0.5
print(ans * 2 / n) | S = input()
a = ['x']*len(S)
print(''.join(a)) | 0 | null | 110,546,218,261,820 | 280 | 221 |
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() | #変b数のまとめの入力についてsplitとインデックスで価を特定させる
youbi = "SUN,MON,TUE,WED,THU,FRI,SAT".split(",")
a = input()
print(7 - youbi.index(a)) | 0 | null | 66,390,764,403,140 | 22 | 270 |
while True:
try:
a = map(int,raw_input().split(' '))
s = a[0] + a[1]
c = 0
while s > 0:
s = s / 10
c = c + 1
if s <= 0:
print c
break
except (EOFError):
break | 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 | 120,547,720 | null | 3 | 3 |
import math
if __name__ == "__main__":
deg = int(input())
print(360//math.gcd(deg, 360)) | from math import gcd
s = int(input())
print(360//gcd(360,s)) | 1 | 13,249,103,853,244 | null | 125 | 125 |
#!python3
import sys
iim = lambda: map(int, sys.stdin.readline().rstrip().split())
def _cmb(N, mod):
N1 = N + 1
fact = [1] * N1
inv = [1] * N1
for i in range(2, N1):
fact[i] = fact[i-1] * i % mod
inv[N] = pow(fact[N], mod-2, mod)
for i in range(N-1, 1, -1):
inv[i] = inv[i+1]*(i+1) % mod
def cmb(a, b):
return fact[a] * inv[b] * inv[a-b] % mod
return cmb
def resolve():
K = int(input())
s = input()
ls = len(s) - 1
mod = 10**9+7
cmb = _cmb(ls+K, mod)
ans = 0
p25 = 1
p26 = pow(26, K, mod)
p26inv = pow(26, mod-2, mod)
for i in range(K+1):
ans += cmb(ls+i, ls) * p25 * p26
ans %= mod
p25 = p25 * 25 % mod
p26 = p26 * p26inv % mod
print(ans)
if __name__ == "__main__":
resolve()
| import sys
input = sys.stdin.readline
K = int(input())
S = list(input())[: -1]
N = len(S)
mod = 10 ** 9 + 7
class Factorial:
def __init__(self, n, mod):
self.f = [1]
for i in range(1, n + 1):
self.f.append(self.f[-1] * i % mod)
self.i = [pow(self.f[-1], mod - 2, mod)]
for i in range(1, n + 1)[: : -1]:
self.i.append(self.i[-1] * i % mod)
self.i.reverse()
def factorial(self, i):
return self.f[i]
def ifactorial(self, i):
return self.i[i]
def combi(self, n, k):
return self.f[n] * self.i[n - k] % mod * self.i[k] % mod
f = Factorial(N + K + 1, mod)
res = 0
for l in range(K + 1):
r = K - l
res += f.combi(l + N - 1, l) * pow(25, l, mod) % mod * pow(26, r, mod) % mod
res %= mod
print(res) | 1 | 12,893,670,652,132 | null | 124 | 124 |
s=input()
t=input()
s+=t[-1]
if(s==t):print("Yes")
else: print("No") | a = [str(input()) for i in range(2)]
s = a[0]
t = a[1]
s_l = len(s)
S = s + t[s_l]
if S == t:
print('Yes')
else:
print('No') | 1 | 21,361,462,421,560 | null | 147 | 147 |
import sys
inf = 1<<30
def solve():
n, m = map(int, input().split())
c = [int(i) for i in input().split()]
c.sort()
dp = [inf] * (n + 1)
dp[0] = 0
for i in range(1, n + 1):
for cj in c:
if i - cj < 0:
break
dp[i] = min(dp[i], dp[i - cj] + 1)
ans = dp[n]
print(ans)
if __name__ == '__main__':
solve() | import sys
import fractions
readline = sys.stdin.buffer.readline
def main():
gcd = fractions.gcd
def lcm(a, b):
return a * b // gcd(a, b)
N, M = map(int, readline().split())
A = list(set(map(int, readline().split())))
B = A[::]
while not any(b % 2 for b in B):
B = [b // 2 for b in B]
if not all(b % 2 for b in B):
print(0)
return
semi_lcm = 1
for a in A:
semi_lcm = lcm(semi_lcm, a // 2)
if semi_lcm > M:
print(0)
return
print((M // semi_lcm + 1) // 2)
return
if __name__ == '__main__':
main()
| 0 | null | 50,917,662,064,470 | 28 | 247 |
n = int(input())
a = list(map(int, input().split()))
d = {}
for i in a:
if i in d: d[i] += 1
else: d[i] = 1
ans = 0
for i in d.values(): ans += i*(i-1)//2
for i in a:
print(ans - (d[i]-1)) | n = int(input())
a = [[0 for j in range(10)] for i in range(10)]
for i in range(1, n+1):
if i >= 10**5:
tmp1 = i//10**5
elif i >= 10**4:
tmp1 = i//10**4
elif i >= 10**3:
tmp1 = i//10**3
elif i >= 10**2:
tmp1 = i//10**2
elif i >= 10:
tmp1 = i//10
else :
tmp1 = i
tmp2 = i % 10
a[tmp1][tmp2] += 1
cnt = 0
for i in range(1, 10):
for j in range(1, 10):
cnt += a[i][j] * a[j][i]
print(cnt)
| 0 | null | 67,244,165,180,328 | 192 | 234 |
import math
X, K, D = map(int, input().split())
kyori = abs(X)
kaisu = math.ceil(kyori / D)
if(K < kaisu):
ans = kyori - (K * D)
#if(X < 0):
# print(-ans)
#else:
# print(ans)
else:
if((K - kaisu) % 2 == 0):
ans = kyori - (kaisu * D)
else:
ans = kyori - (kaisu * D) + D
#if(X < 0):
# print(-ans)
#else:
# print(ans)
print(abs(ans)) | x,k,d=[int(i) for i in input().split()]
x=abs(x)
if x-k*d>=0:
print(x-k*d)
else:
if (x//d)%2==k%2:
print(x%d)
else:
print(d-x%d) | 1 | 5,231,852,147,050 | null | 92 | 92 |
N = input()
print(chr(ord(N)+1)) | import bisect
from itertools import accumulate
def func(x):
cnt = 0
for i in a:
index = bisect.bisect_left(a, x - i)
cnt += N - index
if cnt >= M:
return True
else:
return False
N, M = map(int, input().split())
a = list(map(int, input().split()))
a.sort()
ar = sorted(a, reverse=True)
b = [0] + list(accumulate(ar))
MIN = 0
MAX = 2 * 10 ** 5 + 1
while MAX - MIN > 1:
MID = (MIN + MAX) // 2
if func(MID):
MIN = MID
else:
MAX = MID
ans = 0
cnt = 0
for i in ar:
index = bisect.bisect_left(a, MIN - i)
ans += i * (N - index) + b[N - index]
cnt += N - index
print(ans - (cnt - M) * MIN) | 0 | null | 100,306,036,626,092 | 239 | 252 |
N,K = map(int, input().split())
A = list(map(int, input().split()))
for cnt in range(K):
B = [0] * (N+1)
for i in range(N):
bright = A[i]
l = max(i-bright,0)
r = min(i+bright+1, N)
B[l] += 1
B[r] -= 1
for i in range(N):
B[i+1] += B[i]
A = B[:-1]
#print(A)
if min(A) == N:
#print(cnt)
break
print(" ".join(map(str,A)))
| import sys
import numpy as np
from numba import jit
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
N, K, *A = map(int, read().split())
@jit
def imos(A):
B = np.zeros_like(A)
for i,x in enumerate(A):
a = max(0,i-x)
b = min(N-1,i+x)
B[a] += 1
if b+1 <= N-1:
B[b+1] -= 1
B = np.cumsum(B)
return B
for i in range(K):
if i >= 50:
break
A = imos(A)
print(*A) | 1 | 15,481,466,369,620 | null | 132 | 132 |
from math import ceil
from collections import deque
n,d,a = map(int, input().split())
monster = [list(map(int,input().split())) for i in range(n)]
monster.sort()
damage = 0
finish = deque()
ans = 0
for i in range(n):
x,h = monster[i]
while finish:
if finish[0][0]<x:
damage -= finish.popleft()[1]
else:
break
if h<=damage:
continue
else:
b = ceil((h-damage)/a)
ans += b
damage += b*a
finish.append([x+2*d,b*a])
print(ans)
| #!/usr/bin/env python3
import sys
import math
from collections import deque
def solve(N: int, D: int, A: int, X: "List[int]", H: "List[int]"):
M = sorted([(X[i], H[i]) for i in range(N)])
DD = 2*D
result = 0
revert = deque()
currentDamage = 0
for m in M:
while len(revert) > 0 and revert[0][0] < m[0]:
currentDamage -= revert[0][1]
revert.popleft()
nextDamage = max(0, m[1] - currentDamage)
needAttack = math.ceil(nextDamage/A)
currentDamage += needAttack * A
result += needAttack
if needAttack > 0:
revert.append((m[0]+2*D, needAttack*A))
print(result)
return
# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools (tips: You use the default template now. You can remove this line by using your custom template)
def main():
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
tokens = iterate_tokens()
N = int(next(tokens)) # type: int
D = int(next(tokens)) # type: int
A = int(next(tokens)) # type: int
X = [int()] * (N) # type: "List[int]"
H = [int()] * (N) # type: "List[int]"
for i in range(N):
X[i] = int(next(tokens))
H[i] = int(next(tokens))
solve(N, D, A, X, H)
if __name__ == '__main__':
main()
| 1 | 82,174,513,398,320 | null | 230 | 230 |
import math
import collections
N,M=map(int,input().split())
A=list(map(int,input().split()))
A.sort()
cumax=(2*10**5)+10
cuml=[0]*cumax
#print(A)
ind=0
l=[]
c=collections.Counter(A)
values=list(c.values()) #aのCollectionのvalue値のリスト(n_1こ、n_2こ…)
key=list(c.keys()) #先のvalue値に相当する要素のリスト(要素1,要素2,…)
for i in range(len(key)):
l.append([key[i],values[i]])#lは[要素i,n_i]の情報を詰めたmatrix
lr=[]
v=[]
for i in range(len(key)):
lr.append([0,l[i][0]])
v.append(l[i][1])
for i in range(len(v)):
l=lr[i][0]
r=lr[i][1]
cuml[l]=cuml[l]+v[i]
if r+1<cumax:
cuml[r+1]=cuml[r+1]-v[i]
for i in range(cumax-1):
cuml[i+1]=cuml[i+1]+cuml[i]
#print(cuml)
maxind=2*10**5+10
minind=0
while maxind-minind>1:
piv=minind+(maxind-minind)//2 #pivは握手の幸福度
cnt=0
for i in range(N):
x=piv-A[i]
cnt=cnt+cuml[max(x,0)]
if cnt<=M:
maxind=piv
else:
minind=piv
#print(cnt,maxind,piv,minind)
#print(minind)
thr=minind
cuml2=[0]*(N+1)
A.sort(reverse=True)
for i in range(N):
cuml2[i+1]=cuml2[i]+A[i]
#print(cuml2,thr,A)
ans=0
counts=0
#print(cuml[0:10])
for i in range(N):
x=thr-A[i]
#print(x)
cnt=cuml[max(x,0)]
#print(cnt)
ans=ans+(A[i]*cnt)+cuml2[cnt]
counts=counts+cnt
ans=ans-(counts-M)*thr
#print()
print(ans) | n = int(input())
a, b = map(int, input().split())
ans = 0
for i in range(a, b + 1):
if i % n == 0:
ans += 1
break
print("OK" if ans == 1 else "NG") | 0 | null | 67,057,214,579,680 | 252 | 158 |
import math
a,b,x = map(int,input().split())
if x <= a*a*b/2:
print(math.atan((a*b*b/2/x))*180/math.pi)
else:
print(math.atan((a*a*b-x)/(a**3)*2)*180/math.pi) | #!/usr/bin/env python3
import sys
import math
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
def main():
N = int(readline())
print(math.ceil(N / 2) / N)
if __name__ == '__main__':
main()
| 0 | null | 169,929,975,885,852 | 289 | 297 |
s=list(input())
count=0
if 'R' in s:
count+=1
for i in range(len(s)-1):
if s[i]==s[i+1] and s[i]=='R':
count+=1
print(count)
| s = input()
count = 0
for i in range(len(s)):
if s[i] == "R":
count += 1
if i + 1 >= 3:
break
elif s[i+1] == "S":
break
print(count) | 1 | 4,865,740,419,932 | null | 90 | 90 |
n = int( input() )
a = list( map(int, input().split()) )
x = 0
for i in a:
x ^= i
print( * list( map( lambda y: x^y , a ) ) ) | N=int(input())
array=[int(x) for x in input().split()]
answer=0
for i in array:
answer=answer^i
tobeprinted=[answer^i for i in array]
print(*tobeprinted) | 1 | 12,590,537,143,438 | null | 123 | 123 |
# import itertools
# import math
# import sys
# sys.setrecursionlimit(500*500)
# import numpy as np
N = int(input())
S = input()
# n, *a = map(int, open(0))
# N, M = map(int, input().split())
# A = list(map(int, input().split()))
# B = list(map(int, input().split()))
# tree = [[] for _ in range(N + 1)]
# B_C = [list(map(int,input().split())) for _ in range(M)]
# S = input()
# B_C = sorted(B_C, reverse=True, key=lambda x:x[1])
# all_cases = list(itertools.permutations(P))
# a = list(itertools.combinations_with_replacement(range(1, M + 1), N))
# itertools.product((0,1), repeat=n)
# A = np.array(A)
# cum_A = np.cumsum(A)
# cum_A = np.insert(cum_A, 0, 0)
# def dfs(tree, s):
# for l in tree[s]:
# if depth[l[0]] == -1:
# depth[l[0]] = depth[s] + l[1]
# dfs(tree, l[0])
# dfs(tree, 1)
all = S.count("R") * S.count("G") * S.count("B")
cnt = 0
for i in range(N):
for j in range(i, N):
k = 2 * j - i
if k >= N:
continue
if S[i] != S[j] and S[i] != S[k] and S[j] != S[k]:
cnt += 1
print(all - cnt) | while 1:
tmp = map(int, raw_input().split())
if tmp[0] == tmp[1] == 0:
break
else:
print " ".join(map(str, sorted(tmp)))
| 0 | null | 18,246,290,117,738 | 175 | 43 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.