AI coding assistant for busy programmers

All

JavaScript

How to print all prime numbers up to a given number in Rust

Rust

fn main() {
    let mut num = 0;
    let mut is_prime = true;

println!("Enter a number: ");
    io::stdin().read_line(&mut num).expect("Failed to read line");

let num: u32 = num.trim().parse().expect("Please type a number!");

for i in 2..num {
        if num % i == 0 {
            is_prime = false;
            break;
        }
    }

if is_prime {
        println!("{} is a prime number", num);
    } else {
        println!("{} is not a prime number", num);
    }

// Print all prime numbers up to a given number:

for n in 2..num {  // start from 2 because 1 is not a prime number

let mut i = 2;  // start from 2 because 1 is not a prime number

while i <= (n / 2) {  // loop until the half of the given number

if n % i == 0 {   // check if the given number is divisible by any other numbers except 1 and itself. If yes, then it's not a prime number.

break;       // exit the loop if it's divisible by any other numbers except 1 and itself.

} else if i == (n / 2) && n % i != 0 {   // check if we have reached half of the given number and it's not divisible by any other numbers except 1 and itself. If yes, then it's a prime number.

println!("{}", n);   // print the current value of 'n' as it's a prime number.

} else {   // increment 'i' by 1 to check next divisor in next iteration of loop.

i += 1;

}

}     
}

🤖 Code Explanation

The code is asking the user to input a number, then it checks if that number is a prime number or not. Finally, it prints out all the prime numbers up to the number that the user input.

AI coding assistant for busy programmers

How to print all prime numbers up to a given number in Rust

Rust

🤖 Code Explanation

More problems solved in Rust