// Problem#: 1500
// Author#: Reid Chan
#include <iostream>
#include <cmath>
using namespace std;
bool isPrime(int n)
{
for (int i = 2; i <= sqrt(n); ++i) {
if (n % i == 0) {
return false;
}
}
return true;
}
int main() {
int num;
while (cin >> num && num != 0) {
if (isPrime(num)) {
cout << 0 << endl;
continue;
}
int upper = ++num;
int lower = --num;
while (!isPrime(upper)) {
++upper;
}
while (!isPrime(lower)) {
--lower;
}
cout << upper - lower << endl;
}
return 0;
}
Sicily 1500. Prime Gap
最新推荐文章于 2015-07-11 16:06:00 发布