This documentation is automatically generated by competitive-verifier/competitive-verifier
# competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/primality_test
from libs.math_func import is_prime
from libs.standard_input import *
from libs.yn_func import *
Q = ii()
while Q:
N = ii()
YN(is_prime(N))
Q -= 1
Env | Name | Status | Elapsed | Memory |
---|---|---|---|---|
Python | all_prime_00 |
![]() |
6709 ms | 12 MB |
Python | carmichael_00 |
![]() |
41 ms | 12 MB |
Python | example_00 |
![]() |
27 ms | 12 MB |
Python | hack_issue996_00 |
![]() |
28 ms | 12 MB |
Python | less_1000000000_00 |
![]() |
528 ms | 12 MB |
Python | prod_two_prime_00 |
![]() |
1383 ms | 12 MB |
Python | random_00 |
![]() |
1031 ms | 12 MB |
Python | random_01 |
![]() |
1010 ms | 12 MB |
Python | random_02 |
![]() |
1142 ms | 12 MB |
Python | small_00 |
![]() |
438 ms | 12 MB |