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