結果

問題 No.2141 Enumeratest
ユーザー MasKoaTSMasKoaTS
提出日時 2022-12-02 21:54:29
言語 PyPy3
(7.3.15)
結果
WA  
実行時間 -
コード長 2,458 bytes
コンパイル時間 209 ms
コンパイル使用メモリ 82,560 KB
実行使用メモリ 83,584 KB
最終ジャッジ日時 2024-04-18 05:48:25
合計ジャッジ時間 5,644 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 45 ms
52,608 KB
testcase_01 AC 43 ms
52,352 KB
testcase_02 AC 115 ms
76,160 KB
testcase_03 AC 93 ms
76,032 KB
testcase_04 AC 1,042 ms
83,584 KB
testcase_05 WA -
testcase_06 AC 42 ms
52,736 KB
testcase_07 AC 60 ms
67,840 KB
testcase_08 AC 74 ms
75,648 KB
testcase_09 AC 72 ms
75,776 KB
testcase_10 AC 81 ms
75,904 KB
testcase_11 AC 85 ms
75,648 KB
testcase_12 AC 55 ms
63,104 KB
testcase_13 AC 73 ms
76,160 KB
testcase_14 AC 87 ms
76,288 KB
testcase_15 AC 80 ms
76,288 KB
testcase_16 AC 81 ms
75,648 KB
testcase_17 WA -
testcase_18 WA -
testcase_19 WA -
testcase_20 WA -
testcase_21 WA -
testcase_22 WA -
testcase_23 WA -
testcase_24 AC 289 ms
77,568 KB
testcase_25 AC 95 ms
75,972 KB
testcase_26 WA -
testcase_27 WA -
testcase_28 WA -
testcase_29 WA -
testcase_30 WA -
testcase_31 WA -
testcase_32 WA -
testcase_33 WA -
testcase_34 AC 623 ms
80,640 KB
testcase_35 WA -
testcase_36 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

import sys
input = sys.stdin.readline

class ModInt:
	mod = 998244353

	def __init__(self, x):
		self.x = x % ModInt.mod

	@classmethod
	def set_mod(cls, mod: int) -> None:
		ModInt.mod = mod
		
	def __str__(self):
		return str(self.x)

	__repr__ = __str__

	def __add__(self, other):
		return (ModInt(self.x + other.x) if isinstance(other, ModInt) else ModInt(self.x + other))

	def __sub__(self, other):
		return (ModInt(self.x - other.x) if isinstance(other, ModInt) else ModInt(self.x - other))

	def __mul__(self, other):
		return (ModInt(self.x * other.x) if isinstance(other, ModInt) else ModInt(self.x * other))

	def __truediv__(self, other):
		return (ModInt(self.x * pow(other.x, ModInt.mod - 2, ModInt.mod)) if isinstance(other, ModInt)
		  else ModInt(self.x * pow(other, ModInt.mod - 2, ModInt.mod)))

	def __pow__(self, other):
		return ModInt(pow(self.x, other.x, ModInt.mod)) if isinstance(other, ModInt) else ModInt(pow(self.x, other, ModInt.mod))

	__radd__ = __add__

	def __rsub__(self, other):
		return (ModInt(other.x - self.x) if isinstance(other, ModInt) else ModInt(other - self.x))

	__rmul__ = __mul__

	def __rtruediv__(self, other):
		return (ModInt(other.x * pow(self.x, ModInt.mod - 2, ModInt.mod)) if isinstance(other, ModInt)
		  else ModInt(other * pow(self.x, ModInt.mod - 2, ModInt.mod)))

	def __rpow__(self, other):
		return ModInt(pow(other.x, self.x, ModInt.mod)) if isinstance(other, ModInt) else ModInt(pow(other, self.x, ModInt.mod))

	def __iadd__(self, other):
		self = self + other
		return self

	def __isub__(self, other):
		self = self - other
		return self

	def __imul__(self, other):
		self = self * other
		return self

	def __itruediv__(self, other):
		self = self / other
		return self
	
	@classmethod
	def nCk(cls, n, k):
		if(isinstance(n, ModInt)):
			n = n.x
		if(isinstance(k, ModInt)):
			k = k.x
		r = min(n - k, k)
		ret = ModInt(1)
		for i in range(n - r + 1, n + 1):
			ret *= i
		d = ModInt(1)
		for i in range(2, r + 1):
			d *= i
		ret /= d
		return ret

"""
Main Code
"""

n, m = map(int, input().split())

if(n > m):
	ans = ModInt(1)
	for i in range(n - m + 1, n + 1):
		ans *= i
	print(ans)
	exit(0)

a = [0] * n
t = m
i = 0
while(t > 0):
	a[i % n] += 1
	t -= 1
	i += 1
# print(a)

ans = ModInt(1)
for i in range(2, m + 1):
	ans *= i
fact = {}
for k in a:
	if(k in fact):
		ans /= fact[k]
		continue
	d = ModInt(1)
	for j in range(2, k + 1):
		d *= j
	fact[k] = d 
	ans /= d
print(ans)
0