/* This code is solution for "Howling Primes" challenge. _______________________________________________________ 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. BONUS: Print all the howling prime numbers in a given range. __________________________________________________________ */ #include #include #include #include template void pOL(messageType message){ std::cout << message; } class storage{ // There is no need to share this containers and methods with derrived class // and main program private: // messages represent as strings std::string modeSHeader = "\nYou choose single number research mode.\n"; std::string modeRHeader = "\nYou choose range numbers research mode.\n"; std::string incorrect = "\nThis input is incorrect.\n"; std::string comeAgain = "\nThat's all for now, run again.\n"; // public: // char answer; // bool mode = true; // bool approved = true; // void openDialog(){ std::cin >> answer; } // void validateDialog(){ // Setting range-search mode if ( (answer == 's') || (answer == 'S') ){ mode = true; pOL(modeSHeader); } // Setting range-search mode else if ( (answer == 'r') || (answer == 'R') ){ mode = false; pOL(modeRHeader); } // Not allow to program work when input invalid else approved = false; // if (!approved) pOL(incorrect); } // virtual void getNumber(){} // virtual void getRange(){} // virtual void operate(){} // virtual void closeDialog(){} // virtual ~storage(){ pOL(comeAgain); } }; class numberRes : public storage { // private: // messages represent as strings for range research dialogs std::string enterNumber = "\nYou entered number for research: "; std::string HowlingPrime = "\nYou enter a Howling prime number.\n"; std::string notPrime = "\nIt's not a prime number.\n"; std::string justPrime = "\nIt's just a prime number, but not Howling((\n"; // unsigned long long int number; // protected: // clock_t prime_start; // clock_t prime_pause; // clock_t time_new; // clock_t start_operate; // unsigned long long int new_point; // std::vector pVec; // bool container, true - prime number, false - not prime bool prime_status = false; // bool container, true - prime number, false - not prime bool sum_status = false; // bool container, true - time error, false - everything fine bool time_failure = false; // Method calculate all primes for end point void getPrimes(unsigned long long int &point){ // temporary container unsigned long long int y = point/11; // first number in the container pVec.push_back(2); pVec.push_back(3); pVec.push_back(5); pVec.push_back(7); pVec.push_back(11); time_failure = false; prime_start = clock(); // calculate prime numbers with odd divisors for (unsigned long long int i = 11; ( ( i <= y ) && !time_failure ); ){ prime_pause = clock() - prime_start; if ( prime_pause*1.0/CLOCKS_PER_SEC > 3 ){ point = i*11; new_point = point; time_failure = true; } bool result = true; // first divise number with prime that alreay in the list for (std::vector::iterator it = pVec.begin(); ( ( it != pVec.end() ) && ( *it <= (i/2) ) && result ); it++){ // if something left from division this not prime if ( !( i % (*it) ) ) result = false; } // then find divisors from other odd numbers for (unsigned long long int j = pVec.back(); ( ( j <= (1+i/2) ) && result ); ){ // if something left from division this not prime if ( !( i % j ) ) result = false; // to the next odd number j += 2; } // puch to vector only primes if ( result ) pVec.push_back(i); i += 2; } prime_pause = clock() - prime_start; pOL("\n\nTime spend on calculation primes: "); pOL(prime_pause*1.0/CLOCKS_PER_SEC); pOL(" sec.\n"); } // Method check if number is prime bool checkPrime(unsigned long long int x){ // for (std::vector::iterator it = pVec.begin(); it != pVec.end(); it++){ // if (x == (*it)) return true; if ( ( x > (*it) ) && !(x % (*it)) ) return false; } return true; } // Method return true in case number being prime unsigned long long int getSum(unsigned long long int x){ // unsigned long long int c = 0; while ( x > 0 ){ c += (x%10); x /= 10; } return c; } // public: // void getNumber(){ std::cin >> number; pOL(enterNumber); pOL(number); pOL('.'); } // virtual void getRange(){} // virtual void operate(){} // void closeDialog(){ getPrimes(number); unsigned long long int k = getSum(number); if (checkPrime(number)){ if (checkPrime(k)) pOL(HowlingPrime); else pOL(justPrime); } else pOL(notPrime); } }; // class rangeRes : public numberRes { // private: // messages represent as strings for range research dialogs std::string enterLrange = "\nYou entered first number in the range: "; std::string enterRrange = "\nYou entered last number in the range: "; std::string HowlingRange = "\nAll Howling primes in the given range ["; std::string limitRange = "\nAll Howling primes in the corrected range ["; std::string back = "] are:\n\n{ "; std::string notMe = "\nNot a single Howling prime in the given range((\n"; std::string limit = "\nCalculations ended with time limit error.\n"; // clock_t prime_start; // clock_t prime_pause; // clock_t time_new; // clock_t start_operate; // std::vector howSVec; // std::vector howDVec; // std::vector howTVec; // bool container, true - prime number, false - not prime bool prime_status = false; // bool container, true - prime number, false - not prime bool sum_status = false; // bool container, true - time error, false - everything fine bool time_failure = false; // unsigned long long int leftRange; // unsigned long long int rightRange; // unsigned long long int LIMITrRange; // public: // void getRange(){ std::cin >> leftRange; pOL(enterLrange); pOL(leftRange); pOL('.'); std::cin >> rightRange; pOL(enterRrange); pOL(rightRange); pOL('.'); } // void operate(){ //unsigned long long int newn; // time_failure = false; unsigned long long int k; unsigned long long int j; unsigned long long int z; getPrimes(rightRange); // keep old end of range if not LIMITrRange = rightRange; start_operate = clock(); for (unsigned long long int next = leftRange; next <= rightRange; ){ k = getSum(next); if ( checkPrime(next) && checkPrime(k) ) howSVec.push_back(next); // pause clock and count time of loop break if limit resieved time_new = clock() - start_operate; if ( time_new*1.0/CLOCKS_PER_SEC > 3 ) time_failure = true; // keep new end of range in case time exeception if ( time_failure ){ LIMITrRange = next-1; break; } if (next < 3) next++; else next +=2; } } // void closeDialog(){ // int i = 0; if (howSVec.empty()) pOL(notMe); else { if (time_failure){ pOL(limit); pOL(limitRange); } else pOL(HowlingRange); pOL(leftRange); pOL(", "); pOL(LIMITrRange); pOL("]:\n\n"); pOL("{\n\n"); // output all Howling prime numbes for (std::vector::iterator it = howSVec.begin(); it != howSVec.end(); it++){ pOL(*it); pOL('\t'); if (++i == 6){ pOL('\n'); i = 0; } } if ( prime_pause*1.0/CLOCKS_PER_SEC > 3 ){ pOL("\nCalculation of prime number divisors ended with time limit.\n"); pOL("\nMaded first correction of last number in the range to -> "); pOL(new_point); pOL(".\n"); } if ( time_new*1.0/CLOCKS_PER_SEC > 3 ){ pOL("\nTime failure in operate() on number next = "); pOL(LIMITrRange+1); pOL(".\n"); } pOL("\n}.\n\nQuantity of single-time howling primes: "); pOL(howSVec.size()); pOL(".\n"); } } }; int main() { clock_t t; storage *entry = new storage; entry -> openDialog(); entry -> validateDialog(); if ( (entry -> approved) && (entry -> mode) ) { storage *check = new numberRes; check -> getNumber(); t = clock(); check -> closeDialog(); } if ( (entry -> approved) && !(entry -> mode) ) { storage *check = new rangeRes; check -> getRange(); t = clock(); check -> operate(); check -> closeDialog(); } delete entry; t = clock() - t; pOL("\nTime program spend working: "); pOL(t*1.0/CLOCKS_PER_SEC); pOL(" sec.\n"); return 0; }

[Challenge]: Howling prime numbers