in contests/arc044/arc044_a.rs [14:55]
fn main() {
input! {
N: u64
}
if N == 1 {
println!("Not Prime");
return;
}
for i in 2..N {
if N % i == 0 {
if N == i {
println!("Prime");
return;
}
}
}
let digit = get_digit(N);
let first = N - (N / (10_u64.pow(digit - 1)) * 10);
let is_five = first == 5;
let is_even = first % 2 == 0;
if is_even || is_five {
println!("Not Prime");
return;
}
let mut n = N;
let mut sum = 0;
for i in 1..digit {
let first = N - (N / (10_u64.pow(digit - i)) * 10);
sum += first;
n /= 10;
}
if (sum + n) % 3 == 0 {
println!("Not Prime");
return;
}
println!("Prime");
}