test/cpv/library-checker-number_theory/primality_test.cpp
| Line | Branch | Exec | Source |
|---|---|---|---|
| 1 | // competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/primality_test | ||
| 2 | #include "../../../src/nt/is_prime/lib.hpp" | ||
| 3 | |||
| 4 | using namespace tifa_libs; | ||
| 5 | 12 | int main() { | |
| 6 |
1/2✓ Branch 2 taken 12 times.
✗ Branch 3 not taken.
|
12 | std::cin.tie(nullptr)->std::ios::sync_with_stdio(false); |
| 7 | i64 q; | ||
| 8 |
1/2✓ Branch 1 taken 12 times.
✗ Branch 2 not taken.
|
12 | std::cin >> q; |
| 9 |
2/2✓ Branch 0 taken 701129 times.
✓ Branch 1 taken 12 times.
|
701141 | while (q--) { |
| 10 | u64 n; | ||
| 11 |
1/2✓ Branch 1 taken 701129 times.
✗ Branch 2 not taken.
|
701129 | std::cin >> n; |
| 12 |
4/6✓ Branch 1 taken 122185 times.
✓ Branch 2 taken 578944 times.
✓ Branch 4 taken 701129 times.
✗ Branch 5 not taken.
✓ Branch 7 taken 701129 times.
✗ Branch 8 not taken.
|
701129 | std::cout << (is_prime(n) ? "Yes" : "No") << '\n'; |
| 13 | } | ||
| 14 | 12 | return 0; | |
| 15 | } | ||
| 16 |