Submission #1164190

---

Source Code Expand

#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cassert>
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n) FOR(i,0,n)
#define rep(i,n) FOR(i,0,n)
#define DEBUG(x) cout<<#x<<": "<<x<<endl
#define vint vector<int>
#define vdouble vector<double>
#define vstring vector<string>
using namespace std;

#include<map>
#include<set>
#include<queue>

typedef long long ll;
typedef unsigned long long ull;

const int MAX_N = 1000000;

string ans(int N){
    if(N == 1) return "Not Prime";
    if(N == 2 || N == 3 || N == 5) return "Prime";

    if(N % 3 == 0) return "Not Prime";
    int n = N % 10;
    if(n == 2 || n == 4 || n == 6 || n == 8 || n == 0) return "Not Prime";
    if(n == 5 ) return "Not Prime";
    return "Prime";

}
int main() {
    int N;
    cin >> N;

    cout << ans(N) << endl;
}

Submission Info

Judge Result