/* A palindromic number reads the same both ways. The largest palindrome made from the product of two 2-digit numbers is 9009 = 91 × 99. This program find the largest palindrome made from the product of two numbers in the scope from n to N. Enter invthe separate lines: Higher point N lower point n Good luck! */ #include using namespace std; class Palindromic { private: // Declaring storing cells for maximum unequals input i and j. int MAX=0, max_i=0, max_j=0; // Declaring storing cells for maximum equals input i. int MAXEQ=0, meq_i=0; // Declaring range. int N=0, n=0; public: //Getting search range from user void setRange() { cout<<"Enter high border: "; cin>>N; cout<<"Enter lower border: "; cin>>n; } // Function boolean "not_reverse_skip" swap digits for decimal-input number, write it to rev, // then return "1" if k is not palindrome and "0" if palindrome bool not_reverse_skip(long long k) { long long x=k, rev=0; while (x) { rev=rev*10+(x%10); x/=10; } if(k==rev) return false; else return true; } // Calculate maximum palindrome product from unequal input void calcUnPal() { // Declaring and initialize long long product=0; for(int i=N;i>=n;i--) { for(int j=N;j>=n;j--) { product=i*j; if(not_reverse_skip(product)) continue; if(MAX=n;i--) { product=i*i; if(not_reverse_skip(product)) continue; if(MAXEQsetRange(); arrow->calcUnPal(); arrow->calcEqPal(); // By deleting pointer we will recieve result ot the screen delete arrow; }

Largest palindrome product