結果

問題 No.3030 ミラー・ラビン素数判定法のテスト
ユーザー かりあげクンかりあげクン
提出日時 2020-09-11 17:02:09
言語 Haskell
(9.6.2)
結果
WA  
実行時間 -
コード長 2,283 bytes
コンパイル時間 6,883 ms
コンパイル使用メモリ 187,148 KB
実行使用メモリ 12,784 KB
最終ジャッジ日時 2023-08-11 23:05:35
合計ジャッジ時間 2,548 ms
ジャッジサーバーID
(参考情報)
judge14 / judge11
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 3 ms
7,820 KB
testcase_01 AC 3 ms
7,696 KB
testcase_02 AC 3 ms
8,124 KB
testcase_03 AC 3 ms
8,204 KB
testcase_04 WA -
testcase_05 WA -
testcase_06 WA -
testcase_07 WA -
testcase_08 WA -
testcase_09 WA -
権限があれば一括ダウンロードができます
コンパイルメッセージ
Loaded package environment from /home/judge/.ghc/x86_64-linux-9.6.1/environments/default
[1 of 2] Compiling Main             ( Main.hs, Main.o )

Main.hs:15:28: warning: [GHC-68441] [-Wdeprecations]
    In the use of ‘powModInteger’
    (imported from GHC.Integer.GMP.Internals):
    Deprecated: "Use integerPowMod# instead"
   |
15 | powModInt !a !n !mo = fI $ powModInteger (fi a) (fi n) (fi mo)
   |                            ^^^^^^^^^^^^^
[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
import           GHC.Integer.GMP.Internals

fi :: Int -> Integer
fi = fromIntegral
fI :: Integer -> Int
fI = fromInteger
powModInt :: Int -> Int -> Int -> Int
powModInt !a !n !mo = fI $ powModInteger (fi a) (fi n) (fi mo)

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

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

    loop [] = True
    loop (a:as)
      | (powModInt a d n) /= 1 && powLoop 0 = False
      | otherwise = loop as
      where
        powLoop r
          | r < s     = (powModInt 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