結果
問題 | No.3030 ミラー・ラビン素数判定法のテスト |
ユーザー | かりあげクン |
提出日時 | 2020-09-12 01:07:10 |
言語 | Haskell (9.8.2) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,478 bytes |
コンパイル時間 | 1,260 ms |
コンパイル使用メモリ | 201,384 KB |
実行使用メモリ | 13,100 KB |
最終ジャッジ日時 | 2023-08-11 23:06:38 |
合計ジャッジ時間 | 2,962 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge11 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 3 ms
7,716 KB |
testcase_01 | AC | 3 ms
7,732 KB |
testcase_02 | AC | 3 ms
8,128 KB |
testcase_03 | AC | 3 ms
8,172 KB |
testcase_04 | WA | - |
testcase_05 | AC | 142 ms
12,992 KB |
testcase_06 | AC | 92 ms
12,928 KB |
testcase_07 | AC | 102 ms
12,888 KB |
testcase_08 | AC | 102 ms
13,036 KB |
testcase_09 | AC | 212 ms
12,944 KB |
コンパイルメッセージ
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:13:25: warning: [GHC-68441] [-Wdeprecations] In the use of ‘powModInteger’ (imported from GHC.Integer.GMP.Internals): Deprecated: "Use integerPowMod# instead" | 13 | powModInt a n mo = fI $ powModInteger (fi a) (fi n) (fi mo) | ^^^^^^^^^^^^^ [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 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 < 4759123141 = loop [2,7,61] | 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) | (powModInt a d n /= 1) && allok = False | otherwise = loop as where allok = all (\r -> (powModInt 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)