题解 | #素数判定#

#include <iostream>
#include <cmath>

using namespace std;

bool isPrim (int n){
	if (n == 0 || n == 1){
		return false;
	}else{
		for (int i = 2; i <= sqrt(n); i++){
			if (n % i == 0){
				return false;
			}
		}
		return true;
	}
}

int main () {
	int n;
	while (cin >> n){
		if (isPrim(n)){
			cout << "yes" << endl;
		}else{
			cout << "no" << endl;
		}
	}
	return 0;
}