class PrimeNumberGenerator {
private:
int currentValue = 1;
bool isPrime(int val) {
for (int i = 2; i * i <= val; i++) {
if (val % i == 0) {
return false;
}
}
return true;
}
public:
explicit PrimeNumberGenerator(int start) {
currentValue = start > 2 ? start : 2;
}
int GetNextPrime() {
while (!isPrime(currentValue)) {
currentValue++;
}
currentValue++;
return currentValue - 1;
}
};