input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
# E - Colorful Blocks
import sys
readline = sys.stdin.readline
MOD = 998244353
N, M, K = list(map(int, readline().split()))
# 予め階乗を計算しておく
f = [1]
for i in range(N):
f.append(f[i] * (i+1) % MOD)
f_inv = [1] * N
f_inv[N-1] = pow(f[N-1], MOD-2, MOD)
for i in range(N-1)[::-1]:
f_inv[i] = f_inv[i+1... | # E - Colorful Blocks
import sys
readline = sys.stdin.readline
MOD = 998244353
N, M, K = list(map(int, readline().split()))
# 予め階乗を計算しておく
f = [1]
for i in range(N):
f.append(f[i] * (i+1) % MOD)
f_inv = [1] * N
f_inv[N-1] = pow(f[N-1], MOD-2, MOD)
for i in range(N-1)[::-1]:
f_inv[i] = f_inv[i+1... | p02685 |
# coding: utf-8
def bpow(x, y, z):
a = 1
for b in format(y, 'b'):
a = (a*a) % z
if b == '1':
a = (a*x) % z
y >>= 1
return a
def solve(*args: str) -> str:
n, m, k = list(map(int, args[0].split()))
mod = 998244353
ret = m*bpow(m-1, n-1, mod... | # coding: utf-8
def bpow(x, y, z):
a = 1
for b in format(y, 'b'):
a = (a*a) % z
if b == '1':
a = (a*x) % z
return a
def solve(*args: str) -> str:
n, m, k = list(map(int, args[0].split()))
mod = 998244353
if m == 1 and n-1 == k:
return str... | p02685 |
# coding: utf-8
def bpow(x, y, z):
a = 1
for b in format(y, 'b'):
a = (a*a) % z
if b == '1':
a = (a*x) % z
return a
def solve(*args: str) -> str:
n, m, k = list(map(int, args[0].split()))
mod = 998244353
if m == 1 and n-1 == k:
return str... | # coding: utf-8
def solve(*args: str) -> str:
n, m, k = list(map(int, args[0].split()))
mod = 998244353
if m == 1 and n-1 == k:
return str(1)
ncr = 1
p = m*pow(m-1, n-1, mod) % mod
ret = p
inv = pow(m-1, mod-2, mod)
for i in range(1, k+1):
ncr = (ncr * ... | p02685 |
# coding: utf-8
def solve(*args: str) -> str:
n, m, k = list(map(int, args[0].split()))
mod = 998244353
if m == 1 and n-1 == k:
return str(1)
ncr = 1
p = m*pow(m-1, n-1, mod) % mod
ret = p
inv = pow(m-1, mod-2, mod)
for i in range(1, k+1):
ncr = (ncr * ... | # coding: utf-8
def solve(*args: str) -> str:
n, m, k = list(map(int, args[0].split()))
mod = 998244353
if m == 1 and n-1 == k:
return str(1)
ncr = 1
p = m*pow(m-1, n-1, mod) % mod
ret = p
iR = [1]*(k+1)
im = pow(m-1, mod-2, mod)
for i in range(1, k+1):... | p02685 |
def inv(a,m):
b=m
(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 % m
mod=998244353
n,m,k=list(map(int,input().split()))
frac=[1 for i in ra... | def inv(a,m):
b=m
(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 % m
mod=998244353
n,m,k=list(map(int,input().split()))
frac=[1 for i in ra... | p02685 |
MOD=998244353
N,M,K=list(map(int,input().split()))
def powmod(a,p):
if p==0:
return 1
else:
pow2=powmod(a,p//2)
if p%2==0:
return (pow2**2)%MOD
else:
return (a*pow2**2)%MOD
def invmod(a):
return powmod(a,MOD-2)
if M==1 and K<N-1:
print((0))
else:
ans=0
term1=... | MOD=998244353
N,M,K=list(map(int,input().split()))
inv_table = [0]+[1]
for i in range(2,K+2):
inv_table.append(-(MOD//i)*inv_table[MOD%i]%MOD)
def powmod(a,p):
if p==0:
return 1
else:
pow2=powmod(a,p//2)
if p%2==0:
return (pow2**2)%MOD
else:
return (a*pow2**2)%MOD
def... | p02685 |
#!/usr/bin/python3
# -*- coding:utf-8 -*-
def main():
MAX = 998244353
n, m, k = list(map(int, input().split()))
def pow_mod_p(n, k, p):
x = 1
while k:
if k % 2 == 1:
x *= n
x %= p
n **= 2
n %= p
k >>= 1
return x
ncp = m * pow_mod_p(m-1... | #!/usr/bin/python3
# -*- coding:utf-8 -*-
def main():
MAX = 998244353
n, m, k = list(map(int, input().split()))
cnt = 0
cmb = 1
for ik in range(k+1):
ncp = m * pow(m-1, n-ik-1, MAX)
ncp %= MAX
if ik == 0:
cmb = 1
else:
cmb *= ((n-ik) * pow(ik, MAX-2, MAX)... | p02685 |
def power(x, y, mod):
"""
https://qiita.com/Yaruki00/items/fd1fc269ff7fe40d09a6
二分累乗法でx ** yを求める
2 ** n = 4 ** (n//2) = 16 ** (n//4)
みたいなことをする
"""
if y == 0 : return 1
elif y == 1 : return x % mod
elif y % 2 == 0 : return power(x, y//2, mod)**2 % mod
e... | def power(x, y, mod):
"""
https://qiita.com/Yaruki00/items/fd1fc269ff7fe40d09a6
二分累乗法でx ** yを求める
2 ** n = 4 ** (n//2) = 16 ** (n//4)
みたいなことをする
"""
if y == 0 : return 1
elif y == 1 : return x % mod
elif y % 2 == 0 : return power(x, y//2, mod)**2 % mod
e... | p02685 |
n, m, k = list(map(int, input().split()))
mod = 998244353
def powerDX(n, r, mod):
if r == 0: return 1
if r%2 == 0:
return powerDX(n*n % mod, r//2, mod) % mod
if r%2 == 1:
return n * powerDX(n, r-1, mod) % mod
def cmb(n, r, mod):
if ( r<0 or r>n ):
return 0
r = min(r, n-r)
... | n, m, k = list(map(int, input().split()))
mod = 998244353
def powerDX(n, r, mod):
if r == 0: return 1
if r%2 == 0:
return powerDX(n*n % mod, r//2, mod) % mod
if r%2 == 1:
return n * powerDX(n, r-1, mod) % mod
def cmb(n, r, mod):
if ( r<0 or r>n ):
return 0
r = min(r, n-r)
... | p02685 |
def main():
N, M, K = [int(x) for x in input().split()]
if M == 1:
if K == N - 1:
return 1
else:
return 0
if N == 1:
return M
mod = 998244353
fact = [1]
for i in range(1, N):
fact.append(fact[-1] * i % mod)
count = 0
f... | def main():
N, M, K = [int(x) for x in input().split()]
if M == 1:
if K == N - 1:
return 1
else:
return 0
if N == 1:
return M
mod = 998244353
fact = [1]
for i in range(1, N):
fact.append(fact[-1] * i % mod)
fact_inv = [pow(... | p02685 |
from collections import deque
from heapq import heapify,heappop,heappush,heappushpop
from copy import copy,deepcopy
from itertools import product,permutations,combinations,combinations_with_replacement
from collections import defaultdict,Counter
from bisect import bisect_left,bisect_right
# from math import gcd,c... | from collections import deque
from heapq import heapify,heappop,heappush,heappushpop
from copy import copy,deepcopy
from itertools import product,permutations,combinations,combinations_with_replacement
from collections import defaultdict,Counter
from bisect import bisect_left,bisect_right
# from math import gcd,c... | p02685 |
import math
MOD = 998244353
N,M,K = [int(hoge) for hoge in input().split()]
NcK = []
POWER = []
cur = 1#Nc0
for k in range(K+1):
NcK.append(cur % MOD)
cur *= (N-1-k)
if k==K:break
cur //= (k+1)
ans = 0
Power = 1
for k in range(N-1-K):#M-1**n-1-K
Power *= M-1
Power %= MOD
... | #互いに素なa,bについて、a*x+b*y=1の一つの解
def extgcd(a,b):
r = [1,0,a]
w = [0,1,b]
while w[2]!=1:
q = r[2]//w[2]
r2 = w
w2 = [r[0]-q*w[0],r[1]-q*w[1],r[2]-q*w[2]]
r = r2
w = w2
#[x,y]
return [w[0],w[1]]
# aの逆元(mod m)を求める。(aとmは互いに素であることが前提)
def mod_inv(a,m):
... | p02685 |
mod = 998244353
def bi(x):
o = []
while x != 0:
o.append(x%2)
x //= 2
return o
def modpow(m,n):
o = 0
leo = 0
if n == 1000000005:
o = [1, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1]
leo = 30
else:
... | def a():
mod = 998244353
def bi(x):
o = []
while x != 0:
o.append(x%2)
x //= 2
return o
o = bi(mod - 2)
leo = len(o)
p = [0] * leo
def modinv(m):
p[0] = m
for i in range(1,leo):
a = p[i-1]
... | p02685 |
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees, log2, gcd
from itertools import accumulate, permutations, combinations, combinations_with_replacement, product, groupby
from operator import itemge... | import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees, log2, gcd
from itertools import accumulate, permutations, combinations, combinations_with_replacement, product, groupby
from operator import itemge... | p02685 |
n,m,k = list(map(int,input().split()))
mod = 998244353
f = [m]
for i in range(1,n):
f.append((f[i-1]*(m-1))%mod)
p = [1]
buns = 1
bunb = 1
for i in range(k):
buns *= (n-1-i)
buns %= mod
bunb *= pow(i+1,mod-2,mod)
p.append((bunb*buns)%mod)
ans = 0
for i in range(k+1):
ans += f[n-1... | 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
n,m,k = list(map(int,input().split()))
mod = 998244353
fact = [1, 1]
factinv = [1, 1]
inv = [0,1]
rui = [1,m-1]
for i in range(2,n+1):
fact.append((fact[-1] * ... | p02685 |
# -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
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, product, permutati... | # -*- coding: utf-8 -*-
import sys
# sys.setrecursionlimit(10**6)
buff_readline = sys.stdin.buffer.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().split()))
def read_float():
retu... | p02685 |
def power_func(a,n,p):
bi=str(format(n,"b"))#2進表現に
res=1
for i in range(len(bi)):
res=(res*res) %p
if bi[i]=="1":
res=(res*a) %p
return res
n,m,k=list(map(int,input().split()))
w=998244353
t=0
c=1
b=m*((m-1)**(n-1))%w
for i in range(k+1):
t += c * b
t %= w
c*=(n-1-i)
... | def power_func(a,n,p):
bi=str(format(n,"b"))#2進表現に
res=1
for i in range(len(bi)):
res=(res*res) %p
if bi[i]=="1":
res=(res*a) %p
return res
n,m,k=list(map(int,input().split()))
w=998244353
t=0
c=1
b=m*((m-1)**(n-1))%w
g=power_func(m-1,w-2,w)
for i in range(k+1):
t += c * b
... | p02685 |
#!/usr/bin/env python3
import sys
sys.setrecursionlimit(10 ** 8)
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
N, M, K = list(map(int, readline().split()))
MOD = 998244353
def solve():
m1pows = [1 for i in range(K + 1)]
m1pows[0] = M * pow... | #!/usr/bin/env python3
import sys
sys.setrecursionlimit(10 ** 8)
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
N, M, K = list(map(int, readline().split()))
MOD = 998244353
def solve():
m1pows = [1 for i in range(K + 1)]
m1pows[0] = M * pow... | p02685 |
N, M, K = list(map(int, input().split()))
fac = [0] * (N + 1)
fac[0] = 1
for i in range(N):
fac[i + 1] = fac[i] * (i + 1) % 998244353
def mcomb(n, k):
if n == 0 and k == 0:
return 1
if n < k or k < 0:
return 0
return fac[n] * pow(fac[n - k], 998244351, 998244353) * pow(fac[... | def main():
N, M, K = list(map(int, input().split()))
fac = [0] * (N + 1)
fac[0] = 1
for i in range(N):
fac[i + 1] = fac[i] * (i + 1) % 998244353
def mcomb(n, k):
if n == 0 and k == 0:
return 1
if n < k or k < 0:
return 0
return ... | p02685 |
def main():
from builtins import pow
N, M, K = list(map(int, input().split()))
fac = [0] * N
fac[0] = 1
for i in range(N - 1):
fac[i + 1] = fac[i] * (i + 1) % 998244353
def mcomb(n, k):
if n == 0 and k == 0:
return 1
if n < k or k < 0:
... | N, M, K = list(map(int, input().split()))
result = 0
n = 1
k = 1
for i in range(K + 1):
result += n * pow(k, 998244353 - 2, 998244353) * pow(M - 1, N - 1 - i, 998244353)
result %= 998244353
n *= N - 1 - i
n %= 998244353
k *= i + 1
k %= 998244353
result *= M
result %= 998244353
pri... | p02685 |
MOD = 998244353
N,M,K = list(map(int,input().split()))
ans = 0
NCi = 1#nからi選ぶ組み合わせ
for i in range(0,K+1,1):
ans = (ans + M * pow(M-1,N-1-i,MOD)*NCi)%MOD
NCi = NCi*(N-1-i)*pow((i+1),MOD-2,MOD)
print(ans) | MOD = 998244353
N,M,K = list(map(int,input().split()))
ans = 0
NCi = 1#nからi選ぶ組み合わせ
for i in range(0,K+1,1):
ans = (ans + M * pow(M-1,N-1-i,MOD)*NCi)%MOD
NCi = (NCi*(N-1-i) * pow((i+1),MOD-2,MOD))%MOD
print(ans) | p02685 |
class Combination: # 計算量は O(n_max + log(mod))
def __init__(self, n_max, mod=10**9+7):
self.mod = mod
f = 1
self.fac = fac = [f]
for i in range(1, n_max+1): # 階乗(= n_max !)の逆元を生成
f = f * i % mod ... | class Combination: # 計算量は O(n_max + log(mod))
def __init__(self, n_max, mod=10**9+7):
self.mod = mod
f = 1
self.fac = fac = [f]
for i in range(1, n_max+1): # 階乗(= n_max !)の逆元を生成
f = f * i % mod ... | p02685 |
def COMinit():
fac[0] = fac[1] = 1
finv[0] = finv[1] = 1
inv[1] = 1
for i in range(2,max):
fac[i] = fac[i-1]*i%mod
inv[i] = mod - inv[mod%i]*(mod//i)%mod
finv[i] = finv[i-1]*inv[i]%mod
def COM(n,k):
if n < k:
return 0
if n < 0 or k < 0:
retur... | def COMinit():
fac[0] = fac[1] = 1
finv[0] = finv[1] = 1
inv[1] = 1
for i in range(2,max):
fac[i] = fac[i-1]*i%mod
inv[i] = mod - inv[mod%i]*(mod//i)%mod
finv[i] = finv[i-1]*inv[i]%mod
def COM(n,k):
if n < k:
return 0
if n < 0 or k < 0:
retur... | p02685 |
def COMinit():
fac[0] = fac[1] = 1
finv[0] = finv[1] = 1
inv[1] = 1
for i in range(2,max):
fac[i] = fac[i-1]*i%mod
inv[i] = mod - inv[mod%i]*(mod//i)%mod
finv[i] = finv[i-1]*inv[i]%mod
def COM(n,k):
if n < k:
return 0
if n < 0 or k < 0:
retur... | def COMinit():
fac[0] = fac[1] = 1
finv[0] = finv[1] = 1
inv[1] = 1
for i in range(2,max):
fac[i] = fac[i-1]*i%mod
inv[i] = mod - inv[mod%i]*(mod//i)%mod
finv[i] = finv[i-1]*inv[i]%mod
def COM(n,k):
if n < k:
return 0
if n < 0 or k < 0:
retur... | p02685 |
import sys
readline = sys.stdin.buffer.readline
def even(n): return 1 if n%2==0 else 0
n,m,k = list(map(int,readline().split()))
mod = 998244353
if m == 1:
if k < n-1:
print((0))
else:
print((1))
exit()
def pow(n,p,mod=mod): #繰り返し二乗法(nのp乗)
res = 1
while p > 0:
... | #ABC167-E Colorful Blocks
"""
隣り合うブロックの組の個数がi個(i=0~k)であるときの組み合わせ数を求めていく。
まず、k=0の時を考えると、m=4の時、
res = 4*3**(n-1)となることがわかる。
次に、k>0のときは、
どれか2つのブロックを1つにつなぎ合わせると考えて、
res = 4*3**(n-1-i)
これに合わせて、どのブロックが接続するのかを考える必要があり、
どのブロックも右隣のブロックにのみ接続できると考えた場合、
接続できるブロックの個数はn-1個(一番右のブロックは接続先がない)
そこからi個選んで右のブロックにつなぐので、
n-1Ciとなる。... | p02685 |
N, M, K = list(map(int, input().split()))
mod = 998244353
facs = [1]
nfac = 1
for i in range(1, N):
nfac = nfac * i %mod
facs.append(nfac)
s = 0
for i in range(0, K+1):
patterns = facs[N-1] * pow(facs[i], mod-2, mod) * pow(facs[N-1-i], mod-2, mod) % mod
d = patterns * M * pow(M-1, ... | N, M, K = list(map(int, input().split()))
mod = 998244353
facs = [1] * (N + 1)
nfac = 1
for i in range(1, N):
nfac = nfac * i %mod
facs[i] = nfac
s = 0
for i in range(0, K+1):
patterns = facs[N-1] * pow(facs[i], mod-2, mod) * pow(facs[N-1-i], mod-2, mod) % mod
d = patterns * M * pow(M-1, N... | p02685 |
#!/usr/bin/env python
def main():
n, m, k = list(map(int, input().split()))
div = 998244353
ret = 0
comb = 1
x = m * ((m-1) ** (n-k-1))
comb_list = [0] * (k+1)
x_list = [0] * (k+1)
comb_list[0] = comb
x_list[0] = x
for i in range(1, k+1):
comb = comb * (n-... | #!/usr/bin/env python
def modpow(x, y, mod):
ret = 1
z = x
n = len(bin(y)) - 2
for i in range(n):
if ((y >> i) & 1):
ret = ret * z % mod
z = z * z % mod
return ret
def modinv(x, mod):
return modpow(x, mod-2, mod)
def main():
n, m, k = list(map(int... | p02685 |
import sys
sys.setrecursionlimit(10**6) #再帰関数の上限
import math
from copy import copy, deepcopy
from operator import itemgetter
from bisect import bisect_left, bisect, bisect_right#2分探索
#bisect_left(l,x), bisect(l,x)#aはソート済みである必要あり。aの中からx未満の要素数を返す。rightだと以下
from collections import deque
#deque(l), pop(), append(x... | import sys
sys.setrecursionlimit(10**6) #再帰関数の上限
import math
from copy import copy, deepcopy
from operator import itemgetter
from bisect import bisect_left, bisect, bisect_right#2分探索
#bisect_left(l,x), bisect(l,x)#aはソート済みである必要あり。aの中からx未満の要素数を返す。rightだと以下
from collections import deque
#deque(l), pop(), append(x... | p02685 |
n, m, k = list(map(int, input().split()))
MOD = 998244353
def power(n, k, mod):
if k == 0:
return 1
elif k % 2 == 1:
return (n * power(n, k - 1, mod)) % mod
else:
return power((n ** 2) % mod, k // 2, mod)
lp = [1] # (m - 1) ** i
p = 1
for i in range(n - 1):
p... | n, m, k = list(map(int, input().split()))
MOD = 998244353
class Combination:
def __init__(self, n, mod):
self.n = n
self.mod = mod
self.f = self._get_f()
self.fi = self._get_fi()
def __call__(self, k):
if not 0 <= k <= self.n:
return 0
... | p02685 |
N, M, K = list(map(int, input().split()))
MOD = 998244353
CONV = [1]
ans = 0
for i in range(1, N):
CONV.append(CONV[-1] * (N-i) // i)
for k in range(K+1):
# M x (N-1)Ck x (M-1) ^ (N - 1 - k)
ans += (CONV[k] * pow(M-1, N-1-k, MOD)) % MOD
print((ans * M % MOD)) | N, M, K = list(map(int, input().split()))
MOD = 998244353
ans = 0
class combination():
def __init__(self, n):
self.fact = [1] * (n+1)
self.ifact = [1] * (n+1)
for i in range(1, n+1):
self.fact[i] = self.fact[i-1]*i % MOD
self.ifact[n] = pow(self.fact[n], MOD-... | p02685 |
n,m,k=list(map(int,open(0).read().split()))
mod=998244353
c=[1]*(k+1)
for i in range(1,k+1):
c[i]=c[i-1]*(n-i)//i
ans=0
for i in range(k+1):
ans+=m*pow(m-1,n-1-i,mod)*(c[i]%mod)
ans%=mod
print(ans) | n,m,k=list(map(int,open(0).read().split()))
p=998244353
'''
c=[1]*(k+1)
for i in range(1,k+1):
c[i]=c[i-1]*(n-i)//i
c[i-1]%=mod
'''
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 = 998244353
N = n # N は必要分だけ用意... | p02685 |
import sys
input=sys.stdin.buffer.readline
#sys.setrecursionlimit(10**9)
#from functools import lru_cache
def RD(): return sys.stdin.read()
def II(): return int(eval(input()))
def MI(): return list(map(int,input().split()))
def MF(): return list(map(float,input().split()))
def LI(): retu... | import sys
input=sys.stdin.buffer.readline
#sys.setrecursionlimit(10**9)
#from functools import lru_cache
def RD(): return sys.stdin.read()
def II(): return int(eval(input()))
def MI(): return list(map(int,input().split()))
def MF(): return list(map(float,input().split()))
def LI(): retu... | p02685 |
mod = 998244353
N, M, K = list(map(int, input().split()))
power_cache = {}
power_cache[(M-1, 0)] = 1
for i in range(N-1):
power_cache[(M-1, i+1)] = (power_cache[(M-1, i)]*(M-1)) % mod
def power(x, y):
return power_cache[(x, y)]
combination_cache = {}
combination_cache[(N-1, 0)] = 1
for i... | mod = 998244353
N, M, K = list(map(int, input().split()))
invs = {}
def inv(n):
if n not in invs:
invs[n] = pow(n, mod-2, mod)
return invs[n]
powers = {(M-1, N-1): pow(M-1, N-1, mod)}
def power(x, y):
if y == 0:
return 1
if (x, y) not in powers:
po... | p02685 |
MOD = 998244353
class ModInt:
def __init__(self, x):
self.x = x % 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 + o... | import sys
MOD = 998244353
class ModInt:
def __init__(self, x):
self.x = x % 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
Mod... | p02685 |
n,m,k = list(map(int, input().split()))
# ---------------------------------------
# nCr(n, r, m) テンプレ
mod = 998244353
fac = [1,1] # 階乗 n!
inv = [0,1] # 逆元 1/n
finv = [1,1] # 逆元の階乗 (n^-1)! = (1/n)!
for i in range(2, n+1):
fac.append( (fac[-1] * i ) % mod )
inv.append( (-inv[mod%i] * (mod//i)) % mo... | n,m,k = list(map(int, input().split()))
# ---------------------------------------
# nCr(n, r, m) テンプレ
mod = 998244353
fac = [1,1] # 階乗 n!
inv = [0,1] # 逆元 1/n
finv = [1,1] # 逆元の階乗 (n^-1)! = (1/n)!
for i in range(2, n+1):
fac.append( (fac[-1] * i ) % mod )
inv.append( (-inv[mod%i] * (mod//i)) % mo... | p02685 |
n, m, k = list(map(int, input().split()))
mod = 998244353
N = 10**6 # N!まで求める
fact = [1, 1] # 階乗の元テーブル
fact_inv = [1, 1] # 階乗の逆元テーブル
inv = [0, 1] # 逆元テーブル計算用テーブル 1,2,,...の逆元を求めてる
# 計算 O(1)
def comb(n, r, mod):
if (r<0 or r>n):
return 0
r = min(r, n-r)
return fact[n] * fact_inv[r]... | n, m, k = list(map(int, input().split()))
mod = 998244353
N = 10**5 * 2 # N!まで求める
fact = [1, 1] # 階乗の元テーブル
fact_inv = [1, 1] # 階乗の逆元テーブル
inv = [0, 1] # 逆元テーブル計算用テーブル 1,2,,...の逆元を求めてる
# 計算 O(1)
def comb(n, r, mod):
if (r<0 or r>n):
return 0
r = min(r, n-r)
return fact[n] * fact_in... | p02685 |
import sys
from io import StringIO
import unittest
import os
# 再帰処理上限(dfs作成時に設定するのが面倒なので限度近い値を組み込む)
sys.setrecursionlimit(999999999)
def prepare(n, mod=998244353):
f = 1
factorials = [1]
for m in range(1, n + 1):
f *= m
f %= mod
factorials.append(f)
inv = pow(f... | import sys
from io import StringIO
import unittest
import os
# 再帰処理上限(dfs作成時に設定するのが面倒なので限度近い値を組み込む)
sys.setrecursionlimit(999999999)
class youk_prepare:
def __init__(self, n, mod=pow(10, 9) + 7):
"""
コンストラクタ
:n個の物に対する組み合わせを求める(200万くらいなら十分動く。1億とかは無理。)
:余り mod
... | p02685 |
mod = 998244353
class mod_combination:
def __init__(self, N):
self.fac = [1] * (N + 1)
for i in range(1, N + 1):
self.fac[i] = (self.fac[i - 1] * i) % mod
self.invmod = [1] * (N + 1)
self.invmod[N] = pow(self.fac[N], mod - 2, mod)
for i in range(N, 0, -1... | mod = 998244353
class mod_combination:
def __init__(self, N):
self.fac = [1] * (N + 1)
for i in range(1, N + 1):
self.fac[i] = (self.fac[i - 1] * i) % mod
self.invmod = [1] * (N + 1)
self.invmod[N] = pow(self.fac[N], mod - 2, mod)
for i in range(N, 0, -1... | p02685 |
import sys
sys.setrecursionlimit(10 ** 7)
read = sys.stdin.buffer.read
inp = sys.stdin.buffer.readline
def resolve():
# nCk = n! / n!(n-k)! のテーブル作成
def COMinit(n, MOD):
fact = [1, 1]
fact_inv = [1, 1]
inv = [0, 1]
for i in range(2, n + 1):
fact.append((f... |
def resolve():
# nCk = n! / n!(n-k)! のテーブル作成
def COMinit(n, MOD):
fact = [1, 1]
fact_inv = [1, 1]
inv = [0, 1]
for i in range(2, n + 1):
fact.append((fact[-1] * i) % MOD)
inv.append((-inv[MOD % i] * (MOD // i)) % MOD)
fact_inv.append... | p02685 |
import sys
input = sys.stdin.readline
mod = 998244353
n, m, k = [int(x) for x in input().split()]
def make_tables(n, mod = 998244353):
fac = [1, 1] # 階乗テーブル
finv = [1, 1] #逆元の階乗テーブル
inv = [0, 1] #逆元テーブル
for i in range(2, n + 1):
fac.append((fac[-1] * i) % mod)
inv.appen... | import sys
input = sys.stdin.readline
mod = 998244353
n, m, k = [int(x) for x in input().split()]
def make_tables(n, mod = 998244353):
fac = [1, 1] # 階乗テーブル
finv = [1, 1] #逆元の階乗テーブル
inv = [0, 1] #逆元テーブル
for i in range(2, n + 1):
fac.append((fac[-1] * i) % mod)
inv.appen... | p02685 |
import math
N ,M, K = list(map(int,input().split()))
MOD = 998244353
SUM = 0
def getInvs(n, MOD):
invs = [1] * (n+1)
for x in range(2, n+1):
invs[x] = (-(MOD//x) * invs[MOD%x]) % MOD
return invs
invs = getInvs(K+3, MOD)
POW = [1]
for i in range(1,N):
a = (POW[-1] * (M-1))%MOD
... | import math
N ,M, K = list(map(int,input().split()))
MOD = 998244353
def getInvs(n, MOD):
invs = [1] * (n+1)
for x in range(2, n+1):
invs[x] = (-(MOD//x) * invs[MOD%x]) % MOD
return invs
invs = getInvs(N+3, MOD)
num = M
nums = []
for i in reversed(list(range(1,N))):
nums.append... | p02685 |
# -*- coding: utf-8 -*-
import sys
N,M,K=list(map(int, sys.stdin.readline().split()))
mod=998244353
fact, inv_fact=[1], [1]
fact_tmp=1
for i in range(1, N+1):
fact_tmp*=i
fact_tmp%=mod
fact.append(fact_tmp)
inv_fact.append(pow(fact_tmp, mod-2, mod))
def ncr(n,r):
if n<0 or r<0 or n<r: r... | import sys
N,M,K=list(map(int, sys.stdin.readline().split()))
mod=998244353
fact, inv_fact=[1], [1]
fact_tmp=1
for i in range(1, N+1):
fact_tmp*=i
fact_tmp%=mod
fact.append(fact_tmp)
inv_fact.append(pow(fact_tmp, mod-2, mod))
def ncr(n,r):
if n<0 or r<0 or n<r: return 0
else: return ... | p02685 |
#import numpy as np
import sys, math
from itertools import permutations, combinations
from collections import defaultdict, Counter, deque
from math import factorial#, gcd
from bisect import bisect_left #bisect_left(list, value)
sys.setrecursionlimit(10**7)
enu = enumerate
MOD = 998244353
def input(): return sy... | #import numpy as np
import sys, math
from itertools import permutations, combinations
from collections import defaultdict, Counter, deque
from math import factorial#, gcd
from bisect import bisect_left #bisect_left(list, value)
sys.setrecursionlimit(10**7)
enu = enumerate
MOD = 998244353
def input(): return sy... | p02685 |
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
fac = [1, 1] # 元テーブル
f_inv = [1, 1] # 逆元テーブル
inv = [0, 1] # 逆元テーブル計算用テーブル
def prepare(n, mod):
for i in range(2, n+1):
fac.append((fac[-1] * i) % mod)
inv.append((-inv[mod % i] * (m... | import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
# 0^0 = 1
def main():
N,M,K = list(map(int, readline().split()))
MOD = 998244353
if M == 1:
if K == N - 1:
print((1))
else:
print((0))
exit()
... | p02685 |
def main():
N,M,K = list(map(int,input().split()))
MOD = 998244353
if M == 1:
if K == N-1:
print((1))
else:
print((0))
exit()
fac = [0]*(N+1)
fac[0],fac[1] = 1,1
for i in range(2,N+1):
fac[i] = (fac[i-1]*i)%MOD... | def main():
N,M,K = list(map(int,input().split()))
MOD = 998244353
if M == 1:
if K == N-1:
print((1))
else:
print((0))
exit()
fac = [0]*(N+1)
fac[0],fac[1] = 1,1
for i in range(2,N+1):
fac[i] = (fac[i-1]*i)%MOD... | p02685 |
n,m,k = list(map(int,input().split()))
mod = 998244353
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]*(n+1)
finv = [0]*(n+1)
fac[0] = finv[0] = 1
for i in range(1,n+1):
fac[i] = fac[i-1]*i%mod
finv[i] = pow(fac[i],mod-2,mod)... | n,m,k = list(map(int,input().split()))
mod = 998244353
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 = [1]*(n+1)
finv = [1]*(n+1)
for i in range(1,n+1):
fac[i] = fac[i-1]*i%mod
finv[i] = pow(fac[i],mod-2,mod)
p = [1]*(n+1)
for... | p02685 |
MOD = 998244353
MAX = int(2e5 + 5)
fact = [0] * MAX
invFact = [0] * MAX
def bigmod(a, b):
if b == 0:
return 1
ret = bigmod(a, b // 2)
ret = (ret * ret) % MOD
if b % 2 == 1:
ret = (ret * a) % MOD
return ret
def mod_inverse(a):
return bigmod(a, MOD - 2)
def pre():
global fact, invF... | MOD = 998244353
MAX = int(2e5 + 5)
fact = [0] * MAX
invFact = [0] * MAX
def bigmod(a, b):
if b == 0:
return 1
ret = bigmod(a, b // 2)
ret = (ret * ret) % MOD
if b % 2 == 1:
ret = (ret * a) % MOD
return ret
def mod_inverse(a):
return bigmod(a, MOD - 2)
def pre():
global fact, invF... | p02685 |
MOD = 998244353
MAX = int(2e5 + 5)
fact = [0] * MAX
invFact = [0] * MAX
def bigmod(a, b):
if b == 0:
return 1
ret = bigmod(a, b // 2)
ret = (ret * ret) % MOD
if b % 2 == 1:
ret = (ret * a) % MOD
return ret
def mod_inverse(a):
return bigmod(a, MOD - 2)
def pre():
global fact, invF... | MOD = 998244353
MAX = int(2e5 + 5)
fact = [0] * MAX
invFact = [0] * MAX
def mod_inverse(a):
return pow(a, MOD - 2, MOD)
def pre():
global fact, invFact
fact[0] = 1
for i in range(1, MAX):
fact[i] = (fact[i - 1] * i) % MOD
invFact[MAX - 1] = mod_inverse(fact[MAX - 1])
for i in range(MAX - 2... | p02685 |
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)
class Combination:
def __init__(self, N):
self.fac = [1] * (N + 1)
for i in range(1, N + 1):
self.fac[i] = (self.fac[i - 1] * i)... | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)
class Combination:
def __init__(self, n_max, mod=10**9+7):
# O(n_max + log(mod))
self.mod = mod
f = 1
self.fac = fac = [f]
... | p02685 |
class Facts:
def __init__(self, mod=10**9+7, n_max=1):
self.mod = mod
self.n_max = n_max
self.fact = [1, 1]
self.inv = [0, 1]
self.factinv = [1, 1]
if 1 < n_max:
setup_table(n_max)
def cmb(self, n, r):
if r < 0 or n < r:
return 0
if self.... | class Facts:
def __init__(self, mod=10**9+7, n_max=1):
self.mod = mod
self.n_max = n_max
self.fact = [1, 1]
self.inv = [0, 1]
self.factinv = [1, 1]
if 1 < n_max:
self.setup_table(n_max)
def cmb(self, n, r):
if r < 0 or n < r:
return 0
if self.... | p02685 |
N,M,K = list(map(int,input().split()))
m = 998244353
ans = (M*pow(M-1,N-1,m))%m
alpha = 1
for k in range(1,K+1):
alpha = alpha*(N-k)//(k)
ans = (ans + M*alpha*pow(M-1,N-k-1,m))%m
print(ans)
| N,M,K = list(map(int,input().split()))
m = 998244353
ans = (M*pow(M-1,N-1,m))%m
alpha = 1
for k in range(1,K+1):
alpha = (alpha*(N-k)*pow(k,m-2,m))%m
ans = (ans + M*alpha*pow(M-1,N-k-1,m))%m
print(ans)
| p02685 |
n, m, k = list(map(int, input().split()))
mod = 998244353
N = 10 ** 6
#逆元テーブル
inv_t = [0]+[1]
for i in range(2, N):
inv_t += [inv_t[mod % i] * (mod - int(mod / i)) % mod]
#階乗計算
kai = [1, 1]
rev_kai = [1, inv_t[1]]
for i in range(2, N):
kai.append(kai[-1] * i % mod)
rev_kai.append(rev_kai[-1] * inv... | n, m, k = list(map(int, input().split()))
mod = 998244353
N = 10 ** 6
#逆元テーブル
inv_t = [0]+[1]
for i in range(2, N):
inv_t += [inv_t[mod % i] * (mod - int(mod / i)) % mod]
#階乗計算
kai = [1, 1]
rev_kai = [1, inv_t[1]]
for i in range(2, N):
kai.append(kai[-1] * i % mod)
rev_kai.append(rev_kai[-1] * inv... | p02685 |
from collections import defaultdict
N,M,K=list(map(int,input().split()))
MOD=998244353
def comb(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
g1 = [1, 1] # 元テーブル
g2 = [1, 1] #逆元テーブル
inverse = [0, 1] #逆元テーブル計算用テーブル
for i in range( 2, N ... | from collections import defaultdict
N,M,K=list(map(int,input().split()))
MOD=998244353
def comb(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
#https://algo-logic.info/combination/
g1 = [1, 1] # 元テーブル
g2 = [1, 1] #逆元テーブル
inverse = [0, 1] ... | p02685 |
M=998244353
class Factorial:
def __init__(self,n):
self.f=f=[0]*(n+1)
f[0]=b=1
for i in range(1,n+1):f[i]=b=b*i%M
self.inv=inv=[0]*(n+1)
inv[n]=b=pow(self.f[n],-1,M)
for i in range(n,0,-1):inv[i-1]=b=b*i%M
def factorial(self,i):
return self.f[i]
... | M=998244353
class Factorial:
def __init__(self,n):
self.f=f=[0]*(n+1)
f[0]=b=1
for i in range(1,n+1):f[i]=b=b*i%M
self.inv=inv=[0]*(n+1)
inv[n]=b=pow(self.f[n],M-2,M)
for i in range(n,0,-1):inv[i-1]=b=b*i%M
def factorial(self,i):
return self.f[i]... | p02685 |
R=range
M=998244353
n,m,k=list(map(int,input().split()))
f=1
for i in R(n):f*=i+1
r=[pow(f,M-2,M)]
for i in R(n):r+=r[i]*(n-i)%M,
print((sum(f//n*m*r[i-n]*r[~i]*pow(m-1,~i+n,M)for i in R(k+1))%M)) | R=range
M=998244353
n,m,k=list(map(int,input().split()))
f=1
for i in R(n-1):f=f*-~i%M
r=[pow(f*n,-1,M)]
for i in R(n):r+=r[i]*(n-i)%M,
print((sum(m*f*r[i-n]*r[~i]*pow(m-1,~i+n,M)for i in R(k+1))%M)) | p02685 |
import sys
l = sys.stdin.readline().strip()
N, M, K = list(map(int, l.split()))
comb_quick = {}
mod = 998244353
C = [1]
for i in range(1, (N-1) // 2 + 2):
next = C[-1] * (N-i) // i
C.append(next)
res = 0
exp_quick = [1]
for i in range(N):
exp_quick.append(exp_quick[-1] * (M-1) % mod)
for ... | import sys
l = sys.stdin.readline().strip()
N, M, K = list(map(int, l.split()))
comb_quick = {}
mod = 998244353
C = [1]
for i in range(1, (N-1) // 2 + 2):
next = C[-1] * (N-i) * pow(i, mod-2, mod)
C.append(next % mod)
res = 0
for x in range(K+1):
crt = (pow(M-1, N-x-1, mod) * M) % mod
... | p02685 |
import math
# class Comb:
# m_vals = []
# _mod = 998244353
#
# def __init__(self, n: int, r: int):
# m_ls = [(0, 1)] * (r + 1)
# for i in range(1, r):
# x = (m_ls[i - 1][0] * self._mod + m_ls[i - 1][1]) * (n - r / r)
# if x >= self._mod:
# ... | import math
# class Comb:
# m_vals = []
# _mod = 998244353
#
# def __init__(self, n: int, r: int):
# m_ls = [(0, 1)] * (r + 1)
# for i in range(1, r):
# x = (m_ls[i - 1][0] * self._mod + m_ls[i - 1][1]) * (n - r / r)
# if x >= self._mod:
# ... | p02685 |
X = 998244353
N, M, K = list(map(int, input().split()))
def calc_inverse(n, law):
if n == 1:
return 1
pre_r = law
pre_x = 0
pre_y = 1
cur_r = n
cur_x = 1
cur_y = 0
while True:
d = pre_r // cur_r
r = pre_r % cur_r
nxt_r = r
nxt_x = pre_x - d * cur_x
nxt_y = pre_y - d * c... | X = 998244353
N, M, K = list(map(int, input().split()))
def calc_inverse(n, law):
if n == 1:
return 1
pre_r = law
pre_x = 0
pre_y = 1
cur_r = n
cur_x = 1
cur_y = 0
while True:
d = pre_r // cur_r
r = pre_r % cur_r
nxt_r = r
nxt_x = pre_x - d * cur_x
nxt_y = pre_y - d * c... | p02685 |
#ライブラリの点検
class Data():
def __init__(self):
self.power=1
self.rev=1
class Combi():
def __init__(self,N,mod):
self.lists=[Data() for _ in range(N+1)]
self.mod=mod
for i in range(2,N+1):
self.lists[i].power=((self.lists[i-1].power)*i)%self.mod
... | # ライブラリ改変テスト
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-... | p02685 |
class Factorial():
def __init__(self, mod=10**9 + 7):
self.mod = mod
self._factorial = [1]
self._size = 1
self._factorial_inv = [1]
self._size_inv = 1
def __call__(self, n):
return self.fact(n)
def fact(self, n):
''' n! % mod '''
... | class Factorial():
def __init__(self, mod=10**9 + 7):
self.mod = mod
self._factorial = [1]
self._size = 1
self._factorial_inv = [1]
self._size_inv = 1
def __call__(self, n):
return self.fact(n)
def fact(self, n):
''' n! % mod '''
... | p02685 |
class Factorial():
def __init__(self, mod=10**9 + 7):
self.mod = mod
self._factorial = [1]
self._size = 1
self._factorial_inv = [1]
self._size_inv = 1
def __call__(self, n):
return self.fact(n)
def fact(self, n):
''' n! % mod '''
... | class Factorial():
def __init__(self, mod=10**9 + 7):
self.mod = mod
self._factorial = [1]
self._size = 1
self._factorial_inv = [1]
self._size_inv = 1
def __call__(self, n):
return self.fact(n)
def fact(self, n):
''' n! % mod '''
... | p02685 |
MOD = 998244353
n, m, k = list(map(int, input().split()))
fact = [0]*(n+1)
fact[0] = 1
for i in range(1, n+1):
fact[i] = fact[i-1]*i % MOD
invfact = [0]*(n+1)
for i in range(n+1):
invfact[i] = pow(fact[i], MOD-2, MOD)
def nCk(n, k):
return fact[n]*invfact[k]*invfact[n-k]
ans = 0
for ... | MOD = 998244353
n, m, k = list(map(int, input().split()))
fact = [0]*(n+1)
fact[0] = 1
for i in range(1, n+1):
fact[i] = fact[i-1]*i % MOD
invfact = [0]*(n+1)
invfact[n] = pow(fact[n], MOD-2, MOD)
for i in reversed(list(range(n))):
invfact[i] = invfact[i+1]*(i+1) % MOD
def nCk(n, k):
retu... | p02685 |
N, M, K = list(map(int, input().split()))
mod = 998244353
ans = 0
class Combination:
def __init__(self, n):
self.facts = [1 for i in range(N+1)]
self.invs = [1 for i in range(N+1)]
for i in range(1, N+1):
self.facts[i] = self.facts[i-1] * i % mod
... | N, M, K = list(map(int, input().split()))
mod = 998244353
ans = 0
class Combination:
def __init__(self, n):
self.facts = [1 for i in range(N+1)]
self.invs = [1 for i in range(N+1)]
for i in range(1, N+1):
self.facts[i] = self.facts[i-1] * i % mod
... | p02685 |
def main():
N, M, K = list(map(int, input().split()))
mod = 998244353
r = 0
m = 1
for i in range(K + 1):
if i > 0:
m = m * (N - i) // i
r += M * pow(M - 1, N - i - 1, mod) * m
return r % mod
print((main()))
| def main():
N, M, K = list(map(int, input().split()))
mod = 998244353
r = 0
m = 1
inv = [0] * (N + 1)
inv[1] = 1
for i in range(2, N + 1):
inv[i] = inv[mod % i] * ((mod - mod // i) % mod)
for i in range(K + 1):
if i > 0:
m = (m * (N - i) * inv[i]) %... | p02685 |
N,M,K=list(map(int,input().split()))
mod=998244353
comb=1
pw=(M*pow(M-1,N-1,mod))%mod
ans=pw*comb
invmodk=[0]*(K+2)
invmodk[1]=1
invmodm=pow(M-1,mod-2,mod)
for k in range(2,K+1):
invmodk[k]=invmodk[mod%k]*(mod-mod//k)%mod
for k in range(1,K+1):
pw=(pw*invmodm)%mod
comb*=(N-k)*invmodk[k]
... | N,M,K=list(map(int,input().split()))
mod=998244353
com=1
ans=0
for i in range(K+1):
ans+=M*com*pow(M-1,N-1-i,mod)
ans%=mod
com*=(N-1-i)*pow(i+1,mod-2,mod)
com%=mod
print(ans) | p02685 |
def cmb(n, r, p):
return (fac[n] * pow(fac[r], p - 2, p) * pow(fac[n - r], p - 2, p)) % p
p = 998244353
N, M, K = list(map(int, input().split()))
fac = [1] * (N + 1)
for i in range(1, N + 1):
fac[i] = (fac[i - 1] * i) % p
ans = 0
for k in range(K + 1):
ans += M * pow(M - 1, N - k - 1, p) * cm... | p = 998244353
N, M, K = list(map(int, input().split()))
ans = 0
cmb = 1
for k in range(K + 1):
ans += M * pow(M - 1, N - k - 1, p) * cmb
ans %= p
cmb *= (N - 1 - k) * pow(k + 1, p - 2, p)
cmb %= p
print(ans)
| p02685 |
p = 998244353
N, M, K = list(map(int, input().split()))
ans = 0
cmb = 1
for k in range(K + 1):
ans += M * pow(M - 1, N - k - 1, p) * cmb
ans %= p
cmb *= (N - 1 - k) * pow(k + 1, p - 2, p)
cmb %= p
print(ans)
| N, M, K = list(map(int, input().split()))
MOD = 998244353
ans = 0
comb = 1
for k in range(K + 1):
ans += M * comb * pow(M - 1, N - k - 1, MOD)
ans %= MOD
comb *= (N - k - 1) * pow(k + 1, MOD - 2, MOD)
comb %= MOD
print(ans)
| p02685 |
n,m,k=list(map(int,input().split()))
mod=998244353
if m==1:print((0 if k!=n-1 else 1));exit()
fact=[1]*(n-1+1)
inv=[1]*(n-1+1)
for i in range(2,n-1+1):
fact[i]=i*fact[i-1]%mod
inv[-1]=pow(fact[-1],mod-2,mod)
for i in range(n-1,1,-1):
inv[i-1]=inv[i]*i%mod
ans=0
po=pow(m-1,n-1,mod)*m%mod
ue=fact[n-1]... | n,m,k=list(map(int,input().split()))
mod=998244353
if m==1:print((0 if k!=n-1 else 1));exit()
fact=[1]*(n-1+1)
inv=[1]*(n-1+1)
for i in range(2,n-1+1):
fact[i]=i*fact[i-1]%mod
inv[-1]=pow(fact[-1],mod-2,mod)
for i in range(n-1,1,-1):
inv[i-1]=inv[i]*i%mod
ans=0
po=pow(m-1,n-1,mod)*m%mod
ue=fact[n-1]... | p02685 |
#左からn個目でendが特定の色の場合に
N,M,K = list(map(int,input().split()))
def xgcd(a, b):
x0, y0, x1, y1 = 1, 0, 0, 1
while b != 0:
q, a, b = a // b, b, a % b
x0, x1 = x1, x0 - q * x1
y0, y1 = y1, y0 - q * y1
return a, x0, y0
def modinv(a, m):
g, x, y = xgcd(a, m)
if g != 1:
raise Exception('m... | #左からn個目でendが特定の色の場合に
N,M,K = list(map(int,input().split()))
def xgcd(a, b):
x0, y0, x1, y1 = 1, 0, 0, 1
while b != 0:
q, a, b = a // b, b, a % b
x0, x1 = x1, x0 - q * x1
y0, y1 = y1, y0 - q * y1
return a, x0, y0
def modinv(a, m):
g, x, y = xgcd(a, m)
if g != 1:
raise Exception('m... | p02685 |
from collections import deque
def main():
N,M,K=list(map(int,input().split()))
MOD=998244353
E=0
n_=1
for i in range(1,N):
n_=(n_*i)%MOD
nr_ = 1
nr_array=deque([])
for i in range(1,N-1):
nr_ = (nr_ * i) % MOD
nr_array.append(nr_)
r_=1
... | def main():
N,M,K=list(map(int,input().split()))
MOD=998244353
E=0
n_=1
for i in range(1,N):
n_=(n_*i)%MOD
nr_ = 1
nr_array=[]
for i in range(1,N-1):
nr_ = (nr_ * i) % MOD
nr_array.append(nr_)
m=1
Mk_array=[1]
for i in range(1,N):
... | p02685 |
from functools import lru_cache
MOD = 998244353
def solve_baka(n, m, k):
print(('params:', n, m, k))
ans = 0
for i in range(m**n):
s = ''
for j in range(n):
s = str(i % m) + s
i = i // m
cnt = 0
for j in range(n-1):
if s[j... | from functools import lru_cache
MOD = 998244353
def solve_baka(n, m, k):
print(('params:', n, m, k))
ans = 0
for i in range(m**n):
s = ''
for j in range(n):
s = str(i % m) + s
i = i // m
cnt = 0
for j in range(n-1):
if s[j... | p02685 |
MOD = 998244353
n, m, k = list(map(int, input().split()))
fact = [0]*(n+1)
fact[0] = 1
for i in range(1, n+1):
fact[i] = fact[i-1]*i % MOD
invfact = [0]*(n+1)
for i in range(n+1):
invfact[i] = pow(fact[i], MOD-2, MOD)
def nCk(n, k):
return fact[n]*invfact[k]*invfact[n-k]
ans = 0... | import sys
input = sys.stdin.readline
def comb(n, r):
return (fact[n] * revfact[n-r] * revfact[r]) % mod
mod = 998244353
N, M, K = list(map(int, input().split()))
fact = [1] * (N + 1)
for i in range(1, N + 1):
fact[i] = (fact[i-1] * i) % mod #n!を計算
# print('fact:{}'.format(fact))
revfact =... | p02685 |
import math,itertools,fractions,heapq,collections,bisect,sys,queue,copy
sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
dd=[(-1,0),(0,1),(1,0),(0,-1)]
ddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LF(): return [float(x) for... | import math,itertools,fractions,heapq,collections,bisect,sys,queue,copy
sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
dd=[(-1,0),(0,1),(1,0),(0,-1)]
ddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LF(): return [float(x) for... | p02685 |
import math,itertools,fractions,heapq,collections,bisect,sys,queue,copy
sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
dd=[(-1,0),(0,1),(1,0),(0,-1)]
ddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LF(): return [float(x) for... | import math,itertools,fractions,heapq,collections,bisect,sys,queue,copy
sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
dd=[(-1,0),(0,1),(1,0),(0,-1)]
ddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LF(): return [float(x) for... | p02685 |
import math,itertools,fractions,heapq,collections,bisect,sys,queue,copy
sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
dd=[(-1,0),(0,1),(1,0),(0,-1)]
ddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LF(): return [float(x) for... | import math,itertools,fractions,heapq,collections,bisect,sys,queue,copy
sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
dd=[(-1,0),(0,1),(1,0),(0,-1)]
ddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LF(): return [float(x) for... | p02685 |
n, m, k = list(map(int, input().split()))
MOD = 998244353
ans = 0
c = 1
for i in range(k + 1):
ans += (((m * pow(m - 1, n - i - 1, MOD)) % MOD) * c) % MOD
ans %= MOD
c = (c * (n - 1 - i) * pow(i + 1, MOD - 2, MOD)) % MOD
print((ans%MOD)) | def main():
n, m, k = list(map(int, input().split()))
MOD = 998244353
ans = 0
c = 1
for i in range(k + 1):
ans += (((m * pow(m - 1, n - i - 1, MOD)) % MOD) * c) % MOD
ans %= MOD
c = (c * (n - 1 - i) * pow(i + 1, MOD - 2, MOD)) % MOD
print((a... | p02685 |
from sys import stdin, setrecursionlimit
from math import factorial
setrecursionlimit(10 ** 9)
INF = 1 << 60
def input():
return stdin.readline().strip()
def main():
N, M, K = list(map(int, input().split()))
MOD = 998244353
fac = [0] * (N + 10)
finv = [0] * (N + 10)
inv = [0... | from sys import stdin, setrecursionlimit
from math import factorial
setrecursionlimit(10 ** 9)
INF = 1 << 60
def input():
return stdin.readline().strip()
def main():
N, M, K = list(map(int, input().split()))
MOD = 998244353
COM_MAX = N
fac, finv, inv = [0] * (COM_MAX + 1), [0] ... | p02685 |
n, m, k = list(map(int, input().split()))
MOD = 998244353
ans, N, K = 0, 1, 1
for i in range(k+1):
ans += N * pow(K, MOD-2, MOD) * pow(m-1, n-1-i, MOD)
ans %= MOD
N *= n-1-i
N %= MOD
K *= i+1
K %= MOD
ans *= m
ans %= MOD
print(ans) | def main():
## IMPORT MODULE
#import sys
#sys.setrecursionlimit(100000)
#input=lambda :sys.stdin.readline().rstrip()
#f_inf=float("inf")
MOD=998244353
if 'get_ipython' in globals():
## SAMPLE INPUT
n, m, k = 60522, 114575, 7559
else:
##INPUT
#n = input()
n, m... | p02685 |
# 二項係数のmod (大量のmod計算が必要なとき)
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=998244353
N = 10 ** 6 # 出力の制限
g1 = [1, 1] # 元テーブル
g2 = [1, 1] # 逆元テーブル
inverse = [0, 1] # 逆元テーブル計算用テーブル
for i in range(2, N + 1):
g1.append((... | # 二項係数のmod (大量のmod計算が必要なとき)
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=998244353
N = 10 ** 6 # 出力の制限
g1 = [1, 1] # 元テーブル
g2 = [1, 1] # 逆元テーブル
inverse = [0, 1] # 逆元テーブル計算用テーブル
for i in range(2, N + 1):
g1.append((... | p02685 |
#!/usr/bin/python3
# import bisect
# from collections import Counter, deque, OrderedDict, defaultdict
# from copy import copy, deepcopy # pythonのみ．copyは1次元，deepcopyは多次元．
# from decimal import Decimal, ROUND_HALF_UP, ROUND_HALF_EVEN
# from functools import reduce
# from heapq import heapify, heappop, heappush
# f... | #!/usr/bin/python3
# import bisect
# from collections import Counter, deque, OrderedDict, defaultdict
# from copy import copy, deepcopy # pythonのみ．copyは1次元，deepcopyは多次元．
# from decimal import Decimal, ROUND_HALF_UP, ROUND_HALF_EVEN
# from functools import reduce
# from heapq import heapify, heappop, heappush
# f... | p02685 |
n,m,k=list(map(int,input().split()))
mod=998244353
cntb=1
ans=0
for i in range(k+1):
# cntb*=(n-i)//i
ans+=(((m*pow(m-1,n-1-i,mod))%mod)*cntb)%mod
ans%=mod
cntb*=((n-1-i)*pow(i+1,mod-2,mod))%mod
print((ans%mod)) | n,m,k=list(map(int,input().split()))
mod=998244353
cntb=1
ans=0
for i in range(k+1):
ans=ans+(((m*pow(m-1,n-1-i,mod))%mod)*cntb)%mod
ans=ans%mod
cntb=(cntb*(n-1-i)*pow(i+1,mod-2,mod))%mod
print((ans%mod)) | p02685 |
n1 = int(eval(input()))
lista = list(map(int, input().split()))
cont = 0
for e in lista:
aux = e
while(aux%2 == 0):
aux /= 2
cont += 1
print(cont) | a = int(eval(input()))
lista = list(map(int, input().split()))
ans=0
for i in lista:
while i % 2==0:
i = i / 2
ans += 1
print(ans) | p03325 |
import math
n = int(eval(input()))
a = list(map(int,input().split()))
maxlog = int(math.log2(max(a)))
answer = 0
for _ in range(maxlog):
a = [aa/2 for aa in a if aa%2==0]
answer+= len(a)
if not a:
break
print(answer) | #!/usr/bin/env python3
import sys
def solve(N: int, a: "List[int]"):
answer = 0
for i in range(N):
while a[i]%2 == 0:
answer += 1
a[i] //= 2
print(answer)
return
def main():
def iterate_tokens():
for line in sys.stdin:
fo... | p03325 |
N = eval(input())
a = list(map(int,input().split()))
ans=0
for x in a:
if x%2!=0:
continue
for j in range(1,50):
if x%2**j!=0:
ans+=j-1
break
print(ans) | N = int(eval(input()))
a = list(map(int,input().split()))
ans = 0
for i in a :
if i%2 == 0:
for j in range(i):
if i%2 == 1:
break
i = i/2
ans += 1
print((int(ans))) | p03325 |
N=int(eval(input()))
a=list(map(int,input().split()))
c=0
for i in range(N):
while(a[i]%2==0):
a[i]=a[i]/2
c+=1
print(c) | n = int(eval(input()))
a = list(map(int,input().split()))
c = 0
for i in range(n):
while(a[i] % 2 == 0):
c += 1
a[i] //= 2
print(c) | p03325 |
import math
import collections
def f(n):
a = []
while n % 2 == 0:
a.append(2)
n //= 2
f = 3
while f * f <= n:
if n % f == 0:
a.append(f)
n = n//f
else:f += 2
if n != 1:
a.append(n)
return a
ans = 0
n = int(eval(in... | n = int(eval(input()))
ans = 0
for i in map(int,input().split()):
a = i
while a % 2 == 0:
ans += 1
a = a // 2
print(ans) | p03325 |
n = int(eval(input()))
ans = 0
for i in map(int,input().split()):
a = i
while a % 2 == 0:
ans += 1
a = a // 2
print(ans) | n = int(eval(input()))
ary = list(map(int,input().split()))
ans = 0
for i in range(len(ary)):
a = ary[i]
if a % 2 == 0:
while a % 2 == 0:
ans += 1
a = a // 2
print(ans) | p03325 |
def factorization(n):
arr = []
temp = n
for i in range(2, int(-(-n**0.5//1))+1):
if temp % i == 0:
cnt = 0
while temp % i == 0:
cnt += 1
temp //= i
arr.append([i, cnt])
if temp != 1:
arr.append([temp, 1])
... | def main():
n = int(eval(input()))
As = list(map(int, input().split()))
ans = 0
for i in range(n):
temp = As[i]
if temp % 2 == 0:
cnt = 0
while temp % 2 == 0:
cnt += 1
temp //= 2
ans += cnt
print(ans)... | p03325 |
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
# 素因数分解
def factorization(n):
arr = []
temp = n
for i in range(2, int(-(-n**0.5//1))+1):
if temp % i == 0:
cnt = 0
while temp % i == 0:
... | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
n, *a = list(map(int, read().split()))
ans = 0
for x in a:
while x % 2 == 0:
x = x // 2
ans += 1
print(ans) | p03325 |
n = int(eval(input()))
a = list(map(int, input().split()))
ans = 0
for i in a:
while i % 32 == 0:
i //= 32
ans += 5
while i % 2 == 0:
i //= 2
ans += 1
print(ans) | n = int(eval(input()))
a = list(map(int, input().split()))
ans = 0
for i in a:
while i % 2 == 0:
i //= 2
ans += 1
print(ans)
| p03325 |
n=int(eval(input()))
a=list(map(int,input().split()))
ans=0
for i in a:
while i%2==0:
i//=2
ans+=1
print(ans) | n=int(eval(input()))
a=list(map(int,input().split()))
ans=0
for i in a:
while i%2==0:
ans+=1
i//=2
print(ans) | p03325 |
#!/usr/bin/env python3
n, *a = list(map(int, open(0).read().split()))
c = 0
for i in a:
b = bin(i)
c += len(b) - 1 - b.rfind('1')
print(c)
| #!/usr/bin/env python3
print((sum(bin(i)[::-1].find("1") for i in [*list(map(int, open(0).read().split()))][1:])))
| p03325 |
def prime(n): # nまでの素数を列挙
import math
if n == 1:
return []
else:
num_list = [i + 1 for i in range(2,n,2)]
list_prime = [2]
limit = math.sqrt(n)
if n == 2:
return list_prime
else:
while True:
p = num_list[0]
... | n = int(eval(input()))
list_a = list((list(map(int, input().split()))))
factor2 = 0
for number in list_a:
while number % 2 == 0:
number /= 2
factor2 += 1
print(factor2)
| p03325 |
n = int(eval(input()))
a = list(map(int,input().split()))
ans = 1
for i in range(n):
ans *= a[i]
cnt = 0
while True:
if ans % 2 == 0:
ans //= 2
cnt += 1
else:
print(cnt)
break | n = int(eval(input()))
a = list(map(int,input().split()))
cnt = 0
for i in range(n):
now = a[i]
while True:
if now % 2 == 0:
now //= 2
cnt += 1
else:
break
print(cnt) | p03325 |
from collections import Counter
def prime_decomposition(n):
i=2
table=[]
while i*i <= n:
while n%i == 0:
n /= i
table.append(i)
i += 1
if n > 1:
table.append(n)
return table
n=int(eval(input()))
a=list(map(int,input().split()))
ans_table = []
for i in a:
ans_table.extend(prime_deco... | N=eval(input())
lst=list(map(int,input().split()))
ans=0
for i in lst:
while i%2 == 0:
i //= 2
ans += 1
print(ans) | p03325 |
from math import log2
N = int(eval(input()))
a = list(map(int, input().split()))
ans = 0
for i in range(len(a)):
tmp = a[i]
while a[i]%2 != 1:
if a[i]%2 == 0:
ans += 1
a[i] /= 2
print(ans)
| from math import log2
N = int(eval(input()))
a = list(map(int, input().split()))
ans = 0
for i in range(len(a)):
while a[i]%2 != 1:
ans += 1
a[i] /= 2
print(ans)
| p03325 |
import sys
input = sys.stdin.readline
N = int(eval(input()))
L = [int(v) for v in input().split()]
ans = 0
for v in L:
c = 0
while v % (2 ** (c + 1)) == 0:
c += 1
ans += c
print(ans) | import sys
input = sys.stdin.readline
N, = list(map(int, input().split()))
L = [int(v) for v in input().split()]
ans = 0
for v in L:
while v % 2 == 0:
ans += 1
v = v // 2
print(ans) | p03325 |
import math
n = int(eval(input()))
array = [int(x) for x in input().split()]
res = 0
for i in array:
if i %2 == 0:
while True:
res += 1
i /= 2
if i % 2 != 0:
break
print(res)
| n = int(eval(input()))
divide_dict = {0:1,2:1,4:2,6:1,8:3}
array = [int(x) for x in input().split()]
res = 0
for num in array:
if num % 2 != 0:
continue
else:
while num % 2 == 0:
res += 1
num /= 2
print(res) | p03325 |
n = int(eval(input()))
a = list(map(int,input().split()))
cnt = 0
total = 0
while cnt != len(a):
cnt = 0
for i in range(len(a)):
if a[i] % 2 == 0:
a[i] //= 2
total += 1
break
else:
cnt += 1
print(total) | n = int(eval(input()))
a = list(map(int,input().split()))
total = 0
for i in range(len(a)):
while a[i] % 2 == 0:
total += 1
a[i] //= 2
print(total) | p03325 |
N = int(eval(input()))
a = list(map(int, input().split()))
ans = 0
for i in a:
while (1):
if i % 2 == 1:
break
i /= 2
ans += 1
print(ans) | N = int(eval(input()))
a = list(map(int, input().split()))
ans = 0
for x in a:
while(True):
if x & 1:
break
x >>= 1
ans += 1
print(ans) | p03325 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.