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 = list(input())
l = []
r = []

for i in range(int((len(s)-1)/2)):
    l.append(s[i])

for i in range(int((len(s)+1)/2),len(s)):
    r.append(s[i])

lr = l.copy()
lr.reverse()

rr = r.copy()
rr.reverse()

if l == lr and r == rr:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
# B - String Palindrome
# https://atcoder.jp/contests/abc159/tasks/abc159_b

import sys

S = input()
N = len(S)

def is_palindrome(s):
    n = len(s)
    if n == 2:
        if s[0] == s[1]:
            return True
        else:
            return False
    else:
        if s[:n//2] == s[:n//2:-1]:
            return True
        else:
            return False

if not is_palindrome(S):
    print("No")
    sys.exit()

if not len(S) > 3:
    print("No")
    sys.exit()  

if not is_palindrome(S[:(N-1)//2]):
    print("No")
    sys.exit()

if not is_palindrome(S[(N+3)//2-1:]):
    print("No")
    sys.exit()

print("Yes")

Submission status: Wrong Answer

Solution code:
n=list(input())
def kaibun(l):
  flg=False
  for i in range(int((len(l)-1)/2)):
    
    if l[i] != l[len(l)-1-i]:
      flg=True
  return(int(flg))

c=kaibun(n)
m=n[:int((len(n)-1)/2)]
d=kaibun(m)
p=n[int((len(n)+1)/2):]
e=kaibun(p)
if c+d+e == 0:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

Solution code:
s = input();t=s[:len(s)//2];u=s[len(s)//2+1:]

def check(string):
  for i in range(len(string)):
    if string[i] != string[len(string)-i-1]:
      return False
    return True
  
print("Yes" if all([check(s),check(t),check(u)]) else "No")

Submission status: Wrong Answer

Solution code:
import sys
chars = list(input())
len = len(chars)

mid = len //2

for i in range(mid):
  if chars[i] != chars[len-i-1]:
    print("No")
    sys.exit()
  else:
    continue
    
zenhan = int((len-1)/2)
kouhan = int((len+3)/2)

cz = chars[:zenhan]
ck = chars[(kouhan-1):]

hrf = zenhan//2

for i in range(hrf):
  if cz[i] != cz[hrf-i-1]:
    print("No")
    sys.exit()
  else:
    pass


for i in range(hrf):
  if ck[i] != ck[hrf-i-1]:
    print("No")
    sys.exit()
  else:
    pass
print("Yes")

Submission status: Wrong Answer

Solution code:
import sys
chars = list(input())
len = len(chars)

mid = len //2

for i in range(mid):
  if chars[i] != chars[len-i-1]:
    print("No")
    sys.exit()
  else:
    continue
    
zenhan = int((len-1)/2)
kouhan = int((len+3)/2)


hrf = zenhan//2

for i in range(hrf):
  if chars[i] != chars[len-i-1]:
    print("No")
    sys.exit()
  else:
    pass
print("Yes")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
S=input()
N=len(S)
x=""
y=""
x_1=""
y_1=""
x_2=""
y_2=""
for i in range(N):
    if S[i]==S[N-1-i]:
        x+=S[i]
        y+=S[i]

if x==y:
    for j in range((N-1)//2):
        if S[j]==S[(N-1)//2 -1-j]:
            x_1+=S[j]
            y_1+=S[j]
    if x_1==y_1:
        for k in range((N-1)//2):
            if S[(N-1)//2 -1+k]==S[N-1-k]:
                x_2+=S[k]
                y_2+=S[k]
    else:
        print("No")
    
    if x_2==y_2:
        print("Yes")
    else:
        print("No")

else:
    print("No")

Submission status: Wrong Answer

Solution code:
S=input()
N=len(S)
cnt=0
cnt1=0
cnt2=0
for i in range (N):
    if S[i]==S[N-1-i]:
        cnt+=1

if cnt==N:
    for j in range((N-1)//2):
        if  S[j]==S[(N-1)//2 -1-j]:
            cnt1+=1
    if cnt1==(N-1)//2:
        for k in range((N-1)//2):
            if S[(N+3)//2 -1+k]==S[N-1-k]:
                cnt2+=1
    else:
        print("No")

    if cnt2==(N-1)//2:
        print("Yes")
    else:
        print("No")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
S=input()
N=len(S)
cnt=0
cnt1=0
cnt2=0
for i in range (N):
    if S[i]==S[N-1-i]:
        cnt+=1

if cnt==N:
    for j in range((N-1)//2):
        if  S[j]==S[(N-1)//2 -1-j]:
            cnt1+=1
    if cnt1==(N-1)//2:
        for k in range((N-1)//2):
            if S[(N+3)//2 -1+k]==S[N-1-k]:
                cnt2+=1
    if cnt2==(N-1)//2:
        print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
# B

S = input()

N = len(S)

if S[1:int((N-1)/2)] == S[int((N+3)/2):]:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
S=list(input())
N=len(S)
if S==S[::-1] and N>=5:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

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)+1)//2
if n % 2 ==1:
    print("No")
else:
    m = n//2
    if s[:n-1] == s[len(s):n-1:-1] and s[:m-1] == s[n-2:m-1:-1]:
        print("Yes")
    else:
        print("No")

Submission status: Wrong Answer

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

count = 0
harf = int(l/2)
a = S[:harf]
b = S[harf+1:][::-1]

if a == b :
    count+=1

l1 = int((l-1)/2)
a = S[:l1]
l1_harf = int(len(a)/2)
if len(a) % 2 != 0:
    a1 = a[:l1_harf]
    a2 = a[l1_harf+1:][::-1]
else:
    a1 = a[:l1_harf]
    a2 = a[l1_harf][::-1]

if a1==a2:
    count+=1

l2 = int((l+3)/2)
b = S[l+1:]
l2_harf = int(len(b)/2)
if len(b) % 2 != 0:
    b1 = b[:l2_harf]
    b2 = b[l2_harf+1:][::-1]
else:
    b1 = b[:l2_harf]
    b2 = b[l2_harf:][::-1]

if b1 == b2:
    count += 1

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

Submission status: Wrong Answer

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

count = 0
harf = int(l/2)
a = S[:harf]
b = S[harf+1:][::-1]

if a == b :
    count+=1

l = int((l-1)/2)
a = S[:l]
l1_harf = int(len(a)/2)
a1 = a[:l1_harf]
a2 = a[l1_harf+1:][::-1]

if a1==a2:
    count+=1

l2 = int((l+3)/2)
b = S[l+1:]
l2_harf = int(len(b)/2)
if len(b) % 2 != 0:
    b1 = b[:l2_harf]
    b2 = b[l2_harf+1:][::-1]
else:
    b1 = b[:l2_harf]
    b2 = b[l2_harf:][::-1]

if b1 == b2:
    count += 1

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

Submission status: Wrong Answer

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

count = 0
harf = int(l/2)
a = S[:harf]
b = S[harf+1:][::-1]

if a == b :
    count+=1

l = int((l-1)/2)
a = S[:l]
l1_harf = int(len(a)/2)
a1 = a[:l1_harf]
a2 = a[l1_harf+1:][::-1]

if a1==a2:
    count+=1

l2 = int((l+3)/2)
b = S[l+1:]
l2_harf = int(len(b)/2)
b1 = b[:l2_harf]
b2 = b[l2_harf+1:][::-1]

if b1 == b2:
    count += 1

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

Submission status: Wrong Answer

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

count = 0
harf = int(l/2)
a = S[:harf]
b = S[harf+1:][::-1]

if a == b :
    count+=1

l = int((l-1)/2)
a = S[:l]
l1_harf = int(len(a)/2)
a1 = a[:l1_harf]
a2 = a[l1_harf+1:][::-1]

if a1==a2:
    count+=1

l2 = int((l+3)/2)
b = S[l2:l]
l2_harf = int(len(b)/2)
b1 = b[:l2_harf-1]
b2 = b[l2_harf+1:][::-1]

if b1 == b2:
    count += 1

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

Submission status: Wrong Answer

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

count = 0
harf = int(l/2)
a = S[:harf]
b = S[harf+1:][::-1]

print(a,b)

if a == b :
    count+=1

l = int((l-1)/2)
a = S[:l]
l1_harf = int(len(a)/2)
a1 = a[:l1_harf]
a2 = a[l1_harf+1:][::-1]

print(a,a1,a2)

if a1==a2:
    count+=1

l2 = int((l+3)/2)
b = S[l2:l]
l2_harf = int(len(b)/2)
b1 = b[:l2_harf-1]
b2 = b[l2_harf+1:][::-1]

print(l2,l2_harf,b,b1,b2)

if b1 == b2:
    count += 1

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

Submission status: Wrong Answer

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

count = 0
harf = int(l/2)
a = S[:harf]
b = S[harf+1:][::-1]

print(a,b)

if a == b :
    count+=1

l = int((l-1)/2)
a = S[:l]
l1_harf = int(len(a)/2)
a1 = a[:l1_harf]
a2 = a[l1_harf+1:][::-1]

print(a,a1,a2)

if a1==a2:
    count+=1

l2 = int((l+3)/2)+1
b = S[:l2]
l2_harf = int(len(b)/2)
b1 = b[:l2_harf]
b2 = b[l2_harf+1:][::-1]

print(b,b1,b2)

if b1 == b2:
    count += 1

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

Submission status: Wrong Answer

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

count = 0
harf = int(l/2)
a = S[:harf]
b = S[harf+1:][::-1]

if a == b :
    count+=1

l = int((l-1)/2)
a = S[:l]
l1_harf = int(len(a)/2)
a1 = a[:l1_harf]
a2 = a[l1_harf+1:][::-1]

if a1==a2:
    count+=1

l2 = int((l+3)/2)
b = S[:l2]
l2_harf = int(len(b)/2)
b1 = b[:l2_harf]
b2 = b[l2_harf+1:][::-1]

if b1 == b2:
    count += 1

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

Submission status: Wrong Answer

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

count = 0
harf = int(l/2)
a = S[:harf]
b = S[harf+1:][::-1]

if a == b :
    count+=1

quarter = int(l/2) - 1
a1 = a[:quarter-1]
a2 = a[quarter][::-1]

if a1==a2:
    count+=1

b1 = b[:quarter-1]
b2 = b[quarter][::-1]

if b1 == b2:
    count+=1

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

Submission status: Wrong Answer

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

if a == b and a == a[::-1] and b == b[::-1]:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

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

if a == b and a == a[::-1]:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

Solution code:
s = input()
n = len(s)
s1 = s[0:(n-1)//2]
s2 = s1[::-1]
s3 = s[(n+3)//2-1:n]
s4 = s3[::-1]
if s1 == s2 and s3 == s4:
  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 = input()

def pal(s):
  n = len(s)
  if s[: int((n-1)/2)] == s[int((n+3)/2 - 1) :]:
    return True
  else:
    return False

if pal(S):
  if pal(S[: int((len(S)-1)/2)]) and pal(S[int((len(S)+3)/2 - 1) :]):
    print("Yes")
    exit()

print("No")

Submission status: Wrong Answer

Solution code:
# B - String Palindrome
# https://atcoder.jp/contests/abc159/tasks/abc159_b

import sys

S = input()
N = len(S)

def is_palindrome(s):
    n = len(s)
    if n == 2:
        if s[0] == s[1]:
            return True
        else:
            return False
    else:
        if s[:n//2] == s[:n//2:-1]:
            return True
        else:
            return False

if not is_palindrome(S):
    print("No")
    sys.exit()

if not is_palindrome(S[:(N-1)//2]):
    print("No")
    sys.exit()

if not is_palindrome(S[(N+3)//2-1:]):
    print("No")
    sys.exit()

print("Yes")

Submission status: Wrong Answer

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


s = input()
if isPalindrome(s) and isPalindrome(s[0:3]) and isPalindrome(s[4:7]):
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
string=input()
stringLength=len(string)
answer="No"
middle=int(stringLength/2)
if string[0: middle]==string[(middle+1):] and string[0:int(middle/2)]==string[(int(middle/2)+1): middle]: answer= "Yes"
print(answer)

Submission status: Wrong Answer

Solution code:
string=input()
stringLength=len(string)
answer="No"
if stringLength>=7 and stringLength%2!=0:
  middle=int(stringLength/2)
  if string[0: middle]==string[(middle+1):] and string[0:int(middle/2)]==string[(int(middle/2)+1): middle]: answer= "Yes"
print(answer)

Submission status: Wrong Answer

Solution code:
S = input()
N = len(S) #lenはリアル個数を出力
ans = ""
for i in range(N // 2):
    if S[0 + i] == S[(N - 1) - i]:
        ans = "Yes"
    else:
        ans = "No"
        print("1")
        break
    if S[0 + i] == S[((N - 1) // 2) - 1 - i]:
        ans = "Yes"
    else:
        ans = "No"
        print("2")
        break
    if S[((N + 3) // 2) - 1 + i] == S[(N - 1) - i]:
        ans = "Yes"
    else:
        ans = "No"
        print(i, "3")
        break
print(ans)

Submission status: Wrong Answer

Solution code:
S = input()
N = len(S) #lenはリアル個数を出力
ans = ""
for i in range(N):
    if S[0 + i] == S[(N - 1) - i]:
        ans = "Yes"
        if S[0 + i] == S[((N - 1) // 2) - 1 - i]:
            ans = "Yes"
        else:
            ans = "No"
            break
            if S[((N + 3) // 2) - 1 - i] == S[(N - 1) - i]:
                ans = "Yes"
            else:
                ans = "No"
                break
    else:
        ans = "No"
        break
print(ans)

Submission status: Wrong Answer

Solution code:
def is_palindrome(text):
  mid = len(text) // 2
  # 奇数の場合
  if mid % 2 == 1:
    if text[:mid] == text[mid+1:][-1::-1]:
      return True
    else:
      return False
  # 奇数の場合
  else:
    if text[:mid] == text[mid:][-1::-1]:
      return True
    else:
      return False

s = input()

mid = len(s) // 2

front = s[:mid]       # 前半
back  = s[mid+1:]     # 後半
if is_palindrome(front) and is_palindrome(back):
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
def is_palindrome(text):
  mid = len(text) // 2
  # 奇数の場合
  if mid % 2 == 1:
    if text[:mid] == text[mid+1:][-1::-1]:
      return True
    else:
      return False
  # 奇数の場合
  else:
    if text[:mid] == text[mid:][-1::-1]:
      return True
    else:
      return False

s = input()

mid = len(s) // 2

if len(s) < 6:
  print("No")
else:
  front = s[:mid]       # 前半
  back  = s[mid+1:]     # 後半
  if is_palindrome(front) and is_palindrome(back):
    print("Yes")
  else:
    print("No")

Submission status: Wrong Answer

Solution code:
def is_palindrome(text):
  mid = len(text) // 2
  # 奇数の場合
  if mid % 2 == 1:
    if text[:mid] == text[mid+1:][-1::-1]:
      return True
    else:
      return False
  # 奇数の場合
  else:
    if text[:mid] == text[mid:][-1::-1]:
      return True
    else:
      return False

s = input()

mid = len(s) // 2

if len(s) < 6:
  print("No")
else:
  front = s[:mid]       # 前半
  back  = s[mid+1:]     # 後半
  if is_palindrome(front) and is_palindrome(back):
    if is_palindrome(s):
      print("Yes")
    else:
      print("No")
  else:
    print("No")

Submission status: Wrong Answer

Solution code:
def is_palindrome(text):
  mid = len(text) // 2
  if text[:mid] == text[mid+1:][-1::-1]:
    return True
  else:
    return False

s = input()

mid = len(s) // 2

if len(s) < 6:
  print("No")
else:
  front = s[:mid]       # 前半
  back  = s[mid+1:]     # 後半
  if is_palindrome(front) and is_palindrome(back):
    if is_palindrome(s):
      print("Yes")
    else:
      print("No")
  else:
    print("No")

Submission status: Wrong Answer

Solution code:
s = input()

len_s = len(s)
mid = len_s // 2

if len_s < 6:
  print("No")
else:
  front = s[:mid]       # 前半
  f_mid = len(front) // 2
  back  = s[mid+1:]     # 後半
  b_mid = len(back) // 2
  # front と back が回文か
  if front[:f_mid] == front[f_mid+1:][-1::-1] and back[:b_mid] == back[b_mid+1:][-1::-1]:
    if front == back[-1::-1]:
      print("Yes")
    else:
      print("No")
  else:
    print("No")

Submission status: Wrong Answer

Solution code:
s = input()

len_s   = len(s)
mid_num = len_s // 2

if len_s < 6:
  print("No")
else:
  front = s[:mid_num]       # 前半
  f_mid = len(front) // 2
  back  = s[mid_num+1:]     # 後半
  b_mid = len(back) // 2
  # front と back が回文か
  if front[:f_mid] == front[f_mid+1:] and back[:b_mid] == back[b_mid+1:]:
    if front == back[-1::-1]:
      print("Yes")
    else:
      print("No")
  else:
    print("No")

Submission status: Wrong Answer

Solution code:
#-String Palindrome
import math
character = input()
re_character = character[::-1]
 
num = int(len(character))
middle = math.ceil(num/2.0)
print(middle)
#print(character[0:middle-1], re_character[middle:num])
#print(character[0:num], re_character[0:num])
#print (character[middle:num], re_character[0:middle-1])

if (character[middle:num] == re_character[0:middle-1]):
  if (character[0:num] == re_character[0:num]):
    print("Yes")
  else:
    print("No")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
s = input()

len_s   = len(s)
mid_num = len_s // 2

if len_s < 6:
  print("No")
else:
  # 奇数条件を追加
  if len_s % 2 == 1:
    front = s[:mid_num]       # 前半
    back  = s[mid_num+1:]     # 後半
    if front == back[-1::-1]:
      print("Yes")
    else:
      print("No")
  else:
    print("No")

Submission status: Wrong Answer

Solution code:
s = input()

len_s   = len(s)
mid_num = len_s // 2

if len_s < 6:
  print("No")
else:
  front = s[:mid_num]   # 前半
  back  = s[mid_num+1:] # 後半
  if front == back[-1::-1]:
    print("Yes")
  else:
    print("No")

Submission status: Wrong Answer

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

print(S == ''.join(list(reversed(S))) and
S[0:int((N-1)/2)] == ''.join(list(reversed(S[0:int((N-1)/2)]))) and
S[int((N+3)/2):-1] == ''.join(list(reversed(S[int((N+3)/2):-1]))))

Submission status: Wrong Answer

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

def is_palindrome(s):
  return s == s[::-1]

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

Submission status: Wrong Answer

Solution code:
a = input()
if a == a[::-1]:
    b = a[:int((len(a) - 1) / 2)]
    c = a[int((len(a) + 3) / 2):]
    if b == b[::-1] and c == c[::-1]:
        print('Yes')
        exit(0)
print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
S = str(input())

N=len(S)

s1=S[:int((N-1)/2)]
s2=S[int((N+3)/2-1):]

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

Submission status: Wrong Answer

Solution code:
s = list(input())
n = len(s)
one=(n-1)//2
two=(n+3)//2
s_1 = s[:one]
s_2 = s[two-1:]
if s_1 == list(reversed(s_1)):
    if s_2 == list(reversed(s_2)):
        if s == list(reversed(s)):
            print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Thu Mar 19 11:55:12 2020

@author: 17664
"""
kaibun = input()
joken1 = kaibun[:(len(kaibun)-1)//2]
# print(joken1)
joken2 = kaibun[(len(kaibun)+2)//2:]
# print(joken2)

ans = 'no'

if kaibun == kaibun[::-1] and joken1 == joken1[::-1] and joken2 == joken2[::-1]:
    ans = 'yes'
    
print(ans)

Submission status: Wrong Answer

Solution code:
s = list(input())
n = len(s)
one=(n-1)//2
two=(n+3)//2
s_1 = s[:one]
s_2 = s[two-1:]
if s_1 == list(reversed(s_1)):
    if s_2 == list(reversed(s_2)):
        print('Yes')
    else:
        print('No')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
s = list(input())
n = len(s)
one=(n-1)//2
two=(n+3)//2
s_1 = s[:one]
s_2 = s[two-1:]
if s_1 == list(reversed(s_1)):
    if s_2 == list(reversed(s_2)):
        print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Thu Mar 19 11:55:12 2020

@author: 17664
"""
kaibun = input()
joken1 = kaibun[:(len(kaibun)-1)//2]
# print(joken1)
joken2 = kaibun[(len(kaibun)+2)//2:]
# print(joken2)

ans = 'yes'

if kaibun != kaibun[::-1]:
    ans = 'no'
if joken1 != joken1[::-1]:
    ans = 'no'
if joken2 != joken2[::-1]:
    ans = 'no'
    
print(ans)

Submission status: Wrong Answer

Solution code:
#-String Palindrome
import math
character = input()
re_character = character[::-1]
 
num = int(len(character))
middle = math.ceil(num/2.0)

#print(character[0:middle-1], re_character[middle:num])
#print(character[0:num], re_character[0:num])
#print (character[middle:num], re_character[0:middle-1])

if (character[middle:num] == re_character[0:middle-1]):
  if (character[0:num] == re_character[0:num]):
    print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
#-String Palindrome
import math
character = input()
re_character = character[::-1]
 
num = int(len(character))
middle = math.ceil(num/2.0)

#print(character[0:middle-1] == re_character[middle:num])
#print(character[0:num] == re_character[0:num])
#print (character[middle:num] == re_character[0:middle-1])

if (character[0:num] == re_character[0:num]):
    if (character[middle:num] == re_character[0:middle-1]):
      print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
#-String Palindrome
import math
character = input()
re_character = character[::-1]

num = int(len(character))
middle = math.ceil(num/2.0)

if (character[0:num] == re_character[0:num]):
  if (character[0:middle-1] == re_character[middle:num]):
    if (character[middle:num] == re_character[0:middle-1]):
      print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
S = list(input())
N = len(S)
f = S[:(N-1)//2]
r = S[(N+1)//2:]

if f == f[::-1] and r == r[::-1]:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
S = input()
message = "No"
if S == S[::-1]:
	index = int(((len(S)-1)-1)/2)
	print(index)
	test = S[:index+1]
	print(test)
	if test == test[::-1]:
		index = int(((len(S)-1)+3)/2)
		print(index)
		test = S[index:]
		print(test)
		if test == test[::-1]:
			message = "Yes"
print(message)

Submission status: Wrong Answer

Solution code:
S = input()
message = "No"
if S == S[::-1]:
	index = int((len(S)-1)/2)
	test = S[:index]
	print(test)
	if test == test[::-1]:
		index = int((len(S)+3)/2)
		test = S[index-1:]
		print(test)
		if test == test[::-1]:
			message = "Yes"
print(message)

Submission status: Wrong Answer

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

front = s[:(n-1)//2]
rear = s[(n+1)//2:]

if s == s[::-1] and front == rear[::-1]:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

Solution code:
S = input().strip('\n')
S1=S[:(len(S)-1)//2]
S2=S[(len(S)-1)//2+1:]
flag=True
for i in range(len(S)//2//2):
    if S1[i]!=S2[-i-1] or S1[i]!=S1[-i-1] or S2[i]!=S2[-i-1]:
        flag=False
print('Yes' if flag else 'No')

Submission status: Wrong Answer

Solution code:
S = input().strip('\n')
S1=S[:(len(S)-1)//2]
S2=S[(len(S)-1)//2+1:]
flag=True
for i in range(len(S)//2//2):
    print(S1[i]+S1[-i-1]+S2[i]+S2[-i-1])
    if S1[i]!=S2[-i-1] or S1[i]!=S1[-i-1] or S2[i]!=S2[-i-1]:
        flag=False
print('Yes' if flag else 'No')

Submission status: Wrong Answer

Solution code:
S = input().strip('\n')
S1=S[:(len(S)-1)//2]
S2=S[(len(S)-1)//2+1:]
flag=True
if (len(S)-1)//2%2==1:
    for i in range(len(S)//2//2): 
        if S1[i]!=S2[-i-1] or S1[i]!=S1[-i-1] or S2[i]!=S2[-i-1]:
            flag=False
print('Yes' if flag else 'No')

Submission status: Wrong Answer

Solution code:
S = input().strip('\n')
S1=S[:(len(S)-1)//2]
S2=S[(len(S)-1)//2+1:]
flag=True
if (len(S)-1)//2%2==1:
    for i in range(((len(S)-1)//2-1)//2): 
        if S1[i]!=S1[-i-1] or S2[i]!=S2[-i-1]:
            flag=False
else:
    for i in range((len(S)-1)//2//2): 
        if S1[i]!=S1[-i-1] or S2[i]!=S2[-i-1]:
            flag=False
print('Yes' if flag else 'No')

Submission status: Wrong Answer

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

'''
akasaka
'''

import sys

S = input()

for i in range(len(S)):
    if not S[i] == S[len(S)-1 - i]:
        print('No')
        sys.exit()


newS = list(S)[:int((len(S)-1)/2)]
# print(newS)

for i in range(len(S)):
    if not S[i] == S[len(S) - 1 - i]:
        print('No')
        sys.exit()

newS = list(S)[int((len(S)+3)/2 - 1):]
# print(newS)

for i in range(len(newS)):
    if not S[i] == S[len(S) - 1 - i]:
        print('No')
        sys.exit()

print('Yes')

Submission status: Wrong Answer

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

'''
akasaka
'''

import sys

S = input()

for i in range(len(S)):
    if not S[i] == S[len(S)-1 - i]:
        print('No')
        sys.exit()

    if i < (len(S)-1)/2:
        if not S[i] == S[int((len(S)-1)/2) -1 - i]:
            print('No')
            sys.exit()

# print(list(S))
# print(len(S))
# print(int((len(S)+3)/2)-1)
newS = list(S)[int((len(S)+3)/2 -1):]
print(newS)

for i in range(len(newS)):
    if not S[i] == S[len(S) - 1 - i]:
        print('No')
        sys.exit()

print('Yes')

Submission status: Wrong Answer

Solution code:
S = list(input())
N1 = int(len(S))
N2 = int((N1-1)/2)

if S[:N2] == S[N2-1::-1] or N1 == 1:
	if S == S[::-1]:
		print("Yes")
else:
	print("No")

Submission status: Wrong Answer

Solution code:
S = list(input())
N1 = int(len(S))
N2 = int((N1-1)/2)
if S[:N2] == S[N2-1::-1]:
	if S == S[::-1]:
		print("Yes")
else:
	print("No")

Submission status: Wrong Answer

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

check = 0
for i in range(int((N+1)/2)):
    if S[i] != S[N-1-i]:
        check +=1
    else:
        check +=0


S_1 = S[0:int((N-1)/2)]
N_1 = len(S_1)
check_1 = 0

for i in range(int((N_1+1)/2)):
    if S_1[i] != S_1[N_1-1-i]:
        check_1 +=1
    else:
        check_1 +=0

        
S_2 = S[int((N+5)/2):N]
N_2 = len(S_2)
check_2 = 0

for i in range(int((N_2+1)/2)):
    if S_2[i] != S_2[N_2-1-i]:
        check_2 +=1
    else:
        check_2 +=0

if check + check_1 + check_2 ==0:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

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

if n & 1 == 0 or int( (n-1)/2 ) & 1 == 0:
  flg = False
else:
  for i in range( int((n-1)/2) ):
    if s[i] != s[n-i-1]:
      flg = False
      break
  
  if flg:
    p = s[0:int((n-1)/2)]
    m = len(p)
    for i in range( int((m-1)/2) ):
      if p[i] != p[m-i-1]:
        flg = False
        break

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

Submission status: Wrong Answer

Solution code:
s=input();print(' YNeos'[s[:3]in s[2:]::2])

Submission status: Wrong Answer

Solution code:
s=input();print(' YNeos'[s[:5]in s[2:]::2])

Submission status: Wrong Answer

Solution code:
S = input()

N = len(S)
a = int((N - 1) / 2)
b = int((N + 3) / 2)
A = S[:a]
B = S[b - 1:]

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

Submission status: Wrong Answer

Solution code:
S = input()

N = len(S)
a = int((N - 1) / 2)
b = int((N + 3) / 2)
if (S[:a] == S[:a][::-1]) and (S[b - 1:] == S[b - 1:][::-1]):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
S = input()

N = len(S)
a = int((N - 1) / 2)
if S[:a] == S[:a][::-1] and S[a + 1:] == S[a + 1:][::-1]:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
S = input()
 
def kaibunn_boolean(s):
  return s == s[::-1]
 
ans = False
 
if kaibunn_boolean(S) and kaibunn_boolean(S[:(len(S)-1)//2]) and kaibunn_boolean(S[-(len(S)+3)//2:]):
  ans = True
 
if ans:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

Solution code:
S = input()
 
def kaibunn_boolean(s):
  return s == s[::-1]
 
ans = False
 
if kaibunn_boolean(S) and kaibunn_boolean(S[:3]) and kaibunn_boolean(S[-3:]):
  ans = True
 
if ans:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

Solution code:
S = input()
 
def kaibunn_boolean(s):
  return s == s[::-1]
 
ans = False
 
if kaibunn_boolean(S) and kaibunn_boolean(S[:3]) and kaibunn_boolean(S[-3:]):
  ans = kaibunn_boolean(S)
 
if ans:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

Solution code:
def is_kaibun(s):
  s_len = len(s)
  is_kaibun = True
  for i in range(s_len//2):
    is_kaibun = (s[i] == s[-(i+1)])
  return is_kaibun

s = input()
N = len(s)
s1 = s[:(N+1)//2-1]
s2 = s[(N+3)//2-1:]
if is_kaibun(s) and is_kaibun(s1) and is_kaibun(s2):
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
S = str(input())

Scount = len(S)
Sfront = S[:int(Scount/2)]
Sback = S[int(Scount/2)+1:Scount]

if Sfront==Sfront[::-1] and Sback==Sback[::-1] and Sfront != 1:
    print("Yes")
else:
    print("No")

def palindrome(string): return 0 if string==string[::-1] else 1

Submission status: Wrong Answer

Solution code:
S = str(input())

Scount = len(S)
Sfront = S[:int(Scount/2)]
Sback = S[int(Scount/2)+1:Scount]

if Sfront==Sfront[::-1] and Sback==Sback[::-1]:
    print("Yes")
else:
    print("No")

def palindrome(string): return 0 if string==string[::-1] else 1

Submission status: Wrong Answer

Solution code:
s = input()

def sep(str):
	return (str[:(len(str)-1)//2],str[(len(str)+3)//2-1:len(str)])

flag = False
while 1:
	left,right = sep(s)
	if left == right:
		if len(left) == 1:
			flag = True
			break
		s = left
	else:
		break
if flag:
	print("Yes")
else:
	print("No")

Submission status: Wrong Answer

Solution code:
S = input()
L = list(S)
len = int(len(L))

L1 = L[:(len-1)//2]
L1_r = L1[::-1]
L2 = L[(len+3)//2-1:]
L2_r = L2[::-1]

if L1==L1_r and L2==L2_r:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
S = input()
L = list(S)
#print(L)
len = int(len(L))

L1 = L[:(len-1)//2]
L1_r = L1[::-1]
L2 = L[(len+3)//2-1:]
L2_r = L2[::-1]

if(L1==L1_r and L2==L2_r):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
S = input()
L = list(S)
len = int(len(L))

L1 = L[:(len-1)//2]
L1_r = L1[::-1]
L2 = L[(len+3)//2-1:]
L2_r = L2[::-1]

if(L1==L1_r and L2==L2_r):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
S = input()
L = list(S)
len = int(len(L))

L1 = L[:(len-1)//2]
L1_r = L1[::-1]
L2 = L[(len+3)//2-1:]
L2_r = L2[::-1]

if(L1==L1_r and L2==L2_r):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
S = "aacbaoooooo"

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)