結果
問題 | No.432 占い(Easy) |
ユーザー | Ysmr_Ry |
提出日時 | 2016-12-17 03:21:12 |
言語 | Haskell (9.8.2) |
結果 |
AC
|
実行時間 | 87 ms / 2,000 ms |
コード長 | 366 bytes |
コンパイル時間 | 7,822 ms |
コンパイル使用メモリ | 174,208 KB |
実行使用メモリ | 28,672 KB |
最終ジャッジ日時 | 2024-05-08 01:10:38 |
合計ジャッジ時間 | 9,622 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
5,248 KB |
testcase_01 | AC | 1 ms
5,248 KB |
testcase_02 | AC | 1 ms
5,376 KB |
testcase_03 | AC | 1 ms
5,376 KB |
testcase_04 | AC | 2 ms
5,376 KB |
testcase_05 | AC | 1 ms
5,376 KB |
testcase_06 | AC | 2 ms
5,376 KB |
testcase_07 | AC | 2 ms
5,376 KB |
testcase_08 | AC | 2 ms
5,376 KB |
testcase_09 | AC | 3 ms
5,376 KB |
testcase_10 | AC | 3 ms
5,376 KB |
testcase_11 | AC | 7 ms
7,936 KB |
testcase_12 | AC | 87 ms
28,672 KB |
testcase_13 | AC | 84 ms
28,544 KB |
testcase_14 | AC | 6 ms
8,064 KB |
testcase_15 | AC | 1 ms
5,376 KB |
testcase_16 | AC | 1 ms
5,376 KB |
testcase_17 | AC | 77 ms
28,672 KB |
testcase_18 | AC | 31 ms
13,176 KB |
testcase_19 | AC | 17 ms
10,880 KB |
testcase_20 | AC | 7 ms
8,064 KB |
testcase_21 | AC | 10 ms
9,344 KB |
testcase_22 | AC | 3 ms
5,376 KB |
testcase_23 | AC | 2 ms
5,376 KB |
testcase_24 | AC | 3 ms
5,376 KB |
testcase_25 | AC | 3 ms
5,376 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:9:13: 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." | 9 | print $ head $ last $ takeWhile (not . null) $ iterate step (map digitToInt xs) | ^^^^ Main.hs:12:27: 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." | 12 | step xs = zipWith add xs (tail xs) | ^^^^ [2 of 2] Linking a.out
ソースコード
import Control.Monad import Data.Char main :: IO () main = do t <- readLn replicateM_ t $ do xs <- getLine print $ head $ last $ takeWhile (not . null) $ iterate step (map digitToInt xs) step :: [Int] -> [Int] step xs = zipWith add xs (tail xs) where add a b | s >= 10 = s`div`10+s`mod`10 | otherwise = s where s = a+b