【ligth-oj】1225 - Palindromic Numbers (II)（水）

1225 - Palindromic Numbers (II)

   PDF (English)StatisticsForum

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>#include<algorithm>using namespace std;#define CLR(a,b) memset(a,b,sizeof(a))#define INF 0x3f3f3f3f#define LL long longchar a[20];int main(){int u,ca=1;scanf("%d",&u);while(u--){scanf("%s",a+1);int l=strlen(a+1);int flag=1;for(int i=1;i<=l;i++){if(a[i]-'0'!=a[l-i+1]-'0')flag=0;}if(!flag)printf("Case %d: No\n",ca++);elseprintf("Case %d: Yes\n",ca++);}return 0;}