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()
N = len(S)
T = list(S)
M = ((N-1)/2)-1
i = 0
j = int(M)
while i == j:
    if T[i] != T[j]:
        print('No')
        j = -1
        break
    i += 1
    j -= 1
    
P = int((N+3)/2)-1
i = 0
while P < N:
    if T[i] != T[P]:
        print('No')
        j = -1
        break
    i += 1
    P += 1

if j != -1:
    print('Yes')

Submission status: Wrong Answer

Solution code:
S = input()
T = list(S)
Tlength = len(S)
N = int((len(S)-1)/2)
halfN1=int(N/2)
halfN2=int((Tlength+N)/2)
check=0
#print(T[Tlength-2])
#print(N)
#print(halfN1)
#print(halfN2)
for i in range(0,N):
    if T[i]!=T[Tlength-1-i]:
        check=1
        break
for i in range(0,halfN1):
    if T[i]!=T[N-1-i]:
        check=1
        break
for i in range(0,halfN1):
    if T[N+1+i]!=T[Tlength-1-i]:
        check=1
if check==1:
    print('NO')
else:
    print('Yes')

Submission status: Wrong Answer

Solution code:
S = input()
N = len(S)
T = list(S)
i = 0
chack = 0

if N > 3 or N < 99:
    chack = 1

while i != int((N-1)/2):
    if T[i] != T[N-i-1]:
        chack = 1
        break
    else:
        i = i+1

i = 0
while i != int((N-1)/4):
    if T[i] != T[int((N-1)/2-i-1)]:
        chack = 1
        break
    else:
        i = i+1

i = 0
while i != int((N-1)/4):
    if T[int((N+1)/2)+i] != T[N-i-1]:
        chack = 1
        break
    else:
        i = i+1

if chack == 0:
    print("yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
S = input()
N = len(S)
T = list(S)
i = 0
chack = 0

while i != int((N-1)/2):
    if T[i] != T[N-i-1]:
        chack = 1
        break
    else:
        i = i+1

i = 0
while i != int((N-1)/4):
    if T[i] != T[int((N-1)/2-i-1)]:
        chack = 1
        break
    else:
        i = i+1

i = 0
while i != int((N-1)/4):
    if T[int((N+1)/2)+i] != T[N-i-1]:
        chack = 1
        break
    else:
        i = i+1

if chack == 0:
    print("yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
S = input()
N = len(S)
T = list(S)
i = 0

while i != int((N-1)/2):
    if T[i] != T[N-i-1]:
        print("No")
        break
    else:
        i = i+1
if i == (N-1)/2:
    print("yes")

Submission status: Wrong Answer

Solution code:
from sys import stdin
r = stdin.readline

def is_palin(t):
    ans, n = True, len(t)
    for i in range((n//2)+1):
        if t[i]!=t[n-i-1]: ans=False; break
    return ans

def main():
    t = r().strip()
    n = len(t)
    print(t[:((n-1)//2)], t[(n+2)//2:])
    print("Yes" if is_palin(t) and is_palin(t[:((n-1)//2)]) and is_palin(t[(n+2)//2:]) else "No") 

main()

Submission status: Wrong Answer

Solution code:
s = input()
cnt = 0
n = len(s)

if s == s[::-1]:
    cnt += 1

if s[:(n-1)//2] == s[:(n-1)//2][::-1]:
    cnt += 1

if s[(n+3)//2+1:] == s[(n+3)//2+1:][::-1]:
    cnt += 1

if cnt == 3:
    print ("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
s = input()

def is_kaibun(aaa):
    str_len = len(aaa)
    half_str_len = str_len // 2

    str_mae = aaa[:half_str_len]
    str_ato = aaa[half_str_len+1:]

    if str_mae == str_ato:
        return(True)
    else:
        return(False)
    

if is_kaibun(s):
    s_len = len(s)
    half_s_len = s_len // 2
    mae = s[:half_s_len]
    ato = s[half_s_len+1:] 
    if is_kaibun(mae) and is_kaibun(ato):
        print('Yes')
    else:
        print('No')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
# coding: utf-8
S = input()
N = len(S)
n1 = (N-1)//2 - 1
n2 = (N+3)//2 - 1
if S == S[::-1]:
  if S[:n1] == S[:n1][::-1]:
    if S[n2:] == S[n2:][::-1]:
      print('Yes')
    else:
      print('No')
  else:
    print('No')     
else:
  print('No')

Submission status: Wrong Answer

Solution code:
# coding: utf-8
S = input()
N = len(S)
if S == S[::-1]:
  if S[:(N-1)//2] == S[:(N-1)//2][::-1]:
    if S[(N+3)//2:] == S[(N+3)//2:][::-1]:
      print('Yes')
    else:
      print('No')
  else:
    print('No')     
else:
  print('No')

Submission status: Wrong Answer

Solution code:
# coding: utf-8
S = input()
N = len(S)
if S == S[::-1]:
  if S[:(N-1)//2] == S[:(N-1)//2][::-1]:
    if S[(N+3)//2:] == S[(N+3)//2:][::-1]:
      print('Yes')
else:
  print('No')

Submission status: Wrong Answer

Solution code:
str = input()

str1 = str[::-1]
a = str1 == str
str2 = str[:int((len(str)-1)/2)]
str3 = str2[::-1]
b = str3 == str2
str4 = str[int((len(str)+3)/2)-1:]
str5 = str4[::-1]
c = str5 == str4
print(a, b, c)
if a and b and c:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
S = str(input())
T = S[::-1]
N = len(S)
R = S[:(N-1)//2]
L = S[N+3//2:]

if S==T and N==R:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
S = input()

num = len(S)
S1 = S[:(num-1)//2]
S2 = S[(num+1)//2:]

if S == S[::-1] and S1 == S1[::-1] and S2 == S2[::-1]:
  print('Yes')
else:
  print('No')

print(S, S1, S2)

Submission status: Wrong Answer

Solution code:
S = input()

num = len(S)
S1 = S[:(num-1)//2]
S2 = S[(num+3)//2:]

if S == S[::-1] and S1 == S1[::-1] and S2 == S2[::-1]:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

Solution code:
s = input()
ls = list(s)
print((len(ls)-1)/2 - 1)
ls1 = ls[:int((len(ls)-1)/2)]
ls2 = ls[int((len(ls)+3)/2) - 1:]
def kt(l):
    lr = list(reversed(l))
    if l == lr:
        return 1
    else:
        return 0
a = kt(ls)
b = kt(ls1)
c = kt(ls2)


d = a + b + c

if d >= 3:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
S = list(input())
print(S)
FS = S[:int((len(S) - 1)/ 2)]
BS = S[int((len(S) + 3) / 2) -1:]

r_S = list(reversed(S))
r_FS = list(reversed(FS))
r_BS = list(reversed(BS))
flag = 0

for i in range(len(S)):
    # print(r_FS, BS)
    if r_S[i] == S[i] and r_FS == FS and r_BS == BS:
        flag = 1

        continue
    else:
        print('No')
        flag = 0
        break
    
if flag == 1:
    print('Yes')

Submission status: Wrong Answer

Solution code:
text = input()
num = len(text)
text1 = []
text2 = []
for i in range((num - 1) // 2):
    text1.append(text[i])
    text2.append(text[(num - 1) // 2 - i-1])
    print(text1,text2)
if text1 == text2:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
def main():
  
  strInput = input()
  
  if len(strInput) < 3 or len(strInput) > 99 \
  	or strInput.isupper() or (strInput.isalpha() == True):
    return print('No\n')
  
  if len(strInput) % 2 != 0:
    return print('No\n')
  
  strInputReverse = ''.join(list(reversed(strInput)))
  
  if strInput == strInputReverse:
    return print('Yes\n')
  else:
    return print('No\n')

if __name__ == '__main__':
  main()

Submission status: Wrong Answer

Solution code:
def main():
  
  strInput = input()
  
  if len(strInput) < 3 or len(strInput) > 99 \
  	or strInput.isupper() or strInput.isalpha():
    return print('No\n')
  
  if len(strInput) % 2 != 0:
    return print('No\n')
  
  strInputReverse = ''.join(list(reversed(strInput)))
  
  if strInput == strInputReverse:
    return print('Yes\n')
  else:
    return print('No\n')

if __name__ == '__main__':
  main()

Submission status: Wrong Answer

Solution code:
def main():
  
  strInput = input()
  
  if len(strInput) < 3 or len(strInput) > 99 \
  	and strInput.isupper() or strInput.isalpha():
    return print('No\n')
  
  if len(strInput) % 2 != 0:
    return print('No\n')
  
  strInputReverse = ''.join(list(reversed(strInput)))
  
  if strInput == strInputReverse:
    return print('Yes\n')
  else:
    return print('No\n')

if __name__ == '__main__':
  main()

Submission status: Wrong Answer

Solution code:
def main():
  
  strInput = input()
  
  if len(strInput) < 3 or len(strInput) > 99 \
  	or strInput.isupper() or strInput.isalpha():
    return print('No\n')
  
  strInputReverse = ''.join(list(reversed(strInput)))
  
  if strInput == strInputReverse:
    return print('Yes\n')
  else:
    return print('No\n')

if __name__ == '__main__':
  main()

Submission status: Wrong Answer

Solution code:
def main():
  
  strInput = input()
  
  if len(strInput) < 3 or len(strInput) > 99 \
  	and strInput.isupper() or strInput.isalpha():
    return print('No\n')
  
  strInputReverse = ''.join(list(reversed(strInput)))
  
  if strInput == strInputReverse:
    return print('Yes\n')
  else:
    return print('No\n')

if __name__ == '__main__':
  main()

Submission status: Wrong Answer

Solution code:
def main():
  
  strInput = input()
  
  if len(strInput) < 3 or len(strInput) > 99:
    return print('No\n')
  if strInput.isupper():
    return print('No\n')
  
  strInputReverse = ''.join(list(reversed(strInput)))
  
  if strInput == strInputReverse:
    return print('Yes\n')
  else:
    return print('No\n')

if __name__ == '__main__':
  main()

Submission status: Wrong Answer

Solution code:
def main():
  
  strInput = input()
  
  if len(strInput) < 3 or len(strInput) > 100:
    return print('No\n')
  if strInput.isupper():
    return print('No\n')
  
  strInputReverse = ''.join(list(reversed(strInput)))
  
  if strInput == strInputReverse:
    return print('Yes\n')
  else:
    return print('No\n')

if __name__ == '__main__':
  main()

Submission status: Wrong Answer

Solution code:
def main():
  
  strInput = input()
  
  if len(strInput) < 3 or len(strInput):
    return print('No\n')
  if strInput.isupper():
    return print('No\n')
  
  strInputReverse = ''.join(list(reversed(strInput)))
  
  if strInput == strInputReverse:
    return print('Yes\n')
  else:
    return print('No\n')

if __name__ == '__main__':
  main()

Submission status: Wrong Answer

Solution code:
def main():
  
  strInput = input()
  strInputReverse = ''.join(list(reversed(strInput)))
  
  if strInput == strInputReverse:
    return print('Yes\n')
  else:
    return print('No\n')

if __name__ == '__main__':
  main()

Submission status: Wrong Answer

Solution code:
s=input()
c=0
n=int(len(s))
for i in range(n):
  if (s[i]!=s[n-i-1]):
    c+=1
    print("No")
    break
for i in range((n-1)//2):  
  if s[i]!=s[(n-3)//2-i]:
    c+=1
    print("No")
    break
  if s[(n+1)//2+i]!=s[n-i-1]:
    c+=1
    print("No")
    break
if c==0:
  print("Yes")

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-


def main():
    import sys
    input = sys.stdin.readline

    s = input()
    n = len(s)

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

        if t == t[::-1] and u == u[::-1]:
            print('Yes')
        else:
            print('No')
    else:
        print('No')


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
count=0
s=input()
len_s=len(s)
center=int((len_s-1)/2+1)
s_former=s[0:center-1]
s_leter=s[center:]
if(s==reversed(s)):
    pass
else:
    count=+1
if(s_former==reversed(s_former)):
    pass
else:
    count=+1
if(s_leter==reversed(s_leter)):
    pass
else:
    count=+1    
if(count==0):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
count=0
s=input()
len_s=len(s)
center=int((len_s-1)/2+1)
s_former=s[0:center-1]
s_leter=s[center:]
for a in range(int((len(s)-1)/2-1)):
    if(s[a]==s[-1-a]):
        pass
    else:
        count+=1
for a in range(int((len(s_former)-1)/2-1)):
    if(s_former[a]==s_former[-1-a]):
        pass
    else:
        count+=1
for a in range(int((len(s_leter)-1)/2-1)):
    if(s_leter[a]==s_leter[-1-a]):
        pass
    else:
        count+=1
if(count==0):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
count=0
s=input()
len_s=len(s)
center=int((len_s-1)/2+1)
s_former=s[0:center-1]
s_leter=s[center:]
for a in range(int((len(s)-1)/2-1)):
    if(s[a]==s[-1-a]):
        pass
    else:
        count+=1
for a in range(int((len(s_former)-1)/2-1)):
    if(s_former[a]==s_former[-1-a]):
        pass
    else:
        count+=1
for a in range(int((len(s_leter)-1)/2-1)):
    if(s_leter[a]==s_leter[-1-a]):
        pass
    else:
        count+=1
if(count==0):
    print("Yes")
else:
    print("No")
print(s_former,s_leter)
print(s[-1])

Submission status: Wrong Answer

Solution code:
S = str(input())

#print(S)
#print(S[0])

def check_Palindrome(S):
    N = len(S)
    S_1 = S[:int((N-1)/2)] #9文字なら前半は1～4文字⇒0:4
    S_2 = ''.join(list(reversed(S[int((N+1)/2):]))) #後半は6～9⇒5:
    if S_1 == S_2:
        return 1
    else:
        return 0

#print(check_Palindrome(S))
N = len(S)
# Sの1文字目から（N-1)/2文字目まで⇒Sが9文字なら1～4⇒S[:4]
S_check2 = S[:int((N-1)/2)]
# Sの(N+3)/2文字目からN文字目まで⇒Sが9文字なら6～9⇒S[5:]
S_check3 = S[int((N+3)/2-1):]

if (check_Palindrome(S) == 1) & (check_Palindrome(S_check2) == 1) & (check_Palindrome(S_check3) == 1):
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
if __name__ == '__main__':
    a = input()
    a_len = len(a)
    # check1
    top_s = a[:int((a_len-1)/2)]
    tail_s = a[int((a_len+3)/2)-1:]
    if top_s == ''.join(list(reversed(top_s))) and tail_s == ''.join(list(reversed(tail_s))):
        print('Yes')
    else:
        print('No')

Submission status: Wrong Answer

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

A = str(s[:n-1//2])
B = str(s[n+3//2-1:])

if s ==(s[::-1]) and A == (A[::-1]) and B == (B[::-1]):
    print("Yes")
else:
    print ("No")

Submission status: Wrong Answer

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

A = str(s[:n-1//2])
B = str(s[n+3//2:])

if s ==(s[::-1]) and A == (A[::-1]) and B == (B[::-1]):
    print("Yes")
else:
    print ("No")

Submission status: Wrong Answer

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

A = str(s[:n-1//2])
B = str(s[n+3//2:])

if A == (A[::-1]) and B == (B[::-1]):
    print("Yes")
else:
    print ("No")

Submission status: Wrong Answer

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

A = str(s[::n-1//2])
B = str(s[n+3//2::])

if A == (A[::-1]) and B == (B[::-1]):
    print("Yes")
else:
    print ("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
S = list(input())
N = len(S)
flag = True
# if N == 3: flag = False
for i in range((N-1)//4):
    if S[i] == S[(N-1)//2-1-i] and S[(N+3)//2-1+i] == S[N-1-i]:
        continue
    else:
        flag = False
        break

print("Yes" if flag else "No")

Submission status: Wrong Answer

Solution code:
S = list(input())
N = len(S)
flag = True
if N == 3: flag = False
for i in range((N-1)//4):
    if S[i] == S[(N-1)//2-1-i] and S[(N+3)//2-1+i] == S[N-1-i]:
        continue
    else:
        flag = False
        break

print("Yes" if flag else "No")

Submission status: Wrong Answer

Solution code:
# list(map(int,input().split()))
# map(int,input().split())

S = list(input())
N = len(S)
flag = True
if N == 3: flag = False
for i in range((N-1)//4):
    if S[i] == S[(N-1)//2-1] and S[(N+3)//2-1] == S[N-1-i]:
        continue
    else:
        flag = False
        break

print("Yes" if flag else "No")

Submission status: Wrong Answer

Solution code:
S = list(input())
N = len(S)
flag = True
if N == 3: flag = False
for i in range((N-1)//4):
    if S[i] == S[(N-1)//2-1] and S[(N+3)//2-1] == S[N-1-i]:
        print(S[i],S[(N-1)//2-1] ,S[(N+3)//2-1],S[N-1-i])
        continue
    else:
        flag = False
        break

print("Yes" if flag else "No")

Submission status: Wrong Answer

Solution code:
S = list(input())
N = len(S)
flag = True
for i in range((N-1)//4):
    if S[i] == S[(N-1)//2-1] and S[(N+3)//2-1] == S[N-1-i]:
        continue
    else:
        flag = False
        break

print("Yes" if flag else "No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
S=input()
N=len(S)
s1=S[0:(N-1)//2]
s2=S[(N+1)//2:N]
t=list(s2)
t.reverse()
s3="".join(t)
if s1!=s3:
    print("No")
    exit()
N=len(s1)
s4=s1[0:(N-1)//2]
s5=s1[(N+1)//2:N]
t=list(s5)
t.reverse()
s6="".join(t)
if s4!=s6:
    print("No")
    exit()
N=len(s2)
s7=s2[0:(N-1)//2]
s8=s2[(N+1)//2:N]
t=list(s8)
t.reverse()
s9="".join(t)
if s7!=s9:
    print("No")
    exit()
print("Yes")

Submission status: Wrong Answer

Solution code:
def word_split(s):
    n=len(s)
    return s[0:(n-1)//2],s[(n+1)//2:n]

S=input()
s1,s2=word_split(S)
if s1!=s2:
    print("No")
    exit()
s3,s4=word_split(s1)
if s3!=s4:
    print("No")
    exit()
s5,s6=word_split(s2)
if s5!=s6:
    print("No")
    exit()
print("Yes")

Submission status: Wrong Answer

Solution code:
def word_split(s):
    n=len(s)
    return s[0:(n-1)//2],s[(n+3)//2-1:n]

S=input()
s1,s2=word_split(S)
if s1!=s2:
    print("No")
    exit()
s3,s4=word_split(s1)
if s3!=s4:
    print("No")
    exit()
s5,s6=word_split(s2)
if s5!=s6:
    print("No")
    exit()
print("Yes")

Submission status: Wrong Answer

Solution code:
s=input()
l=list(s)
if reversed(l)!=l:
  print('No')
  exit()

p=l[0:(n+1)/2]
q=l[(n+3)/2:]
if reversed(p)!=p or reversed(q)!=q:
  print('No')
  exit()
  
print('Yes')

Submission status: Wrong Answer

Solution code:
s = input()
len_s = len(s)
if s[:int((len_s-1)/2)] != s[int((len_s-1)/2+1):]:
    print('No')
else:
    tmp = s[:int((len_s-1)/2)]
    if len(tmp) == 1:
        print('Yes')
    else:
        if tmp[:int((len(tmp) - 1) / 2)] == tmp[int((len(tmp) - 1) / 2 + 1):][::-1]:
            print('Yes')
        else:
            print('No')

Submission status: Wrong Answer

Solution code:
S=input('Enter kaibun:')
length=len(S)
kai=0
if not S.islower:
    print('No')
elif length%2 == 0 or not 3<= length <=99:
    print('No')
else:
    N=int((length-1)/2)
    M=int(N/2)
    for i in range(N):
        if S[i]!=S[-1*(i+1)] and kai==0:
            print("No")
            kai=1
    if kai==0:
        for i in range(M):
            if S[i]!=S[N-(i+1)] or S[-1*(i+1)]!=S[-1*(N-i)] and kai==0:
                print("No")
                kai=1
        if kai==0:
            print("Yes")

Submission status: Wrong Answer

Solution code:
S=input('Enter kaibun:')
length=len(S)
kai=0
if not S.islower:
    print('S is not appropreate')
elif length%2 == 0 or not 3<= length <=99:
    print('S is not appropreate')
else:
    N=int((length-1)/2)
    M=int(N/2)
    for i in range(N):
        if S[i]!=S[-1*(i+1)] and kai==0:
            print("No")
            kai=1
    if kai==0:
        for i in range(M):
            if S[i]!=S[N-(i+1)] or S[-1*(i+1)]!=S[-1*(N-i)] and kai==0:
                print("No")
                kai=1
        if kai==0:
            print("Yes")

Submission status: Wrong Answer

Solution code:
def check_palindrome(s):
  n = len(s)
  return all([s[i] == s[n - 1 - i] for i in range(n // 2)])


def main():
  s = input()
  n = len(s)
  print(check_palindrome(s) and check_palindrome(s[:n // 2]))


main()

Submission status: Wrong Answer

Solution code:
s=input()
n=len(s)
b=''
c=''
def palindrome(s):
    for i in range(0,n//2):
        if(s[i]==s[len(s)-i-1]):
            return True
        else:
            return False
if(n>3):
    if(palindrome(s)==True):

        for i in range(0, (n-1)//2):
            b=b+s[i]
        if(palindrome(b)==True):

            for i in range((n+3)//2-1, n):
                c = c + s[i]
            if(palindrome(c)==True):

                print('Yes')

            else:
                print('No')

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

Submission status: Wrong Answer

Solution code:
s=input()
n=len(s)
b=''
c=''
def palindrome(s):
    for i in range(0,n//2):
        if(s[i]==s[len(s)-i-1]):
            return True
        else:
            return False
if(palindrome(s)==True):
    
    for i in range(0, (n-1)//2):
        b=b+s[i]
    if(palindrome(b)==True):

        for i in range((n+3)//2-1, n):
            c = c + s[i]
        if(palindrome(c)==True):

            print('Yes')

        else:
            print('No')

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

Submission status: Wrong Answer

Solution code:
s=input()
n=len(s)
b=''
c=''
def palindrome(s):
    for i in range(0,n//2):
        if(s[i]==s[len(s)-i-1]):
            return True
        else:
            return False
if(palindrome(s)==True):
    for i in range(0, (n-1)//2):
        b=b+s[i]
    if(palindrome(b)==True):
        for i in range((n+3)//2-1, n):
            c = c + s[i]
        if(palindrome(c)==True):
            print('YES')
        else:
            print('NO')
            print(c)
    else:print('NO')
else:print('NO')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a= str(input())
kaibun = list(a)
n = int(len(kaibun))
answer = "No"
strongn1 = int((n-1)/2)
strongn2 = int((n+3)/2)
for i in reversed(range((int((n+1)/2)),n)):
    if kaibun[i] == kaibun[n-i-1]:
        answer = "Yes"
    else:
        answer = "No"
if answer == "Yes":
    for i in range(int(strongn1/2)):
        if kaibun[i] == kaibun[strongn1-i-1]:
            answer = "Yes"
        else:
            answer="No"
if answer =="Yes":
    for i in reversed(range(strongn2+int(strongn1/2)-1,n)):
        if kaibun[i] == kaibun[strongn2-2-i+n]:
            answer = "Yes"
        else:
            answer = "No"
print(answer)

Submission status: Wrong Answer

Solution code:
a= str(input())
kaibun = list(a)
n = int(len(kaibun))
answer = "No"
strongn1 = int((n-1)/2)
strongn2 = int((n+3)/2)
for i in reversed(range((int((n+1)/2)),n)):
    if kaibun[i] == kaibun[n-i-1]:
        answer = "Yes"
    else:
        answer = "No"
if answer == "Yes":
    for i in range(int(strongn1/2)):
        if kaibun[i] == kaibun[strongn1-i-1]:
            answer = "Yes"
        else:
            answer="No"
if answer =="Yes":
    for i in reversed(range(strongn2+int(strongn1/2),n)):
        if kaibun[i] == kaibun[strongn2-2-i+n]:
            answer = "Yes"
        else:
            answer = "No"
print(answer)

Submission status: Wrong Answer

Solution code:
a= str(input())
kaibun = list(a)
n = int(len(kaibun))
answer = "No"
strongn1 = int((n-1)/2)
strongn2 = int((n+3)/2)
for i in reversed(range((int((n+1)/2)),n)):
    if kaibun[i] == kaibun[n-i-1]:
        answer = "Yes"
    else:
        answer = "No"
print("aaa")
if answer == "Yes":
    for i in range(int(strongn1/2)):
        if kaibun[i] == kaibun[strongn1-i-1]:
            answer = "Yes"
        else:
            answer="No"
if answer =="Yes":
    for i in reversed(range(strongn2+int(strongn1/2),n)):
        if kaibun[i] == kaibun[strongn2-2-i+n]:
            answer = "Yes"
        else:
            answer = "No"
print(answer)

Submission status: Wrong Answer

Solution code:
#回文であるか調べる
def kaibuncheck(S):
    N=len(S)
    N_val=N-1
    center=int((N-1)/2)
    checkpoint=0
    for i in range(center-1):
        if S[i] == S[N_val]:
            checkpoint+=1
        N_val -= 1

    if checkpoint == center-1:
        return 1
    else:
        return 0

S = list(input())
N = len(S)
N2 = int((N-1)/2)

S_start=list()
S_end=list()
for i in range(N2):
    S_start.append(S[i])
    S_end.append(S[N2+1+i])

if N%2 == 1:
    if kaibuncheck(S) == 1 and kaibuncheck(S_start) == 1 and kaibuncheck(S_end) == 1:
        print('Yes')
    else:
        print('No')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
#回文であるか調べる
def kaibuncheck(S):
    N=len(S)
    N_val=N-1
    center=int((N-1)/2)
    checkpoint=0
    for i in range(center-1):
        if S[i] == S[N_val]:
            checkpoint+=1
        N_val -= 1

    if checkpoint == center-1:
        return 1
    else:
        return 0

S = list(input())
N = len(S)
N2 = int((N-1)/2)

S_start=list()
S_end=list()
for i in range(N2):
    S_start.append(S[i])
    S_end.append(S[N-1-i])

if N%2 == 1:
    if kaibuncheck(S) == 1 and kaibuncheck(S_start) == 1 and kaibuncheck(S_end) == 1:
        print('Yes')
    else:
        print('No')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
#回文であるか調べる
def kaibuncheck(S):
    N=len(S)
    N_val=N-1
    center=int((N-1)/2)
    checkpoint=0
    for i in range(center-1):
        if S[i] == S[N_val]:
            checkpoint+=1
        N_val -= 1

    if checkpoint == center-1:
        return 1
    else:
        return 0

S = list(input())
N = len(S)
N2 = int((N-1)/2)

S_start=list()
S_end=list()
for i in range(N2):
    S_start.append(S[i])
    S_end.append(S[N-1-i])

if kaibuncheck(S) == 1 and kaibuncheck(S_start) == 1 and kaibuncheck(S_end) == 1:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
#回文であるか調べる
def kaibuncheck(S):
    N=len(S)
    N_val=N-1
    center=int((N-1)/2)
    checkpoint=0
    for i in range(center-1):
        if S[i] == S[N_val]:
            checkpoint+=1
        N_val -= 1

    if checkpoint == center-1:
        return 1
    else:
        return 0

S = list(input())
N = len(S)
N2 = int((N-1)/2)

S_start=list()
S_end=list()
for i in range(N2):
    S_start.append(S[i])
    S_end.append(S[N-1-i])

print(S_start)
print(S_end)

if kaibuncheck(S) == 1 and kaibuncheck(S_start) == 1 and kaibuncheck(S_end) == 1:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
S = list(input())

#回文であるか調べる
def kaibuncheck(S):
    N=len(S)
    if N%2 == 1:
        N_val=N-1
        center=int((N-1)/2)
        checkpoint=0
        for i in range(center-1):
            if S[i] == S[N_val]:
                checkpoint+=1
            N_val -= 1

        if checkpoint == center-1:
            return 1
        else:
            return 0
    else:
        return 0

if kaibuncheck(S) == 1:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
S = input()
N = len(S)
for i in range(N//2):
    if S[i] != S[-i-1]:
        print('No')
        exit()
if N % 2 == 0 or N < 7:
    print('No')
    exit()

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

for i in range((N+3)//2):
    if S[i] != S[-i-1]:
        print('No')
        exit()
print('Yes')

Submission status: Wrong Answer

Solution code:
s = input()

div = len(s) // 2
pre = s[:div]
suf = s[div + 1:]

if pre == pre[::-1] and suf == suf[::-1]:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
str = input()
rev_str = str[::-1]
len_str = len(str)

pre_str = str[0:((len_str-1)//2)]
pro_str = str[(((len_str+3)//2)-1)::]

print(pre_str)
print(pro_str)


rev_pre_str = pre_str[::-1]
rev_pro_str = pro_str[::-1]

pali = 0

if str == rev_str:
    if pre_str == rev_pre_str:
        if pro_str == rev_pro_str:
            pali = 1

if pali == 1:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
def main():
    S = input()
    N = len(S)
    M = N//2
    if N == 3:
        if S[0] == S[2]:
            print("Yes")
        else:
            print("No")
        return
    for i in range(M//2):
        if S[i] == S[M-1-i] == S[M+1+i] == S[N-1-i]:
            continue
        else:
            print("No")
            return
    print("Yes")


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
def main():
    S = input()
    N = len(S)
    M = N//2
    for i in range(M//2):
        if S[i] == S[M-1-i] == S[M+1+i] == S[N-1-i]:
            continue
        else:
            print("No")
            return
    print("Yes")


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
S = list(input())

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

N = len(S)

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

if s[:(n-1)//2] == ''.join(reversed(s[:(n-1)//2])) and s[((n+3)//2-1):] == ''.join(reversed(s[((n+3)//2-1):])):
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
s = input('')
n = len(s)
s1 = s[0:(n-1)//2]
s2 = s[(n+3)//2-1:]

if (s1 == s1[::-1] and s2 == s2[::-1]):
	print("Yes")
else:
  	print("No")

Submission status: Wrong Answer

Solution code:
S  = str(input())
f = S[:((len(S)-1)//2)]
l = S[((len(S)+1)//2):]

if f == f[::-1] and l == l[::-1]:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

Solution code:
s = input()
a = s[:len(s) // 2]
b = s[len(s) // 2 + 1:]
if a == b:
    a_a = s[:(len(a) + 3) // 2]
    a_b = s[(len(a) + 3) // 2 + 1:]
    if a_a == a_b:
        print('Yes')
    else:
        print('No')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
s = input()
a = s[:len(s) // 2]
b = s[len(s) // 2 + 1:]
if a == b:
    a_a = a[:len(a) // 2]
    a_b = a[len(a) // 2 + 1:]
    if a_a == a_b:
        print('Yes')
    else:
        print('No')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
# coding: utf-8
S = input()
def check(S):
    ret = True
    for i in range(len(S)//2):
        if S[i] != S[-i-1]:
            ret = False
    return ret
if len(S) == 3:
    if S[0] != S[-1]:
        print("No")
    else:
        print("Yes")
    exit()
flag = True
if not check(S):
    flag = False
if not check(S[:(len(S)-1)//2]):
    flag = False
if not check(S[(len(S)+3)//2:]):
    flag = False
print("Yes" if flag else "No")