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

use crate::Solution;
use pmath::digits::is_palindrome;

problem!(Problem0004, 4, "Largest Palindrome Product");

impl Solution for Problem0004 {
    fn solve(&self) -> String {
        let mut largest_palindrome: u64 = 0;

        for fact1 in 100..1000 {
            for fact2 in fact1..1000 {
                let product = fact1 * fact2;
                if is_palindrome(product, 10) && (product > largest_palindrome) {
                    largest_palindrome = product;
                }
            }
        }

        largest_palindrome.to_string()
    }
}