Skip to main content

prime_factors_flatten

competitive::math

Function prime_factors_flatten 

Source 
pub fn prime_factors_flatten(n: u64) -> Vec<u64>
Examples found in repository?
crates/library_checker/src/number_theory/factorize.rs (line 9)
5pub fn factorize(reader: impl Read, writer: impl Write) {
6    prepare_io!(reader, writer);
7    sc!(q);
8    for a in sv!([u64; iter q]) {
9        let x = prime_factors_flatten(a);
10        pp!(x.len(), @it x);
11    }
12}
More examples
Hide additional examples
crates/competitive/src/math/prime_factors.rs (line 100)
98pub fn prime_factors(n: u64) -> Vec<(u64, u32)> {
99    let mut res = Vec::new();
100    for a in prime_factors_flatten(n) {
101        if let Some((p, len)) = res.last_mut()
102            && p == &a
103        {
104            *len += 1;
105            continue;
106        }
107        res.push((a, 1));
108    }
109    res
110}