結果
問題 | No.3030 ミラー・ラビン素数判定法のテスト |
ユーザー | かりあげクン |
提出日時 | 2020-09-12 01:17:24 |
言語 | Haskell (9.8.2) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,801 bytes |
コンパイル時間 | 1,015 ms |
コンパイル使用メモリ | 204,180 KB |
実行使用メモリ | 12,660 KB |
最終ジャッジ日時 | 2023-08-11 23:06:49 |
合計ジャッジ時間 | 2,441 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge15 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 3 ms
7,348 KB |
testcase_01 | AC | 3 ms
7,340 KB |
testcase_02 | AC | 2 ms
7,612 KB |
testcase_03 | AC | 3 ms
7,840 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 ) [2 of 2] Linking a.out
ソースコード
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 import Data.Bool 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 < 3825123056546413051 = loop [2,3,5,7,11,13,17,19,23] | otherwise = loop [2,325,9375,28178,450775,9780504,1795265022] where m = n - 1 s = countTrailingZeros m d = m `unsafeShiftR` s loop [] = True loop (a:as) | (powMod a d n /= 1) && allok = False | otherwise = loop as where allok = all (\r -> (powMod a ((1 `unsafeShiftL` r) * d) n) /= m) [0..(s - 1)] 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.putStrLn . solve) xs solve :: Int -> BSC8.ByteString solve n = BSC8.pack $ bool (show n ++ " 0") (show n ++ " 1") (millerRabin n) powMod :: Int -> Int -> Int -> Int powMod n p mo | p == 0 = 1 | odd p = n * powMod n (p-1) mo `mod` mo | otherwise = let t = powMod n (p `div` 2) mo in (t ^ 2) `mod` mo