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
|
|---|---|---|---|---|---|---|
N = int(input())
for i in range(10):
ans = (i+1)*1000-N
if ans >= 0:
print(ans)
exit()
|
import sys
input = sys.stdin.readline
ins = lambda: input().rstrip()
ini = lambda: int(input().rstrip())
inm = lambda: map(int, input().split())
inl = lambda: list(map(int, input().split()))
n = ini()
ans = n % 1000
print(0 if ans == 0 else 1000 - ans)
| 1 | 8,544,852,507,430 | null | 108 | 108 |
#!/usr/bin/python3
import sys
from collections import Counter
input = lambda: sys.stdin.readline().strip()
n = int(input())
a = [int(x) for x in input().split()]
c = Counter(a)
def c2(n):
return n * (n - 1) // 2
ans = sum(c2(v) for v in c.values())
for x in a:
print(ans - (c[x] - 1))
|
n=int(input())
j,k=map(int,input().split())
f=1
if k-j>=n:
print('OK')
f=0
else:
for i in range(j,k+1):
if i%n==0:
print('OK')
f=0
break
if f==1:
print("NG")
| 0 | null | 37,232,767,761,152 | 192 | 158 |
n, k = map(int, input().split())
W = []
for _ in range(n):
w = int(input())
W.append(w)
Baggages = W[:]
def _check(tmp_P):
num_track = 1
tmp_sum = 0
for b in Baggages:
if tmp_sum+b <= tmp_P:
tmp_sum += b
else:
num_track += 1
tmp_sum = b
if num_track > k:
return False
return True
def check(P):
i = 0
for _ in range(k):
s = 0
while s+Baggages[i] <= P:
s += Baggages[i]
i += 1
if i >= n:
return True
if i == n:
return True
else:
return False
def binary_search(max_r):
left = 0
right = max_r
while right-left > 1:
mid = (left+right)//2
if check(mid) == True:
right = mid
else:
left = mid
return right
max_p = sum(Baggages)+1
ans = binary_search(max_p)
print(ans)
#print(check(4))
#print(check(5))
#print(check(6))
#print(check(7))
|
import time
n, k = map(int, input().split())
w = [0] * n
for i in range(n):
w[i] = int(input())
def check(p):
remain_track = k - 1
remain_p = p
for a in range(n):
if w[a] > p:
return False
if remain_p >= w[a]:
remain_p -= w[a]
else:
if remain_track == 0:
return False
else:
remain_track -= 1
remain_p = p - w[a]
# print(a, w[a], remain_p, remain_track)
return True
next = 10 ** 9
prev = next
for i in range(200):
if check(next):
prev = next
next = next // 2
else:
next = (next + prev) // 2
print(prev)
| 1 | 87,541,544,672 | null | 24 | 24 |
n, m = map(int, input().split())
edge = [[] for _ in range(n)]
for _ in range(m):
a, b = map(int, input().split())
a -= 1
b -= 1
edge[a].append(b)
edge[b].append(a)
done = [False] * n
s = []
cnt = 0
for i in range(n):
if not done[i]:
s.append(i)
while not s == []:
v = s.pop()
done[v] = True
for nxt in edge[v]:
if not done[nxt]:
s.append(nxt)
cnt += 1
print(cnt - 1)
|
# -*- coding: utf-8 -*-
def get_input() -> tuple:
"""
標準入力を取得する.
Returns:\n
tuple: 標準入力
"""
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
return N, K, A
def main(N: int, K: int, A: list) -> None:
"""
メイン処理.
Args:\n
N (int): 学期数（2 <= N <= 200000）
K (int): 直近何回分までの点数を考慮するか（1 <= K <= N - 1）
A (list): i学期の期末テストの点数
"""
# 求解処理
for i in range(K, N):
if A[i] > A[i - K]:
print("Yes")
else:
print("No")
if __name__ == "__main__":
# 標準入力を取得
N, K, A = get_input()
# メイン処理
main(N, K, A)
| 0 | null | 4,653,996,806,550 | 70 | 102 |
n,a,b = map(int,input().split())
p = 10**9 + 7
def CC(n,k):
X,Y = 1,1
for i in range(n-k+1,n+1):
X = X*i%p
for j in range(1,k+1):
Y = Y*j%p
YY = pow(Y,p-2,p)
return(X*YY%p)
A = CC(n,a)
B = CC(n,b)
ALL = pow(2,n,p)
ans = (ALL-1-A-B)%p
print(ans)
|
import sys
stdin = sys.stdin
def main():
N = int(stdin.readline().rstrip())
A = list(map(int,stdin.readline().split()))
mod = 10**9+7
ans = 0
for i in range(61):
bits = 0
for x in A:
if (x>>i)&1:
bits += 1
ans += ((bits*(N-bits))* 2**i) %mod
ans %= mod
print(ans)
if __name__ == "__main__":
main()
| 0 | null | 94,657,572,806,758 | 214 | 263 |
from sys import stdin
input=stdin.readline
input()
a=list(map(int,input().split()))
ans=sum(a)
b=[0]*(10**5+1)
for i in a:
b[i]+=1
c=int(input())
for i in range(c):
n,m=map(int,input().split())
if b[n]>0:
x=b[n]
if x>0:
b[m]+=x
b[n]=0
ans+=(m-n)*x
print(ans)
|
N=int(input())
A=list(map(int,input().split()))
Q=int(input())
S=[list(map(int,input().split())) for i in range(Q)]
l=[0]*10**6
total=0
for i in range(N) :
l[A[i]]+=1 #各数字の個数
total+=A[i] #初期総和
for i in range(Q) :
s0=S[i][0] #Bの値、交換した値
s1=S[i][1] #Cの値、交換する値
total+=s1*l[s0]-s0*l[s0]
l[s1]+=l[s0]
l[s0]=0
print(total)
| 1 | 12,147,044,367,620 | null | 122 | 122 |
from typing import List
class Info:
def __init__(self, arg_start, arg_end, arg_area):
self.start = arg_start
self.end = arg_end
self.area = arg_area
if __name__ == "__main__":
LOC: List[int] = []
POOL: List[Info] = []
all_symbols = input()
loc = 0
total_area = 0
for symbol in all_symbols:
if symbol == '\\':
LOC.append(loc)
elif symbol == '/':
if len(LOC) == 0:
continue
tmp_start = int(LOC.pop())
tmp_end = loc
tmp_area = tmp_end - tmp_start
total_area += tmp_area
while len(POOL) > 0:
# \ / : (tmp_start, tmp_end)
# \/ : (POOL[-1].start, POOL[-1].end)
if tmp_start < POOL[-1].start and POOL[-1].end < tmp_end:
tmp_area += POOL[-1].area
POOL.pop()
else:
break
POOL.append(Info(tmp_start, tmp_end, tmp_area))
else:
pass
loc += 1
print(f"{total_area}")
print(f"{len(POOL)}", end="")
while len(POOL) > 0:
print(f" {POOL[0].area}", end="")
POOL.pop(0)
print()
|
cross_section = input()
stack = []
areas_stack = []
area = 0
for i in range(len(cross_section)):
c = cross_section[i]
if c == '\\':
stack.append(i)
elif c == '/' and len(stack) != 0:
j = stack.pop()
a = i - j
area += a
while len(areas_stack) != 0 and areas_stack[-1][0] > j:
a += areas_stack.pop()[1]
areas_stack.append([j, a])
print(area)
if area == 0:
print(0)
else:
print(len(areas_stack), ' '.join([str(x[1]) for x in areas_stack]))
| 1 | 58,442,901,440 | null | 21 | 21 |
def main():
import numpy as np
n=int(input())
a=list(enumerate(map(int,input().split())))
a.sort(key=lambda x: -x[1])
dp=[np.zeros(i+1,dtype=np.int64) for i in range(n+1)]
dp[0]=np.zeros(1,dtype=np.int64)
r=np.arange(n+1,dtype=np.int64)
for time,ix in enumerate(a):
i,x=ix
dp[time+1][1:]=dp[time][:time+1]+(i-r[:time+1])*x
np.maximum(dp[time+1][:-1],dp[time]+((n-1-(time-r[:time+1]))-i)*x,out=dp[time+1][:-1])
print(np.max(dp[n]))
main()
|
N = int(input())
A = list(map(int,input().split()))
B = [i for i in range(1,N+1)]
C = zip(A, B)
C = sorted(C, reverse = True)
A, B = zip(*C)
dp = [[0 for i in range(N+1)] for j in range(N+1)]
for i in range(N):
for j in range(i + 2):
if j == 0:
dp[0][i-j+1] = dp[0][i-j] + A[i] * (N - (i - j) - B[i])
elif j == i+1:
dp[j][0] = dp[j-1][0] + A[i] * (B[i] - j)
else:
dp[j][i-j+1] = max(dp[j][i-j] + A[i] * (N - (i - j) - B[i]), dp[j-1][i-j+1] + A[i] * (B[i] - j))
ans = 0
for i in range(N+1):
ans = max(ans, dp[i][N-i])
print(ans)
| 1 | 33,585,906,691,392 | null | 171 | 171 |
n = int(input())
if(n % 2 !=0):
print(0)
exit()
ketasu = len(str(n))
ans = 0
for i in range(1, 100):
ans += n // (2 * 5 **i)
print(ans)
|
i = 1
while True:
a = int(input())
if (a == 0):
break
else:
print("Case " + str(i) + ": " + str(a))
i += 1
| 0 | null | 58,098,895,403,990 | 258 | 42 |
from collections import deque
h,w=map(int,input().split())
l=list()
l.append('#'*(w+2))#壁
for i in range(h):
l.append('#'+input()+'#')
l.append('#'*(w+2))#壁
p=0
for i in range(1,h+1):
for j in range(1,w+1):
if l[i][j]=='#':
continue
s=[[-1 for a in b] for b in l]
q=deque([[i,j]])
s[i][j]=0
while len(q)>0:
a,b=q.popleft()
for x,y in [[1,0],[0,1],[-1,0],[0,-1]]:
if l[a+x][b+y]=='#' or s[a+x][b+y]>-1:
continue
q.append([a+x,b+y])
s[a+x][b+y]=s[a][b]+1
r=0
for x in s:
for y in x:
r=max(y,r)
p=max(r,p)
print(p)
|
from collections import deque
def bfs(sy,sx):
q=deque([[sy,sx]])
visited[sy][sx]=0
while q:
y,x=q.popleft()
for dy,dx in ([1,0],[-1,0],[0,1],[0,-1]):
ny,nx=y+dy,x+dx
if ny<0 or ny>h-1 or nx<0 or nx>w-1 or path[ny][nx]=="#":continue
if path[ny][nx]=="." and visited[ny][nx]==-1:
visited[ny][nx]=visited[y][x]+1
q.append([ny,nx])
res=-1
for i in range(h):
for j in range(w):
res=max(visited[i][j],res)
return res
h,w=map(int,input().split())
path=[input() for i in range(h)]
visited=[[-1]*w for i in range(h)]
sy,sx=0,0
gy,gx=0,0
ans=0
for i in range(h):
for j in range(w):
if path[i][j]=="#":continue
sy=i
sx=j
visited=[[-1]*w for _ in range(h)]
t=bfs(sy,sx)
ans=max(t,ans)
print(ans)
| 1 | 94,824,758,577,150 | null | 241 | 241 |
import sys
line = sys.stdin.readline()
tate, yoko = line.split(" ")
tate = int(tate)
yoko = int(yoko)
S = tate * yoko
T = 2 * (tate + yoko)
print '%d %d' % (S, T)
|
K, N = map(int, input().split())
A = list(map(int, input().split()))
ans = K
for i in range(N):
start = A[i]
end = K+A[i-1] if A[i-1] < A[i] else A[i-1]
path = end-start
ans = min(path, ans)
print(ans)
| 0 | null | 21,873,190,605,504 | 36 | 186 |
x, n = map(int, input().split())
p = [int(s) for s in input().split()]
min_val = 101
for i in range(102):
if i not in p:
if abs(i - x) < min_val:
min_val = abs(i - x)
ans = i
print(ans)
|
n = int(input())
a = list(map(int, input().split()))
mod = 10**9+7
cur = 0
res = 0
for i in range(n-1):
cur = (cur + a[n-1-i]) % mod
tmp = (a[n-2-i] * cur) % mod
res = (res + tmp) % mod
print(res)
| 0 | null | 8,940,452,067,598 | 128 | 83 |
import sys
sys.setrecursionlimit(10**8)
def line_to_int(): return int(sys.stdin.readline())
def line_to_each_int(): return map(int, sys.stdin.readline().split())
def line_to_list(): return list(map(int, sys.stdin.readline().split()))
def line_to_list_in_iteration(N): return [list(map(int, sys.stdin.readline().split())) for i in range(N)]
# def dp(init, i, j): return [[init]*i for i2 in range(j)]
#from collections import defaultdict #d = defaultdict(int) d[key] += value
#from collections import Counter # a = Counter(A).most_common()
# from itertools import accumulate #A = [0]+list(accumulate(A))
# import bisect #bisect.bisect_left(B, a), bisect.bisect_right(B,a)
a, b = line_to_each_int()
print(a*b)
|
n,a,b = map(int, input().split())
g = n//(a+b)
k = n-(a+b)*g
if k >= a:
print(a+a*g)
else:
print(a*g + k)
| 0 | null | 35,815,302,182,880 | 133 | 202 |
n = map(int, raw_input().split())
n.sort()
print n[0],
print n[1],
print n[2]
|
nums = map(int, raw_input().split())
for i in range(2):
for j in range(2-i):
if nums[j] > nums[j+1]:
temp = nums[j]
nums[j] = nums[j+1]
nums[j+1] = temp
print(str(nums[0]) + " " + str(nums[1]) + " " + str(nums[2]))
| 1 | 414,973,399,360 | null | 40 | 40 |
time = int(input())
hour=int(time/3600)
minutes=int((time-hour*3600)/60)
seconds=int(time-(hour*3600)-(minutes*60))
print(str(hour)+':'+str(minutes)+':'+str(seconds))
|
t = int(input(''))
s = t % 60
h = t // (60 * 60)
m = (t % 3600) // 60
print(str(h) + ":" + str(m) + ":" + str(s))
| 1 | 330,854,821,918 | null | 37 | 37 |
from collections import deque
N,M=map(int,input().split())
C=[[] for i in range(N+1)]
for i in range(M):
A,B=sorted(list(map(int,input().split())))
C[A].append(B)
C[B].append(A)
d=[-1]*(N+1)
d[0]=0
d[1]=0
queue=deque([1])
while queue:
now = queue.popleft()
for i in C[now]:
if d[i]!=-1:continue
d[i]=now
queue.append(i)
if d.count(0)>2:print('No');exit
print('Yes')
for i in range(2,N+1):
print(d[i])
|
from collections import deque
n,m = map(int, input().split())
graph = [[] for _ in range(n+1)]
dist = [0] * (n+1)
visited = [0] * (n+1)
for _ in range(m):
a,b = map(int, input().split())
graph[a].append(b)
graph[b].append(a)
root = 1
visited[root] = 1
d = deque([root])
while d:
v = d.popleft()
for i in graph[v]:
if visited[i]:
continue
visited[i] = 1
dist[i] = v
d.append(i)
print('Yes')
ans = dist[2:]
print(*ans, sep="\n")
| 1 | 20,565,632,226,090 | null | 145 | 145 |
data = input().split()
print(int(data[0])*int(data[1]))
|
k = input().split()
n1 = int(k[0])
n2 = int(k[1])
ans = n1 * n2
print(ans)
| 1 | 15,836,614,782,520 | null | 133 | 133 |
def INT():
return int(input())
def MI():
return map(int, input().split())
def LI():
return list(map(int, input().split()))
S = input()
if S[len(S) - 1] == "s":
S += "es"
else:
S += "s"
print(S)
|
#
# 179A
#
s = input()
s1 = list(s)
if s1[len(s)-1]=='s':
print(s+'es')
else:
print(s+'s')
| 1 | 2,383,114,789,510 | null | 71 | 71 |
H, A = map(int, input().split())
ans = int(H/A)
if (H%A) != 0:
ans += 1
print(ans)
|
from collections import deque
n = int(input())
adj = [list(map(int, input().split(' '))) for i in range(n)]
class Node:
def __init__(self, id, ck):
self.id = id
self.ck = ck
self.depth = -1
def __str__(self):
return '{} {}'.format(self.id, self.depth)
class Graph:
def __init__(self):
self.map = {}
def get(self, id):
return self.map[id]
def set(self, id, ck):
self.map[id] = Node(id, ck)
def bfs(self):
root = self.get(1)
root.depth = 0
queue = deque()
queue.append(root)
while(len(queue) > 0):
node = queue.popleft()
for id in node.ck:
target = self.get(id)
if target.depth != -1: continue
target.depth = node.depth + 1
queue.append(target)
def __str__(self):
return '\n'.join(map(str, [self.get(i + 1) for i in range(len(self.map))]))
graph = Graph()
for data in adj:
id = data[0]
ck = data[2:]
graph.set(id, ck)
graph.bfs()
print(graph)
| 0 | null | 38,684,795,657,430 | 225 | 9 |
s, t = input().split()
a, b = map(int, input().split())
u = input()
bnum = {s: a, t: b}
bnum[u] -= 1
print('{} {}'.format(bnum[s], bnum[t]))
|
W = input()
cnt = 0
while True:
t = input()
if t == 'END_OF_TEXT':
break
else:
cnt += t.lower().split().count(W)
print(cnt)
| 0 | null | 36,963,956,290,880 | 220 | 65 |
n , k = map(int, input().split())
a = list(map(int,input().split()))
a.sort()
MOD = 1000000007
factorial = [1]
inverse = [1]
for i in range(1, n+2):
factorial.append(factorial[-1] * i % MOD)
inverse.append(pow(factorial[-1], MOD - 2, MOD))
def combi(n, r):
if n < r or r < 0:
return 0
elif r == 0:
return 1
return factorial[n] * inverse[r] * inverse[n - r] % MOD
max_sum=0
min_sum=0
for i in range(k-1,n):
t = combi(i,k-1)
max_sum+=a[i]*t
max_sum%=MOD
min_sum+=a[n-i-1]*t
min_sum%=MOD
if max_sum-min_sum<0:
max_sum+=MOD
print(max_sum-min_sum)
|
# This code is generated by [Atcoder_base64](https://github.com/kyomukyomupurin/AtCoder_base64)
import base64
import subprocess
import zlib
exe_bin = "c%1E9e{dUhcK_;!V<mPZIXH<41dAZJm?XkV>|iJLVcAl$;^f2^JCIVsMwaAQM3!7>6&xl&I3?lsj3C@FG@YYu+H0?2rc=1~u4OtmhfTN`ZrU3|OPdys3s;~Lg-HT5I3bDp-gm!WX?LwX?r!=|XY%#fZ{KI%d;7lc`@Y}Z{qFN4fzT$i$wYXwkgpQtjxAL9ZidgSDT@HsLFU8X8_04p4|uCePETh|T52m_N73srE4-dwPqfseqBX?04K!*gA+E9>`r5i&L0gx*G_=63J7(|F=$V<G!1M$r	B?amxE=Wxs<A*Hb^yQY)kV?@LiUey>5{^>mPEDcAct=*=U)eseOqja|<uE;GzuPWd?8mWU6nZ@VoKU6Y6>v*T;VJJzpR-{#4rJZq^>PA0o~%XTV{<84;?+{iFIf2w)cBJuLk3*Ts~`|Q#Ezv%kP+lBkhOoopeM%V<Jd{`Tg*7s(fspTf;w10x%MOE-|Fu0-$e!qeIb_4wPP1W(J0e;fJj@3YZzyM!hfInt{pE0=ZE(5%o@XXh?4F>j~G{Bt(b~YN|e{JB;3b5Zmt|i?rMa#(&@Gpph@48XJn|NYEUS_0dWYsFn#q~rKcaNr$Vnzz5B~c_|aIjB|#?rCf@r)Ep5BBvYQpwn0cqkE5&Q(8i&z6CBIuqCyr-!LTCV)o+Qd=w;O#~wYlGhs<38zIV9ga(xU?dRO2H3ixa3&rRQyD283y%f|#lcoFFtA>vs_P>0B()}W#8Vj&L}P8iWL)xl1A76FCi?g4PJ7!k`;rmyfw(jR{fWj?fg$YP__#P0OJ`Eaa3U`46Zf`)TJnL>YPNe7+u(O3m6b45yCV@XgOTzQaeMNCcrq$(i)FH-F+3UJA%y5f_K1;@J>qaUo&X>+9u~t=Y&<TJ(b#BYY#+mh<LJeMF+@jGdm(Zn+F{`z4MUeV_x6hGJgsDNDA?00uJyE)kGz$`wVrm;yJLs1Cn$P7>lAp$4$y1EAvVLxVTK<oqcs$nN7t8Hx~dS0BX5GA)uu{5_TRFv4yFE-<%<dAgY0}a{5Hnp3-J!~9K)V|>X~`CV*M@Sv&-W1apn4PS>H_8D88Ql^YeRZaK-v5lb2e)Z9{L~Wb%An<@bqWc7=B6@Ll}=tH+tV&85XTKhvzxd8D%5Vmqb6?JE4V3U{jTf(ma?;b&F2dcMx8@M~1Kllg_+uUFxGKI6T-QHAsQjQC;|KE~|VlFB^@+qeq1sPF?S+^WLAslwII5l2+G`aXJ8h1aU^V=COH!jG%)`6~Pc6}~`)zo^3NRQRL{U#P-gRpAa5F62J42@^Gom$-;<Xi_qlW`x`;wiBe({@`L4Dc!su{yLhw;RyK=R4JY=LAyDPJchJ5L;3rW$J8lKQho?|3~liR%HM-LhO~H$^4pNdP!^9+{!ZjEgvA4t??E2jEsjxs1M(QM;x5XsMIJ*{?5F&#$YY3#-IQN}Jcg#&O8I5L4<F(E_TBBf%Ukko_YH0zfEaW{g$e7;D={Fl-@Vd1S*QaYAuqYzLcS}7(V4CZEmdMzaKO0<zuTRgH94MeL!U$W_C0WN+V7_K6QK0@)6q=i6RYlZH|4%CIS!tKQ^K^>jc2^C1-vDUs}MO6@V@7pSbccd(F_lD@+n{L71JMne%UAgL^$f(xcaalpOA{e#(KBo;Gck|+~SwRRv|ZK^W`p^vM+@?FGx29^P3T}4tpHU2dR$}9YSu>mcQHNc>X_x&R4T%O!vC4?>khIY$3T+c=!tI06ILe-`&(X>v;0(*el6>J#_fKMi(hO2SS28U1$L6ofP2I%BZlejYi3FXdCt>_e#g_?eyL2+v&T{C!V1FnXtM;Ewh6BG6vEqOkK1Hhu&};{3{G?-nvNWq$g~S!^aVUNZDpF(%^)x@cCst8U(e8Hn(7UIn;SYzSS=eSrz?Y{%)Jl@~?vYi7@q{Mab8`iRs{d1FsvLXj>}CZB8NgvQ6lGJ$ptlO<|C*%gdn4iZ^n-yYLNq5#%Q7-PkKzP@Wb{Cqdg?JPv)O<3K&5*%n6kUMeZAS%64A7AVn(<iKa*ICv)tO#RX-$b)WMacv1LKpIUI_roDX_<B?EX)w!^qIeV-a0|zk4#v4l80TLUg5X%edby<JMZU{>!%jLq3xs;y_2?qV!u;ZIQPO@5oGpA0Rr6hEV7PGF7B@jIDtYAnI4Hk<pCJEI$h~*Ae=wA<S!Tr%SomEFlCDdjSz5dVY<;HmH{az0X1kED>BI|k!VtbMT?<RYhYiZouyAMTbS1xb($TK)pl?zfyV!tcTCRY;Fm=Tu$Y+JA!W|gk*RM!TVDS6QU_BZ%vUi}X0Xjvpw+Xo}5fs2A_)`yI_!e-5HQ;_hfG(V@DPH3uCR9IwdY_(9`j6r}i^CwH@HpRt@_C%_LHRS7^YUegEx5B4mcM2}el^(gj?i*Sn3^?%Z;pdMpnYm1!Rcv?l+bzBari~RXeu?j3!yJ?OkjW}`fPpjX<?$#9h83(G))IvPED9Yo&VV@``d}+3gJX}CnTQ{<d7SN+v+a(s48+WSAz1-w&wjc*1nbxLY?nQ4Iz0tB!3c;KPdde#ZoCKPxe9J4!tGWFhiyR3dy73L>5dv1j+tNlWzXe=ZjGOcYa7yZA-cT!iy|}?+`jqIv#7sJ{>xreX~zK3oB8;`*Cp-%9i5~>!OhVgQodi1VZ%%gsN4)LJIOM<oPtai%eQ!W@pcZ@=<rakWawuf_$eB26)iK59k8wJr76qc&qTeXr{{~%-_f)EDyN}CoUF$iPEqlID_&heweED!Iq1`sf*^op*J4x2g!-0p?rPLx3S@o9(l&+cz&`g(BmMFv<vyIR$uNz)0TYWQ~$l3_IsiM#jcZQaCxkVE)b3eJAW!S=Cbeja+4<Cqq7M6p=b4uC&p-SN>WYXt_#XqfeW9~`Rq;zdMgI~gc8?{lH28%iL}Ho&l7SdVHJ?vO~tR4*g6t|87QAAJVd83o^i9)4i=*m%0<r2viW}j=l=y|{ww+VZ<w#4{LMeEqf>LuNuUEh`7&g3sO5cn@1DABDcp`04t*@Syl?UG3&|Hl@_D~}##d^5TgaU-37tRBeu#^NDq)UP#{1I~>{)=`{n_*Bb(W3&M0p;$^m(cDEYN?1OT7a0ZJ?Kc?uTTaft>ph&;*``*%AW&5_I?|P+S8)0{RiqHgn~f&Gg_lVj6dvuB)%L9Wm895y$0G06VKx&nMO832`&|9pKjt3fP^S>`iw%>K?EiAa^X=c<Va%3a(H0O2A+B^HzC(=)wLFwOsq1u7xgg9k(AM$~8`5zrk<o9RT*&olly3>`hNt{B~E~+GAh&c#Y5AdU&4C-jS>I+s7=OrUmv6fPD6qJ$4s}f=Z9w7N`?2Ht;(R{ksL{XvJ2bY|CG^wb|Zpe%Zhj!Izmy_`Mfmy&r5@|6Z~8xY=iKI&2Z_uACJNSn9zU7eGF$xTy|jVL!<KIpo*|?EKg4&in03R4_&fIQLB$w-_<-PeA_!^smp}ov!8`eHZuv*m(i$sNW+>C6m+jBp^>)YD!k}?V1{j)&0y|^K&!##QdxF=B~D@?P|N)uC}Y~YP;J0KQ_K!%lBvbeysZYq?)caY55>K;CrF3vQ0w1$M-L6v-MiW^ZnxM7|-`;modushxv0be>VP~E2R|DqwL|0KbOt0%}~C_ImyoRJ;`^Oe|#^piBa`lEH=K^x`XXU@@GUB)926oe9v?#qsMJpe5_XMcL&qwd#C*RHxR8HJbu&unHY41@uykGN{r`zo@M;su=5ufuihK}zij;bu)dvV9h=7jzJ$?R7+ufkCPwdKbePe-j2>q68AiXS-c<fA8vlO4+veWh4X%~jhq6g2>$=_3?rB}KE=xJ@!`=>0Yg>zg{yMfTFiIU&zSQE^o58BMg-BI#YdN2_cuhHvwfMYpzH9N?avo@LTRDHU`22F7YVif-eAeQ1<$0~e>&fY=_(JkRmGQF>JDIGCJId>X7I%`<Rq=*${eTu<L^`T`bhVIcNNZy?ys^9<Y4OG7bx4aZsX7lVup01nLyN;~cU8kH-+#6EvN;$oA69a%q{s1Fi5cR_*X<1qzme)(OOCGES=PtaYG7w0voo_$i+3^HY1iWY{JJ`Pm|b^#g-dhYEIpnZ&u5vPV>&y>sr=k=G4g+!$}b|TtBh|o`8Vm`x%pF|cIJ-nIr_J8j{jzpg6sWUY(hJ8^I;YJe%eHubmP9jg5PoH=E+)GCs4_MKJ9%5^$BAJbs&#Z`O3U|maQvK8QA%Eyso)v&ieU*f&3M~Zv=V%U6d~$pIT6U?z~=Ru5M?I0lwLc{j!r6Sf1R%66?<l<n0!vzr5ay@7evGf&6O*_z<--cins6ti(q@j(9)E`i%oD|8a*J+c|UfdJmgL$p`(oUq%^_KgQ-SZ;LHT98R;3r2CnjuUHg$y+7+L)%&%B#b*~Aml(rG4CEg&!2j3)|DmONJ<RI{@<ry)4D*NI_AXee*TXoh)$Mq!)vw!SfZuIkhxCd*aa`;Xdp(h{F(PgbZSC=eL@|>c5`$tYL(5G<9ikXd#glP~MAA}5$_@{EBBWA=BTA!U1j}teT#Tl~-HFstI3Y%*R5~Muv*RR^8XZf-q*&B*`})p~>Oxq25*Neiba<Z_OG@c|WH=ojjfv6h=qT2ws5lW_(TIxTrft5yfEd`~$0{Ll^Oo&mKwzNY-$q3L?{4w+1$*I~MmeelXrW6v3R^dA8VC%EgT9_n0IbHMVJS?+;8t3`lN7U=SoF(le7d{U<uBSg8+MLW%+UIp-@YtKf1zk5C60u_lDYs&E9Af1la390s#YN>g+Ub$y=|JpA+75)3hVdAA~2f4_&_)q4+Oloi&&2pP9#zhh;b&CmV$R~gA;+hTRP#A$t;)~2PrX`N{>P+#37Z!XrMnn;1vS_|Jc?+k=0V^I)@cf`u=LGoGSj|xxv0(o*TS;YEHOdaQXP(v!y+i35$E$hqCcR6pOCJp-iT7wpwA9-X1NSie$1hy?8;DE^1Zc-rcP#oGMqV>5TuXDmYCU80fKjEtNw!(aJS!Ro$-Cd(ClpPBork#a)%cIPJxVC$n!<3J(F5(h42nNAV<>93!4&N{V?P9BZWTZpK04c<8vSiAM?LM#7m9;)(7{f<1*wY30mbh;2NT)G#8POUDvn6l6zZ2?;L=<AjHv-6=SLEQh}|R-SZ<PJK^oge^lO(R76a>yd~U8;``sBvGRM_f*yt#RflyYlcVT5jda*A*+Z7R>x6T#;UE(zj4ET2E29f`-)LrHg6^!e-lyO?YX|b?%Ac2*T0^5b^820kW=@U=;QaV^YCuZ_4)fErz;uG_e1orZ(E46_rdk~dnKp5&KqA7O)7o9PjMH~);ja|Pfp*}1xz2m`-rl4!S(rjDyOS;{+o4l4^j3)IM3f_Ipu{@^O&Fd{y#{Rm~wso-peW9pV7yU_x~W%?_oTDKjze>(qCFd{|Tb5`L67bamx3Rc+-!+tkdW3+nmnm<efVDv`(MDmvgF*mrY0iNT<)=BRE~8+edI}S@K<-K7SwJRKI<o@Bed5pFgYd_aXgzkzSwE?-T9(H~RkrqwBw<)93pOoX+YJULVibbozWBg43IH^7{Gn7E$V3`MzJ}{}~isA8-Bm{TEU83b;OhkL_Mw-Cw=_r=&8suvPwFgk4{?eyH`hUq@M=^!uwjnic-|mt6mnPQU!V#0Z~fdVSu^Y(ur&f2QBW^mo;DY2>?g`n4wI`udGQuHT}=tL>Xt`=<_p>CdwHgZCj1nY(_>SNX2-lP&!FbqTA_p9TZ{AF+kk`6cW3{{kH-Ur7"
open("./kyomu", 'wb').write(zlib.decompress(base64.b85decode(exe_bin)))
subprocess.run(["chmod +x ./kyomu"], shell=True)
subprocess.run(["./kyomu"], shell=True)
| 0 | null | 49,128,190,057,702 | 242 | 73 |
a,b,n=map(int,input().split())
score=0
if (n<b):
print( int(a*n/b))
elif(b==1):
print(0)
else:
c = int(n/b)
score = 0
for i in range(1,c+1):
n_ = b*i-1
t = int(a*n_/b)-a*int(n_/b)
score = max(score,t)
t = int(a*n/b)-a*int(n/b)
score = max(score,t)
print(score)
|
N = int(input())
A = list(map(int,input().split()))
check = True
for a in A:
if a % 2 == 0:
if a % 3 != 0 and a % 5 != 0:
check = False
if check:
print("APPROVED")
else:
print("DENIED")
| 0 | null | 48,466,211,852,916 | 161 | 217 |
w = input()
t = []
while True:
temp = input()
if temp == 'END_OF_TEXT':
break
else:
t += [s.strip(',.') for s in temp.lower().split(' ')]
print(t.count(w))
|
a=int(input())
b=100
i=0
while b<a:
b+= b // 100
i+=1
print(i)
| 0 | null | 14,413,172,341,408 | 65 | 159 |
import math
A, B, H, M = map(int,input().split())
#時針:0.5°/min
#分針:6.0°/min
print(math.sqrt(A ** 2 + B ** 2 - 2 * A * B * math.cos(5.5 * (H * 60 + M) * math.pi / 180 )))
|
import math
a, b, h, m = map(int, input().split())
rad1 = (2 * math.pi) * ((h * 60 + m) / 720)
rad2 = (2 * math.pi) * (m / 60)
x = abs(rad2 - rad1)
ans = math.sqrt(a * a + b * b - 2 * a * b * math.cos(x))
print(ans)
| 1 | 20,121,826,671,912 | null | 144 | 144 |
a, b, m = map(int, input().split())
a_s = list(map(int, input().split()))
b_s = list(map(int, input().split()))
m_s =[]
for _ in range(m):
m_s.append(list(map(int, input().split())))
mini = min(a_s) + min(b_s)
for am, bm, sale in m_s:
mini = min(mini, a_s[am-1]+b_s[bm-1]-sale)
print(mini)
|
A, B, M = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
ans = 999999
for i in range(M):
x, y, c = map(int, input().split())
if x <= A and y <= B:
d = a[x - 1] + b[y - 1] - c
if d < ans:
ans = d
if (min(a) + min(b)) < ans:
ans = min(a) + min(b)
print(ans)
| 1 | 54,041,169,195,570 | null | 200 | 200 |
import math
N = int(input())
if N % 2 == 1:
print(0)
else:
i = 10
ans = 0
while(True):
a = math.floor(N // i)
if a < 1:
break
ans += a
i *= 5
print(ans)
|
R=int(input())
N=R*2*3.141592
print(N)
| 0 | null | 73,392,713,889,200 | 258 | 167 |
W = input().lower()
ans = 0
while 1:
T = input()
if T == "END_OF_TEXT":
break
ans += T.lower().split().count(W)
print(ans)
|
N = int(input())
if N % 2 == 0:
print("0.5")
else:
a = N // 2 + 1
print(a/N)
| 0 | null | 89,356,959,351,010 | 65 | 297 |
a, b = map(int, input().split())
S = a*b
L = 2*(a+b)
print(S,L)
|
a, b = map(int, input().split())
print("%d %d" % (a * b, 2 * (a + b)))
| 1 | 304,703,614,680 | null | 36 | 36 |
NUM = list(map(int,input().split()))
if(NUM[0] > NUM[1]):
print("safe")
elif(NUM[0] <= NUM[1]):
print("unsafe")
|
s,w=input().split()
s=int(s)
w=int(w)
if s>w:
print("safe")
if w>s:
print("unsafe")
if w==s:
print("unsafe")
| 1 | 29,252,726,193,742 | null | 163 | 163 |
N, K = list(map(int, input().split(' ')))
table = {l for l in range(1, N + 1)}
have = set()
for i in range(K):
d = int(input())
nums = list(map(int, input().split(' ')))
have = have | set(nums)
ans = len(table - have)
print(ans)
|
N = int(input())
A = list(map(int, input().split()))
total = 0
for a in A:
total ^= a
result = []
for a in A:
result.append(total ^ a)
print(*result)
| 0 | null | 18,592,983,893,942 | 154 | 123 |
def resolve():
H, W, K = map(int, input().split())
C = [input() for _ in range(H)]
cnt = 0
for h in range(1 << H):
for w in range(1 << W):
black = 0
for i in range(H):
for j in range(W):
if h >> i & 1 or w >> j & 1:
continue
if C[i][j] == "#":
black += 1
if black == K:
cnt += 1
print(cnt)
resolve()
|
from itertools import groupby, accumulate, product, permutations, combinations
H, W, K = map(int, input().split())
S = [input() for _ in range(H)]
ans = 0
for p in product([0,1],repeat=H+W):
cnt = 0
for i in range(H):
for j in range(W):
if S[i][j]=='#' and p[i]==0 and p[H+j]==0:
cnt += 1
if cnt == K:
ans += 1
print(ans)
| 1 | 8,907,771,411,172 | null | 110 | 110 |
X,Y,A,B,C = map(int,input().split())
AList = sorted(list(map(int,input().split())),reverse=True)
BList = sorted(list(map(int,input().split())),reverse=True)
CList = sorted(list(map(int,input().split())),reverse=True)
FullList = sorted(AList[:X] + BList[:Y])
counter = 0
for i in range(min(C,X+Y)):
if CList[i] <= FullList[i]:
break
else:
counter += 1
ans = sum(CList[:counter])+sum(FullList[counter:])
print(ans)
|
''' 1.降序排列，选出x个红苹果，y个绿苹果
2.使用c个无色苹果去更新这x+y个苹果中的小值，直到最小也比无色苹果的大为止'''
nums = [int(i) for i in input().split()]
x = nums[0]
y = nums[1]
a = nums[2]
b = nums[3]
c = nums[4]
redApples = [int(i) for i in input().split()]
greenApples = [int(i) for i in input().split()]
colorless = [int(i) for i in input().split()]
redApples.sort(reverse=True)
greenApples.sort(reverse=True)
colorless.sort(reverse=True)
redApples = redApples[:x]
greenApples = greenApples[:y]
res = redApples+greenApples
res.sort(reverse=True)
currIndex = len(res)-1
for i in range(len(colorless)):
if colorless[i] <= res[currIndex]:
break
res[currIndex] = colorless[i]
currIndex -= 1
if currIndex < 0:
break
print(sum(res))
| 1 | 44,710,948,124,588 | null | 188 | 188 |
S = str(input())
l = len(S)
if l % 2 == 0:
A = S[:(l//2)]
B = S[(l//2):]
else:
A = S[:(l//2)]
B = S[(l//2+1):]
B = B[::-1]
ans = 0
for i in range(l//2):
if A[i] != B[i]:
ans += 1
print(ans)
|
S = list(input())
front_S = S[:(len(S)//2)]
S.reverse()
back_S=S[:(len(S)//2)]
count = 0
for i,j in zip(front_S,back_S):
if(i!=j):
count+=1
print(count)
| 1 | 120,339,251,072,368 | null | 261 | 261 |
N = int(input())
A_list = list(map(int, input().split()))
zandaka = 1000
kabu = 0
mode = 0
for i in range(N):
if i == 0:
if A_list[i + 1] > A_list[i]:
kabu = 1000 // A_list[i]
zandaka -= kabu * A_list[i]
mode = 1
else:
continue
elif i == N - 1:
zandaka += kabu * A_list[i]
else:
if mode == 1:
if A_list[i] >= A_list[i - 1]:
if A_list[i] > A_list[i + 1]:
zandaka += kabu * A_list[i]
kabu = 0
mode = 0
else:
continue
else:
if A_list[i] < A_list[i + 1]:
kabu = zandaka // A_list[i]
zandaka -= kabu * A_list[i]
mode = 1
else:
continue
if zandaka >= 1000:
print(zandaka)
else:
print(1000)
|
def solve():
n = int(input())
a = list(map(int, input().split()))
res = 1000
for i in range(n-1):
if a[i] < a[i+1]:
res = res % a[i] + (res//a[i])*a[i+1]
print(res)
if __name__ == '__main__':
solve()
| 1 | 7,322,389,604,100 | null | 103 | 103 |
import bisect
n = int(input())
l_li = list(map(int,input().split()))
l_li.sort()
ans = 0
for i in range(n-2):
for j in range(i+1,n-1):
ind = bisect.bisect_left(l_li,l_li[i]+l_li[j])
num = ind-1 - j
ans += num
print(ans)
|
#from collections import deque,defaultdict
printn = lambda x: print(x,end='')
inn = lambda : int(input())
inl = lambda: list(map(int, input().split()))
inm = lambda: map(int, input().split())
ins = lambda : input().strip()
DBG = True # and False
BIG = 10**18
R = 10**9 + 7
#R = 998244353
def ddprint(x):
if DBG:
print(x)
a,b,c = inm()
k = inn()
x = 0
while b<=a:
b *= 2
x += 1
while c<=b:
c *= 2
x += 1
print('Yes' if x<=k else 'No')
| 0 | null | 89,067,736,942,288 | 294 | 101 |
s = input()
if s[0] != s[1] or s[1] != s[2]:
print("Yes")
else:
print("No")
|
s = input()
prev = s[0]
for i in range(1, 3):
if s[i] != prev:
print('Yes')
break
else:
print('No')
| 1 | 54,920,618,139,000 | null | 201 | 201 |
s=input()
x=list(map(int,s.split()))
x.sort()
print("%d %d %d"%tuple(x))
|
n = int(input())
k = int((n/1000)+1)*1000
print(0 if n%1000 == 0 else (k-n))
| 0 | null | 4,466,706,671,178 | 40 | 108 |
S = input()[::-1]
## 余りを0~2018で総数保持
counts = [0]*2019
## 0桁の余りは0
counts[0] = 1
num, d = 0, 1
for c in S:
## 右から~桁の数字
num += int(c) * d
num %= 2019
## 次の桁
d *= 10
d %= 2019
counts[num] += 1
ans = 0
for cnt in counts:
## nC2の計算
ans += cnt * (cnt-1) //2
print(ans)
|
S=list(input())
P=0
M=2019
D=[0]*M
D[0]=1
X,Y=0,1
for i in range(len(S)):
X+=Y*int(S[-i-1])
X%=M
P+=D[X]
D[X]+=1
Y=Y*10%M
print(P)
| 1 | 30,853,024,810,540 | null | 166 | 166 |
input()
l = [int(i) for i in input().split()]
input()
c = 0
for i in input().split():
for j in l:
if int(i) == j:
c += 1
break
print(c)
|
import sys
A,B,C,D = map(int,input().split())
while True:
C -= B
if C <= 0:
print("Yes")
sys.exit()
A -= D
if A <= 0:
print("No")
sys.exit()
| 0 | null | 14,863,495,039,778 | 22 | 164 |
import math
H,W,N = [int(input()) for i in range(3)]
print(min(math.ceil(N/H),math.ceil(N/W)))
|
H, W, M = map(int, input().split())
row = [0] * (H + 1)
col = [0] * (W + 1)
bom = []
for i in range(M):
h, w = map(int, input().split())
bom.append([h, w])
row[h] += 1
col[w] += 1
rmax = max(row)
cmax = max(col)
cnt = row.count(rmax) * col.count(cmax)
for h, w in bom:
if rmax == row[h] and cmax == col[w]:
cnt -= 1
print(rmax + cmax - (cnt == 0))
| 0 | null | 46,858,369,040,260 | 236 | 89 |
import sys
sys.setrecursionlimit(10**7)
input = sys.stdin.readline
s = input().rstrip()
n = len(s)
t = s[0:(n-1)//2]
q = s[(n+2)//2:n]
if s == s[::-1] and t == t[::-1] and q == q[::-1]:
print("Yes")
else:
print("No")
|
S=input()
a=len(S)
print('x'*a)
| 0 | null | 59,724,954,285,110 | 190 | 221 |
import sys
i=1
while True:
x = int( sys.stdin.readline() )
if 0 != x:
print( "Case {}: {}".format( i, x) )
else:
break
i += 1
|
#E
H,N=map(int,input().split())
A=[0 for i in range(N)]
dp=[float("inf") for i in range(10**4+1)]
dp[0]=0
for i in range(N):
a,b=map(int,input().split())
A[i]=a
for j in range(10**4+1):
if j+a>10**4:
break
dp[j+a]=min(dp[j]+b,dp[j+a])
if H+max(A)>10**4:
print(min(dp[H:]))
else:
print(min(dp[H:H+max(A)]))
| 0 | null | 40,681,227,434,706 | 42 | 229 |
a, b = map(float, input().split())
print(round(a) * round(b*100) // 100)
|
A, B = map(float, input().split())
A = int(A)
B = int(B * 100 + 0.01)
print((A * B) // 100)
| 1 | 16,494,613,970,336 | null | 135 | 135 |
while(True):
h, w = map(int, input().split())
if w == 0 and h == 0:
break
print('#' * w)
for i in range(0, h - 2):
print('#' + '.' * (w - 2) + '#')
print('#' * w)
print()
|
data = list(map(int, list(input().split())))
row = data[0]
column = data[1]
matrix = [[0 for i in range(column)] for j in range(row)]
vector = [[0] for k in range(column)]
vector_multi = [[0] for l in range(row)]
for i in range(row):
data_row = list(map(int, list(input().split())))
for j in range(column):
matrix[i][j] = data_row[j]
for i in range(column):
vector[i] = int(input())
for i in range(row):
element = 0
for j in range(column):
element += matrix[i][j] * vector[j]
vector_multi[i][0] = element
for i in vector_multi:
print(i[0])
| 0 | null | 995,825,102,136 | 50 | 56 |
h,w=map(int,input().split())
ans=0
if h==1 or w==1:
ans=1
elif (h*w)%2==0:
ans=int(h*w//2)
else:
ans=(h*w//2+1)
print(ans)
|
h, w = map(int, input().split())
if h == 1 or w == 1:
print(1)
else:
print((-(-w//2)) * (-(-h//2)) + (w//2) * (h//2))
| 1 | 50,547,413,137,352 | null | 196 | 196 |
a, b = map(int, input().split())
print(str(a*b))
|
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import math
import bisect
import random
from itertools import permutations, accumulate, combinations, product
import sys
from pprint import pprint
from copy import deepcopy
import string
from bisect import bisect_left, bisect_right
from math import factorial, ceil, floor
from operator import mul
from functools import reduce
from pprint import pprint
sys.setrecursionlimit(2147483647)
INF = 10 ** 9
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def I(): return int(sys.stdin.buffer.readline())
def LS(): return sys.stdin.buffer.readline().rstrip().decode('utf-8').split()
def S(): return sys.stdin.buffer.readline().rstrip().decode('utf-8')
def IR(n): return [I() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
def LSR(n): return [LS() for i in range(n)]
def SRL(n): return [list(S()) for i in range(n)]
def MSRL(n): return [[int(j) for j in list(S())] for i in range(n)]
mod = 998244353
n = I()
A = LI()
S = sorted([(A[k], k + 1) for k in range(n)], reverse=True)
ans = 0
dp = [[0] * (n + 1) for _ in range(n + 1)]
for i in range(n):
for j in range(n):
if i and i <= S[i + j - 1][1]:
dp[i][j] = max(dp[i][j], dp[i - 1][j] + S[i + j - 1][0] * abs(i - S[i + j - 1][1]))
if j and S[i + j - 1][1] <= n - j + 1:
dp[i][j] = max(dp[i][j], dp[i][j - 1] + S[i + j - 1][0] * abs(n - j + 1 - S[i + j - 1][1]))
if i + j == n:
ans = max(ans, dp[i][j])
break
print(ans)
| 0 | null | 24,863,409,457,380 | 133 | 171 |
n = int(input())
k = 1000000007
if n == 1:
print(0)
else:
print(((10**n)%k - (2* 9**n)%k+(8**n)%k)%k)
|
N=int(input())
MOD=10**9+7
ans=10**N %MOD
ans=ans-2*9**N %MOD
ans=ans+8**N %MOD
print(ans%MOD)
| 1 | 3,145,711,647,648 | null | 78 | 78 |
N,A,B=map(int,input().split())
sho,amri = divmod(N,(A+B))
if amri > A:
amri = A
print(A*sho+amri)
|
import sys
read = sys.stdin.readline
import time
import math
import itertools as it
def inp():
return int(input())
def inpl():
return list(map(int, input().split()))
start_time = time.perf_counter()
# ------------------------------
n, a, b = inpl()
l = n // (a + b)
m = n % (a + b)
print(a * l + min(m, a))
# -----------------------------
end_time = time.perf_counter()
print('time:', end_time-start_time, file=sys.stderr)
| 1 | 55,959,150,305,640 | null | 202 | 202 |
n = int(input())
a = input()
s=list(map(int,a.split()))
q = int(input())
a = input()
t=list(map(int,a.split()))
i = 0
for it in t:
if it in s:
i = i+1
print(i)
|
from _collections import deque
n,m,k=map(int,input().split())
fre=[[] for _ in range(n+1)]
bro=[[] for _ in range(n+1)]
for i in range(m):
a,b=map(int,input().split())
fre[a].append(b)
fre[b].append(a)
for i in range(k):
a, b = map(int, input().split())
bro[a].append(b)
bro[b].append(a)
ans=[]
x=[-1]*(n+1)
for i in range(1,n+1):
if x[i]==-1:
x[i]=i
data=deque([i])
while len(data)>0:
p=data.popleft()
for j in fre[p]:
if x[j]==-1:
x[j]=i
data.append(j)
g=[0]*(n+1)
for i in range(1,n+1):
g[x[i]]+=1
for i in range(1,n+1):
g[i]=g[x[i]]
for i in range(1,n+1):
aa=g[i]-1
aa-=len(fre[i])
for j in bro[i]:
if x[i]==x[j]:
aa-=1
ans.append(str(aa))
print(" ".join(ans))
| 0 | null | 30,953,754,554,752 | 22 | 209 |
x = raw_input()
print int(x) ** 3
|
s=input()
t=input()
ans=int(len(s))
for i in range(len(s)-len(t)+1):
now=int(0)
for j in range(len(t)):
if s[i+j]!=t[j]:
now+=1
ans=min(now,ans)
print(ans)
| 0 | null | 1,988,404,574,240 | 35 | 82 |
if __name__ == '__main__':
A = list(map(int,input().split()))
print(A.index(0)+1)
|
N=int(input())
List = list(map(int, input().split()))
res = 1000000000000
mid = 0
for i in range(101):
for j in range(N):
mid += (i-List[j])**2
res = min(res,mid)
mid = 0
print(res)
| 0 | null | 39,383,257,189,628 | 126 | 213 |
import sys
#fin = open("test.txt", "r")
fin = sys.stdin
n, m = map(int, fin.readline().split())
A = [[] for i in range(n)]
for i in range(n):
A[i] = list(map(int, fin.readline().split()))
b = [0 for i in range(m)]
for i in range(m):
b[i] = int(fin.readline())
c = [0 for i in range(n)]
for i in range(n):
for j in range(m):
c[i] += A[i][j] * b[j]
for i in range(n):
print(c[i])
|
a, b, n = map(int, input().split())
if b > n:
x = n
else:
x = b - 1
print(int(a * x / b) - a * int(x / b))
| 0 | null | 14,674,699,285,330 | 56 | 161 |
import sys
import math
input = sys.stdin.readline
A, B = map(int, input().split())
X = A / 0.08
Y = B/0.1
for i in range(math.floor(min(X, Y)), math.ceil(max(X, Y)) + 1):
if int(i * 0.08) == A and int(i * 0.10) == B:
print(i)
exit()
print(-1)
|
A, B = map(int, input().split())
a = [i for i in range(int((A-1)*100/8 ), int((A+1)*100/8 ))]
b = [i for i in range(int((B-1)*100/10), int((B+1)*100/10))]
a = [i for i in a if int(i*0.08) == A]
b = [i for i in b if int(i*0.10) == B]
ans = list(set(a) & set(b))
if ans and min(ans) > 0:
print(min(ans))
else:
print(-1)
| 1 | 56,344,823,650,232 | null | 203 | 203 |
while True:
text = input()
if text == '0':
break
total = 0
for a in range(len(text)):
total += int(text[a])
print(total)
|
kazu = ['pon','pon','hon','bon','hon','hon','pon','hon','pon','hon']
n = int(input())
print(kazu[n%10])
| 0 | null | 10,493,837,435,378 | 62 | 142 |
n,m,l=map(int,raw_input().split())
matA=[map(int,raw_input().split()) for i in range(n)]
matB=[map(int,raw_input().split()) for j in range(m)]
for i in range(n):
for j in range(l):
print sum([matA[i][k]*matB[k][j] for k in range(m)]),
print
|
n, m, l = map(int, input().split())
A, B = [list(map(int, input().split())) for r in range(n)], [list(map(int, input().split())) for r in range(m)]
for i in range(n):
for j in range(l):
Cij = 0
for k in range(m):
Cij += A[i][k]*B[k][j]
if j < l-1:
print('%d' %(Cij), end=' ')
else:
print('%d' % (Cij))
| 1 | 1,427,752,205,532 | null | 60 | 60 |
M=10**9+7
n,k,*l=map(int,open(0).read().split())
lp,lm=[],[]
for i in l:
if i<0: lm+=[i]
else: lp+=[i]
cp,cm=len(lp),len(lm)
ok=0
if cp>0:
if n==k: ok=1-cm%2
else: ok=1
else: ok=1-k%2
a=1
if ok<1:
l.sort(key=lambda x:abs(x))
for i in range(k):
a=a*l[i]%M
else:
lp.sort()
lm.sort(reverse=1)
if k%2:
a=lp.pop()
p=[]
while len(lp)>1:
p+=[lp.pop()*lp.pop()]
while len(lm)>1:
p+=[lm.pop()*lm.pop()]
p.sort(reverse=1)
for i in range(k//2):
a=a*p[i]%M
print(a)
|
import copy
from sys import exit
n, k = map(int, input().split())
A = list(map(int, input().split()))
mod = 10**9 + 7
plus = []
minus = []
for a in A:
if a >= 0:
plus.append(a)
else:
minus.append(a)
plus.sort()
minus.sort(reverse=True)
def is_ans_plus():
if len(plus) > 0:
if n == k:
if len(minus) % 2 == 0:
return True
else:
return False
else:
return True
else:
if k % 2 == 0:
return True
else:
return False
ans = 1
if is_ans_plus():
if k % 2 == 1:
ans *= plus.pop()
k -= 1
for i in range(k // 2):
plus_pair, minus_pair = -1, -1
if len(plus) >= 2:
plus_pair = plus[-1] * plus[-2]
if len(minus) >= 2:
minus_pair = minus[-1] * minus[-2]
if plus_pair >= minus_pair:
ans *= plus_pair
plus.pop()
plus.pop()
else:
ans *= minus_pair
minus.pop()
minus.pop()
ans %= mod
else:
ans = -1
A = sorted([abs(a) for a in A])
for i in range(k):
ans *= A[i]
ans %= mod
print(ans)
| 1 | 9,318,279,527,788 | null | 112 | 112 |
import sys
input = sys.stdin.readline
from collections import *
def bfs():
q = deque([0])
pre = [-1]*N
pre[0] = 0
while q:
v = q.popleft()
for nv in G[v]:
if pre[nv]==-1:
pre[nv] = v
q.append(nv)
return pre
N, M = map(int, input().split())
G = [[] for _ in range(N)]
for _ in range(M):
A, B = map(int, input().split())
G[A-1].append(B-1)
G[B-1].append(A-1)
pre = bfs()
print('Yes')
for pre_i in pre[1:]:
print(pre_i+1)
|
s = input()
days_of_the_week = ['SUN', 'MON', 'TUE', 'WED', 'THU', 'FRI', 'SAT']
n = days_of_the_week.index(s)
print(7 - days_of_the_week.index(s))
| 0 | null | 76,774,269,492,350 | 145 | 270 |
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()
cnt = 0
if(N % 2 == 1):
l = A[N//2]
r = B[N//2]
cnt = r - l + 1
else:
l = A[N//2-1] + A[N//2]
r = B[N//2-1] + B[N//2]
cnt = r - l + 1
print(cnt)
|
import statistics
def main():
n = int(input())
a = [0 for _ in range(n)]
b = [0 for _ in range(n)]
for i in range(n):
a[i], b[i] = map(int, input().split())
amed = statistics.median(a)
bmed = statistics.median(b)
if n % 2:
print(int(bmed - amed + 1))
else:
print(int((bmed - amed) * 2 + 1))
if __name__ == '__main__':
main()
| 1 | 17,249,169,717,910 | null | 137 | 137 |
N = int(input())
a = 0
k = 2*(N-2)+1
for i in range(2,N):
for j in range(i,N):
if (i*j<N)and(i!=j):
a+=2
elif(i*j<N)and(i==j):
a+=1
else:
break
print(a+k)
|
from math import sqrt
N = int(input())
ans = 0
for a in range(1, N+1):
ans += (N-1)//a
print(ans)
| 1 | 2,595,095,485,892 | null | 73 | 73 |
N=int(input())
A=N//2+N%2
print(A)
|
import sys
def input(): return sys.stdin.readline().strip()
def mapint(): return map(int, input().split())
sys.setrecursionlimit(10**9)
N, M = mapint()
S = list(input())
def solve():
now = N
choice = []
while 1:
if now==0:
return choice[::-1]
for m in range(M, 0, -1):
nx = now-m
if nx<0: continue
if S[nx]=='1': continue
now = nx
choice.append(m)
break
else:
return [-1]
print(*solve())
| 0 | null | 98,844,917,583,412 | 206 | 274 |
print("bust") if sum(list(map(int,input().split()))) > 21 else print("win")
|
MOD = 10 ** 9 + 7
INF = 10 ** 20
import sys
input = sys.stdin.readline
sys.setrecursionlimit(100000000)
dy = (-1,0,1,0)
dx = (0,1,0,-1)
def main():
n = int(input())
a = list(map(int,input().split()))
if n%2 == 0:
ans1 = 0
ans2 = 0
for i in range(n):
if i%2 == 0:
ans1 += a[i]
else:
ans2 += a[i]
ans = max(ans1,ans2)
cuml = [0] * (n + 1)
cumr = [0] * (n + 1)
for i in range(n):
if i == 0:
cuml[i + 1] = a[i]
else:
cuml[i + 1] = cuml[i - 1] + a[i]
for i in range(n - 1,-1,-1):
if i == n - 1:
cumr[i] = a[i]
else:
cumr[i] = cumr[i + 2] + a[i]
for i in range(1,n - 2,2):
ans = max(ans,cuml[i] + cumr[i + 2])
else:
cuml = [0] * (n + 1)
cumr = [0] * (n + 1)
cumr2 = [0] * (n + 1)
for i in range(n):
if i == 0:
cuml[i + 1] = a[i]
else:
cuml[i + 1] = cuml[i - 1] + a[i]
for i in range(n - 1,-1,-1):
if i == n - 1:
cumr[i] = a[i]
cumr2[i] = a[i]
else:
cumr[i] = cumr[i + 2] + a[i]
if i%2 == 1:
if i == n - 2:
continue
if i == n - 4:
cumr2[i] = cumr2[i + 3] + a[i]
else:
cumr2[i] = max(cumr2[i + 2],cumr[i + 3]) + a[i]
cumr.append(0)
ans = -INF
for i in range(n):
ans = max(ans,cuml[i] + cumr[i + 2])
if i <= n - 6 and i%2 == 1:
ans = max(ans,cuml[i] + cumr2[i + 2])
if i <= n - 4 and i%2 == 1:
ans = max(ans,cuml[i] + cumr[i + 3])
print(ans)
if __name__ =='__main__':
main()
| 0 | null | 78,302,211,447,658 | 260 | 177 |
# -*- coding: utf-8 -*-
import sys
import os
for s in sys.stdin:
a, b = list(map(int, s.split()))
c = a + b
if c == 1:
print(1)
continue
for i in range(7):
left = 10 ** i
right = 10 ** (i + 1)
if left <= c < right:
print(i + 1)
break
|
import math
N = int(input())
A = list(map(int, input().split()))
Sum = 0
mod = (10 ** 9) + 7
for i in range(len(bin(max(A)))-2):
Sum_1 = 0
for j in range(N):
#print(i, j)
if ((A[j] >> i) & 1):
Sum_1 += 1
Sum_0 = N - Sum_1
Sum = (Sum + ((Sum_0 * Sum_1) % mod * (2 ** i)) % mod) % mod
# print(Sum_0,Sum_1)
print(Sum)
| 0 | null | 61,410,185,814,348 | 3 | 263 |
import sys
input_line = sys.stdin.readline()
input_arr = input_line.split()
x = int(input_arr[0])
y = int(input_arr[1])
print str(x*y) + " " + str(2*x+2*y)
|
a = input();
print(int(a.split()[0])*int(a.split()[1]),int(a.split()[0]) * 2 + int(a.split()[1])*2, end="\n")
| 1 | 298,211,263,770 | null | 36 | 36 |
h, n = map(int, input().split())
ab = []
for _ in range(n):
ab.append(map(int, input().split()))
m = 20010
dp = [1000000000] * m
dp[0] = 0
for a, b in ab:
for i in range(m):
if i - a >= 0:
dp[i] = min(dp[i], dp[i - a] + b)
print(min(dp[h:]))
|
h,n=map(int,input().split())
inf=100000000000
dp=[inf]*(h+1)
dp[h]=0
for i in range(n):
a,b=map(int,input().split())
for j in range(h,-1,-1):
dp[max(j-a,0)]=min(dp[max(j-a,0)],dp[j]+b)
print(dp[0])
| 1 | 81,082,897,606,458 | null | 229 | 229 |
def a():
data_set=[]
while True:
s=input().split()
data_set.append(s)
if ["0","0"] in data_set:
break
data_set=data_set[:-1]
import itertools
for i in data_set:
count=0
n=int(i[0])
x=int(i[1])
num=list(itertools.combinations(range(1,n+1),3))
for j in num:
if sum(j)==x:
count+=1
print(count)
a()
|
from collections import deque
def print_list(que):
for i, q in enumerate(que):
if i != len(que)-1:
print(q, end=' ')
else:
print(q)
def main():
List = deque()
n = int(input())
for i in range(n):
order = input().split()
if order[0] == "insert":
List.appendleft(order[1])
elif order[0] == "delete":
try:
List.remove(order[1])
except ValueError:
pass
elif order[0] == "deleteFirst":
List.popleft()
elif order[0] == "deleteLast":
List.pop()
print_list(List)
if __name__ == "__main__":
main()
| 0 | null | 668,085,094,600 | 58 | 20 |
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 = int(ipt())
way = [[] for i in range(n+1)]
for i in range(n-1):
a,b = map(int,ipt().split())
way[a].append((b,i))
way[b].append((a,i))
q = queue.Queue()
q.put((1,-1,-1)) #nowplace,pastplace,hen
col = [-1]*(n-1)
while not q.empty():
np,pp,hen = q.get()
nc = 1
for i,wn in way[np]:
if i == pp:
continue
if nc == hen:
nc += 1
col[wn] = nc
q.put((i,np,nc))
nc += 1
print(max(col))
for i in col:
print(i)
return
if __name__ == '__main__':
main()
|
import sys
sys.setrecursionlimit(500000)
N = int(input())
#道を双方向に記録する。
g = [[] for _ in range(N)]
for i in range(N-1): #木の辺の数はN-1
#iが辺のID
a,b = map(int,input().split())
a -= 1; b -= 1 #ここで引いて頂点を0スタートにしないとオーバーフロー
g[a].append((b,i))
g[b].append((a,i))
#これが答え。
ans = [-1 for _ in range(N-1)]
#vという頂点からpという親にcolorという色で繋がっている。
def dfs(v, color, p):
k = 1 #色の初期値
for i in range(len(g[v])): #vから繋がっている頂点をtoとして探す
TO = g[v][i][0]
ID = g[v][i][1]
if TO == p: #親は一つでそれ以外は子。親の時だけ無視すればよい。
continue
if k == color: #親から繋がっている色と被ったらダメ。
k += 1
ans[ID] = k
k += 1 #ここで足す1をしないとこのfor loopの中の辺で色が被る。
dfs(TO,ans[ID],v)
dfs(0,0,-1) #根を0として、仮想親の-1から仮想色0で繋がっている。
print(max(ans))
for i in ans:
print(i)
| 1 | 136,475,002,306,816 | null | 272 | 272 |
def solve():
ans = 10**12
for i in range(1, int(N**0.5)+1):
if N % i == 0:
ans = min(ans, i + (N//i) -2)
if N == 2:
print(1)
elif N == 3:
print(2)
else:
print(ans)
if __name__ == "__main__":
N = int(input())
solve()
|
N = int(input())
A = list(map(int, input().split()))
for a in A:
if a % 2 == 0:
if a % 3 != 0 and a % 5 != 0:
print('DENIED')
break
else:
print('APPROVED')
| 0 | null | 115,117,841,614,720 | 288 | 217 |
import math
n, m = map(int, input().split())
if n >= 2:
a = math.factorial(n)/(math.factorial(2)*math.factorial(n-2))
else:
a = 0
if m >= 2:
b = math.factorial(m)/(math.factorial(2)*math.factorial(m-2))
else:
b = 0
print(int(a + b))
|
A,B = map(int, input().split())
print(int((A*(A-1)+B*(B-1))/2))
| 1 | 45,737,741,134,698 | null | 189 | 189 |
import sys
N,M=map(int,input().split())
slist=list(map(int,input()))
seq=0
for s in slist:
if s==0:
seq=0
else:
seq+=1
if seq==M:
print(-1)
sys.exit(0)
class SegTree:
#init(init_val, ide_ele): 配列init_valで初期化 O(N)
def __init__(self, init_val, segfunc, ide_ele):
#init_val: 配列の初期値
#segfunc: 区間にしたい操作
#ide_ele: 単位元
#n: 要素数
#num: n以上の最小の2のべき乗
#tree: セグメント木(1-index)
n = len(init_val)
self.segfunc = segfunc
self.ide_ele = ide_ele
self.num = 1 << (n - 1).bit_length()
self.tree = [ide_ele] * 2 * self.num
# 配列の値を葉にセット
for i in range(n):
self.tree[self.num + i] = init_val[i]
# 構築していく
for i in range(self.num - 1, 0, -1):
self.tree[i] = self.segfunc(self.tree[2 * i], self.tree[2 * i + 1])
#update(k, x): k番目の値をxに更新 O(logN)
def update(self, k, x):
#k番目の値をxに更新
#k: index(0-index)
#x: update value
k += self.num
self.tree[k] = x
while k > 1:
self.tree[k >> 1] = self.segfunc(self.tree[k], self.tree[k ^ 1])
k >>= 1
#query(l, r): 区間[l, r)をsegfuncしたものを返す O(logN)
def query(self, l, r):
#[l, r)のsegfuncしたものを得る
#l: index(0-index)
#r: index(0-index)
res = self.ide_ele
l += self.num
r += self.num
while l < r:
if l & 1:
res = self.segfunc(res, self.tree[l])
l += 1
if r & 1:
res = self.segfunc(res, self.tree[r - 1])
l >>= 1
r >>= 1
return res
#segfunc
def segfunc(x,y):
return min(x,y) #最小値
#ide_ele
ide_ele=float("inf") #最小値
#init
seg=SegTree([float("inf")]*(N+1), segfunc, ide_ele)
dist_list=[float("inf")]*(N+1)
seg.update(N,0)
dist_list[N]=0
for i in reversed(range(N)):
if slist[i]==0:
left=i+1
right=min(i+M,N)
dist=seg.query(left,right+1)+1
seg.update(i,dist)
dist_list[i]=dist
answer_list=[]
i=0
while i<N:
for j in range(1,M+1):
if dist_list[i]>dist_list[i+j]:
answer_list.append(j)
i+=j
break
print(*answer_list)
|
def main():
n, m = map(int, input().split())
rev = input()[::-1]
ans = []
cur = nxt = 0
while cur < n:
for i in range(cur + 1, cur + m + 1):
if i==n:
nxt = i
break
if rev[i]=="0":
nxt = i
if cur==nxt:
print(-1)
exit()
ans += [str(nxt - cur)]
cur = nxt
print(" ".join(ans[::-1]))
if __name__=="__main__":
main()
| 1 | 139,258,882,968,040 | null | 274 | 274 |
from math import pi
R = int(input())
ans = float(2 * pi * R)
print(ans)
|
X = int(input())
t = X
ans = 1
while t%360 != 0:
t += X
ans += 1
print(ans)
| 0 | null | 22,185,952,054,932 | 167 | 125 |
x = input().split()
a = int(x[0])
b = int(x[1])
c = int(x[2])
if a <= b <= c:
print(a,b,c)
elif a <= c <= b:
print(a,c,b)
elif b <= a <= c:
print(b,a,c)
elif b <= c <= a:
print(b,c,a)
elif c <= a <= b:
print( c,a,b)
else:
print(c,b,a)
|
N=int(input())
mod=10**9+7
a = (10**N)%mod
b = (9**N)%mod
c = (8**N)%mod
ans = (a+c-2*b)%mod
print(ans)
| 0 | null | 1,767,115,310,466 | 40 | 78 |
n = list(input())
for i in range(0, len(n)):
print("x", end = "")
|
def main():
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque
from itertools import combinations, permutations, accumulate, groupby, product
from bisect import bisect_left,bisect_right
from heapq import heapify, heappop, heappush
import math
#from math import gcd
#inf = 10**17
#mod = 10**9 + 7
n,k,c = map(int, input().split())
s = input().rstrip()
left = [0]*n
day = 0
temp = 0
while day < n:
if s[day] == 'o':
temp += 1
left[day] = temp
for i in range(c):
if day+i+1 < n:
left[day+i+1] = temp
day += c
else:
left[day] = temp
day += 1
right = [0]*n
day = n-1
temp = 0
while 0 <= day:
if s[day] == 'o':
temp += 1
right[day] = temp
for i in range(c):
if day-i-1 >= 0:
right[day-i-1] = temp
day -= c
else:
right[day] = temp
day -= 1
res = []
for i in range(n):
if s[i] == 'o':
if i-c-1 < 0:
pre = 0
else:
pre = left[i-c-1]
if i+c+1 >= n:
pos = 0
else:
pos = right[i+c+1]
if pre + pos == k-1:
res.append(i+1)
for i in range(len(res)):
if i-1>=0:
l = res[i-1]
else:
l = -1000000
if i+1<len(res):
r = res[i+1]
else:
r = 10000000
if res[i]-l>c and r-res[i] > c:
print(res[i])
if __name__ == '__main__':
main()
| 0 | null | 56,558,714,304,400 | 221 | 182 |
h1, m1, h2, m2, k = map(int, input().split())
if m1 <= m2:
h = h2 - h1
m = m2 - m1
else:
h = h2 - h1 - 1
m = m2 - m1 + 60
m += 60 * h
print(m - k)
|
A,B,C,K = map(int,input().split())
score = 0
if A<K:
K -= A
score += A
else:
score += K
print(score)
exit()
if B<K:
K -= B
else:
print(score)
exit()
score -= min(K,C)
print(score)
| 0 | null | 19,858,474,222,500 | 139 | 148 |
from collections import deque
N, M, K = map(int, input().split())
G = [[] for i in range(N)]
NG = [set() for i in range(N)]
for _ in range(M):
A, B = map(int, input().split())
G[A - 1].append(B - 1)
G[B - 1].append(A - 1)
NG[A - 1].add(B - 1)
NG[B - 1].add(A - 1)
for _ in range(K):
A, B = map(int, input().split())
NG[A - 1].add(B - 1)
NG[B - 1].add(A - 1)
C = [-1] * N
CNT = [0] * N
c = 0
for i in range(N):
if C[i] >= 0: continue
Q = [i]
C[i] = c
CNT[c] += 1
while Q:
x = Q.pop()
for y in G[x]:
if C[y] == -1:
C[y] = C[x]
CNT[C[y]] += 1
Q.append(y)
c +=1
Y = [0] * N
for i in range(N):
Y[i] = CNT[C[i]] - 1
for i in range(N):
for j in NG[i]:
if C[i] == C[j]:
Y[i] -= 1
print(*Y)
|
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
def s(): return input()
def i(): 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)
def gcd(*numbers): reduce(math.gcd, numbers)
sys.setrecursionlimit(10 ** 9)
mod = 10**9+7
count = 0
ans = 0
n, m = l()
g = [[] for i in range(n)]
for i in range(m):
a, b = l()
g[a-1].append(b-1)
g[b-1].append(a-1)
q = deque([0])
d = [-1] * n
d[0] = 0
while q:
v = q.popleft()
for w in g[v]:
if d[w] != -1:
continue
d[w] = v
q.append(w)
if -1 in d:
print("No")
else:
print("Yes")
for di in d[1:]:
print(di+1)
| 0 | null | 40,809,983,840,920 | 209 | 145 |
import sys
readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)
def main():
a, b = map(int, readline().split())
print(str(min(a, b)) * max(a, b))
if __name__ == '__main__':
main()
|
a,b=map(int,input().split())
s=[''.join([str(a)]*b),''.join([str(b)]*a)]
print(sorted(s)[0])
| 1 | 84,539,695,474,890 | null | 232 | 232 |
a,b = input().split()
#print(a,b)
A = int(a)
x,y = b.split('.')
B = int(x)*100+int(y)
print(int(A*B)//100)
|
C = input()
alphabet = 'abcdefghijklmnopqrstuvwxyz'
print(alphabet[(alphabet.index(C) + 1) % len(alphabet)])
| 0 | null | 54,741,822,064,760 | 135 | 239 |
from math import *
def distance (p,n,x,y):
dis = 0.0
if p == "inf":
for i in range(0,n) :
if dis < abs(x[i]-y[i]):
dis = abs(x[i]-y[i])
else :
for i in range(0,n) :
dis += abs(x[i]-y[i])**p
dis = dis ** (1.0/p)
return dis
if __name__ == '__main__' :
n = int(input())
x = map(int,raw_input().split())
y = map(int,raw_input().split())
print distance(1,n,x,y)
print distance(2,n,x,y)
print distance(3,n,x,y)
v = distance('inf',n,x,y)
print "%.6f" % v
|
n = int(input())
X = list(map(int, input().split()))
Y = list(map(int, input().split()))
C = [abs(X[i] - Y[i]) for i in range(n)]
D = []
def distance(X, Y):
for k in range(1, 4):
d = 0
for j in range(len(X)):
d += C[j] ** k
d = d ** (1 / k)
D.append(d)
D.append(max(C))
return D
distance(X, Y)
for i in range(4):
print('{:.08f}'.format(D[i]))
| 1 | 213,027,696,480 | null | 32 | 32 |
def main():
S = input()
h = [0] * (len(S) + 1)
# < となっている場合だけを考える
# a[i] < a[i+1] でない場合、a[i] に +1 したものを a[i+1] にする
for i in range(len(S)):
if(S[i] == "<"):
h[i+1] = max(h[i+1], h[i] + 1)
# > となっている場合だけを考える
# a[i-1] > a[i] でない場合、a[i] に +1 したものを a[i-1] にする
# この時この操作は逆順から行う
for i in range(len(S), 0, -1):
if(S[i-1] == ">"):
h[i-1] = max(h[i-1], h[i] + 1)
print(sum(h))
if __name__ == "__main__":
main()
|
s = str(input())
#s = "<>>><<><<<<<>>><"
ans = 0
def leftmore(ln):
ret = [0]
cur = 0
for c in ln:
if c == "<":
cur += 1
else:
cur = 0
ret.append(cur)
return ret
def rightless(ln):
revl = reversed(ln)
ret = [0]
cur = 0
for c in revl:
if c == ">":
cur += 1
else:
cur = 0
ret.append(cur)
return list(reversed(ret))
lm = leftmore(s)
rl = rightless(s)
for i in range(len(s)+1):
ans += max(lm[i],rl[i])
print(ans)
| 1 | 156,125,046,524,448 | null | 285 | 285 |
a = [input() for i in range(10)]
a.sort(reverse=True)
print a[0]
print a[1]
print a[2]
|
# coding: utf-8
# Your code here!
N,K=map(int,input().split())
A=list(map(float, input().split()))
low=0
high=10**9+1
while high-low!=1:
mid=(high+low)//2
cut_temp=0
ans=-1
for a in A:
cut_temp+=-(-a//mid)-1
if cut_temp>K:
low=mid
else:
high=mid
print(high)
| 0 | null | 3,287,353,627,108 | 2 | 99 |
s=input()
n=len(s)
# ある桁まで、ぴったり支払う時の解、+1円支払う時の解
# はじめは0円に対して考えるので、0と1。
dp=0,1
# 上からi+1桁目にたいして
for i in range(n):
si=int(s[i])
# i+i桁目までぴったり払うときの最小値。ひとつ上の桁で+1払っているときは、繰り下がりを考慮。
a=min(dp[0]+si,dp[1]+10-si)
# i+1桁目までぴったり＋1を払う時の最小値。
# つまり、次の桁に繰り下がりの1を残す。この桁における1は次の桁から見れば10。なのでdp[1]からの遷移には10が計算の項にある。
b=min(dp[0]+si+1,dp[1]+10-(si+1))
dp=a,b
print(dp[0])
|
n = list(map(int, list(input())))[::-1] + [0]
sum1 = sum(n)
for i in range(len(n)-1):
if n[i] > 5 or (n[i]==5 and n[i+1]>4):
n[i] = 10-n[i]
n[i+1] += 1
print(min(sum1, sum(n)))
| 1 | 70,859,530,845,600 | null | 219 | 219 |
import math
n=int(input())
print(int(360/math.gcd(n,360)))
|
from math import gcd
def lcm(a,b):
return a*b//gcd(a,b)
X=int(input())
from math import ceil
print(lcm(360,X)//X)
| 1 | 13,063,972,311,522 | null | 125 | 125 |
def resolve():
import math
from math import gcd
MOD=10**9+7
n=int(input())
zero=0
cnt={}
for i in range(n):
a,b=map(int,input().split())
if a==0 and b==0:
zero+=1
continue
g=gcd(a,b)
a//=g
b//=g
if b<0:
a*=-1
b*=-1
if b==0 and a<0:
a*=-1
if a<=0:
a,b=b,-a
if (a,b) in cnt:
cnt[(a,b)][0]+=1
else:
cnt[(a,b)]=[1,0]
else:
if (a,b) in cnt:
cnt[(a,b)][1]+=1
else:
cnt[(a,b)]=[0,1]
ans=1
for i,v in cnt.items():
ans*=pow(2,v[0],MOD)+pow(2,v[1],MOD)-1
ans%=MOD
print((zero-1+ans)%MOD)
if __name__ == '__main__':
resolve()
|
import sys
from math import gcd
#import numpy as np
#import math
from fractions import Fraction
import itertools
input=sys.stdin.readline
def main():
ans=1
mod=1000000007
n0=0
na=nb=0
n=int(input())
d={}
for i in range(n):
a,b=map(int,input().split())
if b==0 and a==0:
n0+=1
elif b==0:
nb+=1
elif a==0:
na+=1
else:
g=gcd(a,b)
if b<0:
a*=-1
b*=-1
s=(a//g,b//g)
if s not in d:
d[s]=1
else:
d[s]+=1
for k,v in d.items():
a,b=k
if a>0:
if (-b,a) in d:
if d[(a,b)]!=-1:
ans*=pow(2,d[(-b, a)])-1+pow(2,d[(a,b)])-1+1
ans=ans%mod
d[(-b,a)]=-1
else:
ans*=pow(2,d[(a,b)])
ans=ans%mod
else:
if (b,-a) in d:
if d[(a,b)]!=-1:
ans*=pow(2,d[(b, -a)])-1+pow(2,d[(a,b)])-1+1
ans=ans%mod
d[(b,-a)]=-1
else:
ans*=pow(2,d[(a,b)])
ans=ans%mod
ans*=pow(2,na)-1+pow(2,nb)-1+1
print((ans-1+n0)%mod)
if __name__ == '__main__':
main()
| 1 | 20,879,348,046,128 | null | 146 | 146 |
def input2():
return map(int,input().split())
#入力:[n1,n2,...nk](int:整数配列)
def input_array():
return list(map(int,input().split()))
class UnionFind():
"""docstring for UnionFind"""
def __init__(self, n):
self.parents = [-1]*n
def find(self,x):
if self.parents[x] < 0: #自分が親である時
return x
else: #自分が子供である時
self.parents[x]=self.find(self.parents[x])
return self.parents[x]
def union(self,x,y):
# 各要素の親要素を返す
x=self.find(x)
y=self.find(y)
if x==y:
return
if self.parents[x] > self.parents[y]:
x,y=y,x
self.parents[x]+=self.parents[y]
self.parents[y]=x
# print(self.parents)
n,m=input2()
S=[input_array() for _ in range(m)]
uf=UnionFind(n) #uf.parents==[-1]*n
for s in S:
uf.union(s[0]-1,s[1]-1)
ans=min(uf.parents)
print(-ans)
|
import sys
class UnionFind():
def __init__(self, n):
self.parents = [-1] * n
def find(self, x):
if self.parents[x] < 0:
return x
else:
self.parents[x] = self.find(self.parents[x])
return self.parents[x]
def union(self, x, y):
x = self.find(x)
y = self.find(y)
if x == y:
return
if self.parents[x] > self.parents[y]:
x, y = y, x
self.parents[x] += self.parents[y]
self.parents[y] = x
N, M = map(int, input().split())
info = [()] * M
for i in range(M):
info[i] = map(int, input().split())
uf = UnionFind(N)
for a, b in info:
a -= 1; b -= 1
uf.union(a, b)
ans = min(uf.parents)
print(-ans)
| 1 | 3,943,401,595,852 | null | 84 | 84 |
x1, y1, x2, y2 = map(float, raw_input().split())
num = (x2-x1)*(x2-x1) + (y2-y1)*(y2-y1)
if num == 0:
print 0
else:
xi = num
for _ in range(100):
xi = (xi + (num / xi)) / 2.0
print xi
|
import math
from decimal import Decimal, ROUND_HALF_UP
def resolve():
x1, y1, x2, y2 = map(float, input().split())
a = Decimal(math.sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)).quantize(Decimal('0.0001'), rounding=ROUND_HALF_UP)
print(a)
resolve()
| 1 | 160,841,342,168 | null | 29 | 29 |
s,w = [int(x) for x in input().split()]
if s > w:
print("safe")
else:
print("unsafe")
|
import numpy as np
# import math
# import copy
# from collections import deque
import sys
input = sys.stdin.readline
# sys.setrecursionlimit(10000)
from numba import njit,i8
@njit(i8(i8,i8,i8,i8[:,:],i8[:],i8,i8))
def give_dp(N,K,mod,LR,dp,l,r):
for i in range(N):
if i > 0:
dp[i] += dp[i-1]
dp[i] %= mod
for k in range(K):
l = LR[k][0]
r = LR[k][1]
if i + l < N:
dp[i+l] += dp[i]
dp[i+1] %= mod
if i + r < N:
dp[i+r+1] -= dp[i]
dp[i+1] %= mod
return dp[-1]
def main():
N,K = map(int,input().split())
LR = [list(map(int,input().split())) for i in range(K)]
LR = np.array(LR)
mod = 998244353
dp = [0 for i in range(N)]
dp[0] = 1
dp[1] = -1
dp = np.array(dp)
res = give_dp(N,K,mod,LR,dp,0,0)
res %= mod
print(res)
main()
| 0 | null | 15,895,806,117,412 | 163 | 74 |
from math import floor
A, B, N = map(int, input().split())
i = min(B - 1, N)
f_i = floor(A * i / B) - A * floor(i / B)
print(f_i)
|
def resolve():
A, B, N = list(map(int, input().split()))
x = min(B-1, N)
import math
print(math.floor(A*x/B))
if '__main__' == __name__:
resolve()
| 1 | 28,110,506,362,108 | null | 161 | 161 |
n = int(input())
chars = 'Xabcdefghijklmnopqrstuvwxyz'
res = ''
while True:
x = n%26 #最下位の位の文字を求める(係数が26でない最下位の位が余りとして出せる)
if x == 0: #Xが26のときのみ余り0で対応させるため26に書き換え
x = 26
res += chars[x] #文字を正解リストに追加
n -= x #xを左辺に持っていって右辺で10の位以上の数値を調べる
if n == 0 :
break
n //= 26 #n-xは必ず26の倍数になっている。(xを移項しているから自明)
#最下位の位を余りとして扱うために26で割って係数を消している。
print(res[::-1])#resには1の位が一番初めに入っているので、反転させて表示
|
N = int(input())
letters = 'zabcdefghijklmnopqrstuvwxy'
def solve(N):
md = N%26
l = letters[md]
if md==0: md=26
if N>26:
return solve((N-md)//26) + l
else:
return l
print(solve(N))
| 1 | 11,826,194,839,940 | null | 121 | 121 |
a = input()
b = input()
print(a == b[:-1] and "Yes" or "No")
|
import sys
readline = sys.stdin.buffer.readline
s =readline().rstrip().decode()
t =readline().rstrip().decode()
if t[:-1] == s:
print('Yes')
else:
print('No')
| 1 | 21,332,330,215,350 | null | 147 | 147 |
n = int(input())
lst = []
for i in range(1,10):
for j in range(1,10):
lst.append(i*j)
print("Yes" if n in lst else "No")
|
def resolve():
n = int(input())
for i in range(1, 10):
a = n // i
if n % i == 0 and a < 10:
print('Yes')
return
print('No')
if __name__ == "__main__":
resolve()
| 1 | 159,858,656,107,040 | null | 287 | 287 |
n = int(input())
A = list(map(int,input().split()))
from collections import deque
q = deque(A)
i = 1
ans = []
while i <= n and q:
a = q.popleft()
if a==i:
ans.append(a)
i += 1
if len(ans)==0:
print(-1)
else:
print(n-len(ans))
|
import heapq
x,y,a,b,c = map(int,input().split())
P = [int(i) for i in input().split()]
Q = [int(i) for i in input().split()]
R = [-int(i) for i in input().split()]
P.sort(reverse=True)
P = P[:x]
Q.sort(reverse=True)
Q = Q[:y]
heapq.heapify(P)
heapq.heapify(Q)
heapq.heapify(R)
while R:
if P[0] >= Q[0]:
if Q[0] < -R[0]:
heapq.heapreplace(Q, -heapq.heappop(R))
else:
break
else:
if P[0] < -R[0]:
heapq.heapreplace(P,-heapq.heappop(R))
else:
break
print(sum(P)+sum(Q))
| 0 | null | 80,064,994,215,840 | 257 | 188 |
for i in range(1,10):
for s in range(1,10):
result = str(i) + "x" + str(s) + "=" + str(int(i)*int(s))
print(result)
|
N = input()
while N != "0":
SUM = 0
for i in N:
SUM += int(i)
print(SUM)
N = input()
| 0 | null | 802,025,068,864 | 1 | 62 |
import math
def is_prime(n):
for i in range(2, int(n**0.5) + 1):
if n % i == 0:
return False
return n != 1
n = int(input())
answer = 0
for _ in range(0, n):
m = int(input())
if is_prime(m):
answer = answer + 1
print(answer)
|
import sys
import math
if __name__ == "__main__":
num = int(sys.stdin.readline().strip())
ans = 0
for i in range(0, num):
n = int(sys.stdin.readline().strip())
flag = False
for j in range(2, int(math.sqrt(n)) + 1):
if n % j == 0:
flag = True
break
if not flag:
ans += 1
print ans
| 1 | 10,683,104,158 | null | 12 | 12 |
n, k = map(int, input().split())
A = set([])
for i in range(k):
d = input()
A = A | set(map(int, input().split()))
ans = 0
for i in range(n):
if i+1 not in A:
ans += 1
print(ans)
|
N, K = (int(x) for x in input().split())
check=[False]*N
ans=N
for i in range(K):
d=int(input())
A=list(map(int, input().split()))
for j in range(d):
if check[A[j]-1]==False:
ans-=1
check[A[j]-1]=True
print(ans)
| 1 | 24,740,940,359,630 | null | 154 | 154 |
def main():
N = int(input())
l = list(map(int, input().split()))
l2 = []
for i in range(len(l)):
if l[i] % 2 == 0:
l2.append(l[i])
for i in range(len(l2)):
if not l2[i] % 3 == 0 and not l2[i] % 5 == 0:
print('DENIED')
return
print('APPROVED')
main()
|
import bisect,collections,copy,itertools,math,string
import sys
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())
def main():
n = I()
lst = LI()
cnt = 1
ans = 0
for brock in lst:
if brock == cnt:
cnt += 1
else:
ans += 1
if cnt != 1:
print(ans)
else:
print(-1)
main()
| 0 | null | 91,979,812,130,848 | 217 | 257 |
N = map(int,input().split())
if (sum(N) % 9 == 0 ):
print('Yes')
else:
print('No')
|
# coding: utf-8
from queue import Queue
N = int(input())
graph = [None]
for _ in range(N):
graph.append(list(map(int, input().split(" ")))[1:])
class BFSSolver:
def __init__(self, graph):
self.graph = graph
self.queue = Queue()
self.queue.put(1)
self.before_id = 1
self.already_searched = [1]
self.res = [0]
for _ in range(N):
self.res.append(-1)
self.res[1] = 0
self.turn = 0
def next_turn(self):
now_id = self.queue.get()
before_id = now_id
neighbors = self.graph[now_id][1:]
for i in neighbors:
if i not in self.already_searched:
self.turn = self.res[before_id] + 1
self.already_searched.append(i)
self.res[i] = self.turn
self.queue.put(i)
def solve(self):
while not self.queue.empty():
self.next_turn()
for id, i in enumerate(self.res[1:]):
print("{} {}".format(id+1, i))
s = BFSSolver(graph)
s.solve()
| 0 | null | 2,236,587,827,460 | 87 | 9 |
n = int(input())
lis = list(map(int, input().split()))
cnt = 0
a = 1
for i in range(n):
if lis[i] == a:
cnt += 1
a += 1
if cnt == 0:
print(-1)
else:
print(n-cnt)
|
a = input()
day = ['SUN','MON','TUE','WED','THU','FRI','SAT']
values = [7,6,5,4,3,2,1]
d = dict(zip(day,values))
print(d[a])
| 0 | null | 123,245,836,879,860 | 257 | 270 |
import queue
n = int(input())
alp = "abcdefghijklmn"
q = queue.Queue()
q.put("a")
while not q.empty():
qi = q.get()
if len(qi) == n:
print(qi)
elif len(qi) < n:
idx = alp.index(max(qi))
for i in range(idx+2):
q.put(qi+alp[i])
|
import sys
import itertools
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
in_n = lambda: int(readline())
in_nn = lambda: map(int, readline().split())
in_nl = lambda: list(map(int, readline().split()))
in_na = lambda: map(int, read().split())
in_s = lambda: readline().rstrip().decode('utf-8')
def main():
N = in_n()
ans = []
def dfs(s):
if len(s) == N:
ans.append(s)
return
maxs = max(map(ord, s))
for i in range(ord('a'), maxs + 2):
dfs(s + chr(i))
dfs('a')
print('\n'.join(sorted(ans)))
if __name__ == '__main__':
main()
| 1 | 52,349,106,428,478 | null | 198 | 198 |
# coding: utf-8
import sys
import math
import collections
import itertools
INF = 10 ** 13
MOD = 10 ** 9 + 7
def input() : return sys.stdin.readline().strip()
def lcm(x, y) : return (x * y) // math.gcd(x, y)
def I() : return int(input())
def LI() : return [int(x) for x in input().split()]
def RI(N) : return [int(input()) for _ in range(N)]
def LRI(N) : return [[int(x) for x in input().split()] for _ in range(N)]
def LS() : return input().split()
def RS(N) : return [input() for _ in range(N)]
def LRS(N) : return [input().split() for _ in range(N)]
def PL(L) : print(*L, sep="\n")
def YesNo(B) : print("Yes" if B else "No")
def YESNO(B) : print("YES" if B else "NO")
N = I()
A = LI()
A = sorted([[a, i] for i, a in enumerate(A)], reverse=True, key=lambda x : x[0])
dp = [[0] * (N+1) for _ in range(N+1)]
for i in range(N):
for j in range(N-i):
dp[i+1][j] = max(dp[i+1][j], dp[i][j] + A[i+j][0] * (A[i+j][1] - i))
dp[i][j+1] = max(dp[i][j+1], dp[i][j] + A[i+j][0] * ((N-j-1) - A[i+j][1]))
res = 0
for i in range(N):
res = max(res, dp[i][N-i])
print(res)
|
while True:
H,W=[int(i) for i in input().split(" ")]
if H==W==0:
break
for h in range(H):
s="#" if h%2==0 else "."
for w in range(W-1):
s+="#" if s[-1]=="." else "."
print(s)
print()
| 0 | null | 17,441,355,290,830 | 171 | 51 |
# coding: utf-8
i = input()
j = int(i) ** 3
print(j)
|
from math import ceil
print(ceil(int(input())/2))
| 0 | null | 29,467,003,975,200 | 35 | 206 |
# ?????????????????°???????????????????¨??????????????????°??????
while 1:
# ?¨??????\???????????°???????????????
input_num = list(input())
# ???????????????"0"??\?????§??????
if int(input_num[0]) == 0:
break
# print(input_num)
# ??????????¨?????????????????????°
digitTotal = 0
for i in range(0, len(input_num)):
digitTotal += int(input_num[i])
print("{0}".format(digitTotal))
|
import bisect,collections,copy,itertools,math,string
import sys
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())
def main():
n = I()
a = LI()
dic = collections.Counter(a)
als = 0
exl = [0 for _ in range(n+1)]
for key, value in dic.items():
if value >= 3:
choice = (value)*(value-1)//2
choice1 = (value-1)*(value-2)//2
als += choice
exl[key] = choice1 - choice
elif value == 2:
choice = (value)*(value-1)//2
als += choice
exl[key] = -choice
for ball in a:
choices = als + exl[ball]
print(choices)
main()
| 0 | null | 24,747,337,072,098 | 62 | 192 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.