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
|
|---|---|---|---|---|---|---|
[n,m,l] = map(int, input().split())
a = []
b = []
c = [[0 for k in range(l)] for i in range(n)]
for i in range(n):
a.append(list(map(int, input().split())))
for j in range(m):
b.append(list(map(int, input().split())))
for i in range(n):
for k in range(l):
s = 0
for j in range(m):
s += a[i][j] * b[j][k]
c[i][k] = s
for i in range(n):
for k in range(l):
print(c[i][k],end='')
if k!= l-1:
print(' ',end='')
else:
print() | import copy
def BubbleSort(C, n):
flag = 1
while flag:
flag = 0
for i in range(n-1, 0, -1):
if int(C[i][1]) < int(C[i - 1][1]):
C[i], C[i-1] = C[i-1], C[i]
flag = 1
return C
def SelectionSort(C, n):
for i in range(n-1):
minj = i
for j in range(i, n):
if int(C[j][1]) < int(C[minj][1]):
minj = j
if minj != i:
C[i], C[minj] = C[minj], C[i]
return C
n = int(input())
C = list(input().split())
C2 = C.copy()
print(*BubbleSort(C, n), sep=' ')
print("Stable")
print(*SelectionSort(C2, n), sep=' ')
if C ==C2:
print("Stable")
else:
print("Not stable")
| 0 | null | 714,019,618,880 | 60 | 16 |
import sys
sys.setrecursionlimit(100000000)
def main():
n, m = map(int, input().split())
res = []
# n = 2m+1を考える
if m % 2 == 0:
half_m = int(m / 2)
for i in range(half_m):
res.append((half_m - i, half_m + 1 + i))
res.append((m + half_m - i, m + half_m + 2 + i))
else:
half_m = int(m / 2)
for i in range(half_m):
res.append((half_m - i, half_m + 2 + i))
res.append((m + half_m + 1 - i, m + half_m + 2 + i))
res.append((m + 1, m + 2 * half_m + 2))
for r in res:
print(str(r[0]) + " " + str(r[1]))
main()
| n,m = map(int,input().split())
a = list(map(int,input().split()))
ans = 0
if sum(a) >n:
ans = -1
else:
ans = n-sum(a)
print(ans) | 0 | null | 30,367,671,780,992 | 162 | 168 |
import sys
def insertionSort(A, n, g):
for i in range(g, n):
global cnt
v = A[i]
j = i - g
while j >= 0 and A[j] > v:
A[j+g] = A[j]
j = j - g
cnt += 1
A[j+g] = v
def shellSort(A, n):
global m
global G
for i in range(0, m):
insertionSort(A, n, G[i])
n = int(input())
A = []
for i in range(n):
A.append(int(input()))
if n == 1:
print(1)
print(1)
print(0)
print(A[0])
sys.exit()
t = n - 1
G = []
G.append(t)
while t != 1:
t = t//2
G.append(t)
m = len(G)
cnt = 0
shellSort(A, n)
print(m)
print(' '.join(map(str, G)))
print(cnt)
for i in range(n):
print(A[i])
| def insertionSort(A, n, g):
cnt=0
for i in range(g,n):
v = A[i]
j = i - g
while j >= 0 and A[j] > v:
A[j+g] = A[j]
j = j - g
cnt+=1
A[j+g] = v
return cnt,A
def shellSort(A, n):
cnt = 0
G = [1]
flag=True
while flag:
g = G[0]*3+1
if g < n:
G = [g] + G
else:
flag=False
m = len(G)
for i in range(m):
tmp_cnt,tmp_A = insertionSort(A, n, G[i])
cnt += tmp_cnt
print(m)
G_str = (list(map(lambda x:str(x),list(G))))
print(" ".join(G_str))
print(cnt)
for a in A:
print(a)
#print(A)
n = int(input())
A = []
for i in range(n):
A.append(int(input()))
shellSort(A, n)
| 1 | 30,062,905,652 | null | 17 | 17 |
n = int(input())
for i in range(n):
a = list(map(int, input().split()))
m = max(a)
b = sum([i**2 for i in a if i != m])
if (m**2 == b):
print("YES")
else:
print("NO") | N=int(input())
a=0
if N%2==0:
a=N//2-1
else:
a=N//2
print(a) | 0 | null | 76,950,110,516,928 | 4 | 283 |
line = input()
num_query = int(input())
for loop in range(num_query):
input_str = list(input().split())
if input_str[0] == 'replace':
left = int(input_str[1])
right = int(input_str[2])
right += 1
line = line[:left] + input_str[3] + line[right:]
elif input_str[0] == 'reverse':
left = int(input_str[1])
right = int(input_str[2])
right += 1
line = line[:left] + line[left:right][::-1] + line[right:]
else: # print
left = int(input_str[1])
right = int(input_str[2])
right += 1
for i in range(left, right):
print(line[i], end="")
print()
| S = raw_input()
n = int(raw_input())
for i in range(n):
command = (raw_input()).split(" ")
if command[0] == "print":
a = int(command[1])
b = int(command[2])
print S[a:b+1]
elif command[0] == "reverse":
a = int(command[1])
b = int(command[2])
T = S[a:b+1]
S = S[0:a] + T[::-1] + S[b+1:]
else:
a = int(command[1])
b = int(command[2])
S = S[0:a] + command[3] + S[b+1:] | 1 | 2,083,069,036,246 | null | 68 | 68 |
n = input()
#print(n[-1])
if n[-1] == "3":
print("bon")
elif n[-1] == "0":
print("pon")
elif n[-1] == "1":
print("pon")
elif n[-1] == "6":
print("pon")
elif n[-1] == "8":
print("pon")
else: print("hon") | N = input().rstrip()
N = int(N[-1])
A = {2,4,5,7,9}
B = {0,1,6,8}
if N in A:
print("hon")
elif N in B:
print("pon")
else:
print("bon") | 1 | 19,429,455,685,200 | null | 142 | 142 |
import sys
k1 = [[0 for i in xrange(10)] for j in xrange(3)]
k2 = [[0 for i in xrange(10)] for j in xrange(3)]
k3 = [[0 for i in xrange(10)] for j in xrange(3)]
k4 = [[0 for i in xrange(10)] for j in xrange(3)]
n = input()
for i in xrange(n):
m = map(int,raw_input().split())
if m[0] == 1:
k1[m[1]-1][m[2]-1] = k1[m[1]-1][m[2]-1] + m[3]
elif m[0] == 2:
k2[m[1]-1][m[2]-1] = k2[m[1]-1][m[2]-1] + m[3]
elif m[0] == 3:
k3[m[1]-1][m[2]-1] = k3[m[1]-1][m[2]-1] + m[3]
elif m[0] == 4:
k4[m[1]-1][m[2]-1] = k4[m[1]-1][m[2]-1] + m[3]
for i in xrange(3):
for j in xrange(10):
x = ' ' + str(k1[i][j])
sys.stdout.write(x)
if j == 9:
print ""
print"#"*20
for i in xrange(3):
for j in xrange(10):
y = ' ' + str(k2[i][j])
sys.stdout.write(y)
if j == 9:
print ""
print"#"*20
for i in xrange(3):
for j in xrange(10):
z = ' ' + str(k3[i][j])
sys.stdout.write(z)
if j == 9:
print ""
print"#"*20
for i in xrange(3):
for j in xrange(10):
zz = ' ' + str(k4[i][j])
sys.stdout.write(zz)
if j == 9:
print "" | '''
いちばん簡単なのは建物とフロアごとにリスト作って、足し引き
'''
#部屋、フロア、建物をクラスで定義。まあ、クラスにしなくてもいいんだけど
a = int(input())
n = 10
m = 3
o = 4
h = [
[
[0 for i in range(n)]
for j in range(m)]
for k in range(o)]
#w, x, y, z = 3, 1, 8, 4
for i in range(a):
w,x,y,z = map(int, input().split())
h[w-1][x-1][y-1] += z
#print(h[1][1])
#建物と建物仕切り
def makeFence():
fence = '#' * 20
print(fence)
#部屋を表示する関数
def showRoom(f):
for k in range(len(f)-1):
print(' ' + str(f[k]), end='')
print(' ' + str(f[len(f)-1]))
#フロアを表示する関数
def showFloor(b):
j = 0
while j < len(b):
f = b[j]
showRoom(f)
j += 1
def statusShow(h):
for i in range(len(h)-1):
b = h[i]
showFloor(b)
makeFence()
showFloor(h[len(h)-1])
statusShow(h)
#b = statusShow(h)
#makeFence()
#print(b)
| 1 | 1,105,768,142,710 | null | 55 | 55 |
n=int(input())
if n%2==1:print(0)
else:
n//=2
i=5
s=0
while i<=n:
s+=n//i
i*=5
print(s) | #E
import math
n = int(input())
ans = 0
i = 1
if n % 2 == 0:
tmp = 5 ** i * 2
while tmp <= n:
tmp = 5 ** i * 2
ans += n //tmp
i += 1
print(ans)
else:
print(0) | 1 | 116,191,627,666,980 | null | 258 | 258 |
A,B,M=map(int,input().split())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
X=[]
Y=[]
C=[]
for m in range(M):
x,y,c=map(int,input().split())
X.append(x)
Y.append(y)
C.append(c)
no_coupon=min(a)+min(b)
sum=[]
for i in range(M):
sum.append(a[X[i]-1]+b[Y[i]-1]-C[i])
with_coupon=min(sum)
print(min(no_coupon,with_coupon)) | N, K = map(int, input().split())
p = list(map(int, input().split()))
p.sort()
print(sum(p[:K])) | 0 | null | 32,720,675,868,732 | 200 | 120 |
length = int(input())
targ = [int(n) for n in input().split(' ')]
swap = 0
for l in range(length):
for m in range(l):
if targ[l - m] < targ[l - m - 1]:
disp = targ[l-m -1]
targ[l-m-1] = targ[l-m]
targ[l-m] = disp
swap += 1
print(" ".join([str(n) for n in targ]))
print(swap) | n=int(input())
a=list(map(int,input().split()))
mod=10**9+7
ans=0
for i in range(61):
count0=0
count1=0
for j in a:
if not (j>>i & 1):
count0+=1
if j>>i & 1:
count1+=1
ans+=((count0*count1)*(2**i))%mod
print(ans%mod) | 0 | null | 61,241,570,519,040 | 14 | 263 |
n = int(input())
ans = ''
# 制約条件は高々 26 の 10 乗なので、取り合えずインデックスを13に設定して回す
for i in range(1, 13):
if n <= 26**i:
n -= 1
for j in range(i):
ans += chr(ord('a') + n%26)
n //= 26
break;
else:
n -= 26**i
print(ans[::-1]) | n,m,l=map(int,input().split())
b=[]
for i in range(n):
x= list(map(int, input().split()))
b.append(x)
y=[]
for i in range(m):
z= list(map(int, input().split()))
y.append(z)
c = [[0] * l for i in range(n)]
for i in range(n):
for j in range(l):
for k in range(m):
c[i][j] += b[i][k] * y[k][j]
print(*c[i]) #*をつけると[]が外れて表示される
| 0 | null | 6,740,166,023,144 | 121 | 60 |
n = int(input())
tp = 0
hp = 0
for i in range(n):
tarou, hanako = map(str,input().split())
if(tarou > hanako):
tp += 3
elif(tarou < hanako):
hp += 3
else:
tp += 1
hp += 1
print("%d %d" %(tp,hp))
| import sys
n = int(sys.stdin.readline())
points = [0, 0]
for i in range(n):
(taro, hanako) = sys.stdin.readline().split()
if taro < hanako:
points[1] += 3
elif taro > hanako:
points[0] += 3
else:
points[0] += 1
points[1] += 1
print(points[0], points[1]) | 1 | 2,005,289,328,338 | null | 67 | 67 |
from copy import deepcopy
def getval():
r,c,k = map(int,input().split())
item = [[0 for i in range(c)] for i in range(r)]
for i in range(k):
ri,ci,vi = map(int,input().split())
item[ri-1][ci-1] = vi
return r,c,k,item
def main(r,c,k,item):
#DP containing the information of max value given k items picked in i,j
prev = [[0 for i in range(4)]]
inititem = item[0][0]
prev[0] = [0,inititem,inititem,inititem]
for i in range(1,r):
initval = prev[i-1][3]
temp = []
cur = item[i][0]
for j in range(4):
temp.append(initval)
for j in range(1,4):
temp[j] += cur
prev.append(temp)
for j in range(1,c):
init = deepcopy(prev[0])
for i in range(1,4):
init[i] = max(prev[0][i],prev[0][i-1]+item[0][j])
curcol = [init]
for i in range(1,r):
cur = item[i][j]
left = curcol[-1]
down = prev[i]
temp = [max(left[3],down[0])]
for k in range(1,4):
temp.append(max(max(left[3],down[k-1])+cur,down[k]))
curcol.append(temp)
prev = curcol
print(max(prev[-1]))
if __name__=="__main__":
r,c,k,item = getval()
main(r,c,k,item) | N = int(input())
table = []
for i in range(N):
X,L = map(int,input().split())
table.append((X-L,X+L))
table = sorted(table, key=lambda x:x[1])
cur = 0
l_cur, r_cur = table[0]
ans = N
for i in range(1,N):
l,r = table[i]
if r_cur > l:
ans -= 1
else:
l_cur, r_cur = l,r
print(ans) | 0 | null | 47,929,891,465,526 | 94 | 237 |
# import sys
# import math #sqrt,gcd,pi
# import decimal
# import queue # queue
# import bisect
# import heapq # priolity-queue
# import time
# from itertools import product,permutations,\
# combinations,combinations_with_replacement
# 重複あり順列、順列、組み合わせ、重複あり組み合わせ
# import collections # deque
# from operator import itemgetter,mul
# from fractions import Fraction
# from functools import reduce
mod = int(1e9+7)
# mod = 998244353
INF = 1<<50
def readInt():
return list(map(int,input().split()))
def main():
n = int(input())
s = input()
rgb = {"R":0,"G":0,"B":0}
for i in s:
rgb[i] += 1
ans = 1
for i in rgb.keys():
ans *= rgb[i]
for i in range(n-2):
for j in range(i+1,n-1):
k = j + (j-i)
if k>=n:
continue
if s[i]!=s[j] and s[i]!=s[k] and s[j]!=s[k]:
ans -= 1
print(ans)
return
if __name__=='__main__':
main()
| n = int(input())
p = str(tuple(map(int, input().split())))
q = str(tuple(map(int, input().split())))
import itertools
n_l = [ i+1 for i in range(n) ]
d = {}
for i, v in enumerate(itertools.permutations(n_l)):
d[str(v)] = i
print(abs(d[p]-d[q])) | 0 | null | 68,753,873,995,048 | 175 | 246 |
n, m = list(map(int, input().split()))
num = [0 for i in range(n)]
flag = False
for i in range(m):
s, c = list(map(int, input().split()))
if (s == 1) and (c == 0) and (n > 1):
flag = True
elif num[s-1] == 0:
num[s-1] = c
else:
if num[s-1] != c:
flag = True
if flag:
print(-1)
else:
if (n > 1) and (num[0] == 0):
num[0] = 1
print("".join(list(map(str, num)))) | import sys
N, M = map(int, input().split())
SC = [list(map(int, input().split())) for _ in range(M)]
flagN = [False]*N
numN = [0]*N
if N > 1:
numN[0] = 1
for sc in SC:
s, c = sc[0], sc[1]
if flagN[s-1] == False:
flagN[s-1] = True
numN[s-1] = c
elif numN[s-1] == c:
continue
else:
print(-1)
sys.exit()
if N != 1 and numN[0] == 0:
print(-1)
sys.exit()
ans = ''
for n in numN:
ans += str(n)
print(ans) | 1 | 61,020,640,708,180 | null | 208 | 208 |
while True:
m, t, f = map( int, raw_input().split())
if m == -1 and t == -1 and f == -1:
break
if m == -1 or t == -1:
r = "F"
elif (m + t) >= 80:
r = "A"
elif (m + t) >= 65:
r = "B"
elif (m + t) >= 50:
r = "C"
elif (m + t) >= 30:
if f >= 50:
r = "C"
else:
r = "D"
else:
r = "F"
print r | # -*- coding: utf-8 -*-
while True:
score = list(map(int, input().split()))
if score[0] == -1 and score[1] == -1 and score[2] == -1:
break
elif -1 in (score[0], score[1]) or (score[0] + score[1]) < 30:
print('F')
elif (score[0] + score[1]) >= 80:
print('A')
elif 65 <= (score[0] + score[1]) < 80:
print('B')
elif 50 <= (score[0] + score[1]) < 65 or (30 <= (score[0] + score[1]) < 50 <= score[2]):
print('C')
elif 30 <= (score[0] + score[1]) < 50:
print('D')
| 1 | 1,247,422,974,720 | null | 57 | 57 |
i=1
for i in range(9):
i+=1
print(f'1x{i}={1*i}')
for i in range(9):
i+=1
print(f'2x{i}={2*i}')
for i in range(9):
i+=1
print(f'3x{i}={3*i}')
for i in range(9):
i+=1
print(f'4x{i}={4*i}')
for i in range(9):
i+=1
print(f'5x{i}={5*i}')
for i in range(9):
i+=1
print(f'6x{i}={6*i}')
for i in range(9):
i+=1
print(f'7x{i}={7*i}')
for i in range(9):
i+=1
print(f'8x{i}={8*i}')
for i in range(9):
i+=1
print(f'9x{i}={9*i}')
| def exe():
for i in range(1,10):
for j in range(1,10):
print(str(i)+'x'+str(j)+'='+str(i*j))
if __name__ == '__main__':
exe()
| 1 | 958,892 | null | 1 | 1 |
n,m = map(int,input().split())
mod =10**9+7
sum = 0
min = 0
max = 0
for k in range(1,n+2):
min += k-1
max += n-(k-1)
if k >= m:
sum = (sum + max-min+1) % mod
print(sum)
| while 1:
m,f,r=map(int,input().split());s=m+f
if r<0>s:break
print('F'if m*f<0 or s<30 else'D'if(s<50)*(r<50)else'C'if s<65 else'B'if s<80 else'A')
| 0 | null | 17,176,094,181,860 | 170 | 57 |
A,V=map(int,input().split())
B,W=map(int,input().split())
T=int(input())
if V<=W or (abs(A-B)/(V-W))>T:
print("NO")
else:
print("YES") | a = list(map(int, input().split()))
b = list(map(int, input().split()))
t = int(input())
diff = (a[1]-b[1])*t # 1秒ごとに縮まる
adiff = abs(a[0]-b[0]) # 元々の差
if diff >= adiff:
print('YES')
else:
print('NO') | 1 | 15,173,621,743,930 | null | 131 | 131 |
import sys
import math
import itertools
k,x=(int(i) for i in input().split())
if(k*500>=x):
print("Yes")
else:
print("No") | n=int(input())
s=input()
flag=0
ans=0
for si in s:
if si=='A':
flag=1
elif si=='B' and flag==1:
flag=2
elif si=='C' and flag==2:
ans+=1
flag=0
else:
flag=0
print(ans)
| 0 | null | 98,793,074,863,032 | 244 | 245 |
n,k=map(int,input().split())
#階乗
F = 200005
mod = 10**9+7
fact = [1]*F
inv = [1]*F
for i in range(2,F):
fact[i]=(fact[i-1]*i)%mod
inv[F-1]=pow(fact[F-1],mod-2,mod)
for i in range(F-2,1,-1):
inv[i] = (inv[i+1]*(i+1))%mod
ans=1
for i in range(1,min(n,k+1)):
comb=(fact[n]*inv[i]*inv[n-i])%mod
h=(fact[n-1]*inv[i]*inv[n-1-i])%mod
ans=(ans+comb*h)%mod
print(ans) | import sys
input = sys.stdin.buffer.readline
import copy
def main():
N,K = map(int,input().split())
MOD = 10**9+7
fac = [0 for _ in range(2*10**5+1)]
fac[0],fac[1] = 1,1
inv = copy.deepcopy(fac)
invfac = copy.deepcopy(fac)
for i in range(2,2*10**5+1):
fac[i] = (fac[i-1]*i)%MOD
inv[i] = MOD-(MOD//i)*inv[MOD%i]%MOD
invfac[i] = (invfac[i-1]*inv[i])%MOD
def coef(x,y):
num = (((fac[x]*invfac[y])%MOD)*invfac[x-y]%MOD)
return num
ans = 0
for i in range(min(N,K+1)):
a = coef(N,i)
b = coef(N-1,N-i-1)
ans += ((a*b)%MOD)
print(ans%MOD)
if __name__ == "__main__":
main() | 1 | 67,221,420,210,592 | null | 215 | 215 |
S = input()
K = int(input())
#ランレングス圧縮
rle = []
pre = 'A'
chain = 1
for c in S:
if c == pre:
chain += 1
else:
if pre != 'A':
rle.append([pre,chain])
pre = c
chain = 1
rle.append([pre,chain])
ans = 0
#1種類の文字列の場合
if len(rle) == 1:
ans = (rle[0][1] * K) // 2
#2種類以上の文字列の場合
else:
#先頭と末尾が同じ文字
if rle[0][0] == rle[-1][0]:
#先頭、末尾、つなぎ目の対応
ans += rle[0][1]//2
ans += rle[-1][1]//2
rle[0][1] += rle[-1][1]
rle[-1][1] = 0
ans += rle[0][1]//2 * (K-1)
#Sの中での連続文字の対応
mid_chains = 0
for i in range(1,len(rle)):
mid_chains += rle[i][1]//2
ans += mid_chains * K
#先頭と末尾が異なる文字
else:
mid_chains = 0
for i in range(len(rle)):
mid_chains += rle[i][1]//2
ans += mid_chains * K
#print(rle)
print(ans) | import numpy as np
s=input()
k=int(input())
cnt=1
a=[]
ss=s+"."
for i in range(len(s)):
if ss[i]==ss[i+1]:
cnt+=1
else:
a.append(cnt)
cnt=1
pp=0
if s[0]==s[len(s)-1]:
pp=a[0]+a[-1]
b=[]
if len(a)>1:
b.append(pp)
b+=a[1:len(a)-1]
else:
a=[len(s)*k]
b=[]
else:
b=a
arr=np.array(a)
arr2=np.array(b)
a=arr//2
b=arr2//2
if len(s)>=2:
print(np.sum(a)+int((k-1)*np.sum(b)))
else:
print(k//2) | 1 | 175,838,683,975,680 | null | 296 | 296 |
n=int(input());s=['a']
while len(s)>0:
t=s.pop(-1)
if len(t)==n:print(t)
else:
a=max(ord(i)for i in t)
for a in range(a+1,96,-1):s.append(t+chr(a)) | n, t = map(int, input().split())
ab = [tuple(map(int, input().split())) for i in range(n)]
m, d = 0, [0] * t
for a, b in sorted(ab):
m = max(m, b+d[t-1])
for l in range(t-1,a-1,-1):
if(b+d[l-a] > d[l]):
d[l] = b+d[l-a]
print(m) | 0 | null | 102,213,612,012,942 | 198 | 282 |
# encoding: utf-8
def bubble_sort(A, N):
flag = 1
count = 0
while flag:
flag = 0
for j in xrange(N-1, 0, -1):
if A[j] < A[j-1]:
A[j], A[j-1] = A[j-1], A[j]
flag = 1
count += 1
return A, count
def main():
N = input()
A = map(int, raw_input().split())
A, count = bubble_sort(A, N)
print " ".join(map(str,A))
print count
main() | def bubbleSort(A, N):
flag = 1
count = 0
while flag:
flag = 0
for j in xrange(N-1,0,-1):
if A[j] < A[j-1]:
tmp = A[j]
A[j] = A[j-1]
A[j-1] = tmp
flag += 1
count += 1
return A, count
def main():
N = int(raw_input())
A = map(int, raw_input().split())
new_A, count = bubbleSort(A, N)
print ' '.join(map(str,new_A))
print count
if __name__ == "__main__":
main() | 1 | 17,466,743,030 | null | 14 | 14 |
n = int(input())
xy = [list(map(int, input().split())) for _ in range(n)]
xy.sort(key=lambda x: x[0] + x[1])
mn1, mx1 = xy[0], xy[-1]
xy.sort(key=lambda x: x[0] - x[1])
mn2, mx2 = xy[0], xy[-1]
li = [mn1, mx1, mn2, mx2]
ans = 0
for x1, y1 in li:
for x2, y2 in li:
dist = abs(x1 - x2) + abs(y1 - y2)
ans = max(ans, dist)
print(ans)
| """
四隅に仮想の原点をつくり、各座標からその原点へのマンハッタン距離を計測する。
"""
N = int(input())
XY = [list(map(int,input().split())) for _ in range(N)]
def measure(originX,originY):
origin = [originX,originY]
XY.sort(key=lambda x: abs(x[0]-origin[0])+abs(x[1]-origin[1]))
return abs(XY[-1][0]-origin[0])+abs(XY[-1][1]-origin[1])-(abs(XY[0][0]-origin[0])+abs(XY[0][1]-origin[1]))
ans = 0
ans = max(ans,measure(1,1))
ans = max(ans,measure(1,10**9))
ans = max(ans,measure(10**9,1))
ans = max(ans,measure(10**9,10**9))
print(ans) | 1 | 3,384,851,601,682 | null | 80 | 80 |
N=int(input())
A=list(map(int,input().split()))
SUM=sum(A)
Q=int(input())
List=[0 for _ in range(10**5+1)]
for a in A:
List[a]+=1
for q in range(Q):
B,C=map(int,input().split())
SUM-=B*List[B]
SUM+=C*List[B]
List[C]+=List[B]
List[B]=0
print(SUM) | N = int(input())
A = list(map(int,input().split()))
Q = int(input())
S = [list(map(int, input().split())) for l in range(Q)]
l = [0] * 10**6
tot = 0
for i in range(N) :
l[A[i]]+=1
tot += A[i]
for i in range(Q):
s0 = S[i][0]
s1 = S[i][1]
tot += s1 * (l[s0] + l[s1]) - (s0 * l[s0] + s1*l[s1])
l[s1] += l[s0]
l[s0] = 0
print(tot) | 1 | 12,160,826,769,312 | null | 122 | 122 |
n = int(input())
a = list(map(int,input().split()))
m = max(a) + 1
li = [0]*m
for x in a:
li[x] += 1
ans = 0
for i in range(1,m):
if li[i]:
if li[i]==1:
ans += 1
for j in range(i,m,i):
li[j] = 0
print(ans) | N = int(input())
A = list(map(int,input().split()))
ma = max(A)
l = [0 for _ in range(ma + 10)]
for i in range(N):
temp = A[i]
while(temp <= ma + 5):
l[temp] += 1
temp += A[i]
ans = 0
for i in range(N):
if l[A[i]] == 1: ans += 1
print(ans) | 1 | 14,454,287,099,840 | null | 129 | 129 |
ans = []
for i in range(int(input())):
a, b, c = map(int, input().split())
lst = [a, b, c]
lst.sort()
if lst[2]**2 == lst[0]**2 + lst[1]**2:
ans.append("YES")
else:
ans.append("NO")
for i in ans:
print(i) | # -*- config: utf-8 -*-
if __name__ == '__main__':
for i in range(int(raw_input())):
nums = map(lambda x:x**2,map(int,raw_input().split()))
flg = False
for i in range(3):
s = int(0)
for j in range(3):
if i == j :
continue
s += nums[j]
if s == nums[i] :
flg = True
if flg == True :
print "YES"
else :
print "NO" | 1 | 347,754,528 | null | 4 | 4 |
d = set()
n = int(input())
for i in range(n):
raw=input().split()
if raw[0] == 'insert':
d.add(raw[1])
else:
if raw[1] in d:
print('yes')
else:
print('no')
| def main():
n = int(input())
dictionary = set()
for _ in range(n):
order, code = input().split()
if order == 'insert':
dictionary.add(code)
elif order == 'find':
if code in dictionary:
print('yes')
else:
print('no')
else:
raise Exception('InputError')
if __name__ == '__main__':
main() | 1 | 77,442,100,118 | null | 23 | 23 |
def calc_circle(r):
pi = 3.14159265359
area = round(r*r*pi, 6)
circ = round(2*r*pi, 6)
return (area, circ)
if __name__ == "__main__":
r = float(input())
area, circ = calc_circle(r)
print(f"{area:.6f} {circ:.6f}")
| import math
a = float(input())
print(a*a*math.pi, 2*a*math.pi)
| 1 | 648,924,395,220 | null | 46 | 46 |
N = int(input())
A = list(map(int, input().split()))
N_MAX = 200000
A_MAX = 10 ** 9
temp = dict()
for i in A:
if i in temp:
print("NO")
exit()
else:
temp[i] = 0
print("YES") | st = set()
n = int(input())
ls = [int(x) for x in input().split()]
for i in ls:
st.add(i)
if len(st) == n:
print("YES")
else:
print("NO") | 1 | 73,646,019,660,860 | null | 222 | 222 |
def report(k, r):
print('{} x {}'.format(k, r[k]))
ans = {'AC': 0, 'WA': 0, 'TLE': 0, 'RE': 0}
N = int(input().rstrip())
for i in range(N):
S = input().rstrip()
ans[S] += 1
report('AC', ans)
report('WA', ans)
report('TLE', ans)
report('RE', ans)
| n = int(input())
c0 = 0
c1 = 0
c2 = 0
c3 = 0
for i in range(n):
s = input()
if s == "AC":
c0 += 1
elif s == "WA":
c1 += 1
elif s == "TLE":
c2 += 1
elif s == "RE":
c3 += 1
else:
exit()
print(f"AC x {c0}")
print(f"WA x {c1}")
print(f"TLE x {c2}")
print(f"RE x {c3}")
| 1 | 8,622,545,714,420 | null | 109 | 109 |
import math
n,D = map(int,input().split())
cnt = 0
for i in range(n):
p,q = map(int,input().split())
d = math.sqrt(p**2 + q ** 2)
if D >= d:
cnt += 1
print(cnt) | for i in range(10000):
try:
a = eval(input())
print(int(a))
except:
break
| 0 | null | 3,271,580,820,028 | 96 | 47 |
m = []
f = []
r = []
while(1):
a,b,c = map(int,raw_input().split())
if a == -1 and b == -1 and c == -1:
break
else:
m.append(a)
f.append(b)
r.append(c)
for i in range(len(m)):
if m[i] == -1 or f[i] == -1:
print "F"
elif m[i] + f[i] >= 80:
print "A"
elif m[i] + f[i] >= 65:
print "B"
elif m[i] + f[i] >= 50 or r[i] >= 50:
print "C"
elif m[i] + f[i] >= 30:
print "D"
else:
print "F"
| import sys
input = sys.stdin.readline
from collections import deque
def main():
N, D, A = map(int, input().split())
monsters = sorted([list(map(int, input().split())) for _ in range(N)])
for i in range(N):
monsters[i][1] = (monsters[i][1] + A - 1) // A
attacks = deque([]) # [(有効範囲, 攻撃回数)]
ans = 0
atk = 0
for i in range(N):
atk_this = monsters[i][1]
while attacks and monsters[i][0] > attacks[0][0]:
_, atk_ = attacks.popleft()
atk -= atk_
if atk_this - atk > 0:
ans += atk_this - atk
attacks.append((monsters[i][0]+2*D, atk_this-atk))
atk += atk_this - atk
print(ans)
if __name__ == '__main__':
main()
| 0 | null | 41,638,701,090,660 | 57 | 230 |
n= int(input())
mod=10**9+7
a= [int(x ) for x in input().split()]
b= a[:]
s=0
for i in range(n-2,-1,-1):
b[i]=b[i+1]+b[i]
for i in range(n):
s += (b[i]-a[i])*a[i]
print(s%mod) | n = int(input())
#n, m = map(int, input().split())
al = list(map(int, input().split()))
#al=[list(input()) for i in range(n)]
mod = 10**9+7
add = 0
ans = 0
for i in range(n-1, 0, -1):
add = (add+al[i]) % mod
ans = (ans+add*al[i-1]) % mod
print(ans)
| 1 | 3,806,348,642,080 | null | 83 | 83 |
import sys
a,b,c = map(int, sys.stdin.readline().rstrip().split(' '))
print('Yes' if (a<b<c) else 'No') | def parseSpaceDivideIntArgs(arg):
tmpArr = arg.split()
ret = []
for s in tmpArr:
ret.append(int(s))
return ret
instr = input()
# instr = "1 2 3"
instrSpl = parseSpaceDivideIntArgs(instr)
a = instrSpl[0]
b = instrSpl[1]
c = instrSpl[2]
if a < b & b < c:
print("Yes")
else:
print("No")
| 1 | 384,460,949,828 | null | 39 | 39 |
def main():
a,b,c=map(int,input().split())
k = int(input())
for i in range(k):
if a < b < c:
break
elif a >= b:
b *= 2
elif b >= c:
c *= 2
if a < b < c:
print('Yes')
else:
print('No')
main() | A,B,C=map(int,input().split())
K=int(input())
D=[]
for i in range(K):
for j in range(K-i):
if A*(2**i)<B*(2**j) and B*(2**j)<C*(2**(K-i-j)):
D.append('Yes')
else:
D.append('No')
if ('Yes' in D)==True:
print('Yes')
else:
print('No') | 1 | 6,966,282,218,728 | null | 101 | 101 |
n,k=map(int,input().split())
ar=list(map(int,input().split()))
ar.sort()
pos=0
for i in range(k):
pos+=ar[i]
print(pos) | N,K = list(map(int,input().split()))
P = list(map(int,input().split()))
def bubblesort(l):
for index in range(len(l)-1, 0, -1):
for low in range(index):
if l[low] > l[low+1]:
tmp = l[low+1]
l[low+1] = l[low]
l[low] = tmp
return l
bubblesort(P)
sum = 0
for i in range(K):
sum = sum + P[i]
print(sum) | 1 | 11,520,741,516,988 | null | 120 | 120 |
n=int(input())
d = {}
for _ in range(n):
op,s = input().split()
if op == 'insert': d[s] = 'yes'
elif op == 'find' : print(d.get(s,'no')) | n = int(input())
d = {}
for i in range(n):
cmd = input()
if cmd[0] == 'i':
d[cmd[7:]] = 0
else:
print('yes' if cmd[5:] in d else 'no') | 1 | 77,162,491,968 | null | 23 | 23 |
N = int(input())
A = list(map(int, input().split()))
if N%2==0:
dp = [[0]*2 for _ in range(N)]
dp[0][0] = A[0]
dp[1][1] = A[1]
for i in range(2, N):
if i==2:
dp[i][0] = dp[i-2][0]+A[i]
else:
dp[i][0] = dp[i-2][0]+A[i]
dp[i][1] = max(dp[i-3][0]+A[i], dp[i-2][1]+A[i])
print(max(dp[N-2][0], dp[N-1][1]))
else:
dp = [[0]*3 for _ in range(N)]
dp[0][0] = A[0]
dp[1][1] = A[1]
dp[2][2] = A[2]
for i in range(2, N):
if i==2:
dp[i][0] = dp[i-2][0]+A[i]
elif i==3:
dp[i][0] = dp[i-2][0]+A[i]
dp[i][1] = max(dp[i-2][1]+A[i], dp[i-3][0]+A[i])
else:
dp[i][0] = dp[i-2][0]+A[i]
dp[i][1] = max(dp[i-3][0]+A[i], dp[i-2][1]+A[i])
dp[i][2] = max(dp[i-4][0]+A[i], dp[i-3][1]+A[i], dp[i-2][2]+A[i])
print(max(dp[N-3][0], dp[N-2][1], dp[N-1][2])) | # 写経AC
from collections import defaultdict
N = int(input())
A = [int(i) for i in input().split()]
# dp[(i, x, flag)]:= i番目まででx個選んでいる時の最大値
# flag: i番目をとるフラグ
dp = defaultdict(lambda: -float("inf"))
# 初期条件
dp[(0, 0, 0)] = 0
# 貰うDP
for i, a in enumerate(A, 1):
# i番目までで選ぶ個数
for x in range((i // 2) - 1, (i + 1) // 2 + 1):
dp[(i, x, 0)] = max(dp[(i - 1, x, 0)], dp[(i - 1, x, 1)])
dp[(i, x, 1)] = dp[(i - 1, x - 1, 0)] + a
print(max(dp[(N, N // 2, 0)], dp[(N, N // 2, 1)])) | 1 | 37,415,700,552,790 | null | 177 | 177 |
N,M,K = map(int, input().split())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
a = [0]
b = [0]
for i in range(N):
a.append(a[i] + A[i])
for j in range(M):
b.append(b[j] + B[j])
ans = 0
j = M
for i in range(N+1):
if a[i] > K:
break
while a[i] + b[j] > K:
j -= 1
ans = max(ans, i+j)
print(ans) | from itertools import accumulate
from bisect import bisect_right
N, M, K = map(int,input().split())
A = [0]+list(accumulate(map(int,input().split()), lambda x,y:x+y))
B = [0]+list(accumulate(map(int,input().split()), lambda x,y:x+y))
ans = 0
for i in range(N+1):
left = K-A[i]
if left < 0:
break
j = bisect_right(B, left)
ans = max(ans, i+j-1)
print(ans) | 1 | 10,675,655,293,110 | null | 117 | 117 |
from collections import deque
from math import ceil
n,d,a = map(int,input().split())
M = [list(map(int,input().split())) for i in range(n)]
M = sorted([(x,ceil(h/a)) for x,h in M])
que = deque()
ans = 0
atack = 0
for x,h in M:
while len(que) > 0 and que[0][0] < x:
tx,ta = que.popleft()
atack -= ta
bomb_num = max(0, h-atack)
atack += bomb_num
ans += bomb_num
if bomb_num > 0:
que.append([x+d*2,bomb_num])
print(ans) | def resolve():
x = list(map(int, input().split()))
for i in range(5):
if x[i] == 0:
print(i+1)
return
if __name__ == "__main__":
resolve() | 0 | null | 47,927,376,454,910 | 230 | 126 |
N, K = map(int, input().split(' '))
h_ls = map(int, input().split(' '))
cnt = 0
for i in h_ls:
if i >= K:
cnt += 1
print(cnt) | data = [None] * 4
for i in xrange(4):
data[i] = [None] * 3
for j in xrange(3):
data[i][j] = [0] * 10
n = input()
for i in xrange(n):
line = map(int, raw_input().split())
data[line[0] - 1][line[1] - 1][line[2] - 1] += line[3]
for i in xrange(4):
for j in xrange(3):
s = ""
for k in xrange(10):
s += ' '
s += str(data[i][j][k])
print s
if i < 3:
print '#' * 20 | 0 | null | 89,889,558,279,960 | 298 | 55 |
import itertools
n, m, q = map(int, input().split())
lst = []
for _ in range(q):
l = [int(i) for i in input().split()]
lst.append(l)
lists = list(itertools.combinations_with_replacement(range(1, m+1), n))
#print(lists)
max_point = 0
for each in lists:
point = 0
for i in range(q):
l = lst[i]
a = l[0] - 1
b = l[1] - 1
c = l[2]
if each[b] - each[a] == c:
point += l[3]
if point > max_point:
max_point = point
print(max_point) | N, M ,Q = map(int,input().split())
Rq = [list(map(int,input().split())) for _ in range(Q)]
ary = [1 for _ in range(N)]
ans = 0
while True:
#print(ary)
pt = 0
for j in range(Q):
rq = Rq[j]
if ary[rq[1]-1]-ary[rq[0]-1] == rq[2]:
pt += rq[3]
ans = max(ans,pt)
if ary[0] == M:
break
#次の配列へ
for i in range(-1, -N-1, -1):
if ary[i] < M:
ary[i] += 1
tmp = ary[i]
for l in range(i+1, 0):
ary[l] = tmp
break
print(ans)
| 1 | 27,586,484,623,488 | null | 160 | 160 |
k = int(input())
s = str(input())
if len(s) > k:
s = s[:k] + '...'
print(s) | n=int(input())
syakkin=100000
for i in range(n):
syakkin*=1.05
if syakkin%1000!=0:
syakkin=syakkin-syakkin%1000+1000
print(int(syakkin))
| 0 | null | 9,768,009,079,180 | 143 | 6 |
from itertools import accumulate
from bisect import bisect_left,bisect_right
def main():
n,m,k=map(int,input().split())
a=[0]+list(accumulate(map(int,input().split())))
b=[0]+list(accumulate(map(int,input().split())))
result = 0
for i in range(n+1):
tmp = k - a[i]
if tmp < 0:
continue
tmpNum = i + bisect_right(b, tmp) - 1
if tmpNum > result:
result = tmpNum
print(result)
if __name__ == "__main__":
main() |
def main():
x, n = map(int, input().split(" "))
p =[]
dif = 1e2
ans = 0
l_a = [i for i in range(102)]
if n != 0:
p = list(map(int, input().split(" ")))
for ele in l_a[::-1]:
if abs(x - ele) <= dif and ele not in p:
ans = ele
dif = abs(x - ele)
print(ans)
if __name__ == "__main__":
main() | 0 | null | 12,469,731,751,970 | 117 | 128 |
n = int(input())
a = list(map(int, input().split()))
b = sorted(enumerate(a), key=lambda x:x[1])
c = [b[i][0]+1 for i in range(n)]
d = [str(x) for x in c]
e = " ".join(d)
print(e) | n=int(input())
a=list(map(int,input().split()))
ans=[x for x in range(n)]
for i in range(n):
ans[(a[i] - 1)] = i + 1
for aaa in ans:
print(aaa) | 1 | 180,542,244,920,910 | null | 299 | 299 |
has_seven = "7" in input()
if has_seven:
print("Yes")
else:
print("No") | X, Y = map(int, input().split())
x = 2*X-1/2*Y
y = -X + 1/2*Y
if x.is_integer() and y.is_integer() == True:
if x >= 0 and y >= 0:
print('Yes')
else:
print('No')
else:
print('No') | 0 | null | 24,162,228,147,890 | 172 | 127 |
N = int(input())
A = list(map(int,input().split()))
if 0 in A:
prod = 0
else:
prod = 1
for i in range(N):
prod *= A[i]
if prod>10**18:
prod = -1
break
print(prod) | N = int(input())
alist = list(map(int, input().split()))
k = 1
if 0 in alist:
print(0)
else:
for i in range(0,N):
k = k*alist[i]
if k > 1000000000000000000:
k= -1
break
print(k) | 1 | 16,136,061,721,272 | null | 134 | 134 |
from collections import deque
h,w=map(int,input().split())
s=[input() for _ in range(h)] #マップ
vi=[ [-1 for _ in range(w)] for _ in range(h)]#visit
st=deque()
d=[[0,1],[-1,0],[1,0],[0,-1]]
mx=0
for i in range(h):
for j in range(w):
vi=[ [-1 for _ in range(w)] for _ in range(h)]
st.append([i,j,0])
while st:
h1,w1,k=st.popleft()
if 0<=h1<h and 0<=w1<w and vi[h1][w1]==-1 and s[h1][w1]==".":
vi[h1][w1]=k
for m in d:
st.append([h1+m[0],w1+m[1],k+1])
for m in vi:
mx=max(mx,max(m))
print(mx) | # -*- coding: utf-8 -*-
# B
import sys
from collections import defaultdict, deque
from heapq import heappush, heappop
import math
import bisect
input = sys.stdin.readline
# 再起回数上限変更
# sys.setrecursionlimit(1000000)
N, k = map(int, input().split())
h = list(map(int, input().split()))
# print(h)
h.sort()
a = bisect.bisect_left(h, k)
print(N-a)
| 0 | null | 136,644,740,641,948 | 241 | 298 |
h,n = map(int,input().split())
a = list(map(int,input().split()))
print("Yes" if sum(a)>=h else "No") | n=int(input())
A=[]
B=[]
for i in range(n):
a,b=map(int,input().split())
A.append(a)
B.append(b)
A.sort()
B.sort()
if n%2==1:
print(B[n//2]-A[n//2]+1)
else:
print(int(((B[n//2]+B[n//2-1])/2-(A[n//2]+A[n//2-1])/2)*2+1))
| 0 | null | 47,748,859,318,682 | 226 | 137 |
n = int(input())
s = []
t = []
for _ in range(n):
name,time = map(str,input().split())
s.append(name)
t.append(int(time))
target = input()
start = s.index(target)
ans = 0
for i in range(start+1,n):
ans += t[i]
print(ans) | n = int(input())
s = []
t = []
for i in range(n):
a,b = input().split()
s.append(a)
t.append(int(b))
x = s.index(input())
ans = 0
for i in range(x+1,n):
ans += t[i]
print(ans) | 1 | 96,811,286,422,400 | null | 243 | 243 |
for x in range(1,10):
for y in range(1,10):
print str(x)+"x"+str(y)+"="+str(x*y) | n=int(input())
c=input()
r_cnt=c.count('R')
w_cnt=c.count('W')
last_c='R'*r_cnt+'W'*w_cnt
num=0
for i in range(n):
if c[i]!=last_c[i]:
num+=1
print((num+2-1)//2) | 0 | null | 3,147,441,637,042 | 1 | 98 |
n = int(input())
A = list(map(int, input().split()))
A.sort()
l = [False]*(A[n-1] + 1)
fix = []
for i in A:
if l[i]:
fix.append(i)
l[i] = True
for i in range(A[n-1]+1):
if l[i]:
for j in range(i*2, A[n-1]+1, i):
l[j] = False
for i in fix:
l[i] = False
ans = [i for i in range(A[n-1] + 1) if l[i]]
print(len(ans))
| #!/usr/bin/env python3
import sys
import collections
input = sys.stdin.readline
def ST():
return input().rstrip()
def I():
return int(input())
def MI():
return map(int, input().split())
def LI():
return list(MI())
N = I()
A = LI()
A.sort()
cnt = collections.Counter(A)
end = A[-1] + 1
for a in A:
if cnt[a] >= 2:
del cnt[a]
for i in range(a * 2, end, a):
del cnt[i]
print(sum(cnt.values()))
| 1 | 14,384,910,702,172 | null | 129 | 129 |
A,B,C,D=map(float,input().split())
E=(C-A)**2
F=(D-B)**2
print((float)(E+F)**(1/2))
| #(63)距離
import math
x1,y1,x2,y2=map(float,input().split())
a=abs(x2-x1)
b=abs(y2-y1)
c=math.sqrt(a**2+b**2)
print('{:.8f}'.format(c))
| 1 | 160,017,190,214 | null | 29 | 29 |
def main() -> None:
n = input()
if n[-1] in ['2', '4', '5', '7', '9']:
print('hon')
elif n[-1] in ['0', '1', '6', '8']:
print('pon')
else:
print('bon')
return
if __name__ == '__main__':
main()
| n=int(input())
print(-~n//2/n) | 0 | null | 98,276,329,862,272 | 142 | 297 |
n = int(input())
arr = list(map(int, input().split()))
arr = sorted(arr)
m = arr[-1]
li = [0]*(m+1)
cnt = 0
for i in arr:
for j in range(i, m+1, i):
li[j] += 1
for i in arr:
if li[i] == 1:
cnt += 1
print(cnt) | import numpy as np
from collections import Counter
from math import sqrt
from time import time
def main():
N = int(input())
np_a_o = list([int(x) for x in input().split()])
np_a = Counter(np_a_o)
np_a_keys = set(np_a.keys())
div_list = set()
key_max = max(np_a_keys)
c = 0
for key in np_a_keys:
for div in range(key*2, key_max+1, key):
div_list.add(div)
r = np_a_keys - div_list
u, count = np.unique(np.array(np_a_o), return_counts=True)
r -= set(u[count > 1])
print(len(r))
if __name__ == '__main__':
main()
| 1 | 14,393,906,199,950 | null | 129 | 129 |
# -*- coding:utf-8 -*-
import sys
import math
array =[]
for line in sys.stdin:
array.append(line)
for i in range(len(array)):
num = array[i].split(' ')
a = int(num[0])
b = int(num[1])
n = a + b
print(int(math.log10(n) + 1)) |
def main():
k = int(input())
s = input()
if len(s) > k:
print(s[:k]+"...")
else:
print(s)
if __name__ == '__main__':
main()
| 0 | null | 9,869,225,646,750 | 3 | 143 |
def main():
a, b = map(lambda x: int(x.replace('.','')), input().split())
print(a*b//100)
if __name__ == '__main__':
main() | T1, T2 = map(int, input().split())
A1, A2 = map(int, input().split())
B1, B2 = map(int, input().split())
# 必ずB1の方を大きくする必要がある
if A1 > B1:
B1, A1 = A1, B1
B2, A2 = A2, B2
P = T1*(A1-B1) # Pは負の値
Q = T2*(A2-B2)
if P + Q == 0:
print("infinity")
exit()
elif P + Q < 0: # 出会う位置まで戻ってこれなかった
print(0)
exit()
elif P + Q > 0: # 限られた数だけあえる
if (-P % (P + Q)) == 0:
print(2*(-P // (P+Q)))
else:
print(2*(-P // (P+Q))+1)
| 0 | null | 73,814,008,991,998 | 135 | 269 |
from itertools import combinations
n, a, q, ms, cache = int(input()), list(map(int, input().split())), input(), map(int, input().split()), {}
l = set(sum(t) for i in range(n) for t in combinations(a, i + 1))
for m in ms:
print('yes' if m in l else 'no') | n = input()
A = map(int, raw_input().split())
q = input()
M = map(int, raw_input().split())
def solve(i, m):
if m == 0:
return True
if n <= i or sum(A) < m:
return False
x = (solve(i+1, m) or solve(i+1, m-A[i]))
return x
for m in M:
if solve(0, m):
print "yes"
else:
print "no" | 1 | 102,044,124,380 | null | 25 | 25 |
list = map(int,raw_input().split())
list.sort()
print'%d %d %d' %(list[0],list[1],list[2]) | N, X, M = map(int, input().split())
ls = [False]*M
ls_mod = []
x = X
for m in range(M+1):
if ls[x] == False:
ls_mod.append(x)
ls[x] = m
x = (x**2)%M
else:
last = m
fast = ls[x]
diff = last - fast
break
if M == 1:
print(0)
else:
if last > N:
print(sum(ls_mod[:N]))
else:
shou = (N-fast) // diff
amari = (N-fast) % diff
print(sum(ls_mod[:fast])+sum(ls_mod[fast:])*shou+sum(ls_mod[fast:fast+amari]))
| 0 | null | 1,588,522,366,668 | 40 | 75 |
c= int(input())
ans =0
s = 0
while c >1:
c = c//2
ans += 1
for i in range(1,ans+1):
s += 2**i
print(s+1) | n, k = map(int, input().split())
mod = 998244353
S = []
for _ in range(k):
l, r = map(int, input().split())
S.append([l, r])
dp = [0]*(n+1)
dp_s = [0]*(n+1)
dp[1] = 1
dp_s[1] = 1
for i in range(2, n+1):
for l, r in S:
li = max(i - r, 1)
ri = max(i - l, 0)
dp[i] = (dp[i] + (dp_s[ri] - dp_s[li-1])%mod) % mod
dp_s[i] = (dp_s[i-1] + dp[i])%mod
print(dp[n]%mod) | 0 | null | 41,526,848,502,464 | 228 | 74 |
from collections import defaultdict, deque
V, E = map(int, input().split())
graph = defaultdict(dict)
for _ in range(E):
a, b = map(int, input().split())
graph[a][b] = True
graph[b][a] = True
components = [] # list of components
visited = set()
for i in range(1, V+1):
if i in visited:
continue
# do bfs starting from i
current_component = set()
queue = deque([i])
visited.add(i)
while queue:
x = queue.popleft()
current_component.add(x)
for nbr in graph[x]:
if nbr not in visited:
queue.append(nbr)
visited.add(nbr)
components.append(current_component)
print(max(map(len, components))) | '''
We can show that if u and v belong to the same connected component, then they are friends w/ each other
So everyone in a given connected component is friends with one another
So everyone in a given connected component must be separated into different groups
If we have a CC of with sz nodes in it, then we need at least sz different groups
So, the minimum number of groups needed is max sz(CC)
'''
import sys
sys.setrecursionlimit(2*10**5+5)
n, m = map(int,input().split())
adj = [[] for u in range(n+1)]
for i in range(m):
u, v = map(int,input().split())
adj[u].append(v)
adj[v].append(u)
vis = [False for u in range(n+1)]
def dfs(u):
if vis[u]:
return 0
vis[u] = True
sz = 1
for v in adj[u]:
sz += dfs(v)
return sz
CCs = []
for u in range(1,n+1):
if not vis[u]:
CCs.append(dfs(u))
print(max(CCs)) | 1 | 3,957,842,583,268 | null | 84 | 84 |
import sys
def input(): return sys.stdin.readline().rstrip()
def main():
L=int(input())
print(L**3/27)
if __name__=='__main__':
main() | # C - Distinct or Not
# https://atcoder.jp/contests/abc154/tasks/abc154_c
num = int(input())
p = list(map(int, input().split()))
list.sort(p)
ret = "YES"
for i in range(num-1):
if p[i] == p[i+1]:
ret = "NO"
break
print("{}".format(ret)) | 0 | null | 60,470,963,678,900 | 191 | 222 |
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) | for i in range(1, 10):
for j in range(1, 10):
fmt = format("{0}x{1}={2}")
g = fmt.format(i, j, i*j)
print(g) | 0 | null | 18,861,455,776,928 | 178 | 1 |
import re
print(re.sub(r"\?","D",input())) | N = int(input())
A = list(map(int, input().split()))
flag = 1
counter = 0
while flag:
flag = 0
for i in reversed(range(1,N)):
if A[i] < A[i-1]:
A[i], A[i-1] = A[i-1], A[i]
counter += 1
flag = 1
print(" ".join(map(str, A)))
print(counter) | 0 | null | 9,276,832,776,484 | 140 | 14 |
s = list(input())
num = 0
n = len(s)
l = 0
i = 0
while i < n:
if s[i] == '<':
l+=num
num+=1
i+=1
if i==n:
l+=num
else:
cur = 0
while i < n and s[i]=='>':
i+=1
cur+=1
if cur <= num:
l+=num
cur-=1
l+=(cur*(cur+1))//2
num = 0
print(l) | import itertools
N = int(input())
P=tuple(int(c) for c in input().split())
Q=tuple(int(c) for c in input().split())
l=list(c for c in itertools.permutations(range(1,N+1),N))
print(abs(l.index(P)-l.index(Q))) | 0 | null | 128,499,491,838,942 | 285 | 246 |
N = int(input())
Up = []
Down = []
for _ in range(N):
S = input()
L = [0]
mi = 0
now = 0
for __ in range(len(S)):
if S[__] == '(':
now += 1
else:
now -= 1
mi = min(mi, now)
if now > 0:
Up.append((mi, now))
else:
Down.append((mi - now, mi, now))
Up.sort(reverse=True)
Down.sort()
now = 0
for i, j in Up:
if now + i < 0:
print('No')
exit()
else:
now += j
for _, i, j in Down:
if now + i < 0:
print('No')
exit()
else:
now += j
if now == 0:
print('Yes')
else:
print('No')
| def main():
N, M, K = map(int, input().split())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
total_T_in_A = [0] * (N+1)
total_T_in_A[1] = A[0]
total_T_in_B = [0] * M
total_T_in_B[0] = B[0]
for i in range(1, N+1):
total_T_in_A[i] = total_T_in_A[i-1] + A[i-1]
for i in range(1, M):
total_T_in_B[i] = total_T_in_B[i-1] + B[i]
result = 0
for i in range(N+1):
# A から i 冊読むときにかかる時間
i_A_T = total_T_in_A[i]
if K < i_A_T:
continue
if K == i_A_T:
result = max(result, i)
continue
rem_T = K - i_A_T
# total_T_in_B は累積和を格納した、ソート済の配列
# B_i <= rem_T < B_i+1 となるような B_i を二分探索によって探す
first = total_T_in_B[0]
last = total_T_in_B[M-1]
if rem_T < first:
result = max(result, i)
continue
if last <= rem_T:
result = max(result, i + M)
continue
# assume that first <= rem_T <= last
first_i = 0
last_i = M - 1
while first_i < last_i:
if abs(last_i - first_i) == 1:
break
mid_i = (first_i + last_i) // 2
if rem_T < total_T_in_B[mid_i]:
last_i = mid_i
else:
first_i = mid_i
result = max(result, i + first_i + 1)
print(result)
main()
| 0 | null | 17,295,549,296,750 | 152 | 117 |
# Binary Indexed Tree (Fenwick Tree)
class BIT:
def __init__(self, n):
self.n = n
self.bit = [0]*(n+1)
self.el = [0]*(n+1)
def sum(self, i):
s = 0
while i > 0:
s += self.bit[i]
i -= i & -i
return s
def add(self, i, x):
# assert i > 0
self.el[i] += x
while i <= self.n:
self.bit[i] += x
i += i & -i
def get(self, i, j=None):
if j is None:
return self.el[i]
return self.sum(j) - self.sum(i-1)
def lower_bound(self,x):
w = i = 0
k = 1<<((self.n).bit_length())
while k:
if i+k <= self.n and w + self.bit[i+k] < x:
w += self.bit[i+k]
i += k
k >>= 1
return i+1
def alph_to_num(s):
return ord(s)-ord('a')
def solve():
N = int(input())
S = list(map(alph_to_num,list(input())))
Q = int(input())
bits = [BIT(N) for _ in range(26)]
for i in range(N):
bits[S[i]].add(i+1,1)
ans = []
for _ in range(Q):
x,y,z = input().split()
y = int(y)
if x=='1':
z = alph_to_num(z)
bits[S[y-1]].add(y,-1)
S[y-1] = z
bits[z].add(y,1)
if x=='2':
z = int(z)
ans.append(sum([bits[i].get(y,z)>0 for i in range(26)]))
return ans
print(*solve(),sep='\n') | def update(i,x):
i += d-1
bit = ord(x)-97
seg[i] = 0 | (1<<bit)
while i > 0:
i = (i-1)//2
seg[i] = seg[i*2+1]|seg[i*2+2]
def find(a,b,k,l,r):
if r <= a or b <= l:
return 0
if a <= l and r <= b:
return seg[k]
c1 = find(a,b,2*k+1,l,(l+r)//2)
c2 = find(a,b,2*k+2,(l+r)//2,r)
return c1|c2
n = int(input())
s = input()
q = int(input())
d = 1
while d < n:
d *= 2
seg = [0]*(2*d-1)
for i in range(n):
update(i,s[i])
for i in range(q):
type,a,b = input().split()
if type == "1":
update(int(a)-1,b)
else:
part = find(int(a)-1,int(b),0,0,d)
print(bin(part).count("1"))
| 1 | 62,529,654,793,110 | null | 210 | 210 |
import math
import sys
if __name__ == '__main__':
for line in sys.stdin:
a,b = map(int,line.split())
print(math.gcd(a,b),(a*b) // math.gcd(a,b))
| import math
john=[]
while True:
try:
john.append(input())
except EOFError:
break
for i in john:
k=list(map(int,i.split()))
print(int(math.gcd(k[0],k[1])),int(k[0]*k[1]/math.gcd(k[0],k[1])))
| 1 | 567,082,178 | null | 5 | 5 |
N = int(input())
A = list(map(int, input().split()))
mina = min(A)
maxa = max(A)
AA = [0]*(maxa-mina+1)
for i in range(N):
maxj = maxa//A[i]
for j in range(1,maxj+1):
AA[j*A[i]-mina]+=1
ans = 0
for i in range(N):
if AA[A[i]-mina] == 1:
ans += 1
print(ans) | import collections
n,x,y = map(int,input().split())
h = [[] for _ in range(n+1) ]
for i in range(1,n+1):
if i+1<n+1:
h[i].append(i+1)
if i-1>0:
h[i].append(i-1)
h[x].append(y)
h[y].append(x)
k = [0]*n
for i in range(1,n+1):
q = collections.deque([i])
step = [-1]*(n+1)
step[i] = 0
while q:
now = q.popleft()
for hh in h[now]:
if step[hh] == -1:
q.append(hh)
step[hh] = step[now]+1
k[step[now]+1] += 1
for i in range(1,n):
print(k[i]//2) | 0 | null | 29,148,589,108,730 | 129 | 187 |
n = int(input())
if n%2 == 1:
print (0)
exit()
cnt = 0
for i in range(1,26):
x = pow(5,i)
x *= 2
if x > n:
continue
cnt += n//x
print (cnt) | # 高橋君と青木君がモンスターを闘わせます。
# 高橋君体力 A 攻撃力 B です。
# 青木君体力 C 攻撃力 D です。
# 高橋君→青木君→高橋君→青木君→... の順に攻撃を行います。
# このことをどちらかのモンスターの体力が 0 以下になるまで続けたとき、
# 先に自分のモンスターの体力が 0 以下になった方の負け、そうでない方の勝ちです。
# 高橋君が勝つなら Yes、負けるなら No を出力してくださ
a, b, c, d = list(map(int, input(). split()))#10 9 10 10
while True:
c -= b
if c <= 0:
print("Yes")
break
a -= d
if a <= 0:
print("No")
break
| 0 | null | 72,542,415,588,870 | 258 | 164 |
n,x,t=map(int,input().split())
if n%x==0:print(n//x*t)
else:print((n//x+1)*t) | n = int(input())
k = input()
a = k.count("R")
b = k[:a].count("W")
print(b) | 0 | null | 5,316,181,115,520 | 86 | 98 |
from collections import deque
H,W=map(int,input().split())
S=[[c=='#' for c in input()] for _ in range(H)]
def bfs(i,j):
if S[i][j]:
return 0
que=deque()
que.append((i,j))
vis=[row[:] for row in S]
vis[i][j]=1
ans=-1
while que:
ans+=1
for _ in range(len(que)):
i,j=que.popleft()
for ni,nj in nbs(i,j):
if not vis[ni][nj]:
que.append((ni,nj))
vis[ni][nj]=1
return ans
def nbs(i,j):
for ni,nj in (i-1,j),(i,j+1),(i+1,j),(i,j-1):
if 0<=ni<H and 0<=nj<W:
yield ni,nj
ans=0
for i in range(H):
for j in range(W):
ans=max(ans,bfs(i,j))
print(ans)
| import sys
input = sys.stdin.readline
n=int(input())
a=list(map(int, input().split()))
a.sort()
m=max(a)
arr=[0]*(m+1)
flag=[True]*(m+1)
ans=0
for i in range(n):
if flag[a[i]]:
arr[a[i]]+=1
if not arr[a[i]]==1:
continue
for j in range(a[i]*2,m+1,a[i]):
flag[j]=False
print(arr.count(1)) | 0 | null | 54,737,097,934,152 | 241 | 129 |
def liner_search(r,key):
for x in r:
if x == key:
return True
return False
N = int(input())
S = list(map(int, input().split()))
q = int(input())
Key = list(map(int, input().split()))
cnt = 0
for i in range(q):
if liner_search(S, Key[i]):
cnt += 1
print(cnt) | def selectionSort(A, N):
count = 0
for i in xrange(N):
minj = i
cflag = 0
for j in xrange(i, N):
if A[j] < A[minj]:
minj = j
cflag = 1
A[i], A[minj] = A[minj], A[i]
count+=cflag
return count
# MAIN
N = input()
A = map(int, raw_input().split())
c = selectionSort(A, N)
print " ".join(map(str, A))
print c | 0 | null | 43,251,988,348 | 22 | 15 |
while True:
ia=[int(i) for i in input().split(" ")]
if ia[0]==ia[1]==0:
break
print(" ".join([str(i) for i in sorted(ia)])) | import sys
for i,ws in enumerate(sys.stdin,1):
list = sorted(map(int, ws[:-1].split()))
if list[0] == 0 and list[1] == 0:
break
print(' '.join(map(str,list))) | 1 | 507,272,438,580 | null | 43 | 43 |
n=int(input())
a=list(map(int,input().split()))
c=a[0]
for i in range(1,n):
c=c^a[i]
for i in range(n):
print(c^a[i]) | a= list(map(int,input().split()))
N = a[0]
K = a[1]
a = [0]*K
mod = 10**9+7
for x in range(K,0,-1):
a[x-1] = pow(K//x, N,mod)
for t in range(2,K//x+1):
a[x-1] -= a[t*x-1]
s = 0
for i in range(K):
s += (i+1)*a[i]
ans = s%mod
print(ans) | 0 | null | 24,767,050,724,082 | 123 | 176 |
n=int(input())
if n%2==0:
print("0.5")
if n%2==1:
print((int(n/2)+1)/n) | n = int(input())
if n % 2 == 0:
print("{:.10f}".format((n/2)/n))
else:
print("{:.10f}".format((n//2+1)/n))
| 1 | 177,081,225,268,090 | null | 297 | 297 |
import itertools
from collections import deque,defaultdict,Counter
from itertools import accumulate
import bisect
from heapq import heappop,heappush,heapify
import math
from copy import deepcopy
import queue
import numpy as np
# sympy as syp(素因数分解とか)
Mod = 1000000007
def sieve_of_eratosthenes(n):
if not isinstance(n,int):
raise TypeError("n is not int")
if n<2:
raise ValueError("n is not effective")
prime = [1]*(n+1)
for i in range(2,int(math.sqrt(n))+1):
if prime[i] == 1:
for j in range(2*i,n+1):
if j%i == 0:
prime[j] = 0
res = []
for i in range(2,n+1):
if prime[i] == 1:
res.append(i)
return res
class UnionFind:
def __init__(self,n):
self.parent = [i for i in range(n+1)]
self.rank = [0 for i in range(n+1)]
def findroot(self,x):
if x == self.parent[x]:
return x
else:
y = self.parent[x]
y = self.findroot(self.parent[x])
return y
def union(self,x,y):
px = self.findroot(x)
py = self.findroot(y)
if px < py:
self.parent[y] = px
else:
self.parent[px] = py
def same_group_or_no(self,x,y):
return self.findroot(x) == self.findroot(y)
def main(): #startline-------------------------------------------
n, x, y = map(int, input().split())
ans = [0]*(n-1)
for i in range(n-1):
for j in range(i + 1, n):
if j < x - 1 or y - 1 < i:
distance = j - i
else:
distance = min(j - i, abs(x - 1 - i) + abs(y - 1 - j) + 1)
ans[distance - 1] += 1
for i in range(n - 1):
print(ans[i])
if __name__ == "__main__":
main() #endline=============================================== | n,x,y = map(int,input().split())
ans_ls = [0] * (n-1)
for start in range(1,n):
for end in range(start+1,n+1):
cost_1 = end - start
cost_2 = abs(start - x) + abs(end - y) + 1
cost = min(cost_1,cost_2)
ans_ls[cost-1] += 1
for ans in ans_ls:
print(ans)
| 1 | 44,047,806,038,100 | null | 187 | 187 |
import math
def read_int():
return int(input().strip())
def read_ints():
return list(map(int, input().strip().split(' ')))
def read_into(*A):
for a, v in zip(A, read_ints()):
a.append(v)
def solve():
N, M, L = read_ints()
dist = [
[math.inf for _ in range(N)] for _ in range(N)
]
for i in range(N):
dist[i][i] = 0
for _ in range(M):
a, b, c = read_ints()
dist[a-1][b-1] = dist[b-1][a-1] = c
for k in range(N):
for i in range(N):
for j in range(N):
dist[i][j] = dist[j][i] = min(dist[i][j], dist[i][k]+dist[k][j])
for i in range(N):
for j in range(N):
if i == j: continue
dist[i][j] = 1 if dist[i][j] <= L else math.inf
for k in range(N):
for i in range(N):
for j in range(N):
dist[i][j] = dist[j][i] = min(dist[i][j], dist[i][k]+dist[k][j])
Q = read_int()
for _ in range(Q):
s, t = read_ints()
if dist[s-1][t-1] == math.inf:
print(-1)
else:
print(dist[s-1][t-1]-1)
if __name__ == '__main__':
solve()
| def getN():
return int(input())
def getNM():
return map(int, input().split())
def getList():
return list(map(int, input().split()))
def getArray(intn):
return [int(input()) for i in range(intn)]
def input():
return sys.stdin.readline().rstrip()
def rand_N(ran1, ran2):
return random.randint(ran1, ran2)
def rand_List(ran1, ran2, rantime):
return [random.randint(ran1, ran2) for i in range(rantime)]
def rand_ints_nodup(ran1, ran2, rantime):
ns = []
while len(ns) < rantime:
n = random.randint(ran1, ran2)
if not n in ns:
ns.append(n)
return sorted(ns)
def rand_query(ran1, ran2, rantime):
r_query = []
while len(r_query) < rantime:
n_q = rand_ints_nodup(ran1, ran2, 2)
if not n_q in r_query:
r_query.append(n_q)
return sorted(r_query)
from collections import defaultdict, deque, Counter
from sys import exit
from decimal import *
from heapq import heapify, heappop, heappush
import math
import random
import string
from copy import deepcopy
from itertools import combinations, permutations, product
from operator import mul, itemgetter
from functools import reduce
from bisect import bisect_left, bisect_right
import sys
sys.setrecursionlimit(1000000000)
mod = 10 ** 9 + 7
#############
# Main Code #
#############
N, M, L = getNM()
edges = [getList() for i in range(M)]
Q = getN()
query = [getList() for i in range(Q)]
dist = [[float('inf')] * N for i in range(N)]
for i in range(N):
dist[i][i] = 0
for i in range(M):
a, b, c = edges[i]
dist[a - 1][b - 1] = c
dist[b - 1][a - 1] = c
def warshall_floyd(dist):
for k in range(N):
# i:start j:goal k:中間地点でループ回す
for i in range(N):
for j in range(N):
dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j])
return dist
# まず一回回す
warshall_floyd(dist)
# distの抽象化
# edgesの張り替え
dist_alta = [[float('inf')] * N for i in range(N)]
for i in range(N):
for j in range(i, N):
if i == j:
dist_alta[i][j] = 0
continue
if dist[i][j] <= L:
dist_alta[i][j] = 1
dist_alta[j][i] = 1
warshall_floyd(dist_alta)
for s, t in query:
if dist_alta[s - 1][t - 1] == float('inf'):
print(-1)
continue
print(dist_alta[s - 1][t - 1] - 1) | 1 | 172,907,018,766,530 | null | 295 | 295 |
n, k, c = map(int, input().split())
s = input()
work = [1]*n
rest = 0
for i in range(n):
if rest:
rest -= 1
work[i] = 0
continue
if s[i] == 'x':
work[i] = 0
elif s[i] == 'o':
rest = c
rest = 0
for i in reversed(range(n)):
if rest:
rest -= 1
work[i] = 0
continue
if s[i] == 'o':
rest = c
if k < sum(work):
print()
else:
for idx, bl in enumerate(work):
if bl:
print(idx+1)
| import sys
def input(): return sys.stdin.readline().strip()
def main():
N, K, C = map(int, input().split())
S = input()
"""
そもそもK日働くことができるのかは、左から順に働きづめにしてやれば貪欲法で判定できる。
（必ず働かないといけない日）＝（その日を×にするとK日働けなくなる日）
なので、O(N^2)でなら愚直な判定が可能。
これをO(N)に高速化するために、必ず働かないといけないか判定したい日に対してその左右に働ける日が
何個あるかを求める。
→そうすると判定したい日を１日ずらしたときに尺取り法のようなことが可能！
ただし左側の最終日と右側の初日が(C+2)日以下の場合は１日減らさないといけない。
"""
# 左から貪欲に働く日を数える
L = []
work = 0
diff = C + 1
for i in range(N):
if diff > C and S[i] == "o":
work += 1
L.append((work, 0))
diff = 0
else:
L.append((work, diff))
diff += 1
#print("L={}".format(L))
# 右から貪欲に働く日を数える
R = []
work = 0
diff = C + 1
for i in range(1, N + 1):
if diff > C and S[-i] == "o":
work += 1
R.append((work, 0))
diff = 0
else:
R.append((work, diff))
diff += 1
R.reverse()
#print("R={}".format(R))
# 求積パート
ans = []
if N == 1 and S[0] == "o":
ans.append(1)
elif N >= 2:
for i in range(N):
if S[i] == "x":
continue
else:
if i == 0:
total_work = R[1][0]
elif i == N - 1:
total_work = L[N - 2][0]
else:
total_work = L[i - 1][0] + R[i + 1][0]
if L[i - 1][1] + R[i + 1][1] + 1 < C:
total_work -= 1
#print("i={}, total_work={}".format(i+1, total_work))
if total_work < K:
ans.append(i + 1)
for d in ans:
print(d)
if __name__ == "__main__":
main()
| 1 | 40,612,619,888,448 | null | 182 | 182 |
alpha = "abcdefghijklmnopqrstuvwxyz"
A = [0]*26
while True :
try :
n = input()
for i in range(len(n)) :
if n[i] in alpha or n[i].lower() in alpha :
A[alpha.index(n[i].lower())] += 1
except :
break
for j in range(len(A)) :
print(alpha[j], ":", A[j])
| import sys
Target = ""
for line in sys.stdin:
Target += line
for i in range(26):
print(chr(i + 97), ":", Target.lower().count(chr(i + 97))) | 1 | 1,658,591,684,060 | null | 63 | 63 |
import sys,math
input = sys.stdin.readline
n,k = map(int,input().split())
a = [int(i) for i in input().split()]
f = [int(i) for i in input().split()]
a.sort()
f.sort(reverse=True)
c = [(i*j,j) for i,j in zip(a,f)]
m = max(c)
def is_ok(arg):
# 条件を満たすかどうか？問題ごとに定義
chk = 0
for i,j in c:
chk += math.ceil(max(0,(i-arg))/j)
return chk <= k
def bisect_ok(ng, ok):
'''
初期値のng,okを受け取り,is_okを満たす最小(最大)のokを返す
まずis_okを定義
ng = 最小の値-1 ok = 最大の値+1 で最小
最大最小が逆の場合はng ok をひっくり返す
'''
while (abs(ok - ng) > 1):
mid = (ok + ng) // 2
if is_ok(mid):
ok = mid
else:
ng = mid
return ok
print(bisect_ok(-1,m[0]+1)) | import sys
input = sys.stdin.readline
N = int(input())
def make_divisors(n):
divisors = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n//i)
# divisors.sort()
return divisors
a = make_divisors(N)
b = make_divisors(N - 1)
s = set(a + b)
res = 0
for x in s:
if x == 1: continue
t = N + 0
while t % x == 0: t //= x
res += (t % x == 1)
print(res) | 0 | null | 103,267,707,485,248 | 290 | 183 |
r = input()
r = int(r)
result = r**2
print(result) | n1 = int(input())
r1 = n1 * n1
print(r1)
| 1 | 144,715,955,309,792 | null | 278 | 278 |
n = int(input())
a,b = map(int, input().split())
F = True
while a<=b:
if a%n == 0:
print('OK')
F = False
break
a += 1
if F:
print('NG') | K = int(input())
A, B = map(int, input().split())
XK = list(x * K for x in range(1, 1000//K + 1))
for i in XK:
if (A <= i) & (i <= B):
print('OK')
break
else:
print('NG')
| 1 | 26,637,783,587,392 | null | 158 | 158 |
n, m = map(int, input().split())
if m%2 == 0:
x = m//2
y = m//2
else:
x = m//2
y = m//2+1
for i in range(x):
print(i+1, 2*x+1-i)
for i in range(y):
print(i+2*x+2, 2*y+2*x+1-i) | all = [suit + ' ' + str(rank) for suit in 'SHCD' for rank in range(1, 14)]
for _ in range(int(input())):
all.remove(input())
for card in all:
print(card)
| 0 | null | 14,963,790,140,348 | 162 | 54 |
while True:
a, b = map(int, input().split(" "))
if a == b == 0:
break
if a > b:
a, b = b, a
print("%d %d" % (a,b))
| # coding:utf-8
# ??\??????????????´??°????°???????????????????
i = 1
x = 1
y = 1
while x != 0 or y != 0:
xy = raw_input().split()
x = int(xy[0])
y = int(xy[1])
if x == 0 and y ==0:
break
if x < y :
print x,y
else:
print y,x | 1 | 515,204,939,050 | null | 43 | 43 |
x = int(input())
x //= 200
print(10 - x)
| import math as mt
import sys, string
from collections import Counter, defaultdict
input = sys.stdin.readline
MOD = 1000000007
# input functions
I = lambda : int(input())
M = lambda : map(int, input().split())
Ms = lambda : map(str, input().split())
ARR = lambda: list(map(int, input().split()))
def main():
n = I()
n -= 400
print(8 - n//200)
# testcases
tc = 1
for _ in range(tc):
main() | 1 | 6,692,397,711,812 | null | 100 | 100 |
import math
#import numpy as np
import queue
from collections import deque,defaultdict
import heapq as hpq
from sys import stdin,setrecursionlimit
#from scipy.sparse.csgraph import dijkstra
#from scipy.sparse import csr_matrix
ipt = stdin.readline
setrecursionlimit(10**7)
def main():
n,t = map(int,ipt().split())
dp = [[0,0] for i in range(t)]
for _ in range(n):
a,b = map(int,ipt().split())
for i in range(t-1,a-1,-1):
di = dp[i][1]
dpi = dp[i-a][1]+b
if di < dpi:
dp[i][1] = dpi
for i in dp:
if i[1] < i[0]+b:
i[1] = i[0]+b
for i in range(t-1,a-1,-1):
di = dp[i][0]
dpi = dp[i-a][0]+b
if di < dpi:
dp[i][0] = dpi
print(dp[t-1][1])
return
if __name__ == '__main__':
main()
| #!/usr/bin python3
# -*- coding: utf-8 -*-
from collections import deque
def main():
N = int(input())
Node = [set() for _ in range(N)]
Edge = {}
for i in range(N-1):
a , b = map(int, input().split())
a-=1
b-=1
if b<a:
a, b = b, a
Edge[(a, b)]=i
Node[a].add(b)
Node[b].add(a)
K = 0
for i, x in enumerate(Node):
if len(x)>K:
K = len(x)
top = i
q = deque()
seen = [False]*(N-1)
used = [set() for _ in range(N)]
q.append(top)
while len(q)>0:
cur = q.popleft()
col = 1
for i in Node[cur]:
if cur>i:
ed = (i, cur)
else:
ed = (cur, i)
if seen[Edge[ed]]==False:
while col in used[cur] or col in used[i]:
col+=1
seen[Edge[ed]] = col
used[cur].add(col)
used[i].add(col)
q.append(i)
print(K)
print('\n'.join(map(str, seen)))
if __name__ == '__main__':
main()
| 0 | null | 143,819,775,562,012 | 282 | 272 |
H = int(input())
a = 1
i = 1
while a < H:
a += 2 ** i
i += 1
print(a) | m,n=map(long,raw_input().split())
print m/n,
print m%n,
print '%.5f' % (float(m)/n) | 0 | null | 40,422,823,203,140 | 228 | 45 |
a = int(input())
b = int(input())
A = [a, b]
for i in range(1, 4):
if i not in A:
print(i)
| import itertools
n, m, q = map(int, input().split())
abcd = [list(map(int, input().split())) for _ in range(q)]
v = list(itertools.combinations_with_replacement(range(1, m+1), n))
ans = 0
for i in v:
s = 0
for a, b, c, d in abcd:
if i[b-1] - i[a-1] == c:
s += d
ans = max(ans, s)
print(ans) | 0 | null | 68,902,631,071,406 | 254 | 160 |
A, B, K = map(int, input().split())
if K >= A+B:
print("0 0")
elif K <= A:
print("{} {}".format(A-K, B))
elif K > A:
print("0 {}".format(B-(K-A))) | def solve():
a, b, k = map(int, input().split())
if a > k:
print(a-k, b)
elif a <= k < a+b:
print(0, b-k+a)
else:
print(0, 0)
if __name__ == '__main__':
solve()
| 1 | 104,145,437,637,930 | null | 249 | 249 |
HP, n = map(int, input().split())
AB = [list(map(int,input().split())) for _ in range(n)]
# DP
## DP[i]は、モンスターにダメージ量iを与えるのに必要な魔力の最小コスト
## DPの初期化
DP = [float('inf')] * (HP+1); DP[0] = 0
## HP分だけDPを回す.
for now_hp in range(HP):
## 全ての魔法について以下を試す.
for damage, cost in AB:
### 与えるダメージは、現在のダメージ量＋魔法のダメージか体力の小さい方
next_hp = min(now_hp+damage, HP)
### 今の魔法で与えるダメージ量に必要な最小コストは、->
####->現在わかっている値か今のHPまでの最小コスト＋今の魔法コストの小さい方
DP[next_hp] = min(DP[next_hp], DP[now_hp]+cost)
print(DP[-1]) | x = int(input())
def gcd(a, b):
if b == 0:
return a
return gcd(b, a % b)
def lcm(a, b):
return a*(b//gcd(a, b))
print(lcm(360, x)//x)
| 0 | null | 47,297,115,145,152 | 229 | 125 |
X = int(input())
if 400 <= X < 600:
print(8)
elif 600 <= X < 800:
print(7)
elif 800 <= X < 1000:
print(6)
elif 1000 <= X < 1200:
print(5)
elif 1200 <= X < 1400:
print(4)
elif 1400 <= X < 1600:
print(3)
elif 1600 <= X < 1800:
print(2)
else:
print(1)
| from collections import defaultdict
n = int(input())
d = defaultdict(int)
for i in range(n):
d[input()] += 1
for v in ['AC', 'WA', 'TLE', 'RE']:
print(v, 'x', d[v]) | 0 | null | 7,707,025,576,920 | 100 | 109 |
n = int(raw_input())
d = [100 for i in range(n)]
G = [0 for i in range(n)]
v = [[0 for i in range(n)] for j in range(n)]
def BFS(s):
for e in range(n):
if v[s][e] == 1:
if d[e] > d[s] + 1:
d[e] = d[s]+1
BFS(e)
for i in range(n):
G = map(int, raw_input().split())
for j in range(G[1]):
v[G[0]-1][G[j+2]-1] = 1
d[0] = 0
for i in range(n):
BFS(i)
for i in range(n):
if d[i] == 100:
d[i] = -1
for i in range(n):
print i+1, d[i] | from collections import deque
n=int(input())
l=[0]+[list(map(int,input().split()))[2:] for _ in range(n)]
flg=["white"]*(n+1)
dist=[-1]*(n+1)
def BFS(x):
queue = deque([x])
dist[x]=0
flg[x]="gray"
while queue:
current=queue.popleft()
for i in l[current]:
if flg[i]=="white":
queue.append(i)
flg[i]="gray"
dist[i]=dist[current]+1
flg[current]="black"
BFS(1)
for num,i in enumerate(dist[1:],1):
print(num,i)
| 1 | 4,196,885,924 | null | 9 | 9 |
x = input()
n = int(x)*int(x)*int(x)
print(n)
| print('YNeos'[eval(input().replace(' ','!='))::2]) | 0 | null | 41,909,757,258,522 | 35 | 231 |
xy = [map(int,input().split()) for i in range(2)]
x,y = [list(j) for j in zip(*xy)]
if (y[0] + 1) == y[1] :
ans = 0
else:
ans = 1
print(ans) | import math
h = int(input())
w = int(input())
n = int(input())
ans = math.ceil(n/max(h,w))
print(ans) | 0 | null | 106,041,169,995,258 | 264 | 236 |
N, K = list(map(int, input().split()))
C = 998244353
L = [None]*K
for j in range(K):
l, r = list(map(int, input().split()))
L[j] = [l, r+1]
dp = [0]*N
dp[0] = 1
imos = [0]*(N+1)
imsm = [0]*N
for i in range(N-1):
if i > 0:
imsm[i] = imsm[i-1]+imos[i]
dp[i] = imsm[i] % C
a = dp[i]
# print(i,dp)
for j in range(K):
l, r = L[j]
nl = min(i+l, N)
nr = min(i+r, N)
imos[nl] += a
imos[nr] -= a
# print(i, imos)
dp[N-1] = (imsm[N-2]+imos[N-1]) % C
print(dp[N-1])
| import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
MOD = 998244353
n, k = map(int, input().split())
s = list()
for i in range(k):
s.append(tuple(map(int, input().split())))
dp = [0] + [0] * n
diff = [0] + [0] * n
dp[1] = 1
diff[2] = -1
for i in range(1, n):
for j, k in s:
if i + j > n:
continue
diff[i + j] += dp[i]
if i + k + 1 > n:
continue
diff[i + k + 1] -= dp[i]
#dp[i] = (dp[i - 1] + diff[i]) % MOD
dp[i + 1] = (dp[i] + diff[i + 1]) % MOD
print(dp[n])
| 1 | 2,705,920,753,760 | null | 74 | 74 |
from collections import deque
def input_bordered_grid(h, w, wall):
grid = [wall * (w + 2)]
for _ in range(1, h+1):
grid.append(wall + input() + wall)
grid.append(wall * (w + 2))
return grid
h, w = map(int, input().split())
grid = input_bordered_grid(h, w, '#')
move = [(-1, 0), (1, 0), (0, -1), (0, 1)]
longest = 0
for sy in range(1, h+1):
for sx in range(1, w+1):
if grid[sy][sx] == '#':
continue
dist = [[-1] * (w+2) for _ in range(h+2)]
dist[sy][sx] = 0
q = deque()
q.append((sy, sx))
while q:
y, x = q.popleft()
longest = max(longest, dist[y][x])
for dy, dx in move:
yy = y + dy
xx = x + dx
if dist[yy][xx] == -1 and grid[yy][xx] == '.':
q.append((yy, xx))
dist[yy][xx] = dist[y][x] + 1
print(longest)
| n , d = map(int, input().split())
ans = 0
for _ in range(n):
p, q = map(int, input().split())
if (p ** 2 + q ** 2) ** 0.5 <= d:
ans += 1
print(ans) | 0 | null | 50,263,532,541,440 | 241 | 96 |
ans = [1,2,3]
for i in [0,1]:
y = int(input())
ans.remove(y)
print(ans[0])
| n = int(input())
m = int(input())
if n!=1 and m!=1:
print(1)
elif n!=2 and m!=2:
print(2)
else:
print(3) | 1 | 110,556,194,652,994 | null | 254 | 254 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.