SimpleSearching

Description

A string is called circle string if it is the same as its reverse. Now write a program to judge whether the string is a circle string.

正读和反读都相同的字符串称为回文。编写程序判断输入的字符串是否回文。

Input Format

A string whose length is less than 100.

Output Format

"yes" if the input string is a circle string.

"no X" if the input string is not a circle string, and X is the first character that does not satisfy the circling condition (从左到右，第一个不满足回文条件的字符).

For example:

"yes" (abcbc is a circling string)

"no c" (accba is not a cicling string, and c is the first character that violates the circling condition).

Sample Input 1

abcba

Sample Output 1

yes

Sample Input 2

accba

Sample Output 2

no c

 

 

#include<stdio.h>
#include <ctype.h>
#include <string.h>
int main()
{
 int ll,f=0,last;
 char s[101];
 scanf("%s",&s);
 ll=strlen(s);last=ll-1;
 if(ll%2==0)
 {
 for(f=0;f<=ll/2;f++)
 {
	if(s[f]==s[last])
		last--;
	else if(s[f]!=s[last])
	 {
	 printf("no ");
	 printf("%c",s[f]);
	 break;
	 }
	
 } 
 if(f==ll/2+1)
	 printf("yes");
 
 }
 else
 {
  for(f=0;f<=(ll-1)/2;f++)
  {
  
  if(s[f]==s[last])
		last--;
	else if(s[f]!=s[last])
	 {
	 printf("no ");
	 printf("%c",s[f]);
	 break;
	 }
  }
 if(f==(ll-1)/2+1)
	 printf("yes");


 }
  return 0;
}