源代码:
import java.util.Scanner;
public class Prime {
public int isPrime(long a){
if(a==1) return 0;
for(long i=2;i<=Math.sqrt(a);i++){
if(a%i==0)
return 0;
}
return 1;
}
public static void main(String args[]){
int n;
Scanner k=new Scanner(System.in);
System.out.println("请输入一个正整数");
n=k.nextInt();
Prime p=new Prime();
System.out.println(p.isPrime(n));
}
}