import java.util.*;
class Prime{//注意无括号()
private int m=0;
public Prime(int m) {
this.m=m;
}
//判断是否是素数:除了1和它本身外,不能被其他自然数整除(除0以外)的数为素数,否则为合数
public String judge(int m)
{
String a="true";
String b="flase";
int flag=1;//flag=1是素数
if(m<2) flag=0;
for(int i=2;i<=Math.sqrt(m);i++)
{
if(m%i==0)
{ flag=0;//只要有一个数不整除,不是素数,跳出循环
break;}
}
if(flag==1) {return a;}
else {return b;}
}
}
public class Main {
public static void main(String[] args) {
// TODO Auto-generated method stub
//write your code here
Scanner scanner=new Scanner(System.in);
int m=scanner.nextInt();
Prime obj=new Prime(m);
if(obj.judge(m).equals("true")) {
System.out.println("YES");
}
else
System.out.println("NO");
}
}
JAVA code to determine whether it is a prime number
Guess you like
Origin http://43.154.161.224:23101/article/api/json?id=325532636&siteId=291194637
Recommended
Ranking