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
|
|---|---|---|---|---|---|---|
import numpy as np
from numba import njit, prange
#'''
N, K = map(int, input().split())
As = list(map(int, input().split()))
'''
N = 200000
K = 100000
As = [0] * N
#'''
@njit("i8[:](i8[:],)", cache = True)
def update(A_array):
before_csum = np.zeros(N+1, np.int64)
for i, A in enumerate(A_array[:N]):
before_csum[max(0, i-A)] += 1
before_csum[min(N, i+A+1)] -= 1
return np.cumsum(before_csum)
A_array = np.array(As + [0], dtype = np.int64)
for k in range(min(K, 50)):
A_array = update(A_array)
print(*A_array.tolist()[:N])
|
import math
from itertools import accumulate
n, k = map(int, input().split())
As = list(map(int, input().split()))
for i in range(min(41, k)):
_As = [0]*(n+1)
for j in range(n):
l = max(0, j - As[j])
r = min(n - 1, j + As[j])
_As[l] += 1
_As[r+1] -= 1
As = list(accumulate(_As))[:-1]
print(' '.join([str(A) for A in As]))
| 1 | 15,462,565,369,640 | null | 132 | 132 |
n, k = (int(i) for i in input().split())
used = [0 for i in range(n)]
for i in range(k):
val = int(input())
a = [int(j) for j in input().split()]
for aa in a:
used[aa - 1] = 1
cnt = 0
for i in used:
cnt += i == 0
print(cnt)
|
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,632,215,748,170 | null | 154 | 154 |
import itertools
import math
import fractions
import functools
s, w = map(int, input().split())
if w >= s :print("unsafe")
else: print("safe")
|
import itertools
import math
s, w = map(int, input().split())
if s <= w:
print("unsafe")
else:
print("safe")
| 1 | 29,000,023,849,180 | null | 163 | 163 |
a = int(input())
print(a*(1+a*(1+a)))
|
W,H,x,y,r = map(int, input().split())
if W < (x+r) or H < (y + r) or 0 > (x-r) or 0 > (y-r) :
print("No")
else :
print("Yes")
| 0 | null | 5,359,376,250,908 | 115 | 41 |
num = int(input())
def num2alpha(num):
if num<=26:
return chr(96+num)
elif num%26==0:
return num2alpha(num//26-1)+chr(122)
else:
return num2alpha(num//26)+chr(96+num%26)
print(num2alpha(num))
|
x = int(input())
def score(x):
if 400 <= x <= 599:
print("8")
elif 600 <= x <= 799:
print("7")
elif 800 <= x <= 999:
print("6")
elif 1000 <= x <= 1199:
print("5")
elif 1200 <= x <= 1399:
print("4")
elif 1400 <= x <= 1599:
print("3")
elif 1600 <= x <= 1799:
print("2")
elif 1800 <= x <= 1999:
print("1")
score(x)
| 0 | null | 9,309,157,273,768 | 121 | 100 |
suit = ['S','H','C','D']
num = range(0, 13)
deck = {'S':[0]*13, 'H':[0]*13, 'C':[0]*13, 'D':[0]*13}
n = input()
for i in range(0, n):
a, b = raw_input().split(" ")
deck[a][int(b)-1] = 1
for i in suit:
for j in num:
if (deck[i][j] == 0):
print("%s %d" % (i, j+1))
|
import sys
ris=lambda:map(int,next(sys.stdin).split())
N,M,K=ris()
adj=[set() for _ in range(N)]
for _ in range(M):
A,B=ris()
A,B=A-1,B-1
adj[A].add(B)
adj[B].add(A)
colors=[-1]*N
ct={}
color=-1
for u in range(N):
if colors[u]!=-1:
continue
color+=1
colors[u]=color
stk=[u]
while stk:
u=stk.pop()
ct[color]=ct.get(color,0)+1
for v in adj[u]:
if colors[v]==-1:
colors[v]=color
stk.append(v)
blk=[{*()} for _ in range(N)]
for _ in range(K):
A,B=ris()
A,B=A-1,B-1
if colors[A]==colors[B]:
blk[A].add(B)
blk[B].add(A)
ans=[0]*N
for u in range(N):
c=colors[u]
g=len(adj[u])
b=len(blk[u])
k=ct[c]-1-g-b
ans[u]=k
print(*ans)
| 0 | null | 31,491,524,002,948 | 54 | 209 |
s = input()
l = len(s)
ans = 'x' * l
print(ans)
|
# coding: utf-8
s = input()
ans = "x" * len(s)
print(ans)
| 1 | 73,050,013,520,750 | null | 221 | 221 |
from collections import deque
def BFS(N,M,List):
Graph = [[] for T in range(N+1)]
for NodeM in range(0,M):
Graph[List[NodeM][0]].append(List[NodeM][1])
Graph[List[NodeM][1]].append(List[NodeM][0])
Distance = [-1]*(N+1)
Distance[0] = 0
Distance[1] = 0
From = [0]*(N+1)
From[1] = 1
Deque = deque()
Deque.append(1)
while Deque:
V = Deque.popleft()
for NodeV in Graph[V]:
if Distance[NodeV]==-1:
Distance[NodeV] = Distance[V]+1
Deque.append(NodeV)
From[NodeV] = V
return Distance[1:],From[1:]
N,M = (int(X) for X in input().split())
List = [[] for T in range(0,M)]
for T in range(0,M):
List[T] = [int(X) for X in input().split()]
Distance,From = BFS(N,M,List)
print('\n'.join(['Yes']+[str(X) for X in From[1:]]))
|
X, N = map(int, input().split())
if N>0:
p = [int(i) for i in input().split()]
else:
p = [-1]
p = sorted(p)
#print(p)
try:
idx=p.index(X)
flag=False
for i in range(X+1):
for o in [-1,+1]:
if idx+(i*o) < 0 or idx + (i*o) >= N:
print(X+(i*o))
flag=True
break
elif X+(i*o)!=p[idx+(i*o)]:
print(X+(i*o))
flag=True
break
if flag:
break
except:
print(X)
| 0 | null | 17,162,486,164,230 | 145 | 128 |
n=int(input())
A=list(map(int, input().split()))
count=0
num=1
for i in range(n):
if A[i] == num:
count += 1
num += 1
if count == 0:
print('-1')
exit()
print(n-count)
|
N = int(input())
a = list(map(int,input().split()))
b = N
num = 1
for i in range(N):
if a[i] == num:
num += 1
b -= 1
if b == N:
print(-1)
else:
print(b)
| 1 | 114,757,060,961,060 | null | 257 | 257 |
def W(d):
#d[i][j]: iからjへの最短距離
for k in range(n):
for i in range(n):
for j in range(n):
d[i][j] = min(d[i][j],d[i][k] + d[k][j])
return d
##############################
n,w,l= map(int,input().split()) #n:頂点数 w:辺の数
d = [[10**14]*n for i in range(n)]
#d[u][v] : 辺uvのコスト(存在しないときはinf)
for i in range(w):
x,y,z = map(int,input().split())
if z>l:
continue
x=x-1
y=y-1
d[x][y] = z
d[y][x] = z
for i in range(n):
d[i][i] = 0 #自身のところに行くコストは０
D=W(d)
G=[[10**4]*n for i in range(n)]
for i in range(n):
for j in range(n):
if D[i][j]>l:
continue
G[i][j]=1
WW=W(G)
for i in range(int(input())):
a,b=map(int,input().split())
a=a-1
b=b-1
if WW[a][b]>=10**4:
print(-1)
else:
print(WW[a][b]-1)
|
from collections import defaultdict
N, M = map(int, input().split())
heights = list(map(int, input().split()))
d = defaultdict(list)
for i in range(M):
A, B = map(int, input().split())
d[A].append(B)
d[B].append(A)
ans_cnt = 0
for i in range(1, N + 1):
if d[i] == []:
ans_cnt += 1
else:
my_height = heights[i - 1]
flag = True
for j in d[i]:
if heights[j - 1] >= my_height:
flag = False
break
if flag:
ans_cnt += 1
print(ans_cnt)
| 0 | null | 98,945,031,011,570 | 295 | 155 |
from collections import Counter, defaultdict, deque
import bisect
from sys import stdin, stdout
from itertools import repeat
import math
import random
# sys.stdin = open('input')
def inp():
re = map(int, raw_input().split())
if len(re) == 1:
return re[0]
return re
def inst():
return raw_input().strip()
def gcd(x, y):
while(y):
x, y = y, x % y
return x
def my_main():
n, k, c = inp()
st = inst()
front, end = [], []
def get(now, ans):
while now < n:
if len(ans) == k:
return
for i in range(now, n):
if st[i]=='o':
ans.append(i+1)
now = i+c+1
break
else:
break
get(0, front)
st = st[::-1]
get(0, end)
for i in range(len(end)):
end[i] = n-end[i]+1
end.sort()
if len(front)!=k or len(end)!=k:
return
ans = []
# print front, end
for i in range(k):
if front[i] == end[i]:
ans.append(front[i])
if ans:
print '\n'.join(map(str, ans))
my_main()
|
X = int(input())
happy = 0
happy += X // 500 * 1000
X = X % 500
happy += X //5 * 5
print(happy)
| 0 | null | 41,811,677,609,872 | 182 | 185 |
def fib(n):
x=[1,1]
for i in range(n+1):
y=x[i]+x[i+1]
x.append(y)
print(x[n])
a=int(input())
fib(a)
|
l=raw_input()
k=l.split()
H=int(k[0])
W=int(k[1])
while True:
if H+W==0:
break
else:
for i in range(H):
print "#"*W
print ""
l=raw_input()
k=l.split()
H=int(k[0])
W=int(k[1])
| 0 | null | 378,152,526,852 | 7 | 49 |
N = int(input())
pos = []
for _ in range(N):
x, l = map(int,input().split())
pos.append((x+l, x-l))
pos.sort()
ans = 0
cur = float('-inf')
for i in range(N):
if cur <= pos[i][1]:
ans += 1
cur = pos[i][0]
print(ans)
|
n=int(input())
import bisect
L=[]
for i in range(n):
x,l=map(int,input().split())
a=x-l+0.1
b=x+l-0.1
L.append((b,a))
L=sorted(L)
rob=1
bottom=L[0][0]
for i in range(1,n):
if L[i][1]>bottom:
rob += 1
bottom=L[i][0]
print(rob)
| 1 | 89,735,181,400,640 | null | 237 | 237 |
N, M = map(int, input().split())
if N & 1:
for m in range(1, M+1):
print(m, N-m)
exit()
n1, n2 = N//2, N//2
cnt = 0
for n in range(N//2):
if n+1 >= N//2-n:
break
print(n+1, N//2-n)
cnt += 1
if cnt == M:
exit()
for n in range(N//2):
if n+1 >= N//2-n-1:
break
print(n+1+N//2, N-n-1)
cnt += 1
if cnt == M:
exit()
|
N, M = map(int, input().split())
if N % 2 == 1:
for a in range(1, M + 1):
print(a, N - a + 1)
else:
for a in range(1, M + 1):
if a < -(-M // 2) + 1:
print(a, N - a + 1)
else:
print(a, N - a)
| 1 | 28,544,027,225,142 | null | 162 | 162 |
def main():
N, M = (int(i) for i in input().split())
from math import gcd
def lcm(x, y):
return x*y//gcd(x, y)
def prime_factorize(n):
res = {2: 0}
for i in range(2, 3):
if i*i > n:
break
if n % i != 0:
continue
ex = 0
while n % i == 0:
ex += 1
n //= i
res[i] = ex
if n != 1:
res[n] = 1
return res
B = [int(i)//2 for i in input().split()]
c = set()
L = 1
for b in B:
L = lcm(L, b)
c.add(prime_factorize(b)[2])
if len(c) != 1:
print(0)
else:
ans = 0
i = 1
while L*i <= M:
ans += 1
i += 2
print(ans)
if __name__ == '__main__':
main()
|
N = int(input())
S, T = map(str,input().split())
ST = ''
for i in range(N):
ST = ST + S[i] + T[i]
print(ST)
| 0 | null | 106,636,806,397,320 | 247 | 255 |
from collections import deque
u = int(input())
g = [[i for i in map(int, input().split())] for _ in range(u)]
graph = [[] for _ in range(u)]
ans = [-1] * u
for i in range(u):
for j in range(g[i][1]):
graph[i].append(g[i][2 + j] - 1)
que = deque()
que.append(0)
ans[0] = 0
while que:
v = que.popleft()
for nv in graph[v]:
if ans[nv] != -1:
continue
ans[nv] = ans[v] + 1
que.append(nv)
for i in range(u):
print(i+1, ans[i])
|
def solver(S,T):
counter = 0
for i in range(len(S)):
Si = S[i]
Ti = T[i]
if Si != Ti:
counter += 1
return counter
S = input()
T = input()
print(solver(S,T))
| 0 | null | 5,231,449,038,042 | 9 | 116 |
h, w, k = map(int, input().split())
s = [list(input()) for _ in range(h)]
# 2次元累積和
acum = [[0]*(w+1) for _ in range(h+1)]
for i in range(h):
for j in range(w):
acum[i+1][j+1] = acum[i][j+1] + acum[i+1][j] - acum[i][j] + int(s[i][j])
#print(acum)
def white_choco_count(x1, y1, x2, y2):
return acum[y2][x2] - acum[y2][x1] - acum[y1][x2] + acum[y1][x1]
ans = float("inf")
for rows in range(2**(h-1)):
count = 0
hlist = []
for i in range(h-1):
if rows >> i & 1 == 1:
count += 1 # 横線の数カウントしておく
hlist.append(i+1)
hlist.append(h)
#print(hlist)
x1 = 0
for x2 in range(w):
y1 = 0
for y2 in hlist:
if white_choco_count(x1, y1, x2, y2) > k:
count += float("inf")
# kを超えてはいけないが、一個右で縦に割るとｋを超える必要がある（貪欲にやるので）
elif white_choco_count(x1, y1, x2, y2) <= k < white_choco_count(x1, y1, x2+1, y2):
count += 1
# 次のブロックにいくのでx1更新(ただしy1の更新はx2がｗまでおわったあとにしたいのでbreak使うとうまくいく）
x1 = x2
break
y1 = y2
# ここまでで、x2=0, 1, ..., w-1 までみたが、x2 = wのとき（ブロックの右端）を見てない
y1 = 0
for y2 in hlist:
if white_choco_count(x1, y1, w, y2) > k:
count += float("inf")
y1 = y2
#print(count)
ans = min(ans, count)
print(ans)
|
# -*- coding: utf-8 -*-
import math
class KochCurve(object):
x = 0.0
y = 0.0
# ?§£???
def koch(self, n, a, b):
if n == 0:
return
s = KochCurve()
t = KochCurve()
u = KochCurve()
th = math.pi * 60.0 / 180.0
s.x = (2.0 * a.x + 1.0 * b.x) / 3.0
s.y = (2.0 * a.y + 1.0 * b.y) / 3.0
t.x = (1.0 * a.x + 2.0 * b.x) / 3.0
t.y = (1.0 * a.y + 2.0 * b.y) / 3.0
u.x = (t.x - s.x) * math.cos(th) - (t.y - s.y) * math.sin(th) + s.x
u.y = (t.x - s.x) * math.sin(th) + (t.y - s.y) * math.cos(th) + s.y
KochCurve().koch(n - 1, a, s)
msg = "%.8f %.8f" % (s.x, s.y)
print(msg)
KochCurve().koch(n - 1, s, u)
msg = "%.8f %.8f" % (u.x, u.y)
print(msg)
KochCurve().koch(n - 1, u, t)
msg = "%.8f %.8f" % (t.x, t.y)
print(msg)
KochCurve().koch(n - 1, t, b)
if __name__ == '__main__':
a = KochCurve()
b = KochCurve()
n = int(input())
a.x = 0
a.y = 0
b.x = 100
b.y = 0
msg = "%.8f %.8f" % (a.x, a.y)
print(msg)
KochCurve().koch(n, a, b)
msg = "%.8f %.8f" % (b.x, b.y)
print(msg)
| 0 | null | 24,431,345,102,658 | 193 | 27 |
H, W = map(int, input().split())
s = [list(input()) for _ in range(H)]
dp = [[float('inf')]* W for _ in range(H)]
if s[0][0]=='#':
dp[0][0]=1
else:
dp[0][0]=0
for c in range(W):
for r in range(H):
if r > 0:
count=0
if s[r-1][c]=='.' and s[r][c]=='#':
count = 1
dp[r][c] = min(dp[r][c], dp[r-1][c]+count)
if c > 0:
count=0
if s[r][c-1]=='.' and s[r][c]=='#':
count = 1
dp[r][c] = min(dp[r][c], dp[r][c-1]+count)
print(dp[H-1][W-1])
|
H, W = map(int, input().split())
S = []
for _ in range(H):
S.append([c for c in input()])
cnts = [[0 for _ in range(W)] for _ in range(H)]
if S[0][0] == "#":
cnts[0][0] = 1
for h in range(H):
for w in range(W):
if h == 0 and w == 0:
continue
c1, c2 = float('inf'), float('inf')
if 0 <= h - 1:
c1 = cnts[h - 1][w]
if S[h][w] == "#" and S[h - 1][w] == ".":
c1 += 1
if 0 <= w - 1:
c2 = cnts[h][w - 1]
if S[h][w] == "#" and S[h][w - 1] == ".":
c2 += 1
cnts[h][w] = min(c1, c2)
print(cnts[H-1][W-1])
| 1 | 49,099,138,919,608 | null | 194 | 194 |
from math import pi
r=input()
print"%.8f %.8f"%(pi*r*r,2*pi*r)
|
p = input() * 2
s = input()
print('Yes' if s in p else 'No')
| 0 | null | 1,181,488,609,180 | 46 | 64 |
N = int(raw_input())
A = map(int, raw_input().split())
i = 0
flag = 1
while flag:
flag = 0
for j in range(N-1, 0, -1):
if A[j] < A[j-1]:
A_j = A[j]
A[j] = A[j-1]
A[j-1] = A_j
flag = 1
i += 1
print " ".join(map(str, A))
print i
|
N = int(input())
A = [int(i) for i in input().split()]
cnt = 0
for i in range(0, N):
for j in range(i+1, N)[::-1]:
if A[j] < A[j-1]:
A[j], A[j-1] = A[j-1], A[j]
cnt = cnt + 1
print(' '.join([str(item) for item in A]))
print(cnt)
| 1 | 15,603,505,188 | null | 14 | 14 |
from typing import List
from collections import deque
def bfs(G: List[int], s: int) -> None:
d[s] = 0
color[s] = "GRAY"
Q = deque()
Q.append(s)
while Q:
u = Q.popleft()
for v in G[u]:
if color[v] == "WHITE":
color[v] = "GRAY"
d[v] = d[u] + 1
pi[v] = u
Q.append(v)
color[u] = "BLACK"
if __name__ == "__main__":
n = int(input())
G = [[] for _ in range(n)]
for _ in range(n):
u, k, *adj = list(map(int, input().split()))
u -= 1
G[u] = [v - 1 for v in adj]
color = ["WHITE" for _ in range(n)]
d = [-1 for _ in range(n)]
pi = [None for _ in range(n)]
bfs(G, 0)
for i in range(n):
print(f"{i + 1} {d[i]}")
|
d,t,s=map(int, input().split())
if d/s <=t:
print("Yes")
else:print("No")
| 0 | null | 1,791,853,140,770 | 9 | 81 |
import math
def koch(d, p1, p2):
if d == 0:
return
v = [p2[0] - p1[0], p2[1] - p1[1]]
s = [p1[0] + v[0] / 3, p1[1] + v[1] / 3]
t = [p1[0] + 2 * v[0] / 3, p1[1] + 2 * v[1] / 3]
u = [p1[0] + v[0] / 2 - v[1] * math.sqrt(3) / 6, p1[1] + v[1] / 2 + v[0] * math.sqrt(3) / 6]
koch(d - 1, p1, s)
print(" ".join(map(str, s)))
koch(d - 1, s, u)
print(" ".join(map(str, u)))
koch(d - 1, u, t)
print(" ".join(map(str, t)))
koch(d - 1, t, p2)
n = int(input())
print("0 0")
koch(n, [0, 0], [100, 0])
print("100 0")
|
A,B,C,K=map(int, input().split())
if A >= K:
ans = K
elif A+B >= K:
ans = A
else:
ans = A - (K-A-B)
print(ans)
| 0 | null | 10,985,561,674,240 | 27 | 148 |
N=int(input())
S=str(input())
flg = True
if len(S)%2 != 0:
print("No")
else:
for i in range(len(S)//2):
if S[i] != S[i+len(S)//2]:
print("No")
flg = False
if flg == True:
print("Yes")
|
def main():
N = int(input())
S = input()
cond = S[:N // 2] == S[N // 2:]
print('Yes' if cond else 'No')
if __name__ == '__main__':
main()
| 1 | 146,883,878,770,790 | null | 279 | 279 |
n = int(raw_input())
a = map(int, raw_input().split())
count = 0
def merge(A, left, mid, right):
n1 = mid - left
n2 = right - mid
L = [0 for i in range(n1+1)]
R = [0 for i in range(n2+1)]
for i in range(n1):
L[i] = A[left + i]
for i in range(n2):
R[i] = A[mid + i]
L[n1] = 10**9 + 1
R[n2] = 10**9 + 2
i = 0
j = 0
for k in range(left, right):
global count
count += 1
if L[i] <= R[j]:
A[k] = L[i]
i += 1
else:
A[k] = R[j]
j += 1
def mergeSort(A, left, right):
if left + 1 < right:
mid = int((left + right) /2)
mergeSort(A, left, mid)
mergeSort(A, mid, right)
merge(A, left, mid, right)
mergeSort(a, 0, n)
print ' '.join(map(str, a))
print count
|
N=int(input())
S=set()
for i in range(1,N):
x=i
y=N-i
if x<y:
S.add(x)
print(len(S))
| 0 | null | 76,468,860,040,512 | 26 | 283 |
from collections import defaultdict
from itertools import product
H, W, K = map(int, input().split())
S = [input() for _ in range(H)]
C = [[int(s[i]) for s in S] for i in range(W)]#列を一括りにする
total = sum(sum(c) for c in C)#すべての値の合計を算出
if total <= K:
answer = 0
else:
answer = H * W
for X in product([False, True], repeat=H-1):#Hは行数
#あるXについて一回目のfor文が回る
ans = sum(X)#Trueの数を換算
if ans > answer:
continue
M = [[0]]
for i, x in enumerate(X):
if x:#Trueなら実行
M.append([])#Trueの数の配列が作成される
M[-1].append(i+1)#一番最後にその番目をappendする
D = [0] * len(M)#初期値を設定
for c in C:
for k, m in enumerate(M):
D[k] += sum(c[i] for i in m)#k番目の要素に足していく
#Dにどんどん代入することによってどの列まで足すことができるか算出することができる
if any(d > K for d in D):#一つでもKを超えていたら
ans += 1
if ans > answer:
break
D = [sum(c[i] for i in m) for m in M]#Dの更新(1番最初のDに戻る)
if any(d > K for d in D):#一つでもKを超えていたら
ans = answer + 1#ansの更新
break
answer = min(answer, ans)
print(answer)
|
import math
r = float(input())
areaOfCircle = format(r * r * math.pi, '.6f')
circumference = format(2 * r * math.pi,'.6f')
print("{0} {1}".format(areaOfCircle, circumference))
| 0 | null | 24,724,272,326,450 | 193 | 46 |
# input here
_INPUT = """\
5 3
1 2
3 4
5 1
"""
"""
K = int(input())
H, W, K = map(int, input().split())
a = list(map(int, input().split()))
xy = [list(map(int, input().split())) for i in range(N)]
p = tuple(map(int,input().split()))
"""
class UnionFind():
def __init__(self, n):
self.n = 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
def size(self, x):
return -self.parents[self.find(x)]
def main():
n, m = map(int, input().split())
xy = [list(map(int, input().split())) for i in range(m)]
uf = UnionFind(n)
for i in range(len(xy)):
uf.union(xy[i][0]-1,xy[i][1]-1)
print(-(min(uf.parents)))
if __name__ == '__main__':
import io
import sys
import math
import itertools
from collections import deque
# sys.stdin = io.StringIO(_INPUT)
main()
|
n, m = map(int, input().split())
class UnionFind:
def __init__(self, n):
self.pare = [-1] * n
self.size = [1] * n
def root(self, x):
if self.pare[x] < 0:
return x
r = self.root(self.pare[x])
self.pare[x] = r
return r
def unite(self, x, y):
rx = self.root(x)
ry = self.root(y)
if rx == ry:
return
self.pare[rx] = ry
self.size[ry] += self.size[rx]
return
uf = UnionFind(n)
for i in range(m):
a, b = map(int, input().split())
a -= 1
b -= 1
uf.unite(a, b)
print(max(uf.size))
| 1 | 3,995,621,497,850 | null | 84 | 84 |
n=int(input())
s=input()
r=s.count('R')
g=s.count('G')
b=s.count('B')
ans=r*g*b
for i in range(len(s)):
for j in range(i+1,len(s)):
if s[i]!=s[j]:
k=j+j-i
if k>=len(s):
break
else:
if s[i]!=s[k] and s[j]!=s[k]:
ans-=1
print(ans)
|
s = input()
if "A" in s:
if "B" in s:
print("Yes")
else:
print("No")
else:
print("No")
| 0 | null | 45,381,639,281,252 | 175 | 201 |
a=list(map(int,input().split()))
if sum(a)>=22:
print("bust")
elif sum(a)<=21:
print("win")
|
#import numpy as np
import sys, math
from itertools import permutations, combinations
from collections import defaultdict, Counter, deque
from math import factorial#, gcd
from bisect import bisect_left, bisect_right #bisect_left(list, value)
sys.setrecursionlimit(10**7)
enu = enumerate
MOD = 10**9+7
def input(): return sys.stdin.readline()[:-1]
pl = lambda x: print(*x, sep='\n')
N = int(input())
A = list(map(int, input().split()))
A.sort()
C = Counter(A)
S = set(A)
maxA = A[-1]
chk = [0] * (maxA+1)
for s in S:
for i in range(s, maxA+1, s):
chk[i] += 1
res = [s for s in S if chk[s] == 1 and C[s] == 1]
# print(res)
print(len(res))
| 0 | null | 66,549,752,602,620 | 260 | 129 |
import itertools
import math
N = int(input())
L = [list(map(int,input().split())) for n in range(N)]
I = list(itertools.permutations(L))
sum = 0
for i in I:
for n in range(N-1):
sum += math.sqrt((i[n+1][0]-i[n][0])**2+(i[n+1][1]-i[n][1])**2)
print(sum/len(I))
|
import sys
import math
import itertools
import collections
sys.setrecursionlimit(1000000)
MOD = 10 ** 9 + 7
input = lambda: sys.stdin.readline().strip()
NI = lambda: int(input())
NMI = lambda: map(int, input().split())
NLI = lambda: list(NMI())
SI = lambda: input()
def main():
N = NI()
xy = [NLI() for _ in range(N)]
ls = [p for p in range(N)]
p_list = list(itertools.permutations(ls))
full_course = ["" for _ in range(len(p_list))]
for k in range(len(p_list)):
distance = 0
for l in range(N-1):
departure = p_list[k][l]
goal = p_list[k][l+1]
Xd = xy[departure][0]
Yd = xy[departure][1]
Xg = xy[goal][0]
Yg = xy[goal][1]
distance += ((Xd-Xg)**2 + (Yd-Yg)**2)**(1/2)
full_course[k] = distance
print(sum(full_course)/len(p_list))
if __name__ == '__main__':
main()
| 1 | 148,366,920,475,668 | null | 280 | 280 |
print("Yes") if int(input()) % 9 == 0 else print("No")
|
n = input()
ls = list(n)
wa = 0
for i in range(len(ls)):
wa += int(ls[i])
print('Yes') if wa % 9 == 0 else print('No')
| 1 | 4,386,540,218,860 | null | 87 | 87 |
import sys
N,X,Y = map(int, input().split())
d = [0]*(N-1)
for i in range(N-1):
for j in range(i+1,N):
d[min(j-i,abs((X-1)-i)+1+abs((Y-1)-j))-1] += 1
#print(i,j,min(j-i,abs((X-1)-i)+1+abs((Y-1)-j))-1)
for i in range(len(d)):
print(d[i])
|
n,x,y = map(int, input().split())
lis = [0] * n
x -= 1
y -= 1
for i in range(n):
for j in range(i+1, n):
t = min(abs(i-j), abs(i-x)+abs(j-y)+1,abs(i-y)+abs(j-x)+1)
lis[t] += 1
for i in range(1,n):
print(lis[i])
| 1 | 44,074,052,395,240 | null | 187 | 187 |
M = 10**9 + 7
n,a,b = map(int, input().split())
def modinv(n):
return pow(n, M-2, M)
def comb(n, r):
num = denom = 1
for i in range(1,r+1):
num = (num*(n+1-i))%M
denom = (denom*i)%M
return num * modinv(denom) % M
print((pow(2, n, M) - comb(n, a) - comb(n, b) - 1) % M)
|
n, a, b = map(int, input().split())
mod = 10 ** 9 + 7
#n種類の花を使って、花束を作る組み合わせは2^n-1通り
#pow(x,y,mod) : (x**y) % mod
ans = pow(2, n, mod)-1
#nCa
nCa = 1
#分子:n*(n-1)*...*(n-a+1)
for i in range(n-a+1, n+1):
nCa *= i
nCa %= mod
#分母:1/a! = 1/(1*2*...*a) = 1^(p-2)*2^(p-2)*,,,*a^(p-2)
for i in range(1, a+1):
nCa *= pow(i, mod-2, mod)
nCa %= mod
#nCb
nCb = 1
for i in range(n-b+1, n+1):
nCb *= i
nCb %= mod
for i in range(1, b+1):
nCb *= pow(i, mod-2, mod)
nCb %= mod
#2^n-1通りからnCaとnCbを引く
ans -= (nCa + nCb)
ans %= mod
print(ans)
| 1 | 66,004,116,289,848 | null | 214 | 214 |
import sys
H, W, K = map(int, sys.stdin.readline().rstrip().split())
grid = [list(sys.stdin.readline().rstrip()) for _ in range(H)]
ans = [[-1] * W for _ in range(H)]
color = 0
for h in range(H):
flag = False
color += 1
for w in range(W):
if grid[h][w] == "#":
if not flag:
flag = True
else:
color += 1
ans[h][w] = color
if not flag:
for w in range(W):
ans[h][w] = -1
color -= 1
for w in range(W):
idx = []
color = -1
for h in range(H):
if ans[h][w] == -1:
if color != -1:
ans[h][w] = color
else:
idx.append(h)
else:
color = ans[h][w]
if idx:
for i in idx:
ans[i][w] = color
idx = []
for a in ans:
print(" ".join(map(str, a)))
|
h, w, k = map(int, input().split())
s = [input() for _ in range(h)]
a = [[0]*w for _ in range(h)]
cnt = 1
later = []
for i in range(h):
if '#' not in s[i]: continue
later.append(i)
fst = True
for j in range(w):
if not fst and s[i][j] == '#':
cnt += 1
if fst and s[i][j] == '#':
fst = False
a[i][j] = cnt
cnt += 1
for i in later:
if i >= h-1: continue
if a[i+1][0] != 0: continue
for j in range(w):
k = i
while k < h-1:
if a[k+1][j] == 0:
a[k+1][j] = a[k][j]
k += 1
else:
break
if later[0] != 0:
for i in range(later[0], 0, -1):
for j in range(w):
a[i-1][j] = a[i][j]
for ans in a:
print(*ans)
| 1 | 142,957,084,828,028 | null | 277 | 277 |
while True:
m,f,r=map(int,input().split())
p=m+f
if m+f+r==-3:
break
if m==-1 or f==-1:
print("F")
elif p>=80:
print("A")
elif 65<=p and p<80:
print("B")
elif 50<=p and p<65:
print("C")
elif 30<=p and p<50:
if r>=50:
print("C")
else:
print("D")
else:
print("F")
|
n=int(input())
m=10**9+7
print((pow(10,n,m)-pow(9,n,m)*2+pow(8,n,m))%m if n!=1 else 0)
| 0 | null | 2,179,023,064,100 | 57 | 78 |
#!/usr/bin/env python3
N = int(input().split()[0])
xlt_list = []
for _ in range(N):
x, l = list(map(int, input().split()))
xlt_list.append((x, l, x + l))
xlt_list = sorted(xlt_list, key=lambda x: x[2])
count = 0
before_t = -float("inf")
for i, xlt in enumerate(xlt_list):
x, l, t = xlt
if x - l >= before_t:
count += 1
before_t = t
ans = count
print(ans)
|
N, K = list(map(int, input().rstrip().split()))
r = 0
while 0 < N:
r += 1
N = int(N / K)
print(r)
| 0 | null | 76,911,328,427,300 | 237 | 212 |
ST = list(map(str, input().split()))
print(ST[1]+ST[0])
|
n,a,b = map(int,input().split())
if a == 0:
print(0)
elif a+b <= n and n%(a+b) < a:
print((n//(a+b))*a + n%(a+b))
elif a+b <= n and n%(a+b) >= a:
print((n//(a+b))*a + a)
elif n < a+b and n < a:
print(n)
elif n < a+b and a <= n:
print(a)
| 0 | null | 79,233,208,003,338 | 248 | 202 |
N,K = map(int,input().split())
tmp = 1
for i in range(1,40):
if N >= K**i:
tmp = i+1
else:
print(tmp)
break
|
import numpy as np
H, W, K = map(int, input().split())
s = np.zeros((H, W), dtype=int)
num = 1
for i in range(H):
_s = input()
for j in range(W):
if _s[j] == '#':
s[i,j] = num
num += 1
else:
s[i,j] = 0
flg = False
for i in range(H):
if all(s[i,:] == 0):
if flg:
s[i,:] = s[i-1,:]
else:
flg = True
prej = 0
for j in range(W):
if s[i, j] != 0:
num = s[i, j]
s[i, prej:j] = num
prej = j+1
else:
s[i, prej:] = num
for i in range(H-1, -1, -1):
if all(s[i,:] == 0):
s[i,:] = s[i+1,:]
for i in range(H):
ans = ''
for j in range(W):
ans += str(s[i, j]) + ' '
print(ans)
| 0 | null | 104,068,757,455,040 | 212 | 277 |
N,M = map(int,input().split())
A = list(map(int,input().split()))
A.sort()
MAX = 10**10 + 10
# Ai+Ajを列挙して大きいほうからM番目となるスコアSを求める
# その後S以上となるスコアを加算して合計値を求める
from bisect import bisect_left
def judge(x,key):
# スコアx以上となるのがkey個以上あるか？
num = 0
for i in range(N):
eidx = bisect_left(A,x-A[i])
num += N-eidx
if num >= key:
return True
else:
return False
def meguru(key):
ok = -1
ng = MAX
while (abs(ok-ng)>1):
mid = (ok+ng)//2
if judge(mid,key):
ok = mid
else:
ng = mid
return ok
D = meguru(M)
ans = 0
ruisekiwa = [0]*(N+1)
for i in range(N):
ruisekiwa[i+1] = ruisekiwa[i] + A[i]
num = 0
for i in range(N):
eidx = bisect_left(A,D+0.5-A[i])
ans += A[i] * (N-eidx)
ans += ruisekiwa[N] - ruisekiwa[eidx]
num += N-eidx
if num<M:
ans += (M-num)*D
print(ans)
|
a=int(input())
b,c=map(int,input().split())
x=(b//a)*a
if b<=x<=c:
print("OK")
elif b<=x+a<=c:
print("OK")
else:
print("NG")
| 0 | null | 67,099,612,514,440 | 252 | 158 |
# coding: utf-8
# Your code here!
while(1):
H,W=map(int,input().split(" "))
if H==0 and W==0:
break
else:
for i in range(H):
for j in range(W):
print("#",end="")
print("")
print("")
|
N,K=map(int,input().split())
MOD=int(1e9)+7
dp=[0]*(K+1)
for i in range(K):
j=K-i
dp[j]+=pow(K//j, N, MOD)
k=2*j
while k<=K:
dp[j]=(dp[j]-dp[k]+MOD) % MOD
k+=j
ans=0
for i in range(1,K+1):
ans+=dp[i]*i
ans%=MOD
print(ans)
| 0 | null | 18,894,289,192,048 | 49 | 176 |
import copy
import itertools
h, w, k = map(int, input().split())
#s= list(input())
s = []
min = 100000
for i in range(h):
s.append( [int(s) for s in list(input())])
#s.append([1]*w)
dbg_cnt = 0
l = list(range(h-1))
for i in range(h):
p = list(itertools.combinations(l, i))
for j in p:
tmp = list(j)
tmps = []
q = 0
tmps.append([])
#print(dbg_cnt)
#dbg_cnt += 1
for r in range(h):
tmps[q].append(copy.copy(s[r]))
if(q < len(tmp) and r==tmp[q]):
tmps.append([])
q += 1
#print(tmps)
count = i
sums = [0] * len(tmps)
precut = 1
exitflg = 0
for r in range(w): #550000
for q in range(len(tmps)):
for t in tmps[q]:
sums[q] += t[r] #5500000
cutflg = 0
for q in range(len(tmps)):
if sums[q] > k : #5500000
cutflg = 1
if cutflg == 1:
#print('cut')
count += 1
sums = [0] * len(tmps)
for q in range(len(tmps)):
for t in tmps[q]:
sums[q] += t[r] #5500000
for q in range(len(tmps)): #5500000
if sums[q] > k :
exitflg = 1
#print('exit')
#print(exitflg)
if exitflg == 0:
if min > count:
min = count
print(min)
|
S = input()
T = input()
for i in range(ord('a'), ord('z') + 1):
if T == S + chr(i):
print("Yes")
break
else:
print("No")
| 0 | null | 34,979,207,889,730 | 193 | 147 |
n = int(input())
c0, c1, c2, c3 = 0, 0, 0, 0
for i in range(n):
s = input()
if s == 'AC':
c0 += 1
elif s == 'WA':
c1 += 1
elif s == 'TLE':
c2 += 1
else:
c3 += 1
print('AC x',c0)
print('WA x',c1)
print('TLE x',c2)
print('RE x',c3)
|
N, K = map(int, input().split())
A = [int(a) for a in input().split()]
print(len([a for a in A if a >= K]))
| 0 | null | 94,225,786,653,248 | 109 | 298 |
n = int(input())
lst = list(map(int,input().split()))
lst2 = [0 for i in range(n)]
for i in range(n - 1):
x = lst[i]
lst2[x - 1] = lst2[x - 1] + 1
for i in range(n):
print(lst2[i])
|
n = int(input())
a = map(int,input().split())
lst = [0]*(n+1)
for i in a:
lst[i] += 1
for i in lst[1:]:
print(i)
| 1 | 32,756,748,424,322 | null | 169 | 169 |
a = int ( input ( ) )
h = a // 3600
m = ( a // 60 ) % 60
d = a % 60
print ( "%s:%s:%s" % ( h, m, d ) )
|
# 解説放送の方針
# ダメージが消える右端をキューで管理
# 右端を超えた分は、累積ダメージから引いていく
from collections import deque
N,D,A=map(int,input().split())
XH = [tuple(map(int,input().split())) for _ in range(N)]
XH = sorted(XH)
que=deque()
cum = 0
ans = 0
for i in range(N):
x,h = XH[i]
if i == 0:
r,n = x+2*D,(h+A-1)//A
d = n*A
cum += d
que.append((r,d))
ans += n
continue
while que and que[0][0]<x:
r,d = que.popleft()
cum -= d
h -= cum
if h<0:
continue
r,n = x+2*D,(h+A-1)//A
d = n*A
cum += d
que.append((r,d))
ans += n
print(ans)
| 0 | null | 41,118,500,372,668 | 37 | 230 |
k=int(input())
if k==1:
print('ACL')
elif k==2:
print('ACLACL')
elif k==3:
print('ACLACLACL')
elif k==4:
print('ACLACLACLACL')
elif k==5:
print('ACLACLACLACLACL')
|
h, n = map(int, input().split())
a = [0] * n
b = [0] * n
for i in range(n):
a[i], b[i] = map(int, input().split())
dp = [[1e18] * (h + 1) for _ in range(n + 1)]
dp[0][0] = 0
for i in range(n):
for j in range(h + 1):
dp[i + 1][j] = min(dp[i + 1][j], dp[i][j])
dp[i + 1][min(j + a[i], h)] = min(dp[i + 1][min(j + a[i], h)], dp[i + 1][j] + b[i])
print(dp[n][h])
| 0 | null | 41,456,898,106,452 | 69 | 229 |
# coding: utf-8
def main():
N, A, B = map(int, input().split())
quo = N // (A + B)
rem = N % (A + B)
if (rem > A): rem = A
ans = quo * A + rem
print(ans)
if __name__ == "__main__":
main()
|
import math
def check(A, x, k):
cut_count = 0
for number in A:
cut_count += (math.ceil(number / x)) -1
return cut_count <= k
n, k = map(int,input().split())
a = list(map(int, input().split()))
ans = 0
l = 0
r = 10 ** 9
while r - l > 1:
x = (r + l) // 2
if check(a, x, k):
r = x
else:
l = x
print(r)
| 0 | null | 31,009,887,354,082 | 202 | 99 |
s = input()
if s == "RRR":
x = 3
elif s == "RRS" or s == "SRR":
x = 2
elif s == "SSS":
x = 0
else:
x = 1
print(x)
|
s = input()
ans = 0
strek = 0
for i in range(3):
if s[i] == 'R':
tmp = "R"
strek += 1
ans = max(strek, ans)
else:
strek = 0
print(ans)
| 1 | 4,885,464,051,080 | null | 90 | 90 |
import math
a, b, C = map(int, input().split())
C = C / 180 * math.pi
S = a * b * math.sin(C) / 2
print(S)
print(a + b + math.sqrt(a**2 + b**2 - 2*a*b*math.cos(C)))
print(2 * S / a)
|
while True:
n, x = map(int, input().split())
if n == 0:
break
count = 0
for n1 in range(1, n+1):
for n2 in range(n1+1, n+1):
for n3 in range(n2+1, n+1):
if n1 + n2 + n3 == x:
count += 1
print(count)
| 0 | null | 746,747,337,802 | 30 | 58 |
n=int(input())
arr=[input() for _ in range(n)]
dic={}
for i in range(n): #各単語の出現回数を数える
if arr[i] not in dic:
dic[arr[i]]=1
else:
dic[arr[i]]+=1
largest=max(dic.values()) #最大の出現回数を求める
ans=[]
for keys in dic.keys():
if dic[keys]==largest: #出現回数が最も多い単語を集計する
ans.append(keys)
ans=sorted(ans) #単語を辞書順に並べ替えて出力する
for words in ans:
print(words)
|
from collections import Counter
N = int(input())
S = [input() for _ in range(N)]
# 方針：各文字列の出現回数を数え、出現回数が最大なる文字列を昇順に出力する
# Counter(リスト) は辞書型のサブクラスであり、キーに要素・値に出現回数という形式
# Counter(リスト).most_common() は(要素, 出現回数)というタプルを出現回数順に並べたリスト
S = Counter(S).most_common()
max_count = S[0][1] # 最大の出現回数
# 出現回数が最も多い単語を集計する
l = [s[0] for s in S if s[1] == max_count]
# 昇順にソートして出力
for i in sorted(l):
print(i)
| 1 | 69,841,817,298,688 | null | 218 | 218 |
import math
pi=math.pi
r = int(input().strip())
print(2*r*pi)
|
import math
n = int(input())
x = []
x.extend(list(map(int, input().split())))
y = []
y.extend(list(map(int, input().split())))
i = 0
sum = 0
for i in range(n):
sum += abs(x[i] - y[i])
print(sum)
sum = 0
for i in range(n):
sum += (x[i] - y[i]) ** 2
print(math.sqrt(sum))
sum = 0
for i in range(n):
sum += abs(x[i] - y[i]) ** 3
print(sum ** (1/3))
check = 0
for i in range(n):
if check < abs(x[i] - y[i]):
check = abs(x[i] - y[i])
print(check)
| 0 | null | 15,679,330,500,758 | 167 | 32 |
def mlt(): return map(int, input().split())
x, a, b = mlt()
dp = [0 for n in range(x)]
for n in range(1, x+1):
for k in range(n+1, x+1):
d1 = k-n
d2 = abs(a-n)+1+abs(b-k)
ds = min(d1, d2)
dp[ds] += 1
print(*dp[1:], sep='\n')
|
N = int(input())
A = list(map(int,input().split()))
B = [[A[i],i+1]for i in range(N)]
B.sort()
ans = [B[i][1]for i in range(N)]
print(" ".join(map(str,ans)))
| 0 | null | 112,667,179,319,102 | 187 | 299 |
n=int(input());print(str(n//3600)+":"+str((n//60)%60)+":"+str(n%60))
|
n = int(input())
h = int(n / 3600)
m = int((n-h*3600) / 60)
s = n - h * 3600 - m * 60
print(':'.join(map(str, [h,m,s])))
| 1 | 335,766,340,162 | null | 37 | 37 |
n, t = map(int, input().split())
lst = [0 for _ in range(t)]
ab = [list(map(int, input().split())) for _ in range(n)]
ab.sort()
ans = 0
for a, b in ab:
ans = max(ans, lst[-1] + b)
for i in range(t - 1, a - 1, -1):
lst[i] = max(lst[i], lst[i - a] + b)
print(ans)
|
ans=0
n,t=map(int,input().split())
food=[]
for i in range(n):
f=list(map(int,input().split()))
food.append(f)
food=sorted(food)
dp=[0,0]+[-1]*(t-1)
for a,b in food:
tmp=[dp[i] for i in range(t)]
for i in range(t):
if dp[i]==-1: continue
j=i+a
if j<t: tmp[j]=max(tmp[j],dp[i]+b)
else: ans=max(ans,dp[i]+b)
dp=[tmp[i] for i in range(t)]
print(max(ans,max(dp)))
| 1 | 151,481,808,339,580 | null | 282 | 282 |
a,b = map(int,input().split())
if a>9:
print(-1)
elif b>9:
print(-1)
else:
print(a*b)
|
a, b = list(map(int, input().split()))
if a < 10 and b < 10:
my_result = a * b
else:
my_result = -1
print(my_result)
| 1 | 158,277,497,695,028 | null | 286 | 286 |
N=input()
ans=0
for i in range(1,int(N)+1):
if i%15==0:
pass
elif i%5==0:
pass
elif i%3==0:
pass
else:
ans=ans+i
print(ans)
|
def main():
x, y, a, b, c = list(map(int, input().split()))
P = list(map(int, input().split()))
Q = list(map(int, input().split()))
R = list(map(int, input().split()))
P = sorted(P, reverse = True)[:x]
Q = sorted(Q, reverse = True)[:y]
ans = sorted(P + Q + R, reverse = True)
print(sum(ans[:x + y]))
if __name__ == '__main__':
main()
| 0 | null | 39,993,185,407,318 | 173 | 188 |
N = int(input())
A = list(map(int, input().split()))
ans = 0
if N == 0:
if A[0] >= 2:
ans = -1
else:
ans = 1
if N >= 1 and A[0] >= 1:
ans = -1
if N >= 1:
node_num = {N: A[N]}
max_parent_num = {0: 1}
for i in range(1, N+1):
max_parent_num[i] = max_parent_num[i-1] * 2 - A[i]
for i in range(N, 0, -1):
if node_num[i] > A[i] + max_parent_num[i]:
ans = -1
break
#i-1 no parent wo tukuru
if node_num[i] <= max_parent_num[i-1]:
i_1_parent_num = node_num[i]
else:
i_1_parent_num = max_parent_num[i-1]
node_num[i-1] = i_1_parent_num + A[i-1]
if i == 1:
if node_num[i-1] != 1:
ans = -1
break
if ans == -1 or ans == 1:
print(ans)
else:
ans = sum(node_num.values())
print(ans)
|
x, n = list(map(int, input().split()))
if n == 0:
inputs = []
else:
inputs = list(map(int, input().split()))
nums = [0] * 201
diff = 1000
n = 100
for i in inputs:
nums[i] = 1
for i in range(0, 201):
d = abs(i - x)
if nums[i] == 1:
continue
if d < diff:
diff = d
n = i
print(n)
| 0 | null | 16,447,077,075,168 | 141 | 128 |
N = int(input())
D = [list(map(int,input().split())) for _ in range(N)]
cnt = 0
for i in range(N):
cnt = cnt + 1 if D[i][0] == D[i][1] else 0
if cnt == 3:
print('Yes')
exit()
print('No')
|
def odd(num):
return num//2+num%2
N=int(input())
num = odd(N)/N
print("{:.10f}".format(num))
| 0 | null | 89,421,729,136,740 | 72 | 297 |
# cook your dish here
a,b,c = map(int, input().split())
k = int(input())
c1, c2 = 0, 0
while b<=a:
b=b*2
c1 = c1 + 1
while c <= b:
c=c*2
c2 = c2 +1
if c1 + c2 <= k:
print('Yes')
else:
print('No')
|
def main():
A, B, C = list(map(int, input().split()))
K = int(input())
for _ in range(K):
if A >= B:
B *= 2
elif B >= C:
C *= 2
if A < B < C:
print('Yes')
else:
print('No')
if __name__ == '__main__':
main()
| 1 | 6,890,878,958,268 | null | 101 | 101 |
# http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ITP1_9_D
def reverse(s, a, b):
s1 = s[0:a]
s2 = s[a:b+1]
s2 = s2[::-1]
s3 = s[b+1:len(string)]
return s1 + s2 + s3
def replace(s, a, b, p):
s1 = s[0:a]
s2 = p
s3 = s[b+1:len(string)]
return s1 + s2 + s3
string = input()
q = int(input())
for _ in range(q):
c = input().split()
if c[0] == "print":
print(string[int(c[1]):int(c[2])+1])
if c[0] == "reverse":
string = reverse(string, int(c[1]), int(c[2]))
if c[0] == "replace":
string = replace(string, int(c[1]), int(c[2]), c[3])
|
n, m, k = map(int, input().split())
class UnionFind():
def __init__(self, n):
self.n = n
self.par = [-1 for i in range(self.n)]
def find(self, x):
if self.par[x] < 0:
return x
else:
self.par[x] = self.find(self.par[x])
return self.par[x]
def unite(self, x, y):
p = self.find(x)
q = self.find(y)
if p == q:
return None
if p > q:
p, q = q, p
self.par[p] += self.par[q]
self.par[q] = p
def same(self, x, y):
return self.find(x) == self.find(y)
def size(self, x):
return -self.par[self.find(x)]
UF = UnionFind(n)
f_or_b = [0] * n
for i in range(m):
a, b = map(int, input().split())
UF.unite(a - 1, b - 1)
f_or_b[a - 1] += 1
f_or_b[b - 1] += 1
for i in range(k):
c, d = map(int, input().split())
if UF.same(c - 1, d - 1):
f_or_b[c - 1] += 1
f_or_b[d - 1] += 1
for i in range(n):
print(UF.size(i) - f_or_b[i] - 1, end=" ")
| 0 | null | 31,782,921,780,928 | 68 | 209 |
t = int(input())
if t >= 30:
print("Yes")
else:
print("No")
|
H, A = [int(x) for x in input().split()]
if H % A == 0:
print(H//A)
else:
print(H//A + 1)
| 0 | null | 41,325,160,865,212 | 95 | 225 |
n=int(input())
a=1000
i=1
while n>a:
i=i+1
a=a+1000
print(a-n)
|
n = int(input())
print(1000-(n%1000) if (n%1000) > 0 else 0)
| 1 | 8,416,825,997,210 | null | 108 | 108 |
N,K = map(int,input().split())
MOD = 10**9+7
s = 1
for k in range(K,N+1):
t = (N+1-k)*k+1
# print(t)
s += t
s = s%MOD
print(s)
|
from itertools import accumulate
n = int(input())
A = list(map(int,input().split()))
B = list(accumulate(A))
m = float("inf")
for i in B:
m = min(m,abs(2*i-B[-1]))
print(m)
| 0 | null | 87,915,279,164,972 | 170 | 276 |
# -*- coding: utf-8 -*-
A,B,N = list(map(int, input().rstrip().split()))
#-----
x = min( (B-1) , N)
calc = int(A*x/B) - A * int(x/B)
print(calc)
|
c = input()
alphabet = [chr(i) for i in range(97, 97+26)]
idx = alphabet.index(c)
print(alphabet[idx+1])
| 0 | null | 60,097,345,265,662 | 161 | 239 |
def main():
N = int(input())
S = input()
cnt = 0
for i in range(N):
for j in range(i + 1, N):
k = 2 * j - i
if k >= N:
continue
if S[j] != S[i] and S[i] != S[k] and S[k] != S[j]:
cnt += 1
print(S.count("R") * S.count("B") * S.count("G") - cnt)
if __name__ == "__main__":
main()
|
from itertools import permutations
n = int(input())
s = input()
out = 0
ans = s.count("R")*s.count("G")*s.count("B")
combi = list(permutations(["R","G","B"],3))
for i in range(1,n):
for j in range(n-i*2):
if (s[j], s[j+i], s[j+i*2]) in combi:
ans -= 1
print(ans)
| 1 | 36,124,384,436,800 | null | 175 | 175 |
N, K = list(map(int, input().split(' ')))
marks = list(map(int, input().split(' ')))
for i in range(N-K):
if marks[i] < marks[K+i]:
print('Yes')
else:
print('No')
|
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')
| 1 | 7,074,377,647,360 | null | 102 | 102 |
N = int(input())
A = "abcdefghijklmnopqrstuvwxyz"
x = [A[(N-1)%26]]
N -= 26
i = 1
while N > 0:
x.append(A[((N-1)//(26**i))%26])
i += 1
N -= 26**i
ans = ""
for i in range(1,len(x)+1):
ans += x[-i]
print(ans)
|
def gcd(x, y):
if x < y:
return gcd(y, x)
if y == 0:
return x
return gcd(y, x % y)
x, y = map(int, input().split())
print(gcd(x, y))
| 0 | null | 5,886,035,387,520 | 121 | 11 |
import sys
def input(): return sys.stdin.readline().strip()
def mapint(): return map(int, input().split())
sys.setrecursionlimit(10**9)
N = int(input())
XY = [list(mapint()) for _ in range(N)]
XY.sort(key=lambda x:x[0]+x[1])
ans_1 = abs(XY[0][0]-XY[-1][0])+abs(XY[0][1]-XY[-1][1])
XY.sort(key=lambda x:x[0]-x[1])
ans_2 = abs(XY[0][0]-XY[-1][0])+abs(XY[0][1]-XY[-1][1])
print(max(ans_1, ans_2))
|
n,k = map(int,input().split())
a = [int(i) for i in input().split()]
mod = 10**9+7
pl = 0
zr = 0
mn = 0
a.sort()
for i in range(n):
if a[i] == 0:
zr += 1
elif a[i] > 0:
pl += 1
elif a[i] < 0:
mn += 1
hugo = 0
if zr == 0 and pl == 0 and k % 2 == 1:
hugo = 3#mn
elif zr >= 1 and pl == 0 and k % 2 == 1:
hugo = 2#zr
else:
hugo = 1#pl
ans = 1
tmp_ans = 1
if hugo == 3:
for i in range(k):
ans *= a[mn-1-i]
ans %= mod
print(ans%mod)
elif hugo == 2:
print(0)
else:
if mn == 0:
for i in range(k):
tmp_ans *= a[n-1-i]
tmp_ans %= mod
print(tmp_ans)
else:
tmp = k
pl_num = 0
mn_num = 0
if tmp % 2 == 1:
tmp -= 1
pl_num += 1
tmp_ans = a[n-1]
while tmp > 0:
if tmp >= 2:
tmp -= 2
tmp_p_seki = 0
tmp_m_seki = 0
if pl_num+1 <= pl:
tmp_p_seki = a[n-1-pl_num]*a[n-1-pl_num-1]
if mn_num+1 <= mn:
tmp_m_seki = a[mn_num+0]*a[mn_num+1]
if tmp_p_seki > tmp_m_seki:
tmp_seki = tmp_p_seki
pl_num += 2
elif tmp_p_seki == 0 and tmp_m_seki == 0:
tmp_seki = 0
else:
tmp_seki = tmp_m_seki
mn_num += 2
tmp_ans *= tmp_seki
tmp_ans %= mod
print(tmp_ans%mod)
| 0 | null | 6,441,198,161,110 | 80 | 112 |
N, K = map(int, input().split())
vec = [0] * N
for _ in range(K):
d = int(input())
A = list(map(int, input().split()))
for i in range(d):
vec[A[i]-1] += 1
print(vec.count(0))
|
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,573,325,559,900 | null | 154 | 154 |
s=input()
ans = 0
for i in range(len(s)):
j = len(s)-i-1
if i > j: break
if s[i] != s[j]: ans += 1
print(ans)
|
import sys
S = sys.stdin.readline().strip()
ls = len(S)
ans = 0
h = ls // 2
for i in range(h):
if S[i] != S[ls - 1 - i]:
ans += 1
print(ans)
| 1 | 120,440,640,239,976 | null | 261 | 261 |
mod = int(10 ** 9) + 7
def modinv(x, m = mod):
b = m
u = 1
v = 0
while b:
t = x // b
x -= t * b
x, b = b, x
u -= t * v
u, v = v, u
u %= m
if u < 0:
u += m
return u
def main():
n, k = map(int, input().split())
if k > n-1:
k = n-1
factorial = [None for _ in range(200001)]
factorial[0] = 1
factorial[1] = 1
for i in range(2, 200001):
factorial[i] = (factorial[i-1] * i) % mod
posCount = [None for _ in range(n+1)]
for i in range(n+1):
posCount[i] = (factorial[n] * modinv((factorial[i] * factorial[n-i]) % mod)) % mod
placeCount = [None for _ in range(n+1)]
placeCount[0] = 0
for i in range(1, n+1):
placeCount[i] = (factorial[n-1] * modinv((factorial[i-1] * factorial[(n-1)-(i-1)]) % mod)) % mod
ans = 0
for i in range(-1, -k-2, -1):
ans = (ans + (posCount[i] * placeCount[i])) % mod
if k == 1:
ans -= 1
if ans < 0:
ans += mod
print(ans)
if __name__ == '__main__':
main()
|
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def main():
n, k = map(int, readline().split())
COM_MAX = n
fac, finv, inv = [0] * (COM_MAX + 1), [0] * (COM_MAX + 1), [0] * (COM_MAX + 1)
fac[0] = fac[1] = finv[0] = finv[1] = inv[1] = 1
for i in range(2, COM_MAX + 1):
fac[i] = fac[i - 1] * i % MOD
inv[i] = MOD - inv[MOD % i] * (MOD // i) % MOD
finv[i] = finv[i - 1] * inv[i] % MOD
def com(n, r):
if n < 0 or r < 0 or n < r:
return 0
return fac[n] * (finv[r] * finv[n - r] % MOD) % MOD
ans = 0
for r in range(min(n, k + 1)):
ans = (ans + com(n, r) * com(n - 1, r)) % MOD
print(ans)
return
if __name__ == '__main__':
main()
| 1 | 67,306,095,706,018 | null | 215 | 215 |
H, N = map(int, input().split())
A = list(map(int, input().split()))
def answer(H: int, N: int, A: list) -> str:
damage = 0 # damageに0を代入します
for i in range(0, N): # 0:Nの間にiがある間は
damage += int(A[i]) # damageにリスト[i]をint(整数）に変え足します
# 6でdamage=0にforの間Aの値を足していく意味
i += 1 # 条件を満たす間はiに1つずつ足していきます。リスト内を進めていく
if damage < H:
return 'No'
else:
return 'Yes'
print(answer(H, N, A))
|
import math
a,b=map(int,input().split())
A=[int(x) for x in input().split()]
if a<=sum(A):
print("Yes")
else:
print("No")
| 1 | 77,813,067,937,860 | null | 226 | 226 |
mod = 1000000007
n = int(input())
ans = pow(10,n,mod) - 2 * pow(9,n,mod) + pow(8,n,mod)
ans = (ans % mod + mod) % mod
print(ans)
|
n = int(input())
mod = 10**9+7
ans = pow(10,n)
ans -= pow(9,n)*2
ans += pow(8,n)
print(ans%mod)
| 1 | 3,139,270,331,692 | null | 78 | 78 |
a,b,c = map(int,raw_input().split())
if a>b:
tmp = a
a = b
b = tmp
if b>c:
tmp = b
b = c
c = tmp
if a>b:
tmp = a
a = b
b = tmp
print "%d %d %d" %(a,b,c)
|
score = list(map(int,input().split()))
keta = 0
answer = 1
while score[0] >= answer:
answer *= score[1]
keta += 1
print(keta)
| 0 | null | 32,290,265,625,062 | 40 | 212 |
n = int(input())
a = list(map(int, input().split()))
ans = sum(a)
ans2 = 0
for i in range(n):
if abs((ans - a[i]) - (ans2 + a[i])) < abs(ans - ans2):
ans2 += a[i]
ans -= a[i]
else:
break
print(abs(ans - ans2))
|
import sys
while True:
cards = sys.stdin.readline().strip()
if cards == "-":
break
n = int(sys.stdin.readline())
for i in range(n):
h = int(sys.stdin.readline())
cards = cards[h:] + cards[:h]
print(cards)
| 0 | null | 71,912,383,932,912 | 276 | 66 |
# coding=utf-8
def insertionSort(A, N):
print ' '.join(map(str, A))
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
print ' '.join(map(str, A))
return A
n = int(raw_input().rstrip())
a = map(int, raw_input().rstrip().split())
insertionSort(a, n)
|
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))
| 0 | null | 21,704,064,107,518 | 10 | 186 |
from itertools import groupby
n= input()
s = input()
G = groupby(s)
print(len(list(G)))
|
Ss = input().rstrip()
print('x' * len(Ss))
| 0 | null | 121,467,608,095,868 | 293 | 221 |
from math import ceil
from bisect import bisect_right
n, d, a = (int(x) for x in input().split())
xh = []
for _ in range(n):
x, h = (int(x) for x in input().split())
xh.append([x, h])
xh = sorted(xh, key=lambda x: x[0])
cnt = 0
dmg = [0] * (n + 1)
for i, (x, h) in enumerate(xh):
dmg[i] += dmg[i - 1]
h -= dmg[i]
if h <= 0:
continue
num = ceil(h / a)
dmg[i] += num * a
idx = bisect_right(xh, [x + 2 * d, float('inf')])
dmg[idx] -= num * a
cnt += num
print(cnt)
|
n = input()
maxv = - 1 * pow(10, 9)
minv = input()
for _ in xrange(1, n):
Rj = input()
maxv = max(maxv, Rj - minv)
minv = min(minv, Rj)
print maxv
| 0 | null | 41,085,256,332,896 | 230 | 13 |
import math
l,r,d=map(int,input().split())
i=math.ceil(l/d)
c=0
while((d*i)>=l and (d*i)<=r):
c+=1
i+=1
print(c)
|
high=[0 for i in range(10)]
for i in range(10):
high[i]=int(input())
ans=[0 for i in range(3)]
for i in range(3):
ans[i]=max(high)
high.remove(ans[i])
print(ans[i])
| 0 | null | 3,800,813,250,092 | 104 | 2 |
n = int(input())
n3 = n**3
print(n3)
|
import math;
in_put = input("");
cube=math.pow(float(in_put),3);
print(int(cube));
| 1 | 278,759,563,776 | null | 35 | 35 |
mod=998244353
class Combination:
def __init__(self, N):
self.fac = [1] * (N + 1)
for i in range(1, N + 1):
self.fac[i] = (self.fac[i - 1] * i) % mod
self.invmod = [1] * (N + 1)
self.invmod[N] = pow(self.fac[N], mod - 2, mod)
for i in range(N, 0, -1):
self.invmod[i - 1] = (self.invmod[i] * i) % mod
def calc(self, n, k): # nCk
return self.fac[n] * self.invmod[k] % mod * self.invmod[n - k] % mod
N,M,K=map(int,input().split())
C=Combination(N)
ans=0
c=[1]*(N)
for i in range(1,N):
c[i]=c[i-1]*(M-1)%mod
for i in range(K+1):
tmp=M*c[N-i-1]*C.calc(N-1,N-i-1)%mod
ans=(ans+tmp)%mod
print(ans)
|
from itertools import accumulate
from bisect import bisect
n, m, k = map(int, input().split())
a = [0] + list(map(int, input().split()))
b = [0] + list(map(int, input().split()))
a = list(accumulate(a))
b = list(accumulate(b))
ans = 0
for i in range(n+1):
if a[i] > k:
break
ans = max(ans, i+bisect(b, k-a[i])-1)
print(ans)
| 0 | null | 16,870,540,677,588 | 151 | 117 |
def main():
def inputs():
li = []
count = 0
try:
while count < 200:
li.append(input())
count += 1
except EOFError:
return li
return li
li = inputs()
for x in li:
a = x.split(" ")
result = len(str(int(a[0]) + int(a[1])))
print(result)
return None
if __name__ == '__main__':
main()
|
n=int(input())
l=[list(map(int,input().split())) for i in range(n)]
work1=sorted([x[0] for x in l])
work2=sorted([x[1] for x in l])
if n%2==1 :
mmin=work1[n//2]
mmax=work2[n//2]
else:
mmin=work1[n//2]+work1[n//2-1]
mmax=work2[n//2]+work2[n//2-1]
print(mmax-mmin+1)
| 0 | null | 8,631,606,349,380 | 3 | 137 |
#!/usr/bin/env python3
import sys
from itertools import chain
# import numpy as np
# from itertools import combinations as comb
# from bisect import bisect_left, bisect_right, insort_left, insort_right
# from collections import Counter
MOD = 1000000007 # type: int
OFFSET = 10 ** 100
def k_in_n(k, n):
"""0〜n までの数からちょうど k 個の数を選ぶ時の最大最小"""
minimum = (k * (k - 1)) // 2
maximum = (k * (2 * n - k + 1)) // 2
return (minimum, maximum)
def solve(N: int, K: int):
keep = None # まだ加算されていない範囲
answer = 0
for k in range(K, N + 2):
if keep is None:
keep = k_in_n(k, N)
else:
minmax = k_in_n(k, N)
if minmax[0] + OFFSET <= keep[1]:
keep[0] -= OFFSET
keep[1] = minimum[1]
else:
answer = (answer + keep[1] - keep[0] + 1) % MOD
keep = minmax
if keep is not None:
answer = (answer + keep[1] - keep[0] + 1) % MOD
return answer
def main():
tokens = chain(*(line.split() for line in sys.stdin))
# N, K = map(int, input().split())
# N, K = input().strip()
# N, K = int(input())
N = int(next(tokens)) # type: int
K = int(next(tokens)) # type: int
answer = solve(N, K)
print(answer)
if __name__ == "__main__":
main()
|
from itertools import combinations as comb
def get_ans(m, n):
ans = sum(1 for nums in comb(range(1, min(m+1,n-2)), 2) if ((n-sum(nums)>0) and (n-sum(nums) > max(nums)) and (n-sum(nums)<=m)))
return ans
while True:
m, n = (int(x) for x in input().split())
if m==0 and n==0:
quit()
ans = get_ans(m, n)
print(ans)
| 0 | null | 17,311,659,965,500 | 170 | 58 |
n = int(input())
d = {}
for i in range(n):
[b, f, r, v] = list(map(int,input().split()))
key = f'{b} {f} {r}'
if key in d:
d[key] += v
else:
d[key] = v
for b in range(1,5):
for f in range(1,4):
for r in range(1,11):
key = f'{b} {f} {r}'
if key in d:
print(" "+str(d[key]),end="")
else:
print(" "+str(0),end="")
if r == 10:
print()
if r == 10 and f == 3 and b != 4:
print('####################')
|
I=input
r=range
a=[[[0 for i in r(10)]for j in r(3)]for k in r(4)]
for i in r(int(I())):b,f,r,v=map(int,I().split());a[b-1][f-1][r-1]+=v
f=0
for i in a:
if f:print('#'*20)
else:f=1
for j in i:print('',*j)
| 1 | 1,108,435,272,960 | null | 55 | 55 |
K = int(input())
S = input()
X = len(S)
mod = 10**9+7
def cmb(n, r, mod):
if ( r<0 or r>n ):
return 0
r = min(r, n-r)
return g1[n] * g2[r] * g2[n-r] % mod
mod = 10**9+7 #出力の制限
N = 2*10**6
g1 = [1, 1] # 元テーブル
g2 = [1, 1] #逆元テーブル
inverse = [0, 1] #逆元テーブル計算用テーブル
for i in range( 2, N + 1 ):
g1.append( ( g1[-1] * i ) % mod )
inverse.append( ( -inverse[mod % i] * (mod//i) ) % mod )
g2.append( (g2[-1] * inverse[-1]) % mod )
def power(n, r, mod):
if r == 0: return 1
if r%2 == 0:
return power(n*n % mod, r//2, mod) % mod
if r%2 == 1:
return n * power(n, r-1, mod) % mod
A = 0
B = K
temp = cmb(A+X-1,X-1,mod)*power(25,A,mod)
temp %= mod
temp *= power(26,B,mod)
temp %= mod
ans = temp
for i in range(X+1,K+X+1):
temp *= 25
temp %= mod
temp *= pow(26, mod-2, mod)
temp %= mod
temp *= i-1
temp %= mod
temp *= pow(i-X, mod-2, mod)
temp %= mod
ans += temp
ans %= mod
print(ans)
|
def f_strivore(MOD=10**9 + 7):
K = int(input())
S = input()
length = len(S)
class Combination(object):
"""素数 mod に対する二項係数の計算"""
__slots__ = ['mod', 'fact', 'factinv']
def __init__(self, max_val_arg: int = 10**6, mod: int = 10**9 + 7):
fac, inv = [1], []
fac_append, inv_append = fac.append, inv.append
for i in range(1, max_val_arg + 1):
fac_append(fac[-1] * i % mod)
inv_append(pow(fac[-1], -1, mod))
for i in range(max_val_arg, 0, -1):
inv_append((inv[-1] * i) % mod)
self.mod, self.fact, self.factinv = mod, fac, inv[::-1]
def combination(self, n, r):
return (0 if n < 0 or r < 0 or n < r
else self.fact[n] * self.factinv[r] * self.factinv[n - r] % self.mod)
comb = Combination(length + K).combination
f = [1] * (K + 1)
tmp = 1
for n in range(K + 1):
f[n] = (comb(length + n - 1, length - 1) * tmp) % MOD
tmp = (tmp * 25) % MOD
g = [1] * (K + 1)
for n in range(1, K + 1):
g[n] = (f[n] + 26 * g[n - 1]) % MOD
return g[K]
print(f_strivore())
| 1 | 12,810,651,528,690 | null | 124 | 124 |
R =int(input())
print(R*3.14159*2)
|
print(int(input()) * 3.142 * 2)
| 1 | 31,272,689,244,544 | null | 167 | 167 |
K = int(input())
def make(i):
if int(i) > 3234566667: return
lun.append(int(i))
if i[-1] == "0":
temp = i + "0"
make(temp)
temp = i + "1"
make(temp)
elif i[-1] == "9":
temp = i + "8"
make(temp)
temp = i + "9"
make(temp)
else:
temp = i + str(int(i[-1]) - 1)
make(temp)
temp = i + i[-1]
make(temp)
temp = i + str(int(i[-1]) + 1)
make(temp)
lun = []
for i in range(1, 10):
make(str(i))
lun = sorted(lun)
ans = lun[K - 1]
print(ans)
|
n = int(input())
a = input().split()
money = 1000
stock = 0
pivot = []
upflag = 0
dnflag = 1
if(int(a[1]) - int(a[0]) > 0): # initial
stock = int(money // (int(a[0])))
money = int(money % (int(a[0])))
upflag = 1
dnflag = 0
for i in range(n-2): # i=0,1,,,,n-3 (for n=7, n-3=4)
if(int(a[i+1]) == int(a[i])):
if((int(a[i+2]) - int(a[i+1]) < 0) and upflag == 1): # i+1 is local max so that to sell stock
money = money + stock * (int(a[i+1]))
stock = 0
upflag = 1
dnflag = 0
elif((int(a[i+2]) - int(a[i+1]) > 0) and dnflag == 1): # i+1 is local min so that to sell stock
stock = int(money // (int(a[i+1])))
money = int(money % (int(a[i+1])))
upflag = 0
dnflag = 1
elif(int(a[i+1]) - int(a[i]) > 0):
upflag = 1
if(int(a[i+2]) - int(a[i+1]) < 0): # i+1 is local max so that to sell stock
money = money + stock * (int(a[i+1]))
stock = 0
upflag = 0
elif(int(a[i+1]) - int(a[i]) < 0):
dnflag = 1
if(int(a[i+2]) - int(a[i+1]) > 0): # i+1 is local min so that to buy stock
stock = int(money // (int(a[i+1])))
money = int(money % (int(a[i+1])))
dnflag = 0
if(int(a[n-1]) - int(a[n-2]) > 0): # sell @ final
money = money + stock * (int(a[n-1]))
elif(int(a[n-1]) - int(a[n-2]) == 0):
if(upflag == 1):
money = money + stock * (int(a[n-1]))
print(money)
| 0 | null | 23,612,406,975,598 | 181 | 103 |
n = int(raw_input())
a = map(int, raw_input().split())
for i in range(n):
print a[n-i-1],
|
H,A = (int(x) for x in input().split())
print(H//A+(H%A>0))
| 0 | null | 38,831,470,903,340 | 53 | 225 |
def main():
n = int(input())
a_lst = list(map(int, input().split()))
q = int(input())
bc_lst = [list(map(int, input().split())) for _ in range(q)]
a_max = max(a_lst)
bc_max = 0
for i in range(q):
b = bc_lst[i][0]
c = bc_lst[i][1]
bc_max = max(b, bc_max)
bc_max = max(c, bc_max)
maximum = max(a_max, bc_max)
count_lst = [0] * maximum
for i in range(n):
a = a_lst[i]
count_lst[a - 1] += 1
tmp = sum(a_lst)
for i in range(q):
b = bc_lst[i][0]
c = bc_lst[i][1]
count = count_lst[b - 1]
tmp += count * (c - b)
count_lst[b - 1] = 0
count_lst[c - 1] += count
print(tmp)
if __name__ == '__main__':
main()
|
def main():
n = int(input())
a = list(map(int,input().split()))
dic = {}
for i in range(n):
if not a[i] in dic.keys():
dic[a[i]] = 1
else:
dic[a[i]] += 1
s = 0
for k in dic.keys():
s += dic[k] * k
q = int(input())
for i in range(q):
b,c = map(int,input().split())
if b in dic.keys():
cnt = dic[b]
else:
cnt = 0
dic[b] = 0
if c in dic.keys():
dic[c] += cnt
else:
dic[c] = cnt
s = s + cnt * (c-b)
print(s)
if __name__ == "__main__":
main()
| 1 | 12,116,937,308,480 | null | 122 | 122 |
import math
import string
import itertools
import fractions
import heapq
import collections
import re
import array
import bisect
import sys
import random
import time
inf = 10**9
class Coordinate:
def __init__(self, x, y):
self.x = x
self.y = y
def kock(n, p1, p2):
if n == 0:
return
s = Coordinate((2 * p1.x + p2.x) / 3, (2 * p1.y + p2.y) / 3)
t = Coordinate((p1.x + 2 * p2.x) / 3, (p1.y + 2 * p2.y) / 3)
u = Coordinate(
(t.x - s.x) * math.cos(math.pi / 3) -
(t.y - s.y) * math.sin(math.pi / 3) + s.x,
(t.x - s.x) * math.sin(math.pi / 3) +
(t.y - s.y) * math.cos(math.pi / 3) + s.y
)
kock(n - 1, p1, s)
print(s.x, s.y)
kock(n - 1, s, u)
print(u.x, u.y)
kock(n - 1, u, t)
print(t.x, t.y)
kock(n - 1, t, p2)
def main():
n = int(input())
p1 = Coordinate(0, 0)
p2 = Coordinate(100, 0)
print(p1.x, p1.y)
kock(n, p1, p2)
print(p2.x, p2.y)
if __name__ == '__main__':
main()
|
import sys
from math import sin, cos, radians
input = sys.stdin.readline
deg = radians(60)
def Koch(n, p1_x, p1_y, p2_x, p2_y):
if n != 0:
s_x = (2 * p1_x + p2_x) / 3
s_y = (2 * p1_y + p2_y) / 3
t_x = (p1_x + 2 * p2_x) / 3
t_y = (p1_y + 2 * p2_y) / 3
u_x = (t_x - s_x) * cos(deg) - (t_y - s_y) * sin(deg) + s_x
u_y = (t_x - s_x) * sin(deg) + (t_y - s_y) * cos(deg) + s_y
Koch(n - 1, p1_x, p1_y, s_x, s_y)
print('{:.8f} {:.8f}'.format(s_x, s_y))
Koch(n - 1, s_x, s_y, u_x, u_y)
print('{:.8f} {:.8f}'.format(u_x, u_y))
Koch(n - 1, u_x, u_y, t_x, t_y)
print('{:.8f} {:.8f}'.format(t_x, t_y))
Koch(n - 1, t_x, t_y, p2_x, p2_y)
else:
return
n = int(input())
p1_x, p1_y = 0, 0
p2_x, p2_y = 100, 0
print('{:.8f} {:.8f}'.format(p1_x, p1_y))
Koch(n, p1_x, p1_y, p2_x, p2_y)
print('{:.8f} {:.8f}'.format(p2_x, p2_y))
| 1 | 132,177,297,668 | null | 27 | 27 |
print(1 if input()=="0" else 0)
|
N, = map(int, input().split())
print(1-N)
| 1 | 2,939,762,254,560 | null | 76 | 76 |
N, K = map(int, input().split())
P = [(int(x)+1)/2 for x in input().split()]
Q=[0]*(N+1)
for n in range(N):
Q[n+1]=Q[n]+P[n]
ans=0
for n in range(K,N+1):
ans=max(ans, Q[n]-Q[n-K])
print(ans)
|
def expect(n):
return (n+1)/2
nk = input().split()
N = int(nk[0])
K = int(nk[1])
p = input().split()
tmp = 0
for i in range (K):
tmp += expect(int(p[i]))
tmpMax = tmp
for i in range(N - K):
tmp -= expect(int(p[i]))
tmp += expect(int(p[i+K]))
tmpMax = max(tmpMax, tmp)
print(tmpMax)
| 1 | 74,898,657,042,440 | null | 223 | 223 |
a, b = input().split()
if (len(a) >1) or (len(b) >1):
print(-1)
else:
print(int(a)*int(b))
|
A, B = map(str, input().split())
if len(A) == 1 and len(B) == 1:
print(int(A)*int(B))
else:
print(-1)
| 1 | 158,354,830,934,508 | null | 286 | 286 |
i = 1
while True:
n = input()
if n != 0:
print 'Case %s: %s' % (str(i), str(n))
i = i + 1
else:
break
|
cases = []
n = 1
while n != 0:
n = int(raw_input())
if n == 0:
continue
cases.append(n)
for i in range(len(cases)):
print "Case %d: %d" %(i + 1, cases[i])
| 1 | 480,784,278,390 | null | 42 | 42 |
import os, sys, re, math
S = input()
dow = ['SUN', 'MON', 'TUE', 'WED', 'THU', 'FRI', 'SAT']
print(7 - dow.index(S))
|
x = int(input())
while True:
for i in range(2,x):
if x % i == 0:
break
else:
print(x)
exit()
x += 1
| 0 | null | 119,052,856,882,048 | 270 | 250 |
n = int(input())
A = list(map(int, input().split()))
SWAP = 0
def conquer(A, left, mid, right):
L, R = A[left:mid], A[mid:right]
# L, Rの末尾にINFTYを入れないと、L[-1] or R[-1]が評価されない
INFTY = 2 ** 30
L.append(INFTY)
R.append(INFTY)
# i : position in L, j : position in R
i, j = 0, 0
swap_times = 0
# 元のArrayを変えたいため、kを生成
for k in range(left, right):
# print(i, j, L, R, A)
if L[i] <= R[j]:
A[k] = L[i]
i = i + 1
else:
A[k] = R[j]
j = j + 1
swap_times += 1
return swap_times
def divide(A, left, right):
# print(left, right)
# A[right-left]が2つ以上の場合に
if left+1 < right:
mid = (left+right)//2
countL = divide(A, left, mid)
countR = divide(A, mid, right)
return conquer(A, left, mid, right) + countL + countR
return 0
def mergeSort(A):
return divide(A, 0, len(A))
swap = mergeSort(A)
print(" ".join([ str(i) for i in A]))
print(swap)
|
N,K = map(int, input().split())
tmp=N
count=0
while tmp!=0:
tmp = tmp//K
count += 1
print(count)
| 0 | null | 32,230,743,532,428 | 26 | 212 |
import sys
N=int(input())
if N==2:
print(1)
sys.exit(0)
answer_set=set()
for i in range(2,int(N**0.5)+1):
N2=N
while N2%i==0:
N2//=i
if N2%i==1:
answer_set.add(i)
#print(answer_set)
for i in range(1,int(N**0.5)+1):
if (N-1)%i==0:
answer_set.add((N-1)//i)
#print(answer_set)
answer_set.add(N)
print(len(answer_set))
|
# not resolved
n_ori =int(input())
n_dif = n_ori - 1
sq_ori = int(n_ori**.5)
sq_dif = int(n_dif**.5)
divisor_ori = []
divisor_dif = []
for i in range(1, sq_ori+1):
if n_ori % i == 0:
divisor_ori.append(i)
if i != n_ori // i:
divisor_ori.append(n_ori//i)
for i in range(1, sq_dif+1):
if n_dif % i == 0:
divisor_dif.append(i)
if i != n_dif // i:
divisor_dif.append(n_dif//i)
cnt = 0
for k in divisor_ori:
if k == 1:
continue
else:
tmp = n_ori
while tmp % k == 0:
tmp = tmp//k
if tmp % k == 1:
cnt += 1
print(cnt + len(divisor_dif) - 1)
# # num = n - 1
# # sq = int(num**.5)
# # if sq == 1:
# # for k in range(2, sq+1):
# # if k == sq and num % k == 0:
# # cnt += 1
# # elif num % k == 0:
# # cnt += 2
# # cnt += 1
# # sq2 = int(n ** .5)
# # for k in range(2, sq2+1):
# # x = n
# # if x % k == 0:
# # while x % k == 0:
# # x = x//k
# # if x % k == 1:
# # cnt += 1
# # cnt += 1
# # print(cnt)
| 1 | 41,453,349,069,106 | null | 183 | 183 |
import sys
for i in sys.stdin:
a, b = map(int, i.split())
p, q = max(a, b), min(a, b)
while True:
if p % q == 0:
break
else:
p, q = q, p % q
print("{} {}".format(q, int(a * b / q)))
|
a, b = list(map(int, input().split()))
if a > b:
print("safe")
else:
print("unsafe")
| 0 | null | 14,466,530,901,992 | 5 | 163 |
W, H, x, y, r = [int(i) for i in input().rstrip().split(" ")]
hidari, migi = x-r, x + r
shita, ue = y-r, y+r
if (0 <= hidari) and (migi <= W) and (0 <= shita) and (ue <= H):
print("Yes")
else:
print("No")
|
N=int(input())
b=0
for x in range(1,10):
for y in range(1,10):
if x*y==N:
b+=1
break
if b==1:
break
if b==1:
print("Yes")
else:
print("No")
| 0 | null | 80,174,005,784,256 | 41 | 287 |
def pow(x,n):
res = 1
for _ in range(n):
res *= x
return max(1,res)
def main():
N = int(input())
lists = [0 for i in range(N+1)]
temp = list(map(int,input().split()))
for elem in temp:
lists[elem] += 1
ans = 1
if(lists[0] != 1 or temp[0] != 0):
ans = 0
else:
sum = 1
for i in range(1,N):
ans *= pow(lists[i-1],lists[i])
sum += lists[i]
if(sum == N):
break
if(lists[i] == 0):
if(sum != N):
ans = 0
break
ans %= 998244353
print(ans)
if __name__ == "__main__":
main()
|
N = int(input())
D = list(map(int, input().split()))
mod = 998244353
ans = 1
A = [0]*(max(D)+1)
for i in range(N):
A[D[i]] += 1
#if D[0] != 0 or not all(D[1:]) or not all(A):
# print(0)
# exit()
if D[0] != 0 or not all(D[1:]):
print(0)
exit()
for i in range(1, max(D)+1):
# print(A[i])
if A[i] == 0:
print(0)
exit()
ans = ans * pow(A[i-1], A[i], mod) % mod
print(ans % mod)
| 1 | 154,776,520,945,132 | null | 284 | 284 |
def main():
H, W, K = [int(k) for k in input().split(" ")]
C = []
black_in_row = []
black_in_col = [0] * W
for i in range(H):
C.append(list(input()))
black_in_row.append(C[i].count("#"))
for j in range(W):
if C[i][j] == "#":
black_in_col[j] += 1
black = sum(black_in_row)
if black < K:
print(0)
return 0
cnt = 0
for i in range(2 ** H):
row_bit = [f for f, b in enumerate(list(pad_zero(format(i, 'b'), H))) if b == "1"]
r = sum([black_in_row[y] for y in row_bit])
for j in range(2 ** W):
col_bit = [f for f, b in enumerate(list(pad_zero(format(j, 'b'), W))) if b == "1"]
c = sum([black_in_col[x] for x in col_bit])
bl = black - r - c + sum([1 for p in row_bit for q in col_bit if C[p][q] == "#"])
if bl == K:
cnt += 1
print(cnt)
def pad_zero(s, n):
s = str(s)
return ("0" * n + s)[-n:]
main()
|
H,W,K=map(int,input().split())
c=[str(input())for i in range(H)]
ans=0
for maskH in range(2**H):
for maskW in range(2**W):
black=0
for i in range(H):
for j in range(W):
if ((maskH>>i)&1)==1:
continue
if ((maskW>>j)&1)==1:
continue
if c[i][j]=='#':
black+=1
if black==K:
ans+=1
print(ans)
| 1 | 9,005,524,560,970 | null | 110 | 110 |
N = int(input())
ct = []
for i in range(N):
ct.append([int(i) for i in input().split()])
dist = 0
for a in ct:
for b in ct:
dist += (abs(a[0] - b[0])**2 +abs(a[1] - b[1])**2)**0.5
print(dist/N)
|
import itertools
import math
n=int(input())
xy=[[int(i) for i in input().split()] for _ in range(n)]
p = itertools.permutations(range(n),n)
lenlist=[]
for v in p:
len=0
for i in range(n-1):
len += ( (xy[v[i+1]][0]-xy[v[i]][0])**2 + (xy[v[i+1]][1]-xy[v[i]][1])**2 )**0.5
lenlist.append(len)
print(sum(lenlist)/math.factorial(n))
| 1 | 148,038,450,919,502 | null | 280 | 280 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.