Submission #1500301

---

Source Code Expand

#include <bits/stdc++.h>
#define rep(n) for (int I = 0; (I) < (n); ++(I) )
#define repeat(i, n) for( int i = 0; (i) < (n); ++(i) )
#define repeat_to(i, n) for( int i = 0; (i) <= (n); ++(i) )
#define repeat_from(i, m, n) for( int i = (m); (i) < (n); ++(i) )
#define repeat_from_to(i, m, n) for( int i = (m); (i) <= (n); ++(i) )
#define repeat_from_reverse(i, m, n) for( int i = (n) - 1; (i) >= (m); --(i) )
#define dump(x) cout << " " << #x << "=" << x
#define vdump(v) for(size_t t=0; t<v.size(); ++t){cout << " " << #v << "[" << t << "]=" << v[t];} cout << endl
using namespace std;
using lint = long long;
using ld = long double;

int main(void) {
    int n; cin >> n;
    
    if (n==1) {cout << "Not Prime" << endl; return 0;}
    if (n==2) {cout << "Prime" << endl; return 0;}
    if (n==3) {cout << "Prime" << endl; return 0;}
    if (n==4) {cout << "Not Prime" << endl; return 0;}
    
    int u = sqrt(n);
    
    // 素数かどうか
    bool is_prime = true;
    repeat_from_to(i, 2, u) {
        if (n % i == 0) {
            is_prime = false;
            break;
        }
    }
    if (is_prime) {cout << "Prime" << endl; return 0;}
    
    // 素数っぽいかどうか
    if (n % 2 != 0 && n % 5 != 0 && n % 3 != 0) {cout << "Prime" << endl; return 0;}
    
    cout << "Not Prime" << endl;
    return 0;
}
        

Submission Info

Judge Result