b.rs

fn solve_b() {
    let start : i64 = 65 * 100 + 100000;
    let end = start + 17000 + 17;
    let sqrt = |n: i64| (n as f64).sqrt() as i64;
    let not_prime = |n: i64| (2..sqrt(n)+1).any(|v| n%v==0);
    let p : usize = (start..end)
        .filter(|n| (n-start)%17==0)
        .filter(|n| not_prime(*n))
        .count();
    println!("{}", p);
}