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