結果

問題 No.52 よくある文字列の問題
ユーザー くれちーくれちー
提出日時 2017-03-15 23:42:08
言語 Haskell
(9.8.2)
結果
AC  
実行時間 10 ms / 5,000 ms
コード長 439 bytes
コンパイル時間 1,688 ms
コンパイル使用メモリ 174,080 KB
実行使用メモリ 8,064 KB
最終ジャッジ日時 2024-09-22 05:29:29
合計ジャッジ時間 2,260 ms
ジャッジサーバーID
(参考情報)
judge4 / judge2
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
6,812 KB
testcase_01 AC 1 ms
6,816 KB
testcase_02 AC 5 ms
7,936 KB
testcase_03 AC 1 ms
6,940 KB
testcase_04 AC 10 ms
7,808 KB
testcase_05 AC 6 ms
7,936 KB
testcase_06 AC 8 ms
8,064 KB
testcase_07 AC 3 ms
6,940 KB
testcase_08 AC 2 ms
6,940 KB
testcase_09 AC 1 ms
6,940 KB
testcase_10 AC 2 ms
6,940 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:7:28: 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."
  |
7 |     | x == True  = solve1 (tail s) (s' ++ [head s]) xs
  |                            ^^^^

Main.hs:7:44: 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."
  |
7 |     | x == True  = solve1 (tail s) (s' ++ [head s]) xs
  |                                            ^^^^
[2 of 2] Linking a.out

ソースコード

diff #
プレゼンテーションモードにする

import Control.Monad (replicateM)
import Data.List (nub)
solve1 :: String -> String -> [Bool] -> String
solve1 s s' (x : []) = s' ++ s
solve1 s s' (x : xs)
| x == True = solve1 (tail s) (s' ++ [head s]) xs
| x == False = solve1 (init s) (s' ++ [last s]) xs
solve2 :: Integral a => String -> a
solve2 s = fromIntegral . length . nub . map (solve1 s "")
$ replicateM (length s) [True, False]
main = print . solve2 =<< getLine
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0