code1
stringlengths 16
427k
| code2
stringlengths 16
427k
| similar
int64 0
1
| pair_id
int64 2
181,637B
⌀ | question_pair_id
float64 3.71M
180,629B
⌀ | code1_group
int64 1
299
| code2_group
int64 1
299
|
|---|---|---|---|---|---|---|
a, b, k = map(int,input().split())
if a+b <= k:
print(0, 0)
elif a <= k:
num = k-a
b -= num
print(0, b)
else:
a = a - k
print(a, b)
|
n=list(map(int,input()))
if 7 in n:
print("Yes")
else:
print("No")
| 0 | null | 69,341,222,228,432 | 249 | 172 |
while True:
num = input()
if(num == "0"): break
ret = 0
for i in num:
ret += int(i)
print(ret)
|
# -*-coding:utf-8
def main():
while True:
inputNumber = input()
if(inputNumber == '0'):
break
else:
print(sum(list(map(int, inputNumber))))
if __name__ == '__main__':
main()
| 1 | 1,563,225,153,552 | null | 62 | 62 |
# 視点を変えてやる全探索 000~999までが達成できたらおｋ
n = int(input())
s = list(input())
ans = 0
for i in range(1000):
t = list(f"{i:0>3}")
j = 0
tmp = ""
for c in s:
if t[j] == c:
j += 1
if j == 3:
ans += 1
break
print(ans)
|
n=int(input())
a=list(map(int,input().split()))
for i in a:
if i%2==0:
if i%3!=0 and i%5!=0:
print('DENIED')
exit()
print('APPROVED')
| 0 | null | 98,499,461,265,240 | 267 | 217 |
n=int(input());print(len(set([input() for _ in range(n)])))
|
import numpy as np
N = int(input())
data_list = []
for i in range(N):
si = input()
data_list.append(si)
data_list = np.array(data_list)
print(len(np.unique(data_list)))
| 1 | 30,373,461,886,616 | null | 165 | 165 |
#!/usr/bin/env python3
import sys
sys.setrecursionlimit(10**6)
INF = 10 ** 9 + 1 # sys.maxsize # float("inf")
MOD = 10 ** 9 + 7
def debug(*x):
print(*x, file=sys.stderr)
def precompute():
maxAS = 1000000
eratree = [0] * (maxAS + 10)
for p in range(2, maxAS + 1):
if eratree[p]:
continue
# p is prime
eratree[p] = p
x = p * p
while x <= maxAS:
if not eratree[x]:
eratree[x] = p
x += p
import pickle
pickle.dump(eratree, open("eratree.pickle", "wb"))
def solve(N, AS):
import pickle
eratree = pickle.load(open("eratree.pickle", "rb"))
num_division = 0
from collections import defaultdict
count = defaultdict(int)
for a in AS:
factors = []
while a > 1:
d = eratree[a]
factors.append(d)
a //= d
num_division += 1
# debug(": ", factors)
for f in set(factors):
count[f] += 1
# debug(": num_division", num_division)
if any(x == N for x in count.values()):
return "not coprime"
if any(x >= 2 for x in count.values()):
return "setwise coprime"
return "pairwise coprime"
def main():
# parse input
N = int(input())
AS = list(map(int, input().split()))
print(solve(N, AS))
# tests
T1 = """
3
3 4 5
"""
TEST_T1 = """
>>> as_input(T1)
>>> main()
pairwise coprime
"""
T2 = """
3
6 10 15
"""
TEST_T2 = """
>>> as_input(T2)
>>> main()
setwise coprime
"""
T3 = """
3
6 10 16
"""
TEST_T3 = """
>>> as_input(T3)
>>> main()
not coprime
"""
T4 = """
3
100000 100001 100003
"""
TEST_T4 = """
>>> as_input(T4)
>>> main()
pairwise coprime
"""
def _test():
import doctest
doctest.testmod()
g = globals()
for k in sorted(g):
if k.startswith("TEST_"):
doctest.run_docstring_examples(g[k], g, name=k)
def as_input(s):
"use in test, use given string as input file"
import io
f = io.StringIO(s.strip())
g = globals()
g["input"] = lambda: bytes(f.readline(), "ascii")
g["read"] = lambda: bytes(f.read(), "ascii")
input = sys.stdin.buffer.readline
read = sys.stdin.buffer.read
if sys.argv[-1] == "-t":
print("testing")
_test()
sys.exit()
if sys.argv[-1] == 'ONLINE_JUDGE':
precompute()
elif sys.argv[-1] != "DONTCALL":
import subprocess
subprocess.call("pypy3 Main.py DONTCALL", shell=True, stdin=sys.stdin, stdout=sys.stdout)
else:
main()
|
import sys
from math import gcd
n = int(input())
a = list(map(int, input().split()))
b = gcd(a[0], a[1])
for i in range(2, n):
b = gcd(b, a[i])
if b != 1:
print('not coprime')
else:
c = set()
num = max(a)
m = 1000000
vals = [0]*(m+1)
for i in range(2, m):
if vals[i] != 0:
continue
j = 1
while True:
t = i*j
if t > m:
break
if vals[t] == 0:
vals[t] = i
j += 1
d = dict()
for i in a:
p = i
while p != 1:
if p in d:
print("setwise coprime")
sys.exit()
d[p] = 1
p = int(p/vals[p])
print("pairwise coprime")
| 1 | 4,086,815,088,472 | null | 85 | 85 |
import sys
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
read = sys.stdin.buffer.read
sys.setrecursionlimit(10 ** 7)
INF = float('inf')
N, A, B = map(int, input().split())
dis = B - A
if dis % 2 == 0:
ans = dis // 2
else:
ans = min(A - 1, N - B) + 1 + ((B - A) // 2)
print(ans)
|
from collections import defaultdict, deque
N, K = map(int, input().split())
A = list(map(int, input().split()))
cumA = [0] * (N + 1)
for i in range(1, N + 1):
cumA[i] = cumA[i - 1] + A[i - 1]
cnt = defaultdict(int)
que = deque([])
ans = 0
for i, c in enumerate(cumA):
while que and que[0][0] <= i - K:
cnt[que.popleft()[1]] -= 1
diff = (i - c) % K
ans += cnt[diff]
cnt[diff] += 1
que.append((i, diff))
print(ans)
| 0 | null | 123,813,839,258,822 | 253 | 273 |
from copy import deepcopy
def getval():
r,c,k = map(int,input().split())
item = [[0 for i in range(c)] for i in range(r)]
for i in range(k):
ri,ci,vi = map(int,input().split())
item[ri-1][ci-1] = vi
return r,c,k,item
def main(r,c,k,item):
#DP containing the information of max value given k items picked in i,j
prev = [[0 for i in range(4)]]
inititem = item[0][0]
prev[0] = [0,inititem,inititem,inititem]
for i in range(1,r):
initval = prev[i-1][3]
temp = []
cur = item[i][0]
for j in range(4):
temp.append(initval)
for j in range(1,4):
temp[j] += cur
prev.append(temp)
for j in range(1,c):
init = deepcopy(prev[0])
for i in range(1,4):
init[i] = max(prev[0][i],prev[0][i-1]+item[0][j])
curcol = [init]
for i in range(1,r):
cur = item[i][j]
left = curcol[-1]
down = prev[i]
temp = [max(left[3],down[0])]
for k in range(1,4):
temp.append(max(max(left[3],down[k-1])+cur,down[k]))
curcol.append(temp)
prev = curcol
print(max(prev[-1]))
if __name__=="__main__":
r,c,k,item = getval()
main(r,c,k,item)
|
a = input()
al=[chr(ord('a') + i) for i in range(26)]
if a in al:
print("a")
else:
print("A")
| 0 | null | 8,424,069,681,248 | 94 | 119 |
a=input()
num=[]
for x in range(int(a)+1):
if x!=0 and x%3==0 or x%10==3 or "3" in str(x):
num.append(x)
str_list=map(str,num)
print(" "+" ".join(str_list))
|
table = [[[ 0 for i in range(10)] for j in range(3)] for k in range(4)]
n = int(input())
i = 0
while i < n:
b,f,r,v = (int(x) for x in input().split())
table[b-1][f-1][r-1] += v
i += 1
for i,elem_i in enumerate(table): # building
for j,elem_j in enumerate(elem_i): # floor
for k, elem_k in enumerate(elem_j): # room
print (" " + str(elem_k), end='')
print ("")
if i != 3:
print ("####################")
| 0 | null | 1,020,346,728,492 | 52 | 55 |
a,b,c,d=map(int,input().split())
maxxy=max(a*c,a*d,b*c,b*d)
print(maxxy)
|
s=input()
l=['SUN','MON','TUE','WED','THU','FRI','SAT']
d=[7,6,5,4,3,2,1]
print(d[l.index(s)])
| 0 | null | 67,919,497,038,148 | 77 | 270 |
while 1:
s=input()
if'-'==s:break
for _ in range(int(input())):
a=int(input())
s=s[a:]+s[:a]
print(s)
|
while True:
n = input();
if n == '-':
break;
m = int(input());
N = list(n);
for i in range(0,m):
h = int(input());
for j in range(0,h):
x = [];
x.append(N[0]);
N.pop(0);
N.append(x[0]);
print(''.join(N));
| 1 | 1,944,719,491,012 | null | 66 | 66 |
line = input()
a, b = line.split(" ")
a = int(a)
b = int(b)
if a <= (b * 2):
print(0)
elif a > (b*2):
print(a-(b*2))
|
x = input().split()
x_int = [int(i) for i in x]
d = x_int[0]//x_int[1]
r = x_int[0] % x_int[1]
f = (x_int[0]) / (x_int[1])
print('{0} {1} {2:f}'.format(d,r,f))
| 0 | null | 83,210,443,020,758 | 291 | 45 |
def main():
n = int(input())
a = list(map(int, input().split()))
if n % 2 == 0:
dp = [[-10**18]*2, [-10**18]*2]
dp[0][0] = 0
for i in range(n):
dp2 = [[-10**18]*2, [-10**18]*2]
# 使う場合
dp2[1][0] = max(dp2[1][0], dp[0][0]+a[i])
dp2[1][1] = max(dp2[1][1], dp[0][1]+a[i])
# 使わない場合
dp2[0][1] = max(dp2[0][1], dp[0][0])
# 更新
dp2[0][0] = max(dp2[0][0], dp[1][0])
dp2[0][1] = max(dp2[0][1], dp[1][1])
dp = dp2
print(max(dp[1][1], dp[0][0]))
return
dp = [[-10**18]*3, [-10**18]*3]
dp[0][0] = 0
for i in range(n):
# 使う場合
dp2 = [[-10**18]*3, [-10**18]*3]
dp2[1][0] = max(dp2[1][0], dp[0][0]+a[i])
dp2[1][1] = max(dp2[1][1], dp[0][1]+a[i])
dp2[1][2] = max(dp2[1][2], dp[0][2]+a[i])
# 使わない場合
dp2[0][1] = max(dp2[0][1], dp[0][0])
dp2[0][2] = max(dp2[0][2], dp[0][1])
# 更新
dp2[0][0] = max(dp2[0][0], dp[1][0])
dp2[0][1] = max(dp2[0][1], dp[1][1])
dp2[0][2] = max(dp2[0][2], dp[1][2])
dp = dp2
print(max(dp[1][2], dp[0][1]))
main()
|
n = int(input())
a = list(map(int,input().split()))
# i個使う時の要素の和の最大値
dp = [0]*(n+1)
dp[1] = 0
dp[2] = max(a[0],a[1])
# 奇数の番号の累積和
b = [0]*(n+1)
b[1] = a[0]
for i in range(1,n-1,2):
b[i+2] = b[i] + a[i+1]
# print(b)
for i in range(3,n+1):
if i % 2 == 0:
dp[i] = max(dp[i-2] + a[i-1], b[i-1])
else:
dp[i] = max(dp[i-2] + a[i-1], dp[i-3] + a[i-2], b[i-2])
# print(dp)
print(dp[n])
| 1 | 37,591,316,815,712 | null | 177 | 177 |
#coding: utf-8
import math
n = int(input())
x = [int(i) for i in input().split(" ")]
y = [int(i) for i in input().split(" ")]
d1 = d2 = d3 = di = 0
for i in range(n):
d1 += abs(x[i] - y[i])
d2 += abs(x[i] - y[i])**2
d3 += abs(x[i] - y[i])**3
if di < abs(x[i] - y[i]):
di = abs(x[i] - y[i])
print(d1)
print(math.pow(d2, 1.0/2.0))
print(math.pow(d3, 1.0/3.0))
print(di)
|
import math
def main():
N = int(input())
d = {}
za = zb = zab = r = 0
mod = 10**9 + 7
for i in range(N):
a, b = map(int, input().split())
if a== 0 and b == 0:
zab += 1
elif b == 0:
zb += 1
elif a == 0:
za += 1
else:
if a < 0:
a, b = -a, -b
x = math.gcd(abs(a), abs(b))
d[(a//x, b//x)] = d.get((a//x, b//x), 0) + 1
used = set()
l = []
for x in d:
if x in used:
continue
a, b = x[0], x[1]
used.add(x)
if a * b > 0:
t = (abs(b), -abs(a))
else:
t = (abs(b), abs(a))
used.add(t)
l.append((d[x], d.get(t, 0)))
r = pow(2, za) + pow(2, zb) - 1
for i in l:
r *= (pow(2, i[0]) + pow(2, i[1]) - 1)
r %= mod
return (r - 1 + zab) % mod
print(main())
| 0 | null | 10,639,680,212,578 | 32 | 146 |
t, h = 0, 0
for i in range(int(input())):
tc, hc= input().split()
if tc > hc:
t += 3
elif tc < hc:
h += 3
else:
t += 1
h += 1
print('%d %d' % (t, h))
|
taro_score = 0
hanako_socore = 0
game_times = int(input())
for _ in range(game_times):
cards = input().split()
if cards[0] > cards[1]:
taro_score += 3
elif cards[0] == cards[1]:
taro_score += 1
hanako_socore += 1
else:
hanako_socore += 3
print(taro_score, hanako_socore)
| 1 | 2,000,006,754,662 | null | 67 | 67 |
# ABC159C
# 縦，横，高さの合計が len である直方体のうち，体積が最大のものの体積はいくつか
def f(len):
print((len / 3) ** 3)
f(int(input()))
|
import sys
def resolve(in_):
L = int(in_.read())
return (L / 3.0) ** 3
def main():
answer = resolve(sys.stdin)
print(f'{answer:.12f}')
if __name__ == '__main__':
main()
| 1 | 46,843,792,920,872 | null | 191 | 191 |
#coding:utf-8
#1_10_A 2015.4.10
import math
x1,y1,x2,y2 = list(map(float,input().split()))
distance = math.sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)
print('{:.5f}'.format(distance))
|
import math
x1,y1,x2,y2 = map(float,input().split())
ans = math.sqrt((x2-x1)**2+(y2-y1)**2)
print(round(ans,8))
| 1 | 154,055,359,910 | null | 29 | 29 |
import sys
from collections import deque,defaultdict
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
N = int(readline())
graph = [[] for _ in range(N+1)]
AB = []
for i in range(N-1):
a,b = map(int,readline().split())
AB.append((a,b))
graph[a].append(b)
graph[b].append(a)
dist = [-1] * (N+1)
dist[1] = 0
COL = defaultdict()
q = deque([(1,0)])
max_col = 0
def bfs(max_col):
while q:
x,pre_col = q.popleft()
c = 1
for nx in graph[x]:
if dist[nx] != -1:
continue
if c == pre_col:
c += 1
COL[(x,nx)] = c
dist[nx] = 1
q.append((nx,c))
max_col = max(max_col,c)
c += 1
return max_col
max_col = bfs(max_col)
print(max_col)
for a,b in AB:
if (a,b) in COL:
print(COL[(a,b)])
else:
print(COL[(b,a)])
|
N = int(input())
ad = {}
status = {}
edge=[]
for n in range(N):
ad[n+1]=set([])
status[n+1] = -1
for n in range(N-1):
a,b = list(map(int,input().split()))
edge.append((a,b))
ad[a].add(b)
ad[b].add(a)
color = set([])
parent = [0] * (N+1)
ans={}
#BFS
from collections import deque
start = 1
status[start] = 0
que = deque([start])
while len(que) > 0:
start = que[0]
# print(start,parent[start])
c = 1
for v in ad[start]:
if status[v] == -1:
que.append(v)
status[v]=0
if parent[start] == c:
c += 1
parent[v] = c
color.add(c)
s = min(start,v)
e = max(start,v)
ans[s,e]=c
c+=1
# print(parent,que)
que.popleft()
print(len(color))
for e in edge:
print(ans[e])
| 1 | 136,485,074,715,770 | null | 272 | 272 |
a,b = map(int,input().split())
c = a + b
print(int(a) * int(b),c * 2)
|
H1,M1,H2,M2,K = map(int,input().split())
h = H2 - H1
m = M2 - M1
s = 0
s = h * 60 + m
s = s - K
print(s)
| 0 | null | 9,145,902,057,248 | 36 | 139 |
n,r = map(int, input().split())
if n>10: print(r)
else: print(int(100*(10-n)+r))
|
N,R = map(int,input().split())
if N < 10:
R += 100*(10-N)
print(R)
| 1 | 63,574,729,458,230 | null | 211 | 211 |
K=int(input())
def gcd(p,q):
if p%q==0:
return q
return gcd(q,p%q)
S=0
for i in range(K):
for j in range(K):
for k in range(K):
S+=gcd(i+1,gcd(j+1,k+1))
print(S)
|
import sys
input = sys.stdin.readline
from collections import *
def make_divs(n):
divs = []
i = 1
while i*i<=n:
if n%i==0:
divs.append(i)
if i!=n//i:
divs.append(n//i)
i += 1
return divs
N = int(input())
ds = make_divs(N)
ans = 0
for d in ds:
if d==1:
continue
N2 = N
while N2%d==0:
N2 //= d
if (N2-1)%d==0:
ans += 1
ans += len(make_divs(N-1))-1
print(ans)
| 0 | null | 38,506,389,196,422 | 174 | 183 |
while True:
m,f,r = [int(x) for x in input().split()]
if (m,f,r)==(-1,-1,-1): break
s_mf = m + f
if m < 0 or f < 0: print('F')
elif s_mf < 30: print('F')
elif s_mf >= 80: print('A')
elif s_mf >= 65: print('B')
elif s_mf >= 50: print('C')
elif r >= 50: print('C')
else: print('D')
|
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')
| 0 | null | 4,086,861,655,016 | 57 | 101 |
s = raw_input().split()
stack = []
for op in s:
if op.isdigit():
stack.append(op)
else:
b = int(stack.pop())
a = int(stack.pop())
ret = 0
if op == "+":
ret = a + b
elif op == "-":
ret = a - b
elif op == "*":
ret = a * b
stack.append(str(ret))
print stack.pop()
|
# -*- coding: utf-8 -*-
import sys
import os
lst = input().split()
stack = []
for c in lst:
if c == '+':
a = stack.pop()
b = stack.pop()
stack.append(b + a)
elif c == '-':
a = stack.pop()
b = stack.pop()
stack.append(b - a)
elif c == '*':
a = stack.pop()
b = stack.pop()
stack.append(b * a)
else:
stack.append(int(c))
print(stack[0])
| 1 | 35,745,634,004 | null | 18 | 18 |
def inpl(): return list(map(int, input().split()))
X = [1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51]
print(X[int(input())-1])
|
def main():
L = [1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51]
K = int(input())
print(L[K-1])
if __name__ == "__main__":
main()
| 1 | 50,076,516,396,260 | null | 195 | 195 |
n, a, b = map(int, input().split())
if (a%2 and b%2) or (a%2==0 and b%2==0):
print((b-a)//2)
else:
print(min(a-1, n-b)+1+(b-a-1)//2)
|
n,a,b=map(int,input().split())
if (b-a)%2==0:
print((b-a)//2)
else:
c=min(b-1,n-a)
e=min(a-1,n-b)
d=(b-a-1)//2+e+1
print(min(c,d))
| 1 | 109,415,409,018,048 | null | 253 | 253 |
n, k = (int(i) for i in input().split())
w = [int(input()) for i in range(n)]
total_weght = sum(w)
def check(p):
track = [0 for i in range(k)]
target = 0
for i in range(k):
while (track[i] + w[target]) <= p:
track[i] += w[target]
target += 1
if target not in range(n):
break
if target not in range(n):
break
return(target)
def solve(n):
left = 0
right = 100000 * 100000
while left < right:
mid = (left + right) // 2
if n == check(mid):
right = mid
else:
left = mid + 1
return(right)
if __name__ == "__main__":
ans = solve(n)
print(ans)
|
import math
a, b = map(int,input().split())
ans = -1
for i in range(1, 1011):
if math.floor(i*0.08) == a and math.floor(i * 0.1) == b:
print(i)
exit()
print(ans)
| 0 | null | 28,320,062,164,812 | 24 | 203 |
a = str(input())
if 'A'<=a and a<='Z':
print('A')
else:
print('a')
|
c = input()
if c == c.lower():
print('a')
else:
print('A')
| 1 | 11,280,647,495,220 | null | 119 | 119 |
print(int(not(int(input()))))
|
n,m = map(int,input().split())
l = [-1]*(n+1)
for _ in range(m):
s,c = map(int,input().split())
if l[s] == -1:
l[s] = c
else:
if l[s] != c:
print(-1)
exit()
if n != 1 and l[1] == 0:
print(-1)
exit()
if l[1] == -1:
l[1] = 1
for i in range(2,n+1):
if l[i] == -1:
l[i] = 0
ls = list(map(str,l))
if n == 1 and m == 0:
print(0)
exit()
print(int(''.join(ls[1:])))
| 0 | null | 31,860,895,290,978 | 76 | 208 |
for i in range(1, 10):
for j in range(1, 10):
print('%dx%d=%d' % (i, j, i*j))
|
for i in range(9):
i+=1
for n in range(9):
n+=1
print str(i)+"x"+str(n)+"="+str(i*n)
| 1 | 896,580 | null | 1 | 1 |
H,W,K=map(int,input().split())
S=[input() for _ in range(H)]
ans=0
for h in range(2**H):
for w in range(2**W):
cnt=0
for i in range(H):
for j in range(W):
if (h>>i&1): continue
if (w>>j&1): continue
if S[i][j]=="#": cnt+=1
if cnt==K:ans+=1
print(ans)
|
from sys import stdin
X = [ 0 for i in range(100) ]
d = [ 0 for i in range(100) ]
f = [ 0 for i in range(100) ]
G = [[ 0 for i in range(100) ] for i in range(100)]
t = 0
def DFS(i) :
global t
t += 1
d[i] = t
for j in range(n) :
if G[i][j] != 0 and d[j] == 0 : DFS(j)
t += 1
f[i] = t
n = int(input())
for i in range(n) :
X[i] = stdin.readline().strip().split()
for i in range(n) :
for j in range(int(X[i][1])) :
G[int(X[i][0])-1][int(X[i][j+2])-1] = 1
for i in range(n) :
if d[i] == 0 : DFS(i)
for i in range(n) : print(i+1,d[i],f[i])
| 0 | null | 4,458,430,846,852 | 110 | 8 |
K = int(input())
S = input()
len_S = len(S)
if len_S <= K:
print(S)
else:
print(S[:K] + '...')
|
K=int(input())
S=input()
if len(S)<K or len(S)==K:
print (S)
elif len(S)>K:
print(S[0:K]+"...")
| 1 | 19,683,532,705,180 | null | 143 | 143 |
import math
def isprime(x):
if x == 2:
return True
elif x < 2 or x % 2 == 0:
return False
else:
for i in range(3, int(math.sqrt(x)) + 1,2):
if x % i == 0:
return False
return True
n = int(input())
cnt = 0
for i in range(n):
x = int(input())
if isprime(x):
cnt += 1
print(str(cnt))
|
n, k = list(map(int, input().split(' ')))
r, s, p = list(map(int, input().split(' ')))
d = dict(r=p,
s=r,
p=s)
ttt = input()
ans = 0
prevs = []
for i in range(n):
if i < k or ttt[i] != prevs[i-k]:
ans += d[ttt[i]]
prevs.append(ttt[i])
else:
prevs.append('hoge')
print(ans)
| 0 | null | 53,438,118,661,732 | 12 | 251 |
#D
from collections import deque
N,K = map(int,input().split())
numbers = [i for i in range(0,N+1)]
large = deque([N])
small = deque([0])
for i in range(1,N+1):
large.append(large[-1]+numbers[-i-1])
small.append(small[-1]+numbers[i])
mod = 10**9+7
ans = 1
for i in range(K,N+1):
ans += (large[i-1] - small[i-1] + 1)%mod
print(ans%mod)
|
import math
def koch_kurve(n, p1=[0, 0], p2=[100, 0]):
if n == 0: return
s, t, u = make_edge_list(p1, p2)
koch_kurve(n-1, p1, s)
# print(s)
# print(s)
print(" ".join([ str(i) for i in s ]))
koch_kurve(n-1, s, u)
print(" ".join([ str(i) for i in u ]))
koch_kurve(n-1, u, t)
print(" ".join([ str(i) for i in t ]))
koch_kurve(n-1, t, p2)
def make_edge_list(p1, p2):
sx = 2 / 3 * p1[0] + 1 / 3 * p2[0]
sy = 2 / 3 * p1[1] + 1 / 3 * p2[1]
# s = (sx, sy)
s = [sx, sy]
tx = 1 / 3 * p1[0] + 2 / 3 * p2[0]
ty = 1 / 3 * p1[1] + 2 / 3 * p2[1]
t = [tx, ty]
theta = math.radians(60)
ux = math.cos(theta) * (tx - sx) - math.sin(theta) * (ty - sy) + sx
uy = math.sin(theta) * (tx - sx) + math.cos(theta) * (ty - sy) + sy
u = [ux, uy]
return s, t, u
n = int(input())
print("0 0")
koch_kurve(n)
print("100 0")
| 0 | null | 16,548,558,107,792 | 170 | 27 |
mod = 10**9+7
M = 2*10**6
fact = [1]*(M+1)
factinv = [1]*(M+1)
inv = [1]*(M+1)
for n in range(2,M+1):
fact[n] = n*fact[n-1]%mod
inv[n] = -inv[mod%n]*(mod//n)%mod
factinv[n] = inv[n]*factinv[n-1]%mod
def comb(n,k):
return fact[n]*factinv[k]*factinv[n-k]%mod
def main(K,S):
n = len(S)
ans = 0
for k in range(K+1):
ans += comb(n+k-1,k)*pow(25,k,mod)*pow(26,K-k,mod)
ans %= mod
print(ans)
if __name__ == '__main__':
K = int(input())
S = input()
main(K,S)
|
import numpy as np
s_ = np.array(input().split())
s = [int(i) for i in s_]
N,X,T =s[0],s[1],s[2]
n = N//X
if N % X != 0:
n += 1
out = n * T
print(out)
| 0 | null | 8,547,150,080,462 | 124 | 86 |
import sys
readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)
def main():
S = set(map(int, readline().split()))
if len(S) == 2:
print("Yes")
else:
print("No")
if __name__ == '__main__':
main()
|
A,B,C = input().split()
A = int(A)
B = int(B)
C = int(C)
if A == B == C :
print('No')
elif A == B :
print('Yes')
elif B == C :
print('Yes')
elif C == A :
print('Yes')
elif A == B == C :
print('No')
else :
print('No')
| 1 | 68,049,650,275,936 | null | 216 | 216 |
N = int(input())
root = int(N**0.5)
for i in range(root,-1,-1):
if N % i ==0:
break
print(int(N/i + i -2))
|
A, B, C, D = list(map(int, input().split()))
a = A // D
b = C // B
N = max(a, b) + 1
for i in range(N):
if C > 0:
C -= B
if C <= 0:
break
if A > 0:
A -= D
if A <= 0:
break
ans = "No"
if A > C:
ans = "Yes"
print(ans)
| 0 | null | 95,327,255,510,550 | 288 | 164 |
'''
We can show that if u and v belong to the same connected component, then they are friends w/ each other
So everyone in a given connected component is friends with one another
So everyone in a given connected component must be separated into different groups
If we have a CC of with sz nodes in it, then we need at least sz different groups
So, the minimum number of groups needed is max sz(CC)
'''
import sys
sys.setrecursionlimit(2*10**5+5)
n, m = map(int,input().split())
adj = [[] for u in range(n+1)]
for i in range(m):
u, v = map(int,input().split())
adj[u].append(v)
adj[v].append(u)
vis = [False for u in range(n+1)]
def dfs(u):
if vis[u]:
return 0
vis[u] = True
sz = 1
for v in adj[u]:
sz += dfs(v)
return sz
CCs = []
for u in range(1,n+1):
if not vis[u]:
CCs.append(dfs(u))
print(max(CCs))
|
table = []
r,c = [int(x) for x in input().split( )]
for i in range(r):
mini_table = [int(x) for x in input().split( )]
table.append(mini_table)
for i in table:
i.append(sum(i))
gyou = []
for i in range(c+1):
counter = 0
for j in range(r):
counter += table[j][i]
gyou.append(counter)
table.append(gyou)
for i in table:
print(' '.join(str(j) for j in i))
| 0 | null | 2,672,181,666,300 | 84 | 59 |
base, rate = 100, 0.05
for _ in range(int(input())):
increment = base * rate
base += round(increment + (0 if increment.is_integer() else 0.5))
print(base * 1000)
|
N = int(input())
A = list(map(int, input().split()))
M = [0] * N
S = 0
for i in range(N):
S = S^A[i]
for i in range(N):
M[i] = S^A[i]
print(*M)
| 0 | null | 6,243,238,850,340 | 6 | 123 |
import math
import sys
import collections
import bisect
readline = sys.stdin.readline
def main():
n, a, b = map(int, readline().rstrip().split())
mod = 10 ** 9 + 7
ans = pow(2, n, mod) - 1
nca, ncb = 1, 1
for i in range(b):
ncb = ncb * (n - i) % mod
ncb *= pow(i + 1, mod - 2, mod)
if i + 1 == a:
nca = ncb
print((ans - (nca + ncb)) % mod)
if __name__ == '__main__':
main()
|
mod = (10 ** 9 + 7)
def comb(n, r):
p, q = 1, 1
for i in range(r):
p = p *(n-i)%mod
q = q *(i+1)%mod
return p * pow(q, mod-2, mod) % mod
n, a, b = list(map(int, input().split()))
s = pow(2, n, mod) - 1
print((s - comb(n, a) - comb(n, b)) % mod)
| 1 | 66,492,943,398,940 | null | 214 | 214 |
a, b = list(map(int, input().split()))
if a <= b:
my_result = 'unsafe'
else:
my_result = 'safe'
print(my_result)
|
import numpy as np
from numba import jit
N, K = map(int, input().split())
A = np.array(list(map(int, input().split())), dtype=np.int64)
# 高速化
@jit
def imo(a, n):
imos = np.zeros(n+1, dtype=np.int64)
for i in range(n):
imos[max(0, i-a[i])] += 1
imos[min(n, i+a[i])+1] -= 1
# 累計和はnumpyの方が高速
immo = np.zeros(n+1, dtype=np.int64)
immo = np.cumsum(imos)
return immo[:n]
for _ in range(min(K, 41)):
A = imo(A, N)
print(*A)
| 0 | null | 22,228,394,325,590 | 163 | 132 |
N = int(input())
S = input()
base = ord("A")
ans = ""
for i in range(len(S)):
p = (ord(S[i])-base)
s = (p+N) % 26
ans += chr(s+base)
print(ans)
|
N = int(input())
A = [list(map(int, (input().split(' ')))) for i in range(N)]
hoge = [sum(a) for a in A]
fuga = [a[0] - a[1] for a in A]
print(max(max(hoge) - min(hoge), max(fuga) - min(fuga)))
| 0 | null | 69,068,107,814,872 | 271 | 80 |
H,W=map(int,input().split())
S=[list(input())for _ in range(H)]
from collections import deque
def bfs(h,w,sy,sx,S):
maze=[[10**9]*(W)for _ in range(H)]
maze[sy-1][sx-1]=0
que=deque([[sy-1,sx-1]])
count=0
while que:
y,x=que.popleft()
for i,j in [(1,0),(0,1),(-1,0),(0,-1)]:
nexty,nextx=y+i,x+j
if 0<=nexty<h and 0<=nextx<w:
dist1=S[nexty][nextx]
dist2=maze[nexty][nextx]
else:
continue
if dist1!='#':
if dist2>maze[y][x]+1:
maze[nexty][nextx]=maze[y][x]+1
count=max(count,maze[nexty][nextx])
que.append([nexty,nextx])
return count
ans=0
for sy in range(H):
for sx in range(W):
if S[sy][sx]=='.':
now=bfs(H,W,sy+1,sx+1,S)
ans=max(ans,now)
print(ans)
|
x = int(input())
def score(x):
if 400 <= x <= 599:
print("8")
elif 600 <= x <= 799:
print("7")
elif 800 <= x <= 999:
print("6")
elif 1000 <= x <= 1199:
print("5")
elif 1200 <= x <= 1399:
print("4")
elif 1400 <= x <= 1599:
print("3")
elif 1600 <= x <= 1799:
print("2")
elif 1800 <= x <= 1999:
print("1")
score(x)
| 0 | null | 50,853,561,125,708 | 241 | 100 |
n = int(input())
s, t = map(str, input().split())
ans = ''
for a, b in zip(s, t):
ans += a+b
print(ans)
|
from collections import Counter,defaultdict,deque
from heapq import heappop,heappush
from bisect import bisect_left,bisect_right
import sys,math,itertools,fractions
sys.setrecursionlimit(10**8)
mod = 10**9+7
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
n = inp()
s,t = input().split()
print(''.join([s[i] + t[i] for i in range(n)]))
| 1 | 111,867,504,700,768 | null | 255 | 255 |
w,h,x,y,r = map(int,input().split())
if (x + r)> w or (y + r) > h or x <= 0 or y <=0 or (x-r)<0 or (y-r)<0 :
print('No')
else:
print('Yes')
|
w,h,x,y,r = map(int, input().split())
if x>= r and y >= r and x+r <= w and y+r <= h:
print('Yes')
else:
print('No')
| 1 | 444,580,205,510 | null | 41 | 41 |
a=map(int,raw_input().split())
a.sort()
while a[1]%a[0]!=0:
a[0],a[1]=a[1]%a[0],a[0]
print(a[0])
|
# B - Homework
# N M
N, M = map(int, input().split())
my_list = list(map(int, input().split(maxsplit=M)))
if N < sum(my_list):
answer = -1
else:
answer = N - sum(my_list)
print(answer)
| 0 | null | 16,098,856,031,970 | 11 | 168 |
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
from collections import deque
sys.setrecursionlimit(10**7)
inf = 10**20
mod = 10**9 + 7
DR = [1, -1, 0, 0]
DC = [0, 0, 1, -1]
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
def main():
n = I()
ans = 0
N = 10**7 + 1
prime = [True] * N
prime[1] = False
n_yaku = [1] * N
min_prime = [1] * N
for i in range(2, N):
if not prime[i]:
continue
n_yaku[i] = 2
min_prime[i] = i
num = i + i
while num < N:
min_prime[num] = i
prime[num] = False
num += i
for i in range(2, N):
if prime[i]:
continue
j = i
cnt = 0
while j % min_prime[i] == 0:
# print('j: ', j)
# print('prime: ', min_prime[i])
j //= min_prime[i]
cnt += 1
n_yaku[i] = n_yaku[j] * (cnt + 1)
ans = 0
for i in range(1, n+1):
ans += i * n_yaku[i]
print(ans)
main()
|
def main(N):
x = 0
for i in range(1,N+1):
for j in range(i,N+1,i):
x += j
return x
N = int(input())
print(main(N))
| 1 | 10,968,802,608,580 | null | 118 | 118 |
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)
|
import itertools
import math
n = int(input())
x = []
num = []
for i in range(n):
x.append([int(t) for t in input().split()])
num.append(i)
s = 0
for i in itertools.permutations(num):
i = list(i)
#print(x,i)
for j in range(n-1):
s += math.sqrt((x[i[j]][0] - x[i[j+1]][0])**2 + (x[i[j]][1] - x[i[j+1]][1])**2)
#print(s)
s /= math.factorial(n)
print(s)
| 0 | null | 76,009,104,649,290 | 80 | 280 |
n = int(input())
a = list(map(int, input().split()))
def f():
for i in range(n):
if a[i] % 2 == 0:
if a[i] % 3 != 0 and a[i] % 5 != 0:
return "DENIED"
return "APPROVED"
print(f())
|
count = 0
n, d = map(int, input().split())
for _ in range(n):
l, m = map(int, input().split())
z = (l ** 2 + m ** 2) ** 0.5
if z <= d:
count += 1
print(count)
| 0 | null | 37,451,235,263,260 | 217 | 96 |
N = int(input())
for i in range(1,int(N**(1/2)) + 1)[::-1]:
if N%i == 0:
print(i + N//i - 2)
exit()
|
import math
N = int(input())
N_ = int(math.sqrt(N)) + 1
min_distance = N - 1
for i in range(1, N_):
p, r = divmod(N, i)
if r == 0:
if 1 <= p <= N:
distance = (i-1) + (p-1)
min_distance = min(min_distance, distance)
else:
continue
print(min_distance)
| 1 | 162,309,236,219,270 | null | 288 | 288 |
N = int(input())
A = list(map(int, input().split()))
if N % 2 == 0:
M = N // 2
even_A = [A[i* 2] for i in range(M)]
odd_A = [A[i* 2 + 1] for i in range(M)]
even_sum = []
_sum = 0
for a in even_A:
_sum += a
even_sum.append(_sum)
odd_sum = []
_sum = 0
for a in odd_A:
_sum += a
odd_sum.append(_sum)
ans = max(odd_sum[-1], even_sum[-1])
for i in range(M):
x = even_sum[i] + odd_sum[-1] - odd_sum[i]
ans = max(ans, x)
print(ans)
exit()
M = N // 2
# evenが元一つ多い
even_A = [A[i* 2] for i in range(M+1)]
odd_A = [A[i* 2 + 1] for i in range(M)]
even_sum = []
_sum = 0
for a in even_A:
_sum += a
even_sum.append(_sum)
odd_sum = []
_sum = 0
for a in odd_A:
_sum += a
odd_sum.append(_sum)
# 全て奇数
all_even = even_sum[-1] - min(even_A)
diff_odd_even = [odd_sum[k] - even_sum[k+1] for k in range(M)]
diff_max_odd_even = []
diff_max = diff_odd_even[-1]
for k in range(M):
diff_max = max(diff_max, diff_odd_even[-k-1])
diff_max_odd_even.append(diff_max)
diff_max_odd_even.reverse()
ans = all_even
for i in range(M):
x = even_sum[i] + odd_sum[-1] - odd_sum[i]
y = odd_sum[i] + even_sum[-1] - even_sum[i+1]
z = even_sum[i] + - odd_sum[i] + even_sum[-1] + diff_max_odd_even[i]
ans = max(ans, x, y, z)
print(ans)
|
import sys
sys.setrecursionlimit(10 ** 9)
def solve(pick, idx):
if pick == 0: return 0
if idx >= n: return -float('inf')
if (pick, idx) in dp: return dp[pick, idx]
if n-idx+2 < pick*2: return -float('inf')
total = max(A[idx] + solve(pick-1, idx+2), solve(pick, idx+1))
dp[(pick, idx)] = total
return total
n = int(input())
A = list(map(int, input().split()))
dp = {}
pick = n//2
print(solve(pick, 0))
| 1 | 37,432,549,420,958 | null | 177 | 177 |
data = input().split(" ")
a ,b= int(data[0]) , int(data[1])
print(a*b)
|
N = int(input())
xyss = [[] for _ in range(N)]
for i in range(N):
A = int(input())
for _ in range(A):
x, y = map(int, input().split())
xyss[i].append((x-1, y))
ans = 0
for ptn in range(1<<N):
conflict = False
for i in range(N):
if (ptn>>i) & 1:
for x, y in xyss[i]:
if (ptn>>x) & 1 != y:
conflict = True
break
if conflict:
break
else:
num1 = bin(ptn).count('1')
if num1 > ans:
ans = num1
print(ans)
| 0 | null | 69,077,425,438,912 | 133 | 262 |
line = raw_input()
line2 = ''
for s in line:
if s == '\n':
break
elif s.islower():
line2 += s.upper()
elif s.isupper():
line2 += s.lower()
else:
line2 += s
print line2
|
import collections
N = int(input())
graph = [[] for _ in range(N)]
for i in range(N-1):
a, b = map(int, input().split())
graph[a-1].append([b-1,i])
graph[b-1].append([a-1,i])
q = collections.deque()
ans = [-1]*(N-1)
q.append([0,-1])
while len(q) != 0:
tmp = 1
v, v2 = q.popleft()
for w, i in graph[v]:
if ans[i] != -1:
continue
if ans[v2] == tmp:
tmp += 1
ans[i] = tmp
tmp += 1
q.append([w,i])
print(len(set(ans)))
for i in ans:
print(i)
| 0 | null | 68,418,002,922,620 | 61 | 272 |
k = 2 *10**5
mod = 10**9+7
n, a, b = map(int,input().split())
modinv_table = [-1]*(k+1)
for i in range(1,k+1):
modinv_table[i] = pow(i,-1,mod)
def binomial_coefficients(n,k):
ans = 1
for i in range(k):
ans *= n-i
ans *= modinv_table[i+1]
ans %= mod
return ans
print((pow(2,n,mod)-binomial_coefficients(n,a)-binomial_coefficients(n,b)-1)%mod)
|
n, k, s = map(int, input().split())
L = [0] * n
for i in range(n):
if i < k:
L[i] = s
else:
if s != 10 ** 9:
L[i] = s + 1
else:
L[i] = s - 1
print(*L)
| 0 | null | 78,370,741,010,730 | 214 | 238 |
S=input()
K=int(input())
import copy
num=1
liS=[]
for i in range(len(S)-1):
if S[i]==S[i+1]:
num+=1
else:
liS.append(num)
num=1
liS.append(num)
liSR=copy.copy(liS)
liSR[0]+=liSR[-1]
del liSR[-1]
if liSR!=[] and S[0]==S[-1]:
for j in range(len(liS)):
liS[j]=liS[j]//2
for k in range(len(liSR)):
liSR[k]=liSR[k]//2
print(sum(liSR)*(K-1)+sum(liS))
elif liSR!=[] and S[0]!=S[-1]:
for j in range(len(liS)):
liS[j]=liS[j]//2
print(sum(liS)*K)
else:
print((sum(liS)*K)//2)
|
n = int(input())
x = input()
popcount = x.count('1')
p = int(x, 2) % (popcount + 1)
q = int(x, 2) % (popcount - 1) if popcount != 1 else 0
for i in range(n):
if x[i] == '0':
y = (p + pow(2, n-i-1, popcount+1)) % (popcount + 1)
else:
if popcount != 1:
y = (q - pow(2, n-i-1, popcount-1)) % (popcount - 1)
else:
print(0)
continue
cnt = 1
while y != 0:
y %= bin(y).count('1')
cnt += 1
print(cnt)
| 0 | null | 92,081,685,579,960 | 296 | 107 |
X = int(input())
for a in range(-119, 120):
for b in range(-119, 120):
if X == a**5 - b**5:
la = a
lb = b
print(la, lb)
|
ch = raw_input()
print(chr(ord(ch) + 1))
| 0 | null | 58,858,311,980,720 | 156 | 239 |
W,H,x,y,r=map(int, input().split(" "))
if x<r or y<r or x+r>W or y+r>H :
print('No')
else :
print('Yes')
|
A, B, N = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
l = []
l.append(min(a) + min(b))
for _ in range(N):
aq, bq, d = map(int, input().split())
l.append( a[aq-1] + b[bq-1] - d )
print(min(l))
| 0 | null | 27,214,377,497,690 | 41 | 200 |
import collections
N = int(input())
S = [input() for _ in range(N)]
c = collections.Counter(S)
d = c.most_common()
cnt = 0
for i in range(len(c)-1):
if d[i][1] == d[i+1][1]:
cnt += 1
else:
break
e = []
for j in range(cnt+1):
e.append(d[j][0])
e.sort()
for k in range(len(e)):
print(e[k])
|
from collections import defaultdict, Counter
n = int(input())
lis = [input() for _ in range(n)]
a = Counter(lis)
tmp = 0
for key, value in a.items():
tmp = max(value, tmp)
ans =[]
for k, v in a.items():
if v == tmp:
ans.append(k)
for i in sorted(ans):
print(i)
| 1 | 70,420,297,221,328 | null | 218 | 218 |
a,b = map(int,input().split())
print('%d %d %.10f'%(a/b,a%b,a/b))
|
import sys
if __name__ == "__main__":
a,b = map(int, raw_input().split())
print "%d %d %f" %(a/b, a%b, a*1.0/b)
| 1 | 614,410,670,180 | null | 45 | 45 |
#!/usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
import sys, itertools, math
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt
def LI(): return list(map(int, input().split()))
def LF(): return list(map(float, input().split()))
def LI_(): return list(map(lambda x: int(x)-1, input().split()))
def II(): return int(input())
def IF(): return float(input())
def S(): return input().rstrip()
def LS(): return S().split()
def IR(n):
res = [None] * n
for i in range(n):
res[i] = II()
return res
def LIR(n):
res = [None] * n
for i in range(n):
res[i] = LI()
return res
def FR(n):
res = [None] * n
for i in range(n):
res[i] = IF()
return res
def LIR(n):
res = [None] * n
for i in range(n):
res[i] = IF()
return res
def LIR_(n):
res = [None] * n
for i in range(n):
res[i] = LI_()
return res
def SR(n):
res = [None] * n
for i in range(n):
res[i] = S()
return res
def LSR(n):
res = [None] * n
for i in range(n):
res[i] = LS()
return res
mod = 1000000007
inf = float('INF')
#solve
def solve():
def f(n, c):
tmp = n % c
t = tmp
b = 0
while tmp:
if tmp & 1:
b += 1
tmp //= 2
if t:
return f(t, b) + 1
else:
return 1
n = II()
a = S()
b = 0
for ai in a:
if ai == "1":
b += 1
a = a[::-1]
bp = 0
bm = 0
if b != 1:
for i, ai in enumerate(a):
if ai == "1":
bp += pow(2, i, b + 1)
bm += pow(2, i, b - 1)
bp %= b + 1
bm %= b - 1
ans = []
for i, ai in enumerate(a):
if ai == "1":
tmpbm = bm - pow(2, i, b - 1)
tmpbm %= b - 1
ans.append(f(tmpbm, b - 1))
else:
tmpbp = bp + pow(2, i, b + 1)
tmpbp %= b + 1
ans.append(f(tmpbp, b + 1))
for ai in ans[::-1]:
print(ai)
return
else:
for i, ai in enumerate(a):
if ai == "1":
bp += pow(2, i, b + 1)
bp %= b + 1
ans = []
for i, ai in enumerate(a):
if ai == "1":
ans.append(0)
else:
tmpbp = bp + pow(2, i, b + 1)
tmpbp %= b + 1
ans.append(f(tmpbp, b + 1))
for ai in ans[::-1]:
print(ai)
return
#main
if __name__ == '__main__':
solve()
|
#0除算
import math
def popcount(x):
s=0
y=int(math.log2(x))+2
for i in range(y):
if(x>>i)&1:
s+=1
return x%s
n=int(input())
x=input()[::-1]
#1がなんこ出るのか
c=x.count("1")
#c+1とc-1だけ考えれば良い
#c=1の時場合分け
#m[i][j]:2^iまで考えたときのmod(c+j-1)
if c!=1:
m=[[1%(c-1),1%(c+1)]]
for i in range(n-1):
m.append([(2*m[-1][0])%(c-1),(2*m[-1][1])%(c+1)])
l=[0,0]
for i in range(n):
if x[i]=="1":
l[0]+=m[i][0]
l[1]+=m[i][1]
l[0]%=(c-1)
l[1]%=(c+1)
else:
m=[[1%(c+1),1%(c+1)]]
for i in range(n-1):
m.append([(2*m[-1][0])%(c+1),(2*m[-1][1])%(c+1)])
l=[0,0]
for i in range(n):
if x[i]=="1":
l[0]+=m[i][0]
l[1]+=m[i][1]
l[0]%=(c+1)
l[1]%=(c+1)
#一個だけ変えたいので全体を求める
#最初以外はpopcount使って間に合う
ans=[0]*n
for i in range(n):
if x[i]=="1":
if c-1==0:
ans[i]=0
continue
p=(l[0]+(c-1)-m[i][0])%(c-1)
ans[i]+=1
while p!=0:
p=popcount(p)
ans[i]+=1
else:
p=(l[1]+m[i][1])%(c+1)
ans[i]+=1
while p!=0:
p=popcount(p)
ans[i]+=1
ans=ans[::-1]
for i in range(n):
print(ans[i])
| 1 | 8,228,149,098,038 | null | 107 | 107 |
N = int(input())
A = list(map(int, input().split()))
A.sort()
res = 1
for i in A:
res*=i;
if res>10**18:
res = -1
break
print(res)
|
all_text = []
while True:
try:
text = input().split()
all_text.extend(text)
except EOFError:
break
text = ''.join(all_text)
count = [0]*32
for letter in text:
i = ord(letter)
if i < 64:
continue
else:
i %= 32
if i:
count[i] += 1
for i in range(26):
print(chr(i+ord('a')), ':', count[i+1])
| 0 | null | 8,854,221,033,660 | 134 | 63 |
# ABC162F - Select Half
import sys
input = sys.stdin.buffer.readline
def main():
n=int(input())
a=list(map(int,input().split()))
if n<4:
print(max(a))
sys.exit()
if n%2:
#dp[位置][個数]
dp=[[0,0,0]for i in range(n-2)]
dp[0]=a[:3]
for i in range(2,n-1,2):
dp[i][0]=dp[i-2][0]+a[i]
dp[i][1]=max(dp[i-2][0],dp[i-2][1])+a[i+1]
dp[i][2]=max(dp[i-2][0],dp[i-2][1],dp[i-2][2])+a[i+2]
print(max(dp[-1]))
else:
#dp[位置][個数]
dp=[[0,0]for i in range(n-1)]
dp[0]=a[:2]
for i in range(2,n-1,2):
dp[i][0]=dp[i-2][0]+a[i]
dp[i][1]=max(dp[i-2][0],dp[i-2][1])+a[i+1]
print(max(dp[-1]))
main()
|
import numpy as np
n = int(input())
a = list(map(int,input().split()))
dp = np.zeros((n+1,2), int)
dp[1],dp[2] = [0,a[0]], [0,max(a[0], a[1])]
for i in range(3,n+1):
if(i%2 == 0):
dp[i][0] = max(dp[i-1][0],dp[i-2][0]+a[i-1],dp[i-2][1])
dp[i][1] = max(dp[i-1][1],dp[i-2][1]+a[i-1])
else:
dp[i][0] = max(dp[i-1][1],dp[i-2][1],dp[i-2][0]+a[i-1])
dp[i][1] = dp[i-2][1]+a[i-1]
print(dp[n][(n+1)%2])
| 1 | 37,437,157,995,582 | null | 177 | 177 |
import sys
def main():
i = 1
while True:
x = int(sys.stdin.readline())
if x != 0:
print("Case {0}: {1}".format(i, x))
i += 1
else:
break
return
if __name__ == '__main__':
main()
|
a,b=map(int,input().split())
if a<b:
(a,b)=(b,a)
while b!=0:
(a,b)=(b,a%b)
print(a)
| 0 | null | 249,597,474,980 | 42 | 11 |
# -*- coding:utf-8 -*-
stack = list()
def deal_expression(x):
if x.isdigit():
stack.append(int(x))
else:
a = stack.pop()
b = stack.pop()
if x == '+':
stack.append(b + a)
elif x == '-':
stack.append(b - a)
elif x == '*':
stack.append(b * a)
elif x == '/':
stack.append(b / a)
for x in input().split():
deal_expression(x)
print(stack[0])
|
n=input().split()
c=0
while len(n)!=1:
if n[c]=='+':
n[c-2]=int(n[c-2])+int(n[c-1])
del n[c-1]
del n[c-1]
c=0
elif n[c]=='-':
n[c-2]=int(n[c-2])-int(n[c-1])
del n[c-1]
del n[c-1]
c=0
elif n[c]=='*':
n[c-2]=int(n[c-2])*int(n[c-1])
del n[c-1]
del n[c-1]
c=0
elif n[c]=='/':
n[c-2]=int(n[c-2])/int(n[c-1])
del n[c-1]
del n[c-1]
c=0
c+=1
a=int(n[0])
print(a)
| 1 | 37,157,800,170 | null | 18 | 18 |
def solve():
a,b = map(int,input().split())
print(len(str(a+b)))
while True:
try:
solve()
except:
break
|
import heapq
import sys
input = sys.stdin.readline
n = int(input())
sss = [input()[:-1] for _ in range(n)]
a = []
b = []
ss = 0
ii = 0
for i in sss:
mi = 0
ma = 0
s = 0
for j in i:
if j == "(":
s += 1
else:
s -= 1
mi = min(mi, s)
ma = max(ma, s)
ss += s
if s >= 0:
a.append([s, mi, ma, ii])
else:
mi = 0
ma = 0
s = 0
for j in reversed(i):
if j == ")":
s += 1
else:
s -= 1
mi = min(mi, s)
ma = max(ma, s)
b.append([s, mi, ma, ii])
ii += 1
if ss != 0:
print("No")
exit()
a.sort(reverse=1, key=lambda x: x[1])
b.sort(reverse=1, key=lambda x: x[1])
def ok(a):
s = 0
for i, j, _, _ in a:
if s + j < 0:
print("No")
exit()
s += i
ok(a)
ok(b)
print("Yes")
| 0 | null | 11,889,855,852,378 | 3 | 152 |
N, M = map(int, input().split())
H = [int(x) for x in input().split()]
adj = [0] * N
good = [1]*N
for j in range(N):
adj[j] = set()
for k in range(M):
A, B = map(int, input().split())
if H[A - 1] >= H[B - 1]:
good[B - 1] = 0
if H[A - 1] <= H[B - 1]:
good[A - 1] = 0
print(sum(good))
|
n,m = map(int,input().split())
h = list(map(int,input().split()))
l = [list(map(int,input().split())) for i in range(m)]
a,b = [list(i) for i in zip(*l)]
z = [1] * n
for i in range(m):
x = a[i] - 1
y = b[i] - 1
if h[x] < h[y]:
z[x] = 0
elif h[x] > h[y]:
z[y] = 0
else:
z[x] = 0
z[y] = 0
print(n - z.count(0))
| 1 | 25,094,273,783,858 | null | 155 | 155 |
S = input().rstrip()
T = input().rstrip()
count = 0
for i in range(len(S)):
if S[i] != T[i]:
count+=1
print(count)
|
if __name__ == '__main__':
n = int(input())
a = input().split()
a = [int(x) for x in a]
ans = 1
if 0 in a:
print(0)
else:
for i in a:
ans = ans*i
if ans > 10**18:
ans = -1
break
print(ans)
| 0 | null | 13,361,322,567,548 | 116 | 134 |
arr = map(int, raw_input().split())
print("%d %d" % (arr[0] * arr[1], arr[0] * 2 + arr[1] * 2))
|
a = [int(item) for item in input().split()]
print("{} {}".format(a[0]*a[1], 2*(a[0]+a[1])))
| 1 | 298,516,593,668 | null | 36 | 36 |
def prepare(n, MOD):
# 1! - n! の計算
f = 1
factorials = [1] # 0!の分
for m in range(1, n + 1):
f *= m
f %= MOD
factorials.append(f)
# n!^-1 の計算
inv = pow(f, MOD - 2, MOD)
# n!^-1 - 1!^-1 の計算
invs = [1] * (n + 1)
invs[n] = inv
for m in range(n, 1, -1):
inv *= m
inv %= MOD
invs[m - 1] = inv
return factorials, invs
def main():
n,k=map(int, input().split())
A=[int(i) for i in input().split()]
MOD = 10**9 + 7
fac, invs = prepare(n,MOD)
ans = 0
A.sort()
for i in range(n):
tmp=0
tmp2=0
if i<n-k+1:
tmp = (fac[n-(i+1)]%MOD * invs[k-1]%MOD * invs[n-(i+1) - (k-1)]%MOD)%MOD
if i>=k-1:
tmp2 = (fac[i]%MOD * invs[k-1]%MOD * invs[i-(k-1)]%MOD)%MOD
#print("最大になる回数", tmp2, " 最小になる回数", tmp, "A[i]", A[i])
ans = ans%MOD + (tmp2*A[i]%MOD - tmp*A[i]%MOD)%MOD
ans%=MOD
if k==1:
ans = 0
print(ans)
if __name__ == '__main__':
main()
|
class Comb():
def __init__(self, n, p):
# O(n)
fct, inv = [1, 1], [1, 1]
a, b = 1, 1
for i in range(2, n + 1):
a = (a * i) % p
b = (b * pow(i, p - 2, p)) % p
fct.append(a)
inv.append(b)
self.fct = fct
self.inv = inv
self.n = n
self.p = p
def calc(self, n, r):
fct, inv = self.fct, self.inv
if (r < 0 or n < r):
return 0
else:
return fct[n] * inv[r] * inv[n - r] % p
N, K = map(int, input().split())
A = list(map(int, input().split()))
A.sort()
B = A[::-1]
p = 10 ** 9 + 7
cmb = Comb(N, p)
ans = 0
for n in range(N - K + 1):
c = cmb.calc(N - n - 1, K-1)
ans -= A[n] * c % p
ans += B[n] * c % p
print(ans % p)
| 1 | 95,589,288,194,092 | null | 242 | 242 |
#!/usr/bin/env python
# encoding: utf-8
class Solution:
@staticmethod
def stack_polish_calc():
# write your code here
# array_length = int(input())
calc_func = ('+', '-', '*')
array = [str(x) for x in input().split()]
# print(array)
result = []
for i in range(len(array)):
if array[i] not in calc_func:
result.append(str(array[i]))
else:
calc = array[i]
arg_2 = result.pop()
arg_1 = result.pop()
result.append(str(eval(''.join((str(arg_1), calc, str(arg_2))))))
print(*result)
if __name__ == '__main__':
solution = Solution()
solution.stack_polish_calc()
|
n = input()
S = set([int(s) for s in raw_input().split()])
m = input()
T = set([int(s) for s in raw_input().split()])
print len(T & S)
| 0 | null | 52,419,179,596 | 18 | 22 |
while True:
H, W = [int(x) for x in input().split()]
if H == 0 and W == 0 : break
for i in range(H):
for j in range(W):
if i == 0 or i == (H-1) or j == 0 or j == (W-1):
print("#", end = '')
else:
print(".", end='')
print("\n", end="")
print("\n", end="")
|
t1,t2 = map(int,input().split())
a1,a2 = map(int,input().split())
b1,b2 = map(int,input().split())
import math
f = (a1-b1)*t1
s = (a2-b2)*t2
if f == -s:
print("infinity")
elif (f>0 and f+s>0) or (f<0 and f+s<0):
print(0)
elif f//(-(f+s)) == math.ceil(f/(-(f+s))):
print(f//(-(f+s))*2)
else:
print(f//(-(f+s))*2+1)
| 0 | null | 66,319,488,101,122 | 50 | 269 |
h = int(input())
w = int(input())
n = int(input())
if n % max(h, w) == 0:
print(int(n//max(h, w)))
else:
print(int(n//max(h, w))+1)
|
H=int(input())
W=int(input())
N=int(input())
k=max(H, W)
cnt=0
while k*cnt<N:
cnt+=1
print(cnt)
| 1 | 88,460,918,150,770 | null | 236 | 236 |
S=list(str(input()))
a=0
if len(S)%2==0:
for i in range((len(S))//2):
if S[i]!=S[len(S)-i-1]:
a+=1
if len(S)%2==1:
for i in range((len(S)-1)//2):
if S[i]!=S[len(S)-i-1]:
a+=1
print(a)
|
S = input()
S_ = S[::-1]
count = 0
for i in range(len(S)//2):
if S[i] != S_[i]:
count += 1
print(count)
| 1 | 120,081,805,121,940 | null | 261 | 261 |
import sys
# sys.setrecursionlimit(100000)
def input():
return sys.stdin.readline().strip()
def input_int():
return int(input())
def input_int_list():
return [int(i) for i in input().split()]
def main():
n = input_int()
A = input_int_list()
A_sum = sum(A)
cusum = [0] * (n + 1)
ans = float("inf")
for i in range(1, n + 1):
cusum[i] = cusum[i - 1] + A[i - 1]
ans = min(ans, abs(cusum[i] - (A_sum - cusum[i])))
print(ans)
return
if __name__ == "__main__":
main()
|
n=int(input())
a=list(map(int,input().split()))
s=sum(a)
ans = 12345678901234
cnt = 0
for i in range(n):
cnt += a[i]
ans = min(ans,abs(s-cnt - cnt))
print(ans)
| 1 | 142,358,550,208,132 | null | 276 | 276 |
a, b, k = map(int, input().split())
after_a = max(0, a - k)
after_b = b
if after_a == 0:
k -= a
after_b = max(0, b - k)
print(after_a, after_b)
|
import sys
def input(): return sys.stdin.readline().strip()
def mapint(): return map(int, input().split())
sys.setrecursionlimit(10**9)
N = int(input())
XY = [list(mapint()) for _ in range(N)]
XY.sort(key=lambda x:x[0]+x[1])
ans_1 = abs(XY[0][0]-XY[-1][0])+abs(XY[0][1]-XY[-1][1])
XY.sort(key=lambda x:x[0]-x[1])
ans_2 = abs(XY[0][0]-XY[-1][0])+abs(XY[0][1]-XY[-1][1])
print(max(ans_1, ans_2))
| 0 | null | 53,825,225,359,670 | 249 | 80 |
d=list(map(int,input().split()))
c=list(input())
class dice(object):
def __init__(self, d):
self.d = d
def roll(self,com):
a1,a2,a3,a4,a5,a6=self.d
if com=="E":
self.d = [a4,a2,a1,a6,a5,a3]
elif com=="W":
self.d = [a3,a2,a6,a1,a5,a4]
elif com=="S":
self.d = [a5,a1,a3,a4,a6,a2]
elif com=="N":
self.d = [a2,a6,a3,a4,a1,a5]
dice1=dice(d)
for com in c:
dice1.roll(com)
print(dice1.d[0])
|
class Dice:
def __init__(self, a, b, c, d, e, f):
# サイコロの現在一番上にある面
self.a = a
self.b = b
self.c = c
self.d = d
self.e = e
self.f = f
def move(self, move_str):
for i in move_str:
if i == "N":
self.move_N()
elif i == "E":
self.move_E()
elif i == "W":
self.move_W()
elif i == "S":
self.move_S()
def move_N(self):
tmp1 = self.a
tmp2 = self.e
self.a = self.b
self.b = self.f
self.e = tmp1
self.f = tmp2
def move_E(self):
tmp1 = self.a
tmp2 = self.c
self.a = self.d
self.c = tmp1
self.d = self.f
self.f = tmp2
def move_W(self):
tmp1 = self.a
tmp2 = self.d
self.a = self.c
self.c = self.f
self.d = tmp1
self.f = tmp2
def move_S(self):
tmp1 = self.a
tmp2 = self.b
self.a = self.e
self.b = tmp1
self.e = self.f
self.f = tmp2
"""
def debug(self):
print("--------")
print(f"{self.a=}")
print(f"{self.b=}")
print(f"{self.c=}")
print(f"{self.d=}")
print(f"{self.e=}")
print(f"{self.f=}")
print("--------")
"""
a, b, c, d, e, f = map(int, input().split())
dice = Dice(a, b, c, d, e, f)
li = list(input())
dice.move(li)
print(dice.a)
| 1 | 238,416,004,212 | null | 33 | 33 |
#!/usr/bin/env python3
import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float('inf')
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
s = input()
day = ['SUN', 'MON', 'TUE', 'WED', 'THU', 'FRI', 'SAT']
print(7 - day.index(s))
|
N = int(input())
a = list(map(int, input().split()))
num0 = 0
num1 = sum(a)
ans = 10**10
for i in range(0, N):
num0 += a[i]
num1 -= a[i]
if ans > abs(num1-num0):
ans = abs(num1-num0)
print(ans)
| 0 | null | 137,544,018,432,090 | 270 | 276 |
#!python3
import sys
iim = lambda: map(int, sys.stdin.readline().rstrip().split())
def _cmb(N, mod):
N1 = N + 1
fact = [1] * N1
inv = [1] * N1
for i in range(2, N1):
fact[i] = fact[i-1] * i % mod
inv[N] = pow(fact[N], mod-2, mod)
for i in range(N-1, 1, -1):
inv[i] = inv[i+1]*(i+1) % mod
def cmb(a, b):
return fact[a] * inv[b] * inv[a-b] % mod
return cmb
def resolve():
K = int(input())
s = input()
ls = len(s) - 1
mod = 10**9+7
cmb = _cmb(ls+K, mod)
ans = 0
for i in range(K+1):
ans += cmb(ls+i, ls) * pow(25, i, mod) * pow(26, K - i, mod)
ans %= mod
print(ans)
if __name__ == "__main__":
resolve()
|
import sys
import collections
sys.setrecursionlimit(10**6)
input = sys.stdin.readline
#read = sys.stdin.buffer.read
N = 2100000
MAX_NUM = N + 1
MOD = pow(10, 9) + 7
fac = [0 for _ in range(MAX_NUM)]
finv = [0 for _ in range(MAX_NUM)]
inv = [0 for _ in range(MAX_NUM)]
fac[0] = fac[1] = 1
finv[0] = finv[1] = 1
inv[1] = 1
for i in range(2,MAX_NUM):
fac[i] = fac[i-1] * i % MOD
inv[i] = MOD - inv[MOD%i] * (MOD // i) % MOD
finv[i] = finv[i-1] * inv[i] % MOD
def combinations(n,k):
global fac, finv
if n < k:
return 0
if n < 0 or k < 0:
return 0
return fac[n] * (finv[k] * finv[n-k] % MOD) % MOD
def main():
K = int(input())
S = input()[:-1]
lenS = len(S)
ans = 0
for i in range(lenS, lenS+K+1):
k = min(i-lenS, lenS-1)
ans += (((combinations(i-1, k)*pow(25, i-lenS, MOD))%MOD)*pow(26, lenS+K-i, MOD))%MOD
ans %= MOD
print(ans)
if __name__ == "__main__":
main()
| 1 | 12,883,357,923,920 | null | 124 | 124 |
h1, m1, h2, m2, k = map(int, input().split(' '))
t1 = h1 * 60 + m1
t2 = h2 * 60 + m2
print(t2 - t1 - k)
|
def main():
import sys
input = lambda: sys.stdin.readline().rstrip()
h1, m1, h2, m2, k = map(int, input().split())
m = 60 - m1
h1 += 1
m += (h2 - h1)*60 + m2
print(max(0, m - k))
main()
| 1 | 18,077,214,831,048 | null | 139 | 139 |
# 動的計画法で求める
s = int(input())
mod = 10 ** 9 + 7
A = [0, 0, 0, 1, 1, 1, 2, 3]
for i in range(8, 2000 + 1):
ans = (sum(A[:i - 3 + 1]) + 1) % mod #Aの先頭からi-3+1までを取得
A.append(ans)#配列に結果を加える
print(A[s])
|
# coding:UTF-8
import sys
from math import factorial
def comb(n, r):
return factorial(n) // factorial(r) // factorial(n - r)
def perm(n, r):
return factorial(n) // factorial(r)
def resultSur97(x):
return x % (10**9 + 7)
if __name__ == '__main__':
# ------ 入力 ------#
# 1行入力
s = int(input()) # 数字
# a = input() # 文字列
# aList = list(map(int, input().split())) # スペース区切り連続数字
# aList = input().split() # スペース区切り連続文字列
# aList = [int(c) for c in input()] # 数字→単数字リスト変換
# 定数行入力
x = 5
# aList = [int(input()) for _ in range(x)] # 数字
# aList = [input() for _ in range(x)] # 文字
# aList = [list(map(int, input().split())) for _ in range(x)] # スペース区切り連続数字(行列)
# aList = [input().split() for _ in range(x)] # スペース区切り連続文字
# aList = [[int(c) for c in input()] for _ in range(x)] # 数字→単数字リスト変換(行列)
# スペース区切り連続 数字、文字列複合
# aList = []
# for _ in range(x):
# aa, bb = input().split()
# a.append((int(aa), bb))
# ------ 処理 ------#
a = [1,0,0]
for i in range(3,s+1):
sum = 0
for j in range(i-2):
sum += a[j]
a.append(sum)
out = resultSur97(a[s])
if s >= 3:
print(out)
else:
print(0)
| 1 | 3,286,917,660,740 | null | 79 | 79 |
k=int(input());s=input();print((s,s[:k]+'...')[k<len(s)])
|
k,s=int(input()),input();print([s[:k]+'...',s][len(s)<=k])
| 1 | 19,793,676,676,160 | null | 143 | 143 |
import sys
input = lambda : sys.stdin.readline().rstrip()
sys.setrecursionlimit(max(1000, 10**9))
write = lambda x: sys.stdout.write(x+"\n")
n = int(input())
lr = [None]*n
for i in range(n):
x,l = map(int, input().split())
lr[i] = (x-l, x+l)
lr.sort(key=lambda x: x[1])
ans = 0
c = -10**10
for l,r in lr:
if c<=l:
ans += 1
c = r
print(ans)
|
n=int(input())
cnt=0
Arm=[]
for i in range(n):
x,l=map(int,input().split())
Arm.append([x+l,x-l])
Arm.sort()
dis=-float('inf')
for i in range(n):
if dis<=Arm[i][1]:
cnt+=1
dis=Arm[i][0]
print(cnt)
| 1 | 89,746,524,815,948 | null | 237 | 237 |
# coding: utf-8
a, b = map(int, input().split())
ans = a - b * 2
if ans < 0:
ans = 0
print(ans)
|
A = input().split()
B = int(A[0]) - 2 * int(A[1])
print(0 if B < 0 else B)
| 1 | 166,638,400,999,630 | null | 291 | 291 |
N = int(input())
XL = [tuple(map(int, input().split())) for i in range(N)]
XL.sort(key=lambda x: x[0] + x[1])
ans = 0
prev = - 10**9
for x, l in XL:
if prev <= x - l:
ans += 1
prev = x + l
print(ans)
|
N=int(input())
LR=[]
for i in range(N):
X,L=map(int,input().split())
LR.append([X-L,X+L])
LR.sort(key=lambda x:x[1])
nin=LR[0][1]
ans=1
for i in range(1,N):
if nin<=LR[i][0]:
nin=LR[i][1]
ans+=1
print(ans)
| 1 | 89,917,178,216,588 | null | 237 | 237 |
l = int(input())
v = (l/3)**3
print(v)
|
L = int(input())
print("{}".format(L**3/27))
| 1 | 47,117,404,449,092 | null | 191 | 191 |
import sys
a,v = map(int, sys.stdin.readline().rstrip("\n").split())
b,w = map(int, sys.stdin.readline().rstrip("\n").split())
t = int(sys.stdin.readline().rstrip("\n"))
between = abs(b - a)
speed = v-w
if between <= speed*t:
print('YES')
else:
print('NO')
|
#!/usr/bin/env python3
import sys
from typing import Any, Callable, Deque, Dict, List, Mapping, Optional, Sequence, Set, Tuple, TypeVar, Union
# import time
# import math
# import numpy as np
# import scipy.sparse.csgraph as cs # csgraph_from_dense(ndarray, null_value=inf), bellman_ford(G, return_predecessors=True), dijkstra, floyd_warshall
# import random # random, uniform, randint, randrange, shuffle, sample
# import string # ascii_lowercase, ascii_uppercase, ascii_letters, digits, hexdigits
# import re # re.compile(pattern) => ptn obj; p.search(s), p.match(s), p.finditer(s) => match obj; p.sub(after, s)
# from bisect import bisect_left, bisect_right # bisect_left(a, x, lo=0, hi=len(a)) returns i such that all(val<x for val in a[lo:i]) and all(val>-=x for val in a[i:hi]).
# from collections import deque # deque class. deque(L): dq.append(x), dq.appendleft(x), dq.pop(), dq.popleft(), dq.rotate()
# from collections import defaultdict # subclass of dict. defaultdict(facroty)
# from collections import Counter # subclass of dict. Counter(iter): c.elements(), c.most_common(n), c.subtract(iter)
# from datetime import date, datetime # date.today(), date(year,month,day) => date obj; datetime.now(), datetime(year,month,day,hour,second,microsecond) => datetime obj; subtraction => timedelta obj
# from datetime.datetime import strptime # strptime('2019/01/01 10:05:20', '%Y/%m/%d/ %H:%M:%S') returns datetime obj
# from datetime import timedelta # td.days, td.seconds, td.microseconds, td.total_seconds(). abs function is also available.
# from copy import copy, deepcopy # use deepcopy to copy multi-dimentional matrix without reference
# from functools import reduce # reduce(f, iter[, init])
# from functools import lru_cache # @lrucache ...arguments of functions should be able to be keys of dict (e.g. list is not allowed)
# from heapq import heapify, heappush, heappop # built-in list. heapify(L) changes list in-place to min-heap in O(n), heappush(heapL, x) and heappop(heapL) in O(lgn).
# from heapq import nlargest, nsmallest # nlargest(n, iter[, key]) returns k-largest-list in O(n+klgn).
# from itertools import count, cycle, repeat # count(start[,step]), cycle(iter), repeat(elm[,n])
# from itertools import groupby # [(k, list(g)) for k, g in groupby('000112')] returns [('0',['0','0','0']), ('1',['1','1']), ('2',['2'])]
# from itertools import starmap # starmap(pow, [[2,5], [3,2]]) returns [32, 9]
# from itertools import product, permutations # product(iter, repeat=n), permutations(iter[,r])
# from itertools import combinations, combinations_with_replacement
# from itertools import accumulate # accumulate(iter[, f])
# from operator import itemgetter # itemgetter(1), itemgetter('key')
# from fractions import Fraction # Fraction(a, b) => a / b ∈ Q. note: Fraction(0.1) do not returns Fraciton(1, 10). Fraction('0.1') returns Fraction(1, 10)
def main():
mod = 1000000007 # 10^9+7
inf = float('inf') # sys.float_info.max = 1.79e+308
# inf = 2 ** 63 - 1 # (for fast JIT compile in PyPy) 9.22e+18
sys.setrecursionlimit(10**6) # 1000 -> 1000000
def input(): return sys.stdin.readline().rstrip()
def ii(): return int(input())
def isp(): return input().split()
def mi(): return map(int, input().split())
def mi_0(): return map(lambda x: int(x)-1, input().split())
def lmi(): return list(map(int, input().split()))
def lmi_0(): return list(map(lambda x: int(x)-1, input().split()))
def li(): return list(input())
a, v = mi()
b, w = mi()
t = ii()
if v <= w:
print('NO')
else:
dist = abs(a - b)
print('YES') if dist <= t * (v - w) else print('NO')
if __name__ == "__main__":
main()
| 1 | 15,259,333,024,646 | null | 131 | 131 |
i=input()
a=[x for x in map(int, input().split()) ]
a.sort()
print("{0} {1} {2}".format(a[0], a[-1], sum(a)))
|
import sys
sys.setrecursionlimit(10**5)
N,u,v=map(int,input().split())
du,dv=[0]*-~N,[0]*-~N
T=[list() for i in range(-~N)]
def dfs(p,t,v,d):
d[v]=t
for i in T[v]:
if i!=p:
dfs(v,t+1,i,d)
for i in range(N-1):
a,b=map(int,input().split())
T[a].append(b)
T[b].append(a)
dfs(0,0,u,du)
dfs(0,0,v,dv)
c=0
for i in range(1,-~N):
if len(T[i])==1 and i!=v:
if du[i]<dv[i]:
c=max(c,~-dv[i])
print(c)
| 0 | null | 59,372,945,649,068 | 48 | 259 |
n, a, b = map(int, input().split())
lm = min(n, 2*10**5)
# ①nCrの各項のmod(10^9+7)を事前計算
p = 10 ** 9 + 7
fact = [1, 1] # fact[n] = (n! mod p)
factinv = [1, 1] # factinv[n] = ((n!)^(-1) mod p)
inv = [0, 1] # factinv 計算用
for i in range(2, lm + 1):
fact.append((fact[-1] * i) % p)
inv.append((-inv[p % i] * (p // i)) % p)
factinv.append((factinv[-1] * inv[-1]) % p)
# ②事前計算した項を掛け合わせ
def cmb(n, r, p):
if (r < 0) or (n < r):
return 0
r = min(r, n - r)
rt = 1
for i in range(r):
rt = (rt * (n-i)) % p
rt = rt*factinv[r] % p
return rt
def pow_r(x, n, p):
"""
O(log n)
"""
if n == 0: # exit case
return 1
if n % 2 == 0: # standard case ① n is even
return pow_r(x ** 2 % p, n // 2, p)
else: # standard case ② n is odd
return x * pow_r(x ** 2 % p, (n - 1) // 2, p) % p
rlt = pow_r(2,n,p)
rlt -= 1
rlt -= cmb(n,a,p) % p
rlt -= cmb(n,b,p) % p
while rlt < 0:
rlt += p
print(rlt)
|
def inverse(n, mod):
return pow(n, mod - 2, mod)
def cmb(n, r, mod):
p, q = 1, 1
for i in range(r):
p = p * (n - i) % mod
q = q * (i + 1) % mod
return p * inverse(q, mod) % mod
n, a, b = map(int, input().split())
mod = 10 ** 9 + 7
ans = pow(2, n, mod) - 1
ans -= cmb(n, a, mod)
ans -= cmb(n, b, mod)
print(ans % mod)
| 1 | 66,004,055,666,208 | null | 214 | 214 |
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
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 ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7
from decimal import *
#import numpy as np
#decimal.getcontext().prec = 10
N = INT()
A = LIST()
ans = 1
cnt = [0, 0, 0]
for i in range(N):
ans = ans * cnt.count(A[i]) % mod
if A[i] in cnt:
cnt[cnt.index(A[i])] += 1
else:
print(0)
exit()
print(ans)
|
def has_three(a):
while a != 0:
if a % 10 == 3:
return True
else:
a /= 10
return False
result = list()
n = int(raw_input())
for i in range(1, n + 1):
if i % 3 == 0:
result.append(i)
elif has_three(i):
result.append(i)
print(" " + " ".join(str(i) for i in result))
| 0 | null | 65,822,521,757,472 | 268 | 52 |
import sys
S = input()
if S == "ABC":
print("ARC")
sys.exit()
else:
print("ABC")
sys.exit()
|
s = input()
if s[1] == 'B':
s1 = s.replace('B', 'R')
else:
s1 = s.replace('R', 'B')
print(s1)
| 1 | 24,111,373,103,510 | null | 153 | 153 |
while True :
H, W = [int(temp) for temp in input().split()]
if H == W == 0 :
break
for making in range(H):
if making == 0 or making == (H - 1) : print('#' * W)
else : print('#' + ('.' * (W - 2)) + '#')
print()
|
import sys
sys.setrecursionlimit(10**9)
n, m, k = map(int, input().split())
F = [[] for i in range(n)]
B = [[] for i in range(n)]
l = [0]*n
for i in range(m):
a, b = map(int, input().split())
F[a - 1].append(b - 1)
F[b - 1].append(a - 1)
for i in range(k):
c, d = map(int, input().split())
B[c - 1].append(d - 1)
B[d - 1].append(c - 1)
seen = [0]*n
cnt = 0
r = []
def dfs(x):
if seen[x] == 0:
r[cnt].add(x)
seen[x] = 1
for i in F[x]:
dfs(i)
for i in range(n):
if seen[i] == 0:
r.append(set())
dfs(i)
cnt += 1
ans = [0]*n
for i in r:
lr = len(i)
for j in i:
ans[j] = lr - len(F[j]) - len(i & set(B[j])) - 1
print(*ans)
| 0 | null | 31,363,644,742,562 | 50 | 209 |
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))
|
from itertools import combinations
N = int(input())
town = []
for n in range(N):
x, y = map(int,input().split())
town.append((x,y))
ans = 0
for i,j in combinations(town,2):
ans += ((i[0]-j[0])**2 + (i[1]-j[1])**2)**0.5
print (2*ans/N)
| 1 | 148,896,989,272,928 | null | 280 | 280 |
count = int(raw_input())
S = []
H = []
C = []
D = []
while count:
arr = map(str, raw_input().split(" "))
if arr[0] == "S":
S.append(int(arr[1]))
elif arr[0] == "H":
H.append(int(arr[1]))
elif arr[0] == "C":
C.append(int(arr[1]))
else:
D.append(int(arr[1]))
count -= 1
S.sort()
H.sort()
C.sort()
D.sort()
ans_s = []
ans_h = []
ans_c = []
ans_d = []
for x in range(1, 14):
if not x in S:
ans_s.append(x)
if not x in H:
ans_h.append(x)
if not x in C:
ans_c.append(x)
if not x in D:
ans_d.append(x)
def answer(arr, value):
for x in arr:
print "%s %s" % (value, str(x))
answer(ans_s, 'S')
answer(ans_h, 'H')
answer(ans_c, 'C')
answer(ans_d, 'D')
|
l = int(input())
ans = 0
edge = l/3
ans = edge**3
print(ans)
| 0 | null | 24,041,424,960,062 | 54 | 191 |
import math
A,B,H,M = map(int,input().split())
arg_H = (360*H)/12+(30*M)/60
if M ==0:
arg_M = 360
else:
arg_M = (360*M)/60
HM = abs(arg_H-arg_M)
arg_HM = min(HM, 360-HM)
CM2 = A**2+B**2-2*A*B*math.cos(math.radians(arg_HM))
CM = math.sqrt(CM2)
print(CM)
|
a, b, h, m = map(int,input().split())
angle = 30*h - 5.5*m
import math
ans = (a*a + b*b - 2*a*b*math.cos(math.radians(angle)))**0.5
print(ans)
| 1 | 20,017,144,944,342 | null | 144 | 144 |
a,b=open(0);c=1;
for i in sorted(b.split()):
c*=int(i)
if c>10**18:c=-1;break
print(c)
|
def main():
n = int(input())
As = list(map(int, input().split()))
ans = 1
if 0 in As:
print(0)
return
for a in As:
ans *= a
if ans > 10**18:
print(-1)
return
print(ans)
if __name__ == '__main__':
main()
| 1 | 16,139,712,423,540 | null | 134 | 134 |
H, W, K = map(int, input().split())
S = [input() for _ in range(H)]
C = [0] * W
for i in range(H):
for j in range(W):
if S[i][j] == "#":
C[j] = 1
#print("C:", C)
U = [[0 for _ in range(W)] for _ in range(H)]
T = []
color = 1
for i in range(W):
if C[i] == 1:
T.append(i)
#print("T:", T)
for t in range(len(T)):
if t == len(T) - 1:
if t == 0:
l = 0
else:
l = T[t]
r = W
else:
if t == 0:
l = 0
else:
l = T[t]
r = T[t + 1]
#print("l, r:", l, r)
flag = 0
for h in range(H):
for w in range(l, r):
if S[h][w] == "#":
if flag == 0:
flag = 1
else:
color += 1
for w in range(l, r):
U[h][w] = color
color += 1
for h in range(H):
print(*U[h])
|
N = int(input())
A = list(map(int, input().split()))
min = A[0]
count = 1
for i in range(1, N):
if A[i] <= min:
count += 1
min = A[i]
else:
continue
print(count)
| 0 | null | 114,626,617,459,900 | 277 | 233 |
from collections import Counter
N = int(input())
S = [input() for _ in range(N)]
# 方針：各文字列の出現回数を数え、出現回数が最大なる文字列を昇順に出力する
# Counter(リスト) は辞書型のサブクラスであり、キーに要素・値に出現回数という形式
# Counter(リスト).most_common() は(要素, 出現回数)というタプルを出現回数順に並べたリスト
S = Counter(S).most_common()
max_count = S[0][1] # 最大の出現回数
# 出現回数が最も多い単語を集計する
l = [s[0] for s in S if s[1] == max_count]
# 昇順にソートして出力
for i in sorted(l):
print(i)
|
from collections import defaultdict
N, K, *A = map(int, open(0).read().split())
x = [0] * (N + 1)
for i in range(N):
x[i + 1] = x[i] + A[i]
y = [(x[i] - i) % K for i in range(N + 1)]
ctr = defaultdict(int)
ans = 0
for j in range(N + 1):
ans += ctr[y[j]]
ctr[y[j]] += 1
if j - K + 1 >= 0:
ctr[y[j - K + 1]] -= 1
print(ans)
| 0 | null | 103,586,466,259,360 | 218 | 273 |
N = int(input())
data = [input() for _ in range(N)]
def f(s):
c = len([x for x in data if x in s])
print(f"{s} x {c}")
f("AC")
f("WA")
f("TLE")
f("RE")
|
n, a, b = map(int, input().split())
mod = 10**9+7
# (2**n-1)-nCa-nCb
sum_n = pow(2, n, mod)-1
# print(sum_n)
child = 1
mother = 1
for i in range(0, a):
child *= (n-i)
child %= mod # 分子
mother *= (i+1)
mother %= mod
# print(mother)
# mod-2はフェルマーの小定理によるchild/mother ->child*(mother**(mod-2)) -2が出てくる理由はhttps://qiita.com/drken/items/3b4fdf0a78e7a138cd9a#3-4-fermat-%E3%81%AE%E5%B0%8F%E5%AE%9A%E7%90%86%E3%81%AB%E3%82%88%E3%82%8B%E9%80%86%E5%85%83%E8%A8%88%E7%AE%97
hate_a = child * pow(mother, mod-2, mod) % mod
child = 1
mother = 1
for i in range(0, b):
child *= (n-i)
child %= mod # 分母
mother *= (i+1)
mother %= mod
hate_b = child * pow(mother, mod-2, mod) % mod
print((sum_n-hate_a-hate_b) % mod)
| 0 | null | 37,484,034,679,868 | 109 | 214 |
a,b,c,d=map(int,input().split())
ac = c/b
cc = -(-a//d)
if ac<=cc:
print('Yes')
else:
print('No')
|
abcd = input().split()
hp1 = int(abcd[0])
at1 = int(abcd[1])
hp2 = int(abcd[2])
at2 = int(abcd[3])
while hp1 > 0 and hp2 > 0:
hp2 -= at1
if hp2 <= 0:
print("Yes")
break
hp1 -= at2
if hp1 <= 0:
print("No")
break
| 1 | 29,672,321,433,368 | null | 164 | 164 |
inputs = input().split(" ")
a = int(inputs[0])
b = int(inputs[1])
c = int(inputs[2])
d = int(inputs[3])
values = [a*c, a*d, b*c, b*d]
print(max(values))
|
a,b,c,d = map(int,input().split())
e = a*c
f = a*d
g = b*c
h = b*d
xy =[e,f,g,h]
print(int(max(xy)))
| 1 | 3,026,744,985,180 | null | 77 | 77 |
x,y=map(int,input().split())
t=2*y-4*x
c=y-t
if t<0 or c<0 or t%4!=0 or c%2!=0:
print("No")
else:
print("Yes")
|
while True:
H, W = map(int, input().split())
if H == W == 0:
break
for i in range(H):
for j in range(W):
if (i + j) % 2 == 0:
print('#', end = '')
else:
print('.', end = '')
print()
print()
| 0 | null | 7,350,260,049,978 | 127 | 51 |
import math
def main():
a, b, x = map(int, input().split())
V = a**2 * b
if x <= V/2:
rad = math.atan(a * b**2 / (2*x))
print(math.degrees(rad))
else:
rad = math.atan(2 * (a**2 * b - x) / a**3)
print(math.degrees(rad))
main()
|
def imas(hoge_l, p, track):
s_weights = 0
now_track = 1
for val in hoge_l:
s_weights += val
if s_weights > p:
s_weights = val
now_track += 1
if now_track > track:
return False
return True
num, track = [int(x) for x in input().split()]
hoge_l = list()
for _ in range(num):
hoge_l.append(int(input()))
left = 0
right = 100000 * 10000
while left < right :
mid = (right + left) // 2
if imas(hoge_l, mid, track):
right = mid
else:
left = mid + 1
max_num = max(hoge_l)
if max_num > right:
right = max_num
print (right)
| 0 | null | 81,253,372,193,420 | 289 | 24 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.