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
|
|---|---|---|---|---|---|---|
if __name__ == '__main__':
from statistics import pstdev
while True:
# ??????????????\???
data_count = int(input())
if data_count == 0:
break
scores = [int(x) for x in input().split(' ')]
# ?¨??????????????¨????
result = pstdev(scores)
# ???????????????
print('{0:.8f}'.format(result)) | import math
while True:
n = int(input())
if n == 0: break
points = list(map(int, input().split()))
mean = sum(points) / n
s = 0
for point in points:
s += (point - mean) ** 2
std = math.sqrt(s / n)
print(std) | 1 | 195,969,265,220 | null | 31 | 31 |
N,K=map(int,input().split())
A=[]
B=[]
C=[]
D=[]
for i in range(2*K):
A.append(list(map(int,input().split())))
for i in range(K):
B.append(A[2*i-1])
for i in range(K):
for j in range(len(B[i])):
C.append(B[i][j])
for i in range(1,N+1):
if i not in C:
D.append(i)
print(len(D)) | import sys
read = sys.stdin.read
#readlines = sys.stdin.readlines
from math import ceil
def main():
n = tuple(map(int, tuple(input())))
if sum(n) % 9 == 0:
print('Yes')
else:
print('No')
if __name__ == '__main__':
main() | 0 | null | 14,517,471,933,248 | 154 | 87 |
def readInt():
return list(map(int, input().split()))
a,b,c = readInt()
judge1 = c-a-b > 0
judge2 = 4*a*b < (c-a-b)**2
if judge1 and judge2:
print('Yes')
else:
print('No') | import sys
input = sys.stdin.readline
from collections import deque
N = int(input())
G = [[] for _ in range(N)] # 辺の相手を保存
for i in range(N-1):
a, b = map(lambda x: int(x) - 1, input().split())
G[a].append([b, i])
G[b].append([a, i])
stack = deque([[0, 0]])
visited = [0] * N
visited[0] = 1
ans = [0] * (N-1)
while stack:
i, pc = stack.pop()
c = 1
for ni, ln in G[i]:
if not visited[ni]:
visited[ni] = 1
if c == pc:
c += 1
ans[ln] = c
c += 1
stack.append([ni, ans[ln]])
print(max(ans))
for c in ans:
print(c)
| 0 | null | 93,592,455,394,022 | 197 | 272 |
x, y = map(int, input().split())
prise_dict = {3: 100000, 2: 200000, 1: 300000}
ans = 0
if x in prise_dict.keys():
ans += prise_dict[x]
if y in prise_dict.keys():
ans += prise_dict[y]
if x == y == 1:
ans += 400000
print(ans)
| a,b=map(int,input().split())
ans=a-b*2
if a<=b*2:
ans=0
print(ans) | 0 | null | 152,933,742,108,598 | 275 | 291 |
N, K = map(int, input().split())
P = sorted([int(i) for i in input().split()])
print(sum(P[:K])) | n = int(input())
A = input()
A = A.split()
A = [int(i) for i in A]
A = sorted(A, reverse = True)
#print(A)
ans = 0
for i in range(int(n/2)):
ans += A[i]*2
ans -= A[0]
#print(ans)
if n&1:
ans += A[int(n/2)]
print(ans) | 0 | null | 10,443,331,842,708 | 120 | 111 |
n = int(input())
lst = list(map(int, input().split()))
lst = sorted(lst, reverse = True)
summ = lst[0] + 2 * sum(lst[1:n//2])
if n % 2:
summ += lst[n//2]
print(summ)
| import math
N = int(input())
A = sorted(list(map(int, input().split())),reverse=True)
s = A[0]
for i in range(1,N-1):
s += A[math.ceil(i/2)]
print(s) | 1 | 9,103,201,927,610 | null | 111 | 111 |
inList = input().split()
stack = []
for i in inList:
if i in ['+', '-', '*']:
b, a = stack.pop(), stack.pop()
if i == '+':
stack.append(b + a)
if i == '-':
stack.append(a - b)
if i == '*':
stack.append(b * a)
else:
stack.append(int(i))
print(stack.pop()) | l = input().split()
stack = []
for op in l:
if op.isdigit():
stack.append(int(op))
elif op == '+':
stack.append(stack.pop() + stack.pop())
elif op == '-':
stack.append(- stack.pop() + stack.pop())
elif op == '*':
stack.append(stack.pop() * stack.pop())
print(stack[-1]) | 1 | 36,899,424,308 | null | 18 | 18 |
l=[]
for i in range(2): l.append(int(input()))
for i in range(1, 4):
if i not in l: print(i) | a=int(input())
b=int(input())
print(6//(a*b)) | 1 | 110,756,540,674,362 | null | 254 | 254 |
S = input()
acc = 0
for ch in S:
acc += int(ch)
print('Yes' if acc % 9 == 0 else 'No') | count = input()
#print(len(count))
num = 0
for i in range(len(count)):
num += int(count[i])
if num % 9 == 0:
print("Yes")
else:
print("No") | 1 | 4,477,160,380,950 | null | 87 | 87 |
a,b=map(int,input().split())
if a>b:
a,b=b,a
L=[str(a)]*b
print(''.join(L)) | def is_prime(x):
if x <= 1:
return False
i = 2
while i * i <= x:
if x % i == 0:
return False
i += 1
return True
cnt = 0
for _ in range(int(input())):
if is_prime(int(input())):
cnt += 1
print(cnt) | 0 | null | 42,426,126,324,890 | 232 | 12 |
from collections import deque
N, M, K = map(int, input().split())
friend = [list(map(int, input().split())) for _ in range(M)]
block = [list(map(int, input().split())) for _ in range(K)]
f = [set() for _ in range(N + 1)]
b = [set() for _ in range(N + 1)]
for i, j in friend:
f[i].add(j)
f[j].add(i)
for i, j in block:
b[i].add(j)
b[j].add(i)
stack = deque()
ans = [0] * (N + 1)
visited = [0] * (N + 1)
for i in range(1, N + 1):
if visited[i]:
continue
# setは{}で書く
link = {i}
stack.append(i)
visited[i] = 1
while stack:
n = stack.pop()
# nのフレンド全員について
for j in f[n]:
if visited[j] == 0:
stack.append(j)
visited[j] = 1
# link(set)に追加
link.add(j)
for i in link:
# 全体-既にフレンドの人数-ブロックした人数-自分自身
# set同士で積集合をとる
ans[i] = len(link) - len(link & f[i]) - len(link & b[i]) - 1
print(*ans[1:])
| def resolve():
a, b = input().split()
print(b+a)
resolve() | 0 | null | 82,517,862,999,040 | 209 | 248 |
import itertools,math
n = int(input())
points = [list(map(int,input().split())) for _ in range(n)]
roots = list(itertools.permutations(points))
ans = 0
for root in roots:
for i in range(n-1):
ans += math.sqrt(pow(root[i+1][0] - root[i][0],2) + pow(root[i+1][1] - root[i][1],2))
ans /= len(roots)
print(ans) | #import sys
#input = sys.stdin.readline
import math
from collections import defaultdict,deque
ml=lambda:map(int,input().split())
ll=lambda:list(map(int,input().split()))
ii=lambda:int(input())
ip=lambda:list(input())
ips=lambda:input().split()
"""========main code==============="""
t=1
for _ in range(t):
l,r,d=ml()
ans=0
for i in range(l,r+1):
if(i%d==0):
ans+=1
print(ans) | 0 | null | 77,960,363,093,470 | 280 | 104 |
def main():
import sys
from collections import Counter
input = sys.stdin.readline
input()
a = tuple(map(int, input().split()))
ans = sum(a)
a = Counter(a)
for _ in range(int(input())):
b, c = map(int, input().split())
if b in a:
ans += (c - b) * a[b]
a[c] = a[c] + a[b] if c in a else a[b]
del a[b]
print(ans)
if __name__ == "__main__":
main() | import math
r = float(input())
print('%.6f %.6f' %(math.pi*r**2, math.pi*2*r)) | 0 | null | 6,481,861,526,140 | 122 | 46 |
from __future__ import print_function
import sys
from functools import reduce
input = sys.stdin.readline
def eprint(*args, **kwargs):
print(*args, file=sys.stderr, **kwargs)
return
def solve02():
n = int(input().strip())
L = []
Xmin, Ymin, Xmax, Ymax = (sys.maxsize, sys.maxsize, -100, -100)
for i in range(n):
a, b = map(int, input().strip().split())
L.append((a, b))
Xmin, Ymin, Xmax, Ymax = (min(Xmin, a), min(Ymin, b), max(Xmax, a), max(Ymax, b))
A, B, C, D = ((Xmin, Ymax), (Xmin, Ymin), (Xmax, Ymin), (Xmax, Ymax))
# 対角線ACについて
d_MinDistFromA = sys.maxsize # 点Aからの距離が最小であるような，その最小の距離の値を求める
d_MinDistFromC = sys.maxsize # 点Cからの距離が最小であるような，その最小の距離の値を求める
# 対角線BDについて
d_MinDistFromB = sys.maxsize # 点Bからの距離が最小であるような，その最小の距離の値を求める
d_MinDistFromD = sys.maxsize # 点Dからの距離が最小であるような，その最小の距離の値を求める
for a, b in L:
d_MinDistFromA = min(d_MinDistFromA, abs(a - Xmin) + abs(b - Ymax))
d_MinDistFromC = min(d_MinDistFromC, abs(a - Xmax) + abs(b - Ymin))
d_MinDistFromB = min(d_MinDistFromB, abs(a - Xmin) + abs(b - Ymin))
d_MinDistFromD = min(d_MinDistFromD, abs(a - Xmax) + abs(b - Ymax))
# 出力
ans1 = abs(A[0] - C[0]) + abs(A[1] - C[1]) - (d_MinDistFromA + d_MinDistFromC)
ans2 = abs(B[0] - D[0]) + abs(B[1] - D[1]) - (d_MinDistFromB + d_MinDistFromD)
print(max(ans1, ans2))
def main():
solve02()
if __name__ == '__main__':
main() | N = int(input())
a = []
b = []
for i in range(N):
x,y = (list(map(int,input().split())))
a.append(x+y)
b.append(x-y)
a.sort()
b.sort()
ans = max(a[-1]-a[0],b[-1]-b[0])
print(ans)
| 1 | 3,401,002,995,008 | null | 80 | 80 |
n = int(input())
l = set()
for i in range(n):
cmd = input().split()
if cmd[0] == 'insert':
l.add(cmd[1])
if cmd[0] == 'find':
print('yes' if cmd[1] in l else 'no') | s=input()
h=s/3600
m=s/60-h*60
s=s-h*3600-m*60
print str(h)+":"+str(m)+":"+str(s) | 0 | null | 212,723,743,402 | 23 | 37 |
class ReversingNumbers:
def output(self, a):
s = ""
a.reverse()
for i in range(len(a)-1):
s += "%d " % (a[i])
s += "%d" % (a[len(a)-1])
print s
if __name__ == "__main__":
rn = ReversingNumbers()
raw_input()
a = map(int, raw_input().split())
rn.output(a) | import math
print(2*math.pi*int(input())) | 0 | null | 16,186,768,217,722 | 53 | 167 |
import sys
input=lambda: sys.stdin.readline().rstrip()
n=int(input())
A=[int(i) for i in input().split()]
inf=float("inf")
DP=[[-inf]*4 for _ in range(n+1)]
DP[0][2]=0
for i,a in enumerate(A):
if (i+1)%2==0:
DP[i+1][0]=DP[i][3]+a
if i>=1:
DP[i+1][0]=max(DP[i+1][0],DP[i-1][2]+a)
DP[i+1][2]=DP[i][0]
DP[i+1][3]=max(DP[i][1],DP[i][3])
if i>=1:
DP[i+1][3]=max(DP[i+1][3],DP[i-1][2])
else:
DP[i+1][0]=DP[i][2]+a
DP[i+1][1]=DP[i][3]+a
DP[i+1][3]=max(DP[i][0],DP[i][2])
if n%2==0:
print(max(DP[n][0],DP[n][2]))
else:
print(max(DP[n][1],DP[n][3]))
| S = input()
K = int(input())
if S[0] != S[-1]:
ans = 0
for i in range(len(S) - 1):
if S[i] == S[i + 1]:
S = S[:i + 1] + '*' + S[i + 2:]
ans += 1
print(ans * K)
else:
# S -> s_1 s_2 ... s_k + A + t_l t_l-1 ... t_1 (s_i = t_j)と分解
k, l = 0, len(S) - 1
while k < len(S) and S[k] == S[-1]:
k += 1
while l > -1 and S[l] == S[0]:
l -= 1
# 連結に関係ない部分のカウント
A = S[k:l + 1]
ans = 0
for i in range(len(A) - 1):
if A[i + 1] == A[i]:
A = A[:i + 1] + '*' + A[i + 2:]
ans += 1
ans *= K
# 連結に関係ある部分のカウント
if l == -1 and k == len(S):
# 全部同じ
print((len(S) * K) // 2)
else:
ans += (len(S) - l + k - 1) // 2 * (K - 1)
ans += (len(S) - l - 1) // 2 + k // 2
print(ans)
| 0 | null | 106,098,010,337,840 | 177 | 296 |
a1,a2,a3 = map(int,input().split())
sum = a1
sum += a2
sum += a3
if sum <=21:
print('win')
else:
print('bust')
| A1, A2, A3 = map(int, input().split())
if A1+A2+A3 >= 22: print('bust')
else: print('win') | 1 | 119,026,341,670,040 | null | 260 | 260 |
n = input()
l = map(int, raw_input().split())
max = l[0]
min = l[0]
s = l[0]
k = 1
while k < n:
if max < l[k]:
max = l[k]
if min > l[k]:
min = l[k]
s = s + l[k]
k = k + 1
print min, max, s | n=input()
k=map(int,raw_input().split())
print min(k),max(k),sum(k) | 1 | 736,319,992,182 | null | 48 | 48 |
import sys
import itertools
# import numpy as np
import time
import math
sys.setrecursionlimit(10 ** 7)
from collections import defaultdict
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
from functools import reduce
# from math import *
from fractions import *
N, M = map(int, readline().split())
A = list(map(lambda x: int(x) // 2, readline().split()))
def f(n):
cnt = 0
while n % 2 == 0:
n //= 2
cnt += 1
return cnt
t = f(A[0])
for i in range(N):
if f(A[i]) != t:
print(0)
exit(0)
A[i] >>= t
M >>= t
lcm = reduce(lambda a, b: (a * b) // gcd(a, b), A)
if lcm > M:
print(0)
exit(0)
print((M // lcm + 1) // 2)
| import sys
input = sys.stdin.readline
from collections import deque
def main():
n = int(input().strip())
v = [[] for _ in range(n)]
for i in range(n):
v[i] = list(map(int, input().strip().split()))
l = [-1] * (n+1)
q = deque()
q.append((1, 0))
while len(q) != 0:
id, d = q.popleft()
# print("id", id)
if l[id] != -1:
# print("b")
continue
l[id] = d
# l[id] = min(d, l[id])
# print(id, d)
for i in range(v[id-1][1]):
q.append((v[id-1][2+i], d+1))
# if id == 8:
# print("##", id, v[id-1][2+i])
# print(repr(q))
for i in range(1, n+1):
print(i, l[i])
if __name__ == '__main__':
main()
| 0 | null | 50,815,375,829,788 | 247 | 9 |
n=int(input())
table=[[0]*n for i in range(60)]
for i,v in enumerate(map(int,input().split())):
for j in range(60):
table[j][n-1-i]=v%2
v//=2
if v==0:break
#print(*table,sep='\n')
ans=0
mod1,mod2=10**9+7,998244353
mod=mod1
a=1
for t in table:
o,z=0,0
for v in t:
if v:
o+=1
ans=(ans+z*a)%mod
else:
z+=1
ans=(ans+o*a)%mod
a=a*2%mod
print(ans) | n = int(input())
A = list(map(int, input().split()))
MOD = 10**9+7
ans = 0
for i in range(60):
cnt = 0
for a in A:
cnt += a>>i&1
ans += cnt*(n-cnt)*2**i
ans %= MOD
print(ans)
| 1 | 122,863,070,005,860 | null | 263 | 263 |
K = int(input())
S = input().rstrip()
L = len(S)
if L <= K:
print(S)
else:
print(S[:K] + "...") | num=int(input())
print(3.14159265359*num*2) | 0 | null | 25,530,999,749,740 | 143 | 167 |
a,b,c = map(int, input().split())
A = min(min(a, b),c)
C = max(max(a,b),c)
B = (a+b+c) - (A+C)
print(A, B, C)
| line = list(map(int,input().split()))
print(line[0]//line[1],line[0]%line[1],'%0.05f'%(1.0*line[0]/line[1])) | 0 | null | 518,589,964,538 | 40 | 45 |
import sys
input = sys.stdin.buffer.readline
def main():
n = int(input())
A = list(map(int, input().split()))
L = [(a, i+1) for i, a in enumerate(A)]
L.sort(reverse=True)
dp = [[-1]*(n+1) for _ in range(n+1)]
dp[0][0] = 0
ans = 0
for i in range(n+1):
for j in range(n+1-i):
a, idx = L[i+j-1]
if i:
dp[i][j] = max(dp[i][j], dp[i-1][j]+a*(idx-i))
if j:
dp[i][j] = max(dp[i][j], dp[i][j-1]+a*(n+1-j-idx))
if i+j == n:
ans = max(ans, dp[i][j])
print(ans)
if __name__ == "__main__":
main() | while 1 :
a,op,b=raw_input().split()
ai=int(a)
bi=int(b)
if op=='?':break
elif op=='+':print ai+bi
elif op=='-':print ai-bi
elif op=='*':print ai*bi
elif op=='/':print ai/bi | 0 | null | 17,172,905,838,788 | 171 | 47 |
import math
H = int(input())
ans = 0
num = 0
while True:
ans += 2**num
if H == 1:
print(ans)
break
else:
H = math.floor(H/2)
num += 1 | N=input()
A=input()
Alist=A.split()
counts=0
for i in Alist:
if int(i)%2==1:
counts=counts
elif int(i)%3==0:
counts=counts
elif int(i)%5==0:
counts=counts
else:
counts=counts+1
if counts>=1:
print("DENIED")
else:
print("APPROVED") | 0 | null | 74,624,071,793,362 | 228 | 217 |
n,k,c=map(int,input().split())
s=input()
if k==1:
if s.count("o")==1:
print(s.index("o")+1)
exit()
l=[-c]*k
r=[n+c]*k
ll=0
for i in range(n):
if ll==0:
if s[i]=="o":
l[ll]=i
ll+=1
continue
if s[i]=="x" or l[ll-1]+c>=i:continue
l[ll]=i
ll+=1
if ll==k:break
rr=k-1
for i in range(n):
if rr==k-1:
if s[(n-1)-i]=="o":
r[rr]=(n-1)-i
rr-=1
continue
if s[(n-1)-i]=="x" or r[rr+1]-c<=(n-1)-i:continue
r[rr]=(n-1)-i
rr-=1
if rr==-1:break
for i in range(k):
if l[i]==r[i]:print(l[i]+1) | a,b = map(int,input().split())
n = min(a,b)
m = max(a,b)
ans = ''
for i in range(m):
ans = ans + str(n)
print(ans) | 0 | null | 62,850,486,414,340 | 182 | 232 |
x,n = map(int,input().split())
p = list(map(int,input().split()))
dic = {}
lis = []
for i in range(0,102):
if i not in p:
dic[i] = abs(x-i)
lis.append(i)
mini = min(dic.values())
for j in lis:
if mini == dic[j]:
print(j)
break | X, N = list(map(int, input().split()))
if N == 0:
print(X)
exit()
P = list(map(int, input().split()))
up_min = 0
low_min = 0
arr = [0] * 102
for i in P:
arr[i] = 1
lower = arr[:X]
lower.reverse()
upper = arr[X:]
for i, num in enumerate(lower):
if num == 0:
low_min = len(lower) - 1 - i
break
for i, num in enumerate(upper):
if num == 0:
up_min = len(lower) + i
break
if abs(up_min - X) >= abs(X - low_min):
print(low_min)
else:
print(up_min)
| 1 | 14,145,835,485,372 | null | 128 | 128 |
import math
a, b, c = map(float, input().split())
h = b * math.sin(math.radians(c))
c = math.sqrt(a ** 2 + b ** 2 - 2 * a * b * math.cos(math.radians(c)))
L = a + b + c
S = 1 / 2 * a * h
print(S)
print(L)
print(h)
| def main():
from sys import stdin
def input():
return stdin.readline().strip()
r, c, k = map(int, input().split())
v = [[0] * c for _ in range(r)]
for _ in range(k):
i, j, k = map(int, input().split())
v[i-1][j-1] = k
# dp[j][n] = j列にいて、n個itemを拾った時のアイテムの価値の合計の最大値
# 1行ずつdpを更新する
# 0行目
value = v[0][0]
if value == 0:
dp = [[0] * 4]
else:
dp = [[0, value, value, value]]
for j in range(1, c):
value = v[0][j]
if value == 0:
dp.append(dp[j-1])
continue
a = dp[j-1].copy()
b = [0, a[0]+value, a[1]+value, a[2]+value]
for k in range(1, 4):
if a[k] < b[k]:
a[k] = b[k]
dp.append(a)
# i行目
for i in range(1, r):
pre = dp[0][3]
value = v[i][0]
if value == 0:
new_dp = [[pre] * 4]
else:
new_dp = [[pre, pre+value, pre+value, pre+value]]
for j in range(1, c):
value = v[i][j]
if value == 0:
a = new_dp[j-1].copy()
b = [dp[j][3]] * 4
for k in range(4):
if a[k] < b[k]:
a[k] = b[k]
new_dp.append(a)
else:
a = new_dp[j-1].copy()
pre = dp[j][3]
b = [pre, pre+value, pre+value, pre+value]
d = [a[0], a[0]+value, a[1]+value, a[2]+value]
for k in range(4):
if a[k] < b[k]:
a[k] = b[k]
if a[k] < d[k]:
a[k] = d[k]
new_dp.append(a)
dp = new_dp
print(dp[c-1][3])
main() | 0 | null | 2,837,357,152,036 | 30 | 94 |
from collections import deque
H,W=map(int,input().split())
S=[]
for i in range(H):
S.append(input())
def bfs(s):
seen = [[0 for i in range(W)] for j in range(H)]
total = [[0 for i in range(W)] for j in range(H)]
todo = deque([])
now = s
if S[now[0]][now[1]]=='#':return 0
seen[now[0]][now[1]],total[now[0]][now[1]] = 1,0
todo.append(now)
while 1:
if len(todo)==0:break
now = todo.popleft()
for d in [(1,0),(-1,0),(0,1),(0,-1)]:
new = (now[0]+d[0], now[1]+d[1])
if new[0]<0 or new[0]>=H:continue
if new[1]<0 or new[1]>=W:continue
if seen[new[0]][new[1]]==1:continue
if S[new[0]][new[1]]=='#':continue
seen[new[0]][new[1]] = 1
todo.append(new)
total[new[0]][new[1]] = total[now[0]][now[1]] + 1
return max(map(max, total))
MAX=0
for i in range(H):
for j in range(W):
s = (i,j)
max_ = bfs(s)
if MAX < max_:MAX=max_
print(MAX) | from collections import deque
h,w=map(int,input().split())
s=[input() for _ in range(h)] #マップ
vi=[ [-1 for _ in range(w)] for _ in range(h)]#visit
st=deque()
d=[[0,1],[-1,0],[1,0],[0,-1]]
mx=0
for i in range(h):
for j in range(w):
vi=[ [-1 for _ in range(w)] for _ in range(h)]
st.append([i,j,0])
while st:
h1,w1,k=st.popleft()
if 0<=h1<h and 0<=w1<w and vi[h1][w1]==-1 and s[h1][w1]==".":
vi[h1][w1]=k
for m in d:
st.append([h1+m[0],w1+m[1],k+1])
for m in vi:
mx=max(mx,max(m))
print(mx) | 1 | 94,605,901,562,942 | null | 241 | 241 |
n,k = map(int,input().split())
l = list(map(int,input().split()))
# xは求める長さ
def C(x):
num = 0
for i in range(n):
# (a[i]-1)//x 回切る必要がある
num += (l[i]-1)//x
# k回以内に収まるか
return num <= k
lb,ub = 0,max(l)
while ub-lb > 1:
mid = (lb + ub) // 2
# 条件を満たすならxを小さくしていく
if C(mid):
ub = mid
else:
lb = mid
# print(lb,ub)
print(ub) | #1indexed
class BIT():
def __init__(self, n):
self.size = n
self.bit = [0] * (n+1)
def sum(self, i):
s = 0
while i > 0:
s += self.bit[i]
i -= i & -i
return s
def add(self, i, x):
while i <= self.size:
self.bit[i] += x
i += i & -i
n = int(input())
s = input()
q = int(input())
bit = [BIT(n+1) for i in range(26)]
for i in range(n):
bit[ord(s[i])-97].add(i+1, 1)
s = list(s)
for _ in range(q):
query, a, b = input().split()
if query == "1":
i = int(a)
c = ord(b)-97
bit[c].add(i, 1)
bit[ord(s[i-1])-97].add(i, -1)
s[i-1] = b
else:
ans = 0
for k in range(26):
if bit[k].sum(int(b))-bit[k].sum(int(a)-1) >= 1:
ans += 1
print(ans)
| 0 | null | 34,448,673,745,848 | 99 | 210 |
while 1:
try:
a, b = map(int,raw_input().split())
except EOFError:
break
ac, bc = a, b
while 1:
if a < b:
b = b - a
elif b < a:
a = a - b
elif a == b:
x = [a,ac*bc/a]
print "{:.10g} {:.10g}".format(*x)
break | import sys
def gcd(x, y):
if y == 0:
return x
else:
return gcd(y, x%y)
def lcm(x, y):
return x * y //gcd(x,y)
for line in sys.stdin:
x, y = map(int, line.split())
print(gcd(x, y), lcm(x,y)) | 1 | 712,453,430 | null | 5 | 5 |
n = int(input())
s = str(input())
if n % 2 == 1:
print("No")
exit()
if s[:n // 2] == s[n // 2:]:
print("Yes")
exit()
print("No") | N = int(input())
S = input()
if N%2==0:
if S[:int(N/2)] == S[int(N/2):]:
print('Yes')
else:
print('No')
else:
print('No') | 1 | 147,089,051,290,652 | null | 279 | 279 |
S,W = (int(i) for i in input().split())
if S<=W:
print("unsafe")
else:
print("safe")
| S,W = list(map(int,input().split()))
if W >= S:print('unsafe')
else: print('safe') | 1 | 29,236,589,330,620 | null | 163 | 163 |
N = int(input())
A = [0]*N
B = [0]*N
for i in range(N): A[i],B[i] = map(int,input().split())
A.sort()
B.sort()
sorted_A = A
sorted_B = B
if N % 2 != 0:
center_A = sorted_A[N//2]
center_B = sorted_B[N//2]
print(center_B - center_A + 1)
else:
center_A = (sorted_A[N//2-1] + sorted_A[N//2]) / 2
center_B = (sorted_B[N//2-1] + sorted_B[N//2]) / 2
print(int((center_B - center_A)*2 + 1)) | from bisect import bisect_left
from itertools import accumulate
n, m = map(int, input().split())
a = list(map(int, input().split()))
a.sort()
b = [0] + a
b.sort(reverse=True)
b = [0] +b
b = list(accumulate(b))
def isok(sum_):
n_pattern = 0
for i in range(n):
n_pattern += n - bisect_left(a, sum_ - a[i])
if n_pattern >= m:
return True
return False
ok = min(a)*2
ng = max(a)*2 +1
while ng - ok > 1:
mid = (ok+ng)//2
if isok(mid):
ok = mid
else:
ng = mid
sum_ng = ng
sum_ok = ok
m_counter_ng = 0
ans = 0
for i in range(n):
id_ng = bisect_left(a, sum_ng - a[i])
ans += b[n-id_ng]
ans += a[i]*(n - id_ng)
m_counter_ng += n - id_ng
ans += sum_ok * (m - m_counter_ng)
print(ans)
| 0 | null | 62,660,517,342,038 | 137 | 252 |
def sep():
return map(int,input().strip().split(" "))
def lis():
return list(sep())
a,b=sep()
print(a*b) | k = input().split()
n1 = int(k[0])
n2 = int(k[1])
ans = n1 * n2
print(ans) | 1 | 15,935,335,415,780 | null | 133 | 133 |
N=int(input())
print((N//2+1)/N if N%2 else 0.5) | n, m = map(int, input().split())
N = [0]*n
t = [0]*n
if n>1:
N[0]=1
f = 0
for i in range(m):
s, c = map(int, input().split())
if t[s-1]!=0 and N[s-1]!=c:
f = 1
t[s-1] = 1
N[s-1] = c
if n!=1 and N[0]==0:
print(-1)
elif f==1:
print(-1)
else:
for i in range(n):
print(N[i],end="") | 0 | null | 118,493,286,457,708 | 297 | 208 |
X = int(input())
x1 = X//500
x2 = (X%500)//5
print(x1*1000+x2*5) | X=int(input())
a=int(X/500)
s=1000*a
X-=500*a
b=int(X/5)
s+=5*b
print(s) | 1 | 42,858,841,803,008 | null | 185 | 185 |
N, M = map(int, input().split())
A = list(map(int, input().split()))
A.sort(reverse=True)
LB = A[-1] * 2 # 一回の握手で上がる幸福度の下限は、左手も右手もパワーが一番低い人を握った場合
UB = A[0] * 2 # 一回の握手で上がる幸福度の上限は、左手も右手もパワーが一番高い人を握った場合
# cgs[i] は パワーがi以上のゲストの数
cgs = [0] * (UB + 1)
for a in A:
cgs[a] += 1
for i in range(UB, 0, -1):
cgs[i - 1] += cgs[i]
# 組み合わせの数がM以上になる一回で発生する幸福度の閾値を二分探索する
def is_ok(n):
m = 0
for a in A:
m += cgs[max(n - a, 0)]
return m >= M
ok = LB
ng = UB + 1
while ng - ok > 1:
m = (ok + ng) // 2
if is_ok(m):
ok = m
else:
ng = m
# cps[i] は A[0]～A[i] の累積和
cps = A[:]
for i in range(1, N):
cps[i] += cps[i - 1]
result = 0
for a in A:
# 左手固定
t = cgs[max(ok - a, 0)] # 握手すると閾値を超えるひとたち
if t != 0:
result += a * t + cps[t - 1] # 1人目pとu回握手 + 右手はu人までと握手
M -= t
result += ok * M # 閾値上の人の処理
print(result)
| n, m = map(int, input().split())
a = list(map(int, input().split()))
a.sort(reverse=True)
# l[i] = (a[j] >= i を満たすjの個数)
l = [n for i in range(a[0]+1)]
for i in range(2, n+1):
for j in range(a[-i], a[-i+1], -1):
l[j] = n - i + 1
# 二分探索
# a[i] + a[j] >= x を満たす(i, j)がm組以上存在する最小のxを求める
start = 2 * a[-1]
stop = 2 * a[0]
while start < stop:
i = (start + stop + 1) // 2
num = 0
for j in a:
if i - j < 0:
num += n
elif i - j <= a[0]:
num += l[i - j]
else:
break
if num >= m:
start = i
else:
stop = i - 1
num = 0
for i in a:
if start - i < 0:
num += n
elif 0 <= start - i <= a[0]:
num += l[start - i]
else:
break
# start <= a[i]+a[j] を満たす a[i]+a[j] を全て足す
ans = 0
for i in a:
if start - i < 0:
ans += 2 * i * n
elif start - i <= a[0]:
ans += 2 * i * l[start - i]
else:
break
ans -= (num - m) * start
print(ans) | 1 | 107,789,127,836,868 | null | 252 | 252 |
n=int(input())
A=list(map(int,input().split()))
mod=10**9+7
B=[[] for i in range(n)]
for i in range(n):
B[i]= [((A[i]>>(59-j))) & 1 for j in range(60)]
B[i] = [0]*(60-len(B[i]))+B[i]
TB=[[0]*n for i in range(60)]
for i in range(60):
TB[i] = [B[j][i] for j in range(n)]
# import numpy as np
#print(TB)
ans=0
for i in range(60):
now=TB[i]
q=sum(now)
ans+= ((pow(2,59-i,mod)* (q*(n-q)))%mod)%mod
ans%=mod
print((ans)%mod)
| import math
def checkPrime(n):
for i in range(2, int(math.sqrt(n)) + 1):
if n % i == 0:
return False
return True
if __name__ == "__main__":
N = input()
cnt = 0
for i in range(N):
n = input()
if checkPrime(n):
cnt += 1
print cnt | 0 | null | 61,625,444,375,600 | 263 | 12 |
N, M, K = map(int, input().split())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
answer = 0
b_ind = 0
for x in range(N-1):
A[x+1] += A[x]
if A[x+1] > K:
A = A[:x+1]
break
for y in range(M-1):
B[y+1] += B[y]
if B[y+1] > K:
B = B[:y+1]
break
A = [0] + A
B = [0] + B
na = len(A)
nb = len(B)
if A[-1] + B[-1] <= K:
answer = len(A) + len(B) - 2
print(answer)
else:
for i in range(na):
for j in range(nb-b_ind-1, -1, -1):
if A[i] + B[j] <= K:
if answer < i+j:
answer = i+j
b_ind = nb-j-1
break
print(answer) | N, M, K = map(int, input().split())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
a, b = [0]*(N+1), [0]*(M+1)
for i in range(N):
a[i+1] = a[i] + A[i]
for i in range(M):
b[i+1] = b[i] + B[i]
ans, j = 0, M
for i in range(N + 1):
if a[i] > K:
break
while b[j] > K - a[i]:
j -= 1
ans = max(ans, i + j)
print(ans) | 1 | 10,782,331,993,948 | null | 117 | 117 |
A, B, M = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
a.insert(0, 10**6)
b.insert(0, 10**6)
xyc = [list(map(int, input().split())) for _ in range(M)]
ans = min(a) + min(b)
for n in xyc:
ans = min(ans, a[n[0]] + b[n[1]] - n[2])
print(ans) | from sys import stdin
input = lambda: stdin.readline().rstrip()
na, nb, m = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
min_a = min_b = 10**9
for i in range(na):
min_a = min(min_a, a[i])
for i in range(nb):
min_b = min(min_b, b[i])
ans = min_a + min_b
for i in range(m):
x, y, c = map(int, input().split())
x -= 1
y -= 1
ans = min(ans, a[x] + b[y] - c)
print(ans)
| 1 | 53,973,861,396,910 | null | 200 | 200 |
#!/usr/bin/env python
#-*- coding: utf-8 -*-
if __name__ == '__main__':
N = int(raw_input())
l = map(int, raw_input().split())
cnt = 0
for i in range(0, N):
minj = i
for j in range(i, N):
if l[j] < l[minj]:
minj = j
if i != minj:
l[i], l[minj] = l[minj], l[i]
cnt += 1
print ' '.join(map(str, l))
print cnt
| n = int(input())
s = [ i for i in input().split()]
cnt = 0
for i in range(n-1):
minj = i
for j in range(i+1,n):
if int(s[j]) < int(s[minj]):
minj = j
if i != minj:
cnt += 1
s[i],s[minj] = s[minj],s[i]
print(' '.join(s))
print(cnt)
| 1 | 20,260,701,530 | null | 15 | 15 |
n, k = map(int, input().split())
price = sorted(list(map(int, input().split())))
min_price = 0
for i in range(k) :
min_price += price[i]
print(min_price) | N, K = (int(a) for a in input().split())
p = [int(a) for a in input().split()]
p.sort()
print(sum(p[:K])) | 1 | 11,713,654,220,082 | null | 120 | 120 |
A,B = map(str,input().split())
A = int(A)
B1 = int(B[0])
B2 = int(B[-2])
B3 = int(B[-1])
ans = A*(100*B1+10*B2+B3)//100
print(int(ans)) | s = input()
flg = False
for i in range(1,6):
if s == 'hi' *i:
flg = True
break
print('Yes' if flg else 'No') | 0 | null | 35,009,377,517,740 | 135 | 199 |
n = int(input())
line = input()
arr= line.split(" ")
nums = []
for c in range(n):
nums.append(int(arr[c]))
flag = "true"
convert_n = 0
while flag == "true":
flag = "false"
for i in range(len(nums)-1, 0, -1):
if nums[i] < nums[i-1]:
tmp = nums[i]
nums[i] = nums[i-1]
nums[i-1] = tmp
flag = "true"
convert_n += 1
n_list_str = ""
for num in nums:
n_list_str += str(num)
n_list_str += " "
print(n_list_str.rstrip(" "))
print(convert_n) | from functools import lru_cache
@lru_cache(None)
def f(n,k):
if k<1: return 1
if n<10:
if k<2: return n
return 0
d,m=n//10,n%10
return f(d,k-1)*m+f(d-1,k-1)*(9-m)+f(d,k)
print(f(int(input()),int(input()))) | 0 | null | 37,742,399,218,524 | 14 | 224 |
n, m = map(int, input().split())
s = [0] * m
c = [0] * m
for i in range(m):
s[i], c[i] = map(int, input().split())
for i in range(0, 1000):
x = str(i)
if len(x) != n:
continue
for j in range(m):
if s[j] > len(x) or int(x[s[j] - 1]) != c[j]:
break
else:
print(x)
exit()
print(-1)
| a,v = map(int,input().split())
b,w = map(int,input().split())
t = int(input())
sa = abs(a-b)
tume = v-w
if tume*t < sa:
print('NO')
else:
print('YES') | 0 | null | 38,072,963,516,030 | 208 | 131 |
n, k = map(int, input().split())
print(sum([i >= k for i in list(map(int,input().split()))])) | n,k=map(int,input().split())
h=[int(i) for i in input().split()]
h=[i for i in h if i>=k]
print(len(h)) | 1 | 179,253,827,032,192 | null | 298 | 298 |
n=input()
ans=0
if n=="0":
print("Yes")
else:
for i in n:
ans+=int(i)
if ans%9==0:
print("Yes")
else:
print("No") | n = input()
ret = 0
for s in n:
ret *= 10
ret %= 9
ret += int(s)
ret %= 9
if ret == 0:
print("Yes")
else:
print("No") | 1 | 4,369,227,658,520 | null | 87 | 87 |
s = list(input())
if len(set(s)) == 2:
print("Yes")
else:
print("No") | S = str(input())
if S[0] == S[1] == S[2]:
print('No')
else:
print('Yes') | 1 | 54,789,549,829,938 | null | 201 | 201 |
# coding: utf-8
# Here your code !
W, H , x ,y ,r = list(map(int, input().split()))
t1_x = x + r
t1_y = y + r
t2_x = x - r
t2_y = y - r
if 0 <= t1_x <= W and 0 <= t1_y <= H and 0 <= t2_x <= W and 0 <= t2_y <= H:
print("Yes")
else:
print("No") | for j in range(1,10):
for k in range(1,10):
print str(j)+"x"+str(k)+"="+str(j*k) | 0 | null | 229,445,837,840 | 41 | 1 |
n = int(input())
lis = list(map(int, input().split()))
ans = 0
for i in range(0, n-1):
for t in range(i+1, n):
con = lis[i] * lis[t]
ans += con
print(ans) | n,m=list(map(int,input().split(' ')))
am=[[0 for j in range(m)] for i in range(n)]
bm=[0 for l in range(m)]
cm=[0 for i in range(n)]
for i in range(n):
am[i]=list(map(int,input().split(' ')))
for j in range(m):
bm[j]=int(input())
for i in range(n):
for j in range(m):
cm[i]=cm[i]+am[i][j]*bm[j]
for i in range(n):
print(cm[i])
| 0 | null | 84,724,287,912,076 | 292 | 56 |
#C
A,B=map(int,input().split())
GCD=1
for i in range(2,10**5+1):
if A%i==0 and B%i==0:
GCD=i
LCM=A*B/GCD
print(int(LCM)) | import collections
n=int(input())
S=input()
c=collections.Counter(S)
ans=c['R']*c['B']*c['G']
hiku=0
for i in range(n):
for d in range(n):
j=i+d
k=j+d
if k>n-1:
break
if S[i]!=S[j] and S[j]!=S[k] and S[k]!=S[i]:
hiku+=1
print(ans-hiku) | 0 | null | 74,723,703,315,232 | 256 | 175 |
a,v = map(int,input().split())
b,w = map(int,input().split())
t = int(input())
if v <= w:
print("NO")
else:
dis = abs(b-a)
sp = abs(v-w)
if 0 < dis/sp <= t:
print("YES")
else:
print("NO")
| x = int(input())
n = 120
for i in range(n):
for j in range(i):
if x == i**5-j**5:
print(i,j)
exit(0)
if x == i**5+j**5:
print(i,-j)
exit(0) | 0 | null | 20,397,892,069,102 | 131 | 156 |
N,M = map(int,input().split())
ls2 = []
for i in range(M):
ls1 = list(map(int,input().split()))
ls2.append(ls1)
ans = -1
if M == 0:
if N==1:
ans = 0
else:
ans = 10**(N-1)
if N == 1:
for i in range(10):
for j in range(M):
if not i//(10**(N-ls2[j][0]))%10 == ls2[j][1]:
break
if j == M-1:
ans = i
break
if not ans == -1:
break
else:
for i in range(10**(N-1),10**N):
for j in range(M):
if not i//(10**(N-ls2[j][0]))%10 == ls2[j][1]:
break
if j == M-1:
ans = i
break
if not ans == -1:
break
print(ans)
| N, M=map(int,input().split())
s=list()
c=list()
a=0
for i in range(0,M):
s.append(0)
c.append(0)
for i in range(0,M):
s[i], c[i]=map(int,input().split())
for i in range(0,M):
for j in range(0,M):
if s[i]==s[j] and c[i]!=c[j]:
print("-1")
break
else:
continue
break
else:
if N==1:
b=[0]
for i in range(0,M):
b[s[i]-1]=c[i]
print(b[0])
else:
b=[1]
for i in range(0,N-1):
b.append(0)
for i in range(0,M):
if s[i]==1 and c[i]==0:
print("-1")
break
else:
for i in range(0,M):
b[s[i]-1]=c[i]
for i in range(0,N):
print(b[i],end='') | 1 | 60,561,933,340,730 | null | 208 | 208 |
#coding:utf-8
while True:
try:
a, b = map(int, raw_input(). split())
x = a * b
while True:
c = a % b
a = b
b = c
if b == 0:
break
x = x / a
print("%d %d" % (a, x))
except:
break | #mathモジュールをインポートする
import math
try:
while True:
a,b = map(int,input().split())
#最小公約数
num1 = math.gcd(a,b)
#最大公倍数
num2 = int(a * b / num1)
print(str(num1) + " " + str(num2))
#EOFErrorをひろいコードを終了する
except EOFError:
pass
| 1 | 628,930,640 | null | 5 | 5 |
import sys
import collections
sys.setrecursionlimit(10 ** 8)
input = sys.stdin.readline
def main():
H, W = [int(x) for x in input().split()]
S = [list(input().strip()) for _ in range(H)]
dp = [[10 ** 9] * W for _ in range(H)]
dp[0][0] = int(S[0][0] == '#')
for j in range(H):
for i in range(W):
if j != H - 1:
dp[j + 1][i] = min(dp[j + 1][i], dp[j][i] + int(S[j + 1][i] == '#' and S[j][i] == '.'))
if i != W - 1:
dp[j][i + 1] = min(dp[j][i + 1], dp[j][i] + int(S[j][i + 1] == '#' and S[j][i] == '.'))
print(dp[-1][-1])
if __name__ == '__main__':
main()
| import sys
input = sys.stdin.readline
H, W = map(int, input().split())
s = [input().rstrip() for _ in range(H)]
dp = [[1000]*W for _ in range(H)]
if s[0][0] == '#': dp[0][0] = 1
else: dp[0][0] = 0
for j in range(W):
for i in range(H):
if i <= H - 2:
if s[i][j] == '.' and s[i+1][j] == '#':
dp[i+1][j] = min(dp[i+1][j], dp[i][j] + 1)
else: dp[i+1][j] = min(dp[i+1][j], dp[i][j])
if j <= W - 2:
if s[i][j] == '.' and s[i][j+1] == '#':
dp[i][j+1] = min(dp[i][j+1], dp[i][j] + 1)
else: dp[i][j+1] = min(dp[i][j+1], dp[i][j])
print(dp[H-1][W-1]) | 1 | 49,452,402,716,028 | null | 194 | 194 |
A=list(input())
n=int(input())
tmp=0
if len(set(A)) == 1:
print(len(A)*n//2)
exit()
sum_n=0
tmp3=0
while A[0] == A[tmp3]:
tmp3+=1
sum_n+=tmp3
tmp3=0
while A[-1] == A[-1-tmp3]:
tmp3+=1
sum_n+=tmp3
for i in range(len(A)-1):
if A[i] == A[i+1]:
A[i+1]="1"
tmp+=1
tmp2=0
if A[0] == A[-1]:
tmp2=n-1
if sum_n%2 == 1:
tmp2-=n-1
print(tmp*n+tmp2) | from copy import deepcopy
s = list(input())
k = int(input())
n = len(s)
if len(list(set(s))) == 1:
print(n*k//2)
exit()
n1 = 0
n2 = 0
s1 = deepcopy(s)
s2 = deepcopy(s) + deepcopy(s)
for i in range(n-1):
if s1[i] == s1[i+1]:
s1[i+1] = "?"
n1 += 1
for i in range(2*n - 1):
if s2[i] == s2[i+1]:
s2[i+1] = "?"
n2 += 1
d = n2 - n1
ans = n1 + d*(k-1)
print(ans) | 1 | 174,974,029,036,202 | null | 296 | 296 |
# M-SOLUTIONS プロコンオープン 2020: B – Magic 2
A, B, C = [int(i) for i in input().split()]
K = int(input())
is_success = 'No'
for i in range(K + 1):
for j in range(K + 1):
for k in range(K + 1):
if i + j + k <= K and A * 2 ** i < B * 2 ** j < C * 2 ** k:
is_success = 'Yes'
print(is_success) | A, B, C = map(int, input().split())
K = int(input())
flg = 0
for i in range(K):
if B > A:
if C > B or 2*C > B:
flg = 1
else:
C = 2*C
else:
B = 2*B
continue
if flg:
print('Yes')
else:
print('No') | 1 | 6,914,016,402,068 | null | 101 | 101 |
S=str(input())
ls = ["SAT","FRI","THU","WED","TUE","MON","SUN"]
for i in range(7):
if S == ls[i]:
print(i+1)
| s=input()
if 'SU' in s:
print('7')
if 'MO' in s:
print('6')
if 'TU' in s:
print('5')
if 'WE' in s:
print('4')
if 'TH' in s:
print('3')
if 'FR' in s:
print('2')
if 'SA' in s:
print('1')
| 1 | 132,550,505,798,868 | null | 270 | 270 |
# Begin Header {{{
from math import gcd
from collections import Counter, deque, defaultdict
from heapq import heappush, heappop, heappushpop, heapify, heapreplace, merge
from bisect import bisect_left, bisect_right, bisect, insort_left, insort_right, insort
from itertools import accumulate, product, permutations, combinations, combinations_with_replacement
# }}} End Header
# _________コーディングはここから！！___________
mod = 10**9+7
n = int(input())
ans=0
ans+=pow(10, n, mod)
ans-=pow(9, n, mod)*2
ans+=pow(8, n, mod)
print(ans%mod)
| A, B, C = list(map(int, input().split()))
K = int(input())
while(B <= A):
B *= 2
K -= 1
while(C <= B):
C *= 2
K -= 1
if(K >= 0): print("Yes")
else: print("No") | 0 | null | 5,085,623,441,792 | 78 | 101 |
A = str(input())
if A[-1] == "s":
print(A + "es");
else:
print(A + "s") | M1, D1 = [int(i) for i in input().split()]
M2, D2 = [int(i) for i in input().split()]
if D1>D2 and M2>M1:
print(1)
else:
print(0) | 0 | null | 63,611,625,359,360 | 71 | 264 |
a,b = map(int, input().split())
print(f'{a//b} {a%b} {(a/b):.6f}')
| print(sum(n for n in range(1+int(input())) if n%3 and n%5)) | 0 | null | 17,749,940,625,648 | 45 | 173 |
n=int(input())
arr1=[]
arr2=[]
for _ in range(n):
s=input()
cnt1=0
cnt2=0
for i in range(len(s)):
if s[i]=='(':
cnt1+=1
else:
if cnt1==0:
cnt2+=1
else:
cnt1-=1
if cnt1-cnt2>=0:
arr1.append([cnt1,cnt2])
else:
arr2.append([cnt1,cnt2])
arr1=sorted(arr1,key=lambda x:x[1])
arr2=sorted(arr2,reverse=True,key=lambda x:x[0])
arr=arr1+arr2
cnt=0
for a,b in arr:
if b>cnt:
print('No')
break
else:
cnt+=a-b
else:
if cnt==0:
print('Yes')
else:
print('No') | n = int(input())
L, R = [], []
for i in range(n):
a, b = 0, 0
for c in input():
if c == '(':
b += 1
if c == ')':
if b > 0:
b -= 1
else:
a += 1
if -a + b > 0:
L.append((a, b))
else:
R.append((a, b))
L.sort(key=lambda x: x[0])
R.sort(key=lambda x: x[1], reverse=True)
x = 0
for a, b in L + R:
x -= a
if x < 0:
print('No')
exit()
x += b
if x == 0:
print('Yes')
else:
print('No')
| 1 | 23,672,629,679,358 | null | 152 | 152 |
n = int(input())
A = list(map(int, input().split()))
A.sort(reverse=True)
A2 = [A[0]]
for a in A[1:]:
A2.extend([a, a])
ans = 0
for a in A2[:n-1]:
ans += a
print(ans) | n = int(input())
arr = list(map(int,input().split()))
arr.sort(reverse = True)
ans = arr[0]
odd = False
mult = n-2
if mult%2!=0:
mult-=1
odd = True
mult//=2
ans += sum(arr[1:1+mult])*2
if odd:
ans+=arr[1+mult]
print(ans)
"""
Sample:
7
1 2 3 4 5 6 7
2537146
7+6+6+5+5+4
""" | 1 | 9,217,387,163,702 | null | 111 | 111 |
import sys, itertools
for count, input in zip(itertools.count(1), sys.stdin):
if int(input) == 0: break
print('Case {0}: {1}'.format(count, input), end='') | s = input()
for _ in range(int(input())):
c = input().split()
a = int(c[1])
b = int(c[2])
if c[0] == "replace":
s = s[:a] + c[3] + s[b+1:]
elif c[0] == "reverse":
s = s[:a] + s[a:b+1][::-1] + s[b+1:]
else:
print(s[a:b+1])
| 0 | null | 1,301,202,044,620 | 42 | 68 |
#coding: UTF-8
def SLE(a,b):
if a > b:
return "a > b"
elif a < b:
return "a < b"
else:
return "a == b"
if __name__=="__main__":
a = input().split(" ")
ans = SLE(int(a[0]),int(a[1]))
print(ans) | H, N = map(int, input().split())
A = map(int, input().split())
print('Yes' if H <= sum(A) else 'No') | 0 | null | 39,084,929,203,072 | 38 | 226 |
import math
n, d = [int(n) for n in input().split(' ')]
cnt = 0
for i in range(n):
x, y = [int(n) for n in input().split(' ')]
if math.sqrt(x*x + y*y) <= d:
cnt += 1
print(cnt)
| #最大値の最小値を求める問題は二分探索
#求めるものを変数と見て丸太の最大値がxだとすると
#丸太の長さは全てx以下である必要があるため切るべき回数がわかる
#それがk回以下ならokだしそれがk回を超えていたらだめ
n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
ng=0
ok=max(a)
def check(x):
num=0
for i in range(n):
if a[i]%x==0:
num=num+a[i]//x-1
else:
num=num+a[i]//x
return num<=k
while ok-ng>1:
mid=(ok+ng)//2
if check(mid):
ok=mid
else:
ng=mid
print(ok)
| 0 | null | 6,213,607,701,728 | 96 | 99 |
h, n = map(int, input().split())
items = [tuple(map(int, input().split())) for _ in range(n)]
#dp[i][j] := i番目までの物でjの価値を実現するのに必要な最小コスト
dp = [[0] * (h+1) for _ in range(n+1)]
for j in range(1, h+1):
dp[0][j] = float("inf")
for i in range(n):
for j in range(h+1):
if j < items[i][0]:
dp[i+1][j] = min(dp[i][j], items[i][1])
else:
dp[i+1][j] = min(dp[i][j], dp[i+1][j-items[i][0]] + items[i][1])
print(dp[n][h]) | h,n=map(int,input().split())
c=[list(map(int,input().split()))for _ in range(n)]
d=[0]+[0]*20001
for i in range(h):
d[i]=min(d[i-a]+b for a,b in c)
print(d[h-1]) | 1 | 80,962,138,566,400 | null | 229 | 229 |
import math
a,b,rad_c = map(int,input().split())
S = b * a * math.sin(math.pi / 180 * rad_c) / 2
c = math.sqrt(a**2 + b**2 -2 * a * b * math.cos(math.pi / 180 * rad_c))
L = a + b + c
h = b * math.sin(math.pi / 180 * rad_c)
print(S,L,h) | import math
a,b,c_deg = map(float,input().split())
sin_c = math.sin(c_deg*math.pi/180)
cos_c = math.cos(c_deg*math.pi/180)
s = a*b*sin_c/2.0
c = math.sqrt(a**2+b**2-2*a*b*cos_c)
print(s)
print(a+b+c)
print(s/a*2.0) | 1 | 168,573,923,112 | null | 30 | 30 |
S = input()
SS =S.replace('?','D')
print(SS) | t=list(input())
for i in range(len(t)):
if t[i]=="?":
t[i]="D"
print(t[i],end='') | 1 | 18,564,374,484,928 | null | 140 | 140 |
s = input()
q = int(input())
for qi in range(q):
command = input().split()
a = int(command[1])
b = int(command[2])
if command[0] == 'print':
print(s[a:b + 1])
elif command[0] == 'reverse':
s = s[:a] + s[a:b + 1][::-1] + s[b + 1:]
else:
p = command[3]
s = s[:a] + p + s[b + 1:] | letters = input()
q = int(input())
for _ in range(q):
words = input().split()
command = words[0]
a, b = map(int, words[1:3])
if command == 'replace':
letters = ''.join([letters[:a], words[3], letters[b+1:]])
elif command == 'reverse':
letters = ''.join([letters[:a ], letters[a:b+1][::-1], letters[b+1:]])
elif command == 'print':
print(letters[a:b+1])
| 1 | 2,104,994,025,848 | null | 68 | 68 |
s=input()
l=len(s)
list_s=list(s)
ans=""
if(s[l-1]!="s"):
list_s.append("s")
elif(s[l-1]=="s"):
list_s.append("es")
for i in range(0,len(list_s)):
ans+=list_s[i]
print(ans) | s = input()
if s[-1] == 's':
s = s + "es"
else:
s = s + 's'
print(s)
| 1 | 2,362,203,165,240 | null | 71 | 71 |
print('ACL'*int(input())) | print(int(input()) * 'ACL')
| 1 | 2,187,789,138,960 | null | 69 | 69 |
A, B = input().split()
B = B.replace(".", "")
A, B = int(A), int(B)
print(A*B//100) | import math , sys
from decimal import Decimal
A , B = list( map( Decimal , input().split()))
print( int(A * B ) ) | 1 | 16,535,485,425,722 | null | 135 | 135 |
from collections import *
from copy import *
H,W = map(int,input().split())
S = [(W+2)*["#"]]+[["#"]+list(input())+["#"] for h in range(H)]+[(W+2)*["#"]]
D = [[1,0],[-1,0],[0,1],[0,-1]]
ans = 0
P = deque([])
Q = deque([])
for h in range(1,H+1):
for w in range(1,W+1):
if S[h][w]==".":
P+=[[h,w]]
while P:
T = deepcopy(S)
sx,sy = P.popleft()
T[sx][sy] = 0
Q = deque([[sx,sy]])
while Q:
x,y = Q.popleft()
for dx,dy in D:
if T[x+dx][y+dy]==".":
T[x+dx][y+dy] = T[x][y]+1
Q+=[[x+dx,y+dy]]
ans = max(ans,T[x+dx][y+dy])
print(ans) | from collections import deque
import copy
H, W = map(int, input().split())
route = []
for _ in range(H):
route.append(input())
wall = set()
start = set()
for y, r in enumerate(route):
for x, w in enumerate(r):
if w == '.':
start.add((x, y))
score = -1
ssize = [(-1,0),(0,-1),(1,0),(0,1)]
for xy in start:
d = deque()
d.append((xy+(0,)))
step = 0
can = copy.deepcopy(start)
can.remove(xy)
while len(d) > 0:
now = d.popleft()
step = now[2]
for xs, ys in ssize:
nxt = (now[0]+xs, now[1]+ys)
if nxt in can:
d.append(nxt+(step+1,))
can.remove(nxt)
score = max(step, score)
print(score) | 1 | 94,467,591,242,080 | null | 241 | 241 |
n, m, x = map(int, input().split())
ca = [(list(map(int, input().split()))) for _ in range(n)]
caca = [0]*(m+1)
ans = 12 * 10**5 +1
chk = 0
for nn in range(2**n):
for j in range(m+1):
caca[j] = 0
cnt = 0
for i in range(n):
if (nn>>i) & 1:
for j in range(m+1):
caca[j] += ca[i][j]
for j in range(1, m+1):
if caca[j] >= x:
cnt += 1
else:
break
if cnt == m:
ans = min(ans, caca[0])
chk = 1
print(ans if chk == 1 else -1) | import sys
n,m,x=map(int,input().split())
ac=[[0]*(m+1) for i in range(n)]
a=[[0]*m for i in range(0,n)]
c=[0 for i in range(n)]
for i in range(n):
ac[i]=list(map(int,input().split()))
c[i]=ac[i][0]
a[i]=ac[i][1:m+1]#sliceは上限+１を:の右に代入
cheap=[]
kaukadouka=[0 for i in range(n)]
def kau(i):
global a,x,kaukadouka,cheap,c
rikaido=[0 for i in range(m)]#初期化
for j in range(i+1,n):
kaukadouka[j]=0
if i>=n:
sys.exit()
kaukadouka[i]=1
for j in range(n):
for k in range(m):
rikaido[k]+=kaukadouka[j]*a[j][k]
value=0
if min(rikaido)>=x:
for j in range(n):
value+=c[j]*kaukadouka[j]
cheap.append(value)
if i<n-1:
kau(i+1)
kawanai(i+1)
def kawanai(i):
global kaukadouka
for j in range(i,n):
kaukadouka[j]=0
if i>=n:
sys.exit()
#print('i=',i,'のとき買わないで')
#print('->',kaukadouka)
if i<n-1:
kau(i+1)
kawanai(i+1)
kau(0)
kawanai(0)
if len(cheap)>0:
#print(cheap)
print(min(cheap))
else:
print('-1') | 1 | 22,284,385,584,420 | null | 149 | 149 |
import os, sys, re, math
(N, K) = [int(n) for n in input().split()]
H = [int(n) for n in input().split()]
H = sorted(H, reverse=True)[K:]
print(sum(H))
| S = list(map(str, input().split()))
count = len(S)
stack = []
for i in range(count):
if S[i] == "+":
b = stack.pop()
a = stack.pop()
stack.append(a + b)
elif S[i] == "-":
b = stack.pop()
a = stack.pop()
stack.append(a - b)
elif S[i] == "*":
b = stack.pop()
a = stack.pop()
stack.append(a * b)
else:
stack.append(int(S[i]))
print(stack[0])
| 0 | null | 39,307,223,427,484 | 227 | 18 |
#!/usr/bin/env python
inputlist = map(str,raw_input().split())
numberlist = []
for a in inputlist:
if a == "+":
b = numberlist[-2]
c = numberlist[-1]
numberlist[-2:]=[]
d = int(b) + int(c)
numberlist.append(d)
elif a == "-":
b = numberlist[-2]
c = numberlist[-1]
numberlist[-2:]=[]
d = int(b) - int(c)
numberlist.append(d)
elif a == "*":
b = numberlist[-2]
c = numberlist[-1]
numberlist[-2:]=[]
d = int(b) * int(c)
numberlist.append(d)
else:
numberlist.append(a)
print(numberlist[0]) | def add(a,b):
return a + b
def sub(a,b):
return a - b
def mul(a,b):
return a * b
def div(a,b):
return a/ float(b)
A=input().split()
i=0
for j in range(len(A)):
if A[i]=="+":
A[i-2]=(int)(A[i-2])
A[i-1]=(int)(A[i-1])
A[i]=add(A[i-2],A[i-1])
r=A[i]
del A[i-2]
del A[i-2]
i=i-2
if A[i]=="-":
A[i-2]=(int)(A[i-2])
A[i-1]=(int)(A[i-1])
A[i]=sub(A[i-2],A[i-1])
r=A[i]
del A[i-2]
del A[i-2]
i=i-2
if A[i]=="*":
A[i-2]=(int)(A[i-2])
A[i-1]=(int)(A[i-1])
A[i]=mul(A[i-2],A[i-1])
r=A[i]
del A[i-2]
del A[i-2]
i=i-2
if A[i]=="/":
A[i-2]=(int)(A[i-2])
A[i-1]=(int)(A[i-1])
A[i]=div(A[i-2],A[i-1])
r=A[i]
del A[i-2]
del A[i-2]
i=i-2
i=i+1
print(r)
| 1 | 38,454,848,220 | null | 18 | 18 |
data = raw_input().split()
#figure = [chr(i) for i in range(ord('0'), ord('9')+1)]
stack = []
for i in range(len(data)):
if data[i] == "+":
stack[-2] = stack[-2] + stack[-1]
del stack[-1]
#print stack
elif data[i] == "-":
stack[-2] = stack[-2] - stack[-1]
del stack[-1]
#print stack
elif data[i] == "*":
stack[-2] = stack[-2] * stack[-1]
del stack[-1]
#print stack
else:
stack.append(int(data[i]))
#print stack
print stack[0] | N = int(input())
line = list(map(int, input().split()))
cnt = 0
for i in range(N):
minj = i
for j in range(i+1, N):
if line[j] < line[minj]:
minj = j
if minj != i:
tmp = line[i]
line[i] = line[minj]
line[minj] = tmp
cnt += 1
print(' '.join(list(map(str, line))))
print(cnt) | 0 | null | 29,606,957,348 | 18 | 15 |
n = int(input())
for i in range(1, 180, 1):
if(360*i % n == 0):
print(int(360*i//n))
exit(0) | from scipy.sparse import*
f=csgraph.johnson
n,m,l,*t=map(int,open(0).read().split())
m*=3
[*map(print,f(f(csr_matrix((t[2:m:3],(t[:m:3],t[1:m:3])),[n+1]*2),0)<=l)[t[m+1::2],t[m+2::2]].clip(0,n)%n-1)] | 0 | null | 93,132,504,910,838 | 125 | 295 |
#!/usr/bin/env python3
import math
a, b, x = [int(s) for s in input().split()]
b_w = x / (a * a)
x1 = 2 * b_w - b
if x1 >= 0:
print(math.atan((b - x1) / a) / (2*math.pi) * 360)
else:
print(math.atan(b * a * b / x / 2) / (2*math.pi) * 360)
| import math
a, b, x = list(map(float, input().split()))
if x <= 0.5 * a * a * b:
res = math.degrees(math.atan(2 * x / (a * b * b)))
elif x < a * a * b:
res = math.degrees(math.atan(a / (2 * (b - x / a ** 2))))
else:
res = 90.0
print(f'{90 - res:.7f}')
| 1 | 163,589,416,695,318 | null | 289 | 289 |
from collections import Counter, defaultdict
import sys
sys.setrecursionlimit(10 ** 5 + 10)
input = sys.stdin.readline
from math import factorial
import heapq, bisect
import math
import itertools
import queue
from collections import deque
from fractions import Fraction
# 10進数表記でnのk進数を求めてlength分0埋め
def ternary (n, k, length):
if n == 0:
nums = ['0' for i in range(length)]
nums = ''.join(nums)
return nums
nums = ''
while n:
n, r = divmod(n, k)
nums += str(r)
nums = nums[::-1]
nums = nums.zfill(length)
return nums
def main():
num = int(input())
data = list(map(int, input().split()))
mod = 10 ** 9 + 7
max_length = len(bin(max(data))) - 2
bit_count = [0 for i in range(max_length)]
for i in range(num):
now_bin = bin(data[i])[2:]
now_bin = now_bin.zfill(max_length)
for j in range(max_length):
if now_bin[j] == "1":
bit_count[j] += 1
flg_data = [0 for i in range(max_length)]
for i in range(max_length):
flg_data[i] += bit_count[i] * (num - bit_count[i])
ans = 0
for j in range(max_length):
pow_num = max_length - 1 - j
bbb = pow(2, pow_num, mod)
ans += bbb * flg_data[j]
ans %= mod
print(ans)
if __name__ == '__main__':
main()
| from collections import defaultdict
N = int(input())
A = list(map(int, input().split()))
INF = 10 ** 9 + 7
D = defaultdict(int)
for a in A:
for i in range(61):
# a の i ビット目がたっているか否か
D[1 << i] += bool(a & (1 << i))
ans = 0
for key, value in D.items():
ans += key * value * (N - value)
ans %= INF
print(ans % INF) | 1 | 122,974,795,763,442 | null | 263 | 263 |
def readinput():
n=int(input())
a=list(map(int,input().split()))
return n,a
def main(n,a):
a.sort()
for i in range(n-1):
if a[i]==a[i+1]:
return 'NO'
return 'YES'
if __name__=='__main__':
n,a=readinput()
ans=main(n,a)
print(ans)
| N=int(input())
S=list(input())
a=0#色変化
for i in range(N-1):
if not S[i]==S[i+1]:
a=a+1
print(a+1) | 0 | null | 121,556,200,668,162 | 222 | 293 |
moji=""
while True:
try:
t = input()
moji += t.lower()
except :
break
moji2 = [chr(i) for i in range(97,97+26)]
for j in moji2:
print(j+" : "+str(moji.count(j)))
| mod = 10**9+7
def factorials(n,m):
# 0~n!のリスト
f = [1,1]
for i in range(2,n+1):
f.append(f[-1]*i%m)
# 0~n!の逆元のリスト
g = [1]
for i in range(n):
g.append(pow(f[i+1],m-2,m))
return f,g
f,g = factorials(4*10**5,mod)
n,k = map(int, input().split())
if k>=n-1:
print((f[2*n-1]*g[n]*g[n-1])%mod)
else:
ans = 0
for x in range(k+1):
ans += f[n-1]*g[x]*g[n-x-1]*f[n]*g[n-x]*g[x]
ans %= mod
print(ans) | 0 | null | 34,196,783,641,340 | 63 | 215 |
def pd(n):
i = 2
ans = []
while i ** 2 <= n:
while n % i == 0:
n /= i
ans.append(i)
i += 1
if n > 1:
ans.append(n)
return ans
def gcd(a, b):
gcd = 1
pd_a = pd(a)
pd_b = pd(b)
for i in pd_a:
if i in pd_b:
pd_b.remove(i)
gcd *= i
return int(gcd)
def lcm(a, b):
lcm = a
pd_a = pd(a)
pd_b = pd(b)
for i in pd_a:
if i in pd_b:
pd_b.remove(i)
for j in pd_b:
lcm *= j
return int(lcm)
while True:
try:
s = input()
a,b = [int(i) for i in s.split(' ')]
except:
break
print(gcd(a, b), lcm(a, b))
| s = input()
t = input()
s_len = len(s)
t_len = len(t)
out = t_len
for i in range(0, s_len - t_len + 1):
diff = 0
for j in range(0, t_len):
if t[j] != s[i + j]:
diff += 1
out = min(out, diff)
print(out)
| 0 | null | 1,837,777,240,768 | 5 | 82 |
palavra= input()
tam= len(palavra)
if palavra[tam-1]=='s':
print(palavra+'es')
else:
print(palavra+'s') | S = input()
if S.endswith("s"): print(S + "es")
else: print(S + "s") | 1 | 2,382,380,708,748 | null | 71 | 71 |
def readinput():
n,x,m=map(int,input().split())
return n,x,m
def main(n,x,m):
ans_list=[]
hist=[0]*m
val=x
count=0
while hist[val]==0 and count<n:
ans_list.append(val)
hist[val]+=1
val=(val*val)%m
if count==n:
loop_start=0
loop_len=n
else:
i=0
while ans_list[i] != val:
i+=1
loop_start=i
loop_len=len(ans_list)-i
# print(ans_list)
# print(loop_start)
# print(loop_len)
ans=sum(ans_list[:loop_start])
ans+=sum(ans_list[loop_start:])*((n-loop_start)//loop_len)
ans+=sum(ans_list[loop_start:loop_start+(n-loop_start)%loop_len])
# ans=sum(ans_list)*(n//loop_len) + sum(ans_list[:n%loop_len])
return ans
if __name__=='__main__':
n,x,m=readinput()
ans=main(n,x,m)
print(ans) | x, y = input().split()
x = int(x)
z = round(float(y)*100)
print(x*z//100) | 0 | null | 9,645,453,231,852 | 75 | 135 |
from collections import deque
import math
import copy
#https://qiita.com/ophhdn/items/fb10c932d44b18d12656
def max_dist(input_maze,startx,starty,mazex,mazey):
input_maze[starty][startx]=0
que=deque([[starty,startx]])
# print(que)
while que:
# print(que,input_maze)
y,x=que.popleft()
for i,j in [(1,0),(0,1),(-1,0),(0,-1)]:
nexty,nextx=y+i,x+j
if (nexty>=0) & (nextx>=0) & (nextx<mazex) & (nexty<mazey):
dist=input_maze[nexty][nextx]
if dist!=-1:
if (dist>input_maze[y][x]+1) & (dist > 0):
input_maze[nexty][nextx]=input_maze[y][x]+1
que.append([nexty,nextx])
# print(que)
# print(max(list(map(lambda x: max(x),copy_maze))))
return max(list(map(lambda x: max(x),copy_maze)))
h,w =list(map(int,input().split()))
maze=[list(input()) for l in range(h)]
# Maze preprocess
for y in range(h):
for x in range(w):
if maze[y][x]=='.':
maze[y][x]=math.inf
elif maze[y][x] == '#':
maze[y][x]=int(-1)
results = []
for y in range(h):
for x in range(w):
if maze[y][x]==math.inf:
copy_maze = copy.deepcopy(maze)
max_dist_result = max_dist(copy_maze,x,y,w,h)
results.append(int(max_dist_result))
#print(max_dist_result)
print(max(results))
| from collections import deque
import copy
H,W=map(int,input().split())
inf=1000000000
field=[]
for i in range(H):
row=list(input())
for j in range(len(row)):
if row[j]=='#':row[j]=-1
else:row[j]=inf
field.append(row)
ans=inf
def isIn(x,y):
if x<0 or x>=W:return False
if y<0 or y>=H:return False
return True
vector=[[0,1],[0,-1],[1,0],[-1,0]]
ans=0
for i in range(H):
for j in range(W):
if field[i][j]==-1:continue
l=deque([[j,i]])
f=copy.deepcopy(field)
f[i][j]=0
tmp=0
#print('--start--')
while l:
x,y=l.popleft()
#print(x,y)
#i,jを訪問
for v in vector:
if not isIn(x+v[1],y+v[0]):continue
if f[y+v[0]][x+v[1]]<=tmp:continue
f[y+v[0]][x+v[1]]=f[y][x]+1
l.append([x+v[1],y+v[0]])
tmp=max(f[y+v[0]][x+v[1]],tmp)
ans=max(ans,tmp)
print(ans) | 1 | 94,522,623,564,740 | null | 241 | 241 |
def main():
N = int(input())
a = []
for _ in range(N):
a.append(list(map(int, input().split())))
for x in range(N):
a[x].sort(reverse = True)
if a[x][0] ** 2 == a[x][1] ** 2 + a[x][2] ** 2:
print("YES")
else:
print("NO")
if __name__ == "__main__":
main() | S = input()
K = int(input())
if len(set(S)) == 1:
print(len(S)*K//2)
exit()
b = [1]
for i in range(len(S)-1):
if S[i] == S[i+1]:
b[-1] += 1
else:
b.append(1)
ans = 0
for i in b:
ans += i//2
ans *= K
if S[0] == S[-1] and b[0]%2 == b[-1]%2 == 1:
ans += K - 1
print(ans) | 0 | null | 87,842,355,161,430 | 4 | 296 |
N=int(input())
if N % 2 or N < 10:
print(0)
exit()
ans = 0
i = 1
while 2*5**i<=N:
ans += N // (2*5**i)
i += 1
print(ans) | class Dice:
def __init__(self, U, S, E, W, N, D):
self.u, self.d = U, D
self.e, self.w = E, W
self.s, self.n = S, N
def roll(self, commmand):
if command == 'E':
self.e, self.u, self.w, self.d = self.u, self.w, self.d, self.e
elif command == 'W':
self.e, self.u, self.w, self.d = self.d, self.e, self.u, self.w
elif command == 'S':
self.s, self.u, self.n, self.d = self.u, self.n, self.d, self.s
else:
self.s, self.u, self.n, self.d = self.d, self.s, self.u, self.n
def rightside(self, upside, forward):
self.structure = {self.u:{self.w: self.s, self.s: self.e, self.e: self.n, self.n: self.w},
self.d:{self.n: self.e, self.e: self.s, self.s: self.w, self.w: self.n},
self.e:{self.u: self.s, self.s: self.d, self.d: self.n, self.n: self.u},
self.s:{self.u: self.w, self.w: self.d, self.d: self.e, self.e: self.u},
self.w:{self.u: self.n, self.n: self.d, self.d: self.s, self.s: self.u},
self.n:{self.u: self.e, self.e: self.d, self.d: self.w, self.w: self.u}}
print(self.structure[upside][forward])
U, S, E, W, N, D = [int(i) for i in input().split()]
turns = int(input())
dice1 = Dice(U, S, E, W, N, D)
for i in range(turns):
upside, forward = [int(k) for k in input().split()]
dice1.rightside(upside, forward)
| 0 | null | 58,320,221,397,002 | 258 | 34 |
from math import sin, cos, radians
a, b, ang = map(int, input().split())
ang = radians(ang)
area = a * b * sin(ang) / 2
c = (a ** 2 + b ** 2 - 2 * a * b * cos(ang)) ** 0.5
circ = a + b + c
height = area * 2 / a
print("%lf\n%lf\n%lf" % (area, circ, height))
| n,k = [int(x) for x in input().split()]
a = [int(x) for x in input().split()]
res = 0
for i in range(n):
if k <= a[i]:
res += 1
print(res) | 0 | null | 89,546,091,168,588 | 30 | 298 |
n=int(input())
a=list(map(int,input().split()))
mod=10**9+7
ans=0
for i in range(60):
on=0
off=0
for j in a:
if (j>>i)&1:
on+=1
else:
off+=1
ans+=(on*off)*(2**i)
ans%=mod
print(ans) | N = int(raw_input())
n = map(int, raw_input().split())
for f in reversed(n):
print f, | 0 | null | 62,191,180,170,548 | 263 | 53 |
x = int(raw_input())
print "%d" % x**3 | s = input()
num = int(s)
print(str(num**3))
| 1 | 274,723,273,588 | null | 35 | 35 |
def main():
A, B = map(int, input().split())
print(A * B)
if __name__ == '__main__':
main()
| def main():
import sys
input = sys.stdin.readline
x, y = map(int, input().split())
print(x*y)
return
if __name__ == '__main__':
main() | 1 | 15,935,301,980,978 | null | 133 | 133 |
def bubble(A, N):
c = 0
flag = True
while flag:
flag = False
for j in range(N-1, 0, -1):
if A[j] < A[j-1]:
A[j], A[j-1] = A[j-1], A[j]
c += 1
flag = True
return A, c
if __name__ == "__main__":
N = int(input())
A = [int(i) for i in input().split()]
A, c = bubble(A, N)
print (*A)
print (c) | import sys
lines = sys.stdin.readlines()
N = lines[0]
A = lines[1].strip().split(" ")
flag = 1
c = 0
i = 0
while flag == 1:
flag = 0
for j in reversed(range(i+1,len(A))):
if int(A[j]) < int(A[j-1]):
a = A[j]
b = A[j-1]
A[j] = b
A[j-1] = a
flag = 1
c += 1
i += 1
print " ".join(A)
print c | 1 | 16,944,242,658 | null | 14 | 14 |
class UnionFind(object):
def __init__(self, n=1):
self.par = [i for i in range(n)]
self.rank = [0 for _ in range(n)]
self.size = [1 for _ in range(n)]
def find(self, x):
if self.par[x] == x:
return x
else:
self.par[x] = self.find(self.par[x])
return self.par[x]
def union(self, x, y):
x = self.find(x)
y = self.find(y)
if x != y:
if self.rank[x] < self.rank[y]:
x, y = y, x
if self.rank[x] == self.rank[y]:
self.rank[x] += 1
self.par[y] = x
self.size[x] += self.size[y]
def is_same(self, x, y):
return self.find(x) == self.find(y)
def get_size(self, x):
x = self.find(x)
return self.size[x]
N, M = map(int, input().split())
u = UnionFind(N+1)
for i in range(M):
A, B = map(int, input().split())
u.union(A, B)
print(max([u.get_size(i) for i in range(1, N+1)])) | from sys import stdin
nii=lambda:map(int,stdin.readline().split())
lnii=lambda:list(map(int,stdin.readline().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 same(self, x, y):
return self.find(x) == self.find(y)
def size(self, x):
return -self.parents[self.find(x)]
def members(self, x):
root = self.find(x)
return [i for i in range(self.n) if self.find(i) == root]
def roots(self):
return [i for i, x in enumerate(self.parents) if x < 0]
def group_count(self):
return len(self.roots())
def all_group_members(self):
return {r: self.members(r) for r in self.roots()}
def __str__(self):
return '\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())
n,m=nii()
uf=UnionFind(n)
for i in range(m):
a,b=nii()
a-=1
b-=1
uf.union(a,b)
root=uf.roots()
ans=0
for i in root:
ans=max(ans,uf.size(i))
print(ans) | 1 | 3,939,320,624,710 | null | 84 | 84 |
#D - Chat in a Circle
N = int(input())
A = list(map(int,input().split()))
#ソート
arr = []
arr = sorted(A,reverse = True)
Friend_min_max_wa = 0
i =0
j = 0
for i in range(N -1):
if i % 2 != 0 : j = j + 1
Friend_min_max_wa = Friend_min_max_wa + arr[j]
# 出力
print(Friend_min_max_wa) | import numpy as np
N = int(input())
comfort = list(map(int,input().split()))
comfort_reverse = np.sort(comfort)[::-1]
ans = comfort_reverse[0]
if N > 2:
for i in range(N-2):
num = i // 2 + 1
ans += comfort_reverse[num]
print(ans) | 1 | 9,274,013,356,722 | null | 111 | 111 |
n = int(input())
X = list(map(int, input().split()))
Y = list(map(int, input().split()))
C = [abs(X[i] - Y[i]) for i in range(n)]
D = []
def distance(X, Y):
for k in range(1, 4):
d = 0
for j in range(len(X)):
d += C[j] ** k
d = d ** (1 / k)
D.append(d)
D.append(max(C))
return D
distance(X, Y)
for i in range(4):
print('{:.08f}'.format(D[i]))
| h,w=map(int,input().split())
s=[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
dx=[1,0]
dy=[0,1]
for i in range(h):
for j in range(w):
for dir in range(2):
ni=i+dy[dir]
nj=j+dx[dir]
if ni>=h or nj>=w:
continue
add=0
if s[ni][nj]=='#' and s[i][j]=='.':
add=1
dp[ni][nj] = min(dp[ni][nj], dp[i][j]+add)
print(dp[-1][-1]) | 0 | null | 24,695,196,800,780 | 32 | 194 |
#168b
#値を受け取る
K = int(input())
S = str(input())
#Kになるまで文字を取り、K以降の文字列は'…'で表す
def answer(K: int, S: str) -> str:
if len(S) <= K:
return S
else:
return S[:K] + '...'
print(answer(K, S)) | K=int(input())
S=input()
print(S if len(S)<=K else S[:K]+"...")
| 1 | 19,789,617,357,410 | null | 143 | 143 |
n = int(input())
A = [0] + sorted(list(map(int, input().split())), reverse=True)
res = A[1] + sum(A[2:(n//2)+1]) * 2
if n % 2 == 0:
print(res)
else:
res += A[n//2 + 1]
print(res) | from sys import stdin
nii=lambda:map(int,stdin.readline().split())
lnii=lambda:list(map(int,stdin.readline().split()))
from collections import deque
n,u,v=nii()
u-=1
v-=1
tree=[[] for i in range(n)]
for i in range(n-1):
a,b=nii()
a-=1
b-=1
tree[a].append(b)
tree[b].append(a)
def BFS(s):
dist=[-1 for i in range(n)]
dist[s]=0
que=deque()
que.append(s)
while que:
x=que.popleft()
for i in tree[x]:
if dist[i]==-1:
que.append(i)
dist[i]=dist[x]+1
return dist
dist_t=BFS(u)
dist_a=BFS(v)
ans=0
for i in range(n):
if dist_a[i]>dist_t[i]:
ans=max(ans,dist_a[i]-1)
print(ans) | 0 | null | 63,206,576,177,380 | 111 | 259 |
Subsets and Splits
No saved queries yet
Save your SQL queries to embed, download, and access them later. Queries will appear here once saved.