fn print_prime_factors(mut n: i32) {
let mut div = 2;
while n != 0 {
if n % div != 0 {
div += 1;
} else {
print!("{}, ", div);
n /= div;
if n == 1 {
break;
}
}
}
println!();
}
fn main() {
let numbers = [124, 288, 1288, 893];
for &n in numbers.iter() {
print_prime_factors(n);
}
}
/*
run:
2, 2, 31,
2, 2, 2, 2, 2, 3, 3,
2, 2, 2, 7, 23,
19, 47,
*/