結果

問題 No.1729 ～サンプルはちゃんと見て！～　16進数と8進数(1)
コンテスト
ユーザー sanao10000
提出日時 2021-11-05 22:48:44
言語 Haskell
(9.10.1)
結果
CE  
(最新)
AC  
(最初)
実行時間 -
コード長 2,916 bytes
コンパイル時間 141 ms
コンパイル使用メモリ 151,424 KB
最終ジャッジ日時 2024-11-15 01:53:48
合計ジャッジ時間 450 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）
コンパイルエラー時のメッセージ・ソースコードは、提出者また管理者しか表示できないようにしております。（リジャッジ後のコンパイルエラーは公開されます）
ただし、clay言語の場合は開発者のデバッグのため、公開されます。

コンパイルメッセージ
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:23:1: error: [GHC-87110]
    Could not load module ‘Data.Set’.
    It is a member of the hidden package ‘containers-0.6.8’.
    Use -v to see a list of the files searched for.
   |
23 | import qualified Data.Set                      as Set
   | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^

Main.hs:24:1: error: [GHC-87110]
    Could not load module ‘Data.Map.Strict’.
    It is a member of the hidden package ‘containers-0.6.8’.
    Use -v to see a list of the files searched for.
   |
24 | import qualified Data.Map.Strict               as Map
   | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^

ソースコード

diff # 

{-# LANGUAGE BangPatterns #-}
{-# LANGUAGE BlockArguments #-}
{-# LANGUAGE TypeApplications #-}
{-# LANGUAGE FlexibleContexts    #-}
{-# LANGUAGE FlexibleInstances   #-}


import Control.Applicative
import Control.Monad.State
import qualified Numeric as Nu
import Control.Monad.Identity
import qualified Control.Monad as CM
import qualified Data.List as L
import qualified Control.Monad.ST as ST
import qualified Data.ByteString.Char8         as BS
import qualified Data.Array as A
import qualified Data.Array.IO as AI
import qualified Data.Char as Ch
import qualified Data.Text as T
import qualified Data.Text.IO as T
import qualified Data.Array.ST as AST
import qualified Data.ByteString.Builder as BB
import qualified Data.Set                      as Set
import qualified Data.Map.Strict               as Map
import Prelude hiding (print)


------------------------------------------------------

main = do
    s <- getLine
    let c=L.group$L.sort$Nu.showOct (fst$head$Nu.readHex s) ""
        maxi=maximum$zipWith const (map length c) (map head c)
    putStr$
      unwords$
      words$
      L.intersperse ' ' $
      map snd$
      filter(\(x,y)->x==maxi)$
      zip(map length c)(map head c)

-------------------------------------------------------

cin::Sanao a=>IO a
cin=sanao<$>BS.getLine

type Moji= BS.ByteString

print :: Show a => a -> IO ()
print x=BS.putStrLn $ BS.pack $ show x

class Sanao a where
  sanao :: Moji -> a
  {-# MINIMAL sanao #-}

instance Sanao Moji  where
  sanao= id

instance Sanao Int where
    sanao x= case BS.readInt x of
                Nothing -> error "ここはInt"
                Just (a,_) -> a

instance Sanao Double where
    sanao x= case BS.readInt x of
                Nothing -> error "ここはDouble"
                Just (a,_) -> realToFrac a

instance Sanao [Moji] where
    sanao=BS.words

instance (Sanao a)=>Sanao [a] where
    sanao= map sanao.BS.words

instance Sanao(Int,Int) where
    sanao= (\[a, b]->(a, b)) . map sanao . BS.words

instance Sanao(Int, Int, Int) where
    sanao= (\[a, b, c]->(a, b, c)) . map sanao . BS.words

instance Sanao(Int, Int, Int, Int) where
    sanao= (\[a, b, c, d]->(a, b, c, d)) . map sanao . BS.words

instance Sanao(Double,Double) where
    sanao= (\[a, b]->(a, b)) . map sanao . BS.words

instance Sanao(Double,Double, Double) where
    sanao= (\[a, b, c]->(a, b, c)) . map sanao . BS.words

instance Sanao(Double,Double, Double, Double) where
    sanao= (\[a, b, c, d]->(a, b, c, d)) . map sanao . BS.words

instance Sanao(Moji,Int) where
    sanao= (\[a, b]->(a,sanao b)) . BS.words

instance Sanao(Moji,Int, Int) where
    sanao= (\[a, b, c]->(a,sanao b, sanao c)) . BS.words


instance Sanao(Int,Moji) where
    sanao= (\[a, b]->(sanao a,b)) . BS.words

instance Sanao(Moji,Double) where
    sanao= (\[a, b]->(a,sanao b)) . BS.words

instance Sanao(Double,Moji) where
    sanao= (\[a, b]->(sanao a,b)) . BS.words
0