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