rust(7)-循环,求素数(1)

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);	    
	}	
}

    


    
PS F:\learn\rustlearn> rustc learn1.rs
PS F:\learn\rustlearn> .\learn1.exe
47是素数
13是素数
发布了385 篇原创文章 · 获赞 13 · 访问量 5万+

猜你喜欢

转载自blog.csdn.net/AI_LX/article/details/104503587