/* Howling Primes A howling prime is a prime number if the sum of its digits is also a prime number. For Example: Input:113 Output: true (113 is a prime number, 1+1+3=5 is also a prime number) Input: 89 Output: true (89 is a prime number, 8+9=17 is also a prime number) Input: 19 Output: false (19 is a prime number, but 1+9=10 is not a prime number) Write a program to check if the user input is a howling prime or not. --------------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 #define word std::string #define arata std::cout<< #define lista std::vector #define Unicorn int main() auto prime = [](int n){ if(n==3 || n==2) 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; } lista range(word s){ int sp,l(s.length()); for(int i(0);i!=l;i++){ if((int)s.at(i)==32){ sp=i; break; } } lista v; v.insert(v.end(),{stoi(s.substr(0,sp)),stoi(s.substr(sp+1))}); return v; } int howling(int n){ if(n<=10) return prime(n)? 1:0; word s = std::to_string(n); int sum(0); for(char c:s) sum+=c-'0'; return prime(sum); } Unicorn { try{ word s; getline(std::cin,s); if(has_space(s)){ lista r = range(s); int debut = r[0],fin = r[1]; std::stringstream sr; word res; for(;debut!=fin+1;debut++){ if(howling(debut)) sr<

howling.cpp