input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
import sys
sys.setrecursionlimit(10 ** 5 + 10)
def input(): return sys.stdin.readline().strip()
def resolve():
n=int(eval(input()))
cnt=0
while True:
cnt+=1
if n<=1000*cnt:
print((1000*cnt-n))
break
resolve() | import sys
sys.setrecursionlimit(10 ** 5 + 10)
def input(): return sys.stdin.readline().strip()
def resolve():
n=int(eval(input()))
print((0 if n%1000==0 else 1000-(n%1000)))
resolve() | p02612 |
import sys
n = int((eval(input())))
if n%1000 == 0:
print((0))
else:
while n > 1000:
n -= 1000
print((1000-n)) | import sys
n = int((eval(input())))
if n%1000 == 0:
print((0))
else:
for i in range(10):
if n < 1000:
print((1000-n))
sys.exit()
else:
n -= 1000
| p02612 |
(r, c) = [int(i) for i in input().split()]
ct = [0 for d in range(c)]
tmp = []
for rc in range(r):
tmp = [int(i) for i in input().split()]
total = 0
for cc in range(c):
ct[cc] += tmp[cc]
total += tmp[cc]
print(tmp[cc], end=' ')
print(total)
total = sum(ct)
print(' '... | (r, c) = [int(i) for i in input().split()]
table = []
for rc in range(r):
table.append([int(i) for i in input().split()])
table.append([0 for _ in range(c + 1)])
for rc in range(r):
row_total = 0
for cc in range(c):
table[r][cc] += table[rc][cc]
row_total += table[rc][cc]
... | p02413 |
(r, c) = [int(i) for i in input().split()]
ct = [0 for d in range(c)]
tmp = []
for rc in range(r):
tmp = [int(i) for i in input().split()]
total = 0
for cc in range(c):
ct[cc] += tmp[cc]
total += tmp[cc]
print(tmp[cc], end=' ')
print(total)
total = sum(ct)
print(' ... | (r, c) = [int(i) for i in input().split()]
last_row = [0 for _ in range(c+1)]
for _ in range(r):
row = [int(i) for i in input().split()]
for cc in range(c):
last_row[cc] += int(row[cc])
print(row[cc], end=' ')
print(sum(row))
last_row[-1] = sum(last_row)
print(' '.join([str(a)... | p02413 |
r, c = list(map(int, input().split(' ')))
matrix = []
total_cols = [0 for i in range(c+1)]
for i in range(r):
rows = list(map(int, input().split(' ')));
total = sum(rows)
rows.append(total)
total_cols = [ total_cols[i] + x for i, x in enumerate(rows) ]
matrix.append(rows)
matri... | def main():
r, c = [int(x) for x in input().split()]
matrix = []
totals = [0 for _ in range(c+1)]
for _ in range(r):
nums = [int(x) for x in input().split()]
total = sum(nums)
row = nums + [total]
matrix.append(row)
for i in range(c+1):
... | p02413 |
(r,c) = [int(i) for i in input().split()]
table = []
for rc in range(r):
table.append([int(i) for i in input().split()])
table.append([0 for _ in range(c + 1)])
for rc in range(r):
row_total = 0
for cc in range(c):
table[r][cc] += table[rc][cc]
row_total += table[rc][cc]
... | (r, c) = [int(i) for i in input().split()]
last_row = [0 for _ in range(c+1)]
for _ in range(r):
row = [int(i) for i in input().split()]
for cc in range(c):
last_row[cc] += int(row[cc])
print(row[cc], end=' ')
print(sum(row))
last_row[-1] = sum(last_row)
print(' '.join([str... | p02413 |
h, w = [int(i) for i in input().split()]
date = [[int(q) for q in input().split()] for e in range(h)]
date2=[]
date3=[]
for r in range(0, h):
for t in range(0, w):
print(date[r][t], end=' ')
print(sum(date[r]))
for k in range(0,w):
for j in range(0,h):
date2.append(date[j][k])
fo... | r, c =[int(i) for i in input().split()]
date =[]
sum_row = [0] * (c + 1)
for ri in range(r):
date.append([int(i) for i in input().split()])
date[ri].append(sum(date[ri]))
print((" ".join([str(d) for d in date[ri]])))
for ci in range(c + 1):
sum_row[ci] += date[ri][ci]
print((" ".j... | p02413 |
r, c = map(int, input().split())
a = [[0 for i in range(c+1)] for j in range(r+1)]
for i in range(r):
l = list(map(int, input().split()))
for j in range(c):
a[i][j] = l[j]
a[i][c] += a[i][j]
for i in range(c+1):
for j in range(r):
a[r][i] += a[j][i]
for i in range(r+1):... | r, c = map(int, input().split())
a = [[int(i) for i in input().split()] for j in range(r)]
b = [[0 for i in range(c+1)] for j in range(r+1)]
for i in range(r):
for j in range(c):
b[i][j] = a[i][j]
b[i][c] += a[i][j]
for i in range(c+1):
for j in range(r):
b[r][i] += b[j][i... | p02413 |
r,c=map(int,input().split())
a,b=[],[0]*c
for i in range(r):
x=list(map(int,input().split()))
print(*x, end=' ')
print(sum(x))
for j in range(c):
b[j]+=x[j]
print(*b, end=' ')
print(sum(b))
| r,c=map(int,input().split())
a=[0]*c
for i in range(r):
x=list(map(int,input().split()))
for j in range(c):
a[j]+=x[j]
print(*x, end=' ')
print(sum(x))
print(*a, end=' ')
print(sum(a))
| p02413 |
m,n=map(int,input().split())
a =[]
for _ in range(m):
a.append(list(map(int,input().split())))
for index in range(m):
a[index].append(sum(a[index]))
for a_column in a:
for num in a_column[:-1]:
print(num, end=' ')
print(a_column[-1])
for row_index in range(n):
sum = 0
for a_c... | m,n=list(map(int,input().split()))
a =[]
for _ in range(m):
a.append(list(map(int,input().split())))
for index in range(m):
a[index].append(sum(a[index]))
for a_column in a:
print((' '.join(map(str, a_column))))
a.append([0]*(n+1))
for row_index in range(n+1):
for a_column in a[:-1]:
... | p02413 |
N,M = list(map(int,input().split()))
table = [1,1]
while len(table) <= N:
temp = table[0]
for i in range(len(table)-1):
table[i+1] += temp
temp = table[i+1]- temp
table[i+1] %= M
table.append(1)
S = [1]
rev2 = pow(2, M-2, M)
base = pow(2, N, M)
ans = 0
S = [1]
f... | N, M = list(map(int, input().split()))
fact = [1]*(N+1)
rfact = [1]*(N+1)
for i in range(1, N+1):
fact[i] = r = (i * fact[i-1]) % M
rfact[i] = pow(r, M-2, M)
S = [1]
rev2 = pow(2, M-2, M)
base = pow(2, N, M)
ans = 0
S = [1]
for K in range(N+1):
res = (fact[N] * rfact[K] * rfact[N-K]) % M
... | p03375 |
while True:
n = int(eval(input()))
if n == 0:
break
wlst = list(map(int, input().split()))
dp = [[0] * n for _ in range(n + 1)]
def check(left1, right1, left2, right2, cnt):
if left1 > right1 and left2 > right2: return cnt
if left1 > right1:return dp[right2 - left2 + 1][left2] + cnt
... | def main():
while True:
n = int(eval(input()))
if n == 0:
break
wlst = list(map(int, input().split()))
connect = [[None] * n for _ in range(n)]
for i in range(n):
for j in range(n):
connect[i][j] = abs(wlst[i] - wlst[j]) <= 1
max_lst = [[False] * (n + 1) for... | p01096 |
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**10
mod = 10**9+7
dd = [(-1,0),(0,1),(1,0),(0,-1)]
ddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]
def LI(): return [int(x) for x in s... | import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**10
mod = 10**9+7
dd = [(-1,0),(0,1),(1,0),(0,-1)]
ddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]
def LI(): return [int(x) for x in s... | p01096 |
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,k=list(map(int,input().split()))
a=list(map(int,input().split()))
l=[]
l2=[]
for i in range(n):
l.append([a[i],i])
l.sort()
for i in range(n):
l2.append([l[i][1],i])
l2.sort()
mod=10**9+7
g1=[1,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
n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
a.sort()
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[mo... | p02804 |
#!/usr/bin/env python3
import sys
MOD = 1000000007 # type: int
from itertools import accumulate
def mod_factorial(n):
value = 1
for i in range(n,0,-1):
value*=i
value%=MOD
return value
def solve(N: int, K: int, A: "List[int]"):
A.sort()
n = N-1
r = K-1
... | #!/usr/bin/env python3
import sys
MOD = 1000000007 # type: int
from itertools import accumulate
def mod_factorial(n):
value = 1
for i in range(n,0,-1):
value*=i
value%=MOD
return value
def solve(N: int, K: int, A: "List[int]"):
A.sort()
n = N-1
r = K-1
... | p02804 |
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
A = sorted(A)
def framod(n, mod, a=1):
for i in range(1,n+1):
a=a * i % mod
return a
def power(n, r, mod):
if r == 0: return 1
if r%2 == 0:
return power(n*n % mod, r//2, mod) % mod
if r%2 == 1:
... | N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
A = sorted(A)
p = 1000000007
frac = [1]
for i in range(N):
frac.append(frac[i]*(i+1)%p)
def power(n, r, mod):
if r == 0: return 1
if r%2 == 0:
return power(n*n % mod, r//2, mod) % mod
if r%2 == 1:
retu... | p02804 |
def nCr(n,r):
if n < 0 or r < 0 or n < r: return 0
if n - r < r: r = n - r
if r == 0: return 1
if r == 1: return n
# 分子のn*(n-1)*...がr個分続くやつ
numerator = [n-r+k+1 for k in range(r)]
# 分母：r!=r*(r-1)*...*3*2の要素
denominator = [k+1 for k in range(r)]
# 分母の要素で割れる部分を割っていく部分
for p in rang... |
N,K = list(map(int, input().split()))
MOD = 10**9+7
A = list(map(int, input().split()))
A.sort()
if N == 1 or K == 1:
print((0))
exit()
def nCr(n, r, p):
if (r < 0) or (n < r):
return 0
r = min(r, n - r)
# nCr = n! / (r! * (n-r)!)
return fact[n] * factinv[r] * ... | p02804 |
n,k=list(map(int,input().split()))
a=sorted(list(map(int,input().split())))
mod=10**9+7
ans=0
MOD=10**9+7
from operator import mul
from functools import reduce
def cmb(n,r):
r = min(n-r,r)
if r == 0: return 1
over = reduce(mul, list(range(n, n - r, -1)))
under = reduce(mul, list(range(1,r... | n,k=list(map(int,input().split()))
a=sorted(list(map(int,input().split())))
mod=10**9+7
ans=0
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):
if n < r or ... | p02804 |
# modulo:mod
# inverse x^(-1)
def inv(x):
global mod
return pow(x,mod-2,mod)
# factorial x!
def fact(x):
global mod
res=1
for i in range(2,x+1):
res=res*i%mod
return res
# combination nCr
def combi(n,r):
if r<0 or r>n:
return 0
else:
return ... | # modulo:mod
# inverse x^(-1)
def inv(x):
global mod
return pow(x,mod-2,mod)
# factorial x!
def fact(x):
global mod
res=1
for i in range(2,x+1):
res=res*i%mod
return res
# combination nCr
def combi(n,r):
if r<0 or r>n:
return 0
else:
return ... | p02804 |
import sys
input = sys.stdin.readline
def inv(x):
return pow(x, MOD-2, MOD)
def C(n, r):
if r>n:
return 0
#return fact[n]//fact[r]//fact[n-r]
#return fact[n]*inv(fact[r])*inv(fact[n-r])
return fact[n]*inv_table[r]*inv_table[n-r]
N, K = list(map(int, input().split()))
A =... | def inv(x):
return pow(x, MOD-2, MOD)
def C(n, r):
if r>n:
return 0
return fact[n]*inv_table[r]*inv_table[n-r]
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
A.sort()
ans = 0
MOD = 10**9+7
fact = [1]
for i in range(1, N+1):
fact.append(fact[-1]*i%... | p02804 |
import sys
def input(): return sys.stdin.readline().strip()
def mapint(): return list(map(int, input().split()))
sys.setrecursionlimit(10**9)
N, K = mapint()
from collections import Counter
As = list(mapint())
count = Counter(As)
mod = 10**9+7
maxi = 0
cum = 0
pos = {}
neg = {}
pos[0] = 1
neg[0] = 1
As... | import sys
def input(): return sys.stdin.readline().strip()
def mapint(): return list(map(int, input().split()))
sys.setrecursionlimit(10**9)
N, K = mapint()
As = list(mapint())
mod = 10**9+7
As.sort()
pos = {}
neg = {}
pos[0] = 1
neg[0] = 1
for i in range(1, 10**5+3):
pos[i] = (pos[i-1]*i)%mod
... | p02804 |
n,k = list(map(int, input().split()))
a = sorted(list(map(int, input().split())))
def framod(n, mod, a=1):
for i in range(1,n+1):
a=a * i % mod
return a
def power(n, r, mod):
if r == 0: return 1
if r%2 == 0:
return power(n*n % mod, r//2, mod) % mod
if r%2 == 1:
... | n,k = list(map(int, input().split()))
a = sorted(list(map(int, input().split())))
ans=0
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 comb(n, r, mod):
if n < r or r < 0:
... | p02804 |
from collections import deque
N, K = list(map(int, input().split()))
A = [int(x) for x in input().split()]
A = sorted(A)
B = deque()
C = deque()
mod = (10**9)+7
for h in range(N):
B.append(A[h])
C.append(A[h])
def cmb(n, r): # 【Python】組み合わせ(nCr) 計算の高速化より引用
if (r < 0 or r > n):
retur... | from collections import deque
N, K = list(map(int, input().split()))
A = [int(x) for x in input().split()]
A = sorted(A)
B = deque()
C = deque()
mod = (10**9)+7
for h in range(N):
B.append(A[h])
C.append(A[h])
def cmb(n, r): # 【Python】組み合わせ(nCr) 計算の高速化より引用
if (r < 0 or r > n):
retur... | p02804 |
N, K=(int(i) for i in input().split())
A=[int(i) for i in input().split()]
A= sorted(A)
from math import factorial
inf=10**9+7
ans=0
for i in range(K, N+1):
#(N-1)C(K-1)
ans+=(A[i-1]*factorial(i-1) // factorial(K-1) // factorial(i-1-K+1))%inf
for i in range(1, N-K+2):
#(N-i)C(K-1)
ans-=... |
N, K=(int(i) for i in input().split())
A=[int(i) for i in input().split()]
A= sorted(A)
from math import factorial
inf=10**9+7
ans=0
def cmb(n, r, p):
if (r < 0) or (n < r):
return 0
r = min(r, n - r)
return fact[n] * factinv[r] * factinv[n-r] % p
p = 10 ** 9 + 7
fact = [1, 1] #... | p02804 |
def main():
def modinv(a, mod=10**9+7):
return pow(a, mod-2, mod)
def comb(n, r, mod=10**9+7):
r = min(r, n-r)
res = 1
for i in range(r):
res = res * (n - i) * modinv(i+1, mod) % mod
return res
import sys
input = sys.stdin.readline
mod = 10**9+7
n,k... | def make_array_for_comb(N, mod=10**9+7):
fact = [1,1]
fact_inv = [1,1]
inv = [0,1]
for i in range(2, N+1):
fact.append((fact[-1]*i) % mod)
# モジュラ逆数の性質
inv.append((-inv[mod%i] * (mod//i)) % mod)
fact_inv.append((fact_inv[-1]*inv[i]) % mod)
return fact, fact_in... | p02804 |
n, k = list(map(int, input().split()))
a = sorted(list(map(int, input().split())))
MOD = 1000000007
def pow(x, y):
if y == 0:
return 1
ans = 1
while y > 1:
if y % 2 != 0:
ans *= x
ans %= MOD
x *= x
x %= MOD
y //= 2
r... | n, k = list(map(int, input().split()))
a = sorted(list(map(int, input().split())))
MOD = 1000000007
def pow(x, y):
if y == 0:
return 1
ans = 1
while y > 1:
if y % 2 != 0:
ans *= x
ans %= MOD
x *= x
x %= MOD
y //= 2
r... | p02804 |
# https://atcoder.jp/contests/abc151/tasks/abc151_e
def calc(x,y):
a = fac[x]
b = fac[y]
c = fac[x-y]
ret = ( (a%p)*pow(b,p-2,p)*pow(c,p-2,p))%p
return ret
N,K=list(map(int,input().split()))
A=list(map(int,input().split()))
A.sort()
p=10**9+7
fac=[1]
for i in range(1,N+1):
fac... | # https://atcoder.jp/contests/abc151/tasks/abc151_e
def calc(x,y):
a = fac[x]
b = fac[y]
c = fac[x-y]
ret = ( (a%p)*pow(b,p-2,p)*pow(c,p-2,p))%p
return ret
N,K=list(map(int,input().split()))
A=list(map(int,input().split()))
A.sort()
p=10**9+7
fac=[1]
for i in range(1,N+1):
fac... | p02804 |
import math
def combinations_count(n, r):
a = 1
b = 1
if (n != 0) & (n >= r):
for i in range(n, n - r, -1):
a *= i
b *= i - n + r
return a // b
else:
return 0
n, k = list(map(int, input().split()))
a = [int(i) for i in input().split()]
a.s... | n, k = list(map(int, input().split()))
a = [int(i) for i in input().split()]
a.sort()
mod = 10 ** 9 + 7
ans = 0
f = [1] * (n + 1)
inv = [1] * (n + 1)
for i in range(1, n + 1):
f[i] = (f[i - 1] * i) % (mod)
inv[n] = pow(f[n], mod - 2, mod)
for i in range(n - 1, 0, -1):
inv[i] = inv[i + 1] * (i + 1) ... | p02804 |
import math
def comb(n,r,m):
if r == 0: return 1
return math.factorial(n)*pow(f,m-2,m)*pow(math.factorial(n-r),m-2,m)
N,K,*a = list(map(int, open(0).read().split()))
m = 1000000007
f = math.factorial(K-1)
a.sort()
ans = 0
if K == 1:
print((0))
else:
for i in range(1,N-K+2):
ans ... | 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)
N,K,*a = list(map(int, open(0).read().split()))
m = 1000000007
memf = []
mfappend = me... | p02804 |
SIZE=10**5+1; MOD=10**9+7 #998244353 #ここを変更する
SIZE += 1
inv = [0]*SIZE # inv[j] = j^{-1} mod MOD
fac = [0]*SIZE # fac[j] = j! mod MOD
finv = [0]*SIZE # finv[j] = (j!)^{-1} mod MOD
inv[1] = 1
fac[0] = fac[1] = 1
finv[0] = finv[1] = 1
for i in range(2,SIZE):
inv[i] = MOD - (MOD//i)*inv[MOD%i]%MOD
f... | SIZE=10**5+1; MOD=10**9+7 #998244353 #ここを変更する
SIZE += 1
inv = [0]*SIZE # inv[j] = j^{-1} mod MOD
fac = [0]*SIZE # fac[j] = j! mod MOD
finv = [0]*SIZE # finv[j] = (j!)^{-1} mod MOD
inv[1] = 1
fac[0] = fac[1] = 1
finv[0] = finv[1] = 1
for i in range(2,SIZE):
inv[i] = MOD - (MOD//i)*inv[MOD%i]%MOD
f... | p02804 |
n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
a.sort()
mod=10**9+7
MAX_N=n+5
fac = [1,1] + [0]*MAX_N
finv = [1,1] + [0]*MAX_N
inv = [0,1] + [0]*MAX_N
for i in range(2,MAX_N):
fac[i] = fac[i-1] * i % mod
inv[i] = mod - inv[mod % i] * (mod // i) % mod
finv[i] = finv[i-1] * inv[i... | from sys import stdin
nii=lambda:list(map(int,stdin.readline().split()))
lnii=lambda:list(map(int,stdin.readline().split()))
n,k=nii()
a=lnii()
a.sort()
mod=10**9+7
MAX_N = n+5
fac = [1,1] + [0]*MAX_N
finv = [1,1] + [0]*MAX_N
inv = [0,1] + [0]*MAX_N
for i in range(2,MAX_N):
fac[i] = fac[i-1] * i % m... | p02804 |
from operator import mul
from functools import reduce
def cmb(n,r):
r = min(n-r,r)
if r == 0: return 1
over = reduce(mul, list(range(n, n - r, -1)))
under = reduce(mul, list(range(1,r + 1)))
return over // under
N,K=list(map(int,input().split()))
A=list(map(int,input().split()))
MO... |
N,K=list(map(int,input().split()))
A=list(map(int,input().split()))
MOD=10**9+7
A.sort()
fac=[None for i in range(N)]
finv=[None for i in range(N)]
inv=[None for i in range(N)]
def COMinit(num):
global fac
global finv
global inv
fac[0]=1
fac[1]=1
finv[0]=1
finv[1]=1
... | p02804 |
def main():
n,k = list(map(int,input().split()))
A = list(map(int,input().split()))
A.sort()
mod=10**9+7
sum=0
def we_want(x):
ans=1
for i in range(k-1):
ans=ans*(x-i)*pow(i+1,mod-2,mod)%mod
return ans
def check_min(i):
... | n, k = list(map(int, input().split()))
a = sorted(list(map(int, input().split())))
mod = 10 ** 9 + 7
b = 1
ans = 0
for i in range(k - 1, n):
ans += b * (a[i] - a[n - i - 1])
ans %= mod
b = (i+1)*pow(i-k+2, mod - 2, mod) * b % mod
print(ans) | p02804 |
import math
MOD = 10 ** 9 + 7
def comb(n, r):
if (r < 0) or n < r:
return 0
return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))
def solve(N, K, A):
A.sort()
ans = 0
for i in range(1, N):
now = comb(i, K - 1)
ans += A[i] * now
... | MOD = 10 ** 9 + 7
def solve(N, K, A):
A.sort()
ans = 0
for i in range(1, N):
now = cmb(i, K - 1, MOD)
ans += A[i] * now
A.sort(reverse=True)
for i in range(1, N):
now = cmb(i, K - 1, MOD)
ans += A[i] * (-now)
return ans % MOD
# N = int... | p02804 |
def combination(n, k, MOD):
if(k > n or k < 0):
return 0
frac = [1]*(n+1)
for i in range(1, n+1):
frac[i] = (frac[i-1]*i)%MOD
return (frac[n]*pow(frac[k], MOD-2, MOD)*pow(frac[n-k], MOD-2, MOD))%MOD
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
A.sort()
MOD = 10*... | N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
A.sort()
MOD = 10**9+7
#c[i] := (i)C(K-1)
c = [0] * (N+1)
#frac[i] = i!%MOD
frac = [1] * (N+1)
for i in range(1, N+1):
frac[i] = (frac[i-1]*i)%MOD
for i in range(1, N+1):
if(i >= K-1):
c[i] = frac[i]*pow(frac[K-1], MOD-2, M... | p02804 |
n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
a=sorted(a)
mod=10**9+7
from operator import mul
from functools import reduce
def cmb(n,r):
r=min(n-r,r)
if r==0:
return 1
else:
over=reduce(mul,list(range(n,n-r,-1)))
under=reduce(mul,list(range(1,r+1)... | n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
a=sorted(a)
mod=10**9+7
ans=0
f=[1]
for i in range(1,n+1):
f.append((f[-1]*i)%mod)
for i in range(n-k+1):
ans+=(f[k+i-1]*pow(f[i],mod-2,mod)*pow(f[k-1],mod-2,mod))*(a[k-1+i]-a[n-k-i])
print((ans%mod)) | p02804 |
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
A.sort()
mod = 10 ** 9 + 7
f = [1, 1]
for i in range(2, N+1):
f.append(f[i-1] * i)
fk = pow(f[K-1], mod - 2, mod)
total = 0
for i in range(N - K + 1):
p = N - i - 1
q = K - 1
c = (f[p] * fk * pow(f[p-q], m... | N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
A.sort()
mod = 10 ** 9 + 7
f = [i for i in range(N+1)]
for i in range(2, N+1):
f[i] *= f[i-1]
f[i] %= mod
f[0] = 1
q = K - 1
fk = pow(f[q], mod - 2, mod)
total = 0
for i in range(N - K + 1):
p = N - i - 1
... | p02804 |
MOD=10**9+7
n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
a.sort(reverse=True)
fact = [1]
fact_inv = [1]
mod=10**9+7
for i in range(10**5+1):
new_fact = fact[-1]*(i+1)%mod
fact.append(new_fact)
fact_inv.append(pow(new_fact,mod-2,mod))
def mod_comb_k(n,k,mod):
... | MOD=10**9+7
n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
a.sort(reverse=True)
#前計算
fact = [1]
fact_inv = [1]
mod=10**9+7
for i in range(n+1):
new_fact = fact[-1]*(i+1)%mod
fact.append(new_fact)
fact_inv.append(pow(new_fact,mod-2,mod))
def mod_comb_k(n,k,mod):
re... | p02804 |
MOD=10**9+7
n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
a.sort(reverse=True)
#前計算
fact = [1]
fact_inv = [1]
mod=10**9+7
for i in range(n+1):
new_fact = fact[-1]*(i+1)%mod
fact.append(new_fact)
fact_inv.append(pow(new_fact,mod-2,mod))
def mod_comb_k(n,k,mod):
re... | MOD=10**9+7
n,k=list(map(int,input().split()))
a=sorted(list(map(int,input().split())),reverse=True)
#----------------------------------------------------------
# nCk mod 10**9+7
# 前計算
fact=[1]
fact_inv=[1]
mod=10**9+7
for i in range(n+1):
new_fact=fact[-1]*(i+1)%mod
fact.append(new_fact)
fact_inv... | p02804 |
P = 10**9+7
N, K = list(map(int, input().split()))
S = list(map(int, input().split()))
S.sort()
ans = 0
c = 1
for i in range(N-K+1):
ans += (S[K-1+i]*c)%P
ans -= (S[N-K-i]*c)%P
ans %= P
c = c*(K+i)//(i+1)
print(ans) | P = 10**9+7
N, K = list(map(int, input().split()))
S = list(map(int, input().split()))
S.sort()
ans = 0
c = 1
for i in range(N-K+1):
ans += (S[K-1+i]*c)%P
ans -= (S[N-K-i]*c)%P
ans %= P
c = c*(K+i)*pow(i+1, P-2, P)%P
print(ans) | p02804 |
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
MOD = 1000000007
def combinations(n, r):
r = min(r, n - r)
num = 1
den = 1
for i in range(1, r + 1):
num = num * (n + 1 - i) % MOD
den = den * i % MOD
return num * pow(den, MOD - 2, MOD) ... | N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
MOD = 1000000007
def combinations(n, r, MOD):
if (r < 0) or (n < r):
return 0
r = min(r, n - r)
return fact[n] * fact_inv[r] * fact_inv[n - r] % MOD
A.sort()
fact = [1, 1]
fact_inv = [1, 1]
inv = [0, ... | p02804 |
import sys
input = sys.stdin.readline
N, K = list(map(int, input().split()))
a = list(map(int, input().split()))
mod = 10 ** 9 + 7
res = 0
a.sort()
cs = [0] * (N + 1)
for i in range(N): cs[i + 1] = cs[i] + a[i]
#print(cs)
class Factorial:
def __init__(self, n, mod):
self.f = [1]
for i in range(... | import sys
input = sys.stdin.readline
N, K = list(map(int, input().split()))
a = list(map(int, input().split()))
mod = 10 ** 9 + 7
a.sort()
class Factorial:
def __init__(self, n, mod):
self.mod = mod
self.f = [1]
for i in range(1, n + 1):
self.f.append(self.f[-1] * i % mod)
self.i ... | p02804 |
from heapq import heappush, heappop
from collections import deque
import re
import math
import functools
import itertools
import fractions
def sRaw():
return input().rstrip("\r")
def iRaw():
return int(eval(input()))
def ssRaw():
return input().split()
def isRaw():
return lis... |
def sRaw():
return input().rstrip("\r")
def iRaw():
return int(eval(input()))
def ssRaw():
return input().split()
def isRaw():
return list(map(int, ssRaw()))
INF = 1 << 29
DIV = (10**9) + 7
def mod_inv_prime(a, mod=DIV):
return pow(a, mod-2, mod)
def mod_inv(a, b):
... | p02804 |
import itertools
N, K = (int(x) for x in input().split())
As = (int(x) for x in input().split())
def f(S):
m = 1000000001
M = -1000000001
for a in S:
m = min(m, a)
M = max(M, a)
return M - m
Ss = list(itertools.combinations(As, K))
answer = 0
for S in Ss:
... | import itertools
N, K = (int(x) for x in input().split())
As = (int(x) for x in input().split())
def f(S):
m = 1000000001
M = -1000000001
for a in S:
m = min(m, a)
M = max(M, a)
return M - m
answer = 0
for S in itertools.combinations(As, K):
answer = answer + f(... | p02804 |
import itertools
mod = 10**9 +7
n,k = [int(i) for i in input().split()]
l = [int(i) for i in input().split()]
f = list(itertools.combinations(l, k))
ans = 0
for i in f:
ans += (max(i) - min(i))
print((ans%mod))
| import itertools
mod = 10**9 +7
n,k = [int(i) for i in input().split()]
l = [int(i) for i in input().split()]
f = itertools.combinations(l, k)
ans = 0
for i in f:
ans += abs(i[0] - i[k-1])
print((ans%mod))
| p02804 |
N,K = list(map(int,input().split()))
A = list(map(int,input().split()))
A.sort()
p = 10 ** 9 + 7
#二項定理(nCr)を高速に計算する
def cmb(n,r,p):
N = 10 ** 5 + 5 #必要なサイズを指定
fact = [1,1]
factinv = [1,1]
inv = [0,1]
for i in range(2,N+1):
fact.append((fact[-1] * i) % p)
inv.append((-inv[... | N,K = list(map(int,input().split()))
A = list(map(int,input().split()))
A.sort()
mod = p = 10 ** 9 + 7
fact = [1]
fact_inv = [1]
for i in range(10**5+5):
new_fact = fact[-1]*(i+1)%mod
fact.append(new_fact)
fact_inv.append(pow(new_fact,mod-2,mod))
def mod_comb_k(n,k,mod):
return fact[n... | p02804 |
def cmb1(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 )
inverse.a... | n, k =list(map(int, input().split()))
A = list(map(int, input().split()))
mod = 10**9+7
N = 10**5+50
fac = [1]*(N+1)
finv = [1]*(N+1)
for i in range(N):
fac[i+1] = fac[i] * (i+1) % mod
finv[-1] = pow(fac[-1], mod-2, mod)
for i in reversed(list(range(N))):
finv[i] = finv[i+1] * (i+1) % mod
def cmb... | p02804 |
#import sys
#input = sys.stdin.readline
Q = 10**9+7
def getInv(N):#Qはmod
inv = [0] * (N + 1)
inv[0] = 1
inv[1] = 1
for i in range(2, N + 1):
inv[i] = (-(Q // i) * inv[Q%i]) % Q
return inv
def getFactorialInv(N):
inv = [0] * (N + 1)
inv[0] = 1
inv[1] = 1
ret = ... | #import sys
#input = sys.stdin.readline
Q = 10**9+7
# def getInv(N):#Qはmod
# inv = [0] * (N + 1)
# inv[0] = 1
# inv[1] = 1
# for i in range(2, N + 1):
# inv[i] = (-(Q // i) * inv[Q%i]) % Q
# return inv
def main():
N, K = list(map( int, input().split()))
if K == 1:
... | p02804 |
def cmb(a,b,c):
b = min(b,a-b)
num = 1
for i in range(b):
num = num*(a-i) % c
den = 1
for i in range(b):
den = den*(i+1) % c
return num * pow(den,c-2,c) % c
mod = 10**9 + 7
n,k = list(map(int,input().split()))
inv = [0,1]
for i in range(2,n):
inv += [inv[mod % i]*(... | def cmb(a,b,c):
b = min(b,a-b)
num = 1
for i in range(b):
num = num*(a-i) % c
den = 1
for i in range(b):
den = den*(i+1) % c
return num * pow(den,c-2,c) % c
mod = 10**9 + 7
n,k = list(map(int,input().split()))
inv = [0,1]
for i in range(2,n):
inv += [inv[mod % i]*(... | p02804 |
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
mod = int(1e+9 + 7)
a = sorted(a)
kai = [1, 1]
gyaku = [1, 1]
for i in range(2, n+1):
kai.append(kai[-1]*i % mod)
gyaku.append(gyaku[-1]*pow(i, mod-2, mod))
answer = 0
for i in range(n-k+1):
for j in range(i+k-1,n):
... | n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
mod = int(1e+9 + 7)
a = sorted(a)
kai = [1]*(n+1)
gyaku = [1]*(n+1)
for i in range(2, n+1):
kai[i] = kai[i-1]*i % mod
gyaku[i] = gyaku[i-1]*pow(i, mod-2, mod) %mod
answer = 0
for i in range(n-k+1):
for j in range(i+k... | p02804 |
from functools import lru_cache
@lru_cache(maxsize=2**17, typed=int)
def comb(n, r, p):
r = min(n - r, r)
if r == 0:
return 1
over = 1
for i in range(n, n - r, -1):
over = over * i % p
under = 1
for i in range(1, r + 1):
under = under * i % p
inv = pow... | def main():
n, k = list(map(int, input().split()))
a = sorted(int(i) for i in input().split())
mod = 10**9 + 7
comb = [1] * (n - k + 1)
for i in range(n - k):
comb[i + 1] = (comb[i] * (k + i) * pow(i + 1, mod - 2, mod)) % mod
f = 0
for i in range(n - k + 1):
f = (f +... | p02804 |
import sys
input = sys.stdin.readline
mod = 10 ** 9 + 7
N, K = list(map(int, input().split()))
A = sorted(list(map(int, input().split())))
minus = 0
plus = 0
fact = [0] * (N+1)
fact[0] = 1
pow_fact = [0] * (N+1)
pow_fact[0] = 1
fa = 1
for i in range(1, N+1):
fa *= i
fact[i] = fa
pow_fact[i] =... | import sys
input = sys.stdin.readline
mod = 10 ** 9 + 7
N, K = list(map(int, input().split()))
A = sorted(list(map(int, input().split())))
minus = 0
plus = 0
fact = [0] * (N+1)
fact[0] = 1
pow_fact = [0] * (N+1)
pow_fact[0] = 1
fa = 1
for i in range(1, N+1):
fa *= i
fa %= mod
fact[i] = fa
... | p02804 |
import itertools as it
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
a.sort()
ans=0
for i in it.combinations([i for i in range(n)], k):
max_x = a[max(i)]
min_x = a[min(i)]
ans += (max_x - min_x)
print((ans%(10**9 +7)))
| class Combination(): # nCr(mod p) #n<=10**6
def __init__(self, N, MOD): # cmbの前処理
self.mod = MOD
self.FACT = [1, 1] # 階乗
self.INV = [0, 1] # 各iの逆元
self.FACTINV = [1, 1] # 階乗の逆元
for i in range(2, N + 1):
self.FACT.append((self.FACT[-1] * i) % self.mod)
... | p02804 |
n,k=list(map(int,input().split()))
a=sorted(list(map(int,input().split())))
mod = 10**9+7 # 変える
fac = [1]*n
finv = [1]*n
inv = [0]*n
inv[1] = 1
for i in range(2,n):
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,k):
if n<k:
... | n,k=list(map(int,input().split()))
a=sorted(list(map(int,input().split())))
mod = 10**9+7 # 変える
fac = [1]*n
finv = [1]*n
inv = [0]*n
inv[1] = 1
for i in range(2,n):
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,k):
if n<k:
... | p02804 |
# -*- coding: utf-8 -*-
# E
import sys
from functools import reduce
# 再起回数上限変更
# sys.setrecursionlimit(1000000)
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
mod = 10**9 + 7
A.sort()
# print(A)
def cmb(n, r):
from operator import mul
from functools import red... | # -*- coding: utf-8 -*-
# E
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
A.sort()
mod = 10**9 + 7
class Cmb(object):
def cmb_precalc(self, n, r, mod: int = 10 ** 9 + 7):
if (r < 0) or (r > n):
return 0
r = min(r, n - r)
return self.g... | p02804 |
N,K = list(map(int,input().split()))
A = list(map(int,input().split()))
mod = 10**9+7
import itertools
ans = 0
for a in itertools.combinations(A,K):
ans += (max(a)-min(a))%mod
ans %= mod
print(ans) | N,K = list(map(int,input().split()))
A = list(map(int,input().split()))
A.sort()
fact_l=[1]*(N+10)
mod = 10**9+7
for i in range(2,N+1):
fact_l[i]=(fact_l[i-1]*i)%mod
fact_inv_l = [1]*(N+10)
for i in range(2,N+1):
fact_inv_l[i]=pow(fact_l[i],mod-2,mod)
ans = 0
for i in range(1,N-K+2):
b = N-i
c ... | p02804 |
def factorial(n, p):
ret = 1
for i in range(n, 0, -1):
ret *= i
ret %= p
return ret
def comb(n, r, p):
r = min(r, n - r)
a = factorial(r, p)
b = factorial(n - r, p)
ret = factorial(n, p) * pow(a, p - 2, p) * pow(b, p - 2, p) % p
return ret
mod = 10 ** ... | def cmb(n, r, p):
if r < 0 or n < r:
return 0
r = min(r, n - r)
return fact[n] * fact_inv[r] * fact_inv[n - r] % p
n, k = list(map(int, input().split()))
a = sorted(list(map(int, input().split())), reverse=True)
p = 10 ** 9 + 7
fact = [1, 1] # fact[n] = (n! mod p)
fact_inv = [1, 1] # ... | p02804 |
import sys,bisect
input = sys.stdin.readline
n,k = list(map(int,input().split()))
a = list(map(int,input().split()))
mod = 10**9+7
fact = [1]
fact_inv = [1]
for i in range(10**5+5):
new_fact = fact[-1]*(i+1)%mod
fact.append(new_fact)
fact_inv.append(pow(new_fact,mod-2,mod))
def mod_comb_k... | def main():
import sys
input = sys.stdin.readline
n,k = list(map(int,input().split()))
a = list(map(int,input().split()))
mod = 10**9+7
fact = [1]
fact_inv = [1]
for i in range(10**5+5):
new_fact = fact[-1]*(i+1)%mod
fact.append(new_fact)
fa... | p02804 |
def main():
import sys
input = sys.stdin.readline
n,k = list(map(int,input().split()))
a = list(map(int,input().split()))
mod = 10**9+7
fact = [1]
fact_inv = [1]
for i in range(10**5+5):
fact.append(fact[-1]*(i+1)%mod)
fact_inv.append(pow(fact[-1],mo... | def main():
import sys
input = sys.stdin.readline
n,k = list(map(int,input().split()))
a = list(map(int,input().split()))
mod = 10**9+7
fact = [1]
fact_inv = [1]
for i in range(10**5+5):
fact.append(fact[-1]*(i+1)%mod)
fact_inv.append(pow(fact[-1],mo... | p02804 |
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees, log2, gcd
from itertools import accumulate, permutations, combinations, combinations_with_replacement, product, groupby
from operator import itemge... | import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees, log2, gcd
from itertools import accumulate, permutations, combinations, combinations_with_replacement, product, groupby
from operator import itemge... | p02804 |
import math
def nCr(n, r):
return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))
mod = 10**9 + 7
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
a.sort()
a_reverse = a[::-1]
plus = 0
minus = 0
cnt = 0
ind = 0
# ceil = nCr(n, k)
kaisu = nCr(n, k-1)
#... | n,k = list(map(int, input().split()))
a = sorted(list(map(int, input().split())))
a_reverse = a[::-1]
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 comb(n, r, mod):
if n < r o... | p02804 |
n,k = list(map(int, input().split()))
a = sorted(list(map(int, input().split())))
a_reverse = a[::-1]
mod = 10**9+7
factorial = [1]
inverse = [1]
for i in range(1, n+1):
factorial.append(factorial[-1] * i % mod)
inverse.append(pow(factorial[-1], mod - 2, mod))
def comb(n, r, mod):
if n < r o... | n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
mod = 10**9 + 7
factorial = [1]
inverse = [1]
for i in range(1, n+1):
factorial.append(factorial[-1] * i % mod)
inverse.append(pow(factorial[-1], mod - 2, mod))
def comb(n, r, mod):
if n < r or r < 0: return 0
elif ... | p02804 |
def cmb(n, r):
if (r < 0) or (n < r):
return 0
r = min(r, n - r)
return fact[n] * factinv[r] * factinv[n-r] % mod
N = pow(10, 5) # N は必要分だけ用意する
fact = [1, 1] # fact[n] = (n! mod p)
factinv = [1, 1] # factinv[n] = ((n!)^(-1) mod p)
inv = [0, 1] # factinv 計算用
mod = pow(10, 9) + 7
for... | def cmb(n, r):
if (r < 0) or (n < r):
return 0
r = min(r, n - r)
return fact[n] * factinv[r] * factinv[n-r] % mod
N = pow(10, 5) # N は必要分だけ用意する
fact = [1, 1] # fact[n] = (n! mod p)
factinv = [1, 1] # factinv[n] = ((n!)^(-1) mod p)
inv = [0, 1] # factinv 計算用
mod = pow(10, 9) + 7
for... | p02804 |
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 * 2 + 1
g1 = [1, 1] # 元テーブル
g2 = [1, 1] #逆元テーブル
inverse = [0, 1] #逆元テーブル計算用テーブル
for i in range(2, N + 1 ):
g1.append((g1[-1] * i) % MOD)
inver... | N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
MOD = 10 ** 9 + 7
### Combination Table ###
g1 = [1, 1] # 元テーブル
g2 = [1, 1] # 逆元テーブル
inverse = [0, 1] # 逆元テーブル計算用テーブル
def comb(n, r, mod):
if r < 0 or r > n:
return 0
r = min(r, n - r)
return g1[n] * g2[r] * g2... | p02804 |
MOD = 10**9 + 7
def getInvs(n, MOD):
invs = [1] * (n+1)
for x in range(2, n+1):
invs[x] = (-(MOD//x) * invs[MOD%x]) % MOD
return invs
def getCombKs(n, k, invs, MOD):
combKs = [0] * (n+1)
combKs[k] = 1
for x in range(k+1, n+1):
combKs[x] = (combKs[x-1] * x * invs[x-k... | MOD = 10**9 + 7
N, K = list(map(int, input().split()))
As = list(map(int, input().split()))
def getInvs(n, MOD):
invs = [1] * (n+1)
for x in range(2, n+1):
invs[x] = (-(MOD//x) * invs[MOD%x]) % MOD
return invs
invs = getInvs(N, MOD)
def getCombKs(n, k, invs, MOD):
combKs = [0] * (n... | p02804 |
MAX_NUM = 10**6 + 1
MOD = 10**9+7
fac = [0 for _ in range(MAX_NUM)]
finv = [0 for _ in range(MAX_NUM)]
inv = [0 for _ in range(MAX_NUM)]
fac[0] = fac[1] = 1
finv[0] = finv[1] = 1
inv[1] = 1
for i in range(2,MAX_NUM):
fac[i] = fac[i-1] * i % MOD
inv[i] = MOD - inv[MOD%i] * (MOD // i) % MOD
... | MAX_NUM = 10**6 + 1
MOD = 10**9+7
fac = [0 for _ in range(MAX_NUM)]
finv = [0 for _ in range(MAX_NUM)]
inv = [0 for _ in range(MAX_NUM)]
fac[0] = fac[1] = 1
finv[0] = finv[1] = 1
inv[1] = 1
for i in range(2,MAX_NUM):
fac[i] = fac[i-1] * i % MOD
inv[i] = MOD - inv[MOD%i] * (MOD // i) % MOD
... | p02804 |
from operator import mul
from functools import reduce
def comb(n, r):
r = min(n - r, r)
if r == 0:
return 1
over = reduce(mul, list(range(n, n - r, -1)))
under = reduce(mul, list(range(1, r + 1)))
return over // under
n, k = list(map(int, input().split()))
a = list(map(int, in... | n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
mod = 10 ** 9 + 7
fac = {0: 1, 1: 1}
finv = {0: 1, 1: 1}
inv = {1: 1}
a.sort()
mi = [0] * n
ma = [0] * n
s_mi = 0
s_ma = 0
def comb_init():
for i in range(2, n + 1):
fac[i] = fac[i - 1] * i % mod
inv[i] = mod ... | p02804 |
def main():
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
A.sort()
r = 0
if False:
for i in range(K+1):
r += (A[-i-1] - A[i]) * cmb(N-i-1, K-1, mod)
else:
for i in range(N-K+1):
r += (A[-i-1] - A[i]) * cmb(N-i-1, K-1,... | def main():
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
A.sort()
r = 0
if False:
for i in range(K+1):
r += (A[-i-1] - A[i]) * cmb(N-i-1, K-1, mod)
else:
for i in range(N-K+1):
r += (A[N-i-1] - A[i]) * cmb(N-i-1, K-1... | p02804 |
n, k = list(map(int, input().split()))
a = [int(i) for i in input().split()]
a.sort()
total = 0
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
g1 = [1, 1]
g2 = [1, 1]
inverse = [0, 1]
for i in range(2, N... | n, k = list(map(int, input().split()))
a = [int(i) for i in input().split()]
a.sort()
total = 0
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
g1 = [1,1]
g2 = [1,1]
inverse = [0,1]
for i in range(2, N + 1):... | p02804 |
from itertools import permutations, combinations
n,k=list(map(int, input().split()))
c=combinations(list(map(int, input().split())),k)
t=sum( [max(v)-min(v) for v in list(c)] )
print((t%(10**9+7))) | from itertools import combinations
n,k=list(map(int, input().split()))
c=combinations(list(map(int, input().split())),k)
print((sum( [max(v)-min(v) for v in c] )%(10**9+7))) | p02804 |
H, K = list(map(int,input().split()))
A = list(map(int, input().split()))
mod = int(10**9) + 7
A.sort()
nCkminu1 = [1] * H
for n in range(K, H):
nCkminu1[n] = nCkminu1[n-1] * n // (n - (K-1))
ans = 0
for nCk, amin, amax in zip(nCkminu1[K-1:], A[:-(K-1)][::-1], A[K-1:]):
ans += nCk % mod * (amax - ... | H, K = list(map(int,input().split()))
A = list(map(int, input().split()))
mod = int(10**9) + 7
A.sort()
nCkminu1 = [1] * H
for n in range(K, H):
nCkminu1[n] = nCkminu1[n-1] * n // (n - (K-1))
nCkminu1[n-1] %= mod
ans = 0
for nCk, amin, amax in zip(nCkminu1[K-1:], A[:-(K-1)][::-1], A[K-1:]):
an... | p02804 |
p = 1000000007
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
fac = [0] * (N + 1)
fac[0] = 1
for i in range(N):
fac[i + 1] = fac[i] * (i + 1) % p
def mcomb(n, k):
if n == 0 and k == 0:
return 1
if n < k or k < 0:
return 0
return fac[n] * po... | # フェルマーの小定理
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
m = 1000000007
fac = [0] * (N + 1)
fac[0] = 1
for i in range(N):
fac[i + 1] = fac[i] * (i + 1) % m
def mcomb(n, k):
if n == 0 and k == 0:
return 1
if n < k or k < 0:
return 0
retur... | p02804 |
# -*- coding: utf-8 -*-
class FactMod():
'''
modの値が素数の時のfactと組み合わせを求める
フェルマーの小定理を用いているため、modが素数以外の時は使えない
'''
def __init__(self, n, mod):
'''
コンストラクタ
f:nまでの i!の値を 配列に入れる
inv: (i!)^-1 の値を配列に入れる
'''
self.mod = mod
self.f = [1]*(n+1)... | # -*- coding: utf-8 -*-
class FactMod():
'''
modの値が素数の時のfactと組み合わせを求める
フェルマーの小定理を用いているため、modが素数以外の時は使えない
'''
def __init__(self, n, mod):
'''
コンストラクタ
f:nまでの i!の値を 配列に入れる
inv: (i!)^-1 の値を配列に入れる
'''
self.mod = mod
self.f = [1]*(n+1)... | p02804 |
# 組み合わせ(高速，フェルマーの小定理を利用)
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
g1 = [1, 1] # 元テーブル
g2 = [1, 1] #逆元テーブル
inverse = [0, 1] #逆元テーブル計算用テーブル
for i in range( 2, N + 1 ):
g1.append( ( g1[-1] * i... | # 組み合わせ(高速，フェルマーの小定理を利用)
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
g1 = [1, 1] # 元テーブル
g2 = [1, 1] #逆元テーブル
inverse = [0, 1] #逆元テーブル計算用テーブル
for i in range( 2, N + 1 ):
g1.append( ( g1[-1] * i... | p02804 |
P = 10**9 + 7
N = 1000000
inv_t = [0]+[1]
for i in range(2,N):
inv_t += [inv_t[P % i] * (P - int(P / i)) % P]
n, k = list(map(int, input().split()))
A = list(map(int, input().split()))
mod = 10 ** 9 + 7
A.sort()
mini_count = 0
maxim_count = 0
pattern = 1
for i in range(n-k, -1, -1):
mini ... | P = 10**9 + 7
N = 200000
inv_t = [0]+[1] # 逆元
for i in range(2, N):
inv_t += [inv_t[P % i] * (P - int(P / i)) % P]
n, k = list(map(int, input().split()))
A = list(map(int, input().split()))
mod = 10 ** 9 + 7
A.sort()
mini_count = 0
maxim_count = 0
pattern = 1
"""
minX, maxXとして選ばれるのはそれぞれ
minX:so... | p02804 |
P = 10**9 + 7
N = 200000
inv_t = [0]+[1] # 逆元
for i in range(2, N):
inv_t += [inv_t[P % i] * (P - int(P / i)) % P]
n, k = list(map(int, input().split()))
A = list(map(int, input().split()))
mod = 10 ** 9 + 7
A.sort()
mini_count = 0
maxim_count = 0
pattern = 1
"""
minX, maxXとして選ばれるのはそれぞれ
minX:so... | n, k = list(map(int, input().split()))
A = list(map(int, input().split()))
mod = 10 ** 9 + 7
P = 10**9 + 7
N = n-k+10
inv_t = [0]+[1] # 逆元
for i in range(2, N):
inv_t += [inv_t[P % i] * (P - int(P / i)) % P]
A.sort()
mini_count = 0
maxim_count = 0
pattern = 1
"""
minX, maxXとして選ばれるのはそれぞれ
minX:sort... | p02804 |
class BinomialCoefficient(object):
def __init__(self, N=510000, MOD=10**9+7):
self.fac = [1, 1]
self.finv = [1, 1]
self.inv = [0, 1]
self.MOD = MOD
for i in range(2, N + 1):
self.fac.append((self.fac[-1] * i) % MOD)
self.inv.append((-self.i... |
class BinomialCoefficient(object):
def __init__(self, N=510000, MOD=10**9+7):
self.fac = [1, 1]
self.finv = [1, 1]
self.inv = [0, 1]
self.MOD = MOD
for i in range(2, N + 1):
self.fac.append((self.fac[-1] * i) % MOD)
self.inv.append((-self.i... | p02804 |
from bisect import bisect_right, bisect_left
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,... | MOD = 10**9 + 7
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 - 1] * i % MOD
... | p02804 |
MOD = 10**9 + 7
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 - 1] * i % MOD
... | MOD = 10**9 + 7
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 - 1] * i % MOD
... | p02804 |
def comb(a,b,m):
if b == 0 or b == a:
ret = 1
else:
ret = 1
for i in range(a-b+1,a+1):
ret = (ret * i) % m
for i in range(1,b+1):
ret = (ret * pow(i,m-2,m) ) % m
return ret
mod = 10**9+7
n, k = [ int(v) for v in input().split() ]
num = so... | mod = 10**9+7
n, k = [ int(v) for v in input().split() ]
num = sorted([ int(v) for v in input().split() ])
max_list2 = [ (i, i-k+1) for i in range(n) ]
max_list = []
for a, b in max_list2:
if b < 0:
max_list.append(0)
elif b == 0:
max_list.append(1)
else:
s = max_list[... | p02804 |
from math import factorial
N,K=list(map(int,input().split()))
A=list(map(int,input().split()))
mod = 10**9+7
if K==1:print((0))
else:
def comb(n,k):
return factorial(n)*pow(factorial(n-k)*factorial(k), -1, mod)
A1=sorted(A)
A2=A1[::-1]
ans=0
for i in range(N-K+1):
ans += (A2[i]-A... | N,K=list(map(int,input().split()))
A=list(map(int,input().split()))
mod = 10**9+7
if K==1:print((0))
else:
factorial=[1 for i in range(N+1)]
for i in range(1,N+1):
if i==1:factorial[i]=1
else:factorial[i] = factorial[i-1]*i % mod
def comb(n,k):
return factorial[n]*pow(factorial[n-k]*fa... | p02804 |
N, K = list(map(int,input().split()))
A = list(map(int,input().split()))
MAX = 10 ** 5 + 1
MOD = 10 ** 9 + 7
fac = [0] * (MAX + 1)
fac[0] = 1
fac[1] = 1
for i in range(2, MAX + 1):
fac[i] = fac[i - 1] * i % MOD
finv = [0] * (MAX + 1)
finv[MAX] = pow(fac[MAX], MOD - 2, MOD)
for i in rang... | N,K = list(map(int,input().split()))
A = list(map(int,input().split()))
A.sort()
MAX = 10 ** 5 + 1
MOD = 10 ** 9 + 7
fac = [0]*(MAX+1)
fac[0] = 1
fac[1] = 1
for i in range(2,MAX+1):
fac[i] = fac[i-1]*i%MOD
finv = [0]*(MAX+1)
finv[MAX] = pow(fac[MAX], MOD-2, MOD)
for i in range(MAX, 0, -1):
... | p02804 |
def power(a,n):
x=1
L=list(format(n,'b'))
l=len(L)
for i in range(l):
if int(L[l-i-1])==1:
x=(x*a)%(10**9+7)
a=(a*a)%(10**9+7)
return x
N,K=list(map(int,input().split()))
A=list(map(int,input().split()))
b=sorted(A)
c=sorted(A,reverse=True)
D=[]
M=0
... | def power(a,n):
x=1
L=list(format(n,'b'))
l=len(L)
for i in range(l):
if int(L[l-i-1])==1:
x=(x*a)%(10**9+7)
a=(a*a)%(10**9+7)
return x
N,K=list(map(int,input().split()))
A=list(map(int,input().split()))
b=sorted(A)
c=sorted(A,reverse=True)
D=[]
M=0
... | p02804 |
def cmb(n,r,mod):
a=1
b=1
r = min(r,n-r)
for i in range(r):
a = a*(n-i)%mod
b = b*(i+1)%mod
return a*pow(b,mod-2,mod)%mod
N,K = list(map(int,input().split()))
A = list(map(int,input().split()))
A.sort()
mod = 10**9+7
ans = 0
if K == 1:
print((0))
else:
for i in range(0,N-K+1)... | # kurimu_usamaro様のメソッドを拝借しています。
class Combi():
def __init__(self, N, mod):
self.power = [1 for _ in range(N+1)]
self.rev = [1 for _ in range(N+1)]
self.mod = mod
for i in range(2, N+1):
self.power[i] = (self.power[i-1]*i) % self.mod
self.rev[N] = pow(self.... | p02804 |
def COMint():
fac[0]=1
fac[1]=1
finv[0]=1
finv[1]=1
inv[1]=1
for i in range(2,N+1):
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):
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD
MOD=10**9+7
N,K=[... | def COMint():
fac[0]=1
fac[1]=1
finv[0]=1
finv[1]=1
inv[1]=1
for i in range(2,N+1):
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
return fac[n] * (finv[k] * finv[n - k] % MOD) % ... | p02804 |
MOD = 10**9+7
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
A.sort(reverse=True)
f = [1]
for i in range(10**5+7):
f.append(f[-1]*(i+1)%MOD)
def nCr(n, r, mod=MOD):
return f[n] * pow(f[r], mod-2, mod) * pow(f[n-r], mod-2, mod) % mod
ans = 0
for i in range(N-K+1):
a... | MOD = 10**9+7
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
A.sort()
f = [1]
for i in range(10**5):
f.append(f[-1] * (i+1) % MOD)
def nCr(n, r, mod=MOD):
return f[n] * pow(f[r], mod-2, mod) * pow(f[n-r], mod-2, mod) % mod
ans = 0
for i in range(N-K+1):
ans -= ... | p02804 |
MOD = 10**9+7
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
A.sort()
f = [1]
for i in range(10**5):
f.append(f[-1] * (i+1) % MOD)
def nCr(n, r, mod=MOD):
return f[n] * pow(f[r], mod-2, mod) * pow(f[n-r], mod-2, mod) % mod
ans = 0
for i in range(N-K+1):
ans += ... | import sys
readline = sys.stdin.buffer.readline
MOD = 10**9+7
N, K = list(map(int, readline().split()))
A = list(map(int, readline().split()))
A.sort()
f = [1]
for i in range(10**5):
f.append(f[-1] * (i+1) % MOD)
def nCr(n, r, mod=MOD):
return f[n] * pow(f[r], mod-2, mod) * pow(f[n-r], mod-2, mod) %... | p02804 |
import sys
read = sys.stdin.buffer.read
input = sys.stdin.buffer.readline
inputs = sys.stdin.buffer.readlines
mod=10**9+7
# rstrip().decode('utf-8')
# map(int,input().split())
#import numpy as np
def framod(n, mod, a=1):
for i in range(1,n+1):
a=a * i % mod
return a
def power(n, r,... | import sys
read = sys.stdin.buffer.read
input = sys.stdin.buffer.readline
inputs = sys.stdin.buffer.readlines
mod=10**9+7
# rstrip().decode('utf-8')
# map(int,input().split())
#import numpy as np
def power(n, r, mod):
if r == 0: return 1
if r%2 == 0:
return power(n*n % mod, r//2, mo... | p02804 |
n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
a.sort()
mod=10**9+7
def modfc(x,y,p):
f=1
for i in range(x,y+1):
f=f%p*i%p
return f%p
def comb(x,y,p):
return modfc(x-y+1,x,p)*pow(modfc(1,y,p),p-2,p)
maxs=0
for i in range(k,n+1):
maxs+=a[i-1]*comb(i-1,k-1,mod)
maxs%... | n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
a.sort()
mod=10**9+7
fcl=[1]*(n+1)
for i in range(1,n+1):
fcl[i]=(fcl[i-1]*i)%mod
def comb(x,y,p):
return ((fcl[x]*pow(fcl[y],p-2,p))%mod*pow(fcl[x-y],p-2,p))%mod
maxs=0
for i in range(k,n+1):
maxs+=a[i-1]*comb(i-1,k-1,mod)
maxs... | p02804 |
N_MAX = 10**6
MOD = 10**9 + 7
fac, finv, inv = [0]*N_MAX ,[0]*N_MAX, [0]*N_MAX
def com_init():
fac[0], fac[1] = 1, 1
finv[0], finv[1] = 1, 1
inv[1] = 1
for i in range(2, N_MAX):
fac[i] = fac[i - 1] * i % MOD
inv[i] = MOD - inv[MOD%i] * (MOD // i) % MOD
finv[i] = finv[i ... | class Combination:
def __init__(self, n_max=10**6, mod=10**9+7):
# self._n_max = n_max
self._fac, self._finv, self._inv = [0]*n_max, [0]*n_max, [0]*n_max
self._fac[0], self._fac[1] = 1, 1
self._finv[0], self._finv[1] = 1, 1
self._inv[1] = 1
for i in range(2, n_... | p02804 |
class Combinatorics:
def __init__(self, N, mod):
'''
Preprocess for calculating binomial coefficients nCr (0 <= r <= n, 0 <= n <= N)
over the finite field Z/(mod)Z.
Input:
N (int): maximum n
mod (int): a prime number. The order of the field Z/(mod)Z ove... | class Combinatorics:
def __init__(self, N, mod):
'''
Preprocess for calculating binomial coefficients nCr (0 <= r <= n, 0 <= n <= N)
over the finite field Z/(mod)Z.
Input:
N (int): maximum n
mod (int): a prime number. The order of the field Z/(mod)Z ove... | p02804 |
N, K = list(map(int,input().split()))
A = list(map(int,input().split()))
A.sort()
MOD = 10**9+7
fac = [0]*(N+1) # 階乗テーブル
fac[0] = fac[1] = 1
inv = [0]*(N+1) # 逆元テーブル
inv[1] = 1
facinv = [0]*(N+1) # 階乗の逆元テーブル
facinv[0] = facinv[1] = 1
for i in range(2,N+1):
fac[i] = fac[i-1]*i%MOD
inv[i] = MOD - inv[... | N,K = list(map(int,input().split()))
A = list(map(int,input().split()))
A.sort()
MOD = 10**9+7
# 各aが何回最大最小として選ばれるか考える
ans = 0
class Combination:
def __init__(self, n_max, mod=10**9+7):
self.mod = mod
self.modinv = self.make_modinv_list(n_max)
self.fac, self.facinv = self.make_f... | p02804 |
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
MOD = 10 ** 9 + 7
kai = [1]
for i in range(1, N + 1):
kai.append(kai[-1] * i)
def comb(n, r):
return kai[n] // (kai[n - r] * kai[r])
if K >= 2:
A.sort(reverse = True)
ans = 0
for i in range(N - K + 1):
for j in rang... | N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
MOD = 10 ** 9 + 7
kai1 = [1, 1]
kai2 = [1, 1]
inverse = [0, 1]
for i in range(2, N + 1):
kai1.append((kai1[-1] * i) % MOD)
inverse.append((-inverse[MOD % i] * (MOD // i)) % MOD)
kai2.append((kai2[-1] * inverse[-1]) % MOD)
d... | p02804 |
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
a.sort()
a2 = []
for i, x in enumerate(a):
a2.append((x, i))
from math import factorial
def c(n, r):
if n - r < 0:
return 0
return factorial(n) // factorial(r) // factorial(n - r)
ma = 0
mi = 0
for i in range... | n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
a.sort()
a2 = []
for i, x in enumerate(a):
a2.append((x, i))
from math import factorial
def c(n, r):
if n - r < 0:
return 0
return factorial(n) // factorial(r) // factorial(n - r)
MOD = 10**9 + 7 # 出力の制限
# ... | p02804 |
from functools import lru_cache
@lru_cache(None)
def factrial(n):
ans = 1
for i in range(1, n+1):
ans *= i
return ans
@lru_cache(None)
def combinations(n, r,mod):
return (factrial(n) // (factrial(n - r) * factrial(r))) % mod
def main():
n, k = list(map(int, input().spl... | from functools import lru_cache
n, k = list(map(int, input().split()))
A = sorted(map(int, input().split()))
mod = 10 ** 9 + 7
# 階乗とその逆元の計算
factrial = [0 for _ in range(n + 1)]
factrial[0] = 1
for i in range(1, n + 1):
factrial[i] = (factrial[i - 1] * i) % mod
inverse_factrial = list()
for f in factrial:
... | p02804 |
import math
N, K = list(map(int, input().split()))
A = sorted(list(map(int, input().split())))
Ar = A[::-1]
Ai = [Ar[i] - A[i] for i in range(N)]
ans = 0
if K > N//2:
n, r = N-1, K-1
C = math.factorial(n) // (math.factorial(n - r) * math.factorial(r))
for i in range(N-K+1):
ans += A... | N, K = list(map(int, input().split()))
MOD = 10**9+7
A = [a % MOD for a in sorted(list(map(int, input().split())))]
MIN, MAX = 0, 0
def div_MOD(a): # (a^{-1} mod MOD) をフェルマーの小定理より求める
return pow(a, MOD - 2, MOD) # a^{-1} = a^{p-2} (mod p)
C = [0]*(K-1) + [1]
for n in range(K, N):
C.append((C[... | p02804 |
def prepare(N, MOD):
fac = [None] * (N+2)
finv = [None] * (N+2)
inv = [None] * (N+2)
fac[0] = fac[1] = 1
finv[0] = finv[1] = 1
inv[1] = 1
for i in range(2, N+1):
fac[i] = fac[i - 1] * i % MOD
inv[i] = MOD - inv[MOD % i] * (MOD // i) % MOD
finv[i] = finv[i - ... | def prepare(N, MOD):
fac = [None] * (N+2)
finv = [None] * (N+2)
inv = [None] * (N+2)
fac[0] = fac[1] = 1
finv[0] = finv[1] = 1
inv[1] = 1
for i in range(2, N+1):
fac[i] = fac[i - 1] * i % MOD
inv[i] = MOD - inv[MOD % i] * (MOD // i) % MOD
finv[i] = finv[i - ... | p02804 |
"""
ジャガー「わからん」
先にmax,minそれぞれの和を求める
"""
import sys
input = sys.stdin.readline
mod = 10**9+7
def getComb(n, k, MOD):
if n < k:
return 0
if n-k < k:
k = n-k
# n!/(n-k)!
comb = 1
for x in range(n-k+1, n+1):
comb = (comb * x) % MOD
# k!
d = 1
fo... | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)
def getComb(n, r, p):
if (r < 0) or (n < r):
return 0
r = min(r, n - r)
return fact[n] * factinv[r] * factinv[n-r] % p
N,K = list(map(int,input().split()))
A = sorted([int(i) for i in input().split()])
# ref: https:... | p02804 |
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)
def getComb(n, r, p):
if (r < 0) or (n < r):
return 0
r = min(r, n - r)
return fact[n] * factinv[r] * factinv[n-r] % p
N,K = list(map(int,input().split()))
A = sorted([int(i) for i in input().split()])
# ref: https:... | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)
class Combination():
# コンストラクタ
def __init__(self, N:int, P:int):
self.N = N
self.P = P
# fact[i] = (i! mod P)
self.fact = [1, 1]
# factinv[i] = ((i!)^(-1) mod P)
self.factinv = [1... | p02804 |
from math import factorial
p=10**9+7
n,k=list(map(int,input().split()))
A=[int(i) for i in input().split()]
A.sort()
def nck(n,k):
return factorial(n)//factorial(n-k)//factorial(k)
ans=0
if k==1:
ans=0
else:
for i in range(n):
for j in range(k-1,n-i):
ans+=(A[i+j]-A[i])*nck(j-1,k-2)
... | n,k=list(map(int,input().split()))
arr=[int(i) for i in input().split()]
arr.sort()
mod=10**9+7
#nCk
factorial=[1]
for i in range(1, n+1):
factorial.append(factorial[-1] * i % mod)
inv_factorial = [-1] * (n+1)
inv_factorial[-1] = pow(factorial[-1], mod-2, mod)
for i in reversed(list(range(n))):
... | p02804 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.