test/cpv/aizu-ntl/ntl_1_b.mod.cpp
| Line | Branch | Exec | Source |
|---|---|---|---|
| 1 | // competitive-verifier: PROBLEM https://onlinejudge.u-aizu.ac.jp/courses/library/6/NTL/all/NTL_1_B | ||
| 2 | #include "../../../src/math/qpow/mod/lib.hpp" | ||
| 3 | |||
| 4 | using namespace tifa_libs; | ||
| 5 | CEXP i64 MOD = 1'000'000'007; | ||
| 6 | |||
| 7 | 20 | int main() { | |
| 8 |
1/2✓ Branch 2 taken 20 times.
✗ Branch 3 not taken.
|
20 | std::cin.tie(nullptr)->std::ios::sync_with_stdio(false); |
| 9 | u64 m, n; | ||
| 10 |
2/4✓ Branch 1 taken 20 times.
✗ Branch 2 not taken.
✓ Branch 4 taken 20 times.
✗ Branch 5 not taken.
|
20 | std::cin >> m >> n; |
| 11 |
2/4✓ Branch 2 taken 20 times.
✗ Branch 3 not taken.
✓ Branch 5 taken 20 times.
✗ Branch 6 not taken.
|
20 | std::cout << qpow_mod(m, n, MOD) << '\n'; |
| 12 | 20 | return 0; | |
| 13 | } | ||
| 14 |