test/cpv/library-checker-enumerative_combinatorics/binomial_coefficient.cpp
| Line | Branch | Exec | Source |
|---|---|---|---|
| 1 | // competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/binomial_coefficient | ||
| 2 | #include "../../../src/comb/exlucas/lib.hpp" | ||
| 3 | #include "../../../src/io/fastin/lib.hpp" | ||
| 4 | #include "../../../src/io/fastout/lib.hpp" | ||
| 5 | |||
| 6 | using namespace tifa_libs; | ||
| 7 | 30 | int main() { | |
| 8 | u32 t, m; | ||
| 9 | 30 | fin_uint >> t >> m; | |
| 10 |
2/2✓ Branch 0 taken 1 time.
✓ Branch 1 taken 29 times.
|
30 | if (m == 1) { |
| 11 |
2/2✓ Branch 1 taken 200000 times.
✓ Branch 2 taken 1 time.
|
200001 | while (t--) fout << "0\n"; |
| 12 | } else { | ||
| 13 | 29 | exlucas mCn(m); | |
| 14 |
2/2✓ Branch 0 taken 5400014 times.
✓ Branch 1 taken 29 times.
|
5400043 | while (t--) { |
| 15 | i64 n, k; | ||
| 16 | 5400014 | fin_uint >> n >> k; | |
| 17 | 5400014 | fout << mCn(n, k) << '\n'; | |
| 18 | } | ||
| 19 | 29 | } | |
| 20 | 30 | return 0; | |
| 21 | } | ||
| 22 |