Submission #1367956

---

Source Code Expand

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
 
vector<int> sieve(int n) {
  vector<int> prime(n);
  for(int i=2; i<n; i++) prime[i]=i;
  for(int i=2; i*i<n; i++) {
    if(prime[i]) {
      for(int j=i*i; j<n; j+=i) prime[j]=0;
    }
  }
  return prime;
}
 
int main() {
  vector<int> prime=sieve(1000001);
  int n;
  while(cin >> n) {
    if(prime[n]) cout << "YES" << endl;
    else cout << "NO" << endl;
  }
  return 0;
}

Submission Info

Judge Result