Codeforces Round #142 (Div. 2) B - T-primes_we know that prime numbers are positive integers t-CSDN博客

本文链接：https://blog.csdn.net/xzf19930910/article/details/22876569

We know that prime numbers are positive integers that have exactly two distinct positive divisors. Similarly, we'll call a positive integert Т-prime, if t has exactly three distinct positive divisors.

You are given an array of n positive integers. For each of them determine whether it is Т-prime or not.

Input

The first line contains a single positive integer, n (1 ≤ n ≤ 105), showing how many numbers are in the array. The next line contains nspace-separated integers xi (1 ≤ xi ≤ 1012).

Please, do not use the %lld specifier to read or write 64-bit integers in С++. It is advised to use the cin, cout streams or the %I64dspecifier.

Output

Print n lines: the i-th line should contain "YES" (without the quotes), if number xi is Т-prime, and "NO" (without the quotes), if it isn't.

   Sample test(s) 
 

     input 
   
3
4 5 6

     output 
   
YES
NO
NO

Note

The given test has three numbers. The first number 4 has exactly three divisors — 1, 2 and 4, thus the answer for this number is "YES". The second number 5 has two divisors (1 and 5), and the third number 6 has four divisors (1, 2, 3, 6), hence the answer for them is "NO".

题意：只含有三个因子的数称为T素数，只有一个数是某个素数的平方才是T素数。

代码：

#include<iostream>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<cstdio>
using namespace std;
int f[1000005],i,j;
long long m,n;
int main()
{
    for(i=1;i<=1000000;i++)
      f[i]=1;
   for(i=2;i<=1000;i++)
    if(f[i]==1)
     for(j=i+i;j<=1000000;j+=i)
      f[j]=0;
   cin>>m;
  while(m--)
   {
      cin>>n;
    if(n<=3) {cout<<"NO"<<endl; continue;}
    long long t=(long long)sqrt(n*1.0);
   int flag=1;
     for(i=t-1;i<=t+1;i++)
      if(n%i==0&&f[i]==1&&n/i==i)
         {
             cout<<"YES"<<endl; flag=0; break;
         }
      if(flag==1)
        cout<<"NO"<<endl;
  }

    return 0;
}