HDOJ 2012 素数判定

#include<iostream>

using namespace std;

bool isPrime(int x) {
    if (x <= 1) return false;
    int sqr = (int)sqrt(1.0*x);
    for (int i = 2;i <= sqr;++i) {
        if (x%i == 0) {
            return false;
        }
    }
    return true;
}

int main() {
    int x, y;
    while (cin >> x && cin >> y && (!(x == 0 && y == 0))) {
        int i;
        for (i = x;i <= y;i++) {
            int a = i * i + i + 41;
            if (!isPrime(a)) {
                cout << "Sorry" << endl;
                break;
            }
        }
        if (i == y + 1) cout << "OK" << endl;
    }
    return 0;
}

 

转载于:https://www.cnblogs.com/Mered1th/p/10559533.html