Shared via Rust Playground

playground.rs

// Project Euler Problem 36: Double-base palindromes

fn binary(n: i32) -> String {
    format!("{:b}", n)
}
fn decimal(n: i32) -> String {
    n.to_string()
}

fn is_palindrome(s: String) -> bool {
    let s1 = s.into_bytes();
    let mut s2 = s1.clone();
    s2.reverse();
    s1 == s2
}

fn main() {
    let mut sum = 0;
    for n in 1..1000000 {
        if is_palindrome(binary(n)) && is_palindrome(decimal(n)) {
            //println!("{:b}, {}", n, n);
            sum += n
        }
    }
    println!("{}", sum);

}