C++ Exercises: Check if a number is Keith or not

C++ Numbers: Exercise-40 with Solution

Write a program in C++ to check if a number is Keith or not.

Sample Solution:

C++ Code :

#include<bits/stdc++.h>
using namespace std;

int lenCount(int nm)
{  int ctr=0;
    while(nm>0)
    {
        nm=nm/10;
        ctr++;
     }
     return ctr; 
}

int main()
{
    int num1=0,arr1[10],num2=0,flg=0,i=0,sum=0;
	cout << "\n\n Check whether a number is Keith or not: \n";
	cout <<" Sample Keith numbers: 197, 742, 1104, 1537, 2208, 2580, 3684, 4788, 7385..\n";
	cout << " -----------------------------------------------------------------------\n";	
	cout<<" Input a number : ";
    cin>>num1;
    num2=num1;
    for(i=lenCount(num2)-1;i>=0;i--)
    {
        arr1[i]=num1 % 10;
        num1/=10;
    }
    while(flg==0)
    {
        for(i=0;i<lenCount(num2);i++)
            sum+=arr1[i];
        if(sum==num2)
        {
            cout<<" The given number is a Keith Number.\n";
            flg=1;
        }
        if(sum>num2)
        {
            cout<<" The given number is not a Keith number.\n";
            flg=1;
        }
        for(i=0;i<lenCount(num2);i++)
        {
            if(i!=lenCount(num2)-1)
                arr1[i]=arr1[i+1];
            else
                arr1[i]=sum;
        }
        sum=0;
    }
}

Sample Output:

 Check whether a number is Keith or not:                               
 Sample Keith numbers: 197, 742, 1104, 1537, 2208, 2580, 3684, 4788, 7385..                                                                   
 -----------------------------------------------------------------------                                                                     
 Input a number : 742                                                  
 The given number is a Keith Number.

Flowchart:

C++ Code Editor:

Contribute your code and comments through Disqus.

Previous: Write a program in C++ to print the first 20 numbers of the Pell series.
Next: Write a program in C++ to check if a number is Keith or not.