A palindrome number remains the same when its digits are reversed, such as 121, 34543, 343, 131, and 48984.
Palindrome number algorithm
- Get the number from user
- Hold the number in temporary variable
- Reverse the number
- Compare the temporary number with reversed number
- If both numbers are same, print palindrome number
- Else print not palindrome number
Let's explore a C++ program that checks if a given number is a palindrome. This program prompts the user for an input and then verifies if the number remains the same when read from left to right and right to left.
Example
Example
#include <iostream>
using namespace std;
int main()
{
int n,r,sum=0,temp;
cout<<"Enter the Number=";
cin>>n;
temp=n;
while(n>0)
{
r=n%10;
sum=(sum*10)+r;
n=n/10;
}
if(temp==sum)
cout<<"Number is Palindrome.";
else
cout<<"Number is not Palindrome.";
return 0;
}
Output:
Output
Enter the Number=121
Number is Palindrome.
Example
Enter the number=113
Number is not Palindrome.
