test/cpv/library-checker-number_theory/counting_primes.min25.cpp
| Line | Branch | Exec | Source |
|---|---|---|---|
| 1 | // competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/counting_primes | ||
| 2 | #include "../../../src/nt/mfsum/pi/lib.hpp" | ||
| 3 | |||
| 4 | using namespace tifa_libs; | ||
| 5 | 31 | int main() { | |
| 6 |
1/2✓ Branch 2 taken 31 times.
✗ Branch 3 not taken.
|
31 | std::cin.tie(nullptr)->std::ios::sync_with_stdio(false); |
| 7 | u64 n; | ||
| 8 |
1/2✓ Branch 1 taken 31 times.
✗ Branch 2 not taken.
|
31 | std::cin >> n; |
| 9 |
2/4✓ Branch 2 taken 31 times.
✗ Branch 3 not taken.
✓ Branch 5 taken 31 times.
✗ Branch 6 not taken.
|
31 | std::cout << pi_min25(n) << '\n'; |
| 10 | 31 | return 0; | |
| 11 | } | ||
| 12 |