code1
stringlengths 16
24.5k
| code2
stringlengths 16
24.5k
| similar
int64 0
1
| pair_id
int64 2
181,637B
⌀ | question_pair_id
float64 3.71M
180,628B
⌀ | code1_group
int64 1
299
| code2_group
int64 1
299
|
|---|---|---|---|---|---|---|
N,K = map(int,input().split())
height = list(map(int,input().split()))
chibi = [1] * N
for i in range (N):
if height[i] >= K:
chibi[i] = 0
print(N-sum(chibi))
|
from collections import defaultdict
import numpy as np
N, K = map(int, input().split())
A = [0] + list(map(int, input().split()))
A = np.array(A)
A %= K
A = A.cumsum()
tmp = np.arange(N + 1)
B = (A - tmp) % K
ans = 0
d = defaultdict(int)
for i in range(min(K, N + 1)):
x = B[i]
ans += d[x]
d[x] += 1
if N > K:
for i in range(K, N + 1):
x = B[i]
y = B[i - K]
d[y] -= 1
ans += d[x]
d[x] += 1
print(ans)
| 0 | null | 158,181,371,106,890 | 298 | 273 |
A = int(input())
B = int(input())
ans = 6-A-B
print(ans)
|
a=int(input())
b=int(input())
l=[]
l.append(a)
l.append(b)
if 1 not in l:
print(1)
elif 2 not in l:
print(2)
else:
print(3)
| 1 | 111,175,469,057,862 | null | 254 | 254 |
def count(n, d):
return n // d
def main():
L, R, d = map(int, input().split())
ans = count(R, d) - count(L - 1, d)
print(ans)
if __name__ == '__main__':
main()
|
from collections import defaultdict
n = int(input())
dct = defaultdict(int)
for i in range(1,n+1):
s = str(i)
dct[(s[0],s[-1])] += 1
ans = 0
for i in range(1,n+1):
s = str(i)
ans += dct[(s[-1],s[0])]
print(ans)
| 0 | null | 47,280,389,412,410 | 104 | 234 |
S = input()
length = len(S)
leng = int(length/2)
cnt = 0
for i in range(leng):
if S[i] == S[length-(i+1)]:
continue
else:
cnt += 1
print(cnt)
|
a = input()
if ("AB" in a) or ("BA" in a):
print("Yes")
else:
print("No")
| 0 | null | 87,338,344,780,992 | 261 | 201 |
#!/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(A: int, B: int, C: int, K: int):
return min(K, A) - max(K-A-B, 0)
def main():
sys.setrecursionlimit(10 ** 6)
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
tokens = iterate_tokens()
A = int(next(tokens)) # type: int
B = int(next(tokens)) # type: int
C = int(next(tokens)) # type: int
K = int(next(tokens)) # type: int
print(solve(A, B, C, K))
if __name__ == '__main__':
main()
|
a,b,c,k = list(map(int,input().split()))
ans = min(a,k)
k = max(0,k-a-b)
ans -= k
print(ans)
| 1 | 21,666,957,233,222 | null | 148 | 148 |
def popcount_int(n):
return bin(n).count('1')
def popcount_bin(s):
return s.count('1')
def poptimes(n,cnt=1):
if n==0:
return cnt
else:
n%=popcount_int(n)
cnt+=1
return poptimes(n,cnt)
N=int(input())
S=input()
S_int=int(S,2)
pc=popcount_bin(S)
pc_plus=S_int%(pc+1)
if pc!=1:
pc_minus=S_int%(pc-1)
for i in range(N):
if S[i]=='1':
if pc!=1:
tmp=pc_minus-pow(2,N-i-1,pc-1)
print(poptimes(tmp%(pc-1)))
else:
print(0)
continue
else:
tmp=pc_plus+pow(2,N-i-1,pc+1)
print(poptimes(tmp%(pc+1)))
|
from collections import deque
H, W = map(int, input().split())
S=[]
for _ in range(H):
S.append(input())
vx = [1, 0, -1, 0]
vy = [0, 1, 0, -1]
ans = 0
def func(si, sj):
queue = deque([si, sj])
seen = [[-1]*W for _ in range(H)]
seen[si][sj] = 0
while queue:
x = queue.popleft()
y = queue.popleft()
for i in range(4):
nx = x + vx[i]
ny = y + vy[i]
if nx<0 or nx>=H or ny<0 or ny>=W:
continue
if S[nx][ny]=="#" or seen[nx][ny]>=0:
continue
seen[nx][ny]=seen[x][y]+1
queue.append(nx)
queue.append(ny)
return seen[x][y]
ans = 0
for i in range(H):
for j in range(W):
if S[i][j]==".":
ans = max(ans, func(i, j))
print(ans)
| 0 | null | 51,232,076,058,566 | 107 | 241 |
n=int(input())
l = [list(map(int,input().split())) for i in range(n)]
ans='No'
for i in range(n-2):
if l[i][0]==l[i][1] and l[i+1][0]==l[i+1][1] and l[i+2][0]==l[i+2][1]:
ans='Yes'
print(ans)
|
X = int(input())
happy = 0
happy += X // 500 * 1000
X = X % 500
happy += X //5 * 5
print(happy)
| 0 | null | 22,727,093,465,342 | 72 | 185 |
import sys
read = sys.stdin.buffer.read
input = sys.stdin.readline
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')
def main():
n=II()
A=[]
B=[]
for _ in range(n):
a,b=MI()
A.append(a)
B.append(b)
A.sort()
B.sort()
#print(A,B)
r=n//2
l=(n-1)//2
#print(l,r)
mi=A[l]+A[r]
ma=B[l]+B[r]
ans=(ma-mi)-(ma-mi)*(n%2)//2+1
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))
N = ini()
A, B = [], []
for i in range(N):
a, b = inm()
A.append(a)
B.append(b)
def solve():
sa = sorted(A)
sb = sorted(B)
if N % 2 == 1:
return sb[N // 2] - sa[N // 2] + 1
else:
return (sb[N // 2] + sb[N // 2 - 1]) - (sa[N // 2] + sa[N // 2 - 1]) + 1
print(solve())
| 1 | 17,355,368,411,188 | null | 137 | 137 |
def main(S, T):
ans = 0
for i in range(len(S)):
if S[i] != T[i]:
ans += 1
return ans
if __name__ == '__main__':
S = input()
T = input()
ans = main(S, T)
print(ans)
|
s = input()
t = input()
n = len(s)
a = 0
for i in range(n):
if s[i] != t[i]:
a += 1
print(a)
| 1 | 10,482,785,470,640 | null | 116 | 116 |
N=int(input())
List = list(map(int, input().split()))
Row = int(input())
QList = []
for i in range (Row):
QList.append(list(map(int, input().split())))
dictA ={}
res = 0
for i in range (N):
dictA.setdefault(List[i],0)
dictA[List[i]] += 1
res += List[i]
num = 0
for i in range(Row):
if QList[i][0] not in dictA:
pass
else:
num = dictA[QList[i][0]]
res = res - dictA[QList[i][0]] * QList[i][0]
dictA[QList[i][0]] = 0
dictA.setdefault(QList[i][1],0)
dictA[QList[i][1]] += num
res += QList[i][1] * num
print(res)
|
from collections import Counter
n = int(input())
a = list(map(int, input().split()))
q = int(input())
counter = Counter(a)
sum_res = sum(a) # はじめの合計、名前がsumだとsum関数とかぶってよくないので
# q回操作します。ループ変数は使わないので_とします（Pythonの慣習）
for _ in range(q):
before, after = map(int, input().split())
# 合計を変更します
sum_res -= before * counter[before]
sum_res += after * counter[before]
# 個数を変更します
counter[after] += counter[before]
counter[before] = 0
print(sum_res)
| 1 | 12,131,889,858,050 | null | 122 | 122 |
X = int(input())
ans = X//500 * 1000
X %= 500
ans += X//5 * 5
print(ans)
|
s=input()
if(s[-1]=='s'): ans='es'
else: ans='s'
print(s+ans)
| 0 | null | 22,684,610,544,160 | 185 | 71 |
from collections import defaultdict
n = int(input())
lis = list(map(int, input().split()))
mod = 998244353
if lis[0] != 0:
print(0)
exit()
d = defaultdict(int)
for i in lis:
d[i] += 1
if d[0] != 1:
print(0)
exit()
ans = 1
for i in range(1, max(lis)+1):
if i not in d:
print(0)
exit()
ans = ans * (d[i-1]**d[i]) % mod
print(ans)
|
import sys
input = sys.stdin.readline
ins = lambda: input().rstrip()
ini = lambda: int(input().rstrip())
inm = lambda: map(int, input().split())
inl = lambda: list(map(int, input().split()))
out = lambda x: print('\n'.join(map(str, x)))
n = ini()
s = list(ins())
n = s.count("R")
t = sorted(s)
ans = 0
for i in range(n):
if s[i] != t[i]:
ans += 1
print(ans)
| 0 | null | 80,963,965,473,862 | 284 | 98 |
import sys
line = sys.stdin.readline().strip().split(" ")
d = float(line[0])
t = float(line[1])
s = float(line[2])
if d / s <= t:
print("Yes")
else:
print("No")
|
a,b,c = map(int, raw_input().split())
t = 0
for n in range(a,b+1):
if c%n == 0:
t += 1
print str(t)
| 0 | null | 2,055,492,458,688 | 81 | 44 |
while True:
N,X = map(int,input().split())
if N == 0 and X == 0:
break
ans = 0
for a in range(1,N+1):
for b in range(1,N+1):
if b <= a:
continue
c = X-(a+b)
if c > b and c <= N:
ans += 1
print("%d"%(ans))
|
n=int(input())
s=input()
mid=n//2
if(s[:mid]==s[mid:]):
print("Yes")
else:
print("No")
| 0 | null | 73,734,434,494,636 | 58 | 279 |
# -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, product, permutations
from operator import add, mul, sub
import sys
# sys.setrecursionlimit(10**6)
# buff_readline = sys.stdin.buffer.readline
buff_readline = sys.stdin.readline
readline = sys.stdin.readline
INF = 2**62-1
def read_int():
return int(buff_readline())
def read_int_n():
return list(map(int, buff_readline().split()))
def read_float():
return float(buff_readline())
def read_float_n():
return list(map(float, buff_readline().split()))
def read_str():
return readline().strip()
def read_str_n():
return readline().strip().split()
def error_print(*args):
print(*args, file=sys.stderr)
def mt(f):
import time
def wrap(*args, **kwargs):
s = time.time()
ret = f(*args, **kwargs)
e = time.time()
error_print(e - s, 'sec')
return ret
return wrap
@mt
def slv(N, A):
sa = [0]
for a in A:
sa.append(sa[-1]+a)
if N == 0:
if A[0] == 1:
return 1
else:
return -1
if A[0] != 0:
return -1
ans = 1
p = 1
for i in range(1, N+1):
m = min(p*2, sa[-1] - sa[i])
ans += m
if m - A[i] < 0:
return -1
p = m - A[i]
return ans
def main():
N = read_int()
A = read_int_n()
print(slv(N, A))
if __name__ == '__main__':
main()
|
N = int(input())
A = list(map(int, input().split()))
def solve(A):
ans = 0
leaves = sum(A)
prev_node_capacity = 1
for ai in A:
if ai > prev_node_capacity:
return -1
ans += min(prev_node_capacity, leaves)
leaves -= ai
prev_node_capacity -= ai
prev_node_capacity *= 2
return ans
print(solve(A))
| 1 | 18,750,510,591,488 | null | 141 | 141 |
N = int(input())
d_ls=[]
for vakawkawelkn in range(N):
D1,D2=map(int, input().split())
if D1==D2:
d_ls+=[1]
else:
d_ls+=[0]
flag=0
for i in range(N-2):
if d_ls[i]*d_ls[i+1]*d_ls[i+2]==1:
flag=1
if flag==0:
print("No")
else:
print("Yes")
# 2darray [[0] * 4 for i in range(3)]
# import itertools
|
N=int(input())
f=0
for i in range(N):
a,b=map(int,input().split())
if a==b:
f+=1
else:
f=0
if f==3:
print('Yes')
break
else:
print('No')
| 1 | 2,501,628,754,152 | null | 72 | 72 |
A,B,C=map(int,input().split())
K = int(input())
flag = False
cnt = 0
while(A>=B):
if cnt > K :
break
B = 2*B
cnt += 1
while(B>=C):
if cnt >= K:
break
C = 2*C
cnt += 1
#print(A,B,C)
if A < B and B < C:
flag = True
if flag:
print("Yes")
else:
print("No")
|
n,m = map(int,input().split())
A = [list(map(int,input().split())) for _ in [None]*n]
b = [int(input()) for _ in [None]*m]
for a in A:print(sum(i*j for i,j in zip(a,b)))
| 0 | null | 4,025,479,520,888 | 101 | 56 |
k, n = map(int, input().split())
a_list = list(map(int, input().split()))
longest = 0
for i in range(n-1):
distance = a_list[i+1] - a_list[i]
longest = max(longest, distance)
print(k-max(longest, k-a_list[n-1]+a_list[0]))
|
import copy
a = [int(c) for c in input().split()]
K = a[0]
N = a[1]
A = [int(c) for c in input().split()]
B = list(map(lambda x: x+K,copy.deepcopy(A)))
A = A+B
l = 0
tmp = 0
cnt = 0
for i in range(N):
tmp = A[i+1]-A[i]
if tmp > l :
cnt = i
l = tmp
print(K-l)
| 1 | 43,386,504,714,582 | null | 186 | 186 |
import sys
input = sys.stdin.readline
ins = lambda: input().rstrip()
ini = lambda: int(input().rstrip())
inm = lambda: map(int, input().split())
inl = lambda: list(map(int, input().split()))
out = lambda x: print('\n'.join(map(str, x)))
n = ini()
a = inl()
ans = [0] * n
for i in a:
ans[i-1] += 1
out(ans)
|
n = int(input())
a = list(map(int, input().split()))
sub_list = [0] * n
for i in (a):
sub_list[i - 1] += 1
for i in range(n):
print(sub_list[i], sep = ',')
| 1 | 32,675,520,718,688 | null | 169 | 169 |
#
import sys
input=sys.stdin.readline
def main():
N,M=map(int,input().split())
if N>=2 and M>=2:
print((N*(N-1))//2+(M*(M-1)//2))
elif N>=2:
print((N*(N-1))//2)
elif M>=2:
print((M*(M-1)//2))
else:
print(0)
if __name__=="__main__":
main()
|
import bisect,collections,copy,heapq,itertools,math,string
import sys
def S(): return sys.stdin.readline().rstrip()
def M(): return map(int,sys.stdin.readline().rstrip().split())
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())
n, m = M()
print(n*(n-1)//2 + m*(m-1)//2)
| 1 | 45,530,216,847,236 | null | 189 | 189 |
whxyr = input().split()
[w, h, x, y, r] = [int(x) for x in whxyr]
if 0 <= x - r and x + r <= w and 0 <= y - r and y + r <= h:
print("Yes")
else:
print("No")
|
#入力受け取り
N, K, C=map(int, input().split())
S='x'+input() #インデックスと日数を合わせるために先頭に'x'を追加
#前詰めな働き方の場合で働く日を求める
A=[] #前詰めで働く場合の働く日リスト
i=1 #1日目から判定スタート
while len(A)<K:
if S[i]=='o':
#i日目に働けるなら、リストにiを追加し、iをC+1だけ進める
A.append(i)
i+=(C+1)
else:
#i日目に働けないならその日は働けないので(小泉構文)、iに1足すのみ
i+=1
#後ろ詰めな働き方の場合で働く日を求める
B=[]
i=N #N日目から判定スタート
while len(B)<K:
if S[i]=='o':
#i日目に働けるなら、リストにiを追加し、iをC+1だけ戻す
B.append(i)
i-=(C+1)
else:
#i日目に働けないならその日は働けないので(小泉構文)、iから1引くのみ
i-=1
B=B[::-1] #Bは降順に追加されているので、昇順にする
for i in range(K):
#i番目に働くのが前詰めと後ろ詰めで同じ日であれば出力
if A[i]==B[i]:
print(A[i])
| 0 | null | 20,508,523,199,548 | 41 | 182 |
n,k=map(int,input().split())
lis=list(map(int,input().split()))
lis.sort()
ans=0
for i in lis:
if i<k:
ans+=1
else:
break
print(n-ans)
|
N,K = map(int,input().split())
height = list(map(int,input().split()))
chibi = [1] * N
for i in range (N):
if height[i] >= K:
chibi[i] = 0
print(N-sum(chibi))
| 1 | 178,329,706,884,350 | null | 298 | 298 |
A = list(map(int, input().split()))
ans = 'Yes' if (len(A) - 1) == len(set(A)) else 'No'
print(ans)
|
nums = tuple(map(int, input().split()))
s = set(nums)
if len(s) == 2:
print('Yes')
else:
print("No")
| 1 | 68,097,484,838,812 | null | 216 | 216 |
# encoding=utf-8
n = int(raw_input())
min = int(raw_input())
keep = int(raw_input())
diff = keep - min
if keep > min:
keep = min
n = n - 2
for i in range(n):
v = int(raw_input())
if v - keep > diff:
diff = v - keep
min = keep
elif keep > v:
keep = v
print diff
|
n = int(raw_input())
num_list = [int(raw_input()) for i in xrange(n)]
minv = num_list[0]
maxv = -1000000000
for i in xrange(1, n):
tmp = num_list[i] - minv
maxv = tmp if tmp > maxv else maxv
minv = num_list[i] if minv > num_list[i] else minv
# print "i = %d, tmp = %d, maxv = %d, minv = %d" % (i, tmp, maxv, minv)
print maxv
| 1 | 13,088,906,052 | null | 13 | 13 |
def GCD(a,b):
while (a % b) != 0:
a,b = b, a%b
return b
def LCM(a,b):
return a * b / GCD(a,b)
while True:
try:
a,b =map(int,raw_input().split())
print GCD(a,b),LCM(a,b)
except:
break
|
import sys
def gcd(a, b):
"?????§??¬?´???°????±???????"
if a < b:
c = a
a = b
b = c
if b == 0:
return a
else:
return gcd(b, a % b)
def lcm(a, b):
g = gcd(a, b)
return g * (a // g) * (b // g)
for line in sys.stdin:
a, b = map(int, line.split())
print("%d %d" % (gcd(a, b), lcm(a, b)))
| 1 | 631,660,188 | null | 5 | 5 |
A,B,C=[int(s) for s in input().split()]
X=int(input())
count=0
while A>=B:
B*=2
count+=1
while B>=C:
C*=2
count+=1
if count<=X:
print('Yes')
else:
print('No')
|
def upper(word):
Word = ''
str = list(word)
for i in range(len(str)):
if str[i].islower(): Word += str[i].upper()
else: Word += str[i]
return Word
key_word = str(upper(input()))
sen = []
count = 0
while True:
a = str(input())
if a == 'END_OF_TEXT': break
a = upper(a)
sen.extend(a.split())
for i in range(len(sen)):
if sen[i] == key_word:
count+= 1
print(count)
| 0 | null | 4,333,333,983,810 | 101 | 65 |
def colorchange(i,l,r,col):
k=i-1
while(k>=0):
if not '#' in G[k]:
for j in range(l+1,r+1):
A[k][j]=col
else:
break
k-=1
k=i+1
while(k<H):
if not '#' in G[k]:
for j in range(l+1,r+1):
A[k][j]=col
else:
break
k+=1
H,W,K=map(int,input().split())
G=[list(input()) for i in range(H)]
s=set()
A=[[-1]*W for i in range(H)]
now=1
for i in range(H):
if not '#' in G[i]:
continue
last=-1
first=True
for j in range(W):
if G[i][j]=='#' and j==0:
first=False
A[i][j]=now
if j==W-1:
colorchange(i,last,j,now)
now+=1
elif G[i][j+1]=='#':
if first:
first=False
else:
colorchange(i,last,j,now)
last=j
now+=1
for i in range(H):
print(*A[i])
|
import sys
from math import *
readline = sys.stdin.readline
def isPrime(x):
if x == 2 or x == 3:
return True
elif x % 2 == 0 or x % 3 == 0:
return False
s = ceil(sqrt(x))
for i in range(5, s + 1, 2):
if x % i == 0:
return False
return True
print(sum(isPrime(int(readline())) for _ in range(int(input()))))
| 0 | null | 72,115,537,793,660 | 277 | 12 |
x = int(input())
num = x // 100
sur = x % 100
if sur <= num * 5:
print(1)
else:
print(0)
|
f=n=0
while 1:
a=input()
if a.isdigit():
if n==1:s=s[int(a):]
n=1
else:
if f==1:print(s[:l])
if'-'==a:break
f=1
n=0
l=len(a)
s=a*100
| 0 | null | 64,783,210,843,232 | 266 | 66 |
A1, A2, A3 = [int(s) for s in input().split(' ')]
print('win' if A1+A2+A3 < 22 else 'bust')
|
import numpy as np
import scipy as sp
import math
a, b, c = map(int, input().split())
d = a + b + c
if(d<22):
print("win")
else:
print("bust")
| 1 | 119,008,316,433,660 | null | 260 | 260 |
# Nを１位上９以下の2つの整数の積として表せるならYes,できないならNo
N = int(input())
for i in range(1, 9+1):
if N%i == 0 and N//i <= 9:
print('Yes')
exit()
print('No')
|
n=int(input())
for i in range(9):
for j in range(9):
k = (i+1)*(j+1)
if n==k:
print('Yes')
exit()
else:
continue
print('No')
| 1 | 160,009,021,560,920 | null | 287 | 287 |
import math
a, b, h, m = map(int, input().split())
x = 6 * m
y = 30 * h + 0.5 * m
C = max(x, y) - min(x, y)
C = min(C, 360 - C)
print(math.sqrt(a**2 + b**2 - 2*a*b*math.cos(math.radians(C))))
|
from math import tan, pi, degrees
a, b, x = map(int, input().split())
def solve(isOK):
ng, ok = pi/2, 0
while abs(ok-ng) > 10**-12:
mid = (ng+ok) / 2
if isOK(mid):
ok = mid
else:
ng = mid
# print('ok:', ok)
print(degrees(ok))
def isOK1(theta):
return a*a*tan(theta)/2 + x/a <= a*b
def isOK2(theta):
return b*b/tan(theta)/2 >= x/a
if x/a >= a*b/2:
solve(isOK1)
else:
solve(isOK2)
| 0 | null | 91,938,250,222,432 | 144 | 289 |
# coding: utf-8
n = int(input())
A = list(map(int, input().split()))
mini = 1
c = 0
for i in range(n):
mini = i
for j in range(i, n):
if A[j] < A[mini]:
mini = j
A[i], A[mini] = A[mini], A[i]
if mini != i:
c += 1
print(" ".join(map(str, A)))
print(c)
|
M, N = input().split() # 2つ整数の読み取り
A=int(M)
B=N.replace(".","")
B=int(B)
C=A*B//100
print(C)
| 0 | null | 8,349,074,362,666 | 15 | 135 |
# ABC145 D
X,Y=map(int,input().split())
a,b=-1,-1
if not (2*X-Y)%3:
b=(2*X-Y)//3
if not (2*Y-X)%3:
a=(2*Y-X)//3
N=10**6
p=10**9+7
f,finv,inv=[0]*N,[0]*N,[0]*N
def nCr_init(L,p):
for i in range(L+1):
if i<=1:
f[i],finv[i],inv[i]=1,1,1
else:
f[i]=(f[i-1]*i)%p
inv[i]=(p-inv[p%i]*(p//i))%p
finv[i]=(finv[i-1]*inv[i])%p
def nCr(n,r,p):
if 0<=r<=n and 0<=n:
return (f[n]*finv[n-r]*finv[r])%p
else:
return 0
nCr_init(a+b+1,p)
if a>=0 and b>=0:
print(nCr(a+b,b,p))
else:
print(0)
|
mod=10**9+7
import math
import sys
from collections import deque
import heapq
import copy
import itertools
from itertools import permutations
from itertools import combinations
import bisect
def mi() : return map(int,sys.stdin.readline().split())
def ii() : return int(sys.stdin.readline().rstrip())
def i() : return sys.stdin.readline().rstrip()
a,b=mi()
if (a+b)%3!=0:
print(0)
sys.exit()
s=(a+b)//3
a-=s
b-=s
if a<0 or b<0:
print(0)
sys.exit()
fac=[1]*700000
for i in range(1,700000):
fac[i]=(fac[i-1]*i)%mod
m=a+b
n=min(a,b)
c=1
for j in range(m,m-n,-1):
c*=j
c=c%mod
print((c*pow(fac[n],mod-2,mod))%mod)
| 1 | 150,025,262,498,496 | null | 281 | 281 |
N, K, C = map(int, input().split())
S = [1 if a == "o" else 0 for a in input()]
c = 0
X = [0] * N
Y = [0] * N
i = 0
while i < N:
if S[i]:
c += 1
X[i] = 1
i += C + 1
else:
i += 1
if c > K:
exit()
i = N - 1
while i >= 0:
if S[i]:
Y[i] = 1
i -= C + 1
else:
i -= 1
for i in range(N):
if X[i] and Y[i]:
print(i + 1)
|
N = int(input())
S = str(input())
flag = False
half = (N+1) // 2
if S[:half] == S[half:N]:
flag = True
if flag:
print("Yes")
else:
print("No")
| 0 | null | 93,989,122,138,780 | 182 | 279 |
N, K = [int(s) for s in raw_input().split()]
ws = [int(raw_input()) for _ in xrange(N)]
lo, hi = max(ws) - 1, sum(ws)
while hi - lo > 1:
p = P = (lo + hi) / 2
k = 1
for w in ws:
if w > p:
p = P
k += 1
p -= w
if k <= K:
hi = P
else:
lo = P
print hi
|
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()
| 1 | 86,051,154,912 | null | 24 | 24 |
#!usr/bin/env python3
import sys
def init_card_deck():
# S: spades
# H: hearts
# C: clubs
# D: diamonds
card_deck = {'S': [], 'H': [], 'C': [], 'D': []}
n = int(sys.stdin.readline())
for i in range(n):
lst = [card for card in sys.stdin.readline().split()]
card_deck[lst[0]].append(lst[1])
return card_deck
def print_missing_cards(card_deck):
card_symbols = ['S', 'H', 'C', 'D']
for i in card_symbols:
for card in range(1, 14):
if not str(card) in card_deck[i]:
print(i, card)
def main():
print_missing_cards(init_card_deck())
if __name__ == '__main__':
main()
|
data = {
'S': [int(x) for x in range(1,14)],
'H': [int(x) for x in range(1,14)],
'C': [int(x) for x in range(1,14)],
'D': [int(x) for x in range(1,14)]
}
count = int(input())
for c in range(count):
(s, r) = input().split()
r = int(r)
del data[s][data[s].index(r)]
for i in ('S', 'H', 'C', 'D'):
for v in data[i]:
print(i, v)
| 1 | 1,028,302,935,070 | null | 54 | 54 |
S = input()
s1 = S[0:int((len(S)-1)/2)]
s2 = S[int((len(S)/2))+1:len(S)+1]
if S == S[::-1] and s1 == s1[::-1] and s2 == s2[::-1]:
print("Yes")
else:
print("No")
|
n = int(input())
hon = [2,4,5,7,9]
pon = [0,1,6,8]
num = n % 10
if num in hon:
print("hon")
elif num in pon:
print("pon")
elif num == 3:
print("bon")
| 0 | null | 32,681,498,332,788 | 190 | 142 |
while True:
try:
s=input().split(" ")
num=int(s[0])+int(s[1])
print(len(str(num)))
except:
break
|
import sys
if __name__ == "__main__":
for i in sys.stdin:
a,b = list(map(int,i.strip().split()))
print(len(str(a+b)))
| 1 | 94,265,280 | null | 3 | 3 |
N=int(input())
count=0
for i in range(1,10):
for j in range(1,10):
if N/i==j:
count+=1
else:
count=count
if count==0:
print("No")
else:
print("Yes")
|
def eighty_one(a):
for n in range(9, 0, -1):
if a % n == 0:
if a // n > 9:
return False
else:
return True
return False
n = int(input())
if eighty_one(n):
print('Yes')
else:
print('No')
| 1 | 159,436,279,411,308 | null | 287 | 287 |
M1,D1 = map(int,input().split())
M2,D2 = map(int,input().split())
if M1<M2:print(1)
else:print(0)
|
m1,d1 = (int(x) for x in input().split())
m2,d2 = (int(x) for x in input().split())
if d2==1:
print(1)
else:
print(0)
| 1 | 124,161,020,162,264 | null | 264 | 264 |
n = int(input())
a = n // 100
b = n % 100
check = a > 20 or b / 5 <= a
print("1" if check else "0")
|
X=int(input())
han=0
for a in range(1001):
if a * 100 > X:
break
for b in range(1001-a):
if a * 100 + b * 101 > X:
break
for c in range(1001-a-b):
if a * 100 + b * 101 + c * 102 > X:
break
for d in range(1001-a-b-c):
if a * 100 + b * 101 + c * 102 + 103 * d> X:
break
for e in range(1001-a-b-c-d):
if a * 100 + b * 101 + c * 102 + 103 * d + 104 * e>X:
break
for f in range(1001-a-b-c-d-e):
if a * 100 + b * 101 + c * 102 + 103 * d + 104 * e + 105 * f>X:
break
if a*100+b*101+c*102+103*d+104*e+105*f==X:
print("1")
han=1
exit()
if han==0:
print(0)
| 1 | 126,975,631,797,938 | null | 266 | 266 |
n,a,b=map(int,input().split())
c=max(a,b)
b=min(a,b)
a=c
MOD = pow(10,9) + 7
X=1
Y=1
for i in range(1,a+1):
X=X*(n+1-i)%MOD
Y=Y*i%MOD
if i==b:
b_X=X
b_Y=Y
a_X=X
a_Y=Y
def calc(X,Y,MOD):
return X*pow(Y,MOD-2,MOD)
ans=pow(2,n,MOD)%MOD-1-calc(a_X,a_Y,MOD)-calc(b_X,b_Y,MOD)
print(ans%MOD)
|
import math
n = input()
x = map(float, raw_input().split())
y = map(float, raw_input().split())
temp = p1 = p2 = p3 = pinf = 0
for i,j in zip(x, y):
temp = math.fabs(i - j)
p1 += temp
p2 += temp ** 2
p3 += temp ** 3
if temp > pinf:
pinf = temp
print u"%f\n%f\n%f\n%f" % (p1, p2**(1.0/2), p3**(1.0/3), pinf)
| 0 | null | 33,345,281,428,800 | 214 | 32 |
import itertools
n=int(input())
p=list(map(int,input().split()))
q=list(map(int,input().split()))
target= range(1,n+1)
p_len=0
q_len=0
for i,v in enumerate(itertools.permutations(target,n)):
tmp=list(v)
if p==tmp:
p_len=i
if q==tmp:
q_len=i
print(abs(p_len-q_len))
|
def resolve():
A, B = list(map(int, input().split()))
import math
for i in range(1, math.ceil(100/0.08)+1):
if math.floor(i*0.08) == A and math.floor(i*0.1) == B:
print(i)
return
print(-1)
if '__main__' == __name__:
resolve()
| 0 | null | 78,399,457,756,764 | 246 | 203 |
#!/usr/bin/env python3
import sys
import collections as cl
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
MOD = 998244353
def main():
N, K = MI()
kukan = []
for _ in range(K):
tmp = LI()
kukan.append(tmp)
dp = [0] * (N + 1)
dp[1] = 1
dp_sum = [0] * (N+1)
dp_sum[1] = 1
for i in range(N+1):
for k in range(K):
l, r = kukan[k]
pre_l = i - r
pre_r = i - l
if pre_r < 0:
continue
pre_l = max(pre_l, 0)
dp[i] += dp_sum[pre_r] - dp_sum[pre_l - 1]
dp_sum[i] = dp[i] + dp_sum[i-1]
dp_sum[i] %= MOD
dp[i] %= MOD
print(dp[-1])
main()
|
N,K=map(int,input().split())
S=[list(map(int,input().split())) for _ in range(K)]
NUM=998244353
dp=[0]*(N+1)
dp[1]=1
sums=[0]*(N+1)
sums[1]=1
for i in range(2,N+1):
for s in S:
_l,_r=i-s[0],i-s[1]-1
if _l<0:
continue
elif _r<0:
_r=0
dp[i]+=sums[_l]-sums[_r]
dp[i]%=NUM
sums[i]=dp[i]+sums[i-1]
sums[i]%=NUM
print(dp[N])
| 1 | 2,717,575,128,840 | null | 74 | 74 |
from itertools import product
def abc173c_h_and_v():
h, w, k = map(int, input().split())
c = [input() for _ in range(h)]
cnt = 0
for hp in product(range(2), repeat=h):
for wp in product(range(2), repeat=w):
a = [c[i][j] for j in range(w) if wp[j] == 1 for i in range(h) if hp[i] == 1]
if k == a.count('#'):
cnt += 1
print(cnt)
abc173c_h_and_v()
|
# -*- coding: utf-8 -*-
import sys
def main():
H,W,K = list(map(int, sys.stdin.readline().split()))
C_list = [list( sys.stdin.readline().rstrip() ) for _ in range(H)]
bit_H = 1 << H
bit_W = 1 << W
cnt_K = 0
for b_H in range(bit_H):
for b_W in range(bit_W):
cnt_black = 0
for row in range(H):
for col in range(W):
if (C_list[row][col] == "#") and ( b_H & (1 << row) ) and ( b_W & (1 << col) ):
cnt_black += 1
if cnt_black == K:
cnt_K += 1
print(cnt_K)
if __name__ == "__main__":
main()
| 1 | 8,941,336,223,468 | null | 110 | 110 |
a = 0
N = int(input())
for i in range(1, 10):
for j in range(1, 10):
if N == i*j:
print('Yes')
a = 1
if a == 1:
break
if a == 0:
print('No')
|
h,n = map(int,input().split())
arr=list(map(int,input().split()))
print("No" if h>sum(arr) else "Yes")
| 0 | null | 118,395,887,354,864 | 287 | 226 |
x = input().split()
for i in range(5):
if x[i] == '0':
print(i+1)
|
# from math import sqrt
# from heapq import heappush, heappop
# from collections import deque
from functools import reduce
# a, b = [int(v) for v in input().split()]
def main():
mod = 1000000007
n, k = map(int, input().split())
fact1 = [0] * (n + 1) # 1/P!
fact1[0] = 1
for i in range(1, n + 1):
fact1[i] = (fact1[i - 1] * i) % mod
fact2 = [0] * (n + 1) # P!
fact2[n] = pow(fact1[n], mod-2, mod)
for i in range(n, 0, -1):
fact2[i - 1] = (fact2[i] * i) % mod
def cmb2(n, r, mod):
if r < 0 or r > n:
return 0
return fact1[n] * fact2[n - r] * fact2[r] % mod
ans = 0
for i in range(min(n - 1, k) + 1):
ans += cmb2(n, i, mod) * cmb2(n - 1, i, mod)
ans %= mod
print(ans)
main()
| 0 | null | 40,273,988,403,968 | 126 | 215 |
from bisect import bisect_left
N,M = map(int, input().split())
A = list(map(int, input().split()))
A.sort()
# 一回の握手でとりうる最大の得点+1
hi = 2*10**5+1
lo = 0
# 一回の握手で得られる幸福度がmid以上になるような握手のみで、握手回数がM回を超えるか調べていく
while hi - lo > 1:
mid = (hi+lo)//2
# 左手の得点をaとしたときに一回の握手でmid点以上得られる握手の組み合わせの数
cnt_hs = 0
for a in A:
# 左手の得点がaのとき、midを超えるにはもう一方の右手でmid-x以上の点をとる必要がある
right = mid - a
idx = bisect_left(A, right)
# Aのうち、idxより先のものを選べばその握手の点がmidを超える
cnt_hs += N - idx
# mid以上の点を得られる握手の組み合わせの数がMを超えているな、必要以上に握手しているから、握手回数を減らす方向に調整
if cnt_hs >= M:
lo = mid
else:
hi = mid
# M回以上の握手するには一回の握手で何点とりましょう、という点の最低ラインloが求まった
B = sorted(A, reverse=True)
accum_B = [0]*N
accum_B[0] = B[0]
for i in range(1,N):
accum_B[i] = accum_B[i-1] + B[i]
ans = 0
cnt_hs = 0
for a in A:
# 一回の握手でlo点以上得るためにとるべき、右手の最低点
right = lo - a
# aを使った場合はlo点以上とれないならスキップ
if A[-1] < right:
continue
idx = bisect_left(A, right)
# aをN-idx回と、Aについてidxより先の部分の和の合計を得る
# sum(A[idx:])みたいにできなくもないけど毎回計算するより累積でやる方が効率いい
ans += a*(N-idx) + accum_B[N-1 - idx]
# lo点以上得られる握手回数を累計
cnt_hs += N-idx
# 設定回数以上握手している場合はその分減らす
# 一回の握手の最低点がloなので、一回オーバーするごとにlo減らす？
# とりうる握手の最低点はloだけど、この設定において実際の握手の最低点はloになっていて、本当にそれが複数あるのか？
if cnt_hs > M:
ans -= (cnt_hs - M) * lo
print(ans)
|
# Aizu - 0005
def De(a):
res = []
tmp = 2
while a != 1:
while not (a % tmp):
a = round(a / tmp)
res.append(tmp)
tmp += 1
return res
while True:
try:
tmp = input()
a = [int(i) for i in tmp.split(' ')]
except:
break
b = De(a[1])
a = De(a[0])
pa, pb = 0, 0
GCD, LCM = 1, 1
while True:
if pa == len(a):
for i in range(pb, len(b)):
LCM *= b[i]
break;
if pb == len(b):
for i in range(pa, len(a)):
LCM *= a[i]
break;
if a[pa] == b[pb]:
GCD *= a[pa]
LCM *= a[pa]
pa += 1
pb += 1
continue
if a[pa] < b[pb]:
LCM *= a[pa]
pa += 1
continue
if a[pa] > b[pb]:
LCM *= b[pb]
pb += 1
continue
print('%d %d'%(GCD, LCM))
| 0 | null | 54,255,198,248,760 | 252 | 5 |
N=int(input());S,T=map(str,input().split())
for i in range(N):print(S[i],end='');print(T[i],end='')
|
n = int(input())
a, b = map(list, input().split())
if len(a) == len(b):
for i in range(0, len(a)):
print(a[i] + b[i], end = "")
| 1 | 112,297,855,585,640 | null | 255 | 255 |
N,K = map(int, input().split())
p = N%K
print(min(p, abs(K-p)))
|
N,K=map(int,input().split())
m=N//K
print(min(abs(N-m*K),abs(N-(m+1)*K)))
| 1 | 39,318,469,345,570 | null | 180 | 180 |
import math
N, K = map(int, input().split())
A = list(map(float, input().split()))
min_A = 0
max_A = 10**10
while( max_A - min_A > 1):
now = (min_A + max_A) // 2
temp = 0
for i in A:
if i > now:
temp += (i // now)
if temp > K:
min_A = now
else:
max_A = now
print(int(min_A) + 1)
|
import sys
import math
def input():
return sys.stdin.readline().rstrip()
def main():
N, K = map(int, input().split())
A = list(map(int, input().split()))
ng = 0
ok = 10 ** 9 + 1
while ok - ng > 1:
mid = (ok + ng) // 2
ans = sum(list(map(lambda x: math.ceil(x / mid) - 1, A)))
# for i in range(N):
# ans += A[i]//mid -1
# if A[i]%mid !=0:
# ans +=1
if ans <= K:
ok = mid
else:
ng = mid
print(ok)
if __name__ == "__main__":
main()
| 1 | 6,519,797,830,530 | null | 99 | 99 |
n = int(input())
furui = [i for i in range(10**6+2)]
ans = 9999999999999
yakusuu = []
for i in range(1,int(n**0.5)+1+1):
if n%i == 0:
yakusuu.append(i)
for i in yakusuu:
ans = min(i+n//i,ans)
# print(i,ans)
print(ans-2)
|
#!/usr/bin/env python3
# Generated by https://github.com/kyuridenamida/atcoder-tools
from typing import *
import collections
import functools as fts
import itertools as its
import math
import sys
INF = float('inf')
def solve(N: int):
def manhattan_distance(x1, y1, x2, y2):
return abs(x1-x2) + abs(y1-y2)
return min(manhattan_distance(1, 1, i, N//i) for i in range(1, int(math.sqrt(N))+1) if N % i == 0)
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
print(f'{solve(N)}')
if __name__ == '__main__':
main()
| 1 | 161,596,114,321,356 | null | 288 | 288 |
# encoding: utf-8
def main():
n = input()
t = map(int, raw_input().split())
q = input()
s = map(int, raw_input().split())
sum = 0
for a in s:
sum += 1 if a in t else 0
print sum
main()
|
n = int(input())
S = [int(_) for _ in input().split()]
q = int(input())
T = [int(_) for _ in input().split()]
cnt = 0
for t in T:
if t in S:
cnt += 1
print(cnt)
| 1 | 66,235,152,958 | null | 22 | 22 |
k = int(input())
s = '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'
arr = [int(x) for x in s.split(', ')]
print(arr[k - 1])
|
import sys
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
A = [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 = ir()
print(A[K-1])
| 1 | 49,773,778,740,000 | null | 195 | 195 |
# ABC151
# A Next Alphabet
c = input()
l = [chr(ord("a")+i) for i in range(26)]
for i in range(26):
if l[i] == c:
print(l[i+1])
break
|
H,W=map(int,input().split())
if (H==1)|(W==1):
print(1)
elif (H%2==1)&(W%2==1):
print(int((H*W+1)/2))
else:
print(int(H*W/2))
| 0 | null | 71,431,184,710,912 | 239 | 196 |
x=int(input())
x=x+(x**2)+(x**3)
print(x)
|
a = int(input())
ans = a*(1+a*(1+a))
print(ans)
| 1 | 10,239,377,372,910 | null | 115 | 115 |
#!/usr/bin/env python3
import collections as cl
import sys
def II():
return int(sys.stdin.readline())
def MI():
return map(int, sys.stdin.readline().split())
def LI():
return list(map(int, sys.stdin.readline().split()))
MOD = 10 ** 9 + 7
def main():
N = II()
targets = LI()
colors = [0] * 3
ans = 1
for i in range(N):
count = 0
for k in range(3):
if colors[k] == targets[i]:
if count == 0:
colors[k] += 1
count += 1
ans *= count
ans %= MOD
print(ans)
main()
|
N = int(input())
A = list(map(int, input().split()))
MOD = 1000000007
cnt = [0,0,0] # 現在割り当てられている人数
ans = 1 # 現時点での組み合わせ
for a in A:
idx = []
for i in range(3):
if cnt[i] == a: # 割り当て可能
idx.append(i)
if len(idx)==0: # 割り当て不能
print(0)
exit()
cnt[idx[0]]+=1 # 任意の色で良いので、一番番号が若い色とする
ans *= len(idx) # 割り当て可能な人数をかける
ans %= MOD
print (ans)
| 1 | 129,590,554,873,090 | null | 268 | 268 |
#!/usr/bin/env python3
n, m = map(int, input().split())
d = m
r = d + 1
for i in range(m):
if d <= 0:
break
a = i + 1
b = a + d
print(a, b)
d -= 2
d = m - 1
for i in range(m):
if d <= 0:
break
a = r + i + 1
b = a + d
print(a, b)
d -= 2
|
j = []
for i in range(10) :
j.append(int(input()))
j.sort(reverse = True)
for k in range(3) :
print(j[k])
| 0 | null | 14,354,225,672,160 | 162 | 2 |
from math import factorial
N = int(input())
P = [int(x) for x in input().split()]
Q = [int(x) for x in input().split()]
orderP = 1 + (P[0]-1)*factorial(N-1)
orderQ = 1 + (Q[0]-1)*factorial(N-1)
for i in range(1,N):
redP = 0
redQ = 0
for j in range(i):
if P[j] < P[i]: redP += 1
if Q[j] < Q[i]: redQ += 1
orderP += (P[i]-redP-1)*factorial(N-i-1)
orderQ += (Q[i]-redQ-1)*factorial(N-i-1)
print(abs(orderP - orderQ))
|
#!/usr/bin python3
# -*- coding: utf-8 -*-
mod = 10**9+7
n = int(input())
ret = 0
ret += pow(10,n,mod)
ret -= 2 * pow(9,n,mod)
ret %= mod
ret += pow(8,n,mod)
ret %= mod
print(ret)
| 0 | null | 51,746,735,477,740 | 246 | 78 |
import numpy as np
from numpy.fft import rfft,irfft
N,M = map(int,input().split())
A = list(map(int,input().split()))
a = np.zeros(10**5+1)
for i in range(N):
a[A[i]] += 1
b = rfft(a,2*10**5+1)
b = irfft(b*b,2*10**5+1)
b = np.rint(b).astype(np.int64)
c = 0
ans = 0
for n in range(2*10**5,1,-1):
if c+b[n]<M:
c += b[n]
ans += b[n]*n
else:
ans += (M-c)*n
c = M
break
print(ans)
|
def gcd(a, b):
if a > b:
a, b = b, a
if a == 0:
return b
else:
return gcd(b % a, a)
try:
while 1:
a,b = list(map(int,input().split()))
c = gcd(a, b)
print('{} {}'.format(c,int(c * (a/c) * (b/c))))
except Exception:
pass
| 0 | null | 53,834,982,695,456 | 252 | 5 |
"""
AtCoder Beginner Contest 144 E - Gluttony
愚直解
・修行の順序は結果に影響しないから、修行を誰に割り振るか：N^K
・メンバーN人をどの問題に当てるか（N人の並べ方）：N!
-> N^K * N!
間に合わない。
完食にかかる時間のうち最大値がチーム全体の成績なので、
・消化コストAiを修行で下げる
・消化コストAiの大きい人に、食べにくさFiの小さい食べ物を割り当てる
のが良さそう
最大値の最小化、なので、二分探索が使えそうな気もする。
A,F <= 10^6
かかる時間を X 以下にできるか、を考える。
・消化コストが大きい人に、食べにくさが小さい問題を当てるようにする
・Ai * Fi > Xであれば、(Ai - m) * Fi <= X となるような最小のmをカウントする
全メンバーに対しこれを数え上げた時に、
mの合計 > K
であれば、X以下になるように修行することができない（K回までしか修行できず、回数が足りない）ので、最大値の最小はXより上
mの合計 <= K
であれば、X以下になるように修行できるので、最大値の最小はX以下
A*F <= 10^12 までなので、40~50程度繰り返せば行けそう
"""
import math
N,K = map(int, input().split())
A = list(map(int, input().split()))
F = list(map(int, input().split()))
if K >= sum(A):
print(0)
exit()
A.sort(reverse=True)
F.sort()
def is_ok(mid):
cnt = 0
for i in range(N):
if A[i] * F[i] <= mid:
continue
else:
cnt += math.ceil((A[i] * F[i] - mid) / F[i]) # A[i]が1減少するごとにF[i]減るのでF[i]で割る
return cnt <= K
# okは全員がX以下になる最小値に着地するので、A*F<=10**12 なので＋１して最大のケースにも対応する
ok = 10**12 + 1
# 0ではないことが上で保証されてるので、条件を満たさない最大値の0にしておく
ng = 0
while ok - ng > 1:
mid = (ok + ng) // 2
#print(ok,ng,mid)
if is_ok(mid):
ok = mid
else:
ng = mid
#print(ok,ng,mid)
print(ok)
|
A, B = [int(v) for v in input().rstrip().split()]
print(A * B)
| 0 | null | 90,403,179,750,490 | 290 | 133 |
N = int(input())
A = list(map(int, input().split()))
import numpy as np
A = np.array(A)
ans = np.argsort(A)
ans = list(str(a + 1) for a in ans)
ans = ' '.join(ans)
print(ans)
|
N=int(input())
A=list(map(int,input().split()))
if A[0]:
if N==0 and A[0]==1:
print(1)
else:
print(-1)
exit()
B=[0 for _ in range(N)]
B.append(A[-1])
for i in range(N)[::-1]:
B[i]=B[i+1]+A[i]
r=1
ans=1
for i in range(1,N+1):
t=min(r*2,B[i])
ans+=t
r=t-A[i]
if r<0:
print(-1)
exit()
print(ans)
| 0 | null | 99,394,282,503,850 | 299 | 141 |
def merge_sort(A):
if len(A) <= 1:
return A, 0
mid = len(A) // 2
left, lcount = merge_sort(A[:mid])
right, rcount = merge_sort(A[mid:])
merged, count = merge(left, right)
return merged, lcount + rcount + count
def merge(left, right):
lpos = 0
rpos = 0
#lcount = 0
#rcount = 0
merged = []
while lpos < len(left) and rpos < len(right):
if left[lpos] <= right[rpos]:
merged.append(left[lpos])
lpos += 1
#lcount += 1
else:
merged.append(right[rpos])
rpos += 1
#rcount += 1
if left[lpos:]:
merged.extend(left[lpos:])
#lcount += len(left[lpos:])
if right[rpos:]:
merged.extend(right[rpos:])
#rcount += len(right[rpos:])
#print merged
#return merged, lcount + rcount
return merged, len(merged)
if __name__ == '__main__':
n = int(raw_input())
A = map(long, raw_input().split())
sorted, count = merge_sort(A)
print ' '.join(str(x) for x in sorted)
print count
|
while 1:
x=raw_input()
if x=='0':break
sum=0
for i in x:
sum+=int(i)
print sum
| 0 | null | 830,594,495,138 | 26 | 62 |
N = input()
result = int(N) ** 3
print(result)
|
n = int(input())
a = (10**n) % (10**9+7)
b = (9**n) % (10**9+7)
c = (8**n) % (10**9+7)
print((a-2*b+c) % (10**9+7))
| 0 | null | 1,703,040,099,698 | 35 | 78 |
class SegmentTree():
"""一点更新、区間取得クエリをそれぞれO(logN)で答えるデータ構造を構築する。
built(array) := arrayを初期値とするセグメント木を構築する O(N)。
update(i, val) := i番目の要素をvalに変更する。
get_val(l, r) := 区間[l, r)に対する二項演算の畳み込みの結果を返す。
"""
def __init__(self, n, op, e):
"""要素数、二項演算、単位元を引数として渡す
例) 区間最小値 SegmentTree(n, min, 10 ** 18)
区間和 SegmentTree(n, lambda a, b : a + b, 0)
"""
self.n = n
self.op = op
self.e = e
self.size = 2 ** ((n - 1).bit_length())
self.node = [self.e] * (2 * self.size)
def build(self, array):
"""arrayを初期値とするセグメント木を構築する"""
for i in range(self.n):
self.node[self.size + i] = array[i]
for i in range(self.size - 1, 0, -1):
self.node[i] = self.op(self.node[i << 1], self.node[(i << 1) + 1])
def update(self, i, val):
"""i番目の要素をvalに変更する"""
i += self.size
self.node[i] = val
while i > 1:
i >>= 1
self.node[i] = self.op(self.node[i << 1], self.node[(i << 1) + 1])
def get_val(self, l, r):
"""[l, r)の畳み込みの結果を返す"""
l, r = l + self.size, r + self.size
res_l, res_r = self.e, self.e
while l < r:
if l & 1:
res_l = self.op(res_l, self.node[l])
l += 1
if r & 1:
r -= 1
res_r = self.op(self.node[r], res_r)
l, r = l >> 1, r >> 1
return self.op(res_l, res_r)
ALPH = "abcdefghijklmnopqrstuvwxyz"
to_int = {char: i for i, char in enumerate(ALPH)}
n = int(input())
s = input()
q = int(input())
query = [list(input().split()) for i in range(q)]
init = [0] * n
for i, char in enumerate(s):
init[i] = 1 << to_int[char]
op = lambda a, b: a | b
st = SegmentTree(n, op, 0)
st.build(init)
for i in range(q):
if query[i][0] == "1":
_, ind, char = query[i]
ind = int(ind) - 1
st.update(ind, 1 << to_int[char])
else:
_, l, r = query[i]
l, r = int(l) - 1, int(r)
print(bin(st.get_val(l, r)).count("1"))
|
import sys
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split())) #空白あり
N = I()
a = LI()
b = 0
for i in range(N):
b ^= a[i]
print(*[b^a[i] for i in range(N)])
| 0 | null | 37,621,555,834,380 | 210 | 123 |
def resolve():
# 十進数表記で1~9までの数字がK個入るN桁の数字の数を答える問題
S = input()
K = int(input())
n = len(S)
# dp[i][k][smaller]:
# i:桁数
# K:0以外の数字を使った回数
# smaller:iまでの桁で値以上になっていないかのフラグ
dp = [[[0] * 2 for _ in range(4)] for _ in range(105)]
dp[0][0][0] = 1
for i in range(n):
for j in range(4):
for k in range(2):
nd = int(S[i])
for d in range(10):
ni = i+1
nj = j
nk = k
if d != 0:
nj += 1
if nj > K:
continue
if k == 0:
if d > nd: # 値を超えている
continue
if d < nd:
nk += 1
dp[ni][nj][nk] += dp[i][j][k]
ans = dp[n][K][0] + dp[n][K][1]
print(ans)
if __name__ == "__main__":
resolve()
|
import sys
sys.setrecursionlimit(10 ** 8)
ini = lambda: int(sys.stdin.readline())
inm = lambda: map(int, sys.stdin.readline().split())
inl = lambda: list(inm())
ins = lambda: sys.stdin.readline().rstrip()
debug = lambda *a, **kw: print("\033[33m", *a, "\033[0m", **dict(file=sys.stderr, **kw))
N = ins()
K = ini()
def solve():
M = len(N)
dp_eq = [[0 for _ in range(K + 1)] for _ in range(M)]
dp_less = [[0 for _ in range(K + 1)] for _ in range(M)]
dp_eq[0][K - 1] = 1
dp_less[0][K] = 1
dp_less[0][K - 1] = ord(N[0]) - ord("0") - 1
for i in range(1, M):
is_zero = N[i] == "0"
for k in range(K + 1):
if is_zero:
dp_eq[i][k] = dp_eq[i - 1][k]
elif k < K:
dp_eq[i][k] = dp_eq[i - 1][k + 1]
dp_less[i][k] = dp_less[i - 1][k]
if k < K:
dp_less[i][k] += dp_less[i - 1][k + 1] * 9
if not is_zero:
dp_less[i][k] += dp_eq[i - 1][k]
if k < K:
dp_less[i][k] += dp_eq[i - 1][k + 1] * (ord(N[i]) - ord("0") - 1)
return dp_eq[M - 1][0] + dp_less[M - 1][0]
print(solve())
| 1 | 76,283,538,072,852 | null | 224 | 224 |
import sys
while True:
n, x = [ int( val ) for val in sys.stdin.readline().split( " " ) ]
if 0 == n and 0 == x:
break
cnt = 0
goto = False
for i in range( 1, n-1 ):
if x < 3*(i+1):
break
for j in range( i+1, n ):
if x <= ( i+j ):
break
for k in range( j+1, n+1 ):
s = ( i + j + k )
if x == s:
cnt += 1
break
elif x < s:
goto = True
break
goto = False
print( cnt )
|
import bisect
import collections
N,K=map(int,input().split())
A=list(map(int,input().split()))
A.insert(0,0)
cuml=[0]*(N+1)
cuml[0]=A[0]
l=[]
cuml2=[]
l2=[]
buf=[]
ans=0
for i in range(N):
cuml[i+1]=cuml[i]+A[i+1]
#print(cuml)
for i in range(N+1):
cuml2.append([(cuml[i]-i)%K,i])
cuml[i]=(cuml[i]-i)%K
#print(cuml2,cuml)
cuml2.sort(key=lambda x:x[0])
piv=cuml2[0][0]
buf=[]
for i in range(N+1):
if piv!=cuml2[i][0]:
l2.append(buf)
piv=cuml2[i][0]
buf=[]
buf.append(cuml2[i][1])
l2.append(buf)
#print(l2)
cnt=0
for i in range(len(l2)):
for j in range(len(l2[i])):
num=l2[i][j]
id=bisect.bisect_left(l2[i], num + K)
#print(j,id)
cnt=cnt+(id-j-1)
print(cnt)
| 0 | null | 69,186,470,861,552 | 58 | 273 |
def showList(A, N):
for i in range(N-1):
print(A[i],end=' ')
print(A[N-1])
def selectionSort(A, N):
"""
選択ソート
O(n^2)のアルゴリズム
"""
count = 0
for i in range(N):
minj = i
for j in range(i,N):
if A[j] < A[minj]:
minj = j
if minj != i:
t = A[minj]
A[minj] = A[i]
A[i] = t
count += 1
showList(A, N)
print(count)
N = int(input())
A = [int(x) for x in input().split(' ')]
selectionSort(A, N)
|
# -*- coding: utf-8 -*-
import sys
import os
import math
N = int(input())
A = list(map(int, input().split()))
def selection_sort(A):
swap_num = 0
for i in range(N):
min_i = i
for j in range(i + 1, N):
if A[j] < A[min_i]:
min_i = j
if i != min_i:
A[i], A[min_i] = A[min_i], A[i]
swap_num += 1
print(*A)
print(swap_num)
selection_sort(A)
| 1 | 22,584,417,100 | null | 15 | 15 |
def resolve():
S = input()
T = input()
cnt = 0
for i in range(len(S)):
s = S[i]
t = T[i]
if s != t:
cnt += 1
print(cnt)
resolve()
|
# -*- coding: utf-8 -*-
S = input()
ans = 0
for i in range(len(S)):
if S[i] == "R":
if ans == 0:
ans += 1
else:
if i > 0 and S[i] == S[i-1] == "R":
ans += 1
print(ans)
| 0 | null | 7,663,577,702,510 | 116 | 90 |
def main():
n,k = map(int,input().split())
mod = 10**9+7
ans = 0
for i in range(k,n+2):
ans += (i*(n-i+1)+1) % mod
ans = ans % mod
print(ans)
if __name__ == "__main__":
main()
|
import bisect,collections,copy,itertools,math,string
import sys
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())
def main():
n, k = LI()
N = 10**9+7
ans = 0
start = sum([i for i in range(0,k-1)])
goal = sum([i for i in range(n,n-k+1,-1)])
for i, j in zip(range(k-1,n+1), range(n-k+1,-1,-1)):
start += i
goal += j
cnt = (goal-start+1)%N
ans += cnt
ans %= N
print(ans)
main()
| 1 | 33,163,282,644,000 | null | 170 | 170 |
import sys
def solve():
a, b = map(int, input().split())
ans = gcd(a, b)
print(ans)
def gcd(a, b):
return gcd(b, a % b) if b else a
if __name__ == '__main__':
solve()
|
class SegmentTree():
def __init__(self,n):
self.e = 0
self.r = 0 #ノードの段数
cnt = 0
while cnt<n:
cnt=2**self.r
self.r +=1
self.tree = [self.e]*(2**self.r -1)# 0-index
self.n = 2**(self.r-1) #一番下のnodeの数
def func(self,a,b): #適宜書き換え
return a|b
def update(self,i,val):
i += self.n -1
self.tree[i] = val
while i>0:
i = (i-1)//2
self.tree[i] = self.func(self.tree[i*2+1],self.tree[i*2+2])
def query(self,l,r):
l += self.n -1
r += self.n -1 #開区間 idxはr-1
lval = self.e
rval = self.e
while r>l:
if l%2 == 0:
lval = self.func(lval,self.tree[l])
l+=1
if r%2==0:
rval = self.func(rval,self.tree[r-1])
r-=1
r//=2
l//=2
return self.func(lval,rval)
def index(self,i):
return i+self.n -1
def sid(s):
return ord(s)-ord("a") #chr("a") == 0
import sys
input = sys.stdin.readline
n = int(input())
S = input()[:-1]
Q = int(input())
seg = SegmentTree(n)
for i in range(n):
s = S[i]
seg.update(i,2**(sid(s)))
for q in range(Q):
num,a,b = input().split()
if num=="1":
seg.update(int(a)-1,2**sid(b))
#print(a,b,list(map(lambda x:bin(x)[2:],seg.tree)))
else:
print(bin(seg.query(int(a)-1,int(b))).count("1"))
| 0 | null | 31,168,065,315,270 | 11 | 210 |
from math import atan,pi
a,b,x=map(int,input().split())
if b-x/a**2 <= x/a**2:print(atan((b-x/a**2)/(a/2))*(180/pi))
else:
y = x/a*2/b
print(atan(b/y)*(180/pi))
|
N,K=map(int,input().split())
R,S,P=map(int,input().split())
T =input()
com = [0]*N
for i in range(N):
if i>=K and T[i]==T[i-K] and com[i-K]!=0:
continue
elif T[i] =="r":
com[i] =P
elif T[i] =="s":
com[i] =R
else:
com[i] =S
print(sum(com))
| 0 | null | 135,254,645,734,402 | 289 | 251 |
N,K = map(int,input().split())
LR = []
for _ in range(K): LR.append(list(map(int,input().split())))
MOD = 998244353
dp = [0]*(N+1)
dp[0] = 1
for i in range(N):
for L,R in LR:
if i+L<N: dp[i+L] += dp[i]
if i+R+1<N: dp[i+R+1] -= dp[i]
if i>0: dp[i+1] = (dp[i+1]+dp[i])%MOD
print(dp[-1])
|
import sys
input = sys.stdin.readline
N,K = map(int,input().split())
MOD = 998244353
dp = [0 for _ in range(N+1)]
dp[1] = 1
R = [tuple(map(int,input().split())) for _ in range(K)]
S = [0 for _ in range(K)]
for i in range(2, N+1):
s = 0
for k in range(K):
S[k] += dp[max(0, i - R[k][0])] - dp[max(0, i - R[k][1] - 1)]
S[k] %= MOD
s = (s + S[k]) % MOD
dp[i] = s
print(dp[N])
| 1 | 2,668,952,935,840 | null | 74 | 74 |
x, n = map(int, input().split())
if n == 0:
print(x)
else:
a = [int(x) for x in input().split()]
ans1 = x
while ans1 in a :
ans1 -= 1
ans2 = x
while ans2 in a :
ans2 += 1
if abs(x - ans1) <= abs(x - ans2):
print(ans1)
else:
print(ans2)
|
num = input()
L = []
house = []
for i in range(int(num)):
k = input().split()
k[0] = int(k[0])
k[1] = int(k[1])
k[2] = int(k[2])
k[3] = int(k[3])
L.append(k)
for i in range(3):
a = ["","0","0","0","0","0","0","0","0","0","0"]
b = ["","0","0","0","0","0","0","0","0","0","0"]
c = ["","0","0","0","0","0","0","0","0","0","0"]
d = ["#"*20]
house.append([a,b,c,d])
a = ["","0","0","0","0","0","0","0","0","0","0"]
b = ["","0","0","0","0","0","0","0","0","0","0"]
c = ["","0","0","0","0","0","0","0","0","0","0"]
house.append([a,b,c])
for i in L:
house[i[0]-1][i[1]-1][i[2]] = str(int(house[i[0]-1][i[1]-1][i[2]])+i[3])
for i in house:
for j in i:
k = " ".join(j)
print(k)
| 0 | null | 7,573,403,117,034 | 128 | 55 |
import fractions
A,B=map(int,input().split())
def lcm(x,y):
return int((x*y)/fractions.gcd(x,y))
print(lcm(A,B))
|
def merge(a, left, mid, right):
INF = int(1e+11)
l = a[left:mid]
r = a[mid:right]
l.append(INF)
r.append(INF)
i = 0
j = 0
ans = 0
for k in range(left, right):
ans += 1
if l[i] <= r[j]:
a[k] = l[i]
i += 1
else:
a[k] = r[j]
j += 1
return ans
def merge_sort(a, left, right):
ans = 0
if left + 1 < right:
mid = (left + right) // 2
ans += merge_sort(a, left, mid)
ans += merge_sort(a, mid, right)
ans += merge(a, left, mid, right)
return ans
def print_list_split_whitespace(s):
for x in s[:-1]:
print(x, end=" ")
print(s[-1])
n = int(input())
s = [int(x) for x in input().split()]
ans = merge_sort(s, 0, len(s))
print_list_split_whitespace(s)
print(ans)
| 0 | null | 56,507,822,307,092 | 256 | 26 |
H = int(input())
W = int(input())
N = int(input())
a = max(H, W)
print(N // a + min(1, N % a))
|
from collections import deque
n,m = map(int,input().split())
g = [[] for _ in range(n)]
for i in range(m):
a,b = map(lambda x:int(x)-1,input().split())
g[a].append(b)
g[b].append(a)
to = {}
dist = [-1 for _ in range(n)]
dist[0] = 0
q = deque()
q.append(0)
while (len(q) > 0):
v = q.popleft()
for nv in g[v]:
if (dist[nv] != -1):continue
dist[nv] = dist[v] + 1
q.append(nv)
to[nv] = v
print('Yes')
for i in range(1,n):
print(to[i]+1)
| 0 | null | 54,610,359,274,746 | 236 | 145 |
n,m=map(int,input().split())
if(n>m):
print("safe")
else:
print("unsafe")
|
#!/usr/bin/env python3
def solve(S: int, W: int):
if W >= S:
return "unsafe"
return "safe"
def main():
S, W = map(int, input().split())
answer = solve(S, W)
print(answer)
if __name__ == "__main__":
main()
| 1 | 29,288,229,001,592 | null | 163 | 163 |
n = input()
data = [int(i) for i in input().split(' ')]
def insertion_sort(raw_list):
for i, v in enumerate(raw_list):
if i == 0:
continue
j = i - 1
while j >= 0 and v < raw_list[j]:
raw_list[j+1] = v
raw_list[j+1] = raw_list[j]
j -= 1
raw_list[j+1] = v
print(' '.join([str(i) for i in raw_list]))
return raw_list
print(' '.join([str(i) for i in data]))
insertion_sort(data)
#print(' '.join([str(i) for i in insertion_sort(data)]))
|
n = int(input())
a = input()
print(a)
a = [int(x) for x in a.split(' ')]
for i in range(1, n):
v = a[i]
j = i - 1
while j >= 0 and a[j] > v:
a[j + 1] = a[j]
j -= 1
a[j + 1] = v
print(' '.join([str(x) for x in a]))
| 1 | 5,239,077,474 | null | 10 | 10 |
n = int(input())
a_ = [int(i) for i in input().split()]
a = [[a_[i], i+1] for i in range(n)]
a.sort(reverse=True)
dp = [[0 for i in range(n+1)] for j in range(n+1)]
x_plus_y = 0
ans = 0
for i in range(n):
if x_plus_y == 0:
dp[0][1] = a[i][0] * abs((n - a[i][1]))
dp[1][0] = a[i][0] * abs((a[i][1] - 1))
else:
for x in range(x_plus_y + 1):
y = x_plus_y - x
dp[x][y+1] = max(dp[x][y+1], a[i][0] * abs((n - y) - a[i][1]) + dp[x][y])
dp[x+1][y] = max(dp[x+1][y] , a[i][0] * abs((a[i][1] - (1+x))) + dp[x][y])
if x_plus_y == n-1:
ans = max(ans, dp[x][y+1], dp[x+1][y])
x_plus_y += 1
print(ans)
|
#active infants
n=int(input())
lists=list(map(int,input().split()))
data=[]
for i in range(n):
data.append((lists[i],i+1))
data=sorted(data,key=lambda x:-x[0])
#dp[K][i]=始めのKつまで考えてそのうちプラスの個数がiこの方法で最大のあたい(0<=i<=K)
#求める値はmax(dp[N][i] for i in range(N+1))で与えられる
#dp[N][N]まで考えればいい
#計算量0(N**2)
dp=[[0 for i in range(n+1)] for j in range(n+1)]
dp[1][1]=n*(data[0][0])-data[0][0]*data[0][1]
dp[1][0]=data[0][0]*data[0][1]-data[0][0]
for i in range(2,n+1):
#dp[i]について考える
for j in range(i+1):
x=data[i-1][0]
y=data[i-1][1]
#j=0,1,,,,,iまで
#dp[i][j]-> 直前は i-1,j-1, or i-1 j のどちらか
if i>j>=1:
dp[i][j]=max(dp[i-1][j-1]+x*(n+1-j)-x*y,dp[i-1][j]-(i-j)*x+x*y)
elif j==0:
dp[i][j]=dp[i-1][0]-i*x+x*y
elif j==i:
dp[i][j]=dp[i-1][i-1]+x*(n+1-j)-x*y
K=0
for i in range(n+1):
K=max(K,dp[n][i])
print(K)
| 1 | 33,544,680,363,570 | null | 171 | 171 |
n = int(input())
h = [[] for _ in range(n)]
u = [[] for _ in range(n)]
for i in range(n):
a = int(input())
for _ in range(a):
x, y = map(int, input().split())
if y == 1:
h[i].append(x)
elif y == 0:
u[i].append(x)
ans = 0
for i in range(2**n):
hs, us = set(), set()
honest, unkind = set(), set()
for j in range(n):
if i & (1 << j):
hs |= set(h[j])
us |= set(u[j])
honest.add(j+1)
else:
unkind.add(j+1)
if not hs <= honest:
continue
if not us <= unkind:
continue
ans = max(ans, len(honest))
print(ans)
|
# -*- coding: utf-8 -*-
N = int(input())
A = []
data = []
for i in range(N):
a = int(input())
A.append(a)
x = [list(map(int, input().split())) for _ in range(a)]
data.append(x)
ans = 0
for i in range(1<<N):
bit = [0] * N
cnt = 0
for j in range(N):
div = 1 << j
bit[j] = (i // div) % 2
if bit[j] == 1:
cnt += 1
flag = True
for j in range(N):
if bit[j] == 0:
continue
for a in range(A[j]):
x = data[j][a]
if bit[x[0]-1] != x[1]:
flag = False
break
if not flag:
break
if flag:
ans = max(ans, cnt)
print(ans)
| 1 | 121,466,607,750,990 | null | 262 | 262 |
import sys
import math
import copy
import heapq
from functools import cmp_to_key
from bisect import bisect_left, bisect_right
from collections import defaultdict, deque, Counter
sys.setrecursionlimit(1000000)
# input aliases
input = sys.stdin.readline
getS = lambda: input().strip()
getN = lambda: int(input())
getList = lambda: list(map(int, input().split()))
getZList = lambda: [int(x) - 1 for x in input().split()]
INF = float("inf")
MOD = 10**9 + 7
divide = lambda x: pow(x, MOD-2, MOD)
def nck(n, k, kaijyo):
return (npk(n, k, kaijyo) * divide(kaijyo[k])) % MOD
def npk(n, k, kaijyo):
if k == 0 or k == n:
return n % MOD
return (kaijyo[n] * divide(kaijyo[n-k])) % MOD
def fact_and_inv(SIZE):
inv = [0] * SIZE # inv[j] = j^{-1} mod MOD
fac = [0] * SIZE # fac[j] = j! mod MOD
finv = [0] * SIZE # finv[j] = (j!)^{-1} mod MOD
inv[1] = 1
fac[0] = fac[1] = 1
finv[0] = finv[1] = 1
for i in range(2, SIZE):
inv[i] = MOD - (MOD // i) * inv[MOD % i] % MOD
fac[i] = fac[i - 1] * i % MOD
finv[i] = finv[i - 1] * inv[i] % MOD
return fac, finv
def renritsu(A, Y):
# example 2x + y = 3, x + 3y = 4
# A = [[2,1], [1,3]])
# Y = [[3],[4]] または [3,4]
A = np.matrix(A)
Y = np.matrix(Y)
Y = np.reshape(Y, (-1, 1))
X = np.linalg.solve(A, Y)
# [1.0, 1.0]
return X.flatten().tolist()[0]
class TwoDimGrid:
# 2次元座標 -> 1次元
def __init__(self, h, w, wall="o"):
self.h = h
self.w = w
self.size = (h+2) * (w+2)
self.wall = wall
self.get_grid()
self.init_cost()
def get_grid(self):
grid = [self.wall * (self.w + 2)]
for i in range(self.h):
grid.append(self.wall + getS() + self.wall)
grid.append(self.wall * (self.w + 2))
self.grid = grid
def init_cost(self):
self.cost = [INF] * self.size
def pos(self, x, y):
# 壁も含めて0-indexed 元々の座標だけ考えると1-indexed
return y * (self.w + 2) + x
def getgrid(self, x, y):
return self.grid[y][x]
def get(self, x, y):
return self.cost[self.pos(x, y)]
def set(self, x, y, v):
self.cost[self.pos(x, y)] = v
return
def show(self):
for i in range(self.h+2):
print(self.cost[(self.w + 2) * i:(self.w + 2) * (i+1)])
def showsome(self, tgt):
for t in tgt:
print(t)
return
def showsomejoin(self, tgt):
for t in tgt:
print("".join(t))
return
def search(self):
grid = self.grid
move = [(0, 1), (0, -1), (1, 0), (-1, 0)]
move_eight = [(0, 1), (0, -1), (1, 0), (-1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
d = deque()
d.append((1,1))
self.set(1,1,0)
while(d):
cx, cy = d.popleft()
cc = self.get(cx, cy)
if self.getgrid(cx, cy) == self.wall:
continue
for dx, dy in [(1, 0), (0, 1)]:
nx, ny = cx + dx, cy + dy
if self.getgrid(cx, cy) == self.getgrid(nx, ny):
if self.get(nx, ny) > cc:
d.append((nx, ny))
self.set(nx, ny, cc)
else:
if self.get(nx, ny) > cc + 1:
d.append((nx, ny))
self.set(nx, ny, cc + 1)
# self.show()
ans = (self.get(self.w, self.h))
if self.getgrid(1,1) == "#":
ans += 1
print((ans + 1) // 2)
def soinsu(n):
ret = defaultdict(int)
for i in range(2, int(math.sqrt(n) + 2)):
if n % i == 0:
while True:
if n % i == 0:
ret[i] += 1
n //= i
else:
break
if not ret:
return {n: 1}
return ret
def solve():
h, w = getList()
G = TwoDimGrid(h, w)
G.search()
def main():
n = getN()
for _ in range(n):
solve()
return
if __name__ == "__main__":
# main()
solve()
|
X= raw_input().split()
if float(X[2]) + float(X[4]) <= float(X[0])and float(X[2]) - float(X[4]) >= 0 and float(X[3]) + float(X[4]) <= float(X[1]) and float(X[3]) - float(X[4]) >= 0:
print "Yes"
else:
print "No"
| 0 | null | 24,896,630,638,500 | 194 | 41 |
class Doubling():
def __init__(self,N,log_k,perm):
"""
与えられた順列のダブリング配列を作成する.
Parameters
----------
N : int
順列の数
log_k : int
最大移動回数の対数(切り上げ)
perm : [int]
1-indexed の順列が格納されたリスト
"""
self.N = N
self.log_k = log_k
self.doubling = [[0]*(self.N+1) for _ in range(log_k)]
for i in range(1,self.N+1):
self.doubling[0][i] = perm[i]
for j in range(1,self.log_k):
for i in range(1,self.N+1):
prev = self.doubling[j-1][i]
self.doubling[j][i] = self.doubling[j-1][prev]
def query(self,pos,k):
"""
位置iからk回移動したときの移動先を計算する.
Parameters
----------
pos : int
移動元の位置
k : int
移動回数(1<=k<=2^(log_k+1)-1)
Returns
----------
dest : int
移動先の位置
"""
for i in range(self.log_k):
if k & (1<<i) == 0:continue
pos = self.doubling[i][pos]
dest = pos
return dest
def main():
n,k = tuple([int(t)for t in input().split()])
a = [int(t) for t in input().split()]
a.insert(0,0)
log_k = k.bit_length()+1
doubling = Doubling(n,log_k,a)
print(doubling.query(1,k))
if __name__ == "__main__":
main()
|
from collections import defaultdict
N,K = map(int,input().split())
N_List = list(map(int,input().split()))
N_Dict = defaultdict(int)
N_Dict[1] = 1
Pos = N_List[0]
for i in range(N):
N_Dict[Pos] += 1
if N_Dict[Pos] == 2:
break
else:
Pos = N_List[Pos - 1]
##ループ始点がPosに入っている状態
##ループがどのくらいの長さか知りたい
CPos = Pos
flg = 0
Loop_List = [CPos]
while flg == 0:
CPos = N_List[CPos-1]
if CPos != Pos:
Loop_List.append(CPos)
else:
flg = 1
##ループの始点に至るまでの長さを求める
FL = len(N_Dict) - len(Loop_List)
if FL <= K:
ans = Loop_List[(K - FL) % len(Loop_List)]
else:
ans =list(N_Dict.keys())[K]
print(ans)
| 1 | 22,640,477,479,620 | null | 150 | 150 |
a,b,m = map(int,input().split())
A = list(map(int,input().split()))
B = list(map(int,input().split()))
ret = 2**60
for _ in range(m):
x,y,c = map(int,input().split())
x -= 1
y -= 1
ret = min(ret, A[x]+B[y]-c)
print( min(ret, min(A)+min(B)) )
|
a,b,m=map(int,input().split())
al=list(map(int,input().split()))
bl=list(map(int,input().split()))
xyc=[list(map(int,input().split())) for _ in range(m)]
ans=min(al)+min(bl)
for i in range(m):
tmp=0
tmp=al[xyc[i][0]-1]+bl[xyc[i][1]-1]-xyc[i][2]
ans=min(ans,tmp)
print(ans)
| 1 | 53,978,534,142,368 | null | 200 | 200 |
# https://atcoder.jp/contests/abc145/tasks/abc145_d
class Combination: # 計算量は O(n_max + log(mod))
def __init__(self, n_max, mod=10**9+7):
self.mod = mod
f = 1
self.fac = fac = [f]
for i in range(1, n_max+1): # 階乗(= n_max !)の逆元を生成
f = f * i % mod # 動的計画法による階乗の高速計算
fac.append(f) # fac は階乗のリスト
f = pow(f, mod-2, mod) # 階乗から階乗の逆元を計算。フェルマーの小定理より、 a^-1 = a^(p-2) (mod p) if p = prime number and p and a are coprime
# python の pow 関数は自動的に mod の下での高速累乗を行ってくれる
self.facinv = facinv = [f]
for i in range(n_max, 0, -1): # 上記の階乗の逆元から階乗の逆元のリストを生成（＝ facinv ）
f = f * i % mod
facinv.append(f)
facinv.reverse()
# "n 要素" は区別できる n 要素
# "k グループ" はちょうど k グループ
def __call__(self, n, r): # self.C と同じ
return self.fac[n] * self.facinv[r] % self.mod * self.facinv[n-r] % self.mod
def C(self, n, r):
if not 0 <= r <= n: return 0
return self.fac[n] * self.facinv[r] % self.mod * self.facinv[n-r] % self.mod
X, Y = map(int, input().split())
if (2*Y- X) % 3 or (2*X- Y) % 3:
print(0)
exit()
x = (2*Y - X) // 3
y = (2*X - Y) // 3
n = x + y
r = x
mod = 10**9 + 7
f = 1
for i in range(1, n + 1):
f = f*i % mod
fac = f
f = pow(f, mod-2, mod)
facinv = [f]
for i in range(n, 0, -1):
f = f*i % mod
facinv.append(f)
facinv.append(1)
comb = Combination(n)
print(comb.C(n,r))
|
import numpy as np
N,K=map(int,input().split())
a = np.array([int(x) for x in input().split()])
val=sum(a[:K])
max_val=val
for i in range(N-K):
val+=a[K+i]
val-=a[i]
max_val=max(val,max_val)
print(max_val/2+K*0.5)
| 0 | null | 112,838,368,523,958 | 281 | 223 |
height_list = []
for i in range(10):
height_list.append(input())
height_list.sort()
height_list.reverse()
for height in height_list[:3]:
print height
|
m1 = 0;m2 = 0;m3 = 0
for i in range(1,11):
m = int(input())
if m>=m1:
m3 = m2;m2 = m1;m1 = m
elif m2<=m<m1:
m3 = m2;m2 = m
elif m3<=m<m2:
m3 = m
print(m1)
print(m2)
print(m3)
| 1 | 22,071,110 | null | 2 | 2 |
while True:
h,w = map(int, raw_input().split())
if h == w == 0:
break
print (("#" * w + "\n") * h)
|
x,k,d = list(map(int,input().split()))
x = abs(x)
point =x % d
num = x//d
if num<k:
rest = k - num
if rest%2==0:
pass
else:
point = d -point
else:
point = x - k*d
print(point)
| 0 | null | 2,996,363,481,082 | 49 | 92 |
from collections import deque
n, q = map(int, input().split())
t = 0
queue = deque([])
for _ in range(n):
name, time = input().split()
time = int(time)
queue.append([name, time])
while len(queue):
if queue[0][1] > q:
queue[0][1] -= q
t += q
queue.rotate(-1)
else:
t += queue[0][1]
queue[0][1] = t
print(" ".join(list(map(str, queue.popleft()))))
|
def gcd(a,b):
x = max(a,b)
y = min(a,b)
while True:
n = x%y
if n == 0:
print(y)
break
else:
x = y
y = n
a,b = map(int,input().split())
gcd(a,b)
| 0 | null | 25,032,707,260 | 19 | 11 |
# 2020-05-22
def main():
n, m, k = [int(x) for x in input().split()]
friends = [set() for _ in range(n)]
blocks = [set() for _ in range(n)]
for _ in range(m):
a, b = [int(x) - 1 for x in input().split()]
friends[a].add(b)
friends[b].add(a)
for _ in range(k):
a, b = [int(x) - 1 for x in input().split()]
blocks[a].add(b)
blocks[b].add(a)
networks = {} # The dict of networks as sets. Keys are leaders.
net_leaders = [-1] * n # The leaders of the networks that the ones joined.
visited = [False] * n
for person in range(n):
if visited[person]:
continue
network = set()
stack = [person]
while stack:
new = stack.pop()
visited[new] = True
net_leaders[new] = person
network.add(new)
for adj in friends[new]:
if visited[adj]:
continue
stack.append(adj)
networks[person] = network
answers = []
for person in range(n):
net = networks[net_leaders[person]]
ans = len(net) - len(friends[person]) - 1
for block in blocks[person]:
if block in net:
ans -= 1
answers.append(ans)
print(*answers)
return
if __name__ == '__main__':
main()
|
# dfs
import collections,sys
sys.setrecursionlimit(10**9)
n,m,k = map(int, input().split())
friend = [[]*(n+1) for _ in range(n+1)]
block = [[]*(n+1) for _ in range(n+1)]
teams = [0]*(n+1)
for _ in range(m):
a,b = map(int, input().split())
friend[a].append(b)
friend[b].append(a)
for _ in range(k):
c,d = map(int, input().split())
block[c].append(d)
block[d].append(c)
def dfs(i):
teams[i] = team
for j in friend[i]:
if teams[j] != 0:
continue
dfs(j)
team=1
for i in range(1,n+1):
if teams[i] != 0:
continue
dfs(i)
team+=1
c = collections.Counter(teams)
for i in range(1,n+1):
temp = c[teams[i]]-len(friend[i])-1
for j in block[i]:
if teams[j] == teams[i]:
temp -= 1
print(temp, end='')
if i != n:
print(" ", end='')
| 1 | 61,794,384,171,740 | null | 209 | 209 |
s = input()
output = s.islower()
if output == True:
print("a")
else:
print("A")
|
if __name__ == '__main__':
s = input()
if s.islower():
print("a")
else:
print("A")
| 1 | 11,342,378,807,290 | null | 119 | 119 |
import sys
## io ##
def IS(): return sys.stdin.readline().rstrip()
def II(): return int(IS())
def MII(): return list(map(int, IS().split()))
def MIIZ(): return list(map(lambda x: x-1, MII()))
## dp ##
def DD2(d1,d2,init=0): return [[init]*d2 for _ in range(d1)]
def DD3(d1,d2,d3,init=0): return [DD2(d2,d3,init) for _ in range(d1)]
## math ##
def to_bin(x: int) -> str: return format(x, 'b') # rev => int(res, 2)
def to_oct(x: int) -> str: return format(x, 'o') # rev => int(res, 8)
def to_hex(x: int) -> str: return format(x, 'x') # rev => int(res, 16)
MOD=10**9+7
def divc(x,y) -> int: return -(-x//y)
def divf(x,y) -> int: return x//y
def gcd(x,y):
while y: x,y = y,x%y
return x
def lcm(x,y): return x*y//gcd(x,y)
def enumerate_divs(n):
"""Return a tuple list of divisor of n"""
return [(i,n//i) for i in range(1,int(n**0.5)+1) if n%i==0]
def get_primes(MAX_NUM=10**3):
"""Return a list of prime numbers n or less"""
is_prime = [True]*(MAX_NUM+1)
is_prime[0] = is_prime[1] = False
for i in range(2, int(MAX_NUM**0.5)+1):
if not is_prime[i]: continue
for j in range(i*2, MAX_NUM+1, i): is_prime[j] = False
return [i for i in range(MAX_NUM+1) if is_prime[i]]
def prime_factor(n):
"""Return a list of prime factorization numbers of n"""
res = []
for i in range(2,int(n**0.5)+1):
while n%i==0: res.append(i); n //= i
if n != 1: res.append(n)
return res
## libs ##
from itertools import accumulate as acc, combinations as combi, product, combinations_with_replacement as combi_dup
from collections import deque, Counter
from heapq import heapify, heappop, heappush
from bisect import bisect_left
#======================================================#
def main():
n = II()
xl = [MII() for _ in range(n)]
lr_x = [[x-l, x+l] for x, l in xl]
lr_x.sort(key=lambda x: x[1])
now = -(10**9)
cnt = 0
for l, r in lr_x:
if now <= l:
cnt += 1
now = r
print(cnt)
if __name__ == '__main__':
main()
|
N = int(input())
A = []
for i in range(N):
x,y = map(int, input().split())
A.append([x+y,x-y])
A.sort()
now = -float('inf')
ans = 0
for a,b in A:
if b>=now:
ans += 1
now = a
print(ans)
| 1 | 89,640,548,730,852 | null | 237 | 237 |
n,m = map(int,input().split())
a = list(map(int,input().split()))
for v in a:
n = n - v
if n < 0:
n = -1
break
print(n)
|
n,m = [int(x) for x in input().split()]
a = [int(x) for x in input().split()]
if n >= sum(a):
print(n - sum(a))
else:
print(-1)
| 1 | 31,949,103,333,210 | null | 168 | 168 |
A, B = [int(x) for x in input().split()]
if A >= 10 or B >= 10:
print(-1)
else:
print(A*B)
|
# -*- coding: utf-8 -*-
def main():
import sys
input = sys.stdin.readline
d, t, s = map(int, input().split())
if s * t >= d:
print('Yes')
else:
print('No')
if __name__ == '__main__':
main()
| 0 | null | 80,520,410,415,550 | 286 | 81 |
# -*- coding: utf-8 -*-
import sys
import fractions
def lcm(a,b):
return a / fractions.gcd(a,b) * b
for s in sys.stdin:
a,b = map(int,s.split())
gcd_ab = fractions.gcd(a,b)
lcm_ab = lcm(a,b)
print gcd_ab,lcm_ab
|
import sys
def gcd(inta, intb):
large = max(inta, intb)
small = min(inta,intb)
mod = large % small
if mod ==0:
return small
else:
return gcd(small, mod)
def lcm(inta, intb, intgcd):
return (inta * intb // intgcd)
sets = sys.stdin.readlines()
for line in sets:
a, b = map(int, line.split())
c = gcd(a, b)
print(c, lcm(a, b, c))
| 1 | 648,002,912 | null | 5 | 5 |
n, m = (int(i) for i in input().split())
tot = sum(int(i) for i in input().split())
if tot > n:
print(-1)
else:
print(n - tot)
|
days_summer_vacation, amount_homework = map(int, input().split())
a = map(int, input().split())
schedule_hw = list(a)
need_days_hw = 0
for i in schedule_hw:
need_days_hw += i
if days_summer_vacation > need_days_hw:
print(days_summer_vacation - need_days_hw)
elif days_summer_vacation == need_days_hw:
print(0)
else:
print(-1)
| 1 | 32,004,397,070,722 | null | 168 | 168 |
N = int(input())
flag = False
for i in range(1, 10):
for j in range(1, 10):
if N == i*j:
flag = True
break
if flag:
print("Yes")
else:
print("No")
|
a,b=map(int,input().split())
ans=a-b*2
if a<=b*2:
ans=0
print(ans)
| 0 | null | 162,835,816,103,840 | 287 | 291 |
def cmb(n, r, mod):
if (r < 0 or r > n):
return 0
r = min(r, n - r)
return g1[n] * g2[r] * g2[n - r] % mod
mod = 998244353
N = 2 * 10**5 # 出力の制限
g1 = [1, 1] # 元テーブル
g2 = [1, 1] # 逆元テーブル
inverse = [0, 1] # 逆元テーブル計算用テーブル
for i in range(2, N + 1):
g1.append((g1[-1] * i) % mod)
inverse.append((-inverse[mod % i] * (mod // i)) % mod)
g2.append((g2[-1] * inverse[-1]) % mod)
N, M, K = map(int, input().split())
m_pow = [0] * N
m_pow[0] = 1
for i in range(1, N):
m_pow[i] = m_pow[i - 1] * (M - 1) % mod
ans = 0
for i in range(K+1):
ans = (ans + cmb(N - 1, i, mod) * M * m_pow[N - 1 - i]) % mod
print(ans)
|
import sys
readline = sys.stdin.readline
def main():
N, M, K = map(int, readline().split())
p = 998244353
cnt = 0
c = 1
for i in range(K+1):
cnt += c * M * pow(M-1, N-1-i, p)
cnt %= p
c *= (N - i - 1) * pow(i+1, p-2, p)
c %= p
print(cnt)
if __name__ == '__main__':
main()
| 1 | 23,017,473,793,270 | null | 151 | 151 |
#import sys
#input = sys.stdin.buffer.readline
#input = sys.stdin.readline
# mod=10**9+7
# rstrip().decode('utf-8')
# map(int,input().split())
# import numpy as np
def main():
n=int(input())
s=[]
t=[]
for i in range(n):
a,b=input().split()
s.append(a)
t.append(int(b))
x=input()
for i in range(n):
if x==s[i]:
ans=sum(t[i+1:])
print(ans)
exit(0)
if __name__ == "__main__":
main()
|
def resolve():
import math
print(2*math.pi*int(input()))
if '__main__' == __name__:
resolve()
| 0 | null | 64,097,604,400,298 | 243 | 167 |
A, B = map(int,input().split())
mult = A * B
print(mult)
|
#!/usr/bin/env python3
import sys
def solve(A: int, B: int):
print(A*B)
# Generated by 1.1.7.1 https://github.com/kyuridenamida/atcoder-tools (tips: You use the default template now. You can remove this line by using your custom template)
def main():
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
tokens = iterate_tokens()
A = int(next(tokens)) # type: int
B = int(next(tokens)) # type: int
solve(A, B)
if __name__ == '__main__':
main()
| 1 | 15,725,622,654,460 | null | 133 | 133 |
H,W = map(int,input().split())
s = [input() for _ in range(H)]
DP = [[1000]+[0]*W for _ in range(H+1)]
re = [[0]*(W+1) for _ in range(H+1)]
DP[0] = [1000]*(W+1)
DP[0][1] = DP[1][0] = 0
for i in range(1,H+1):
for j in range(1,W+1):
if s[i-1][j-1] == ".":
DP[i][j] = min(DP[i-1][j],DP[i][j-1])
else:
u = DP[i-1][j]+1-re[i-1][j]
l = DP[i][j-1]+1-re[i][j-1]
DP[i][j] = min(u, l)
re[i][j] = 1
print(DP[H][W])
|
string = raw_input()
for _ in xrange(input()):
order = raw_input().split()
a, b = map(int, order[1:3])
if order[0] == 'print':
print string[a:b+1]
elif order[0] == 'reverse':
# string = string[:a] + string[b:a-1:-1] + string[b+1:]
string = string[:a] + string[a:b+1][::-1] + string[b+1:]
elif order[0] == 'replace':
string = string[:a] + order[3] + string[b+1:]
| 0 | null | 25,624,761,682,190 | 194 | 68 |
while True:
n, x = map(int, input().split())
if not n and not x:
break
li = []
for i in range(1,x//3):
y = x - i
li.append((y-1)//2 - max(i, y-n-1))
print(sum([comb for comb in li if comb > 0]))
|
n, m = map(int, input().split())
a = list(map(int, input().split()))
x = 0
for i in range(m):
x += a[i]
if n - x >= 0:
print(n - x)
else:
print(-1)
| 0 | null | 16,487,036,049,344 | 58 | 168 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.