gaussiant 0.8.0

Gaussian integers
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37

//! See https://projecteuler.net/problem=153

use gaussiant::GaussianInt;
use num_traits::Zero;

fn main() {
    let n = 100;
    let mut big_sum = 0;

    for _n in 1..=n {
        let set = gaussiant::get_g_ints(_n);
        let mut divisors = vec![];
        let mut sum = 0;

        for z in set {
            if z != GaussianInt::zero() && z.0.re != 0 {
                if z.divides(GaussianInt::new(_n, 0)) {
                    divisors.push(z);
                    sum += z.0.re;
                    sum += z.0.im;
                    big_sum += z.0.re;
                    big_sum += z.0.im;
                }
            }
        }

        // format divisors as string
        let mut output = String::new();
        for d in divisors {
            output.push_str(&(d.to_string() + " "));
        }

        println!("{_n}: {output} {sum}");
    }

    println!("big sum: {}", big_sum);
}