rustgym 0.2.0

rustgym solutions
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
44
45
46
47
48
49
50
51
52
53
54

struct Solution;

impl Solution {
    fn prime_palindrome(n: i32) -> i32 {
        if 8 <= n && n <= 11 {
            return 11;
        }
        for i in 1..100_000 {
            let mut x: Vec<char> = format!("{}", i).chars().collect();
            let mut y = x.clone();
            y.reverse();
            x.extend(y.iter().skip(1));
            let s: String = x.iter().collect();
            let v = s.parse::<i32>().unwrap();
            if v < n {
                continue;
            }
            if Self::is_prime(v) {
                return v;
            }
        }
        0
    }
    fn is_prime(x: i32) -> bool {
        if x < 2 || x % 2 == 0 {
            return x == 2;
        }
        let mut i = 3;
        while i * i <= x {
            if x % i == 0 {
                return false;
            } else {
                i += 2;
            }
        }
        true
    }
}

#[test]
fn test() {
    let n = 6;
    let res = 7;
    assert_eq!(Solution::prime_palindrome(n), res);
    let n = 8;
    let res = 11;
    assert_eq!(Solution::prime_palindrome(n), res);
    let n = 13;
    let res = 101;
    assert_eq!(Solution::prime_palindrome(n), res);
    let n = 9_989_900;
    let res = 100_030_001;
    assert_eq!(Solution::prime_palindrome(n), res);
}