test/cpv/library-checker-number_theory/enumerate_quotients.cpp
| Line | Branch | Exec | Source |
|---|---|---|---|
| 1 | // competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/enumerate_quotients | ||
| 2 | #include "../../../src/io/container/lib.hpp" | ||
| 3 | #include "../../../src/math/do_quot/lib.hpp" | ||
| 4 | |||
| 5 | using namespace tifa_libs; | ||
| 6 | 26 | int main() { | |
| 7 |
1/2✓ Branch 2 taken 26 times.
✗ Branch 3 not taken.
|
26 | std::cin.tie(nullptr)->std::ios::sync_with_stdio(false); |
| 8 | u64 n; | ||
| 9 |
1/2✓ Branch 1 taken 26 times.
✗ Branch 2 not taken.
|
26 | std::cin >> n; |
| 10 | 26 | vecuu ans; | |
| 11 | 14830373 | do_quot(n, [&ans](u64, u64, u64 q) { ans.push_back(q); }); | |
| 12 |
1/2✓ Branch 1 taken 26 times.
✗ Branch 2 not taken.
|
26 | std::ranges::sort(ans); |
| 13 |
2/4✓ Branch 2 taken 26 times.
✗ Branch 3 not taken.
✓ Branch 5 taken 26 times.
✗ Branch 6 not taken.
|
26 | std::cout << ans.size() << '\n'; |
| 14 |
1/2✓ Branch 2 taken 26 times.
✗ Branch 3 not taken.
|
26 | std::cout << ans << '\n'; |
| 15 | 26 | return 0; | |
| 16 | 26 | } | |
| 17 |