test/cpv/library-checker-enumerative_combinatorics/montmort_number_mod.cpp
| Line | Branch | Exec | Source |
|---|---|---|---|
| 1 | // competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/montmort_number_mod | ||
| 2 | #include "../../../src/comb/seq/derange/lib.hpp" | ||
| 3 | #include "../../../src/io/container/lib.hpp" | ||
| 4 | |||
| 5 | using namespace tifa_libs; | ||
| 6 | 10 | int main() { | |
| 7 |
1/2✓ Branch 2 taken 10 times.
✗ Branch 3 not taken.
|
10 | std::cin.tie(nullptr)->std::ios::sync_with_stdio(false); |
| 8 | u32 n, m; | ||
| 9 |
2/4✓ Branch 1 taken 10 times.
✗ Branch 2 not taken.
✓ Branch 4 taken 10 times.
✗ Branch 5 not taken.
|
10 | std::cin >> n >> m; |
| 10 |
1/2✓ Branch 3 taken 10 times.
✗ Branch 4 not taken.
|
10 | std::cout << gen_derange(n, m) << '\n'; |
| 11 | 10 | return 0; | |
| 12 | } | ||
| 13 |