Submission #1655331

---

Source Code Expand

#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cctype>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define ll long long
#define imfor(i, n) for(int i = 0; i < n; i++)
using namespace std;
ll MOD = 1000000007;

int main() {
    ll n;
    cin >> n;
    if (n == 1) {
        cout << "Not Prime" << endl;
    }
    else if (n == 2 && n == 3 && n == 5) {
        cout << "Prime" << endl;
    }
    else if (n % 2 == 0 || n % 3 == 0 || n % 5 == 0) {
        cout << "Not Prime" << endl;
    }
    else {
        cout << "Prime" << endl;
    }
}

Submission Info

Judge Result