import java.util.Scanner;
public class JavaApplication1 {
public static void main(String[] args) {
Scanner kboard = new Scanner(System.in);
int n = 0;
int i = 1;
System.out.println("Enter a positive number");
n = kboard.nextInt();
System.out.print("The Prime Factors of " + n + " are : ");
value = 2;
while (n > 1) {
i = 1;
if (n % i != 0){
i = 1;
i=i+1;
if(n % i == 0){
System.out.println(" "+ i);
}
}
else {
System.out.print("1 and " + n);
break;
}
}
}
}
这是我的计划,我开始编码一个月左右前,但该程序只给1和输出,而不是素数因子的数量。总理分解为
一旦你发现n可以被i整除,你会在哪里减少n?你也应该从2开始** i **。 –