code1
stringlengths 17
427k
| code2
stringlengths 17
427k
| similar
int64 0
1
| pair_id
int64 2
181,637B
⌀ | question_pair_id
float64 3.7M
180,677B
⌀ | code1_group
int64 1
299
| code2_group
int64 1
299
|
|---|---|---|---|---|---|---|
from itertools import permutations as p
N = int(input())
P = tuple(map(int,input().split()))
Q = tuple(map(int,input().split()))
j = 0
for i in p(range(1, N + 1)):
j += 1
if i == P: a = j
if i == Q: b = j
if a - b >= 0: print(a - b)
else: print(b - a) | S = input()
ans = "Yes"
if S == "AAA" or S == "BBB":
ans = "No"
print(ans) | 0 | null | 77,574,172,685,332 | 246 | 201 |
'''
Created on 2020/08/23
@author: harurun
'''
def f(n):
arr=[]
temp=n
for c in range(2,int(-(-n**0.5//1))+1):
if temp%c==0:
cnt=0
while temp%c==0:
cnt+=1
temp//=c
arr.append([c,cnt])
if temp!=1:
arr.append([temp,1])
return arr
def main():
import math
import sys
pin=sys.stdin.readline
pout=sys.stdout.write
perr=sys.stderr.write
N=int(pin())
r=f(N)
ans=0
for i in r:
ans+=int((math.sqrt(1+8*i[1])-1)/2)
print(ans)
return
main() | def main():
n = int(input())
ans = 0
for k in range(2,int(n**0.5)+1):
if n%k==0:
cnt,mx = 0,0
while n%k==0:
n = n//k
cnt += 1
if cnt > mx:
ans += 1
mx += 1
cnt = 0
if n!=1:
ans += 1
print(ans)
if __name__ == "__main__":
main()
| 1 | 16,796,541,225,762 | null | 136 | 136 |
a = int(input())
b = int(input())
num = [a, b]
for i in range(1, 4):
if i not in num:
print(i)
break | A = int(input())
B = int(input())
if A == 1:
if B == 2:
print(3)
else:
print(2)
elif A == 2:
if B == 1:
print(3)
else:
print(1)
else:
if B == 1:
print(2)
else:
print(1)
| 1 | 111,070,579,266,120 | null | 254 | 254 |
N, = map(int, input().split())
print(10-N//200)
| def warshall_floyd(v_count: int, matrix: list) -> list:
""" ワーシャルフロイド
v_count: 頂点数
matrix: 隣接行列(到達不能はfloat("inf"))
"""
for i in range(v_count):
for j, c2 in enumerate(row[i] for row in matrix):
for k, (c1, c3) in enumerate(zip(matrix[j], matrix[i])):
if c1 > c2+c3:
matrix[j][k] = c2+c3
return matrix
INF = 10 ** 16
n, m, l = map(int, input().split())
mat = [[INF] * n for _ in range(n)]
for i in range(n):
mat[i][i] = 0
for _ in range(m):
a, b, c = map(int, input().split())
mat[a - 1][b - 1] = c
mat[b - 1][a - 1] = c
mat = warshall_floyd(n, mat)
fuel_mat = [[INF] * n for _ in range(n)]
for i in range(n):
for j in range(n):
if i == j:
fuel_mat[i][j] = 0
elif mat[i][j] <= l:
fuel_mat[i][j] = 1
fuel_mat = warshall_floyd(n, fuel_mat)
q = int(input())
for _ in range(q):
s, t = map(int, input().split())
d = fuel_mat[s - 1][t - 1]
if d == INF:
print(-1)
else:
print(d - 1)
| 0 | null | 90,093,356,633,600 | 100 | 295 |
n = int(input())
XY = []
for i in range(n):
a = int(input())
xy = []
for j in range(a):
x, y = map(int, input().split())
xy.append([x, y])
XY.append(xy)
ans = 0
for i in range(2 ** n):
s = [0] * n
cnt = 0
case = True
for j in range(n):
if (i >> j) & 1:
s[j] = 1
cnt += 1
for k in range(n):
if s[k] == 1:
for l in range(len(XY[k])):
if s[XY[k][l][0] - 1] != XY[k][l][1]:
case = False
if case is True:
ans = max(ans, cnt)
print(ans)
| import copy
N = int(input())
testimony = []
for n in range(N):
A = int(input())
testimony.append({})
for a in range(A):
x, y = map(int, input().split())
testimony[n][x - 1] = y
def judge(truthy):
answer = True
for i in range(len(truthy)):
if truthy[i] == 1:
for t in testimony[i].keys():
if truthy[t] != testimony[i][t]:
answer = False
break
if not answer:
break
# print(answer, truthy)
return 0 if not answer else truthy.count(1)
def dfs(truthy, depth):
if N == depth:
return judge(truthy)
truth = copy.copy(truthy)
truth.append(1)
t = dfs(truth, depth + 1)
false = copy.copy(truthy)
false.append(0)
f = dfs(false, depth + 1)
return max(t, f)
print(dfs([], 0)) | 1 | 121,276,523,541,398 | null | 262 | 262 |
while True:
x = input().split()
if x[1] == '+':
y = int(x[0])+int(x[2])
print(y)
elif x[1] == '-':
y = int(x[0])-int(x[2])
print(y)
elif x[1] == '*':
y = int(x[0])*int(x[2])
print(y)
elif x[1] == '/':
y = int(x[0])//int(x[2])
print(y)
elif x[1] == '?':
break | #coding:UTF-8
while True:
a,op,b = map(str,raw_input().split())
a = int(a)
b = int(b)
if op == '+':
print a + b
elif op == '-':
print a - b
elif op == '*':
print a * b
elif op == '/':
print a / b
else:
break | 1 | 679,286,371,370 | null | 47 | 47 |
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
import functools
def s(): return input()
def k(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def X(): return list(input())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 9)
mod = 10**9+7
cnt = 0
ans = 0
inf = float("inf")
s = s()
a = ["SAT", "FRI", "THU","WED","TUE","MON","SUN"]
x = a.index(s) + 1
print(x)
| r = int(input())
import math
pi = math.pi
l = 2 * pi * r
print(l) | 0 | null | 82,263,147,062,196 | 270 | 167 |
def cal(S):
tmp, a, cnt = S[0], 1, 0
flag = True
for s in S[1:]:
if S[0]!=s: flag=False
if flag: a+=1
if tmp[-1]==s:
s = '*'
cnt += 1
tmp += s
return a, cnt
S = input().replace('\n', '')
k = int(input())
ans = 0
if len(list(set(S)))==1:
ans = len(S)*k//2
else:
a, cnt = cal(S)
b, _ = cal(S[::-1])
ans = cnt*k
if S[0]==S[-1]:
ans -= ((a//2)+(b//2)-((a+b)//2))*(k-1)
print(ans) | s=input()
k=int(input())
cnt=1
temp=[]
for i in range(len(s)-1):
if s[i]==s[i+1]: cnt+=1
else:
temp.append([s[i],cnt])
cnt=1
if cnt>=1: temp.append([s[-1],cnt])
if len(temp)==1:
print(k*len(s)//2)
exit()
ans=0
if temp[0][0]!=temp[-1][0]:
for pair in temp:
if pair[1]!=1: ans+=pair[1]//2
print(ans*k)
else:
for pair in temp[1:-1]:
if pair[1]!=1: ans+=pair[1]//2
ans*=k
ans+=(k-1)*((temp[0][1]+temp[-1][1])//2)
ans+=temp[0][1]//2+temp[-1][1]//2
print(ans) | 1 | 175,281,637,690,972 | null | 296 | 296 |
N = int(input())
set_list = [input().split() for _ in range(N)]
X = input()
ans = 0
flg = False
for i in range(N):
if flg == True:
ans += int(set_list[i][1])
if set_list[i][0] == X:
flg = True
print(ans) | n=int(input())
a=[list(input().split()) for _ in range(n)]
x=input()
s=0
for i in range(n):
if a[i][0]==x:
p=i
break
for i in range(p+1,n):
s+=int(a[i][1])
print(s) | 1 | 97,126,558,107,880 | null | 243 | 243 |
n=int(input())
a=list(map(int,input().split()))
ans=['-']*n
for i in range(n):
ans[a[i]-1]=str(i+1)
print(' '.join(ans)) | while True:
line = list(map(int, input().split()))
if line==[0,0]: break
print(' '.join(map(str,sorted(line)))) | 0 | null | 90,289,911,616,250 | 299 | 43 |
def BFS(s = 0):
Q.pop(0)
color[s] = 2
for j in range(len(color)):
if A[s][j] == 1 and color[j] == 0:
Q.append(j)
color[j] = 1
d[j] = d[s] + 1
if len(Q) != 0:
BFS(Q[0])
n = int(raw_input())
A = [0] * n
for i in range(n):
A[i] = [0] * n
for i in range(n):
value = map(int, raw_input().split())
u = value[0] - 1
k = value[1]
nodes = value[2:]
for j in range(k):
v = nodes[j] - 1
A[u][v] = 1
color = [0] * n
Q = [0]
d = [-1] * n
d[0] = 0
BFS(0)
for i in range(n):
print(str(i + 1) + " " + str(d[i])) | #木ではない
#非連結成分
#処理済みの判定、辺の距離はすべて1なので一度到達すればよい
from collections import deque
n = int(input())
V = [[] for _ in range(n+1)]
for _ in range(n):
inpt = list(map(int,input().split( )))
if len(inpt)>2:
V[inpt[0]] = inpt[2:]
lrg = 10000
D = [lrg]*(n+1)
End = [0]*(n+1)
D[1] = 0
Deq = deque()
time = 1
Q = [1]
Deq.append(1)
while len(Deq) > 0:
v = Deq.popleft()
for i in V[v]:
D[i] = min(D[i],D[v]+1)
if End[i] == 0:
Deq.append(i)
End[i] = 1
for i in range(1,n+1):
if D[i]<lrg-1:
print(i,D[i])
else:
print(i,-1)
| 1 | 3,993,683,972 | null | 9 | 9 |
import sys
def div(x, y):
if x % y == 0:
print y
else:
div(y, x%y)
line = sys.stdin.readline()
x, y = line.split(" ")
x = int(x)
y = int(y)
if x < y:
x, y = y, x
if x == y:
print x
else:
div(x, y) | dbg = False
a, b = list(map(int, input().split()))
if a > b:
x, y = a, b
else:
x, y = b, a
divs = [1]
for i in range(1, int((y+1)/2)+1):
gcd_tmp = int(y / i)
if dbg: print('%d, %d' % (i, gcd_tmp))
if i > gcd_tmp:
break
if y % i == 0:
if x % gcd_tmp == 0:
print(gcd_tmp)
exit()
elif x % i == 0:
divs.append(i)
print(max(divs)) | 1 | 8,457,547,098 | null | 11 | 11 |
A,B,C = map(int,input().split())
print(("bust","win")[A+B+C <22]) | N = int(input())
"""nを素因数分解"""
"""2以上の整数n => [[素因数, 指数], ...]の2次元リスト"""
def factorization(n):
if (n == 1):
return []
arr = []
temp = n
for i in range(2, int(-(-n**0.5//1))+1):
if temp%i==0:
cnt=0
while temp%i==0:
cnt+=1
temp //= i
arr.append([i, cnt])
if temp!=1:
arr.append([temp, 1])
if arr==[]:
arr.append([n, 1])
return arr
#print(factorization(N))
list_a = factorization(N)
count = 0
for i in range(len(list_a)):
num = list_a[i][1]
cal = 1
while(num > 0):
num -= cal
cal += 1
if(num < 0) :
break
count += 1
#print(num,count)
print(count)
| 0 | null | 67,690,490,640,918 | 260 | 136 |
from collections import deque
h,w = map(int, input().split())
hw = [input() for _ in range(h)]
def bfs(s):
que = deque([s])
m = [[-1]*w for _ in range(h)]
sh, sw = s
m[sh][sw] = 0
ret = 0
while que:
now_h, now_w = que.popleft()
for dh, dw in [(1,0), (-1,0), (0,-1), (0,1)]:
nh = now_h + dh
nw = now_w + dw
if not (0<=nh<h and 0<=nw<w) or m[nh][nw] != -1 or hw[nh][nw] == '#':
continue
m[nh][nw] = m[now_h][now_w] + 1
que.append((nh,nw))
ret = max(ret, m[now_h][now_w] + 1)
return ret
ans = 0
for y in range(h):
for x in range(w):
if hw[y][x] == '#':
continue
s = (y, x)
ans = max(bfs(s), ans)
print(ans) | from collections import deque
H, W = [int(x) for x in input().split()]
field = []
for i in range(H):
field.append(input())
conn = [[[] for _ in range(W)] for _ in range(H)]
for i in range(H):
for j in range(W):
if field[i][j] == '.':
for e in [[-1, 0], [1, 0], [0, -1], [0, 1]]:
h, w = i + e[0], j + e[1]
if 0 <= h < H and 0 <= w < W and field[h][w] == '.':
conn[i][j].append([h, w])
d = 0
for i in range(H):
for j in range(W):
l = 0
q = deque([[i, j]])
dist = [[-1 for _ in range(W)] for _ in range(H)]
dist[i][j] = 0
while q:
v = q.popleft()
for w in conn[v[0]][v[1]]:
if dist[w[0]][w[1]] == -1:
q.append(w)
dist[w[0]][w[1]] = dist[v[0]][v[1]] + 1
l = dist[w[0]][w[1]]
d = max(d, l)
print(d) | 1 | 94,275,686,397,578 | null | 241 | 241 |
N = int(input())
A = list(map(int, input().split()))
mod = 10**9+7
S = sum(A)**2
T = 0
for a in A:
T+=a**2
S -= T
S //= 2
S%=mod
print(S) | n = int(input())
a = list(map(int, input().split()))
s, mod = sum(a)-a[0], 1000000007
ans = a[0]*s
for i in range(1, n):
s -= a[i]
ans = (ans % mod + ((s % mod) * a[i]) % mod) % mod
print(ans % mod)
| 1 | 3,849,380,627,302 | null | 83 | 83 |
# coding: utf-8
stack = []
f = input().split()
for s in f:
if s in ('+', '-', '*'):
stack.append(str(eval("{1}{2}{0}".format(stack.pop(), stack.pop(), s))))
else:
stack.append(s)
print(*stack) | import re
data = input().split()
stack = []
for elem in data:
if re.match('\d+', elem):
stack.append(int(elem))
else:
a = stack.pop()
b = stack.pop()
if elem == "+":
stack.append(b+a)
elif elem == "-":
stack.append(b-a)
elif elem == "*":
stack.append(b*a)
print(stack[0]) | 1 | 37,350,960,892 | null | 18 | 18 |
def main():
S = input()
Q = int(input())
order = [list(input().split()) for _ in range(Q)]
left_flag = 0
right_flag = 0
cnt = 0
for i in range(Q):
if order[i][0] == '1':
cnt += 1
else:
if cnt%2 == 0:
if order[i][1] == '1':
if left_flag == 1:
left = order[i][2] + left
else:
left = order[i][2]
left_flag = 1
else:
if right_flag == 1:
right = right + order[i][2]
else:
right = order[i][2]
right_flag = 1
else:
if order[i][1] == '2':
if left_flag == 1:
left = order[i][2] + left
else:
left = order[i][2]
left_flag = 1
else:
if right_flag == 1:
right = right + order[i][2]
else:
right = order[i][2]
right_flag = 1
if left_flag == 1 and right_flag == 1:
S = left + S + right
elif left_flag == 1 and right_flag == 0:
S = left + S
elif left_flag == 0 and right_flag == 1:
S = S + right
else:
S = S
if cnt%2 == 0:
return(S)
else:
S2 = S[-1]
for i in range(len(S)-2,-1,-1):
S2 = S2 + S[i]
return S2
print(main())
| import sys
from collections import deque
input = sys.stdin.readline
def dfs(N):
alphabet = "abcdefghij"
stack = deque(["a"])
while stack:
s = stack.pop()
if len(s) == N:
print(s)
continue
suffixes = []
for al in alphabet:
suffixes.append(al)
if al not in s:
break
for suffix in reversed(suffixes):
stack.append("".join((s, suffix)))
def main():
N = int(input())
dfs(N)
if __name__ == "__main__":
main()
| 0 | null | 54,991,649,060,682 | 204 | 198 |
n,m=[int(x) for x in input().split()]
A=[[0 for i in range(m)] for i in range(n)]
vector=[0 for i in range(m)]
result=[0 for i in range(n)]
for i in range(n):
A[i]=[int(x) for x in input().split()]
for i in range(m):
vector[i]=int(input())
for i in range(n):
for j in range(m):
result[i] += A[i][j]*vector[j]
for _ in result:
print(_) | import queue
N=int(input())
M=[input().split()[2:]for _ in[0]*N]
q=queue.Queue();q.put(0)
d=[-1]*N;d[0]=0
while q.qsize()>0:
u=q.get()
for v in M[u]:
v=int(v)-1
if d[v]<0:d[v]=d[u]+1;q.put(v)
for i in range(N):print(i+1,d[i])
| 0 | null | 570,231,700,430 | 56 | 9 |
N,K = map(int,input().split())
a = sorted(list(map(int,input().split())),reverse=True)
del a[0:K]
print(sum(a)) | n, k = map(int , input().split())
hn = [int(num) for num in input().split()]
hn.sort(reverse = True)
if len(hn) > k:
print(sum(hn[k:]))
else :
print(0) | 1 | 79,056,253,231,270 | null | 227 | 227 |
#ABC156B
n,k = map(int,input().split())
ans = 0
while n > 0 :
n = n // k
ans = ans + 1
print(ans) | N, K = map(int, input().split())
q, r = divmod(N, K)
ans = 1
while q > 0:
q, r = divmod(q, K)
ans += 1
print(ans)
| 1 | 64,069,622,836,008 | null | 212 | 212 |
N = int(input())
X = int(N/1.08)
for i in [-1, 0, 1]:
X_ = int((X+i)*1.08)
if(X_ == N):
print(X+i)
exit()
print(':(') | S = 0
N,X,T = map(int,input().split())
if N % X ==0:
print((N // X)*T)
else:
print((N + X - 1)// X *T) | 0 | null | 65,005,383,065,642 | 265 | 86 |
rooms = [0] * (4*3*10)
count = int(input())
for i in range(count):
b, f, r, v = [int(x) for x in input().split()]
rooms[30*(b-1) + 10*(f-1) + (r-1)] += v
for i, room in enumerate(rooms, start=1):
print('', room, end='')
if i%10 == 0:
print()
if i%30 == 0 and i%120 != 0:
print('#'*20) | from collections import deque
def input_bordered_grid(h, w, wall):
grid = [wall * (w + 2)]
for _ in range(1, h+1):
grid.append(wall + input() + wall)
grid.append(wall * (w + 2))
return grid
h, w = map(int, input().split())
grid = input_bordered_grid(h, w, '#')
move = [(-1, 0), (1, 0), (0, -1), (0, 1)]
longest = 0
for sy in range(1, h+1):
for sx in range(1, w+1):
if grid[sy][sx] == '#':
continue
dist = [[-1] * (w+2) for _ in range(h+2)]
dist[sy][sx] = 0
q = deque()
q.append((sy, sx))
while q:
y, x = q.popleft()
longest = max(longest, dist[y][x])
for dy, dx in move:
yy = y + dy
xx = x + dx
if dist[yy][xx] == -1 and grid[yy][xx] == '.':
q.append((yy, xx))
dist[yy][xx] = dist[y][x] + 1
print(longest)
| 0 | null | 47,841,715,377,200 | 55 | 241 |
from collections import deque
import sys
input()
lst = deque()
for s in sys.stdin:
if s[0] == 'i':
lst.appendleft(s[7:-1])
else:
a = s[6]
if a == ' ':
try:
lst.remove(s[7:-1])
except:
pass
elif a == 'F':
lst.popleft()
else:
lst.pop()
print(*lst)
| from collections import deque
n = int(input())
dll = deque()
for i in range(n):
input_line = input().split()
if input_line[0] == "insert":
dll.appendleft(input_line[1])
elif len(dll) == 0:
continue
elif input_line[0] == "delete":
try:
dll.remove(input_line[1])
except:
pass
elif input_line[0] == "deleteFirst":
dll.popleft()
else:
dll.pop()
print(*dll) | 1 | 48,853,617,468 | null | 20 | 20 |
from collections import deque
h, w = map(int, input().split())
meiro = [list(input()) for i in range(h)]
# meiro[y][x]
def bfs(a, b): # a縦b横
mx_dist = 0
dx = [1, 0, -1, 0]
dy = [0, 1, 0, -1]
dist = [[-1] * w for i in range(h)]
dist[a][b] = 0
que = deque([])
que.append((a, b))
while que:
y, x = que.popleft()
D = dist[y][x]
for i in range(4):
X = x + dx[i]
Y = y + dy[i]
if 0 <= Y and Y <= h - 1 and X <= w - 1 and 0 <= X:
if meiro[Y][X] == ".":
if dist[Y][X] == -1:
dist[Y][X] = D + 1
que.append((Y, X))
mx_dist = max(mx_dist, D + 1)
return mx_dist
saidai = 0
for i in range(h):
for j in range(w):
if meiro[i][j] == ".":
saidai = max(saidai, bfs(i, j))
print(saidai)
| N, K = map(int, input().split())
A = list(map(int, input().split()))
left, right = 0, max(A)
while right - left != 1:
mid = (left + right) // 2
tmp = 0
for i in A:
tmp += i // mid - 1 if i % mid == 0 else i // mid
if tmp > K:
left = mid
else:
right = mid
print(right)
| 0 | null | 50,811,576,527,712 | 241 | 99 |
def main():
x, y = map(int, input().split())
mul_xy = x * y
while True:
x, y = y, x % y
if not y:
break
print(int(mul_xy / x))
if __name__ == '__main__':
main()
| import math
A,B = map(int,input().split())
#print(math.gcd(A,B))
C = A*B //(math.gcd(A,B))
print(C)
| 1 | 112,985,508,162,212 | null | 256 | 256 |
N = int(input())
L = [0]
M = list(range(1 , N + 1))
a = 1
for i in range(1 , N):
for j in range(1 ,i + 1):
a = a * j
L.append(a)
a = 1
list.sort(L,reverse = True)
P = list(map(int,input().split()))
Q = list(map(int,input().split()))
con_P = 0
con_Q = 0
for k in range(0 , N - 1):
if k != N - 2:
con_P += L[k] * (M.index(P[k]))
M.remove(P[k])
else:
con_P += L[k] * (M.index(P[k]) + 1)
M = list(range(1 , N + 1))
for l in range(0 , N - 1):
if l != N - 2:
con_Q += L[l] * (M.index(Q[l]))
M.remove(Q[l])
else:
con_Q += L[l] * (M.index(Q[l]) + 1)
ans = con_P - con_Q
if ans < 0:
print(-ans)
else:
print(ans)
| from itertools import permutations
n = int(input())
p = tuple(map(int, input().split()))
q = tuple(map(int, input().split()))
perm = list(permutations(p))
perm.sort()
a = perm.index(p)
b = perm.index(q)
print(abs(a- b))
| 1 | 100,838,560,441,702 | null | 246 | 246 |
n = int(input())
res = 0
for i in range(1,n+1):
for j in range(1,n+1):
if i*j < n:
res += 1
else:
break
print(res) | n = list(input())
print("Yes") if any([i == "7" for i in n]) else print("No")
| 0 | null | 18,474,896,825,414 | 73 | 172 |
from sys import stdin
f_i = stdin
N, M = map(int, f_i.readline().split())
A = list(map(int, f_i.readline().split()))
A.sort()
from bisect import bisect_left
def shake_count(power):
return N ** 2 - sum(bisect_left(A, power - left_hand) for left_hand in A)
lower = A[0] * 2 - 1
upper = A[-1] * 2 + 1
while lower + 1 < upper:
mid = (lower + upper) // 2
if shake_count(mid) >= M:
lower = mid
else:
upper = mid
X = tuple(bisect_left(A, upper - left_hand) for left_hand in A)
from itertools import accumulate
acc = tuple(accumulate([0] + A))
s = acc[-1]
ans = sum(s - acc[x] for x in X) + sum(a * (N - x) for a, x in zip(A, X))
rest_shake_count = M - (N ** 2 - sum(X))
ans += lower * rest_shake_count
print(ans) | from bisect import bisect_right
N, M = map(int, input().split())
A = list(map(int, input().split()))
A.sort()
def calc(m): #m以下の組が何通りあるかを数える
count = 0 #組数を数える
for a in A:
b = m - a #b以上のは含める
count += N - bisect_right(A, b - 0.5)
return count
l = 0
r = 3 * 10 ** 5
while r - l > 1:
mid = (l + r) // 2
if calc(mid) >= M: #合計mid以上の組と手を繋ぐとしたとき、とM回以上握手できる
l = mid
else:
r = mid
B = [0] * (N + 1)
for i in range(N):
B[i + 1] = B[i] + A[i]
# print(B)
flag = False
for i in range(mid + 3, -1, -1):
if calc(i) < M:
flag = False
else: #初めて手をにぎる回数がM回を下回ったとき
break
i += 1 #合計この値までは全て使う、残り回数を調整
ans = 0
for a in A:
b = i - a
tmp = bisect_right(A, b - 0.5)
M -= (N - tmp) #使った数
ans += a * (N - tmp) + (B[-1] - B[tmp])
ans += M * (i - 1)
print (ans) | 1 | 108,128,305,711,250 | null | 252 | 252 |
def main():
n = int(input())
nums = input().split(' ')
s = set()
result = 'YES'
for i in range(n):
num = nums[i]
if num in s:
result = 'NO'
break
s.add(num)
print(result)
if __name__ == '__main__':
main()
| N,D,A=map(int, input().split())
B=[list(map(int, input().split())) for _ in range(N)]
C=sorted(B)
d,E=zip(*C)
import bisect
Damage=[0]*N
for i in range(N):
e=bisect.bisect_right(d,d[i]+2*D)
Damage[i]=e
dd=[0]*(N+1)
cnt=0
for i in range(N):
if i!=0:
dd[i]+=dd[i-1]
h=E[i]
h-=dd[i]
if h>0:
bomb=-(-h//A)
cnt+=bomb
dd[i]+=A*bomb
dd[Damage[i]]-=A*bomb
print(cnt) | 0 | null | 77,969,893,518,880 | 222 | 230 |
import math
def str2list(str):
result = []
for value in str.split(' '):
result.append(int(value))
return result
def distance1(n, x, y):
result = 0
for i in range(n):
result += abs(x[i] - y[i])
return result
def distance2(n, x, y):
result = 0
for i in range(n):
result += (x[i] - y[i]) * (x[i] - y[i])
return math.sqrt(result) if result != 0 else 0
def distance3(n, x, y):
result = 0
for i in range(n):
result += math.pow(abs(x[i] - y[i]), 3)
return math.exp(math.log(result)/3) if result != 0 else 0
def distanceInf(n, x, y):
result = 0
for i in range(n):
new_result = abs(x[i] - y[i])
result = new_result if new_result > result else result
return result
n = int(input());
x = str2list(input())
y = str2list(input())
print('%.6f'%distance1(n, x, y))
print('%.6f'%distance2(n, x, y))
print('%.6f'%distance3(n, x, y))
print('%.6f'%distanceInf(n, x, y)) | N = int(input())
X = input()
ans = [1 for _ in range(N)]
#original 1 count
l = X.count('1')
if l == 0:
for _ in range(N):
print(1)
exit()
if l == 1:
if X[-1] == '1':
for _ in range(N-1):
ans[_] = 2
else:
ans[-1] = 2
for k in range(N):
if X[k] =='1':
ans[k] = 0
for _ in range(N):
print(ans[_])
exit()
intN = int(X, 2)
N1 = intN %(l-1)
N0 = intN % (l+1)
start = []
if N == 1:
if X[0] == '1':
print(0)
exit()
else:
print(1)
exit()
else:
s1 = 1
s0 = 1
for k in range(N-1, -1, -1):
if X[k] == '1':
ia = (N1 - s1)%(l-1)
else:
ia = (N0 + s0)%(l+1)
start.append(ia)
s1 = s1*2%(l-1)
s0 = s0*2%(l+1)
start = start[::-1]
ml = len(bin(l+1))-2
poplist = [0 for _ in range(N)]
t = 1
while t < N + 1:
t *= 2
for k in range(t//2, N, t):
for j in range(t//2):
if k+j>N-1:
break
poplist[k+j] += 1
"""
def popcount(n):
c = 0
n = bin(n)[2:]
for k in range(len(n)):
if n[k] == '1':
c+=1
return c
"""
for k in range(len(start)):
for count in range(10*5):
if start[k] == 0:
ans[k] += count
break
else:
start[k] = start[k] % poplist[start[k]]
for k in range(N):
print(ans[k]) | 0 | null | 4,182,265,053,148 | 32 | 107 |
S,W=map(int,input().split())
if S<=W:
print("unsafe")
elif S>W:
print("safe") | S,W = map(int,input().split())
print('safe' if S > W else 'unsafe') | 1 | 29,225,433,945,088 | null | 163 | 163 |
s = input()
k = int(input())
ans = 0
lens = len(s)
# n -> n//2
def tansaku(moji, n, m, k):
# n以上 m未満を探索する.
ansr = 0
cntt = 1
for i in range(n, m-1):
if moji[i] == moji[i + 1]:
cntt += 1
else:
ansr += (cntt // 2) * k
cntt = 1
ansr += (cntt // 2) * k
return ansr
cnnt = 1
hentai = False
for i in range(lens-1):
if s[i] == s[i+1]:
cnnt += 1
if cnnt == lens:
hentai = True
if not hentai:
if k >= 2:
zencnts = 0
atocnts = 0
if s[lens-1] == s[0]:
for i in range(lens):
if s[lens-1-i] == s[lens-1]:
zencnts += 1
else:
break
for i in range(lens):
if s[i] == s[0]:
atocnts += 1
else:
break
news = s[atocnts:] + s[:atocnts]
news1 = s[atocnts:]
news2 = s[:atocnts]
ans += tansaku(news, 0, lens, k-1)
ans += tansaku(news1, 0, lens-atocnts, 1)
ans += tansaku(news2, 0, atocnts, 1)
print(ans)
else:
ans += tansaku(s, 0, lens, 1)
print(ans)
else:
print((lens*k)//2) | r = float(input())
pi = 3.1415
print(r * 2 * pi) | 0 | null | 102,971,889,597,900 | 296 | 167 |
raw_data = input()
data = raw_data.replace('?', 'D')
print(data) | T=input()
print(T.replace('?','D')) | 1 | 18,479,711,524,160 | null | 140 | 140 |
# coding=utf-8
if __name__ == '__main__':
N, M = map(int, input().split())
li = list(map(int, input().split()))
lisum = sum(li)
cnt = 0
for i in range(N):
if lisum / (M * 4) <= li[i]:
cnt += 1
if M <= cnt:
print('Yes')
else:
print('No')
| import re
data = input().split()
stack = []
for elem in data:
if re.match('\d+', elem):
stack.append(int(elem))
else:
a = stack.pop()
b = stack.pop()
if elem == "+":
stack.append(b+a)
elif elem == "-":
stack.append(b-a)
elif elem == "*":
stack.append(b*a)
print(stack[0]) | 0 | null | 19,445,115,788,232 | 179 | 18 |
cnt = 0
def insertionSort(A, n, g):
global cnt
for i in range(g, n):
v = A[i]
j = i - g
while (j >= 0) and (A[j] > v):
A[j + g] = A[j]
j = j - g
cnt += 1
A[j + g] = v
def shellSort(A, n):
G = [1]
for i in range(1, 100):
G.append(G[i - 1] * 3 + 1)
G = list(reversed([g for g in G if g <= n]))
m = len(G)
print(m)
if G:
print(*G)
for i in range(m):
insertionSort(A, n, G[i])
print(cnt)
n = int(input())
A = [int(input()) for _ in range(n)]
shellSort(A, n)
[print(a) for a in A]
| def read_n_lows_input(n):
Alist=[int(input()) for i in range(n)]
return Alist
def print_list(A):
print(*A, sep=" ")
def print_list_multi_low(A):
for i in A:
print(i)
def insertion_sort(A, n, g, cnt):
for i in range(g-1, n):
v = A[i]
j = i - g
while j >= 0 and A[j] > v:
A[j+g] = A[j]
j -= g
cnt += 1
A[j+g] = v
return A, cnt
def shell_sort(A, n):
cnt = 0
G0 = [797161, 265720, 88573, 29524, 9841, 3280, 1093, 364, 121, 40, 13, 4, 1]
G = [i for i in G0 if i <= n]
m = len(G)
print(m)
print_list(G)
for i in range(m):
A, cnt = insertion_sort(A, n, G[i], cnt)
print(cnt)
print_list_multi_low(A)
n=int(input())
A = read_n_lows_input(n)
shell_sort(A, n)
| 1 | 28,327,854,408 | null | 17 | 17 |
result = [(temp1 + str(temp2)) for temp1 in ('S ','H ','C ','D ') for temp2 in range(1,14)]
for check in range(int(input())) :
result.remove(input())
for temp in result :
print(temp) | import sys
ERROR_INPUT = 'input is invalid'
def main():
n = get_length()
arr = get_array(length=n)
insetionSort(li=arr, length=n)
return 0
def get_length():
n = int(input())
if n < 0 or n > 100:
print(ERROR_INPUT)
sys.exit(1)
else:
return n
def get_array(length):
nums = input().split(' ')
return [str2int(string=n) for n in nums]
def str2int(string):
n = int(string)
if n < 0 or n > 1000:
print(ERROR_INPUT)
sys.exit(1)
else:
return n
def insetionSort(li, length):
for n in range(0, length):
print(*(sorted(li[0:n + 1]) + li[n + 1:length]))
main() | 0 | null | 537,206,432,908 | 54 | 10 |
l,r,f = map(int,input().split())
count = 0
for i in range(l,r+1):
if i % f == 0 :
count = count + 1
print(count) | 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) | 1 | 7,531,885,347,132 | null | 104 | 104 |
A, B = input().split()
A = int(A)
B = int(B.replace('.',''))
print(f'{A*B//100}') | a, b = map(float, input().split())
ib = b * 100
ans = int(a) * round(ib) // 100
print(ans) | 1 | 16,556,414,126,340 | null | 135 | 135 |
N,K=map(int,input().split())
List = list(map(int, input().split()))
List.sort(reverse = True)
res = 0
for i in range(N):
if i <= K-1:
pass
else:
res += List[i]
print(res) | a,b = map(int,input().split())
lis = list(map(int,input().split()))
lis.sort(reverse=True)
print(sum(lis[b:])) | 1 | 79,324,609,070,102 | null | 227 | 227 |
# coding: utf-8
# Your code here!
def main():
k = int(input())
s = input()
if len(s) <= k:
print(s)
else:
print(s[:k] + "...")
main() | k=int(input())
s=input()
n=len(s)
if(n<=k):
print(s)
else:
print(s[:k]+'...')
| 1 | 19,640,738,249,870 | null | 143 | 143 |
n, x, t = map(int,input().split())
a = (int)(n / x)
if n % x != 0:
a += 1
print(a * t) | NXT= [int(i) for i in input().split(' ')]
i=NXT[0]
count=0
while i>0:
i -= NXT[1];count +=1
print(int(NXT[2]*count)) | 1 | 4,272,942,279,752 | null | 86 | 86 |
n = int(input())
R = [int(input()) for i in range(n)]
minv = float('inf')
maxv = -float('inf')
for r in R:
maxv = max(maxv, r-minv)
minv = min(minv, r)
print(maxv) | N=int(raw_input())
max=(-1)*(10**9)
x1=input()
min=x1
for i in range(N-1):
x=int(raw_input())
if max < x-min:
max=x-min
if min>x:
min=x
print max | 1 | 11,849,684,462 | null | 13 | 13 |
import sys
from collections import deque
S = deque(input())
Q = int(input())
reverse = False
for _ in range(Q):
q = sys.stdin.readline()
if q[0] == "1":
reverse = not reverse
else:
_, f, c = q.split()
if f == "1":
if reverse:
S.append(c)
else:
S.appendleft(c)
else:
if reverse:
S.appendleft(c)
else:
S.append(c)
if reverse:
S.reverse()
ans = "".join(S)
print(ans) | from collections import deque
import sys
flg1 = 1
s = input()
ll = deque()
lr = deque()
for _ in range(int(input())):
q = sys.stdin.readline().rstrip()
if q == "1":
flg1 *= -1
else:
q = list(q.split())
flg2 = 1 if q[1] == "1" else -1
if flg1 * flg2 == 1:
ll.appendleft(q[2])
else:
lr.append(q[2])
ans = "".join(ll) + s + "".join(lr)
print((ans[::-1], ans)[flg1 == 1]) | 1 | 57,285,802,105,642 | null | 204 | 204 |
time = int(input())
s = time % 60
h = time // 3600
m = (time - h * 3600) // 60
print(str(h) + ":" + str(m) + ":" + str(s))
| def main():
abcd = [int(_x) for _x in input().split()]
a = abcd[0]
b = abcd[1]
c = abcd[2]
d = abcd[3]
while True:
c = c - b
if c <= 0:
print("Yes")
return
a = a - d
if a <= 0:
print("No")
return
main()
| 0 | null | 14,984,651,403,020 | 37 | 164 |
N,X = map(int,input().split())
Y = N - sum(map(int,input().split()))
print(("-1",Y)[Y >= 0]) | import sys
input = sys.stdin.readline
N, M = map(int, input().split())
if M%2:
cnt = 0
for i in range(1, M//2 + 1):
cnt += 1
print(i, M + 2 - i)
print(M + 1 + i, 2*M + 2 - i)
i = cnt + 1
print(i, M + 2 - i)
else:
for i in range(1, M//2 + 1):
print(i, M + 2 - i)
print(M + 1 + i, 2*M + 2 - i) | 0 | null | 30,479,812,377,208 | 168 | 162 |
n,k,c = map(int, input().split())
s = input()
L = []
L.append(-c)
workday = 1
for i in range(1, n+1):
if i <= L[workday-1] + c:
continue
if s[i-1] == 'x':
continue
L.append(i)
workday += 1
if workday == k + 1:
break
R = [0] * (k+2)
R[k+1] = n + c + 1
workday = k
for i in range(n, 0, -1):
if i >= R[workday+1] - c:
continue
if s[i-1] == 'x':
continue
R[workday] = i
workday -= 1
if workday == 0:
break
for i in range(1, k+1):
if L[i] == R[i]:
print(L[i]) | n = int(input())
a = list(map(int, input().split()))
INF = 1001001001001001
c = n//2
dp = [[-INF]*3 for _ in range(c+1)]
dp[0][0] = 0
for i in range(c+1):
for j in range(3):
for k in range(3):
if i+1<=c and j+k<3 and 2*i+j+k<n:
dp[i+1][j+k] = max(dp[i+1][j+k], dp[i][j]+a[2*i+j+k])
ans = -INF
for i in range(3):
ans = max(ans,dp[c][i])
print(ans) | 0 | null | 39,118,042,183,348 | 182 | 177 |
while True:
H, W = map(int, input().split())
if H == 0 and W == 0:
break
square = [['#'] * W] * H
for row in square:
print(''.join(row))
print()
| s = list(input())
k = int(input())
if len(set(s)) == 1:
print((len(s)*k)//2)
exit()
def n_change(sss):
s = sss.copy()
x = 0
for i in range(1, len(s)):
if s[i] == s[i-1]:
s[i] = "X"
x += 1
return x
print(n_change(s) + (k-1) * (n_change(2*s) - n_change(s))) | 0 | null | 88,443,851,522,136 | 49 | 296 |
def main():
inf = 1<<29
n,m = map(int,input().split())
coins = list(map(int,input().split()))
dp = [inf]*(n+1)
dp[0] = 0
for i in range(1,n+1):
for j in range(m):
if i-coins[j]<0:continue
dp[i] = min(dp[i],dp[i-coins[j]]+1)
print (dp[n])
if __name__ == '__main__':
main()
| # dp[i][j](各マスの値) = i-1番目の品物の中からj円を支払うときの最小枚数
# → 個数制限なし
# <DP初期状態>
# i\j 0 1 2 3 ... n (お金(yen))
# 0 0 INF INF INF ... INF
# 1 0 INF INF INF ... INF
# ...
# m-1 0 INF INF INF ... INF
# m 0 INF INF INF ... INF
# (i番目のコイン)
#
# <DP遷移式>
# if(j >= c_i): c[i]のコイン採用可
# dp[i+1] = min(dp[i][j-c[i]]+1 : c[i]を採用する(コイン枚数:1枚増える)
# , dp[i][j]) : c[i]を採用しない
# , dp[i+1][j-c[i]]+1) : c[i]を重複を許して採用
# elif(j < c_j): money[i]のコイン採用不可
# dp[i+1][j] = dp[i][j] : c[i]を採用しない
n,m = map(int,input().split())
c = list(map(int,input().split()))
# DP配列の初期化
dp = []
for i in range(m+100):
tmp = [0]
for j in range(n+99): tmp.append(float('inf'))
dp.append(tmp)
# DP遷移
for i in range(m):
#print_dp(dp,i)
for j in range(n+1):
if(j>=c[i]): # i番目のコイン採用可
dp[i+1][j] = min(dp[i][j-c[i]]+1,
dp[i][j],
dp[i+1][j-c[i]]+1)
else: # i番目のコイン採用不可
dp[i+1][j] = dp[i][j]
#print_dp(dp,i+1)
# 出力
print(dp[m][n])
| 1 | 139,769,244,390 | null | 28 | 28 |
import sys
readline = sys.stdin.readline
D = int(readline())
C = list(map(int,readline().split()))
S = [None] * D
for i in range(D):
s = list(map(int,readline().split()))
S[i] = s
def calc_score(arr):
point = 0
last_submit = [-1] * 26
for i in range(len(arr)):
point += S[i][arr[i]]
last_submit[arr[i]] = i
for j in range(len(last_submit)):
point -= (i - last_submit[j]) * C[j]
print(point)
return point
T = [None] * D
for i in range(D):
T[i] = int(readline()) - 1
ans = calc_score(T)
| d = int(input())
c = list(map(int, input().split()))
s = [list(map(int, input().split())) for _ in range(d)]
t = [int(input()) - 1 for _ in range(d)]
def scoring(d, c, s, t):
v = []
memo = [0 for _ in range(26)]
for i in range(d):
if i == 0:
score = 0
else:
score = v[-1]
score += s[i][t[i]]
memo[t[i]] = i + 1
for j in range(26):
score -= c[j] * (i+1 - memo[j])
v.append(score)
return v
v = scoring(d, c, s, t)
print(*v, sep='\n') | 1 | 9,899,011,791,332 | null | 114 | 114 |
n,k=list(map(int,input().split()))
mod=10**9+7
def modinv(x):
return pow(x,mod-2,mod)
ans=1
comb1=1
comb2=1
for i in range(1,min(n-1,k)+1):
comb1*=(n-i+1)*modinv(i)
comb2*=(n-i)*modinv(i)
comb1%=mod
comb2%=mod
ans+=comb1*comb2
ans%=mod
print(ans) | M=10**9+7
n,k=map(int,input().split())
l=[1]
f=1
for i in range(n):
f=f*(i+1)%M
l+=[f]
a=0
for i in range(min(n,k+1)):
c=l[n]*l[n-1]%M
p=l[i]**2*l[n-i]*l[n-i-1]%M
a+=c*pow(p,M-2,M)
print(a%M) | 1 | 66,856,613,168,554 | null | 215 | 215 |
MOD = 10 ** 9 + 7
INF = 10 ** 10
import sys
sys.setrecursionlimit(100000000)
dy = (-1,0,1,0)
dx = (0,1,0,-1)
def main():
n,k = map(int,input().split())
a = list(map(int,input().split()))
cum = [0] * (n + 1)
dic = {0:1}
ans = 0
for i in range(min(n,k - 1)):
cum[i + 1] = (cum[i] + a[i])%k
tmp = (cum[i + 1] - i - 1)%k
if tmp in dic:
dic[tmp] += 1
else:
dic[tmp] = 1
for v in dic.values():
ans += v * (v - 1)//2
for i in range(max(n - k + 1,0)):
dic[(cum[i] - i)%k] -= 1
cum[i + k] = (cum[i + k - 1] + a[i + k - 1])%k
tmp = (cum[i + k] - i - k)%k
if tmp in dic:
ans += dic[tmp]
dic[tmp] += 1
else:
dic[tmp] = 1
print(ans)
if __name__ =='__main__':
main()
| import sys
input = sys.stdin.readline
sys.setrecursionlimit(10000000)
from collections import defaultdict
from bisect import *
mod = 10**9+7
H = int(input())
W = int(input())
N = int(input())
h, w = max(H, W), min(H, W)
cnt, ans = 0, 0
while cnt < N:
cnt += h
ans += 1
print(ans)
| 0 | null | 113,308,319,872,370 | 273 | 236 |
N = int(input())
if N % 2 == 1:
print(0)
exit()
ans = 0
i = 1
while 5 ** i * 2 <= N:
ans += N // (5 ** i * 2)
i += 1
print(ans)
| from collections import Counter
def main():
n = int(input())
S = [input() for _ in range(n)]
S_c = Counter(S)
num = list(S_c.values()).count(max(list(S_c.values())))
anss = S_c.most_common()[:num]
for ans in sorted(anss):
print(ans[0])
if __name__ == '__main__':
main()
| 0 | null | 92,756,435,650,230 | 258 | 218 |
def bubble_sort(A, n):
flag = 1
i = 0
count = 0
while flag:
flag = 0
for j in range(n-1, i, -1):
if A[j] < A[j-1]:
A[j], A[j-1] = A[j-1], A[j]
flag = 1
count += 1
i += 1
print(' '.join(map(str, A)))
print(count)
if __name__ == '__main__':
n = int(input())
A = list(map(int, input().split()))
bubble_sort(A, n) | n = input()
n = n.split()
m = int(n[1])
n = int(n[0])
a = input()
a = a.split()
c = int(a[0])
for b in range(n-1):
c = c + int(a[b+1])
c = c / (4 * m)
e = 0
for d in range(n):
if int(a[d]) >= c :
e = e + 1
if e >= m:
print("Yes")
else:
print("No") | 0 | null | 19,257,062,201,678 | 14 | 179 |
h,n = map(str,input().split())
#li = [int(x) for x in input().split()]
print(n+h) | i = raw_input().strip().split()
l = [int(i[0]),int(i[1]),int(i[2])]
tmp = 0
for j in range(3):
for k in range(3):
if l[k] > l[j]:
tmp = l[j]
l[j] = l[k]
l[k] = tmp
print str(l[0])+" "+str(l[1])+" "+str(l[2]) | 0 | null | 51,737,518,358,162 | 248 | 40 |
n=int(input());print((n//2)/n if n%2==0 else -(-n//2)/n) | def resolve():
s = int(input())
dp = [0] * (s + 1)
dp[0] = 1
for i in range(1, s + 1):
for j in range(0, (i - 3 + 1)):
dp[i] += dp[j]
dp[i] %= 10**9 + 7
print(dp[s])
resolve() | 0 | null | 90,047,099,270,204 | 297 | 79 |
num_list = raw_input().split()
num_list = map(int, num_list)
def gcd(x, y):
if x < y:
x, y = y, x
while (y>0):
r = x % y
x = y
y = r
return x
x = num_list[0]
y = num_list[1]
print gcd(x, y) | import sys
import numpy as np
from collections import defaultdict
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
N, K = lr()
A = np.array([1] + lr())
A = (A-1) % K
N += 1
# 累積和が同じになっている箇所に注目、要素がK-1離れている組み合わせは無理
Acum = (A.cumsum() % K).tolist()
answer = 0
dic = defaultdict(int)
for i, cur in enumerate(Acum):
answer += dic[cur]
dic[cur] += 1
if i >= K-1:
vanish = Acum[i-(K-1)]
dic[vanish] -= 1
print(answer)
# 10 | 0 | null | 68,727,918,928,772 | 11 | 273 |
s,w = map(int, input().split())
ans = ['unsafe' if w >= s else 'safe']
print(ans[0]) | import sys
sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
f_inf = float('inf')
mod = 10 ** 9 + 7
def resolve():
n, t = map(int, input().split())
AB = sorted([list(map(int, input().split())) for _ in range(n)], key=lambda x: x[0])
res = 0
dp = [[0] * (t + 1) for _ in range(n + 1)]
for i in range(1, n + 1):
a, b = AB[i - 1]
for j in range(1, t + 1):
if j - a >= 0:
dp[i][j] = max(dp[i - 1][j], dp[i - 1][j - a] + b)
else:
dp[i][j] = max(dp[i - 1][j], dp[i][j])
now = dp[i - 1][t - 1] + b
res = max(res, now)
print(res)
if __name__ == '__main__':
resolve()
| 0 | null | 90,679,672,149,752 | 163 | 282 |
import numpy as np
N = int(input())
X = str(input())
num_one = X.count("1")
dp = [-1] * N
dp[0] = 0
def dfs(n):
if dp[n] == -1:
dp[n] = 1 + dfs(n % bin(n).count('1'))
return dp[n]
num_one = X.count("1")
bool_arr = np.array([True if X[N-i-1] == "1" else False for i in range(N)])
zero_ver = np.array([pow(2, i, num_one + 1) for i in range(N)])
zero_ver_sum = sum(zero_ver[bool_arr])
one_ver = -1
one_ver_sum = 0
flag = False
if num_one != 1:
one_ver = np.array([pow(2, i, num_one - 1) for i in range(N)])
one_ver_sum = sum(one_ver[bool_arr])
else:
flag = True
for i in range(1,N+1):
start = 0
if bool_arr[N-i] == False:
start = (zero_ver_sum + pow(2, N - i, num_one + 1)) % (num_one + 1)
print(dfs(start)+1)
else:
if flag:
print(0)
else:
start = (one_ver_sum - pow(2, N - i, num_one - 1)) % (num_one - 1)
print(dfs(start)+1)
| def resolve():
N = int(input())
X = input()
Xint = int(X,2)
popX = X.count("1")
if popX == 1:
idx = X.find("1")
for i in range(N):
if i == idx:
print(0)
else:
if i != N-1:
if X[-1] == "0":
print(1)
else:
print(2)
else:
print(2)
return
Xmod_plus = Xint % (popX+1)
Xmod_minus = Xint % (popX-1)
pop_2expi_p = {0:1}
pop_2expi_m = {0:1}
for i in range(1,N):
pop_2expi_p[i] = pop_2expi_p[i-1] * 2 % (popX+1)
pop_2expi_m[i] = pop_2expi_m[i-1] * 2 % (popX-1)
for i in range(N):
count = 1
if X[i] == "1":
nX = (Xmod_minus - pop_2expi_m[N-1-i] ) % (popX-1)
if X[i] == "0":
nX = (Xmod_plus + pop_2expi_p[N-1-i] ) % (popX+1)
for j in range(N):
if nX == 0:
break
else:
nX %= bin(nX).count("1")
count += 1
print(count)
resolve() | 1 | 8,206,715,029,578 | null | 107 | 107 |
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
def size(self,x):
return self.parents[self.find(x)]
N,M,K=map(int,input().split())
uf=UnionFind(N+1)
friends={x:set() for x in range(1,N+1)}
blocks={x:set() for x in range(1,N+1)}
ans=[N-1]*(N+1)
for _ in range(M):
A,B=map(int,input().split())
friends[A].add(B)
friends[B].add(A)
uf.union(A,B)
for _ in range(K):
C,D=map(int,input().split())
if uf.find(C)==uf.find(D):
blocks[C].add(D)
blocks[D].add(C)
for i in range(1,N+1):
if uf.size(i)==-1:
print(0)
continue
print(abs(uf.size(i))-len(friends[i])-len(blocks[i])-1,end=' ') | N = int(input())
a = []
for i in range(N):
a = list(map(int, input().split()))
side_a = a[0]
side_b = a[1]
side_c = a[2]
if side_a ** 2 + side_b ** 2 == side_c ** 2 \
or side_c ** 2 + side_b ** 2 == side_a ** 2 \
or side_a ** 2 + side_c ** 2 == side_b ** 2:
print("YES")
else:
print("NO") | 0 | null | 30,968,123,006,812 | 209 | 4 |
n = int(input())
if n == 1:
print(0)
exit()
def factorization(n):
arr = []
temp = n
for i in range(2, int(-(-n**0.5//1))+1):
if temp%i==0:
cnt=0
while temp%i==0:
cnt+=1
temp //= i
arr.append([i, cnt])
if temp!=1:
arr.append([temp, 1])
if arr==[]:
arr.append([n, 1])
return arr
chk = factorization(n)
ans = 0
for num,k in chk:
now = 1
while True:
if k < now:
break
ans += 1
k -= now
now += 1
print(ans) | import sys
# x = abs(int(input()))
# k = int(input())
# d = int(input())
array = list(map(int, input().strip().split()))
x = abs(array[0])
k = array[1]
d = array[2]
if (d == 0):
amari = abs(x)
else:
move_cnt = int(x / d)
if (move_cnt <= k):
k -= move_cnt
amari = x - move_cnt * d
else:
amari = x - k * d
k = 0
if (k > 0):
if (k % 2 == 1):
if (amari > 0):
amari -= d
else:
amari += d
print(abs(amari)) | 0 | null | 11,133,293,466,052 | 136 | 92 |
n,m=map(int,input().split())
if n%2==1:
for i in range(m):
print(i+1, n-i-1)
else:
used = [False]*n
next = [i+1 for i in range(m)][::-2]+[i+1 for i in range(m)][-2::-2]
i=0
now=0
count=0
while True:
if used[now]==False and used[now+next[i]]==False:
print(now+1, now+next[i]+1)
count+=1
if count==m:
break
used[now]=True
used[now+next[i]]=True
i+=1
now+=1
else:
now+=1 | n = int(input())
S = set(map(int, input().split()))
q = int(input())
T = list(map(int, input().split()))
sum = 0
for i in T:
if i in S:
sum +=1
print(sum) | 0 | null | 14,270,104,304,540 | 162 | 22 |
from collections import defaultdict
n, k = map(int, input().split())
a = list(map(lambda x: int(x) - 1, input().split()))
s = [0] * (n + 1)
for i in range(n):
s[i + 1] = (s[i] + a[i]) % k
mp = defaultdict(int)
ans = 0
for i in range(n + 1):
ans += mp[s[i]]
mp[s[i]] += 1
if i >= k - 1:
mp[s[i - k + 1]] -= 1
print(ans)
| n = int(input())
print((n - (n+1)%2)//2) | 0 | null | 146,006,129,617,852 | 273 | 283 |
n = int(input())
a = list(map(str,input().split()))
a.sort()
ans = 'YES'
for i in range(n-1):
if a[i] == a[i+1]:
ans = 'NO'
break
print(ans) | n=int(input())
a=[int(v) for v in input().split()]
check=1
a.sort()
for i in range (0,n-1):
if a[i]==a[i+1]:
check=0
break
if check==0:
print("NO")
else:
print("YES")
| 1 | 73,915,353,241,352 | null | 222 | 222 |
def main():
N, S = map(int, input().split())
A = list(map(int, input().split()))
return solve(N, S, A)
def solve(N, S, A):
mod = 998244353
dp = [0] * (S + 1)
dp[0] = pow(2, N, mod)
div2 = pow(2, mod - 2, mod)
m = 0
for a in A:
m += a
for i in reversed(range(a, min(S, m) + 1)):
dp[i] = (dp[i] + dp[i - a] * div2) % mod
return dp[S]
print(main())
| n,s = map(int,input().split())
a = list(map(int,input().split()))
if n == 1:
if a[0] == s:
print(1)
quit()
else:
print(0)
quit()
mod = 998244353
dp = [[0]*(s+1) for _ in range(n+1)]
dp[0][0] = 1
for i in range(n):
dp[i+1][0] = 2*dp[i][0]%mod
for j in range(s+1):
dp[i+1][j] = dp[i][j]*2%mod
if a[i] <= s:
for j in range(a[i],s+1):
dp[i+1][j] += dp[i][j-a[i]]
dp[i+1][j] %= mod
print(dp[-1][-1]%mod) | 1 | 17,688,439,637,440 | null | 138 | 138 |
t1, t2 = map(int,input().split())
a1, a2 = map(int,input().split())
b1, b2 = map(int,input().split())
a1 = t1*a1
a2 = t2*a2
b1 = t1*b1
b2 = t2*b2
if (a1 + a2) == (b1 + b2):
print('infinity')
exit(0)
elif (a1 + a2) > (b1 + b2):
a1, b1 = b1, a1
a2, b2 = b2, a2
if b1 > a1:
print(0)
exit(0)
tmp00 = a1 - b1
tmp01 = b1 + b2 - a1 - a2
ans = tmp00 // tmp01 * 2 + 1
if tmp00 % tmp01 == 0:
ans -= 1
print(ans) | import numpy as np
t1,t2 = map(int, input().split())
a1,a2 = map(int, input().split())
b1,b2 = map(int, input().split())
# まず大きい方にswap
if a1 <= b1:
a1,b1 = b1,a1
a2,b2 = b2,a2
# t1での距離
x1 = a1*t1 - b1*t1
# t2での距離
x2 = x1 + a2*t2 - b2*t2
if x2 == 0:
print("infinity")
elif x2 > 0:
print(0)
else:
ans = int(np.ceil(x1/abs(x2))*2)
if x1 % abs(x2) != 0:
ans -= 1
print(ans) | 1 | 131,580,308,576,412 | null | 269 | 269 |
n,k = map(int,input().split())
i = 0
while True :
s = k **i
if n < s :
ans = i
break
i += 1
print(ans) | n,k = [int(x) for x in input().split()]
res = 0
while n > 0:
n //= k
res += 1
print(res) | 1 | 64,551,821,991,780 | null | 212 | 212 |
A,B,C = map(int,input().split())
if A+B+C <= 21:
print("win")
else:
print("bust") |
n = input()
s = []
h = []
c = []
d = []
for i in range(n):
spare = raw_input().split()
if spare[0]=='S':
s.append(int(spare[1]))
elif spare[0]=='H':
h.append(int(spare[1]))
elif spare[0]=='C':
c.append(int(spare[1]))
else :
d.append(int(spare[1]))
for j in range(1,14):
judge = True
for k in range(len(s)):
if j==s[k] :
judge = False
break
if judge :
print 'S %d' %j
for j in range(1,14):
judge = True
for k in range(len(h)):
if j==h[k] :
judge = False
break
if judge :
print 'H %d' %j
for j in range(1,14):
judge = True
for k in range(len(c)):
if j==c[k] :
judge = False
break
if judge :
print 'C %d' %j
for j in range(1,14):
judge = True
for k in range(len(d)):
if j==d[k] :
judge = False
break
if judge :
print 'D %d' %j | 0 | null | 60,033,888,764,412 | 260 | 54 |
if int(input()) >= 30:
print('Yes')
else:
print('No') | # 41m AC
from collections import Counter
import sys
def input(): return sys.stdin.readline().strip()
def I(): return int(input())
def LI(): return list(map(int, input().split()))
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 S(): return input()
def LS(): return input().split()
INF = float('inf')
n = I()
if n % 2 != 0:
print(0)
exit()
ans = 0
i = 10
while i <= n:
ans += n // i
i *= 5
print(ans)
| 0 | null | 60,763,194,710,206 | 95 | 258 |
N, k = map(int, input().split())
dp = [0] * (N+1)
dp[1] = 1
S = []
for i in range(k):
S.append(list(map(int, input().split())))
for i in range(2, N+1):
for l, r in S:
dp[i] += (dp[max(i-l, 0)] - dp[max(i-r-1, 0)])
dp[i] += dp[i-1]
dp[i] %= 998244353
print((dp[N] - dp[N-1])%998244353) | mod = 998244353
n, k = map(int, input().split())
s = []
for _ in range(k):
l, r = map(int, input().split())
s.append((l, r))
dp = [0] * (n + 1)
dp[1] = 1
for i in range(2, n+1):
for l, r in s:
jl = max(i - l, 0)
jr = max(i - r - 1, 0)
dp[i] = (dp[i] + dp[jl] - dp[jr]) % mod
dp[i] += dp[i-1]
print((dp[n] - dp[n-1]) % mod)
| 1 | 2,689,145,580,732 | null | 74 | 74 |
import sys
read = sys.stdin.read
readlines = sys.stdin.readlines
def main():
n, *a = map(int, read().split())
r = 0
minp = a[0]
for i1 in range(n):
if minp >= a[i1]:
r += 1
minp = a[i1]
print(r)
if __name__ == '__main__':
main()
| from pprint import pprint
n,m=map(int,input().split())
c=list(map(int,input().split()))
dp=[[10**5]*(n+1) for _ in range(m+1)]
dp[0][0]=0
for i in range(m):
for j in range(n+1):
if c[i]>j:
dp[i+1][j]=dp[i][j]
else:
dp[i+1][j]=min(dp[i][j],dp[i][j-c[i]]+1,dp[i+1][j-c[i]]+1)
# pprint(dp)
print(dp[m][n])
| 0 | null | 43,045,620,088,380 | 233 | 28 |
#!/usr/bin/env python3
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)
a, b, c = map(int, input().split())
if a + b + c > 21:
print('bust')
else:
print('win')
| n,d,a = map(int,input().split())
xh = [list(map(int,input().split())) for _ in range(n)]
xh.sort()
ans = 0
att = [0]*n
cnt = 0
f = []
f1 = [0]*n
for x,h in xh:
f.append(h)
for i in range(n):
tmp = xh[i][0] + 2 * d
while cnt < n:
if xh[cnt][0] <= tmp:
cnt += 1
else:
break
att[i] = min(cnt-1, n-1)
for i in range(n):
if f[i] > 0:
da = -(-f[i]//a)
ans += da
f1[i] -= da * a
if att[i]+1 < n:
f1[att[i]+1] += da * a
if i < n-1:
f1[i+1] += f1[i]
f[i+1] += f1[i+1]
print(ans)
| 0 | null | 100,996,106,702,020 | 260 | 230 |
#!/usr/bin/env python3
import sys
import collections as cl
def II():
return int(sys.stdin.readline())
def MI():
return map(int, sys.stdin.readline().split())
def LI():
return list(map(int, sys.stdin.readline().split()))
def main():
n, x, y = MI()
ans = [0] * (n)
for i in range(1, n + 1):
for j in range(i + 1, n + 1):
dis = min(j - i, abs(i - x) + abs(j - y) + 1)
ans[dis] += 1
for i in range(1, n):
print(ans[i])
main()
| N,X,Y = map(int, input().split())
X,Y = X-1,Y-1
ans = [0] * N
for i in range(N):
for j in range(i+1,N):
dist = min(abs(i-j), abs(i-X) + 1 + abs(Y-j))
ans[dist] += 1
print(*ans[1:], sep='\n') | 1 | 44,081,192,605,450 | null | 187 | 187 |
import sys
read = sys.stdin.read
readlines = sys.stdin.readlines
def main():
n, m, *a = map(int, read().split())
suma = sum(a)
if n < suma:
print(-1)
else:
print(n - suma)
if __name__ == '__main__':
main()
| N, M = map(int, input().split())
A = list(map(int, input().split()))
def answer(N: int, M: int, A: list) -> int:
homework_days = 0
for i in range(0, M):
homework_days += int(A[i])
i += 1
if homework_days <= N:
return N - homework_days
else:
return -1
print(answer(N, M, A)) | 1 | 32,044,375,588,420 | null | 168 | 168 |
from math import ceil
from collections import deque
n,d,a = map(int, input().split())
monster = [list(map(int,input().split())) for i in range(n)]
monster.sort()
damage = 0
finish = deque()
ans = 0
for i in range(n):
x,h = monster[i]
while finish:
if finish[0][0]<x:
damage -= finish.popleft()[1]
else:
break
if h<=damage:
continue
else:
b = ceil((h-damage)/a)
ans += b
damage += b*a
finish.append([x+2*d,b*a])
print(ans)
| n = int(input())
st = input()
if st[:n//2] == st[n//2:]: print("Yes")
else: print("No") | 0 | null | 114,420,487,412,650 | 230 | 279 |
n = int(input())
shou500 = n//500
shou5 = (n-shou500*500)//5
print(shou500*1000+shou5*5) | N = int(input())
a500 = N //500
N = N - 500 *a500
a5 = N//5
res = 1000*a500 +5*a5
print(res) | 1 | 42,660,264,065,212 | null | 185 | 185 |
import math
a,b = map(int,input().split())
d = (int)((a*b+1)/2)
if a == 1 or b == 1:
print(1)
else :
print(d)
| a = input("")
if "A" in a and "B" in a:
print("Yes")
else:
print("No") | 0 | null | 53,010,697,551,680 | 196 | 201 |
# 146A
S = input()
if S == 'SUN':
answer = (7)
elif S == 'MON':
answer = (6)
elif S == 'TUE':
answer = (5)
elif S == 'WED':
answer = (4)
elif S == 'THU':
answer = (3)
elif S == 'FRI':
answer = (2)
elif S == 'SAT':
answer = (1)
print(answer) | n = len(input())
print('x' * n) | 0 | null | 102,421,097,102,720 | 270 | 221 |
x,y = map(int,input().split())
#xをベースに
r = 0 #→2 ↑1
u = x #→1 ↑2
while y != r + u*2:
u -= 2
r += 1
if u < 0: #到達する方法がない
print(0)
exit()
#modありのコンビネーション計算
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 = u+r+1 #必要な数
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 )
print(cmb(u+r,r,mod))
| import sys
import numpy as np
read = sys.stdin.read
readline = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 8)
INF = float('inf')
MOD = 10 ** 9 + 7
def main():
X, Y = map(int, readline().split())
if X%3==Y%3==1 or X%3==Y%3==2:
print(0)
sys.exit()
a = (2*Y-X)//3
b = (2*X-Y)//3
N = a+b
fact = [1, 1]
factinv = [1, 1]
inv = [0, 1]
for i in range(2, N + 1):
fact.append((fact[-1] * i) % MOD)
inv.append((-inv[MOD % i] * (MOD // i)) % MOD)
factinv.append((factinv[-1] * inv[-1]) % MOD)
def cmb(n, r, mod):
if (r < 0) or (n < r):
return 0
r = min(r, n - r)
return fact[n] * factinv[r] * factinv[n - r] % mod
print(cmb(N, a, MOD))
if __name__ == '__main__':
main()
| 1 | 149,742,849,150,560 | null | 281 | 281 |
from collections import deque
from sys import stdin
nii=lambda:map(int,stdin.readline().split())
n=int(input())
l=[list(nii()) for i in range(n-1)]
tree=[[]for _ in range(n)]
for a,b in l:
a-=1
b-=1
tree[a].append(b)
tree[b].append(b)
ans_num=0
for i in tree:
ans_num=max(ans_num,len(i))
dq=deque()
dq.append((0,0))
seen=set()
seen.add(0)
ans_dict={}
while dq:
x,color=dq.pop()
i=0
for nx in tree[x]:
if nx in seen:
continue
i+=1
if i==color:
i+=1
seen.add(nx)
dq.append((nx,i)),
ans_dict[x+1,nx+1]=i
ans_dict[nx+1,x+1]=i
print(ans_num)
for i in l:
print(ans_dict[tuple(i)]) | N = int(input())
ans = [0] * (N-1)
to = [[] for i in range(N-1)]
used = [0] * N
for i in range(N-1):
a, b = map(int, input().split())
to[a-1].append([b-1, i])
for i in range(N-1):
unable = used[i]
c = 1
for j, id in to[i]:
if c == unable:
c += 1
ans[id] = c
used[j] = c
c += 1
print(max(used))
for i in range(N-1):
print(ans[i]) | 1 | 135,884,922,936,380 | null | 272 | 272 |
from collections import deque
l=deque()
for _ in range(input()):
a=raw_input().split()
c=a[0][-4]
if c=="i": l.popleft()
elif c=="L": l.pop()
elif c=="s": l.appendleft(a[1])
else:
try: l.remove(a[1])
except: pass
print " ".join(l) | from collections import deque
n = int(input())
dll = deque([])
for _ in range(n):
p = input().split()
if p[0] == "insert":
dll.appendleft(p[1])
elif p[0] == "delete":
try:
dll.remove(p[1])
except:
pass
elif p[0] == "deleteFirst":
dll.popleft()
else:
dll.pop()
print(" ".join(dll))
| 1 | 52,744,175,300 | null | 20 | 20 |
# 2020-05-22
def main():
n, m, k = [int(x) for x in input().split()]
friends = [set() for _ in range(n)]
blocks = [set() for _ in range(n)]
for _ in range(m):
a, b = [int(x) - 1 for x in input().split()]
friends[a].add(b)
friends[b].add(a)
for _ in range(k):
a, b = [int(x) - 1 for x in input().split()]
blocks[a].add(b)
blocks[b].add(a)
networks = {} # The dict of networks as sets. Keys are leaders.
net_leaders = [-1] * n # The leaders of the networks that the ones joined.
visited = [False] * n
for person in range(n):
if visited[person]:
continue
network = set()
stack = [person]
while stack:
new = stack.pop()
visited[new] = True
net_leaders[new] = person
network.add(new)
for adj in friends[new]:
if visited[adj]:
continue
stack.append(adj)
networks[person] = network
answers = []
for person in range(n):
net = networks[net_leaders[person]]
ans = len(net) - len(friends[person]) - 1
for block in blocks[person]:
if block in net:
ans -= 1
answers.append(ans)
print(*answers)
return
if __name__ == '__main__':
main()
| # dfs
import collections,sys
sys.setrecursionlimit(10**9)
n,m,k = map(int, input().split())
friend = [[]*(n+1) for _ in range(n+1)]
block = [[]*(n+1) for _ in range(n+1)]
teams = [0]*(n+1)
for _ in range(m):
a,b = map(int, input().split())
friend[a].append(b)
friend[b].append(a)
for _ in range(k):
c,d = map(int, input().split())
block[c].append(d)
block[d].append(c)
def dfs(i):
teams[i] = team
for j in friend[i]:
if teams[j] != 0:
continue
dfs(j)
team=1
for i in range(1,n+1):
if teams[i] != 0:
continue
dfs(i)
team+=1
c = collections.Counter(teams)
for i in range(1,n+1):
temp = c[teams[i]]-len(friend[i])-1
for j in block[i]:
if teams[j] == teams[i]:
temp -= 1
print(temp, end='')
if i != n:
print(" ", end='') | 1 | 61,794,384,171,740 | null | 209 | 209 |
N,K=map(int,input().split())
A=list(map(int,input().split()))
for i in range(K-1,N-1):
a=A[i-K+1]
b=A[i+1]
if(a<b):
print('Yes')
else:
print('No') | import math
n = int(input())
c= [0]*n
s = map(int,input().split())
for i in s:
c[i-1]+=1
for i in c:
print(i) | 0 | null | 19,816,707,299,352 | 102 | 169 |
from collections import deque
h,w=map(int,input().split())
s=[list(input()) for _ in range(h)]
ans=0
for i in range(h):
for j in range(w):
if s[i][j]==".":
cnt=[[-1]*w for _ in range(h)]
cnt[i][j]=0
queue=deque()
queue.append([i,j])
for k in range(100*h*w):
if len(queue)==0:
break
num=queue.popleft()
num1=num[0]
num2=num[1]
if num1!=0:
if s[num1-1][num2]=="." and cnt[num1-1][num2]==-1:
cnt[num1-1][num2]=cnt[num1][num2]+1
queue.append([num1-1,num2])
if num2!=0:
if s[num1][num2-1]=="." and cnt[num1][num2-1]==-1:
cnt[num1][num2-1]=cnt[num1][num2]+1
queue.append([num1,num2-1])
if num1!=h-1:
if s[num1+1][num2]=="." and cnt[num1+1][num2]==-1:
cnt[num1+1][num2]=cnt[num1][num2]+1
queue.append([num1+1,num2])
if num2!=w-1:
if s[num1][num2+1]=="." and cnt[num1][num2+1]==-1:
cnt[num1][num2+1]=cnt[num1][num2]+1
queue.append([num1,num2+1])
cnt2=0
for k in range(h):
cnt2=max(cnt2,max(cnt[k]))
ans=max(ans,cnt2)
print(ans)
| S = input()
l = len(S)
x = [0]*(l+1)
y = [0]*(l+1)
for i in range(l):
if S[i] == "<":
x[i+1] = x[i]+1
for i in range(l):
if S[l-i-1] == ">":
y[l-i-1] = y[l-i]+1
res = 0
for a, b in zip(x, y):
res += max(a, b)
print(res) | 0 | null | 125,588,804,292,948 | 241 | 285 |
N, K = map(int, input().split())
count = 0
while N != 0:
N //= K
count += 1
print(count)
| N, K = map(int,input().split())
def abc(n,m):
a,b = divmod(n,m)
return a,b
count = 0
a = 1
while a !=0 :
a,b = abc(N,K)
N = a
count += 1
print(count) | 1 | 64,515,416,810,490 | null | 212 | 212 |
n = int(input())
l = [0 for _ in range(10**4)]
def fib(n):
if n==0:
l[0]=1
return 1
if n==1:
l[1]=1
return 1
if l[n]!=0:
return l[n]
else:
l[n]=fib(n-1)+fib(n-2)
return fib(n-1)+fib(n-2)
print(fib(n))
| import sys
if __name__ == "__main__":
n = int(input())
if n == 0 or n == 1:
print(1)
sys.exit(0)
dp = [0] * (n + 1)
dp[0] = 1
dp[1] = 1
for i in range(2, n + 1):
dp[i] = dp[i - 1] + dp[i - 2]
print(dp[n])
| 1 | 1,688,386,140 | null | 7 | 7 |
from math import gcd
def main():
ans = 0
k = int(input())
for i in range(1,1+k):
for j in range(1,1+k):
for l in range(1,1+k):
ans += gcd(i,gcd(j,l))
print(ans)
if __name__ == "__main__":
main() | import itertools, math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
K = int(input())
if K == 1:
print(1)
exit()
elif K ==2:
print(9)
exit()
l_2 = itertools.combinations(range(1, K + 1), 2)
l_3 = itertools.combinations(range(1, K + 1), 3)
sum = int(K * (K + 1) / 2)
for x in l_2:
sum += math.gcd(x[0], x[1]) * 6
for x in l_3:
sum += gcd(x[0], x[1], x[2]) * 6
print(sum) | 1 | 35,436,695,149,020 | null | 174 | 174 |
n = int(input())
d = list(map(int,input().split()))
ans = 0
for i in range(n):
ans += d[i] * (sum(d) - d[i])
print(ans // 2) | import itertools
N = int(input())
D = list(input().split())
a = itertools.combinations(D,2)
sum= 0
for i,j in a:
sum += eval("{} * {}".format(i,j))
print(sum) | 1 | 168,078,482,318,912 | null | 292 | 292 |
import collections
cnt = collections.defaultdict(int)
N = int(input())
ans = 0
height = list(map(int, input().split()))
for n in range(1, N+1):
ans += cnt[n - height[n-1]]
cnt[n+height[n-1]] += 1
print(ans) | import math
print(2*math.pi*int(input())) | 0 | null | 28,817,024,297,280 | 157 | 167 |
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
def main():
S = input()
if S[-1] == 's':
print(S+'es')
else:
print(S+'s')
if __name__ == '__main__':
main()
| def main():
s = input()
if s[-1]=='s':
print(s,'es',sep='')
else:
print(s,'s',sep='')
if __name__ == "__main__":
main() | 1 | 2,377,515,334,788 | null | 71 | 71 |
x = input().split()
a = int(x[0])
b = int(x[1])
if a == b :
print('a == b')
elif a > b :
print('a > b')
else :
print('a < b') | x,y,z=map(int,input().split())
x,y=y,x
x,z=z,x
print(x,y,z,sep=" ")
| 0 | null | 19,264,588,145,310 | 38 | 178 |
n,m = map(int, input().split())
a = list(map(int,input().split()))
sum = 0;
for i in a:
sum += i
if(sum > n):
print(-1)
else:
print(n-sum)
#print(a)
| N = int(input())
R = []
for i in range(N):
x, l = map(int, input().split())
R.append((x+l, x-l))
R.sort()
ans = 0
now = -(10 ** 9 + 1)
for (r, l) in R:
if now <= l:
ans += 1
now = r
print(ans)
| 0 | null | 61,007,017,739,668 | 168 | 237 |
bill=[[[0 for i in range(10)]for j in range(3)]for k in range(4)]
n=int(input())
for i in range(n):
b,f,r,v=map(int,input().split())
bill[b-1][f-1][r-1]+=v
for i in range(4):
for j in range(3):
for k in range(10):
if k!=9:
print("",bill[i][j][k],end="")
else:
print("",bill[i][j][k])
if i!=3:
print("#"*20)
| n = int(input())
count = list()
for b in range(4):
count.append(list())
for f in range(3):
count[b].append(list())
for r in range(10):
count[b][f].append(0)
read = 0
while read < n:
b,f,r,v = [int(x) for x in input().split(" ")]
count[b-1][f-1][r-1] += v
read += 1
for b in range(len(count)):
for f in range(len(count[b])):
for r in range(len(count[b][f])):
print("", count[b][f][r], end="")
print()
if b < len(count) - 1:
print("####################") | 1 | 1,118,955,628,640 | null | 55 | 55 |
N = int(input())
import math
o = math.ceil(N / 2)
print(o / N)
| import sys
import math
import bisect
def main():
n = int(input())
ans = ((n+1)//2) / n
print('%.10f' % ans)
if __name__ == "__main__":
main()
| 1 | 177,069,417,069,288 | null | 297 | 297 |
N, M = map(int, input().split())
A = list(map(int, input().split()))
if N - sum(A) <= 0:
result = "Yes"
else:
result = "No"
print(result) | h, n = map(int, input().split())
aa = [int(a) for a in input().split()]
all = sum(aa)
if h <= all :
print("Yes")
else :
print("No") | 1 | 77,951,067,753,530 | null | 226 | 226 |
target = input()
now_height = []
now_area = [0]
answer = []
continued = 0
depth = 0
depth_list = []
for t in target:
# print(now_height,depth_list,now_area,answer,continued)
if t == '\\':
now_height.append(continued)
depth_list.append(depth)
now_area.append(0)
depth -= 1
elif t == '_':
pass
elif t == '/' and len(now_height) > 0:
depth += 1
started = now_height.pop()
temp_area = continued - started
# print(depth_list[-1],depth)
now_area[-1] += temp_area
if depth > depth_list[-1]:
while depth > depth_list[-1]:
temp = now_area.pop()
now_area[-1] += temp
depth_list.pop()
if len(now_height) == 0 or depth == depth_list[0]:
answer.append(sum(now_area))
now_area = [0]
depth_list = []
continued += 1
now_area = list(filter(lambda x:x != 0,now_area))
answer.extend(now_area)
print(sum(answer))
print(len(answer),*answer) | n = int(input())
xlist = list(map(int,input().split()))
sum = 0
for i in range(n):
for j in range(i+1,n):
sum+=xlist[i]*xlist[j]
print(sum) | 0 | null | 84,305,069,673,782 | 21 | 292 |
#!/usr/bin/env python
# encoding: utf-8
import sys
class Solution:
def __init__(self):
self.count = 0
def shell_sort(self):
array_length = int(input())
# array = []
# array_length = 10
# array = [15, 12, 8, 9, 3, 2, 7, 2, 11, 1]
array = list(map(int, sys.stdin.readlines()))
G = [1]
while True:
g = G[0] * 3 + 1
if g > array_length:
break
G.insert(0, g)
g_length = len(G)
result = []
for j in range(g_length):
result = self.insertion_sort(array=array, array_length=array_length, g=G[j])
# print(result, 'r', G[j])
print(g_length)
print(" ".join(map(str, G)))
print(self.count)
for k in range(array_length):
print(result[k])
def insertion_sort(self, array, array_length, g):
# write your code here
for i in range(g, array_length):
v = array[i]
j = i - g
while j >= 0 and array[j] > v:
array[j + g] = array[j]
j -= g
self.count += 1
array[j + g] = v
# print(" ".join(map(str, array)))
return array
if __name__ == '__main__':
solution = Solution()
solution.shell_sort() | import sys
sys.setrecursionlimit(10 ** 8)
ini = lambda: int(sys.stdin.readline())
inm = lambda: map(int, sys.stdin.readline().split())
inl = lambda: list(inm())
ins = lambda: sys.stdin.readline().rstrip()
debug = lambda *a, **kw: print("\033[33m", *a, "\033[0m", **dict(file=sys.stderr, **kw))
n, m = inm()
sc = [tuple(inm()) for i in range(m)]
def digits(x):
if x < 10:
return 1
if x < 100:
return 2
return 3
def solve():
for x in range(1000):
if digits(x) != n:
continue
sx = str(x)
ok = True
for i in range(m):
s, c = sc[i]
if sx[s - 1] != str(c):
ok = False
break
if ok:
return x
return -1
print(solve())
| 0 | null | 30,278,546,833,808 | 17 | 208 |
class Dice(object):
def __init__(self,List):
self.face=List
def n_spin(self,List):
temp=List[0]
List[0]=List[1]
List[1]=List[5]
List[5]=List[4]
List[4]=temp
def s_spin(self,List):
temp=List[0]
List[0]=List[4]
List[4]=List[5]
List[5]=List[1]
List[1]=temp
def e_spin(self,List):
temp=List[0]
List[0]=List[3]
List[3]=List[5]
List[5]=List[2]
List[2]=temp
def w_spin(self,List):
temp=List[0]
List[0]=List[2]
List[2]=List[5]
List[5]=List[3]
List[3]=temp
dice = Dice(map(int,raw_input().split()))
command = list(raw_input())
for k in command:
if k=='N':
dice.n_spin(dice.face)
elif k=='S':
dice.s_spin(dice.face)
elif k=='E':
dice.e_spin(dice.face)
else:
dice.w_spin(dice.face)
print dice.face[0] | """from collections import *
from itertools import *
from bisect import *
from heapq import *
import math
from fractions import gcd"""
T1,T2=map(int,input().split())
A1,A2=map(int,input().split())
B1,B2=map(int,input().split())
A1*=T1
A2*=T2
B1*=T1
B2*=T2
if A1+A2==B1+B2:
print("infinity")
else:
if A1+A2<B1+B2:
A1,B1=B1,A1
A2,B2=B2,A2
if A1>B1:
print(0)
else:
print(((B1-A1)//(A1+A2-(B1+B2)))*2 +1-(((B1-A1)%(A1+A2-(B1+B2)))==0)*1)
| 0 | null | 66,221,101,445,700 | 33 | 269 |
from math import sqrt
from statistics import mean
while True:
n = int(input())
if n == 0:
break
else:
L = list(map(int, input().split()))
m = mean(L)
temp = list(map(lambda x: (x-m)**2, L))
SD = sqrt(sum(temp) / len(L))
print(SD)
| import math
while True:
n = int(input())
if n == 0: break
d = list(map(int, input().strip().split()))
m = sum(d) / n
print(math.sqrt(sum((x - m)**2 for x in d) / n)) | 1 | 196,847,290,908 | null | 31 | 31 |
import math
r = float(input())
m = r ** 2 * math.pi
l = r * 2 * math.pi
print('{:.6f} {:.6f}'.format(m, l)) | import math
a=input()
a=float(a)
p=math.pi
b= a*a*p
c= a*2*p
print('%03.7f' % b,'%03.7f' % c) | 1 | 646,701,345,010 | null | 46 | 46 |
def main():
N = int(input())
s={""}
for _ in range(N):
s.add(input())
return len(s)-1
if __name__ == '__main__':
print(main()) | n = int(input())
S=[]
for i in range(n):
S.append(input())
S.sort()
c=1
for i in range(n-1):
if S[i]!=S[i+1] :
c+=1
print( c ) | 1 | 30,094,542,239,872 | null | 165 | 165 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.