Найти в массиве числа, которые являются квадратами простых

#include <vector>
#include <cstdlib>
#include <ctime>
#include <algorithm>
#include <iterator>
#include <cmath>
#include <iostream>
 
bool isPrime(unsigned number) {
  if (number < 2) {
    return false;
  }
  if (number == 2) {
    return true;
  }
  for (unsigned i = 3; i <= sqrt(number); ++++i) {
    if (number % i == 0) {
      return false;
    }
  }
  return number % 2 != 0;
}
 
bool isSquareRootOfPrime(unsigned number, double epsilon = 0.000001) {
  int root = sqrt(number);
  if (sqrt(number) - root > epsilon) {
    return false;
  }
  return isPrime(root);
}
 
struct RandomGenerator {
  int min;
  int max;
  RandomGenerator(int min, int max) : min(min), max(max) {}
  int operator()() {
    return min + (rand() % (max - min));
  }
};
 
int main(int, char**) {
  srand(time(0));
 
  RandomGenerator generator(0, 20001);
  std::vector<unsigned> values;
  std::generate_n(std::back_inserter(values), 10000, generator);
 
  for (auto i = values.begin(); i != values.end(); ++i) {
    if (isSquareRootOfPrime(*i)) {
      std::cout << "Number " << *i << " is square root of prime " << (int)sqrt(*i) << std::endl;
    }
  }
  
  return 0;
}

#include <cstdlib>
#include <cmath>
#include <vector>
#include <algorithm>
#include <iterator>
#include <iostream>
 
bool is_prime_square(unsigned n)
{
  unsigned sqn = (unsigned) std::sqrt(n);
 
  unsigned factor;
  for (factor = 2; factor <= sqn; ++factor)
    if (n % factor == 0)
      break;
 
  return factor == n / factor;
}
 
int main()
{
  std::vector<unsigned> v(10000);
  std::generate(v.begin(), v.end(), std::rand);
 
  std::cout << "All numbers: ";
  std::copy(v.begin(), v.end(), std::ostream_iterator<unsigned>(std::cout, " "));
  std::cout << std::endl << std::endl;
 
  std::cout << "Prime squares: ";
  std::copy_if(v.begin(), v.end(), std::ostream_iterator<unsigned>(std::cout, " "), is_prime_square);
  std::cout << std::endl;
}

bool is_prime_square(unsigned n)
{
  unsigned sqn = (unsigned) std::sqrt(n);
 
  if (sqn * sqn != n)
    return false;
 
  unsigned factor;
  for (factor = 2; factor <= sqn; ++factor)
    if (n % factor == 0)
      break;
 
  return factor == sqn;
}