Palindromes

FJNU.1199

Description
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.

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

Output
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.

Sample Input
eyE
laLAlal
Foof
foobar

Sample Output
yes
yes
yes
no

My Program

#include < iostream >
#include < string .h >
using   namespace  std;

int  Palindromes( char  a[])
... {
    int i,n=strlen(a);
    for(i=0;i<n;i++)
        if(a[i]>='A'&&a[i]<='Z')
            a[i]-='A'-'a';
    for(i=0;i<n/2;i++)
        if(a[i]!=a[n-i-1])
            return 0;
    return 1;
}

int  main()
... {
    char a[255];
    while(cin>>a)
    ...{
        if(Palindromes(a))
            cout<<"yes"<<endl;
        else
            cout<<"no"<<endl;
    }
    return 0;
}

 YOYO's Note: 
数据读入用while……
在1188的基础上多了大写字母，并且不区分……