結果

問題 No.140 みんなで旅行
ユーザー Coki628
提出日時 2020-11-12 02:42:35
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 216 ms / 5,000 ms
コード長 2,813 bytes
コンパイル時間 320 ms
コンパイル使用メモリ 82,432 KB
実行使用メモリ 78,976 KB
最終ジャッジ日時 2024-07-22 18:57:09
合計ジャッジ時間 3,400 ms
ジャッジサーバーID
(参考情報)
judge5 / judge3
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 19
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

import sys
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for k in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for k in range(c)] for k in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(N=None): return list(MAP()) if N is None else [INT() for i in range(N)]
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10**9)
INF = 10**19
MOD = 10**9 + 7
EPS = 10**-10
class ModTools:
""" """
def __init__(self, MAX, MOD):
# nCrnnHrn+r
MAX += 1
self.MAX = MAX
self.MOD = MOD
factorial = [1] * MAX
factorial[0] = factorial[1] = 1
for i in range(2, MAX):
factorial[i] = factorial[i-1] * i % MOD
inverse = [1] * MAX
inverse[MAX-1] = pow(factorial[MAX-1], MOD-2, MOD)
for i in range(MAX-2, -1, -1):
inverse[i] = inverse[i+1] * (i+1) % MOD
self.fact = factorial
self.inv = inverse
def nCr(self, n, r):
""" """
if n < r: return 0
r = min(r, n-r)
numerator = self.fact[n]
denominator = self.inv[r] * self.inv[n-r] % self.MOD
return numerator * denominator % self.MOD
def nHr(self, n, r):
""" """
return self.nCr(r+n-1, r)
def nPr(self, n, r):
""" """
if n < r: return 0
return self.fact[n] * self.inv[n-r] % self.MOD
def div(self, x, y):
""" MOD """
return x * pow(y, self.MOD-2, self.MOD) % self.MOD
# NK(1)
def stirling(N, K):
dp = list2d(N+1, K+1, 0)
dp[0][0] = 1
for i in range(1, N+1):
for k in range(1, K+1):
dp[i][k] = dp[i-1][k-1] + k*dp[i-1][k]
dp[i][k] %= MOD
return dp
N = INT()
mt = ModTools(N, MOD)
S = stirling(N, N)
ans = 0
# k
for k in range(1, N+1):
# nm
for n in range(N+1):
m = N - n
# Nn
# * n1k()
# * m(kk-1)
ans += mt.nCr(N, n) * S[n][k] * pow(k, m, MOD)*pow(k-1, m, MOD)
ans %= MOD
print(ans)
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0