acm 0.1.3

Arithmetic congruence monoid implementation in Rust
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19

use crate::factorize;

/// Returns the integer divisors of an integer.
///
/// # Examples
/// ```
/// assert_eq!(acm::divisors(60), [1, 2, 4, 3, 6, 12, 5, 10, 20, 15, 30, 60]);
/// ```
pub fn divisors(n: u32) -> Vec<u32> {
    let mut divisors = vec![1];
    for (factor, m) in factorize(n) {
        for d in divisors.clone() {
            for p in 1..m + 1 {
                divisors.push(d * factor.pow(p));
            }
        }
    }
    divisors
}