input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
n,m=list(map(int,input().split()))
a=[[int(j) for j in input().split()] for i in range(n)]
c=[[int(j) for j in input().split()] for i in range(m)]
for i in range(n):
d=10e8
b=0
for j in range(m):
if abs(a[i][0]-c[j][0])+abs(a[i][1]-c[j][1])<d:
d=abs(a[i][0]-c[j][0])+abs(a[i][1]-c... | n,m=list(map(int,input().split()))
ab=[[int(j) for j in input().split()] for i in range(n)]
cd=[[int(j) for j in input().split()] for i in range(m)]
for a,b in ab:
l=[abs(a-c)+abs(b-d) for c,d in cd]
print((l.index(min(l))+1)) | p03774 |
N,M = list(map(int,input().split()))
students = [list(map(int,input().split()))for i in range(N)]
checkPoints = [list(map(int,input().split()))for i in range(M)]
for i in range(N):
idx = -1
mindis = 3*10**8
sx,sy = students[i]
for j in range(M):
cx,cy = checkPoints[j]
distance... | N,M = list(map(int,input().split()))
students = [list(map(int,input().split()))for i in range(N)]
checkPoints = [list(map(int,input().split()))for i in range(M)]
for i in range(N):
idx = 1
mindis = abs(students[i][0]-checkPoints[0][0])+ abs(students[i][1]-checkPoints[0][1])
sx,sy = students[i]
... | p03774 |
#!/usr/bin/env python3
import sys, math, itertools, collections, bisect
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
inf = float('inf')
ans = 0 ;count = 0 ;pro = 1
n,m=list(map(int,input().split()))
ab=[tuple(map(int,input().split())) for i in range(n)]
cd=[tuple(map(int,input().split()... | #!/usr/bin/env python3
import sys, math, itertools, collections, bisect
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
inf = float('inf') ;mod = 10**9+7
mans = inf ;ans = 0 ;count = 0 ;pro = 1
n,m = list(map(int,input().split()))
CD = [tuple(map(int,input().split())) for i in range(n)]
AB... | p03774 |
import math
INF = 1001001001
def resolve():
n, m = list(map(int, input().split()))
s = []
c = []
for i in range(n):
a, b = list(map(int, input().split()))
s.append([a, b])
for i in range(m):
a, b = list(map(int, input().split()))
c.append([a, b])
for a in s:
ans = ... | def resolve():
n, m = list(map(int, input().split()))
ab = []
for i in range(n):
ab.append(list(map(int, input().split())))
cd = []
for i in range(m):
cd.append(list(map(int, input().split())))
for a in ab:
ans = 0
dist = 10000000000
for i in range(m):
tmp = abs(a[0] ... | p03774 |
N,M = map(int,input().split())
st = [tuple(map(int,input().split())) for i in range(N)]
ch = [tuple(map(int,input().split())) for i in range(M)]
ans = []
for sx,sy in st:
minci = 1
mind = float('inf')
for i,(cx,cy) in enumerate(ch):
d = abs(sx-cx) + abs(sy-cy)
if d < mind:
... | N,M = list(map(int,input().split()))
A = [tuple(map(int,input().split())) for i in range(N)]
C = [tuple(map(int,input().split())) for i in range(M)]
for ax,ay in A:
min_d = 10**10
min_i = -1
for i,(cx,cy) in enumerate(C):
d = abs(ax-cx) + abs(ay-cy)
if d < min_d:
min_d =... | p03774 |
N, M = list(map(int, input().split()))
ab = [list(map(int, input().split())) for _ in range(N)]
cd = [list(map(int, input().split())) for _ in range(M)]
ans = []
for i in range(N):
index = 0
lowest = pow(10, 8) * 4
for j in range(M):
dist = abs(ab[i][0] - cd[j][0]) + abs(ab[i][1] - cd[j][1... | n, m = list(map(int, input().split()))
ss = [list(map(int, input().split())) for _ in range(n)]
p = [list(map(int, input().split())) for _ in range(m)]
INF = 10 ** 8 * 4
for s in ss:
dist = INF
c_point = 0
a, b = s
for i, v in enumerate(p):
c, d = v
manhattan = abs(a - c) +... | p03774 |
N, M = list(map(int, input().split(" ")))
student = [];
pos = [];
for i in range(N) :
a, b = list(map(int, input().split(" ")))
student.append((a, b))
for i in range(M) :
a, b = list(map(int, input().split(" ")))
pos.append((a,b))
for st in student :
ans = -1;
score = 10**10;
for i in range(... | N, M = list(map(int, input().split()))
student = [ tuple( map(int, input().split()) ) for x in range(N)]
point = [ tuple( map(int, input().split()) ) for x in range(M)]
for (x1, y1) in student :
data = [ abs(x1 - x2) + abs(y1 - y2) for (x2, y2) in point ]
ans = data.index(min(data))
print((ans... | p03774 |
N, M = list(map(int, input().split()))
ab = [tuple(map(int, input().split())) for i in range(N)]
cd = [tuple(map(int, input().split())) for i in range(M)]
for a, b in ab:
ret = -1
dis = 10**20
for i, x in enumerate(cd):
c, d = x
if dis > abs(c-a) + abs(d-b):
dis = ... | N, M = map(int, input().split())
ab = [tuple(map(int, input().split())) for i in range(N)]
cd = [tuple(map(int, input().split())) for j in range(M)]
ans = [0]*N
for i, x in enumerate(ab):
a, b = x
D = 10**9
for j, y in enumerate(cd):
c, d = y
dis = abs(a-c) + abs(b-d)
... | p03774 |
n,m=map(int,input().split())
ab=[list(map(int,input().split())) for i in range(n)]#学生の位置
cd=[list(map(int,input().split())) for i in range(m)]#ゴール
l=[0]*n
for i in range(n):
ans=10**18
for j in range(m):
a=abs(ab[i][0]-cd[j][0])+abs(ab[i][1]-cd[j][1])
if ans>a:
... | n,m=list(map(int,input().split()))
ab=[list(map(int,input().split())) for i in range(n)]
cd=[list(map(int,input().split())) for i in range(m)]
for i in range(n):
x=ab[i][0]
y=ab[i][1]
ans = [float('inf')] * 2
for j in range(m):
man=abs(x-cd[j][0])+abs(y-cd[j][1])
if ans[0]>man... | p03774 |
N,M = [int(c) for c in input().split()]
ab = [list(map(int,input().split())) for c in range(N)]
cd = [list(map(int,input().split())) for c in range(M)]
for i in range(N):
mi = 2*10**9
for j in range(M):
tmp = abs(ab[i][0]-cd[j][0])+abs(ab[i][1]-cd[j][1])
if mi > tmp:
mi = tmp... | N,M = [int(c) for c in input().split()]
ab = [list(map(int,input().split())) for c in range(N)]
cd = [list(map(int,input().split())) for c in range(M)]
for i in range(N):
mi = 10**9
for j in range(M):
tmp = abs(ab[i][0]-cd[j][0])+abs(ab[i][1]-cd[j][1])
if mi > tmp:
mi = tmp
... | p03774 |
n, m = list(map(int, input().split()))
AB = [[int(i) for i in input().split()] for i in range(n)]
CD = [[int(i) for i in input().split()] for i in range(m)]
for a, b in AB:
dist = [abs(a - c) + abs(b - d) for c, d in CD]
print((dist.index(min(dist)) + 1)) | n, m = list(map(int, input().split()))
AB = [[int(i) for i in input().split()] for i in range(n)]
CD = [[int(i) for i in input().split()] for i in range(m)]
for ab in AB:
ans = 10 ** 12
id = 0
for i, cd in enumerate(CD):
tmp = abs(ab[0] - cd[0]) + abs(ab[1] - cd[1])
if tmp < ans:
... | p03774 |
n, m = list(map(int, input().split()))
A = [list(map(int, input().split())) for i in range(n)]
B = [list(map(int, input().split())) for i in range(m)]
ans = []
for a in A:
cur = float('inf')
for i, b in enumerate(B):
x = abs(a[0] - b[0]) + abs(a[1] - b[1])
if x < cur:
cur... | n, m = list(map(int, input().split()))
AB = [list(map(int, input().split())) for i in range(n)]
CD = [list(map(int, input().split())) for i in range(m)]
for a, b in AB:
dist = [[abs(a - c) + abs(b - d)] for c, d in CD]
print((dist.index(min(dist)) + 1)) | p03774 |
#!/usr/bin/env python3
import sys
import heapq
import copy
import itertools
inf = float('inf')
a = '.'
b = '#'
class Graph_dijkstra(object):
def __init__(self, V: "List[int]", E: "Set[Tuple[Tuple, Tuple]]", L: "Dict[Tuple[Tuple, Tuple], int]"):
self.V = V
self.E = E
self.L ... | #!/usr/bin/env python3
import sys
import heapq
import copy
import itertools
inf = float('inf')
a = '.'
b = '#'
def solve(H, W, s):
white_count = sum([line.count(a) for line in s])
field = [[b for w in range(W+2)] for h in range(H+2)]
for h in range(H):
field[1+h][1:W+1] = s[h... | p03436 |
mod = 1000000007
n= int(eval(input()))
a= list(map(int,input().split()))
check = [0]*(n+1)
g1=[1,1]
g2=[1,1]
inverse=[0,1]
for i in range(2,n+1+1):
g1.append((g1[-1]*i)%mod)
inverse.append((-inverse[mod%i]*(mod//i))%mod)
g2.append((g2[-1]*inverse[-1])%mod)
def cmb2(n,r):
mod = 1000000007
... | mod = 1000000007
n= int(eval(input()))
a= list(map(int,input().split()))
check = [0]*(n+1)
g1=[1,1]
g2=[1,1]
inverse=[0,1]
for i in range(2,n+1+1):
g1.append((g1[-1]*i)%mod)
inverse.append((-inverse[mod%i]*(mod//i))%mod)
g2.append((g2[-1]*inverse[-1])%mod)
def cmb2(n,r):
mod = 1000000007
... | p03674 |
# encoding:utf-8
import copy
import random
import bisect #bisect_left これで二部探索の大小検索が行える
import fractions #最小公倍数などはこっち
import math
mod = 10**9+7
n = int(eval(input()))
a = [int(i) for i in input().split()]
factorial = [1]
for i in range(1,n+2):
tmp = factorial[-1]*i
factorial.append(tmp)
... | # encoding:utf-8
import copy
import random
import bisect #bisect_left これで二部探索の大小検索が行える
import fractions #最小公倍数などはこっち
import math
mod = 10**9+7
n = int(eval(input()))
a = [int(i) for i in input().split()]
# 階乗 & 逆元計算
factorial = [1]
inverse = [1]
for i in range(1, n+2):
factorial.append(fact... | p03674 |
from statistics import mode
N = int(eval(input()))
A = list(map(int, input().split()))
MOD = 10 ** 9 + 7
# 2回表れている値とそのインデックスを取得
C = mode(A)
C_indexes = [i for i, x in enumerate(A) if x == C]
# 二つのCの外側にそれぞれ何個ずつあるか
outside = C_indexes[0] + len(A) - C_indexes[1] - 1
# 階乗・逆元の値を保存
factorial = [1]
inverse ... | """
実験のためにkobaya0514様のコードをいじくらせていただいております
"""
N = int(eval(input()))
A = [int(x) for x in input().split()]
# 重複始点終点調査
se = []
c = sum(A) - N * (N + 1) / 2
for i in range(len(A)):
if A[i] == c:
se.append(i)
l = se[0]
r = se[1]
mod = 10 ** 9 + 7
# 階乗計算
factorial = [1]
inverse = [1]
for ... | p03674 |
from collections import Counter
N = int(eval(input()))
A = list(map(int, input().split()))
mod = 10 **9 + 7
# 階乗 & 逆元計算
factorial = [1]
inverse = [1]
for i in range(1, N+2):
factorial.append(factorial[-1] * i % mod)
inverse.append(pow(factorial[-1], mod-2, mod))
# 組み合わせ計算
def nCr(n, r):
... | N = int(eval(input()))
A = list(map(int, input().split()))
MOD = 10 ** 9 + 7
duplicate_x = None
checked = set()
for a in A:
if a in checked:
duplicate_x = a
checked.add(a)
x_l_index = A.index(duplicate_x)
x_r_index = N + 1 - A[::-1].index(duplicate_x) - 1
# 逆元の前計算
factorial = [1,... | p03674 |
def memfact(a,m):
temp = 1
yield temp
for i in range(1,a+1):
temp = temp * i % m
yield temp
def comb(n,r,m):
if r == 0: return 1
return (memf[n]*pow(memf[r],m-2,m)*pow(memf[n-r],m-2,m)) % m
n,*a = list(map(int, open(0).read().split()))
m = 1000000007
checker = set()
f... | def memfact(a,m):
temp = 1
yield temp
for i in range(1,a+1):
temp = temp * i % m
yield temp
def comb(n,r,m):
if r == 0: return 1
return (memf[n]*pow(memf[r],m-2,m)*pow(memf[n-r],m-2,m)) % m
n,*a = list(map(int, open(0).read().split()))
m = 1000000007
checker = set()
f... | p03674 |
def main():
N = int(eval(input()))
A = [int(a) for a in input().split()]
div = pow(10, 9) + 7
# print(A)
d = dict()
for i in range(N+1):
if A[i] not in d: d[A[i]] = [i]
else: d[A[i]].append(i)
i1, i2 = 0, 0
for a in d:
if len(d[a]) == 2:
... | def main():
N = int(eval(input()))
A = [int(a) for a in input().split()]
div = pow(10, 9) + 7
# print(A)
d = dict()
for i in range(N+1):
if A[i] not in d: d[A[i]] = [i]
else: d[A[i]].append(i)
i1, i2 = 0, 0
for a in d:
if len(d[a]) == 2:
... | p03674 |
def main():
N = int(eval(input()))
A = [int(a) for a in input().split()]
div = pow(10, 9) + 7
# print(A)
d = dict()
for i in range(N+1):
if A[i] not in d: d[A[i]] = [i]
else: d[A[i]].append(i)
i1, i2 = 0, 0
for a in d:
if len(d[a]) == 2:
... |
def main():
N = int(eval(input()))
A = [int(a) for a in input().split()]
div = pow(10, 9) + 7
# print(A)
d = dict()
for i in range(N+1):
if A[i] not in d: d[A[i]] = [i]
else: d[A[i]].append(i)
i1, i2 = 0, 0
for a in d:
if len(d[a]) == 2:
... | p03674 |
import sys
sys.setrecursionlimit(10**7)
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LI(): return list(map(int,sys.stdin.readline().rstrip().split())) #空白あり
def LI2(): return list(map(int,sys.stdin.readline().rstrip())) #空白なし
def ... | import sys
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split())) #空白あり
N = I()
A = [0] + LI()
mod = 10**9+7
count = [0]*(N+1)
for i in range(1,N+2):
if count[A[i]] != 0:
a,b = count[A[i]],i # 重複する文字のあるindex
else:
... | p03674 |
import sys
input = sys.stdin.readline
######## modあり modは素数 ###############
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 #出力の制限
N = 10**5+1
g1 = [1, 1] # 元テーブル
g2 = [1, 1] #逆元テーブル
inverse = [0, 1] #逆元テーブル計算用テーブル
... | import sys
input = sys.stdin.readline
######## modあり modは素数 ###############
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 #出力の制限
N = 10**5+1
g1 = [1, 1] # 元テーブル
g2 = [1, 1] #逆元テーブル
inverse = [0, 1] #逆元テーブル計算用テーブル
... | p03674 |
mod = int(1e9) + 7
def power(x, y):
if y == 0:
return 1
elif y == 1:
return x % mod
elif y % 2 == 0:
return power(x, y//2)**2 % mod
else:
return power(x, y//2)**2 * x % mod
fact = [1] * int(1e5+1)
for i in range(1, int(1e5+1)):
fact[i] = (i * fact[... | mod = int(1e9) + 7
def power(x, y):
if y == 0:
return 1
elif y == 1:
return x % mod
elif y % 2 == 0:
return power(x, y//2)**2 % mod
else:
return power(x, y//2)**2 * x % mod
fact = [1] * int(1e5+2)
for i in range(1, int(1e5+2)):
fact[i] = (i * fact[... | p03674 |
from math import factorial
from collections import Counter
mod = 10**9 + 7
n = int(eval(input()))
length = n+1
li = list(map(int,input().split()))
counter = Counter(li)
dup = counter.most_common()[0][0]
be, af = [i for i, x in enumerate(li) if x==dup]
soto = be + length - af - 1
for k in range(1, n+2):
... | import collections
N = int(eval(input()))
a = list(map(int, input().split()))
c = collections.Counter(a)
dup = c.most_common()[0][0]
id = [i for i, x in enumerate(a) if x == dup]
L = id[0]
R = id[1]
MOD = 10**9 +7
factorial = [1]
inverse = [1]
for i in range(1, N+2):
factorial.append(factorial... | p03674 |
n = int(eval(input()))
A =list(map(int, input().split()))
mod = 10**9+7
d = {}
for i in range(n+1):
if A[i] not in d:
d[A[i]] = i
else:
l = d[A[i]]
r = i
break
#print(l, r)
def cmb1(n, r, mod):
if ( r<0 or r>n ):
return 0
r = min(r, n-r)
re... | n = int(eval(input()))
A = list(map(int, input().split()))
mod = 10**9+7
from collections import Counter
C = Counter(A)
for k, v in list(C.items()):
if v == 2:
t = k
flag = False
for i in range(n+1):
if not flag:
if A[i] == t:
l = i
flag = True
else:... | p03674 |
#!/usr/bin/env python3
#ABC66 D
import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(1000000)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counte... | #!/usr/bin/env python3
#ABC66 D
import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(1000000)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counte... | p03674 |
mod=10**9+7
n=int(eval(input()))
a=list(map(int,input().split()))
c=[0]*n
for i in a:c[i-1]+=1
ind=c.index(2)
x=[]
for i in range(n+1):
if a[i]==ind+1:x.append(i)
m=n+x[0]-x[1]
f=[1]
for i in range(1,n+2):f.append(f[-1]*i%mod)
def comb(n,r):return f[n]*pow(f[r],mod-2,mod)*pow(f[n-r],mod-2,mod)%mod
for ... | mod=10**9+7
n=int(eval(input()))
a=list(map(int,input().split()))
c=[0]*n
for i in a:c[i-1]+=1
ind=c.index(2)
x=[]
for i in range(n+1):
if a[i]==ind+1:x.append(i)
m=n+x[0]-x[1]
ans=1
anss=1
for k in range(1,n+2):
ans=(ans*(n-k+2))%mod
ans=ans*pow(k,mod-2,mod)%mod
if k==1:print(n);continue... | p03674 |
import sys
MOD = 10 ** 9 + 7
def make_table(n=10**5+1, p=10**9+7):
fac = [None] * (n + 1)
fac[0] = 1
ifac = fac.copy()
for i in range(1, n + 1):
fac[i] = fac[i-1] * i % p
ifac[n] = pow(fac[n], p - 2, p)
for i in range(n-1, 0, -1):
ifac[i] = ifac[i+1] * (i + 1) % p
... | import sys
MOD = 10 ** 9 + 7
def make_table(n=10**5+1, p=10**9+7):
fac = [None] * (n + 1)
fac[0] = 1
ifac = fac.copy()
for i in range(1, n + 1):
fac[i] = fac[i-1] * i % p
ifac[n] = pow(fac[n], p - 2, p)
for i in range(n-1, 0, -1):
ifac[i] = ifac[i+1] * (i + 1) % p
... | p03674 |
import sys
readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)
def main():
n = int(readline())
a = list(map(int, readline().split()))
dup = 0
for i in range(1, n + 2):
if a.count(i) == 2:
dup = i
first = a.index(... | import sys
readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)
def main():
n = int(readline())
a = list(map(int, readline().split()))
appeared = set()
dup = 0
for x in a:
if x in appeared:
dup = x
br... | p03674 |
n = int(eval(input()))
A= list(map(int, input().split()))
mod = int(1e9+7)
def powermod(p,n,mod):
#if n==0: return 1
if n==1: return p%mod
else: return powermod(p,n//2,mod)**2 * (p**(n%2)) %mod
memo={}
for i, a in enumerate(A):
if a in memo:
L = memo[a]
C = i - memo[a] -1
R = le... | n = int(eval(input()))
A= list(map(int, input().split()))
mod = int(1e9+7)
def powermod(p,n,mod):
#if n==0: return 1
if n==1:
return p%mod
if n%2:
return powermod(p,n//2,mod)**2 * p %mod
else:
return powermod(p,n//2,mod)**2 %mod
memo={}
for i, a in enumerate(A):... | p03674 |
n = int(eval(input()))
A= list(map(int, input().split()))
mod = int(1e9+7)
def powermod(a, n, mod):
r = 1
while n>=1:
if n%2:
r = (r*a)%mod
a = (a*a)%mod
n = n//2
return r
memo={}
for i, a in enumerate(A):
if a in memo:
L = memo[a]
C = i - m... | n = int(eval(input()))
A= list(map(int, input().split()))
mod = int(1e9+7)
def invmod(a, mod):
if a==1:
return 1
return -invmod(mod%a, mod) * (mod//a) %mod
memo={}
for i, a in enumerate(A):
if a in memo:
L = memo[a]
C = i - memo[a] -1
R = len(A) - i-1
break
else:
... | p03674 |
n = int(eval(input()))
A= list(map(int, input().split()))
mod = int(1e9+7)
def invmod(a, mod):
if a==1:
return 1
return -invmod(mod%a, mod) * (mod//a) %mod
memo={}
for i, a in enumerate(A):
if a in memo:
L = memo[a]
C = i - memo[a] -1
R = len(A) - i-1
break
else:
... | n = int(eval(input()))
A= list(map(int, input().split()))
mod = 10**9+7
class combinationmod():
def __init__(self,MAX, mod):
self.mod =mod
self.fac=[0]*(MAX+1)
self.finv=[0]*(MAX+1)
self.inv=[0]*(MAX+1)
self.fac[0]=self.fac[1]=1
self.finv[0]=self.finv[1]=1
self.inv[1]=1
... | p03674 |
from collections import Counter
n = int(eval(input()))
A = list(map(int, input().split()))
cnt = Counter(A)
mod = 10**9 + 7
def comb(n,k,p):
"""power_funcを用いて(nCk) mod p を求める"""
from math import factorial
if n<0 or k<0 or n<k: return 0
if n==0 or k==0: return 1
a=factorial(n) %p
b=f... | from collections import Counter
n = int(eval(input()))
A = list(map(int, input().split()))
cnt = Counter(A)
mod = 10**9 + 7
def comb(n,k,p):
"""power_funcを用いて(nCk) mod p を求める"""
from math import factorial
if n<0 or k<0 or n<k: return 0
if n==0 or k==0: return 1
a=factorial(n) %p
b=f... | p03674 |
#list_int 並べて出力 print (' '.join(map(str,ans_li)))
#list_str 並べて出力 print (' '.join(list))
# 2進数 format(10, 'b') # '1010'
# aa=[int(input()) for i in range(n)]
#for i,name in enumerate(list)
''' 二次元配列を一列ずつ
for i in ans:
print(*i)
'''
''' heapq
queue = []
heapq.heapify(queue) #heapqの作成
heapq.heappush(... | from collections import defaultdict
import sys,heapq,bisect,math,itertools,string
sys.setrecursionlimit(10**8)
INF = float('inf')
mod = 10**9+7
AtoZ = [chr(i) for i in range(65,65+26)]
atoz = [chr(i) for i in range(97,97+26)]
def inpl_int(): return list(map(int, input().split()))
def inpl_str(): return list(m... | p03674 |
import sys
sys.setrecursionlimit(10 ** 9)
M = 10 ** 9 + 7
cache = {}
# Combination under a prime modulo: nCk % p
def combmod(n, k, p=M):
if k > n:
return 0
if k > n - k:
k = n - k
if (n, k) in cache:
return cache[n, k]
num, den = 1, 1
for i in range(k):
... | import sys
input = sys.stdin.readline
M = 10 ** 9 + 7
n = int(eval(input()))
a = list(map(int, input().split()))
assert len(a) == n + 1
b = [None] * (n + 1)
d1, d2 = -1, -1
for i in range(n + 1):
if b[a[i]] is None:
b[a[i]] = i
else:
d1 = b[a[i]]
d2 = i
break
... | p03674 |
n = int(eval(input()))
a = list(map(int, input().split()))
dup=[0]*n
for num in a:
dup[num-1]+=1
if dup[num-1]>1:
break
A=-1
B=-1
for i in range(len(a)):
if a[i]==num:
if A==-1:
A=i
else:
B=i
B=n-B
def find_power(n,mod=10**9+7):
powlis... | n = int(eval(input()))
a = list(map(int, input().split()))
dup=[0]*n
for num in a:
dup[num-1]+=1
if dup[num-1]>1:
break
A=-1
B=-1
for i in range(len(a)):
if a[i]==num:
if A==-1:
A=i
else:
B=i
B=n-B
def find_power(n,mod=10**9+7):
powl... | p03674 |
from collections import Counter, defaultdict
class Combination:
def __init__(self, size, mod=10**9 + 7):
self.size = size + 2
self.mod = mod
self.fact = [1, 1] + [0] * size
self.factInv = [1, 1] + [0] * size
self.inv = [0, 1] + [0] * size
for i in range(2,... | from collections import Counter
class Combination:
def __init__(self, size):
self.size = size + 2
self.fact = [1, 1] + [0] * size
self.factInv = [1, 1] + [0] * size
self.inv = [0, 1] + [0] * size
for i in range(2, self.size):
self.fact[i] = self.fact[i... | p03674 |
MOD = 10**9+7
def mod_pow(x, n):
if x==0: return 1
res = 1
while n > 0:
if n&1:
res = (res*x)%MOD
x = (x*x)%MOD
n >>= 1
return res
fact, invfact = [0]*(10**5+2), [0]*(10**5+2)
fact[0], invfact[0] = 1, 1
for i in range(1, 10**5+2):
fact[i] = (fact[i-1]*i)%MOD
invfact[i] = ... | # Pythonの組み込み関数powを使ったバージョン
MOD = 10**9+7
fact, invfact = [0]*(10**5+2), [0]*(10**5+2)
fact[0], invfact[0] = 1, 1
for i in range(1, 10**5+2):
fact[i] = (fact[i-1]*i)%MOD
invfact[i] = pow(fact[i], MOD-2, MOD)
def mod_comb(n, r):
if n<r or n==0 or r==0: return 0
return (((fact[n]*invfact[r])%MOD)*i... | p03674 |
n = int(eval(input()))
a = list(map(int, input().split()))
from collections import Counter
c = Counter(a)
for k in list(c.keys()):
if c[k] == 2:
break
l = []
for i in range(len(a)):
if a[i] == k:
l.append(i)
if len(l) == 2:
break
d = n - l[1] + l[0]
def power(x, y):... | n = int(eval(input()))
a = list(map(int, input().split()))
from collections import Counter
c = Counter(a)
for k in list(c.keys()):
if c[k] == 2:
break
l = []
for i in range(len(a)):
if a[i] == k:
l.append(i)
if len(l) == 2:
break
d = n - l[1] + l[0]
def power(x, y):... | p03674 |
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import math
import bisect
import random
from itertools import permutations, accumulate, combinations, product
import sys
import string
from bisect import bisect_left, bisect_right
from math import factorial, ceil, ... | from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import math
import bisect
import random
from itertools import permutations, accumulate, combinations, product
import sys
import string
from bisect import bisect_left, bisect_right
from math import factorial, ceil, ... | p03674 |
# 繰り返し二乗法 (mod 有り)
def mod_rep_pow(a, n, mod=(10 ** 9 + 7)):
res = 1
while n > 0:
if n % 2 == 0:
a = a ** 2 % mod
n //= 2
else:
res = res * a % mod
n -= 1
return (res % mod)
# 繰り返し二乗法 (mod 有り) を利用して nCk を高速に返す
# mod が素数のときのみ利用可能... | def mod_rep_pow(a, n, mod=(10 ** 9 + 7)):
res = 1
while 0 < n:
if n & 1:
res = (res * a) % mod
n -= 1
else:
a = (a ** 2) % mod
n //= 2
return (res % mod)
def mod_inverse(a, mod=(10 ** 9 + 7)):
return mod_rep_pow(a, (mod - 2))... | p03674 |
from collections import defaultdict
n = int(eval(input()))
a = list(map(int, input().split()))
MOD = 10**9 + 7
MAX = n + 5
fact = [1 for _ in range(MAX)]
finv = [1 for _ in range(MAX)]
for i in range(2, MAX):
fact[i] = fact[i - 1] * i % MOD
finv[i] = pow(fact[i], MOD-2, MOD)
def comb(n: int, k: in... | from collections import defaultdict
n = int(eval(input()))
a = list(map(int, input().split()))
MOD = 10**9 + 7
MAX = n + 5
fact = [1 for _ in range(MAX)]
finv = [1 for _ in range(MAX)]
for i in range(2, MAX):
fact[i] = fact[i - 1] * i % MOD
finv[i] = pow(fact[i], MOD-2, MOD)
def comb(n: int, k: in... | p03674 |
from math import factorial as f
from collections import Counter as co
n=int(eval(input()))
a=list(map(int,input().split()))
mod=10**9+7
d=co(a)
keys=[k for k,v in list(d.items()) if v==2]
dbl=keys[0]
ll=[i for i,x in enumerate(a) if x==dbl]
b=ll[1]-ll[0]-1
m=n-1-b
def pf(a,b,p):
if b==0: return 1
if b%... | from math import factorial as f
from collections import Counter as co
n=int(eval(input()))
a=list(map(int,input().split()))
mod=10**9+7
d=co(a)
keys=[k for k,v in list(d.items()) if v==2]
dbl=keys[0]
ll=[i for i,x in enumerate(a) if x==dbl]
b=ll[1]-ll[0]
m=n-b
def pf(x,y,p):
if y==0: return 1
if y%2=... | p03674 |
def comb(n,k,p):
from math import factorial
if n<0 or k<0 or n<k:return 0
if n==0 or k==0:return 1
a=factorial(n)%p
b=factorial(k)%p
c=factorial(n-k)%p
return (a*power_func(b,p-2,p)*power_func(c,p-2,p))%p
def power_func(a,b,p):
if b==0: return 1
if b%2==0:
d=power_func(a,b//2,p)
re... | def comb(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
g1 = [1, 1] # 元テーブル
g2 = [1, 1] #逆元テーブル
inverse = [0, 1] #逆元テーブル計算用テーブル
n=int(eval(input()))
mod=10**9+7
for i in range( 2, n + 1 ):
g1.append( ( g1[-1] * i ) % mod )
inverse.app... | p03674 |
# 解説を見た
class Calc:
def __init__(self, max_value, mod):
"""combination(max_value, all)"""
fact = [-1] * (max_value + 1)
fact[0] = 1
fact[1] = 1
for x in range(2, max_value + 1):
fact[x] = x * fact[x - 1] % mod
invs = [-1] * (max_value + 1)
... | def build_combination(n, mod):
def cmb(n, r):
if r < 0 or n < r:
return 0
return (((invs[r] * invs[n - r]) % mod) * fact[n]) % mod
fact = [1] * (n + 1)
for x in range(2, n + 1):
fact[x] = x * fact[x - 1] % mod
invs = [1] * (n + 1)
invs[n] = pow(fact[n... | p03674 |
class Calc:
def __init__(self, max_value, mod):
"""combination(max_value, all)"""
fact = [-1] * (max_value + 1)
fact[0] = 1
fact[1] = 1
for x in range(2, max_value + 1):
fact[x] = x * fact[x - 1] % mod
invs = [1] * (max_value + 1)
invs[m... | class Calc:
def __init__(self, max_value, mod):
"""combination(max_value, all)"""
fact = [-1] * (max_value + 1)
fact[0] = 1
fact[1] = 1
for x in range(2, max_value + 1):
fact[x] = x * fact[x - 1] % mod
invs = [1] * (max_value + 1)
invs[m... | p03674 |
from collections import Counter, defaultdict
import sys
sys.setrecursionlimit(10 ** 5 + 10)
# input = sys.stdin.readline
from math import factorial
import heapq, bisect
import math
import itertools
import queue
from collections import deque
def comb(n, r, mod):
if n < r:
return 0
ans ... | from collections import Counter, defaultdict
import sys
sys.setrecursionlimit(10 ** 5 + 10)
# input = sys.stdin.readline
from math import factorial
import heapq, bisect
import math
import itertools
import queue
from collections import deque
def comb(n, r, mod, bunsi):
if r > n:
return 0
... | p03674 |
# -*- coding: utf-8 -*-
import sys
from collections import Counter
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range... | # -*- coding: utf-8 -*-
import sys
from collections import Counter
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range... | p03674 |
class ModComb:
def __init__(self, MAX, mod=10 ** 9 + 7):
fac = [1, 1]
finv = [1, 1]
inv = [0, 1]
for i in range(2, MAX):
fac.append(fac[i - 1] * i % mod)
inv.append(mod - inv[mod % i] * (mod // i) % mod)
finv.append(finv[i - 1] * inv[i] % m... | class ModComb:
def __init__(self, MAX, mod=10 ** 9 + 7):
fac = [1, 1]
finv = [1, 1]
inv = [0, 1]
for i in range(2, MAX):
fac.append(fac[i - 1] * i % mod)
inv.append(mod - inv[mod % i] * (mod // i) % mod)
finv.append(finv[i - 1] * inv[i] % m... | p03674 |
N = int(eval(input()))
A = [int(i) for i in input().split()]
mod = 7 + 10 ** 9
def Pow(i, n):
if n == 0:
return 1
else:
ans = Pow(i * i % mod, n//2)
if n % 2 == 1:
ans *= i
ans %= mod
return ans
Nfact = [1]
NfactRev = []
for i in range(1,... | def Pow(i, n):
if n == 0:
return 1
else:
ans = Pow(i * i % mod, n//2)
if n % 2 == 1:
ans *= i
ans %= mod
return ans
N = int(eval(input()))
A = [int(i) for i in input().split()]
mod = 7 + 10 ** 9
num = [-1 for i in range(N)]
for i, a in enume... | p03674 |
import sys
from math import factorial
def main():
input = sys.stdin.readline
N = int(eval(input()))
A = list(map(int, input().split()))
MOD = 10**9 + 7
used = set()
first = 0
second = 0
for i in range(N+1):
if A[i] in used:
second = i
firs... | import sys
def main():
input = sys.stdin.readline
N = int(eval(input()))
A = list(map(int, input().split()))
MOD = 10**9 + 7
used = set()
first = 0
second = 0
for i in range(N+1):
if A[i] in used:
second = i
first = A.index(A[i])
e... | p03674 |
import sys
stdin = sys.stdin
def li(): return list(map(int, stdin.readline().split()))
def li_(): return [int(x)-1 for x in stdin.readline().split()]
def lf(): return list(map(float, stdin.readline().split()))
def ls(): return stdin.readline().split()
def ns(): return stdin.readline().rstrip()
def lc(): return... | import sys
stdin = sys.stdin
def li(): return list(map(int, stdin.readline().split()))
def li_(): return [int(x)-1 for x in stdin.readline().split()]
def lf(): return list(map(float, stdin.readline().split()))
def ls(): return stdin.readline().split()
def ns(): return stdin.readline().rstrip()
def lc(): return... | p03674 |
from functools import reduce
def nCr(N,a,mod):
if a == 0:return 1
num = reduce(lambda x,y:x * y % mod,list(range(N,N-a,-1)))
den = reduce(lambda x,y:x * y % mod,list(range(1,a+1)))
return num * pow(den,mod-2,mod)%mod
def nHr(n,a,mod):
return nCr(n-1+a,n-1,mod)
mod = 10 ** 9 + 7
n = ... | 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
g1 = [1, 1] # 元テーブル
g2 = [1, 1] #逆元テーブル
inverse = [0, 1] #逆元テーブル計算用テーブル
mod = 10 ** 9 + 7
n = int(eval(input()))
lis = list(map(int,input().split()))
li = [-1] * n
for i in range( 2... | p03674 |
def comb(k,r):
"""kCpを求める"""
if k<0 or r<0 or r>k: return 0
elif k==0 or r==0: return 1
else:
return (X[k]*Y[r]*Y[k-r])
def power_func(a,b,p):
"""a^b mod p を求める"""
if b==0: return 1
if b%2==0:
d=power_func(a,b//2,p)
return d*d %p
if b%2==1:
return (a*power_func(a,b-1,p )... | def comb(k,r):
"""kCpを求める"""
if k<0 or r<0 or r>k: return 0
elif k==0 or r==0: return 1
else:
return (X[k]*Y[r]*Y[k-r])
def power_func(a,b,p):
"""a^b mod p を求める"""
if b==0: return 1
if b%2==0:
d=power_func(a,b//2,p)
return d*d %p
if b%2==1:
return (a*power_func(a,b-1,p )... | p03674 |
from collections import Counter
n,*a = list(map(int,open(0).read().split()))
dbl = Counter(a).most_common()[0][0]
l,r = [i for i,j in enumerate(a) if j==dbl]
const = n+l-r
m = n + 1
mod = 10**9+7
fac = [1]*(m+1)
inv = [1]*(m+1)
for i in range(1,m+1):
fac[i] = fac[i-1] * i % mod
inv[-1] = pow(fac[-1], mod - ... | def main():
n,*a = list(map(int,open(0).read().split()))
dbl = sum(a)-n*(n+1)//2
l,r = [i for i,j in enumerate(a) if j==dbl]
const = n+l-r
m = n + 1
mod = 10**9+7
fac = [1]*(m+1)
inv = [1]*(m+1)
for i in range(1,m+1):
fac[i] = fac[i-1] * i % mod
inv[-1] = pow(fac[-1], mod - 2, mod)
for i in ran... | p03674 |
n=int(eval(input()))
a=list(map(int,input().split()))
mod=pow(10,9)+7
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
g1 = [1, 1]
g2 = [1, 1]
inverse = [0, 1]
for i in range( 2, n + 2 ):
g1.append( ( g1[-1] * i ) % mod )
inv... | n=int(eval(input()))
a=list(map(int,input().split()))
mod=pow(10,9)+7
#ans=[int(input()) for _ in range(n+1)]
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
g1 = [1, 1]
g2 = [1, 1]
inverse = [0, 1]
for i in range( 2, n + 2 ):
g... | p03674 |
n = int(eval(input()))
a = list(map(int, input().split()))
mod = 10 ** 9 + 7
N = 100000
#逆元テーブル
inv_t = [0]+[1]
for i in range(2, N):
inv_t += [inv_t[mod % i] * (mod - int(mod / i)) % mod]
#階乗計算
kai = [1, 1]
rev_kai = [1, inv_t[1]]
for i in range(2, N):
kai.append(kai[-1] * i % mod)
rev_kai.appen... | n = int(eval(input()))
a = list(map(int, input().split()))
mod = 10 ** 9 + 7
N = 100000
#逆元テーブル
inv_t = [0]+[1]
for i in range(2, N):
inv_t += [inv_t[mod % i] * (mod - int(mod / i)) % mod]
#階乗計算
kai = [1, 1]
rev_kai = [1, inv_t[1]]
for i in range(2, N):
kai.append(kai[-1] * i % mod)
rev_kai.appen... | p03674 |
def comb(n,k,p):
from math import factorial
if n<0 or k<0 or n<k: return 0
if n==0 or k==0: return 1
a,b,c = factorial(n)%p,factorial(k)%p,factorial(n-k)%p
return (a*power_func(b,p-2,p)*power_func(c,p-2,p))%p
def power_func(a,b,p):
if b==0: return 1
elif b%2==0:
d = power_func(a,b//2,p)
return d**2... | def comb(n,k):
if n<k or n==0: return 0
elif k==0: return 1
else: return f[n]*p[k]*p[n-k]%(10**9+7)
from collections import Counter
n = int(eval(input()))
print(n)
a = [int(i) for i in input().split()]
twice = Counter(a).most_common(1)[0][0]
x,y = (i for i,j in enumerate(a) if j == twice)
num,y,f,p = 1,n-y... | p03674 |
from collections import Counter
U = 10**5+1
MOD = 10**9+7
fact = [1]*(U+1)
fact_inv = [1]*(U+1)
for i in range(1,U+1):
fact[i] = (fact[i-1]*i)%MOD
fact_inv[U] = pow(fact[U], MOD-2, MOD)
for i in range(U,0,-1):
fact_inv[i-1] = (fact_inv[i]*i)%MOD
def comb(n, k):
if k < 0 or k > n:... | from collections import Counter
U = 10**5+1
MOD = 10**9+7
fact = [1]*(U+1)
fact_inv = [1]*(U+1)
for i in range(1,U+1):
fact[i] = (fact[i-1]*i)%MOD
fact_inv[U] = pow(fact[U], MOD-2, MOD)
for i in range(U,0,-1):
fact_inv[i-1] = (fact_inv[i]*i)%MOD
def comb(n, k):
if k < 0 or k > n:... | p03674 |
from collections import Counter
N = int(input())
src = list(map(int,input().split()))
ctr = Counter(src)
most = ctr.most_common(1)[0][0]
i1 = src.index(most)
i2 = src[i1+1:].index(most) + i1+1
d = i2 - i1
MOD = 10**9+7
def mul(a,b):
return (a*b) % MOD
def pow(a,n): # a^n
ret = 1
mag =... | from collections import Counter
N = int(input())
src = list(map(int,input().split()))
ctr = Counter(src)
doub = ctr.most_common()[0][0]
i1 = src.index(doub)
i2 = src[::-1].index(doub)
doub_len = (i1+i2+1)
MOD = 10**9+7
fac = [1,1] + [0]*N
finv = [1,1] + [0]*N
inv = [0,1] + [0]*N
for i in range(2,N+2):
... | p03674 |
from collections import Counter
N = int(input())
src = list(map(int,input().split()))
ctr = Counter(src)
doub = ctr.most_common()[0][0]
i1 = src.index(doub)
i2 = src[::-1].index(doub)
doub_len = (i1+i2+1)
MOD = 10**9+7
fac = [1,1] + [0]*N
finv = [1,1] + [0]*N
inv = [0,1] + [0]*N
for i in range(2,N+2):
... | N = int(input())
A = list(map(int,input().split()))
MOD = 10**9+7
from collections import Counter
ctr = Counter(A)
d = ctr.most_common(1)[0][0]
x = A.index(d)
y = x+1 + A[x+1:].index(d)
f = x + N-y
MAXN = N+5
fac = [1,1] + [0]*MAXN
finv = [1,1] + [0]*MAXN
inv = [0,1] + [0]*MAXN
for i in range(2,MAXN+2)... | p03674 |
def comb(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 # 出力の制限
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)
inve... | def comb(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 # 出力の制限
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)
inve... | p03674 |
n = int(eval(input()))
a = list(input().split())
if n == 1:
print((1))
print((1))
exit()
MOD = 10 ** 9 + 7
b = sorted(a)
for i in range(n):
if b[i] == b[i + 1]:
d = b[i]
break
first = a.index(d)
for i in range(first + 1, n + 1):
if a[i] == d:
second =... | n = int(eval(input()))
a = list(input().split())
if n == 1:
print((1))
print((1))
exit()
MOD = 10 ** 9 + 7
b = sorted(a)
for i in range(n):
if b[i] == b[i + 1]:
d = b[i]
break
first = a.index(d)
for i in range(first + 1, n + 1):
if a[i] == d:
second =... | p03674 |
n = int(eval(input()))
a = list(input().split())
if n == 1:
print((1))
print((1))
exit()
MOD = 10 ** 9 + 7
b = sorted(a)
for i in range(n):
if b[i] == b[i + 1]:
d = b[i]
break
first = a.index(d)
for i in range(first + 1, n + 1):
if a[i] == d:
second =... | n = int(eval(input()))
a = list(map(int, input().split()))
class ModInv:
def __init__(self, size, MOD):
self.inv = [0] * (size + 1)
self.inv[1] = 1
for i in range(2, size + 1):
self.inv[i] = (-(MOD // i) * self.inv[MOD%i]) % MOD
if n == 1:
print((1))
print((... | p03674 |
from collections import defaultdict
n = int(eval(input())) + 1
a = list(map(int, input().split()))
mod = 10 ** 9 + 7
# 1を一つだけ選ぶやつは重複する可能性
d = defaultdict(int)
left = right = 0
for i in range(n):
if d[a[i]] > 0:
right = i
left = a.index(a[i])
break
d[a[i]] += 1
fac ... | n = int(eval(input())) + 1
a = list(map(int, input().split()))
mod = 10 ** 9 + 7
# 1を一つだけ選ぶやつは重複する可能性
d = [False] * (n + 1)
left = right = 0
for i in range(n):
if d[a[i]]:
right = i
left = a.index(a[i])
break
d[a[i]] = True
fac = [1] * (n + 1)
for i in range(1, n + 1... | p03674 |
N = int(eval(input()))
A = [int(_) for _ in input().split()]
mod = 10**9+7
memo=[0]*(N+2)
def comb(x, y):
if x == N-1 and memo[y] > 0:
return memo[y]
elif y > x:
return 0
elif y * 2 > x:
y = x - y
result = 1
for j in range(1, y + 1):
result *= (x + j - ... | N = int(eval(input()))
A = [int(_) for _ in input().split()]
mod = 10**9 + 7
f = [1] * (N + 2)
fi = [1] * (N + 2)
for i in range(2, N + 2):
f[i] = i * f[i - 1]
f[i] %= mod
for i in range(2, N + 2):
fi[i] = fi[i - 1] * pow(i, mod - 2, mod)
fi[i] %= mod
def comb(n, r):
if 0 <= n and ... | p03674 |
#11
n = int(eval(input()))
a = list(map(int, input().split()))
flag = [a.count(a[i])-1 for i in range(n+1) ]
p = flag.index(1) + list(reversed(flag)).index(1)
g1 = [1, 1]
g2 = [1, 1]
inverse = [0, 1]
mod = 10**9 + 7
for i in range( 2, n + 2 ):
g1.append( ( g1[-1] * i ) % mod )
inverse.append( ( -... |
MOD = 10**9+7
n = int(eval(input()))
la = list(map(int,input().split()))
L = [-1]*(n+1)
l = 0
for i in range(n+1):
a = la[i]
if L[a] == -1:
L[a] = i
else:
l = i - L[a] - 1
break
MAX = n
factorial = [1, 1]
inverse = [0, 1]
inverse_factorial = [1, 1]
for i in range(2,MAX+1):
fact... | p03674 |
n=int(eval(input()))
l=list(map(int,input().split()))
cnt=[0 for i in range(n+1)]
mod=10**9+7
fact=[1]*(n+2)
inv=[1]*(n+2)
for i in range(2,n+2):
fact[i]=i*fact[i-1]%mod
inv[-1]=pow(fact[-1],mod-2,mod)
for i in range(n+1,1,-1):
inv[i-1]=inv[i]*i%mod
def comb(x,y):return fact[x]*inv[y]%mod*inv[x-y]%mo... | n=int(eval(input()))
l=list(map(int,input().split()))
memo={}
for i in range(n+1):
if l[i]in memo:
g=l[i]
x,y=memo[g],i
break
memo[l[i]]=i
mod=10**9+7
fact=[1]*(n+1+1)
inv=[1]*(n+1+1)
for i in range(2,n+1+1):
fact[i]=i*fact[i-1]%mod
inv[-1]=pow(fact[-1],mod-2,mod)
... | p03674 |
def combination_modp(n, r, p): # nCr modpを求める
r = min(n-r, r)
result = 1
for i in range(n, n-r, -1):
result *= i
result %=p
for i in range(1, r+1):
result *= pow(i,p-2,p)
result %= p
return result
n = int(eval(input()))
a = list(map(int,input().split()))
... | n = int(eval(input()))
a = list(map(int,input().split()))
search = [-1 for i in range(n)]
l,r = -1,-1
for i,x in enumerate(a):
if search[x-1] == -1:
search[x-1] = i
else:
l = search[x-1]
r = i
#print(l,r)
p = 10**9 + 7
#前計算
comb1 = [0 for _ in range(n+1)]
comb1[0] = n+1
... | p03674 |
from collections import Counter
n, *a = list(map(int, open(0).read().split()))
n += 1
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
N = n
# 元テーブル
g1 = [0] * (N + 1)
g1[0] = 1
g1[1] = 1
# 逆元テーブル
g2... | from collections import Counter
n, *a = list(map(int, open(0).read().split()))
n += 1
def cmb(n, r, mod=10 ** 9 + 7):
if r < 0 or r > n:
return 0
r = min(r, n - r)
return g1[n] * g2[r] * g2[n - r] % mod
def make_table(n, mod=10 ** 9 + 7):
mod = mod
N = n
# 元テーブル
... | p03674 |
#!/usr/bin/env python3
import sys
from collections import Counter
INF = float("inf")
MOD = 1000000007 # type: int
def cmb(n, r):
r = min(r, n-r)
if r < 0 or r > n:
return 0
if r == 0:
return 1
if r == 1:
return n
numer = [n - r + k + 1 for k in range(r)]... | #!/usr/bin/env python3
import sys
from collections import Counter
INF = float("inf")
MOD = 1000000007 # type: int
class Combination(object):
def __init__(self, N, mod):
self.N = N
self.MOD = mod
self.fac = [0] * (N+1)
self.finv = [0] * (N+1)
self.inv = [0] *... | p03674 |
def d_11(N, A): # N:整数の種類, A:数列
M = 10**9 + 7 # 求めた解の剰余をこれで取る
# 重複した数のインデックスを求める
from collections import Counter
c = Counter(A).most_common(n=1)[0][0] # 重複した整数の値を取得
index = [i for i, x in enumerate(A) if x == c] # 重複した整数のインデックス
l = index[0] + 1
r = index[1] + 1
# フェルマーの小定... | def d_11(MOD=10**9 + 7):
from collections import Counter
class Combination(object):
"""参考: https://harigami.net/contents?id=5f169f85-5707-4137-87a5-f0068749d9bb"""
__slots__ = ["mod", "factorial", "inverse"]
def __init__(self, max_n: int = 10**6, mod: int = 10**9 + 7):
... | p03674 |
def d_11(MOD=10**9 + 7):
from collections import Counter
class Combination(object):
"""参考: https://harigami.net/contents?id=5f169f85-5707-4137-87a5-f0068749d9bb"""
__slots__ = ["mod", "factorial", "inverse"]
def __init__(self, max_n: int = 10**6, mod: int = 10**9 + 7):
... | def d_11(MOD=10**9 + 7):
class Combination(object):
"""参考: https://harigami.net/contents?id=5f169f85-5707-4137-87a5-f0068749d9bb"""
__slots__ = ["mod", "factorial", "inverse"]
def __init__(self, max_n: int = 10**6, mod: int = 10**9 + 7):
fac, inv = [1], []
fac... | p03674 |
# ABC143C - Slimes
from itertools import groupby
def main():
N = int(eval(input()))
S = input().rstrip()
ans = len(tuple(groupby(S)))
print(ans)
if __name__ == "__main__":
main() | def main():
N = int(eval(input()))
S = input().rstrip()
S += "."
ans, cur = 0, S[0]
for s in S[1:]:
if s != cur:
ans += 1
cur = s
print(ans)
if __name__ == "__main__":
main() | p02887 |
f=input;f()
import itertools as it
print((len(list(it.groupby(f()))))) | f=input;n=int(f());s=f()
print((1+sum(s[i]!=s[i-1] for i in range(1,n)))) | p02887 |
# 2019-11-19 10:28:31(JST)
import sys
# import collections
# import math
# from string import ascii_lowercase, ascii_uppercase, digits
# from bisect import bisect_left as bi_l, bisect_right as bi_r
# import itertools
# from functools import reduce
# import operator as op
# import re
# import heapq
# import a... | import sys
n, s = sys.stdin.read().split()
def main():
cnt = 0
prev = '$'
for c in s:
if c == prev: continue
cnt += 1
prev = c
print(cnt)
if __name__ == '__main__':
main() | p02887 |
import sys
def solve():
input = sys.stdin.readline
mod = 10 ** 9 + 7
n = int(input().rstrip('\n'))
s = str(input().rstrip('\n'))
cnt = 0
for i in range(1, n):
if s[i] != s[i-1]:
cnt += 1
print((cnt+1))
if __name__ == '__main__':
solve()
| import sys
def solve():
readline = sys.stdin.buffer.readline
mod = 10 ** 9 + 7
n = int(readline())
s = str(readline().rstrip().decode('utf-8'))
cnt = 0
for i in range(1, n):
if s[i] != s[i-1]:
cnt += 1
print((cnt + 1))
if __name__ == '__main__':
so... | p02887 |
from itertools import groupby
def main():
S = open(0).read().split()[1]
print((len(list(groupby(S)))))
main()
| from itertools import groupby
def main():
S = open(0).read().split()[1]
print((sum(1 for x in groupby(S))))
main()
| p02887 |
n = int(eval(input()))
s = input().rstrip()
def rle(s):
import itertools
return list([(x[0], len(list(x[1]))) for x in itertools.groupby(s)])
print((len(rle(s)))) | import itertools
import sys
input = sys.stdin.readline
ri = lambda: int(eval(input()))
rs = lambda: input().rstrip()
ril = lambda: list(map(int, input().split()))
rsl = lambda: input().rstrip().split()
ris = lambda n: [ri() for _ in range(n)]
rss = lambda n: [rs() for _ in range(n)]
rils = lambda n: [ril()... | p02887 |
N = int(eval(input()))
S = input().strip()
after = S[0]
for i in range(1, N):
if S[i] != S[i-1]:
after += S[i]
print((len(after)))
| N = int(eval(input()))
S = input().strip()
after = [S[0]]
for i in range(1, N):
if S[i] != S[i-1]:
after.append(S[i])
print((len(after)))
| p02887 |
def gcd(a, b):
while a != b:
if a > b :
a -= b
else:
b -= a
return a
N, X=list(map(int, input().split()))
print((3*(N - gcd(N, X))))
| def gcd(a, b):
while a != b:
if a == 0:
return b
elif b == 0:
return a
if a > b :
a %= b
else:
b %= a
return a
N, X=list(map(int, i... | p04048 |
N,X = list(map(int,input().split()))
x = X
y = N-X
res = N
while 1:
if x==y:
res += x
break
if x > y:
x,y = y,x
res += x*2
y -= x
print(res) | N,X = list(map(int,input().split()))
x = X
y = N-X
if x<y:
x,y = y,x
res = N
while y>0:
x,y = y,x
m = x*(y//x)
res += m*2
y -= m
res -= x
print(res) | p04048 |
n,x = list(map(int,input().split()))
ans = n
e = n-x
count = 0
while True:
if x%e == 0:
ans += x//e*(e*2)-e
break
else:
ans += (x//e)*e*2
x,e = e,x%e
count += 1
print(ans) | n,x = list(map(int,input().split()))
ans = n
e = n-x
while e > 0:
if x%e == 0:
ans += x//e*(e*2)-e
else:
ans += (x//e)*e*2
x,e = e,x%e
print(ans) | p04048 |
import os
import sys
if os.getenv("LOCAL"):
sys.stdin = open("_in.txt", "r")
sys.setrecursionlimit(10 ** 9)
INF = float("inf")
IINF = 10 ** 18
MOD = 10 ** 9 + 7
# MOD = 998244353
N, K = list(map(int, sys.stdin.buffer.readline().split()))
a = K
b = N - K
c = 0
d = min(a, b)
while not a == b == ... | import os
import sys
if os.getenv("LOCAL"):
sys.stdin = open("_in.txt", "r")
sys.setrecursionlimit(10 ** 9)
INF = float("inf")
IINF = 10 ** 18
MOD = 10 ** 9 + 7
# MOD = 998244353
N, K = list(map(int, sys.stdin.buffer.readline().split()))
a = K
b = N - K
c = 0
d = min(a, b)
while not a == b =... | p04048 |
n, x = list(map(int, input().split(' ')))
ans = n
c = [x, n-x]
while (c[0] != c[1]):
ans += 2 * min(c)
c = [min(c), max(c)-min(c)]
print((ans+c[0]))
| def sub(a, b):
if (a%b == 0):
return a//b-1
return a//b
def mod(a, b):
if a%b==0:
return b
return a%b
n, x = list(map(int, input().split(' ')))
ans = n
c = [x, n-x]
while (c[0] != c[1]):
c = [min(c), max(c)]
ans += 2*sub(c[1], c[0])*c[0]
c[1] = mod(c[1], c[0... | p04048 |
N, X = list(map(int, input().split(" ")))
e_long = max(X, N-X)
e_short = N - e_long
total = N
while e_long != e_short and e_long > 0 and e_short > 0:
total += e_short * 2
e_long -= e_short
if e_short > e_long:
tmp = e_long
e_long = e_short
e_short = tmp
total += e_... | import sys
input = sys.stdin.readline
def main():
N, X = list(map(int, input().split()))
ans = N
min_ = min(X, N-X)
max_ = max(X, N-X)
while min_ != 0:
# print(max_, min_)
ans += (max_ // min_) * 2 * min_
tmp = max_ % min_
max_ = min_
min_ = tmp
... | p04048 |
N,X=list(map(int,input().split()))
A=N
X,N = sorted((X,N-X))
while N != X:
A += 2*X
X,N=sorted((X,N-X))
print((A+X)) | N,X=list(map(int,input().split()))
A=N
X,N = sorted((X,N-X))
while N != X and X != 0:
if N%X == 0:
A += 2*(N//X-1)*X
X,N=X,X
else:
A += 2*(N//X)*X
X,N=sorted((X,N%X))
print((A+X)) | p04048 |
# -*- coding: utf-8 -*-
import sys
if sys.version_info.minor >= 5: from math import gcd
else: from fractions import gcd
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def l... | # -*- coding: utf-8 -*-
import sys
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in ... | p04048 |
n, x = list(map(int, input().split()))
def func(a, b):
res = 0
while b > 0:
c, d = divmod(a, b)
res += 2 * b * c
a = b
b = d
return res - a
print((n + func(x, n-x))) | n, x = list(map(int, input().split()))
def func(a, b):
if a < b:
a, b = b, a
res = 0
while b > 0:
c, d = divmod(a, b)
res += 2 * b * c
a = b
b = d
return res - a
print((n + func(x, n-x))) | p04048 |
n, x = list(map(int,input().split()))
if n % 2 == 0 and n//2 == x:
print((3 * x))
exit()
if x > n // 2:
x = n - x
xx = x
yy = n - x
ans = n
i = 0
f = False
while True:
if yy >= xx:
ans += 2 * xx
yy -= xx
if yy == 0:
ans -= xx
f... | n, x = list(map(int,input().split()))
if n % 2 == 0 and n//2 == x:
print((3 * x))
exit()
if x > n // 2:
x = n - x
xx = x
yy = n - x
ans = n
i = 0
while True:
if yy >= xx:
ans += 2 * (yy // xx) * xx
yy %= xx
if yy == 0:
ans -= xx
... | p04048 |
n, x = list(map(int, input().split()))
def func(a, b):
if a < b:
if b%a == 0:
return (b//a*2 - 1)*a
else:
q, mod = divmod(b,a)
return 2*q*a + func(a, mod)
elif a > b:
if a%b == 0:
return (a//b*2 - 1)*b
else:
... | # coding:utf-8
def inpl(): return list(map(int, input().split()))
n, x = inpl()
def func(a, b):
if a < b:
a, b = b, a
if a == b:
return a
else:
if a % b == 0:
return (a // b * 2 - 1) * b
else:
q, mod = divmod(a, b)
... | p04048 |
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
n, x = list(map(int, input().split()))
ans = 0
ans += n
l1, l2 = min(n - x, x), max(n - x, x)
#while True:
# if l1 == l2:
# ans += l1
# break
# else:
# ans += (l1 * 2)
# l1, l2 = min(l1, l2 -l1), ma... | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
n, x = list(map(int, input().split()))
ans = 0
ans += n
l1, l2 = min(n - x, x), max(n - x, x)
#while True:
# if l1 == l2:
# ans += l1
# break
# else:
# ans += (l1 * 2)
# l1, l2 = min(l1, l2 -l1), ma... | p04048 |
import sys
import heapq as hp
class Edge:
def __init__(self, end, cost):
self.to = end
self.cost = cost
class Dijkstra:
def __init__(self, V):
self._node = V
self._graph = [[] for i in range(self._node)]
self._inf = sys.maxsize
self.dist = [self._... | import sys
from heapq import heappush, heappop
class Dijkstra:
class Edge:
def __init__(self, end, cost):
self.to = end
self.cost = cost
def __init__(self, V):
self._node = V
self._graph = [[] for i in range(self._node)]
self.inf = 10 ** ... | p02361 |
import sys
import queue
class Dijkstra:
class Edge:
def __init__(self, end, cost):
self.to = end
self.cost = cost
def __init__(self, node_size, inf):
self._node = node_size
self._graph = [[] for _ in range(self._node)]
self.inf = inf
... | import sys
from heapq import heappush, heappop
class Dijkstra:
class Edge:
def __init__(self, end, cost):
self.to = end
self.cost = cost
def __init__(self, node_size, inf):
self._node = node_size
self._graph = [[] for _ in range(self._node)]
... | p02361 |
import sys
import heapq
def dfs(u,s,target, vs):
vs[u] = 1
if(u == target):
global h
heapq.heappush(h,s)
return
for j in range(e):
if(e_1[j] == u):
if(vs[e_2[j]] != 1):
count = s + e_w[j]
print((s,e_2[j],vs))
... | import sys
import heapq
v,e,r=list(map(int, input().split()));
e_1=[0]*e;
e_2=[0]*e;
e_w=[0]*e;
for i in range(e):
e_1[i], e_2[i], e_w[i] = list(map(int, input().split()));
v_q=[];
INF = 9999999999999999999
d = [INF for i in range(v)]
d[r] = 0
heapq.heappush(v_q,(0,r))
while(len(v_q) != 0):
... | p02361 |
from heapq import heappush, heappop
V, E, r = list(map(int, input().split()))
edges = [[] for _ in [None]*V]
vertices = [10**10]*V
vertices[r] = 0
for _ in [None]*E:
s, t, d = list(map(int, input().split()))
edges[s].append((t,d))
q = [(0, r)]
while q:
cost, v = heappop(q)
for dest, _cost... | from heapq import heappush, heappop
V, E, r = list(map(int, input().split()))
inf = 10**10
edges = [[] for _ in [None]*V]
vertices = [inf]*V
vertices[r] = 0
for _ in [None]*E:
s, t, d = list(map(int, input().split()))
edges[s].append((t, d))
q = [(0, r)]
rem = V-1
while q and rem > 0:
cost, ... | p02361 |
from heapq import heappush, heappop
V, E, r = list(map(int, input().split()))
inf = 10**10
edges = [[] for _ in [None]*V]
vertices = [inf]*V
vertices[r] = 0
for _ in [None]*E:
s, t, d = list(map(int, input().split()))
edges[s].append((t, d))
q = [(0, r)]
rem = V-1
while q:
cost, v = heappop(... | import sys
from heapq import heappush, heappop
readline = sys.stdin.readline
V, E, r = list(map(int, readline().split()))
inf = 10**10
edges = [[] for _ in [None]*V]
vertices = [inf]*V
vertices[r] = 0
for _ in [None]*E:
s, t, d = list(map(int, readline().split()))
edges[s].append((t, d))
q = [(0,... | p02361 |
from heapq import heappush, heappop
V, E, r = list(map(int, input().split()))
g = [[] for i in range(V)]
for i in range(E):
s, t, d = list(map(int, input().split()))
g[s].append((t, d))
INF = 10**10
dist = [INF]*V
que = [(0,r)]
dist[r] = 0
while que:
c, v = heappop(que)
if dist[v] < c:
... | class RadixHeap:
__slots__ = ["data", "last", "siz", "used"]
# (max_key - min_key) <= C
def __init__(self, N, C):
self.data = [[] for i in range(C.bit_length() + 1)]
self.last = self.siz = 0
self.used = [0]*N
def push(self, x, key):
#assert self.last <= x
... | p02361 |
from collections import defaultdict
from heapq import heappush, heappop
def main():
#Read stdin
fl = input().split(" ")
V = int(fl[0])
E = int(fl[1])
R = int(fl[2])
#Adjacency list
G = defaultdict(list)
for i in range(int(E)):
s, t, w = [int(x) for x in input().spl... |
from collections import defaultdict
from heapq import heappush, heappop
def main():
#Read stdin
fl = input().split(" ")
V = int(fl[0])
E = int(fl[1])
R = int(fl[2])
#Adjacency list
G = defaultdict(list)
for i in range(int(E)):
s, t, w = [int(x) for x in input().spl... | p02361 |
#!usr/bin/env python3
from collections import defaultdict
def main():
fl = input().split(" ")
V = int(fl[0])
E = int(fl[1])
R = int(fl[2])
#Adjacency list
G = defaultdict(dict)
for i in range(int(E)):
s, t, w = [int(x) for x in input().split(" ")]
G[s][t] = w
... | #!usr/bin/env python3
from collections import defaultdict
def main():
#Read stdin
fl = input().split(" ")
V = int(fl[0])
E = int(fl[1])
R = int(fl[2])
#Adjacency list
G = defaultdict(list)
for i in range(int(E)):
s, t, w = [int(x) for x in input().split(" ")]
... | p02361 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.