test/cpv/library-checker-number_theory/min_of_mod_of_linear.cpp
| Line | Branch | Exec | Source |
|---|---|---|---|
| 1 | // competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/min_of_mod_of_linear | ||
| 2 | #include "../../../src/math/min_mod_linear/lib.hpp" | ||
| 3 | |||
| 4 | using namespace tifa_libs; | ||
| 5 | 17 | int main() { | |
| 6 |
1/2✓ Branch 2 taken 17 times.
✗ Branch 3 not taken.
|
17 | std::cin.tie(nullptr)->std::ios::sync_with_stdio(false); |
| 7 | u32 t; | ||
| 8 |
1/2✓ Branch 1 taken 17 times.
✗ Branch 2 not taken.
|
17 | std::cin >> t; |
| 9 |
2/2✓ Branch 0 taken 1485614 times.
✓ Branch 1 taken 17 times.
|
1485631 | while (t--) { |
| 10 | u32 n, m, a, b; | ||
| 11 |
4/8✓ Branch 1 taken 1485614 times.
✗ Branch 2 not taken.
✓ Branch 4 taken 1485614 times.
✗ Branch 5 not taken.
✓ Branch 7 taken 1485614 times.
✗ Branch 8 not taken.
✓ Branch 10 taken 1485614 times.
✗ Branch 11 not taken.
|
1485614 | std::cin >> n >> m >> a >> b; |
| 12 |
2/4✓ Branch 2 taken 1485614 times.
✗ Branch 3 not taken.
✓ Branch 5 taken 1485614 times.
✗ Branch 6 not taken.
|
1485614 | std::cout << min_mod_linear(n, m, a, b) << '\n'; |
| 13 | } | ||
| 14 | 17 | return 0; | |
| 15 | } | ||
| 16 |