Submission #1246817

---

Source Code Expand

#include <iostream>

using namespace std;

bool hh(long long int n) {
	long long int k = 0;
	while (n != 0) {
		k += n % 10;
		n /= 10;
	}
	if (k % 3 != 0) {
		return true;
	}
	return false;
}

int main() {
	long long int n;
	cin >> n;
	bool h = true;
	for (long long int i = 2; i*i <= n; i++) {
		if (n % i == 0) {
			h = false;
			break;
		}
	}
	if (n == 1) {
		cout << "Not Prime" << endl;
	} else if (h) {
		cout << "Prime" << endl;
	}
	else {
		long long int k = n % 10;
		if (k % 2 != 0 && k != 5) {
			if (hh(n)) {
				cout << "Prime" << endl;
			}
			else {
				cout << "Not Prime" << endl;
			}
		}
		else {
			cout << "Not Prime" << endl;
		}
	}
	return 0;
}

Submission Info

Judge Result