package shiyan; import java.util.Scanner; import com.student; import static java.lang.Math.pow; import static java.lang.Math.sqrt; public class DEMO { public static void main(String[] args) { Scanner input = new Scanner(System.in); // code here int count=input.nextInt(); long[] nums=new long[count]; for(int i=0;i<nums.length;i++){ nums[i]=input.nextLong(); } for(int i=0;i<nums.length;i++){ boolean b=is(nums[i]); if(b==false) System.out.println("NO"); else System.out.println("YES"); } input.close(); } public static boolean is(long n) { if (n == 1) return false; else { long tmp = (long) sqrt(n); if (pow(tmp, 2) != n) return false; for (long i = 2; i < sqrt(tmp); i++) { if (n % i == 0) return false; } return true; } } }
08-27
2984
![](https://csdnimg.cn/release/blogv2/dist/pc/img/readCountWhite.png)
09-04
876
![](https://csdnimg.cn/release/blogv2/dist/pc/img/readCountWhite.png)
08-24