結果

問題 No.36 素数が嫌い！
コンテスト
ユーザー tottoripaper
提出日時 2014-11-24 06:02:49
言語 Haskell
(9.10.1)
結果
AC  
実行時間 497 ms / 5,000 ms
コード長 661 bytes
コンパイル時間 2,063 ms
コンパイル使用メモリ 171,008 KB
実行使用メモリ 8,192 KB
最終ジャッジ日時 2024-06-27 00:13:11
合計ジャッジ時間 5,080 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 26
権限があれば一括ダウンロードができます
コンパイルメッセージ
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:8:17: 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 | factor n = map (head &&& length) . group $ helper n 2
  |                 ^^^^

Main.hs:17:30: 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."
   |
17 |   | length fs == 2 && (snd . head . reverse . sortBy (comparing snd)) fs >= 2 = True
   |                              ^^^^

Main.hs:18:30: 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."
   |
18 |   | length fs == 1 && (snd . head . reverse . sortBy (comparing snd)) fs >= 3 = True
   |                              ^^^^
[2 of 2] Linking a.out

ソースコード

diff #
raw source code 

{-# LANGUAGE Arrows #-}

import Control.Arrow
import Data.List (group, sortBy)
import Data.Ord

factor 1 = []
factor n = map (head &&& length) . group $ helper n 2
  where
    helper n x
      | x * x > n = if n > 1 then [n] else []
      | n `mod` x == 0 = x : helper (n `div` x) x
      | otherwise = helper n (x+1)

can n
  | length fs > 2 = True
  | length fs == 2 && (snd . head . reverse . sortBy (comparing snd)) fs >= 2 = True
  | length fs == 1 && (snd . head . reverse . sortBy (comparing snd)) fs >= 3 = True
  | otherwise = False
  where
    fs = factor n

main = do
  n <- readLn
  putStrLn $ if can n then "YES" else "NO"
0