fork download 
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. const int N=1e5+18;
  4. int main() {
  5. 	vector<bool>isPrime(N+1,1);
  6. 	isPrime[0]=isPrime[1]=false;
  7. 	for(int i=2;i<=N;i++)
  8. 	{
  9. 		if(isPrime[i]==true)
  10. 		{
  11. 			for(int j=2*i;j<=N;j+=i)
  12. 			{
  13. 				isPrime[j]=false;
  14. 			}
  15. 		}
  16. 	}
  17. 	int t;cin>>t;
  18. 	while(t--)
  19. 	{
  20. 		int n;cin>>n;
  21. 		if(isPrime[n]==1)
  22. 		{
  23. 			cout<<"YES"<<"\n";
  24. 		}
  25. 		else
  26. 		{
  27. 			cout<<"NO"<<"\n";
  28. 		}
  29. 	}
  30.  
  31. 	return 0;
  32. }
Success #stdin #stdout 0.01s 5476KB
comments (?)
stdin 
5
20
45
78
9
5
stdout 
NO
NO
NO
NO
YES
https://ideone.com/gpxhjf
language:
C++ (gcc 8.3)
created:
2 years ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!