code1
stringlengths 16
24.5k
| code2
stringlengths 16
24.5k
| similar
int64 0
1
| pair_id
int64 2
181,637B
⌀ | question_pair_id
float64 3.71M
180,628B
⌀ | code1_group
int64 1
299
| code2_group
int64 1
299
|
|---|---|---|---|---|---|---|
s=0
t=0
for i in range(9):
s+=1
for j in range(9):
if t==9:
t=1
else:
t+=1
print(f'{s}x{t}={s*t}')
|
# 繰り返しの始まり + 繰り返し + 途中で終わった繰り返し分
N,X,M = map(int,input().split())
p = [0] * (M+2)
sum = [0] * (M+2)
p[X] = 1
sum[1] = X
repeat_start = 0
repeat_end = 0
for i in range(2,N+1):
X = (X**2) % M
if p[X] != 0:
repeat_start = p[X]
repeat_end = i
break
else:
sum[i] = sum[i-1] + X
p[X] += i
if repeat_start == 0:
print(sum[N])
else:
repeat_cnt,mod=divmod(N-repeat_start+1,repeat_end-repeat_start)
print(repeat_cnt*(sum[repeat_end-1]-sum[repeat_start-1]) + sum[repeat_start+mod-1])
| 0 | null | 1,399,669,226,324 | 1 | 75 |
# でつoO(YOU PLAY WITH THE CARDS YOU'RE DEALT..)
import sys
def main(N, T, AB):
dpL = [[0] * (T + 1) for _ in range(N + 2)]
for i in range(1, N + 1):
a, b = AB[i - 1]
for t in range(T):
dpL[i][t] = dpL[i - 1][t]
if t >= a:
dpL[i][t] = max(dpL[i][t], dpL[i - 1][t - a] + b)
dpR = [[0] * (T + 1) for _ in range(N + 2)]
for i in range(N, 0, -1):
a, b = AB[i - 1]
for t in range(T):
dpR[i][t] = dpR[i + 1][t]
if t >= a:
dpR[i][t] = max(dpR[i][t], dpR[i + 1][t - a] + b)
ans = 0
for i in range(1, N + 1):
a, b = AB[i - 1]
for t in range(T):
ans = max(ans, dpL[i - 1][t] + dpR[i + 1][T - 1 - t] + b)
print(ans)
if __name__ == '__main__':
input = sys.stdin.readline
N, T = map(int, input().split())
AB = [list(map(int, input().split())) for _ in range(N)]
main(N, T, AB)
|
N, T = map(int, input().split())
AB = [list(map(int, input().split())) for _ in range(N)]
AB.sort()
dp = [0] * T
#print("AB:", AB)
answer = 0
for a, b in AB:
for t in range(T-1, -1, -1):
if dp[t]:
if a + t < T:
dp[a + t] = max(dp[a + t], dp[t] + b)
answer = max(answer, dp[a + t])
else:
answer = max(answer, dp[t] + b)
if a < T:
dp[a] = max(dp[a], b)
answer = max(answer, b)
#print("dp:", dp)
print(answer)
| 1 | 151,514,033,109,028 | null | 282 | 282 |
# -*-coding:utf-8
import fileinput
import math
def main():
for line in fileinput.input():
a, b, c = map(int, line.strip().split())
count = 0
for i in range(a, b+1):
if(c % i == 0):
count += 1
print(count)
if __name__ == '__main__':
main()
|
from collections import deque
D = set()
N = int(input())
for i in range(N):
c, s = input().split()
if c == "insert":
D.add(s)
elif c == "find":
if (s in D):
print("yes")
else:
print("no")
| 0 | null | 313,718,311,900 | 44 | 23 |
import math
x = raw_input()
x = float(x)
S = x*x*math.pi
l = 2*x*math.pi
print("%.6f %.6f" %(S, l))
|
import math
r = float(input())
s = '{:.6f}'.format(r * r * math.pi)
l = '{:.6f}'.format(2 * r * math.pi)
print(s,l)
| 1 | 655,182,091,510 | null | 46 | 46 |
def readinput():
n=int(input())
return n
def main(n):
x7=int(n/1.07)
x8=int(n/1.08)
x9=int(n/1.09)
n100=n*100
for x in range(max(1,x9-1),x7+1+1):
xx=x*108//100
#print(x,xx)
if xx==n:
print(x)
break
else:
print(':(')
if __name__=='__main__':
n=readinput()
main(n)
|
import sys
n = int(input())
ans = n*100/108
for i in [int(ans), int(ans)+1]:
if int(i*1.08) == n:
print(i)
sys.exit()
print(":(")
| 1 | 125,738,294,335,102 | null | 265 | 265 |
import sys
input = lambda: sys.stdin.readline().rstrip()
S = input()
print("ABC" if S == "ARC" else "ARC")
|
con = input()
if con == "ABC":
print("ARC")
else:
print("ABC")
| 1 | 24,207,295,984,480 | null | 153 | 153 |
X = int(input())
x1 = X//500
x2 = (X%500)//5
print(x1*1000+x2*5)
|
x = int(input())
ans = 0
ans += 1000*(x//500)
x %= 500
ans += 5*(x//5)
print(ans)
| 1 | 42,891,326,775,990 | null | 185 | 185 |
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)
from operator import or_
class SegmentTree:
def __init__(self, orig, func, unit):
_len = len(orig)
self.func = func
self.size = 1 << (_len - 1).bit_length()
self.tree = [unit] * self.size + orig + [unit] * (self.size - _len)
self.unit = unit
for i in range(self.size - 1, 0, -1):
self.tree[i] = func(self.tree[i * 2], self.tree[i * 2 + 1])
def update(self, i, v):
i += self.size
self.tree[i] = v
while i:
i //= 2
self.tree[i] = self.func(self.tree[i * 2], self.tree[i * 2 + 1])
def find(self, l, r):
l += self.size
r += self.size
ret = self.unit
while l < r:
if l & 1:
ret = self.func(ret, self.tree[l])
l += 1
if r & 1:
r -= 1
ret = self.func(ret, self.tree[r])
l //= 2
r //= 2
return ret
n = readline()
s = readline()
q = int(readline())
li = [1 << ord(x) - 97 for x in s[:-1]]
seg = SegmentTree(li, or_, 0)
ans = []
for _ in range(q):
f, x, y = readline().split()
x = int(x)
if f == '1':
seg.update(x - 1, 1 << ord(y) - 97)
else:
y = int(y)
z = seg.find(x - 1, y)
cnt = bin(z).count('1')
ans.append(cnt)
print(*ans)
|
import sys
# import re
import math
import collections
# import decimal
import bisect
import itertools
import fractions
# import functools
import copy
# import heapq
import decimal
# import statistics
import queue
# import numpy as np
sys.setrecursionlimit(10000001)
INF = 10 ** 16
MOD = 10 ** 9 + 7
# MOD = 998244353
ni = lambda: int(sys.stdin.readline())
ns = lambda: map(int, sys.stdin.readline().split())
na = lambda: list(map(int, sys.stdin.readline().split()))
# ===CODE===
def main():
n = ni()
s = list(input())
q = ni()
alphabet_idx = {}
for i in range(26):
alphabet_idx[i] = []
for i, si in enumerate(s):
alphabet_idx[ord(si) - ord("a")].append(i)
for _ in range(q):
qi, a, b = input().split()
qi, a = int(qi), int(a)
if qi == 1:
a -= 1
if s[a] == b:
continue
del_char = ord(s[a]) - ord("a")
del_idx = bisect.bisect_left(alphabet_idx[del_char], a)
del alphabet_idx[del_char][del_idx]
insert_char = ord(b) - ord("a")
insert_idx = bisect.bisect_left(alphabet_idx[insert_char], a)
alphabet_idx[insert_char].insert(insert_idx, a)
s[a] = b
if qi == 2:
b = int(b)
a -= 1
b -= 1
ans = 0
for i in range(26):
a_idx = bisect.bisect_left(alphabet_idx[i], a)
if a_idx < len(alphabet_idx[i]):
if alphabet_idx[i][a_idx] <= b:
ans += 1
print(ans)
if __name__ == '__main__':
main()
| 1 | 62,556,706,902,570 | null | 210 | 210 |
# coding: utf-8
#Name: List of Top 3 Hills
#Level: 1
#Category: ????????????
#Note:
s = [int(raw_input()) for i in range(10)]
s.sort()
for i in range(3):
print s[9-i]
|
a=[]
for i in range(10):
a.append(int(input()))
a=sorted(a)[::-1]
for i in range(3):
print(a[i])
| 1 | 26,006,980 | null | 2 | 2 |
def main():
A1, A2, A3 = map(int, input().split())
if A1 + A2 + A3 >= 22:
ans = "bust"
else:
ans = "win"
print(ans)
if __name__ == "__main__":
main()
|
print("win" if sum(map(int,input().split()))<=21 else "bust")
| 1 | 118,391,814,456,828 | null | 260 | 260 |
import numpy as np
raw = input()
rawl = raw.split()
A = int(rawl[0])
B = int(rawl[1])
H = int(rawl[2])
M = int(rawl[3])
theta = 2*np.pi*(H/12+M/720-M/60)
print((A*A+B*B-2*A*B*np.cos(theta))**(0.5))
|
import math
a,b,h,m=map(int,input().split())
print((a**2+b**2-2*a*b*math.cos(math.pi*(m*11/360-h/6)))**0.5)
| 1 | 20,035,399,887,938 | null | 144 | 144 |
t = input().lower()
cnt = 0
while True:
w = input()
if w == 'END_OF_TEXT': break
cnt += len(list(filter(lambda x: x == t, [v.lower() for v in w.split(' ')])))
print(cnt)
|
W = input().casefold()
count=0
while True:
line = input()
if line == "END_OF_TEXT":
break
line = line.casefold()
word = line.split()
count += word.count(W)
print(count)
| 1 | 1,801,487,374,190 | null | 65 | 65 |
number = int(input())
print(number + number**2 + number**3)
|
t = int(input())
print(t+t**2+t**3)
| 1 | 10,235,665,875,172 | null | 115 | 115 |
import random
s = input()
num = random.randint(0,len(s)-3)
print(s[num:num+3])
|
#!/usr/bin/env python
# -*- coding: utf-8 -*-
import sys
def input():
return sys.stdin.readline()
def resolve():
s = input().rstrip()
print(s[0:3])
if __name__ == "__main__":
resolve()
| 1 | 14,779,810,100,768 | null | 130 | 130 |
n, a, b = map(int, input().split())
mod = 10**9 + 7
ans = pow(2, n, mod)
ans -= 1
aa = 1
for i in range(1, a+1):
aa = (aa * (n - i + 1) * pow(i, -1, mod)) % mod
bb = 1
for i in range(1, b+1):
bb = (bb * (n - i + 1) * pow(i, -1, mod)) % mod
ans = (ans - aa - bb) % mod
print(ans)
|
n=int(input())
x=input()
p=x.count('1')
#愚直に解く関数を定義
def solve(n):
count=0
while n:
popcount=bin(n).count('1')
n%=popcount
count+=1
return count+1
#popcount(x)が0,1だった場合に対応
if p==0:
for i in range(n):
print(1)
exit()
elif p==1:
z=x.index('1')
t=pow(2,n-z-1,p+1)
for i in range(n):
if i==z:
print(0)
else:
tmp=(t+pow(2,n-i-1,p+1))%(p+1)
print(solve(tmp))
exit()
#2^i mod(p+1),2^i mod(p-1)のリストを作成
a,b=[],[]
for i in range(n):
a.append(pow(2,i,p+1))
b.append(pow(2,i,p-1))
#x mod(p+1),x mod(p-1)を計算
a1,b1=0,0
for i in range(n):
if x[-1-i]=='1':
a1+=a[i]
b1+=b[i]
#本計算
for i in range(n):
if x[i]=='1':
tmp=(b1-b[-1-i])%(p-1)
else:
tmp=(a1+a[-1-i])%(p+1)
print(solve(tmp))
| 0 | null | 37,288,825,355,602 | 214 | 107 |
def main():
N = int(input())
G = [[] for _ in range(N)]
edge = [-1] * (N-1)
for i in range(N-1):
a, b = (int(i)-1 for i in input().split())
G[a].append(b*N + i)
G[b].append(a*N + i)
max_deg = max(len(G[i]) for i in range(N))
from collections import deque
def bfs(s):
que = deque([])
par = [-1]*N
que.append(s)
while que:
pos = que.popleft()
c = -1
k = 1
for vi in G[pos]:
v, i = divmod(vi, N)
if par[pos] == v:
c = edge[i]
for vi in G[pos]:
v, i = divmod(vi, N)
if par[pos] == v:
continue
if k == c:
k += 1
par[v] = pos
edge[i] = k
k += 1
que.append(v)
bfs(0)
print(max_deg)
for i in range(N-1):
print(edge[i])
if __name__ == '__main__':
main()
|
from collections import deque
import sys
sys.setrecursionlimit(10**9)
N = int(input())
to = [[] for _ in range(N)]
order = []
for _ in range(N - 1):
a, b = list(map(lambda x:int(x) - 1, input().split()))
to[a].append(b)
to[b].append(a)
order.append(b)
def solve():
dist = [-1] * N
# 頂点iに向かう辺をiとする
color = [0] * N
dist[0] = 0
color[0] = 0
que = deque([0])
while que:
v = que.popleft()
used_color = [color[v]]
next_color = 1
for nv in to[v]:
if dist[nv] == -1:
dist[nv] = dist[v] + 1
while next_color in used_color:
next_color += 1
color[nv] = next_color
used_color.append(next_color)
que.append(nv)
print(len(set(color[1:])))
for i in range(N - 1):
print(color[order[i]])
if __name__ == "__main__":
solve()
| 1 | 136,214,766,511,292 | null | 272 | 272 |
listSi = [0,0,0,0]
ic = int(input())
icz = 0
while True:
icz += 1
i = input()
if i == "AC":
listSi[0] += 1
elif i == "WA":
listSi[1] += 1
elif i == "TLE":
listSi[2] += 1
elif i == "RE":
listSi[3] += 1
if icz == ic:
break
print(f"AC x {listSi[0]}")
print(f"WA x {listSi[1]}")
print(f"TLE x {listSi[2]}")
print(f"RE x {listSi[3]}")
|
import sys
readline = sys.stdin.buffer.readline
import math
sys.setrecursionlimit(10 ** 8)
INF = float('inf')
MOD = 10 ** 9 + 7
def main():
N = int(readline())
S = readline().decode('utf-8')
total = S.count('R') * S.count('G') * S.count('B')
for stride in range(1, math.ceil(N / 2) + 1):
for start in range(N):
if start + stride * 2 >= N:
break
else:
if S[start] != S[start + stride] and S[start + stride] != S[start + stride * 2] and S[start + stride * 2] != S[start]:
total -= 1
print(total)
if __name__ == '__main__':
main()
| 0 | null | 22,423,569,476,462 | 109 | 175 |
K = int(input())
string = "ACL"
print(string * K)
|
k = int(input())
i = 0
ans = ""
for i in range(k):
ans += "ACL"
#print(ans)
i += 1
print(ans)
| 1 | 2,184,926,547,012 | null | 69 | 69 |
n,k = map(int,input().split())
A = list(map(int,input().split()))
mod = 10**9 + 7
A.sort(key = lambda x:abs(x),reverse = True)
ans = 1
last = -1
lastp = -1
cnt = 0
for a in A:
if a >= 0:break
else:
if k&1:
for i in range(k):
ans *= A[n-i-1]
ans %= mod
else:
for i in range(k):
ans *= A[i]
ans %= mod
print(ans)
exit()
for i in range(k):
ans *= A[i]
ans %= mod
if A[i] < 0:
last = i
cnt += 1
if A[i] > 0:
lastp = i
if n == k:
print(ans%mod)
exit()
if cnt&1:
first = 0
firstp = 0
for a in A[k:]:
if a > 0 and firstp == 0:
firstp = a
if a < 0 and first == 0:
first = a
if first == 0 and firstp == 0:
ans = 0
elif first == 0 or lastp == -1:
ans *= pow(A[last],mod-2,mod)*firstp%mod
ans %= mod
elif firstp == 0:
ans *= pow(A[lastp],mod-2,mod)*first%mod
ans %= mod
else:
if A[lastp]*firstp <= A[last]*first:
ans *= pow(A[lastp],mod-2,mod)*first%mod
ans %= mod
else:
ans *= pow(A[last],mod-2,mod)*firstp%mod
ans %= mod
print(ans%mod)
|
import sys
readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)
def main():
from collections import deque
import bisect
n, k = map(int, readline().split())
a = list(map(int, readline().split()))
a.sort()
que = deque()
if n == k:
que.extend(a)
elif a[-1] < 0 and k % 2 == 1:
que.extend(a)
for _ in range(n - k):
que.popleft()
else:
pos_ = []
neg_ = []
for x in a:
if x >= 0:
pos_.append(x)
else:
neg_.append(x)
pos = deque(sorted(pos_, reverse=True))
neg = deque((sorted(neg_)))
while len(que) < k:
if len(pos) >= 2:
pp = pos[0] * pos[1]
else:
pp = -1
if len(neg) >= 2:
np = neg[0] * neg[1]
else:
np = -1
if (pp > np) or len(que) == (k-1):
que.append(pos.popleft())
else:
que.append(neg.popleft())
que.append(neg.popleft())
while len(que) > 1:
que.append(que.popleft() * que.popleft())
print(que.popleft() % MOD)
if __name__ == '__main__':
main()
| 1 | 9,416,014,304,960 | null | 112 | 112 |
a, b = map(int, input().split())
sq = a * b
leng = a*2 + b*2
print('{} {}'.format(sq,leng))
|
a = input().split()
c = int(a[0]) * int(a[1])
d = (int(a[0])*2) + (int(a[1])*2)
print('%d %d' %(c,d))
| 1 | 305,255,559,620 | null | 36 | 36 |
*X, = map(int, open(0).read().split())
print(max(X[0]*X[2],X[1]*X[2],X[0]*X[3],X[1]*X[3]))
|
# coding: utf-8
# Your code here!
def main():
a, b, c, d = map(int, input().split())
ans = max(a*c, max(b*d, max(a*d, b*c)))
print(ans)
main()
| 1 | 3,096,431,280,908 | null | 77 | 77 |
H,N = map(int,input().split())
Magic = [list(map(int, input().split())) for i in range(N)]
inf = float("inf")
dp = [inf]*(H+1)
dp[0]=0
for i in range(N):
a,b = Magic[i]
for h in range(H):
next_h = min(h+a,H)
dp[next_h]=min(dp[next_h],dp[h]+b)
print(dp[-1])
|
(h,n),*c=[[*map(int,i.split())]for i in open(0)]
d=[0]*20002
for i in range(h):d[i]=min(d[i-a]+b for a,b in c)
print(d[h-1])
| 1 | 80,990,074,356,320 | null | 229 | 229 |
#!/usr/bin/env python3
import collections as cl
import math
import sys
def II():
return int(sys.stdin.readline())
def MI():
return map(int, sys.stdin.readline().split())
def LI():
return list(map(int, sys.stdin.readline().split()))
def main():
N = II()
print(math.ceil(N / 2))
main()
|
n = int(input())
M = int(n**(0.5))
ans = [0]*(n+1)
for x in range(1,M+1):
for y in range(1,10**2):
for z in range(1,10**2):
if x**2+y**2+z**2+x*y+y*z+z*x > n:
break
ans[x**2+y**2+z**2+x*y+y*z+z*x] += 1
if x**2+y**2 > n:
break
for i in range(n):
print(ans[i+1])
| 0 | null | 33,572,282,694,500 | 206 | 106 |
import sys
def I(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LMI(): return list(map(int, sys.stdin.readline().split()))
MOD = 10 ** 9 + 7
a = [1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51]
K = I()
print(a[K -1 ])
|
def main():
params = [1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51]
return params[int(input())-1]
print(main())
| 1 | 50,020,447,760,160 | null | 195 | 195 |
N = int(input())
A = list(map(int, input().split()))
count = 0
for i in range(N):
mini = i
for j in range(i, N):
if A[j] < A[mini]:
mini = j
if i != mini:
A[i], A[mini] = A[mini], A[i]
count += 1
print(*A)
print(count)
|
S = input()
T = input()
min = 10000000
for i in range(len(S)- len(T) + 1):
x = 0
for j in range(len(T)):
if S[i+j] != T[j]:
x += 1
if x < min:
min = x
print(min)
| 0 | null | 1,842,866,967,022 | 15 | 82 |
class Union_Find():
def __init__(self, N):
self.N = N
self.par = [n for n in range(N)]
self.rank = [0] * N
def root(self, x):
if self.par[x] == x:
return x
else:
return self.root(self.par[x])
def same(self, x, y):
if self.root(x) == self.root(y):
return True
else:
return False
def unite(self, x, y):
x = self.root(x)
y = self.root(y)
if (x==y): return
if (self.rank[x] < self.rank[y]):
self.par[x] = y
self.rank[y] += self.rank[x] + 1
else:
self.par[y] = x
self.rank[x] += self.rank[y] + 1
N, M = map(int, input().split())
UF = Union_Find(N)
for _ in range(M):
a, b = map(int, input().split())
a -= 1
b -= 1
UF.unite(a, b)
ans = -1
for n in range(N):
ans = max(ans, UF.rank[n])
print(ans+1)
|
N = int(input())
N = N % 10
if N in (2, 4, 5, 7, 9):
print ("hon")
elif N in (0, 1, 6, 8):
print ("pon")
elif N == 3:
print ("bon")
| 0 | null | 11,614,441,601,568 | 84 | 142 |
#!/usr/bin/env python
# coding: utf-8
# In[10]:
X,Y,A,B,C = map(int, input().split())
p = sorted(list(map(int, input().split())), reverse=True)
q = sorted(list(map(int, input().split())), reverse=True)
r = sorted(list(map(int, input().split())), reverse=True)
# In[14]:
p_list = p[:X]
q_list = q[:Y]
mylist = sorted(p_list + q_list + r, reverse=True)
ans = 0
for i in range(X+Y):
ans += mylist[i]
print(ans)
# In[ ]:
|
def insert_sort(A):
for i in range(1, len(A)):
k = A[i]
j = i - 1
while j >= 0 and A[j] > k:
A[j + 1] = A[j]
j -= 1
A[j + 1] = k
show(A)
def show(A):
for i in range(len(A) - 1):
print(A[i], end=" ")
print(A[len(A) - 1])
n = int(input())
line = input()
A = list(map(int, line.split()))
show(A)
insert_sort(A)
| 0 | null | 22,557,570,158,488 | 188 | 10 |
h1, m1, h2, m2, k = list(map(int, input().split()))
s = (h1*60)+m1
e = (h2*60)+m2
print(e-s-k)
|
n = int(input())
for i in range(1,10):
if (n%i==0) and ((n//i) in range(1,10)):
print("Yes")
break
else:
print("No")
| 0 | null | 89,064,880,432,792 | 139 | 287 |
N = int(input())
def factorization(n): # => {prime:count,...}
fac = {}
count = 0
while n % 2 == 0:
n //= 2
count += 1
if count > 0:
fac[2] = count
for i in range(3, int(n ** .5) + 1, 2):
count = 0
while n % i == 0:
n //= i
count += 1
if count > 0:
fac[i] = count
if n > 1:
fac[n] = 1
return fac
ans = 0
for key, cnt in factorization(N).items():
n = 1
while cnt >= 0:
cnt -= n
n += 1
ans += 1
ans -= 1
print(ans)
|
n=int(input())
def f(x):
z=1
while not(z*(z+1)<=2*x<(z+1)*(z+2)):
z+=1
return z
x=[-1]*(10**6+1) #2以上の自然数に対して最小の素因数を表す
x[0]=0
x[1]=1
i=2
prime=[]
while i<=10**6:
if x[i]==-1:
x[i]=i
prime.append(i)
for j in prime:
if i*j>10**6 or j>x[i]:break
x[j*i]=j
i+=1
if n==1:
print(0)
exit()
y=0
j=2
while j*j<=n:
if n%j==0:
y=1
j+=1
if y==0:
print(1)
exit()
a=[]
q=0
for i in range(len(prime)):
p=prime[i]
while n%p==0:
q+=1
n=n//p
if q>0:a.append(q)
q=0
ans=0
for i in range(len(a)):
ans+=f(a[i])
print(ans if n==1 else ans+1)
| 1 | 16,912,030,603,908 | null | 136 | 136 |
import sys
def input():
return sys.stdin.buffer.readline()[:-1]
n = int(input())
d = [list(map(int, input().split())) for _ in range(n)]
ans1 = max(x[0] + x[1] for x in d) - min(x[0] + x[1] for x in d)
ans2 = max(x[0] - x[1] for x in d) - min(x[0] - x[1] for x in d)
print(max(ans1, ans2))
|
n = int(input())
xy = []
for index in range(n):
x, y = map(int, input().split())
xy.append([x, y])
pos_max = xy[0][0]+xy[0][1]
pos_min = xy[0][0]+xy[0][1]
neg_max = xy[0][0]-xy[0][1]
neg_min = xy[0][0]-xy[0][1]
for item in xy:
pos_v = item[0] + item[1]
neg_v = item[0] - item[1]
pos_max = pos_v if pos_v > pos_max else pos_max
pos_min = pos_v if pos_v < pos_min else pos_min
neg_max = neg_v if neg_v > neg_max else neg_max
neg_min = neg_v if neg_v < neg_min else neg_min
pos_result = pos_max - pos_min
neg_result = neg_max - neg_min
print(pos_result if pos_result >= neg_result else neg_result)
| 1 | 3,369,893,229,498 | null | 80 | 80 |
from collections import deque
import copy
H,W=map(int,input().split())
inf=1000000000
field=[]
for i in range(H):
row=list(input())
for j in range(len(row)):
if row[j]=='#':row[j]=-1
else:row[j]=inf
field.append(row)
ans=inf
def isIn(x,y):
if x<0 or x>=W:return False
if y<0 or y>=H:return False
return True
vector=[[0,1],[0,-1],[1,0],[-1,0]]
ans=0
for i in range(H):
for j in range(W):
if field[i][j]==-1:continue
l=deque([[j,i]])
f=copy.deepcopy(field)
f[i][j]=0
tmp=0
#print('--start--')
while l:
x,y=l.popleft()
#print(x,y)
#i,jを訪問
for v in vector:
if not isIn(x+v[1],y+v[0]):continue
if f[y+v[0]][x+v[1]]<=tmp:continue
f[y+v[0]][x+v[1]]=f[y][x]+1
l.append([x+v[1],y+v[0]])
tmp=max(f[y+v[0]][x+v[1]],tmp)
ans=max(ans,tmp)
print(ans)
|
from collections import deque
import copy
H, W = map(int, input().split())
S = [input() for _ in range(H)]
def warshall_floyd(d):
#d[i][j]: iからjへの最短距離
for k in range(H*W):
for i in range(H*W):
for j in range(H*W):
d[i][j] = min(d[i][j],d[i][k] + d[k][j])
return d
d = [[float("inf")]*(H*W) for i in range(H*W)]
#d[u][v] : 辺uvのコスト(存在しないときはinf)
for i in range(H-1):
for j in range(W-1):
if S[i][j] == ".":
if S[i+1][j] == ".":
d[i*W+j][(i+1)*W+j] = 1
d[(i+1)*W+j][i*W+j] = 1
if S[i][j+1] == ".":
d[i*W+j][i*W+(j+1)] = 1
d[i*W+(j+1)][i*W+j] = 1
for i in range(W-1):
if S[H-1][i] == "." and S[H-1][i+1] == ".":
d[(H-1)*W+i][(H-1)*W+(i+1)] = 1
d[(H-1)*W+(i+1)][(H-1)*W+i] = 1
for i in range(H-1):
if S[i][W-1] == "." and S[i+1][W-1] == ".":
d[i*W+(W-1)][(i+1)*W+(W-1)] = 1
d[(i+1)*W+(W-1)][i*W+(W-1)] = 1
for i in range(H*W):
d[i][i] = 0 #自身のところに行くコストは０
ans = 0
data = warshall_floyd(d)
for items in data:
for item in items:
if item != float("inf"):
ans = max(ans, item)
print(ans)
| 1 | 94,879,870,038,142 | null | 241 | 241 |
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)
|
while True:
x, y = map(int, input().split())
if x == 0 and y == 0:
break
else:
a = [x, y]
a.sort()
print(a[0], a[1])
| 1 | 529,970,696,508 | null | 43 | 43 |
import sys
from bisect import bisect_left, bisect_right
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def main():
N, *L = map(int, read().split())
L.sort()
ans = 0
for i in range(N):
a = L[i]
for j in range(i + 1, N):
b = L[j]
left = bisect_left(L, b, lo=j + 1)
right = bisect_left(L, a + b, lo=j + 1)
ans += right - left
print(ans)
return
if __name__ == '__main__':
main()
|
#!/usr/bin/env python3
from bisect import bisect_right
n, *L = map(int, open(0).read().split())
L.sort()
ans = 0
for i in range(n):
for j in range(i + 1, n):
ans += (bisect_right(L, L[i] + L[j] - 1) -
bisect_right(L, L[j] - L[i]) - 1 - (L[j] - L[i] * 2 < 0))
print(ans // 3)
| 1 | 171,760,298,511,918 | null | 294 | 294 |
import math
n=int(input())
s=0
for i in range(n):
a=int(input())
#b=int(a**0.5)
b=math.ceil(a**0.5)
#print(str(b), '??O')
if a==2:
s+=1
# print(str(a),'!!!!')
elif a%2==0 or a < 2:
continue
else:
j=3
c=0
while j <= b:
if a%j==0:
c+=1
break
j+=2
if c==0:
s+=1
"""
for j in range(3,b+1,2):
if a%j==0:
break
if j==b:
s+=1
print(str(a),'!!!!')
"""
print(s)
|
N = int(input())
A = list(map(int,input().split()))
for i in range(N):
v = A[i]
j = i - 1
while j >= 0 and A[j] > v:
A[j+1] = A[j]
j -= 1
A[j+1] = v
print(" ".join(map(str, A)))
| 0 | null | 7,612,453,980 | 12 | 10 |
import math
n=int(input())
print((n-math.floor(n/2))/n)
|
N=int(input())
K=(N+1)//2
print(K/N)
| 1 | 176,933,026,647,872 | null | 297 | 297 |
s = input()
if(s == 'hi'):
print('Yes')
elif(s == 'hihi'):
print('Yes')
elif(s == 'hihihi'):
print('Yes')
elif(s == 'hihihihi'):
print('Yes')
elif(s == 'hihihihihi'):
print('Yes')
else:
print('No')
|
r = input()
if len(r) & 1:
print("No")
else:
for i in range(0, len(r), 2):
if not (r[i] == 'h' and r[i + 1]=='i'):
print("No")
exit()
print("Yes")
| 1 | 53,290,710,983,928 | null | 199 | 199 |
import sys, fractions
[[print("{} {}".format(int(fractions.gcd(t[0], t[1])), int(t[0] * t[1] / fractions.gcd(t[0], t[1])))) for t in [[int(y) for y in x.split()]]] for x in sys.stdin]
|
import math
while True:
try:
a, b = [int(i) for i in input().split()]
gcd = math.gcd(a, b)
lcm = a * b // gcd
print(f'{gcd} {lcm}')
except EOFError:
break
| 1 | 546,436,790 | null | 5 | 5 |
S = input().rstrip()
print('x' * len(S))
|
ri = lambda S: [int(v) for v in S.split()]
S = [ri(input()) for _ in range(3)]
N = int(input())
D = set()
O = set()
def mark(A, v):
for i in range(3):
for j in range(3):
if A[i][j] != 0 and A[i][j] == v:
A[i][j] = 0
if (i, j) in [(0, 0), (1, 1), (2,2)]:
D.add((i,j))
if (i, j) in [(0, 2), (1, 1), (2, 0)]:
O.add((i, j))
for _ in range(N):
b = int(input())
mark(S, b)
R = [sum(r) for r in S]
C = [sum(r) for r in zip(*S)]
check = len(D) == 3 or len(O) == 3 or any(v == 0 for v in R) or any(v == 0 for v in C)
print("Yes" if check else "No")
| 0 | null | 66,052,165,082,718 | 221 | 207 |
a,b=1,0
for c in map(int,input()):a,b=min(a+10-c-1,b+c+1),min(a+10-c,b+c)
print(b)
|
#E DPでとく
N = [int(x) for x in input()]
dp = 0,1
for item in N:
a = min(dp[0] + item, dp[1] + 10 - item)
b = min(dp[0] + item + 1, dp[1] + 10 - (item + 1))
dp = a, b
print(dp[0])
| 1 | 70,957,687,530,942 | null | 219 | 219 |
n = int(input())
dic = set()
for i in range(n):
order, Str = input().split()
if order=='insert':
dic.add(Str)
if order=='find':
if Str in dic:
print('yes')
else:
print('no')
|
import sys
n = int(input())
dic = {}
input_ = [x.split() for x in sys.stdin.readlines()]
for c, s in input_:
if c == 'insert':
dic[s] = 0
else:
if s in dic:
print('yes')
else:
print('no')
| 1 | 76,478,154,520 | null | 23 | 23 |
h = int(input())
w = int(input())
n = int(input())
print(int((n-1)/max(h, w))+1)
|
if __name__=="__main__":
num = int(input())
if num < 400:
pass
elif num<600:
print(8)
elif num<800:
print(7)
elif num<1000:
print(6)
elif num<1200:
print(5)
elif num<1400:
print(4)
elif num<1600:
print(3)
elif num<1800:
print(2)
elif num<2000:
print(1)
| 0 | null | 47,839,409,544,552 | 236 | 100 |
a = []
while True:
arr = map(int,raw_input().split())
if arr[0] == 0 and arr[1] == 0:
break
arr.sort()
arr = map(str,arr)
print ' '.join(arr)
|
n = int(input())
c = input()
t = n
lw, rr = 0, c.count('R')
for ci in c+'Z':
swap = min(lw, rr)
wtor, rtow = max(0, lw-swap), max(0, rr-swap)
t = min(t, swap + wtor + rtow)
lw = lw + (ci == 'W')
rr = rr - (ci == 'R')
print(t)
| 0 | null | 3,395,809,221,604 | 43 | 98 |
n, m = map(int, input().split())
a =[[0 for i in range(m)]for j in range(n)]
for i in range(n):
a[i] = list(map(int, input().split()))
b = [0 for j in range(m)]
for j in range(m):
b[j] = int(input())
c = [0 for i in range(n)]
for i in range(n):
for j in range(m):
c[i] += a[i][j] * b[j]
print(c[i])
|
line = int(input().split(" ")[0])
a_vec =[]
b_vec =[]
res = []
for i in range(line):
#a_vec.append([int(x) for x in a_input[i].split(" ")])
a_vec.append([int(x) for x in input().split(" ")])
for i in range(len(a_vec[0])):
b_vec.append(int(input()))
for a_row in a_vec:
c = 0
for i, a_col in enumerate(a_row):
c += a_col * b_vec[i]
res.append(c)
for r in res:
print(r)
| 1 | 1,166,323,589,662 | null | 56 | 56 |
N,K=map(int,input().split())
A=list(map(int,input().split()))
A.sort()
mod=10**9+7
f=[1]
for i in range(N):
f+=[f[-1]*(i+1)%mod]
def comb(a,b):
return f[a]*pow(f[b],mod-2,mod)*pow(f[a-b],mod-2,mod)%mod
max=0
for i in range(K-1,N):
max+=comb(i,K-1)*A[i]
max%=mod
for i in range(N-K+1):
max-=comb(N-i-1,K-1)*A[i]
max%=mod
print(max)
|
N,K = map(int, input().split())
A_list = sorted(list(map(int, input().split())))
if K == 1:
print(0)
exit()
MOD = 10**9 + 7
fact = [0] * (N+1)
fact_inv = [0] * (N+1)
inv = [0] * (N+1)
fact[0] = fact[1] = 1
fact_inv[0] = fact_inv[1] = 1
inv[1] = 1
for i in range(2, N):
fact[i] = fact[i-1] * i % MOD
inv[i] = MOD - inv[MOD%i] * (MOD//i) % MOD # //で良いのかな?
fact_inv[i] = fact_inv[i-1] * inv[i] % MOD
def combo(n,k):
if n < k:
return 0
if n < 0 or k < 0:
return 0
return fact[n] * (fact_inv[k] * fact_inv[n-k] % MOD) % MOD
def main():
min_sum = 0
max_sum = 0
for i in range(N-K+1):
cmb = combo(N-i-1, K-1)
min_sum -= A_list[i] * cmb
max_sum += A_list[N-i-1] * cmb
min_sum %= MOD
max_sum %= MOD
print((max_sum+min_sum + MOD )%MOD)
if __name__ == "__main__":
main()
| 1 | 95,708,090,759,050 | null | 242 | 242 |
value = int(input())
kyu_rated = 8
lvalue = 400
rvalue = 599
for i in range(0, 8):
if lvalue <= value <= rvalue:
print(kyu_rated)
flag = 1
break
else:
lvalue += 200
rvalue += 200
kyu_rated -= 1
|
h,w=map(int,input().split())
if h == 1 or w == 1:
print(1)
else:
div,mod=divmod(h*w,2)
print(div+mod)
| 0 | null | 28,950,773,488,610 | 100 | 196 |
K, N= map(int, input().split())
A = list(map(int, input().split()))
max=K-(A[N-1]-A[0])
for i in range(N-1):
a=A[i+1]-A[i]
if max<a:
max=a
print(K-max)
|
import sys
from array import array
read = sys.stdin.buffer.read
k, n, *A = map(int, read().split())
A += [k + A[0]]
far = max(array("l", [x - y for x, y in zip(A[1:], A)]))
print(k-far)
| 1 | 43,323,307,495,368 | null | 186 | 186 |
import math
inf = math.inf
def merge(A, left, mid, right):
global cnt
L = []
R = []
for i in A[left:mid]:
L.append(i)
for i in A[mid:right]:
R.append(i)
L.append(inf)
R.append(inf)
i = 0
j = 0
for k in range(left, right):
cnt += 1
if L[i] <= R[j]:
A[k] = L[i]
i += 1
else:
A[k] = R[j]
j += 1
def mergeSort(A, left, right):
if right - left > 1:
mid = (left + right) // 2
mergeSort(A, left, mid)
mergeSort(A, mid, right)
merge(A, left, mid, right)
_ =input()
A = list(map(int, input().rstrip().split(" ")))
cnt = 0
mergeSort(A, 0, len(A))
print(" ".join(list(map(str, A))))
print(cnt)
|
from sys import stdin, maxsize
def stdinput():
return stdin.readline().strip()
def main():
n = int(stdinput())
*A, = map(int, stdinput().split(' '))
o = mergeSort(A, 0, n)
print(*A)
print(o)
def merge(A, left, mid, right):
L = A[left:mid]
R = A[mid:right]
cap = maxsize
L.append(cap)
R.append(cap)
i = j = 0
for k in range(left, right):
if L[i] <= R[j]:
A[k] = L[i]
i += 1
else:
A[k] = R[j]
j += 1
return i + j
def mergeSort(A, left, right):
o = 0
if left + 1 < right:
mid = (left + right) // 2
o += mergeSort(A, left, mid)
o += mergeSort(A, mid, right)
o += merge(A, left, mid, right)
return o
if __name__ == '__main__':
main()
# import cProfile
# cProfile.run('main()')
| 1 | 109,441,189,176 | null | 26 | 26 |
a,b,n = map(int, input().split())
if b == 1:
print (0)
exit()
else:
x = min(b-1,n)
ans = (a*x)//b-a*(x//b)
print (ans)
|
a = [input().split() for l in range(3)]
n = int(input())
b = list(input() for i in range(n))
c = [[0] * 3 for i in range(3)]
for i in range(n):
for j in range(3):
for k in range(3):
if b[i] == a[j][k]:
c[j][k] = 1
if (c[0][0] == 1 and c[0][1] == 1 and c[0][2] == 1) or(c[1][0] == 1 and c[1][1] == 1 and c[1][2] == 1) or(c[2][0] == 1 and c[2][1] == 1 and c[2][2] == 1) or(c[0][0] == 1 and c[1][0] == 1 and c[2][0] == 1) or(c[0][1] == 1 and c[1][1] == 1 and c[2][1] == 1) or(c[0][2] == 1 and c[1][2] == 1 and c[2][2] == 1) or(c[0][0] == 1 and c[1][1] == 1 and c[2][2] == 1) or (c[0][2] == 1 and c[1][1] == 1 and c[2][0] == 1):
print("Yes")
else:
print("No")
| 0 | null | 43,687,329,070,140 | 161 | 207 |
n = int(input())
x = list(map(int, input().split()))
y = list(map(int, input().split()))
for p in range(1, 3 + 1):
s = sum([(pow(abs(x[i] - y[i]), p)) for i in range(n)])
print('{0:.6f}'.format(pow(s, 1 / p)))
print('{0:.6f}'.format(max([abs(x[i] - y[i]) for i in range(n)])))
|
import math
num = int(input())
x = list(map(float,input().split()))
y = list(map(float,input().split()))
diff = [0]*num
for a in range(num):
diff[a] = abs(x[a] - y[a])
print(sum(diff)) #1
po = [0]*num
for b in range(num):
po[b] = diff[b] * diff[b]
print(math.sqrt(sum(po))) #2
for c in range(num):
po[c] = diff[c] * diff[c] * diff[c]
print((sum(po))**(1/3)) #3
_max = 0
for d in diff:
if _max < d:
_max = d
print(_max)#infinity
| 1 | 216,658,214,598 | null | 32 | 32 |
from scipy import misc
N = int(input())
K = int(input())
d = len(str(N))
first = int(str(N)[0])
if K == 1:
print(9*(d-1)+first)
elif K == 2:
if d == 1:
print('0')
else:
for i in range(1,d):
if str(N)[i] != '0':
second_dig = i+1
second_num = int(str(N)[i])
break
else:
second_dig = d
second_num = 0
print(((d-1)*(d-2)//2*81)+(first-1)*(d-1)*9+(d-second_dig)*9+second_num)
else:
if K < 3:
print('0')
else:
found_second = False
found_third = False
for i in range(1,d):
if str(N)[i] != '0':
if found_second == False:
second_dig = i+1
second_num = int(str(N)[i])
found_second = True
else:
third_dig = i+1
third_num = int(str(N)[i])
found_third = True
break
if found_second == False:
print((d-1)*(d-2)*(d-3)//6*729+(first-1)*((d-1)*(d-2)//2*81))
elif found_third == False:
print((d-1)*(d-2)*(d-3)//6*729+(first-1)*((d-1)*(d-2)//2*81)+(second_num-1)*(d-second_dig)*9+(d-second_dig)*(d-second_dig-1)//2*81)
else:
print((d-1)*(d-2)*(d-3)//6*729+(first-1)*((d-1)*(d-2)//2*81)+(second_num-1)*(d-second_dig)*9+(d-second_dig)*(d-second_dig-1)//2*81+(d-third_dig)*9+third_num)
|
n = str(input())
k = int(input())
l = len(n)
def f(dig, under, num):
if num > l - dig: return 0
if num == 0: return 1
if dig == l-1:
if under: return int(n[dig])
else: return 9
if under:
if n[dig] == '0':
res = f(dig+1, True, num)
#print(dig, under, num, res, 'aaa')
return res
else:
res = f(dig+1, False, num)
if int(n[dig]) > 1:
res += (int(n[dig])-1) * f(dig+1, False, num-1)
res += f(dig+1, True, num-1)
#print(dig, under, num, res, 'bbb')
return res
else:
res = f(dig+1, False, num)
res += 9 * f(dig+1, False, num-1)
#print(dig, under, num, res, 'ccc')
return res
ans = f(0, True, k)
print(ans)
| 1 | 75,964,574,103,652 | null | 224 | 224 |
#!/usr/bin python3
# -*- coding: utf-8 -*-
h, w, k = map(int, input().split())
a = [list(map(int, list(input()))) for _ in range(h)]
ret = 100000
for i in range(2 ** (h-1)):
hi = [0] * h
for j in range(h-1):
hi[j+1] += hi[j] + (i >> j & 1)
cnt = max(hi)
pj = 0
x = []
while pj < w:
s = [0] * 10
fg = False
for j in range(pj, w):
for t in range(h):
s[hi[t]] += a[t][j]
if max(s)>k:
if j == pj:
cnt = 100000
fg = True
break
else:
x.append(j)
cnt += 1
pj = j
break
if j == w-1:
pj = w
break
if fg:
break
ret = min(ret, cnt)
print(ret)
|
# coding: utf-8
import sys
import numpy as np
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
H, W, K = lr()
S = np.array([list(map(int, sr())) for _ in range(H)])
Scum = np.cumsum(S, axis=1)
INF = 10 ** 10
answer = INF
for pattern in range(1<<H-1):
cnt = 0
Tcum = Scum.copy()
for i in range(H-1):
if pattern>>i & 1: # 切れ目
cnt += 1
else:
Tcum[i+1] += Tcum[i]
prev = -1
w = 0
Tcum = Tcum.tolist()
while w < W:
cut = False
for i in range(H):
if Tcum[i][w] - (Tcum[i][prev] if prev >= 0 else 0) > K:
cut = True
break
if cut:
if prev == w - 1: # 1列でKをオーバー
break
cnt += 1
prev = w - 1
else:
w += 1
else:
answer = min(answer, cnt)
print(answer)
| 1 | 48,320,420,133,970 | null | 193 | 193 |
import sys
sys.setrecursionlimit(10 ** 5 * 2)
N, K = map(int, input().split())
A = [0] + list(map(int, input().split()))
top = -1
hist = []
finished = [True] + [False for _ in range(N)]
seen = [True] + [False for _ in range(N)]
def dfs(cur):
global hist, finished, seen, top
hist.append(cur)
seen[cur] = True
nex = A[cur]
if seen[nex] and not finished[nex]:
top = nex
return
dfs(nex)
if not top == -1:
return
hist.pop()
finished[cur] = True
dfs(1)
cycle = []
while not hist == []:
i = hist.pop()
cycle.append(i)
if i == top:
break
cycle.reverse()
cur = 1
while not cur == top and not K == 0:
cur = A[cur]
K -= 1
if cur == top:
cur = cycle[K % len(cycle)]
print(cur)
|
# -*- coding: utf-8 -*-
l = input()
S1, S2 = [], []
sum = 0
n = len(l)
for i in range(n):
if l[i] == "\\":
S1.append(i)
elif l[i] == "/" and S1:
j = S1.pop()
a = i - j
sum += a
while S2 and S2[-1][0] > j:
a += S2.pop()[1]
S2.append([j, a])
print(sum)
print(len(S2), *(a for j, a in S2))
| 0 | null | 11,429,936,401,380 | 150 | 21 |
main=list(map(int,input().split()));count=0
for i in range(main[0],main[1]+1):
if(i%main[2]==0): count=count+1
print(count)
|
n = int(input())
A = list(map(int,input().split()))
A = sorted([(a,i) for i,a in enumerate(A)],reverse=True)
dp=[[0]*(n+1) for i in range(n+1)]
# i+j=n
for i in range(n):
for j in range(n-i):
a,k=A[i+j]
dp[i+1][j]=max(dp[i+1][j], dp[i][j]+abs(k-i)*a)
dp[i][j+1]=max(dp[i][j+1], dp[i][j]+abs((n-j-1)-k)*a)
ans=0
for i in range(n+1):
ans=max(ans,max(dp[i]))
print(ans)
| 0 | null | 20,736,437,738,400 | 104 | 171 |
from functools import reduce
MOD = 10**9 + 7
n, a, b = map(int, input().split())
def combination2(n, r, MOD=10**9+7):
if not 0 <= r <= n: return 0
r = min(r, n - r)
numerator = reduce(lambda x, y: x * y % MOD, range(n, n - r, -1), 1)
denominator = reduce(lambda x, y: x * y % MOD, range(1, r + 1), 1)
return numerator * pow(denominator, MOD - 2, MOD) % MOD
print((pow(2,n,MOD) - combination2(n,a) - combination2(n,b)-1)%MOD)
|
c=input().split(" ")
print(c[1]+c[0])
| 0 | null | 84,427,706,638,108 | 214 | 248 |
# -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, product, permutations
from operator import add, mul, sub
import sys
# sys.setrecursionlimit(10**6)
# buff_readline = sys.stdin.buffer.readline
buff_readline = sys.stdin.readline
readline = sys.stdin.readline
INF = 2**62-1
def read_int():
return int(buff_readline())
def read_int_n():
return list(map(int, buff_readline().split()))
def read_float():
return float(buff_readline())
def read_float_n():
return list(map(float, buff_readline().split()))
def read_str():
return readline().strip()
def read_str_n():
return readline().strip().split()
def error_print(*args):
print(*args, file=sys.stderr)
def mt(f):
import time
def wrap(*args, **kwargs):
s = time.time()
ret = f(*args, **kwargs)
e = time.time()
error_print(e - s, 'sec')
return ret
return wrap
class UnionFind():
def __init__(self):
self.__table = {}
self.__size = defaultdict(lambda: 1)
self.__rank = defaultdict(lambda: 1)
def __root(self, x):
if x not in self.__table:
self.__table[x] = x
elif x != self.__table[x]:
self.__table[x] = self.__root(self.__table[x])
return self.__table[x]
def same(self, x, y):
return self.__root(x) == self.__root(y)
def union(self, x, y):
x = self.__root(x)
y = self.__root(y)
if x == y:
return False
if self.__rank[x] < self.__rank[y]:
self.__table[x] = y
self.__size[y] += self.__size[x]
else:
self.__table[y] = x
self.__size[x] += self.__size[y]
if self.__rank[x] == self.__rank[y]:
self.__rank[x] += 1
return True
def size(self, x):
return self.__size[self.__root(x)]
def num_of_group(self):
g = 0
for k, v in self.__table.items():
if k == v:
g += 1
return g
@mt
def slv(N, M, AB):
uf = UnionFind()
p = set()
for a, b in AB:
uf.union(a, b)
p.add(a)
p.add(b)
ans = 1
for c in p:
ans = max(ans, uf.size(c))
return ans
def main():
N, M = read_int_n()
AB = [read_int_n() for _ in range(M)]
print(slv(N, M, AB))
if __name__ == '__main__':
main()
|
class UFTree:
def __init__(self, N):
self.nodes = [Node(i) for i in range(N)]
self.N = N
def find_max_child_num(self):
result = 0
for i in range(self.N):
result = max(result, self.nodes[i].child_num)
return result
class Node:
def __init__(self, ID):
self.ID = ID
self.parent = None
self.child_num = 0
self.rank = 1
def get_root(self):
if self.parent is None:
return self
return self.parent.get_root()
def is_in_same_tree(self, another):
return self.get_root().ID == another.get_root().ID
def concat(self, another):
if self.is_in_same_tree(another):
return
sr = self.get_root()
ar = another.get_root()
if sr.rank > ar.rank:
parent, child = sr, ar
else:
parent, child = ar, sr
parent.child_num += child.child_num + 1
parent.rank = max(parent.rank, child.rank + 1)
child.parent = parent
N, M = map(int, input().split())
tree = UFTree(N)
AB = []
for i in range(M):
l = list(map(int, input().split()))
AB.append(l)
for i in range(M):
a, b = AB[i][0], AB[i][1]
a -= 1;
b -= 1;
tree.nodes[a].concat(tree.nodes[b])
# # for debug
# for i in range(N):
# n = tree.nodes[i]
# if n.parent is None:
# print(i + 1, "is root")
# else:
# print("parent of", i + 1, "is", n.parent.ID + 1)
print(tree.find_max_child_num() + 1)
| 1 | 3,969,968,638,130 | null | 84 | 84 |
a,b = map(int,input().split())
s = a*b
l = 2*(a+b)
print(s,l)
|
InputNum = input().split()
tate = int(InputNum[0])
yoko = int(InputNum[1])
square = tate * yoko
length = 2* (tate + yoko)
print(square,length)
| 1 | 298,938,533,700 | null | 36 | 36 |
n = int(input())
s, t = map(str, input().split())
sl = list(s)
tl = list(t)
a = []
for i in range(n):
a.append(s[i])
a.append(t[i])
print(''.join(a))
|
n=int(input())
li = input().split()
a=''
for i in range(n):
a+=li[0][i]+li[1][i]
print(a)
| 1 | 112,074,379,281,422 | null | 255 | 255 |
import sys
read=sys.stdin.readline
class SEGTree:
def __init__(self,n):
self.Unit=0
i=1
while(i<n):
i*=2
self.SEG=[self.Unit]*(2*i-1)
self.d=i
def update(self,i,x):
i+=self.d-1
self.SEG[i]=1<<x
while i>0:
i=(i-1)//2
self.SEG[i]=self.SEG[i*2+1]|self.SEG[i*2+2]
def find(self,a,b,k,l,r):
if r<=a or b<=l:
return self.Unit
if a<=l and r<=b:
return self.SEG[k]
else:
c1=self.find(a,b,2*k+1,l,(l+r)//2)
c2=self.find(a,b,2*k+2,(l+r)//2,r)
return c1|c2
def get(self,a,b):
return self.find(a,b,0,0,self.d)
def bitcnt(x):
res=0
while x>0:
if x&1:
res+=1
x//=2
return res
n=int(input())
s=input()
q=int(input())
seg=SEGTree(n)
for i in range(n):
seg.update(i,ord(s[i])-97)
for i in range(q):
q,x,y=read().rstrip().split()
if q=='1':
seg.update(int(x)-1,ord(y)-97)
else:
x,y=int(x)-1,int(y)
bit=seg.get(x,y)
print(bitcnt(bit))
|
import sys
input = lambda: sys.stdin.readline().rstrip()
class SegTree:
def __init__(self, init_val, segfunc, ide_ele):
n = len(init_val)
self.ide_ele = ide_ele
self.segfunc = segfunc
self.num = 2**(n - 1).bit_length()
self.seg = [self.ide_ele] * 2 * self.num
for i in range(n):
self.seg[i + self.num - 1] = init_val[i]
for i in range(self.num - 2, -1, -1):
self.seg[i] = self.segfunc(self.seg[2 * i + 1], self.seg[2 * i + 2])
def update(self, k, x):
k += self.num - 1
self.seg[k] = x
while k:
k = (k - 1) // 2
self.seg[k] = self.segfunc(self.seg[k * 2 + 1], self.seg[k * 2 + 2])
def query(self, p, q):
if q <= p:
return self.ide_ele
p += self.num - 1
q += self.num - 2
res = self.ide_ele
while q - p > 1:
if p & 1 == 0:
res = self.segfunc(res, self.seg[p])
if q & 1 == 1:
res = self.segfunc(res, self.seg[q])
q -= 1
p = p // 2
q = (q - 1) // 2
if p == q:
res = self.segfunc(res, self.seg[p])
else:
res = self.segfunc(self.segfunc(res, self.seg[p]), self.seg[q])
return res
def solve():
N = int(input())
S = list(input())
Q = int(input())
seg = [[0 for _ in range(N)] for _ in range(26)]
for i in range(N):
al = ord(S[i]) - ord('a')
seg[al][i] = 1
segtree = []
segfunc = lambda a, b: a | b
for i in range(26):
segtree.append(SegTree(seg[i], segfunc, 0))
ans = []
for i in range(Q):
a, b, c = input().split()
a = int(a)
if a == 1:
b = int(b) - 1
ps = S[b]
S[b] = c
segtree[ord(ps) - ord('a')].update(b, 0)
segtree[ord(c) - ord('a')].update(b, 1)
elif a == 2:
b, c = int(b) - 1, int(c)
count = 0
for i in range(26):
count += segtree[i].query(b, c)
ans.append(count)
print('\n'.join(map(str, ans)))
if __name__ == '__main__':
solve()
| 1 | 62,158,191,205,292 | null | 210 | 210 |
se = set([])
n = int(raw_input())
for i in range(n):
s = raw_input().split()
if s[0] == 'insert':
se.add(s[1])
elif s[0] == 'find':
if s[1] in se:
print 'yes'
else:
print 'no'
|
def resolve():
N = int(input())
s = set()
for _ in range(N):
a, b = input().split()
if a == "insert":
s.add(b)
else:
if b in s:
print("yes")
else:
print("no")
resolve()
| 1 | 77,790,427,998 | null | 23 | 23 |
from collections import Counter
n = int(input())
s = [input() for _ in range(n)]
data = Counter(s)
print(len(data.keys()))
|
N=int(input())
A=map(int, input().split())
P=1000000007
ans = 1
cnt = [3 if i == 0 else 0 for i in range(N + 1)]
for a in A:
ans=ans*cnt[a]%P
if ans==0:
break
cnt[a]-=1
cnt[a+1]+=1
print(ans)
| 0 | null | 80,219,645,259,402 | 165 | 268 |
from collections import deque
import sys
deq = deque()
q = int(input())
for _ in range(q):
s = input()
if s == 'deleteFirst':
deq.popleft()
elif s == 'deleteLast':
deq.pop()
else:
ss, num = s.split()
if ss == 'insert':
deq.appendleft(num)
else:
try:
deq.remove(num)
except:
pass
print(" ".join(deq))
|
import random
def Nickname():
Name = str(input()) #入力回数を決める
num = random.randint(0, len(Name) - 3)
print(Name[num:num+3])
if __name__ == '__main__':
Nickname()
| 0 | null | 7,387,755,311,288 | 20 | 130 |
while True:
(n, x) = [int(i) for i in input().split()]
if n == x == 0:
break
count = 0
start = n if n < x else x
for a in range(start, 0, -1):
if a >= x:
continue
for b in range(a - 1, 0, -1):
if a + b >= x:
continue
for c in range(b - 1, 0, -1):
if a + b + c == x:
count += 1
print(count)
|
from itertools import combinations
while True:
n, x = map(int, input().split())
if not n:
break
print(sum(1 for cmb in combinations(range(1, n + 1), 3) if sum(cmb) == x))
| 1 | 1,297,670,396,858 | null | 58 | 58 |
import bisect
import copy
import heapq
import math
import sys
from collections import *
from itertools import accumulate, combinations, permutations, product
def input():
return sys.stdin.readline()[:-1]
def ruiseki(lst):
return [0]+list(accumulate(lst))
mod=pow(10,9)+7
al=[chr(ord('a') + i) for i in range(26)]
direction=[[1,0],[0,1],[-1,0],[0,-1]]
n,k=map(int,input().split())
a=list(map(int,input().split()))
# amari=[a[i]%k for i in range(n)]
rui=ruiseki(a)
# print(a)
# print(amari)
# print(rui)
dic=defaultdict(int)
ans=0
for i in range(n+1):
if i>=k:
dic[(rui[i-k]-(i-k))%k]-=1
ans+=dic[(rui[i]-i)%k]
dic[(rui[i]-i)%k]+=1
# print(dic)
print(ans)
|
import sys
from collections import defaultdict
#+++++
def main():
n, k = map(int, input().split())
aal = list(map(int, input().split()))
sss = [0]*(n+1)
si=0
for i, a in enumerate(aal):
si+=a-1
sss[i+1]=si%k
count=0
mkl_dict=defaultdict(lambda :0)
for j in range(n+1):
sj=sss[j]
if j-k >= 0:
mkl_dict[sss[j-k]]-=1
count += mkl_dict[sj]
mkl_dict[sj] += 1
print(count)
#+++++
isTest=False
def pa(v):
if isTest:
print(v)
if __name__ == "__main__":
if sys.platform =='ios':
sys.stdin=open('inputFile.txt')
isTest=True
else:
pass
#input = sys.stdin.readline
ret = main()
if ret is not None:
print(ret)
| 1 | 137,691,001,744,730 | null | 273 | 273 |
from math import gcd
# X * K = 360 * n
lcm = lambda x, y: (x * y) // gcd(x, y)
X = int(input())
print(lcm(X, 360) // X)
|
# n, m, l = map(int, input().split())
# list_n = list(map(int, input().split()))
# n = input()
# list = [input() for i in range(N)
# list = [[i for i in range(N)] for _ in range(M)]
import sys
input = sys.stdin.readline
A, B, M = map(int, input().split())
List_A = list(map(int, input().split()))
List_B = list(map(int, input().split()))
List_discount = [list(map(int, input().split())) for i in range(M)]
# print(List_discount)
ans = 2 * 10**5
for d in List_discount:
# print(d)
p = List_A[d[0]-1] + List_B[d[1]-1] - d[2]
ans = min(ans, p)
no_discount = min(List_A) + min(List_B)
ans = min(ans, no_discount)
print(ans)
| 0 | null | 33,622,114,798,700 | 125 | 200 |
# https://atcoder.jp/contests/abc154/tasks/abc154_e
def digit(N, M):
"""
:param N: 0 <= n <= N の整数 (※ 下限が 1 の場合は返り値を -= 1 等する)
:param M: 状態数（例: 0<= (0の個数) <= M）
dp[0][i][*]: 上からi桁目までが N と一致
dp[1][i][*]: 上からi桁目までで N である事が確定
dp[*][*][j]: 状態 j の個数（今回は j = (0 の個数) ）
"""
def f(j,k):
"""状態 j からの繊維。 i+1 桁目の数( = j)に依存"""
return min2(j + (k != 0), M - 1)
L = len(N)
dp = [[[0] * M for i in range(L + 1)] for j in range(2)]
dp[0][0][0] = 1
for i in range(L):
for j in range(M):
for k in range(10):
if k < N[i]:
dp[1][i+1][f(j, k)] += dp[0][i][j] + dp[1][i][j]
elif k == N[i]:
dp[0][i+1][f(j, k)] += dp[0][i][j]
dp[1][i+1][f(j, k)] += dp[1][i][j]
else:
dp[1][i+1][f(j, k)] += dp[1][i][j]
return dp[0][L][K] + dp[1][L][K]
##########################################################################################
N = list(map(int, input().strip())) # 整数を桁毎のリストとして読み込む
K = int(input())
M = K + 2 # 状態数
def min2(x,y):
return x if x < y else y
print(digit(N, M))
|
N = input()
K = int(input())
L = len(N)
dp =[[[ 0 for _ in range(2)] for _ in range(5)] for _ in range(len(N)+1)]
# dp[i][j][flg] i+1桁目までで0以外の個数がj個
# flg = 1 -> N 以下が確定している
dp[0][1][1] = int(N[0])-1
dp[0][1][0] = 1
dp[0][0][1]=1
for i in range(1,L):
for j in range(4):
b = i-1 # hitotumae
now = int(N[i])
## N上限に張り付いてる方
if now == 0:
dp[i][j][0] += dp[b][j][0]
else:
dp[i][j][1] += dp[b][j][0]
dp[i][j+1][1] += dp[b][j][0] * (now-1)
dp[i][j+1][0] += dp[b][j][0]
## 張り付いてない方
dp[i][j][1] += dp[b][j][1]
dp[i][j+1][1] += dp[b][j][1] * 9
print(dp[L-1][K][0] + dp[L-1][K][1])
| 1 | 75,954,363,137,572 | null | 224 | 224 |
def gcd(a,b):
if b ==0:
return a
else:
return gcd(b, a%b)
A,B = map(int, input().split())
A,B = (A,B) if A>B else (B,A)
print(int(A/gcd(A,B)*B))
|
def gcd(a, b):
for i in range(min(a, b), 0, -1):
if a%i == 0 and b%i == 0:
return i
A, B = map(int, input().split())
print((A*B) // gcd(A, B))
| 1 | 113,565,155,863,584 | null | 256 | 256 |
# This code is generated by [Atcoder_base64](https://github.com/kyomukyomupurin/AtCoder_base64)
# Original source code :
"""
#include <stdio.h>
int main() {
int d, t, s; scanf("%d %d %d", &d, &t, &s);
if (s * t >= d) {
puts("Yes");
} else {
puts("No");
}
}
"""
import base64
import subprocess
import zlib
exe_bin = "c%1E7eQZ<L6~E6(hy#gZNC5M(VYSW_*2N?cAdIHu1t+{rNk}1KR0W<Ke<U7`o!QS_K;4FvGRdOuJZaKUyQ!5XO?2wC_K!_eleVCAU8hYNmA18Nsl=)>1y;0dtPx`(-nsAH^Zf4hdz4B0lcPB2o!>p@-0%C&J@1=+gZ(Z^B1l!_F+!!{3PbK;cyWWN0$3NRga4l)n+a8`w&;ocw#0L{S&w1Y<uYWEZzepKEWCy|(@Y)D3GthDw5=B!4D>>SpW~CP-f0(a=VEpjncYREk9?6eY*FZ6HT#V+e<BYNo>wzIa!rfU=T7EG<c|`bqut|Rw}RY1c^N;%>T?>GqpZEiaUQlM6XUx&w<V)($wVqQ(>Bw!t8G_jFq;l;*W2V}x(9~GbbUJCIJC69nPIfNe*TU;@}oZ<X?p7gY2C}GKUkNY`?19A%PaH#=&J;0j;D?ATVsQ7alrRE-~|W&s~q&d@1WlfzlUsa0^=H?!?=s6Y9gDC?AfDcBjHq>Oy{&LU|B63IjKe_Ppa{7A_+ibCalI2sc<rJItC)Or%D-3oeC#X<iOxS?|yZAaJTu?X+CWa?j-8K=#UzXWnvSFtQO0R4((5-Q?b$Tc#?XXm`bOZH`P$JRixyC`J^*ktv^d3(YeEQwmy+)pk<FUtXY?<$dgRYZA{cryBO2Q^@sbZSZnZC1$>0zZZD6c{BEPc>E5uerK=Xa+JY}waO*j<Xu)eO_-zaBw%~INr@Af+{+0!=vf!63xOE>Zvmd*ab2Z&7{X{uCr@2a(mDxAk^JaNz=Z!i)DYbkI{~NdTz!Q}xY0>qoC7_lMsZ6_m{jx5<M`hZi>vOvNPmtq9OMR_Mp}P(gqRP4ImR5@8LjhmMoKhGJG%JPCfLAGKf%=8l!1`P$(A@abP{6x46sZ6D!(e#@s#<soiooF9(*a*p+3~3ECD#NkZ=DB~pHY>=pz^o(7mfjo2OGCMqt_lUcHA7uzkNc<f2hoUv^X+4Sg835Xe)(=TeKmCZmM5e`#EUyzZ$oMbZ7vCF{Mx=16TIkR`S=h4KQSP+{TbK94}oh*KmBEj#62seWiAVoi5$Y)@86)E-hCn`9<Z@!ahZMQ+az?^MS)l%waus=;ZHA_v@fWa@&;I?(fm3G1{Jb<y`mkAT1P@OQi(`y6|SrcR-e?`59_=Yd)^`hpHdH9;c(C%kr1yBLn$&<S`k>qGhQ@?`j+6hvod;f&9|o)@%A2xpcQ`;SYC9CFSf*&EN4pwr4PZXE47M%Ku$1HD6I?=Oty&2e}(`4Lx~WJ|-WRPsr+gvE2S!^K8wrRVKmeZHfBzKk`H@ONP@#+Elf-i>=dVp-O7`d*H7CzXJRX;K!h&qrj8UlaDA4{0owC?o*OZA0pC>SK3rx>n=*QUW)7Qda!%Mvi|M$2??M+)Yn6~$J_7meW`KP*W72wzKwf7za#Jv+S7Ne5A>}2liD7GpBHeA0wGVk>)1+<TVAD?Q=6yhd_sHlGpX0({kE&u<9n{E&*Lvt_j+2Ntx-Jf-&&z~x@K#KJUtmtm+WbmJ*~YSKj?veug9&QZFD>?fFJ8Q@PHoB1A0LBOBnxPykor&QL1PBB^I=>aGo@?Ll3WS7*}m#GM<SW8OQi)vrzuYaw$#ud3K0lY*b`H48|-MS@}vP|D5qvjQbd0OL)Rq=mLv_@T^p@AB<z{wVv^#H9UU4ns4_U<9Hp!`aer}z5kSq{z(j4X7W+yuT(DAX_3kOto+|hw#Ib-Ps01ANPlMi|10B5_qrV4gD_q`uz&v-{jFo;xs;ak?+)$^wzuub=~BlxI=X`Gom&m`etgm!K$p!+kKPkTZSg9i+2Ymay5sR0bG`BS3UgiZc&#~KJnlB<naAtQ^~B>V&2`7)tIYk!<Mm|D7H{B#eG~T(uPxqa?q?qN62C3J+RPj9_!=^8i#M6)1CKYG=K_zfwOyB0WSzN>c^r1F*ADj)uPwfz0;Bt{n*5_A;%*1LiO{peL*|6>T+49oG6&Sk@DTxjOs~7#PCN&O^ykX)(U_m2;OC64UpdZB?SE0%UqiGyvBX~gC;I=UiuU|c_ft7vzhU}fd*0LkSFWF%x}VDVt&(W|1J*6m$8Fgp+2=pb>UiaP*e2QMQDlkc3D#GvlLlSCa$hJ8exeTeEb}k6r|8iB7Xe@GT5q14NUu=bvLEsI_yrrEm)Ls1Jjd&V*6Sla!B3v)V;&aoM8A^^eQ_M#!SQGM8pE$R^mmE1U-aX0+4py|%RXQAYu&%ixkr;v!3c?Dw5*nk$KkP@WKy*$HA1sTG@%tus}srecsQv>wR9${hI2C{lAfAQ#<W;8xO>;0E_)@K^h&7VOeTCvjit2ADH6|wr($X}H#Kz%Oe~TLni{97s{M!Lp+2>5I7Aa$yh4<yp(lprp@IE;iJk`o=)mxp+NUrNO6U+#4-6jcl?T;>{r!jgM%7Wdcd$>zTwElZ)0=wFOdCz^_4IIgxmYx;g)0(%Wu?x_WS`(cr5?;y^Qk;FnoX;d;Z&5S`34R`K{Sz4bJ<wb+HTr;kjJxG=0;B`@`=fErMsa7dWD1Pm@VXUmVBd0FnelB3y%ZWG6tW-r$h=oO_N|Mt;K?J??9Uto?y~MDi<8jC6dv$M3m^#WH>uXg3(hc@Mmx>W0X7<%VZPj6ep-qmWd_9RFOSRCpB6n3;=x$PNd;Mi_O4)eKv!cv_3(>*d$wOlhI6BGE9wyV_4ub)DWIZMBqU;hp{C=SnpG?Fm3kN|4KBjr|%{_f1SRoAc^_)hY6pv6u(>e1${9*>JaQPo<kn^6nmO?S%O#^?J@2<FSH+z8!?O-CdOR@?J+(?{w~8YAB^^RFE~Q@Zxt9vBFFm-k~n@Rh;dgydyF@c<5`UDcM1F?G438HV_b^7$D#d5rwL}@4Z`>p`J7O{*#BpkeJ|Eu!*jfkQE{D({d1)Jt&I}C7m(w<4N08;ykL)UGx8om-z)I%3ijp$<KlR^1^xrU9^a?PUBZ3C%ZucPf<4A1$i*;D?ElMz-@h0~Aa54*Mf=wTd#CS*PWHbN?D3v}+$}74aXfzuKZvT!_j&VsqP@O2{(pjBqs1QM*jMk<{x8HBd$ccquQg=+PP;;|!+AVUjQ)%HhzpH|eDqW5zaiM0@uZipN3=&;WEk3GeCGAq>x<{lCkzuW=xD#y!QRU4^3*-d-p2-xzGogGmHWTW(snByU1xAHA0W1WwS#?;Rj@4JqWymX{m5y7"
open("./kyomu", 'wb').write(zlib.decompress(base64.b85decode(exe_bin)))
subprocess.run(["chmod +x ./kyomu"], shell=True)
subprocess.run(["./kyomu"], shell=True)
|
ri = lambda S: [int(v) for v in S.split()]
def rii(): return ri(input())
S, T = input().split()
A, B = rii()
U = input()
D = {S:A, T:B}
D[U] -= 1
print(D[S], D[T])
| 0 | null | 37,646,786,853,120 | 81 | 220 |
N = input()
A = map(int,raw_input().split())
for i in range(N-1):
print A[i],
print A[-1]
for i in range(1,N):
v = A[i]
j = i - 1
while j >= 0 and A[j] > v:
A[j+1] = A[j]
j -= 1
A[j+1] = v
for i in range(N-1):
print A[i],
print A[-1]
|
n,u,v = map(int,input().split())
import sys
input = sys.stdin.readline
from collections import deque
graph = [set() for _ in range(n+1)]
for _ in range(n-1):
a,b = map(int,input().split())
graph[a].add(b)
graph[b].add(a)
def bfs(graph, root):
depth = [None] * (n+1)
depth[0] = (-1,None)
d = deque()
d.append((root,0))
max_dep = 0
while(d):
child,parent = d.popleft()
depth[child] = (depth[parent][0] + 1, parent)
if( max_dep < depth[child][0] ):
max_dep = depth[child][0]
for i in graph[child]:
if i != parent:
d.append( (i,child) )
return depth,max_dep
depth_v,_ = bfs(graph, v)
now = list(depth_v[u])
u_depth = now[0]
limit = (u_depth+2)//2
while(now[0] > limit):
u = now[1]
now = depth_v[ u ]
if(len(graph[u]) == 1):
print( depth_v[u][0]//2 )
exit()
graph[u].discard( now[1] )
depth_new,max_dep = bfs(graph, u)
ans = limit + max_dep - 1
print(ans)
| 0 | null | 58,603,766,104,940 | 10 | 259 |
A, B = input().split()
C = B + A
print(C)
|
from sys import stdin
import math
s,t = stdin.readline().rstrip().split()
print(t + s)
| 1 | 103,040,936,558,080 | null | 248 | 248 |
def N():
return int(input())
def L():
return list(map(int,input().split()))
def NL(n):
return [list(map(int,input().split())) for i in range(n)]
mod = pow(10,9)+7
#import numpy
a,b,c,d = L()
ta = -(-c // b)
ao = -(-a//d)
#print(ta,ao)
if ta <= ao :
print("Yes")
else:
print("No")
|
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
import functools
def s(): return input()
def k(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def X(): return list(input())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 9)
mod = 10**9+7
cnt = 0
ans = 0
inf = float("inf")
a,b,c,d = I()
while a > 0 and c > 0:
c -= b
a -= d
if c <= 0:
print("Yes")
else:
print("No")
| 1 | 29,572,812,526,908 | null | 164 | 164 |
import bisect
import copy
import heapq
import math
import sys
from collections import *
from itertools import accumulate, combinations, permutations, product
from math import gcd
def input():
return sys.stdin.readline()[:-1]
def ruiseki(lst):
return [0]+list(accumulate(lst))
mod=pow(10,9)+7
al=[chr(ord('a') + i) for i in range(26)]
direction=[[1,0],[0,1],[-1,0],[0,-1]]
n,m=map(int,input().split())
half=n//2
lst=[]
if n%2==1:
for i in range(m):
lst.append([half-i,half+i+1])
else:
for i in range(m):
if i%2==0:
lst.append([half-i//2,half+i//2+1])
else:
lst.append([1+i//2,n-1-i//2])
for i in range(m):
print(*lst[i])
# dic=defaultdict(int)
# for i in range(m):
# tmp=lst[i]
# dic[tmp[1]-tmp[0]]+=1
# dic[n-tmp[1]+tmp[0]]+=1
# print(dic)
|
from collections import defaultdict
def main():
N = int(input())
d = defaultdict(int)
results = ["AC", "WA", "TLE", "RE"]
for _ in range(N):
d[input()] += 1
for r in results:
print(f"{r} x {d[r]}")
if __name__ == '__main__':
main()
| 0 | null | 18,759,840,485,188 | 162 | 109 |
n = list(input())
for i in range(len(n)) :
n[i] = int(n[i])
if sum(n)%9==0 :
print("Yes")
else :
print("No")
|
# B - Tax Rate
N = int(input())
ans = ':('
for x in range(50000):
if (108*x)//100==N:
ans = x
break
print(ans)
| 0 | null | 64,934,402,380,910 | 87 | 265 |
H1,M1,H2,M2,K=map(int, input().split())
M1 += H1*60
M2 += H2*60
print(M2-M1-K)
|
a = int(input())
b = a*a*a
c = a*a
print(a+b+c)
| 0 | null | 14,074,298,949,198 | 139 | 115 |
H, A = map(int,input().split())
a = int(H/A)
b = H/A
if a==b:
print(a)
else:
c = a+1
print(c)
|
N,M = map(int,input().split())
home = list(map(int,input().split()))
if N - sum(home) < 0:
print("-1")
else:
print(N - sum(home))
| 0 | null | 54,655,978,886,120 | 225 | 168 |
def Judge(a):
col=[]
diag1=0
diag2=0
for i in range(3):
if(a[i].count(0)==3):
return 1
break
if(a[i][0]==0):
col.append(0)
if(a[i][1]==0):
col.append(1)
if(a[i][2]==0):
col.append(2)
if(a[i][i]==0):
diag1+=1
if(a[i][-(i+1)]==0):
diag2+=1
if(diag1==3 or diag2==3):
return 1
if(col.count(0)==3 or col.count(1)==3 or col.count(2)==3):
return 1
return 0
a=[]
for i in range(3):
a.append(list(map(int,input().split())))
n=int(input())
for i in range(n):
b=int(input())
for j in range(3):
for k in range(3):
if(b==a[j][k]):
a[j][k]=0
judge=Judge(a)
if(judge==1):
print("Yes")
else:
print("No")
|
n=int(input())
box1=[]
box2=[]
for i in range(n):
i=input().rstrip().split(" ")
box1.append(i[0])
box2.append(int(i[1]))
num=box1.index(input())
del box2[:num+1]
print(sum(box2))
| 0 | null | 78,234,519,299,588 | 207 | 243 |
a,b,c=map(int,input().split())
if (a==b and b==c) or (a!=b and b!=c and c!=a):
print("No")
else:
print("Yes")
|
A,B,C=map(int,input().split())
if len(set([A,B,C]))==2:print('Yes')
else:print('No')
| 1 | 68,040,530,511,070 | null | 216 | 216 |
def main():
n, k = map(int, input().split())
h_lst = list(map(int, input().split()))
ans = 0
for h in h_lst:
if h >= k:
ans += 1
print(ans)
if __name__ == "__main__":
main()
|
n, k = (int(i) for i in input().split())
list_h = sorted([int(i) for i in input().split()])
if list_h[-1] < k:
print("0")
exit()
count = 0
for count in range(0, n):
if list_h[count] >= k: break
print(len(list_h[count:]))
| 1 | 178,617,279,541,310 | null | 298 | 298 |
n = int(input())
a = list(map(int,input().split()))
flag = 1
i = 0
count = 0
while flag:
flag = 0
for j in range(n-1,i,-1):
if a[j] < a[j-1]:
a[j],a[j-1] = a[j-1],a[j]
count += 1
flag = 1
i += 1
for w in range(n):
if w != n-1:
print(a[w],end=" ")
else:
print(a[w])
print(count)
|
#bubble
N=int(input())
A=[int(i) for i in input().split()]
fl=1
C=0
while fl==1:
fl=0
for j in range(N-1):
if A[N-1-j]<A[N-2-j]:
t=A[N-1-j]
A[N-1-j]=A[N-2-j]
A[N-2-j]=t
C+=1
fl=1
for j in range(N):
A[j]=str(A[j])
print(" ".join(A))
print(C)
| 1 | 15,542,567,900 | null | 14 | 14 |
import sys
n = int(input())
for i in range(int(n / 1.08), int(n / 1.08) + 2):
if int(i * 1.08) == n:
print(i)
sys.exit()
else:
print(":(")
|
#!/usr/bin/env python3
def main():
import sys
input = sys.stdin.readline
X = int(input())
cnt = 0
res = 100
while True:
if res >= X:
print(cnt)
break
res += res // 100
cnt += 1
if __name__ == '__main__':
main()
| 0 | null | 76,042,636,515,682 | 265 | 159 |
def main(n,m,s):
#i初期化
i = n
tmp = []
while i > 0 :
for j in range(m,-1,-1):
if j == 0 :
i = -1
break
if i-j >= 0 :
if s[i-j] == '0':
i -= j
tmp.append(j)
break
if i == 0:
for l in reversed(tmp):
print(l,end=' ')
else:
print(-1)
n,m = map(int,input().split())
s = input()
main(n,m,s)
|
N = int(input())
lst = list(map(int, input().split()))
c = True
for i in lst:
if i%2 ==0:
if i%3 != 0 and i%5 != 0:
c = False
break
if c:
print('APPROVED')
else:
print('DENIED')
| 0 | null | 103,518,579,588,700 | 274 | 217 |
X = int(input())
a = X // 500 * 1000
b = X % 500 // 5 * 5
print(a + b)
|
t,T,a,A,b,B=map(int,open(0).read().split())
x,y=(b-a)*t,(A-B)*T
if y-x==0:
r="infinity"
else:
s,t=divmod(x,y-x)
r=max(0,s*2+(t!=0))
print(r)
| 0 | null | 87,156,497,091,420 | 185 | 269 |
import math
def calc_combi(n,m):
if n<=1:
return 0
return math.factorial(n)/(math.factorial(m)*(math.factorial(n-m)))
n,m=map(int,input().split())
ans=int(calc_combi(n,2)+calc_combi(m,2))
print(ans)
|
#C
A,B=map(int,input().split())
GCD=1
for i in range(2,10**5+1):
if A%i==0 and B%i==0:
GCD=i
LCM=A*B/GCD
print(int(LCM))
| 0 | null | 79,525,049,993,348 | 189 | 256 |
N = int(input())
m = N//100
M = N//105
if 100*m <= N <= 105*m or 100*M <= N <= 105*M:
print(1)
else:
print(0)
|
from collections import deque
x = deque()
for i in range(int(input())):
com = input()
if com == "deleteFirst":
x.popleft()
elif com == "deleteLast":
x.pop()
else:
com,n = com.split()
if com == "insert":
x.appendleft(n)
elif com == "delete":
try:
x.remove(n)
except:
pass
print(*x)
| 0 | null | 63,805,784,474,968 | 266 | 20 |
# 入力
n = int(input())
p = list(map(int, input().split()))
q = list(map(int, input().split()))
# ライブラリ
import itertools
l = [i+1 for i in range(n)]
perms = itertools.permutations(l, n)
# 処理
a = 0
b = 0
for i, perm in enumerate(perms):
perm = list(perm)
if perm == p:
a = i
if perm == q:
b = i
import numpy as np
print(np.abs(a-b))
|
N = int(input())
P = list(map(int, input().split()))
Q = list(map(int, input().split()))
p = -1
q = -1
jun = []
a = [(k+1) for k in range(N)]
def make(now):
if len(now) == N:
jun.append(now)
return 0
for item in a:
if item not in now:
make(now+ [item])
make([])
for k in range(len(jun)):
if jun[k] == P:
p = k
if jun[k] == Q:
q = k
if p >=0 and q >=0:
break
print(abs(p-q))
| 1 | 100,556,482,185,988 | null | 246 | 246 |
input()
a = input().split()
a.reverse()
print(' '.join(a))
|
from collections import Counter,defaultdict,deque
from heapq import heappop,heappush,heapify
from bisect import bisect_left,bisect_right
import sys,math,itertools,fractions,pprint
sys.setrecursionlimit(10**8)
mod = 10**9+7
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
n,m = inpl()
ge = []
l = 1
r = n-1
for i in range(m):
if i%2:
ge.append(l)
else:
ge.append(r)
l += 1; r -= 1
ge.sort(reverse = True)
for i in range(m):
print(i+1,i+1+ge[i])
| 0 | null | 14,950,277,190,142 | 53 | 162 |
n = int(input())
a = 10 - n // 200
print(a)
|
while True:
H, W = [int(i) for i in input().split()]
if H == W == 0:
break
for i in range(H):
if i == 0 or i == H - 1:
print('#' * W)
else:
print('#{0}#'.format('.' * (W - 2)))
print('')
| 0 | null | 3,776,343,915,920 | 100 | 50 |
w = str.lower(raw_input())
t = []
while True:
line = raw_input()
if line == "END_OF_TEXT":
break
else:
t += (map(str.lower, line.split(" ")))
count = 0
for i in xrange(len(t)):
if w == t[i]:
count += 1
print count
|
s=input()
tex=[]
while 1:
a=input()
if a=="END_OF_TEXT":
break
else:
tex.extend([x.lower() for x in a.split()])
c=0
tex
for i in tex:
if i==s:
c+=1
print(c)
| 1 | 1,793,090,912,480 | null | 65 | 65 |
n,m=map(int,input().split())
s=input()
ans=[]
w=n
while w:
x=0
for i in range(1,m+1):
if w-i>=0 and s[w-i]=='0':
x=i
if x==0:
print(-1)
exit()
else:
ans.append(x)
w-=x
print(*ans[::-1])
|
from collections import defaultdict
n=int(input())
a=[int(i) for i in input().split()]
INF=float('inf')
dp0=defaultdict(lambda: -INF)
dp1=defaultdict(lambda: -INF)
dp0[(0,0)]=0
for i in range(1,n+1):
for j in range(i//2-1,(i+1)//2+1):
dp0[(i,j)]=max(dp0[(i-1,j)],dp1[(i-1,j)])
dp1[(i,j)]=dp0[(i-1,j-1)]+a[i-1]
print(max(dp0[(n,n//2)],dp1[(n,n//2)]))
| 0 | null | 88,434,431,106,992 | 274 | 177 |
N, K = (int(x) for x in input().split())
ans=0
while(N>=1):
N = int(N/K)
ans+=1
print(ans)
|
N,K=map(int,input().split())
num=0
while N>=K:
N=N//K
num+=1
print(num+1)
| 1 | 64,081,638,413,210 | null | 212 | 212 |
def ri():
return int(input())
def rii():
return [int(v) for v in input().split()]
def solve():
X, N = rii()
P = set(rii())
n = m = float("inf")
if not P:
print(X)
return
for i in range(min(P)-1, max(P)+2):
if i not in P:
d = abs(i - X)
if d == m:
n = min(n, i)
elif d < m:
m = d
n = i
print(n)
if __name__ == "__main__":
solve()
|
import sys
INF = 1 << 60
MOD = 10**9 + 7 # 998244353
sys.setrecursionlimit(2147483647)
input = lambda:sys.stdin.readline().rstrip()
def resolve():
S = input()
if S[-1] == 's':
S += 'es'
else:
S += 's'
print(S)
resolve()
| 0 | null | 8,333,772,133,544 | 128 | 71 |
N, T = map(int, input().split())
# 1-index
A = [0]
B = [0]
for _ in range(N):
a, b = map(int, input().split())
A.append(a)
B.append(b)
# dp1[i][j] 1 ~ i の料理で j 分以内に完食できる美味しさの合計の最大値
# dp2[i][j] i ~ N の料理で j 分以内に〃
# max(DP1[i − 1][j] + DP2[i + 1][T − 1 − j]) i番目以外で T - 1 以内
dp1 = [[0] * T for _ in range(N+2)]
dp2 = [[0] * T for _ in range(N+2)]
for i in range(1, N+1):
for j in range(T):
dp1[i][j] = dp1[i-1][j]
if j - A[i] >= 0:
dp1[i][j] = max(dp1[i][j], dp1[i-1][j - A[i]] + B[i])
for i in range(N, 0, -1):
for j in range(T):
dp2[i][j] = dp2[i+1][j]
if j - A[i] >= 0:
dp2[i][j] = max(dp2[i][j], dp2[i+1][j - A[i]] + B[i])
ans = 0
for i in range(1, N+1):
for j in range(T):
ans = max(ans, dp1[i-1][j] + B[i] + dp2[i+1][T - 1 - j])
print(ans)
|
a, b, c, d, e, f = map(int, input().split())
S = list(input())
i = 0
number1 = a
number2 = b
number3 = c
number4 = d
number5 = e
number6 = f
while i < len(S) :
if S[i] == "N" :
number1 = b
number2 = f
number3 = c
number4 = d
number5 = a
number6 = e
elif S[i] == "S" :
number1 = e
number2 = a
number3 = c
number4 = d
number5 = f
number6 = b
elif S[i] == "E" :
number1 = d
number2 = b
number3 = a
number4 = f
number5 = e
number6 = c
elif S[i] == "W" :
number1 = c
number2 = b
number3 = f
number4 = a
number5 = e
number6 = d
a = number1
b = number2
c = number3
d = number4
e = number5
f = number6
i = i + 1
print(number1)
| 0 | null | 75,872,246,626,968 | 282 | 33 |
def Ii():return int(input())
def Mi():return map(int,input().split())
def Li():return list(map(int,input().split()))
a,b = Mi()
print(a*b)
|
x,y=map(int ,input().split())
print(x*y)
| 1 | 15,807,727,247,818 | null | 133 | 133 |
n,m = map(int,input().split())
a = list(map(int,input().split()))
for v in a:
n = n - v
if n < 0:
n = -1
break
print(n)
|
n = list(map(int, input().split(' ')))
m = list(map(int, input().split(' ')))
if n[0] >= sum(m):
print(n[0] - sum(m))
else:
print(-1)
| 1 | 31,884,303,536,800 | null | 168 | 168 |
kyu = [2000, 1800, 1600, 1400, 1200, 1000, 800, 600, 400, 0]
x = int(input())
for k, num in enumerate(kyu):
if num > x >= kyu[k+1]:
print(k + 1)
break
|
N = int(input())
arr = list(map(int, input().split()))
first = 0
second = sum(arr)
min_delta = second - first
for i in range(N):
first += arr[i]
second -= arr[i]
min_delta = min(abs(second - first), min_delta)
print(min_delta)
| 0 | null | 74,474,527,596,602 | 100 | 276 |
A = int(input())
B = int(input())
for i in range(1, 4):
if i in [A, B]:
continue
else:
print(i)
break
|
import sys
import math
from collections import defaultdict, deque
from copy import deepcopy
input = sys.stdin.readline
def RD(): return input().rstrip()
def F(): return float(input().rstrip())
def I(): return int(input().rstrip())
def MI(): return map(int, input().split())
def MF(): return map(float,input().split())
def LI(): return list(map(int, input().split()))
def LF(): return list(map(float,input().split()))
def Init(H, W, num): return [[num for i in range(W)] for j in range(H)]
def fib(num):
d = defaultdict(int)
d[0] = 1
d[1] = 1
if num <= 1:
return d[num]
else:
for i in range(1,num):
d[i+1] = d[i]+d[i-1]
return d[num]
def main():
num = I()
print(fib(num))
if __name__ == "__main__":
main()
| 0 | null | 55,159,479,509,752 | 254 | 7 |
A,B,C,K=map(int,input().split())
ans=0
if A>K:
ans+=K
else:
ans+=A
if B>K-A:
ans+=0
else:
if (K-A-B)<C:
ans+=-(K-A-B)
else:
ans+=-C
print(ans)
|
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')
| 0 | null | 14,376,822,668,452 | 148 | 102 |
k, n = map(int, input().split())
a = list(map(int, input().split()))
d = [0]*n
for i in range(n):
if i == n-1:
d[n-1] = (k-a[n-1]) + a[0]
else :
d[i] = a[i+1] - a[i]
d.sort()
d[n-1] = 0
print(sum(d))
|
# C - Traveling Salesman around Lake
K,N = map(int,input().split())
A = list(map(int,input().split()))
tmp = 0
for i in range(N):
tmp = max(tmp, (A[i]-A[i-1])%K)
print(K-tmp)
| 1 | 43,442,296,217,760 | null | 186 | 186 |
import math
a, b, x = map(int, input().split())
if a*a*b//2 <= x:
print(math.degrees(math.atan((a*a*b-x)/a*2/a/a)))
else:
print(math.degrees(math.atan(b/(x/a*2/b))))
|
#!/usr/bin/env python
#-*- coding: utf-8 -*-
if __name__ == '__main__':
N = int(raw_input())
l = map(int, raw_input().split())
cnt = 0
for i in range(0, N):
minj = i
for j in range(i, N):
if l[j] < l[minj]:
minj = j
if i != minj:
l[i], l[minj] = l[minj], l[i]
cnt += 1
print ' '.join(map(str, l))
print cnt
| 0 | null | 81,558,690,041,630 | 289 | 15 |
N = list(map(int, input().split()))
if sum(N) % 9: print('No')
else: print('Yes')
|
import sys
input = sys.stdin.readline
mod = int(1e9+7)
n,k = map(int,input().split())
L=list(map(int,input().split()))
ans = 1
if k==n:
for i in L:
ans*=i
ans%=mod
print(ans%mod)
sys.exit()
pos = []
neg = []
for i in L:
if i>=0:
pos.append(i)
else:
neg.append(i)
pos.sort(reverse=True)
neg.sort()
if len(pos) == 0 and k%2!=0:
for i in range(1,k+1):
ans*=neg[-i]
ans%=mod
print(ans%mod)
sys.exit()
if k%2!=0:
ans*=pos.pop(0)
k-=1
l=[]
for i in range(1,len(pos),2):
l.append(pos[i]*pos[i-1])
for i in range(1,len(neg),2):
l.append(neg[i]*neg[i-1])
l.sort(reverse = True)
for i in range(k//2):
ans*=l[i]
ans%=mod
print(ans%mod)
| 0 | null | 6,974,398,288,512 | 87 | 112 |
def buble_sort(seq):
l = len(seq)
cnt = 0
for i in range(l):
for j in range(i+1, l)[::-1]:
if seq[j] < seq[j-1]:
seq[j], seq[j-1] = seq[j-1], seq[j]
cnt += 1
return seq, cnt
n = int(input())
a = list(map(int, input().split()))
sorted_a, num_swap = buble_sort(a)
print(' '.join(map(str, sorted_a)))
print(num_swap)
|
n = int(input())
print(n * n * n)
| 0 | null | 151,330,214,100 | 14 | 35 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.