Palindromes

FJNU.1188

Description
A palindrome is a string that reads the same both backwards and forwards. For example, atoyota is a palindrome because if you read it backwards, you get atoyota again. By a warped coincidence, palindrome is not a palindrome.

Input
Each line of input will be one test case. Each test case has a string of no more than 80 characters. All the characters will be lower case letters. There will be no spaces, or other characters on the line.

Output
The word, yes, in all lower case if the given input is a palindrome. Output no otherwise.

Sample Input
atoyota
palindrome

Sample Output
yes
no

 

My Program

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

int  main()
... {
    int i,n;
    bool f;
    char s[80];
    while(gets(s))
    ...{
        f=true;
        n=strlen(s);
        for(i=0;i<n/2;i++)
            if(s[i]!=s[n-1-i])
            ...{
                f=false;
                break;
            }
        if(f)
            cout<<"yes"<<endl;
        else
            cout<<"no"<<endl;
    }
    return 0;
}

 

 YOYO's Note: 
数据读入用while……