codeforce B. T-primes （预处理素数）

最新推荐文章于 2021-07-23 23:24:07 发布

饮酒在风里

最新推荐文章于 2021-07-23 23:24:07 发布

阅读量326

点赞数

本文链接：https://blog.csdn.net/qq_43256272/article/details/90415542

版权

B. T-primes

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

We know that prime numbers are positive integers that have exactly two distinct positive divisors. Similarly, we'll call a positive integer t Т-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.

Examples

input

Copy

3
4 5 6

output

Copy

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".

题意：判断一个数是否只有三个因数。1，它本身，以及完全平方根为素数的数。提前打表素数即可，不然会超时。

#include <iostream>
#include <cstring>
#include <vector>
#include <algorithm>
#include <cmath>
#include <set>
#include <cstdio>
#include <map>
using namespace std;
typedef long long ll;
const int MAXN = 2e6+5;
ll  n,m,flag,flag1,ma,mi,ans,sum,T,k;
int a[MAXN],b[MAXN],dp[MAXN];
char c[MAXN];
int mapp[5001][5001];
string str,str1,str2;
set<char>  ss;
vector<char> v;
map<string,int> M;
bool judge(int x){if(x==2||x==3)return false;for(int i=2;i<=sqrt(x);i++){if(x%i==0)return true;}return false;}
struct node
{
    int a,b;
}s[1001];

bool cmp(node x,node y)
{
    if(x.a!=y.a)
        return x.a<y.a;
    else
        return x.b>y.b;
}


int main()
{
    cin>>n;
    memset(a,0,sizeof(a));
    for(int i=0;i<1000002;i++)
    {
        if(!judge(i))
            a[i]=1;
    }
    while(n--)
    {
         cin>>m;
        ll t;
        t=sqrt(m);
        //cout<<t<<endl;
        flag=0;
        if(t*t==m&&t!=m)
        {
            if(a[t]==1)
                flag=1;
        }
        if(flag)
            cout<<"YES"<<endl;
         else
            cout<<"NO"<<endl;

    }
   return 0;
}