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



Sample input:
akasaka


Sample output:
Yes

Submission status: Wrong Answer

Solution code:
S = input()

flag = 1
for i in range(0,(len(S) - 1)//2 ):
	if S[i] != S[len(S) -1 -i]:
		flag = 0
	#print(i)
#print(flag)

#flag= 1
for i in range(0,((len(S)- 1)//2-1 )//2):
	if S[i] !=  S[(len(S) -1 )//2 -1 -i]:
		flag=0
	#print(i)
#print(flag)

#flag= 1
for i in range(   (len(S) + 3 )//2-1,   (3 * len(S)-1)//4   ):
	if S[i] !=  S[(len(S) -1 )//2 -1 -i]:
		flag=0
#	print(i)

if flag == 1:
	answer = "Yes"
else:
	answer = "No"

print(answer)

Submission status: Wrong Answer

Solution code:
S = input()

flag = 1
for i in range(0,(len(S) - 1)//2 ):
	if S[i] != S[len(S) -1 -i]:
		flag = 0
	#print(i)
#print(flag)

#flag= 1
for i in range(0,((len(S)- 1)//2-1 )//2):
	if S[i] !=  S[(len(S) -1 )//2 -1 -i]:
		flag=0
	#print(i)
#print(flag)

#flag= 1
for i in range(   (len(S) + 3 )//2-1,   (3 * len(S)-1)//4   ):
	if S[i] !=  S[(len(S) -1 )//2 -1 -i]:
		flag=0
#	print(i)
print(flag)

Submission status: Wrong Answer

Solution code:
S=list(input())
N=len(S)
kaibun=0
for i in range((N-1)//2):
    if S[i]==S[(N-1)//2-i-1]and S[(N+1)//2+i]==S[N-i-1]: 
        kaibun=kaibun+1
    else:
        kaibun=0
        break
for i in range (N):
    if S[i]==S[N-i-1]:
        kaibun=kaibun+1
    else:
        kaibun=0

if kaibun==0:
        print("No")
else:
        print("Yes")

Submission status: Wrong Answer

Solution code:
S=list(input())
N=len(S)
kaibun=0
for i in range((N-1)//2):
    if S[i]==S[(N-1)//2-i-1]and S[(N+1)//2+i]==S[N-i-1]: 
        kaibun=kaibun+1
    else:
        kaibun=0
        break
if kaibun==0:
        print("No")
else:
        print("Yes")

Submission status: Wrong Answer

Solution code:
S=list(input())
N=len(S)
kaibun=0
for i in range((N-1)//2):
    if S[i]==S[(N-1)//2-i-1]and S[(N+1)//2+i]==S[N-i-1]: 
        kaibun=kaibun+1
    else:
        kaibun=0
        break
if kaibun==0:
    print("No")
else:
      print("Yes")

Submission status: Wrong Answer

Solution code:
S = input()

N = len(S)
# [0:N//2] == [(N+1)//2:N]
A = int(N//2)
B = int((N+1)//2)
flag = True
if S[0:A] == S[B:N]:
    N = A
    A = int(N // 2)
    B = int((N + 1) // 2)
    if S[0:A] == S[B:N]:
        print("Yes")
        flag = False

if flag:
    print("No")

Submission status: Wrong Answer

Solution code:
s = input()

result = 'Yes'
j = int((len(s)-1)/2)
for i in range(int(j/2)):
    if(s[i] != s[j-i-1]):
        result = 'No'
        break

for i in range(int(j/2)):
    if(s[i+j+1] != s[len(s)-i-1]):
        result = 'No'
        break

print(result)

Submission status: Wrong Answer

Solution code:
s = input()

result = 'Yes'
j = int((len(s)-1)/2)
for i in range(int(j/2)):
    if(s[i] != s[j-i-1]):
        result = 'No'
        break

for i in range(j+1,j+int(j/2)):
    if(s[i] != s[len(s)-i-1]):
        result = 'No'
        break

print(result)

Submission status: Wrong Answer

Solution code:
s = input()

result = 'Yes'
j = int((len(s)-1)/2)
for i in range(int(j/2)):
    if(s[i] != s[j-i-1]):
        result = 'No'
        break

for i in range(j+1,j+int(j/2)):
    if(s[i] != s[j-i-1]):
        result = 'No'
        break

print(result)

Submission status: Wrong Answer

Solution code:
S = list(input())
N = len(S)
s1 = S[:int((N-1)/2):]
s2 = S[int(((N+3)/2)-1):int(N):]
if S == S[::-1] :
    if s1 == s1[::-1] and s2 == s2[::-1] :
        print("Yes")
    else :
          print("No")

Submission status: Wrong Answer

Solution code:
S = list(input())
N = len(S)
if S == S[::-1] :
    if S[:int((N-1)/2):] == S[:int((N-1)/2):-1] and S[int(((N+3)/2)-1):int(N):] ==  S[int(((N+3)/2)-1):int(N):-1] :
        print("Yes")
    else :
          print("No")

Submission status: Wrong Answer

Solution code:
S = input()

n = int(len(S)/2)

if S == S[::-1]:
  if S[:n] == S[:n][::-1]:
    if S[n+1:] == S[n+1:][::-1]:
      print('Yes')
      
else:
  print('No')

Submission status: Wrong Answer

Solution code:
# 入力
s = input()

# 処理
leftLen = len(s) // 2 # 文字列の長さの半分
left = s[:leftLen] # sの左半分

# leftの回文チェック
leftLenHalf = leftLen // 2
isPalindromeLeft = True
for i in range(0, leftLenHalf - 1):
	if left[i] != left[leftLenHalf - i]:
		isPalindromeLeft = False

# 全体の回文チェック
right = s[leftLen * -1:] # sの右半分
isPalindrome = isPalindromeLeft and left == right

# 結果
result = "Yes" if isPalindrome else "No"

# 出力
print(result)

Submission status: Wrong Answer

Solution code:
s1 = input()
s2 = s1[::-1]

if s1 == s2 :
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
import math
a= input()
length=math.floor(len(a)/2)
def kaibun(p):
    length_p=math.floor(len(p)/2)
    total_p = 0
    for i in range(length_p):
        if p[i] is not p[-1*i -1]:
            return False
            break
        else:
            total_p += 1
        if total_p == length_p:
            return True
if kaibun(a):
    if kaibun(a[:length+1]):
        print('Yes')
    elif length==1:
        print('Yes')
    else:
        print('No')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
import math
a= input()
length=math.floor(len(a)/2)
def kaibun(p):
    length_p=math.floor(len(p)/2)
    total_p = 0
    for i in range(length_p):
        if p[i] is not p[-1*i -1]:
            return False
            break
        else:
            total_p += 1
        if total_p == length_p:
            return True
if kaibun(a):
    if kaibun(a[:length]):
        print('Yes')
    else:
        print('No')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
a = input();
cnt = 0;
if(a == a[::-1]):
	cnt+=1
n = len(a)
if(a[:(n-1)//2] == a[:(n-1)//2:-1]):
    cnt+=1
if(a[(n+3)//2::-1] == a[(n+3)//2:]):
    cnt+=1
if(cnt == 3):
    print("Yes")
else:
   	print("No")

Submission status: Wrong Answer

Solution code:
s = input()


def reverse(text):
    return text == ''.join(list(reversed(text)))


N = len(s)
if reverse(s[:int((N-1)/2)]) and reverse(s[int((N+3)/2 - 1):]):
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
def f(x):
  x==x[::-1]
S=str(input())
N=len(S)
S1=S[:(N-1)//2]
S2=S[(N+1)//2:]
if f(S) and f(S1) and f(S2):
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

Solution code:
kaibun=input()
if kaibun==kaibun[::-1]:
    print("Yes")
else:print("No")

Submission status: Wrong Answer

Solution code:
def f(kaibun):
    for i in range (len(kaibun)//2):
        if kaibun[i]!=kaibun[-i-1]:
            return print("No")
        return print("Yes")
kaibun=input()
f(kaibun)

Submission status: Wrong Answer

Solution code:

def f(x):
	return x == x[::-1]
S = input()


l1 = (len(S)-1)//2
l2 = (len(S)+3)//2

S1 = S[:l1]
S2 = S[l2-1:]


print(S1,S2)
if f(S) and f(S1) and f(S2):
	print("Yes")
else:
	print("No")

Submission status: Wrong Answer

Solution code:

def f(x):
	return x == x[::-1]
S = input()


l1 = (len(S)-1)//2
l2 = (len(S)+3)//2

S1 = S[:l1+1]
S2 = S[l2:]


if f(S) and f(S1) and f(S2):
	print("Yes")
else:
	print("No")

Submission status: Wrong Answer

Solution code:

def f(x):
	return x == x[::-1]
S = input()


l1 = (len(S)-1)//2
l2 = (len(S)+3)//2

S1 = S[:l1]
S2 = S[l2+1:]


if f(S) and f(S1) and f(S2):
	print("Yes")
else:
	print("No")

Submission status: Wrong Answer

Solution code:

def f(x):
	return x == x[::-1]
S = input()
l1 = (len(S)-1)//2
l2 = (len(S)+3)//2

S1 = S[:l1]
S2 = S[l2:]
if f(S) and f(S1) and f(S2):
	print("Yes")
else:
	print("No")

Submission status: Wrong Answer

Solution code:

def f(x):
	return x == x[::-1]
S = input()
l = len(S)
S1 = S[:((l-1)//2)]
S2 = S[((l+3)//2):]
if f(S) and f(S1) and f(S2):
	print("Yes")
else:
	print("No")

Submission status: Wrong Answer

Solution code:
def Kaibun(x):
	return x == x[::-1]
S = input()
l = len(S)
S1 = S[:(l-1)//2]
S2 = S[(l+3)//2:]
if Kaibun(S) and Kaibun(S1) and Kaibun(S2):
	print("Yes")
else:
	print("No")

Submission status: Wrong Answer

Solution code:
def Kaibun(Str):
	return Str == Str[::-1]
S = input()
l = len(S)
S1 = S[:(l-1)//2]
S2 = S[(l+3)//2:]
if Kaibun(S) and Kaibun(S1) and Kaibun(S2):
	print("Yes")
else:
	print("No")

Submission status: Wrong Answer

Solution code:
S = input()
l = len(S)

S1 = S[0:(l-1)//2]
S2 = S[(l+3)//2:]

def Kaibun(Str):
	return Str == Str[::-1]

if Kaibun(S) and Kaibun(S1) and Kaibun(S2):
	print("Yes")
else:
	print("No")

Submission status: Wrong Answer

Solution code:
def chk(i,j,f,s):
    while (j > i and f == 0):
        if s[i] != s[j]:
            f = 1
            break

        j = j-1
        i = i+1

    return f


s = input()
l = len(s)
lh = (l)//2
j = l-1
i = 0
f = 0
r = chk(i,j,f,s)
if r == 1:
    print("No")
    exit()

s1 = s[0:lh]
#lh1 = len(s1)//2
j = len(s1)-1
i = 0
f = 0
r = chk(i,j,f,s1)
if r == 1:
    print("No")
    exit()

s2 = s[lh+1:]
if len(s2)%2 == 0:
    print("No")
    exit()

#lh2 = len(s2)//2
j = len(s2)-1
i = 0
f = 0
r = chk(i,j,f,s2)
if r == 1:
    print("No")
    exit()

print("Yes")

Submission status: Wrong Answer

Solution code:
def chk(i,j,f,s,lh):
    while (j > lh and i < lh and f == 0):
        if s[i] != s[j]:
            f = 1
            break

        j = j-1
        i = i+1

    return f


s = input()
l = len(s)
lh = l//2

j = l-1
i = 0
f = 0
r = chk(i,j,f,s,lh)
if r == 1:
    print("No")
    exit()

s1 = s[0:lh]
if len(s1)%2 == 0:
    print("No")
    exit()

lh1 = len(s1)//2
j = len(s1)-1
i = 0
f = 0
r = chk(i,j,f,s1,lh1)
if r == 1:
    print("No")
    exit()

s2 = s[lh+1:]
if len(s2)%2 == 0:
    print("No")
    exit()

lh2 = len(s2)//2
j = len(s2)-1
i = 0
f = 0
r = chk(i,j,f,s2,lh2)
if r == 1:
    print("No")
    exit()

print("Yes")

Submission status: Wrong Answer

Solution code:
s = str(input())
n = len(s)

t = s[0:(n-1)//2]
t_inv = t[::-1]

u = s[(n+3) // 2 - 1:]
u_inv = u[::-1]

if t == t_inv and u == u_inv:
    print('Yes')
else:
    print("No")

Submission status: Wrong Answer

Solution code:
s = str(input())
n = len(s)

t = s[0:(n-1)//2]
t_inv = t[::-1]

u = s[(n+3) // 2 + 1:]
u_inv = u[::-1]

if t == t_inv and u == u_inv:
    print('Yes')
else:
    print("No")

Submission status: Wrong Answer

Solution code:
s = str(input())
n = len(s)

t = s[0:(n // 2)]
t_inv = t[::-1]

u = s[n // 2 + 1:]
u_inv = u[::-1]

if t == t_inv and u == u_inv:
    print('Yes')
else:
    print("No")

Submission status: Wrong Answer

Solution code:
S=input()
a=S[:int((len(S)-1)/2)]
b=S[int((len(S)+3)/2)-1:]
c=''.join(list(reversed(a)))
d=''.join(list(reversed(b)))
if a==c and b==d:
	print('Yes')
else:
	print('No')

Submission status: Wrong Answer

Solution code:
S=input()
a=S[:int((len(S)-1)/2)]
b=S[int((len(S)+3)/2)-1:]
c=''.join(list(reversed(a)))
d=''.join(list(reversed(b)))

print(a,b,c,d)
if a==c and b==d:
	print('Yes')
else:
	print('No')

Submission status: Wrong Answer

Solution code:
s = input()

n = len(s)

palin = lambda s: s == s[::-1]
f = (n-1)//2 
i = (n+3)//2

if palin(s[0:f]) and palin(s[i-1:n]):
	print("Yes")
else:
	print("No")

Submission status: Wrong Answer

Solution code:
def pal(t):
  return t == t[::-1];


s = input();
f = pal(s) and pal(s[0:(len(s)//2 - 1):]) and pal(s[(len(s)//2 + 1)::]);
#f = pal(s);
if f == True:
  print("Yes");
else:
  print("No");

Submission status: Wrong Answer

Solution code:
S = str(input())

def f():
    for i in range(len(S) // 2):
        if S[i] != S[-i - 1]:  return "No"
    mid = (len(S) + 1) // 2
    for i in range((mid - 1) // 2):
        if S[i] != S[: mid + 1][-i - 1]: return "No"
    return "Yes"

print(f())

Submission status: Wrong Answer

Solution code:
s = input()
def isPalindrome(string):
    return s == s[::-1]
if isPalindrome(s) and isPalindrome(s[0:len(s)//2]):
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
s = input()
n = len(s)
a = s[:n//2]
b = s[n//2+1:]


def circular(string):
    return s == s[::-1]
if circular(s) and circular(a):
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
s = input()
def isPalindrome(string):
    return s == s[::-1]
if isPalindrome(s) and isPalindrome(s[:len(s)//2]) and isPalindrome(s[len(s)//2+1:]):
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
s = input()
def isPalindrome(string):
    return s == s[::-1]
if isPalindrome(s) and isPalindrome(s[:len(s)//2]):
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
s = list(input())
n = len(s)
def circular(a):
    n = len(a)
    bool = False
    for i in range(int(n/2)):
        if a[i] != a[n - 1 - i]:
            bool = False
            break
        bool = True
    return bool
ans = circular(s[0:int((n - 1) / 2)]) and circular(s[int((n + 3) / 2) - 1:n])
if ans:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
str = input("")
n = len(str)
BOOL = True
for i in range(int((n+1)/2)):
    BOOL = BOOL and str[i] == str[n-1-i]

for i in range(int((n-1)/2)):
    BOOL = BOOL and str[i] == str[int((n-1)/2-1-i)]

for i in range(int((n-1)/2)):
    BOOL = BOOL and str[int((n+3)/2-1+i)] == str[n-1-i]

print(BOOL)

Submission status: Wrong Answer

Solution code:
S = input()


def check(s):
    flag = False
    for i in range(len(s)//2):
        if s[i] != s[-i-1]:
            break
        flag = True
    return(flag)


if check(S) and check(S[0:(len(S)-1)//2]) and check(S[(len(S)+3)//2-1:len(S)]):
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
S = input()


def check(s):
    flag = False
    for i in range(len(s)//2):
        if s[i] != s[-i-1]:
            break
        flag = True
    return(flag)


if check(S) and check(S[0:len(S)//2]) and check(S[(len(S)+3)//2-1:len(S)]):
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
S = input()


def check(s):
    flag = False
    for i in range(len(s)//2):
        if s[i] != s[-i-1]:
            break
        flag = True
    return(flag)

front = S[0:int((len(S)-1)//2)]


if check(S) and check(S[0:int((len(S)-1)//2)]) and check(S[(len(S)+3)//2-1:len(S)]):
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
S = input()


def check(s):
    flag = False
    for i in range(int(len(s))//2 + 1):
        if s[i] != s[-i-1]:
            break
        flag = True
    return(flag)


if check(S) and check(S[0:int((len(S)-1)//2)]) and check(S[(len(S)+3)//2-1:len(S)]):
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
S = input()


def check(s):
    flag = False
    for i in range(int(len(s))//2 + 1):
        if s[i] != s[-i-1]:
            break
        flag = True
    return(flag)


if check(S) & check(S[0:int((len(S)-1)//2)]) & check(S[(len(S)+3)//2-1:len(S)]):
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
S = input()


def check(s):
    flag = False
    for i in range(len(s)//2 + 1):
        if s[i] != s[-i-1]:
            break
        flag = True
    return(flag)


if check(S) & check(S[:int((len(S)-1)/2)]) & check(S[int((len(S)+3)/2-1):]):
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
S = input()


def check(s):
    flag = False
    for i in range(len(s)//2):
        if s[i] != s[-i-1]:
            break
        flag = True
    return(flag)


if check(S) & check(S[:int((len(S)-1)/2)]) & check(S[int((len(S)+3)/2-1):]):
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
S = input()


def check(s):
    flag = False
    for i in range(len(S)//2):
        if s[i] != s[-i-1]:
            break
        flag = True
    return(flag)


if check(S) & check(S[:int((len(S)-1)/2)]) & check(S[int((len(S)+3)/2-1):]):
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
S = input()


def check(s):
    flag = False
    for i in range(len(S)//2):
        if s[i] != s[-(i+1)]:
            break
        flag = True
    return(flag)


if check(S) & check(S[:int((len(S)-1)/2)]) & check(S[int((len(S)+3)/2-1):]):
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
def knsu(S):
    N = len(S)
    F = True
    for i in range(N):
        J = N - 1 - i
        if S[i] == S[J]:
            pass
        else:
            F = False
            break

    return F


S = input()
N = len(S)
f1 = knsu(S[:N//2])
f2 = knsu(S[N//2+1:])
if f1 and f2:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
import sys
s = input()
for i in range((len(s) - 1)//4):
    if s[i] != s[(len(s) - 1)//2 - i - 1] and s[i + len(s) // 2 + 1] != s[(len(s) - 1)//2 - i + len(s) // 2]:
        print("No")
        sys.exit(0)
print("Yes")

Submission status: Wrong Answer

Solution code:
import sys
s = input()
for i in range((len(s) - 1)//4):
    if s[i] != s[(len(s) - 1)//2 - i - 1]:
        print("No")
        sys.exit(0)
print("Yes")

Submission status: Wrong Answer

Solution code:
get = input()
if get[:int((len(get)-1)/2)] == get[int(((len(get)+3)/2)-1):]:
    print('yes')
else:
    print('no')

Submission status: Wrong Answer

Solution code:
s = str(input())
 
def iskaibun(w):
    w = str(w)
    l = int(len(w))
    if l != 1:
        if w[0:(l-1)//2] == w[(l+3)//2-1:l]:
            return True
        else:
            return False
    else:
        return True
tf = False
if iskaibun(s) is True:
    t = len(s)
    if iskaibun(s[0:(t-1)//2]) is True and iskaibun(s[(t+3)//2-1:]) is True:
        tf = True
if tf is True:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
s = str(input())
 
def iskaibun(w):
    w = str(w)
    l = int(len(w))
    if w[0:(l-1)//2] == w[(l+3)//2-1:l]:
        ans=True
        return ans
    else:
        ans=False
        return ans
tf = False
if iskaibun(s) is True:
    t = len(s)
    if iskaibun(s[0:(t-1)//2]) is True and iskaibun(s[(t+3)//2-1:]) is True:
        tf = True
if tf is True:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
s = input()
n = len(s)
if s[0:(n-1)//2] == s[(n-2)//2::-1] :
    if s[((n+1)//2)::] == s[n+1:(n//2):-1] :
        print("Yes")
    else:
        print("No")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
s = input()
n = len(s)
if s[0:(n-1)//2] == s[(n-2)//2::-1] :
    if s[((n+1)//2)::] == s[n:((n-1)//2):-1] :
        print("Yes")
    else:
        print("No")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Tue Mar 31 00:02:15 2020

@author: black
"""


S = input()
N = len(S)

T = round((N-1)/2)
num = 0
for i in range(T):
    if S[i] == S[-i-1]:
        pass
    else:
        num += 1

for i in range(round(T/2)):
    print(S[i], S[T-i])
    if S[i] == S[T-i]:
        pass
    else:
        num += 1




if num == 0:    
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
S = input()
a = S[:len(S)//2]
b = S[len(S)//2+1:]
ans = 'Yes'
for i in range(len(a)//2):
    if a[i] != a[len(a)-i-1]:
        ans = 'No'
        break
for i in range(len(b)//2):
    if b[i] != b[len(b)-i-1]:
        ans = 'No'
        break
print(ans)

Submission status: Wrong Answer

Solution code:
def find (words):
    for i in range (len(words)):
        if words[i] == 's'or words[i]=='S':
            return "Yes"
        return "No"

Submission status: Wrong Answer

Solution code:
s = input()
n = len(s)
con1 = (n-1)//2
con2 = (n+3)//2 -1
kaibun = True
answer = ''
if n%2 == 1:
    for i in range(n):
        if s[i] == s[n-i-1]:
          kaibun = True
        else:
          kaibun = False
          break
    for j in range(con1):
        if s[j] == s[con1-j-1]:
          kaibun = True
        else:
          kaibun = False
          break
    for k in range(con2,n):
        if s[k] == s[con2-k-1]:
          kaibun = True
        else:
          kaibun = False
          break
    print('Yes' if kaibun else 'No')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
def isPal(s):
	return s==s[::-1]

s = str(input())
n = len(s)
if isPal(s[0:(n-1)//2]) and isPal(s[n//2+1:]):

	print('Yes')
else:
	print('No')

Submission status: Wrong Answer

Solution code:
str1 = input()
n = len(str1)
m = int((n-1)/2)
o = int((n+3)/2)
str2 = str1[:m]
str3 = str1[(o-1):n]
if str1 != str1[::-1]:
	print("No")
if str2 != str2[::-1]:
	print("No")
if str3 != str3[::-1]:
    print("No")
else:
    print("Yes")

Submission status: Wrong Answer

Solution code:
S = list(input())
S_len = len(S)
S_reverse = list(S[::-1])

ans = 'Yes'

# 条件1 Sは回文である
if S == S_reverse:
    pass
else:
    ans = 'No'

# 条件2
S_2 = S[0:(S_len - 1) // 2]
S_2_reverse = S_2[::-1]
if S_2 == S_2_reverse:
    pass
else:
    ans = 'No'

# 条件3
S_3 = S[0:(S_len + 3) // 2]
S_3_reverse = S_3[::-1]
if S_3 == S_3_reverse:
    pass
else:
    ans = 'No'
 
print(ans)

Submission status: Wrong Answer

Solution code:
import sys
input = lambda: sys.stdin.readline().rstrip()

S = input()

N = len(S)

S_left = S[:(N-1)//2]
S_right = S[(N+1)//2:]

if len(S_left) % 2 == 0:
    print("No")
    exit()

if len(S_right) % 2 == 0:
    print("No")
    exit()

for i in range((len(S)-1)//2):
    if S[i] != S[len(S_left)-1-i]:
        print("No")
        exit()

for i in range((len(S_left)-1)//2):
    if S_left[i] != S_left[len(S_left)-1-i]:
        print("No")
        exit()

for i in range((len(S_right)-1)//2):
    if S_right[i] != S_right[len(S_right)-1-i]:
        print("No")
        exit()

print("Yes")

Submission status: Wrong Answer

Solution code:
import sys
input = lambda: sys.stdin.readline().rstrip()

S = input()

N = len(S)

S_left = S[:(N-1)//2]
S_right = S[(N+1)//2:]


def ch_kaibun(s):
    if not s:
        return True

    if len(s) % 2 == 0:
        return False 

    n = len(s)
    for i in range((n-1)//2):
        if s[i] != s[n-1-i]:
            return False
    return True


if ch_kaibun(S) and ch_kaibun(S_left) and ch_kaibun(S_right):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
def check(s):
    if len(s) % 2 == 0:
        L = len(s)//2
        head=s[:L]
        tale=s[L:]
    else:
        L = (len(s)-1)//2
        head = s[:L]
        tale = s[L+1:]
    print(s, head, tale)
    if head == tale[::-1]:
        return True
    return False
s = input()
if not check(s):
    print("No")
elif not check(s[:(len(s)-1)//2]):
    print("No")
elif not check(s[(len(s)+3)//2-1:]):
    print("No")
else:
    print("Yes")

Submission status: Wrong Answer

Solution code:
s = input()

def is_palindrome( s ):
  for i in range( len( s ) // 2 ):
    if s[i] != s[-i-1]:
      return False
  return True

ret = is_palindrome( s ) 
ret &= is_palindrome( s[:(len(s)-1)//2 ] ) 
ret &= is_palindrome( s[ (len(s)+3)//2-1: ] )
print( ret )

Submission status: Wrong Answer

Solution code:
def check(s):
    if len(s) == 1:
        return False
    L = (len(s)-1)//2
    head = s[:L]
    tale = s[L+1:]
    if head == tale[::-1]:
        return True
    return False
s = input()
if not check(s):
    print("No")
elif not check(s[:(len(s)-1)//2]):
    print("No")
elif not check(s[(len(s)+3)//2-1:]):
    print("No")
else:
    print("Yes")

Submission status: Wrong Answer

Solution code:
def check(s):
    L = (len(s)-1)//2
    head = s[:L]
    tale = s[L+1:]
    if head == tale[::-1]:
        return True
    return False
s = input()
if not check(s):
    print("No")
elif not check(s[:(len(s)-1)//2]):
    print("No")
elif not check(s[(len(s)+3)//2-1:]):
    print("No")
else:
    print("Yes")

Submission status: Wrong Answer

Solution code:
s=input()
if s!=s[::-1]:
  print("No")
  exit()
n=len(s)
chk_s=s[0:(n-1)//2]
if chk_s!=chk_s[::-1]:
  print("No")
  exit()
chk_s=s[(n+3)//2+1:]
if chk_s!=chk_s[::-1]:
  print("No")
  exit()
print("Yes")

Submission status: Wrong Answer

Solution code:
S=list(input())
N2=((int(len(S))//2))
SS=S[0:N2]
A=0
B=-1

while SS[A]==SS[B]:
    A+=1
    B-=1
    if A>int(len(SS)//2):
        break

if A==0:
    print("No")

X=tuple(SS)
Y=tuple(S[N2+1:])
if A!=0 and X==Y:
    print("Yes")

Submission status: Wrong Answer

Solution code:
S = input()
S_before = S[:3]
S_after = S[-3:]

S_reverse = ''.join(list(reversed(S)))

if (S[:(len(S)//2)] == S[:(len(S_reverse)//2)]) and (S_before[:1] == S_before[-1:]) and (S_after[:1] == S_after[-1:]):
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
S = input()
S_before = S[:3]
S_after = S[-3:]

if S[:(len(S)//2)] == S[-(len(S)//2):] and (S_before[:1] == S_before[-1:]) and (S_after[:1] == S_after[-1:]):
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
S = input()
S_before = S[:3]
S_after = S[-3:]

if (S_before[:1] == S_before[-1:]) and (S_after[:1] == S_after[-1:]):
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
import sys
s=sys.stdin.readline()

l=(len(s)-1)//2
judge=1
for i in range(l):
    if s[i]==s[l-i-1] and s[l+i+1]==s[2*l-i]:
        pass
    else:
        judge=0
        break
if judge==1:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
S = input()
length = len(S)
flag = 0
for i in range(((length-1)//2)//2):
  if S[i] != S[((length-1)//2)-i-1]:
    flag = 1
    break

for i in range(((length-1)//2)//2):
  if flag == 1:
    break
  if S[(length+3)//2-1+i] != S[(length)-i-1]:
    flag = 1
    break
for i in range((len(S)-1)//2):
  # print(S[i] , S[-i])
  if flag == 1:
    break
  if S[i] != S[-i]:
    break
  
if flag == 0:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
import sys
s=sys.stdin.readline()

l=(len(s)-1)//2
judge=1
for i in range(l):
    if s[i]==s[l-i-1]:
        pass
    else:
        judge=0
        break
if judge==1:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
S = input()
N = len(S)

ans = 'No'
if S == S[::-1]:
    if S[:N//2] == S[N//2::-1]:
        ans = 'Yes'

print(ans)

Submission status: Wrong Answer

Solution code:
S = input()
N = len(S)

ans = 'No'
if S == S[::-1]:
    if S[:N//2] == S[:N//2:-1]:
        ans = 'Yes'

print(ans)

Submission status: Wrong Answer

Solution code:
S = input()
N = len(S)

if (S[:N//2] == S[(N+1)//2:]) and (S[:(N//2)//2] == S[((N+1)//2)//2:N//2]):
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
S = input()
N = len(S)

ans = 'No'
if S[:N//2] == S[(N+1)//2:]:
    if S[:(N//2)//2] == S[((N+1)//2)//2:N//2]:
        ans = 'Yes'

print(ans)

Submission status: Wrong Answer

Solution code:
print('No')

Submission status: Wrong Answer

Solution code:
S=input()
print("Yes" if S[0:((len(S)-1)//2-1)]==S[((len(S)+3)//2-1):len(S)-1] else "No")

Submission status: Wrong Answer

Solution code:
#B
S = input()
Slist = list(S)
ans = 'Yes'
for k in range (int(len(Slist) / 2)):
    if Slist[k] != Slist[len(Slist) - k - 1]:
        ans = 'No'
N = len(Slist)
if ans == 'Yes':
    for k in range (int(int((N)/2)/2)):
        if Slist[k] != Slist[int((N-1)/2) - k - 1]:
            ans = 'No'
if ans == 'Yes':
    for k in range (int(int((N)/2)/2)):
        if Slist[N-k-1] != Slist[int((N+3)/2) - k - 1]:
            ans ='No'
print(ans)

Submission status: Wrong Answer

Solution code:
def pali (s):
    if(len(s)%2==0):
        return 0
    else:
        start=0
        end=len(s)-1
        while(start<end):
            if(s[start]!=s[end]):
                return 0
            start+=1
            end-=1
        return 1
s=input()
n=len(s)
s1=s[:(n-1)//2]
s2=s[(n+3)//2-1:]
if(pali(s)==1 and pali(s1)==1 and pali(s2)==1):
    print ('Yes')
else:
    print ('No')

Submission status: Wrong Answer

Solution code:
def checkKaibun(str):
    if len(str) % 2 == 0:
      return False
    for i in range(int((len(str) - 1) / 2)):
        if str[i] != str[-i - 1]:
            return False
    return True
 
s = input()
n = len(s)
c2e = int((n - 1) / 2)
c3s = int((n + 3) / 2) - 1
if not checkKaibun(s):
    print('No')
elif not checkKaibun(s[0:c2e]):
    print('No')
elif not checkKaibun(s[c3s:n]):
    print('No')
else :
    print('Yes')

Submission status: Wrong Answer

Solution code:
def checkKaibun(str):
    if len(str) % 2 == 1:
      return False
    for i in range(int((len(str) - 1) / 2)):
        if str[i] != str[-i - 1]:
            return False
    return True
 
s = input()
n = len(s)
c2e = int((n - 1) / 2)
c3s = int((n + 3) / 2) - 1
if not checkKaibun(s):
    print('No')
elif not checkKaibun(s[0:c2e]):
    print('No')
elif not checkKaibun(s[c3s:n]):
    print('No')
else :
    print('Yes')

Submission status: Wrong Answer

Solution code:
S=input()
for i in range(len(S)//4):
    if not S[i]==S[-i-len(S)//2-2]==S[i+len(S)//2+1]==S[-i-1]:
        print("No")
        exit()
print("Yes" if S[0]==S[-1] else "No")

Submission status: Wrong Answer

Solution code:
def checkKaibun(str):
    for i in range(int((len(str) - 1) / 2)):
        if str[i] != str[-i - 1]:
            return False
    return True
 
s = input()
n = len(s)
c2e = int((n - 1) / 2)
c3s = int((n + 3) / 2) - 1
if not checkKaibun(s):
    print('No')
elif not checkKaibun(s[0:c2e]):
    print('No')
elif not checkKaibun(s[c3s:n]):
    print('No')
else :
    print('Yes')

Submission status: Wrong Answer

Solution code:
S=input()
for i in range(len(S)//4):
    if not S[i]==S[-i-len(S)//2-2]==S[i+len(S)//2+1]==S[-i-1]:
        print("No")
        exit()
print("Yes")

Submission status: Wrong Answer

Solution code:
S=input()
for i in range(len(S)//4):
    if not S[i]==S[-i-len(S)//2-2]==S[i+len(S)//2+1]==S[-i-1]:
        exit()
print("Yes")

Submission status: Wrong Answer

Solution code:
S=input()
for i in range(len(S)//4):
    print(i)
    if not S[i]==S[-i-len(S)//2-2]==S[i+len(S)//2+1]==S[-i-1]:
        exit()
print("Yes")

Submission status: Wrong Answer

Solution code:
def checkKaibun(str):
    for i in range(int((len(str) - 1) / 2)):
        if str[i] != str[-i - 1]:
            return False
    return True

s = input()
n = len(s)
c2e = int((n - 1) / 2)
c3s = int((n + 3) / 2)
if not checkKaibun(s):
    print('No')
elif not checkKaibun(s[1:c2e]):
    print('No')
elif not checkKaibun(s[c3s:n]):
    print('No')
else :
    print('Yes')

Submission status: Wrong Answer

Solution code:
def checkKaibun(str):
    for i in range(int((len(str) - 1) / 2)):
        if str[i] != str[-i - 1]:
            return False
    return True

s = input()
n = len(s)
c2e = int((n - 1) / 2 - 1)
c3s = int((n - 1) / 2 + 1)
if not checkKaibun(s):
    print('No')
elif not checkKaibun(s[1:c2e]):
    print('No')
elif not checkKaibun(s[c3s:n]):
    print('No')
else:
    print('Yes')