Example(s):Palindrome, prime, armstrong, "linear search", reverse etc.

Example(s):1575, 1632, 1539 (Only one at a time)

Login

[lwa]

Solved Problem
#CPP#3581

Problem Statement - Check if number is a palindrome without using modulus operator

Write a C++ program to collect a positive integer from the user and the check its reversed number would be a palindrome or not (same number when reversed for e.g. 121, 1331). Please use some alternate technique to find remainder instead of modulus operator.

Related codes are those codes where similar programming concepts are in use. They are different from alternate codes in the sense that they may not have same purpose and results.

:

Run Output

Enter a positive integer:1331
Palindrome

-OR-

Enter a positive integer:1321
Not Palindrome

while(nc>0){rem=nc%10;nr=nr*10+rem;nc=nc/10;} This loop reverses the number kept in nc, the copy of original number in a variable named nr. First nc%10 extracts the last digit then this digit is shifted left by mutiplying it to 10 and then adding the next number, then last number is dropped by using nc/10.

if(n==nr) cout<<“Palindrome”; else cout<<“Not Palindrome”;
If original number n is same is nr the reversed number then we display it as palindrome, else we display not a palindrome.

Notes

This approach will not work on negative integers. One can find absolute number of input to remove the negative sign and then follow this approach.