結果

問題 No.3030 ミラー・ラビン素数判定法のテスト
ユーザー かりあげクンかりあげクン
提出日時 2020-09-11 17:21:43
言語 Haskell
(9.8.2)
結果
TLE  
実行時間 -
コード長 1,967 bytes
コンパイル時間 1,290 ms
コンパイル使用メモリ 203,532 KB
実行使用メモリ 16,452 KB
最終ジャッジ日時 2023-08-11 23:06:24
合計ジャッジ時間 12,870 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge13
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 3 ms
7,952 KB
testcase_01 AC 3 ms
7,796 KB
testcase_02 AC 3 ms
8,152 KB
testcase_03 AC 3 ms
8,264 KB
testcase_04 TLE -
testcase_05 -- -
testcase_06 -- -
testcase_07 -- -
testcase_08 -- -
testcase_09 -- -
権限があれば一括ダウンロードができます
コンパイルメッセージ
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:14:25: warning: [GHC-68441] [-Wdeprecations]
    In the use of ‘powModInteger’
    (imported from GHC.Integer.GMP.Internals):
    Deprecated: "Use integerPowMod# instead"
   |
14 | powModInt a n mo = fI $ powModInteger (fi a) (fi n) (fi mo)
   |                         ^^^^^^^^^^^^^

Main.hs:34:9: warning: [GHC-97441] [-Woverflowed-literals]
    Literal 9223372036854775808 is out of the Int range -9223372036854775808..9223372036854775807
    Suggested fix:
      Perhaps you intended to use NegativeLiterals
      If you are trying to write a large negative literal
   |
34 |   | n < 9223372036854775808 = loop [2,325,9375,28178,450775,9780504,1795265022]
   |         ^^^^^^^^^^^^^^^^^^^

Main.hs:34:9: warning: [GHC-97441] [-Woverflowed-literals]
    Literal 9223372036854775808 is out of the Int range -9223372036854775808..9223372036854775807
    Suggested fix:
      Perhaps you intended to use NegativeLiterals
      If you are trying to write a large negative literal
   |
34 |   | n < 9223372036854775808 = loop [2,325,9375,28178,450775,9780504,1795265022]
   |         ^^^^^^^^^^^^^^^^^^^
[2 of 2] Linking a.out

ソースコード

diff # 

{-# LANGUAGE OverloadedStrings #-}

import qualified Control.Arrow             as Arrow
import qualified Data.ByteString.Char8     as BSC8
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
  | even n  = False
  | otherwise = mrCheck n

mrCheck :: Int -> Bool
mrCheck n
  | n < 2047                = loop [2]
  | n < 9080191             = loop [31,73]
  | n < 4759123141          = loop [2,7,61]
  | n < 1122004669633       = loop [2,13,23,1662803]
  | n < 2152302898747       = loop [2,3,5,7,11]
  | n < 341550071728321     = loop [2,3,5,7,11,13,17]
  | n < 9223372036854775808 = loop [2,325,9375,28178,450775,9780504,1795265022]
  | otherwise               = loop [ 2 .. min (n - 1) (floor $ 2 * (log n')^(2 :: Int)) ]
  where
    n' = fromIntegral n :: Double
    m = n - 1
    s = countTrailingZeros m
    d = m `div` (2 ^ 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
parse1 :: IO Int
parse1 = readLn
parseN :: Int -> IO (VU.Vector Int)
parseN n = VU.replicateM n parse1

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