/* Emirp Numbers An emirp is a prime number that results in a different prime when its decimal digits are reversed. For example, 13 is an emirp number because both 13 and 31 are prime numbers. For example: Input: 17 Output: true (17 and 71 are prime numbers) Input: 113 Output: true (113 and 311 are prime numbers) Input: 23 Output: false (23 is a prime number, but 32 is not) Write a program to check if the user input is an emirp number or not. Bonus: Print all the emirp numbers in a given range. --------------Important---------------------- If you want a range, enter the lower and the upper bound separated by a space. example: 1 20 If you just want to check for a number, just input your number. example: 12 --------------------------------------------- */ #include #include #include #include #define word std::string #define arata std::cout<< #define lista std::vector auto prime = [](int n){ if(n==2 || n==3) return 1; if(n<2) return 0; for(int i=2;i!=n/2+1;i++){ if(!(n%i)) return 0; } return 1; }; int has_space(word s){ for(char c : s){ if((int)c==32) return 1; } return 0; } int emirp(int n){ if(!prime(n)) return 0; word r = std::to_string(n); reverse(r.begin(),r.end()); return prime(stoi(r)); } lista range(word s){ int l=s.length(), sp; lista v; for(int i=0;i!=l;i++){ if((int)s.at(i)==32){ sp=i; break; } } v.insert(v.end(),{stoi(s.substr(0,sp)),stoi(s.substr(sp+1))}); return v; } int main() { try{ word s; getline(std::cin,s); if(has_space(s)){ lista r = range(s),res; int d=r[0], f=r[1]; for(int i=d;i!=f+1;i++){ if(emirp(i)) res.push_back(i); } if(res.size()){ arata "The emirp numbers between "<

emirp.cpp