結果

問題 No.2299 Antitypoglycemia
ユーザー mtwtkman
提出日時 2023-05-14 21:00:42
言語 Haskell
(9.10.1)
結果
AC  
実行時間 57 ms / 2,000 ms
コード長 674 bytes
コンパイル時間 3,769 ms
コンパイル使用メモリ 175,744 KB
実行使用メモリ 15,872 KB
最終ジャッジ日時 2024-11-30 07:55:55
合計ジャッジ時間 3,760 ms
ジャッジサーバーID
(参考情報)
judge1 / judge2
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 25
権限があれば一括ダウンロードができます
コンパイルメッセージ
Loaded package environment from /home/judge/.ghc/x86_64-linux-9.8.2/environments/default
[1 of 2] Compiling Main             ( Main.hs, Main.o )

Main.hs:26:29: warning: [GHC-63394] [-Wx-partial]
    In the use of ‘head’
    (imported from Prelude, but defined in GHC.List):
    "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
   |
26 |   let [n, a, b] = map read [head vs, vs !! 1, vs !! 2]
   |                             ^^^^
[2 of 2] Linking a.out

ソースコード

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

split :: String -> [String]
split = go ("", [])
where
go :: (String, [String]) -> String -> [String]
go (a, acc) "" = acc <> [a]
go (a, acc) (' ' : xs) = go ("", acc <> [a]) xs
go (a, acc) (x : xs) = go (a <> [x], acc) xs
prompt :: IO [String]
prompt = do split <$> getLine
m = 998244353
fac :: Integer -> Integer
fac 0 = 1
fac n = (fac (n - 1) * n) `mod` m
solve :: Integer -> Integer -> Integer -> Integer
solve n a b =
let r = (fac n + ((m - 2) * fac (n - 1)) `mod` m) `mod` m
in if a /= b then (r + fac (n - 2)) `mod` m else r
main :: IO ()
main = do
vs <- prompt
let [n, a, b] = map read [head vs, vs !! 1, vs !! 2]
print $ solve n a b
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0