use std::i32;
pub fn is_div(n1:i32,n2:i32)->bool{
if n1%n2==0 {
return true;
}
else{
return false;
}
}
pub fn is_prime_number(num:i32)->bool{
let y1=num as f32;
let y2=y1.sqrt() as i32 +1;
for x in 2..y2 {
if is_div(num,x){
return false;
}
}
return true;
}
fn main() {
let x=47;
let y=13;
let z=25;
if is_prime_number(x){
println!("{}是素数",x);
}
if is_prime_number(y){
println!("{}是素数",y);
}
if is_prime_number(z){
println!("{}是素数",z);
}
}