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 **。 –