class PrimeNumberGenerator {
public:
explicit PrimeNumberGenerator(int start) {
prime_number = start;
}
int GetNextPrime() {
bool check = true;
int n = prime_number;
while (check) {
if (IsPrime(n)) {
check = false;
prime_number = n + 1;
}
n++;
}
return n - 1;
}
private:
int prime_number;
bool IsPrime(int n) {
if (n == 1){
return false;
}
int k = 2;
bool check = true;
while (k * k <= n && check) {
check = n % k++ == 0 ? false : true;
}
return check;
}
};