code1
stringlengths 16
427k
| code2
stringlengths 16
427k
| similar
int64 0
1
| pair_id
int64 6.82M
181,637B
⌀ | question_pair_id
float64 101M
180,471B
⌀ | code1_group
int64 2
299
| code2_group
int64 2
299
|
|---|---|---|---|---|---|---|
n = int(input())
s = input()
h = int(n/2)
s=list(s)
if s[0:h] == s[h:n]:
print("Yes")
else: print("No")
|
N=int(input())
S=input()
if S[0:N//2]==S[N//2:N]:
print("Yes")
else:
print("No")
| 1 | 146,620,540,208,770 | null | 279 | 279 |
chars = [chr(i) for i in range(ord('a'), ord('z') + 1)]
arr = []
x = int(input())
def get_len(n):
length = 1
t = 26
while True:
if n <= t:
return length
t += 26 ** (length + 1)
length += 1
if length > 1000000000000001:
raise
def get_ord(n):
st = 1
end = 26
ind = 1
while True:
if st <= n <= end:
return x - st
st = end + 1
end += 26 ** (ind + 1)
ind += 1
length = get_len(x)
order = get_ord(x)
# print(length)
for i in range(length):
s = order % 26
order = order // 26
arr.append(s)
# print(arr)
ans = ""
for ai in arr[::-1]:
ans += chars[ai]
print(ans)
|
X = int(input())
quint = [0] * 1001
for i in range(1, 1001):
quint[i] = i ** 5
for i in range(0, 1001):
a = X - quint[i]
b = X + quint[i]
try:
c = quint.index(a)
print("{} {}".format(c, -i))
break
except:
try:
c = quint.index(b)
print("{} {}".format(c, i))
break
except:
continue
| 0 | null | 18,804,149,565,510 | 121 | 156 |
a, b = map(int, input().split())
S = a*b
L = 2*(a+b)
print(S,L)
|
a, b = [int(x) for x in input().split()]
print("{} {}".format(a * b, 2 * a + 2 * b))
| 1 | 295,577,528,038 | null | 36 | 36 |
n = int(input())
a_ls = list(map(int, input().split()))
def isOK(a,b,c):
return abs(a-b) < c < a+b
a_ls.sort()
ans = 0
for i in range(n):
short = a_ls[i]
r = i+1
num = 0
for l in range(i+1,n-1):
while r+1 < n and isOK(short, a_ls[l], a_ls[r+1]):
r += 1
num += r - l
if l == r:
r += 1
ans += num
print(ans)
|
k = int(input())
def rec(d, n, array):
array.append(n)
if d == 10:
return
for i in [-1, 0, 1]:
add = n % 10 + i
if 0 <= add <= 9:
rec(d + 1, 10 * n + add, array)
array = []
for i in range(1, 10):
rec(1, i, array)
s_array = sorted(array)
ans = s_array[k - 1]
print(ans)
| 0 | null | 105,630,536,685,850 | 294 | 181 |
def lu(n):
L.append(n)
a=n%10
if len(str(n))>11:
return 1
if a==0:
lu(n*10+1)
lu(n*10)
elif a==9:
lu(n*10+9)
lu(n*10+8)
else:
lu(n*10+1+a)
lu(n*10+a-1)
lu(n*10+a)
L=list()
lu(1)
lu(2)
lu(3)
lu(4)
lu(5)
lu(6)
lu(7)
lu(8)
lu(9)
L=sorted(set(L))
k=int(input())
print(L[k-1])
|
import sys
n, m = map(int, sys.stdin.readline().split())
if n == m:
print('Yes')
else:
print('No')
| 0 | null | 61,652,889,191,076 | 181 | 231 |
M1, D1 = map(int, input().split())
M2, D2 = map(int, input().split())
if M1 in [1, 3, 5, 7, 8, 10, 12]:
if D1 == 31:
print(1)
else:
print(0)
elif M1 in [4, 6, 9, 11]:
if D1 == 30:
print(1)
else:
print(0)
elif M1 == 2:
if D1 == 28:
print(1)
else:
print(0)
|
build = [[[0]*10,[0]*10,[0]*10],[[0]*10,[0]*10,[0]*10],[[0]*10,[0]*10,[0]*10],[[0]*10,[0]*10,[0]*10]]
n = int(input())
for i in range(n):
b, f, r, v = [int(x) for x in input().split()]
build[b-1][f-1][r-1] += v
count = 0
for i1 in build:
for i2 in i1:
line = ""
for i3 in i2:
line += " " + str(i3)
print(line)
if count < 3:
print("#"*20)
count += 1
| 0 | null | 62,732,626,319,760 | 264 | 55 |
def main():
N=int(input())
A=list(map(int,input().split()))
mod=10**9+7
ans=0
for i in range(60):
c=0
for j in A:
if j>>i&1:
c+=1
ans+=pow(2,i,mod)*c*(N-c)
ans%=mod
print(ans)
if __name__=='__main__':
main()
|
s = input()
n = int(input())
for i in range(n):
c = input().split()
a = int(c[1])
b = int(c[2])
if "replace" in c:
s = s[:a] + c[3] + s[b+1:]
if "reverse" in c:
u = s[a:b+1]
s = s[:a] + u[:: -1] +s[b + 1:]
if "print" in c:
print(s[a:b+1], sep = '')
| 0 | null | 62,825,048,535,018 | 263 | 68 |
def solve():
N, K = list(map(int, input().split()))
if(N >= K):
tmp = N - ((N // K) * K)
ans = min(tmp, abs(abs(tmp) - K))
elif(N < K):
if(K <= 2*N):
ans = abs(N - K)
else:
ans = abs(N)
print(ans)
if __name__ == "__main__":
solve()
|
import sys
n, k = map(int, sys.stdin.buffer.read().split())
rem = n % k
print(min(rem, k - rem))
| 1 | 39,176,066,910,720 | null | 180 | 180 |
def funcs(a, b, c):
x = int(a)
y = int(b)
z = int(c)
if x < y < z:
print("Yes")
else:
print("No")
tmp = input()
a, b, c = tmp.split(" ")
funcs(a, b, c)
|
a, b, c = [int(i) for i in raw_input().split()]
if a < b< c:
print "Yes"
else:
print "No"
| 1 | 379,244,432,220 | null | 39 | 39 |
N, M = map(int, input().split())
x = N + M
print(x * (x - 1) // 2 - N * M)
|
W = raw_input().lower()
c = 0
while True:
T = raw_input()
if T == "END_OF_TEXT":
break
Ti = T.lower().split()
for i in Ti:
if i == W:
c += 1
print("%d" % (c, ))
| 0 | null | 23,847,700,142,098 | 189 | 65 |
n = int(input())
def make_divisors(n):
divisors = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n//i)
divisors.sort()
return divisors
p = make_divisors(n)
x = 0
i = 1
ans = 0
def countf(x):
for j in range(1,x+2):
if (1+j)*j//2 > x:
return j - 1
while n != 1:
if n % p[i] == 0:
x += 1
n = n // p[i]
else:
if x != 0:
ans += countf(x)
x = 0
i += 1
ans += countf(x)
print(ans)
|
a = str(input())
if 'A'<=a and a<='Z':
print('A')
else:
print('a')
| 0 | null | 14,127,097,828,700 | 136 | 119 |
import numpy as np
n,m,x = map(int, input().split())
li = []
for i in range(n):
c_A = list(map(int, input().split()))
li.append(c_A)
li = np.array(li)
cost = 10**7
for i in range(2**n):
c_s = np.array([0]*(m+1))
for j in range(n):
if ((i>>j)&1):
c_s += li[j]
if np.all(c_s[1:]>=x):
cost = min(cost,c_s[0])
if cost==10**7:
print(-1)
else:
print(cost)
|
x, n = map(int, input().split())
li_p = list(map(int, input().split()))
li_p.sort()
i = 0
while True:
a = x - i
b = x + i
if not a in li_p:
print(a)
break
elif a in li_p and not b in li_p:
print(b)
break
elif a in li_p and b in li_p:
i += 1
| 0 | null | 18,241,485,497,860 | 149 | 128 |
#!/usr/bin/env python
letters = []
for i in range(26):
letters.append(chr(i + 97) + " : ")
contents = []
while True:
try:
text = input()
except EOFError:
break
contents.append(text)
#65-90 uppercase
#97-122lowercase
i = 0
for y in letters:
value = 0
for text in contents:
for x in text:
if x.isupper():
x = x.lower()
if x in y:
value += 1
elif x.islower():
if x in y:
value += 1
letters[i] = letters[i] + str(value)
i += 1
for x in letters:
print(x)
|
n = int(input())
L = list(map(int, input().split()))
ans = 0
for i in range(n):
for j in range(i+1, n):
for k in range(j+1, n):
if L[i] == L[j] or L[j] == L[k] or L[k] == L[i]:
pass
elif L[i] + L[j] > L[k] and L[j] + L[k] > L[i] and L[k] + L[i] > L[j]:
ans += 1
print(ans)
| 0 | null | 3,319,438,626,520 | 63 | 91 |
def main():
n = int(input())
a = sorted(list(map(int,input().split())),reverse=True)
ans = a[0]
for i in range(3,n+1):
if i%2==0:
ans += a[i//2-1]
else:
ans += a[(i-1)//2]
print(ans)
if __name__ == "__main__":
main()
|
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))
def solve():
n = ini()
a = inl()
x = 0
for y in a:
x ^= y
b = [x ^ y for i, y in enumerate(a)]
return b
print(*solve())
| 0 | null | 10,834,992,279,972 | 111 | 123 |
n, p = map(int, input().split())
s = input()
if 10%p==0:
ans = 0
for r in range(n):
if int(s[r])%p == 0:
ans += r+1
print(ans)
exit()
d = [0]*(n+1)
ten = 1
for i in range(n-1, -1, -1):
a = int(s[i])*ten%p
d[i] = (d[i+1]+a)%p
ten *= 10
ten %= p
cnt = [0]*p
ans = 0
for i in range(n, -1, -1):
ans += cnt[d[i]]
cnt[d[i]] += 1
print(ans)
|
h1, m1, h2, m2, k = map(int, input().split())
st = h1 * 60 + m1
ed = h2 * 60 + m2
ans = ed - st - k
if ans < 0:
ans = 0
print(ans)
| 0 | null | 38,398,307,231,932 | 205 | 139 |
N = int(input())
S = input()
res = 0
f = S[0]
for i in range(N):
if S[i] != f:
f = S[i]
res += 1
print(res+1)
|
#!/usr/bin python3
# -*- coding: utf-8 -*-
def main():
N = int(input())
S = input()
nw = S[0]
ret = 1
for i in range(1,N):
if nw == S[i]:
continue
else:
nw = S[i]
ret += 1
print(ret)
if __name__ == '__main__':
main()
| 1 | 170,315,918,808,848 | null | 293 | 293 |
n,k = map(int,input().split())
p = [int(x) for x in input().split()]
p.sort()
print(sum(p[0:k]))
|
def main():
N, K = map(int, input().split())
*P, = map(int, input().split())
P.sort()
print(sum(P[:K]))
if __name__ == '__main__':
main()
| 1 | 11,735,106,103,646 | null | 120 | 120 |
N=int(input())
D=list(map(int,input().split()))
isOK=True
if D[0]!=0:
isOK=False
for i in range(1,N):
if D[i]==0:
isOK=False
break
cnt=[0]*(max(D)+1)
MOD=998244353
for i in range(N):
cnt[D[i]]+=1
ans=1
for i in range(len(cnt)-1):
for r in range(cnt[i+1]):
ans=ans*cnt[i]%MOD
if isOK:
print(ans)
else:
print(0)
|
N = int(input())
def f(l, r):
cnt = 0
if l == r and l <= N:
cnt += 1
if l*10 + r <= N:
cnt += 1
for c in range(1, 5):
x = l*10**(c+1) + r
i = 0
I = int("9"*c)
while x <= N and i <= I:
cnt += 1
x += 10
i += 1
return cnt
C = [[0]*9 for _ in range(9)]
ans = 0
for i in range(9):
for j in range(9):
C[i][j] = f(i+1, j+1)
for i in range(9):
for j in range(9):
ans += C[i][j] * C[j][i]
print(ans)
| 0 | null | 120,771,365,660,748 | 284 | 234 |
from statistics import median
#import collections
#aa = collections.Counter(a) # list to list || .most_common(2)で最大の2個とりだせるお a[0][0]
from fractions import gcd
from itertools import combinations # (string,3) 3回
from collections import deque
from collections import defaultdict
import bisect
#
# d = m - k[i] - k[j]
# if kk[bisect.bisect_right(kk,d) - 1] == d:
#
#
#
# pythonで無理なときは、pypyでやると正解するかも！！
#
#
import sys
sys.setrecursionlimit(10000000)
mod = 10**9 + 7
def readInts():
return list(map(int,input().split()))
def main():
n,k,s = readInts()
ans = []
for i in range(k):
ans.append(s)
for i in range(k,n):
if s >= 100:
ans.append(s-1)
else:
ans.append(s+1)
print(*ans)
if __name__ == '__main__':
main()
|
#!/usr/bin/env python3
# Generated by https://github.com/kyuridenamida/atcoder-tools
from typing import *
import itertools
import math
import sys
INF = float('inf')
def solve(N: int, K: int, p: "List[int]"):
return sum(sorted(p)[:K])
def main():
sys.setrecursionlimit(10 ** 6)
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
tokens = iterate_tokens()
N = int(next(tokens)) # type: int
K = int(next(tokens)) # type: int
p = [int(next(tokens)) for _ in range(N)] # type: "List[int]"
print(solve(N, K, p))
if __name__ == '__main__':
main()
| 0 | null | 51,265,270,006,742 | 238 | 120 |
# -*- coding: utf-8 -*-
import sys
from sys import stdin
import math
n, k = map(int, stdin.readline().split())
w = list([int(stdin.readline().rstrip()) for i in range(n)])
def main2():
def is_ok():
cnt_track = w_tmp = 0
for w_i in w:
w_tmp += w_i
if w_tmp > m:
w_tmp = w_i
cnt_track += 1
if cnt_track >= k:
return 0
return 1
r = sum(w)
l = max(math.ceil(r/k),max(w))
while l < r:
m = (l + r) // 2
# print("%d %d %d " % (l, r, m))
if is_ok():
r = m
else:
l = m + 1
print(r)
if __name__ == '__main__':
main2()
|
N,M = map(int,input().split())
H = list(map(int,input().split()))
L = [ list(map(int,input().split())) for i in range(M) ]
d = { k+1:True for k in range(N) }
for l in L :
if H[l[0]-1] <= H[l[1]-1] :
d[l[0]] = False
if H[l[0]-1] >= H[l[1]-1] :
d[l[1]] = False
ans = 0
for v in d.values() :
if v :
ans += 1
print(ans)
| 0 | null | 12,554,574,162,610 | 24 | 155 |
import sys
#import numpy as np
import copy
fline = input().rstrip().split(' ')
N, Q = int(fline[0]), int(fline[1])
list = []
for i in range(N):
tlist = []
line = input().split(' ')
tlist = [line[0], line[1]]
#print(tlist)
list.append(tlist)
#print(list)
current = 0
while len(list) != 0:
if int(list[0][1]) <= Q:
current += int(list[0][1])
print(list[0][0] + " " + str(current))
del list[0]
else:
list[0][1] = str((int)(list[0][1])-Q)
list.append(list[0])
del list[0]
current += Q
#print(list)
|
n,q=map(int,input().split())
#print(n,p)
round_robin=[]
for i in range(n):
x=input().split()
name=x[0]
t=int(x[1])
round_robin.append([name,t])
#print(round_robin)
finished=[]
counter=0
while round_robin:
left_time=round_robin[0][1]
if left_time<=q:
counter+=left_time
finished.append([round_robin[0][0],counter])
del round_robin[0]
else:
counter+=q
left_time-=q
round_robin[0]=[round_robin[0][0],left_time]
round_robin.append(round_robin.pop(0))
for i in finished:
print(*i)
| 1 | 42,914,055,072 | null | 19 | 19 |
import sys
sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
f_inf = float('inf')
mod = 10 ** 9 + 7
def resolve():
H, W, k = map(int, input().split())
grid = [[0] * W for _ in range(H)]
for _ in range(k):
r, c, v = map(int, input().split())
grid[r - 1][c - 1] = v
# dp[i][h][w]:h行目のアイテムをi個取得した時の、座標(h,w)における価値の最大値
dp = [[[0] * W for _ in range(H)] for _ in range(4)]
dp[1][0][0] = grid[0][0]
for h in range(H):
for w in range(W):
for i in range(4):
# 下に移動する場合
if h + 1 < H:
# アイテムを取らない
dp[0][h + 1][w] = max(dp[0][h + 1][w], dp[i][h][w])
# アイテムを取る
dp[1][h + 1][w] = max(dp[1][h + 1][w], dp[i][h][w] + grid[h + 1][w])
# 右に移動する場合
if w + 1 < W:
# アイテムを取らない
dp[i][h][w + 1] = max(dp[i][h][w + 1], dp[i][h][w])
# アイテムを取る（但し、4個以上所持してはいけない）
if i + 1 < 4:
dp[i + 1][h][w + 1] = max(dp[i + 1][h][w + 1], dp[i][h][w] + grid[h][w + 1])
res = 0
for i in range(4):
res = max(res, dp[i][-1][-1])
print(res)
if __name__ == '__main__':
resolve()
|
import sys
# \n
def input():
return sys.stdin.readline().rstrip()
def main():
N, K = map(int, input().split())
A = list(map(int, input().split()))
F = list(map(int, input().split()))
A.sort(reverse=True) # 0(NlogN)
F.sort() # O(NlogN)
def train(X, Y, T): # O(N) ans: 回数
ans = 0
for i in range(len(X)):
ans += max(0, X[i] - T // Y[i])
return ans
ok = 10**18+1 #時間
ng = -1
while ok - ng > 1:
mid = (ok + ng) // 2 #時間
ans = train(A,F,mid) #kaisuu
if ans >K:
ng =mid
else:
ok =mid
print(ok)
if __name__ == "__main__":
main()
| 0 | null | 85,368,901,716,922 | 94 | 290 |
def main() :
lst = input().split()
stack = []
for i in lst :
if i == "+" :
x = stack.pop()
y = stack.pop()
stack.append(x + y)
elif i == "-" :
x = stack.pop()
y = stack.pop()
stack.append(y - x)
elif i == "*" :
x = stack.pop()
y = stack.pop()
stack.append(x * y)
else :
stack.append(int(i))
print(stack.pop())
if __name__ == "__main__" :
main()
|
import sys
import os
import math
import bisect
import itertools
import collections
import heapq
import queue
import array
# 時々使う
# from scipy.sparse.csgraph import csgraph_from_dense, floyd_warshall
# from decimal import Decimal
# from collections import defaultdict, deque
# 再帰の制限設定
sys.setrecursionlimit(10000000)
def ii(): return int(sys.stdin.buffer.readline().rstrip())
def il(): return list(map(int, sys.stdin.buffer.readline().split()))
def fl(): return list(map(float, sys.stdin.buffer.readline().split()))
def iln(n): return [int(sys.stdin.buffer.readline().rstrip())
for _ in range(n)]
def iss(): return sys.stdin.buffer.readline().decode().rstrip()
def sl(): return list(map(str, sys.stdin.buffer.readline().decode().split()))
def isn(n): return [sys.stdin.buffer.readline().decode().rstrip()
for _ in range(n)]
def lcm(x, y): return (x * y) // math.gcd(x, y)
# MOD = 10 ** 9 + 7
MOD = 998244353
INF = float('inf')
def main():
if os.getenv("LOCAL"):
sys.stdin = open("input.txt", "r")
N, K = il()
D = [il() for _ in range(K)]
dp = [0] * (N)
dp[0] = 1
acc = 0
for i in range(1, N):
for l, r in D:
if i - l >= 0:
acc += dp[i-l]
acc %= MOD
if i - r - 1 >= 0:
acc -= dp[i-r-1]
acc %= MOD
dp[i] = acc
print(dp[-1])
if __name__ == '__main__':
main()
| 0 | null | 1,394,981,790,752 | 18 | 74 |
from __future__ import division, print_function
from sys import stdin
n = int(stdin.readline())
result = [0, 0]
for _ in range(n):
taro, hanako = stdin.readline().split()
if taro > hanako:
result[0] += 3
elif taro < hanako:
result[1] += 3
else:
result[0] += 1
result[1] += 1
print(*result)
|
tscore = hscore = 0
n = int( input( ) )
for i in range( n ):
tcard, hcard = input( ).split( " " )
if tcard < hcard:
hscore += 3
elif hcard < tcard:
tscore += 3
else:
hscore += 1
tscore += 1
print( "{:d} {:d}".format( tscore, hscore ) )
| 1 | 1,969,854,583,158 | null | 67 | 67 |
h,a = [int(x) for x in input().split()]
print((h+a-1)//a)
|
n=int(input())
print('Yes' if n>=30 else 'No')
| 0 | null | 41,193,138,796,986 | 225 | 95 |
#155_A
a, b, c = map(int, input().split())
if a==b and a!=c and b!=c:
print('Yes')
elif a==c and a!=b and c!=b:
print('Yes')
elif b==c and b!=a and c!=a:
print('Yes')
else:
print('No')
|
s = input().split()
if s[0]==s[1] and s[0]!=s[2]:
print("Yes")
elif s[0]==s[2] and s[0]!=s[1]:
print("Yes")
elif s[2]==s[1] and s[0]!=s[2]:
print("Yes")
else:
print("No")
| 1 | 67,917,461,552,902 | null | 216 | 216 |
str = raw_input()
q = input()
for ans in range(q):
ans = raw_input()
ans1 = ans.split(' ')
if ans1[0] == 'replace':
str = str[0:int(ans1[1])]+ans1[3]+ str[int(ans1[2])+1:len(str)]
if ans1[0] == 'reverse':
str = str[0:int(ans1[1])]+ str[int(ans1[1]):int(ans1[2])+1][::-1] + str[int(ans1[2])+1:len(str)]
if ans1[0] == 'print':
print str[int(ans1[1]):int(ans1[2])+1]
|
n,k,*a = map(int,open(0).read().split())
def func(b):
c = k
for i in a:
c -= (i-1)//b
if c < 0:
return False
return True
l = 1
r = max(a)
while(r>l):
lr = (l+r)//2
if func(lr):
r = lr
else:
l = lr + 1
print(r)
| 0 | null | 4,319,779,963,532 | 68 | 99 |
s = input()[::-1]
cnts = [0] * 2019
cnts[0] = 1
n, d = 0, 1
for char in s:
n = (n + int(char) * d) % 2019
d = d * 10 % 2019
cnts[n] += 1
ans = 0
for cnt in cnts:
ans += cnt * (cnt - 1) // 2
print(ans)
|
def prime_factorize(n):
a = []
while n % 2 == 0:
a.append(2)
n //= 2
f = 3
while f * f <= n:
if n % f == 0:
a.append(f)
n //= f
else:
f += 2
if n != 1:
a.append(n)
return a
dum = prime_factorize(int(input()))
dum_len = len(dum)
num = 0
ans = 0
cnt = 0
check = 0
for i in range(dum_len):
if num == dum[i]:
cnt += 1
if cnt >= check:
check += 1
ans += 1
cnt = 0
else:
num = dum[i]
ans += 1
cnt = 0
check = 2
print(ans)
| 0 | null | 23,889,105,842,280 | 166 | 136 |
# Python3 implementation of the approach
# Function to find the number of divisors
# of all numbers in the range [1,n]
def findDivisors(n):
# List to store the count
# of divisors
div = [0 for i in range(n + 1)]
# For every number from 1 to n
for i in range(1, n + 1):
# Increase divisors count for
# every number divisible by i
for j in range(1, n + 1):
if j * i <= n:
div[i * j] += 1
else:
break
# Print the divisors
return div
# Driver Code
if __name__ == "__main__":
n = int(input())
print(sum(findDivisors(n-1)))
# This code is contributed by
# Vivek Kumar Singh
|
def get_sieve_of_eratosthenes(n):
if not isinstance(n, int):
raise TypeError("n is int-type.")
if n < 2:
raise ValueError("n is more than 2")
data = [i for i in range(2, n + 1)]
for d in data:
data = [x for x in data if (x == d or x % d != 0)]
return data
p_list = get_sieve_of_eratosthenes(10**3)
def factorization_counta(n):
arr = []
temp = n
for i in p_list:
if i * i > n:
break
elif temp % i == 0:
cnt = 0
while temp % i == 0:
cnt += 1
temp //= i
arr.append(cnt)
if temp != 1:
arr.append(1)
if arr == []:
arr.append(1)
return arr
def main():
N = int(input())
ans = 1
for c in range(2, N):
p = factorization_counta(c)
tmp = 1
for v in p:
tmp *= (v + 1)
ans += tmp
return ans
if __name__ == '__main__':
print(main())
| 1 | 2,620,921,971,302 | null | 73 | 73 |
a,b,c,d=map(float,input().split())
r=((c-a)**2+(d-b)**2)**(1/2)
print(f'{r:5f}')
|
import math
x1,y1,x2,y2 = map(float,input().split())
ans = math.sqrt((x2-x1)**2+(y2-y1)**2)
print(round(ans,8))
| 1 | 156,209,636,230 | null | 29 | 29 |
#!/usr/bin/env python3
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
def main():
r = int(input())
print(r**2)
if __name__ == '__main__':
main()
|
def main():
r = int(input())
print(r**2)
if __name__ == "__main__":
main()
| 1 | 145,222,453,011,382 | null | 278 | 278 |
N = [x for x in input().split(' ')]
#データを格納するための整数型1次元配列
stack = []
for i in N:
# +が入っていた場合
if i == '+':
num1 = stack.pop()
num2 = stack.pop()
stack.append(num1 + num2)
# -が入っていた場合
elif i == '-':
num2 = stack.pop()
num1 = stack.pop()
stack.append(num1 - num2)
# *が入っていた場合
elif i == '*':
num1 = stack.pop()
num2 = stack.pop()
stack.append(num1 * num2)
#算術演算子( + - *)以外が入っていた場合
else:
stack.append(int(i))
#表示
print(stack.pop())
|
import re
def revPolish(f):
f = re.sub(r'(\-?\d+\.?\d*)\s(\-?\d+\.?\d*)\s([\+\-\*/])(?!\d)',
lambda m: str(eval(m.group(1) + m.group(3) + m.group(2))),
f)
if f[-1] in ('+','-','*','/'):
return revPolish(f)
else:
return f
if __name__=='__main__':
print(revPolish(input()))
| 1 | 36,862,259,292 | null | 18 | 18 |
import sys
INF = 1 << 60
MOD = 10**9 + 7 # 998244353
sys.setrecursionlimit(2147483647)
input = lambda:sys.stdin.readline().rstrip()
from collections import Counter
def resolve():
n = int(input())
sieve = list(range(n + 1))
primes = []
for i in range(2, n + 1):
if sieve[i] == i:
primes.append(i)
for p in primes:
if p * i > n or sieve[i] < p:
break
sieve[p * i] = p
ans = 0
for i in range(1, n):
C = Counter()
while i > 1:
C[sieve[i]] += 1
i //= sieve[i]
score = 1
for val in C.values():
score *= val + 1
ans += score
print(ans)
resolve()
|
twoNumbers=list(map(int,input().split()))
x=twoNumbers[0]
y=twoNumbers[1]
devidedBy=[]
syou=[]
if x>=y:
for number in range(1, y+1):
if y%number==0:
if number>y//number:
break
else:
if not number in devidedBy:
devidedBy.append(number)
if not y//number in syou:
syou.append(y//number)
else:
for number in range(1, x+1):
if x%number==0:
if number>x//number:
break
else:
if not number in devidedBy:
devidedBy.append(number)
if not x//number in syou:
syou.append(x//number)
if devidedBy[len(devidedBy)-1]==syou[len(syou)-1]:
del devidedBy[len(devidedBy)-1]
devidedBy.extend(syou)
devidedBy.sort()
index=len(devidedBy)-1
while index>=0:
if x>=y:
if x%devidedBy[index]==0:
print(devidedBy[index])
break
else:
index-=1
else:
if y%devidedBy[index]==0:
print(devidedBy[index])
break
else:
index-=1
| 0 | null | 1,295,139,505,920 | 73 | 11 |
def solve(Mi,i):
if Mi == 0: return True
if i < n and min(A[i:]) <= Mi <= sum(A[i:]):
r1 = solve(Mi-A[i],i+1)
if r1: return r1
r2 = solve(Mi,i+1)
if r2: return r2
n = input()
A = map(int,raw_input().split())
q = input()
M = map(int,raw_input().split())
for Mi in M:
print "yes" if solve(Mi,0) else "no"
|
import itertools as it
n=int(input())
A=input().split()
q=int(input())
M=input().split()
ans=[]
cnt=0
A=list(map(int,A))
M=list(map(int,M))
for i in range(len(A)):
Ac=list(it.combinations(A,i+1))
for j in Ac:
ans.append(sum(j))
for i in M:
flag=0
for j in ans:
if i==j:
print("yes")
flag=1
break
if flag==0:
print("no")
| 1 | 101,500,784,448 | null | 25 | 25 |
from math import factorial
from itertools import permutations
n = int(input())
t,*c = [list(map(int, input().split())) for _ in range(n)]
print(sum(sum(((x-v)**2+(y-w)**2)**.5 for (x, y), (v, w) in zip([t]+l, l+[t])) for l in map(list,permutations(c)))*(n-1)/factorial(n))
|
import itertools
N = int(input())
x = []
y = []
for i in range(N):
xy = list(map(int, input().split()))
x.append(xy[0])
y.append(xy[1])
l = [i for i in range(N)]
ans = 0
cnt = 0
for i in itertools.permutations(l, N):
cnt += 1
for j in range(1, N):
x1 = x[i[j]]
x2 = x[i[j-1]]
y1 = y[i[j]]
y2 = y[i[j-1]]
ans += pow((x1 - x2)**2 + (y1 - y2)**2, 0.5)
# print(i, j, x1, y1, x2, y2)
ans /= cnt
print(ans)
| 1 | 148,727,056,081,120 | null | 280 | 280 |
N = int(input())
P = tuple(map(int,input().split()))
Q = tuple(map(int,input().split()))
import itertools
nums = list(itertools.permutations(range(1,N+1)))
print(abs(nums.index(P)-nums.index(Q)))
|
import itertools
n = int(input())
s = ""
for i in range(n):
s += str(i+1)
l = list(itertools.permutations(s, n))
p = tuple(input().split())
q = tuple(input().split())
a = l.index(p)
b = l.index(q)
print(abs(a-b))
| 1 | 100,548,940,538,760 | null | 246 | 246 |
n,d=map(int,input().split())
print(sum(eval("(("+input().replace(" ",")**2+(")+")**2)")**0.5<=d for _ in range(n)))
|
a, b = input().split()
print(['No','Yes'][a==b])
| 0 | null | 44,378,188,954,088 | 96 | 231 |
from collections import deque
from sys import stdin
input = stdin.readline
def main():
N, M = list(map(int, input().split()))
G = [[] for _ in range(N+1)]
for i in range(M):
a, b = map(int, input().split())
G[a].append(b)
G[b].append(a)
from_ = [0]*(N+1)
q = deque([1])
seen = set()
seen.add(1)
while len(q):
now = q.popleft()
for next_ in G[now]:
if next_ not in seen:
seen.add(next_)
q.append(next_)
from_[next_] = now
print('Yes')
for i in range(2, N+1):
print(from_[i])
if(__name__ == '__main__'):
main()
|
def main():
n, m = (int(i) for i in input().split())
graph = { i: [] for i in range(1, n+1) }
for i in range(m):
src, dst = (int(i) for i in input().split())
graph[src].append(dst)
graph[dst].append(src)
def bfs():
st = [1]
pptr = { 1: 0 }
while st:
room = st.pop(0)
for dest_room in graph[room]:
if dest_room in pptr:
continue
st.append(dest_room)
pptr[dest_room] = room
return pptr
pptr = bfs()
if len(pptr) != n:
print('No')
else:
print('Yes')
for i in sorted(pptr.keys()):
if i == 1:
continue
print(pptr[i])
main()
| 1 | 20,704,787,727,988 | null | 145 | 145 |
n = int(input())
list_ = []
for _ in range(n):
x, l = map(int, input().split())
list_.append([x-l, x+l])
list_.sort(key=lambda x: x[1])
res = n
pos = -float('inf')
for l, r in list_:
if l < pos:
res -= 1
else:
pos = r
print(res)
|
n = int(input())
lst = []
for i in range(n):
x, l = map(int, input().split())
lst.append((x + l, x - l))
sorted_lst = sorted(lst)
num = 0
ans = n
while True:
tmp = sorted_lst[num][0]
for i in range(num + 1, n):
if tmp > sorted_lst[i][1]:
ans -= 1
else:
num = i
break
if i == n - 1:
num = i
break
if num == n - 1:
break
print(ans)
| 1 | 89,606,575,354,308 | null | 237 | 237 |
a,b = [int(n) for n in input().split()]
if a == b:
print("a == b")
elif a > b:
print("a > b")
else:
print("a < b")
|
[a,b] = input().split()
a = int(a)
b= int(b)
if(a == b):
print('a == b')
elif(a > b):
print("a > b")
else:
print("a < b")
| 1 | 359,981,563,740 | null | 38 | 38 |
from sys import stdin
n,m = [int(x) for x in stdin.readline().rstrip().split()]
if n == m:
print("Yes")
else:
print("No")
|
import sys
input = sys.stdin.readline
N,M=list(map(int,input().split()))
print('Yes' if N == M else 'No')
| 1 | 83,542,175,155,868 | null | 231 | 231 |
count = 0
while True:
count+=1
a = int(input())
if a == 0:
break
print("Case %d: %d" % (count, a))
|
#! /usr/bin/env python
# -*- coding: utf-8 -*-
x_list = []
while True:
x = int(raw_input())
if x == 0:
break
else:
x_list.append(x)
for i, x in enumerate(x_list, 1):
print("Case %d: %d") % (i, x)
| 1 | 481,906,166,930 | null | 42 | 42 |
import itertools
N = int(input())
cities = [list(map(int, input().split())) for _ in range(N)]
patterns = itertools.permutations(cities, N)
result = 0
count = 0
for ptn in patterns:
count += 1
dis = 0
for i in range(N-1):
dis += ((ptn[i][0]-ptn[i+1][0])**2 + (ptn[i][1]-ptn[i+1][1])**2)**0.5
result += dis
print(result/count)
|
#!/usr/bin/env python3
import sys
import itertools
import math
def input():
return sys.stdin.readline()[:-1]
def main():
N = int(input())
x = [0] * N
y = [0] * N
for i in range(N):
x[i], y[i] = map(int, input().split())
l = [i for i in range(N)]
p = [i for i in itertools.permutations(l, N)]
d = 0
for i in range(len(p)):
t = p[i]
for j in range(N - 1):
d += math.sqrt(((x[t[j]] - x[t[j + 1]]) ** 2) + ((y[t[j]] - y
[t[j + 1]])) ** 2)
ans = d / math.factorial(N)
print(ans)
if __name__ == '__main__':
main()
| 1 | 148,430,951,987,280 | null | 280 | 280 |
import sys
from sys import stdin
input = stdin.readline
cnt = 0
INF = 10000000000
def merge(A, left, mid, right):
global cnt
L = A[left:mid] + [INF]
R = A[mid:right] + [INF]
i = 0
j = 0
for k in range(left , right):
if L[i] <= R[j]:
A[k] = L[i]
i = i + 1
cnt += 1
else:
A[k] = R[j]
j = j + 1
cnt += 1
def mergeSort(A, left, right):
if left+1 < right:
mid = (left + right)//2
mergeSort(A, left, mid)
mergeSort(A, mid, right)
merge(A, left, mid, right)
n = int(input())
A =[int(x) for x in input().split()]
mergeSort(A, 0, n)
print(*A)
print(cnt)
|
A,B,H,M = map(int, input().split())
m = M/60*360
h = H/12*360+M/60*30
kakudo = (h-m)%360
import math
cos = math.cos(math.radians(kakudo))
print(math.sqrt(A*A+B*B-2*A*B*cos))
| 0 | null | 10,149,983,184,358 | 26 | 144 |
import math
A, B, N = map(int, input().split())
n = min(N, B-1)
print(math.floor(A * n / B))
|
x = int(input())
x = (x + 1) % 2
print(x)
| 0 | null | 15,612,814,445,748 | 161 | 76 |
import sys
def input(): return sys.stdin.readline().strip()
mod = 998244353
def main():
"""
各トークンを(最下点、最終的な高さ)に分けるのはできた。
そしてそれらを最下点位置が浅い順に並べるのも悪くはなかった、増加パートに関しては。
減少パートは減少度合が小さい順に付け加えたとしても高さが負に潜り込むケースがある。
（例）高さ3から下るとして、(-1, -1), (-2, 0), (-3, -2)が各トークンとすると
この順にくっつけると(-3, -2)を加えるときにアウトだが、
(-2, 0), (-3, -2), (-1, -1)の順だったらOK
なので下る場合には増加パートとは違う方法でくっつけないといけない。
結論としては、これは左右反転させれば増加していることになるので、右からくっつけるようにすればいい。
"""
N = int(input())
S_up = []
S_down = []
for _ in range(N):
s = input()
max_depth = 0
height = 0
for c in s:
if c == '(':
height += 1
else:
height -= 1
max_depth = min(max_depth, height)
if height > 0: S_up.append((max_depth, height - max_depth))
else: S_down.append((-(height - max_depth), -max_depth))
S_up.sort(key=lambda x: (x[0], x[1]))
S_down.sort(key=lambda x: (x[0], x[1]))
height_left = 0
while S_up:
d, h = S_up.pop()
#print("({}, {})".format(d, h))
if height_left + d < 0:
print("No")
return
height_left += d+h
height_right = 0
while S_down:
d, h = S_down.pop()
#print("({}, {})".format(d, h))
if height_right + d < 0:
print("No")
return
height_right += d+h
if height_left != height_right: print("No")
else: print("Yes")
if __name__ == "__main__":
main()
|
N, K = map(int, input().split())
A = list(map(int, input().split()))
MOD = 10 ** 9 + 7
neg_a = sorted([a for a in A if a < 0], reverse=True)
pos_a = sorted([a for a in A if a >= 0])
ans = 1
if len(pos_a) == 0 and K % 2 == 1:
for a in neg_a[:K]:
ans = ans * a % MOD
print(ans)
exit()
while K > 0:
if K == 1 or len(neg_a) <= 1:
if len(pos_a) == 0:
ans *= neg_a.pop()
elif len(pos_a) > 0:
ans *= pos_a.pop()
K -= 1
elif len(pos_a) <= 1:
ans *= neg_a.pop() * neg_a.pop()
K -= 2
elif pos_a[-1] * pos_a[-2] > neg_a[-1] * neg_a[-2]:
ans *= pos_a.pop()
K -= 1
else:
ans *= neg_a.pop() * neg_a.pop()
K -= 2
ans %= MOD
print(ans)
| 0 | null | 16,683,352,402,498 | 152 | 112 |
#!/usr/bin/python3
import copy
def minOp(h, w, k, yl, s):
xl = []
ks = [ 0 for i in range(len(yl) + 1) ]
for x in range(w):
py = 0
cks = [ 0 for i in range(len(yl) + 1) ]
for idx, y in enumerate(yl + [h - 1]):
for yy in range(py, y + 1):
if s[yy][x] == '1':
cks[idx] += 1
py = y + 1
over = False
for idx, kk in enumerate(ks):
if kk + cks[idx] > k:
over = True
if over:
for ck in cks:
if ck > k:
return (h - 1) + (w - 1)
xl.append(x - 1)
ks = copy.copy(cks)
else:
ks = list(map(lambda a, b: a + b, ks, cks))
return len(xl) + len(yl)
def devideVertical(h, w, k, cy, yl, s):
m = (h - 1) + (w - 1)
for y in range(cy, h - 1):
nyl = copy.copy(yl)
nyl.append(y)
m = min(m, devideVertical(h, w, k, y + 1, nyl, s))
m = min(m, minOp(h, w, k, yl, s))
return m
(h, w, k) = map(int, input().split())
s = []
for i in range(h):
s.append(input())
print(devideVertical(h, w, k, 0, [], s))
|
s = input()
for _ in range(int(input())):
o = input().split()
a, b = map(int, o[1:3])
b += 1
c = o[0][2]
if c == 'p':
s = s[:a]+o[3]+s[b:]
elif c == 'i':
print(s[a:b])
elif c == 'v':
s = s[:a]+s[a:b][::-1]+s[b:]
| 0 | null | 25,134,452,297,018 | 193 | 68 |
num = int(input())
i = 1
while i <= 9:
j = 1
while j <= 9:
if (i * j) / num == 1:
print("Yes")
exit()
else:
j += 1
i += 1
print("No")
|
n = input()
A = list(map(int, input().split()))
ans = 1
for a in A:
ans *= a
ans = min(ans, 10**18+1)
if ans == 10**18+1:
ans = -1
print(ans)
| 0 | null | 87,654,158,644,000 | 287 | 134 |
H,N = map(int,input().split())
a = list(map(int,input().split()))
a.sort()
reversed(a)
flag = True
for i in range(N):
H-=a[i]
if H<=0:
flag = False
print('Yes')
break
if flag == True:
print('No')
|
# Problem B - Common Raccoon vs Monster
# input
H, N = map(int, input().split())
a_nums = list(map(int, input().split()))
# initialization
a_sum = sum(a_nums)
# output
if a_sum>=H:
print("Yes")
else:
print("No")
| 1 | 78,120,214,675,558 | null | 226 | 226 |
N = int(input())
a = list(map(int,input().split()))
if not(1 in a):
print(-1)
exit(0)
cnt = 0
for i in a:
if i == cnt + 1:
cnt += 1
print(N-cnt)
|
N=int(input())
lst=list(map(int,input().split(" ")))
now=0
for i in range(N):
if lst[i]==now+1:
now+=1
if now == 0:
print(-1)
else:
print(N-now)
| 1 | 114,716,940,927,860 | null | 257 | 257 |
a,b=map(int,input().split());print([0,a-b*2][a-b*2>0])
|
from itertools import combinations
n = int(input())
a = list(map(int, input().split()))
q = int(input())
m = map(int, input().split())
s = set()
for i in range(1, n):
for j in combinations(a, i):
s.add(sum(j))
for ans in m:
print('yes' if ans in s else 'no')
| 0 | null | 83,235,458,524,350 | 291 | 25 |
import sys
lines = [s.rstrip("\n") for s in sys.stdin.readlines()]
n = int(lines.pop(0))
s = lines.pop(0)
count = 0
prev_c = None
for c in s:
if c != prev_c:
count += 1
prev_c = c
print(count)
|
rst = []
N = int(input())
S = input()
tmp_val = ''
for i in S:
if tmp_val != i:
rst.append(i)
tmp_val = i
print(len(rst))
| 1 | 169,956,419,011,612 | null | 293 | 293 |
import itertools
n = int(input())
def make_divisors(n):
lower_divisors , upper_divisors = [], []
i = 1
while i*i <= n:
if n % i == 0:
lower_divisors.append(i)
if i != n // i:
upper_divisors.append(n//i)
i += 1
return lower_divisors + upper_divisors[::-1]
div_list = make_divisors(n)
#print(div_list)
mn =2**50
for i in div_list:
mn = min(mn,i+n//i)
print(mn-2)
|
x = int(input())
for i in range(1,1500):
for j in range(-1000,1000):
y = i**5 - j**5
if x == y:
print(i,j)
exit()
| 0 | null | 93,243,729,403,328 | 288 | 156 |
s = "#."
while True:
H,W= map(int, input().split())
if H==0 and W==0:
break
elif W%2==0 :
w1=s*(W//2)
w2="."+s*(W//2-1)+"#"
elif W%2==1:
w1=s*((W-1)//2)+"#"
w2="."+s*((W-1)//2)
for i in range(H):
if i%2==0:
print(w1)
elif i%2==1:
print(w2)
print("")
|
def rect(h, w):
a = '#.' * 150
b = '.#' * 150
while h > 0:
print(a[:w])
a, b = b, a
h -= 1
print()
return
while True:
n = list(map(int, input().split()))
H = n[0]
W = n[1]
if (H == 0 and W == 0):
break
rect(H, W)
| 1 | 876,187,672,008 | null | 51 | 51 |
from sys import exit
n, m = map(int, input().split())
s = input()
one_sequence = 0
for i in range(1, n):
if s[i] == "1":
one_sequence += 1
if one_sequence == m:
print(-1)
exit()
else:
one_sequence = 0
pos = n
ans = ""
while pos != 0:
for i in range(1, m+1)[::-1]:
if pos-i < 0:
continue
if s[pos-i] != "1":
ans = str(i) + " " + ans
pos -= i
break
print(ans)
|
data = list(map(int, list(input().split())))
row = data[0]
column = data[1]
matrix = [[0 for i in range(column)] for j in range(row)]
vector = [[0] for k in range(column)]
vector_multi = [[0] for l in range(row)]
for i in range(row):
data_row = list(map(int, list(input().split())))
for j in range(column):
matrix[i][j] = data_row[j]
for i in range(column):
vector[i] = int(input())
for i in range(row):
element = 0
for j in range(column):
element += matrix[i][j] * vector[j]
vector_multi[i][0] = element
for i in vector_multi:
print(i[0])
| 0 | null | 70,428,403,543,538 | 274 | 56 |
from collections import Counter
s=input()
n=len(s)
M=[0]
mod=2019
for i in range(n):
m=(M[-1]+int(s[n-1-i])%mod*pow(10,i,mod))%mod
M.append(m)
MC=Counter(M)
r=0
for v in MC.values():
if v>1:
r+=v*(v-1)//2
print(r)
|
s = int(input())
for x in range(s):
r = sorted(list(map(int, input().split())))
if r[2] ** 2 == r[0] ** 2 + r[1] ** 2:
print('YES')
else:
print('NO')
| 0 | null | 15,290,130,618,482 | 166 | 4 |
import math
x = int(input())
# -100 ~ 100 ^ 5
pow5 = {}
for i in range(-1000, 1001):
pow5[i] = int(math.pow(i, 5))
for i in range(-1000, 1001):
a = x + pow5[i]
for j in range(-1000, 1001):
if a == pow5[j]:
print(j, i)
exit()
|
import sys
input=sys.stdin.buffer.readline
#sys.setrecursionlimit(10**9)
#from functools import lru_cache
def RD(): return sys.stdin.read()
def II(): return int(input())
def MI(): return map(int,input().split())
def MF(): return map(float,input().split())
def LI(): return list(map(int,input().split()))
def LF(): return list(map(float,input().split()))
def TI(): return tuple(map(int,input().split()))
# rstrip().decode('utf-8')
import numpy as np
def main():
x=II()
for i in range(-300,300):
for j in range(-300,300):
if i**5==x+j**5:
print(i,j)
exit()
if __name__=="__main__":
main()
| 1 | 25,470,123,288,590 | null | 156 | 156 |
N = int(input())
def calc(n):
ans = [0 for i in range(n+1)]
for x in range(1,n+1):
a = x**2
if a>=n:
break
for y in range(1,1+n):
b = y**2
if b>=n:
break
for z in range(1,1+n):
c = z**2
if c>=n:
break
f = a+b+c+x*y+y*z+z*x
if f>n:
break
ans[f]+=1
return ans
res = calc(N)
for i in range(N):
print(res[i+1])
|
N = int(input())
myans = [ 0 for n in range(N+1)]
upper = int(N**(2/3))
#print(upper)
for x in range(1, 105):
for y in range(1, 105):
for z in range(1, 105):
v = x**2 + y**2 + z**2 + x*y + y*z + z*x
if v < N+1:
myans[v] += 1
#print(myans)
for a,b in enumerate(myans):
if a != 0:
print(b)
| 1 | 7,993,371,044,308 | null | 106 | 106 |
def solve(n):
arr = [i for i in range(1, n+1) if i % 3 != 0 and i % 5 != 0]
print(sum(arr))
if __name__ == "__main__":
n = int(input())
solve(n)
|
def insertionSort(A, n, g):
cnt = 0
for i in xrange(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
return cnt
def shellSort(A, n):
# variables
cnt, m, t = 0, 1, n
# getting m
while (t-1)/3 > 0:
t, m = (t-1)/3, m+1
print m
# creating and printing G
G = [1]
for i in xrange(1,m):
G.append(1+G[i-1]*3)
G = list(reversed(G))
print " ".join( map(str, G) )
# sorting
for i in xrange(0, m):
cnt += insertionSort(A, n, G[i])
return cnt
# MAIN
n = input()
A = [input() for i in xrange(n)]
cnt = shellSort(A, n)
print cnt
for i in xrange(n):
print A[i]
| 0 | null | 17,396,192,099,648 | 173 | 17 |
from math import pi as pi
N=int(input().rstrip())
print(float(2.00*pi*N))
|
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 | 18,267,380,929,450 | 167 | 92 |
pi = 3.14159265358979
r = float(raw_input())
print '%.6f %.6f'%(pi*r*r, 2*pi*r)
|
r=input();p=3.141592653589793;print "%.9f"%(p*r*r),r*2*p
| 1 | 631,684,336,260 | null | 46 | 46 |
N,M,Q=map(int,input().split())
Query=[list(map(int,input().split())) for i in range(Q)]
import itertools
ans=0
for x in itertools.combinations_with_replacement(range(1, M+1), N):
l=0
for i in range(Q):
a,b,c,d=map(int,Query[i])
if x[b-1]-x[a-1]==c:
l+=d
ans=max(ans,l)
print(ans)
|
import sys
def input(): return sys.stdin.readline().rstrip()
def main():
x,y,a,b,c=map(int, input().split())
p=list(map(int, input().split()))
q=list(map(int, input().split()))
r=list(map(int, input().split()))
p.sort(reverse=True)
q.sort(reverse=True)
r.sort(reverse=True)
p=[10**10]+p[:x]
q=[10**10]+q[:y]
r+=[0]*(a+b)
ans=sum(p)+sum(q)-2*10**10
pcnt,qcnt=0,0
for i in range(x+y):
if p[-1-pcnt] >= r[i] and q[-1-qcnt] >= r[i]:
break
elif p[-1-pcnt] > q[-1-qcnt]:
ans += -q[-1-qcnt] + r[i]
qcnt +=1
else:
ans += -p[-1-pcnt] + r[i]
pcnt +=1
print(ans)
if __name__ == '__main__':
main()
| 0 | null | 36,363,430,096,604 | 160 | 188 |
N = int(input())
S = list(input())
S.append("test")
i = 0
while N > 0:
if S[i] == S[i+1]:
S.pop(i)
i = i - 1
i = i + 1
N = N - 1
print(len(S)-1)
|
s_max = -float('inf')
s = 0
for i in range(int(input())):
r = int(input())
if i:
s = max(s, 0) + r - prev
s_max = max(s, s_max)
prev = r
print(s_max)
| 0 | null | 85,017,034,403,880 | 293 | 13 |
def rev(val, v1, v2):
for i in range((v2-v1)//2 +1):
val[v1+i], val[v2-i] = val[v2-i], val[v1+i]
return val
def rep(val1, val2, v1, v2):
for i in range(v2-v1):
val1[v1+i] = val2[i]
return val1
st = input()
lst = [i for i in st]
q = int(input())
for i in range(q):
f = list(map(str, input().split()))
if f[0] == 'print':
s = ''.join(lst[int(f[1]):int(f[2])+1])
print(s)
elif f[0] == 'reverse':
lst = rev(lst, int(f[1]), int(f[2]))
elif f[0] == 'replace':
x = [i for i in f[3]]
lst = rep(lst, x, int(f[1]), int(f[2])+1)
|
from typing import List
def count_loadable_baggage_num(baggage_num: int, truck_num: int, baggages: List[int], truck_capacity: int) -> int:
loaded_baggage_num: int = 0
for _ in range(truck_num):
current_weight: int = 0
while current_weight + baggages[loaded_baggage_num] <= truck_capacity:
current_weight += baggages[loaded_baggage_num]
loaded_baggage_num += 1
if loaded_baggage_num == baggage_num:
return baggage_num
return loaded_baggage_num
def calc_turck_min_capacity(baggage_num: int, truck_num: int, baggages: List[int]) -> int:
ng: int = max(baggages) - 1
ok: int = sum(baggages) + 1
while ok - ng > 1:
mid = (ng + ok) // 2
loadable_baggage_num = count_loadable_baggage_num(baggage_num, truck_num, baggages, mid)
if loadable_baggage_num >= baggage_num:
ok = mid
else:
ng = mid
return ok
def main():
n, k = map(int, input().split())
w: List[int] = []
for _ in range(n):
w.append(int(input()))
P = calc_turck_min_capacity(n, k, w)
print(P)
if __name__ == "__main__":
main()
| 0 | null | 1,096,181,214,790 | 68 | 24 |
n = int(input())
ans = 0
for i in range(1,n+1):
if (i % 3 == 0) or (i % 5 == 0):
pass
else:
ans += i
print(ans)
|
def scoring(d, t, k=10):
arr = [l for l in last]
arr[t] = d
penalty = sum((d - l) * c for l, c in zip(arr, C))
score = S[d][t] - penalty
score -= (min(D, d + k) - d - 1) * penalty
return score
D = int(input())
C = list(map(int, input().split()))
S = []
for _ in range(D):
s = list(map(int, input().split()))
S.append(s)
last = [-1] * 26
ans = []
for i in range(D):
res = -10 ** 6
idx = -1
for j in range(26):
tmp = scoring(i, j)
if tmp > res:
res = tmp
idx = j
last[idx] = i
ans.append(idx+1)
print(*ans, sep='\n')
| 0 | null | 22,395,271,739,906 | 173 | 113 |
n = int(input())
d = {'AC': 0, 'WA': 0, 'TLE': 0, 'RE': 0}
for i in range(n):
st = input()
d[st] += 1
for k, v in d.items():
print(k, 'x', v)
|
for i in range(int(input())):
a = sorted(map(int,input().split()),reverse = True)
if a[0]**2 == a[1]**2 + a[2]**2:
print("YES")
else:
print("NO")
| 0 | null | 4,292,799,388,548 | 109 | 4 |
def solve(n):
arr = [i for i in range(1, n+1) if i % 3 != 0 and i % 5 != 0]
print(sum(arr))
if __name__ == "__main__":
n = int(input())
solve(n)
|
S = int(input())
sum_all = 0
sum_fizzbuzz = 0
for i in range(1,S+1):
sum_all = sum_all + i
if i % 3 == 0 or i % 5 == 0 or i % 15 ==0:
sum_fizzbuzz = sum_fizzbuzz + i
#print(sum_all)
#print(sum_fizzbuzz)
print(sum_all - sum_fizzbuzz)
| 1 | 34,893,223,969,408 | null | 173 | 173 |
S = list(input())
print('YNeos'[S[2::2]!=S[3::2]::2])
|
R, C, K = map(int, input().split())
V = [[0]*(C+1) for _ in range(R+1)]
for _ in range(K):
r, c, v = map(int, input().split())
V[r][c] = v
max_p = [0]*(C+1)
for i in range(R+1):
now0, now1, now2, now3 = [[0]*(C+1) for _ in range(4)]
for j in range(C+1):
v = V[i][j]
la = lb = 0
if j > 0:
la = now0[j-1]
lb = now1[j-1]
now2[j] = max(now2[j], now2[j-1], lb + v)
now3[j] = max(now3[j], now3[j-1], now2[j-1] + v)
if i > 0:
now0[j] = max(now0[j], max_p[j], la)
now1[j] = max(now1[j], max_p[j] + v, la + v, lb)
max_p[j] = max(now0[j], now1[j], now2[j], now3[j])
print(max(now0[C], now1[C], now2[C], now3[C]))
| 0 | null | 23,677,786,012,572 | 184 | 94 |
N = int(input())
q, r = divmod(N, 2)
print((q + r) / N)
|
def main():
log_no, cut_max = [int(x) for x in input().split()]
logs = [int(x) for x in input().split()]
bin_l, bin_r = 0, 10 ** 9
while bin_r - bin_l > 1:
bin_mid = (bin_l + bin_r) // 2
cut_count = sum((log - 1) // bin_mid for log in logs)
if cut_count <= cut_max:
bin_r = bin_mid
else:
bin_l = bin_mid
print(bin_r)
if __name__ == '__main__':
main()
| 0 | null | 91,734,321,015,630 | 297 | 99 |
n = int(input())
l = [0 for i in range(n)]
r = [0 for i in range(n)]
dat = []
dat2 = []
st = -1
for i in range(n):
s = input()
for ch in s:
if ch == '(':
r[i] += 1
pass
else:
if r[i] > 0:
r[i] -= 1
else:
l[i] += 1
pass
# print(i, l[i], r[i])
if l[i] == 0:
if st == -1 or r[st] < r[i]:
st = i
if r[i] >= l[i]:
dat.append((l[i], i))
else:
dat2.append((r[i], i))
dat.sort()
dat2.sort(reverse=True)
if st == -1:
print("No")
exit()
now = r[st]
# print('now={}'.format(now))
for num, i in dat:
if i == st:
continue
if now < l[i]:
print("No")
exit()
now = now - l[i] + r[i]
for num, i in dat2:
# print('dat2', num, i)
if now < l[i]:
print("No")
exit()
now = now - l[i] + r[i]
if now == 0:
print("Yes")
else:
print("No")
|
def main():
N, M, Q = (int(i) for i in input().split())
T = [[int(i) for i in input().split()] for j in range(Q)]
def dfs(A):
if len(A) == N:
ret = 0
for (a, b, c, d) in T:
if A[b-1] - A[a-1] == c:
ret += d
return ret
ret = 0
s = A[-1] if A else 1
for a in range(s, M+1):
ret = max(ret, dfs(A + [a]))
return ret
print(dfs([]))
if __name__ == '__main__':
main()
| 0 | null | 25,639,503,336,062 | 152 | 160 |
n,k = map(int,input().split())
sec = []
for i in range(k):
l,r = map(int,input().split())
sec.append([l,r])
mod = 998244353
dp = [0]*(n+1)
dp[0],dp[1] = 0,1
cumsum = [0]*(n+1)
cumsum[1] = 1
for i in range(2,n+1):
for l,r in sec:
if i>l:
dp[i] += cumsum[i-l]-cumsum[max(0,i-r-1)]
cumsum[i] = (dp[i]+cumsum[i-1])%mod
print(dp[n]%mod)
|
import re
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
import functools
def v(): 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 ** 6)
mod = 10**9+7
cnt = 0
ans = 0
inf = float("inf")
al = "abcdefghijklmnopqrstuvwxyz"
AL = al.upper()
n, k=I()
h = l()
h.sort(reverse=True)
print(sum(h[k:]))
| 0 | null | 40,866,469,011,748 | 74 | 227 |
def resolve():
s = str(input())
ans = 0
if 'R' in s:
ans = 1
if 'RR' in s:
ans = 2
if 'RRR' in s:
ans = 3
print(ans)
resolve()
|
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees, log2, gcd
from itertools import accumulate, permutations, combinations, combinations_with_replacement, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left, insort, insort_left
from heapq import heappush, heappop
from functools import reduce, lru_cache
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def TUPLE(): return tuple(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = 10**6#float('inf')
mod = 10 ** 9 + 7
#mod = 998244353
from decimal import *
#import numpy as np
#decimal.getcontext().prec = 10
#階乗#
lim = 4*10**5 #必要そうな階乗の限界を入力
fact = [1] * (lim+1)
for n in range(1, lim+1):
fact[n] = n * fact[n-1] % mod
#階乗の逆元#
fact_inv = [1]*(lim+1)
fact_inv[lim] = pow(fact[lim], mod-2, mod)
for n in range(lim, 0, -1):
fact_inv[n-1] = n*fact_inv[n]%mod
def C(n, r):
return (fact[n]*fact_inv[r]%mod)*fact_inv[n-r]%mod
n, k = MAP()
if n-1 <= k:
print(C(2*n-1, n))
exit()
ans = 0
for i in range(k+1):
ans += C(n, i) * C(n-1, i) % mod
ans %= mod
print(ans)
| 0 | null | 35,916,448,400,924 | 90 | 215 |
list=[0 for i in range(10**4+1)]
for x in range(1,100):
for y in range(1,100):
for z in range(1,100):
var=x**2 +y**2 +z**2 +x*y +y*z +z*x
if var<=10**4:
list[var]+=1
n=int(input())
for i in range(1,n+1):
print(list[i])
|
N = int(input())
A = [0] * (N + 1)
for i in range(1, 102):
for j in range(1, 102):
for k in range(1, 102):
t = i ** 2 + j ** 2 + k ** 2 + i * j + j * k + i * k
if t <= N:
A[t] += 1
for n in range(1, N + 1):
print(A[n])
| 1 | 7,976,065,529,088 | null | 106 | 106 |
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])
|
import sys
from bisect import *
from heapq import *
from collections import *
from itertools import *
from functools import *
sys.setrecursionlimit(100000000)
def input(): return sys.stdin.readline().rstrip()
N, K, C = map(int, input().split())
S = input()
L = [None] * K
R = [None] * K
i = 0
for j in range(N):
if S[j] == 'o' and i < K and (i == 0 or j - L[i - 1] > C):
L[i] = j
i += 1
i = K - 1
for j in reversed(range(N)):
if S[j] == 'o' and i >= 0 and (i == K - 1 or R[i + 1] - j > C):
R[i] = j
i -= 1
for l, r in zip(L, R):
if l == r:
print(l + 1)
| 1 | 40,780,104,504,750 | null | 182 | 182 |
import sys
input = sys.stdin.readline
def main():
N = int( input())
U = []
V = []
for _ in range(N):
x, y = map( int, input().split())
u, v = x+y, x-y
U.append(u)
V.append(v)
U.sort()
V.sort()
print( max(U[-1]-U[0], V[-1]-V[0]))
if __name__ == '__main__':
main()
|
n, a, b = map(int, input().split())
ans = (n // (a+b)) * a
temp = n % (a+b)
if temp <= a:
ans += temp
else:
ans += a
print(ans)
| 0 | null | 29,456,714,187,600 | 80 | 202 |
while 1:
cards = raw_input()
if cards == "-":
break
m = int(raw_input())
for i in range(m):
h = int(raw_input())
for j in range(h):
cards += cards[0]
cards = cards[1:]
print(cards)
|
#9_2
def shuffle(letter,num):
for i in range(num):
memory=''
h=int(input())
bellow=letter[0:h]
above=letter[h:len(letter)]
memory=above+bellow
letter=memory
return letter
##main##
while(True):
letter=input()
if(letter in "-"):
break
else:
num=int(input())
letter=shuffle(letter,num)
print(letter)
| 1 | 1,912,584,385,272 | null | 66 | 66 |
n = int(input())
x = 1
print "",
while x <= n:
if x%3==0:
print str(x),
else:
t = x
while t:
if t%10==3:
print str(x),
t = 0
else:
t /= 10
x += 1
print
|
n, m, l = map(int, input().split())
A = []
B = []
C = [[] for i in range(n)]
for i in range(n):
tmp_row = list(map(int, input().split()))
A.append(tmp_row)
for i in range(m):
tmp_row = list(map(int, input().split()))
B.append(tmp_row)
for i in range(n):
for j in range(l):
ab = sum([A[i][k] * B[k][j] for k in range(m)])
C[i].append(ab)
for i in C:
print(" ".join(map(str, i)))
| 0 | null | 1,181,388,073,428 | 52 | 60 |
count, outrate = map(int, input().split())
if count >= 10:
result = outrate
print(result)
else:
result = outrate + 100 * (10 - count)
print(result)
|
N,R = map(int,input().split())
print(R + 100*(10-N)) if N < 10 else print(R)
| 1 | 63,749,225,237,950 | null | 211 | 211 |
a=[int(x) for x in input().split()]
print("{0} {1} {2:.5f}".format(a[0]//a[1],a[0]%a[1],a[0]/a[1]))
|
a,b = map(int,input().split())
x = int(a // b)
y = int(a - b*x)
z = a / b
print(x,y,f"{z:.5f}")
| 1 | 606,198,032,610 | null | 45 | 45 |
#coding:utf-8
buff = [int(x) for x in input().split()]
a = buff[0]
b = buff[1]
c = buff[2]
print(len([x for x in [x+a for x in range(b - a + 1)] if c%x==0]))
|
import numpy as np
def main():
n,s=map(int,input().split())
A=list(map(int,input().split()))
dp=np.array([0 for i in range(s+1)])
dp[0]=1
for ai in A:
tmp=dp[:-ai].copy()
#print(tmp)
dp*=2
dp[ai:]+=tmp
dp%=998244353
print(dp[s])
if __name__=="__main__":
main()
| 0 | null | 9,056,766,445,390 | 44 | 138 |
"""
方針：
幸福度が一定以上のつなぎ方の数→NlogNで二分探索可能
採用するうち最小の幸福度を NlogNlogNで探索
累積和を用いて合計を算出
2 3
5 2
10 + 7 + 7 = 24
"""
import bisect
def wantover(n): #n以上の幸福度のつなぎ方の数がM以上ならTrueを返す
ret = 0
for i in range(N):
serchnum = n - A[i]
ret += (N - bisect.bisect_left(A,serchnum))
#print ("over",n,"is",ret)
if ret >= M:
return True
else:
return False
N,M = map(int,input().split())
A = list(map(int,input().split()))
A.sort()
#print (wantover(7))
hpl = 0
hpr = A[-1] * 2 + 1
while hpr - hpl != 1:
mid = (hpr + hpl) // 2
if wantover(mid):
hpl = mid
else:
hpr = mid
#ここで最小の幸福度はhpl
#print (hpl,hpr)
B = [0] #累積和行列
for i in range(N):
B.append(B[-1] + A[-1 - i])
#print (A)
#print (B)
ans = 0
plnum = 0 #つないだ手の回数
for i in range(N):
i = N-i-1
ind = bisect.bisect_left(A,hpl - A[i])
#print (hpl,A[i],N-ind)
plnum += N - ind
ans += B[N - ind] + A[i] * (N-ind)
#print (ans,plnum)
print (ans - hpl * (plnum - M))
|
import bisect
import copy
def check(a, b, bar):
sm = 0
cnt = 0
n = len(a)
for x in a:
i = bisect.bisect_left(a, bar - x)
if i == n:
continue
cnt += n - i
sm += b[i] + x * (n-i)
return cnt, sm
n,m = map(int, input().split())
a = list(map(int, input().split()))
a.sort()
b = copy.deepcopy(a)
for i,_ in enumerate(b[:-1]):
b[n-i-2] += b[n-i-1]
left = 0
right = b[0] * 2
while right - left > 1:
middle = ( right + left ) // 2
if check(a, b, middle)[0] < m:
right = middle
else:
left = middle
print(check(a, b, left)[1] - left * (check(a, b, left)[0]-m) )
| 1 | 107,682,137,434,480 | null | 252 | 252 |
n = int(input())
l = [0]*53
for i in range(n):
a, b = input().split()
b = int(b)
if a == "H":
b += 13
elif a == "C":
b += 26
elif a == "D":
b += 39
l[b] = 1
for j in range(1,53):
if l[j] != 1:
ama = j % 13
syou = j // 13
if ama == 0:
ama = 13
syou -= 1
if syou == 0:
zi = "S"
elif syou == 1:
zi = "H"
elif syou == 2:
zi = "C"
else:
zi = "D"
print(zi, ama)
|
r=int(input())
print(r*6.28318530717958623200)
| 0 | null | 16,332,885,303,030 | 54 | 167 |
def resolve():
L = list(map(int, input().split()))
print("Yes" if len(L)-1 == len(set(L)) else "No")
if '__main__' == __name__:
resolve()
|
K = int(input())
S = input()
s = len(S)
base = 10 ** 9 + 7
L26 = [ 1 for i in range(K+1)] # 26^i mod base
for i in range(K):
L26[i+1] = (L26[i] * 26) % base
T1 = 1
T2 = 1
ans = 0
for i in range( s, s+K+1):
T3 = L26[K + s - i]
#T4 = pow(26, K + s - i, base)
#print(T3, T4)
p = (T1 * T2) % base
p = (p * T3) % base
ans += p
ans %= base
#print(ans, T1, T2, T3)
T1 *= 25
T1 %= base
# T2 = (T2 * i ) // (i+1-s) # T2 = (i, s-1) = (i-1, s-1) * i // (i+1-s)
T2 *= i
T2 %= base
T2 *= pow(i+1-s, base-2, base)
T2 %= base
print(ans % base)
| 0 | null | 40,493,604,903,000 | 216 | 124 |
n = int(input())
xy = []
for _ in range(n):
xy.append(list(map(int, input().split())))
tmp1 = []
tmp2 = []
for i in range(n):
tmp1.append([xy[i][0]+xy[i][1], xy[i][0], xy[i][1]])
tmp2.append([xy[i][0]-xy[i][1], xy[i][0], xy[i][1]])
tmp1.sort()
tmp2.sort()
ans = 0
if (tmp1[-1][2]-tmp1[0][2])*(tmp1[-1][1]-tmp1[0][1]) >= 0:
tmp = tmp1[-1][0]-tmp1[0][0]
ans = max(tmp, ans)
if (tmp2[-1][2]-tmp2[0][2])*(tmp2[-1][1]-tmp2[0][1]) <= 0:
tmp = tmp2[-1][0]-tmp2[0][0]
ans = max(tmp, ans)
print(ans)
|
import math
r = float(input())
print("{0:.6f} {1:.6f}".format(math.pi*r**2, 2*math.pi*r))
| 0 | null | 2,046,167,844,930 | 80 | 46 |
n, a, b = map(int, input().split())
ans = (n // (a+b)) * a
temp = n % (a+b)
if temp <= a:
ans += temp
else:
ans += a
print(ans)
|
n = input()
if n[-1]== "2" or n[-1]== "4" or n[-1]== "5" or n[-1]== "7" or n[-1]== "9":
print("hon")
elif n[-1]== "3":
print("bon")
else:
print("pon")
| 0 | null | 37,463,515,062,640 | 202 | 142 |
x = int(input())
if x == 1:
print(0)
elif x == 0:
print(1)
else:
pass
|
import sys
def input(): return sys.stdin.readline().strip()
def STR(): return input()
def MAP(): return map(int, input().split())
inf = sys.maxsize
h, w, k = MAP()
s = [[int(i) for i in STR()] for _ in range(h)]
ans = inf
for i in range(2 ** (h - 1)): #縦方向の割り方を全探索 O(500)
hdiv = [1 for _ in range(h)]
for j in range(h - 1):
tmp = 2 ** j
hdiv[j] = 1 if i & tmp else 0
sh = sum(hdiv)
tmpans = sh - 1
wdiv = [0 for _ in range(w - 1)]
partsum = [0 for _ in range(sh + 1)]
j = 0
cnt = 0
while j < w: #O(2 * 10 ** 4)
tmp = 0
idx = 0
for kk in range(h): #O(10)
tmp += s[kk][j]
if hdiv[kk]:
partsum[idx] += tmp
tmp = 0
idx += 1
flag = True
for kk in range(sh + 1):
if partsum[kk] > k:
tmpans += 1
partsum = [0 for _ in range(sh + 1)]
flag = False
if flag:
j += 1
cnt = 0
else:
cnt += 1
if cnt > 2:
tmpans = inf
break
ans = min(ans, tmpans)
print(ans)
| 0 | null | 25,676,954,745,040 | 76 | 193 |
from itertools import combinations
import numpy as np
N = int(input())
D = list(map(int, input().split()))
List = np.array(list(combinations(D,2)))
print(sum(np.product(List, axis = 1)))
|
import itertools
n = int(input())
d = list(map(int, input().split()))
M = []
ans = 0
for v in itertools.combinations(d, 2):
M.append(list(v))
for m in M:
ans += m[0]*m[1]
print(ans)
| 1 | 167,877,072,751,840 | null | 292 | 292 |
N,M=map(int,input().split())
H=list(map(int,input().split()))
cnt=[1 for _ in range(N)]
for _ in range(M):
A,B=map(int,input().split())
A-=1
B-=1
if H[A]>H[B]:
cnt[B]=0
elif H[A]<H[B]:
cnt[A]=0
else:
cnt[A]=0
cnt[B]=0
print(cnt.count(1))
|
input();print(*[i+j for i,j in zip(*input().split())],sep='')
| 0 | null | 68,503,222,836,360 | 155 | 255 |
X = int(input())
K = 0
while ((X * K) % 360 != 0) or (K == 0):
K += 1
print(K)
|
A, B = map(float, input().split())
A = int(A)
B = round(B*100)
print((A * B) // 100)
| 0 | null | 14,883,045,751,338 | 125 | 135 |
s = input()
t = input()
cnt = 0
for i in range(len(s)):
if s[i]!=t[i]:
cnt+=1
if cnt>0:
print("No")
else:
print("Yes")
|
print('YNeos'[input()!=input()[:-1]::2])
| 1 | 21,227,846,353,350 | null | 147 | 147 |
N,K = map(int,input().split())
M = list(map(int,input().split()))
M =sorted(M,reverse=True)
print(sum(M[K:]))
|
# -*- coding: utf-8 -*-
import sys
lines = sys.stdin.readlines()
l = 0
while not ("-" in lines[l]):
s = lines[l].replace('\n','')
n = int(lines[l+1])
l += 2
t = sum(map(int, lines[l:l+n])) % len(s)
print s[t:]+s[:t]
l += n
| 0 | null | 40,421,173,468,834 | 227 | 66 |
k = int(input())
sum = 0
def gcd(a, b):
if b == 0:
return a
return gcd(b, a % b)
for a in range(1, k + 1):
for b in range(1, k + 1):
ab_gcd = gcd(a, b)
for c in range(1, k + 1):
abc_gcd = gcd(c, ab_gcd)
sum += abc_gcd
print(sum)
|
def check(P,k,staffList):
i = 0
for _ in range(k):
staffNum = 0
while(staffNum + staffList[i]<= P):
staffNum += staffList[i]
i += 1
if i == n:
return n
return i
def getMaxP(n,k,staffList):
# Pが増えれば，入れられる個数は単純増加するので，二部探索によりPの最小値を求められる
left = 0
right = 100000*10000
while right-left>1:
mid = (left+right)//2
staffNum = check(mid,k,staffList)
if staffNum >= n :
right = mid
else:
left = mid
return right
if __name__ == "__main__":
n,k = map(int,input().split())
staffList = [int(input()) for _ in range(n)]
# 特定の最大積載量でどれだけ積めるのかを計算する
P = getMaxP(n,k,staffList)
print(P)
| 0 | null | 17,933,345,687,840 | 174 | 24 |
import math
z = raw_input()
x1, y1, x2, y2 = z.split()
x1 = float(x1)
x2 = float(x2)
y1 = float(y1)
y2 = float(y2)
d = math.sqrt((x2 - x1) * (x2-x1) + (y2 - y1) * (y2 - y1))
print ("%lf" %(d))
|
W, H, x, y, r = list(map(int, input().split()))
x_right = x + r
x_left = x - r
y_up = y + r
y_down = y - r
if x_right <= W and x_left >= 0 and y_up <= H and y_down >= 0:
print("Yes")
else:
print("No")
| 0 | null | 306,103,655,620 | 29 | 41 |
#!/usr/bin/env python3
import sys
from itertools import chain
# floor(A x / B) - A * floor(x / B)
#
# x = B * x1 + x2 : (x2 < B) とする
#
# = floor(A (B*x1+x2) / B) - A floor((B*x1+x2) / B)
# = A x1 + floor(A x2 / B) - A x1
# = floor(A x2 / B)
def solve(A: int, B: int, N: int):
if N >= B:
x2 = B - 1
else:
x2 = N
return (A * x2) // B
def main():
tokens = chain(*(line.split() for line in sys.stdin))
A = int(next(tokens)) # type: int
B = int(next(tokens)) # type: int
N = int(next(tokens)) # type: int
answer = solve(A, B, N)
print(answer)
if __name__ == "__main__":
main()
|
import sys
import math
def resolve(in_):
a, b, n = map(int, next(in_).split())
x = min(b - 1, n)
return math.floor(a * x / b) - a * math.floor(x / b)
def main():
answer = resolve(sys.stdin.buffer)
print(answer)
if __name__ == '__main__':
main()
| 1 | 28,152,576,186,460 | null | 161 | 161 |
R = int(input())
print(6.28*R)
|
def f(x, m):
return x * x % m
def main():
N, X, M = map(int, input().split())
pre = set()
pre.add(X)
cnt = 1
while cnt < N:
X = f(X, M)
if X in pre: break
cnt += 1
pre.add(X)
if cnt == N:
return sum(pre)
ans = sum(pre)
N -= cnt
loop = set()
loop.add(X)
while cnt < N:
X = f(X, M)
if X in loop: break
loop.add(X)
left = N % len(loop)
ans += sum(loop) * (N // len(loop))
for i in range(left):
ans += X
X = f(X, M)
return ans
print(main())
| 0 | null | 17,088,236,245,532 | 167 | 75 |
import math
h = int(input())
n = int(math.log2(h))
a = 2
r = 2
S = (a*(r**n)-a) // (r-1)
print(S + 1)
|
H = int(input())
i = 1
cnt = 0
while H > 0:
H //= 2
cnt += i
i *= 2
print(cnt)
| 1 | 80,196,666,110,120 | null | 228 | 228 |
n = int(input())
x = [input() for i in range(n)]
print(len(list(set(x))))
|
A11, A12, A13 = map(int, input().split())
A21, A22, A23 = map(int, input().split())
A31, A32, A33 = map(int, input().split())
N = int(input())
B = {int(input()) for _ in range(N)}
h1 = {A11, A12, A13}
h2 = {A21, A22, A23}
h3 = {A31, A32, A33}
v1 = {A11, A21, A31}
v2 = {A12, A22, A32}
v3 = {A13, A23, A33}
c1 = {A11, A22, A33}
c2 = {A13, A22, A31}
if len(h1 & B)==3 or len(h2 & B)==3 or len(h3 & B)==3 or len(v1 & B)==3 or len(v2 & B)==3 or len(v3 & B)==3 or len(c1 & B)==3 or len(c2 & B)==3:
print("Yes")
else:
print("No")
| 0 | null | 45,059,791,703,630 | 165 | 207 |
str = input()
for q in range(int(input())):
com, *num = input().strip().split()
a, b = int(num[0]), int(num[1])
if com == 'print':
print(str[a:b+1])
elif com == 'replace':
str = str[:a] + num[2] + str[b+1:]
else: # com == 'reverse'
str = str[:a] + str[a:b+1][::-1] + str[b+1:]
|
def my_print(s, a, b):
print(s[a:b+1])
def my_reverse(s, a, b):
return s[:a] + s[a:b+1][::-1] + s[b+1:]
def my_replace(s, a, b, p):
return s[:a] + p + s[b+1:]
if __name__ == '__main__':
s = input()
q = int(input())
for i in range(q):
code = input().split()
op, a, b = code[0], int(code[1]), int(code[2])
if op == 'print':
my_print(s, a, b)
elif op == 'reverse':
s = my_reverse(s, a, b)
elif op == 'replace':
s = my_replace(s, a, b, code[3])
| 1 | 2,081,933,334,812 | null | 68 | 68 |
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
X,Y,A,B,C = map(int,readline().split())
P = list(map(int,readline().split()))
Q = list(map(int,readline().split()))
R = list(map(int,readline().split()))
P = sorted(P,reverse=True)
Q = sorted(Q,reverse=True)
R = sorted(R,reverse=True)
P = P[:X]
Q = Q[:Y]
PQR = sorted(P+Q+R,reverse = True)
ans = sum(PQR[:X+Y])
print(ans)
|
from sys import stdin, setrecursionlimit
def main():
input = stdin.buffer.readline
x, y, a, b, c = map(int, input().split())
pqr = []
p = list(map(int, input().split()))
q = list(map(int, input().split()))
r = list(map(int, input().split()))
for i in range(a):
pqr.append([p[i], 1])
for i in range(b):
pqr.append([q[i], 2])
for i in range(c):
pqr.append([r[i], 0])
pqr.sort(reverse=True)
ans = 0
c_a = 0
c_b = 0
c_c = 0
for v, k in pqr:
if k == 1 and c_a < x:
ans += v
c_a += 1
elif k == 2 and c_b < y:
ans += v
c_b += 1
elif k == 0 and c_a + c_b + c_c < x + y:
ans += v
c_c += 1
if c_a + c_b + c_c == x + y:
print(ans)
exit()
if __name__ == "__main__":
setrecursionlimit(10000)
main()
| 1 | 44,794,384,995,672 | null | 188 | 188 |
from sys import stdin, setrecursionlimit
def main():
input = stdin.buffer.readline
n = int(input())
d = list(map(int, input().split()))
ans = 0
for i in range(n - 1):
for j in range(i + 1, n):
ans += d[i] * d[j]
print(ans)
if __name__ == "__main__":
setrecursionlimit(10000)
main()
|
a, b = map(str, input().split())
ans = [a] * int(b) if int(a)<=int(b) else [b] * int(a)
print(''.join(ans))
| 0 | null | 125,984,195,343,798 | 292 | 232 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.