C++ Exercises: Check whether a given number is a Kaprekar number or not

C++ Numbers: Exercise-9 with Solution

Write a program in C++ to check whether a given number is a Kaprekar number or not.

Pictorial Presentation:

Sample Solution:

C++ Code :

#include<bits/stdc++.h>
using namespace std;
 
bool chkkaprekar(int n)
{
    if (n == 1)
       return true;
    int sqr_n = n * n;
    int ctr_digits = 0;
    while (sqr_n)
    {
        ctr_digits++;
        sqr_n /= 10;
    }
    sqr_n = n*n; 
    for (int r_digits=1; r_digits<ctr_digits; r_digits++)
    {
         int eq_parts = pow(10, r_digits);

         if (eq_parts == n)
            continue;
         int sum = sqr_n/eq_parts + sqr_n % eq_parts;
         if (sum == n)
           return true;
    }
    return false;
}
int main()
{
int kpno;
 cout << "\n\n Check whether a given number is a Kaprekar number: \n";
 cout << " -------------------------------------------------------\n";
cout << " Input a number: ";
cin >> kpno;
          chkkaprekar(kpno)? cout << kpno <<" is a Kaprekar number. ": cout << kpno<<" is not a kaprekar number.";
          cout <<endl; 
}

Sample Output:

 Check whether a given number is a Kaprekar number:                    
 -------------------------------------------------------               
 Input a number: 45.                                                   
45 is a Kaprekar number. 

Flowchart:

C++ Code Editor:

Contribute your code and comments through Disqus.

Previous: Write a program in C++ to generate random integers in a specific range.
Next: Write a program in C++ to generate and show all Kaprekar numbers less than 1000.