結果

問題 No.123 カードシャッフル
コンテスト
ユーザー Haar
提出日時 2016-04-03 15:41:46
言語 Haskell
(9.10.1)
結果
AC  
実行時間 321 ms / 5,000 ms
コード長 270 bytes
コンパイル時間 1,495 ms
コンパイル使用メモリ 170,496 KB
実行使用メモリ 54,912 KB
最終ジャッジ日時 2024-10-02 12:37:08
合計ジャッジ時間 3,379 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 10
権限があれば一括ダウンロードができます
コンパイルメッセージ
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:2:20: 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."
  |
2 | shuffle cards p = (head post) : pre ++ (tail post)
  |                    ^^^^

Main.hs:2:41: 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."
  |
2 | shuffle cards p = (head post) : pre ++ (tail post)
  |                                         ^^^^

Main.hs:3:1: warning: [GHC-94817] [-Wtabs]
    Tab character found here, and in four further locations.
    Suggested fix: Please use spaces instead.
  |
3 |         where pre = take (p-1) cards;
  | ^^^^^^^^

Main.hs:8:29: 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."
  |
8 |         getLine >>= print . head . foldl shuffle [1..n] . map read . words
  |                             ^^^^
[2 of 2] Linking a.out

ソースコード

diff #
raw source code 

shuffle :: [Int] -> Int -> [Int]
shuffle cards p = (head post) : pre ++ (tail post)
	where pre = take (p-1) cards;
		  post = drop (p-1) cards

main = do
	[n, _] <- getLine >>= return . map read . words
	getLine >>= print . head . foldl shuffle [1..n] . map read . words
0