input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
###############################################################################
from sys import stdout
from bisect import bisect_left as binl
from copy import copy, deepcopy
from collections import defaultdict
import math
mod = 1
def intin():
input_tuple = input().split()
if len(input_tuple) ... | ###############################################################################
from sys import stdout
from bisect import bisect_left as binl
from copy import copy, deepcopy
from collections import defaultdict
import math
mod = 1
def intin():
input_tuple = input().split()
if len(input_tuple) ... | p03039 |
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 ):
g1.append( ( g1[-1] * i ) % mod )
inverse.ap... | def main():
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] #逆元テーブル計算用テーブル
... | p03039 |
def egcd(a, b):
(x, lastx) = (0, 1)
(y, lasty) = (1, 0)
while b != 0:
q = a // b
(a, b) = (b, a % b)
(x, lastx) = (lastx - q * x, x)
(y, lasty) = (lasty - q * y, y)
return (lastx, lasty, a)
# ax ≡ 1 (mod m)なるxを返す
def modinv(a):
m=MOD
(inv, q, gcd_val... | def modinv(a):
b=MOD
(x, lastx) = (0, 1)
(y, lasty) = (1, 0)
while b != 0:
q = a // b
(a, b) = (b, a % b)
(x, lastx) = (lastx - q * x, x)
(y, lasty) = (lasty - q * y, y)
return lastx%MOD
MOD=10**9+7
N,M,K=list(map(int,input().split()))
b=1
for i in ra... | p03039 |
def modinv(a):
b=MOD
(x, lastx) = (0, 1)
(y, lasty) = (1, 0)
while b != 0:
q = a // b
(a, b) = (b, a % b)
(x, lastx) = (lastx - q * x, x)
(y, lasty) = (lasty - q * y, y)
return lastx%MOD
MOD=10**9+7
N,M,K=list(map(int,input().split()))
b=1
for i in ra... | def comb(n, k):
x, y = 1, 1
k = min(k, n-k)
for i in range(k):
x *= n - i
x %= MOD
y *= i + 1
y %= MOD
return x*pow(y, MOD-2, MOD) % MOD
def modinv(a):
b=MOD
(x, lastx) = (0, 1)
(y, lasty) = (1, 0)
while b != 0:
q = a // b
... | p03039 |
def comb(n, k):
x, y = 1, 1
k = min(k, n-k)
for i in range(k):
x *= n - i
x %= MOD
y *= i + 1
y %= MOD
return x*pow(y, MOD-2, MOD) % MOD
def modinv(a):
b=MOD
(x, lastx) = (0, 1)
(y, lasty) = (1, 0)
while b != 0:
q = a // b
... | def comb(n, k):
x, y = 1, 1
k = min(k, n-k)
for i in range(k):
x *= n - i
x %= MOD
y *= i + 1
y %= MOD
return x*modinv(y) % MOD
def modinv(a):
b=MOD
(x, lastx) = (0, 1)
(y, lasty) = (1, 0)
while b != 0:
q = a // b
(a, b) = ... | p03039 |
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
n,m,k = list(map(int,input().split()))
mod = 10**9+7
ans = 0
for i in range(1,n):
ans += i*(n-i)*m**2*cmb(... | 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
n,m,k = list(map(int,input().split()))
mod = 10**9+7
ans = 0
C = cmb(n*m-2,k-2,mod)
for i in range(1,n):
... | p03039 |
N,M,K=list(map(int,input().split()))
import math
def com(n, r):
return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))
A=com(M*N-2, K-2)
MOD=10**9+7
ans=0
for d in range(1,N):
ans+=d*(N-d)*M*M*A%MOD
for d in range(1,M):
ans+=d*(M-d)*N*N*A%MOD
print((ans%MOD)) | N,M,K=list(map(int,input().split()))
def cmb(x,y):
X=1
Y=1
for i in range(1,y+1):
X= X*(x+1-i)%MOD
Y= Y*i%MOD
return (X*pow(Y,MOD-2,MOD))%MOD
MOD=10**9+7
A=cmb(M*N-2, K-2)
ans=0
for d in range(1,N):
ans+=d*(N-d)*M*M*A%MOD
for d in range(1,M):
ans+=d*(M-d)*N*N*A%MOD
print((ans%MOD)) | p03039 |
n,m,k=list(map(int,input().split()))
mod=10**9+7
f=[1]
for i in range(2*10**5+7):f+=[f[-1]*(i+1)%mod]
def comb(a,b):return f[a]*pow(f[b],mod-2,mod)*pow(f[a-b],mod-2,mod)%mod
ans=0
for i in range(1,n):
ans+=(i*(n-i)*m**2)*(comb(n*m-2,k-2))
ans%=mod
for i in range(1,m):
ans+=(i*(m-i)*n**2)*(comb(n*m-2,k-2... | n,m,k=list(map(int,input().split()))
mod = 10**9+7
f = [1]
for i in range(n*m):
f += [f[-1]*(i+1) % mod]
def comb(a, b):
return f[a]*pow(f[b], mod-2, mod)*pow(f[a-b], mod-2, mod) % mod
ans=0
for dist in range(1,n):
c=n-dist
p=(c*m*m)%mod
ans+=p*dist
for dist in range(1,m):
c=m-dist
p=(c*... | p03039 |
import math
MOD = int(10**9 + 7)
def egcd(a, b):
if a == 0:
return (b, 0, 1)
else:
g, y, x = egcd(b%a, a)
return (g, x - (b//a) * y, y)
def modinv(a, m):
g, x, y = egcd(a, m)
if g != 1:
raise Exception("No inverse exists")
else:
return x % ... | import math
MOD = int(10**9 + 7)
def egcd(a, b):
if a == 0:
return (b, 0, 1)
else:
g, y, x = egcd(b%a, a)
return (g, x - (b//a) * y, y)
def modinv(a, m):
g, x, y = egcd(a, m)
if g != 1:
raise Exception("No inverse exists")
else:
return x % ... | p03039 |
import sys
input = sys.stdin.readline
import math
N, M, K = [int(item) for item in input().split()]
mod = 10**9 + 7
total = 0
for d in range(1, N):
score = (N - d) * M**2 * d
score %= mod
for i in range(2, K):
score *= ((N * M - i) % mod * pow(K - i, mod - 2, mod))
score %= mo... | import sys
input = sys.stdin.readline
import math
N, M, K = [int(item) for item in input().split()]
mod = 10**9 + 7
score_c = 1
for i in range(2, K):
score_c *= ((N * M - i) % mod * pow(K - i, mod - 2, mod))
score_c %= mod
total = 0
for d in range(1, N):
score = (N - d) * M**2 * d * score_c... | p03039 |
MOD = 10**9+7
N,M,K = list(map(int,input().split()))
U = N*M
fact = [1]*(U+1)
for i in range(1,U+1):
fact[i] = (fact[i-1]*i)%MOD
def comb(n,k):
x = fact[n]
x *= pow(fact[n-k],MOD-2,MOD)
x %= MOD
x *= pow(fact[k],MOD-2,MOD)
return x
res = 0
for i in range(1,N):
res += i*... | mod = 10**9 + 7
n,m,k = list(map(int,input().split()))
nm = n*m
f = [1]*(nm+1)
for i in range(1,nm+1):
f[i] = (f[i-1]*i)%mod
def C(n,k):
x = f[n]
x *= pow(f[n-k],mod-2,mod)
x %= mod
x *= pow(f[k],mod-2,mod)
x %= mod
return x
def F(n):
x = n*n*(n+1)//2
y = n*(n+1)*(2*n+... | p03039 |
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, M, K = list(map(int, input().split()))
ans = 0
for i in range(1... | 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:
return n * power(n, r-1, mod) % mod
def comb(n, k, mod):
a=framod(n, mod)
... | p03039 |
MOD = 10**9 + 7
N, M, K = list(map(int, input().split()))
invs = [1] * (K-1)
for x in range(2, K-1):
invs[x] = (-(MOD//x) * invs[MOD%x]) % MOD
C = 1
for x in range(N*M-K+1, N*M-1):
C *= x
C %= MOD
for x in range(1, K-1):
C *= invs[x]
C %= MOD
ans1 = 0
for d in range(1, N):
... | MOD = 10**9 + 7
N, M, K = list(map(int, input().split()))
def getComb(n, k, MOD):
if n < k:
return 0
if n-k < k:
k = n-k
comb = 1
for x in range(n-k+1, n+1):
comb = (comb * x) % MOD
d = 1
for x in range(1, k+1):
d = (d * x) % MOD
comb *= pow(d... | p03039 |
import math
N, M, K = (int(x) for x in input().split())
def nCm(n,m):
if m < 0 or m > n:
return 0
nf = math.factorial(n)
nm = math.factorial(m)
nm2 = math.factorial(n-m)
return (nf//nm//nm2) % 1000000007
c_sum = (M*(N-1)*N*(N+1)*M+N*(M-1)*M*(M+1)*N)//3
c_sum = c_sum//2
c_sum... | import math
N, M, K = (int(x) for x in input().split())
def comb(n,k,p):
if k < 0 or k > n:
return 0
if n == 0 or k == 0:
return 1
a=math.factorial(n) % p
b=math.factorial(k) % p
c=math.factorial(n-k) % p
return (a*mypow(b,p-2,p)*mypow(c,p-2,p)) % p
def mypow(a,b... | p03039 |
import math
N, M, K = (int(x) for x in input().split())
def nCm(n,m):
if m < 0 or m > n:
return 0
nf = math.factorial(n)
nm = math.factorial(m)
nm2 = math.factorial(n-m)
return (nf//nm//nm2) % 1000000007
c_sum = (M*(N-1)*N*(N+1)*M+N*(M-1)*M*(M+1)*N)//3
c_sum = c_sum//2
c_sum... | import math
N, M, K = (int(x) for x in input().split())
def comb(n,k,p):
if k < 0 or k > n:
return 0
if n == 0 or k == 0:
return 1
a=math.factorial(n) % p
b=math.factorial(k) % p
c=math.factorial(n-k) % p
return (a*mypow(b,p-2,p)*mypow(c,p-2,p)) % p
def mypow(a,b... | p03039 |
def combi(n, r) :
ret = 1
for i in range(n, n-r, -1) :
ret *= i
while r > 1 and ret % r == 0 :
ret //= r
r -= 1
return ret
MOD = 10 ** 9 + 7
N, M, K = list(map(int, input().split(' ')))
n, r = N * M - 2, K - 2
P = combi(n, r) % MOD
ans = 0
for n i... | from math import factorial
MOD = 10 ** 9 + 7
N, M, K = list(map(int, input().split(' ')))
n, r = N * M - 2, K - 2
#P = factorial(n) // factorial(n-r) // factorial(r) % MOD
P = factorial(n) * pow(factorial(n-r) % MOD, MOD - 2, MOD) * pow(factorial(r) % MOD, MOD - 2, MOD)
ans = 0
for n in range(N) :
for... | p03039 |
N, M, K = list(map(int, input().split()))
MOD = 10**9+7
fact = [1 for i in range(N*M+1)]
for i in range(2, N*M+1):
fact[i] = fact[i-1] * i
def comb(n, r):
if n == 0 or r == 0:
return 1
return fact[n] // fact[n-r] // fact[r]
p = comb(N*M-2, K-2)
ans = 0
for i in range(N):
for j ... | from math import factorial
N, M, K = list(map(int, input().split()))
MOD = 10**9+7
def comb(n, r):
r = n-r if n-r < r else r
if r == 0:
return 1
ndfact = 1
for i in range(n, n-r, -1):
ndfact *= i
return ndfact // factorial(r)
p = comb(N*M-2, K-2)
ans = 0
for i in r... | p03039 |
from math import factorial
N, M, K = list(map(int, input().split()))
MOD = 10**9+7
def comb(n, r):
r = n-r if n-r < r else r
if r == 0:
return 1
ndfact = 1
for i in range(n, n-r, -1):
ndfact *= i
return ndfact // factorial(r)
p = comb(N*M-2, K-2) % MOD
ans = 0
for ... | from math import factorial
N, M, K = list(map(int, input().split()))
MOD = 10**9+7
fact = [1] * (N*M+1)
for i in range(2, N*M+1):
fact[i] = fact[i-1] * i % MOD
def comb(n, r):
r = n-r if n-r < r else r
return fact[n] * pow(fact[r], MOD-2, MOD) * pow(fact[n-r], MOD-2, MOD) % MOD
p = comb(N*M... | p03039 |
# -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, produc... | # -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, produc... | p03039 |
# -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, produc... | # -*- coding: utf-8 -*-
import sys
# sys.setrecursionlimit(10**6)
# buff_readline = sys.stdin.buffer.readline
buff_readline = sys.stdin.readline
readline = sys.stdin.readline
INF = 2**62-1
def read_int():
return int(buff_readline())
def read_int_n():
return list(map(int, buff_readline().spli... | p03039 |
def com(n,r):
if n-r<r:
r=n-r
re=1
for i in range(n,n-r,-1):
re*=i
for i in range(1,r+1):
re//=i
return re
def f(n,m,k):
md = 10 ** 9 + 7
ans = 0
for d in range(1, m):
ans = (ans + d * (m - d) * n * n) % md
for d in range(1, n):
... | def com(n,r):
re=fct[n]*pow(fct[r],md-2,md)*pow(fct[n-r],md-2,md)
re%=md
return re
n,m,k=list(map(int,input().split()))
md=10**9+7
ans=0
fct=[1]*(n*m-1)
f=1
for i in range(1,n*m-1):
f=f*i%md
fct[i]=f
for d in range(1,m):
ans=(ans+d*(m-d)*n*n)%md
for d in range(1,n):
ans=(ans... | p03039 |
from math import factorial
mod=10**9+7
def cmb(n, r):
return factorial(n) // factorial(r) // factorial(n - r)%mod
n,m,k=list(map(int,input().split()))
print((((pow(m,2,mod)*cmb(n*m-2,k-2)*sum((n-i)*i%mod for i in range(1,n))%mod)+pow(n,2,mod)*cmb(n*m-2,k-2)*sum((m-i)*i%mod for i in range(1,m))%mod)%mod)) | mod=10**9+7
def mod_combination(n, k, mod):
def ext_gcd(a, b):
if b == 0:return a, 1, 0
else:d,x,y = ext_gcd(b,a%b);x-=(a//b)*y
return d,y,x
p,q=1,1
for i in range(n-k+1,n+1):
p=(p*i)%mod
for i in range(2,k+1):
q=(q*i)%mod
return int(p*(ext_gcd(q, ... | p03039 |
# https://atcoder.jp/contests/abc127/tasks/abc127_e
import itertools
from collections import Counter
from collections import defaultdict
import bisect
import math
# Calculate count of combination
def combination(n, r):
if r == 0:
return 1
a = 1
b = 1
for i in range(r):
a... | # https://atcoder.jp/contests/abc127/tasks/abc127_e
import itertools
from collections import Counter
from collections import defaultdict
import bisect
import math
# Calculate count of combination
def cmb(n, r):
if n - r < r: r = n - r
if r == 0: return 1
if r == 1: return n
numerator = ... | p03039 |
import sys
input = sys.stdin.readline
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, M, K = list(map(int, input().sp... | from math import factorial
def comb(n, k, mod):
if n < 0 or k < 0 or n < k:
return 0
if n == 0 or k == 0:
return 1
a=factorial(n) % mod
b=factorial(k) % mod
c=factorial(n-k) % mod
return (a*power_func(b, mod-2, mod)*power_func(c, mod-2, mod)) % mod
def power_func(a,b,mod):
... | p03039 |
import itertools
import sys
from functools import reduce
from operator import mul
sys.setrecursionlimit(10000)
INF = float('inf')
def comb(n, r):
"""
scipy.misc.comb または scipy.special.comb と同じ
組み合わせの数 nCr
:param int n:
:param int r:
:rtype: int
"""
assert n >= r
... | import math
import sys
sys.setrecursionlimit(10000)
INF = float('inf')
def inv(x):
return pow(x, MOD - 2, MOD)
def comb(n, r, mod):
# https://fushime2.hatenablog.com/entry/2016/11/12/155543
return (math.factorial(n) * inv(math.factorial(n - r)) * inv(math.factorial(r))) % mod
N, M, K ... | p03039 |
mod = 10**9 + 7
def comb(n, k):
x, y = 1, 1
k = min(k, n-k)
for i in range(k):
x *= n - i
y *= i + 1
return x*pow(y, mod-2, mod) % mod
N, M, K = list(map(int, input().split()))
print(((sum(i*(N-i)*M**2 for i in range(N))+sum(i*(M-i)*N**2 for i in range(M)))*comb(N*M-2, K-2) ... | mod = 10**9 + 7
def comb(n, k):
x, y = 1, 1
k = min(k, n-k)
for i in range(k):
x *= n - i
x %= mod
y *= i + 1
y %= mod
return x*pow(y, mod-2, mod) % mod
N, M, K = list(map(int, input().split()))
print(((sum(i*(N-i)*M**2 for i in range(N))+sum(i*(M-i)*N**2 f... | p03039 |
mod = 10**9 + 7
def comb(n, k):
x, y = 1, 1
k = min(k, n-k)
for i in range(k):
x *= n - i
x %= mod
y *= i + 1
y %= mod
return x*pow(y, mod-2, mod) % mod
N, M, K = list(map(int, input().split()))
print(((sum(i*(N-i)*M**2 for i in range(N))+sum(i*(M-i)*N**2 f... | mod = 10**9 + 7
def comb(n, k):
x, y = 1, 1
k = min(k, n-k)
for i in range(k):
x *= n - i
x %= mod
y *= i + 1
y %= mod
return x*pow(y, mod-2, mod) % mod
N, M, K = list(map(int, input().split()))
print(((M*M%mod*((N**3-N)//6%mod)%mod+N*N%mod*((M**3-M)//6%mod... | p03039 |
def combination(n, r):
r = min(n - r, r)
result = 1
for i in range(n, n - r, -1):
result *= i
for i in range(1, r + 1):
result //= i
return result
N, M, K = list(map(int, input().split()))
mod = 10 ** 9 + 7
NM = N * M
fa = [1] * (NM + 1)
for i in range(1, NM + 1):... | class FactMod:
def __init__(self, n, mod):
self.mod = mod
self.f = [1] * (n + 1)
for i in range(1, n + 1):
self.f[i] = self.f[i - 1] * i % mod
self.inv = [pow(self.f[-1], mod - 2, mod)]
for i in reversed(list(range(1, n + 1))):
self.inv.app... | p03039 |
class FactMod:
def __init__(self, n, mod):
self.mod = mod
self.f = [1] * (n + 1)
for i in range(1, n + 1):
self.f[i] = self.f[i - 1] * i % mod
self.inv = [pow(self.f[-1], mod - 2, mod)]
for i in reversed(list(range(1, n + 1))):
self.inv.app... | class FactMod:
def __init__(self, n, mod):
self.mod = mod
self.f = [1] * (n + 1)
for i in range(1, n + 1):
self.f[i] = self.f[i - 1] * i % mod
self.inv = [pow(self.f[-1], mod - 2, mod)]
for i in reversed(list(range(1, n + 1))):
self.inv.app... | p03039 |
import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda:sys.stdin.readline().rstrip()
class modfact(object):
def __init__(self,n):
fact=[1]*(n+1); invfact=[1]*(n+1)
for i in range(1,n+1): fact[i]=i*fact[i-1]%MOD
invfact[n]=pow(fact[n],MOD-2,MOD)
... | import sys
sys.setrecursionlimit(2147483647)
INF = 1 << 60
MOD = 10**9 + 7 # 998244353
input = lambda:sys.stdin.readline().rstrip()
class modfact(object):
def __init__(self, n):
fact, invfact = [1] * (n + 1), [1] * (n + 1)
for i in range(1, n + 1): fact[i] = i * fact[i - 1] % MOD
... | p03039 |
from math import factorial
N, M, K = list(map(int, input().split()))
mod = 10 ** 9 + 7
def Comb(N, K):
a = factorial(N) % mod
b = factorial(K) % mod
c = factorial(N-K) % mod
return (a * pow(b, mod-2, mod) * pow(c, mod-2, mod)) % mod
c = Comb(N*M-2, K-2)
ans = 0
for d in range(M):
... | from math import factorial
N, M, K = list(map(int, input().split()))
mod = 10 ** 9 + 7
def f(N):
a = 1
for i in range(1, N+1):
a *= i
a %= mod
return a % mod
def Comb(N, K):
a = f(N)
b = f(K)
c = f(N-K)
return (a * pow(b, mod-2, mod) * pow(c, mod-2, mod)) %... | p03039 |
N,M,K=list(map(int,input().split()))
P=1000000007
import math
ans=M**2*(N-1)*N*(N+1)//6
ans+=N**2*(M-1)*M*(M+1)//6
print((ans*math.factorial(N*M-2)*pow(math.factorial(K-2),P-2,P)*pow(math.factorial(N*M-K),P-2,P)%P))
| N,M,K=list(map(int,input().split()))
P=1000000007
import math
print((M*N*(M+N)*(M*N-1)//6*math.factorial(N*M-2)*pow(math.factorial(K-2),P-2,P)*pow(math.factorial(N*M-K),P-2,P)%P))
| p03039 |
import sys
input = sys.stdin.readline
def I(): return int(eval(input()))
def MI(): return list(map(int, input().split()))
def LI(): return list(map(int, input().split()))
def main():
mod=10**9+7
N,M,K=MI()
#2この組み合わせを全部足して，平均ぽく考える
def sum2(x):
return ((x*(x+1))//2)%mod
... | import sys
input = sys.stdin.readline
def I(): return int(eval(input()))
def MI(): return list(map(int, input().split()))
def LI(): return list(map(int, input().split()))
def main():
mod=10**9+7
"""
まず，xとyを分離する=>xだけを考えるので1行とみなす．
いっぺんにいくつも考えられないので，コマを2つだけ置いた時を考える．
2この組み合わせで距離が1=>M-1通り，2... | p03039 |
N,M,K = list(map(int, input().split()))
mod = 10**9+7
a = 1
b = 1
for i in range(min(K-2, N*M-K)):
a *= (N*M-2-i)
b *= i+1
comb = a//b
ans = ((N*N*(N+1)//2-N*(N+1)*(2*N+1)//6)*M**2 + (M*M*(M+1)//2-M*(M+1)*(2*M+1)//6)*N**2)%mod
ans *= comb
print((ans%mod)) | N,M,K = list(map(int, input().split()))
mod = 10**9+7
a = 1
b = 1
for i in range(min(K-2, N*M-K)):
a *= (N*M-2-i)
a %= mod
b *= i+1
b %= mod
comb = a * pow(b, mod - 2, mod) % mod
ans = (((N*N*(N+1)//2-N*(N+1)*(2*N+1)//6)*M**2 + (M*M*(M+1)//2-M*(M+1)*(2*M+1)//6)*N**2)*comb)%mod
print(ans) | p03039 |
N, M, K = list(map(int, input().split()))
MOD = 10 ** 9 + 7
def comb(n, r) :
if n - r < 0 or r < 0 :
return 0
r = min(n-r, r)
a, b = 1, 1
for i in range(r) :
a *= n - i
b *= i + 1
return a // b
res = 0
for i in range(1, N + 1) :
for j in range... | N, M, K = list(map(int, input().split()))
MOD = 10 ** 9 + 7
def pow(x, n) :
y = 1
while n > 0 :
if n & 1 :
y = (y * x) % MOD
x = (x * x) % MOD
n >>= 1
return y
def comb(n, r) :
if n < r or n < 0 :
return 0
factorial = [0] * (n + 1)
... | p03039 |
n, m, k = list(map(int, input().split( )))
mod = 10**9 + 7
def chs(a,b, md):
res = 1
for i in range(a-b+1,a+1):
res *= i
res %= md
rev = 1
for i in range(1,b+1):
rev *= i
rev %= md
rev2 = pow(rev,md-2,md)
res *= rev2
res %= md
... | n, m, k = list(map(int, input().split( )))
mod = 10**9 + 7
def chs(a,b, md):
res = 1
for i in range(a-b+1,a+1):
res *= i
res %= md
rev = 1
for i in range(1,b+1):
rev *= i
rev %= md
rev2 = pow(rev,md-2,md)
res *= rev2
res %= md
... | p03039 |
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
A=2*10**5
mod = 10**9+7
g1 = [1, 1]
g2 = [1, 1]
inverse = [0, 1]
for i in range( 2, A + 1 ):
g1.append( ( g1[-1] * i ) % mod )
inverse.append( ( -inverse[mod % i] * (mod//i) )... | def power_mod(a,b,mod=10**9+7):
i,temp,box=0,b,[]
while(2**i<=b):
i+=1
for j in range(i-1,-1,-1):
box=[[j,temp//2**j]]+box
temp-=2**j*(temp//2**j)
box[0].append(a)
ans=box[0][1]*a%mod
for j in range(1,i):
box[j].append(box[j-1][2]**2%mod)
if box... | p03039 |
#E問題
N,M,K = list(map(int,input().split()))
mod = 1000000007
#factorial(階乗)
def factorial(n):
factorial_list=[]
for i in range(n+1):
if i == 0:
factorial_list.append(1)
elif i == 1:
factorial_list.append(1)
else:
factorial_list.append(fac... | #E問題
N,M,K = list(map(int,input().split()))
mod = 1000000007
zen = 1
for i in range(N*M-2):
zen*=(i+1)
kk = 1
for i in range(K-2):
kk*=(i+1)
zk = 1
for i in range(N*M-K):
zk*=(i+1)
C = zen//(kk*zk)
X = 0
for i in range(N-1):
d = i+1
X+=(N-d)*M*M*d
X%=mod
Y = 0
for ... | p03039 |
mod = 1000000007
import sys
input = sys.stdin.readline
N, M, K = list(map(int, input().split()))
N2 = N**2
M2 = M**2
Xpattern = [(x * (N-x)) %mod for x in range(N)]
Ypattern = [(y * (M-y)) %mod for y in range(M)]
coef = 1
num = min(K-2, N*M-K)
for i in range(N*M-2, N*M-2-num, -1):
coef *= i
for j in r... | mod = 1000000007
import sys
input = sys.stdin.readline
N, M, K = list(map(int, input().split()))
def cmb(n, r):
if n<0 or r<0 or r>n:
return None
r = min(r, n-r)
if r == 0:
return 1
if r == 1:
return n
numerator = [0]*r
denominator = [0]*r
for k in r... | p03039 |
"""
xi,xjのペアにおいて、このペアは何通り出てくるか
sum(全通り)sum(i)sum(j){|xi-xj|+|yi-yj|}
和なので、どんな順序でもいい
sum(i)sum(j)sum(全通り){|xi-xj|}
sum(i)sum(j)sum(全通り){|yi-yj|}
あるi,jで固定して、sum(全通り){|xi-xj|}を求めるヤツ
固定したi,jが現れる回数は、
pat = NM-2_C_K-2 こいつはどこでも一緒
pat*sum(i)sum(j){|xi-xj|}を計算する
すべてのi,j(i>j)ペアにおいて、xi,xjの和は
sum(i=1,N){i*(N-i... |
"""
xi,xjのペアにおいて、このペアは何通り出てくるか
sum(全通り)sum(i)sum(j){|xi-xj|+|yi-yj|}
和なので、どんな順序でもいい
sum(i)sum(j)sum(全通り){|xi-xj|}
sum(i)sum(j)sum(全通り){|yi-yj|}
あるi,jで固定して、sum(全通り){|xi-xj|}を求めるヤツ
固定したi,jが現れる回数は、
pat = NM-2_C_K-2 こいつはどこでも一緒
pat*sum(i)sum(j){|xi-xj|}を計算する
すべてのi,j(i>j)ペアにおいて、xi,xjの和は
sum(i=1,N){i*(N-i... | p03039 |
"""
組み合わせ(nCr)計算
https://qiita.com/derodero24/items/91b6468e66923a87f39f#%E7%95%AA%E5%A4%96%E7%B7%A8
逆元の求め方
http://drken1215.hatenablog.com/entry/2018/06/08/210000
解法@公式放送
https://www.youtube.com/watch?v=SS6kW-d-rJ0&feature=youtu.be&t=7376
"""
def cmb(n, r):
return (fact[n] * finv_t[r] * finv_t[n - r])... | """
https://atcoder.jp/contests/abc127/submissions/5606400
"""
def inv(x):
return pow(x, MOD - 2, MOD)
def cmb(n, r):
r = min(r, n - r)
if r == 0:
return 1
if r == 1:
return n
f = 1
for k in range(n, n - r, -1):
f = (f * k) % MOD
# n!/(n-r)... | p03039 |
# https://atcoder.jp/contests/abc127/submissions/5606400
from functools import reduce
def mod_mul(a, b):
return (a * b) % MOD
def mod_add(a, b):
return (a + b) % MOD
def cmb(n, r):
r = min(r, n - r)
if r == 0:
return 1
if r == 1:
return n
f = reduce(mo... | # https://atcoder.jp/contests/abc127/submissions/5606400
from functools import reduce
from operator import add
def mod_mul(a, b):
return (a * b) % MOD
def cmb(n, r):
r = min(r, n - r)
if r == 0:
return 1
if r == 1:
return n
f = reduce(mod_mul, list(range(n - r + ... | p03039 |
from collections import defaultdict
mod = 10 ** 9 + 7
memo = defaultdict(int)
def cmb(n, r):
if (n, r) in memo:
return memo[(n, r)]
if n < r or r < 0:
return 0
if r > n - r:
return cmb(n, n - r)
res = f[n] * pow(f[n - r], mod - 2, mod) * pow(f[r], mod - 2,... | def solve():
mod = 10 ** 9 + 7
def cmb(n, r):
def build():
fs = [1]
t = 1
for x in range(1, h * w):
t = (t * x) % mod
fs.append(t)
invs = [1] * (h * w)
t = pow(t, mod - 2, mod)
invs[-1]... | p03039 |
def solve():
mod = 10 ** 9 + 7
def cmb(n, r):
def build():
fs = [1]
t = 1
for x in range(1, h * w):
t = (t * x) % mod
fs.append(t)
invs = [1] * (h * w)
t = pow(t, mod - 2, mod)
invs[-1]... | class Calc:
def __init__(self, max_value, mod):
"""combination(max_value, all)"""
fact = [-1] * (max_value + 1)
fact[0] = 1
fact[1] = 1
for x in range(2, max_value + 1):
fact[x] = x * fact[x - 1] % mod
invs = [1] * (max_value + 1)
invs[m... | p03039 |
import math
mod = 10**9+7
N,M,K = list(map(int, input().split()))
MAX = min(N*M,mod)
facts = [1 for i in range(MAX)]
invs = [1 for i in range(MAX)]
def inv(x):
return pow(x,mod-2,mod)
for i in range(1,MAX):
facts[i] = (facts[i-1] * i)% mod
invs[i] = inv(facts[i])
def nCr(n,r):
return fac... | import math
mod = 10**9+7
N,M,K = list(map(int, input().split()))
MAX = min(N*M,mod)
facts = [1 for i in range(MAX)]
invs = [1 for i in range(MAX)]
def inv(x):
return pow(x,mod-2,mod)
for i in range(1,MAX):
facts[i] = (facts[i-1] * i)% mod
invs[i] = inv(facts[i])
def nCr(n,r):
return fac... | p03039 |
N, M, K = list(map(int, input().split()))
MOD = 10 ** 9 + 7
NM = N * M
fact = [1 for _ in range(NM+1)]
for i in range(1, NM+1):
fact[i] = fact[i-1] * i
def combination(n, m):
return fact[n] // fact[n-m] //fact[m]
pattern = combination(NM-2, K-2) % MOD
def diff_x_pattern(val):
# for d i... | N, M, K = list(map(int, input().split()))
MOD = 10 ** 9 + 7
def combination(n, m):
m = min(m, n-m)
c = 1
for i in range(m):
c *= n - i
for i in range(2, m+1):
c //= i
return c % MOD
pattern = combination(N*M-2, K-2) % MOD
def diff_x_pattern(val):
# for d in ra... | p03039 |
N, M, K = list(map(int, input().split()))
MOD = 10 ** 9 + 7
fact = [1 for _ in range(N*M+1)]
for i in range(1, N*M+1):
fact[i] = fact[i-1] * i
def inv(val):
return pow(val, MOD-2, MOD)
def combination(n, m):
return fact[n] * inv(fact[n-m]*fact[m]) % MOD
pattern = combination(N*M-2, K-2)
... | N, M, K = list(map(int, input().split()))
MOD = 10 ** 9 + 7
def combination(n, m):
c = 1
m = min(n-m, m)
for i in range(m):
c *= (n-i) * pow(m-i, MOD-2, MOD) % MOD
return c
pattern = combination(N*M-2, K-2)
def diff_x_pattern(val):
ret = 0
for d in range(1, val):
... | p03039 |
N, M, K = list(map(int, input().split()))
MOD = 10 ** 9 + 7
def combination(n, m):
c = 1
m = min(n-m, m)
for i in range(m):
c *= (n-i) * pow(m-i, MOD-2, MOD) % MOD
return c
pattern = combination(N*M-2, K-2)
def diff_x_pattern(val):
ret = 0
for d in range(1, val):
... | N, M, K = list(map(int, input().split()))
MOD = 10 ** 9 + 7
def combination(n, m):
c = 1
m = min(n-m, m)
for i in range(m):
c = c * (n-i) * pow(m-i, MOD-2, MOD) % MOD
return c
pattern = combination(N*M-2, K-2)
def diff_x_pattern(val):
ret = 0
for d in range(1, val):
... | p03039 |
import sys
from itertools import combinations
def comb_mod(n, r, MOD=10**9+7):
if n < 0 or r < 0 or n < r:
return 0
factrial = [1] * (n+1)
for k in range(1, n+1):
factrial[k] = (factrial[k-1] * k) % MOD
fact_inv = [1] * (n+1)
fact_inv[n] = pow(factrial[n], MOD - 2, MOD... | import sys
from itertools import combinations
def comb_mod(n, r, MOD=10**9+7):
if n < 0 or r < 0 or n < r:
return 0
factrial = [1] * (n+1)
for k in range(1, n+1):
factrial[k] = (factrial[k-1] * k) % MOD
fact_inv = [1] * (n+1)
fact_inv[n] = pow(factrial[n], MOD - 2, MOD... | p03039 |
p,q,r=list(map(int,input().split()))
def comb_mod(N,K,modp):
K_fact=1
NK_fact=1
N_fact=1
for i in range(1,K+1):
K_fact*=i
for i in range(1,N-K+1):
NK_fact*=i
for i in range(1,N+1):
N_fact*=i
K_inv=pow(K_fact, -1, modp)
NK_inv=pow(NK_fact,... | p,q,r=list(map(int,input().split()))
def comb_mod(N,K,modp):
K_fact=1
NK_fact=1
N_fact=1
for i in range(1,K+1):
K_fact*=i
K_fact=K_fact%modp
for i in range(1,N-K+1):
NK_fact*=i
NK_fact=NK_fact%modp
for i in range(1,N+1):
N_fact*=i
... | p03039 |
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, M, K = list(map(int, input().split()))
c = cmb(N*M-2,K-2)
ans = c *... | mod = 10**9 + 7
def comb(n, k):
x, y = 1, 1
k = min(k, n - k)
for i in range(k):
x *= n - i
x %= mod
y *= i + 1
y %= mod
return x * pow(y, mod - 2, mod) % mod
N, M, K = list(map(int, input().split()))
c = comb(N*M-2,K-2)
ans = c * (M**2 * (N**2 * (... | p03039 |
N, M, K = list(map(int, input().split()))
ppp = 10**9 + 7
def expo_div_p(a: int,n: int,p: int):
if n == 1:
d = a
elif n % 2 == 0:
d = expo_div_p(a, n//2, p)**2 % p
else:
d = a * expo_div_p(a, n//2, p)**2 % p
return d
def combi(x, y, p):
c = 1
for i in rang... | N, M, K = list(map(int, input().split()))
ppp = 10**9 + 7
#def expo_div_p(a: int,n: int,p: int):
# if n == 1:
# d = a
# elif n % 2 == 0:
# d = expo_div_p(a, n//2, p)**2 % p
# else:
# d = a * expo_div_p(a, n//2, p)**2 % p
# return d
#
def combi(x, y, p):
c = 1
for ... | p03039 |
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,M,K = list(map(int,input().split()))
C = comb(N*M-2, K-2)
#print(... | def comb(n, r):
if n - r < r: r = n - r
if r == 0: return 1
if r == 1: return n
numerator = [n - r + k + 1 for k in range(r)]
denominator = [k + 1 for k in range(r)]
for p in range(2,r+1):
pivot = denominator[p - 1]
if pivot > 1:
offset = (n - r) % p
... | p03039 |
from operator import mul
from functools import reduce
def comb2(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
import sys
def I(): return int(sys.stdin.readline())
def LI(): return ... | from operator import mul
from functools import reduce
def comb2(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
def comb3(n, r):
if n - r < r: r = n - r
if r == 0: return 1
... | p03039 |
from operator import mul
from functools import reduce
def comb2(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
def comb3(n, r):
if n - r < r: r = n - r
if r == 0: return 1
... | class combination():
#素数のmod取るときのみ 速い
def __init__(self, n, mod):
self.n = n
self.fac = [1] * (n + 1)
self.inv = [1] * (n + 1)
for j in range(1, n + 1):
self.fac[j] = self.fac[j - 1] * j % mod
self.inv[n] = pow(self.fac[n], mod - 2, mod)
for... | p03039 |
N,M,K=list(map(int,input().split()))
O,S,T=10**9+7,N+M,6
for i in range(K):S=S*(N*M-i)%O;T*=i+1
print((S*K*~-K*pow(T,O-2,O)%O)) | N,M,K=list(map(int,input().split()))
O,S,T=10**9+7,N+M,6
for i in range(K):S=S*(N*M-i)%O;T=T*-~i%O
print((S*K*~-K*pow(T,O-2,O)%O)) | p03039 |
import math
n,m,k = list(map(int,input().split()))
ss = (math.factorial(m*n)//math.factorial(k))//math.factorial(m*n-k)
s = (ss*k*(k-1))//2
r = 10**9 +7
xav = ((m**3-m) *n**2)//6
yav = ((n**3-n)*m**2)//6
av = xav + yav
d = (m*n*(m*n-1))//2
print((int(((av*s)//d)%r)))
| n,m,k = list(map(int,input().split()))
x = m*n
def cmb(n, r):
if n - r < r: r = n - r
if r == 0: return 1
if r == 1: return n
numerator = [n - r + k + 1 for k in range(r)]
denominator = [k + 1 for k in range(r)]
for p in range(2,r+1):
pivot = denominator[p - 1]
if p... | p03039 |
# -*- coding: utf-8 -*-
mod = 10 ** 9 + 7
n, m, k = list(map(int, input().split()))
nm = n * m
fact = [1] * (nm + 1)
for i in range(1, nm + 1):
fact[i] = fact[i - 1] * i
def C(n, k):
x = fact[n]
x *= pow(fact[n-k], mod - 2, mod)
x %= mod
x *= pow(fact[k], mod - 2, mod)
x %= mod... | # -*- coding: utf-8 -*-
mod = 10 ** 9 + 7
n, m, k = list(map(int, input().split()))
nm = n * m
fact = [1] * (nm + 1)
for i in range(1, nm + 1):
fact[i] = fact[i - 1] * i % mod
def C(n, k):
x = fact[n]
x *= pow(fact[n-k], mod - 2, mod)
x %= mod
x *= pow(fact[k], mod - 2, mod)
x ... | p03039 |
mod = 10**9 + 7
n, m, k = list(map(int, input().split()))
nm = n * m
fact = [1] * (nm-1)
inv = [1] * (nm-1)
inv_fact = [1] * (nm-1)
for i in range(2, nm-1):
fact[i] = fact[i-1] * i % mod
inv[i] = -(mod // i) * inv[mod % i] % mod
inv_fact[i] = inv_fact[i-1] * inv[i]
comb = fact[nm-2] * inv_fact[k-2] * in... | mod = 10**9 + 7
n, m, k = list(map(int, input().split()))
nm = n * m
fact = [1] * (nm-1)
inv = [1] * (nm-1)
inv_fact = [1] * (nm-1)
for i in range(2, nm-1):
fact[i] = fact[i-1] * i % mod
inv[i] = -(mod // i) * inv[mod % i] % mod
inv_fact[i] = inv_fact[i-1] * inv[i] % mod
comb = fact[nm-2] * inv_fact[k-2... | p03039 |
import sys
input = sys.stdin.readline
N,M,K=list(map(int,input().split()))
mod=10**9+7
def Combi2(a,b):#aは大きいが、bは小さいとき
if b>a:
return 0
ANS=1
for i in range(min(b,a-b)):
ANS=ANS*(a-i)*pow(min(b,a-b)-i,mod-2,mod)
return ANS%mod
SUM_N=SUM_M=0
for i in range(N):
SUM... | import sys
input = sys.stdin.readline
N,M,K=list(map(int,input().split()))
mod=10**9+7
def Combi2(a,b):#aは大きいが、bは小さいとき
if b>a:
return 0
ANS=1
for i in range(min(b,a-b)):
ANS=ANS*(a-i)*pow(min(b,a-b)-i,mod-2,mod)%mod
return ANS%mod
SUM_N=SUM_M=0
for i in range(N):
... | p03039 |
N,M,K = list(map(int,input().split()))
mod = 10 ** 9 + 7
MAX = N*M
fac = [0] * MAX
finv = [0] * MAX
inv = [0] * MAX
def cominit():
fac[0] = 1
fac[1] = 1
finv[0] = 1
finv[1] = 1
inv[1] = 1
for i in range(2,MAX):
fac[i] = fac[i-1] * i % mod
inv[i] = mo... |
N,M,K = list(map(int,input().split()))
mod = 10 ** 9 + 7
MAX = N*M
fac = [0] * MAX
finv = [0] * MAX
inv = [0] * MAX
def cominit():
fac[0] = 1
fac[1] = 1
finv[0] = 1
finv[1] = 1
inv[1] = 1
for i in range(2,MAX):
fac[i] = fac[i-1] * i % mod
inv[i] = mo... | p03039 |
#!/usr/bin/python3
# -*- coding: utf-8 -*-
MOD = 10**9+7
Facts = [1]*(2*10**5+1)
for i in range(2,2*10**5+1):
Facts[i] = (Facts[i-1]*i) % MOD
def mul(a,b):
return (a*b) % MOD
def power(a,b):
if b==0 : return 1
elif b==1 : return a % MOD
elif b%2==0 : return power(a,b//2)**2 % MOD
e... | #!/usr/bin/python3
# -*- coding: utf-8 -*-
MOD = 10**9+7
Facts = [1]*(2*10**5+1)
for i in range(2,2*10**5+1):
Facts[i] = (Facts[i-1]*i) % MOD
def mul(a,b):
return (a*b) % MOD
def power(a,b):
if b==0 : return 1
elif b==1 : return a % MOD
elif b%2==0 : return power(a,b//2)**2 % MOD
e... | p03039 |
import sys
readline = sys.stdin.readline
sys.setrecursionlimit(10**8)
mod = 10**9+7
#mod = 998244353
INF = 10**18
eps = 10**-7
m,n,k = list(map(int,readline().split()))
def comb(n, r, mod):
r = min(r, n-r)
mol = 1
deno = 1
for i in range(1, r+1):
mol = mol * (n-r+i) % mod
... | import sys
readline = sys.stdin.readline
sys.setrecursionlimit(10**8)
mod = 10**9+7
#mod = 998244353
INF = 10**18
eps = 10**-7
m,n,k = list(map(int,readline().split()))
def comb(n, r, mod):
r = min(r, n-r)
mol = 1
deno = 1
for i in range(1, r+1):
mol = mol * (n-r+i) % mod
... | p03039 |
import sys
readline = sys.stdin.readline
sys.setrecursionlimit(10**8)
mod = 10**9+7
#mod = 998244353
INF = 10**18
eps = 10**-7
m,n,k = list(map(int,readline().split()))
def comb(n, r, mod):
r = min(r, n-r)
mol = 1
deno = 1
for i in range(1, r+1):
mol = mol * (n-r+i) % mod
... | import sys
readline = sys.stdin.readline
sys.setrecursionlimit(10**8)
mod = 10**9+7
#mod = 998244353
INF = 10**18
eps = 10**-7
m,n,k = list(map(int,readline().split()))
def comb(n, r, mod):
r = min(r, n-r)
mol = 1
deno = 1
for i in range(1, r+1):
mol = mol * (n-r+i) % mod
... | p03039 |
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 ):
g1.append( ( g1[-1] * i ) % mod )
inverse.ap... | 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... | p03039 |
class Combination:
def __init__(self, n, MOD):
self.fact = [1]
for i in range(1, n + 1):
self.fact.append(self.fact[-1] * i % MOD)
self.inv_fact = [pow(self.fact[i] ,MOD - 2 ,MOD) for i in range(n + 1)]
self.MOD = MOD
def factorial(self, k):
'''k!を... | class Combination:
def __init__(self, n, MOD):
self.fact = [1]
for i in range(1, n + 1):
self.fact.append(self.fact[-1] * i % MOD)
self.inv_fact = [pow(self.fact[i] ,MOD - 2 ,MOD) for i in range(n + 1)]
self.MOD = MOD
def factorial(self, k):
'''k!を... | p03039 |
n, m, k = list(map(int, input().split()))
mod = 1000000007
def pow(x, n):
ret = 1
while n > 0:
if (n & 1) == 1:
ret = (ret * x) % mod
x = (x * x) % mod
n >>= 1
return ret
fac = [1]
inv = [1]
for i in range(1, n * m + 1):
fac.append((fac[-1] * i) % mod... | n, m, k = list(map(int, input().split()))
mod = 1000000007
fac = [1]
for i in range(1, n * m + 1):
fac.append((fac[-1] * i) % mod)
def pow(x, n):
ret = 1
while n > 0:
if (n & 1) == 1:
ret = (ret * x) % mod
x = (x * x) % mod
n >>= 1
return ret
def in... | p03039 |
N,M,K=list(map(int,input().split()))
MOD=10**9+7
from fractions import Fraction
# 組合せの総数
def comb(n, k):
if n < 0 or k < 0:
pdt = 0
else:
pdt = 1
for s in range(1, k + 1):
pdt *= Fraction(n - s + 1, s)
# 戻り値をint型にするために分子を取り出す
return p... | N,M,K=list(map(int,input().split()))
MOD=10**9+7
# 組合せの総数
def comb(n, r):
if n - r < r: r = n - r
if r == 0: return 1
if r == 1: return n
numerator = [n - r + k + 1 for k in range(r)]
denominator = [k + 1 for k in range(r)]
for p in range(2,r+1):
pivot = denominator[p - 1... | p03039 |
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):
fact_n = factorial_mod(n, mod)
fact_k = factorial_mod(k, mod)
fact_n_k = factorial_mod(n - k, mod)
return (fact_n * pow(fact_k, mod - 2, mod) * pow(fact_... | 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):
fact_n = factorial_mod(n, mod)
fact_k = factorial_mod(k, mod)
fact_n_k = factorial_mod(n - k, mod)
return (fact_n * pow(fact_k, mod - 2, mod) * pow(fact_... | p03039 |
N, M, K = list(map(int, input().split()))
P = 10**9+7
fact = [1]
for i in range(N*M):
fact.append(fact[-1]*(i+1))
def inv(n):
return pow(n, P-2, P)
def C(a, b):
return fact[a]*inv(fact[a-b]*fact[b])%P
print(((M**2*(N**3-N)+N**2*(M**3-M))//6*C(M*N-2, K-2)%P)) | N, M, K = list(map(int, input().split()))
P = 10**9+7
fact = [1]
for i in range(N*M):
fact.append(fact[-1]*(i+1)%P)
def inv(n):
return pow(n, P-2, P)
def C(a, b):
return fact[a]*inv(fact[a-b]*fact[b])%P
print(((M**2*(N**3-N)+N**2*(M**3-M))//6*C(M*N-2, K-2)%P)) | p03039 |
import math
n,m,k = list(map(int,input().split()))
mod = 10**9+7
memo = {}
def factorial(num):
if num == 0:
return 1
if not num in memo:
memo[num] = num*factorial(num-1)
return memo[num]
temp = math.factorial(n*m-2)//(math.factorial(k-2)*math.factorial(n*m-k))
ans = 0
for d in ... | n,m,k = list(map(int,input().split()))
mod = 10**9+7
def combination(n,r,p):
if n < r or r < 0:
return 0
r = min(n-r,r)
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[p%i]*(p//i))%p)
f... | p03039 |
n,m,k=list(map(int,input().split()))
ans=0
INF=10**9+7
if n<=m:
M=(m-1)*m*(2*m-1)//3
for i in range(1,n+1):
for j in range(i,n+1):
if i==j:
ans=ans+m*m*(m-1)//2-(m-1)*m*(2*m-1)//6
else:
d=j-i
ans=ans+d*m+2*d*m*(m-1)+(m-d)... | n,m,k=list(map(int,input().split()))
ans=0
INF=10**9+7
if n<=m:
M=(m-1)*m*(2*m-1)//3
for i in range(1,n+1):
for j in range(i,n+1):
if i==j:
ans=ans+m*m*(m-1)//2-(m-1)*m*(2*m-1)//6
else:
d=j-i
ans=ans+d*m+(m+d)*m*(m-1)-M
... | p03039 |
n,m,k=list(map(int,input().split()))
ans=0
INF=10**9+7
if n<=m:
M=-(m-1)*m*(2*m-1)//3+m*m*(m-1)
Ms=m*m*(m-1)//2-(m-1)*m*(2*m-1)//6
M=M%INF
Ms=Ms%INF
for i in range(1,n+1):
for j in range(i,n+1):
if i==j:
ans=ans+Ms
else:
d=... | n,m,k=list(map(int,input().split()))
ans=0
INF=10**9+7
if n<=m:
M=-(m-1)*m*(2*m-1)//3+m*m*(m-1)
Ms=m*m*(m-1)//2-(m-1)*m*(2*m-1)//6
M=M%INF
Ms=Ms%INF
for i in range(1,n+1):
for j in range(i,n+1):
if i==j:
ans=ans+Ms
else:
d=... | p03039 |
n,m,k=list(map(int,input().split()))
ans=0
INF=10**9+7
if n<=m:
M=-(m-1)*m*(2*m-1)//3+m*m*(m-1)
Ms=m*m*(m-1)//2-(m-1)*m*(2*m-1)//6
M=M%INF
Ms=Ms%INF
for i in range(1,n+1):
for j in range(i,n+1):
if i==j:
ans=ans+Ms
else:
d=... | n,m,k=list(map(int,input().split()))
ans=0
INF=10**9+7
if n<=m:
M=-(m-1)*m*(2*m-1)//3+m*m*(m-1)
Ms=m*m*(m-1)//2-(m-1)*m*(2*m-1)//6
M=M%INF
Ms=Ms%INF
for i in range(1,n+1):
for j in range(i,n+1):
if i==j:
ans=ans+Ms
else:
d=... | p03039 |
n, m, k = list(map(int, input().split()))
mod = 10 ** 9 + 7
MAX = n * m
class ModInt:
def __init__(self, num):
self.num = num
def __str__(self):
return str(self.num)
def __repr__(self):
return "ModInt(num: {}, mod: {}".format(self.num, mod)
def __add__(self, o... | n, m, k = list(map(int, input().split()))
mod = 10 ** 9 + 7
MAX = n * m
fact = [1] * (MAX + 1)
for i in range(1, MAX + 1):
fact[i] = (fact[i-1] * i) % mod
inv = [1] * (MAX + 1)
inv[MAX] = pow(fact[MAX], mod - 2, mod)
for i in range(MAX, 0, -1):
inv[i-1] = (inv[i] * i) % mod
def comb(n, k):
... | p03039 |
inpl = lambda: list(map(int,input().split()))
N, M ,K = inpl()
MOD = 10**9+7
factor = 1
# MN-2 C K-2 = MN-2 C MN-K = MN-2 C L
L = min(K-2,M*N-K)
for i in range(M*N-L-1,M*N-1):
factor *= i
for i in range(1,L+1):
factor //= i
factor %= MOD
ans = ((M*(N-1)*(N+1) + N*(M-1)*(M+1))*M*N //6 * factor) % MOD
... | inpl = lambda: list(map(int,input().split()))
N, M ,K = inpl()
MOD = 10**9+7
def mod_inv(a, m=MOD):
def mod_inv_sub(a, m):
if a == 1:
return 1, 0
else:
d, r = m//a, m % a
x, y = mod_inv_sub(r, a)
return y - d*x, x
x = mod_inv_sub(a,m... | p03039 |
# coding: utf-8
import re
import math
import fractions
import random
import time
#import numpy as np
mod=int(10**9+7)
inf=int(10**20)
fac=[1]*250000
for a in range(2,250000):
fac[a]=fac[a-1]*a%mod
class union_find():
def __init__(self,n):
self.n=n
self.P=[a for a in range(N)]
... | # coding: utf-8
import re
import math
import fractions
import random
import time
#import numpy as np
mod=int(10**9+7)
inf=int(10**20)
fac=[1]*250000
for a in range(2,250000):
fac[a]=fac[a-1]*a%mod
class union_find():
def __init__(self,n):
self.n=n
self.P=[a for a in range(N)]
... | p03039 |
n,m,k=list(map(int,input().split()))
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 + 1)))
return over // under%mod
A=n*m
v=cmb(A-2,k-2)
... | n,m,k=list(map(int,input().split()))
mod=10**9+7
A=n*m-2
from math import factorial
def Comb(N, K):
a = factorial(N) % mod
b = factorial(K) % mod
c = factorial(N-K) % mod
return (a * pow(b, mod-2, mod) * pow(c, mod-2, mod)) % mod
v=Comb(A,k-2)
t=0
y=0
for i in range(1,n):
t+=i*(n-i)*m*m%m... | p03039 |
from itertools import combinations
import math
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 ** 6 # N は必要分だけ用意する
fact = [1, 1] # fact[n] = (n! mod p)
factinv = [1, 1] # factinv[n] = ((n!)^(-1) ... | """
基本の方針は「各マンハッタン距離が何回足されるか」という考え方で距離の値を積み上げて行けばよい
まず、XとYは独立に考えることにする。
X軸の距離の方から積み上げる。
X1とX2の距離が足される回数は、
A.X1の列とX2の列の座標の組み合わせの数 × B.その組み合わせが含まれるような座標の組み合わせの数
である。
A ＝ 行数**２
B ＝ CMB(N*M-2 , K-2)である
同様の計算をY軸に関しても行えばよい。
"""
def cmb(n, r, p):
if (r < 0) or (n < r):
return 0
r = min(r, n -... | p03039 |
import sys
mod = pow(10, 9) + 7
def C(n, r):
if ( r<0 or r>n ):
return 0
r = min(r, n-r)
return g1[n] * g2[r] * g2[n-r] % mod
NNN = (10**6)
g1 = [1, 1]
g2 = [1, 1]
inverse = [0, 1]
for i in range(2, NNN+1):
g1.append( ( g1[-1] * i ) % mod )
inverse.append( ( -inverse[mod % i] * ... | N, M, K = list(map(int, input().split()))
import sys
mod = pow(10, 9) + 7
sys.setrecursionlimit(pow(10, 8))
def power(x, y):
if y == 0: return 1
elif y == 1 : return x % mod
elif y % 2 == 0 : return power(x, y//2)**2 % mod
else: return power(x, (y-1)//2)**2 * x % mod
def mul(a, b):
... | p03039 |
#!/usr/bin/env python3
import sys
INF = float("inf")
MOD = 1000000007 # type: int
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 for k in range(r)]
for p in range(2, r+1):
... | #!/usr/bin/env python3
import sys
INF = float("inf")
MOD = 1000000007 # type: int
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 for k in range(r)]
for p in range(2, r+1):
... | p03039 |
MAX = 10**9 + 7
def mod_inv(i, MOD):
return pow(i, MOD-2, MOD)
def combination(_N, _K):
if _K > (_N/2):
_K = _N - _K
up = 1
low = 1
for i in range (_K):
up *= (_N - i) % MAX
low *= (i + 1) % MAX
ret = up * mod_inv(low, MAX)
if ret >= MAX:
ret ... | MAX = 10**9 + 7
def mod_inv(i, mod):
return pow(i, mod-2, mod)
def combination(_N, _K):
if _K > (_N/2):
_K = _N - _K
up = 1
low = 1
for i in range (_K):
up = up * (_N - i) % MAX
low = low * (i + 1) % MAX
ret = up * mod_inv(low, MAX) % MAX
return ret
... | p03039 |
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def main():
N, M, K = list(map(int, readline().split()))
COM_MAX = N * M
fac, finv, inv = [0] * (COM_MAX + 1), [0] * (COM_MAX + 1),... | import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def main():
N, M, K = list(map(int, readline().split()))
COM_MAX = N * M
fac, finv, inv = [0] * (COM_MAX + 1), [0] * (COM_MAX + 1),... | p03039 |
n,m,k=list(map(int,input().split()))
mod=10**9+7
import math
def f(x):
return math.factorial(x)
def c(x,y):
return f(x)//(f(x-y)*f(y))
ans=(n**2*(m-1)*m*(m+1)//6)%mod
ans=(ans+m**2*(n-1)*n*(n+1)//6)%mod
ans=(ans*c(m*n-2,k-2))%mod
print(ans) | n,m,k=list(map(int,input().split()))
import math
def f(x): return math.factorial(x)
def c(x,y): return f(x)//(f(x-y)*f(y))
print((((n**2*(m-1)*m*(m+1)//6+m**2*(n-1)*n*(n+1)//6)*c(m*n-2,k-2))%(10**9+7))) | p03039 |
import sys
sys.setrecursionlimit(100000)
while True:
n,m,h,k = list(map(int,input().split()))
if not n: break
s_lst = [int(eval(input())) for _ in range(n)]
b_lst = [tuple(map(int,input().split())) for _ in range(m)]
b_lst = sorted(b_lst,key=lambda x:-x[1])
def amida(b_lst, s_lst, used, k):
if ... | while True:
n,m,h,k = list(map(int,input().split()))
if not n: break
s_lst = [int(eval(input())) for _ in range(n)]
i_lst = [i for i in range(n)]
b_lst = [tuple(map(int,input().split())) for _ in range(m)]
b_lst = sorted(b_lst,key=lambda x:x[1])
pare_lst = []
for bar in b_lst:
ind = bar[0]
... | p00463 |
while True:
n, m, h, k = list(map(int, input().split()))
if not n:
break
points = [int(eval(input())) for _ in range(n)]
bars = [tuple(map(int, input().split())) for _ in range(m)]
bars_h = [set() for _ in range(h)]
for ba, bh in bars:
bars_h[bh].add(ba - 1)
swap = [... | while True:
n, m, h, k = list(map(int, input().split()))
if not n:
break
points = [int(eval(input())) for _ in range(n)]
bars = [tuple(map(int, input().split())) for _ in range(m)]
bars_h = [set() for _ in range(h)]
for ba, bh in bars:
bars_h[bh].add(ba - 1)
swap = l... | p00463 |
import sys
input=sys.stdin.readline
import copy
def knapsack(N,W,weight,value):
dp=[[999999999999 for i in range(W+1)] for j in range(N+1)]
dp2=[[set() for i in range(W+1)] for j in range(N+1)]
for i in range(W+1): dp[0][i]=0
for i in range(N):
for w in range(W+1):
if weight[i]<=w:
... | import sys
input=sys.stdin.readline
import copy
def knapsack(N,W,weight,value):
dp=[[999999999999 for i in range(W+1)] for j in range(N+1)]
dp2=[]
for i in range(N+1):
x=[]
for j in range(W+1):
x.append([])
dp2.append(x)
for i in range(W+1): dp[0][i]=0
for i in range(N):
... | p02863 |
import sys
input=sys.stdin.readline
import copy
def knapsack(N,W,weight,value):
dp=[[999999999999 for i in range(W+1)] for j in range(N+1)]
dp2=[]
for i in range(N+1):
x=[]
for j in range(W+1):
x.append([])
dp2.append(x)
for i in range(W+1): dp[0][i]=0
for i in range(N):
... | import sys
input=sys.stdin.readline
import copy
def knapsack(N,W,weight,value):
dp=[[999999999999 for i in range(W+1)] for j in range(N+1)]
for i in range(W+1): dp[0][i]=0
for i in range(N):
for w in range(W+1):
if weight[i]<=w:
if dp[i][w-weight[i]]+value[i]>dp[i][w]:
dp[... | p02863 |
import sys
input=sys.stdin.readline
def knapsack(N,W,weight,value):
dp=[[float('inf') for i in range(W+1)] for j in range(N+1)]
for i in range(W+1):
dp[0][i]=0
for i in range(N):
for w in range(W+1):
if weight[i]<=w:
if dp[i][w-weight[i]]+value[i]>dp[i][w]:
dp[i+1][w]=... | import sys
input=sys.stdin.readline
def knapsack(N,W,weight,value):
dp=[[999999999999 for i in range(W+1)] for j in range(N+1)]
for i in range(W+1):
dp[0][i]=0
for i in range(N):
for w in range(W+1):
if weight[i]<=w:
if dp[i][w-weight[i]]+value[i]>dp[i][w]:
dp[i+1][w]=... | p02863 |
import sys
input=sys.stdin.readline
import copy
def knapsack(N,W,weight,value):
dp=[[999999999999 for i in range(W+1)] for j in range(N+1)]
dp2=[[0 for i in range(W+1)] for j in range(N+1)]
for i in range(W+1): dp[0][i]=0
for i in range(N):
for w in range(W+1):
if weight[i]<=w:
if... | import sys
input=sys.stdin.readline
def knapsack(N,W,weight,value):
dp=[[999999999999 for i in range(W+1)] for j in range(N+1)]
for i in range(W+1):
dp[0][i]=0
for i in range(N):
for w in range(W+1):
if weight[i]<=w:
if dp[i][w-weight[i]]+value[i]>dp[i][w]:
dp[i+1][w]=... | p02863 |
N,T=list(map(int,input().split()))
x=[None] # x[0]
for i in range(1,N+1): # x[i]のiに対応させる
x.append(tuple(map(int,input().split()))) # x[1]~x[N]
# print(x) #DB★
dp1=[[0 for j in range(T)] for i in range(N+2)] # 0~N+1 dp1[i]はx[1]からx[i]まで使用（dp1[0]は使用するx[i]なしの初期値，dp1[N+1]は余り→0で初期化していることが後で役に立つ）
for i in range(1,... | N,T=list(map(int,input().split()))
x=[(0,0)] # x[0]
for i in range(1,N+1): # x[i]のiに対応させる
x.append(tuple(map(int,input().split()))) # x[1]~x[N]
x.sort()
# print(x) #DB★
dp1=[[0 for j in range(T)] for i in range(N+2)] # 0~N+1 dp1[i]はx[1]からx[i]まで使用（dp1[0]は使用するx[i]なしの初期値，dp1[N+1]は余り→0で初期化していることが後で役に立つ）
for ... | p02863 |
n, t = list(map(int, input().split()))
a, b, ab = [], [], []
for _ in range(n):
ab.append(tuple(map(int, input().split())))
ab.sort(key=lambda x:x[0])
for i in ab:
a.append(i[0])
b.append(i[1])
# dp[i][j] = 0~i番目の料理でj分以内に完食できる美味しさの合計の最大値
# 0 <= i <= n-1, 0 <= j <= t-1
dp = [[0 for _ in range(a[0... | n, t = list(map(int, input().split()))
a, b, ab = [], [], []
for _ in range(n):
ab.append(tuple(map(int, input().split())))
ab.sort(key=lambda x:x[0])
for i in ab:
a.append(i[0])
b.append(i[1])
# dp[i][j] = 0~i番目の料理でj分以内に完食できる美味しさの合計の最大値
# 0 <= i <= n-1, 0 <= j <= t-1
dp = [[0 for _ in range(min... | p02863 |
N, W = list(map(int, input().split()))
items = [list(map(int, input().split())) for i in range(N)]
# dp1[i][j] := 商品0 ~ i が対象
# dp2[i][j] := 商品i ~ N が対象(順番はそのまま)
# out-of-index 対策に余分に取っておく
dp1 = [[0] * (W + 1) for i in range(N + 2)]
dp2 = [[0] * (W + 1) for i in range(N + 2)]
# dp1を埋める
for i in range(N):
... | N, W = list(map(int, input().split()))
items = sorted([list(map(int, input().split())) for i in range(N)])
# dp1[i][j] := 商品0 ~ i が対象
dp = [[0] * (W + 1) for i in range(N + 1)]
# dpテーブルを埋める
for i in range(N):
wi, vi = items[i]
for j in range(W + 1):
if j + wi <= W:
dp[i + 1][j +... | p02863 |
N, W = list(map(int, input().split()))
items = sorted([list(map(int, input().split())) for i in range(N)])
# dp1[i][j] := 商品0 ~ i が対象
dp = [[0] * (W + 1) for i in range(N + 1)]
# dpテーブルを埋める
for i in range(N):
wi, vi = items[i]
for j in range(W + 1):
if j + wi <= W:
dp[i + 1][j +... | N, W = list(map(int, input().split()))
items = sorted([list(map(int, input().split())) for i in range(N)])
# dp1[i][j] := 商品0 ~ i が対象
dp = [[0] * (W + 1) for i in range(N + 1)]
# dpテーブルを埋める
for i in range(N):
wi, vi = items[i]
for j in range(W + 1):
if j + wi <= W:
dp[i + 1][j +... | p02863 |
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
n,t = list(map(int,readline().split()))
f = []
m = 0
for i in range(n):
p,q = list(map(int,readline().split()))
m = max(m,p)
f.append((p,q))
f.sort()
dp = [[0]*(t+m) for i in range(n+1)]
for i,c in enumerate(f):
a,b ... | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
n,t = list(map(int,readline().split()))
f = []
m = 0
for i in range(n):
p,q = list(map(int,readline().split()))
m = max(m,p)
f.append((p,q))
f.sort()
dp = [[0]*(t+m) for i in range(n+1)]
for i,c in enumerate(f):
a,b ... | p02863 |
from sys import stdin
def main():
#入力
readline=stdin.readline
n,t=list(map(int,readline().split()))
li=[list(map(int,readline().split())) for _ in range(n)]
li.sort()
a=[0]*n
b=[0]*n
for i in range(n):
a[i],b[i]=li[i][0],li[i][1]
#ナップサックDP
inf=-float("inf")
... | from sys import stdin
def main():
#入力
readline=stdin.readline
n,t=list(map(int,readline().split()))
li=[list(map(int,readline().split())) for _ in range(n)]
li.sort()
a=[0]*n
b=[0]*n
for i in range(n):
a[i],b[i]=li[i][0],li[i][1]
#ナップサックDP
inf=-10**9
dp... | p02863 |
n,t=list(map(int,input().split()))
ab=[]
for i in range(n):
ab.append(list(map(int,input().split())))
ab_r=list(reversed(ab))
dp1=[[0 for j in range(t)] for i in range(n+1)]
dp2=[[0 for j in range(t)] for i in range(n+1)]
for i in range(n):
for j in range(t-1):
if ab[i][0] <= j:
... | n,t=list(map(int,input().split()))
ab=[]
for i in range(n):
ab.append(list(map(int,input().split())))
ab_r=list(reversed(ab))
dp1=[[0 for j in range(t)] for i in range(n+1)]
dp2=[[0 for j in range(t)] for i in range(n+1)]
for i in range(n):
for j in range(t-1):
if ab[i][0] <= j:
... | p02863 |
#16:25
n,t = list(map(int,input().split()))
wv = []
for _ in range(n):
wv.append(list(map(int,input().split())))
wv.sort(key=lambda x:x[0])
now = [0 for _ in range(t+1)]
for i in range(n):
w,v = wv[i]
last = now
now = []
for f in range(t):
if f >= w:
now.append(max(last[f-w]+v,last[f]))... | n,t = list(map(int,input().split()))
dish = []
for _ in range(n):
a,b = list(map(int,input().split()))
dish.append([a,b])
dish.sort()
now = [0 for _ in range(t+1)]
for i in range(n):
a,b = dish[i]
for d in range(t)[::-1]:
if d + a < t:
now[d+a] = max(now[d+a],now[d]+b)
else:
now... | p02863 |
import math
def main():
N, T = list(map(int, input().split()))
C = []
for _ in range(N):
A, B = list(map(int, input().split()))
C.append([B, A])
C.sort()
dp = [[0, 0] for _ in range(T)]
ans = 0
for i in range(T):
for j in range(N):
if (dp... | import math
def main():
N, T = list(map(int, input().split()))
C = []
for _ in range(N):
A, B = list(map(int, input().split()))
C.append([B, A])
# C.sort()
dp = [[0, 0] for _ in range(T)]
ans = 0
for i in range(T):
for j in range(N):
if (... | p02863 |
import sys
def LI(): return list(map(int,sys.stdin.readline().rstrip().split())) #空白あり
def S(): return sys.stdin.readline().rstrip()
N,T = list(map(int,S().split()))
A = [0]
B = [0]
for i in range(N):
a,b = LI()
A.append(a)
B.append(b)
dp1 = [[0]*(T+1) for i in range(N+1)]
# dp[i][j] = 1~i番目... | def main():
import sys
def LI():
return list(map(int, sys.stdin.readline().rstrip().split())) # 空白あり
def S():
return sys.stdin.readline().rstrip()
N, T = list(map(int, S().split()))
A = [0]
B = [0]
for i in range(N):
a, b = LI()
A.append(a)
... | p02863 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.