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:
import copy
a = list(input())
if len(a)%4 != 3:
  print("No")
  exit()
else:
  b = copy.copy(a)
  b.reverse()
  x = int((len(a)-1)/2)
  for i in range(x):
    if a[i] != b[i]:
      print("No")
      exit()
  c = a[:x]
  d = a[x+1:]
  y = int((len(c)-1)/2)
  for i in range(y):
    if c[i] != c[len(c)-i-1] or d[i] != d[len(c)-i-1]:
      print("No")
      exit()
  print("Yes")

Submission status: Wrong Answer

Solution code:
a = list(input())
if len(a)%4 != 3:
  print("No")
  exit()
else:
  b = a
  b.reverse()
  x = int((len(a)-1)/2)
  for i in range(x):
    if a[i] != b[i]:
      print("No")
      exit()
  c = a[:x]
  d = a[x+1:]
  y = int((len(c)-1)/2)
  for i in range(y):
    if c[i] != c[len(c)-i-1] or d[i] != d[len(c)-i-1]:
      print("No")
      exit()
  print("Yes")

Submission status: Wrong Answer

Solution code:
a = list(input())
if len(a)%4 != 3:
  print("No")
  exit()
else:
  b = a
  b.reverse()
  x = int((len(a)-1)/2)
  for i in range(x):
    if a[i] != b[i]:
      print("No")
      exit()
  c = a[:x]
  d = a[x+1:]
  print(c,d)
  y = int((len(c)-1)/2)
  for i in range(y):
    if c[i] != c[len(c)-i-1] or d[i] != d[len(c)-i-1]:
      print("No")
      exit()
  print("Yes")

Submission status: Wrong Answer

Solution code:
a = list(input())
if len(a)%4 != 3:
  print("No")
  exit()
else:
  b = a
  b.reverse()
  x = int((len(a)-1)/2)
  for i in range(x):
    if a[i] != b[i]:
      print("No")
      exit()
  c = a[:x]
  d = a[x+1:]
  print(c,d)
  y = int((len(c)-1)/2)
  for i in range(y):
    if c[i] != c[len(c)-i-1] and d[i] != d[len(c)-i-1]:
      print("No")
      exit()
  print("Yes")

Submission status: Wrong Answer

Solution code:
a = list(input())
if len(a)%4 != 3 or len(a) == 3:
  print("No")
  exit()
else:
  b = a
  b.reverse()
  x = int((len(a)-1)/2)
  for i in range(x):
    if a[i] != b[i]:
      print("No")
      exit()
  c = a[:x]
  d = a[x+1:]
  for i in range(len(c)):
    if c[i] != d[i]:
      print("No")
      exit()
  print("Yes")

Submission status: Wrong Answer

Solution code:
a = list(input())
if len(a)%4 != 3:
  print("No")
  exit()
else:
  b = a
  b.reverse()
  x = int((len(a)-1)/2)
  for i in range(x):
    if a[i] != b[i]:
      print("No")
      exit()
  c = a[:x]
  d = a[x+1:]
  for i in range(len(c)):
    if c[i] != d[i]:
      print("No")
      exit()
  print("Yes")

Submission status: Wrong Answer

Solution code:
import sys
S = list(input())
for i in range((len(S)//2)-1):
    if S[i] != S[len(S)-1-i]:
        print('No')
        sys.exit()
       
for j in range((len(S)//4)-1):
    if S[j] != S[(len(S)//2)-j-1]:
        print('No')
        sys.exit()

for k in range((len(S)//4)-1):
    if S[(len(S)//2)+1+k] != S[len(S)-k-1]:
        print('No')
        sys.exit()

print('Yes')

Submission status: Wrong Answer

Solution code:
# coding: utf-8
# Your code here!
def main():
    s = input()
    n = len(s)
    s1 = s[:int((n-1)/2)]
    s2 = s[int((n+3)/2)+1:]
    
    for tmp in [s, s1, s2]:
        tmp_rev = tmp[::-1]
        # print(tmp, tmp_rev)
        if tmp != tmp_rev:
            print("No")
            break
    else:
        print("Yes")
    
main()

Submission status: Wrong Answer

Solution code:
# coding: utf-8
# Your code here!
def main():
    s = input()
    n = len(s)
    s_reverse = s[::-1]
    if s != s_reverse:
        print("No")
        return 0
    # print("1")
    s_tmp = s[:int((n-1)/2)]
    # print(s_tmp)
    s_tmp_reverse = s_tmp[::-1]
    if s_tmp != s_tmp_reverse:
        print("No")
        return 0
    # print("2")
    s_tmp = s[int((n+3)/2)+1:]
    s_tmp_reverse = s_tmp[::-1]
    if s_tmp != s_tmp_reverse:
        print("No")
        return 0
    print("Yes")
    return 0
    
main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def main():
    s = input()
    s1 = s[:int((len(s)-1)/2)]
    s2 = s[int((len(s)+3)/2-1):]
    rs1 = s1[::-1]
    rs2 = s2[::-1]

    if s1 == rs1 and s2 == rs2:
        print("Yes")
    else:
        print("No")
    
    return
    
main()

Submission status: Wrong Answer

Solution code:
S = input()
N = len(S)
S_list=[]
for i in S:
    S_list.append(i)   
rS_list = list(reversed(S_list))
second_list = S_list[:(int((N-1)/2))]
print(f'second: {second_list}')
rsecond_list = list(reversed(second_list))
third_list = S_list[(int(((N+3)-1)/2)):N]
print(f'third: {third_list}')
rthird_list = list(reversed(third_list))
if S_list == rS_list:
    #print(f'壱: OK')
    if second_list == rsecond_list:
        #print(f'弐: OK')
        if third_list == rthird_list:
            #print(f'参: OK')
            print('Yes')       
    else:
            print('No')   
else:
            print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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


subS1 = S[:int((N - 1) / 2)]
subS2 = S[int((N + 3) / 2) - 1:]

if subS1 == subS1[::-1] and subS2 == subS2[::-1]:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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


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

Submission status: Wrong Answer

Solution code:
s=input()

n=len(s)
k=s[:(n-1)//2]
kk=s[(n+3)//2-1:]

ck= k[len(k)//2+1:]

if k[:len(k)//2] == k[len(k)//2+1:] and kk[:len(kk)//2] == kk[len(kk)//2+1:]:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

Solution code:
# String Palindrome
def is_palindrome(s):
    res = s == s[::-1]
    return res

S = input()
N = len(S)
ans = ['No', 'Yes'][is_palindrome(S[:((N-1)//2)]) & is_palindrome(S[((N+1)//2):])]
print(ans)

Submission status: Wrong Answer

Solution code:
s=input()
n=len(s)
a=s[0:(n-1)//2]
b=s[(n+3)//2-1:n]
c=a[::-1]
d=b[::-1]
for i in range(len(a)):
    if a[i]==c[i]:
        pass
    else:
        print("No")
        exit()
for i in range(len(b)):
    if b[i]==d[i]:
        pass
    else:
        print("No")
        exit()
print("Yes")

Submission status: Wrong Answer

Solution code:
S=input()
N=len(S)
SH=S[:(N-1)//2]
ST=S[(N+3)//2-1:]
p=False
if SH==SH[::-1] and ST==ST[::-1]:
  p=True
print("Yes" if p else "No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:


S = input()

def is_kaibun(s):
    l = len(s)
    print('former', s[:int(l/2)])
    print('latter', s[:-(int(l/2))-1:-1])
    if s[:int(l/2)] == s[:-(int(l/2))-1:-1]:
        return True
    else:
        return False

if is_kaibun(S):
    if is_kaibun(S[:int((len(S)-1)/2)]):
        if is_kaibun(S[int((len(S)+3)/2)-1:]):
            print('Yes')
            exit()
print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def judge_palindrome(string):
    """
    文字列を引数に、回文か否かを判別する。
    string：文字列
    return True or False
    """
    # 文字数
    str_count = len(string)
    # 文字列の先頭にダミー文字を挿入
    string = '0' + string
    # 偶数
    if str_count % 2 == 0:
        for i in range(1, (str_count//2)+1):
            if string[i] == string[-i]:
                pass
            else:
                return False
    # 奇数
    if str_count % 2 == 1:
        for i in range(1, (str_count+1)//2):
            if string[i] == string[-i]:
                pass
            else:
                return False
    return True

def string_palindrome():
    # 入力
    S = input()
    # 初期処理
    N = len(S) # 文字列の長さ
    is_palindrome = list() # 条件１，２で回文か否かを保存
    string = list()
    # 条件設定
    string.append(S[0:(N-1)//2]) # 条件１
    string.append(S[(N+3)//2-1:N]) # 条件２
    for i in range(2):
        result = judge_palindrome(string[i])
        is_palindrome.append(result)
    # 戻り値
    if is_palindrome[0] and is_palindrome[1]:
        return 'Yes'
    else:
        return 'No'

result = string_palindrome()
print(result)

Submission status: Wrong Answer

Solution code:
def judge_palindrome(string):
    """
    文字列を引数に、回文か否かを判別する。
    引数：string
    戻り値：True or False
    """
    # 文字数
    str_count = len(string)
    # 文字列の先頭にダミー文字を挿入
    string = '0' + string
    # 偶数
    if str_count % 2 == 0:
        for i in range(1, (str_count//2)+1):
            if string[i] == string[-i]:
                pass
            else:
                return False
    # 奇数
    if str_count % 2 == 1:
        for i in range(1, (str_count+1)//2):
            if string[i] == string[-i]:
                pass
            else:
                return False
    return True

def string_palindrome():
    # 入力
    S = input()
    # 初期処理
    N = len(S) # 文字列の長さ
    is_palindrome = list() # 条件１，２で回文か否かを保存
    # 条件１判定
    str1 = S[0:(N-1)//2] # 判定文字列
    result = judge_palindrome(str1)
    is_palindrome.append(result)
    # 条件２判定
    str2 = S[(N+3)//2-1:N] # 判定文字列
    result = judge_palindrome(str2)
    is_palindrome.append(result)
    # 戻り値
    if is_palindrome[0] and is_palindrome[1]:
        return 'Yes'
    else:
        return 'No'

result = string_palindrome()
print(result)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

s_lh_r = s[n//2+1:][::-1]
s_fh = s[:n//2]

if not s_lh_r == s_fh:
    print("No")
    exit()

n = len(s_fh)

if not s_fh[:n//2] == s_fh[n//2+1:][::-1] or not s_lh_r[:n//2] == s_lh_r[n//2+1:][::-1]:
    print("No")
    exit()

print("Yes")

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
# Generated by https://github.com/kyuridenamida/atcoder-tools
from typing import *
import collections
import functools
import itertools
import math
import sys

INF = float('inf')
YES = "Yes"  # type: str
NO = "No"  # type: str


def is_palindrome(s: str):
    return s[:len(s)//2] == s[:len(s)//2:-1]


def solve(S: str):
    return [NO, YES][is_palindrome(S) and is_palindrome(S[:(len(S)-1)//2-1+1]) and is_palindrome(S[(len(S)+3)//2-1:])]


def main():

    sys.setrecursionlimit(10 ** 6)

    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    S = next(tokens)  # type: str
    print(f'{solve(S)}')


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
# Generated by https://github.com/kyuridenamida/atcoder-tools
from typing import *
import collections
import functools
import itertools
import math
import sys

INF = float('inf')
YES = "Yes"  # type: str
NO = "No"  # type: str


def is_palindrome(s: str):
    return s[:len(s)//2] == s[:len(s)//2:-1]


def solve(S: str):
    return [NO, YES][is_palindrome(S) and is_palindrome(S[:((len(S)-1)//2)-1+1]) and is_palindrome(S[((len(S)+3)//2)-1:])]


def main():

    sys.setrecursionlimit(10 ** 6)

    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    S = next(tokens)  # type: str
    print(f'{solve(S)}')


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import numpy as np


def check_pali(S):
    for i in range(0, len(S)):
        if S[i] != S[-1 * i + -1]:
            return False

        # elif i > (len(S) / 2) + 1:
        #     break

    return True


S = input()

N = len(S)

short_N = (N - 1) // 2
long_N = (N + 3) // 2


if check_pali(S[0:short_N]) & check_pali(S[long_N-1:N]):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
import numpy as np


def check_pali(S):
    for i in range(0, len(S)):
        if S[i] != S[-1 * i + -1]:
            return False

        elif i > (len(S) / 2) + 1:
            break

    return True


S = input()

N = len(S)

short_N = (N - 1) // 2
long_N = (N + 3) // 2

if check_pali(S[0:short_N]) & check_pali(S[long_N-1:N]):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
s = input()
a = s[: len(s) // 2]
b = s[(len(s) + 1) // 2 :]
if a == a[::-1] and b == b[::-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 == a[::-1] and b == b[::-1]:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
S = input()

s = list(S)
f = s[:int((len(s)-1)/2)]
l = s[int((len(s)+3)/2-1):]

if f == l:
    while len(f) > 1:
        if f[0] == f[-1]:
            f.pop(0)
            f.pop()
    if len(f) == 1:
        while len(l) > 1:
            if l[0] == l[-1]:
                l.pop(0)
                l.pop()
        if len(l) == 1:
            print('Yes')
        else:
            print('No')
    else:
        print('No')
else:
    print('No')

Submission status: Wrong Answer

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

else:
	print("No")

Submission status: Wrong Answer

Solution code:
s=input()
n=len(s)
 
if s==reversed(s) and s[0:(n-1)//2]==reverses(s[0:(n-1)//2]) and s[((n+3)//2)-1:n]==reversed(s[((n+3)//2)-1:n]):
	print("Yes")

else:
	print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys
S = input()

if not S.islower():sys.exit()
if not ( 3 <= len(S) <= 99 and len(S) % 2 == 1 ): sys.exit()
first = int((len(S)-1)/2)
F = S[0:first]
second = int((len(S)+3)/2)
S = S[second-1:]

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

Submission status: Wrong Answer

Solution code:
import sys
S = input()

if not S.islower():sys.exit()
if not ( 3 <= len(S) <= 99 and len(S) % 2 == 1 ): sys.exit()
first = int((len(S)-1)/2)
F = S[0:first]
second = int((len(S)+3)/2)
S = S[second-1:]

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

Submission status: Wrong Answer

Solution code:
from sys  import stdin,stdout

import bisect

import math

def st():
    return list(stdin.readline().strip())

def inp():
    return int(stdin.readline())

def li():
    return list(map(int,stdin.readline().split()))

def mp():
    return map(int,stdin.readline().split())

def pr(n):
    stdout.write(str(n)+"\n")

def soe(limit):
    l=[1]*(limit+1)
    prime=[]
    for i in range(2,limit+1):
        if l[i]:
            for j in range(i*i,limit+1,i):
                l[j]=0

    for i in range(2,limit+1):
        if l[i]:
            prime.append(i)
    return prime

def segsoe(low,high):
    limit=int(high**0.5)+1
    prime=soe(limit)
    n=high-low+1
    l=[0]*(n+1)
    for i in range(len(prime)):
        lowlimit=(low//prime[i])*prime[i]
        if lowlimit<low:
            lowlimit+=prime[i]
        if lowlimit==prime[i]:
            lowlimit+=prime[i]
        for j in range(lowlimit,high+1,prime[i]):
            l[j-low]=1
    for i in range(low,high+1):
        if not l[i-low]:
            if i!=1:
                print(i)

def power(a,n):
    r=1
    while n:
        if n&1:
            r=(r*a)
        a*=a
        n=n>>1
    return r


def solve():
    s=input()
    n=len(s)
    a=s[:(n-1)//2]
    b=a[::-1]
    c=s[(n+3)//2:]
    d=c[::-1]
    if s==s[::-1] and a==b and c==d:
        print("Yes")
    else:
        print("No")


for _ in range(1):
    solve()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

hantei=0
for i in range(len(s)):
    if s[i]==s[mozisuu-i-1]:
        hantei+=1

j=(mozisuu-1)//2

for i in range(j):
    if s[i]==s[j-i-1]:
        hantei+=1

j=(mozisuu+3)//2

for i in range(j-1,mozisuu):
    if s[i]==s[j-i-1]:
        hantei+=1

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def string_palindrome():
    # 入力
    S = input()
    # 初期処理
    N = len(S)
    condition1 = int((N-1)/2)
    condition2 = int((N+3)/2)
    # 回文判定
    # 条件1
    cond1_string1 = S[0:condition1]
    cond1_string2 = '0'+cond1_string1
    stop = int((len(cond1_string1)-1/2)+1)
    for i in range(1,stop):
        if cond1_string2[i] == cond1_string2[-i]:
            pass
        else:
            return 'No'
    # 条件2
    cond2_string1 = S[-1:condition2-1]
    cond2_string2 = '0'+cond2_string1
    stop = int((len(cond2_string1)-1/2)+1)
    for i in range(1,stop):
        if cond2_string2[i] == cond2_string2[-i]:
            pass
        else:
            return 'No'
    # 条件1，2をクリア
    return 'Yes'

result = string_palindrome()
print(result)

Submission status: Wrong Answer

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

s_first = s[0:(N-1)//2]
s_second = s[(N+1)//2:]

if(s_first == s_first[::-1] and s_second == s_second[::-1]):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

s_first = s[0:(N-1)//2]
s_second = s[(N+1)//2:]

for i in range(len(s_first)):
    if(s_first[i] != s_first[::-1][i] or s_second[i] != s_second[::-1][i]):
        print("No")
        break
else:
    print("Yes")

Submission status: Wrong Answer

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

s_first = s[0:int((N-1)/2)]
s_second = s[int((N+1)/2):]

for i in range(len(s_first)):
    if(s_first[i] != s_first[::-1][i] or s_second[i] != s_second[::-1][i]):
        print("No")
        break
else:
    print("Yes")

Submission status: Wrong Answer

Solution code:
S=input()
i=0
kot=[]
for a in S:
    kot.append(a)
tok=list(reversed(kot))


for a in range(len(kot)):
    if kot[a]==tok[a]:
        i=0
    else:
        print("No")
        i=1
        break
if i==0:
    for a in range(int((len(kot)-1)/2)):
        if kot[a]==tok[int((len(kot)-1)/2)-a-1]:
            i=0
        else:
            print("No")
            i=1
            break
print(i)
if i==0:
        for a in range(int((len(kot)-1)/2)):
            if kot[int((len(kot)+3)/2)+a-1]==tok[-a-1]:
                i=0

            else:
                print("No")
                i=1
                break
print(i)
if i==0:
    print("Yes")

Submission status: Wrong Answer

Solution code:
S=input()
i=0
kot=[]
for a in S:
    kot.append(a)
tok=list(reversed(kot))

print(tok)
print(kot)
for a in range(len(kot)):
    if kot[a]==tok[a]:
        i=0
    else:
        print("No")
        i=1
        break
if i==0:
    for a in range(int((len(kot)-1)/2)):
        if kot[a]==tok[int((len(kot)-1)/2)-a-1]:
            i=0
        else:
            print("No")
            i=1
            break
print(i)
if i==0:
        for a in range(int((len(kot)-1)/2)):
            if kot[int((len(kot)+3)/2)+a-1]==tok[-a-1]:
                i=0

            else:
                print("No")
                i=1
                break
print(i)
if i==0:
    print("Yes")

Submission status: Wrong Answer

Solution code:
S=input()
i=0
kot=[]
for a in S:
    kot.append(a)
tok=kot
tok.reverse()
for a in range(len(kot)):
    if kot[a]==kot[a]:
        i=0
    else:
        print("No")
        i=1
        break
if i==0:
    for a in range(int((len(kot)-1)/2)):
        if kot[a]==tok[int((len(kot)-1)/2)-a-1]:
            i=0
        else:
            print("No")
            i=1
            break

if i==0:
        for a in range(int((len(kot)-1)/2)):
            if kot[int((len(kot)+3)/2)+a-1]==tok[-a-1]:
                i=0

            else:
                print("No")
                i=1
                break

if i==0:
    print("Yes")

Submission status: Wrong Answer

Solution code:
S = input()
N = len(S)
 
def isp(s):
  n = len(s)
  for i in range(n // 2 - 1):
    if s[i] != s[n - 1 - i]:
      return False
  return True
 
if isp(S) and isp(S[0:(N - 1) // 2]):
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
S=input()
a=(S[0]+S[1]+S[2])
b=(S[-1]+S[-2]+S[-3])
if a==b:
    A=a[::-1]
    B=b[::-1]
    if A==a and B==b:
        print('Yes')
    else:
        print('No')
else:
    print('No')

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def is_kaibun(string):
    isk = True
    length = len(string)
    for i in range(length // 2):
        if string[i] != string[length - 1 - i]:
            isk = False
            break
    return isk

s = input()
len_s = len(s)
if is_kaibun(s[0:(len_s // 2)]) and is_kaibun(s[(len_s // 2) + 1:len_s]):
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

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

a = S[:(l-1)//2]
a1 = ''.join(list(reversed(a)))

b = S[(l+3)//2-1:l]
b1 = ''.join(list(reversed(b)))

if a == a1 and b == b1:
    print('Yes')
if a != a1 or b != b1:
    print('No')

Submission status: Wrong Answer

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

a = S[:(l-1)//2]
a1 = ''.join(list(reversed(a)))

b = S[(l+3)//2-1:l]
b1 = ''.join(list(reversed(b)))

if a == a1 and b == b1:
    print('Yes')
if a != a1 and b != b1:
    print('No')

Submission status: Wrong Answer

Solution code:
s = input()
n = len(s)
sd = s[::-1]
a = s[:int((n-1)/2)]
ad = a[::-1]
b = s[int((n+3)/2-1):]
bd = b[::-1]
print(s,sd,a,ad,b,bd)
if s == sd and a == ad and b == bd:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
S=str(input())
N=len(S)
if S!=S[::-1]:#Sと反転したSが不一致
    print('No')
else:
    S1=S[0:(N-1)//2]#Sが1文字目～(N-1)/2番目の場合
    S2=S[(N+3)//2:N]#Sが(N+3)/2～N番目の場合
    if S1==S1[::-1] and S2==S2[::-1]:
        print('Yes')
    else:
        print('No')

Submission status: Wrong Answer

Solution code:
S = input()
N = len(S)
x = 0
M = int((N - 1) / 2)
L = int((N + 3) / 2 - 1)

if S != S[ : :-1]:
    x += 1

if S[ :M] != S[ :M:-1]:
    x += 1

if S[L:N] != S[L:N:-1]:
    x += 1

if x == 0:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
def palindrome(S):
  for i in range(len(S)//2):
#    print(S[i],S[-(i+1)])
    if S[i] != S[-(i+1)]:
      return 0
  return 1
ans = "No"
S = input()
S1 = S[:(len(S)-1)//2]
S2 = S[(len(S)+1)//2:]
print(palindrome(S))
print(palindrome(S1))
print(palindrome(S2))

if palindrome(S) == 1:
  if palindrome(S1) == 1:
    if palindrome(S2) == 1:
      ans = "Yes"
print(ans)

Submission status: Wrong Answer

Solution code:
def palindrome(S):
  for i in range(len(S)//2):
#    print(S[i],S[-(i+1)])
    if S[i] != S[-(i+1)]:
      return 0
  return 1
ans = "No"
S = input()
S1 = S[:(len(S)-1)//2]
S2 = S[(len(S)+3)//2:]
if palindrome(S) == 1:
  if palindrome(S1) == 1:
    if palindrome(S2) == 1:
      ans == "Yes"
print(ans)

Submission status: Wrong Answer

Solution code:
S = input()

def is_kaibun(s):
    return s[:len(s)//2] == s[:len(s)//2:-1]

flg = is_kaibun(S) and is_kaibun(S[:len(S)//2]) and is_kaibun(S[:len(S)//2:-1])

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
s = input()
t = s[::-1]
n = len(s)

if n <= 5 or s != t:
    print('No')
    exit()

else:
    for i in range((n - 1)//2):
        if s[i] != t[i]:
            print('No')
            exit()
        else:
          continue
    print('Yes')

Submission status: Wrong Answer

Solution code:
s = input()
t = s[::-1]
n = len(s)

if n <= 5 or s != t:
    print('No')
    exit()

else:
    for i in range((n - 1)//2):
        if s[i] != t[i]:
            print('No')
            exit()
    print('Yes')

Submission status: Wrong Answer

Solution code:
s = input()
t = s[::-1]
n = len(s)

if n <= 5 or s != t:
    print('No')
    exit()

else:
    for i in range(0, (n - 1)//2, 2):
        if s[i] != t[i]:
            print('No')
            exit()
    print('Yes')

Submission status: Wrong Answer

Solution code:
s = input()
t = s[::-1]
n = len(s)

if n <= 5:
    print('No')
    exit()
    
elif s != t:
    print('No')
    exit()

else:
    for i in range(0, (n - 1)//2, 2):
        if s[i] != t[i]:
            print('No')
            exit()
print('Yes')

Submission status: Wrong Answer

Solution code:
s = input()
t = s[::-1]
n = len(s)

if n == 5 or s != t:
    print('No')
    exit()

else:
    for i in range(0, (n - 1)//2, 2):
        if s[i] != t[i]:
            print('No')
            exit()
            
    print('Yes')

Submission status: Wrong Answer

Solution code:
s = input()
t = s[::-1]
n = len(s)

if n == 1 or n == 5:
    print('No')
    exit()
    
elif s != t:
    print('No')
    exit()

else:
    for i in range(0, (n - 1)//2, 2):
        if s[i] != t[i]:
            print('No')
            exit()
print('Yes')

Submission status: Wrong Answer

Solution code:
s = input()
t = s[::-1]
n = len(s)

if n == 5:
    print('No')
    exit()
    
elif s != t:
    print('No')
    exit()

else:
    for i in range(0, (n - 1)//2, 2):
        if s[i] != t[i]:
            print('No')
            exit()
print('Yes')

Submission status: Wrong Answer

Solution code:
s = input()
t = s[::-1]
n = len(s)

if n <=5 or s != t:
  print('No')
  exit()

for i in range(0, (n - 1)//2, 2):
    if s[i] != t[i]:
        print('No')
        exit()
print('Yes')

Submission status: Wrong Answer

Solution code:
s = input()
t = s[::-1]
n = len(s)

if n <=5 or s == t:
  print('No')
  exit()

for i in range(0, (n - 1)//2, 2):
    if s[i] != t[i]:
        print('No')
        exit()
print('Yes')

Submission status: Wrong Answer

Solution code:
s = input()
t = s[::-1]
n = len(s)

if n <=5:
  print('No')
  exit()

for i in range(0, (n - 1)//2, 2):
    if s[i] != t[i]:
        print('No')
        exit()
print('Yes')

Submission status: Wrong Answer

Solution code:
import sys

S=input()
N=len(S)
check=S[0:int((N-1)/2)]
#print(check)
if check!=check[::-1]:
  print("No")
  sys.exit(0)
check=S[int((N+3)/2)-1:N]
#print(check)
if check!=check[::-1]:
  print("No")
  sys.exit(0)
print("Yes")

Submission status: Wrong Answer

Solution code:
S = input()
N = len(S)
S1 = S[:(N-1)//2]
S2 = S[(N+1)//2:]

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

Submission status: Wrong Answer

Solution code:
a = input()
l = len(a)
m = a[:l//2]
n = a[l//2 + 1 :]
if a[::-1] == a and m == m[::-1] and n == n[::-1]:
    print("gh")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
s = input()
c = int((len(s) - 1)/2)
ans = (list(s[:c]) == list(reversed(s[:c])) and list(s[(c+1):]) == list(reversed(s[(c+1):])))
print(["No", "Yes"][ans])

Submission status: Wrong Answer

Solution code:
s = list(input())
L = len(s)
count = 0
for i in range(int((L-1)/2)):
    if s[i] == s[-i]:
        count += 1
for j in range(int((L+1)/2),L):
    if s[j] == s[L-j+int((L-1)/2)]:
        count += 1
if (L+1)/2 == count:
    print("Yes")
else:
    print("No")