結果
問題 |
No.300 平方数
|
ユーザー |
![]() |
提出日時 | 2015-11-13 22:37:17 |
言語 | Haskell (9.10.1) |
結果 |
AC
|
実行時間 | 65 ms / 1,000 ms |
コード長 | 876 bytes |
コンパイル時間 | 5,003 ms |
コンパイル使用メモリ | 170,624 KB |
実行使用メモリ | 13,568 KB |
最終ジャッジ日時 | 2024-09-13 14:41:48 |
合計ジャッジ時間 | 6,689 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 43 |
コンパイルメッセージ
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:32: 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." | 23 | factors = map (\ps -> (head ps, fromIntegral $ length ps)) $ group $ factorize x | ^^^^ [2 of 2] Linking a.out
ソースコード
import Data.List (group) primes :: Integral a => [a] primes = map fromIntegral primes' where primes' = [2, 3, 5] ++ sieve 5 7 (drop 2 primes') sieve m s (p : ps) = [n | n <- ns, gcd m n == 1] ++ sieve (m * p) (p * p) ps where ns = [x + y | x <- [s, s + 6 .. p * p - 2], y <- [0, 4]] 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 getY :: Integer -> Integer getY x = y where factors = map (\ps -> (head ps, fromIntegral $ length ps)) $ group $ factorize x y = product $ map (\(f, k) -> if odd k then f else 1) factors main :: IO () main = print . getY =<< readLn