Function solve_simultaneous_linear_congruence 

pub fn solve_simultaneous_linear_congruence<T, I>(abm: I) -> Option<(T, T)>
where
    T: Unsigned,
    I: IntoIterator<Item = (T, T, T)>,

return: (y,z)

forall (a,b,m), ax = b mod m, where x = y mod z

Examples found in repository

crates/competitive/src/math/arbitrary_mod_binomial.rs (lines 223-227)

    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
    }