結果

問題 No.8030 ミラー・ラビン素数判定法のテスト
ユーザー かりあげクン
提出日時 2020-09-11 16:55:38
言語 Haskell
(9.10.1)
結果
MLE  
実行時間 -
コード長 2,240 bytes
コンパイル時間 5,022 ms
コンパイル使用メモリ 213,772 KB
実行使用メモリ 813,824 KB
最終ジャッジ日時 2024-11-18 18:22:40
合計ジャッジ時間 22,136 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 4 MLE * 6
権限があれば一括ダウンロードができます
コンパイルメッセージ
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

ソースコード

diff # 

{-# LANGUAGE OverloadedStrings #-}
{-# LANGUAGE BangPatterns      #-}
import qualified Control.Arrow             as Arrow
import qualified Data.ByteString.Char8     as BSC8
import qualified Data.Vector               as V
import qualified Data.Vector.Unboxed       as VU
import           Data.Bits

powMod :: Int -> Int -> Int -> Int
powMod a 0 m = 1
powMod a n m
       | n `mod` 2 == 0 = ret * ret `mod` m
       where ret = powMod a (n `div` 2) m
powMod a n m = powMod a (n-1) m * a `mod` m

millerRabin :: Int -> Bool
millerRabin n
  |  n <= 1 = False
  |  n == 2
  || n == 3
  || n == 5
  || n == 7 = True
  | even n  = False
  | otherwise = mrCheck n

mrCheck :: Int -> Bool
mrCheck n = loop [2,325,9375,28178,450775,9780504,1795265022]
  where
    !m = n - 1
    !s = countTrailingZeros m
    !d = m `div` s

    loop [] = True
    loop (a:as)
      | powMod a d n /= 1 && powLoop 0 = False
      | otherwise = loop as
      where
        powLoop r
          | r < s     = (powMod a (2 ^ r * d) n) /= (n - 1) && powLoop (r + 1)
          | otherwise = True

type Parser a = BSC8.ByteString -> Maybe (a, BSC8.ByteString)
parseInt :: Parser Int
parseInt = fmap (Arrow.second BSC8.tail) . BSC8.readInt
parseChar :: [Char] -> VU.Vector Char
parseChar = VU.fromList
parse1 :: IO Int
parse1 = readLn
parse2 :: IO (Int, Int)
parse2 = (\vec -> (vec VU.! 0, vec VU.! 1)) . VU.unfoldrN 2 parseInt <$> BSC8.getLine
parse3 :: IO (Int, Int, Int)
parse3 = (\vec -> (vec VU.! 0, vec VU.! 1, vec VU.! 2)) . VU.unfoldrN 3 parseInt <$> BSC8.getLine
parse4 :: IO (Int, Int, Int, Int)
parse4 = (\vec -> (vec VU.! 0, vec VU.! 1, vec VU.! 2, vec VU.! 3)) . VU.unfoldrN 4 parseInt <$> BSC8.getLine
parseM :: Int -> IO (VU.Vector Int)
parseM m = VU.unfoldrN m parseInt <$> BSC8.getLine
parseN :: Int -> IO (VU.Vector Int)
parseN n = VU.replicateM n parse1
parseNM :: Int -> Int -> IO (V.Vector (VU.Vector Int))
parseNM n m = V.replicateM n $ VU.unfoldrN m parseInt <$> BSC8.getLine

main :: IO ()
main = do
  n  <- parse1
  xs <- parseN n
  VU.mapM_ (BSC8.putStr . solve) xs

solve :: Int -> BSC8.ByteString
solve n
  | millerRabin n = tupToBS (n, 1)
  | otherwise     = tupToBS (n, 0)
  where
    tupToBS (a, b) = BSC8.pack $ show a ++ " " ++ show b ++ "\n"
0