提出 #19412335

---

ソースコード 拡げる

{-# LANGUAGE DatatypeContexts #-}
import           Control.Exception           (assert)
import           Control.Monad
import           Control.Monad.Primitive
import qualified Control.Monad.ST            as ST
import qualified Data.Array.IO               as IO
import qualified Data.Array.ST               as ST
import qualified Data.Array.Unboxed          as A
import           Data.Bits
import qualified Data.ByteString.Char8       as BS
import           Data.Char
import           Data.Foldable
import           Data.List
import qualified Data.Map.Strict             as Map
import           Data.Maybe
import qualified Data.Sequence               as Seq
import qualified Data.Set                    as Set
import qualified Data.Vector                 as VB
import qualified Data.Vector.Mutable         as VBM
import qualified Data.Vector.Unboxed         as V
import           Data.Vector.Unboxed.Base
import qualified Data.Vector.Unboxed.Mutable as VM
import           Debug.Trace

readInt = fst . fromJust . BS.readInt
readIntList = map readInt . BS.words
getInt = readInt <$> BS.getLine
getIntList = readIntList <$> BS.getLine
getIntVec n = V.unfoldrN n (BS.readInt . BS.dropWhile isSpace) <$> BS.getLine

readInteger = fst . fromJust . BS.readInteger
readIntegerList = map readInteger . BS.words
getInteger = readInteger <$> BS.getLine
getIntegerList = readIntegerList <$> BS.getLine

inf :: Int
inf = 10^18

main = do
    [n, m, k] <- getIntList

    let p = 998244353
        r0 = m * modpow (m-1) (n-1) p `mod` p
        c0 = 1

        solve i c res
          | i > k = res
          | otherwise = let r' = m * modpow (m-1) (n-1-i) p `mod` p
                            c' = c * (n-i) `mod` p * modinv i p `mod` p
                            res' = (r' * c' `mod` p + res) `mod` p
                        in solve (i+1) c' res'

    print $ solve 1 c0 (r0 * c0 `mod` p)

-- compulte a^n `mod` p
modpow :: Int -> Int -> Int -> Int
modpow a n p =
  let modpow' :: Integer -> Integer -> Integer -> Integer
      modpow' a n res | n == 0    = res
                      | otherwise =
                          modpow' (a*a`mod`p')
                                  (n `shiftR` 1)
                                  (if (n .&. 1) == 1 then res * a `mod` p' else res)
      p' = fromIntegral p
  in fromInteger $ modpow' (fromIntegral a) (fromIntegral n) 1

-- compute a^(-1) `mod` p
modinv :: Int -> Int -> Int
modinv a p = modpow a (p-2) p

提出情報

コンパイルエラー

Loaded package environment from /home/contestant/.ghc/x86_64-linux-8.8.3/environments/default

Main.hs:1:14: warning:
    -XDatatypeContexts is deprecated: It was widely considered a misfeature, and has been removed from the Haskell language.
  |
1 | {-# LANGUAGE DatatypeContexts #-}
  |              ^^^^^^^^^^^^^^^^

ジャッジ結果