LightOJ 1225 Palindromic Numbers

1225 - Palindromic Numbers (II)

PDF (English)

Statistics

Forum

Time Limit: 0.5 second(s)

Memory Limit: 32 MB

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⁹).

Output

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

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

回文串

#include<cstdio>
#include<cstring>
#define M 1000000
char st[M];
int main()
{
	int t,k=0;
	scanf("%d",&t);
	while(t--)
	{
		int flag = 0;
		long long i;
		scanf("%s",&st);
		long long len = strlen(st);
		for(i = 0 ; i < len/2 ; i++)
		{
			if(st[i] != st[len-1-i])
			{
				flag = 1;
				break;
			}
				
		}
		printf("Case %d: ",++k);
		if(flag == 1)
			printf("No\n");
		else
			printf("Yes\n");
	}
}