Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<bits/stdc++.h>
- #define ll long long int
- using namespace std;
- long long int prime[1000001];
- int main()
- {
- ll n,a;
- cin>>a;
- prime[1] = 1;
- for(ll i = 2;i<=1000000;i++)
- {
- if(prime[i] == 0)
- {
- for(ll j = i+i;j<=1000000;j+=i)
- {
- prime[j] = 1;
- }
- }
- }
- for(ll i=0;i<a;i++)
- {
- cin>>n;
- ll sqr=0;
- sqr = sqrt(n);
- if(sqr*sqr==n&&prime[sqr]==0)
- {
- cout<<"YES"<<endl;
- }
- else
- {
- cout<<"NO"<<endl;
- }
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement