TnT/Multi_CodeNet4Repair huggingface dataset:
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

Submission attempts (in order):
N = int(input())
S = input()
l = len(S)
flg = 0
if l%2 == 0:
	flg = 1
	print("No")
else:
	for i in range(l/2):
		if S[i] != S[i+l/2]:	
			print("No")
			flg = 1
            break
if flg == 0:
	print("Yes")

N = int(input())
S = input()
l = len(S)
flg = 0
if l%2 == 1:
	flg = 1
	print("No")
else:
	for i in range(int(l/2)):
		//print(S[i],S[i+int(l/2)])
		if S[i] != S[i+int(l/2)]:	
			print("No")
			flg = 1
			break
if flg == 0:
	print("Yes")

N = int(input())
S = input()
l = len(S)
flg = 0
if l%2 == 1:
	flg = 1
	print("No")
else:
	for i in range(int(l/2)):
		if S[i] != S[i+int(l/2)]:	
			print("No")
			flg = 1
			break
if flg == 0:
	print("Yes")

Verdicts: Runtime Error

Runtime Error

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

Submission attempts (in order):
N = int(input())
S = str(input())
S = list(S)

if N%2 != 0:
    print('No')
    exit()

S1, S2 = [], []
for i, s enumerate(S):
    if i < (N/2):
        s1.append(s)
    else:
        s2.append(s)

s1, s2 = ' ', ' '
for s in S1:
    s1 += s

for s in S2:
    s2 += s

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


N = int(input())
S = str(input())
S = list(S)

if N%2 != 0:
    print('No')
    exit()

S1, S2 = [], []
for i, s in enumerate(S):
    if i < (N/2):
        s1.append(s)
    else:
        s2.append(s)

s1, s2 = ' ', ' '
for s in S1:
    s1 += s

for s in S2:
    s2 += s

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


N = int(input())
S = str(input())
S = list(S)

if N%2 != 0:
    print('No')
    exit()

S1, S2 = [], []
for i, s in enumerate(S):
    if i < (N/2):
        S1.append(s)
    else:
        S2.append(s)

s1 = ' '
for s in S1:
    s1 += s

s2 = ' '
for s in S2:
    s2 += s

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


Verdicts: Runtime Error

Runtime Error

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

Submission attempts (in order):
N = int(input())
s = input()
ans = 'No'
if N % 2 == 0:
    n = N/2
    a = s[:n]
    b = s[n:]
    if a == b:
        ans = 'Yes'
print(ans)

N = int(input())
s = input()
ans = 'No'
if N % 2 == 0:
    n = N//2
    a = s[:n]
    b = s[n:]
    if a == b:
        ans = 'Yes'
print(ans)


Verdicts: Runtime Error

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

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

if n % 2 == 1:
  print('No')
elif:
  for i in range(n/2):
    if s[i] != s[i+n/2]:
      print('No')
      break
      
  print('Yes')

n = int(input())
s = input()

if n % 2 == 1:
  print('No')
else:
  s1 = s[: n//2)]
  s2 = s[n//2: ]
  
  if s1 == s2:
    print('Yes')
  else:
    print('No')


n = int(input())
s = input()

if n % 2 == 1:
  print('No')
else:
  for i in range(n/2):
    if s[i] != s[i+n/2]:
      print('No')
      break
      
  print('Yes')

n = int(input())
s = input()

if n % 2 == 1:
  print('No')
else:
  s1 = s[: n/2]
  s2 = s[n/2: ]
  
  if s1 == s2:
    print('Yes')
  else:
    print('No')


n = int(input())
s = input()

if n % 2 == 1:
  print('No')
else:
  m = int(n/2)
  s1 = s[: m]
  s2 = s[m: ]
  
  if s1 == s2:
    print('Yes')
  else:
    print('No')


Verdicts: Runtime Error

Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

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

s1 = s[:(n/2)]
s2 = s[(n/2):]

print( s1 == s2 ? 'Yes' : 'No')

n = int(input())
s = str(input())

s1 = s[:(n//2)]
s2 = s[(n//2):]

print( 'Yes' if s1 == s2 else 'No')

Verdicts: Runtime Error

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

Submission attempts (in order):
n = int(input())
s = [str(x) for x in input()]
if n % 2 == 1:
    print('No')
else:
    if s[:((n/2)+1)] == s[((n/2)+1)]:
        print('Yes')
    else:
        print('No')

n = int(input())
s = [str(x) for x in input()]
print(s)
if n % 2 == 1:
    print('No')
else:
    a = int(n/2)
    if s[0:a] == s[a:]:
        print('Yes')
    else:
        print('No')

n = int(input())
s = [str(x) for x in input()]
if n % 2 == 1:
    print('No')
else:
    a = int(n/2)
    if s[0:a] == s[a:]:
        print('Yes')
    else:
        print('No')

Verdicts: Runtime Error

Wrong Answer

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

Submission attempts (in order):
N = input()
N = int(N)
S = input()
S = S.split()
S = list(S)

if N % 2 == 0:
  H = int(N/2)
  if S[0][:H] == S[0][H:]:
    print("YES")
  else:
    print("NO")
  
else:
  print("NO")

N = input()
N = int(N)
S = input()
S = S.split()
S = list(S)

if N % 2 == 0:
  H = int(N/2)
  if S[0][:H] == S[0][H:]:
    print("Yes")
  else:
    print("No")
  
else:
  print("No")

Verdicts: Wrong Answer

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

Submission attempts (in order):
n = int(input())
s = int(input())
#a = list(map(int,input().split()))

if n % 2 != 0 :
    print("No")
else:
    mae = s[0:int(n/2)]
    usi = s[int(n/2):]
    if mae == usi :
        print("Yes")
    else:
        print("No")


n = int(input())
s = input()
#a = list(map(int,input().split()))

if n % 2 != 0 :
    print("No")
else:
    mae = s[0:int(n/2)]
    usi = s[int(n/2):]
    if mae == usi :
        print("Yes")
    else:
        print("No")


Verdicts: Runtime Error

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

Submission attempts (in order):
n,s = [input() for i in range(n)]

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

n = int(input())
s = input()

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

n = int(input())
s = input()
 
if n%2==0 and s[:n//2] == s[n//2:]:
  print('Yes')
else:
  print('No')

Verdicts: Runtime Error

Wrong Answer

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

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

if s[:length // 2] == s[length // 2:]:
    print("yes")
else:
    print("no")


length = int(input())
s = input()

if s[:length // 2] == s[length // 2:]:
    print("Yes")
else:
    print("No")


Verdicts: Wrong Answer

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

Submission attempts (in order):
n=int(input())
s=input()
v=[s[i: i+n/2] for i in range(0, len(s), n/2)]
if(len(set(v))==1):
  print("Yes")
else:
  print("No")

n=int(input())
s=input()
if(n%2!=0):
  print("No")
else:
  v=[s[i: i+n/2] for i in range(0, len(s), n/2)]
  if(len(set(v))==1):
    print("Yes")
  else:
    print("No")

n=int(input())
s=input()
if(n%2!=0):
  print("No")
else:
  v=[s[i: i+n//2] for i in range(0, len(s), n//2)]
  if(len(set(v))==1):
    print("Yes")
  else:
    print("No")

Verdicts: Runtime Error

Runtime Error

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

Submission attempts (in order):
n = int(input())
s = input()
 
if n%2 == 1:
  print("No")
  return
 
slise = (n/2)
a = s[:int(slise)]
b = s[int(slise):]
 
if a==b:
  print("Yes")
else:
  print("No")

n = int(input())
s = input()
 
if n%2 == 1:
  print("No")
 
a = s[int(n/2+1):]
b = s[:int(n/2+1)]
 
if a==b:
  print("Yes")
else:
  print("No")

n = int(input())
s = input()

a = s[n/2:]
b = s[:n/2]

if a==b:
  print("Yes")
else:
  print("No")

n = 5
s = input()
 
a = s[int(n/2):]
b = s[:int(n/2)]
 
if a==b:
  print("Yes")
else:
  print("No")

n = int(input())
s = input()
 
if n%2 == 1:
  print("No")

slise = (n/2)*1
a = s[:int(start)]
b = s[int(slise):]

if a==b:
  print("Yes")
else:
  print("No")

n = int(input())
s = input()

if n%2 ==1:
  print("No")

a = s[n/2:]
b = s[:n/2]
 
if a==b:
  print("Yes")
else:
  print("No")

n = int(input())
s = input()
 
if n%2 == 1:
  print("No")
 
slise = (n/2)+1
a = s[:int(slise)]
b = s[int(slise):]
 
if a==b:
  print("Yes")
else:
  print("No")

import sys

n = int(input())
s = input()
 
if n%2 == 1:
  print("No")
  sys.exit()
 
slise = (n/2)
a = s[:int(slise)]
b = s[int(slise):]
 
if a==b:
  print("Yes")
else:
  print("No")

Verdicts: Runtime Error

Wrong Answer

Runtime Error

Wrong Answer

Runtime Error

Runtime Error

Wrong Answer

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

Submission attempts (in order):
r = int(input())
s = input()
 
if i < 2:
  return

i = int(r/2)
before = s[i:]
after = s[:i]
 
if before == after:
	print('Yes')
else:
  	print('No')

r = int(input())
s = input()
 
i = int(r/2)
before = s[i:]
after = s[:i]
 
if before == after:
	print('Yes')
else:
  	print('No')


Verdicts: Runtime Error

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

Submission attempts (in order):
n = int(input())
n = int(input())
s = input()
if s[:n//2] == s[n//2:]:
    print("Yes")
else:
    print("No")

n = int(input())
s = input()
if s[:n//2] == s[n//2:]:
    print("Yes")
else:
    print("No")

Verdicts: Runtime Error

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

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

t = int(n/2)

if(s[:t]*2 == s):print('YES')
else:print('NO')

n = int(input())
s = input()

t = int(n/2)

if(s[:t] + s[:t] == s):print('Yes')
else:print('No')

Verdicts: Wrong Answer

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

Submission attempts (in order):
N = int(input())
S = input()
print("Yes" if N%2 == 0 and S[:(N/2)+1] == S[(N/2)+1:N+1])

N = int(input())
S = input()
print("Yes" if N%2 == 0 and S[:N/2] == S[N/2:N] else "No")

N = input()
S = input()
print("Yes" if N%2 == 0 and S[:(N/2)+1] == S[(N/2)+1:N+1])

N = int(input())
S = input()
print("Yes" if S[:N//2] == S[N//2:N] else "No")

Verdicts: Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

Submission attempts (in order):
S,T=input().split()
S=int(S)
print('Yes' if T[:S//2]==T[S//2:] else 'No')


S=int(input())
T=input()
S=int(S)
print('Yes' if T[:S//2]==T[S//2:] else 'No')


Verdicts: Runtime Error

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

Submission attempts (in order):
n = int(input())
s = input()
c = n/2
stt = s[: c]
end = s[c :]

if c%2 == 1:
  print("No")

if stt == end :
  print("Yes")
else:
  print("No")

n = int(input())
s = input()
c = n/2
stt = s[:c]
end = s[c:]

if (n%2 == 1):
  print("No")

if (stt == end):
  print("Yes")
else:
  print("No")

n = int(input())
s = input()
c = n/2
stt = s[: c]
end = s[c :]
if stt == end:
  print("Yes")
else:
  print("No")

n = int(input())
s = input()

if s[ :n//2 ] == s[ n//2: ]:
  print("Yes")
else:
  print("No")

Verdicts: Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

Submission attempts (in order):
import sys
N = int(input())
S = list(map(str,input().split()))
if N % 2 == 0:
	T_1 = S[:int(len(S)/2)]
	T_2 = S[int(len(S)/2):]
	for i in range(len(T_1)):
		if T_1[i] != T_2[i]:
	 		print("No")
	 		sys.exit()
		
	 print("Yes")
	 sys.exit()
else:
	print("No")

N = int(input())
S = list(map(str,input().split()))
if N % 2 == 0:
	T_1 = S[:int(len(S)/2)]
	T_2 = S[int(len(S)/2):]
	for i in range(len(T_1)):
	 if T_1[i] == T_2[i]:
	 	print("Yes")
	 else:
	 	print("No")
else:
	print("No")

import sys
N = int(input())
# S = list(map(str,input().split()))
S = list(input())
if N % 2 == 0:
	T_1 = S[:int(len(S)/2)]
	T_2 = S[int(len(S)/2):]
	# print(T_1)
	# print(T_2)
	for i in range(len(T_1)):
		if T_1[i] != T_2[i]:
			print("No")
			sys.exit()	
	print("Yes")
	sys.exit()
else:
	print("No")

Verdicts: Runtime Error

Wrong Answer

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

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

if N % 2 != 0:
    print("no")
elif S[:N // 2] == S[N // 2:]:
    print("yes")
else:
    print("no")

N = int(input())
S = input()

if N % 2 != 0:
    print("No")
elif S[:N // 2] == S[N // 2:]:
    print("Yes")
else:
    print("No")

Verdicts: Wrong Answer

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

Submission attempts (in order):
S = input()
LENS = int((len(S))/2)
mae = S[0:LENS]
usiro = S[LENS:len(S)]

if mae == usiro:
    print("Yes")
else:
    print("No")

S = int(input())
LENS = int((len(S))/2)
mae = S[0:LENS]
usiro = S[LENS:len(S)]

if mae == usiro:
    print("Yes")
else:
    print("No")

    

N = int(input())
S = input()
if N%2==1:
    print("No")
else:
    center = int(len(S)/2)
    if S == S[:center]*2:
        print("Yes")
    else:
        print("No")

Verdicts: Wrong Answer

Runtime Error

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

Submission attempts (in order):
N = int(input())
S = input()
if N%2 != 0:
  print('No')
else:
  if S[0:N//2] == S[N//2:N]:
    print('Yes')
print('No')

N = int(input())
S = input()
if N%2 != 0:
  print('No')
else:
  if S[0:N//2] == S[N//2:N]:
    print('Yes')
  else:
    print('No')


Verdicts: Wrong Answer

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

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

print(N)
if (N % 2 != 0):
    print('No')
else:
    half = len(S) / 2
    part = S[0:int(len(S)/2)]
    #print(S[int(len(S)/2):])
    if S[int(len(S)/2):] == part:
        print("Yes")
    else:
        print('No')


N = int(input())
S = input()

#print(N)
if (N % 2 != 0):
    print('No')
else:
    half = len(S) / 2
    part = S[0:int(len(S)/2)]
    #print(S[int(len(S)/2):])
    if S[int(len(S)/2):] == part:
        print("Yes")
    else:
        print('No')


Verdicts: Wrong Answer

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

Submission attempts (in order):
n = int(input())
s = input()
for i in range((n//2)+1):
    if s[i] == s[i+(n//2)]:
        c+= 1
if c*2 == n:
    print("Yes")
else:
    print("No")
    

n = int(input())
s = input()
c = 0
for i in range((n//2)):
    if s[i] == s[i+(n//2)]:
        c+= 1
if c*2 == n:
    print("Yes")
else:
    print("No")


Verdicts: Runtime Error

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

Submission attempts (in order):
s = input()
t = len(s)
if s[:t//2]==s[s//2]:
  print('Yes')
else: print('No')


s = input()
t = len(s)
if s[:t//2]==s[t//2:]:
  print('Yes')
else: print('No')


s = input()
t = len(s)
if s[:t//2]==s[t//2]:
  print('Yes')
else: print('No')


s = input()
t = len(s)
if s[:t//2]=s[s//2]:
  print('Yes')
else: print('No')


t = int(input())
s = input()
if s[:t//2]==s[t//2:]:
  print('Yes')
else: print('No')

Verdicts: Runtime Error

Wrong Answer

Wrong Answer

Runtime Error

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

Submission attempts (in order):
n = int(input())
a = input()
if a[:n/2+1]==a[n/2+1:]:
  print("Yes")
else:
  print("No")

n = int(input())
a = input()
if a[:int(n/2)+1]==a[int(n/2)+1:]:
  print("Yes")
else:
  print("No")

n = int(input())
a = input()
if str(a[:n/2+1])==str(a[n/2+1:]):
  print("Yes")
else:
  print("No")

n = int(input())
a = input()
if n%2==1:
  print("No")
elif str(a[:int(n/2)+1])==str(a[int(n/2)+1:]):
  print("Yes")
else:
  print("No")

n = int(input())
a = input()
if n%2==1:
  print("No")
elif a[:int(n/2)+1]==a[int(n/2)+1:]:
  print("Yes")
else:
  print("No")

n = int(input())
a = input()
if a[:n//2]==a[n//2:]:
  print("Yes")
else:
  print("No")

Verdicts: Runtime Error

Wrong Answer

Runtime Error

Wrong Answer

Wrong Answer

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

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

flag = 1

if N % 2 == 1:
    print("No")

else:
    n = N//2

    for i in range(n):
        if S[i] != S[n+i]:
            flag = 0
            break

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

N = int(input())
S = input()

flag = 1

if N % 2 == 1:
    print("No")

else:
    n = N//2

    for i in range(n):
        if S[i] != S[n+i]:
            flag = 0
            break

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

Verdicts: Wrong Answer

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

Submission attempts (in order):
import sys
#input = sys.stdin.readline
sys.setrecursionlimit(10**7)
N = int(input())
S = input()

ss = S[:(len(S)//2)]
print(ss)
if ss+ss == S:
    print('Yes')
else:
    print('No')

import sys
#input = sys.stdin.readline
sys.setrecursionlimit(10**7)
N = int(input())
S = input()

ss = S[:(len(S)//2)]
if ss+ss == S:
    print('Yes')
else:
    print('No')


Verdicts: Wrong Answer

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

Submission attempts (in order):
N = int(input())
S = list(input())
if S[:(N//2) == S[(N//2+1):]:
     print("Yes")
else:
     print("No")

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


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


N = int(input())
S = input()
if S[:(N//2)] == S[(N//2):]:
	print("Yes")
else:
	print("No")

Verdicts: Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

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

if n < 2:
  print('No')
else:
  left = s[0:n//2]
  right = s[n//2+1:]

  print('Yes' if left == right else 'No')

n = int(input())
s = input()

if n < 2:
  print('No')
else:
  left = s[0:n//2]
  right = s[n//2:]

  print('Yes' if left == right else 'No')

Verdicts: Wrong Answer

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

Submission attempts (in order):
N=input()
n=int(int(N)/2)
S=input()

T=S[0:n]
print(T)
if S==T+T:
    print("Yes")
else:
    print("No")

N=input()
n=int(int(N)/2)
S=input()

T=S[0:n]
if S==T+T:
    print("Yes")
else:
    print("No")

Verdicts: Wrong Answer

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

Submission attempts (in order):
n = int(input())
s = input()
m = int(n/2)
print(s[0:m])
print(s[m:])
if s[0:m] == s[m:]:
    print("Yes")
else:
    print("No")


n = int(input())
s = input()
m = int(n/2)
if s[0:m] == s[m:]:
    print("Yes")
else:
    print("No")


Verdicts: Wrong Answer

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

Submission attempts (in order):
s = input()
m = len(s)//2

print('Yes') if s[:m] == s[m:] else print('No')

_ = input()
s = input()
m = len(s)//2
 
print('Yes') if s[:m] == s[m:] else print('No')

Verdicts: Wrong Answer

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

Submission attempts (in order):
n = int(input())
s = input()
output = "No"

for i in range(1, n - 1):
    if n % i != 0:
        continue

    else:
        tmp = s[:i:]
        print(tmp)
        if tmp * (n // i) == s:
            output = "Yes"


print(output)


n = int(input())
s = input()
output = "No"

if n % 2 != 0:
    print(output)

else:
    tmp = s[: n // 2 :]
    if tmp * 2 == s:
        output = "Yes"

    print(output)
    

Verdicts: Wrong Answer

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

Submission attempts (in order):
import sys
import math
import itertools

n = int(sys.stdin.readline())
total = math.factorial(n)
res = 0
acc = 0
lines = []

for i in range(n):
    lines.append(sys.stdin.readline().rstrip('\n'))
for y in itertools.combinations(lines, 2):
    acc += ((int(y[0][0]) - int(y[1][0]))**2) + ((int(y[0][1]) - int(y[1][1]))**2)
    acc += math.sqrt(acc)

res = acc/total
print(res)

n = int(input())
s = input()

if s.endswith(s[:n/2]):
  print("Yes")
else:
  print("No")

n = int(input())

fin = n//2
s = input()

debut = s[0:fin]

if s == debut + debut:
    print("Yes")
else:
    print("No")

Verdicts: Runtime Error

Runtime Error

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

Submission attempts (in order):
n = int(input())
s = str(input())
if n % 2 == 1:
  print('No')
elif s[:2//n] == s[2//n+1:]:
  print('Yes')
else:
  print('No')


n = int(input())
s = str(input())
if s[2//n:] == s[:2//n]:
  print('Yes')
else:
  print('No')

n = int(input())
s = str(input())
if n % 2 == 1:
  print('No')
elif s[2//n:] == s[:2//n]:
  print('Yes')
else:
  print('No')

n = int(input())
s = str(input())
if s[n//2:] == s[:n//2]:
  print('Yes')
else:
  print('No')


Verdicts: Wrong Answer

Wrong Answer

Wrong Answer

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

Submission attempts (in order):
l = int(input())
s = str(input())

if l %2 == 1:
  print('No')
else:

  t = int(l / 2)

  if (s[0:t] == s[t+1:l+1]):
    print('Yes')
  else:
    print('No')
  

l = int(input())
s = str(input())

if l %2 == 1:
  print('No')
else:

  t = int(l / 2)


  if (s[0:t] == s[t:l+1]):
    print('Yes')
  else:
    print('No')
  

Verdicts: Wrong Answer

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

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

if n%2==2:
  print('No')
else:
  s1=s[:n//2]
  s2=s[n//2:]
  print(s1,s2)
  if s1==s2:
    print('Yes')
  else:
    print('No')

n=int(input())
s=input()

if n%2==1:
  print('No')
else:
  s1=s[0:n//2]
  s2=s[n//2:n]
  print(s1,s2)
  if s1==s2:
    print('Yes')
  else:
    print('No')

n=int(input())
s=input()

if n%2==1:
  print('No')
else:
  s1=s[0:n//2]
  s2=s[n//2:n+1]
  print(s1,s2)
  if s1==s2:
    print('Yes')
  else:
    print('No')

n=int(input())
s=input()

if n%2==1:
  print('No')
else:
  s1=s[:n//2]
  s2=s[n//2:]
  #print(s1,s2)
  if s1==s2:
    print('Yes')
  else:
    print('No')

Verdicts: Wrong Answer

Wrong Answer

Wrong Answer

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

Submission attempts (in order):
num = int(input())
s = input()
flg=False
if num>1 and num%2==0:
    if s[:num//2] == s[num//2:]:
        flg=True
if flg:
    print('True')
else:
    print('No')

num = int(input())
s = input()
flg=False
if num>1 and num%2==0:
    if s[:num//2] == s[num//2:]:
        flg=True
if flg:
    print('Yes')
else:
    print('No')

Verdicts: Wrong Answer

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

Submission attempts (in order):
def e(a):
    n=len(a)
    if len(a)%2!=0:
        return 'No'
    else:
        if a[:n//2]==a[(n//2):n]:
            return 'Yes'
        else:
            return 'No'
a=input()
print(e(a))

def e(a):
    n=len(a)
    if len(a)%2!=0:
        return 'No'
    else:
        if a[:n//2]==a[(n//2):n]:
            return 'Yes'
        else:
            return 'No'
n=int(input())
a=input()
print(e(a))

Verdicts: Wrong Answer

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

Submission attempts (in order):
n=int(input())
s=input()
if n%2==1:
  print("No")
  exit()
t=s[:n/2]
if t+t==s:
  print("Yes")
else:
  print("No")

n=int(input())
s=input()
if n%2==1:
    print("No")
    exit()
t=s[:int(n/2)]
if t+t==s:
    print("Yes")
else:
    print("No")

Verdicts: Runtime Error

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

Submission attempts (in order):
n = int(input())  
s = input()
if s[:n/2] == s[n/2:]:
  print("Yes")
else:
  print("No")

n = int(input())
if n / 2 % == 1:
  print("No")
  return
s = input()
if s[:n/2] == s[n/2:]:
  print("Yes")
else:
  print("No")

n = int(input())
if n / 2 % == 1:
  print("No")
  exit()
s = input()
if s[:n/2] == s[n/2:]:
  print("Yes")
else:
  print("No")

n = int(input())
s = input()
if s[:n//2] == s[n//2:]:
  print("Yes")
else:
  print("No")

Verdicts: Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

Submission attempts (in order):
st = input()
n= len(st)
if st[:n//2] == st[n//2:]:
  print("Yes")
else:
  print("No")

n= int(input())
st = input()

if st[:n//2] == st[n//2:]:
  print("Yes")
else:
  print("No")

Verdicts: Wrong Answer

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

Submission attempts (in order):
n,a=open(0);n=int(n);print("YNeos"[a[:n//2]!=a[n//2:]::2])

n,a=open(0);n=int(n);print("YNeos"[a[:n//2]!=a[n//2:-1]::2])

Verdicts: Wrong Answer

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

Submission attempts (in order):
# coding: utf-8
# Your code here!

N = int(input())
S = input()
if len(S) % 2 == 0:
    char1 = S[0:N // 2]
    char2 = S[N // 2: N + 1]
    print(char1, char2)
    if char1 == char2:
        print('Yes')
    else:
        print('No')
else:
    print('No')

# coding: utf-8
# Your code here!

N = int(input())
S = input()
if len(S) % 2 == 0:
    char1 = S[0:N // 2]
    char2 = S[N // 2: N + 1]
    if char1 == char2:
        print('Yes')
    else:
        print('No')
else:
    print('No')

Verdicts: Wrong Answer

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

Submission attempts (in order):

N, S = input().split()

hN = int(int(N)/2)

S1 = S[:hN]
S2 = S[hN:]

if(S1 == S2):
    print('Yes')
else:
    print('No')



N, S = input().split()

hN = int(int(N)/2)

S1 = S[:hN]
S2 = S[hN:]

if(S1 == S2):
    print('Yes')
else:
    print('No')



N = int(input())
S = input()

hN = int(int(N)/2)

S1 = S[:hN]
S2 = S[hN:]

if(S1 == S2):
    print('Yes')
else:
    print('No')


Verdicts: Runtime Error

Runtime Error

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

Submission attempts (in order):
import collections

n = int(input())
s = input()

s_list = list(s)
collections = collections.Counter(s)

res = []
for c in collections.values():
  if c == 2:
    res.append(True)

if len(res) == len(collections):
  print('YES')
else:
  print('NO')

n = int(input())
s = input()

res = []

if n%2 is not 0:
  print('No')
if n%2 == 0:
  tl = s[0:(n//2)]
  t_list = list(tl)
  if s.count(tl) == 2:
    print('Yes')
  else:
    print('No')
    
  

Verdicts: Wrong Answer

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

Submission attempts (in order):
n = int(input())

s = input()
k=""
if n%2 == 0:
    i =int( n/2)
    print(i)
    for j in range(0,i):
        k += s[j]
    if s == k+k:
        print('Yes')
    else:
        print('No')

else:
    print('No')

n = int(input())

s = input()
k=""
if n%2 == 0:
    i =int( n/2)
    for j in range(0,i):
        k += s[j]
    if s == k+k:
        print('Yes')
    else:
        print('No')

else:
    print('No')

Verdicts: Wrong Answer

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

Submission attempts (in order):
s = input()
if s[:len(s)//2]==s[len(s)//2:]:
    print("Yes")
else:
    print("No")

s = input()
if s[0:len(s)//2]==s[len(s)//2:len(s)]:
    print("Yes")
else:
    print("No")

n = int(input())
s = input()
if (s[0:len(s)//2]==s[len(s)//2:len(s)]):
    print("Yes")
else:
    print("No")

Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

Submission attempts (in order):
length = int(input())
str_ls = list(map(str, input().split()))
num = int(length / 2)
ls_1 = str_ls[:num]
ls_2 = str_ls[num:]
if length == 1:
    print('No')
elif ls_1 != ls_2:
    print('No')
else:
    print('Yes')

length = int(input())
str_ls = list(map(str, input().split()))
num = int(length / 2)
ls_1 = str_ls[:num]
ls_2 = str_ls[num:]
if length == 1:
    print('No')
elif ls_1 == ls_2:
    print('Yes')
else:
    print('No')


length = int(input())
str_ls = list(map(str, input().split()))
num = length // 2
ls_1 = str_ls[:num]
ls_2 = str_ls[num:]
if length == 1:
    print('No')
elif ls_1 == ls_2:
    print('Yes')
else:
    print('No')

length = int(input())
str_ls = list(map(str, input().split()))
num = int(length / 2)
ls_1 = str_ls[:num]
ls_2 = str_ls[num:]
if ls_1 != ls_2:
    print('No')
else:
    print('Yes')

length = int(input())
str_ls = list(input())
num = length // 2
#print(num)
#print(str_ls)
ls_1 = str_ls[:num]
ls_2 = str_ls[num:]
#print(ls_1)
#print(ls_2)
if length == 1:
    print('No')
elif ls_1 == ls_2:
    print('Yes')
else:
    print('No')

Verdicts: Wrong Answer

Wrong Answer

Wrong Answer

Wrong Answer

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

Submission attempts (in order):
n = int(input())
s = input()
t = s[:n//2]
print(t)
if n%2 != 0:
    print('No')
elif s == t*2:
    print('Yes')
else:
    print('No')

n = int(input())
s = input()
t = s[:n//2]
if n%2 != 0:
    print('No')
elif s == t*2:
    print('Yes')
else:
    print('No')

Verdicts: Wrong Answer

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

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

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

N = int(input())
S = input()

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


N = int(input())
S = input()

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


Verdicts: Runtime Error

Wrong Answer

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

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

if n % 2 != 0:
  print('No')
else:
  m = n/2
  if s[:m-1] == s[m:]:
    print('Yes')

n=int(input())
s=input()

if n % 2 != 0:
  print('No')
else:
  m = int(n/2)
  if s[:m] == s[m:]:
    print('Yes')
  else:
    print('No')
    
    


Verdicts: Runtime Error

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

Submission attempts (in order):
n=input()
if len(n)%2:print("No")
else:print("Yes" if n[0:len(n)//2]==n[len(n)//2:] else "No")

input()
n = input()
if len(n) % 2:
    print("No")
else:
    print("Yes" if n[0:len(n)//2] == n[len(n)//2:] else "No")


Verdicts: Wrong Answer

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

Submission attempts (in order):
# -*- coding:utf-8 -*-

def solve():
    N = int(input())
    S = input()
    if N%2 != 0:
        print("No")
        return

    l_str = S[0:N//2-1]
    r_str = S[N//2:]

    if l_str == r_str:
        print("Yes")
        return

    print("No")

if __name__ == "__main__":
    solve()


# -*- coding:utf-8 -*-

def solve():
    N = int(input())
    S = input()
    if N%2 != 0:
        print("No")
        return

    l_str = S[0:N//2]
    r_str = S[N//2:]

    if l_str == r_str:
        print("Yes")
        return

    print("No")

if __name__ == "__main__":
    solve()


Verdicts: Wrong Answer

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

Submission attempts (in order):
n = int(input())
s = input()
if n%2 == 0:
  s0 = s[0:int((n//2)-1)]
  if s0 == s[int(n//2):]:
    print('Yes')
  else:
    print('No')
else:
  print('No')


n = int(input())
s = input()
if n%2 == 0:
  s0 = s[0:(n//2)-1]
  if s0 == s[n//2:]:
    print('Yes')
  else:
    print('No')
else:
  print('No')

n = int(input())
s = input()
if n%2 == 0:
  s0 = s[0:int(n//2)]
  if s0 == s[int(n//2):]:
    print('Yes')
  else:
    print('No')
else:
  print('No')


Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

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

if n % 2 != 0 or s[:n/2] != s[n/2:]:
  print("No")
else:
  print("Yes")
 

n = int(input())
s = input()

if s[:n/2] == s[n/2:]:
	print("Yes")
else:
    print("No")


n = int(input())
s = input()
     
if s[:n/2] == s[n/2:]:
	print("Yes")
else:
	print("No")

n = int(input())
s = input()
     
if s[:n//2] == s[n//2:]:
	print("Yes")
else:
	print("No")


Verdicts: Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

Submission attempts (in order):
n = str(input())
s = str(input())
s_l = s[0:len(s)//2]
s_r = s[len(s)//2:len(s)]
if s_l == s_r:
    print('TRUE')
else:
    print('FALSE')

n = str(input())
s = str(input())
s_l = s[0:len(s)//2]
s_r = s[len(s)//2:len(s)]
if s_l == s_r:
    print('Yes')
else:
    print('No')

Verdicts: Wrong Answer

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

Submission attempts (in order):
S = input()
index = len(S) // 2

if len(S) % 2 != 0:
  print('No')
elif S[:index] != S[index:]:
  print('No')
else:
  print('Yes')

import sys

N = int(input())
str_input = input()

if N % 2 != 0:
  print('No')
else:
  print('Yes') if str_input[:N/2] == str_input[:N] else print('No')


S = input()

if len(S) % 2 != 0:
  matched = False
else:
  matched = True
  index = len(S)//2
  for i in range(index):
    if S[i] != S[index+i]:
      matched = False
      break

if matched:
  print('Yes')
else:
  print('False')

N = int(input())
str_input = input()
 
if N % 2 != 0:
  print('No')
else:
  print('Yes') if str_input[:N/2] == str_input[(N/2):] else print('No')

S = input()

if len(S) % 2 != 0:
  matched = False
else:
  matched = True
  index = len(S)//2
  for i in range(index+1):
  	if S[i] != S[index+1]
    	matched = False
        break
        
if mathed:
  print('Yes')
else:
  print('False')
      
      

N = int(input())
str_input = input()
 
if N % 2 != 0:
  print('No')
else:
  print('Yes') if str_input[:N//2] == str_input[(N//2):] else print('No')

Verdicts: Wrong Answer

Runtime Error

Wrong Answer

Runtime Error

Runtime Error

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

Submission attempts (in order):
n=int(input())
s=input()
m=n//2
t=s[:m]
print('Yes' if s=t+t else 'No')

n=int(input())
s=input()
m=n//2
t=s[:m]
print('Yes' if s==t+t else 'No')

Verdicts: Runtime Error

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

Submission attempts (in order):
    n = int(input())
    s = input()
    half = n//2
     
    if s == (s[0:half] + s[0:half]):
             print("Yes")
    else:
             print("No")

n = int(inpur())
s = input()
half = n//2

if s == (s[0:half] + s[0:half]:
         print("Yes")
else:
         print("No")

n = int(input())
s = input()
half = n//2

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

elif s == (s[0:half] + s[0:half]):
                 print("Yes")
else:
                 print("No")

Verdicts: Runtime Error

Runtime Error

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

Submission attempts (in order):
n=int(input())
s=input()
if n%2==0:
  s_1=s[0:n/2]
  s_2=s[n/2:n]
  if s_1==s_2:
    print("Yes")
  else:
    print("No")
else:
  print("No")

n=int(input())
s=input()
if n%2==0:
  s_1=s[0:n/2]
  s_2=s[n/2:n]
  if s_1==s_2:
    print("Yes")
else:
  print("No")


n=int(input())
s=input()
if n%2==0:
    k=int(n/2)
    s_1=s[0:k]
    s_2=s[k:n]
    if s_1==s_2:
        print("Yes")
    else:
        print("No")
else:
    print("No")

Verdicts: Runtime Error

Runtime Error

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

Submission attempts (in order):
len = int(input())
s = input()
s1 = s[:len / 2]
s2 = s[len/2:]
if s1 == s2:
  print('Yes')
else:
  print('No')

l = int(input())
s = input()
s1 = s[:l // 2]
s2 = s[l//2:]
if s1 == s2:
    print('Yes')
else:
    print('No')


Verdicts: Runtime Error

Accepted
Problem: Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

Submission attempts (in order):
N = int(input())
S = input()
if N % 2 == 1:
  print('No')
else:
  for i in range(N//2):
    if S[i] != S[i + N //2]:
      print('No')
      exit(0)
    else:
      print('Yes')

N = int(input())
S = input()
n = int(N/2) - 1
if len(S) % 2 == 1:
  print('No')
else:
  for i in range(n):
    if S[i] == S[i + int(n)]:
      print('Yes')
      exit(0)
  print('No')

N = int(input())
S = input()
m = N - 1
n = int(N / 2)
n0 = n - 1
if len(S) % 2 == 1:
  print('No')
else:
  for i in range(n):
    if S[i] == S[i + n0]:
      print('Yes')
      exit(0)
  print('No')

N = int(input())
S = input()
if N % 2 == 1:
  print('No')
else:
  for i in range(N//2):
    if S[i] != S[i + N //2]:
      print('No')
      exit(0)
  print('Yes')

Verdicts: Wrong Answer

Wrong Answer

Wrong Answer

Accepted