TnT/Multi_CodeNet4Repair huggingface dataset:
Problem: 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.

Submission attempts (in order):
s = input()
n = len(s)
print((s==s[::-1]) and (s[(n-1)//2+1:]==s[:(n-1)//2:-1]))

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

Verdicts: Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
str = input()
resp = True
for i in range(0, int(len(str) / 2)):
    if str[i] != str[len(str) - i - 1]:
        resp = False
        break
print(resp)

def isPal(arr):
    resp = True
    for i in range(0, int(len(arr) / 2)):
        if arr[i] != arr[len(arr) - i - 1]:
            resp = False
            break
    return(resp)

str = input()
resp = 'No'
if isPal(str):
    if isPal(str[0:(len(str) // 2)]) and isPal(str[(len(str) // 2) + 1:len(str)]):
        resp = 'Yes'
print(resp)

Verdicts: Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
s = input()
s1 = s[:n//2]
s2 = s[n//2+1:]
if s1 == s2 and s2 ==  s2[::-1]:
    print('Yes')
else:
    print('No')

s = input()
n = len(s)

s1 = s[:(n-1)//2]
s2 = s[(n+3)//2-1:]

print(s1)
print(s2)

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

s = input()
n = len(s)

s1 = s[:(n-1)//2]
s2 = s[(n+3)//2-1:]

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

Verdicts: Runtime Error

Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
import sys

s = input()
N = len(s)
j = int((N-1)/2)
i = 0
while i!=j:
  if s[i] == s[j]:
    print("YES")
  else:
    print("No")
    sys.exit()
  i = i+1
  j = j-1
p = int((N+3)/2 -1)
q = N
while p!=q:
  if s[p] == s[q]:
    pass
  else:
    print("No")
    sys.exit()
  p = p+1
  q = q-1

a = 0
while a != N:
  if s[a] == s[N]:
    pass
  else:
    print("No")
    sys.exit()
  a = a+1
  N = N-1
if a >= (N-1)/2:
  print("Yes")

s = input()
N = len(s)
t = s[::-1]
a = s[0:int((N-1)/2)]
b = a[::-1]
if s == t and a == b:
  print("Yes")
else:
  print("No")

Verdicts: Runtime Error

Accepted
Problem: 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.

Submission attempts (in order):
S = input()
N = len(S)
flag1 = (S == S[::-1])
s = S[0:(N - 3)//2]
flag2 = (s == s[::-1])
if flag1 and flag2:
    print("Yes")
else:
    print("No")


S = input()
N = len(S)
flag1 = (S == S[::-1])
s = S[0:(N - 1)//2]
flag2 = (s == s[::-1])
if flag1 and flag2:
    print("Yes")
else:
    print("No")


Verdicts: Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
S = input()

N = len(S)
S_list = [i for i in S]
S_1 = S_list[:(N-1)//2]
check = 0
for i in range(len(S_1)//2+1):
    print(S_1[i], S_1[-(i+1)])
    if S_1[i] != S_1[-(i+1)]:
        check = 1

S_2 = S_list[(N+3)//2-1:]
for i in range(len(S_2)//2+1):
    print(S_2[i], S_2[-(i+1)])
    if S_2[i] != S_2[-(i+1)]:
        check = 1

print(S_1, S_2)
if check == 0:
    print('Yes')
else:
    print('No')


S = input()

N = len(S)
S_list = [i for i in S]
check = 0

S_0 = S_list
for i in range(len(S_0)//2):
    if S_0[i] != S_0[-(i+1)]:
        check = 1

S_1 = S_list[:(N-1)//2]
for i in range(len(S_1)//2+1):
    if S_1[i] != S_1[-(i+1)]:
        check = 1

S_2 = S_list[(N+3)//2-1:]
for i in range(len(S_2)//2+1):
    if S_2[i] != S_2[-(i+1)]:
        check = 1

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


Verdicts: Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
 = input()
flag = True
for i in range((len(s)-1)//2):
	if s[i] == s[len(s)-i-1]:
		continue
	else:
		flag = False
		break

if flag:
	left = s[:(len(s)-1)//2]
	right = s[(len(s)+3)//2-1:]
	if left == right:
		print("Yes")
	else:
		print("No")
else:
	print("No")


s= input()
flag = True
for i in range((len(s)-1)//2):
	if s[i] == s[len(s)-i-1]:
		continue
	else:
		flag = False
		break

if flag:
	left = s[:(len(s)-1)//2]
	right = s[(len(s)+3)//2-1:]
	if left == right:
		print("Yes")
	else:
		print("No")
else:
	print("No")


Verdicts: Runtime Error

Accepted
Problem: 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.

Submission attempts (in order):
s = input()
n = len(s)
left = s[0:int((n-1)/2)]
print(left)
right = s[int((n+3)/2)-1:n]
print(right)
if s == s[::-1] and left == left[::-1] and right == right[::-1]:
    print("Yes")
else:
    print("No")

s = input()
n = len(s)
left = s[0:int((n-1)/2)]
right = s[int((n+3)/2)-1:n]
if s == s[::-1] and left == left[::-1] and right == right[::-1]:
    print("Yes")
else:
    print("No")

Verdicts: Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
S = input()
N = len(S)
def ispalindrome(s):
    h = len(s) // 2
    for a, b in zip(s[:h], reversed(s[h+1:])):
        if a != b: return 0
    return True

S1=S[0:(N-1)//2]
S2=S[-1+(N+3)//2:N]
print(S1)
print(S2)
if ispalindrome(S) and ispalindrome(S1) and ispalindrome(S2):
    print("Yes")
else:
    print("No")




S = input()
N = len(S)
def ispalindrome(string): return True if string==string[::-1] else False

S1=S[0:(N-1)//2]
S2=S[-1+(N+3)//2:N]
print(ispalindrome(S1))
if ispalindrome(S) and ispalindrome(S1) and ispalindrome(S2):
    print("Yes")
else:
    print("No")




S = input()
N = len(S)
def ispalindrome(string): return True if string==string[::-1] else False

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

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


Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
s=input()
n=len(s)
if s[0:(n-1)//2:1]==s[(n-1)//2:0:-1] and s[(n+3)//2:n:1]==s[n:(n+3)//2:-1]  and  s=s[::-1]:
    print('Yes')
else:
    print('No')

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

Verdicts: Runtime Error

Accepted
Problem: 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.

Submission attempts (in order):
S=input()
N=len(S)

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

S=input()
N=len(S)

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

for i in range(len(S)):
	if S[i]!=S[-(i+1)]:
		print("No")
		exit()
for i in range(len(A)):
	if A[i]!=A[-(i+1)]:
		print("No")
		exit()
for i in range(len(B)):
	if B[i]!=B[-(i+1)]:
		print("No")
		exit()
print("Yes")

Verdicts: Runtime Error

Accepted
Problem: 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.

Submission attempts (in order):
S = input()
N = len(S)
def kaibun(s,n):
    for i in range(n//2):
        if(s[i]!=s[n-i-1]):
            return false
    return true

if(kaibun(S,N) & kaibun(S[0:(N+1)//2-1],N//2) & kaibun(S[N:(N+3)//2-2:-1],N//2)):
    print("Yes")
else:
    print("No")

S = input()
N = len(S)
def kaibun(s,n):
    for i in range(n//2):
        if(s[i]!=s[n-i-1]):
            return False
    return True

if(kaibun(S,N) & kaibun(S[0:(N+1)//2-1],N//2) & kaibun(S[N:(N+3)//2-2:-1],N//2)):
    print("Yes")
else:
    print("No")

Verdicts: Runtime Error

Accepted
Problem: 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.

Submission attempts (in order):
s = list(input())
if len(s) < 6:
  print('No')
  exit()
  
for i in range(len(s)//2):
  if s[i] != s[-(i+1)]:
    print('No')
    exit()
s = s[:len(s)//2]
print(s)
for i in range(len(s)//2):
  print(i, -(i+1))
  if s[i] != s[-(i+1)]:
    print('No')
    exit()
print('Yes')

s = input()
if 4 < len(s) < 6:
  print('No')
  exit()

if s[::-1] != s:
  print('No')
  exit()
s = s[:len(s)//2]
if s[::-1] != s:
  print('No')
  exit()
print('Yes')

Verdicts: Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):

# Created: Sun Mar 22 11:54:41 UTC 2020
import sys
 
stdin = sys.stdin
inf = 1 << 60
mod = 1000000007
 
ni      = lambda: int(ns())
nin     = lambda y: [ni() for _ in range(y)]
na      = lambda: list(map(int, stdin.readline().split()))
nan     = lambda y: [na() for _ in range(y)]
nf      = lambda: float(ns())
nfn     = lambda y: [nf() for _ in range(y)]
nfa     = lambda: list(map(float, stdin.readline().split()))
nfan    = lambda y: [nfa() for _ in range(y)]
ns      = lambda: stdin.readline().rstrip()
nsn     = lambda y: [ns() for _ in range(y)]
ncl     = lambda y: [list(ns()) for _ in range(y)]
nas     = lambda: stdin.readline().split()

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

for i in range((n + 3) // 2 - 1, n):
    p = n
    if s[i] != s[p - i - 1]:
        flag = False

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

import sys

stdin = sys.stdin
inf = 1 << 60
mod = 1000000007

ni      = lambda: int(ns())
nin     = lambda y: [ni() for _ in range(y)]
na      = lambda: list(map(int, stdin.readline().split()))
nan     = lambda y: [na() for _ in range(y)]
nf      = lambda: float(ns())
nfn     = lambda y: [nf() for _ in range(y)]
nfa     = lambda: list(map(float, stdin.readline().split()))
nfan    = lambda y: [nfa() for _ in range(y)]
ns      = lambda: stdin.readline().rstrip()
nsn     = lambda y: [ns() for _ in range(y)]
ncl     = lambda y: [list(ns()) for _ in range(y)]
nas     = lambda: stdin.readline().split()

s = ns()
n = len(s)

def is_palind(s):
    if s != ''.join(reversed(s)):
        return False
    return True

flag = True
if not is_palind(s):
    flag = False
if not is_palind(s[:(n - 1) // 2]):
    flag = False

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

Verdicts: Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
s = input()

n = len(s)

ans = 0

s1 = s[:int((n - 1) / 2)]
s2 = s[int((n + 3) / 2) - 1:]

s5 = s[::-1]

s3 = s1[::-1]
s4 = s2[::-1]

print(s5, s3, s4)
if s1 == s3:
    ans += 1

if s2 == s4:
    ans += 1

if s == s5:
    ans += 1

if ans == 3:
    print('Yes')
else:
    print('No')


s = input()

n = len(s)

ans = 0

s1 = s[:int((n - 1) / 2)]
s2 = s[int((n + 3) / 2) - 1:]

s5 = s[::-1]

s3 = s1[::-1]
s4 = s2[::-1]

#print(s5, s3, s4)
if s1 == s3:
    ans += 1

if s2 == s4:
    ans += 1

if s == s5:
    ans += 1

if ans == 3:
    print('Yes')
else:
    print('No')


Verdicts: Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
s=input()
n=len(s)

def kaibun(s):
  i = 0
  ans = True
  while i < n-1-i:
    if s[i] != s[len(s)-1-i]:
      ans = False
      return ans
      break
    i += 1
  return ans

ans_total = kaibun(s)

zenhan = s[:n//2]
kouhan = s[n//2:]

ans_zen = kaibun(zenhan)
ans_kou = kaibun(kouhan)

if ans_total == True and ans_zen == True and ans_kou == True:
  print('Yes')
else:
  print('No')

s=input()
n=len(s)

def kaibun(string):
  index = 0
  ans = True
  while i < n-1-i:
    if s[i] != s[n-1-i]:
      ans = False
      return ans
      break
    index += 1
  return ans

ans_total = def(s)

zenhan = s[:n//2]
kouhan = s[n//2:]

ans_zen = def(zenhan)
ans_kou = def(kouhan)

if ans_total == True and ans_zen == True and ans_kou == True:
  print('Yes')
else:
  print('No')

s = input()
n = len(s)
zen = s[:n // 2]

kou= s[n // 2 + 1:]

s_rev = s[::-1]

zen_rev = zen[::-1]
kou_rev = kou[::-1]

if s == s_rev and zen == zen_rev and kou == kou_rev:
  print('Yes')
else:
  print('No')

Verdicts: Wrong Answer

Runtime Error

Accepted
Problem: 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.

Submission attempts (in order):
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]))))

S = input()
N = len(S)

result = (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]))))

print('Yes') if result == True else print('No')

Verdicts: Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
from itertools import combinations
N, M = map(int, input().split())

a = list(combinations(range(N), 2))
b = list(combinations(range(M), 2))
print(len(a)+len(b))

S = str(input())
N = len(S)
num = (N-1)/2
num1 = (N+2)/2
if(S[:int(num)]==S[int(num1):]):
    print("Yes")
else:
    print("No")

Verdicts: Runtime Error

Accepted
Problem: 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.

Submission attempts (in order):
s = input()
n = len(s)
a = int((n-1)/2)
b = int((n+3)/2)
if n>0:
    x=s[:a]
    y = s[b-1:]
    print(x,y)
    if x==x[::-1] and y==y[::-1]:
      print("Yes")
    else:
      print("No")
else:
    print("No")

s = input()
n = len(s)
a = int((n-1)/2)
b = int((n+3)/2)
x=s[:a]
y = s[b-1:]
if x==x[::-1] and y==y[::-1] and s==s[::-1]:
  print("Yes")
else:
  print("No")


Verdicts: Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):

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

import sys
S = input()
N = len(S)

if S == S[::-1]:
    if S[0:(N-1)/2] == S[0:(N-1)/2][::-1]:
        if S[((N+3)/2)-1:N] == S[((N+3)/2)-1:N][::-1]:
            print("Yes")
            sys.exit()


print("No")

S = input()

words = []
words.append(S)
words.append(S[:(N-1)//2])
words.append(S[(N+3)//2 - 1:])

ans = all([word == word[::-1] for word in words])

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

S = input()
N = len(S)

words = []
words.append(S)
words.append(S[:(N-1)//2])
words.append(S[(N+3)//2 - 1:])

ans = all([word == word[::-1] for word in words])

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

Verdicts: Wrong Answer

Runtime Error

Runtime Error

Accepted
Problem: 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.

Submission attempts (in order):
letter = str(input())
N = len(letter)

l_1 = letter[:int((N-1)/2)]
l_2 = letter[int((N+3)/2-1):]

if(l == l[::-1] and l_1 == l_1[::-1] and l_2 == l_2[::-1]):
    ans = "Yes"
else:
    ans = "No"
# print(l_1)
# print(l_2)

print(ans)


letter = str(input())
N = len(letter)

l_1 = letter[:int((N-1)/2)]
l_2 = letter[int((N+3)/2-1):]

if(letter == letter[::-1] and l_1 == l_1[::-1] and l_2 == l_2[::-1]):
    ans = "Yes"
else:
    ans = "No"
# print(l_1)
# print(l_2)

print(ans)


Verdicts: Runtime Error

Accepted
Problem: 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.

Submission attempts (in order):
def reverse(s):
    return s[::-1]


def isPalindrome(s):
    # Calling reverse function
    rev = reverse(s)

    # Checking if both string are equal or not
    if (s == rev):
        return True
    return False


S = input()
if len(S)%2==1:
    if isPalindrome(S):
        a = S[0: int((len(S) - 1) / 2)]
        b = S[int((len(S)+3)/2-1): len(S)]
        if isPalindrome(a) and isPalindrome(S):
            print("YES")
        else:
            print("NO")
    else:
        print("NO")
else:
    print("NO")

def reverse(s):
    return s[::-1]


def isPalindrome(s):
    # Calling reverse function
    rev = reverse(s)

    # Checking if both string are equal or not
    if (s == rev):
        return True
    return False


S = input()
if isPalindrome(S):
    a = S[0: int((len(S) - 1) / 2)]
    b = S[int((len(S)+3)/2-1): len(S)]
    if isPalindrome(a) and isPalindrome(S):
        print("YES")
    else:
        print("NO")
else:
    print("NO")

n = input()
x = len(n)

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

Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
#!/usr/bin/env python3
# -*- coding: utf-8 -*-*-

from sys import stdin


def main():
    S = stdin.readline()
    # S = S[0:-1]
    N = len(S)

    if len(S) % 2 == 0:
        print('No')
        return

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

    

    if S[0:N // 2 ] != S[N // 2 + 1:]:
        print('No')
        return
    # output
    print("Yes")


if __name__ == "__main__":
    main()


from sys import stdin

def is_kaibun(S):
    for i in range(len(S) // 2):
        if S[i] != S[-i - 1]:
            print('No')
            return False
    return True


def main():
    S = (stdin.readline()).replace('\n', '')
    N = len(S)

    if len(S) % 2 == 0:
        print('No')
        return

    
    if not is_kaibun(S): return

    

    for c in [S[0:N // 2], S[N // 2 + 1:]]:
        if not is_kaibun(c): return

    # output
    print("Yes")


if __name__ == "__main__":
    main()

Verdicts: Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
s = input()

s1 = s[:int((len(s))/2)]
s2 = s[int((len(s)+3)/2)-1:]

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

s = input()

s1 = s[:int((len(s))/2)]
s2 = s[int((len(s)+3)/2)-1:]

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

Verdicts: Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)


############ ---- Input Functions ---- ############
def in_int():
    return (int(input()))


def in_list():
    return (list(map(int, input().split())))


def in_str():
    s = input()
    return (list(s[:len(s) - 1]))


def in_ints():
    return (map(int, input().split()))


ss = in_str()


def check(ss):
    i = 0
    j = len(ss)-1
    while i < j:
        if ss[i] != ss[j]:
            return False

        i+=1
        j-=1

    return True



n = len(ss)

if n%2 == 0:
    print('NO')
else:
    if check(ss) and check(ss[:n//2]):
        print("YES")
    else:
        print('NO')




import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)


############ ---- Input Functions ---- ############
def in_int():
    return (int(input()))


def in_list():
    return (list(map(int, input().split())))


def in_str():
    s = input()
    return (list(s[:len(s) - 1]))


def in_ints():
    return (map(int, input().split()))


ss = in_str()


def check(ss):
    i = 0
    j = len(ss)-1
    while i < j:
        if ss[i] != ss[j]:
            return False

        i+=1
        j-=1

    return True



n = len(ss)

if n%2 == 0:
    print('No')
else:
    if check(ss) and check(ss[:n//2]):
        print("Yes")
    else:
        print('No')




Verdicts: Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
s = input()


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


N = len(s)

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

s = input()


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


N = len(s)

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

Verdicts: Runtime Error

Accepted
Problem: 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.

Submission attempts (in order):
s = input()
n = len(s)


def f(s):
    n = len(s)
    if n % 2 == 0:
        return s[:n // 2] == s[n // 2:]
    else:
        return s[:n // 2] == s[n // 2 + 1:]


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


s = input()
n = len(s)


def f(s):
    n = len(s)
    if n % 2 == 0:
        return list(s[:n // 2]) == list(reversed(s[n // 2:]))
    else:
        return list(s[:n // 2]) == list(reversed(s[n // 2 + 1:]))


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


s = input()
n = len(s)


def f(s):
    n = len(s)
    if n % 2 == 0:
        return list(s[:n // 2]) == list(reversed(s[n // 2:]))
    else:
        return list(s[:n // 2]) == list(reversed(s[n // 2 + 1:]))


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


Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
import copy
S = list(input())
N = len(S)
ReS = copy.copy(S)
o = 1
for i in S:
    ReS[N-o] = i
    o += 1
if S == reversed(S):
    print("Yes")
if S == ReS:
    if S[0:int((N-1)/2)] == ReS[int((N+1)/2): N]:
        if S[int(N+1/2): N] == ReS[0:int((N-1)/2)]:
            print("Yes")
        else:
            print("No")
    else:
        print("No")
else:
        print("No")


import copy
S = list(input())
N = len(S)
ReS = copy.copy(S)
o = 1
for i in S:
    ReS[N-o] = i
    o += 1
if S == reversed(S):
    print("Yes")
if S == ReS:
    if S[0:int((N-1)/2)] == ReS[int((N+1)/2): N]:
        if S[int((N+1)/2): N] == ReS[0:int((N-1)/2)]:
            print("Yes")
        else:
            print("No")
    else:
        print("No")
else:
        print("No")


Verdicts: Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
s = str(input())
n = len(s)
if n%2==0:
    print("No")
else:
    a = s[:int((n-1)/2)]
    b = s[int((n+1)/2):]
    x = a[::-1]
    y = b[::-1]
    print(a)
    print(b)

    l = (n+1)/4
    # print(l)
    c = 0
    for i in range(int(l)):
        if (a[i]!=x[i])or (b[i]!=y[i]):
            print("No")
            c =1
            break
if(c==0):
    print("Yes")
        

s = str(input())
m = s[::-1]
n = len(s)
c=0
for i in range(int((n-1)/2)):
    if (s[i]!=m[i]):
        print("No")
c=1

a = s[:int((n-1)/2)]
b = s[int((n+1)/2):]
x = a[::-1]
y = b[::-1]
# print(a)
# print(b)

l = (n+1)/4
    # print(l)

for i in range(int(l)):
    if (a[i]!=x[i])or (b[i]!=y[i]):
        print("No")
        c =1
        break
if(c==0): 
     print("Yes")

s = str(input())
m = s[::-1]
n = len(s)
c=0
for i in range(int((n-1)/2)):
    if (s[i]!=m[i]):
        print("No")
        c=1
        break

if c==0:
    a = s[:int((n-1)/2)]
    b = s[int((n+1)/2):]
    x = a[::-1]
    y = b[::-1]
    # print(a)
    # print(b)

    l = (n+1)/4
        # print(l)

    for i in range(int(l)):
        if (a[i]!=x[i])or (b[i]!=y[i]):
            print("No")
            c =1
            break
    if(c==0): 
        print("Yes")

Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
s = input()
n = len(s)
ans = "Yes"
half = int((n -1) / 2)
half2 = int((n+2)/2)
a = s[:half]
a_2 = s[half+1:n]
a_2 = a_2[::-1]
print(a, a_2)
if a != a_2:
    ans = "No"
else:
    if (len(a)%2) == 0:
        a_half = int(len(a)/2)
        a_3 = a[0:a_half]
        a_4 = a[a_half:len(a)]
        a_4 = a_4[::-1]
    else:
        a_half = int((len(a)+1)/2)
        a_3 = a[0:a_half]
        a_4 = a[a_half-1:len(a)]
        a_4 = a_4[::-1]
    print(a_3, a_4)
    if a_3 != a_4:
        ans = "No"
    else:
        b = s[half2:n]
        if (len(b)%2) == 0:
            b_half = int(len(b)/2)
            b_2 = b[0:b_half]
            b_3 = b[b_half:len(b)]
            b_3 = b_3[::-1]
        else:
            b_half = int((len(b)+1)/2)
            b_2 = b[0:b_half]
            b_3 = b[b_half-1:len(b)]
            b_3 = b_3[::-1]            
        print(b_2, b_3)
        if b_2 != b_3:
            ans = "No"
print(ans)

s = input()
n = len(s)
ans = "Yes"
half = int((n -1) / 2)
half2 = int((n+2)/2)
a = s[:half]
a_2 = s[half+1:n]
a_2 = a_2[::-1]
if a != a_2:
    ans = "No"
else:
    if (len(a)%2) == 0:
        a_half = int(len(a)/2)
        a_3 = a[0:a_half]
        a_4 = a[a_half:len(a)]
        a_4 = a_4[::-1]
    else:
        a_half = int((len(a)+1)/2)
        a_3 = a[0:a_half]
        a_4 = a[a_half-1:len(a)]
        a_4 = a_4[::-1]
    if a_3 != a_4:
        ans = "No"
    else:
        b = s[half2:n]
        if (len(b)%2) == 0:
            b_half = int(len(b)/2)
            b_2 = b[0:b_half]
            b_3 = b[b_half:len(b)]
            b_3 = b_3[::-1]
        else:
            b_half = int((len(b)+1)/2)
            b_2 = b[0:b_half]
            b_3 = b[b_half-1:len(b)]
            b_3 = b_3[::-1]            
        if b_2 != b_3:
            ans = "No"
print(ans)

Verdicts: Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
S=input();print("YNeos"[S==S[::-1]and S.endswith(S[:len(S)//2])::2])

S = input()
N = len(S)
isPal = lambda s: s == s[::-1]
print("Yes" if isPal(S[:(N-1)//2]) and isPal(S[(N-1)//2:]) else "No")

S=input();print("YNeos"[S!=S[::-1]or 1-S.endswith(S[:len(S)//2])::2])

Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
S = map(str,input().split())
N = int(len(S))
S_a = S[:(N-1)//2]
S_b = S[(N+1)//2:]

if S == S[::-1] and S_a == S_a[::-1] and S_b == S_b[::-1]:
    print("Yes")
else:
    print("No")

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

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

Verdicts: Runtime Error

Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
from copy import copy

S = input()
Slist = []
par = []
rap = []

for s in S:
    Slist.append(s)

if len(Slist)==3:
    if Slist==list(reversed(Slist)):
        print("Yes")
    else:
        print("No")
else:
    par = copy(Slist)
    rap = copy(Slist)
    rap = list(reversed(rap))
    print(par)
    print(rap)

    if par==rap:
        rap = []
        par = copy(Slist)
        par = par[:(len(par)-1)//2]
        rap = copy(par)
        rap = list(reversed(rap))
        print(par)
        print(rap)

        if par==rap:
            rap = []
            par = copy(Slist)
            par = par[(len(par)+3)//2-1:]
            rap = copy(par)
            rap = list(reversed(rap))
            print(par)
            print(rap)

            if par==rap:
                print("Yes")
            else:
                print("No")
        else:
            print("No")
    else:
        print("No")


from copy import copy

S = input()
Slist = []
par = []
rap = []

for s in S:
    Slist.append(s)

if len(Slist)==3:
    if Slist==list(reversed(Slist)):
        print("Yes")
    else:
        print("No")
else:
    par = copy(Slist)
    rap = copy(Slist)
    rap = list(reversed(rap))

    if par==rap:
        rap = []
        par = copy(Slist)
        par = par[:(len(par)-1)//2]
        rap = copy(par)
        rap = list(reversed(rap))

        if par==rap:
            rap = []
            par = copy(Slist)
            par = par[(len(par)+3)//2-1:]
            rap = copy(par)
            rap = list(reversed(rap))

            if par==rap:
                print("Yes")
            else:
                print("No")
        else:
            print("No")
    else:
        print("No")


Verdicts: Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
# 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")

# 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
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")

# 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))//2]):
    flag = False
if not check(S[(len(S)+3)//2-1:]):
    flag = False
print("Yes" if flag else "No")

Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
akasaka

S = list(str(input()))
N = len(S)
a = 0
newS = list(reversed(S))
if S == newS:
        a += 1

left = []
for i in range(0,int((N-1)/2)): 
  left += S[i]
newleft = list(reversed(left))
if left == newleft:
        a += 1

right = []
for i in range(0,int((N-1)/2)): 
  right += S[-i-1]
newright = list(reversed(right))
if right == newright:
        a += 1
    
if a == 3:
	print('Yes')
else :
    print('No')

Verdicts: Runtime Error

Accepted
Problem: 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.

Submission attempts (in order):
s = input()

m = []
for i in s:
  m.append(i)
n = len(s)
n1 = int((n-1)/2)
n2 = int((n+3)/2)

for i in range(n1):
  if m[i] != m[n-1-i]:
    print('No')
    break
  else:
    if m[i] != m[n1-1-i]:
      print('No')
      break
    else:
      if m[n2-1+i] != m[n-1-i]:
        print('No')
        break
      else:
        print('Yes')

s = input()

n = len(s)
m = []
for i in s:
  m.append(i)

n1 = int((n-1)/2)
n2 = int((n+3)/2)
for i in range(n1):
  if m[i] != m[n-1-i]:
    print('No')
    break
  else:
    if m[i] != m[n1-1-i]:
      print('No')
      break
    else:
      if m[n2-1] != m[n-1-i]:
        print('No')
        break
      else:
        print('Yes')

s = input()

n = len(s)
m = []
for i in s:
  m.append(i)

n1 = int((n-1)/2)
n2 = int((n+3)/2)
for i in range(n):
  if m[i] != m[n-1-i]:
    print('No')
    break
  else:
    if m[i] != m[n1-1-i]:
      print('No')
      break
    else:
      if m[n2-1] != m[n-1-i]:
        print('No')
        break
      else:
        print('Yes')


s = input()

m = []
for i in s:
  m.append(i)
n = len(s)
n1 = int((n-1)/2)
n2 = int((n+3)/2)
ans = 0

for i in range(n1):
  if m[i] != m[n-1-i]:
    print('No')
    break
  else:
    if m[i] != m[n1-1-i]:
      print('No')
      break
    else:
      if m[n2-1+i] != m[n-1-i]:
        print('No')
        break
      else:
        ans += 1
        
if ans == n1:
  print('Yes')

Verdicts: Wrong Answer

Wrong Answer

Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
# coding: utf-8
# Your code here!
s = input()
s1 = s[::-1]
l=len(s)
print(l)
check = 0
if(s==s1):
    if(s[0:int((l-1)/2)] == s1[0:int((l-1)/2)]):
        if(s[int((l+3)/2):l] == s[int((l+3)/2):l]):
            print("Yes")
            check =1
if(check ==0):
    print("No")



# coding: utf-8
# Your code here!
s = input()
s1 = s[::-1]
l=len(s)

check = 0
if(s==s1):
    if(s[0:int((l-1)/2)] == s1[int((l+3)/2)-1:l]):
        if(s[int((l+3)/2)-1:l] == s1[0:int((l-1)/2)]):
            print("Yes")
            check =1
if(check ==0):
    print("No")



Verdicts: Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
A = list(input())
A1 = reversed(A)

B = A[0:(len(A)-1)/2-1]
B1 = reversed(B)

C = A[(len(A)+3)/2-1:-1]
C1 = reversed(C)

if A == A1 and B == B1 and C == C1:
    print("Yes")
else:
    print("No")

A = list(input())
A1 = list(reversed(A))
#print((len(A)-1)/2-1)
 
B = A[:(len(A)-1)//2]
B1 = list(reversed(B))
 
C = A[(len(A)+3)//2-1:]
C1 = list(reversed(C))
 
if A == A1 and B == B1 and C == C1:
    print("Yes")
else:
    print("No")

Verdicts: Runtime Error

Accepted
Problem: 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.

Submission attempts (in order):
S = input()
N = len(S)
N1 = (N-1)//2
N2 = (N+3)//2

for s1, s2 in zip(S, S[::-1]):
    if s1 != s2:
        print('No')
        exit()
    else:
        continue

for s1, s2 in zip(S[0:N1+1], S[N1+1:0:-1]):
    if s1 != s2:
        print('No')
        exit()
    else:
        continue

for s1, s2 in zip(S[N2-1:N], S[N:N2-1:-1]):
    if s1 != s2:
        print('No')
        exit()
    else:
        continue

print('Yes')

def ispalindrome(S,N):
    for a, b in zip(S[:N], reversed(S[:N])):
        if a != b: return 0
    return 1

def ispalindrome2(S,N):
    for a, b in zip(S[N2-1:N], reversed(S[N2-1:N])):
        if a != b: return 0
    return 1

S = input()
N = len(S)
N1 = (N-1)//2
N2 = (N+3)//2

r1 = ispalindrome(S,N)
r2 = ispalindrome(S,N1)
r3 = ispalindrome2(S,N2)
if r1==1 and r2==1 and r3==1:
    print('Yes')
else:
    print('No')

Verdicts: Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
s = input()
n = len(s)
def is_kai(s):
    for i in range(int(len(s)/2)):
        if s[i] != s[-i-1]:
            return False
        return True
if is_kai(s) and is_kai(s[:int((n-1)/2)]) and is_kai(s[int((n+3)/2):]):
    print('Yes')
else:
    print('No')

s = input()
n = len(s)
def is_kai(s):
    for i in range(int((len(s))/2)):
        if s[i] != s[-i-1]:
            return False
    return True
if is_kai(s) and is_kai(s[:int((n-1)/2)]):
    print('Yes')
else:
    print('No')

Verdicts: Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
s = input()
n = len(s)
fs = s[:(n-1)//2]
es = s[(n+3)//2-1:]
print((n-1)//2, (n+3)//2-1)
if s == s[::-1] and fs == fs[::-1] and es == es[::-1]:
    print("Yes")
else:
    print("No")

s = input()
n = len(s)
fs = s[:(n-1)//2]
es = s[(n+3)//2-1:]
if s == s[::-1] and fs == fs[::-1] and es == es[::-1]:
    print("Yes")
else:
    print("No")

Verdicts: Wrong Answer

Accepted