问题:完善下列代码,根据用户输入判断其是否为素数 import java.util.Scanner; public class Prime_1 { public static void main(String[] args) { Scanner in = new Scanner(System.in); int n = in.nextInt(); int isPrime = 1; for(int i = 2;i { if(n%i == 0) { isPrime = 0; 2 } } if( isPrime == 1) { System.out.println(n+"是素数"); } else { System.out.println(n+"不是素数"); } } }