Text string (hangdian 2029)

/* Palindromes _ easy version
Problem description
A "text return string" is a string with the same reading and deserialization. For example, "level" or "Noon" is a text return string. Write a program to check whether the read string is a "reply ".
 

Input
The input contains multiple test instances. The first line of input data is a positive integer N, indicating the number of test instances, followed by N strings.

 

Output
If a string is a return string, "yes" is output; otherwise, "no" is output ".

 

Sample Input
4
Level
ABCDE
Noon
Haha
 

Sample output
Yes
No
Yes
No

*/

# Include <stdio. h>
# Include <string. h>
Int main ()
{
Char STR [100010];
Int test, Len, I, J;
While (~ Scanf ("% d", & Test ))
{
Getchar (); // note the location of getchar.
While (test --)
{
Gets (STR );
Len = strlen (STR );
For (I = 0, j = len-1; I <j; I ++, j --) // compare the first character in the string with the most character
If (STR [I]! = STR [J])
{
Printf ("NO \ n ");
Break;
}
If (I> = J)
Printf ("Yes \ n ");
}
}
Return 0;
}