/*Emirp Numbers task counting all prime and empir numbers in range [0,UPPER_BOARD] Input the upper board of search(<100000 with this algorithm in soloLearn)*/ //I think most resources spending to find primes and it find only numbers lower than 200 000 without time limit exception. But its not enough to check empirs upper 200 000. If you know how to improve result let me know in comments ;) I think it will be great to find all primes and empirs above 1 000 000 in cpp - sololearn environment. #include #include #include using namespace std; typedef unsigned long uint; //check num for being prime by dividing to all another prime numbers of vector bool isPrime(uint &num,vector vec) { for(int i=0;i& vec) { for(uint mun:vec)if(num==mun)return true; return false; } //return reverse number uint revers(uint num) {uint n=num%10, np; for(int i=1;;i++) { np=num/pow(10,i); if(np<=0)return n; n=np%10+n*10; } } int main() { //uint usize=pow(2,sizeof(uint)*8)-1; //cout<<"maximum number of this data type ="<>UPPER_BOARD; if(UPPER_BOARD>100000){cout<<"too much, should be less than 100 000"< primes; uint num=4; primes.push_back(2); primes.push_back(3); int upperPrime; do//fill primes vector in given range { if(isPrime(num,primes)){ //cout<

Empir Numbers