/* Kaprekar's constant The number 6174 is known as Kaprekar's constant. It is the ultimate convergence point of the Kaprekar's routine, an algorithm thought up by Indian mathematician D.R. Kaprekar in 1949. The routine is as follows: 1. Take any four-digit number (at least two different digits must be used, zeroes allowed). 2. Arrange the digits in descending and then in ascending order to get two four-digit numbers. 3. Subtract the smaller number from the larger and get the result. 4. Repeat steps 2-4 with the new number. After a few iterations, the algorithm converges to a fixed point and starts to result in the same number - 6174 - the so-called Kaprekar's constant. For Example: n = 5324 5432 - 2345 = 3087 8730 - 0378 = 8352 8532 - 2358 = 6174 7641 - 1467 = 6174 Challenge - level: Hard Write a code that universally finds Kaprekar's constants and/or loop for any K-digit number. If a sequence is found, all the numbers comprising it have to be returned. So, this program work under integer rates, for now. When you will try to compile this program with GNU gcc compiler on the PC from comand line you should also enter code: "-std=c++11" Text me if find any bugs. Good luck! */ #include using namespace std; // Main information stored private in the class class Kaprekar { private: // Variable for inputed number unsigned long long initial_in=0; // Quatity of digits from inputed number int K=0; // Container for storing digits of the calc. number int newNumber[19]={0}; // Variable for current number unsigned long long actual_in=0; // Variable for left operand of the substruction unsigned long long outL=0; // Variable for right operand of the substruction unsigned long long outR=0; // Container for storing new numbers unsigned long long SEQ[19]={0}; // Quantity of the repetetive numbers int Num=0; // Starting point of the repetetive numbers int count=0; // Quatity of the iterations int iter=0; public: // User get notification with promt to enter // a number for research void setInput() { //cout<<"\nEnter your N-digit number "; //cout<<"(less than 18446744073709551615): "; cin>>initial_in; actual_in=initial_in; cout<<"Entered numbers is: "<2) && (K==4) ) { cout<<"Entered number is invalid.\n"; cout<<"Avoid more than 2-times "; cout<<"repeated numbers for 4-digit input.\n"; return false; } // Error note for 3-digit number if( (maxs>1) && (K==3) ) { cout<<"Entered number is invalid.\n"; cout<<"Avoid repeatetive numbers "; cout<<"for 3-digit input.\n"; return false; } // Error note everyone else if( (K>2) && (maxs>=(K-1)) ) { cout<<"Entered number is invalid.\n"; cout<<"Too many repetetive numbers.\n"; return false; } } // Check if new number is not stored in the SEQ container bool checkNew() { // Zero input will be avoid if(!actual_in) return false; // If number already in the SEQ return index // for later printing for(int i=0; i0;i--) for(int j=1;j<=i;j++) if(newNumber[j-1]>newNumber[j]) { temp=newNumber[j-1]; newNumber[j-1]=newNumber[j]; newNumber[j]=temp; } // Get ascending and descending numbers for(int i=0;i

Kaprekar challenge