結果
| 問題 | No.227 簡単ポーカー | 
| コンテスト | |
| ユーザー |  nisizawa | 
| 提出日時 | 2018-07-21 00:57:20 | 
| 言語 | Haskell (9.10.1) | 
| 結果 | 
                                AC
                                 
                             | 
| 実行時間 | 2 ms / 5,000 ms | 
| コード長 | 955 bytes | 
| コンパイル時間 | 7,835 ms | 
| コンパイル使用メモリ | 172,800 KB | 
| 実行使用メモリ | 5,248 KB | 
| 最終ジャッジ日時 | 2024-12-26 04:34:35 | 
| 合計ジャッジ時間 | 8,410 ms | 
| ジャッジサーバーID (参考情報) | judge3 / judge4 | 
(要ログイン)
| ファイルパターン | 結果 | 
|---|---|
| other | AC * 14 | 
コンパイルメッセージ
Loaded package environment from /home/judge/.ghc/x86_64-linux-9.8.2/environments/default [1 of 2] Compiling Main ( Main.hs, Main.o ) [2 of 2] Linking a.out
ソースコード
import Data.List
main :: IO ()
main = do
    cards <- input_ints
    let ans = solve cards
    putStrLn ans
input_ints :: IO [Int]
input_ints = return . map read . words =<< getLine
solve :: [Int] -> String
solve cards = solve_rec (sort cards) (0, 0)
    where
        solve_rec :: [Int] -> (Int, Int) -> String
        solve_rec [] count
            | count == (0, 0) = "NO HAND"
            | count == (1, 0) = "ONE PAIR"
            | count == (2, 0) = "TWO PAIR"
            | count == (0, 1) = "THREE CARD"
            | count == (1, 1) = "FULL HOUSE"
        solve_rec (card:cards) (two, three) = solve_rec new_cards (new_two, new_three)
            where
                (selected_cards, new_cards) = span (== card) cards
                (new_two, new_three) =
                    case length selected_cards of
                        1 -> (two + 1, three)
                        2 -> (two, three + 1)
                        _ -> (two, three)
            
            
            
        