code1
stringlengths 16
427k
| code2
stringlengths 16
427k
| similar
int64 0
1
| pair_id
int64 6.82M
181,637B
⌀ | question_pair_id
float64 101M
180,471B
⌀ | code1_group
int64 2
299
| code2_group
int64 2
299
|
|---|---|---|---|---|---|---|
#!/usr/bin/env python3
import sys
from math import gcd
from collections import defaultdict
sys.setrecursionlimit(10**8)
MOD = 1000000007 # type: int
def solve(N: int, A: "List[int]", B: "List[int]"):
def quadrant(a, b):
if a > 0 and b >= 0:
return 0
elif a <= 0 and b > 0:
return 1
elif a < 0 and b <= 0:
return 2
elif a >= 0 and b < 0:
return 3
else:
return None
def norm(a, b):
g = gcd(a, b)
a //= g
b //= g
while quadrant(a, b) != 0:
a, b = -b, a
return a, b
d = defaultdict(lambda: [0, 0, 0, 0])
kodoku = 0
for i, (a, b) in enumerate(zip(A, B)):
if (a, b) == (0, 0):
kodoku += 1
else:
d[norm(a, b)][quadrant(a, b)] += 1
ans = 1
for v in d.values():
buf = pow(2, v[0]+v[2], MOD)
buf += pow(2, v[1]+v[3], MOD)
buf = (buf-1) % MOD
ans *= buf
ans %= MOD
print((ans-1+kodoku) % MOD)
return
def main():
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
tokens = iterate_tokens()
N = int(next(tokens)) # type: int
A = [int()] * (N) # type: "List[int]"
B = [int()] * (N) # type: "List[int]"
for i in range(N):
A[i] = int(next(tokens))
B[i] = int(next(tokens))
solve(N, A, B)
if __name__ == '__main__':
main()
| class SegmentTree():
def __init__(self, array, f, ti):
"""
Parameters
----------
array : list
to construct segment tree from
f : func
binary operation of the monoid
ti :
identity element of the monoid
"""
self.f = f
self.ti = ti
self.n = n = 2**(len(array).bit_length())
self.dat = dat = [ti] * n + array + [ti] * (n - len(array))
for i in range(n - 1, 0, -1): # build
dat[i] = f(dat[i << 1], dat[i << 1 | 1])
def update(self, p, v): # set value at position p (0-indexed)
f, n, dat = self.f, self.n, self.dat
p += n
dat[p] = v
while p > 1:
p >>= 1
dat[p] = f(dat[p << 1], dat[p << 1 | 1])
def query(self, l, r): # result on interval [l, r) (0-indexed)
f, ti, n, dat = self.f, self.ti, self.n, self.dat
res = ti
l += n
r += n
while l < r:
if l & 1:
res = f(res, dat[l])
l += 1
if r & 1:
r -= 1
res = f(dat[r], res)
l >>= 1
r >>= 1
return res
N, M = [int(_) for _ in input().split()]
S = [i if v == '0' else 10**5 + 5 for i, v in enumerate(input())]
ST = SegmentTree(S, min, 10**5 + 5)
i = N
ans = [i]
while i:
i2 = ST.query(max(0, i - M), i)
if i2 == 10**5 + 5:
print(-1)
exit()
i = i2
ans += [i]
ans = ans[::-1]
print(' '.join(str(b - a) for a, b in zip(ans, ans[1:])))
| 0 | null | 79,976,040,940,768 | 146 | 274 |
a,v,b,w,t=map(int,open(0).read().split());print('YNEOS'[w>=v or t<-(-abs(a-b)//(v-w))::2]) | a,v=map(int,input().split())
b,w=map(int,input().split())
t=int(input())
#a,b間の距離
d=abs(b-a)
#速度差
V=v-w
if V<=0:
print("NO")
exit()
T=d/V
if T<=t:
print("YES")
else:
print("NO") | 1 | 15,008,453,764,512 | null | 131 | 131 |
n = int(input())
a =list(map(int,input().split()))
b = sorted(a)
c = [0]*n
for i in range(0,n-1):
c[a[i]-1]+=1
for i in range(n):
print(c[i]) | import math
n = int(input())
c= [0]*n
s = map(int,input().split())
for i in s:
c[i-1]+=1
for i in c:
print(i) | 1 | 32,421,483,890,264 | null | 169 | 169 |
h,n=map(int,input().split())
A=list(map(int,input().split()))
attack = sum(A)
if h > attack:
print('No')
else:
print('Yes') | # -*- coding: utf-8 -*-
# input
a, b = map(int, input().split())
x = list(map(int, input().split()))
print('Yes') if a <= sum(x) else print('No') | 1 | 77,620,376,523,338 | null | 226 | 226 |
from string import ascii_lowercase
N = int(input())
k = [0, 26]
for i in range(1, 13):
k.append(26 * (k[i] + 1))
for i in range(13):
if k[i] + 1 <= N <= k[i+1]:
n = N - (k[i] + 1)
for j in range(i, -1, -1):
print(ascii_lowercase[(n//26**j) % 26], end="") | n = int(input())
lis = []
#print(n)
alf = ""
while n > 0:
n -= 1
mod = n % 26
lis.insert(0,mod)
n = n // 26
#print(n)
for i in lis:
alf += chr(ord("a") + i)
print(alf) | 1 | 11,898,394,066,888 | null | 121 | 121 |
N=int(input())
print(len(set([input() for _ in range(N)]))) | x,y,a,b,c=map(int, input().split())
p=sorted(list(map(int, input().split())), reverse=True)[:x]
q=sorted(list(map(int, input().split())), reverse=True)[:y]
r=sorted(list(map(int, input().split())), reverse=True)[:x+y]
new=sorted(p+q+r, reverse=True)
print(sum(new[:x+y]))
| 0 | null | 37,477,143,421,452 | 165 | 188 |
h,a = map(int,input().split())
ct=h//a
a=h-ct*a
if a>0:
ct+=1
print(ct) | W = raw_input().lower()
c = 0
while True:
T = raw_input()
if T == "END_OF_TEXT":
break
Ti = T.lower().split()
for i in Ti:
if i == W:
c += 1
print("%d" % (c, )) | 0 | null | 39,282,885,168,220 | 225 | 65 |
N = int(input())
A = sorted(list(map(int, input().split())), reverse=True)
n = N // 2
if N % 2 == 1:
ans = sum(A[:n]) + sum(A[1:n+1])
else:
ans = sum(A[:n]) + sum(A[1:n])
print(ans) | 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 | 7,212,118,496,902 | 111 | 92 |
from collections import *
from math import *
N = int(input())
A = list(map(int,input().split()))
C = Counter(A)
S = 0
for k,v in C.items():
S+=comb(v,2)
for a in A:
print(S-(comb(C[a],2)-comb(C[a]-1,2))) | #!/usr/bin/env python3
import sys
from itertools import chain
def solve(
N: int, M: int, H: "List[int]", A: "List[int]", B: "List[int]"
):
ok = [1 for _ in range(N)]
for a, b in zip(A, B):
if H[a - 1] <= H[b - 1]:
ok[a - 1] = 0
if H[b - 1] <= H[a - 1]:
ok[b - 1] = 0
return sum(ok)
def main():
tokens = chain(*(line.split() for line in sys.stdin))
N = int(next(tokens)) # type: int
M = int(next(tokens)) # type: int
H = [int(next(tokens)) for _ in range(N)] # type: "List[int]"
A = [int()] * (M) # type: "List[int]"
B = [int()] * (M) # type: "List[int]"
for i in range(M):
A[i] = int(next(tokens))
B[i] = int(next(tokens))
answer = solve(N, M, H, A, B)
print(answer)
if __name__ == "__main__":
main()
| 0 | null | 36,467,872,981,540 | 192 | 155 |
N=int(input())
a=0
ans=float('inf')
x=list(map(int,input().split()))
for i in range(100):
for j in range(N):
a=a+(x[j]-i-1)**2
#print(a)
ans=min(ans,a)
a=0
print(ans)
| k = int(input())
if k % 7 == 0:
l = 9*k // 7
else:
l = 9*k
if l % 2 == 0 or l % 5 == 0:
print(-1)
else:
pmo = 1
for i in range(1, l + 1):
mo = (pmo * 10) % l
if mo == 1:
print(i)
break
else:
pmo = mo | 0 | null | 35,816,874,488,782 | 213 | 97 |
N,K = (int(x) for x in input().split())
p = N % K
if p < (K-p):
print(p)
else:
print(K-p)
| a,b=[int(s) for s in input().split()]
print(min([a%b,(b-a)%b]))
| 1 | 39,486,504,947,690 | null | 180 | 180 |
import math
N = int(input())
for i in range(math.floor(N**0.5),0,-1):
if N%i==0:
print(i+N//i-2)
exit()
| a,b=(map(int,input().split()))
c=0
if a<=b:
print(0)
elif a>b:
c=a-b*2
if c>0:
print(c)
elif c<=0:
print(0) | 0 | null | 164,544,658,991,008 | 288 | 291 |
def main():
N_satu, M_satu, K_fun = map(int, input().split())
A_fun = list(map(int, input().split()))
B_fun = list(map(int, input().split()))
SumOf_A = [0]
SumOf_B = [0]
for i in range(N_satu):
next_val = SumOf_A[i] + A_fun[i]
SumOf_A.append(next_val)
for i in range(M_satu):
next_val = SumOf_B[i] + B_fun[i]
SumOf_B.append(next_val)
index_b = M_satu
max_cnt = 0
for i in range(N_satu + 1):
if (SumOf_A[i] > K_fun):
break
while (SumOf_A[i] + SumOf_B[index_b] > K_fun):
index_b -= 1
max_cnt = max(max_cnt, i + index_b)
print(max_cnt)
if __name__ == '__main__':
main()
| # C Many Requirements
from itertools import combinations_with_replacement as com
N, M, Q = map(int, input().split())
C = []
for q in range(Q):
C.append(tuple(map(int, input().split())))
As = com([i for i in range(1, M+1)], N)
ans = 0
for A in As:
point = 0
for Ci in C:
if A[Ci[1]-1] - A[Ci[0]-1] == Ci[2]:
point += Ci[3]
ans = max(ans, point)
print(ans) | 0 | null | 19,309,427,064,722 | 117 | 160 |
# -*- coding: utf-8 -*-
def DFS(adj, start):
n = len(adj)
d = [0] * n
f = [0] * n
flag = [0] * n
S = []
time = 1
S.append(start)
flag[start] = 1
d[start] = time
time = time + 1
while flag.count(2) != n: # ??¨????????????????????¢?´¢????????????????????§
if len(S) != 0:
u = S.pop()
v = [i for i, x in enumerate(adj[u]) if (x == 1) and (flag[i] == 0)] # v <= ??£??\???????????????????????¢?´¢??????????????????
if len(v) != 0:
S.append(u)
S.append(v[0])
flag[v[0]] = 1
d[v[0]] = time
time = time + 1
else:
#??£??\??????????????¨????¨??????????
flag[u] = 2
f[u] = time
time = time + 1
else:
u = flag.index(0)
S.append(u)
flag[u] = 1
d[u] = time
time = time + 1
return d, f
def main():
n = int(input())
adj = [[0 for i in range(n)] for j in range(n)]
for i in range(n):
tmp = list(map(int, input().split()))
u = tmp[0]
u = u -1
k = tmp[1]
v = tmp[2:]
for j in range(k):
adj[u][v[j]-1] = 1
d, f = DFS(adj, 0)
for i in range(n):
print(i+1, d[i], f[i])
if __name__ == "__main__":
main() | import sys
import math
import fractions
import bisect
import queue
import heapq
from collections import deque
sys.setrecursionlimit(4100000)
MOD = int(1e9+7)
PI = 3.14159265358979323846264338327950288
INF = 1e18
'''
1行のint
N, K = map(int, input().split())
1行のstring
S, T = input().split()
1行の整数配列
P = list(map(int,input().split()))
改行あり
x = []
y = []
for i in range(N):
x1,y1=[int(i) for i in input().split()]
x.append(x1)
y.append(y1)
N行M列の初期化
dp = [[INF] * M for i in range(N)]
'''
N, D, A = map(int, input().split())
XH = []
for i in range(N):
x1,y1=[int(i) for i in input().split()]
XH.append([x1, y1])
def counting(hp):
if hp < 0:
return 0
return hp//A + int(hp%A!=0)
XH.sort()
bombs = deque([]) # 有効な爆弾の威力と範囲を保存する
power = 0 # 有効な爆弾の威力の合計
ans = 0
for i in range(N):
# 使えない爆弾を捨てる
while len(bombs)>0 and bombs[0][0] < XH[i][0]:
power -= bombs.popleft()[1]
# パワーの不足分の爆弾
add = counting(XH[i][1]-power)
ans += add
# 追加した爆弾をキューに加える
bombs.append((XH[i][0] + 2*D, add*A))
power += add*A
print(ans)
"""
ATTENTION: Pythonで間に合うか？？
<目安>
文字列結合、再帰関数を含む→Python
上を含まず時間が不安→PyPy3
""" | 0 | null | 41,362,034,622,160 | 8 | 230 |
X,Y,Z=map(int,input().split(" "))
tmp=Y
Y=X
X=tmp
tmp=Z
Z=X
X=tmp
print(X,Y,Z,end=" ") | import math
class Circle:
def output(self, r):
print "%.6f %.6f" % (math.pi * r * r, 2.0 * math.pi * r)
if __name__ == "__main__":
cir = Circle()
r = float(raw_input())
cir.output(r) | 0 | null | 19,418,798,432,788 | 178 | 46 |
import math
def modpow(a, n, p):
if n == 0:
return 1
if n == 1:
return a % p
elif n % 2 == 1:
return a * modpow(a, n-1, p) % p
else:
return modpow(a, n//2, p) **2 % p
MOD = 1000000007
n = int(input())
#初期値が0の辞書
from collections import defaultdict
pp = defaultdict(lambda: 0)
pm = defaultdict(lambda: 0)
def seiki(x,y):
tmp=math.gcd(x,y)
return (x//tmp,y//tmp)
a0b0 = 0
for i in range(n):
a, b = map(int, input().split())
if a == 0 and b == 0:
a0b0 += 1
elif a == 0:
pp[(0,1)] += 1
elif b == 0:
pm[(0,1)] += 1
elif a*b>0:
tmp = seiki(abs(a),abs(b))
pp[tmp] += 1
else:
tmp = seiki(abs(b),abs(a))
pm[tmp] += 1
ans = 1
for key in set(pp.keys()) | set(pm.keys()):
pp_v=pp[key]
pm_v=pm[key]
ans*=(modpow(2,pm_v,MOD)+modpow(2,pp_v,MOD)-1)
ans%=MOD
ans = (ans+a0b0-1) % MOD
print(ans)
| MOD = 10 ** 9 + 7
from math import gcd
from collections import defaultdict
n = int(input())
plus = defaultdict(int)
minus = defaultdict(int)
zero = [0, 0, 0]
for _ in range(n):
a, b = map(int, input().split())
if a * b == 0:
if a == b == 0:
zero[0] += 1
elif a == 0:
zero[1] += 1
else:
zero[2] += 1
continue
g = gcd(a, b)
a //= g
b //= g
if a < 0:
a *= -1
b *= -1
if b >= 0:
s = str(a) + "-" + str(b)
plus[s] += 1
else:
s = str(-b) + "-" + str(a)
minus[s] += 1
pm = [[zero[1], zero[2]]]
cnt = sum(zero)
for key, value in plus.items():
if minus[key] != 0:
pm.append([value, minus[key]])
cnt += value + minus[key]
ans = pow(2, n - cnt, MOD)
for p, m in pm:
ans *= (pow(2, p, MOD) + pow(2, m, MOD) - 1)
ans %= MOD
ans += zero[0] - 1
ans %= MOD
print(ans)
| 1 | 21,024,214,496,100 | null | 146 | 146 |
class Dice:
top = 0
def __init__(self,one,two,three,four,five,six):
self.one = one
self.two = two
self.three = three
self.four = four
self.five = five
self.six = six
def role(self,direction):
global top
if(direction == 'S'):
t1 = self.one
self.one = self.five
t2 = self.two
self.two = t1
t3 = self.six
self.six = t2
t4 = self.five
self.five = t3
top = self.one
if(direction == 'E'):
t1 = self.one
self.one = self.four
t2 = self.three
self.three = t1
t3 = self.six
self.six = t2
self.four = t3
top = self.one
if(direction == 'N'):
t1 = self.one
t2 = self.two
t5 = self.five
t6 = self.six
self.one = t2
self.two = t6
self.six = t5
self.five = t1
top = self.one
if(direction == 'W'):
t1 = self.one
t3 = self.three
t4 = self.four
t6 = self.six
self.one = t3
self.four = t1
self.six = t4
self.three = t6
top = self.one
return(top)
arr = [int(i) for i in input().split()]
op = str(input())
final = 0
a = Dice(arr[0],arr[1],arr[2],arr[3],arr[4],arr[5])
for i in range(len(op)):
final = a.role(op[i])
print(final)
| n = int(input())
s = input()
ans = s.count('ABC')
print(ans) | 0 | null | 49,941,277,917,540 | 33 | 245 |
n = int(input())
g = [[] for _ in range(n)]
for i in range(n):
a = int(input())
for j in range(a):
x, y = map(int, input().split())
x -= 1
g[i].append((x, y))
ans = 0
for i in range(2**n):
temp = [-1]*n
for j in range(n):
if (i >> j) & 1:
temp[j] = 1
else:
temp[j] = 0
flag = True
for j in range(n):
if temp[j] == 1:
for x, y in g[j]:
if temp[x] != y:
flag = False
if flag:
ans = max(ans, sum(temp))
print(ans)
| h,n = map(int,input().split())
ab = [list(map(int,input().split())) for i in range(n)]
dp = [float("inf") for i in range(10**5)]
dp[0] = 0
for a,b in ab:
for k in range(a+1):
dp[k] = min(dp[k], b)
for k in range(a+1,h+1):
dp[k] = min(dp[k], dp[k-a] + b)
print(dp[h]) | 0 | null | 100,881,180,590,880 | 262 | 229 |
mod = 998244353
N, S = map(int, input().split())
A = list(map(int, input().split()))
dp = [[0]*(S+1) for _ in range(N+1)]
dp[0][0] = 1
for i in range(1,N+1):
dp[i][0] = dp[i-1][0]*2%mod
for i in range(1,N+1):
for j in range(1,S+1):
dp[i][j] = dp[i-1][j]*2%mod
if j>=A[i-1]:
dp[i][j] += dp[i-1][j-A[i-1]]
ans = dp[-1][-1]%mod
print(ans) | def sep():
return map(int,input().strip().split(" "))
def lis():
return list(sep())
n,s=sep()
ar=lis()
ar.insert(0,0)
dp=[[0]*(s+2) for _ in range(n+2)]
dp[0][0]=1
N=998244353
for i in range(1,n+1):
for j in range(0,s+1):
dp[i][j]=(2*dp[i-1][j])%N
if j-ar[i]>=0:
dp[i][j]=(dp[i][j]+dp[i-1][j-ar[i]])%N
#print(dp)
print(dp[n][s])
| 1 | 17,560,131,229,760 | null | 138 | 138 |
N = int(input())
As = list(map(int, input().split()))
h = 0
ans = 0
for i in range(N):
h = max(h, As[i])
ans += h - As[i]
print(ans)
| n, a, b = map( int, input().split() )
mod = 10 ** 9 + 7
N = pow( 2, n, mod ) - 1
def comb( n, r ):
c = 1
m = 1
r = min( n - r, r )
for i in range( r ):
c = c * ( n - i ) % mod
m = m * ( i + 1 ) % mod
return c * pow( m, mod - 2, mod ) % mod
A = comb( n, a )
B = comb( n, b )
print( ( N - A - B ) % mod ) | 0 | null | 35,342,659,925,860 | 88 | 214 |
import collections
N = int(input())
A = list(map(int,input().split()))
a = collections.Counter(A)
for i in range(1,len(A)+2):
print(a[i]) | nn = int(input())
aa = list(map(int,input().split()))
joushi = [0]*nn
for i in range(len(aa)):
joushi[aa[i]-1] += 1
for j in range(len(joushi)):
print(joushi[j])
| 1 | 32,776,091,344,348 | null | 169 | 169 |
# import bisect
# from collections import Counter, deque
# import copy
# from heapq import heappush, heappop, heapify
# from fractions import gcd
# import itertools
# from operator import attrgetter, itemgetter
# import math
import sys
# import numpy as np
ipti = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)
def main():
n = int(input())
s = [0] * n
t = [0] * n
for i in range(n):
s[i], t[i] = input().split()
t[i] = int(t[i])
x = input()
idx = s.index(x)
ans = 0
for i in range(idx+1, n):
ans += t[i]
print(ans)
if __name__ == '__main__':
main() | N=int(input())
s=[0]*N
t=[0]*N
for i in range(N):
s[i],t[i] = input().split()
t[i]=int(t[i])
X=input()
j= s.index(X)
if X==s[-1]:
ans=0
else:
ans= sum(t[j+1:])
print(ans) | 1 | 97,434,230,547,080 | null | 243 | 243 |
n = int(input())
z = []
w = []
for i in range(n):
x,y = map(int,input().split())
z.append(x+y)
w.append(x-y)
zmax = max(z)-min(z)
wmax = max(w)-min(w)
print(max(zmax,wmax)) | n = int(input())
xy = [list(map(int,input().split())) for i in range(n)]
cheby = []
for i in range(n):
l = [xy[i][0]-xy[i][1],xy[i][0]+xy[i][1]]
cheby.append(l)
xmax = -10**10
xmin = 10**10
ymax = -10**10
ymin = 10**10
for i in range(n):
if cheby[i][0] > xmax :
xmax = cheby[i][0]
xa = i
if cheby[i][0] < xmin :
xmin = cheby[i][0]
xi = i
if cheby[i][1] > ymax :
ymax = cheby[i][1]
ya = i
if cheby[i][1] < ymin :
ymin = cheby[i][1]
yi = i
if abs(xmax-xmin) > abs(ymax-ymin):
print(abs(xy[xa][0]-xy[xi][0])+abs(xy[xa][1]-xy[xi][1]))
else :
print(abs(xy[ya][0]-xy[yi][0])+abs(xy[ya][1]-xy[yi][1]))
| 1 | 3,426,279,811,542 | null | 80 | 80 |
A, V = map(int, input().split())
B, W = map(int, input().split())
T = int(input())
if(W > V):
print('NO')
exit(0)
# 相対速度、距離
S = V - W
D = abs(A - B)
if(D > S * T):
print('NO')
exit(0)
else:
print('YES')
| N = int(input())
S = input().split("ABC")
print(len(S)-1) | 0 | null | 57,526,667,986,648 | 131 | 245 |
def resolve():
A, B, H, M = list(map(int, input().split()))
ath = ((H*60+M)/(12*60))*360
bth = M/60*360
diff = abs(ath - bth) if abs(ath - bth) < 180 else 360-abs(ath - bth)
import math
print(math.sqrt((A**2)+(B**2)-2*A*B*math.cos(2*math.pi*diff/360)))
if '__main__' == __name__:
resolve() | import math
a, b, h, m = map(int,input().split())
a_s = (30 * h) % 360 + 0.5 * m
b_s = (6*m)
s = max(a_s,b_s) - min(a_s,b_s)
ans = math.sqrt(a**2+b**2-2*a*b*math.cos(math.radians(s)))
print(ans) | 1 | 20,187,722,450,452 | null | 144 | 144 |
import sys
input = sys.stdin.readline
H,W = list(map(int,input().split()))
S = [ input().rstrip() for _ in range(H)] #マップの読み込み
dp = [[float('inf')]*W for _ in range(H)] #コスト
if S[0][0] == '#':#はじめが'#'なら1,else 0
dp[0][0] = 1
else:
dp[0][0] = 0
for i in range(H):
for j in range(W):
if i == 0 and j == 0:#スタート地点は無視
continue
a = float('inf')
b = float('inf')
# S[i][j]にくるには i-1 かj-1からくるしかない
if i >= 1:
a = dp[i-1][j] + ( S[i-1][j] =='.' and S[i][j] =='#') #i-1からくる
if j >= j:
b= dp[i][j-1] + ( S[i][j-1] =='.' and S[i][j] =='#') #j-1からくる
dp[i][j] = min(a,b)#a,bの小さいほうが最小コスト
print(dp[i][j])
| h,w=map(int, input().split())
s=[list(input()) for _ in range(h)]
dx=[1,0]
dy=[0,1]
dp=[[10**9]*(w) for _ in range(h)]
if s[0][0]=='#':
dp[0][0]=1
else:
dp[0][0]=0
for i in range(h):
for j in range(w):
for d in range(2):
new_i=i+dx[d]
new_j=j+dy[d]
if h<=new_i or w<=new_j:
continue
add=0
if s[new_i][new_j]=='#' and s[i][j]=='.':
add=1
dp[new_i][new_j]=min(dp[new_i][new_j], dp[i][j]+add)
print(dp[-1][-1])
| 1 | 49,259,396,179,510 | null | 194 | 194 |
arr = list([input() for _ in range(10)])
arr.sort(reverse=True)
for i in range(3):
print arr[i]
| t1, t2 = map(int, input().split())
a1, a2 = map(int, input().split())
b1, b2 = map(int, input().split())
ave_a = t1 * a1 + t2 * a2
ave_b = t1 * b1 + t2 * b2
if ave_a < ave_b:
(a1, a2), (b1, b2) = (b1, b2), (a1, a2)
ave_a, ave_b = ave_b, ave_a
if ave_a == ave_b:
print('infinity')
exit()
half, all = t1 * (b1 - a1), ave_a - ave_b
ans = half // all * 2 + (half % all != 0)
print(max(0, ans))
| 0 | null | 65,807,173,613,860 | 2 | 269 |
num_list = list(map(int, input().split()))
num = num_list[0]
distance = num_list[1]
res = 0
for i in range(num):
nmb_list = list(map(int, input().split()))
if(nmb_list[0]*nmb_list[0]+nmb_list[1]*nmb_list[1] <= distance*distance):
res += 1
print(res) | def resolve():
N, D = map(int, input().split())
P = [list(map(int, input().split())) for x in range(N)]
cnt = 0
for p in P:
d = (p[0] ** 2 + p[1] ** 2) ** 0.5
if d <= D:
cnt += 1
print(cnt)
resolve() | 1 | 5,899,014,721,468 | null | 96 | 96 |
def main():
k = int(input())
s = input()
s_len = len(s)
if s_len <= k:
print(s)
else:
s = s[0:k] + '...'
print(s)
main() | k = int(input())
s = input()
if k >= len(s):
print(s)
else:
print(f"{s[:k]}...") | 1 | 19,613,167,326,688 | null | 143 | 143 |
import sys
n, m, l = [ int( val ) for val in sys.stdin.readline().split( " " ) ]
matrixA = [ [ int( val ) for val in sys.stdin.readline().split( " " ) ] for row in range( n ) ]
matrixB = [ [ int( val ) for val in sys.stdin.readline().split( " " ) ] for row in range( m ) ]
matrixC = [ [ 0 for row in range( l ) ] for row in range( n ) ]
output = []
for i in range( n ):
for j in range( l ):
for k in range( m ):
matrixC[i][j] += ( matrixA[i][k] * matrixB[k][j] )
output.append( "{:d}".format( matrixC[i][j] ) )
output.append( " " )
output.pop()
output.append( "\n" )
output.pop()
print( "".join( output ) ) | N, K = [int(n) for n in input().split()]
A = [int(n) for n in input().split()]
count = 0
for i in range(1,N+1):
A[i-1] = A[i-1]-1
check = {0: [0,1,[0]]}
s = 0
for i in range(1,N+1):
s = (s + A[i-1]) % K
if s in check:
j = check[s][0]
l = check[s][1]
while j < l and i - check[s][2][j] >= K:
j += 1
check[s][0] = j
count += l - j
check[s][2].append(i)
check[s][1] = l + 1
else:
check[s] = [0,1,[i]]
print(count) | 0 | null | 69,285,501,073,440 | 60 | 273 |
N = int(input())
count = {}
max_count = 0
for _ in range(N):
s = input()
if s not in count:
count[s] = 0
count[s] += 1
max_count = max(max_count, count[s])
longest = []
for s, c in count.items():
if c == max_count:
longest.append(s)
longest.sort()
for s in longest:
print(s) | import collections
N = int(input())
cnt = collections.defaultdict(int)
for _ in range(N):
s = input()
cnt[s] += 1
max_v = max(cnt.values())
ans = sorted([k for k, v in cnt.items() if v == max_v])
for s in ans:
print(s)
| 1 | 69,851,499,256,000 | null | 218 | 218 |
w = input()
l = len(w)
flag = True
for i in range((l - 1)//2):
if w[i] != w[l - i - 1]:
flag = False
break
mid = (l - 1) // 2
mid_mid = mid // 2
for i in range(mid_mid + 1):
if w[i] != w[mid - i - 1] or not flag:
flag = False
break
if w[i + mid + 1] != w[l - i - 1]:
flag = False
break
if flag:
print('Yes')
else:
print('No')
| N = int(input())
x = list(map(int,input().rstrip().split()))
ans = 0
for i in range(N):
for j in range(i+1,N):
ans+=x[i]*x[j]
print(ans) | 0 | null | 107,592,479,084,718 | 190 | 292 |
def call(n):
res = []
for i in range(1, n + 1):
if i % 3 == 0:
res.append(str(i))
elif '3' in str(i):
res.append(str(i))
print(' ' + ' '.join(res))
call(int(input())) | import sys
SUITS = ('S', 'H', 'C', 'D')
cards = {suit:{i for i in range(1, 14)} for suit in SUITS}
n = input() # 読み捨て
for line in sys.stdin:
suit, number = line.split()
cards[suit].discard(int(number))
for suit in SUITS:
for i in cards[suit]:
print(suit, i) | 0 | null | 975,604,244,878 | 52 | 54 |
N = int(input(""))
X = input("").split(" ")
X = [int(b) for b in X]
ans = 0
xb = int(round(sum(X) / len(X)))
for a in X:
ans += (a-xb)**2
print(ans) | def abc156c_rally():
n = int(input())
x = list(map(int, input().split()))
min_x, max_x = min(x), max(x)
best = float('inf')
for i in range(min_x, max_x + 1):
total = 0
for v in x:
total += (v - i) * (v - i)
if best > total:
best = total
print(best)
abc156c_rally() | 1 | 65,229,464,037,600 | null | 213 | 213 |
N = int(input())
ls1 = []
for i in range(N):
A = int(input())
ls2 = []
for i in range(A):
x, y = map(int,input().split())
ls2.append([x,y])
ls1.append(ls2)
ans = 0
f = True
for i in range(2**N):
for j in range(N):
if (i>>j&1):
f = True
for k in ls1[j]:
if (i >>(k[0] - 1) &1) == (k[1]&1):
continue
else:
f = False
break
if f == False:
break
if f:
ans = max(ans,bin(i).count('1'))
print(ans) | #!/usr/bin/env python3
def next_line():
return input()
def next_int():
return int(input())
def next_int_array_one_line():
return list(map(int, input().split()))
def next_int_array_multi_lines(size):
return [int(input()) for _ in range(size)]
def next_str_array(size):
return [input() for _ in range(size)]
def main():
n = next_int()
ar = next_int_array_one_line()
num = [0] * 100001
for a in ar:
num[a] += 1
q = next_int()
res = 0
for i in range(len(num)):
res += num[i] * i
for i in range(q):
b, c = map(int, input().split())
res += (c-b) * num[b]
num[c] += num[b]
num[b] = 0
print(res)
if __name__ == '__main__':
main()
| 0 | null | 67,060,236,234,272 | 262 | 122 |
n, d, a = map(int, input().split())
xh = []
for _ in range(n):
x, h = map(int, input().split())
h = (h - 1) // a + 1
xh.append([x, h])
xh.sort()
damage = xh[0][1]
ans = damage
damage_lst = [[xh[0][0] + d * 2, damage]]
pos = 0
for i, (x, h) in enumerate(xh[1:], start = 1):
while x > damage_lst[pos][0]:
damage -= damage_lst[pos][1]
pos += 1
if pos == i:
break
damage_tmp = max(h - damage, 0)
ans += damage_tmp
damage += damage_tmp
damage_lst.append([x + d * 2, damage_tmp])
print(ans) | X = int(input())
ans = X//500 * 1000
X %= 500
ans += X//5 * 5
print(ans)
| 0 | null | 62,395,059,119,260 | 230 | 185 |
import math
a,b,h,m=map(int,input().split())
f=h / 12 * 360 - m / 60 * 360 + m / 60 / 12 * 360
theta=math.radians(f)
print(math.sqrt(a**2 + b**2 - 2 * a * b * math.cos(theta))) | n = int(input())
ph = 0
pl = 10**10
mh = -10**10
ml = 10**10
for _ in range(n):
x,y = map(int,input().split())
ph = max(ph,x+y)
pl = min(pl,x+y)
mh = max(mh,x-y)
ml = min(ml,x-y)
print(max(ph-pl,mh-ml)) | 0 | null | 11,746,553,115,868 | 144 | 80 |
#-*-coding:utf-8-*-
from decimal import Decimal
import math
def main():
x1,y1,x2,y2 = map(Decimal,input().split())
print("{:.8f}".format(math.sqrt((x2-x1)**2+(y2-y1)**2)))
if __name__=="__main__":
main()
| a,b,c,d,e = map(int,input().split())
x = abs(a - c) * 60 - b + d - e
if x < 0:
print(0)
else:
print(x) | 0 | null | 9,153,291,050,622 | 29 | 139 |
n, m, k = map(int, input().split())
mod = 998244353
fact = [1] * (n + 1)
ifact = [1] * (n + 1)
for i in range(n):
fact[i + 1] = fact[i] * (i + 1) % mod
ifact[i + 1] = pow(fact[i + 1], mod - 2, mod)
def comb(x, y):
if y < 0 or y > x:
return 0
return (fact[x] * ifact[x - y] * ifact[y]) % mod
mm = [1]
for _ in range(n + 1):
mm.append(mm[-1] * (m - 1) % mod)
ans = 0
for i in range(k + 1):
ans += m * comb(n - 1, i) * mm[n - 1 - i]
ans %= mod
print(ans)
| #!/usr/bin/env python3
import sys
from functools import reduce
from operator import mul
MOD = 998244353 # type: int
class ModInt:
def __init__(self, x):
self.x = x % MOD
def __str__(self):
return str(self.x)
__repr__ = __str__
def __add__(self, other):
return (
ModInt(self.x + other.x) if isinstance(other, ModInt) else
ModInt(self.x + other)
)
def __sub__(self, other):
return (
ModInt(self.x - other.x) if isinstance(other, ModInt) else
ModInt(self.x - other)
)
def __mul__(self, other):
return (
ModInt(self.x * other.x) if isinstance(other, ModInt) else
ModInt(self.x * other)
)
def __truediv__(self, other):
return (
ModInt(
self.x * pow(other.x, MOD - 2, MOD)
) if isinstance(other, ModInt) else
ModInt(self.x * pow(other, MOD - 2, MOD))
)
def __pow__(self, other):
return (
ModInt(pow(self.x, other.x, MOD)) if isinstance(other, ModInt) else
ModInt(pow(self.x, other, MOD))
)
__radd__ = __add__
def __rsub__(self, other):
return (
ModInt(other.x - self.x) if isinstance(other, ModInt) else
ModInt(other - self.x)
)
__rmul__ = __mul__
def __rtruediv__(self, other):
return (
ModInt(
other.x * pow(self.x, MOD - 2, MOD)
) if isinstance(other, ModInt) else
ModInt(other * pow(self.x, MOD - 2, MOD))
)
def __rpow__(self, other):
return (
ModInt(pow(other.x, self.x, MOD)) if isinstance(other, ModInt) else
ModInt(pow(other, self.x, MOD))
)
def combinations_count(n, r):
r = min(r, n - r)
numer = reduce(mul, range(n, n - r, -1), 1)
denom = reduce(mul, range(1, r + 1), 1)
return numer // denom
def solve(N: int, M: int, K: int):
SUM = ModInt(0)
n_1Ck = [ModInt(1) for k in range(K + 1)]
for i in range(1, K + 1):
n_1Ck[i] = n_1Ck[i-1] * (N-i) / i
for k in range(0, K + 1):
SUM += M * n_1Ck[k] * (pow(M - 1, N - 1 - k, MOD))
print(SUM)
return
# Generated by 1.1.6 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()
N = int(next(tokens)) # type: int
M = int(next(tokens)) # type: int
K = int(next(tokens)) # type: int
solve(N, M, K)
if __name__ == '__main__':
main()
| 1 | 23,085,000,448,202 | null | 151 | 151 |
h0, w0, k0 = [ int(x) for x in input().split() ]
found, buf = 0, {}
for i in range(h0): buf[1 << i] = { 1 << j for j,x in enumerate(input()) if x == '#' }
for i in range(1, 1 << h0):
idx = {}
for k,vs in buf.items():
if k & i == 0: continue
for v in vs: idx[v] = idx.get(v, 0) + 1
for j in range(1, 1 << w0):
n = sum([ v for k,v in idx.items() if k & j ])
if n == k0: found += 1
print(found) | import sys
import numpy as np
from collections import Counter
# 全探索なら、 2**6 * 2**6 （4000）
# > 4000 * (6**2)
# bit全探索でOK
# ------------------------------------------
h, w, num = map(int, input().split())
data = []
for _ in range(h):
# 一文字ずつListへ格納
temp = list(input())
data.append(temp)
#data = [input() for _ in range(h)]
# print(data)
'''
count = Counter(data)
most = count.most_common()
print(most)
'''
ans = 0
# 縦の全Loop
for i in range(2 ** h):
for j in range(2 ** w):
#print(i, j)
*temp, = data
temp = np.array(temp)
for k in range(h):
if (i >> k & 1):
temp[k, :] = 'aa'
for l in range(w):
if (j >> l & 1):
temp[:, l] = 'aa'
count = np.where(temp == '#')[0]
#print(count, len(count))
if (len(count) == num):
# print('add')
ans += 1
else:
pass
print(ans)
| 1 | 8,916,209,451,552 | null | 110 | 110 |
n, k = [int(i) for i in input().split()]
h = sorted([int(i) for i in input().split()])
if k > len(h):
print(0)
elif k == 0:
print(sum(h))
else:
print(sum(h[0:-k])) | 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)
| 0 | null | 41,049,551,456,068 | 227 | 80 |
h, w, k = map(int, input().split())
board = [list(input()) for _ in range(h)]
ans = 0
for point_h in range(2**h):
for point_w in range(2**w):
cnt=0
for i in range(h):
for j in range(w):
if (point_h>>i)&1==0 and (point_w>>j)&1==0:
if board[i][j]=="#":
cnt+=1
if k==cnt:
ans+=1
print(ans) | #!/usr/bin/env python3
import math
n, m = map(int, input().split())
nans = (n * (n - 1)) // 2
mans = (m * (m - 1)) // 2
print(nans + mans)
| 0 | null | 27,438,438,115,770 | 110 | 189 |
def main():
n, m = map(int, input().split())
rev = input()[::-1]
ans = []
cur = nxt = 0
while cur < n:
for i in range(cur + 1, cur + m + 1):
if i==n:
nxt = i
break
if rev[i]=="0":
nxt = i
if cur==nxt:
print(-1)
exit()
ans += [str(nxt - cur)]
cur = nxt
print(" ".join(ans[::-1]))
if __name__=="__main__":
main()
| n,m=map(int,input().split())
s=input()
ans=[]
w=n
while w:
x=0
for i in range(1,m+1):
if w-i>=0 and s[w-i]=='0':
x=i
if x==0:
print(-1)
exit()
else:
ans.append(x)
w-=x
print(*ans[::-1])
| 1 | 139,431,593,478,402 | null | 274 | 274 |
mod = 998244353
N, S, *A = map(int, open(0).read().split())
dp = [1] + [0] * S
for i, a in enumerate(A, 1):
dp = [(2 * dp[j] + (dp[j - a] if j >= a else 0)) % mod for j in range(S + 1)]
print(dp[S]) | N,S = map(int,input().split())
A = list(map(int,input().split()))
MOD = 998244353
dp = [0 for _ in range(S+1)]
#i個目までの和がjの数となるのは何通りあるかdp[i][j]
dp[0] = 1
#dp = [0 if i==0 else INF for i in range(S + 1)]
for i in range(N): #i個目まで見て。
p = [0 for _ in range(S+1)]
p,dp = dp,p
for j in range(S+1):
dp[j] = (dp[j]+p[j]*2)%MOD
if j >= A[i]:
#print(j,A[i],p[j-A[i]])
dp[j] += p[j-A[i]]
#print(dp)
ans = dp[S]%MOD
print(ans)
| 1 | 17,693,353,711,872 | null | 138 | 138 |
N = int((input()))
C_p = []
C_m = []
for i in range(N):
kakko = input()
temp = 0
temp_min = 0
for s in kakko:
if s == "(":
temp += 1
else:
temp -= 1
temp_min = min(temp, temp_min)
if temp >= 0:
C_p.append((temp_min, temp))
else:
C_m.append((temp_min - temp, temp_min, temp))
C_p.sort(reverse=True)
flag = 0
final = 0
for l, f in C_p:
if final + l < 0:
flag = 1
final += f
C_m.sort()
for _, l, f in C_m:
if final + l < 0:
flag = 1
final += f
if final != 0:
flag = 1
print("Yes" if flag == 0 else "No") | n = int(input())
lr1, lr2 = [], []
res = 0
for _ in range(n):
s = input()
m = len(s)
l, r = 0, 0
tmp = 0
for i in range(m):
if s[i] == ')':
tmp += 1
else:
tmp -= 1
l = max(l, tmp)
tmp = 0
for i in range(m):
if s[m-1-i] == '(':
tmp += 1
else:
tmp -= 1
r = max(r, tmp)
res += r - l
if r - l >= 0:
lr1.append((l, r))
else:
lr2.append((l, r))
if res != 0:
print('No')
exit()
lr1.sort(key=lambda x: x[0])
lr2.sort(key=lambda x: x[1])
flg1, flg2 = True, True
n1, n2 = len(lr1), len(lr2)
tmp = 0
for i in range(n1):
l, r = lr1[i]
tmp -= l
if tmp < 0:
flg1 = False
tmp += r
tmp = 0
for i in range(n2):
l, r = lr2[i]
tmp -= r
if tmp < 0:
flg2 = False
tmp += l
if flg1 and flg2:
print('Yes')
else:
print('No')
| 1 | 23,754,660,279,040 | null | 152 | 152 |
def main():
N, K = map(int, input().split())
N = N + 1
A=[n for n in range(N)]
S=[0]*(N+1)
for a in A:
S[a+1]+=S[a]+a
ans=0
for k in range(K, N+1):
maxS, minS=S[-1], S[k]
offset=S[-k-1]
ans+=(maxS - offset) - minS + 1
print(ans%(1000000007))
if __name__=='__main__':
main() | n,k=map(int,input().split())
mod=10**9+7
def f(i):
return (1+i*(n-i+1))%mod
ans=0
for i in range(k,n+2):
ans=(ans+f(i))%mod
print(ans) | 1 | 33,147,150,323,264 | null | 170 | 170 |
N = int(input())
X = list(map(int, input().split()))
ans = 1000000000
for i in range(1, max(X)+1):
l = 0
for j in range(N):
l += (i - X[j]) ** 2
ans = min(ans, l)
print(ans) | import math
a = int(input())
answer = 100000000
b = list(map(int,input().split()))
for i in range(1,101):
cost = 0
for j in b:
cost+=(j-i)**2
answer = min(answer,cost)
print(answer) | 1 | 65,376,401,360,160 | null | 213 | 213 |
n, m, l = [int(i) for i in input().split()]
A = []
B = []
C = []
for ni in range(n):
A.append([int(i) for i in input().split()])
for mi in range(m):
B.append([int(i) for i in input().split()])
for i in range(n):
C.append([])
for j in range(l):
C[i].append(0)
for k in range(m):
C[i][j] += A[i][k] * B[k][j]
for li in range(n):
print(" ".join([str(s) for s in C[li]])) | a = [[0 for i in range(100)] for j in range(100)]
b = [[0 for i in range(100)] for j in range(100)]
n, m, l = map(int, input().split())
for i in range(n):
a[i][:m] = map(int, input().split())
for i in range(m):
b[i][:l] = map(int, input().split())
for i in range(n):
for j in range(l):
c = 0
for k in range(m):
c += a[i][k] * b[k][j]
print(c, end='')
if j < l - 1:
print(' ', end='')
else:
print() | 1 | 1,449,805,410,118 | null | 60 | 60 |
import math
x1,y1,x2,y2=input().split()
x1=float(x1)
y1=float(y1)
x2=float(x2)
y2=float(y2)
r=math.sqrt((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2))
print(r) | import math
def main():
x1, y1, x2, y2 = [float(n) for n in input().split()]
d = math.sqrt((x2 - x1)**2 + (y2 - y1)**2)
print("{:.5f}".format(d));
if __name__ == '__main__':
main()
| 1 | 158,530,771,102 | null | 29 | 29 |
def merge(A, left, mid, right):
L = A[left:mid] + [2147483648]
R = A[mid:right] + [2147483648]
i = 0
j = 0
for k in range(left, right):
if L[i] <= R[j]:
A[k] = L[i]
i += 1
else:
A[k] = R[j]
j += 1
global c
c += right - left
def mergeSort(A, left, right):
if left + 1 < right:
mid = (left + right) // 2
mergeSort(A, left, mid)
mergeSort(A, mid, right)
merge(A, left, mid, right)
c = 0
n = int(input())
A = list(map(int, input().split()))
mergeSort(A, 0, n)
print(" ".join(map(str, A)))
print(c)
| cnt = 0
def merge(A, left, mid, right):
global cnt
L = A[left:mid]
R = A[mid:right]
L.append(float("inf"))
R.append(float("inf"))
i, j = 0, 0
for k in range(left, right):
cnt += 1
if L[i] <= R[j]:
A[k] = L[i]
i += 1
else:
A[k] = R[j]
j += 1
def mergeSort(A, left, right):
if left + 1 < right:
mid = (left+right)//2
mergeSort(A, left, mid)
mergeSort(A, mid, right)
merge(A, left, mid, right)
def solve(A):
left = 0
right = len(A)
mergeSort(A, left, right)
def resolve():
n = int(input())
A = [int(i) for i in input().split()]
solve(A)
print(*A)
print(cnt)
resolve()
| 1 | 114,444,957,774 | null | 26 | 26 |
a,b = input().split()
A = a*int(b)
B = b*int(a)
print(A if A<B else B)
| S = input()
n = len(S)
s1 = S[:(n-1)//2]
s2 = S[(n+3)//2-1:]
if S[::-1]==S and s1[::-1]==s1 and s2[::-1]==s2:
print("Yes")
else:
print("No") | 0 | null | 65,183,749,450,940 | 232 | 190 |
t = str(input())
ans = t.replace("?","D")
print(ans) | t=list(input())
for i in range(len(t)):
if t[i]=="?":
t[i]="D"
print(t[i],end='') | 1 | 18,493,054,865,020 | null | 140 | 140 |
n = int(input())
a = [int(i) for i in input().split()]
color = [0, 0, 0]
ans = 1
mod = 10 ** 9 + 7
for i in a:
cnt = color.count(i)
ans *= cnt
ans = ans % mod
if ans > 0:
color[color.index(i)] += 1
else:
break
print(ans) | from collections import defaultdict
import math
def P(n, r):
return math.factorial(n)//math.factorial(n-r)
def C(n, r):
return P(n, r)//math.factorial(r)
S = input()[::-1]
N = len(S)
cnt = [0]*N
tmp = 0
d = defaultdict(int)
d[0] += 1
for i in range(N):
tmp += int(S[i])*pow(10,i,2019)
tmp %= 2019
d[tmp] += 1
ans = 0
for v in d.values():
if v >= 2:
ans += C(v,2)
print(ans) | 0 | null | 80,191,470,254,688 | 268 | 166 |
n = int(input())
plus_bracket = []
minus_bracket = []
for _ in range(n):
mini = 0
cur = 0
for bracket in input():
if bracket == '(':
cur += 1
else:
cur -= 1
if cur < mini:
mini = cur
if cur > 0:
plus_bracket.append([-mini, cur])
else:
minus_bracket.append([cur - mini, -cur])
success = True
cur = 0
plus_bracket.sort()
minus_bracket.sort()
for bracket in plus_bracket:
if cur < bracket[0]:
success = False
break
cur += bracket[1]
back_cur = 0
for bracket in minus_bracket:
if back_cur < bracket[0]:
success = False
break
back_cur += bracket[1]
if cur != back_cur:
success = False
if success:
print('Yes')
else:
print('No') | n=int(input())
for i in range(1,10):
if n%i==0 and 1<=n//i<=9:
print("Yes")
break
else:
print("No") | 0 | null | 91,707,137,070,098 | 152 | 287 |
def main():
X = int(input())
v = 100
ans = 0
while v < X:
ans += 1
v = int(v * 101 // 100)
print(ans)
if __name__ == '__main__':
main()
| x = int(input())
n = 100
ans = 0
while (x > n):
n += (n//100)
ans += 1
print(ans) | 1 | 27,080,407,674,808 | null | 159 | 159 |
import sys
import math
sys.setrecursionlimit(500000)
INF = float('inf')
def main():
n = int(input())
c = input()
red_stones = c.count('R')
return c[red_stones:].count('R')
if __name__ == '__main__':
print(main())
| N = int(input())
S,T = input().split()
s = ''
for i in range(N):
s += S[i]
s+= T[i]
print(s) | 0 | null | 59,370,093,207,250 | 98 | 255 |
n = int(input())
ans = 10**7+9
x = list(map(int, input().split()))
X = len(x)
for i in range(100):
total = 0
for j in range(X):
total += (x[j]-i)**2
else:
ans = min(ans,total)
print(ans)
| n=int(input())
x=list(map(int, input().strip().split()))
X=0
for i in range(n):
X+=x[i]
XX=0
for i in range(n):
XX+=(x[i])**2
s=X//n
t=s+1
S=n*(s**2)-2*s*X+XX
T=n*(t**2)-2*t*X+XX
print(min(S,T)) | 1 | 65,238,937,202,712 | null | 213 | 213 |
# -*- 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
from fractions import gcd
[print("{} {}".format(gcd(*x), x[0] * x[1] // gcd(*x))) for x in [list(map(int, x.split())) for x in sys.stdin]] | 1 | 551,150,112 | null | 5 | 5 |
mod = 998244353
N = int(input())
D = list(map(int, input().split()))
if D[0] != 0:
res = 0
else:
dict_D = {}
for d in D:
if d not in dict_D:
dict_D[d] = 0
dict_D[d] += 1
max_D = sorted(D)[-1]
res = 1
parent = 1
for i in range(max_D+1):
if i == 0:
if dict_D[0] != 1:
res = 0
break
else:
if i not in dict_D:
res = 0
break
else:
if i != 1:
res *= (parent**dict_D[i])
res %= mod
parent = dict_D[i]
print(res)
| n = int(input())
d_l = list(map(int,input().split()))
count_dict = {}
for i in range(n):
count_dict[i] = 0
for val in d_l:
count_dict[val] += 1
if d_l[0] != 0 or count_dict[0] != 1:
ans = 0
else:
ans = 1
for i in range(1,n):
ans = (ans*(count_dict[i-1]**count_dict[i])) %998244353
if ans == 0:
break
print(ans) | 1 | 155,026,386,187,200 | null | 284 | 284 |
T1, T2 = map(int, input().split())
A1, A2 = map(int, input().split())
B1, B2 = map(int, input().split())
X1 = T1 * (A1 - B1)
X2 = T2 * (A2 - B2)
D = X1 + X2
if D == 0:
print("infinity")
else:
if X1 < 0:
X1, X2 = [-X1, -X2]
else:
D = -D
if D < 0:
print("0")
else:
if X1 % D == 0:
print((X1 // D) * 2)
else:
print((X1 // D) * 2 + 1)
| import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
in_n = lambda: int(readline())
in_nn = lambda: map(int, readline().split())
in_s = lambda: readline().rstrip().decode('utf-8')
in_nl = lambda: list(map(int, readline().split()))
in_nl2 = lambda H: [in_nl() for _ in range(H)]
in_map = lambda: [s == ord('.') for s in readline() if s != ord('\n')]
in_map2 = lambda H: [in_map() for _ in range(H)]
in_all = lambda: map(int, read().split())
def main():
T1, T2 = in_nn()
A1, A2 = in_nn()
B1, B2 = in_nn()
if A1 > B1:
A1, B1 = B1, A1
A2, B2 = B2, A2
da1 = T1 * A1
da2 = T2 * A2
db1 = T1 * B1
db2 = T2 * B2
if da1 == db1:
if db1 == db2:
ans = "infinity"
else:
ans = 1
else:
if da1 + da2 == db1 + db2:
ans = "infinity"
elif da1 + da2 < db1 + db2:
ans = 0
else:
d1 = db1 - da1
d2 = (da1 + da2) - (db1 + db2)
ans = 1 + (d1 // d2) * 2
if d1 % d2 == 0:
ans -= 1
print(ans)
if __name__ == '__main__':
main()
| 1 | 131,692,619,354,098 | null | 269 | 269 |
X, N = map(int,input().split())
li = set(list(map(int,input().split())))
li = list(set(range(102)) - li)
li.sort(reverse=True)
n = 102
for i in li:
m = abs(X - i)
if m <= n:
n = m
k = i
print(k) | n = int( input() )
a = list( map(int, input().split()) )
x = 0
for i in a:
x ^= i
print( * list( map( lambda y: x^y , a ) ) ) | 0 | null | 13,298,137,009,930 | 128 | 123 |
# -*-coding:utf-8
#import fileinput
import math
def main():
n = int(input())
for i in range(1, n+1):
x = i
if (x%3 == 0):
print(' %d' % i, end='')
else:
while(x):
if (x%10 == 3):
print(' %d' % i, end='')
break
else:
x = int(x/10)
print('')
if __name__ == '__main__':
main() | w,h,x,y,r=map(int,input().split())
print(['No','Yes'][r<=x<=w-r and r<=y<=h-r]) | 0 | null | 675,263,871,702 | 52 | 41 |
n, m, k = map(int, input().split())
mod = 998244353
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
N = 10**6
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 )
ans = 0
for i in range(k+1):
col = m * pow(m-1,n-i-1,mod)
match = cmb(n-1,i,mod)
ans += col * match
print(ans % mod) |
import numpy as np
a= input()
K = [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(K[int(a)-1])
| 0 | null | 36,583,261,611,692 | 151 | 195 |
N,M=map(int,input().split())
A,c,dp,r=[0]*N,0,0,[]
for i, s in enumerate(reversed(input())):
if s=="1":c+=1;A[i]=c
else:c=0
while dp+M<=N-1:
t = M-A[dp+M]
if t>0: dp+=t
else:print(-1);exit()
r.append(t)
r.append(N-dp)
print(*reversed(r)) | A,V = map(int,input().split())
B,W = map(int,input().split())
T = int(input())
if A < B:
if A + (V*T) >= B + (W*T):
print("YES")
else:
print("NO")
else:
if A - (V*T) <= B - (W*T):
print("YES")
else:
print("NO") | 0 | null | 76,822,540,409,900 | 274 | 131 |
def main():
musics = int(input())
title = []
time = []
for _ in range(musics):
s, t = input().split()
title.append(s)
time.append(int(t))
last_song = input()
for i in range(musics):
if title[i] == last_song:
print(sum(time[i + 1:]))
break
if __name__ == '__main__':
main()
| N=int(input())
s=list()
t=list()
st=[]
for i in range(N):
st.append(input().split())
X=input()
ans=0
count=False
for j in range(N):
if count:
ans+=int(st[j][1])
if st[j][0]==X:
count=True
print(ans) | 1 | 97,250,253,870,492 | null | 243 | 243 |
n, m, q = map(int, input().split())
a = [0]*q
b = [0]*q
c = [0]*q
d = [0]*q
A= [1] * n
for i in range(q):
a[i], b[i], c[i], d[i] = map(int, input().split())
ans = 0
while A[0] <= m:
tmp = 0
for i in range(q):
if (A[b[i]-1] - A[a[i]-1]) == c[i]:
tmp += d[i]
if tmp > ans:
ans = tmp
A[-1] +=1
for i in range(n-1,0,-1):
if A[i] == m+1:
A[i-1] +=1
for j in range(len(A[i:])):
A[i+j] = A[i-1]
print(ans)
| n,m,q=map(int,input().split())
def dfs(seq):
u=0
if len(seq)==n:
ans=0
for a,b,c,d in data:
if seq[b-1]-seq[a-1]==c:
ans+=d
return ans
else:
for i in range(seq[-1],m+1):
seq_next=seq.copy()
seq_next.append(i)
u=max(u,dfs(seq_next))
return u
data=[]
for _ in range(q):
A=list(map(int,input().split()))
data.append(A)
print(dfs([1]))
| 1 | 27,698,228,818,348 | null | 160 | 160 |
N = int(input())
s, t = [0]*N, [0]*N
for i in range(N):
s[i], t[i] = input().split()
X = input()
ans = 0
flag = False
for i in range(N):
if flag:
ans += int(t[i])
if s[i] == X:
flag = True
print(ans) | import sys, math
from functools import lru_cache
sys.setrecursionlimit(500000)
MOD = 10**9+7
def input():
return sys.stdin.readline()[:-1]
def mi():
return map(int, input().split())
def ii():
return int(input())
def i2(n):
tmp = [list(mi()) for i in range(n)]
return [list(i) for i in zip(*tmp)]
def main():
N = ii()
s, t = [list(i) for i in zip(*[input().split() for i in range(N)])]
t = list(map(int, t))
k = s.index(input())
print(sum(int(t[i]) for i in range(k+1, N)))
if __name__ == '__main__':
main() | 1 | 97,106,447,944,440 | null | 243 | 243 |
n = int(input())
l = list(sorted(map(int, input().split())))
x = 0
if n >= 3:
for k in range(n - 2):
for j in range(k + 1):
for i in range(j + 1):
if l[i] < l[j + 1] < l[k + 2] and l[i] + l[j + 1] > l[k + 2]:
x += 1
print(x) | h,w=map(int,input().split())
s=[input() for _ in range(h)]
dp=[[float('inf')]*w for _ in range(h)]
if s[0][0]=='#':
dp[0][0] = 1
else:
dp[0][0] = 0
dx=[1,0]
dy=[0,1]
for i in range(h):
for j in range(w):
for dir in range(2):
ni=i+dy[dir]
nj=j+dx[dir]
if ni>=h or nj>=w:
continue
add=0
if s[ni][nj]=='#' and s[i][j]=='.':
add=1
dp[ni][nj] = min(dp[ni][nj], dp[i][j]+add)
print(dp[-1][-1]) | 0 | null | 27,121,808,428,722 | 91 | 194 |
n=input()
if 65<=ord(n)<=90:
print("A")
else:
print("a") | alp = 'abcdefghijklmnopqrstuvwxyz'
if input() in alp:
print('a')
else:
print('A') | 1 | 11,329,059,887,328 | null | 119 | 119 |
n,k = map(int,input().split())
A = sorted(list(map(int,input().split())))
F = sorted(list(map(int,input().split())))[::-1]
o = []
for a,f in zip(A,F):
o.append(a*f)
ok = max(o)
ng = -1
while ok - ng > 1:
mid = (ok+ng)//2
k1 = 0
for i in range(n):
k1 += max( 0 , A[i]- mid//F[i])
if k1<= k:
ok = mid
else:
ng = mid
print(ok)
| import sys
import numpy as np
n, k = map(int,input().split())
a = np.array(sorted(list(map(int, input().split()))))
f = np.array(sorted(list(map(int, input().split())), reverse=True))
asum = a.sum()
l,r = 0, 10**13
while l != r:
mid = (l+r)//2
can = (asum - np.minimum(mid//f, a).sum()) <= k
if can:
r = mid
else:
l = mid +1
print(l) | 1 | 164,603,382,371,428 | null | 290 | 290 |
from collections import defaultdict
def main():
N, P = list(map(int, input().split()))
S = input()
if P in [2, 5]:
ans = 0
# P = 2, 5の時は一番下の位の数だけ見ればカウント可能
for right in range(N - 1, - 1, - 1):
if int(S[right]) % P == 0:
ans += right + 1
print(ans)
return
# 例：S = 3543, P = 3
# 左からn番目 ～ 1番右の数のmod Pの値を計算
# C = [3543, 543, 43, 3] % P = [0, 0, 1, 0]
# C[m] == C[n] なる m < nのペア数 + C[n] == 0なるnの個数を求める
# 3 + 3 = 6
cur_c = 0
C = [0] * N
pw = 1
for n, s in enumerate(S[::-1]):
cur_c = (cur_c + pw * int(s)) % P
C[N - 1 - n] = cur_c
pw = (pw * 10) % P
counter = defaultdict(int)
for c in C:
counter[c] += 1
ans = 0
for c in C:
counter[c] -= 1
ans += counter[c]
ans += len([c for c in C if c == 0])
print(ans)
if __name__ == '__main__':
main() | K = int(input())
S = input()
ans = S
if len(S) > K:
ans = S[:K] + '...'
print(ans) | 0 | null | 38,999,470,959,420 | 205 | 143 |
N,K = map(int,input().split())
count = N//K
N = abs( N - count*K )
N_2 = abs( N - K )
print( N if N <= N_2 else N_2 ) | def main():
N = input()
if "7" in N: return "Yes"
return "No"
if __name__ == '__main__':
print(main())
| 0 | null | 36,951,690,264,548 | 180 | 172 |
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
A.sort()
def cmb(n, r, mod):
if ( r<0 or r>n ):
return 0
r = min(r, n-r)
return g1[n] * g2[r] * g2[n-r] % mod
mod = 10**9+7 # 出力の制限
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 )
ans = 0
for i in range(N-K+1):
ans += A[-1-i]*cmb(N-1-i, K-1, mod)
ans %= mod
ans -= A[i]*cmb(N-1-i, K-1, mod)
ans %= mod
print(ans) | MOD = 998244353
N = int(input())
D = list(map(int, input().split()))
if D[0] != 0:
print(0)
exit()
D_2 = [0]*(max(D)+1)
for i in D:
D_2[i] += 1
if D_2[0] != 1:
print(0)
exit()
ans = 1
for i in range(1,max(D)+1):
ans *= D_2[i-1]**D_2[i]
ans %= MOD
print(ans)
| 0 | null | 125,129,163,860,262 | 242 | 284 |
while True:
d = input()
if d == '-':
break
m = int(input())
h = [int(input()) for _ in range(m)]
for i in h:
d = d[i:] + d[:i]
print(d)
| # coding: utf-8
output = []
# ??????????????????
while (1):
texts = input().strip()
if (texts == '-'):
break
# ?????£??????????????°
m = int(input())
# ?????£??????????????°??????????????????
for i in range(m):
h = int(input())
temp_texts = texts[:h]
new_texts = texts[h:] + temp_texts
texts = new_texts
output.append(texts)
for i in output:
print(i) | 1 | 1,904,496,549,472 | null | 66 | 66 |
n = int(input())
a = map(int,input().split())
boss = [[] for _ in range(n)]
for i,j in enumerate(a):
boss[j-1].append(i)
for i in boss:
print(len(i)) | import sys
n, m, l = [ int( val ) for val in sys.stdin.readline().split( " " ) ]
matrixA = [ [ int( val ) for val in sys.stdin.readline().split( " " ) ] for row in range( n ) ]
matrixB = [ [ int( val ) for val in sys.stdin.readline().split( " " ) ] for row in range( m ) ]
matrixC = [ [ sum( matrixA[i][k] * matrixB[k][j] for k in range( m ) ) for j in range( l ) ] for i in range( n ) ]
for i in range( n ):
print( " ".join( map( str, matrixC[i] ) ) ) | 0 | null | 17,026,197,564,410 | 169 | 60 |
import random
def down_score(d, c, last_d, score):
sum = 0
for i in range(26):
sum += c[i]*(d-last_d[i])
return (score - sum)
def main():
D = int(input())
c = list(map(int, input().split()))
s = [list(map(int, input().split())) for i in range(D)]
#print(c)
#print(s)
last_d = [0 for i in range(26)]
ans = []
score = 0
for i in range(D):
max = 0
idx = 0
for j in range(26):
if max < (s[i][j] + c[j] * (i-last_d[j])*(i-last_d[j]+1)/2) and c[j] != 0:
max = s[i][j] + c[j] * (i-last_d[j])*(i-last_d[j]+1)/2
idx = j
elif max == (s[i][j] + c[j] * (i-last_d[j])*(i-last_d[j]+1)/2) and c[j] > c[idx]:
idx = j
last_d[idx] = i+1
score += s[i][j]
down_score(i+1,c,last_d,score)
ans.append(idx)
for i in range(D):
print(ans[i]+1)
if __name__ == "__main__":
main() | # -*- coding: utf-8 -*-
import sys
import math
from bisect import bisect_left
from bisect import bisect_right
from collections import defaultdict
from heapq import heappop, heappush
import itertools
import random
from decimal import *
input = sys.stdin.readline
def inputInt(): return int(input())
def inputMap(): return map(int, input().split())
def inputList(): return list(map(int, input().split()))
def inputStr(): return input()[:-1]
inf = float('inf')
mod = 1000000007
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
def main():
D = inputInt()
C = inputList()
S = []
for i in range(D):
s = inputList()
S.append(s)
ans1 = []
ans2 = []
ans3 = []
ans4 = []
for i in range(D):
bestSco1 = 0
bestSco2 = 0
bestSco3 = 0
bestSco4 = 0
bestI1 = 1
bestI2 = 1
bestI3 = 1
bestI4 = 1
for j,val in enumerate(S[i]):
if j == 0:
tmpAns = ans1 + [j+1]
tmpSco = findScore(tmpAns, S, C)
if bestSco1 < tmpSco:
bestSco4 = bestSco3
bestI4 = bestI3
bestSco3 = bestSco2
bestI3 = bestI2
bestSco2 = bestSco1
bestI2 = bestI1
bestSco1 = tmpSco
bestI1 = j+1
else:
tmpAns1 = ans1 + [j+1]
tmpAns2 = ans2 + [j+1]
tmpAns3 = ans3 + [j+1]
tmpAns4 = ans4 + [j+1]
tmpSco1 = findScore(tmpAns1, S, C)
tmpSco2 = findScore(tmpAns2, S, C)
tmpSco3 = findScore(tmpAns3, S, C)
tmpSco4 = findScore(tmpAns4, S, C)
if bestSco1 < tmpSco1:
bestSco1 = tmpSco1
bestI1 = j+1
if bestSco2 < tmpSco2:
bestSco2 = tmpSco2
bestI2 = j+1
if bestSco3 < tmpSco3:
bestSco3 = tmpSco3
bestI3 = j+1
if bestSco4 < tmpSco4:
bestSco4 = tmpSco4
bestI4 = j+1
ans1.append(bestI1)
ans2.append(bestI2)
ans3.append(bestI3)
ans4.append(bestI4)
aa = []
aa.append(bestSco1)
aa.append(bestSco2)
aa.append(bestSco3)
aa.append(bestSco4)
aa.sort()
aa = aa[::-1]
if aa[0] == bestSco1:
for i in ans1:
print(i)
elif aa[0] == bestSco2:
for i in ans2:
print(i)
elif aa[0] == bestSco3:
for i in ans3:
print(i)
elif aa[0] == bestSco4:
for i in ans4:
print(i)
def findScore(ans, S, C):
scezhu = [inf for i in range(26)]
sco = 0
for i,val in enumerate(ans):
tmp = S[i][val-1]
scezhu[val-1] = i
mins = 0
for j,vol in enumerate(C):
if scezhu[j] == inf:
mins = mins + (vol * (i+1))
else:
mins = mins + (vol * ((i+1)-(scezhu[j]+1)))
tmp -= mins
sco += tmp
return sco
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
if __name__ == "__main__":
main()
| 1 | 9,731,860,704,852 | null | 113 | 113 |
N = int(input())
A = str(input())
if (N % 2 == 0):
if (A[:N//2] == A[N//2:]):
print("Yes")
else:
print("No")
else:
print("No")
| N = int(input())
target_list = []
if N % 2 == 1:
N += 1
for i in range(1, int(N/2)):
target = N - i
if target == i:
continue
else:
target_list.append(target)
print(len(target_list)) | 0 | null | 150,071,012,565,738 | 279 | 283 |
H,A = (int(x) for x in input().split())
print(H//A+(H%A>0)) | import sys
readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)
def main():
H, A = map(int, readline().split())
print((H + A - 1) // A)
if __name__ == '__main__':
main()
| 1 | 76,883,502,608,272 | null | 225 | 225 |
n = int(input())
ans = [0] * (10**4 + 1)
for i in range(1,105):
for j in range(1,105):
for k in range(1,105):
v = i*i+j*j+k*k+i*j+j*k+k*i
if v < 10001:
ans[v]+=1
for i in range(n):
print(ans[i+1])
| #from statistics import median
#import collections
#aa = collections.Counter(a) # list to list || .most_common(2)で最大の2個とりだせるお a[0][0]
from fractions import gcd
from itertools import combinations,permutations,accumulate # (string,3) 3回
#from collections import deque
from collections import deque,defaultdict,Counter
import decimal
import re
#import bisect
#
# d = m - k[i] - k[j]
# if kk[bisect.bisect_right(kk,d) - 1] == d:
#
#
#
# pythonで無理なときは、pypyでやると正解するかも！！
#
#
# my_round_int = lambda x:np.round((x*2 + 1)//2)
# 四捨五入
import sys
sys.setrecursionlimit(10000000)
mod = 10**9 + 7
#mod = 9982443453
def readInts():
return list(map(int,input().split()))
def I():
return int(input())
NUM = [0] * 500000
for x in range(1,101):
for y in range(1,101):
for z in range(1,101):
nya = x**2 + y**2 + z**2 + x*y + y*z + z*x
NUM[nya] += 1
n = I()
for i in range(1,n+1):
print(NUM[i])
| 1 | 7,956,972,793,990 | null | 106 | 106 |
import fractions
def c2(a):
ans = 0
while True:
q,r = divmod(a,2)
if r==0:
ans+=1
a = q
else:break
return ans
gcd = fractions.gcd
n,m= map(int,input().split())
A = list(map(lambda x:int(x)//2,input().split()))
A.sort()
ma = 0
cp = c2(A[0])
for i in range(n):
if cp!=c2(A[i]):
print(0)
exit()
lcm = A[0]
for i in range(1,n):
lcm = A[i]*lcm//gcd(A[i],lcm)
print((m//lcm +1)//2)
| from fractions import gcd
def lcm(a,b):
return (a*b)//gcd(a,b)
n,m = map(int,input().split())
a = list(map(int,input().split()))
ans = 1
for i in a:
ans = lcm(ans,i)
for i in a:
if (ans//i) % 2 == 0:
print(0)
exit()
print(((m//(ans//2))+1)//2) | 1 | 101,544,766,299,330 | null | 247 | 247 |
k=int(input())
s=input()
if len(s)<=k:
print(s)
else:
for i in range(k):
print(s[i],end="")
print("...",end="") | MOD = 10 ** 9 + 7
MAX = 10 ** 6 + 1
fac = [0] * MAX
finv = [0] * MAX
inv = [0] * MAX
def CoMinit():
fac[0] = fac[1] = 1
finv[0] = finv[1] = 1
inv[1] = 1
for i in range(2, MAX):
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 COM(n, k):
if n < k:
return 0
if n < 0 or k < 0:
return 0
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD
CoMinit()
N, K = map(int, input().split())
a = list(map(int, input().split()))
a.sort()
mint = 0
maxt = 0
for i in range(N):
maxt += a[i] * COM(i, K - 1)
mint += a[-i - 1] * COM(i, K - 1)
print((maxt - mint) % MOD) | 0 | null | 58,051,953,560,470 | 143 | 242 |
a,b=map(int,input().split())
#a,bの最大公約数
def gcd(a,b):
if(b==0):
return a
else:
return gcd(b, a%b)
#a,bの最小公倍数
def lcm(a,b):
return a*b//gcd(a,b)
print(lcm(a,b)) | import sys
input = sys.stdin.readline
n,m,l = map(int,input().split())
town = [list(map(int,input().split())) for _ in range(m)]
q = int(input())
query = [list(map(int,input().split())) for _ in range(q)]
inf = (l+1)*n
d = [[inf]*n for _ in range(n)]
for i in range(n):
d[i][i] = 0
for a,b,c in town:
a -= 1
b -= 1
d[a][b] = c
d[b][a] = c
def warshall_floyd(d,n):
for k in range(n):
for j in range(n):
for i in range(n):
d[i][j] = min(d[i][j],d[i][k]+d[k][j])
warshall_floyd(d,n)
d2 = [None]*n
for i,row in enumerate(d):
d2[i] = [1 if val<=l else inf for val in row]
d2[i][i] = 0
warshall_floyd(d2,n)
for s,t in query:
s -= 1
t -= 1
count = (d2[s][t]%inf)-1
print(count)
| 0 | null | 143,585,077,805,610 | 256 | 295 |
n = int(input())
a = list(map(int, input().split()))
b = list(enumerate(a))
c = sorted(b, key=lambda x:x[1])
print(*[c[i][0]+1 for i in range(n)]) | def resolve():
N = int(input())
S = str(input())
print(S.count('ABC'))
return
resolve() | 0 | null | 140,229,618,899,132 | 299 | 245 |
#!/usr/bin/env python3
import collections
import itertools as it
import math
#import numpy as np
# = input()
x = int(input())
# = map(int, input().split())
# = list(map(int, input().split()))
# = [int(input()) for i in range(N)]
#
# c = collections.Counter()
n = x // 100
mod = x % 100
print(0 if 5 * n < mod else 1)
| X = int(input())
r = X%100
x5 = r//5
r5 = r%5
if r5:
x5+=1
if x5*100 <= X:
print(1)
else:
print(0) | 1 | 127,075,840,465,028 | null | 266 | 266 |
bit=[0]*9
fa=[1]*9
for n in range(1,9):fa[n]=fa[n-1]*n
def up(id):
while id<9:
bit[id]+=1
id+=id&(-id)
def qr(id):
res=0
while id:
res+=bit[id]
id-=id&(-id)
return res
x=int(input())
s=list(map(int,input().split()))
z=list(map(int,input().split()))
v=''
for n in s:
a=qr(n)
vl=n-1-a
v+=str(vl)
up(n)
v=v[::-1]
r1=0
for n in range(len(v)):
r1+=int(v[n])*fa[n]
r2=0
v=''
bit=[0]*9
for n in z:
a=qr(n)
vl=n-1-a
v+=str(vl)
up(n)
v=v[::-1]
for n in range(len(v)):
r2+=int(v[n])*fa[n]
print(abs(r1-r2)) | set = raw_input().split()
if int(set[0]) < int(set[1]) < int(set[2]):
print 'Yes'
else:
print 'No' | 0 | null | 50,691,104,020,050 | 246 | 39 |
K = int(input())
l = [1, 2, 3, 4, 5, 6, 7, 8, 9]
for i in range(K):
t = l[i] % 10
if t == 0:
l.append(l[i] * 10 + 0)
l.append(l[i] * 10 + 1)
elif t == 9:
l.append(l[i] * 10 + 8)
l.append(l[i] * 10 + 9)
else:
l.append(l[i] * 10 + t - 1)
l.append(l[i] * 10 + t)
l.append(l[i] * 10 + t + 1)
print(l[K-1]) | k = int(input())
lun = [str(i) for i in range(1, 10)]
L = [str(i) for i in range(1, 10)]
nL = []
while len(lun) < 10 ** 5:
for num in L:
l = num[-1]
lm = int(l) - 1
lp = int(l) + 1
nL.append(num + l)
if lm >= 0:
nL.append(num + str(lm))
if lp < 10:
nL.append(num + str(lp))
lun.extend(nL)
L = nL
nL = []
lunlun = [int(x) for x in lun]
lunlun.sort()
print(lunlun[k-1])
| 1 | 40,002,241,178,888 | null | 181 | 181 |
K = int(input())
x = 7
for i in range(K):
if x % K == 0:
print(i+1)
exit()
else:
x = (10*x + 7) % K
print(-1) | 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()))
#======================================================#
def main():
k = II()
sevens = 7%k
for i in range(1, k+1):
if sevens % k == 0:
print(i)
return
sevens = (10*sevens + 7)%k
print(-1)
if __name__ == '__main__':
main() | 1 | 6,105,633,647,802 | null | 97 | 97 |
def prime(p):
flag = True
for i in range(2,(int(p**0.5)+1)):
if p%i==0:
flag = False
break
return flag
X = int(input())
while True:
result = prime(X)
if result:
break
else:
X += 1
print(X) | S = input()
L = S.split()
a = L[0]
a = int(a)
b = L[1]
b = int(b)
if a < b:
print('a < b')
elif a > b:
print('a > b')
elif a == b:
print('a == b') | 0 | null | 52,877,352,745,334 | 250 | 38 |
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time, copy,bisect
from operator import itemgetter
#from heapq import heappush, heappop
#import numpy as np
#from scipy.sparse.csgraph import shortest_path, floyd_warshall, dijkstra, bellman_ford, johnson
#from scipy.sparse import csr_matrix
#from decimal import Decimal, ROUND_HALF_UP, ROUND_HALF_EVEN
sys.setrecursionlimit(10**7)
inf = 10**20
mod = 10**9 + 7
stdin = sys.stdin
ni = lambda: int(ns())
nf = lambda: float(ns())
na = lambda: list(map(int, stdin.readline().split()))
nb = lambda: list(map(float, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip() # ignore trailing spaces
N, M = na()
print(N * (N - 1) // 2 + M * (M - 1) // 2)
| X = int(input())
n500 = int(X / 500)
n5 = int((X % 500) / 5)
print(n500 * 1000 + n5 * 5)
| 0 | null | 44,099,348,280,262 | 189 | 185 |
n, k = map(int, input().split())
mod = 10**9+7
k = min([k, n-1])
ans = 0
key = 1
for i in range(k+1):
ans += key
ans %= mod
key = (((key*(n-i)%mod)*(n-i-1)%mod)*pow(pow(i+1, mod-2, mod), 2, mod))%mod
print(ans) | def main():
import sys
input = sys.stdin.readline
# comb init
mod = 1000000007
nmax = 4 * 10 ** 5 + 10 # change here
fac = [0] * nmax
finv = [0] * nmax
inv = [0] * nmax
fac[0] = 1
fac[1] = 1
finv[0] = 1
finv[1] = 1
inv[1] = 1
for i in range(2, nmax):
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 comb(n, r):
if n < r:
return 0
else:
return (fac[n] * ((finv[r] * finv[n - r]) % mod)) % mod
N, K = map(int, input().split())
ans = 0
for m in range(min(K+1, N)):
ans = (ans + (comb(N, m) * comb(N-1, m))%mod)%mod
print(ans)
if __name__ == '__main__':
main()
| 1 | 67,190,258,999,342 | null | 215 | 215 |
n = int(input())
print((n+2-1)//2)
| n = int(input())
print(int((n + 1)/2)) | 1 | 59,073,275,801,782 | null | 206 | 206 |
a = int(input())
x = a
while x%360:
x += a
print(x//a) | from math import gcd
print(360//gcd(360,int(input()))) | 1 | 13,130,979,240,050 | null | 125 | 125 |
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)
| import collections
def main():
N, K = map(int, input().split())
A = list(map(int, input().split()))
d = collections.defaultdict(int)
prefix = [0]
for i in range(N):
prefix.append(prefix[-1] + A[i])
ans = 0
for j in range(N+1):
v = (prefix[j] - j) % K
ans += d[v]
d[v] += 1
if j >= K-1:
d[(prefix[j-K+1] - (j-K+1)) % K] -= 1
# print(ans)
return ans
if __name__ == '__main__':
print(main()) | 1 | 137,736,702,706,472 | null | 273 | 273 |
a,b=map(int,input().split(' '))
count=0
if a==b:
print("Yes")
else:
print("No")
| N,M=list(map(int, input().split()))
if N==M:
print('Yes')
else:
print('No') | 1 | 83,195,949,097,412 | null | 231 | 231 |
#!/usr/bin/env python3
from collections import deque, Counter
from heapq import heappop, heappush
from bisect import bisect_right
def main():
N = int(input())
A = list(map(int, input().split()))
p = 10**9+7
# check[i]:= Aの中のiが出てきた順番
check = [[] for _ in range(N)]
for i in range(N):
check[A[i]].append(i)
# print(check)
ans = 1
for i in range(len(check[0])):
ans *= (3-i)
for i in range(1,N):
if len(check[i-1]) < len(check[i]):
exit(print(0))
# check[i]がcheck[i-1]のなかで何番目か調べる
for j in range(len(check[i])):
d = bisect_right(check[i-1],check[i][j])
if d < j:
exit(print(0))
ans *= d-j
ans %= p
# print(ans)
print(ans)
if __name__ == "__main__":
main()
| N=int(input())
S=input()
S=list(S)
ans=[]
color = ''
for s in S:
if color != s:
ans.append(s)
color = s
print(len(ans)) | 0 | null | 150,750,395,158,440 | 268 | 293 |
N,K,C=map(int,input().split())
S=input()
L=[0 for i in range(K)]
R=[0 for i in range(K)]
n=0
rc=0
lc=0
while True:
if lc==K:
break
if S[n]=="o":
L[lc]=n+1
n+=C+1
lc+=1
else:
n+=1
n=N-1
while True:
if rc==K:
break
if S[n]=="o":
R[K-1-rc]=n+1
n-=C+1
rc+=1
else:
n-=1
for i in range(K):
if R[i]==L[i]:
print(R[i])
| # cook your dish here
import sys
def file():
sys.stdin = open('input.py', 'r')
sys.stdout = open('output.py', 'w')
def main(N, arr):
#initialising with positive infinity value
maxi=float("inf")
#initialising the answer variable
ans=0
#iterating linesrly
for i in range(N):
#finding minimum at each step
maxi=min(maxi,arr[i])
#increasing the final ans
ans+=maxi
print("dhh")
#returning the answer
return ans
#file()
if __name__ == '__main__':
#length of the array
'''N = 4
#Maximum size of each individual bucket
Arr = [4,3,2,1]
#passing the values to the main function
answer = main(N,Arr)
#printing the result
print(answer)'''
n=int(input())
s=input()
#l=list(map(int, input().split()))
ans=0
for i in range(1,n):
if(s[i]!=s[i-1]):
ans+=1
print(ans+1)
| 0 | null | 105,491,102,410,668 | 182 | 293 |
def f():
N = int(input())
UP = []
DOWN = []
for _ in range(N):
S = input()
c = 0
minC = 0
for s in S:
if s == '(':
c += 1
else:
c -= 1
minC = min(minC, c)
if c >= 0:
UP.append((minC, c))
else:
DOWN.append((c - minC, c))
c = 0
for up in sorted(UP, reverse=True):
if c + up[0] < 0:
return False
c += up[1]
for down in sorted(DOWN, reverse=True):
if c + down[1] - down[0] < 0:
return False
c += down[1]
if c != 0:
return False
return True
if f():
print('Yes')
else:
print('No')
| A,B,K = list(map(int,input().split()))
if A>= K:
print(str(A-K) + ' ' + str(B))
elif A < K :
print(str(0) + ' ' + str(max(B+A-K,0)))
| 0 | null | 63,606,108,865,718 | 152 | 249 |
def resolve():
n = int(input())
a = tuple(map(int,input().split()))
print('YES' if len(a)==len(set(a)) else 'NO')
resolve() | X=int(input())
#m1,d1=map(int,input().split())
#hl=list(map(int,input().split()))
#l=[list(map(int,input().split())) for i in range(n)]
flag=0
for i in range(1,1001):
if i*100 <= X and X <= i*105:
flag=1
break
print(flag)
| 0 | null | 100,269,082,938,260 | 222 | 266 |
def main():
a = [list(map(int, input().split())) for _ in range(3)]
n = int(input())
x = [[0]*3 for _ in range(3)]
b =[]
for _ in range(n):
b.append(int(input()))
for i in range(3):
for j in range(3):
if a[i][j] in b:
x[i][j] = 1
for i in range(3):
c = 1
for j in range(3):
c *= x[i][j]
if c == 1:
print("Yes")
return
for i in range(3):
c = 1
for j in range(3):
c *= x[j][i]
if c == 1:
print("Yes")
return
c = 1
for i in range(3):
c *= x[i][i]
if(c):
print("Yes")
return
if(x[0][2]*x[1][1]*x[2][0]):
print("Yes")
return
print("No")
if __name__ == "__main__":
main() | A = [input().split() for _ in range(3)]
N = int(input())
c = [[False]*3 for _ in range(3)]
for _ in range(N):
B = input()
for i in range(3):
if B in A[i]:
c[i][A[i].index(B)] = True
def solve(c):
y = "Yes"
n = "No"
for i in range(3):
if c[i][0] and c[i][1] and c[i][2]:
return y
if c[0][i] and c[1][i] and c[2][i]:
return y
if c[0][0] and c[1][1] and c[2][2]:
return y
if c[0][2] and c[1][1] and c[2][0]:
return y
return n
print(solve(c))
| 1 | 59,937,788,313,382 | null | 207 | 207 |
while True:
m,f,r=map(int,input().split())
p=m+f
if m+f+r==-3:
break
if m==-1 or f==-1:
print("F")
elif p>=80:
print("A")
elif 65<=p and p<80:
print("B")
elif 50<=p and p<65:
print("C")
elif 30<=p and p<50:
if r>=50:
print("C")
else:
print("D")
else:
print("F") | N=int(input())
for i in range(10):
for j in range(10):
if N==i*j:
print('Yes')
exit()
print('No') | 0 | null | 80,255,940,219,140 | 57 | 287 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.