LanQiaoTestCodes/素数的判断.java

26 lines
502 B
Java
Raw Normal View History

2023-04-23 12:34:32 +00:00
package Course_Codes;
import java.util.Scanner;
public class <EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ж<EFBFBD> {
public static void main(String[] args) {
Scanner sc=new Scanner(System.in);
while(sc.hasNext()) {
int n=sc.nextInt();
System.out.println(isprime(n)?"Yes":"No");
}
}
public static Boolean isprime(int n) {
//<2F>ų<EFBFBD><C5B3><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>0 1
if(n<1)
return false;
//i*i<n <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD>2<EFBFBD><32><EFBFBD><EFBFBD><6E><C8AB><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ֻ<EFBFBD><D6BB><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>һ<EFBFBD><EFBFBD>ɣ<EFBFBD>
for(int i=2;i*i<n;i++)
if(n%i==0)
return false;
return true;
}
}