周赛

E 圆周率用acos(-1.0) 使用longlong

Time Limit:500MS     Memory Limit:32768KB     64bit IO Format:%lld & %llu

Submit  Status  Practice  LightOJ 1225  uDebug

Description

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

5

1

21

16161

523125

0

Sample Output

Case 1: Yes

Case 2: No

Case 3: Yes

Case 4: No

Case 5: Yes

#include<cstdio>
#include<math.h>
#include<cstring>
#include<algorithm>
using namespace std;
int main()
{
	int t,cont=0;
	long long n,m,sum;
	scanf("%d",&t);
	while(t--)
	{
		sum=0;
		scanf("%lld",&n);
		m=n;
		while(n!=0)
		{
			sum=sum+n%10;
			n=n/10;
			if(n==0)
			break;
			sum=sum*10;
		}
		if(sum==m)
		printf("Case %d: Yes\n",++cont);
		else
		printf("Case %d: No\n",++cont);
	}
	return 0;
}//EEEEEEEEEE