（TOJ3260）Palindromes

描述

Palindromes are strings that read the same both forwards and backwards. `Eye' is one such example (ignoring case). In this problem, you get to write a program to determine if a given word is a palindrome or not.

输入

Each line of input contains one word with no embedded spaces. Each word will have only alphabetic characters (either upper or lower case).

输出

For each line of input, output either `yes' if the word is a palindrome or `no' otherwise. Don't print the quotes. Case should be ignored when checking the words.

样例输入

eyE
laLAlal
Foof
foobar

样例输出

yes
yes
yes
no

#include<stdio.h>
#include<string.h>
#include<ctype.h>
#include<math.h>

char s[65536];

void solve()
{
    int i,len;
    while(gets(s))
    {
     len=strlen(s);
      for(i=0; i<len/2; i++)
      {
          if(tolower(s[i])!=tolower(s[len-1-i]))
            break;
       }
      if(i==len/2)
        printf("yes\n");
    else
      printf("no\n");
    }
}

int main()
{
  solve(s);
  getchar();
  getchar();
    return 0;
}