結果

問題 No.40 多項式の割り算
コンテスト
ユーザー 情報学生
提出日時 2019-08-27 11:26:10
言語 Haskell
(9.10.1)
結果
AC  
実行時間 3 ms / 5,000 ms
コード長 842 bytes
コンパイル時間 3,317 ms
コンパイル使用メモリ 180,932 KB
実行使用メモリ 6,824 KB
最終ジャッジ日時 2024-11-14 06:02:12
合計ジャッジ時間 4,388 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 32
権限があれば一括ダウンロードができます
コンパイルメッセージ
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:22:16: 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."
   |
22 |     putStrLn $ head ys
   |                ^^^^

Main.hs:23:26: 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."
   |
23 |     putStrLn $ unwords $ tail ys
   |                          ^^^^
[2 of 2] Linking a.out

ソースコード

diff # 

import Control.Applicative ((<$>))
import Data.ByteString.Char8 (ByteString)
import qualified Data.ByteString.Char8 as B
import Data.Char (isSpace)
import Data.List (foldl', unfoldr)

getL :: (ByteString -> [Int]) -> IO [Int]
getL f = f <$> B.getLine

readIL :: (ByteString -> Maybe (Int, ByteString)) -> (ByteString -> [Int])
readIL f = unfoldr g
    where
        g s = do
            (n, s') <- f s
            return (n, B.dropWhile isSpace s')

main :: IO ()
main = do
    B.getLine
    xs <- getL $ readIL B.readInt
    let ys = map show $ solve $ reverse xs
    putStrLn $ head ys
    putStrLn $ unwords $ tail ys

solve :: [Int] -> [Int]
solve (0:xs)        = solve xs
solve []            = [0, 0]
solve [x]           = [0, x]
solve [x, y]        = [1, y, x]
solve [x, y, z]     = [2, z, y, x]
solve (x:y:z:w:rs)  = solve (y:z+x:w:rs)
0