python/TangDou/XiTi/1052.cpp

#include <bits/stdc++.h>

using namespace std;

int main() {
    int n;
    cin >> n;
    if (n < 2) {
        cout << "not prime" << endl;
        return 0;
    }
    bool isPrime = true;
    for (int i = 2; i < n / 2; i++) {
        if (n % i == 0) {
            cout << "not prime" << endl;
            isPrime = false;
            break;
        }
    }
    if (isPrime)
        cout << "prime" << endl;
    return 0;
}