input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
n, k = list(map(int, input().split()))
a_list = list(map(int, input().split()))
a_list.sort()
import math
def cmb(n, r):
o = math.factorial(n)
u = math.factorial(r) * math.factorial(n - r)
return o // u
max_val = 0
min_val = 0
val = int(cmb(n - 1, k - 1))
for i in range(n - k + 1):
... | n, k = list(map(int, input().split()))
a_list = list(map(int, input().split()))
a_list.sort()
mod = 10 ** 9 + 7
f_list = [1]
for i in range(1,n+1):
f_list.append((f_list[-1] * i) % mod)
def comb(n,r):
return f_list[n] * (pow(f_list[r], mod-2, mod) * pow(f_list[n-r], mod-2, mod) % mod) % mod
max... | p02804 |
N,K = list(map(int,input().split()))
A = list(map(int,input().split()))
A.sort()
M = 10**9+7
def pow(a,b,M):
if b == 0:
return 1
elif b % 2 == 0:
return pow((a**2)%M,b//2,M) % M
else:
return ((a % M) * pow((a**2)%M,b//2,M)) % M
def inv(a,p):
return pow(a,p-2,p)
... | N,K = list(map(int,input().split()))
A = list(map(int,input().split()))
A.sort()
M = 10**9+7
def pow(a,b,M):
if b == 0:
return 1
elif b % 2 == 0:
return pow((a**2)%M,b//2,M) % M
else:
return ((a % M) * pow((a**2)%M,b//2,M)) % M
def inv(a,p):
return pow(a,p-2,p)
... | p02804 |
def pow(a,b,M):
if b == 0:
return 1
elif b % 2 == 0:
return pow((a**2)%M,b//2,M) % M
else:
return ((a % M) * pow((a**2)%M,b//2,M)) % M
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):
... | N,K = list(map(int,input().split()))
A = list(map(int,input().split()))
A.sort()
M = 10**9+7
def inv(a,p):
return pow(a,p-2,p)
ans,comb = 0,1
#i番目ではcomb = (K-1-i)_C_(K-1)
#max,min以外での選ぶ個数は常にK-1であることに注目すればcomb関数はいらなかった
for i in range(N-K+1):
if i > 0:
comb = (comb * (K-1+i) * inv(i,M)) %... | p02804 |
n, k = [int(i) for i in input().split()]
al = [int(i) for i in input().split()]
al.sort()
mod = 10 ** 9 + 7
kai_dp={}
def kai(x, p=mod):
if x in kai_dp:
return kai_dp[x]
a = 1
for i in range(1, x + 1):
a *= i
a %= p
kai_dp[x]=a
return a
def comb(a, b, p=mo... | n, k = [int(i) for i in input().split()]
al = [int(i) for i in input().split()]
al.sort()
mod = 10 ** 9 + 7
kai = [1]
for i in range(1, n + 1):
kai.append(kai[-1]*i%mod)
def comb(a, b, p=mod):
if a < 0 or b < 0:
return 0
elif a < b:
return 0
c = 1
c *= kai[a]... | p02804 |
N,K=list(map(int, input().split()))
AA=list(map(int, input().split()))
A=sorted(AA)
B=sorted(AA)[::-1]
mod=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
mod = 10**9+7 #出力の制限
n = 10**6+1
g1 = [1, 1] # 元テーブル
g2 = [1, 1] #逆元テ... | N,K=list(map(int, input().split()))
AA=list(map(int, input().split()))
A=sorted(AA)
B=sorted(AA)[::-1]
mod=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
mod = 10**9+7 #出力の制限
n = 10**5
g1 = [1, 1] # 元テーブル
g2 = [1, 1] #逆元テーブ... | p02804 |
#!usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
from itertools import permutations
import sys
import math
import bisect
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS():return [list(x) for x in... | #!usr/bin/env python3
from collections import defaultdict, deque
from heapq import heappush, heappop
from itertools import permutations, accumulate
import sys
import math
import bisect
def LI(): return [int(x) for x in sys.stdin.buffer.readline().split()]
def I(): return int(sys.stdin.buffer.readline())
def LS... | p02804 |
n,k = [int(x) for x in input().split()]
a = [int(x) for x in input().split()]
a.sort()
def mod_nCr(n,k,mod):
a = 1
for i in range(n-k+1,n+1):
a = a*i%mod
b = 1
for i in range(1,k+1):
b = b*pow(i,mod-2,mod)%mod
return a*b%mod
mod = 10**9+7
ans = 0
for i in range(k-1,n... | n,k = [int(x) for x in input().split()]
a = [int(x) for x in input().split()]
a.sort()
def mod_nCr(n,k,mod):
r = min(k,n-k)
return fact[n]*factinv[k]*factinv[n-k]%mod
mod = 10**9+7
fact = [1,1]
inv = [0,1]
factinv = [1,1]
for i in range(2,n+1):
fact.append(fact[-1]*i%mod)
inv.append((-in... | p02804 |
import sys
import bisect
import itertools
import collections
import fractions
import heapq
import math
from operator import mul
from functools import reduce
from functools import lru_cache
def solve():
readline = sys.stdin.buffer.readline
mod = 10 ** 9 + 7
N, K = list(map(int, readline().sp... | import sys
import bisect
import itertools
import collections
import fractions
import heapq
import math
from operator import mul
from functools import reduce
from functools import lru_cache
def solve():
readline = sys.stdin.buffer.readline
mod = 10 ** 9 + 7
N, K = list(map(int, readline().sp... | p02804 |
def prepare(n, MOD):
# 1! - n! の計算
f = 1
factorials = [1] # 0!の分
for m in range(1, n + 1):
f *= m
f %= MOD
factorials.append(f)
# n!^-1 の計算
inv = pow(f, MOD - 2, MOD)
# n!^-1 - 1!^-1 の計算
invs = [1] * (n + 1)
invs[n] = inv
for m in range(n,... | def prepare(n, MOD):
# 1! - n! の計算
f = 1
factorials = [1] # 0!の分
for m in range(1, n + 1):
f *= m
f %= MOD
factorials.append(f)
# n!^-1 の計算
inv = pow(f, MOD - 2, MOD)
# n!^-1 - 1!^-1 の計算
invs = [1] * (n + 1)
invs[n] = inv
for m in range(n,... | p02804 |
def main():
n,k = list(map(int, input().split()))
a = list(map(int, input().split()))
a.sort()
ans = 0
c = 1
nCk = [1]
for r in range(k,n+1):
c = c*r//(r-k+1)
nCk.append(c)
if k == 1:
print((0))
else:
for i in range(1,n):
if n-i < k-1:
break
... | def main():
n,k = list(map(int, input().split()))
a = list(map(int, input().split()))
a.sort()
ans = 0
if k == 1:
print((0))
else:
for i in range(k-1,n):
if n-i+1<0:
break
if i == k-1:
c = 1
ans += (a[i]-a[n-i-1])*c
else:
c = c*i//(i-k... | p02804 |
n,K=list(map(int,input().split()))
L=list(map(int,input().split()))
L.sort()
def cmb(n, r, mod):
if ( r<0 or r>n ):
return 0
r = min(r, n-r)
return g1[n] * g2[r] * g2[n-r] % mod
mod = 10**9+7 #出力の制限
N = 10**5
g1 = [1, 1] # 元テーブル
g2 = [1, 1] #逆元テーブル
inverse = [0, 1] #逆元テーブル計算用テーブル... | n,K=list(map(int,input().split()))
A=list(map(int,input().split()))
A.sort()
mod=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
#出力の制限
N = 10**5+5
g1 = [1, 1] # 元テーブル
g2 = [1, 1] #逆元テーブル
inverse = [0, 1] #逆元テーブル計算用テーブル... | p02804 |
import sys
from math import factorial
input = sys.stdin.readline
n,k = list(map(int,input().split()))
a = list(map(int,input().split()))
mod = 10**9 + 7
a.sort()
li = []
for i in range(n-1):
li.append(a[i+1]-a[i])
ans = 0
dp = [1]
for i in range(1,n+1):
dp.append(dp[-1]*i)
def comb(n... | import sys
from math import factorial
input = sys.stdin.readline
n,k = list(map(int,input().split()))
a = list(map(int,input().split()))
mod = 10**9 + 7
a.sort()
li = []
for i in range(n-1):
li.append(a[i+1]-a[i])
ans = 0
dp = [1]
for i in range(1,n+1):
dp.append(dp[-1]*i%mod)
def co... | p02804 |
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=factorial(k) %p
c=factorial(n-k) %p
return (a*power_func(b,p-2,p)*power_func(c,p-2,... | N, K = [int(i) for i in input().split()]
A = [int(i) for i in input().split()]
A.sort()
MOD = 10 ** 9 + 7
def combination(mod=MOD):
fact = [1] * (N + 1)
inv_fact = [1] * (N + 1)
r = 1
for i in range(1, N + 1):
fact[i] = r = r * i % mod
inv_fact[N] = r = pow(fact[N], mod - 2, mo... | p02804 |
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
mod = 10**9 + 7
A.sort(reverse=True)
kaijou = [1 for _ in range(N+1)]
for k in range(1, N):
kaijou[k+1] = kaijou[k]*(k+1)%mod
b = mod-2
blis = []
c = 0
while b >0:
if b & 1 == 1:
blis.append(c)
c += 1
b >>= 1
d... | N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
mod = 10**9 + 7
A.sort(reverse=True)
"""
kaijou = [1 for _ in range(N+1)]
for k in range(1, N):
kaijou[k+1] = kaijou[k]*(k+1)%mod
b = mod-2
blis = []
c = 0
while b >0:
if b & 1 == 1:
blis.append(c)
c += 1
b >>= 1... | p02804 |
from operator import mul
from functools import reduce
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
A.sort()
X_max = 0
X_min = 0
nCr = {}
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, li... | N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
A.sort()
p = 1000000007
X_max = 0
X_min = 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
fact = [1, 1] # fact[n] = (n! mod p)
fact... | p02804 |
MOD = 10 ** 9 + 7
FACT_MAX = 10 ** 5
fact = [1] * FACT_MAX
for i in range(1, FACT_MAX):
fact[i] = fact[i - 1] * i % MOD
def comb(n, r):
return fact[n] * pow(fact[n - r], MOD - 2, MOD) * pow(fact[r], MOD - 2, MOD)
N, K = list(map(int, input().split()))
A = sorted(map(int, input().split()))
print((sum(... | MOD = 10 ** 9 + 7
def comb(n, r):
return fact[n] * pow(fact[n - r], MOD - 2, MOD) * pow(fact[r], MOD - 2, MOD)
N, K = list(map(int, input().split()))
fact = [1] * N
for i in range(1, N):
fact[i] = fact[i - 1] * i % MOD
A = sorted(map(int, input().split()))
print((sum(comb(i, K - 1) * (A[i] - A[N - i -... | p02804 |
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
mod = 10**9+7
comb = [0] * (N+1)
comb[K-1] = 1
for i in range(K-1, N):
comb[i+1] = comb[i] * (i+1) * pow(i-K+2, -1, mod) % mod
# print(comb)
A.sort()
# mi = sum(a*comb[i]%mod for a, i in zip(reversed(A[:N-K+1]), range(K-1, N)))
# m... | def main():
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
mod = 10**9+7
comb = [0] * (N+1)
comb[K-1] = 1
for i in range(K-1, N):
comb[i+1] = comb[i] * (i+1) * pow(i-K+2, -1, mod) % mod
# print(comb)
A.sort()
# mi = sum(a*comb[i]%mod for ... | p02804 |
from collections import Counter,defaultdict,deque
from heapq import heappop,heappush,heapify
import sys,bisect,math,itertools,fractions,pprint
sys.setrecursionlimit(10**8)
mod = 10**9+7
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
... | from collections import Counter,defaultdict,deque
from heapq import heappop,heappush
from bisect import bisect_left,bisect_right
import sys,math,itertools,fractions
sys.setrecursionlimit(10**8)
mod = 10**9+7
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.std... | p02804 |
import math
import operator as op
from functools import reduce
def ncr(n, r):
r = min(r, n-r)
numer = reduce(op.mul, list(range(n, n-r, -1)), 1)
denom = reduce(op.mul, list(range(1, r+1)), 1)
return numer // denom
n, m = list(map(int, input().split()))
a = sorted(list(map(int, input().s... | n, k = list(map(int, input().split()))
a = sorted(list(map(int, input().split())))
mod = 10**9 + 7
f = [1, 1]
for i in range(2, n):
f.append((f[i-1] * i) % mod)
total = 0
for i in range(n - k + 1):
p = n - i - 1
q = k - 1
c = f[p] * pow(f[p-q], mod-2, mod) * pow(f[q], mod-2, mod) % mod
... | p02804 |
import itertools
import math
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
A = sorted(A)
mod = 10**9+7
# print(list(itertools.combinations(range(6), 3)))
# A = range(6)
# N = 6
# K = 3
# 二項係数を素数で割った余り
def combMod(n, r, p):
if (r < 0) or (n < r):
return 0
... | # import itertools
# import math
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
A = sorted(A)
mod = 10**9+7
# print(list(itertools.combinations(range(6), 3)))
# A = range(6)
# N = 6
# K = 3
# 二項係数を素数で割った余り
def combMod(n, r, p):
if (r < 0) or (n < r):
return 0... | p02804 |
# import itertools
# import math
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
A = sorted(A)
mod = 10**9+7
# print(list(itertools.combinations(range(6), 3)))
# A = range(6)
# N = 6
# K = 3
# 二項係数を素数で割った余り
def combMod(n, r, p):
if (r < 0) or (n < r):
return 0... | N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
A = sorted(A)
mod = 10**9+7
# conbModに使うfactとfactinvを求める
def factorialMod(n, p):
fact = [1, 1]
factinv = [1, 1]
inv = [0, 1]
for i in range(2, N + 1):
fact.append((fact[-1] * i) % mod)
inv.append((-in... | p02804 |
from math import factorial
MOD = 10**9 + 7
# 階乗を用意
fact = [1] * (10**5 + 1)
for i in range(1, 10**5 + 1):
fact[i] = fact[i-1] * i
fact[i] %= MOD
def comb(n, k, p):
"""power_funcを用いて(nCk) mod p を求める"""
global fact
if n < 0 or k < 0 or n < k:
return 0
if n == 0 or k == 0:
... | from math import factorial
MOD = 10**9 + 7
# 階乗を用意
fact = [1] * (10**5 + 1)
for i in range(1, 10**5 + 1):
fact[i] = fact[i-1] * i
fact[i] %= MOD
def comb(n, k, p):
"""power_funcを用いて(nCk) mod p を求める"""
global fact
if n < 0 or k < 0 or n < k:
return 0
if n == 0 or k == 0:
... | p02804 |
mod = int(1e9+7)
fac = [1]
def add(a, b):
c = a + b
if c >= mod:
c -= mod
return c
def subtract(a, b):
return (a - b) % mod
def mul(a, b):
return (a * b) % mod
def my_pow(a, b):
if b == 0:
return 1
if b % 2 == 1:
return mul(a, my_pow(a, b-1))
... | mod = int(1e9+7)
fac = [1]
def add(a, b):
c = a + b
if c >= mod:
c -= mod
return c
def subtract(a, b):
return (a - b) % mod
def mul(a, b):
return (a * b) % mod
def my_pow(a, b):
if b == 0:
return 1
if b % 2 == 1:
return mul(a, my_pow(a, b-1))
... | 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()))
lis = list(map(int,input().split()))
li... | import sys
sys.setrecursionlimit(1000000)
def cmb(n, r, mod):
if ( r<0 or r>n ):
return 0
r = min(r, n-r)
return g1[n] * g2[r] * g2[n-r] % mod
mod = 10**9+7 #出力の制限
g1 = [1, 1] # 元テーブル
g2 = [1, 1] #逆元テーブル
inverse = [0, 1] #逆元テーブル計算用テーブル
n,k = list(map(int,input().split()))
lis = lis... | p02804 |
from itertools import combinations
n,k = list(map(int,input().split()))
a = [int(i) for i in input().split()]
a.sort()
mod = 10**9+7
ans = 0
for i in combinations(a,k):
ans += i[k-1] - i[0]
ans %= mod
print(ans) | n,k = list(map(int,input().split()))
a = [int(i) for i in input().split()]
a.sort()
mod = 10**9+7
fac = [0]*(n+1)
finv = [0]*(n+1)
def comb(n,k):
if n < k: return 0
if n < 0 or k < 0: return 0
return fac[n]*finv[k]%mod*finv[n-k]%mod
fac[0] = finv[0] = 1
for i in range(1,n+1):
fac[i] = fac[i-... | p02804 |
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)
from bisect import bisect_left
def comb(n, k):
if n < 0 or n < k or k < 0:
return 0
return fac[n] * ifac[k] * ifac[n - k] % mod
n, k, *a ... | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)
def comb(n, k):
if n < 0 or n < k or k < 0:
return 0
return fac[n] * ifac[k] * ifac[n - k] % mod
n, k, *a = list(map(int, read().split()))
... | p02804 |
def combi(x, y):
if x < y:
return 0
if (x,y) in memo:
return memo[(x,y)]
else:
memo[(x,y)] = math.factorial(x) // (math.factorial(x - y) * math.factorial(y))
return memo[(x,y)]
import math
memo = dict()
n, k = list(map(int, input().split()))
a = list(map(int, inpu... | mod = 10**9+7
memo = dict()
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
a.sort()
factorial = [1 for i in range(n+1+k)]
for i in range(1,n+1+k):
factorial[i] = (factorial[i-1] * i) % mod
#互いに素なa,bについて、a*x+b*y=1の一つの解
def extgcd(a,b):
r = [1,0,a]
w = [0,1,b]
while... | p02804 |
n, k = list(map(int, input().split()))
a = [int(i) for i in input().split()]
Mod = 10**9 + 7
a.sort()
c = [0] * (n+1)
c[k - 1] = 1
for i in range(n+1):
if i >= k:
c[i] = (c[i - 1]*i) // (i - k + 1)
ans = 0
for i in range(1, n + 1):
ans += (a[i - 1] * (c[i - 1] - c[n - i])) % Mod
print((ans %... | n, k = list(map(int, input().split()))
a = [int(i) for i in input().split()]
Mod = 10**9 + 7
a.sort()
c = [0] * (n+1)
c[k - 1] = 1
for i in range(n+1):
if i >= k:
c[i] = ((c[i - 1]*i * pow(i - k + 1, Mod - 2, Mod))) % Mod
ans = 0
for i in range(1, n + 1):
ans += (a[i - 1] * (c[i - 1] - c[n - ... | p02804 |
n,k=list(map(int,input().split()))
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
N = n
g1 = [1, 1] # 元テーブル
g2 = [1, 1] #逆元テーブル
inverse = [0, 1] #逆元テーブル計算用テーブル
for i in range( 2, ... | n,k=list(map(int,input().split()))
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
N = n
g1 = [1, 1] # 元テーブル
g2 = [1, 1] #逆元テーブル
inverse = [0, 1] #逆元テーブル計算用テーブル
for i in range( 2, ... | p02804 |
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
mod = 10 ** 9 + 7
a.sort(reverse = True)
N = n+2
P = mod
inv_t = [0]+[1]
for i in range(2,N):
inv_t += [inv_t[P % i] * (P - int(P / i)) % P]
base = 1
for item in range(n-k+1, n):
base = (base * item) % mod
for i in range(1,... | n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
mod = 10 ** 9 + 7
a.sort(reverse = True)
N = n+2
P = mod
inv_t = [0]+[1]
for i in range(2,N):
inv_t += [inv_t[P % i] * (P - int(P / i)) % P]
base = 1
for item in range(n-k+1, n):
base = (base * item) % mod
for i in range(1,... | p02804 |
def comb(n,r,mod):
'''
return nCr
O(min{n-r, r})
'''
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 = [int(x) for x in input().split()]
A.sort()
mod = 10**9+7
l = [[A[0], comb(N-1, K-1, m... |
N,K = list(map(int,input().split()))
A = [int(x) for x in input().split()]
A.sort()
mod = 10**9+7
l = 0
r = 0
t = 1
cnt = 1
for i in range(N-K+1)[::-1]:
l = (l+(t*A[i])%mod)%mod
t = (t*(cnt+K-1))%mod
t = (t*pow(cnt,mod-2, mod))%mod
cnt+=1
t = 1
cnt = 1
for i in range(K-1, N):
r = (r+(t*A[... | p02804 |
import math
n,k = list(map(int,input().split()))
als = list(map(int,input().split()))
als.sort()
# n = 10**5
# k = 5*(10**4)
mod = 10**9+7
ans = 0
# def nCr(n,r):
# mod = (10**9)+7
# fac = [1,1]+[0]*n
# finv = [1,1]+[0]*n
# inv = [1,1]+[0]*n
# for i in range(2,n+1):
# fac[i] =... | def nCr(n,r,fac,finv):
mod = (10**9)+7
ans = fac[n] * (finv[r] * finv[n-r] % mod) % mod
return ans
n,k = list(map(int,input().split()))
als = list(map(int,input().split()))
als.sort()
ans = 0
mod = (10**9)+7
fac = [1,1]+[0]*n
finv = [1,1]+[0]*n
inv = [1,1]+[0]*n
for i in range(2,n+1):
fac... | p02804 |
def modinv2(a,m):
return pow(a,m-2,m)
N,K = list(map(int,input().split()))
A = list(map(int,input().split()))
A.sort()
P = 10**9+7
cominv = [0 for i in range(N-1)]
for i in range(N-1):
if i+2 == K:
cominv[i] = 1
elif i+1 == K:
cominv[i] = (i+1)%P
elif i+1 > K:
a ... | def modinv2(a,m):
return pow(a,m-2,m)
def modcomn(n,r,m):
modcom = [0 for _ in range(n)]
for i in range(n):
if i < r-1:
continue
if i == r-1:
modcom[i] = 1
elif i == r:
modcom[i] = (i+1)%m
else:
div = modinv2(i-r+1... | p02804 |
def modinv2(a,m):
return pow(a,m-2,m)
def modcomn(n,r,m):
modcom = [0 for _ in range(n)]
for i in range(n):
if i < r-1:
continue
if i == r-1:
modcom[i] = 1
elif i == r:
modcom[i] = (i+1)%m
else:
div = modinv2(i-r+1... | def modinv2(a,m):
return pow(a,m-2,m)
def modcomn(n,r,m):
modcom = [0 for _ in range(n)]
for i in range(n):
if i < r-1:
continue
if i == r-1:
modcom[i] = 1
elif i == r:
modcom[i] = (i+1)%m
else:
div = modinv2(i-r+1... | p02804 |
n,k=list(map(int, input().split()))
an=[int(i) for i in input().split()]
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
N = 10 ** 5
fact = [1, 1]
factinv = [1, 1]
inv = [0, 1]
for i in range(2,N+1):
... | n,k=list(map(int, input().split()))
an=[int(i) for i in input().split()]
def cmb(n, r, mod):
if (r < 0) or (n < r):
return 0
r=min(r,n-r)
return fact[n] * factinv[r] * factinv[n-r] %mod
mod = 10 ** 9 + 7
N = 10 ** 5
fact = [1, 1]
factinv = [1, 1]
inv = [0, 1]
for i in range(2,N+1):... | p02804 |
N,K = list(map(int,input().split()))
A = list(map(int,input().split()))
A.sort()
MOD = 10**9+7
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):
fac[i] = fac[i-1] * i % MOD
inv[i] = -inv[MOD%i] * (MOD // i) % MOD
finv[i] = finv[i-1] * i... | N,K = list(map(int,input().split()))
A = list(map(int,input().split()))
A.sort()
MOD = 10**9+7
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):
fac[i] = fac[i-1] * i % MOD
inv[i] = -inv[MOD%i] * (MOD // i) % MOD
finv[i] = finv[i-1] * inv... | p02804 |
from collections import defaultdict
class Combination:
"""
O(n)の前計算を1回行うことで，O(1)でnCr mod mを求められる
n_max = 10**6のとき前処理は約950ms (PyPyなら約340ms, 10**7で約1800ms)
使用例：
comb = Combination(1000000)
print(comb(5, 3)) # 10
"""
def __init__(self, n_max, mod=10**9+7):
self.mod = mo... | class Combination:
"""
O(n)の前計算を1回行うことで，O(1)でnCr mod mを求められる
n_max = 10**6のとき前処理は約950ms (PyPyなら約340ms, 10**7で約1800ms)
使用例：
comb = Combination(1000000)
print(comb(5, 3)) # 10
"""
def __init__(self, n_max, mod=10**9+7):
self.mod = mod
self.modinv = self.make_modi... | p02804 |
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
n,k,*alst = list(map(int,read().split()))
alst.sort()
lst1=alst[k-1:]
lst2=alst[n-k::-1]
mod = 10 ** 9 + 7
res=0
prep=1
for i in range(n-k+1):
res+=prep*(lst1[i]-lst2[i])
res%=mod
prep... | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
n,k,*alst = list(map(int,read().split()))
alst.sort()
lst1=alst[k-1:]
lst2=alst[n-k::-1]
mod = 10 ** 9 + 7
res=0
prep=1
for i in range(n-k+1):
res+=prep*(lst1[i]-lst2[i])
res%=mod
prep... | p02804 |
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
n,k,*alst = list(map(int,read().split()))
alst.sort()
lst1=alst[k-1:]
lst2=alst[n-k::-1]
mod = 10 ** 9 + 7
res=0
prep=1
for i in range(n-k+1):
res+=prep*(lst1[i]-lst2[i])
res%=mod
prep... | import sys
read = sys.stdin.read
n, k, *alst = list(map(int, read().split()))
alst.sort()
lst1 = alst[k - 1:]
lst2 = alst[n - k::-1]
mod = 10 ** 9 + 7
res = 0
prep = 1
for i in range(n - k + 1):
res += prep * (lst1[i] - lst2[i])
res %= mod
prep = prep * (i + k) * pow(i + 1, mod - 2, mod)
... | p02804 |
def find_power(n,mod):
# 0!からn!までのびっくりを出してくれる関数(ただし、modで割った値に対してである）
powlist=[0]*(n+1)
powlist[0]=1
powlist[1]=1
for i in range(2,n+1):
powlist[i]=powlist[i-1]*i%(mod)
return powlist
def find_inv_power(n):
#0!からn!までの逆元を素数10**9+7で割ったあまりリストを作る関数
powlist=find_power(n,10*... | 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.power[N], self.mod-2, self.mod)
... | p02804 |
MOD = 10 ** 9 + 7
def mymodBinomial(n, k, p):
if k < 0 or k > n:
return 0
else:
numerator = 1
for i in range(k):
numerator = (numerator * (n - i)) % p
denominator = 1
for i in range(1, k + 1):
denominator = (denominator * i) % p
return (numerator * pow(denominator, p - 2, p)) % p
i... | MOD = 10 ** 9 + 7
# def mymodBinomial(n, k, p):
# if k < 0 or k > n:
# return 0
# else:
# numerator = 1
# for i in range(k):
# numerator = (numerator * (n - i)) % p
# denominator = 1
# for i in range(1, k + 1):
# denominator = (denominator * i) % p
# return (numerator * pow(denominator,... | p02804 |
import itertools
n, k = list(map(int, input().split()))
alist = sorted(list(map(int, input().split())))
alist_rev = alist[::-1]
divide = 10**9 + 7
def comb(s, n):
return len(list(itertools.combinations(s, n)))
amax = 0
i = 0
while i <= n-k:
amax += alist_rev[i] * comb(alist_rev[i+1:], k-1)
... | import itertools
import math
n, k = list(map(int, input().split()))
alist = sorted(list(map(int, input().split())))
alist_rev = alist[::-1]
divide = 10**9 + 7
def comb(n, k):
return math.factorial(n) // (math.factorial(n-k) * math.factorial(k))
amax = 0
i = n-1
while i >= k-1:
amax += alist... | p02804 |
#!/usr/bin/env python3
def extgcd(a, b):
if b == 0:
return [1, 0, a]
x, y, g = extgcd(b, a%b)
return [y, x - a//b * y, g]
def mod_inverse(a, m):
x, y, _ = extgcd(a, m)
return (m+x%m) % m
def mod_comb(n, k, mod):
mul, div = 1, 1
for i in range(k):
mul *= ... | #!/usr/bin/env python3
MOD = int(1e9)+7
def extgcd(a, b):
if b == 0:
return [1, 0, a]
x, y, g = extgcd(b, a%b)
return [y, x - a//b * y, g]
def mod_inverse(a, m):
x, y, _ = extgcd(a, m)
return (m+x%m) % m
n, k = list(map(int, input().split()))
maxf = 2*n + 10
f = [1 ... | p02804 |
import bisect
import collections
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**6
g1 = [1, 1] # 元テーブル
g2 = [1, 1] # 逆元テーブル
inverse = [0, 1] # 逆元テーブル計算用テーブル
for i in range(2, n + 1):
g... | def main():
import collections
import bisect
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] # 逆元テーブル計算用テーブ... | p02804 |
def solve():
from sys import stdin
f_i = stdin
mod = 10 ** 9 + 7
N, K = list(map(int, f_i.readline().split()))
A = sorted(map(int, f_i.readline().split()))
num = [1] * (N - K + 1)
for i, j in zip(list(range(K, N)), list(range(1, N))):
num[j] = num[j-1] * i /... | def solve():
from sys import stdin
f_i = stdin
mod = 10 ** 9 + 7
N, K = list(map(int, f_i.readline().split()))
A = sorted(map(int, f_i.readline().split()))
comb = 1
ans = A[K-1] - A[N-K]
for i, j, A_s, A_t in zip(list(range(K, N)), list(range(1, N)), A[K:], A[N-... | p02804 |
#----------------------------------------------------------
P = 10**9 + 7
N = 500000 #使える最大値、値に注意
inv = [0] + [1] # 1/x
finv = [1] + [1] # 1/x!
fac = [1] + [1] # x!
for i in range(2,N):
inv += [inv[P % i] * (P - int(P / i)) % P]
fac += [(fac[i-1] * i) % P]
finv += [(finv[i-1] * inv[i]) % P]
def comb(a... | #----------------------------------------------------------
P = 10**9 + 7
N = 200000 #使える最大値、値に注意
inv = [0] + [1] # 1/x
finv = [1] + [1] # 1/x!
fac = [1] + [1] # x!
for i in range(2,N):
inv += [inv[P % i] * (P - int(P / i)) % P]
fac += [(fac[i-1] * i) % P]
finv += [(finv[i-1] * inv[i]) % P]
def comb(a... | p02804 |
#----------------------------------------------------------
P = 10**9 + 7
N = 200000 #使える最大値、値に注意
inv = [0] + [1] # 1/x
finv = [1] + [1] # 1/x!
fac = [1] + [1] # x!
for i in range(2,N):
inv += [inv[P % i] * (P - int(P / i)) % P]
fac += [(fac[i-1] * i) % P]
finv += [(finv[i-1] * inv[i]) % P]
def comb(a... | #----------------------------------------------------------
P = 10**9 + 7
N = 100001 #使う最大値+1以上にする、値に注意3*10^5とかにしとくと安心
inv = [0] + [1] # 1/x
finv = [1] + [1] # 1/x!
fac = [1] + [1] # x!
for i in range(2,N):
inv += [inv[P % i] * (P - int(P / i)) % P]
fac += [(fac[i-1] * i) % P]
finv += [(finv[i-1] * inv[i... | p02804 |
import math
from functools import lru_cache
from operator import mul
from functools import reduce
def resolve():
import sys
input = sys.stdin.readline
MOD = 10**9 + 7
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
A.sort()
B = A[::-1]
@lru_... | import math
from functools import lru_cache
from operator import mul
from functools import reduce
def resolve():
import sys
input = sys.stdin.readline
MOD = 10**9 + 7
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
def combinations_count(n, r, mod=10**9... | p02804 |
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
MOD = 10 ** 9 + 7
A.sort()
factorial = [1]
for i in range(1, N + 1):
factorial.append(factorial[-1] * i)
inv_factorial = [-1] * (N + 1)
inv_factorial[-1] = pow(factorial[-1], MOD - 2, MOD)
for i in reversed(list(range(N))):
... | N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
MOD = 10 ** 9 + 7
A.sort()
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 |
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
A = sorted(A)
def ncr(n, r, p):
num = den = 1
for i in range(r):
num = (num * (n - i)) % p
den = (den * (i + 1)) % p
return (num * pow(den, p - 2, p)) % p
p=10**9+7
ans = 0
for i in range(N-K+1):
j = N-1-i
ans ... | N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
A = sorted(A)
def ncr(n, r, p):
num = den = 1
for i in range(r):
num = (num * (n - i)) % p
den = (den * (i + 1)) % p
return (num * pow(den, p - 2, p)) % p
Mod = 10**9+7
fac = [1, 1]
finv = [1, 1]
inv = [0, 1]
def C... | p02804 |
N,K = (int(x) for x in input().split())
mod = 10**9+7 #出力の制限
g1 = [1, 1] # 元テーブル
g2 = [1, 1] #逆元テーブル
inverse = [0, 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
for i in range( 2, N + 1 ):
g1.append( ( g1[-1]... | N,K = (int(x) for x in input().split())
mod = 10**9+7 #出力の制限
g1 = [1, 1] # 元テーブル
g2 = [1, 1] #逆元テーブル
inverse = [0, 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
for i in range( 2, N + 1 ):
g1.append( ( g1[-1]... | p02804 |
N, K = list(map(int, input().split()))
A = [int(x) for x in input().split()]
A.sort()
res = 0
MOD = 10**9+7
nCk_2 = dict()
fact_t = [1]
for n in range(N):
fact_t.append(fact_t[-1]*(n+1))
def comb(n, k):
return (fact_t[n]//(fact_t[n-k]*fact_t[k]))%MOD
s = [1,-1]
for m in range(2):
for i in range... | N, K = list(map(int, input().split()))
A = [int(x) for x in input().split()]
A.sort()
res = 0
MOD = 10**9+7
nCk_2 = dict()
fac, finv, inv = [0]*(N+1), [0]*(N+1), [0]*(N+1)
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... | p02804 |
n, k = (int(x) for x in input().split())
a = [int(x) for x in input().split()]
a = sorted(a)
fact = [1]
for i in range(1, n + 1):
fact.append(fact[-1] * i % 1000000007)
max_a = 0
for i in range(k - 1, n):
max_a += a[i] * fact[i] * pow(fact[i - k + 1], 1000000005, 1000000007) * pow(fact[k - 1], 100000000... | n, k = (int(x) for x in input().split())
a = [int(x) for x in input().split()]
a = sorted(a)
MOD = 1000000007
fact = [1]
for i in range(1, n + 1):
fact.append(fact[-1] * i % MOD)
def inv(i):
return pow(fact[i], MOD - 2, MOD)
def max_min_a():
a_sum = 0
for i in range(k - 1, n):
a_sum ... | p02804 |
def factorial_mod(n, mod):
a = 1
for i in range(1, n + 1):
a *= i
a %= mod
return a
def comb_mod(n, k, mod):
if k > n or k < 0:
return 0
fact_n = factorial_mod(n, mod)
fact_k = factorial_mod(k, mod)
fact_n_k = factorial_mod(n - k, mod)
return (fact... | def prepare(n, MOD):
f = 1
factorials = [1]
for m in range(1, n + 1):
f *= m
f %= MOD
factorials.append(f)
inv = pow(f, MOD - 2, MOD)
invs = [1] * (n + 1)
invs[n] = inv
for m in range(n, 1, -1):
inv *= m
inv %= MOD
invs[m - 1] = in... | p02804 |
MOD = 10**9 + 7
n,k,*a=list(map(int,open(0).read().split()))
a.sort()
comb = 1
ans = 0
for i in range(k,n+1):
ans += (a[i-1] - a[-i]) * (comb % MOD)
comb = comb * i // (i-k+1)
ans = ans%MOD
print(ans) | MOD = 10**9 + 7
n,k,*a=list(map(int,open(0).read().split()))
a.sort()
comb = 1
ans = 0
for i in range(k,n+1):
ans += (a[i-1] - a[-i]) *comb
comb = comb * i * pow(i-k+1,MOD-2,MOD) % MOD
ans = ans%MOD
print(ans) | p02804 |
N, K = list(map(int, input().split()))
A = sorted(list(map(int, input().split())))
P = int(1e9+7)
ans = 0
def comb(n, r):
if n < r or r < 0:
return 0
nume = 1
deno = 1
for i in range(1, r + 1):
nume *= (n - i + 1)
deno *= (i)
return nume//deno
combs=[comb... | N, K = list(map(int, input().split()))
A = sorted(list(map(int, input().split())))
P = int(1e9+7)
ans = 0
kaizyo = [0]
kaizyo_inv = [0]
tmp = 1
for i in range(1, N+1):
tmp = (tmp*i) % P
kaizyo.append(tmp)
kaizyo_inv.append(pow(tmp, P - 2, P))
def comb(n, r):
if n < r or n == 0:
... | p02804 |
from math import factorial as jj
mod=10**9+7
n,k=list(map(int,input().split()))
l=sorted(map(int,input().split()))
ans=0
ml=jj(n-1)//(jj(k-1)*jj(n-k))
ans-=ml*(l[0]-l[n-1])%mod
for i in range(1,n-k+1):
ml=ml*(n-i-k+1)//(n-i)
ans-=ml*(l[i]-l[n-1-i])%mod
print((ans%mod))
| n,k=list(map(int,input().split()))
l=sorted(list(map(int,input().split())))
mod=10**9+7
fact=[1]*(n+1)
inv=[1]*(n+1)
for i in range(2,n+1):
fact[i]=i*fact[i-1]%mod
inv[-1]=pow(fact[-1],mod-2,mod)
for i in range(n,1,-1):
inv[i-1]=inv[i]*i%mod
ans=0
for i in range(n):
if i>=k-1:
ans+=l[i]... | p02804 |
def main():
def pre(n,mod):
a=1
for i in range(1,n+1):
a=(a*i)%mod
an=a
b=pow(a,mod-2,mod)
bs=[1]*(n+1)
bs[n]=b
for i in range(n,1,-1):
b=b*i%mod
bs[i-1]=b
return an,bs
n,k=list(map(int,input().spl... | def main():
n,k=list(map(int,input().split()))
a=sorted(list(map(int,input().split())))
mod=10**9+7
ans=0
for i in range(k-1,n):
if i==k-1:
c=1
else:
c=(c*i*pow(i-k+1,mod-2,mod))%mod
ans+=(a[i]-a[n-i-1])*c
ans%=mod
print(ans)
... | p02804 |
def modpow(x,p,mod):
ret=1
for i in range(100):
if (1<<i)&p:
ret=ret*x%mod
x=x*x%mod
return ret
def inverse_table(n,mod):
table=[]
for i in range(0,n+1):
table.append(modpow(i,mod-2,mod))
return table
def factorial_table(n,mod):
table=[1]
... | def modpow(x,p,mod):
ret=1
for i in range(64):
if (1<<i)&p:
ret=ret*x%mod
x=x*x%mod
return ret
def inverse_table(n,mod):
table=[]
for i in range(0,n+1):
table.append(modpow(i,mod-2,mod))
return table
def factorial_table(n,mod):
table=[1]
... | p02804 |
import math
mod = 10**9+7
n,k = list(map(int,input().split()))
b = math.factorial(k-1)%mod
def comb(p):
if p >= k-1:
a = math.factorial(p)%mod
c = math.factorial(p-k+1)%mod
return (a*pow(b*c, mod-2, mod))%mod
else:
return 0
A = list(map(int,input().split()))
A.sort()
... | import math
mod = 10**9+7
n,k = list(map(int,input().split()))
b = math.factorial(k-1)%mod
fact = [0]*(n-k+1)
a = math.factorial(k-1)%mod
c = 1
for i in range(k-1, n):
if i == k-1:
fact[0] = (a*pow(b*c, mod-2, mod))%mod
else:
a = a*i%mod
c = c*(i-k+1)%mod
fact[i-k+1]... | p02804 |
n, k = list(map(int, input().split(' ')))
aaa = sorted(list(map(int, input().split(' '))))
mmm = 1000000000 + 7
# 二項係数 mod [検索]
fac = []
inv = []
inv_fac = []
def init(n):
fac.append(1)
fac.append(1)
inv.append(0)
inv.append(1)
inv_fac.append(1)
inv_fac.append(1)
for i in range... | n, k = list(map(int, input().split(' ')))
aaa = sorted(list(map(int, input().split(' '))))
mmm = 1000000000 + 7
# 二項係数 mod [検索]
fac = []
inv = []
inv_fac = []
def init(n):
fac.append(1)
fac.append(1)
inv.append(0)
inv.append(1)
inv_fac.append(1)
inv_fac.append(1)
for i in range... | p02804 |
import math
n, k = list(map(int, input().split()))
A = list(map(int, input().split()))
mod = 10 ** 9 + 7
def com_init():
MAX = 10 ** 5 + 1
fac = [0] * MAX
finv = [0] * MAX
inv = [0] * MAX
fac[0] = fac[1] = 1
finv[0] = finv[1] = 1
inv[1] = 1
for i in range(2, MAX):
... | n, k = list(map(int, input().split()))
nums = [int(i) for i in input().split()]
mod = 10 ** 9 + 7 # (modの値をすごく大きくすれば（5乗とか）、普通のnCrとして使える)
MAX = 10 ** 5 + 1 # これは変動するので注意。せいぜい10 ** 6くらいまでがTLEの限界
def com_init(MAX, mod):
fac = [0] * MAX
finv = [0] * MAX
inv = [0] * MAX
fac[0] = fac[1] = 1
f... | p02804 |
#!/usr/bin/env python3
import sys
import functools
INF = float("inf")
MOD = 1000000007 # type: int
@functools.lru_cache(maxsize=None)
def cmb(n, r):
r = min(r, n-r)
if r == 0:
return 1
if r == 1:
return n
numer = [n - r + k + 1 for k in range(r)]
denom = [k + 1 ... | #!/usr/bin/env python3
import sys
import functools
INF = float("inf")
MOD = 1000000007 # type: int
class Combination(object):
"""
組み合わせを求める。
cmbで使いうる最大のNまでを前処理で準備。
"""
def __init__(self, N, mod=10**9+7):
fac, finv, inv = [0]*(N+1), [0]*(N+1), [0]*(N+1)
fac[:2] = ... | p02804 |
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
mod = 10 ** 9 + 7
fac=[]
finv=[]
inv=[]
def combi_init():
fac.append(1)
fac.append(1)
finv.append(1)
finv.append(1)
inv.append(1)
inv.append(1)
for i in range(2,N+1):
fac.append(fac[i-1]*i%mo... | N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
mod = 10 ** 9 + 7
fac=[]
finv=[]
inv=[]
def combi_init():
fac.append(1)
fac.append(1)
finv.append(1)
finv.append(1)
inv.append(1)
inv.append(1)
for i in range(2,N+1):
fac.append(fac[i-1]*i%mo... | p02804 |
dic = {}
def comb(n,k,p):
from math import factorial
if n / 2 < k:
k = n - k
if n<0 or k<0 or n<k:
return 0
if n==0 or k==0:
return 1
a=fact_mod[n] %p
b=fact_mod[k] %p
c=fact_mod[n-k] %p
return (a*power_func(b,p-2,p)*power_func(c,p-2,p))%p
def power_func(a,b,p)... | dic = {}
def comb(n,k,p):
from math import factorial
if n / 2 < k:
k = n - k
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... | p02804 |
#nCr % mod
def comb_mod(n, r, mod):
x = 1
y = 1
for i in range(r):
x = (x * (n - i)) % mod
y = (y * (i + 1)) % mod
ans = x * pow_k(y, mod-2, mod)
return ans % mod
# x^n % mod
def pow_k(x, n, mod):
if n == 0:
return 1
K = 1
while n > 1:
if n % 2 != 0:
... | # x^n % mod
def pow_k(x, n, mod):
if n == 0:
return 1
K = 1
while n > 1:
if n % 2 != 0:
K = (x * K) % mod
x = (x * x) % mod
n //= 2
return (x * K) % mod
def main():
MOD = 10 ** 9 + 7
n,k = list(map(int,input().split()))
a = sorted(list(map(int,input().... | p02804 |
N, K = list(map(int, input().split()))
lis = list(map(int, input().split()))
p = 10**9+7
fac_lis = [[0] for i in range(N)]
fac_lis[0] = 1
max_ans = 0
min_ans = 0
for i in range(1,N):
fac_lis[i] = fac_lis[i-1]*(i+1)
def combi(n,k):
if n == k:
return 1
else:
return fac_lis[n-1]*pow(fac_lis[k... | # フェルマーの小定理
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
r... | p02804 |
class Cmb:
def __init__(self, m=10**5, p=10**9+7):
fct, inv = [1], [1]
a, b = 1, 1
for i in range(1, m+1):
a = (a * i) % p
b = (b * pow(i, p - 2, p)) % p
fct.append(a)
inv.append(b)
self.fct = fct
self.inv = inv
... | n, k = list(map(int, input().split()))
*A, = list(map(int, input().split()))
A.sort()
p = 10**9+7
F, I = [1], [1]
for i in range(1, n+1):
F.append((F[-1]*i) % p)
I.append((I[-1]*pow(i, p-2, p)) % p)
s = 0
for i in range(k-1, n):
s += (A[i]-A[n-(i+1)])*F[i]*I[k-1]*I[i-(k-1)]
s %= p
print(s) | p02804 |
cookie = list(map(int, input().split()))
sc = sum(cookie)
cnt = -1
if cookie[0] == cookie[1] and cookie[1] == cookie[2]:
if cookie[0] % 2 == 0:
print(cnt)
exit()
else:
print((0))
memo = [0]*3
while sum(cookie) == sc:
memo[0] = (cookie[1] + cookie[2]) // 2
memo[1] = (c... | cookie = list(map(int, input().split()))
sc = sum(cookie)
cnt = 0
if cookie[0] == cookie[1] and cookie[1] == cookie[2] and cookie[0]%2 == 0:
print((-1))
exit()
memo = [0]*3
while cookie[0]%2 == 0 and cookie[1]%2 == 0 and cookie[2]%2 == 0:
memo[0] = (cookie[1] + cookie[2]) // 2
memo[1] = (cookie... | p03723 |
a,b,c=list(map(int,open(0).read().split()))
e=(a-b)|(b-c)
print((bool(e|(a|b|c)%2)*(e^~-e).bit_length()-1)) | a,b,c=list(map(int,input().split()))
e=(a-b)|(b-c)
print((bool(e|(a|b|c)%2)*(e^~-e).bit_length()-1)) | p03723 |
a,b,c=list(map(int,input().split()))
e=(a-b)|(b-c)
print((bool(e|(a|b|c)%2)*(e^~-e).bit_length()-1)) | a,b,c=list(map(int,input().split()))
e=(a-b)|(b-c)
print((bool(e|b%2)*(e^~-e).bit_length()-1)) | p03723 |
a,b,c=list(map(int, input().split()))
d=0
while d<10**5:
if a%2==1 or b%2==1 or c%2==1:break
a,b,c=b/2+c/2,a/2+c/2,a/2+b/2
d+=1
else:d=-1
print(d) | a,b,c=list(map(int, input().split()))
ans=0
while a%2==0 and b%2==0 and c%2==0 and ans<10000:
a,b,c=b//2+c//2,a//2+c//2,a//2+b//2
ans+=1
if ans==10000:ans=-1
print(ans) | p03723 |
*a,=list(map(int,input().split()))
b=[bin(abs(a[i+1]-a[i]))[::-1].find('1') for i in range(2)]
print(((max(b) if b[0]*b[1]<0 else min(b))*(1-sum(a)%2))) | *a,=list(map(int,input().split()))
b=[bin(a[i+1]-a[i])[::-1].find('1')for i in (0,1)]
print(((max(b) if b[0]*b[1]<0 else min(b))*(1-sum(a)%2))) | p03723 |
import sys
a,b,c = list(map(int,input().split(" ")))
li = [[a,b,c]]
count=0
for i in range(10**9):
if (a % 2)==1 or (b % 2)==1 or (c % 2)==1:
break
else:
a2 = a/2
b2 = b/2
c2 = c/2
a = b2+c2
b = c2+a2
c = a2+b2
count += 1
if [a,b,c] in li:
print((-1))
s... | import sys
a,b,c = list(map(int,input().split(" ")))
li = [[a,b,c]]
count=0
for i in range(10**2):
if (a % 2)==1 or (b % 2)==1 or (c % 2)==1:
break
else:
a2 = a/2
b2 = b/2
c2 = c/2
a = b2+c2
b = c2+a2
c = a2+b2
count += 1
if [a,b,c] in li:
print((-1))
s... | p03723 |
a,b,c=list(map(int,input().split()))
if a==b==c and a%2==0:
print((-1))
else:
res=0
while a%2==b%2==c%2==0:
a,b,c=(b+c)/2,(c+a)/2,(a+b)/2
res+=1
print(res) | a,b,c=list(map(int,input().split()));print((len(bin((e:=a-b|c-b)&-e))-3or~c%-2)) | p03723 |
A,B,C = (int(i) for i in input().split())
times = 0
if A%2==1 or B%2==1 or C%2==1:
times = 0
elif A == 497225728 and B == 689434624 and C == 883453952:
times = 13
else:
while True:
times += 1
A = A / 2
B = B / 2
C = C / 2
if A==B and C==A:
... | A,B,C = (int(i) for i in input().split())
times = 0
if A%2==1 or B%2==1 or C%2==1:
times = 0
#やってはいけない！！！！
elif A == 497225728 and B == 689434624 and C == 883453952:
times = 13
else:
while True:
times += 1
A = A / 2
B = B / 2
C = C / 2
if A==B and C=... | p03723 |
L = list(map(int, input().split()))
if L[0]%2 == 1 or L[1]%2 == 1 or L[2]%2 == 1:
print((0))
exit()
if (L[0]//2)%2 == 1 and (L[1]//2)%2 == 1 and (L[2]//2)%2 == 1:
print((-1))
exit()
i = 0
while True:
i += 1
L = [L[1]//2+L[2]//2, L[0]//2+L[2]//2, L[0]//2+L[1]//2]
if L[0]%2 == 1... | L = list(map(int, input().split()))
if L[0]%2 == 1 or L[1]%2 == 1 or L[2]%2 == 1:
print((0))
exit()
if (L[0]//2)%2 == 1 and (L[1]//2)%2 == 1 and (L[2]//2)%2 == 1:
print((-1))
exit()
i = 0
while True:
i += 1
L = [L[1]//2+L[2]//2, L[0]//2+L[2]//2, L[0]//2+L[1]//2]
if L[0]%2 == 1... | p03723 |
a, b, c = list(map(int,input().split()))
def aa():
if a == b and a == c and a % 2 == 0:
return -1
else:
A = [a-b, b-c, c-a]
j = 0
while True:
for i in range(3):
if A[i] % 2 == 1:
return j
else:
... | a, b, c = list(map(int,input().split()))
def aa():
if a == b and a == c:
if a % 2 == 0:
return -1
else:
return 0
else:
A = [a-b, b-c, c-a]
j = 0
while True:
for i in range(3):
if A[i] % 2 == 1:
... | p03723 |
a, b, c = list(map(int, input().split()))
cnt = 0
while cnt <= 10**6:
if a%2 != 0 or b%2 != 0 or c%2 != 0:
print(cnt)
exit()
a_ = b//2 + c//2
b_ = a//2 + c//2
c_ = a//2 + b//2
a = a_
b = b_
c = c_
cnt += 1
print((-1)) | a, b, c = list(map(int, input().split()))
cnt = 0
while cnt <= 10**6:
if (a%2 != 0 or b%2 != 0 or c%2 != 0):
print(cnt)
exit()
if a==b==c:
print((-1))
exit()
a_ = b//2 + c//2
b_ = a//2 + c//2
c_ = a//2 + b//2
a = a_
b = b_
c =... | p03723 |
# agc014_a.py]
A, B, C = list(map(int,input().split()))
cnt = 0
inf = 10**6
for i in range(inf):
if A%2==0 and B%2==0 and C%2==0:
a = (B+C)//2
b = (A+C)//2
c = (B+A)//2
A = a
B = b
C = c
cnt += 1
else:
break
if cnt == inf:
cnt ... | # agc014_a.py]
A, B, C = list(map(int,input().split()))
cnt = 0
inf = 10**2
for i in range(inf):
if A%2==0 and B%2==0 and C%2==0:
a = (B+C)//2
b = (A+C)//2
c = (B+A)//2
A = a
B = b
C = c
cnt += 1
else:
break
if cnt == inf:
cnt ... | p03723 |
a, b, c = list(map(int, input().split()))
ans = 0
while True:
if ans > 999999:
print((-1))
break
elif a % 2 != 0 or b % 2 != 0 or c % 2 != 0:
print(ans)
break
n_a = b/2 + c/2
n_b = a/2 + c/2
n_c = a/2 + b/2
a = n_a
b = n_b
c = n_c
... | a, b, c = list(map(int, input().split()))
ans = 0
while True:
if ans > 999999:
print((-1))
break
elif a % 2 != 0 or b % 2 != 0 or c % 2 != 0:
print(ans)
break
a, b, c = (b+c) // 2, (a+c) // 2, (a+b) // 2
ans += 1
| p03723 |
import time
N = list(map(int, input().split()))
N2 = [0,0,0]
ans = 0
while True:
time.sleep(1)
for i in range(3):
if not N[i] %2 == 0:
print(ans)
exit()
N2[0] = (N[1] + N[2]) /2
N2[1] = (N[0] + N[2]) /2
N2[2] = (N[0] + N[1]) /2
#print(N2)
if N =... | N = list(map(int, input().split()))
N2 = [0,0,0]
ans = 0
while True:
for i in range(3):
if not N[i] %2 == 0:
print(ans)
exit()
N2[0] = (N[1] + N[2]) /2
N2[1] = (N[0] + N[2]) /2
N2[2] = (N[0] + N[1]) /2
#print(N2)
if N == N2:
print('-1')
... | p03723 |
a, b, c = list(map(int, input().split()))
if any(i % 2 != 0 for i in [a, b, c]):
print((0))
exit()
if a == b and b == c:
print((-1))
exit()
cnt = 0
a_list = [0]*(1001001)
b_list = [0]*(1001001)
c_list = [0]*(1001001)
a_list[0] = a
b_list[0] = b
c_list[0] = c
for i in range(1, 10010... | def solve(a, b, c):
if any(i % 2 == 1 for i in [a, b, c]):
return 0
if a == b == c:
return -1
a, b, c = (b + c) // 2, (c + a) // 2, (a + b) // 2
return solve(a, b, c) + 1
a, b, c = list(map(int, input().split()))
print((solve(a, b, c))) | p03723 |
a,b,c = tuple(map(int,input().split()))
if len(set((a,b,c)))==1 and a%2==1:
print((0))
exit()
ans = 0
while True:
if len(set((a,b,c)))==1:
print((-1))
exit()
if a%2==0 and b%2==0 and c%2==0:
a,b,c = b//2+c//2,c//2+a//2,a//2+b//2
ans+=1
else:
break
print(ans)
| a,b,c = tuple(map(int,input().split()))
ans = 0
while True:
if len(set((a,b,c)))==1:
if a%2==1:
print((0))
exit()
print((-1))
exit()
if a%2==0 and b%2==0 and c%2==0:
a,b,c = b//2+c//2,c//2+a//2,a//2+b//2
ans+=1
else:
break
print(ans) | p03723 |
a,b,c=list(map(int,input().split()))
if a==b==c:
print((-(a%2<1)))
else:
s=0
while a%2<1and b%2<1and c%2<1:
a,b,c=(b+c)//2,(c+a)//2,(a+b)//2
s+=1
print(s) | a,b,c=list(map(int,input().split()))
e=a-b|b-c
print(((e!=b%2)*(e^e-1).bit_length()-1)) | p03723 |
a,b,c=list(map(int,input().split()))
e=a-b|b-c
print((len(bin(e&-e))-3or-(e==b&1))) | a,b,c=list(map(int,input().split()))
e=a-b|b-c
print((len(bin(e&-e))-3-(e==b&1))) | p03723 |
def slove():
import sys
input = sys.stdin.readline
a, b, c = list(map(int, input().rstrip('\n').split()))
if a == b == c:
if a % 2 == 0:
print((-1))
else:
print((0))
else:
cnt = 0
while True:
if a % 2 == 0 and b % 2 == 0... | def slove():
import sys
input = sys.stdin.readline
a, b, c = list(map(int, input().rstrip('\n').split()))
if a == b == c:
if a % 2 == 0:
print((-1))
else:
print((0))
else:
cnt = 0
while True:
if a % 2 == 0 and b % 2 == 0... | p03723 |
a, b, c = list(map(int, input().split()))
ab = abs(a-b)
bc = abs(b-c)
if a == b == c:
if a % 2 == 0:
print((-1))
exit()
else:
print((0))
exit()
count = 0
while True:
if ab % 2 != 0 or bc % 2 != 0:
break
else:
ab = ab // 2
bc = bc // 2
count += 1
print(co... | c = list(map(int, input().split()))
if len(set(c)) == 1 and c[0] % 2 == 0:
print((-1))
exit()
cnt = 0
while c[0] % 2 != 1 and c[1] % 2 != 1 and c[2] % 2 != 1:
c = [c[1]/2 + c[2]/2, c[0]/2 + c[2]/2, c[0]/2 + c[1]/2]
cnt += 1
print(cnt) | p03723 |
a,b,c = list(map(int, input().split()))
ans = 0
while(a%2==0 and b%2==0 and c%2==0):
if(a==b and b==c and c==a):
ans = -1
break
else:
a1 = b+c
b1 = a+c
c1 = b+a
a = a1/2
b = b1/2
c = c1/2
ans+=1
print(ans) | l = list(map(int, input().split()))
ans = 0
while( l[0]%2==0 and l[1]%2==0 and l[2]%2==0):
if l[0]==l[1]and l[1]==l[2]:
ans = -1
break
else:
a = l[0]
b = l[1]
c = l[2]
l[0]=(b+c)/2
l[1]=(a+c)/2
l[2]=(a+b)/2
ans+=1
print(ans) | p03723 |
import time
t=time.time()
A,B,C=list(map(int,input().split()))
cnt=0
while(A%2==B%2==C%2==0):
a,b,c=A,B,C
A=b//2+c//2;B=a//2+c//2;C=a//2+b//2
cnt+=1
if(time.time()-t>=1):
print((-1))
exit()
print(cnt) | A,B,C=list(map(int,input().split()))
cnt=0
if(A==B==C):
if A%2!=0:
print((0))
else:
print((-1))
exit()
while(A%2==B%2==C%2==0):
a,b,c=A,B,C
A=b//2+c//2;B=a//2+c//2;C=a//2+b//2
cnt+=1
print(cnt) | p03723 |
from sys import stdin
a,b,c = [int(x) for x in stdin.readline().rstrip().split()]
count = 0
num = 0
while True:
if a%2 == 1 or b%2 == 1 or c%2 == 1:
print(count)
exit()
elif a==b==c:
print((-1))
exit()
else:
a,b,c = b//2+c//2,c//2+a//2,a//2+b//2
... | a,b,c = list(map(int,input().split()))
if a%2 == 1 or b%2 == 1 or c%2 == 1:
print((0))
exit()
if a == b == c:
print((-1))
exit()
count = 0
while True:
count += 1
a,b,c = b//2+c//2,a//2+c//2,a//2+b//2
if a%2 == 1 or b%2 == 1 or c%2 == 1:
break
print(count) | p03723 |
N = int(eval(input()))
def lc():
l0, l1 = 2, 1
while 1:
yield l0 + l1
l0, l1 = l1, l0 + l1
for i, n in enumerate(lc()):
if i == N - 2:
print(n)
break
| N = int(eval(input()))
def lc():
l0, l1 = 2, 1
while 1:
yield l0 + l1
l0, l1 = l1, l0 + l1
if N > 1:
for i, n in enumerate(lc()):
if i == N - 2:
print(n)
break
else:
print((1))
| p03544 |
# -*- cooding utf-8 -*-
n=int(eval(input()))
l=[2,1]
for i in range(2,n+1):
l.append(l[i-2]+l[i-1])
print((l[-1]))
| n=int(eval(input()))
l=[2,1]
for i in range(2,n+1):
l.append(l[i-2]+l[i-1])
print((l[-1]))
| p03544 |
def return_Lucas(num1, num2):
return num1 + num2
n = int(eval(input()))
n1 = 2
n2 = 1
if n == 0:
print(n1)
elif n == 1:
print(n2)
else:
for i in range(2, n+1):
n1, n2 = n2, return_Lucas(n1,n2)
if i == n:
print(n2)
| n = int(eval(input()))
n1 = 2
n2 = 1
if n == 0:
print(n1)
elif n == 1:
print(n2)
else:
for i in range(2, n+1):
n1, n2 = n2, n1+n2
if i == n:
print(n2)
| p03544 |
n = int(eval(input()))
l = [2,1]
i = 2
while i <= n:
l.append(l[i-1] + l[i-2])
i += 1
# print(l)
print((l[-1]))
|
n = int(eval(input()))
l = [2,1]
for i in range(2,n+1):
l.append(l[i-1] + l[i-2])
print((l[-1]))
| p03544 |
N = int(eval(input()))
L = [ 0 ] * 1000000
L[0] = 2
L[1] = 1
for i in range(2, N+1):
L[i] = L[i-2] + L[i-1]
print((L[N]))
| N = int(eval(input()))
L = [ 0 ] * (N+1)
L[0] = 2
L[1] = 1
for i in range(2, N+1):
L[i] = L[i-2] + L[i-1]
print((L[N]))
| p03544 |
N = int(eval(input()))
a =2
b =1
if N == 1:
print(b)
else:
for _ in range(1,N):
c = b + a
a = b
b = c
else:
print(c)
| N = int(eval(input()))
a =2
b =1
if N == 1:
print(b)
else:
for _ in range(1,N):
c = b + a
a = b
b = c
print(c) | p03544 |
n = int(eval(input()))
l = [2,1]
i = 2
while True:
l.append(l[i-1] + l[i-2])
if i == n:
print((l[i]))
exit()
elif i == 0:
print((2))
exit()
elif i == 1:
print((1))
exit()
else:
i += 1 | n = int(eval(input()))
l = [2,1]
i = 2
while True:
l.append(l[i-1] + l[i-2])
if i == n:
print((l[i]))
exit()
elif n == 0:
print((2))
exit()
elif n == 1:
print((1))
exit()
else:
i += 1 | p03544 |
n=int(eval(input()))
a=2
b=1
for i in range(n-1):
tmpa=b
b+=a
a=tmpa
print(b) | n = int(eval(input()))
a = 2
b = 1
for i in range(n-1):
a, b = b, a + b
print(b) | p03544 |
N = int(eval(input()))
L = [2, 1]
for i in range(2, N+2):
Li = L[i-1] + L[i-2]
L.append(Li)
print((L[N])) | N = int(eval(input()))
L = [2, 1]
for i in range(2, N+2):
L.append(L[i-1]+L[i-2])
print((L[N])) | p03544 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.