Algorithm-and-data-structure/tprime.cpp at master · Akram1871/Algorithm-and-data-structure · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
#include<bits/stdc++.h>
using namespace std;

bool prime[1000006];
set<long long>s;

void seive()
{
   long long int i,j,k;
    memset(prime,1,sizeof(prime));
    for(i=4;i<=1000006;i+=2)
        prime[i]=0;
 prime[1]=0;
 prime[2]=1;
    k=sqrt(1000006);
    for(i=3;i<=k;i+=2)
    {
        if(prime[i])
        {
            for(j=i*i;j<=1000006;j+=i)
            {
                prime[j]=0;
            }
        }
    }s.insert(4);
    for(i=3;i<=1000006;i+=2)
    {
       if(prime[i])
            s.insert(i*i);
    }

}
int main()
{
    int n,i;
    cin>>n;
    long long int x;
    seive();
    for(i=0;i<n;i++)
    {
        cin>>x;
        set<long long>::iterator it;
        it =s.find(x);
        if(it!=s.end())
            cout<<"YES\n";
        else
            cout<<"NO\n";

    }
}