Submission #1841493

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;

typedef unsigned long long ll;

bool is_prime(ll n){
    for(int i = 2 ; i * i <= n ; i++){
        if(n % i == 0) return false;
    }
    if(n == 1) return false;
    else
        return true;
}

bool looks_Prime(ll n){
    
    if(n == 1) return false;

    if((n % 2 != 0) && (n % 5 != 0) && (n % 3 != 0))
        return true;
    else
        return false;
}

int main(){
    int n; cin >> n;
    
    if(is_prime(n) == true){
        cout << "Prime" << endl;
    }
    
    else if(looks_Prime(n) == true){
        cout << "Prime" << endl;
    }
    
    else
        cout << "Not Prime" << endl;
    
}

Submission Info

Judge Result