finds the list of prime numbers from 2..n, given n.

prime.rs

use std::io;

fn find_prime(n:i32) -> Vec<i32>{
    let mut prime_list: Vec<i32> = Vec::new();
    let mut flag:bool;
    for i in 2..n{
        flag = false;
        for j in 2..(i / 2 + 1){
            if i%j == 0 {
                flag = true;
                break;
            }
        }
        if flag == false {
            prime_list.push(i);
        }
    }
    return prime_list;
}


fn main(){
    let mut buff = String::new();
    io::stdin().read_line(&mut buff).expect("Read line error");
    let n:i32 = buff.trim().parse::<i32>().unwrap();
    let result = find_prime(n);
    for val in &result{
        print!("{} ", val);
    }
    println!();

}