import java.util.Scanner;
public class Main{
public static void main(String args[] ){
Scanner sc=new Scanner(System.in);
int n=sc.nextInt();
factor(n);
}
//判断是不是素数
public static boolean isPrime(int n) {
for (int i = 2; i <=n/2; i++) {
if (n%i==0) {
return false;
}
}
return true;
}
public static void factor(int n) {
for (int i = 2; i <=n/2; i++) {
if (n%i==0) {
System.out.print(i+" ");
if (isPrime(n/i)) {
System.out.print(n/i+" ");
}else {
factor(n/i);
}
break;
}
}
}
}
分解质数
最新推荐文章于 2020-11-27 22:54:04 发布