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