CP-Algorithms Library

This documentation is automatically generated by competitive-verifier/competitive-verifier

View the Project on GitHub cp-algorithms/cp-algorithms-aux

:heavy_check_mark: Binomial Coefficient (Prime Mod) (verify/combi/binom.test.cpp)

Depends on

Code

// @brief Binomial Coefficient (Prime Mod)
#define PROBLEM "https://judge.yosupo.jp/problem/binomial_coefficient_prime_mod"
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2")
#define CP_ALGO_MAXN 1e7
#include "cp-algo/number_theory/modint.hpp"
#include "cp-algo/math/combinatorics.hpp"
#include <bits/stdc++.h>

using namespace std;
using namespace cp_algo;
using namespace math;
using base = dynamic_modint<>;

void solve() {
    int n, r;
    cin >> n >> r;
    cout << binom<base>(n, r) << "\n";
}

signed main() {
    //freopen("input.txt", "r", stdin);
    ios::sync_with_stdio(0);
    cin.tie(0);
    int t = 1;
    cin >> t;
    int m;
    cin >> m;
    base::switch_mod(m);
    while(t--) {
        solve();
    }
}
Traceback (most recent call last):
  File "/home/runner/.local/lib/python3.12/site-packages/competitive_verifier/oj_resolve/resolver.py", line 181, in resolve
    bundled_code = language.bundle(path, basedir=basedir)
                   ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  File "/home/runner/.local/lib/python3.12/site-packages/competitive_verifier/oj/verify/languages/cplusplus.py", line 252, in bundle
    bundler.update(path)
  File "/home/runner/.local/lib/python3.12/site-packages/competitive_verifier/oj/verify/languages/cplusplus_bundle.py", line 327, in update
    assert len(lines) == len(uncommented_lines)
           ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
AssertionError

Test cases

Env Name Status Elapsed Memory
g++ example_00 :heavy_check_mark: AC 55 ms 81 MB
g++ example_01 :heavy_check_mark: AC 58 ms 81 MB
g++ large_random_00 :heavy_check_mark: AC 324 ms 81 MB
g++ large_random_01 :heavy_check_mark: AC 321 ms 81 MB
g++ large_random_02 :heavy_check_mark: AC 317 ms 81 MB
g++ med_random_00 :heavy_check_mark: AC 223 ms 81 MB
g++ med_random_01 :heavy_check_mark: AC 219 ms 81 MB
g++ med_random_02 :heavy_check_mark: AC 220 ms 81 MB
g++ mod1000000007_00 :heavy_check_mark: AC 322 ms 81 MB
g++ mod1000000007_01 :heavy_check_mark: AC 315 ms 81 MB
g++ mod2_00 :heavy_check_mark: AC 187 ms 81 MB
g++ mod2_01 :heavy_check_mark: AC 193 ms 81 MB
g++ mod3_00 :heavy_check_mark: AC 185 ms 81 MB
g++ mod3_01 :heavy_check_mark: AC 182 ms 81 MB
g++ mod998244353_00 :heavy_check_mark: AC 312 ms 81 MB
g++ mod998244353_01 :heavy_check_mark: AC 315 ms 81 MB
g++ mod998244353_maxi_00 :heavy_check_mark: AC 377 ms 81 MB
g++ small_random_00 :heavy_check_mark: AC 181 ms 81 MB
g++ small_random_01 :heavy_check_mark: AC 181 ms 81 MB
g++ small_random_02 :heavy_check_mark: AC 181 ms 81 MB
Back to top page