[Solved] 1225 – Palindromic Numbers (II) of LightOJ

Main Problem

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

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 < 10^9).

Output

For each case, print the case number and ‘Yes’ if n is palindromic, otherwise print ‘No’.

Sample Input	Output for Sample Input
5	Case 1: Yes
1	Case 2: No
21	Case 3: Yes
16161	Case 4: No
523125	Case 5: Yes
0

Full Source Code (C++)

#include<iostream>
#include<cstring>
#include<stdio.h>
using namespace std;
int main()
{
    int t,i,j,k,flag=1;
    char n[20];
    cin>>t;
    for(i=1;i<=t;i++)
    {
        flag=1;
        scanf("%s",n);
        for(j=0;k=strlen(n)-1;k>=j;j++)
        {
            if(n[j]!=n[k-j])
            {
                flag=0;
                break;
            }
        }
        if(flag==1) cout<<"Case "<<i<<": Yes\n";
        else cout<<"Case "<<i<<": No\n";
    }
    return 0;
}