循环素数，帮助发现错误，C++

花费和小时试图找到错误，没有成功:(
解决欧拉问题：http://projecteuler.net/problem=35
看来我的头现在不工作了

代码没有优化，对此感到抱歉（我在这里做错了什么？正确答案是 55，我的程序给了我 22

#include "euler.hpp"
#include <algorithm>
int main() {
    euler::prime_generator<euler::eratosthenes_sieve> gen;
    gen.range(0, 1000000);
    unsigned c = 0; // number of circular primes
    unsigned p = 0; // number of primes (test)
    unsigned prime;
    while(prime = gen.nextPrime()) {
        p++;
        bool ok = true;
        std::vector<unsigned> pv = euler::number2vector(prime);
        if(pv.size() > 1) {
            bool cont = false;
            for(unsigned i = 0; i < pv.size(); ++i) {
                if(pv[i] % 2 == 0) { cont = true; break; }
            }
            if(cont) continue;
            std::sort(pv.begin(), pv.end());
            do {
                if(!gen.isPrime(euler::array2number(&pv[0], pv.size()))) {
                    // was desperate and made this
                    if(euler::isPrime(euler::array2number(&pv[0], pv.size()))) {
                        std::cout << prime << " -> " << euler::array2number(&pv[0], pv.size()) << std::endl;
                    }
                    else ok = false;
                    break;
                }
            } while(std::next_permutation(pv.begin(), pv.end()));
        }
        if(ok) {
            //std::cout << prime << std::endl;
            c++;
        }
        //std::cout << prime << std::endl;
    }
    std::cout << p << " -> " << c << std::endl;
    euler::pause();
}

我使用的几个外部函数

// in class
void range(unsigned lower_bound, unsigned upper_bound) {
    m_lower_bound = lower_bound;
    primes.resize(upper_bound - lower_bound + 1, true);
    for(unsigned i = 0; i < 2 - lower_bound; ++i) primes[i] = false;
    for(unsigned i = 2; i <= sqrt(upper_bound - lower_bound); ++i) {
        if(primes[i]) {
            for(unsigned j = i*i; j <= upper_bound; j += i) {
                primes[j] = false;
            }
        }
    }
}
// in the same class
bool isPrime(unsigned number) {
    return primes[number - m_lower_bound];
}
// in the same class
unsigned nextPrime() {
    for(; next <= m_upper_bound; ++next) {
        if(isPrime(next)) return next++ + m_lower_bound;
    }
    return 0;
}
template <typename T>
T array2number(T * begin, unsigned length) {
    T number = 0;
    unsigned m = 1;
    while(length--) {
        number += begin[length] * m;
        m *= 10;
    }
    return number;
}
template <typename T>
std::vector<T> number2vector(T number) {
    unsigned l = number_length(number);
    std::vector<T> vec(l);
    while(l--) {
        vec[l] = number % 10;
        number /= 10;
    }
    return vec;
}

提前谢谢你！