Description
A palindrome is a symmetrical string, that is, a string read the same from left to right as from right to left. You are asked to write a program which, given a string, determines whether it is a palindrome or not.
Input
The first line contain a single integer T, indicates the number of test cases.
T lines follow, each line contain a string which you should judge. The length of the string is at most 1000.
Output
Print one line for each string, if it is a palindrome, output “YES”, else “NO”.
Sample Input
2
aba
ab
Sample Output
YES
NO
HINT
#include<iostream>
#include<cstring>
using namespace std;
main()
{
string s;
int n;
scanf("%d",&n);
while(n--){
cin>>s;
int flag=0;
for(int i=0;i<s.length()/2;i++){
if(s[i]!=s[s.length()-1-i])
{flag=1; break;}
}
if(flag==0)printf("YES\n");
else printf("NO\n");
}
}