結果
| 問題 |
No.117 組み合わせの数
|
| ユーザー |
mkawa2
|
| 提出日時 | 2020-01-20 22:07:09 |
| 言語 | Python3 (3.13.1 + numpy 2.2.1 + scipy 1.14.1) |
| 結果 |
TLE
|
| 実行時間 | - |
| コード長 | 1,694 bytes |
| コンパイル時間 | 140 ms |
| コンパイル使用メモリ | 12,800 KB |
| 実行使用メモリ | 488,436 KB |
| 最終ジャッジ日時 | 2024-07-02 23:13:41 |
| 合計ジャッジ時間 | 12,929 ms |
|
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
| ファイルパターン | 結果 |
|---|---|
| other | TLE * 1 |
ソースコード
import sys
sys.setrecursionlimit(10 ** 6)
def II(): return int(sys.stdin.readline())
class mint:
def __init__(self, x):
self.__x = x % md
def __str__(self):
return str(self.__x)
def __add__(self, other):
if isinstance(other, mint): other = other.__x
return mint(self.__x + other)
def __sub__(self, other):
if isinstance(other, mint): other = other.__x
return mint(self.__x - other)
def __rsub__(self, other):
return mint(other - self.__x)
def __mul__(self, other):
if isinstance(other, mint): other = other.__x
return mint(self.__x * other)
__radd__ = __add__
__rmul__ = __mul__
def __truediv__(self, other):
if isinstance(other, mint): other = other.__x
return mint(self.__x * pow(other, md - 2, md))
def __pow__(self, power, modulo=None):
return mint(pow(self.__x, power, md))
def nCr(com_n, com_r):
if com_n < com_r: return 0
return fac[com_n] * ifac[com_r] * ifac[com_n - com_r]
def nPr(com_n, com_r):
if com_n < com_r: return 0
return fac[com_n] * ifac[com_n - com_r]
def nHr(com_n, com_r):
return nCr(com_n + com_r - 1, com_r)
md = 10 ** 9 + 7
n_max = 10 ** 6 * 2
fac = [mint(1)]
for i in range(1, n_max + 1): fac.append(fac[-1] * i)
ifac = [1] * (n_max + 1)
ifac[n_max] = fac[n_max] ** (md - 2)
for i in range(n_max - 1, 1, -1): ifac[i] = ifac[i + 1] * (i + 1)
def main():
t = II()
for _ in range(t):
s = input()
op = s[0]
n, r = map(int, s[2:-1].split(","))
if op == "C": print(nCr(n, r))
if op == "P": print(nPr(n, r))
if op == "H": print(nHr(n, r))
main()
mkawa2