[Solved] 1225 – Palindromic Numbers (II) of LightOJ
Main LightOJ Problem is here
A palindromic number or numeral palindrome is a
‘symmetrical’ number like 16461, that remains the same when its digits are
reversed. In this problem you will be given an integer, you have to say whether
the number is a palindromic number or not.
Input starts with an integer T (≤ 20000),
denoting the number of test cases.
Each case starts with a line containing an integer n (0 ≤
n < 109).
For each case, print the case number and ‘Yes’ if n
is palindromic, otherwise print ‘No’.
Output for Sample Input
Case 1: Yes
Case 2: No
Case 3: Yes
Case 4: No
Case 5: Yes
Full Source Code Using C Plus Plus