結果
問題 | No.432 占い(Easy) |
ユーザー | gemmaro |
提出日時 | 2020-01-13 09:23:49 |
言語 | Haskell (9.8.2) |
結果 |
AC
|
実行時間 | 115 ms / 2,000 ms |
コード長 | 551 bytes |
コンパイル時間 | 11,955 ms |
コンパイル使用メモリ | 167,936 KB |
実行使用メモリ | 36,608 KB |
最終ジャッジ日時 | 2024-12-16 01:58:35 |
合計ジャッジ時間 | 9,807 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,248 KB |
testcase_02 | AC | 1 ms
5,248 KB |
testcase_03 | AC | 1 ms
5,248 KB |
testcase_04 | AC | 3 ms
5,248 KB |
testcase_05 | AC | 1 ms
5,248 KB |
testcase_06 | AC | 1 ms
5,248 KB |
testcase_07 | AC | 3 ms
5,248 KB |
testcase_08 | AC | 1 ms
5,248 KB |
testcase_09 | AC | 3 ms
5,248 KB |
testcase_10 | AC | 3 ms
5,248 KB |
testcase_11 | AC | 7 ms
7,936 KB |
testcase_12 | AC | 115 ms
36,480 KB |
testcase_13 | AC | 113 ms
36,608 KB |
testcase_14 | AC | 7 ms
8,192 KB |
testcase_15 | AC | 2 ms
5,248 KB |
testcase_16 | AC | 2 ms
5,248 KB |
testcase_17 | AC | 81 ms
31,232 KB |
testcase_18 | AC | 36 ms
13,832 KB |
testcase_19 | AC | 20 ms
10,624 KB |
testcase_20 | AC | 11 ms
8,704 KB |
testcase_21 | AC | 12 ms
9,472 KB |
testcase_22 | AC | 2 ms
5,248 KB |
testcase_23 | AC | 2 ms
5,248 KB |
testcase_24 | AC | 2 ms
5,248 KB |
testcase_25 | AC | 1 ms
5,248 KB |
コンパイルメッセージ
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:13:15: 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." | 13 | 1 -> head s | ^^^^ Main.hs:18:58: warning: [GHC-63394] [-Wx-partial] In the use of ‘tail’ (imported from Prelude, but defined in GHC.List): "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty." | 18 | where s' = map (\x -> fst x + snd x) $ zip (init s) (tail s) | ^^^^ [2 of 2] Linking a.out
ソースコード
import qualified Control.Monad as M import qualified Data.Char as C main = do t <- readLn s <- M.replicateM t getLine let s' = map (\x -> map C.digitToInt x) s putStr $ unlines $ map (show . solve) s' solve :: [Int] -> Int solve s = case length s of 1 -> head s otherwise -> solve (f s) f :: [Int] -> [Int] f s = map toDigit s' where s' = map (\x -> fst x + snd x) $ zip (init s) (tail s) toDigit :: Int -> Int toDigit n = if n >= 10 then toDigit $ sum $ map C.digitToInt $ show n else n