完善找素数
见4-2-3 逻辑类型讲过的程序:
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
<span style="white-space:pre"> </span>int n = in.nextInt(); <span style="white-space:pre"> </span>
<span style="white-space:pre"> </span>boolean isPrime = true;
<span style="white-space:pre"> </span>for (int i = 2; i < n ; i++ )
<span style="white-space:pre"> </span>{
<span style="white-space:pre"> </span>if(n % i == 0)
<span style="white-space:pre"> </span>{
<span style="white-space:pre"> </span>isPrime = false;
<span style="white-space:pre"> </span>System.out.println(n+"不是素数,i="+i);
<span style="white-space:pre"> </span>break;
<span style="white-space:pre"> </span>}
<span style="white-space:pre"> </span>}
<span style="white-space:pre"> </span>if( isPrime )
<span style="white-space:pre"> </span>{
<span style="white-space:pre"> </span>System.out.println(n+"是素数");
<span style="white-space:pre"> </span>}
<span style="white-space:pre"> </span>else
<span style="white-space:pre"> </span>{
<span style="white-space:pre"> </span>System.out.println(n+"不是素数");
<span style="white-space:pre"> </span>}