Struct PrimePowerBinomial 

struct PrimePowerBinomial {
    p: u64,
    e: u32,
    m: u64,
    size: usize,
    fact: Vec<u64>,
    inv_fact: Vec<u64>,
    delta: u64,
    bp: BarrettReduction<u64>,
    bm: BarrettReduction<u64>,
    bm128: BarrettReduction<u128>,
}

Fields

p: u64

e: u32

m: u64

size: usize

fact: Vec<u64>

inv_fact: Vec<u64>

delta: u64

bp: BarrettReduction<u64>

bm: BarrettReduction<u64>

bm128: BarrettReduction<u128>

Implementations

impl PrimePowerBinomial

fn new(p: u64, e: u32, max_n: u64) -> Self

Examples found in repository

crates/competitive/src/math/arbitrary_mod_binomial.rs (line 217)

    pub fn new(modulus: u64, max_n: u64) -> Self {
        assert_ne!(modulus, 0);
        let ppbs = prime_factors(modulus)
            .into_iter()
            .map(|(p, e)| PrimePowerBinomial::new(p, e, max_n))
            .collect();
        Self { ppbs }
    }

fn combination(&self, n: u64, k: u64) -> u64

Examples found in repository

crates/competitive/src/math/arbitrary_mod_binomial.rs (line 226)

    pub fn combination(&self, n: u64, k: u64) -> u64 {
        solve_simultaneous_linear_congruence(
            self.ppbs
                .iter()
                .map(|ppb| (1u64, ppb.combination(n, k), ppb.m)),
        )
        .unwrap()
        .0
    }

Trait Implementations

impl Debug for PrimePowerBinomial

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.