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
|
|---|---|---|---|---|---|---|
a, b, c, d = map(int,input().split())
x = (a+d-1)//d
y = (c+b-1)//b
if x >= y:
print('Yes')
else:
print('No') | a, b, c, d = map(int, input().split())
x = 0
y = 0
while c > 0:
c -= b
x += 1
while a > 0:
a -= d
y += 1
if x <= y:
print('Yes')
else:
print('No')
| 1 | 29,739,598,730,710 | null | 164 | 164 |
N,K,S = map(int,input().split())
A = [S]*K
if S == 10**9:
A.extend([1]*(N-K))
else:
A.extend([10**9]*(N-K))
print(*A, sep = " ") | import numpy
n = int(input())
l = []
ans = n
def is_prime(q):
q = abs(q)
if q == 2: return True
if q < 2 or q&1 == 0: return False
return pow(2, q-1, q) == 1
if is_prime(n) :
print(n-1)
if is_prime(n) == False:
for i in range(2,int(numpy.sqrt(n))+1):
if n%i == 0:
a = i
b = n//i
ans = min(n,a+b-2)
print(ans) | 0 | null | 125,754,025,182,446 | 238 | 288 |
all = [x for x in range(1,53)]
N = int(input())
i = 1
while i <= N:
M, num = input().split()
num = int(num)
if M == 'S':
all.remove(num)
elif M == 'H':
all.remove(num+13)
elif M == 'C':
all.remove(num+26)
elif M == 'D':
all.remove(num+39)
i += 1
sN = 52 - N
for j in range(sN):
if all[j] // 13 == 0 or (all[j] // 13 == 1 and all[j] % 13 == 0):
print("S {}".format(all[j]))
elif all[j] // 13 == 1 or (all[j] // 13 == 2 and all[j] % 13 == 0):
print("H {}".format(all[j]-13))
elif all[j] // 13 == 2 or (all[j] // 13 == 3 and all[j] % 13 == 0):
print("C {}".format(all[j]-26))
else:
print("D {}".format(all[j]-39)) | n=int(input())
lst=["1","2","3","4","5","6","7","8","9","10","11","12","13"]
#S_list=lst
#H_list=lst
#C_list=lst
#D_list=lst
S_list=["1","2","3","4","5","6","7","8","9","10","11","12","13"]
H_list=["1","2","3","4","5","6","7","8","9","10","11","12","13"]
C_list=["1","2","3","4","5","6","7","8","9","10","11","12","13"]
D_list=["1","2","3","4","5","6","7","8","9","10","11","12","13"]
for i in range(n):
Del=map(str,raw_input().split())
if Del[0]=="S":
S_list.remove(Del[1])
elif Del[0]=="H":
H_list.remove(Del[1])
elif Del[0]=="C":
C_list.remove(Del[1])
elif Del[0]=="D":
D_list.remove(Del[1])
S=map(int,S_list)
H=map(int,H_list)
C=map(int,C_list)
D=map(int,D_list)
#
for i in range(len(S)):
print "S "+str(S[i])
for i in range(len(H)):
print "H "+str(H[i])
for i in range(len(C)):
print "C "+str(C[i])
for i in range(len(D)):
print "D "+str(D[i]) | 1 | 1,025,742,063,542 | null | 54 | 54 |
import sys
import math
import itertools
import collections
sys.setrecursionlimit(1000000)
MOD = 10 ** 9 + 7
input = lambda: sys.stdin.readline().strip()
NI = lambda: int(input())
NMI = lambda: map(int, input().split())
NLI = lambda: list(NMI())
SI = lambda: input()
def main():
N = NI()
xy = [NLI() for _ in range(N)]
ls = [p for p in range(N)]
p_list = list(itertools.permutations(ls))
full_course = ["" for _ in range(len(p_list))]
for k in range(len(p_list)):
distance = 0
for l in range(N-1):
departure = p_list[k][l]
goal = p_list[k][l+1]
Xd = xy[departure][0]
Yd = xy[departure][1]
Xg = xy[goal][0]
Yg = xy[goal][1]
distance += ((Xd-Xg)**2 + (Yd-Yg)**2)**(1/2)
full_course[k] = distance
print(sum(full_course)/len(p_list))
if __name__ == '__main__':
main() | import itertools
import math
N = int(input())
x_list = [0] * N
y_list = [0] * N
for i in range(N):
x_list[i], y_list[i] = map(int, input().split())
l_sum = 0
l = 0
for comb in itertools.combinations(range(N), 2):
l = (
(x_list[comb[0]] - x_list[comb[1]]) ** 2
+ (y_list[comb[0]] - y_list[comb[1]]) ** 2
) ** 0.5
l_sum += l
ans = 2 * l_sum / N
print(ans) | 1 | 148,944,751,817,180 | null | 280 | 280 |
S = input()
Slist = list(S)
big = ord('A')
small = ord('a')
diff = big-small
for i in range(len(Slist)):
w = ord(Slist[i])
if small <= w:
#?°?????????????
Slist[i] = chr(w+diff)
elif big <= w:
Slist[i] = chr(w-diff)
print(''.join(Slist)) | def search(S, n, t):
i=0
S[n]=t
while (S[i] != t):
i+=1
return i!=n
sum=0
n=int(input())
S=list(map(int, input().split()))
S.append([0]*10000)
q=int(input())
T=list(map(int, input().split()))
for i in range(0,q):
if search(S,n,T[i]):
sum+=1
print(sum) | 0 | null | 803,658,831,160 | 61 | 22 |
n = int(input())
def dfs(n, s, idx):
l = len(s)
if n == l:
print(s)
return
alpha = "abcdefghijklmnopqrstuvwxyz"
i = 0
while i < idx + 1:
if i == idx:
dfs(n, s + alpha[i], idx + 1)
else:
dfs(n, s + alpha[i], idx)
i += 1
dfs(n, "", 0)
| input()
A = list([int(i) for i in input().split()])
print(min(A),max(A),sum(A)) | 0 | null | 26,499,998,152,288 | 198 | 48 |
from itertools import permutations
from math import factorial
n = int(input())
p = tuple(map(int, input().split(' ')))
q = tuple(map(int, input().split(' ')))
l = [i for i in range(1, n+1)]
ls = list(permutations(l))
for i in range(factorial(n)):
if p==ls[i]:
a = i
if q==ls[i]:
b = i
print(abs(a-b)) | n = input()
a = map(int,raw_input().split())
for i in xrange(len(a)):
v = a[i]
j = i - 1
while j >= 0 and a[j] > v :
a[j+1] = a[j]
j = j - 1
a[j+1] = v
print " ".join(map(str,a)) | 0 | null | 50,152,791,255,620 | 246 | 10 |
n, k = map(int, input().split())
l = list(map(int, input().split()))
start = k
c = 0
for i in range(n-k):
if l[start]>l[c]:
print("Yes")
else:
print("No")
start+=1
c+=1 | n, k = map(int, input().split())
A = list(map(int, input().split()))
now = 1000
for i in range(k, n):
#print(A[i], A[i-k])
if A[i] > A[i-k]:
print("Yes")
else:
print("No") | 1 | 7,160,382,032,980 | null | 102 | 102 |
import warnings
import sys
x = 0
while (x == 0):
args = map(int, raw_input().split())
h = args[0]
w = args[1]
if (h == 0 and w == 0):
break
for i in range(h):
for j in range(w):
sys.stdout.write("#")
print ""
print "" | N = int(input())
A = list(map(int,input().split()))
a = [0]*N
for i in range(N):
a[A[i]-1] = i + 1
print(*a) | 0 | null | 90,815,142,504,438 | 49 | 299 |
n, k = map(int, input().split())
h = list(map(int, input().split()))
h = sorted(h)
ans = 0
for i in range(max(0, n-k)):
ans += h[i]
print(str(ans))
| teki, hissatsu = list(map(int, input().split(' ')))
l = sorted(list(map(int, input().split(' '))))[:max(0, teki-hissatsu)]
print(sum(l)) | 1 | 79,070,336,937,462 | null | 227 | 227 |
a, b, k = map(int, input().split())
if a >= k:
a = a - k
else:
b = b + a - k
a = 0
if b < 0:
b = 0
print(str(a) + " " + str(b))
| # compiled by pythran
"""
#pythran export main2()
import numpy as np
i4 = np.int32
i8 = np.int64
def main(in_file):
stdin = open(in_file)
N, M, K = [int(x) for x in stdin.readline().split()]
a = np.array([int(x) for x in stdin.readline().split()])
b = np.array([int(x) for x in stdin.readline().split()])
sum_ = 0
i = 0
while i < N:
sum_ += a[i]
if sum_ > K:
sum_ -= a[i]
break
i += 1
sum_ = K - sum_
j = 0
ans = 0
while True:
while True:
if sum_ < 0:
ans = max(ans, i + j - 1)
break
else:
if j == M:
ans = max(ans, i + j)
break
sum_ -= b[j]
j += 1
if i == 0 or j == M:
break
i -= 1
sum_ += a[i]
print(ans)
def main2():
main('/dev/stdin')
"""
import os, sys
p = os.path.dirname(__file__)
pymain = os.path.join(p, "a.out")
if len(sys.argv) == 1:
import subprocess
if p == "":
pymain = "./" + pymain
subprocess.call(pymain)
else:
import gzip, base64, stat
gz = b'H4sIAHaqVF8C/+19C3wU1dX47GY32RDILvIwPIQVF0xEwm4ekOVlAlmZ1QUiCYivTpZkA6ubbExmISBqNIGyjWtppa3Vtp/1s61t7VdsqbXUR3gjaov4wicoCLMEBRURFdj/Offe2Z2d7EBI0f//9/99q+HOPXPuued1zz33zutul+dqvU7Hyb80bhqHtTVjaL2UwRc8E0cBWAmXCf+O5EZw6VA3KPDU5UldcmmK90PblehpXV0O55JLnaI0ctq/d5YklxxnjbdDXnOXUWjuMmtSeSydwi2m5HZ61s6ygp1fYU0uGb9yKTc3sL8qBleX5VxyaWBlxUdiLR6/tIjW1eUWXXIpt7sO2qVzPf9ZWDmX9aellz2MqFzKdhgf8C+cUDQ+UDsu4G8ItYxrKZkwbkJRfnMwv4DwZGG4M2fPi9tbr5B1IIPheWH+5bN+2VF4ULdl+Nr6lzrsxd+3/hXPTVPY7boSe2na49kEhr41A/7+8KMpm/76buHrTc+kT7ryU+F7t/1k/bhfDW98OpAzvnzgg31n9LUePvPSsMNnOi4+fEZLD0+AwS5KAd/DpYYvSk8NX2dMDb81LTV8pCE1fEAmx41KAd+vweeXGvBqfWr4V7rU8JAG3KZB/1YN+GYN+HINvbVnpIaf0aBzWAPeoMH/EA24MTM1/AsNO16lYcefacj1Fw0+L9Kwy0kN+G816EzR4P/P8Nc/BbyvBv5tGvK+otHvwxp8ztTQzxMa+CUa/j9Kg589Gvy8qNHvexr4X2nY6xuNfkdp6O0hjfiwXEOuAg0/vEaDn5HxGSj5F9GQ6+ca46hOg58rNOTakJbafywa/EzWgPfR0GeWBj/zNfQwT0PPO4HOpdxgrmS5VTFbw/zJ4NUMnsPgr+oovHRZMv66dJQX8JdZk+a3Z9Mpfguj08rg9RyFL16WDH+A0ZcYvEL2wwykP5SztrJ8gXVwKAPjfDZnvZ7Wixj+nWmp4TMZfjWDl8mKgHm4WaytGTsW594JnCAsqg82CM2it0kUBE5wV80San1NvkX+ZtHXVDVrRiDY4KvyLgz46LnUZ26cXSmW+IPNwkJvs6/I3eAXyx2uJQCvml8pOooB6q+BPpp83vqFoTp3DQAdNYu9TYLY5PWLze4alws5aWkRGn1NzcEGb8AvLhOW2AmF2Q67INS0tHgX+pc4CuC42S/UBLzNzYK4rNEn+Bvqgi7KwkSC53A4nLTHIHTpb1hEO07Va6UXu2a8zq4MOoVZQK/Z1yS6Ay7X3MpglUApM4IgYkrmi2sCPm+TC84UCG5QA/yJXhEVUxuoQNqVIjIuLm4KLhUCvoZF4mLB19QUbKq4tobK2GvmXUzL5+CQQ+pewRsIBGuAM8HXUuNrFP3BBsKcY4JA+oOeZPlTEZkLsMIEd8hXlVBlF1yVE4SKaysLhQChVuRrqA2cNwGq6AnIX8Anm+RahV4K4m4EatFWiKOwzt9QK9T5m5pFIVjnAhXX16v8o6ekCsAfaoINgBeqEV31Ncyg9dSiRbJFgyHsSWjyNizyCXX1InS5XDUoyguYjyWYKFYyoTEskhy0yg1mVhquFyJNbPKBeZf4XChDw9L6uaBhZ0OQyiFSZ5goy7XQW0s9ZkmqIT4jwZWjsCnUIPrrfdSr2ZiJsyoL3xtrTlRYE/hUWrSq6j8bNshPgsmipYu9Yjcj9ZRNu4CxsTHgrQHV1iOHPQocRX5QpKsidZB0CK7ecYNhzNvYCMPQxTgBS/fWABOIASDeqvVPAgpxlKShO0OOpgl3mUHtD10440EwuAg6V8TA2d28iHk9sMz8s1uk7PkIcqXsAVide20v9Ovq/Ui2o0xEc3VNvuQw3EtD14DDiD7X3HoalYpqIBr1nr+C3o4A4nPNzf5FDaDTyiKBhUpVfIHsY1ENEMPkw8EJ8xqWonPN9TWH6n14soZmJXVBcF6uTvQFYEbB5KTmNqFm8W1CndePAOgHpihaA77EYICr8wXruLpFPrEZITDFyhOe6Gvxi1y9r76mvpEUjcu4uppAsNnH1ZPYJpvDj1nHch/i1AeXwNwtID8sM6r3+oEfsBg3c8YMoTDfzs30uKfPWLAAjovyC+wcHJZNdwuO/MJ8Z9I5p+JUciOHskqPhQLFkSNxWJBfTPZDDFwa+UuDY/wvjTMyCD1OJ2UG+dcEf5lwbCCYRgLDvz6Mip79GchZA2kP+XacGt2Fof8ZFCX+6ch/NP/VcXebEvl+xZhlWUilLFPe/0knmHi+Ef9O/gxWeH04dyaFLXvlz1m4C7aA1cN358H5DM7H6q/+GVecRq6Z1W8n7Q3cXawu5v3YhHxG4v2lcb8wJfarBvr9/TjQw88Z/tof/TQdd4j+m9VDQ/2ZqNn/yUzez5L35Rovp6VdBa9m+50lKrid4XN3qPDraJmjgj/C4FYV/CRbR9hV8H0Mv0QFt7A6r4Jb2T5ghQqey+rVaj4Z/mIN/BY1/wy/VQUvZfU1GnI9qMYvYPRU8M5CWj6tgi9g9U4VvNVByx1quYqZ/lTwRlaXVHCO9XtMBV/DFlim1mS4XOdWJNaF5Yr1pEkBn67YT5X1oWNreIvKnmp4rga8VAO+QAPeqAE3KeATFevnxxXwSQr4Lg34SQ34jrspHPdoM5R0FPAhyn0cBbxAAd+ngE9QwCUFvEQBP6aAO5V8KuBTlfsXrQn+8xVweT/AqLhmQfxLAS9TwBcr4DOUfCrg5cp9ruUJ+DQlfQX8KgW8RQGfroDL+wcIdynp30XhGYq9CyKXAq5XwHkFPE0Br1DADQr4AgVced2lWgFXXndYrICbFPBGBTxTKa8C3kcBb1XAsxTw1Qp4XwV8jQLeTwF/UAHPVsAfUcDNynGhgFuU+/sKuHJ/7GkFXLlP1amAD1COFwV8oHK8KOCDlONFAR+sHC8K+MVKP1TAc5TjRQEfqhwvCvgw5Qbb3Qn4cAXYpIBfohxfCvgIBTxHAVfuE1oV8EsV8FwFXHkdxK6AX6b0fwXcpvR/BXy00v8V8DFK/1fAL1f6vwKeq/R/BTxP6f8K+BVK/1fAxyr9XwG/Uun/Cvg4pf8r4OOV/q+A25X+r4A7lP6vgBcq/V8BL1L6vwJerPR/BXyy0v8V8ClK/bcdMfEdxnqvleNXdor62C6+bYtpc/x8rPjHgpWLjV4L/5pHlsIR1hfjqei+GPxG/wDrGOqiu0j9XqxjiIt2kvpyrGNoi64j9SasY0iLPkLqt2IdQ1l0DakvxDqGsGgrqd+IdWQ72kjqc7GOoSxaTerXYB1DWLSC1KdjHUNXtJTUJ2EdQ1bUTuoFWMdQFbWS+hVYxxAVtZD6KKxjaIpypD4U6xiSosfOYP0irFuI/KTeB+v9ifykrsf6RUR+Uv/6e1AfQOQn9c+wPpDIT+qHsT6IyE/qH2J9MJGf1N/G+sVEflLfjfUcIj+p78T6ECI/qW/C+lAiP6lvwPowIj+p/wXrw4n8pP4HrF9C5Cf1R7E+gshP6g9hfSSR/zTWf4x1K5Gf1H+A9UuJ/KR+L9ZHEflJfTnWLyPyk3oT1m1EflK/FeujifykvhDrY4j8pH4j1i8n8pP6XKznEvlJ/Rqs5xH5SX061q8g8pP6JKyPJfKTegHWryTyk/oVWB9H5Cf1UVjPJ/KT+lCsjyfynyL2x7qdyE/qfbDuIPKTuh7qdWvi46tjMr8yJhql/UCMD+/lI8XLrrdykkiqR6UVMRm8EMG3MLAPwR0rbFYpKxOJrLCZpI3glHxkhc0u4UVmaCRdhViR4lxoiVWUB1Et0hsE4ag0gpGx8G1bLbzzKPBxEyB5woc84Y8pPrQrOUU7Rf/mOwa5bwFykeLdQBUQpZ0IDW/tep2P3GGSVkAQcneU2yRPuNZm94RFgx3gjZ7wE7ZHcLobzmg9RmhNsSU6/vAU7W3nN4QB6V7EQJJ5SpJWvqNfKZHHY7BSyuttqE1p0zeU8jWEMtNq5JSsvsvmg/pGsN7fgHiBfUw7g30dlQaTvozCApRsUE42UR8fToN2+1HtB1EToNpS6Rek5ZfS2gyq4nfjZts0D7nqkjYAH60rbJdz4pvULn5A7XoRuxNYo+1Msc8zln9GyBe3zkONHpVaANz1ECL8iiEsOc10cUmhShdF81Pp4qmvabtpp9VaXvEN7br2a6rl4dTc0pZ06hFXkvqX0npWHw747sjdpdJ/AwAOSqSH6IFd+hE9sEqSkRxYpLvTOSLA0nQq5/OniFpN1xO1buxLSPJhF7pPB9rjfkToeMa2DuYDd9sWi8d5SAxLe4C3rnsBJ1hlJUwsogDi711IOwJNYEqR/pVFnd8ibSFHU2wSXhhGUK70a3aUI/2d8BWTrmJ8XX5KHj2/ZNT2IbXWOLUlWfKgegKIdP0DNTQXj36DRw8i4UjxK5WUuxe+isWie8go2OyO3GWRWuB8dPsZ2keO5EynLnNpnOjFWVRPcxCxJkZt9Rcg0/U8GW9GqvtW0P28SpiBc2v5DsNojGl8uNyW4+jkIzfDmI0YT5ZQT42INhOeMkmnmIhFNloegZkU8DuqbDm1fOFAQiSUAXN47k23bJae+4qM3egq4KHOPLKczfeRqdtuBOtUoBd1TL3nBpATJn0w4aobyNB/HM5GR0HbujWOj93hV77Hhz/k2w4cq6jyRIx/KETt9CskxdQpOEcOGgPtjlP6kanXESLGa7BwnhQHQXpxZgFNLzJj+8wjySXazawE/Etpp0OxyDvDbzyTxoeP8Rulq3jdNv6VM+JAIPA6I2CK7aNyyO1bp34F7bjQ+Hl829RVgAVa+UjsC2JtgIpUDyJKi4HFbcZXAE93y2ZV/9E7UDX55pHtNG2rBE72XIeG/+Z5DPJSFioJer6Mj1RY+O2lZBHFhy3bSi0cVK2Y+UCZS8FpN23GLClBEOmtZvQQR/rnV5TeSGhEFjR15qOdcJzDCJE0zdyf0qpbQ+3VbyusnTdUE30VlxUQtY2CZbk09ctYbE3dmkR/DH8Q4t9A8ftT/M8gTZT6aeD7piTwP3AQ/E2I/96J1PihyQl+nqT4P0b8P2ngb52UwL+H4i9E/Ds18AdNSvBzHcUvQPxZavyyeWVVZAzl8B3poFdz+5+IIU67w188j7r0dFQDwWJDBcTesVZpykkyjgnmao7OEtIJhN1sM31uvqucDTR++4wcZlLzYKhvm2EC68wgtwuY+7sgSM+DuotYkF+5W5zEd1wDiXQBH97J533Gh9/kN8bAj++EsPwv8SIYXjl8ePtNt5TdXHZLlAcjIIRWN0sktmynuwgg+1sTE7qaZyeyT4ApUrruC5Cd6Wce4gymOD+nOF9DIY0DHPNIrrv+wVk2DKL4XmZfKKTTx1X6JLoEQUbyK98Rr+TbbjPpQqNBnfEZdzL08FwOR6PP7C8UnEMIgZizJtn/k+iNA3oWXWhMgl566x0mThz+nJURRH5UBCUndNL13hoWvzouRnXzfNutVl2oDMiHv6E9jOdXfgyjquNOEM4Fat8OzDYAuefsHA23vya00xSkQVNqfgk9nA8fILnVHSXSD+iBXbqHHlipvSJ3WG6KNsRQ3aXd9f0T1PcpHdF3lNpnCQxDKfL5ufSdo9L3H6HFc7lMPe9/fi59l813h8+QSENGBh/+AjjImGXlKqWyLxKu/zMyMupBnfUmFoAscuDZ+BE4rjQrUjsOjk+micv5DTH6G8k7dy0Noi5dyIhuK6ZQ4dsss5xHxCI+vM0TjvId/fnwYDSRkW+bbtXxbRtNfNs2k9v5Umj/rLwj7kiV7SS/8TCkXuW7YKjNICONxr4ZJPa5wyPowCj73mZHZ9fPpbc+pZPYk+irKJU7fByEKvBYOZDvNAnTJAIkzaImR6c057gssbhgVofNxkdKLcDyrJUHzO2PssHfAdTdYZDEAFnUSfPS76Hm207qQq4y81MG2+oMIGpDGLC6zZBB2GTssph/C2gR+oPpl/Yemq8Y3Nj3li5bXdw/wgcdu9GUD6AGw9tRg9hBeIbFEz7sCR+UHkJxaZ9dPwC/6QNrD8kHQOkYU8RLn6PXMXtfz4c/RaOfYJEw/DkmFHxH0OSBIRGG3DAsefKinjwJjWluH6tHbyzi3Nu3nESHdh4zrzqkI7rgw5BFQLIJaYaPMAFHJLNwh7dfE4EUFNRqmRVZROLcdj01VpHZ4+wyt/+SxJbKk+7IHBAEejzMh9/gN36S5na+7I7MspSaH9judv7b/MDGUtO/ze3P4tBo+9piXvVXMkju0jl2Ez8Mn+RfAU73Gdj8/HmZOVg1iCsz9x94MfxTPgiabYLRvSn0ER/+mm/78Awf6fs6YSVS3o/z6L7inW+K/fgOMHR/fjvREbjyl9CkSwzx4cN83tt822ET4w5cUwfOam6fh2yEP2VcvBLlN35gwJH1uTnYd4C5v2EAdN53IO17ZyjKhz/Dvj2RItL3tZG+RW7d+7zzDbGfu2MwdO3enk67th33hLvczo/FGSx+ZfErX8BI6If4NcbTUThr5QlxhLtjmjsy34K8G6Wnj7KohVll11GcLDabgP/QplkQ4kyYWf7kqOwkkM56wivkuQuXDSBbi4VMWjiaSSZIh1OZsHkN/3RiLG8zfz8dQ9nKE6FLyp7BxMblgPACRiaZES6a1jyHvu6J2L4goDdPy3mkJ/w1kweGdyf8bYJurzkJceQkcXPn5tCBaBtZfn0QjSIl2q5sPvNTGq8hU63P0YmZ8REPQQnc6xZwrFNu53viNL5jAAaTcTTeJ+vrahblV3+i0Nc/P6H6gtahTWQ2IGG09pN4GIX1GFTc2w1kf7KrPTmfmA+pq/kaK0cDzSnkNAiiZSi4HXATDBbGcPSdo2TGjfMNTLug3hO+d32s4DstmW8IKjAhmDBS/P5jsoAg3EvvQkXZ/c1HMUtX8T/H3XP+h/Wef4uS/xkfa/EfPaLgf7iK/198koL/H/I95/+mT3rNf8URBf9tR7T4z1Pyf/ORZP7RHt34//dMqzz9nq70dCxC/mHSEU3utoANBBiFTvgoagLp4miTyZ3uQmlgnMzqCNhM7o7hNhTIo8gveiBXS5dCrj92KeRCgnG5rutiQwKnwXaoRHHXqVs+AfLEru6BPLuPpJBn3IWQ5/HDCnneOawlzz2HFfKsP3wWecb3RB59KnluOXwB5NkTVciTpSnPk1GFPAeiTB7Su0Ke6+MRFWb+e46sJiEO5gPcM+CTMqIW3Fcw9snFmmgjszkPWZitlKQhEPWl/zohb63BDG3AGfpuE2deOTYND2dCMgeE7XQHRTxOtrT+NN3K0XXt/sM9XNdiVuF4xxMpbrscOdEhCyVk3wOPKvAo1xOptkSfwvU43/aNzrzyDBCBdMzFrS63VXvC+3C1tgC6z8fuUZPbDDmcVE1ZMLf/juQUsFwPWzB/qfA4PzS37yYzPAFU8+EKcrCg+wq+wkQVgykd31FCdFGLCuhYauInL7WY23+OhDoQB/JaPnz1ST68FCZeWIacBtwXdHQXyE5aZqWh+U78w0Bovy29LKGGRZCVTtwiir5VGvMF3Uyijd7Q0w5KiTAG0jkPzNghfZGGgSN4wPlKISnDdGCMu60ePG2kG6Y6d3zhEzoUd7Gj0uOHkHq5zc7SH6TapGdUnW+Z7w3rEbEWFNWRy+e95da9xztf4c1XvwKZHK/bxYdfFTOhL1g2YCvQPYj+jdm8SjhDpbGSDTnHbuk5Il4VnA8TUxJVv+0JfwIuJm08iCdvprqtiJacwciJ6QZPB84KNNQhc/s9cEJaD8jRpWfQ30keiEZf+Y65XQ+grj8m/L/OHPTYqs39eUt0LGYZ2LtVOnhc7grb4HUSWFlZwZHmsc3jyAymKM9Bsl/KdPWNtALraMiVE8/QPWG7tPpTqj8T+m4L5Pl9yZgyr/wV2vqeLTjmFDlWwnSiLm46UI73EEnfYXEBNv6f+LUBc/tcndLeVyUa8W07Y1KfQ3SB0pFGTlvporLoKub5ng6rtOhQfJ0zx922VYfrHLfuiDvvY1heeMIBG+9uO21eWovBKbwLjnWhUrq60SOI+DJZ3uhTLG9uttmjplOyLt6FqBj96ptYDH1vK12yoHEPHEAdDej6C/EHusRZdzDuDbBMrLR07YKV8TdXJHY3lo4kK+MFl0H8aAYC0q9IqvM2nLrtMnJq6ijc3pRWfYT993s+L7ErNJm2HY5tJ2Lnkan7LoXjyUhnDNCRNgKr0jMHiGqifz5IyycP0jXU1oN05R6PnvccwR1nRcBstz2uo3urGUTxC8iIycG1OW7HbujD1uQ7sQfnzTaTOJbvuI80UrjI5XriIkg7nuNiv7jDa/dExt08FTc/72iUNn+I43r0lGlW6NNxAqNnHfDQikuzjuJxADb3b7et1nGkfFCH1wlW4HUCeuGF1+0lV2T47e22FnbjiSc8URpOVGP8DXRDAnLkjlIcm+BanbkoI2kbMZ6eYiVzRIk5D/wQ/6nAf6ql4UTzxo8Jm80mGK0tFjaflCDfMJKqkU4r8RlgkF332tZOrlRw0sP7Y7ENedRmv7NSlU3cj47h4oheOeLvuTzGl20sQT/xAVrpE3KRZpNkQnTQecYGHdX5tnJbxuXSp6Cx5wkzkQDMSJ9BGzgBfAKTOXRxuoVsBeHchk5eTfq7lwwaDE8wmhd4nJ1LJvN5Oxy7HSegZ3e4U3LvJ53jrHvX/uTrZ+b2d9G9Loaeo7sPYPxyx5tK/QG5a5u8r03ibUcLxM+9HUutbf/SSbfD+WgR2zECZVZgo5uB664fSYNg6pIsH5KRHr3mAC2nH6C++jCU0WWssuQArqWS5n+YSwdNxozGHT5N93zQnR9Xu/OD1J3B8cjFJOm6fcTjdk5O9rhGYg/jPydTj2thHrc64XH0IhTzOCtafTHzOMijpD98QDymcHKyx1k9kZZcgD8wiXparif8DKGDfmZPuJ30hw9J+zsmxz1usexxuQmPK7c1op1bmK8RnUvjP6CXWv6+V+k+L+zD2kfbcF2LbegOPnEMXECjJ6Bf3KCjflGKfsGDX5i/fxqdKGFgO5Gs+B9OFnqlox+whKOLYwkHugnmGANtvPOwuf0EF885LHLOYUqVc7jDLg5W8MbTKDVomUgZ19Bg48doDVCPlc5aP91LdDTTSYIH0W8usSe5dki01NHvK6eVoxbC64fxa4fL38dFuYSx6kFlrAoFIE49rkueypIGhh06iH6juLDrlrcicWRMBc+WTgPxaCG52gTzsoXMyxlk35S6ez2efxon+Mv2opNviUY/oH79KStNH1L48x+QndKyeaDx+y8BR2erwRT7fKCJW4hXfYTrROjlEJmuii0lcnJ69b7E1udPqerjOerzJpqYSre/j5JdaQNDmtiMxYcxLuFWpguz38oUm5UQ+OWlqVUnDlNtBRYotwKTtqZffU+xNZ0OXXdtwc67/iRlvk+H/8Uf0LLwA7KK6Zbv33OkxaAa4ovJ1UDzU1fnQqJ8eTtIO8qATJ7hO+6y414wphsfQkLp2P0PPY3Jc4aDfiag6CQv6W+gy5LjZD53WYnK7sMUFAJwqSdSixmdiCNRxHxSxMuUJImFKTE6GGOFHP/wVAdZiBh/Nozayi5NPYw+ms2vfMHcfiNJbK/DqzN1E9iQ4iPTY7xuE/TKm3lYhvcvNz91pV5a9X7CfpgPQyyxlJmfe/05OiFs94RLpM/epVlaSbcUBlv9i8zeYMCOLJfjY35yhcncvkOXMKTH+RWuuv4tTX43kRBKDe/SPLIEF2WjSQ4ZGpGUP/Z9N27GvdJVUHG1f2xeOZnEUKa92aRry3OcgS7lhrzHosZJagF/sRxP/us9murhyTKyT1sKa4T9GBwgTWvbbIjcGztz5syXuy/dNboVfmI0vGnjYcvvW0Hl5vJNfKRSz5vL3w5v5Dbybe+kefL2Y/pWSpL1748iARwmXbKiMqCpnoL8fLUFBSzFM+7wLSZcSMGwJgqEkigQFq+YRJYS71lJyMyDtW+Ik0a8TfVTKl+9sOLVC6V+jryt0M/Id+L5fFw7dqKqEmk/nMP6ZnJLw3riyjCOikbTFfAx88rbabaNTq8IUYwe+EnAdjnZys0jEQqc89+4l50j/eMtupeds7KzzLx2azTzDNnEZOt1XCCkQYTqupTtZ4q4ksFl06fv0PS1FPXvDs+zhN9q+8bUfEnbfkMosPKF0Jy44qKbzsj7om4M/ZEWE6bFbYdgaWgJv+3u8AyEI4/lJJ93MtI3jc/btjGa9jn/mwQBXPNARj7QttpyYqNe/E2Z+e9Vfc/UhatMZ7oeLAOaYUtZR1XfUwA41fV9aTCZI/v9eUQiHx47kOTDfSHzkS4HiaVNZLbq16HAyUAcmAFL2ZX3vRcD8td7WBolrdvDLklsllZ+DXF6J7izdMdb7DSO/QXSfXtIaB2ew64YbIbhva8Ig2+a1PglzdNK8VYWnHlKyeoOXUmq/YjehzKF5qOni8gtI9lH6N015E6c2wEm3fw2zdNb3qXTwW/epfVnWTmfwRdD2fUGHnUwyBPvYj7G8iFjwfnnQ2VvknxoQ0HKfOiPBb3Mhx4iGjNeVpA6H2pznCMfeugt0v62gvPPh0buUeTZexR5doeOzjv3v6FMlB55s0eJ0rLuiRK+sEiRKGVQJ1ljlwPbtj0s5B3VSJQG684zUXqtIHWitKUgKVGqf4Mob4RdmSjlvpmcKO2yp0yUrns9daJkXkk22c6RLKVBJ9EvtZIlJyZLu6CD6PgYnbasyYuFcmwePJOUSB06k0ikbNj2QUyk3oYj6fX36CD4+1s0ezr0Fq1vY/XoW2wnVLlf+A2MCgm3fiLP2EpJ+YRtjXqU7NHjKPFAChExRgeQDSUEI74U/JDcPGZBly/Vxxd+PB5Kf8FxKV9tuhtRqvXyqGi30dV0O+kP6416MlFjqgVGx80OALYkAyPF0/JljxLfoJspcPYKnCbJcpylA+QWNOnD18i1cuZBdCZL9PiErVXPUoOXTGQXBUNB8XvjoANcPJa1TrHNM6/tdOu2SKZEX7We8GO2R3AARB4jt6jxkfW0DrGtGiMu9EDgZJMNb8OEmYht3dSY6FS3ADkDFrHNlXsJlybGpUXmsprYY73Noqfcknr4S9QKgqSq92lf1bIUZX1wk7aEM7fXk26eISoFa+C92Doyde/PUCZ+8y/C+4deY4nfyn+ze/seJsuDM3i4BnclI+1Mvk/YNrFJWh2lfT/CbGeRefg13v/YVpqjw30S3C7CDeMcPvwLW46e3omD6stF/g+8rdzxDGdiDwf5vPfx9i/pdyhLRwBPQrCqILdkPkaDbAfdV0DqJTA0WA2ynEb8pxpn1EbkaZe8N9jI5+3B1q10Q8Cc127rJFH2PrL34d54Kg0ZXEfIwEhd2Xm3tetaxfX6dLLNi1dgwyGTu+2IThyHucxmslWF6WZHyMRPDllCr5FoBnrbQUyxmSCHXsVsOp3tI5ikUx/SO1KL3pP3ZFFxYWIyiHqlJj5vF16ox1sQzKuuxLv9Om6F7k/qze0j0qlPNBJ7QE5/I2SHX+Imskk68Dm1FdkvCp+Ib+m/e4jaqpXZap/sm/hiJWIrcH3Uj0SieqNJeUWAxEJ8U5xU/BYVgOaAbxOLnPDkHSTmOkkGECSIZI8Yb8vEdhYdNRcpwVw8mGMtqWF3x6h9fkEOELCPbMvQE8joOh0lg9tDnrx95ry1tlKcZcLbzHm/sFkZGcwe3eSOQWq6S7p4dp8QtZu7bQtMGWi3T8BuOOCyjlC78ZDAmtxxu6FNLJnkLlWCDHYjG9ug0jVkCG5nk/QJKfwWvYW2DAOcfG+p7QP53uuhH8i2rniH2sTC7IU0DDbJ+RkF08y3yBa3lf0gtZVdl1ABsZXbkGyrpxW2qlDaClc0UvhNykAFsVV+epKtPBnUVhXEVl+kUSW3Mlu1MlstANM8xnzpMVu1jtjqCXKAgAodtVW1IgAgmUbZVo8RpRBb0SlFDpvUVrgqBGPldJWvSWWnfLRTzWFqpwVKO1XZyN0PizIUhtpNDEXiMWHjENroozepjX75NrURuZu4da9soyV76bws/ekt5TAcmEaHIVkdSmSGKuBXnjDf30jCF0Q8KGcB5v1BPY2xD+LsuJvvMPPOF++8LHqdHjVF7o9wbgK7ESzDm7xuB+/cvKIvH4Z12SYd7/wstBeXwKunA1tPk9C/cd9VFMv8y05ct5O4nvciJqL88/IzSO74dKpcv7QM5Z1bxQbMU57GVmOHQy+dEPLfWXYQxGoxe6DbvI288xXzfW8QA/fV886vzO3k/rS2KPDzL97s+RSvW85CUjzfdljHT15LxDVH2ohz3Edk5dOGv9LVgdfXgfBg/h/x6Z3RX4K4ul28cxtQPAZLDA9MqNKXL5H9+VI8nvwSXQjsZ16aK731pnwn9dE9eC4mLYUSN96fIdkHJF5TWOI1hy4B0TTKxCuRZVAV/qqT7DHhzdqYGlroRJhD0pJhMOO1PkNmRZgrX1dMt8QFvtbTOXrgi+h+7WSyIlFMn7iRnO9Ya7Pq6X63VZHTYApkfop2tJqmQdi0gsSPtaykIVgqepOOdaSPfMo5kTQME7/mk6CA3Y4XonthNQzFHvJ8QL+RWbCWO0MvAHVkkiXc8Uy8/gHMShdBliLdCa2lHa/KK7r3d7IV3Vbpr3jhZs4uOO0EDUhr8Z8/Y+r40IuE9v5+iTsWJ5oI7S1I+52d5LTBnLhs00nuj5/6azz9zM748pAOQOlWgIC2O/XsisDTcQ1tdUdwJx4jG1ENzYpmkQS40YTLybZtA6XDLybljWMpBZgBLzKvmgb8bRhAudiRSbOuh17A9pTWEGKdCrx2hqfufoGsQ0w2OWuc9hK9SO3HNYg74rHRRchaypBzJ4x6ecd2LZGArkXWUhZw+REhCxTWQCFdQmLVmoU9/SCHSaoCsjZ5hXBnfHS0lQRoXE1D2joZLzbCJE8cLXInyZjIMXSGczRZTQ9+gw6iT14jJP5MSHxJ2r9DQIPWk8mp+JLR9BkGI3qIZTcZhsvButJrO8jSYj3h2ty/0RIdhEuSZ1+Bf/jddK295eXk8jVWXvEvWk5i5QxW7mDl7aycB2V0O6tEVEjjWdnBymWsfIWVU1i5npUX/Yvc5wPSei+z0tt0wxl8x908LAAXUIW27iDacIwii70SvIM+OuUF5e39dWvg/KVa7Utp+08vjbeXTu+gu4H4wONNUWGHkhjNM+L30ylWVng3Ot5d9zviAOP5jpkW7I/egsk7jzUNSWwLkwiWIOrpuNvkiRSR2+1mhU/jJdyVJ8QbcC57ZTs6ehYksW7nUTHHEz5Mr1LROzY/3yHfsbnyBbqTeft2dJLLZuk+mqU77gnfBq5UY1F1DPNv1OU40PUn8At8cYf0zLZkfZVd7w6/yYc/Q9nIdoo7fJw+s8J3zCF3XYd38HmHefn20lNkcE7h3Nu30dtLT5pXPc2xtQsZO8hs+na6tWahHIc3u3Xb3B0Z7vC/PRHPANOsPBDKMODaiMFJVhxu5xFz+0NkZOJehQe39ZCQRTq9nUpt8eAGn9v5kjjNE/4alhIeUEDFNhztH4fG4tLAQm6QtMwKh+i9kWV4F7/q7kj0LxgsJdCu68U6lX3BR8zfL4Yjl+OE4x2SW7lx3/Aiuu/nfCm0sutHa56n90sWnSb3S6bHkh2Grr9Bo+gonsjoCSPxHubIuGlQVpbhQwuQqH1E7gjfeDpNErYQAUSr4524f6B0J8rDR8tiA9+FRQZM3u+FDtN7wRNWTfT5+WZ2Tzp7qlfH3j4wfnGw3je+wX+rf3y9v8FfE2yo9RaO9zUsaR7vFWuCtb4mfKPw+MZl4uJgQ2F+yfhmv+gb1+ituc27yNdM4E3eBnbeXzM+JPoDzeObF3ubfLVCk68uf3Fj47fRT7DR1+QVg03C+ObQQrkTfBYcfgutU6z2POtV1lyvdcpUa7NYO2lSQ6je1+SvEQL+er/YPKXWVxPAtxrmLsybNmlSvbclN8861rowzzrJmtsDfH8DxUfy3jz4WceMsY4KLvE11QWCS601i301t43ivl25vbW13eSeNrU3go87T8HH9UDwCy038tAMTZpFKrTyZVmTJilfH2htCAUC1oagaF3iDfhrmX5GN0+yCkJjsNmau3Sxv2ax1d9sHb08lGedZhUX+5vHTWv2L/eBbMlnOc7fQKhYA8BekzdgrQs2WQPBhkWAutQvLrbia9esDvsk+d0EF1puf0NNIFTrY/IDsaYm7zKF3e1oCT9awQ9eTyy4yCdOsU/LFWAQNvrkdyDU++opbgPiNgBurVf0ymJz1j7wf79MlVphaMGhCqisce7xc6zUJf3BBiv8T974VWut8wd8XNNY7mooiS3wRWNEeU0+by22TCZK36LHzQiGArUNl8vo2JgbX+tbMh4E8zdwS3w14PqTJrF3K57tPeqy31phXBDXsN7hbQg2LKsPhprvnDRJ1u+kSUSx4PZUs1OqrrQ2Vk67Ig+dIm/ctPNpNGlSnbdZzPXDoDi/ZvKYvumWXHQtq79BzLNSpsdYbyJuVmWdapXPTYZWUD17H6QH8lLAKXK7K62OK8/RSgw1BnwCjOZmMOe0ydb/u1pMiDzmFrV95TNaDMXjJKiitjY3oYO4hs/+Hv7zoA+j5PzpV12hRZnMoEA1PoVOqVL4yLhpubJvJDzj7Ppt8i4VqIZl3qbdwp29CcZZ0i1072vyNdT4rD1skNKXU/nweTOQ7A1VY3qnvytSqI9ETRpbFIOFQNl7fBUnplmn3XKh7dcLBr61/s9uF4jX3Rg7ZwumsmT/v9D2Y6/RTJ6fpuAbNLt3foH7P7sCBJzGbvlWx38vFHDFbEeBMNMzZ3qZRxBmC44SmYFiwrajcDpMHS75ramu823vPEvTnvVfKXpxYqh14Qtkz7t/xwRXwxJ/U7Ch3tcgpiJxrvb2+d5AyKfR+bnbT3TPSbTVDUub3Kmj7/nb8lQs1heWXsf/EYsV4Rs2N8Ri+wyQv0NZbeS4q6AcbuK4VVBuwQvv/wR4JsfdCOXTUN4PZVUfjst/JhbrhHI1lLl9OW7gc7HYWihtUJZCuRbKJ6DcAuW70Pf652MxD/bXGYvhnmc5lO1QilDihu5jUOI3IV6DEreCDBtjsdegLIISt1lroTwFZdUmoJPGce1QVkO5Hsq1UBo2Qzsoq6A8gnAoc0Cu41AWQWnDJSyUIpSNUFZtjcVO4q09sMbG92gMfAHkhXI9lPjiOnEn9ANl0YvAH5THoTwA5ZaXYjFrBsj3cix2M5S1/4LzUD72aixWAfqqfQPkhbL8LaAL+qp6OxbbBaW4NxYLgL7WfhiLPZYF8KPAF+CthXIPwA9AeRzKLcdisQVwfuBnwA/orx3Kvv0S74TTLZ/L6VosumF9M0xrdBmWgew9bPvADsr3h6XGp+9CQ/x162MxOz6Dnm25OjvnGnPWUlMrd9XQyVcU2kbJ7fF9hU//PRZTvq8Pr0nfjO85ezYWI+8hLMu2tOn1pdkmeg5v/FgL56bFz63AU/SdrEgPzpH3tJVnWxD2OPy9poLhJ6WOqWB4HbXvc8mwA7juVMHwXrZyBcyD7UDuaoDhTR/c9GxLRD89O+e+tLJs6ypDWXZum7E8u1T/SJ/s3PJsa1l2DmBMzza5ssoBUqaAlGUxOW7GvZXnk/vFS07DFbD496mWV3iIBTIefnaglRsm2yGXvZcuB9rgeyQNd2cSfa3SQ39tacBJS3YO1MtAe4i7C9pMAVw302sCb1kfGREZRFzcPa8G3OvIC+ziuDOzrU0yavnmbdReuO+/FnAL4vYKxO1VDueeVsiE/OK1gdcYz1r8lrIXap4CvL0o2+9MRO/366/JzomkTc+23od6X2W8Ntvelq5/gup5epKec7vr784Bcf1hu1XG+wyRtPv11FdxW33432Ix5NFAX45C3i+Ht0dVQUzBGxsMdpPS/tei/d2y/SPdrW3rzsNXFyV4KG0zrjLclxbRD2Tv6OuEMYUvSDPspm88xeeJVsMYOwD9/15Pfe+Held2zv1prmxrxDA9O/c+Y1m2fVV6WXZJW8bM7Oq0fvo+2SUAAvVMV6hkeha+4/Q1vCwI8ewB5sf3oxxKfZahXiq6qRP5sECsewLaro+3dcfblsfbVtFBEG/LZ+nrVRD0f6Bl3XJhaD0OtNZeAFqon+NAywRxfWMKWkQ/5UjrFqDlVrS8hujWDrH/F71sG4C29m3n3xa/BZMLPG+BtlOAhuFRI/OR6egj01P4yDXZnbo0MS2lk5Bxc2V3n3VZEj7bqWvLWJV+nzFiuD/th3oW5/F9jsP+EovNRN+9yhiP8+Uw3+UcgnmKODPGhkUkNuC8gDmDB+bEv+FcPcB4Fn+cmb0vTX9zH8Ku0i9dWSnG+M/NCV73pSkGuTzGNzwZiy1HPl81xL+ng/pvhfn4PeTlRYNSh27UoSuuw3I6zvalpRXrz0uHumS+UuvwQeDtRuSt1hCPPybMGf4di2Vg/KkysPjjxvhTnjT/rOsef5BuOzR56ElqA8OohMzVQHfFrlhsBPrNRYZz+c3M7HWZaV+klpnXkLlfdkLmdZkaMhcAb3j/koG+0Ibwhu8G416PxYZhXvZ0Wo/sMfcs9sC+1uK9H7J+I2lxH5XAIdcfYPMR8VGR+CheIjbghWE49xq5YHFW/ZRnV9SkZODaLH2tRkgm8R3f+In3FE/XyfGdj/dB5CxX9FGt35GSVnkW0RvmgxLkj89C3md4Un/uWPBIetrfTOflx86+CZs+kq5h0wXrYrH70F/X0Ws0SGcX8PYu6P9W1Osf9Mlzf6m+SpmEWLv3uzFLOW+mrSJzJo7/FqCJuYZhoT6etz4DefA+gOezvON6sCjGnNfwfjbQtY/jlLpJzKU86oZH3czKLm1KpReS1wwH5TQCHeX7r2MxHf4Z625/kxwYRhoJMH2HrrBVTyAXUcglHii3pr2se6IP95N042N9uIczjev7cB9l2gGCiJeOIYj2vTrjI0Zun974JyN3XH/t40buxwbjg0bulwbjGiO3kxwfNhgBHiPH0KZvHq7BjOVciHY25Ec648tG7j69cauRe1RvfNbIdel36F8nyIZLphKkPkVG4P5W45eU8/G0afFzOuOBTO7nemN7H25TmvG+PlzEaDyVyR1ONx7P5A6ajD8lrN/fh/t7pvFIJrc3kzY0DsNnK+BgNHTekY6df2Pk/qk3PpDOtaeF9W3p3HYjVg4ZjXCMXRZeThrcjaqJ6ow7crh39MY9OVxbmjEyhPujwbgvh9tsMP5pCPeYcYvudA73Zobxb0O4oxnGL3K4V00v634zhLs3yyjlcA9nGVcO4WJZO3W7crjjlv4/GcL97iLjsRzu5ADjL4dwvx5U0ZnDPXKxcV0Ot/Vi4+M53ImLjU/ncN/PMQIcWMheACwsM+7Qc8d0VBwT6mOicSFhNMvI/e/vf38X7id/N0T+Toj98v/Vyf8PP/k7Luqf/B0X+XsenOp7LfL3PDjVd1lyVfBqDbj8nZVSFVzuT/5+Smdhav7k74DI30epLtbwW5l+YfL3TrR+Oo3yblNy/ResLn+DoZG99F/+9kLVjbSUv/0hf4dnmOJ7opziWwTyd3fk/RR5L+qLM7EgeY89m8TluN7JPiIhf3tCYuflb0hsYOezFPtZnOrbCpziGxhW9h0EOVdYZ0jeX5O/bSJ/a6FzSDJ838Bkvvex9pmq/keo5PsmRuXTMdAZVrcMlPMVWpf5PMbqy9lHJb5i9ZxvaXzI3zlX/37LBHmKldtY+QYrD7LyBCvTR9JyMCvHsHICK69m5XxW1rFyCStXsfKnrPwtK59i5TZWvsHKg6w8wcp0JsZgVo5h5QRWXs3K+aysY+USVq5i5U9Z+VtWPsXKbax8g5UHWXmClensIxeDWTmGlRNYeTUr57OyjpVLWLmKlT9l5W9Z+dSlF8bO8e8dsd/MGTMmWXPnLQw1iCFrSX5Rvn2cI0RqjrscJfn2ojwK7Qlt/L5YiT4VXM9VpYSncWJKuCEeB5Lhxvj4T4anx+NEMjwjPn6S4ab4uEuGZ8bHdzK8TzwOJMOz4vEwGd6XW5MS3o/rvDQVPJvblRJujsfXZLiFq04J78+9tCgV/CJujT8VfAB3TEwFHxiP48nwQfH4nQxPfG85GX5xyriSBlFMjsPJcFByayp44rvKyfBhKec1A/dprJvfk5ifzbWyfE7+5tJSDfhBBt/F4PI3nfD73qngdzG4hW2Cyd+uOUFurbZw+9jdRUEGD+kpfqkKf6ee4lcz/NsZfEwaxW9U4f8qjdFnN6Y1MPglBor/iAr/XgPFtzL8Jxn8E4a/S4U/w0jxH6lh+QGD/5eR4ssfxZHxjzN8K8O/S/7uTjrFtzP8owz+fDrj38ueRWHwURmp8X/E4NYrkvvdmkHptDI68je7TCaKX6HCn2JifKrw72b4rQxf/ibYKwy+i8Hd8nXbTMYPu1h3nZz3MXgrg8vfQNupAT/O4J1jk/m8og/zh4VMXwze0IfiHxubzOdGBi9lm0V7GXx2FuOfxRn5WsgBBreyjw+ZWOJ3fV8KP35pcj70at/U+Ff3Y/ZiH137PYvTOxh8H5tBHmB0xmYzPbC8dj2D35yN8g7mVrN8Vt5T/qEGfieDy3m0DD+uAc81M78tTIbP04Dfy+Byfr6RwZ9icDnPluH7GVzO02X4QAvTD/vo3RSW4N7J4FnsI1gzGf5RBm9kH1v6G9Pn0P4UPpfhL5fty+B2FpDeY/gPM/hLDF+eNj7VwJ92EYtjzKEymH3vZ/AxzDHl5cUhBreywDmCyTVmALXjHpUd5zK4vF6R89m7BlA6NzL6j8jv+2L461R0TjD4AhWdMQOZ3Zkih7GE+nYG//qyZD1sZfDqa2j9WbbQGTeIjrtSgY1/podHB1H8KjaA7mPwAYOZn49OXvdcyuDyfoL8TcLiwUh/KOe4x5q03iofTOWS14eyXEsHszjA1qVyQvYHhm9R6WEPw5fXt/K9BOkXU/xcFb7zYhaHVfQDDL9Uhf8ow5fXw/LydQ+Dy+th+ZtmphzGD4PLtzMW5aSer6/KYeNuTDK8jMGPqeBVDK7er7k1h+rZrtLzMgLvns88wug0qug8QfC750Va/L9I8C/ijqTIr1Lhv0UU2z1/O0LodM+jvsihq1Y1/+lDKFzN55AhSKd73jV+SPL3DOXf9CH4vb5EXie3CmngbxuCPj+Ey1HlaS8PQakGx7+zKev/kAadjKH4PcBsbt31tP6aPK6HpsbHL4ZZU+SNd2jgPzwU+Unkz/I3MP+ggb9raPL3CeN20cDHlDQV3D4Y4eC3LD7cKs8LGvg3a8Dv0YA/oQHXDwd59UO6rfvMw1PjO4ZTu8vfP5Xzsds08FchPtC3qL6r+6gG/ksa8LTRCO++3vlYAx8/SpkKPlQDnq8Bn38JlVf+rmuFHPes1F5rxiTHz99q0NmgAX9ZA75fA545gvIjf09WttoNI1LjXzwK4d3XoaER1O7q8XiPBp33NeDFI1PDeQ34jSNxfCXWaxY24G8fmfw91fj+kgadDSNpHFizgMUjRmegNTU+7uNYUsQBHYlLQ7mSe5LhzVZK33p9cj6zToP+Fg34h1ZKX63nTzTwL700NfxODfijGvBvNOD9RlG/3XcDrcsPtVwyKjV+vQa8VQP+vgZ86mWp4XMvS63nH2rgr9OA481qqeA3aMBvtyV/h1b+RTTwf6MB/8pG9VnB4pK8/ZQ5OjX+FRpw9+jU/r9odGo+l2jA12jQ/9toGjeqVXnjHgaXvzctx3PbmNR0XGOovaqvT15X3quB/4gGnKtx5Nc0NnLCjZo3NpMb0x32xI3p7tmV4kR227mjQHnbubumUnQ48N5zQWzy+sVmd42r0gv/wG9GgfsaKMob51QJ30V3jt52VylOoM9EuANALPAfsZ6Cloqva79lPTSKriX5/uYmb35xSX6jt0nML3ZCv99Nxy6HUxAq5rqqqm4Qrp43e0aVe85s4fzFtgv07vpi8kyFy1Xrk2WaYKcyTXCcv0ypqF4ghnuhLoVMBUymwu/EThdM7ISvJ3RbCP1jT5XFQpIvTpjAZJx4vjL2rJcLLJA8eBMCTJxIBZhY0nsBlFS/JYYTXjXRSRkusf/nDJ/dZc7+gAx76tMdmF3pEBz2xPOq7oCn3uEi0MKk51HZ5DEXTxXhA4LIwxKXiwbQXg56Z/zpyB6Y4FuRyKElkVZ3zvizp4XNoYWuQIAZlA6hnjY6bykVFLy1tYluS3rYLW10/srtScieWOtvbgw2x53cWdRbiip/6Ea4+DtIWdSdOgqLz+l9RaiI8gLXkh5iOnqCyVzS3+JixnYUF53N2t2bXQhzd4873RRUUtxbklqTB6Z6c8FEE/wNftHvDfiX+5oEIhg9TxM31r29MJ88ktnYFGzMLygo+n+KGagFauGg+DvK7edWXFvzXeb3qi5lcSd8R2sLtbgKa551lMQtXAgWdEwUZgEb5Jlqwd/Q7GsS3deQM64ls2EELWoIEd6AxYZgU703IJDXkWAvFYBGvOA/WpVoeV73UDTxnGFD+ewsi0hV88/zcePz6qMnsUzVQ48ipbpNT/qRH/ztUQdx5N5IYD+fDnqCnKTTszcoWRjyB0RwVPSW4ubGgF90zb1W5UQIKBScDcEGn4BQmERYtLYrI5Sj8DvrSI4NE8+aT8cJ1ywJUC30EFUmX9ITgZzxp/+xvbuswClAHOkm2VmH9PkTk1l09orqhPNnMaXvYsxmPELYYnwlpqzCC02PSV1o71lyVILvKAr4G9CRlP7j6EEkSzz4D7junuP+J2zJ4vWEv+QXG5ybRzX++TqNyltcLphXeunVWqRk8QvkoSqwt2gJNY6iei++QasnczH17CIEuKsEl8PR5GsOBUQaUeZUTmT5VYGdbVXM/TZWg2fPmb8L4WRtFnJIXa5BSiv3AMtHwS3gSWCpUvSUCII/iIlpT7yp+zxfVXn+Tdw9f/nIuTtwnhftbi8m6YkE3Zu4z//1JT3oqHet1BGhsqdRq6ZJbBZDdXX5NVytr8m3CBYksC4R64WaAEzFzZwg1AaFRYHgQshXayHLbBa8oRauJlgPTi/6avMnOp0TUyPBsr7BT5fhAsjStIyra/LW+4TaUH39MmiiqAnoekmognD13LJZLsE1uxyHjTBz9jzBxTMgXz6XE8pvmF02yz0DziU1rk0GNIuw5I37/Zyrr650VQlVZdM9LoGrE32BQGnpTI97+gyhIL8gv5jE3krRSdcO/mBzqoWDizVZsEAozC+iy4X4soM1DdJ1B/zr89Zrrz4wZ0yiBjMBJ/jwrX5kXE5sCEKcCC5N0WMJcEdC0YwCFY3kBQxbbk9kr9tz1asY7uE6yQlrG/p+Pxesleq7M53EU3l3ntxzBPL+PyHU7KslwuFCiEgHTWoFsmxSNwIevehGZLWcbClgOOBrSIbV++pr6hvVFq0Ui4DtQEpT4oK8MGEyNBa4h11wVU4QUvHCXpjlE3xyvCktBYyy6W7BkV9IOiuwy2IBf4vExYIPBxoo7Wxucz5WaG72L2qAlK2ySOhuBqG2OSgshkgV8EEXtYGKJYAoOpkfCaKaCXR3R3G8d1DAwlBdT7we+YAVrlDn9avGUPn1+fjOWFjwtrQIjTAtBtF+4jJhiZ3a3RlXUHARdKuhH2r7Jp+WrtHYjcsSXTviNhJ9LX5R7QWoiu4WCKJG2Vo9gO4QrFIp1UnzsV4PcVc3G9WR12uq+WtYWq9mD1muV8pMmJmNLtsUahD9ED198sqzm12rLiTLAsbRmtuEmsW3qQyOSq+aNUOO02jeCYI8lmTNnu/Iq7gWloKB7nboxYiBWVDxWllXfU13c+BrSpOtgV6XIorUBEMpxs9sh53w5F3oX+LAwd/sh7kTRgfJy0AFdUFXsuOSIKKm3z1kp9xPCvRkNykAeWnSbtY5JrQinDBdFakjAZBSj0ycn+SZNckoxUqjaAQSNvPh1grgicFAKk1glKUb3Oq+F4Ji5a4h2BbJsQRsIwTrBEiqF/mEunoRAspyla3JyvHaXvhQIUxBtTAPNTVjH2QCPNcMWOQGlc5wpJyaz7t/O3GExoC3Bubv+pTzb50vWKdSpBDwL6wRappDAkvse9F1Im3o3uMin9icwnaq4AQ6wK2d89+YTaXg3hhvAjEeDEgRBspZ7AfzSX1wiS+FRL1xb7IZmGIGVKULvZJoosIdzypST8Z+cU3A521ywZkCwQ3OC38izKCpJmOWiioFcFfNEhLLBpgIcNFQ5V2I2ce8hqXI51xYpNYjvRkzgJa994lPDcQk0eeam0rQhK/jooMJ7lNuFKsFIg1IICHL4G7LALeSgLrxovpgA2ssUCWkVgGxb4JM0dLFXjHFXO3uNmpSTDO98sNUowgyjbPnhL10ebbbHI/eGtEvOUR2D/FcfvOyetG7EEqYHki5WD7yN4CKG7l8YN2XD044TvQuYjWYD/Nxz6l2nL+WI7XF3ubFXH7tsgagR0uxiZ5hezVJFQHONfkCXkRkR40BEbuE2ImH+YuCcAC5JfxLnCy/KUgWavm+xWwtu7i2KVED6jU1LHcVROIP+YmFKaUhHyMd7BNIEk699f4aCuXyYcLj8mG9jfsBF+i582HsmQD5vkr5+WG5HK7x3gL5dxl7Nl9uLz9nLJfWbs9eqO53V7WXn0eWS9s52uN7jE7EYkG5vfzcslzK95MbVe8DkH+z2bsL9Kr3G8jlnvTE+w90ivby/Z3z2TsD9Kr3Jcjlhsyz6+977N0Dcnv5eWm5/LGKf72qvI29y0Cuy89Vy+UuLsF/Wgr5lzOd6lXvV4iXhtT6k+VvZ+2nq97XIJfrFO1zUrS/n+kkXfV+C7m8+Bz2D6vay899y6U9TXUfs6pcq2ovPx8ul6YUzzEry1+q2svPd8rlvSWp+5d//61qLz9/IZeZ55D/96rxKz9XI5f+fsn46vH4pKq9/PyTXG7Rnb3/51Xt5efc5bI6K7X+5N8Lqvby8/By2aU7+/h5B/6yFe/tkJ+7yl2WWt9q+x3CZ3EU7eXnuUqW9cz+nzOe5Pby81qlrP0u/dntj43TFe3l58wsK1hdnxi/yn5lOg+q+pefL7OyB7/36c7Of6YuuX38+Y3W5HGqZT8ze6FKvH/WPkdurzu7/w1k/atfcCG3z9OYf5SlPtXzMax97sD440rkWXh1/MlUyq74Na5lz6eOObv/9ddoX/xP1u85/Pf/ADu6WgIYxAAA'
bin = gzip.decompress(base64.b64decode(gz))
with open(pymain, "wb") as f:
f.write(bin)
os.chmod(pymain, 0o775)
| 0 | null | 57,497,857,109,530 | 249 | 117 |
import math
from functools import reduce
def getD(num):
input_list = [2 if i % 2 == 0 else i for i in range(num+1)]
input_list[0] = 0
bool_list = [False if i % 2 == 0 else True for i in range(num+1)]
sqrt = int(math.sqrt(num))
for serial in range(3, sqrt + 1, 2):
if bool_list[serial]:
for s in range(serial ** 2, num+1, serial):
if bool_list[s]:
input_list[s] = serial
bool_list[s] = False
return input_list
N = int(input())
A = list(map(int, input().split()))
D = getD(max(A))
pairwise_coprime = True
use_divnum = set()
for i in range(N):
k = A[i]
while k != 1:
if D[k] in use_divnum:
pairwise_coprime = False
break
else:
use_divnum.add(D[k])
div = D[k]
while k % div == 0 and k > 1:
k = k // div
if pairwise_coprime:
print("pairwise coprime")
exit()
from math import gcd
gcd_of_a = A[0]
for i in range(N):
gcd_of_a = gcd(gcd_of_a, A[i])
if gcd_of_a == 1:
print("setwise coprime")
else:
print("not coprime")
| import math
def div(s):
i=1
while(i<=math.sqrt(s)):
if(s%i==0):
if(s//i==i):
if(i!=1):
if(i in d):
return False
else:
d[i]=1
else:
if(i!=1):
if(i in d):
return False
else:
d[i]=1
if(s//i!=1):
if(s//i in d):
return False
else:
d[s//i]=1
i+=1
#print(d,s)
return True
n=int(input())
l=list(map(int,input().split()))
d=dict()
setwise=False
pairWise=True
pairWise&=div(l[0])
pairWise&=div(l[1])
val=math.gcd(l[0],l[1])
for i in range(2,n):
pairWise&=div(l[i])
val=math.gcd(val,l[i])
if(pairWise):
print('pairwise coprime')
elif(val==1):
print('setwise coprime')
else:
print('not coprime')
| 1 | 4,161,481,757,586 | null | 85 | 85 |
import math
N = int(input())
P = list(map(int, input().split()))
Q = list(map(int, input().split()))
a, b = 0, 0
A, B = set(), set()
for i in range(N):
n = N - i - 1
m = P[i] - i - 1
for ai in A:
if ai < P[i]:
m -= 1
a += m * math.factorial(n)
A.add(P[i])
for i in range(N):
n = N - i - 1
m = Q[i] - i - 1
for bi in B:
if bi < Q[i]:
m -= 1
b += m * math.factorial(n)
B.add(Q[i])
print(abs(a - b)) | from sys import stdin
s = int(stdin.readline().rstrip())
h = s//3600
m = (s%3600)//60
sec = (s%3600)%60
print("{}:{}:{}".format(h, m, sec))
| 0 | null | 50,259,448,853,998 | 246 | 37 |
a, b, c = map(int, input().split())
if a > b:
if b > c:
print("{} {} {}".format(c, b, a))
else:
if a > c:
print("{} {} {}".format(b, c, a))
else:
print("{} {} {}".format(b, a, c))
else:
if a > c:
print("{} {} {}".format(c, a, b))
else:
if b > c:
print("{} {} {}".format(a, c, b))
else:
print("{} {} {}".format(a, b, c))
| n = int(input())
a = list(map(int, input().split()))
x = 1
if 0 in a:
x = 0
else:
for i in range(n):
if x != -1:
x = x * a[i]
if x > 10 ** 18:
x = -1
print(x) | 0 | null | 8,233,542,530,500 | 40 | 134 |
n, k = map(int, input().split())
li_a = list(map(int, input().split()))
for idx, v in enumerate(li_a):
if idx <= (k - 1):
pass
else:
if v > li_a[idx - k]:
print('Yes')
else:
print('No')
| from sys import stdin,stdout
n,k=map(int,stdin.readline().split())
a=list(map(int,stdin.readline().split()))
for i in range(k,n):
print('Yes' if a[i]>a[i-k] else 'No') | 1 | 7,128,825,942,820 | null | 102 | 102 |
s,t=raw_input().split()
print t+s | def resolve():
a,b = map(int,input().split())
A = str(a)*b
B = str(b)*a
print(A if A<B else B)
resolve() | 0 | null | 94,155,486,879,610 | 248 | 232 |
mod = 998244353
n,s = map(int, input().split())
a = list(map(int, input().split()))
table = [0]*(s+1)
table[0] = 1
ans = 0
for ai in a:
nxt = [0]*(s+1)
if ai <= s:
for j in range(ai, s+1):
nxt[j] = table[j-ai]
table = [(2*table[i] + nxt[i])%mod for i in range(s+1)]
ans += table[-1]
ans %= mod
print(ans)
| import sys
A,B,K = map(int,input().split())
if not ( 0 <= A <= 10**12 and 0 <= B <= 10**12 and 0 <= K <= 10**12 ): sys.exit()
if not ( isinstance(A,int) and isinstance(B,int) and isinstance(K,int) ): sys.exit()
if K >= A:
if (K - A) >= B:
B = 0
elif (K - A) < B:
B = B - (K - A)
A = 0
elif K < A:
A = A - K
print(A,B) | 0 | null | 60,867,467,160,070 | 138 | 249 |
A, B, K = map(int, input().split())
if A >= K:
a = A - K
b = B
else:
if K <= A + B:
a = 0
b = B - (K - A)
else:
a = 0
b = 0
print(a, b)
| from itertools import accumulate
h,w,k=map(int,input().split())
s=[[0]*(w+1)]+[[0]+[int(i) for i in input()] for _ in range(h)]
for i in range(h+1):
s[i]=list(accumulate(s[i]))
for j in range(w+1):
for i in range(h):
s[i+1][j]+=s[i][j]
ans=10**18
for i in range(1<<h-1):
a=[]
for j in range(h-1):
if (i>>j)&1:a+=[j+1]
a+=[h]
cnt=len(a)-1
q=1
for j in range(1,w+1):
p=0
flag=0
for l in a:
if s[l][j]-s[l][j-1]-s[p][j]+s[p][j-1]>k:flag=1
elif s[l][j]-s[l][q-1]-s[p][j]+s[p][q-1]>k:
q=j
cnt+=1
break
else:p=l
if flag:break
else:
ans=min(cnt,ans)
print(ans) | 0 | null | 76,137,932,034,190 | 249 | 193 |
class Calc:
def __init__(self, max_value, mod):
"""combination(max_value, all)"""
fact = [-1] * (max_value + 1)
fact[0] = 1
fact[1] = 1
for x in range(2, max_value + 1):
fact[x] = x * fact[x - 1] % mod
invs = [1] * (max_value + 1)
invs[max_value] = pow(fact[max_value], mod - 2, mod)
for x in range(max_value - 1, 0, -1):
invs[x] = invs[x + 1] * (x + 1) % mod
self.fact = fact
self.invs = invs
self.mod = mod
def combination(self, n, r):
if n - r < r:
return self.combination(n, n - r)
if r < 0:
return 0
if r == 0:
return 1
if r == 1:
return n
return self.fact[n] * self.invs[r] * self.invs[n - r] % self.mod
def factorial(self, n):
return self.fact[n]
def main():
MOD = 10 ** 9 + 7
N, K = map(int, input().split())
K = min(K, N - 1) # K=最大空室数->N部屋空室は不可能
calc = Calc(max_value=N * 2, mod=MOD)
ans = 0
for v in range(K + 1): # 空室数
ans = (ans + (calc.combination(N, v) * calc.combination(v + (N - v) - 1, v)) % MOD) % MOD
print(ans)
if __name__ == '__main__':
main()
| N = int(input())
print('ACL' * N) | 0 | null | 34,435,205,907,748 | 215 | 69 |
n,k=map(int,input().split())
L=list(range(n+1))
cnt=0
ans=0
def calc(i):
smallest=(i-1)*i//2
largest=(2*n-i+1)*i//2
return largest-smallest+1
for i in range(k,n+2):
cnt+=calc(i)
cnt%=(10**9+7)
print(cnt) | n, k = map(int, input().split(" "))
MOD = (10**9) + 7
def dSum(s, e):
s -= 1
_s = s * (s + 1) // 2
_e = e * (e + 1) // 2
return _e - _s
ans = 0
for i in range(k, n + 1):
# _sum = dSum(n - i - 1, n) - dSum(0, i - 1) + 1
ans += dSum(i, n) - dSum(0, n - i) + 1
print((ans + 1) % MOD)
| 1 | 33,061,488,420,292 | null | 170 | 170 |
import math
H = int(input())
l = math.log(H,2)
ll = math.floor(l)+1
ans = 2 ** ll -1
print(ans) | def attacks(HP, times=1):
if HP==0: return times-1
HP //= 2
times *= 2
return attacks(HP,times)
h=int(input())
print(attacks(h))
| 1 | 80,316,199,803,598 | null | 228 | 228 |
n = int(input())
sumOfN = sum(int(i) for i in list(str(n)))
print("No" if sumOfN%9 else "Yes") | from sys import stdin
import math
inp = lambda : stdin.readline().strip()
a = list(inp())
a2 = [int(x) for x in a]
if sum(a2) % 9 == 0:
print("Yes")
else:
print("No") | 1 | 4,430,609,039,968 | null | 87 | 87 |
n, k = map(int, input().split())
A = [*map(int, input().split())]
for i in range(n-k): print('Yes' if A[i] < A[i+k] else 'No')
| mod = 10 ** 9 + 7
n = int(input())
a = map(int, input().split())
cnt = [0] * (n + 1)
cnt[-1] = 3
ret = 1
for x in a:
ret = ret * cnt[x - 1] % mod
cnt[x - 1] -= 1
cnt[x] += 1
print(ret)
| 0 | null | 68,378,444,267,438 | 102 | 268 |
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
def main():
a, b, m =[int(i) for i in input().split(" ")]
res = 0
for i in range(a, b + 1):
if m % i == 0:
res += 1
print(res)
if __name__ == '__main__':
main() | # coding: utf-8
# ?????????????????¨????????????
class Dice(object):
def __init__(self):
# ????????¶???
self.dice = (2, 5), (3, 4), (1, 6) # x, y, z
self.ax = [[0, False], [1, False], [2, False]]
self.axmap = [0, 1, 2]
self.mm = {"N": (0, 2), "S": (2, 0), "E": (1, 2), "W": (2, 1), "R": (0, 1), "L": (1, 0)}
def rotate(self, dir):
def rot(k, r):
t = self.axmap[r]
self.axmap[k], self.axmap[r] = t, self.axmap[k]
self.ax[t][1] = not self.ax[t][1]
rot(*self.mm[dir])
def front(self): return self.value(0, True)
def rear(self): return self.value(0, False)
def right(self): return self.value(1, True)
def left(self): return self.value(1, False)
def top(self): return self.value(2, True)
def bottom(self): return self.value(2, False)
def value(self, ax, d):
a = self.ax[self.axmap[ax]]
return self.dice[a[0]][a[1] if d else not a[1]]
if __name__=="__main__":
dice = Dice()
labels = input().split()
q = int(input())
def tf(p, f, d):
for _ in range(4):
if p==f(): break
dice.rotate(d)
for _ in range(q):
a, b = input().split()
p = labels.index(a) + 1
f = dice.top
tf(p, f, "N")
tf(p, f, "E")
p = labels.index(b) + 1
f = dice.front
tf(p, f, "R")
print(labels[dice.right()-1]) | 0 | null | 406,466,962,880 | 44 | 34 |
n,r = map(int, input().split())
if n>10: print(r)
else: print(int(100*(10-n)+r)) | def A():
x = int(input())
if x >= 30:
print("Yes")
else:
print("No")
A() | 0 | null | 34,568,724,845,142 | 211 | 95 |
from math import floor
from fractions import Fraction
a,b = input().split()
a = int(a)
b = Fraction(b)
print(floor(a*b)) | import math
a,b,c,d = map(int,input().split())
def death_time(hp,atack):
if hp%atack == 0:
return hp/atack
else:
return hp//atack + 1
takahashi_death = death_time(a,d)
aoki_death = death_time(c,b)
if aoki_death<=takahashi_death:
print("Yes")
else:
print("No") | 0 | null | 23,237,421,354,602 | 135 | 164 |
import sys
(a, b, c) = [int(i) for i in sys.stdin.readline().split()]
count = 0
for i in range(a, b + 1):
if c % i == 0:
count += 1
print(count) | import os, sys, re, math
import itertools
N = int(input())
P = tuple([int(n) for n in input().split()])
Q = tuple([int(n) for n in input().split()])
nums = [n for n in range(1, N + 1)]
patterns = itertools.permutations(nums, N)
i = 0
for pattern in patterns:
if pattern == P:
pi = i
if pattern == Q:
qi = i
i += 1
print(abs(pi - qi)) | 0 | null | 50,404,255,366,374 | 44 | 246 |
# coding: utf-8
import sys
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
N, R = lr()
answer = R
if N < 10:
answer += (10-N) * 100
print(answer)
| def main():
N, R = map(int, input().split())
X = R + max(0, 100 * (10 - N))
print(X)
if __name__ == '__main__':
main()
| 1 | 63,178,130,636,900 | null | 211 | 211 |
def resolve():
N = int(input())
ans = ""
while N > 0:
rem = N % 26
rem = 25 if rem == 0 else rem - 1
ans = chr(ord("a")+rem) + ans
N = (N-1) // 26
print(ans)
if '__main__' == __name__:
resolve() | import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
def main():
N,T,*ab = map(int, read().split())
AB = []
for a, b in zip(*[iter(ab)]*2):
AB.append((a, b))
AB.sort()
dp = [[0] * (T+1) for _ in range(N+1)]
ans = 0
for i in range(N):
w_i, v_i = AB[i]
for j in range(T):
if j < w_i:
dp[i+1][j] = dp[i][j]
else:
dp[i+1][j] = max(dp[i][j - w_i] + v_i, dp[i][j])
ans = max(ans, dp[i][T-1] + v_i)
print(ans)
if __name__ == "__main__":
main()
| 0 | null | 81,514,509,890,088 | 121 | 282 |
import sys
sys.setrecursionlimit(10**6)
def dfs(GF,group,gn,i):
size = 1
group[i]=gn
for node in GF[i]:
if group[node]==-1:
group[node]=gn
size+=dfs(GF,group,gn,node)
return size
def main():
from sys import stdin
n,m,k = map(int,stdin.readline().rstrip().split())
F=[]
for _ in range(m):
F.append(list(map(int,stdin.readline().rstrip().split())))
GF = [[] for _ in range(n+1)]
for a,b in F:
GF[a].append(b)
GF[b].append(a)
B=[]
for _ in range(k):
B.append(list(map(int,stdin.readline().rstrip().split())))
GB = [[] for _ in range(n+1)]
for a,b in B:
GB[a].append(b)
GB[b].append(a)
U = []
group= [-1]*(n+1)
gn = 0
for i in range(1,n+1):
if group[i] == -1:
sz = dfs(GF,group,gn,i)
gn+=1
U.append(sz)
for i in range(1,n+1):
g = group[i]
ans = U[g]-1-len(GF[i])
for b in GB[i]:
if group[b]==g:
ans-=1
print(ans,end=" ")
main() | N,M,K=map(int,input().split())
par=[0]*(N+1)
num=[0]*(N+1)
group = [1]*(N+1)
for i in range(1,N+1): par[i]=i
def root(x):
if par[x]==x: return x
return root(par[x])
def union(x,y):
rx = root(x)
ry = root(y)
if rx==ry: return
par[max(rx,ry)] = min(rx,ry)
group[min(rx,ry)] += group[max(rx,ry)]
def same(x,y):
return root(x)==root(y)
for _ in range(M):
a,b=map(int,input().split())
union(a,b)
num[a]+=1
num[b]+=1
for _ in range(K):
c,d=map(int,input().split())
if same(c,d):
num[c]+=1
num[d]+=1
for i in range(1,N+1):
print(group[root(i)]-num[i]-1,end=" ") | 1 | 61,538,063,242,712 | null | 209 | 209 |
from time import *
from random import *
t=time()
T0,T1=2000,600
Tt=2000
D=int(input())
C=list(map(int,input().split()))
S=[list(map(int,input().split())) for i in range(D)]
X=[0]*26
XX=[0]*26
P=[]
for i in range(D):
for j in range(26):
X[j]+=C[j]
XX[j]+=X[j]
P.append([])
for j in range(26):
P[i].append(j)
P[i].sort(reverse=True,key=lambda x:X[x]+S[i][x])
XX[P[i][0]]-=X[P[i][0]]
X[P[i][0]]=0
SC,SC2=0,0
for i in range(D):
SC+=S[i][P[i][0]]
YY=[]
Y=[]
A,B=0,0
e=0
E=1
for i in range(50):
e+=E
E*=1/(i+1)
def f(x):
global e,Tt
if x>=0:
return True
else:
return randrange(0,10000000)<=pow(e,x/Tt)
for l in range(12):
for k in range(25):
for i in range(D):
SC2=SC
YY=XX[:]
Y=X[:]
SC2-=S[i][P[i][0]]
SC2+=S[i][P[i][k+1]]
for j in range(26):
Y[j]=0
YY[P[i][0]],YY[P[i][k+1]]=0,0
for j in range(D):
if j==i:
Z=P[j][k+1]
else:
Z=P[j][0]
Y[P[i][0]]+=C[P[i][0]]
Y[P[i][k+1]]+=C[P[i][k+1]]
Y[Z]=0
YY[P[i][0]]+=Y[P[i][0]]
YY[P[i][k+1]]+=Y[P[i][k+1]]
if f((SC2-sum(YY))-(SC-sum(XX))):
P[i].insert(0,P[i][k+1])
del P[i][k+2]
XX=YY[:]
SC=SC2
for i in range(D-1):
SC2=SC
YY=XX[:]
Y=X[:]
A=i
B=randrange(A+1,D)
SC2-=S[A][P[A][0]]+S[B][P[B][0]]
SC2+=S[A][P[B][0]]+S[B][P[A][0]]
for j in range(26):
Y[j]=0
YY[P[A][0]],YY[P[B][0]]=0,0
for j in range(D):
if j==A:
Z=P[B][0]
elif j==B:
Z=P[A][0]
else:
Z=P[j][0]
Y[P[A][0]]+=C[P[A][0]]
Y[P[B][0]]+=C[P[B][0]]
Y[Z]=0
YY[P[A][0]]+=Y[P[A][0]]
YY[P[B][0]]+=Y[P[B][0]]
if f((SC2-sum(YY))-(SC-sum(XX))):
P[A],P[B]=P[B][:],P[A][:]
XX=YY[:]
SC=SC2
Tt=pow(T0,1-(time()-t))*pow(T1,time()-t)
for i in range(D):
print(P[i][0]+1) | from operator import itemgetter
N,M = map(int,input().split())
PS = [list(map(str,input().split())) for i in range(M)]
for i in range(M) :
PS[i][0] = int(PS[i][0])
submits = [["null"] for i in range(N)]
for i in range(M) :
submits[PS[i][0]-1][0] = PS[i][0]-1
submits[PS[i][0]-1].append(PS[i][1])
ac = 0
pena = 0
for i in range(len(submits)) :
if submits[i][0] == "null" :
continue
flag = False
wabuf1 = 0
for j in range(1,len(submits[i])) :
if submits[i][j] == "AC" :
ac += 1
flag = True
break
else :
wabuf1 += 1
if flag == True :
pena += wabuf1
print(ac,pena) | 0 | null | 51,387,387,080,302 | 113 | 240 |
H, W, M = map(int, input().split())
row=[0]*H #x座標を入れるっちゅうかカウント
col=[0]*W #y座標を入れる
mat=[] #座標を入れる
for i in range(M):
h, w = map(int, input().split())
row[h-1]+=1
col[w-1]+=1
mat.append((h-1,w-1))
r=max(row)
c=max(col)
rr=[1 if row[i]==r else 0 for i in range(H)] #maxな列のインデックス
cc=[1 if col[i]==c else 0 for i in range(W)] #maxな行のインデックス
x=0 #maxな列と行の交差点にある爆弾の個数をカウント
for k in mat:
if rr[k[0]]==1 and cc[k[1]]==1:
x+=1
if sum(rr)*sum(cc)==x: #行と列の全ての交差点に爆弾があれば-1する
print(r+c-1)
else:
print(r+c) | from collections import defaultdict as ddict
h,w,m=map(int,input().split())
xs=[0]*w
ys=[0]*h
xsmx=ysmx=0
pts=set()
for _ in range(m):
y,x=map(int,input().split())
x,y=x-1,y-1
xs[x]+=1
ys[y]+=1
pts.add((x,y))
xsmx=max(xsmx,xs[x])
ysmx=max(ysmx,ys[y])
xsc=[x for x in range(w) if xs[x]==xsmx]
ysc=[y for y in range(h) if ys[y]==ysmx]
ans=xsmx+ysmx-1
ok=False
for y in ysc:
for x in xsc:
if (x,y) not in pts:
ans+=1
ok=True
break
if ok:
break
print(ans)
| 1 | 4,733,993,537,788 | null | 89 | 89 |
import bisect
N = int(input())
Kaijo = [1 for _ in range(N)]
for i in range(2,N+1):
Kaijo[-i] = Kaijo[1-i]*i
#print(Kaijo)
L = [i+1 for i in range(N)]
P = list(map(int,input().split()))
PN = 0
for i in range(N-1):
k = bisect.bisect_left(L, P[i])
L.remove(P[i])
PN += k*Kaijo[i+1]
#print(PN)
L = [i+1 for i in range(N)]
Q = list(map(int,input().split()))
QN = 0
for i in range(N-1):
k = bisect.bisect_left(L, Q[i])
L.remove(Q[i])
QN += k*Kaijo[i+1]
ans = abs(PN-QN)
print(ans) | from itertools import permutations
from math import factorial
n = int(input())
p = tuple(map(int, input().split(' ')))
q = tuple(map(int, input().split(' ')))
l = [i for i in range(1, n+1)]
ls = list(permutations(l))
for i in range(factorial(n)):
if p==ls[i]:
a = i
if q==ls[i]:
b = i
print(abs(a-b)) | 1 | 100,213,407,241,882 | null | 246 | 246 |
from heapq import *
import sys
from collections import *
from itertools import *
from decimal import *
import copy
from bisect import *
import time
import math
def gcd(a,b):
if(a%b==0):return(b)
return (gcd(b,a%b))
N=int(input())
A=list(map(int,input().split()))
A=[[A[i],i] for i in range(N)]
A.sort(reverse=True)
dp=[[0 for i in range(N+1)] for _ in range(N+1)]
for n in range(N):
a,p=A[n]
for x in range(1,n+2):
y=n+1-x
dp[x][y]=max(dp[x][y],dp[x-1][y]+round(abs(x-1 - p))*a)
for y in range(1,n+2):
x=n+1-y
dp[x][y]=max(dp[x][y],dp[x][y-1]+round(abs(N-y - p))*a)
#print(dp)
print(max([dp[x][y] for x in range(N+1) for y in range(N+1) if x+y==N]))
| N = int(input())
As = list(map(int, input().split()))
dp = [[0] * (N-k+1) for k in range(N+1)]
s = 0
for i, A in sorted(enumerate(As), key = lambda t:t[1], reverse=True):
s += 1
for x in range(s+1):
y = s - x
if x > 0 and y > 0:
dp[x][y] = max(dp[x-1][y] + A * (i - x + 1), dp[x][y-1] + A * ((N-y) - i))
elif x == 0:
dp[x][y] = dp[x][y-1] + A * ((N-y) - i)
else:
dp[x][y] = dp[x-1][y] + A * (i - x + 1)
ans = max((dp[x][N-x] for x in range(N+1)))
print(ans) | 1 | 33,781,086,617,190 | null | 171 | 171 |
N, R = map(int, input().split())
ans = R + 100*max(0, (10-N))
print(ans) | def gcd(a, b):
while b:
a, b = b, a%b
return a
x, y = map(int,input().split())
print(gcd(x, y)) | 0 | null | 31,789,603,211,392 | 211 | 11 |
from itertools import *
from collections import *
from functools import *
def isqrt(n):
if n > 0:
x = 1 << (n.bit_length() + 1 >> 1)
while True:
y = (x + n // x) >> 1
if y >= x:
return x
x = y
elif n == 0:
return 0
else:
raise ValueError
def qrime():
yield from [2, 3, 5, 7]
q = [i for i in range(1, 210, 2) if 0 not in (i%3, i%5, i%7)]
yield from q[1:]
for i in count(210, 210):
for j in q:
yield i + j
def factor(n):
p = Counter()
limit = isqrt(n)
for q in qrime():
if q > limit:
break
while n % q ==0:
p[q] += 1
n //= q
if q in p:
limit = isqrt(n)
if n != 1:
p[n] += 1
return p
def divisor(n):
p, m = zip(*factor(n).items())
for c in product(*map(lambda x:range(x+1), m)):
yield reduce(int.__mul__, (x**y for x, y in zip(p, c) if y), 1)
N = int(input())
ans = reduce(int.__mul__, (c+1 for c in factor(N-1).values()), 1) - 1
for d in divisor(N):
if d == 1:
continue
n = N
while n % d == 0:
n //= d
if n % d == 1:
ans += 1
print(ans)
| N = int(input())
def divisor(n):
res = []
for i in range(1, int(n**0.5)+1):
if n%i!=0: continue
res.append(i)
if i*i != n: res.append(n//i)
return res
ans = 0
d = []
for x in divisor(N):
if x==1: continue
tmp = N
while tmp%x==0: tmp //= x
tmp %= x
if tmp == 1: ans += 1
ans += len(divisor(N-1)) - 1
print(ans) | 1 | 41,211,739,557,660 | null | 183 | 183 |
from sys import stdin
import sys
import math
from functools import reduce
import functools
import itertools
@functools.lru_cache(None)
def aa(k):
if k > 1: return 2*aa(k//2) + 1
return 1
h = int(stdin.readline().rstrip())
print(aa(h)) | h = int(input())
cnt = -1
while h > 0:
h //= 2
cnt += 1
ans = 2**(cnt+1) - 1
print(ans) | 1 | 80,087,654,391,648 | null | 228 | 228 |
"""
時間がかかる料理は、食べるとしたら最後に食べるのがベスト。
逆にいうと、その料理を食べるかどうかを検討する段階ではほかの料理は食べるかどうかの検討は終わっている状態。
なので、食べるのにかかる時間でソートしてナップサックすればよい。
"""
N,T = map(int,input().split())
AB = [list(map(int,input().split())) for _ in range(N)]
dp = [0]*(T)
AB.sort()
ans = 0
for i in range(N):
a,b = AB[i]
ans = max(ans,dp[-1]+b)
for j in range(T-1,-1,-1):
if j-a >= 0:
dp[j] = max(dp[j],dp[j-a]+b)
print(ans) | # coding:utf-8
n = int(input())
count = 0
for i in range(n):
d1, d2 = map(int, input().split())
if d1 == d2:
count += 1
else:
count = 0
if count == 3:
print('Yes')
exit()
print('No')
| 0 | null | 76,749,714,769,502 | 282 | 72 |
n = int(input())
s = [input() for _ in range(n)]
ans = set()
for i in s:
ans.add(i)
print(len(ans))
| n = int(input())
ans = set()
for _ in range(n):
ans.add(input())
print(len(ans)) | 1 | 30,369,820,531,588 | null | 165 | 165 |
X,K,D = map(int,input().split())
X = abs(X)
if X <= K * D :
if (K - X // D) % 2 == 1 :
answer = abs(X % D - D)
else :
answer = X % D
else :
answer = X - K * D
print(answer) | r = int(input())
print((r * 2) * 3.141592) | 0 | null | 18,214,123,768,932 | 92 | 167 |
def main():
from math import gcd
K = int(input())
ans = 0
for a in range(1, K+1):
for b in range(1, K+1):
g = gcd(a, b)
for c in range(1, K+1):
ans += gcd(g, c)
print(ans)
if __name__ == '__main__':
main()
| def gcd(x,y):
while y>0:
x,y = y,x%y
return x
K = int(input())
cnt = 0
for a in range(1,K+1):
for b in range(1,K+1):
for c in range(1,K+1):
x = a
x = gcd(x,b)
x = gcd(x,c)
cnt += x
print(cnt) | 1 | 35,584,255,139,844 | null | 174 | 174 |
#!/usr/bin/env python3
import sys
# import math
# import re # re.compile(pattern) => ptn obj; p.search(s), p.match(s), p.finditer(s) => match obj; p.sub(after, s)
# from collections import deque # deque class. deque(L): dq.append(x), dq.appendleft(x), dq.pop(), dq.popleft(), dq.rotate()
# from collections import defaultdict # subclass of dict. defaultdict(facroty)
# from collections import Counter # subclass of dict. Counter(iter): c.elements(), c.most_common(n), c.subtract(iter)
# from heapq import heapify, heappush, heappop # built-in list. heapify(L) changes list in-place to min-heap in O(n), heappush(heapL, x) and heappop(heapL) in O(lgn).
# from heapq import nlargest, nsmallest # nlargest(n, iter[, key]) returns k-largest-list in O(n+klgn).
# from itertools import count, cycle, repeat # count(start[,step]), cycle(iter), repeat(elm[,n])
# from itertools import groupby # [(k, list(g)) for k, g in groupby('000112')] returns [('0',['0','0','0']), ('1',['1','1']), ('2',['2'])]
# from itertools import starmap # starmap(pow, [[2,5], [3,2]]) returns [32, 9]
# from itertools import product # product(iter, repeat=n)
# from itertools import accumulate # accumulate(iter[, f])
# from functools import reduce # reduce(f, iter[, init])
# from functools import lru_cache # @lrucache ...arguments of functions should be able to be keys of dict
# from bisect import bisect_left, bisect_right # bisect_left(a, x, lo=0, hi=len(a)) returns i such that all(val<x for val in a[lo:i]) and all(val>-=x for val in a[i:hi]).
# from copy import deepcopy # to copy multi-dimentional matrix without reference
# from fractions import gcd # for Python 3.4
def main():
mod = 1000000007 # 10^9+7
inf = float('inf')
sys.setrecursionlimit(10**6) # 1000 -> 1000000
def input(): return sys.stdin.readline().rstrip()
def ii(): return int(input())
def mi(): return map(int, input().split())
def mi_0(): return map(lambda x: int(x)-1, input().split())
def lmi(): return list(map(int, input().split()))
def lmi_0(): return list(map(lambda x: int(x)-1, input().split()))
def li(): return list(input())
h, w, k = mi()
L = []
for _ in range(h):
L.append(list(map(int, li())))
L_trans = [[None] * h for _ in range(w)]
for i in range(h):
for j in range(w):
L_trans[j][i] = L[i][j]
d = 2 ** (h-1)
cost = [float('inf')] * d
for state in range(d):
bit_count = bin(state)[2:].count('1')
separated = [[0] * (bit_count + 1) for _ in range(w)]
for i in range(w):
current = 0
for j in range(h):
if j >= 1 and 1 << (j-1) & state:
current += 1
if L_trans[i][j]:
separated[i][current] += 1
previous = [0] * (bit_count + 1)
cnt = 0
# print(separated)
for i in range(w):
if any(map(lambda x: x > k, separated[i])):
break
if all(map(lambda x: x <= k, [elm + previous[ind] for ind, elm in enumerate(separated[i])])):
# print(f"just add: {previous} {separated[i]}")
for ind, elm in enumerate(separated[i]):
previous[ind] += elm # 追加
else:
cnt += 1
# print(f"count up: {previous} {separated[i]}")
for ind, elm in enumerate(separated[i]):
previous[ind] = elm # 上書き
else:
cost[state] = bit_count + cnt
# print(cost)
print(min(cost))
if __name__ == "__main__":
main()
| N = int(input())
A = ''.join(list(map(lambda x: format(int(x), '060b'), input().split(' '))))
mod = 10 ** 9 + 7
ans = 0
for n in range(60):
one = A[59-n::60].count('1')
ans = (ans + 2**n *one*(N-one))%mod
print(ans) | 0 | null | 85,700,525,463,648 | 193 | 263 |
def gcd(x, y):
if y == 0:
return x
else:
return gcd(y, x % y)
def main():
l, r = tuple(map(int, input().split(' ')))
print(gcd(l, r))
main()
| a, b = [int(tem) for tem in input().split()]
def mak(A, B) :
while B != 0 :
q, r = divmod(A, B)
A = int((A - r) / q)
B = r
return A
if a > b : print(mak(a, b))
else : print(mak(b, a)) | 1 | 8,164,560,292 | null | 11 | 11 |
n = int(input())
A = [0] * (n + 1)
for i in range(1, n + 1):
for j in range(i, n + 1, i):
A[j] += 1
print(sum(i * A[i] for i in range(1, n + 1))) | axis_1 = '0154' * 2 # 2 -> 3
axis_2 = '0253' * 2 # 4 -> 1
axis_3 = '3124' * 2 # 0 -> 5
right = [axis_3, axis_2[::-1], axis_1, axis_1[::-1], axis_2, axis_3[::-1], ]
a = list(map(int, input().split()))
n = int(input())
for _ in range(n):
top, front = map(a.index, map(int, input().split()))
x = '%d%d' % (top, front)
for i, axis in enumerate(right):
if x in axis:
print(a[i])
break
else:
print('------------------')
print(x) | 0 | null | 5,664,703,779,392 | 118 | 34 |
#A問題
S = input()
if S == "RRR":
print(3)
if S == "RRS"or S == "SRR" :
print(2)
if S == "RSR"or S == "RSS" or S == "SRS" or S == "SSR":
print(1)
if S == "SSS":
print(0) | N,K=map(int,input().split())
R,S,P=map(int,input().split())
T =input()
com = [0]*N
for i in range(N):
if i>=K and T[i]==T[i-K] and com[i-K]!=0:
continue
elif T[i] =="r":
com[i] =P
elif T[i] =="s":
com[i] =R
else:
com[i] =S
print(sum(com))
| 0 | null | 55,752,584,685,122 | 90 | 251 |
N,K=map(int,input().split())
A=list(map(int,input().split()))
point=[1]*N
for i in range(N-K):
if(A[K+i]>A[i]):
print("Yes")
else:
print("No")
| import numpy as np
def solve():
for i in range(K,N):
if A[i-K] < A[i]:
print("Yes")
else:
print("No")
if __name__ == "__main__":
N,K = list(map(int, input().split()))
A = list(map(int, input().split()))
solve()
| 1 | 7,133,053,860,748 | null | 102 | 102 |
from math import gcd
def lcm(a, b):
return a // gcd(a, b) * b
N, M = map(int, input().split())
As = list(map(int, input().split()))
rightmostbit = As[0] & -As[0]
for A in As[1:]:
if rightmostbit != A & -A:
print(0)
exit()
lcm_of_half_As = 1
for A in As:
lcm_of_half_As = lcm(lcm_of_half_As, A // 2)
if lcm_of_half_As > M:
break
print((M // lcm_of_half_As + 1) // 2) | from fractions import gcd
from functools import reduce
def lcm_base(x,y):
return (x*y)//gcd(x,y)
def lcm(A):
return reduce(lcm_base,A,1)
n,m=map(int,input().split())
A=list(map(int,input().split()))
num=lcm(A)
semi=num//2
ans=0
if any([True for i in range(n) if semi%A[i]==0]):print(0)
elif semi<=m:
ans +=1
m -=semi
ans +=m//num
print(ans)
else:print(0) | 1 | 102,034,683,726,238 | null | 247 | 247 |
def DFS(n = 1, A = [0], i = 0, d = [0], f = [0], time = 1):
for j in range(n):
if A[i][j] == 1 and d[j] == 0:
time = time + 1
d[j] = time
time = DFS(n, A, j, d, f, time)
time = time + 1
f[i] = time
return time
n = int(raw_input())
A = [0] * n
for i in range(n):
A[i] = [0] * n
for i in range(n):
value = map(int, raw_input().split())
u = value[0] - 1
k = value[1]
nodes = value[2:]
for j in range(k):
v = nodes[j] - 1
A[u][v] = 1
d = [0] * n
f = [0] * n
time = 0
for i in range(n):
if d[i] == 0:
time = time + 1
d[i] = time
time = DFS(n, A, i, d, f, time)
for i in range(n):
print(str(i + 1) + " " + str(d[i]) + " " + str(f[i])) | import time as ti
class MyQueue(object):
"""
My Queue class
Attributes:
queue: queue
head
tail
"""
def __init__(self):
"""Constructor
"""
self.length = 50010
self.queue = [0] * self.length
# counter = 0
# while counter < self.length:
# self.queue.append(Process())
# counter += 1
self.head = 0
self.tail = 0
# def enqueue(self, name, time):
def enqueue(self, process):
"""enqueue method
Args:
name: enqueued process name
time: enqueued process time
Returns:
None
"""
self.queue[self.tail] = process
# self.queue[self.tail].name = name
# self.queue[self.tail].time = time
self.tail = (self.tail + 1) % self.length
def dequeue(self):
"""dequeue method
Returns:
None
"""
# self.queue[self.head].name = ""
# self.queue[self.head].time = 0
self.queue[self.head] = 0
self.head = (self.head + 1) % self.length
def is_empty(self):
"""check queue is empty or not
Returns:
Bool
"""
if self.head == self.tail:
return True
else:
return False
def is_full(self):
"""chech whether queue is full or not"""
if self.tail - self.head >= len(self.queue):
return True
else:
return False
class Process(object):
"""process class
"""
def __init__(self, name="", time=0):
"""constructor
Args:
name: name
time: time
"""
self.name = name
self.time = time
def forward_time(self, time):
"""time forward method
Args:
time: forward time interval
Returns:
remain time
"""
self.time -= time
return self.time
def time_forward(my_queue, interval, current_time,):
"""
Args:
my_queue: queue
interval: time step interval
current_time: current time
"""
value = my_queue.queue[my_queue.head].forward_time(interval)
if value <= 0:
current_time += (interval + value)
print my_queue.queue[my_queue.head].name, current_time
my_queue.dequeue()
elif value > 0:
current_time += interval
# name, time = my_queue.queue[my_queue.head].name, \
# my_queue.queue[my_queue.head].time
my_queue.enqueue(my_queue.queue[my_queue.head])
my_queue.dequeue()
return current_time
my_queue = MyQueue()
n, q = [int(x) for x in raw_input().split()]
counter = 0
while counter < n:
name, time = raw_input().split()
my_queue.enqueue(Process(name, int(time)))
counter += 1
# end_time_list = []
current_time = 0
while not my_queue.is_empty():
current_time = time_forward(my_queue, q, current_time) | 0 | null | 23,120,352,668 | 8 | 19 |
N=str(input())
if '7' in N:
print("Yes")
else:
print("No") | def main():
""""ここに今までのコード"""
N, K = map(int, input().split())
dice_list = list(map(int, input().split()))
max, s = 0, 0
for i in range(K):
s += (dice_list[i] + 1) / 2
max = s
for i in range(N-K):
s -= (dice_list[i] + 1) / 2
s += (dice_list[i+K] + 1) / 2
if s > max:
max = s
print(max)
if __name__ == '__main__':
main() | 0 | null | 54,457,888,370,148 | 172 | 223 |
#!/usr/bin/env python3
import sys
sys.setrecursionlimit(10**6)
INF = 10 ** 9 + 1 # sys.maxsize # float("inf")
MOD = 998244353
def debug(*x):
print(*x, file=sys.stderr)
def solve(N, K, SS):
count = [0] * (N + 10)
count[0] = 1
accum = [0] * (N + 10)
accum[0] = 1
for pos in range(1, N):
ret = 0
for left, right in SS:
start = pos - right - 1
end = pos - left
ret += (accum[end] - accum[start])
ret %= MOD
count[pos] = ret
accum[pos] = accum[pos - 1] + ret
ret = count[N - 1]
return ret % MOD
def main():
# parse input
N, K = map(int, input().split())
SS = []
for i in range(K):
SS.append(tuple(map(int, input().split())))
print(solve(N, K, SS))
# tests
T1 = """
5 2
1 1
3 4
"""
TEST_T1 = """
>>> as_input(T1)
>>> main()
4
"""
T2 = """
5 2
3 3
5 5
"""
TEST_T2 = """
>>> as_input(T2)
>>> main()
0
"""
T3 = """
5 1
1 2
"""
TEST_T3 = """
>>> as_input(T3)
>>> main()
5
"""
T4 = """
60 3
5 8
1 3
10 15
"""
TEST_T4 = """
>>> as_input(T4)
>>> main()
221823067
"""
T5 = """
10 1
1 2
"""
TEST_T5 = """
>>> as_input(T5)
>>> main()
55
"""
def _test():
import doctest
doctest.testmod()
g = globals()
for k in sorted(g):
if k.startswith("TEST_"):
doctest.run_docstring_examples(g[k], g, name=k)
def as_input(s):
"use in test, use given string as input file"
import io
f = io.StringIO(s.strip())
g = globals()
g["input"] = lambda: bytes(f.readline(), "ascii")
g["read"] = lambda: bytes(f.read(), "ascii")
input = sys.stdin.buffer.readline
read = sys.stdin.buffer.read
if sys.argv[-1] == "-t":
print("testing")
_test()
sys.exit()
main()
| def resolve():
s = input()
n = len(s)
a = s[:n//2]
b = s[::-1][:n//2]
cnt = 0
for i in range(len(a)):
if a[i] != b[i]:
cnt += 1
print(cnt)
resolve() | 0 | null | 61,520,239,460,040 | 74 | 261 |
print("Yes" if input().count("7") != 0 else "No") | import math
k = int(input())
sum_gcd = 0
for a in range(1,k+1):
for b in range(1,k+1):
for c in range(1,k+1):
sum_gcd += math.gcd(math.gcd(a,b) , c)
print(sum_gcd) | 0 | null | 34,847,341,258,812 | 172 | 174 |
def f(x):
if x=="r":
return 2
elif x=="s":
return 0
else:
return 1
N,K=map(int,input().split())
L=list(map(int,input().split()))
T=["*"]+list(map(f,input()))
Z=[[0,0,0] for _ in range(N+1)]
for x in range(1,N+1):
for a in range(3):
if x<=K:
Z[x][a]=L[a]*(T[x]==a)
else:
b=(a+1)%3
c=(b+1)%3
Z[x][a]=max(Z[x-K][b],Z[x-K][c])+L[a]*(T[x]==a)
X=0
for i in range(1,K+1):
X+=max(Z[-i])
print(X) | import os
import sys
import numpy as np
def solve(N, K, S, P, R, T):
dp = np.zeros((N+1, 3), dtype=np.int64)
for i in range(1, N+1):
c = T[i]
dp[i, 0] = max(dp[i-K, 1], dp[i-K, 2]) + (c == "r") * R
dp[i, 1] = max(dp[i-K, 0], dp[i-K, 2]) + (c == "s") * S
dp[i, 2] = max(dp[i-K, 0], dp[i-K, 1]) + (c == "p") * P
#d = dp.max(1)
d = np.zeros(N+1, dtype=np.int64)
for i in range(N+1):
d[i] = dp[i].max()
ans = d[-K:].sum()
return ans
# >>> numba compile >>>
numba_config = [
[solve, "i8(i8,i8,i8,i8,i8,string)"],
]
if sys.argv[-1] == "ONLINE_JUDGE":
from numba import njit
from numba.pycc import CC
cc = CC("my_module")
for func, signature in numba_config:
vars()[func.__name__] = njit(signature)(func)
cc.export(func.__name__, signature)(func)
cc.compile()
exit()
elif os.name == "posix":
exec(f"from my_module import {','.join(func.__name__ for func, _ in numba_config)}")
else:
from numba import njit
for func, signature in numba_config:
vars()[func.__name__] = njit(signature, cache=True)(func)
print("compiled!", file=sys.stderr)
# <<< numba compile <<<
def main():
N, K = map(int, input().split())
S, P, R = map(int, input().split())
T = "_" + input()
ans = solve(N, K, S, P, R, T)
print(ans)
main()
| 1 | 106,425,153,757,220 | null | 251 | 251 |
a, b = map(int, input().split())
d = a/b
r = a%b
f = a/b
print("%d %d %.6f"%(d, r, f))
|
splited = input().split(" ")
f = int(splited[0])/int(splited[1])
r = int(splited[0])%int(splited[1])
d = int(splited[0])//int(splited[1])
print(d, r, "{0:.5f}".format(f)) | 1 | 593,617,667,340 | null | 45 | 45 |
import bisect
n=int(input())
l=sorted(list(map(int,input().split())))
ans=0
for i in range(n):
for j in range(i+1,n):
index=bisect.bisect_left(l,l[i]+l[j])
ans+=index-j-1
print(ans) | import itertools # accumulate, compress, permutations(nPr), combinations(nCr)
import bisect # bisect_left(insert位置), bisect_right(slice用)
# import math # factorical（階乗) # hypot(距離)
# import heapq
# from fractions import gcd # Python3.5以前 # lcm（最小公倍数） = (a*b)//gcd(a,b)
# from fractions import Fraction
# from math import gcd # Python3.6以降
# --------------------------------------------------------------
n = int(input())
bo = list(map(int,input().split()))
cnt = 0
bo.sort()
for a in range(n-1):
for b in range(a+1,n):
cnt += bisect.bisect_left(bo, bo[a]+bo[b]) - (b+1)
print(cnt) | 1 | 172,350,427,359,460 | null | 294 | 294 |
n=input()
if n.count('7')>0:
print('Yes')
else:
print('No') | n, m = map(int, input().split())
in_list = input().split()
vote_list = [int(i) for i in in_list]
ans = 0
for ai in vote_list:
if ai >= 1/(4*m)*sum(vote_list):
ans += 1
if ans < m :
print('No')
else:
print('Yes') | 0 | null | 36,597,482,315,040 | 172 | 179 |
n = input()
s = list(n)
sm = 0
for i in range(len(s)):
sm += int(s[i])
if sm%9 == 0:
print("Yes")
else:
print("No")
| n = int(input())
a = list(map(int, input().split()))
M = max(a)
biggest_prime = [0] * (M+10)
for i in range(2, M+10):
if biggest_prime[i] == 0:
biggest_prime[i] = i
for j in range(i*i, M+1, i):
biggest_prime[j] = i
def fact(n):
arr=[]
while n>1:
now=n
cnt=0
p=biggest_prime[now]
while now % p == 0:
now//=p
cnt+=1
arr.append([p,cnt])
n=now
return arr
from collections import defaultdict
cntd=defaultdict(int)
for i in range(len(a)):
lis = fact(a[i])
for num,cnt in lis:
if num==1:
continue
cntd[num]+=1
flg=False
for c in cntd.values():
if c==n:
print("not coprime")
exit()
if c>1:
flg=True
if flg:
print("setwise coprime")
else:
print("pairwise coprime") | 0 | null | 4,195,528,956,948 | 87 | 85 |
hoge = list(map(int, input().split()))
ret = sorted(hoge)
print(str(ret[0])+" "+str(ret[1])+" "+str(ret[2]))
|
X,Y = map(int,input().split())
key1 = Y - 2*X
key2 = 4*X - Y
if key1 % 2 != 0:
print('No')
elif key2 % 2 != 0:
print('No')
elif key1 < 0:
print('No')
elif key2 < 0:
print('No')
else:
print('Yes') | 0 | null | 7,042,151,038,120 | 40 | 127 |
import math
a,b,agree=map(float,input().split())
agree=math.radians(agree)
c=(a**2+b**2-2*a*b*math.cos(agree))**0.5
s=0.5*a*b*math.sin(agree)
l=a+b+c
h=b*math.sin(agree)
print("{0:.5f}".format(s))
print("{0:.5f}".format(l))
print("{0:.5f}".format(h))
| n,m=map(int,input().split())
sc=[list(map(int,input().split())) for _ in range(m)]
for x in range(1000):
sx=str(x)
if n!=len(sx):
continue
for s,c in sc:
if sx[s-1]!=str(c):
break
else:
print(x)
exit(0)
print(-1) | 0 | null | 30,621,888,236,602 | 30 | 208 |
a,b=map(int,input().split())
s=list(map(int,input().split()))
ans=0
s=sorted(s)
for i in range(b):
ans+=s[i]
print(ans)
| s, t = map(str, input().split())
x = t + s
print(x) | 0 | null | 57,039,059,518,148 | 120 | 248 |
N=int(input())
S={}
for n in range(N):
s=input()
S[s]=S.get(s,0)+1
maxS=max(S.values())
S=[k for k,v in S.items() if v==maxS]
print('\n'.join(sorted(S)))
| import collections
N=int(input())
S=[]
for i in range(N):
s=input()
S.append(s)
l=collections.Counter(S)
keys=l.keys()
k=max(l.values())
ans=[]
for i in keys:
if l[i]==k:
ans.append(i)
ans.sort()
n=len(ans)
for i in range(n):
print(ans[i]) | 1 | 69,736,206,106,582 | null | 218 | 218 |
S = input()
print("Yes" if S.count("A") and S.count("A") < 3 or S.count("B") and S.count("B") < 3 else "No") | s = input()
t = input()
n = len(s)
m = len(t)
ans = float("inf")
for i in range(n-m+1):
p = m
for j in range(m):
if s[i+j] == t[j]: p -= 1
if p < ans: ans = p
print(ans) | 0 | null | 29,041,272,339,200 | 201 | 82 |
n,k = map(int,input().split())
R,S,P = map(int,input().split())
T = input()
slist = ['']*k
for i in range(n):
slist[i%k] += T[i]
ans = 0
for s in slist:
dp = [[0,0,0]for i in range(len(s))]
#dp[i][j] = 直前にｊを出したときの得点の最大値
'''
0..r
1..s
2..p
'''
dp[0][1] = S if s[0] == 'p' else 0
dp[0][0] = R if s[0] == 's' else 0
dp[0][2] = P if s[0] == 'r' else 0
for i in range(1,len(s)):
if s[i] == 'r':
dp[i][2] = max(dp[i-1][0],dp[i-1][1]) + P
dp[i][1] = max(dp[i-1][0],dp[i-1][2])
dp[i][0] = max(dp[i-1][1],dp[i-1][2])
elif s[i] == 's':
dp[i][0] = max(dp[i-1][2],dp[i-1][1]) + R
dp[i][1] = max(dp[i-1][0],dp[i-1][2])
dp[i][2] = max(dp[i-1][1],dp[i-1][0])
else:
dp[i][1] = max(dp[i-1][2],dp[i-1][0]) + S
dp[i][0] = max(dp[i-1][1],dp[i-1][2])
dp[i][2] = max(dp[i-1][1],dp[i-1][0])
ans += max(dp[len(s)-1][0],dp[len(s)-1][1],dp[len(s)-1][2])
#print(slist)
print(ans)
| from sys import stdin
test = list(stdin.readline().rstrip())
result=0
for i in test:
result = result + int(i)
if (result % 9) == 0:
print('Yes')
else:
print('No')
| 0 | null | 55,868,210,363,072 | 251 | 87 |
l = input().split()
q = []
for e in l:
if e == '+':
q.append(q.pop() + q.pop())
elif e == '-':
q.append(-q.pop() + q.pop())
elif e == '*':
q.append(q.pop() * q.pop())
else:
q.append(int(e))
print(q[0]) | N,K = [int(i) for i in input().split()]
mod = 998244353
LR = []
S = []
dp = [0]*(N+1)
dps = [0]*(N+1)
dps[1] = 1
dp[1] = 1
for i in range(K):
LR.append([int(i) for i in input().split()])
for i in range(1,N+1):
for l,r in LR:
l,r = i - r,i - l
#print(l,r)
if r < 1:
continue
l = max(1,l)
dp[i] += dps[r] - dps[l-1]
dp[i] %= mod
#print(dp[i])
dps[i] = dps[i-1] + dp[i]
#print(dp, dps)
print(dp[-1]) | 0 | null | 1,361,007,796,510 | 18 | 74 |
INF = 10 ** 20
n, m = map(int, input().split())
c_lst = list(map(int, input().split()))
dp = [INF for _ in range(n + 1)]
dp[0] = 0
for coin in c_lst:
for price in range(coin, n + 1):
dp[price] = min(dp[price], dp[price - coin] + 1)
print(dp[n])
| H=int(input())
ans = 0
count = 0
while H>0:
H=int(H/2)
ans+=2**count
count+=1
print(ans) | 0 | null | 40,115,238,651,890 | 28 | 228 |
nums = []
while True:
num = [int(e) for e in input().split()]
if num[0]==0 and num[1]==0:
break
nums.append(num)
for i in range(len(nums)):
for j in range(len(nums[i])):
for k in range(j):
if nums[i][k] > nums[i][j]:
a = nums[i][k]
nums[i][k] = nums[i][j]
nums[i][j] = a
for i in range(len(nums)):
print(" ".join(map(str, nums[i])))
| while 1:
x, y = map(int, raw_input().split())
if x == y == 0:
break
else:
if x < y:
print "%d %d" % (x, y)
else:
print "%d %d" % (y, x) | 1 | 520,750,270,458 | null | 43 | 43 |
A = []
b = []
row, col = (int(x) for x in input().split())
for i in range(row):
A.append([int(x) for x in input().split()])
for i in range(col):
b.append(int(input()))
for i in range(row):
print(sum(A[i][j]*b[j] for j in range(col))) | H, W, M = map(int, input().split())
bomb = []
h_sum = [0]*W
w_sum = [0]*H
for _ in range(M):
h, w = map(int, input().split())
bomb.append((h,w))
h_sum[w-1] += 1
w_sum[h-1] += 1
max_h = max(h_sum)
max_w = max(w_sum)
target_cnt = h_sum.count(max_h)*w_sum.count(max_w)
for h, w in bomb:
if h_sum[w-1] == max_h and w_sum[h-1] == max_w:
target_cnt -= 1
if target_cnt == 0:
print(max_h+max_w-1)
else:
print(max_h+max_w) | 0 | null | 2,936,864,444,550 | 56 | 89 |
def main():
import sys
readline = sys.stdin.buffer.readline
n = int(readline())
d = list(map(int, readline().split()))
e = sum(d)
ans = 0
for i in d:
e -= i
ans += i*e
print(ans)
if __name__ == '__main__':
main() | def sep():
return map(int,input().strip().split(" "))
def lis():
return list(sep())
import sys
sys.setrecursionlimit(10**6)
n=int(input())
k=(n//500)*1000
t=((n%(500))//5)*5
print(k+t) | 0 | null | 105,693,061,752,992 | 292 | 185 |
x, y = map(int, input().split())
lst = []
ans = 'No'
for i in range(x):
lst.append(2)
for i in range(x):
if sum(lst) == y:
ans = 'Yes'
break
lst[i] = 4
if sum(lst) == y:
ans = 'Yes'
print(ans) | X,Y = map(int,input().split())
ans = False
for t in range(101):
for k in range(101):
if t+k == X and 2*t + 4*k == Y:
ans = True
if ans:
print("Yes")
else:
print("No") | 1 | 13,743,275,478,602 | null | 127 | 127 |
import sys
input = sys.stdin.readline
read = sys.stdin.read
n, t = map(int, input().split())
m = map(int, read().split())
AB = sorted(zip(m, m))
A, B = zip(*AB)
dp = [[0]*t for _ in range(n+1)]
for i, a in enumerate(A[:-1]):
for j in range(t):
if j < a:
dp[i+1][j] = dp[i][j]
else:
dp[i+1][j] = max(dp[i][j-a]+B[i], dp[i][j])
ans = 0
maxB = [B[-1]]*n
for i in range(n-2, 0, -1):
maxB[i] = max(B[i], maxB[i+1])
for i in range(n-1):
ans = max(ans, dp[i+1][-1] + maxB[i+1])
print(ans) | n = int(raw_input())
r = []
for i in range(n):
r.append(int(raw_input()))
min_v = r[0]
max_profit = -1000000000000
for i in range(1,n):
if max_profit < r[i] - min_v:
max_profit = r[i]-min_v
if r[i] < min_v:
min_v = r[i]
print max_profit | 0 | null | 75,979,144,754,160 | 282 | 13 |
def gcd(a,b):
while True:
# print(a,b)
if a >= b:
x = a
y = b
else:
x = b
y = a
mod = x%y
if mod == 0:
return y
else:
a = y
b = mod
A,B = list(map(int,input().split()))
ans = int(A*B / gcd(A,B))
print(ans) | import fractions
a,b = map(int,input().split())
def lcm(x,y):
z = int(x*y/fractions.gcd(x,y))
return z
print(lcm(a,b)) | 1 | 113,640,408,064,450 | null | 256 | 256 |
a,b,k=map(int,input().split())
if a>k:
a=a-k
b=b
elif a+b<=k:
b=0
a=0
elif a<=k:
b=b+(a-k)
a=0
print(a,b)
| N, D, A = map(int, input().split())
data = []
for _ in range(N):
data.append(tuple(map(int, input().split())))
data.sort()
queue = []
i = 0
j = 0
total = 0
height = 0
while i < N:
if j >= len(queue) or data[i][0] <= queue[j][0]:
x, h = data[i]
i += 1
if height < h:
count = (h - height + A - 1) // A
total += count
height += count * A
queue.append((x + D * 2, count * A))
else:
height -= queue[j][1]
j += 1
print(total)
| 0 | null | 93,237,834,671,904 | 249 | 230 |
# coding: utf-8
# Here your code !
count=0
def merge(A, left, mid, right):
global count
n1 = mid - left
n2 = right - mid
L = [0 for i in xrange(n1 + 1)]
R = [0 for i in xrange(n2 + 1)]
for i in xrange(n1):
L[i] = A[left + i]
for i in xrange(n2):
R[i] = A[mid + i]
L[n1] = 1<<32 - 1
R[n2] = 1<<32 - 1
i = 0
j = 0
for k in xrange(left, right):
count += 1
if L[i] <= R[j]:
A[k] = L[i]
i += 1
else:
A[k] = R[j]
j += 1
def mergeSort(A, left, right):
if left + 1 < right:
mid = (left + right) / 2
mergeSort(A, left, mid)
mergeSort(A, mid, right)
merge(A, left, mid, right)
if __name__ == "__main__":
n = int(raw_input())
refA = map(int, raw_input().split())
A = list(refA)
mergeSort(A, 0, n)
print " ".join(map(str,A))
print count | # coding: utf-8
# Your code here!
X,K,D=map(int,input().split())
move=min(abs(X)//D,K)
ans=abs(X)-move*D
if move==K:
print(ans)
else:
if (K-move)%2==0:
print(ans)
else:
print(abs(ans-D)) | 0 | null | 2,690,153,111,060 | 26 | 92 |
import random
import time
import copy
def down_score(d, c, last_d, score):
sum = 0
for i in range(26):
sum = sum + c[i]*(d-last_d[i])
return int(score - sum)
def main():
D = int(input())
c = list(map(int, input().split()))
s = [list(map(int, input().split())) for i in range(D)]
start = time.time()
last_d = [0 for i in range(26)]
ans = []
score1 = 0
for i in range(D):
max = 0
idx = 0
for j in range(26):
if max < (s[i][j] + c[j] * (i-last_d[j])*(i-last_d[j]+1)/2) and c[j] != 0:
max = s[i][j] + c[j] * (i-last_d[j])*(i-last_d[j]+1)/2
idx = j
elif max == (s[i][j] + c[j] * (i-last_d[j])*(i-last_d[j]+1)/2) and c[j] * (i-last_d[j])*(i-last_d[j]+1)/2 > c[idx]* (i-last_d[idx])*(i-last_d[idx]+1)/2 and c[j] != 0:
idx = j
last_d[idx] = i+1
score1 += s[i][idx]
score1 = down_score(i+1,c,last_d,score1)
ans.append(idx)
while time.time() - start < 1.9:
cp = ans.copy()
last_d = [0 for i in range(26)]
score2 = 0
idx1 = random.randint(0,25)
idx2 = random.randint(0,25)
idx3 = random.randint(0,25)
if random.randint(0,1):
d1 = random.randint(0,D-1)
d2 = random.randint(0,D-1)
d3 = random.randint(0,D-1)
if idx1 == idx2 or idx1 == idx3 or idx2 == idx3:
continue
if random.randint(0,1):
ans[d1] = idx1
elif random.randint(0,1):
ans[d1] = idx1
ans[d2] = idx2
else:
ans[d1] = idx1
ans[d2] = idx2
ans[d3] = idx3
#2値入れ替え
elif random.randint(0,1):
d1 = random.randint(0,D-8)
d2 = random.randint(d1+1,d1+7)
tmp1 = ans[d1]
tmp2 = ans[d2]
if random.randint(0,1):
ans[d1] = tmp2
ans[d2] = tmp1
#3値入れ替え
else:
d1 = random.randint(0,D-11)
d2 = random.randint(d1+1,d1+5)
d3 = random.randint(d2+1,d2+5)
tmp1 = ans[d1]
tmp2 = ans[d2]
tmp3 = ans[d3]
if random.randint(0,1):
ans[d1] = tmp2
ans[d2] = tmp3
ans[d3] = tmp1
else:
ans[d1] = tmp3
ans[d2] = tmp1
ans[d3] = tmp2
for i in range(D):
score2 += s[i][ans[i]]
last_d[ans[i]] = i+1
score2 = down_score(i+1, c, last_d, score2)
if score1 > score2:
ans = cp.copy()
else:
score1 = score2
for i in range(D):
print(ans[i]+1)
if __name__ == "__main__":
main()
| N, M, K = map(int, input().split())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
idx_B = M-1
m = sum(B)
an = M
ans = 0
for a in [0] + A:
m += a
while idx_B >= 0 and m > K:
m -= B[idx_B]
idx_B -= 1
an -= 1
if m > K:
break
if an > ans:
ans = an
an += 1
print(ans)
| 0 | null | 10,234,014,845,278 | 113 | 117 |
x,y,z =map(int,input().split())
t=0
t=x;x=y;y=t;
t=x;x=z;z=t;
print(x,y,z) | N = int(input())
S = input()
uns = 0
for d in range(1, (N - 1) // 2 + 1):
for i in range(N - 2 * d):
s, t, u = S[i], S[i + d], S[i + 2 * d]
if s != t and t != u and u != s:
uns += 1
r = S.count('R')
g = S.count('G')
b = N - r - g # = S.count('B')
ans = r * g * b - uns
print(ans) | 0 | null | 36,922,486,281,568 | 178 | 175 |
import bisect
N, M, X = map(int, input().split())
C = [0] * N
A = [0] * N
for i in range(N):
x = list(map(int, input().split()))
C[i] = x[0]
A[i] = [0] * M
for j in range(M):
A[i][j] = x[j + 1]
cnt = [0] * (2 ** N)
ans_list = []
for i in range(2 ** N):
bag = []
cnt[i] = [0] * M
for j in range(N):
if ((i >> j) & 1):
bag.append(C[j])
for k in range(M):
cnt[i][k] += A[j][k]
cnt[i].sort()
if bisect.bisect_left(cnt[i], X) == 0:
ans_list.append(sum(bag))
if ans_list == []:
print(-1)
else:
print(min(ans_list)) | import math
N,M,X = map(int,input().split())
#a[i][0]:price of the i-th book
a = [[] for i in range(N)]
for i in range(N):
a[i] = list(map(int,input().split()))
def is_greater(b):
for i in b:
if i < X:
return False
return True
cost = math.inf
for i in range(2**N):
b = [0]*(M+1)
for j in range(N):
if ((i >> j)&1):
for k in range(M+1):
b[k] += a[j][k]
if b[0] < cost and is_greater(b[1:]):
cost = b[0]
if cost == math.inf:
print(-1)
else:
print(cost) | 1 | 22,334,748,368,768 | null | 149 | 149 |
n=int(input())
s=input()
A=[]
for i in range(n):
A.append(s[i])
W=0
R=A.count('R')
ans=float('inf')
for i in range(n+1):
if i!=0:
if A[i-1]=='W':
W+=1
else:
R-=1
ans=min(max(W,R),ans)
print(ans) | from math import ceil
H,W,N = map(int, open(0).read().split())
m = max(H,W)
print(ceil(N/m)) | 0 | null | 47,717,790,521,930 | 98 | 236 |
s, t = input("").split(" ")
res = t + s
print(res) | ### ----------------
### ここから
### ----------------
import sys
from io import StringIO
import unittest
def yn(b):
print("Yes" if b==1 else "No")
return
def resolve():
readline=sys.stdin.readline
n,m=map(int, readline().rstrip().split())
ac=[0]*n
wa=[0]*n
for i in range(m):
p,s=readline().rstrip().split()
p=int(p)-1
if s=="AC":
ac[p]=1
continue
if ac[p]==0:
wa[p]+=1
for i in range(n):
wa[i]*=ac[i]
print(sum(ac),sum(wa))
return
if 'doTest' not in globals():
resolve()
sys.exit()
### ----------------
### ここまで
### ---------------- | 0 | null | 98,168,599,532,210 | 248 | 240 |
import sys
sys.setrecursionlimit(10 ** 9)
def solve(pick, idx):
if pick == 0: return 0
if idx >= n: return -float('inf')
if (pick, idx) in dp: return dp[pick, idx]
if n-idx+2 < pick*2: return -float('inf')
total = max(A[idx] + solve(pick-1, idx+2), solve(pick, idx+1))
dp[(pick, idx)] = total
return total
n = int(input())
A = list(map(int, input().split()))
dp = {}
pick = n//2
print(solve(pick, 0)) | N, M = map(int, input().split())
A = list(map(int, input().split()))
cnt = 0
thr = -(-sum(A)//(4*M))
for a in A:
if a >= thr:
cnt += 1
if cnt >= M:
print("Yes")
else:
print("No")
| 0 | null | 38,001,762,647,072 | 177 | 179 |
from collections import deque
import sys
input = sys.stdin.readline
def putsarray(array):
if len(array) == 0:
print()
return
for i in range(len(array) - 1):
print(int(array[i]), end=' ')
print(int(array[-1]))
def main():
stack = deque([])
instr = input()
is_same_lake = False
result = 0
lakes = deque([])
for i in range(len(instr)):
char = instr[i]
if char == "\\":
stack.append(i)
elif char == "_":
pass
elif char == "/":
if len(stack) == 0:
is_same_lake = False
continue
down = stack.pop()
result += i - down
lake_area = i - down
index = len(lakes) -1
while True:
if index < 0:
break
lake = lakes[index]
if down < lake[0] and lake[1] < i:
lake_area += lakes.pop()[2]
else:
break
index -= 1
lakes.append((down, i, lake_area))
print(int(result))
putsarray([len(lakes),] + [l[2] for l in lakes])
main()
| from collections import deque
from sys import stdin
A = input()
d = deque([])
e = deque([])
area = 0
areas = deque([])
for a,b in enumerate(A):
if b == "\\":
d.append(a)
elif b == "/" and d != deque([]):
x = d.pop()
area += a - x
areas.append([x,a,a-x])
menseki = 0
kaitou = []
prev_start,prev_end = 20000,0
while len(areas) > 0:
temp = areas.pop()
if temp[0] > prev_start and temp[1] < prev_end:
menseki += temp[2]
else:
if menseki != 0:
kaitou.append(menseki)
menseki = temp[2]
prev_start, prev_end = temp[0],temp[1]
if len(areas) == 0:
kaitou.append(menseki)
print(sum(kaitou))
kaitou.append(len(kaitou))
print(*kaitou[::-1])
| 1 | 58,221,328,360 | null | 21 | 21 |
x, y = map(int, input().split())
if y/2 != int(y/2):
print("No")
else:
p = 2*x - y/2
q = y/2 - x
if p >= 0:
if q >= 0:
print("Yes")
else:
print("No")
else:
print("No") | n,k=[int(x) for x in input().split()]
a=[int(x) for x in input().split()]
for i in range(n-k):
if a[i]<a[i+k]:
print("Yes")
else:
print("No") | 0 | null | 10,525,246,844,220 | 127 | 102 |
N = int(input())
ans = N % 10
if ans == 2 or ans == 4 or ans == 5 or ans == 7or ans == 9:
print("hon")
elif ans == 0 or ans == 1 or ans == 6 or ans == 8:
print("pon")
else:
print("bon") | def therefore():
hon = [2, 4, 5, 7, 9]
pon = [0, 1, 6, 8]
bon = [3]
N = input()
n = int(N[-1])
if n in hon:
print("hon")
elif n in pon:
print("pon")
elif n in bon:
print("bon")
therefore() | 1 | 19,354,535,754,880 | null | 142 | 142 |
N=input()
l=len(N)
if int(N[l-1]) in [2,4,5,7,9]:
print('hon')
elif int(N[l-1]) in [0,1,6,8]:
print('pon')
elif int(N[l-1]) in [3]:
print('bon') | N = int(input())
ans_ac = 0
ans_wa = 0
ans_tle =0
ans_re =0
for i in range(N):
S = input()
if S == 'AC':
ans_ac += 1
elif S == 'WA':
ans_wa += 1
elif S == 'TLE':
ans_tle += 1
else:
ans_re += 1
print('AC','x',ans_ac)
print('WA','x',ans_wa)
print('TLE','x',ans_tle)
print('RE','x',ans_re) | 0 | null | 14,061,590,272,700 | 142 | 109 |
from sys import stdin,stdout
def INPUT():return list(int(i) for i in stdin.readline().split())
def inp():return stdin.readline()
def out(x):return stdout.write(x)
import math
import random
########################################################
F=[1]*(10**6+1)
for i in range(2,10**6+1):
for j in range(i,10**6+1,i):
F[j]+=1
ans=0
n=int(input())
for c in range(1,n):
ans+=F[n-c]
print(ans)
| count=int(raw_input())
l=set()
for i in xrange(count):
a,b=raw_input().split()
if a=='insert':
l.add(b)
elif b in l:
print 'yes'
else:
print 'no' | 0 | null | 1,349,165,096,730 | 73 | 23 |
N = int(input())
S = []
T = []
for i in range(N):
s, t = input().split()
S.append(s)
T.append(int(t))
X = input()
print(sum(T[S.index(X)+1:]))
| from sys import stdin
rs = lambda : stdin.readline().strip()
ri = lambda : int(rs())
ril = lambda : list(map(int, rs().split()))
def main():
N = ri()
s = []
t = []
for i in range(N):
x, y = input().split()
s.append(x)
t.append(int(y))
X = rs()
a = sum(t)
b = 0
for x, y in zip(s, t):
b += y
if x == X:
break
print(a - b)
if __name__ == '__main__':
main()
| 1 | 96,951,199,112,988 | null | 243 | 243 |
from copy import copy
import random
import math
import sys
input = sys.stdin.readline
D = int(input())
c = list(map(int,input().split()))
s = [list(map(int,input().split())) for _ in range(D)]
last = [0]*26
ans = [0]*D
score = 0
for i in range(D):
ps = [0]*26
for j in range(26):
pl = copy(last)
pl[j] = i+1
ps[j] += s[i][j]
for k in range(26):
ps[j] -= c[k]*(i+1-pl[k])
idx = ps.index(max(ps))
last[idx] = i+1
ans[i] = idx+1
score += max(ps)
for k in range(1,35001):
na = copy(ans)
x = random.randint(1,365)
y = random.randint(1,365)
z = random.randint(min(x,y),max(x,y))
na[y-1] = na[x-1]
na[y-1] = na[z-1]
last = [0]*26
ns = 0
for i in range(D):
last[na[i]-1] = i+1
ns += s[i][na[i]-1]
for j in range(26):
ns -= c[j]*(i+1-last[j])
if k%100 == 1:
T = 300-(298*k/40000)
p = pow(math.e,-abs(ns-score)/T)
if ns > score or random.random() < p:
ans = na
score = ns
for a in ans:
print(a) | from time import time
from random import random
limit_secs = 2
start_time = time()
D = int(input())
c = list(map(int, input().split()))
s = [list(map(int, input().split())) for _ in range(D)]
def calc_score(t):
score = 0
S = 0
last = [-1] * 26
for d in range(len(t)):
S += s[d][t[d]]
last[t[d]] = d
for i in range(26):
S -= c[i] * (d - last[i])
score += max(10 ** 6 + S, 0)
return score
def solution1():
return [i % 26 for i in range(D)]
def solution2():
t = None
score = -1
for i in range(26):
nt = [(i + j) % 26 for j in range(D)]
if calc_score(nt) > score:
t = nt
return t
#def solution3():
# t = []
# for _ in range(D):
# for i in range(26):
def optimize0(t):
return t
def optimize1(t):
score = calc_score(t)
while time() - start_time + 0.15 < limit_secs:
d = int(random() * D)
q = int(random() * 26)
old = t[d]
t[d] = q
new_score = calc_score(t)
if new_score < score:
t[d] = old
else:
score = new_score
return t
t = solution2()
t = optimize0(t)
print('\n'.join(str(e + 1) for e in t))
| 1 | 9,743,134,639,472 | null | 113 | 113 |
A, B = input().split()
A = int(A)
B = round(float(B) * 100)
ans = (A * B) // 100
print(int(ans)) | inf=float("inf")
h,w=map(int,input().split())
s=[["#"]*(w+2) for i in range(h+2)]
for i in range(h):
s[i+1]=["#"]+list(input())+["#"]
#h,w=3,5
#s=[['#', '#', '#', '#', '#', '#', '#'], ['#', '.', '.', '.', '#', '.', '#'], ['#', '.', '#', '.', '#', '.', '#'], ['#', '.', '#', '.', '.', '.', '#'], ['#', '#', '#', '#', '#', '#', '#']]
nv=h*w
dp=[[inf]*nv for i in range(nv)]
def nhw(hi,wi):
return (hi-1)*w+wi-1
for i in range(1,h+1):
for j in range(1,w+1):
if s[i][j]=="#":
continue
vij=nhw(i,j)
if s[i-1][j]==".":
vij2=nhw(i-1,j)
dp[vij][vij2]=1
dp[vij2][vij]=1
if s[i+1][j]==".":
vij2=nhw(i+1,j)
dp[vij][vij2]=1
dp[vij2][vij]=1
if s[i][j-1]==".":
vij2=nhw(i,j-1)
dp[vij][vij2]=1
dp[vij2][vij]=1
if s[i][j+1]==".":
vij2=nhw(i,j+1)
dp[vij][vij2]=1
dp[vij2][vij]=1
for i in range(nv):
dp[i][i]=0
#print(dp)
for k in range(nv):
for i in range(nv):
for j in range(nv):
dp[i][j]=min(dp[i][j],dp[i][k]+dp[k][j])
# print(dp)
#print(dp)
dpmax=0
for i in range(nv):
for j in range(nv):
if dp[i][j]!=inf:
if dpmax<dp[i][j]:
dpmax=dp[i][j]
print(dpmax)
| 0 | null | 55,355,679,789,788 | 133 | 241 |
import sys
def main(args):
h, n = map(int,input().split())
magic = [0]*n
maxim = 0
for i in range(n):
dam, mp = map(int,input().split())
magic[i] = (dam, mp)
maxim = max(maxim, dam)
damage = [float('inf')]*(2*10**4)
damage[0] = 0
for i in range(max(2*h, 2*maxim)):
for m in magic:
dam, mp = m
damage[i] = min(damage[i-dam]+mp, damage[i])
print(min(damage[h:]))
if __name__ == '__main__':
main(sys.argv[1:]) | # https://atcoder.jp/contests/abc166/tasks/abc166_e
"""
変数分離すれば互いに独立なので、
連想配列でO(N)になる。
"""
import sys
input = sys.stdin.readline
from collections import Counter
N = int(input())
A = list(map(int, input().split()))
P = (j+1-A[j] for j in range(N))
M = (i+1+A[i] for i in range(N))
dic = Counter(P)
res = 0
for m in M:
res += dic.get(m,0)
print(res) | 0 | null | 53,897,189,061,792 | 229 | 157 |
A, B = [int(x) for x in input().split()]
if A >= 10 or B >= 10:
print(-1)
else:
print(A*B)
| A, B = map(int, input().split())
if 1<=A<=9 and 1<=B<=9: print(A*B)
else: print(-1) | 1 | 158,095,697,627,378 | null | 286 | 286 |
# coding: utf-8
from scipy.sparse.csgraph import floyd_warshall
N,M,L=map(int, input().split())
RG=[[0 for i in range(N)] for j in range(N)]
for i in range(M):
f,t,c = map(int, input().split())
if c <= L:
RG[f-1][t-1] = c
RG[t-1][f-1] = c
Rd = floyd_warshall(RG, directed=False)
FG=[[0 for i in range(N)] for j in range(N)]
for i in range(N):
for j in range(i+1, N):
if Rd[i][j] <= L:
FG[i][j] = 1
FG[j][i] = 1
Fd = floyd_warshall(FG, directed=False)
Q=int(input())
for i in range(Q):
s, t = map(int, input().split())
v = Fd[s-1][t-1]
if s == t:
print (str(0))
if v == float('inf'):
print (str(-1))
else:
print (str(int(v-1)))
| T1, T2 = map(int, input().split())
A1, A2 = map(int, input().split())
B1, B2 = map(int, input().split())
c1 = T1*A1-T1*B1
c2 = T2*A2-T2*B2
if c1 > 0:
c1 *= -1
c2 *= -1
power = c1+c2
if power == 0:
print('infinity')
elif power < 0:
print(0)
else:
ans = 2*(-c1//power)+(c1%power > 0)
print(ans) | 0 | null | 152,891,189,297,098 | 295 | 269 |
from collections import Counter
N = int(input())
S = input()
c = Counter(S)
ans = c['R'] * c['G'] * c['B']
for s in range(N-2):
for d in range(1, (N-1-s)//2+1):
t = s + d
u = t + d
if S[s] != S[t] and S[t] != S[u] and S[u] != S[s]:
ans -= 1
print(ans)
| N = int(input())
S = 'X' + input()
cnt_R, cnt_G, cnt_B = 0, 0, 0
for s in S[1:]:
if s == 'R':
cnt_R += 1
elif s == 'G':
cnt_G += 1
elif s == 'B':
cnt_B += 1
ans = cnt_R * cnt_G * cnt_B
for i in range(1,N-1):
for j in range(i+1,N):
k = 2*j - i
if k > N:
break
a = S[i]; b = S[j]; c = S[k]
if a != b and b != c and c != a:
ans -= 1
print(ans) | 1 | 35,996,238,611,142 | null | 175 | 175 |
N, K = map(int, input().split())
mod = 10**9 + 7
fact_count = [0 for _ in range(K+1)]
for k in range(1, K+1):
fact_count[k] = K//k
ans = 0
count = [0 for _ in range(K+1)]
for k in range(K, 0, -1):
c = pow(fact_count[k], N, mod)
j = 2*k
l = 2
while(j<=K):
c -= count[j]
l += 1
j = k*l
count[k] = c
c = c*k%mod
ans += c
ans %= mod
print(ans)
| import sys
sys.setrecursionlimit(10 ** 8)
ni = lambda: int(sys.stdin.readline())
nm = lambda: map(int, sys.stdin.readline().split())
nl = lambda: list(nm())
ns = lambda: sys.stdin.readline().rstrip()
MOD = 10 ** 9 + 7
N, K = nm()
def solve():
ans = 0
tbl = [0] * (K + 1)
for i in range(K, 0, -1):
m = K // i
p = pow(m, N, MOD)
j = 2
while j * i <= K:
p += MOD - tbl[j * i] % MOD
p %= MOD
j += 1
tbl[i] = p
ans += i * p % MOD
ans %= MOD
return ans
print(solve())
| 1 | 36,732,753,568,640 | null | 176 | 176 |
N = int(input())
if N == 1:
print(0)
exit()
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
ans = 0
l = factorization(N)
for i,j in l:
k = 1
while j >= k:
ans += 1
j -= k
k += 1
print(ans) | N = int(input())
def factorization(num):
res = []
n = num
div_max = int(num ** 0.5)
for i in range(2, div_max+1):
if n % i == 0:
count = 0
while n % i == 0:
count += 1
n //= i
res.append([i, count])
if n != 1:
res.append([n, 1])
if len(res) == 0:
res.append([num, 1])
return res
res = factorization(N)
ans = 0
for i in range(len(res)):
p, n = res[i]
if p != 1:
j = 1
while n - j >= 0:
ans += 1
n -= j
j += 1
print(ans) | 1 | 17,053,141,540,708 | null | 136 | 136 |
L=int(input())
l=L/3
ans=l*l*l
print("{:.07f}".format(ans)) | import sys
def main():
input = sys.stdin.buffer.readline
l = int(input())
print((l / 3) ** 3)
if __name__ == "__main__":
main()
| 1 | 47,353,981,216,430 | null | 191 | 191 |
l = list(map(int, input().split()))
s = input()
for c in s:
if c == "S":
l = [l[4], l[0], l[2], l[3], l[5], l[1]]
elif c == "N":
l = [l[1], l[5], l[2], l[3], l[0], l[4]]
elif c == "E":
l = [l[3], l[1], l[0], l[5], l[4], l[2]]
else:
l = [l[2], l[1], l[5], l[0], l[4], l[3]]
print(l[0])
| v,w,x,y=map(float,input().split())
print(float((abs(v-x)**2)+abs(w-y)**2)**(1/2)) | 0 | null | 199,307,451,360 | 33 | 29 |
n,m = map(int,input().split())
prb = [[0] for _ in range(n+1)]
for _ in range(m):
sub = input().split()
p, s = int(sub[0]), sub[1]
lst = prb[p]
if lst[-1] == 1:
pass
elif s == "WA":
lst.append(0)
elif s == "AC":
lst.append(1)
prb[p] = lst
ac_prb = [lst for lst in prb if lst[-1] == 1]
ac_num = len(ac_prb)
pe_num = -2*ac_num
for prb in ac_prb:
pe_num += len(prb)
print(ac_num, pe_num) | from collections import defaultdict
MOD = 998244353
N,S = map(int,input().split())
A = map(int,input().split())
dp = [0]*(S+1)
dp[0] = 1
for a in A:
ndp = [0]*(S+1)
for total,cnt in enumerate(dp):
ndp[total] += dp[total]*2
ndp[total] %= MOD
if total+a <= S:
ndp[total+a] += dp[total]
ndp[total+a] %= MOD
dp = ndp
print(dp[-1]%MOD) | 0 | null | 55,485,062,219,148 | 240 | 138 |
S = list(map(int, list(input())))[::-1]
N = len(S)
CNT = [0]*2019
CNT[0] = 1
num = 0
d = 0
for i in range(N):
num += S[i]*pow(10, d, 2019)
num %= 2019
CNT[num] += 1
d += 1
ans = 0
for cnt in CNT:
ans += (cnt*(cnt - 1)) // 2
print(ans) | import math,itertools,fractions,heapq,collections,bisect,sys,queue,copy
sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
dd=[(-1,0),(0,1),(1,0),(0,-1)]
ddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]
def LI(): return [int(x) for x in sys.stdin.readline().split()]
# def LF(): return [float(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def LS(): return sys.stdin.readline().split()
def S(): return input()
# Summarize count of factor within list -- START --
def summarizeList(l):
sl=sorted(l)
a=sl[0]
c=1
res=[]
for x in sl[1:]:
if x==a:
c+=1
else:
res.append([a,c])
a=x
c=1
res.append([a,c])
return res
# Summarize count of factor within list --- END ---
# 累積和の書き方がよくないやつ
def main():
s=S()
n=len(s)
l=[]
mul=1
for x in s[::-1]:
l.append(mul*int(x)%2019)
mul*=10
mul%=2019
for i in range(n-1):
l[i+1]+=l[i]
l[i+1]%=2019
sl=summarizeList(l)
# print(sl)
ans=0
for x,c in sl:
if x==0:
ans+=c
if c>1:
ans+=c*(c-1)//2
return ans
# main()
print(main())
| 1 | 30,975,247,445,392 | null | 166 | 166 |
import sys
readline=sys.stdin.readline
N,D,A=map(int,readline().split())
D*=2 # 爆発の長さ
X=[None]*N
for i in range(N):
X[i]=list(map(int,readline().split()))
X=sorted(X,key=lambda x:x[0])
# lastX=X[-1][0] # 最後のモンスターの場所
damage=0 # 現在の爆発が与えられるダメージ
from collections import deque
bombs=deque() # 爆弾が切れるタイミング
# [位置、効力]
ans=0
for i in range(len(X)):
x=X[i][0]
h=X[i][1] # モンスターの体力
# 爆発が途切れていないかを確認
while bombs:
b=bombs.popleft()
if b[0]<x:
damage-=b[1]
else:
bombs.appendleft(b)
break
h-=damage
if h>0:
turn=((h+A-1)//A)
damage+=turn*A
ans+=turn
bombs.append([x+D,turn*A])
print(ans)
| def main():
def trial_division(n):
divs = set()
for i in range(1, int(n**0.5)+1):
if n % i == 0:
divs.add(i)
if i != n//i:
divs.add(n//i)
return divs
def gcd(x, y):
if y == 0:
return x
while y != 0:
x, y = y, x % y
return x
N = int(input())
ans = 0
divs = trial_division(N) | trial_division(N-1)
for d in divs:
if d == 1:
continue
num = N
while num % d == 0 and d <= num:
num //= d
if num % d == 1:
ans += 1
print(ans)
if __name__ == '__main__':
main()
| 0 | null | 61,763,096,274,950 | 230 | 183 |
a,b=list(map(int,input().split()))
if a==b:
print('Yes')
else :
print('No')
| n,*l=map(int,open(0).read().split())
a=t=0
for i in l:
if i>t: t=i
a+=t-i
print(a) | 0 | null | 43,621,611,211,360 | 231 | 88 |
import sys
n,m,l=map(int,input().split())
e=[list(map(int,e.split()))for e in sys.stdin]
for c in e[:n]:print(*[sum(s*t for s,t in zip(c,l))for l in zip(*e[n:])])
| # n??m????????? A ??¨ m??l ????????? B ?????\??????????????????????????§?????? n??l ????????? C ???????????????????????°??????
n, m, l = map(int, input().split())
# n x m ???????????????
A = [[0 for i in range(m)] for j in range(n)]
# m x l ???????????????
B = [[0 for i in range(l)] for j in range(m)]
# n x l ??????(????????????)?????????
C = [[0 for i in range(l)] for j in range(n)]
# m x n ??????????¨??????\?????????????????????
for i in range(0, n):
A[i][:m] = map(int, input().split())
# print(sheet_nxm)
# m x n ??????????¨??????\?????????????????????
for i in range(0, m):
B[i][:l] = map(int, input().split())
# print(sheet_mxl)
# C(n x l)??????????¨???????A????????¨B????????????
for i in range(0, n):
for j in range(0, l):
for k in range(0, m):
C[i][j] += A[i][k] * B[k][j]
# print(C)
# C???????????????
for i in range(0, n):
for j in range(0, l):
print("{0}".format(C[i][j]), end="")
if j != l - 1:
print(" ", end="")
else:
print("") | 1 | 1,427,572,452,490 | null | 60 | 60 |
MOD = 10**9 + 7
def main():
import sys
input = sys.stdin.buffer.readline
_ = int(input())
A = [int(i) for i in input().split()]
def gcd(x, y):
if y == 0:
return x
while y != 0:
x, y = y, x % y
return x
def lcm(x, y):
return x*y//gcd(x, y)
L = A[0]
for a in A[1:]:
L = lcm(L, a)
L %= MOD
ans = 0
for a in A:
ans += L*pow(a, MOD-2, MOD)
print(ans % MOD)
if __name__ == '__main__':
main()
| chars = [chr(i) for i in range(ord('a'), ord('z') + 1)]
arr = []
x = int(input())
def get_len(n):
length = 1
t = 26
while True:
if n <= t:
return length
t += 26 ** (length + 1)
length += 1
if length > 1000000000000001:
raise
def get_ord(n):
st = 1
end = 26
ind = 1
while True:
if st <= n <= end:
return x - st
st = end + 1
end += 26 ** (ind + 1)
ind += 1
length = get_len(x)
order = get_ord(x)
# print(length)
for i in range(length):
s = order % 26
order = order // 26
arr.append(s)
# print(arr)
ans = ""
for ai in arr[::-1]:
ans += chars[ai]
print(ans) | 0 | null | 50,082,058,800,280 | 235 | 121 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.