結果

問題 No.193 筒の数式
コンテスト
ユーザー Michae'Gon
提出日時 2015-04-30 11:48:26
言語 Haskell
(9.10.1)
結果
WA  
実行時間 -
コード長 577 bytes
コンパイル時間 5,223 ms
コンパイル使用メモリ 174,976 KB
実行使用メモリ 5,376 KB
最終ジャッジ日時 2024-07-05 17:07:05
合計ジャッジ時間 5,565 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 12 WA * 3 RE * 1
権限があれば一括ダウンロードができます
コンパイルメッセージ
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:12:32: 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 |         | otherwise = ((read $ tail sy ++ x) :: Int) + foldl ff 0 ys + ((read [head sy]) :: Int)
   |                                ^^^^

Main.hs:12:80: 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."
   |
12 |         | otherwise = ((read $ tail sy ++ x) :: Int) + foldl ff 0 ys + ((read [head sy]) :: Int)
   |                                                                                ^^^^

Main.hs:15:14: 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."
   |
15 |         sy = head y
   |              ^^^^
[2 of 2] Linking a.out

ソースコード

diff # 

import Data.Char
main = getLine >>= print . solve . words . foldr ff ""
        where
        ff x acc
                | isDigit x = x : acc
                | x == '-' = ' ' : x : acc
                | otherwise  = ' ' : acc

solve :: [String] -> Int
solve (x : xs)
        | read sy < 0 = ((read $ drop 2 sy ++  x) :: Int) + foldl ff 0 ys + ((read $ take 2 sy) :: Int)
        | otherwise = ((read $ tail sy ++ x) :: Int) + foldl ff 0 ys + ((read [head sy]) :: Int)
        where
        (ys, y) = splitAt (length xs - 1) xs
        sy = head y
        ff acc z = read z + acc
0