test/cpv/library-checker-number_theory/factorize.cpp
| Line | Branch | Exec | Source |
|---|---|---|---|
| 1 | // competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/factorize | ||
| 2 | #include "../../../src/io/container/lib.hpp" | ||
| 3 | #include "../../../src/nt/pfactors/lib.hpp" | ||
| 4 | |||
| 5 | using namespace tifa_libs; | ||
| 6 | 31 | int main() { | |
| 7 |
1/2✓ Branch 2 taken 31 times.
✗ Branch 3 not taken.
|
31 | std::cin.tie(nullptr)->std::ios::sync_with_stdio(false); |
| 8 | i64 q; | ||
| 9 |
1/2✓ Branch 1 taken 31 times.
✗ Branch 2 not taken.
|
31 | std::cin >> q; |
| 10 |
2/2✓ Branch 0 taken 2635 times.
✓ Branch 1 taken 31 times.
|
2666 | while (q--) { |
| 11 | u64 a; | ||
| 12 |
1/2✓ Branch 1 taken 2635 times.
✗ Branch 2 not taken.
|
2635 | std::cin >> a; |
| 13 | 2635 | auto ans = pfactors<false>(a); | |
| 14 |
1/2✓ Branch 2 taken 2635 times.
✗ Branch 3 not taken.
|
2635 | std::cout << ans.size(); |
| 15 |
3/4✓ Branch 1 taken 2633 times.
✓ Branch 2 taken 2 times.
✓ Branch 4 taken 2633 times.
✗ Branch 5 not taken.
|
2635 | if (!ans.empty()) std::cout << ' ' << ans; |
| 16 |
1/2✓ Branch 1 taken 2635 times.
✗ Branch 2 not taken.
|
2635 | std::cout << '\n'; |
| 17 | 2635 | } | |
| 18 | 31 | return 0; | |
| 19 | } | ||
| 20 |