peuler 0.1.0

A Rust crate with solutions to the Project Euler problems
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
38
39
40
41
42
43

use crate::Solution;
use malachite::Natural;
use malachite::base::num::arithmetic::traits::PowerOf2;
use malachite::base::num::conversion::traits::Digits;

problem!(Problem0016, 16, "Power Digit Sum");

impl Solution for Problem0016 {
    fn solve(&self) -> String {
        Natural::power_of_2(1000)
            .to_digits_desc(&10)
            .into_iter()
            .sum::<u64>()
            .to_string()
    }
}

// this is a slower, pen and paper style solution
/*
fn solve_manual() -> String {
    let mut working_num: Vec<u64> = vec![1];
    let mut transfer: u64 = 0;
    for _ in 1..=1000 {
        for j in (0..working_num.len()).rev() {
            let working_product: u64 = (working_num[j] * 2) + transfer;
            working_num[j] = working_product % 10;
            transfer = working_product / 10;
        }
        while transfer != 0 {
            working_num.insert(0, transfer % 10);
            transfer /= 10;
        }
    }


    let mut sum: u64 = 0;
    for i in &working_num {
        sum += i;
    }

    sum.to_string()
}
*/