結果
問題 | No.2 素因数ゲーム |
ユーザー | はむ吉🐹 |
提出日時 | 2015-11-15 13:02:59 |
言語 | Haskell (9.8.2) |
結果 |
AC
|
実行時間 | 2 ms / 5,000 ms |
コード長 | 1,264 bytes |
コンパイル時間 | 6,507 ms |
コンパイル使用メモリ | 175,876 KB |
実行使用メモリ | 6,944 KB |
最終ジャッジ日時 | 2024-06-08 00:13:00 |
合計ジャッジ時間 | 6,874 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
6,816 KB |
testcase_01 | AC | 1 ms
6,820 KB |
testcase_02 | AC | 2 ms
6,940 KB |
testcase_03 | AC | 1 ms
6,940 KB |
testcase_04 | AC | 2 ms
6,940 KB |
testcase_05 | AC | 2 ms
6,940 KB |
testcase_06 | AC | 2 ms
6,940 KB |
testcase_07 | AC | 2 ms
6,944 KB |
testcase_08 | AC | 2 ms
6,940 KB |
testcase_09 | AC | 1 ms
6,940 KB |
testcase_10 | AC | 1 ms
6,940 KB |
testcase_11 | AC | 2 ms
6,940 KB |
testcase_12 | AC | 1 ms
6,944 KB |
testcase_13 | AC | 1 ms
6,944 KB |
testcase_14 | AC | 1 ms
6,940 KB |
testcase_15 | AC | 2 ms
6,944 KB |
testcase_16 | AC | 1 ms
6,940 KB |
testcase_17 | AC | 1 ms
6,944 KB |
testcase_18 | AC | 2 ms
6,940 KB |
testcase_19 | AC | 2 ms
6,944 KB |
testcase_20 | AC | 2 ms
6,940 KB |
testcase_21 | AC | 2 ms
6,940 KB |
testcase_22 | AC | 2 ms
6,940 KB |
testcase_23 | AC | 2 ms
6,940 KB |
testcase_24 | AC | 1 ms
6,940 KB |
testcase_25 | AC | 2 ms
6,940 KB |
testcase_26 | AC | 1 ms
6,940 KB |
testcase_27 | AC | 1 ms
6,940 KB |
testcase_28 | AC | 1 ms
6,944 KB |
testcase_29 | AC | 1 ms
6,940 KB |
testcase_30 | AC | 1 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:27: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." | 27 | frequency = map (length &&& head) . group | ^^^^ [2 of 2] Linking a.out
ソースコード
import Control.Arrow ((&&&)) import Data.Bits (Bits, xor) import Data.List (group) -- | Generates the sequence of prime numbers. -- Based on <http://qiita.com/little_Haskeller/items/614a3ae20a517c19bb1f this article> . primes :: Integral a => [a] primes = map fromIntegral primes' where primes' = [2, 3, 5] ++ sieve2 5 7 (drop 2 primes') sieve2 m s (p : ps) = [n | n <- ns, gcd m n == 1] ++ sieve2 (m * p) (p * p) ps where ns = [x + y | x <- [s, s + 6 .. p * p - 2], y <- [0, 4]] -- | Factorizes the given integer using 'primes'. -- Based on <https://wiki.haskell.org/Testing_primality this page>. factorize :: Integral a => a -> [a] factorize 1 = [] factorize n = factorize' n primes where factorize' n ps@(p : pr) | p * p > n = [n] | m == 0 = p : factorize' d ps | otherwise = factorize' n pr where (d, m) = divMod n p frequency :: Ord a => [a] -> [(Int, a)] frequency = map (length &&& head) . group xor2 :: Bits a => [a] -> a xor2 (x : []) = x xor2 (x : xs) = xor x $ xor2 xs main :: IO () main = putStrLn . (\x -> if x == 0 then "Bob" else "Alice") . xor2 .map fst . frequency . factorize =<< readLn