Submission #1519468

---

Source Code Expand

#include <map>
#include <set>
#include <list>
#include <cmath>
#include <deque>
#include <queue>
#include <stack>
#include <cstdio>
#include <string>
#include <vector>
#include <complex>
#include <cstdlib>
#include <cstring>
#include <numeric>
#include <utility>
#include <iostream>
#include <algorithm>
#include <functional>
#include <unordered_map>
#include <unordered_set>

using namespace std;

#define ll long long
#define ull unsigned long long
#define INF (1 << 29)
#define LLINF (1LL << 61)
#define MOD7 1000000007
#define MOD9 1000000009
#define eps 1e-9
#define P pair<int, int>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pul pair<ull, ull>
#define all(a) (a).begin(), (a).end()
#define FOR(i,a,b) for (int i=(a);i<(b);++i)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);--i)
#define REP(i,n) for (int i=0;i<(n);++i)
#define RREP(i,n) for (int i=(n)-1;i>=0;--i)

void YES() { cout << "YES" << endl; }
void NO() { cout << "NO" << endl; }
void Yes() { cout << "Yes" << endl; }
void No() { cout << "No" << endl; }
void yes() { cout << "yes" << endl; }
void no() { cout << "no" << endl; }

template<class T>
vector<T> getPrime(T n) {
	T k = sqrt(n);
	vector<T> dst;
	vector<bool> used(n + 1);
	for (T i = 2; i <= k; ++i) {
		if (used[i] == false) {
			for (T j = i * 2; j <= n; j += i) {
				used[j] = true;
			}
		}
	}
	for (T i = 2; i <= n; ++i) {
		if (used[i] == false) {
			dst.push_back(i);
		}
	}

	return dst;
}

template<class T>
bool isPrime(T n) {
	if (n == 2)
		return true;

	if (n < 2 || n % 2 == 0)
		return false;

	for (T i = 3, k = sqrt(n); i <= k; i += 2) {
		if (n % i == 0)
			return false;
	}

	return true;
}

int main() {
	int n;
	cin >> n;
	if (isPrime(n))
		YES();
	else
		NO();

	return 0;
}

Submission Info

Judge Result