Problem:
Score : 200 points

Problem Statement

A string S of an odd length is said to be a strong palindrome if and only if all of the following conditions are satisfied:

S is a palindrome.

Let N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a palindrome.

The string consisting of the (N+3)/2-st through N-th characters of S is a palindrome.

Determine whether S is a strong palindrome.

Constraints

S consists of lowercase English letters.

The length of S is an odd number between 3 and 99 (inclusive).

Input

Input is given from Standard Input in the following format:

S

Output

If S is a strong palindrome, print Yes;
otherwise, print No.

Sample Input 1

akasaka

Sample Output 1

Yes

S is akasaka.

The string formed by the 1-st through the 3-rd characters is aka.

The string formed by the 5-th through the 7-th characters is aka.
All of these are palindromes, so S is a strong palindrome.

Sample Input 2

level

Sample Output 2

No

Sample Input 3

atcoder

Sample Output 3

No

Solution in C (GCC 5.4.1) (judge verdict: Wrong Answer)

#include <stdio.h>
#include<string.h>
#define max 101
char arr[max],arr1[max],arr2[max];
int main()
{scanf("%s",arr);
int len=strlen(arr),start,end,count;
start=(len-1)/2;end=(len+3)/2;
//printf("%s\n%d\n%d\n%d\n",&arr[0],len,start,end);
for(int i=0;i<start;i++){
    arr1[i]=arr[i];
}
//printf("%s\n%d\n%d\n%d\n",&arr1[0],len,start,end);
count=0;
for(int i=end-1;i<len;i++){
    arr2[count]=arr[i];count++;
}
int result=strcmp(arr1,arr2);
if(result==0){
    printf("YES\n");
}else{
    printf("NO\n");
}
//printf("%d",result);
//printf("%s\n%d\n%d\n%d\n",&arr2[0],len,start,end);
    return 0;
}