problem_id
stringlengths 6
6
| buggy_code
stringlengths 8
526k
| fixed_code
stringlengths 12
526k
| labels
listlengths 0
15
⌀ | buggy_submission_id
int64 1
1.54M
| fixed_submission_id
int64 2
1.54M
| user_id
stringlengths 10
10
| language
stringclasses 8
values |
|---|---|---|---|---|---|---|---|
p02860
|
a = int(input())
s = input()
if s[0:int(a/2)] == s[int(a/2):a]:
print('yes')
else:
print('no')
|
a = int(input())
s = input()
if s[0:int(a/2)] == s[int(a/2):a]:
print('Yes')
else:
print('No')
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 663,547
| 663,548
|
u087665185
|
python
|
p02860
|
n = int(input())
s = input()
if n % 2 != 0:
print("No")
else:
half = n // 2
found = False
for i in range(0, half + 1):
if s[i] != s[half + i]:
found = True
break
print("No" if found else "Yes")
|
n = int(input())
s = input()
if n % 2 != 0:
print("No")
else:
half = n // 2
found = False
for i in range(0, half):
if s[i] != s[half + i]:
found = True
break
print("No" if found else "Yes")
|
[
"expression.operation.binary.remove"
] | 663,553
| 663,554
|
u986237475
|
python
|
p02860
|
n = int(input())
a = input()
b = a[0:n//2]
c = a[n//2-1:n-1]
#print(b)
#print(c)
if n!=1:
if b==c :
print('Yes')
else:
print('No')
else:
print('No')
|
n = int(input())
a = input()
b = a[0:n//2]
c = a[n//2:n]
#print(b)
#print(c)
if n!=1:
if b==c :
print('Yes')
else:
print('No')
else:
print('No')
|
[
"expression.operation.binary.remove"
] | 663,564
| 663,565
|
u845937249
|
python
|
p02860
|
n=int(input())
s=input()
print(["No","Yes"][s[:int(n/2)]]==s[int(n/2):])
|
n=int(input())
s=input()
print(["No","Yes"][s[:int(n/2)]==s[int(n/2):]])
|
[
"call.arguments.change"
] | 663,577
| 663,579
|
u427571081
|
python
|
p02860
|
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")
|
[
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 663,580
| 663,582
|
u665224938
|
python
|
p02860
|
N=int(input())
S=input()
flag=0
if N%2==0:
for i in range(0,int(N/2)):
if S[i]!=S[i+3]:
flag+=1
if flag==0:
print('Yes')
else :
print('No')
else :
print('No')
|
N=int(input())
S=input()
flag=0
if N%2==0:
for i in range(0,int(N/2)):
if S[i]!=S[i+int(N/2)]:
flag+=1
if flag==0:
print('Yes')
else :
print('No')
else :
print('No')
|
[
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"call.arguments.add"
] | 663,589
| 663,587
|
u333731247
|
python
|
p02860
|
n = int(input())
s = input()
if n % 2 == 1:
print("No")
else:
d = n/2
if s[:d] == s[d:]:
print("Yes")
else:
print("No")
|
n = int(input())
s = input()
if n % 2 == 1:
print("No")
else:
d = int(n/2)
if s[:d] == s[d:]:
print("Yes")
else:
print("No")
|
[
"call.add",
"call.arguments.change"
] | 663,604
| 663,605
|
u534308356
|
python
|
p02860
|
# -*- 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()
|
[
"expression.operation.binary.remove"
] | 663,613
| 663,614
|
u687044304
|
python
|
p02860
|
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")
|
[
"expression.operator.arithmetic.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"call.arguments.change",
"control_flow.loop.range.bounds.step.change"
] | 663,572
| 663,575
|
u582663624
|
python
|
p02860
|
N = int(input())
S = input()
if N%2 == 0:
print('No')
elif S == S[0:N//2+1]*2 :
print('Yes')
else:
print('No')
|
N = int(input())
S = input()
if N%2 == 1:
print('No')
elif S == S[0:N//2]*2 :
print('Yes')
else:
print('No')
|
[
"literal.number.integer.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 663,599
| 663,601
|
u540761833
|
python
|
p02860
|
n = int(input())
s = input()
if n%2==0:
a = s[0:(int(n/2))]
b = s[(int(n/2)):n]
if a==b:
print("Yes")
else:
print("NO")
else:
print("No")
|
n = int(input())
s = input()
if n%2==0:
a = s[0:(int(n/2))]
b = s[(int(n/2)):n]
if a==b:
print("Yes")
else:
print("No")
else:
print("No")
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 663,616
| 663,618
|
u032222383
|
python
|
p02860
|
N, row = input().split()
unit1, unit2 = row[:len(row)//2], row[len(row)//2:]
if unit1 == unit2:
print('Yes')
else:
print('No')
|
N = input()
row = input()
unit1, unit2 = row[:len(row)//2], row[len(row)//2:]
if unit1 == unit2:
print('Yes')
else:
print('No')
|
[
"call.add",
"call.remove"
] | 663,626
| 663,627
|
u908481359
|
python
|
p02860
|
row = input()
unit1, unit2 = row[:len(row)//2], row[len(row)//2:]
if unit1 == unit2:
print('Yes')
else:
print('No')
|
N = input()
row = input()
unit1, unit2 = row[:len(row)//2], row[len(row)//2:]
if unit1 == unit2:
print('Yes')
else:
print('No')
|
[
"assignment.add"
] | 663,628
| 663,627
|
u908481359
|
python
|
p02860
|
n = int(input())
s = input()
if n % 2 == 1:
print('No')
else:
if s[0:n//2-1] == s[n//2+1:n-1]:
print('Yes')
else:
print('No')
|
n = int(input())
s = input()
if n % 2 == 1:
print('No')
else:
if s[0:n//2] == s[n//2:n]:
print('Yes')
else:
print('No')
|
[
"expression.operation.binary.remove"
] | 663,635
| 663,636
|
u812587837
|
python
|
p02860
|
import sys
def main():
[n, s] = [x for x in sys.stdin]
n = int(n)
if n % 2 != 0:
print("No")
return
half = int(n / 2)
if s[:half] == s[half:]:
print("Yes")
return
print("No")
main()
|
import sys
def main():
[n, s] = [x for x in sys.stdin]
n = int(n)
if n % 2 != 0:
print("No")
return
half = int(n / 2)
if s[0:half] == s[half:n]:
print("Yes")
return
print("No")
main()
|
[
"control_flow.branch.if.condition.change"
] | 663,646
| 663,647
|
u081069339
|
python
|
p02860
|
N = int(input())
S = str(input())
half = int(N/2)
if S[:half] == S[half:]:
print("True")
else:
print("False")
|
N = int(input())
S = str(input())
half = int(N/2)
if S[:half] == S[half:]:
print("Yes")
else:
print("No")
|
[
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 663,650
| 663,651
|
u943057856
|
python
|
p02860
|
N = input()
S = str(input())
if N + 2 // 2 == 1:
print('No')
else:
f = int(N/2)
b = int(N/2)
front = S[:f]
back = S[b:]
if front == back:
print('Yes')
else:
print('No')
|
N = int(input())
S = str(input())
if N + 2 // 2 == 1:
print('No')
else:
f = int(N/2)
b = int(N/2)
front = S[:f]
back = S[b:]
if front == back:
print('Yes')
else:
print('No')
#print(front)
#print(back)
|
[
"call.add",
"call.arguments.change"
] | 663,654
| 663,655
|
u966546644
|
python
|
p02860
|
n=int(input())
s=input()
if n%2==1:
print("No")
n=n//2
if s[:n]==s[n:]:
print("Yes")
else:
print("No")
|
n=int(input())
s=input()
if n%2==1:
print("No")
exit()
n=n//2
if s[:n]==s[n:]:
print("Yes")
else:
print("No")
|
[
"call.add"
] | 663,656
| 663,657
|
u236838596
|
python
|
p02860
|
def echo(n,s):
if n % 2 != 0:
pass
else:
if s[:int(n/2)] == s[int(n/2):]:
return "yes"
return "no"
print(echo(int(input()),input()))
|
def echo(n,s):
if n % 2 != 0:
pass
else:
if s[:int(n/2)] == s[int(n/2):]:
return "Yes"
return "No"
print(echo(int(input()),input()))
|
[
"literal.string.change",
"literal.string.case.change",
"function.return_value.change"
] | 663,665
| 663,666
|
u871550854
|
python
|
p02860
|
n=int(input())
a =input()
if len(a)%2!=0:
print("NO")
else:
if a[:len(a)//2]==a[len(a)//2:]:
print("YES")
else:
print("NO")
|
n=int(input())
a =input()
if len(a)%2!=0:
print("No")
else:
if a[:len(a)//2]==a[len(a)//2:]:
print("Yes")
else:
print("No")
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 663,667
| 663,668
|
u981269105
|
python
|
p02860
|
n = int(input())
chars = input()
if n%2 ==0:
k = n/2
if chars[:k] == chars[k:]:
print("Yes")
else:
print("No")
else:
print("No")
|
n = int(input())
chars = input()
if n%2 == 0:
k = n//2
if chars[:k] == chars[k:]:
print("Yes")
else:
print("No")
else:
print("No")
|
[
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 663,671
| 663,672
|
u323374686
|
python
|
p02860
|
N = int(input())
S = input()
if N%2 == 1:
print("NO")
else:
N_2 = N//2
if S[:N_2]==S[N_2:]:
print("YES")
else:
print("NO")
|
N = int(input())
S = input()
if N%2 == 1:
print("No")
else:
N_2 = N//2
if S[:N_2]==S[N_2:]:
print("Yes")
else:
print("No")
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 663,675
| 663,676
|
u994093512
|
python
|
p02860
|
a = int(input())
s = string(input())
if a % 2 == 1:
print("No")
else:
b = int(a/2)
if s[:b] == s[b:]:
print("Yes")
else:
print("No")
|
a = int(input())
s = str(input())
if a % 2 == 1:
print("No")
else:
b = int(a/2)
if s[:b] == s[b:]:
print("Yes")
else:
print("No")
|
[
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 663,679
| 663,680
|
u094103573
|
python
|
p02860
|
a = int(input())
s = string(input())
if a % 2 == 1:
print("No")
else:
b = a/2
if s[:b] == s[b:]:
print("Yes")
else:
print("No")
|
a = int(input())
s = str(input())
if a % 2 == 1:
print("No")
else:
b = int(a/2)
if s[:b] == s[b:]:
print("Yes")
else:
print("No")
|
[
"assignment.value.change",
"identifier.change",
"call.function.change",
"call.add",
"call.arguments.change"
] | 663,681
| 663,680
|
u094103573
|
python
|
p02860
|
N = int(input())
S = input()
if N % 2 == 1:
print("No")
else:
ans1 = S[:N//2]
ans2 = S[:N//2]
if ans1 == ans2:
print("Yes")
else:
print("No")
|
N = int(input())
S = input()
if N % 2 == 1:
print("No")
else:
ans1 = S[:N//2]
ans2 = S[N//2:]
if ans1 == ans2:
print("Yes")
else:
print("No")
|
[] | 663,695
| 663,696
|
u658931690
|
python
|
p02860
|
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')
|
[
"call.remove"
] | 663,699
| 663,700
|
u569185453
|
python
|
p02860
|
#coding by utf-8
N = int(input())
S = str(input())
t = int(N / 2)
if S[:t] == S[t:]:
print("Yes")
else:
print("NO")
|
#coding by utf-8
N = int(input())
S = str(input())
t = int(N / 2)
if S[:t] == S[t:]:
print("Yes")
else:
print("No")
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 663,708
| 663,709
|
u674736819
|
python
|
p02860
|
N = int(input())
S = input()
if N%2==1:
print('No')
else:
a = S[:N//2]
b = S[N//2:]
print(a,b)
if a==b:
print('Yes')
else:
print('No')
|
N = int(input())
S = input()
if N%2==1:
print('No')
else:
a = S[:N//2]
b = S[N//2:]
if a==b:
print('Yes')
else:
print('No')
|
[
"call.remove"
] | 663,710
| 663,711
|
u114799679
|
python
|
p02860
|
_ = input()
s = input()
mid = int((len(s)+1)/2)
if s[:mid] == s[mid:]:
print("Yes")
else:
print("NO")
|
_ = input()
s = input()
mid = int((len(s)+1)/2)
if s[:mid] == s[mid:]:
print("Yes")
else:
print("No")
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 663,714
| 663,715
|
u424240341
|
python
|
p02860
|
n = int(input())
s = input()
a = s[0:int(n/2)]
b = s[int(n/2):]
print(a,b)
if n % 2 != 0 or n != len(s):
print("No")
elif a == b:
print("Yes")
else:
print("No")
|
n = int(input())
s = input()
a = s[0:int(n/2)]
b = s[int(n/2):]
if n % 2 != 0 or n != len(s):
print("No")
elif a == b:
print("Yes")
else:
print("No")
|
[
"call.remove"
] | 663,716
| 663,717
|
u177645323
|
python
|
p02860
|
N = int(input())
S = input()
if N % 2 == 0 and S[:N] == S[N:]:
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")
|
[
"control_flow.branch.if.condition.change"
] | 663,718
| 663,719
|
u732996882
|
python
|
p02860
|
n = int(input())
a = input()
if a[0:int(n/2)-1]==a[int(n/2):n-1]:
print("Yes")
else:
print("No")
|
n = int(input())
a = input()
if a[0:int(n/2)]==a[int(n/2):n]:
print("Yes")
else:
print("No")
|
[
"expression.operation.binary.remove"
] | 663,720
| 663,721
|
u777916428
|
python
|
p02860
|
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')
|
[
"call.remove"
] | 663,749
| 663,750
|
u677732976
|
python
|
p02860
|
N=int(input().strip())
if N%2!=0:
print("No")
S=input().strip()
if S[:int(N/2)] == S[int(N/2):]:
print("Yes")
else:
print("No")
|
N=int(input().strip())
if N%2!=0:
print("No")
else:
S=input().strip()
if S[:int(N/2)] == S[int(N/2):]:
print("Yes")
else:
print("No")
|
[] | 663,759
| 663,760
|
u970133396
|
python
|
p02860
|
N = int(input())
S = str(input())
result = "yes"
n= int(N/2)
if(N%2 == 0):
for i in range(n):
if(S[i] != S[n+i]):
result = "no"
else:
result = "no"
print(result)
|
N = int(input())
S = str(input())
result = "Yes"
n= int(N/2)
if(N%2 == 0):
for i in range(n):
if(S[i] != S[n+i]):
result = "No"
else:
result = "No"
print(result)
|
[
"literal.string.change",
"literal.string.case.change",
"assignment.value.change"
] | 663,763
| 663,764
|
u722102777
|
python
|
p02860
|
N = int(input())
S = input()
print('Yes') if S[:len(S)/2] == S[len(S)/2:] else print('No')
|
N = int(input())
S = input()
print('Yes') if S[:len(S)//2] == S[len(S)//2:] else print('No')
|
[
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 663,765
| 663,766
|
u521020719
|
python
|
p02860
|
n = int(input())
s = input()
if n % 2 == 0:
n = n // 2
for i in range(n):
if s[i] != s[n + i]:
print('No')
break
else:
print('Yes')
else:
print('no')
|
n = int(input())
s = input()
if n % 2 == 0:
n = n // 2
for i in range(n):
if s[i] != s[n + i]:
print('No')
break
else:
print('Yes')
else:
print('No')
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 663,767
| 663,768
|
u689429090
|
python
|
p02860
|
n = int(input())
s = input()
if n % 2 == 0:
n = n // 2
for i in range(n):
if s[i] != s[n + i]:
print('No')
break
else:
print('Yes')
else:
print('Yes')
|
n = int(input())
s = input()
if n % 2 == 0:
n = n // 2
for i in range(n):
if s[i] != s[n + i]:
print('No')
break
else:
print('Yes')
else:
print('No')
|
[
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 663,769
| 663,768
|
u689429090
|
python
|
p02860
|
total = int(input())
s = input()
if total%2 == 1:
print("No")
else:
if(s[:int(total/2)] is s[int(total/2):]):
print("Yes")
else:
print("No")
|
total = int(input())
s = input()
if total%2 == 1:
print("No")
else:
if(s[:int(total/2)] == s[int(total/2):]):
print("Yes")
else:
print("No")
|
[
"control_flow.branch.if.condition.change"
] | 663,770
| 663,771
|
u493373637
|
python
|
p02860
|
total = int(input())
s = input()
if total%2 == 1:
print("No")
else:
if(s[:total/2]==s[total/2:]):
print("Yes")
else:
print("No")
|
total = int(input())
s = input()
if total%2 == 1:
print("No")
else:
if(s[:int(total/2)] == s[int(total/2):]):
print("Yes")
else:
print("No")
|
[
"control_flow.branch.if.condition.change",
"call.add"
] | 663,772
| 663,771
|
u493373637
|
python
|
p02860
|
total = int(input())
s = input()
if total%2 == 1:
print("No")
else:
if(s[:total/2]==s[total/2:]):
print("Yes")
else:
print("No")
|
total = int(input())
s = input()
if total%2 == 1:
print("No")
else:
if(s[:int(total/2)] == s[int(total/2):]):
print("Yes")
else:
print("No")
|
[
"control_flow.branch.if.condition.change",
"call.add"
] | 663,773
| 663,771
|
u493373637
|
python
|
p02860
|
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')
|
[
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 663,788
| 663,789
|
u660571124
|
python
|
p02860
|
n = int(input())
s = input()
if s == s[:n//2+1]*2:
print("Yes")
else:
print("No")
|
n = int(input())
s = input()
if s == s[:n//2]*2:
print("Yes")
else:
print("No")
|
[
"expression.operation.binary.remove"
] | 663,808
| 663,809
|
u973758681
|
python
|
p02860
|
n=int(input())
s=input()
flag=1
if n%2==1:
print('No')
else:
for i in range(1,n//2):
if s[i]==s[i+n//2]:
flag*=1
else:
flag*=0
if flag==1:
print('Yes')
else:
print('No')
|
n=int(input())
s=input()
flag=1
if n%2==1:
print('No')
else:
for i in range(n//2):
if s[i]==s[i+n//2]:
flag*=1
else:
flag*=0
if flag==1:
print('Yes')
else:
print('No')
|
[
"call.arguments.change"
] | 663,819
| 663,820
|
u015187377
|
python
|
p02860
|
n=int(input())
s=input()
flag=1
if n%2==1:
print('No')
else:
for i in range(1,n//2):
if s[i]==s[i+n//2]:
flag*=1
else:
flag*=0
if flag==1:
print('Yes')
else:
print('No')
|
n=int(input())
s=input()
flag=1
if n%2==1:
print('No')
else:
for i in range(n//2):
if s[i]==s[i+n//2]:
flag*=1
else:
flag*=0
if flag==1:
print('Yes')
else:
print('No')
|
[
"call.arguments.change"
] | 663,821
| 663,820
|
u015187377
|
python
|
p02860
|
import math
N = int(input())
S = input()
if N%2 == 1:
print(No)
else:
if S == S[:N//2]+S[:N//2]:
print("Yes")
else:
print("No")
|
import math
N = int(input())
S = input()
if N%2 == 1:
print("No")
else:
if S == S[:N//2]+S[:N//2]:
print("Yes")
else:
print("No")
|
[
"call.arguments.change"
] | 663,822
| 663,823
|
u513900925
|
python
|
p02860
|
n = int(input())
s = input()
# print(s[:n // 2], s[n//2+1:n])
if n % 2 == 1 :
print("NO")
elif s[:n // 2] == s[n//2:n]:
print("YES" )
else:
print("NO")
|
n = int(input())
s = input()
# print(s[:n // 2], s[n//2+1:n])
if n % 2 == 1 :
print("No")
elif s[:n // 2] == s[n//2:n]:
print("Yes" )
else:
print("No")
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 663,839
| 663,840
|
u785795721
|
python
|
p02860
|
N = int(input())
S = input()
if N % 2:
print('No')
exit()
if S[0:N//2] == S[N//2:N]:
print('YES')
else:
print('NO')
|
N = int(input())
S = input()
if N % 2:
print('No')
exit()
if S[0:N//2] == S[N//2:N]:
print('Yes')
else:
print('No')
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 663,843
| 663,844
|
u920032768
|
python
|
p02860
|
n=int(input())
s=input()
if n%2==0 and s[:n//2] == s[n//2:]:
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")
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 663,859
| 663,860
|
u472645805
|
python
|
p02860
|
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')
|
[
"expression.operation.binary.remove"
] | 663,879
| 663,880
|
u659468426
|
python
|
p02860
|
n=int(input())
s=input()
if len(s)%2!=0:
print("Yes")
else:
j=len(s)//2
if s[:j]==s[j:]:
print("Yes")
else:
print("No")
|
n=int(input())
s=input()
if len(s)%2!=0:
print("No")
else:
j=len(s)//2
if s[:j]==s[j:]:
print("Yes")
else:
print("No")
|
[
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 663,932
| 663,933
|
u780962115
|
python
|
p02860
|
N = int(input())
A = str(input())
n = int(N/2)
m = N-n
print(m)
if n == m:
if A[:n] == A[n:]:
print('Yes')
else:
print('No')
else:
print('No')
|
N = int(input())
A = str(input())
n = int(N/2)
m = N-n
if n == m:
if A[:n] == A[n:]:
print('Yes')
else:
print('No')
else:
print('No')
|
[
"call.remove"
] | 663,934
| 663,935
|
u451233002
|
python
|
p02860
|
N = input()
A = input()
AA = A[0:int(N/2)]
if A == (AA+AA):
print('Yes')
else:
print('No')
|
N = int(input())
A = input()
AA = A[0:int(N/2)]
if A == (AA+AA):
print('Yes')
else:
print('No')
|
[
"call.add",
"call.arguments.change"
] | 663,942
| 663,943
|
u113971909
|
python
|
p02860
|
n = int(input())
s = input()
if(n % 2 == 1):
print("No")
else:
if (s[:(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")
|
[
"expression.operation.binary.remove"
] | 663,948
| 663,949
|
u917733926
|
python
|
p02860
|
_ = input()
s = input()
if len(s) % 2 != 0:
print("No")
half_len = int(len(s)/2)
if s[:half_len]+s[:half_len] == s:
print("Yes")
else :
print("No")
|
_ = input()
s = input()
if len(s) % 2 != 0:
print("No")
exit()
half_len = int(len(s)/2)
if s[:half_len]+s[:half_len] == s:
print("Yes")
else :
print("No")
|
[
"call.add"
] | 663,950
| 663,951
|
u516400317
|
python
|
p02860
|
n = int(input())
s = input()
m = n/2
if n%2==0:
if s[:m]==s[m:]:
print('Yes')
else:
print('No')
else:
print('No')
|
n = int(input())
s = input()
m = int(n/2)
if n%2==0:
if s[:m]==s[m:]:
print('Yes')
else:
print('No')
else:
print('No')
|
[
"call.add",
"call.arguments.change"
] | 663,965
| 663,966
|
u144616794
|
python
|
p02860
|
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:int(n//2)]
if s0 == s[int(n//2):]:
print('Yes')
else:
print('No')
else:
print('No')
|
[
"call.arguments.change"
] | 663,979
| 663,980
|
u687929074
|
python
|
p02860
|
n = int(input().strip())
s = input().strip()
if n%2!=0:
print("NO")
elif s[:n//2]==s[n//2:]:
print("Yes")
else:
print("No")
|
n = int(input().strip())
s = input().strip()
if n%2!=0:
print("No")
elif s[:n//2]==s[n//2:]:
print("Yes")
else:
print("No")
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 663,989
| 663,990
|
u499286346
|
python
|
p02860
|
n = int(input())
s = input()
count = 0
print(n)
if n%2==1:
print("No")
else:
for i in range(n//2):
#print(s[i], s[n//2+i])
if s[i]!=s[n//2+i]:
count = 1
if count == 0:
print("Yes")
else:
print("No")
|
n = int(input())
s = input()
count = 0
#print(n)
if n%2==1:
print("No")
else:
for i in range(n//2):
#print(s[i], s[n//2+i])
if s[i]!=s[n//2+i]:
count = 1
if count == 0:
print("Yes")
else:
print("No")
|
[
"call.remove"
] | 663,999
| 664,000
|
u455533363
|
python
|
p02860
|
input()
a=input()
if len(a)%2==0 and a[:len(a)/2]==a[len(a)/2:]:
print("Yes")
else:
pritn("No")
|
input()
a=input()
if len(a)%2==0 and a[:len(a)//2]==a[len(a)//2:]:
print("Yes")
else:
print("No")
|
[
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"identifier.change",
"call.function.change"
] | 664,001
| 664,002
|
u172237109
|
python
|
p02860
|
input()
s=input()
if len(a)%2==0 and a[:len(a)/2]==a[len(a)/2:]:
print("Yes")
else:
pritn("No")
|
input()
a=input()
if len(a)%2==0 and a[:len(a)//2]==a[len(a)//2:]:
print("Yes")
else:
print("No")
|
[
"assignment.variable.change",
"identifier.change",
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"call.function.change"
] | 664,003
| 664,002
|
u172237109
|
python
|
p02860
|
n = int(input())
s = input()
if n % 2 != 0:
print('No')
mid = n // 2
t1 = s[0:mid]
t2 = s[mid:]
print('Yes') if t1 == t2 else print('No')
|
n = int(input())
s = input()
if n % 2 != 0:
print('No')
exit()
mid = n // 2
t1 = s[0:mid]
t2 = s[mid:]
print('Yes') if t1 == t2 else print('No')
|
[
"call.add"
] | 664,022
| 664,023
|
u395620499
|
python
|
p02860
|
N = int(input())
S = input()
flag = 0
if len(S)%2 != 0:
flag = 1
ans1 = ''
ans2 = ''
for i in range(N):
if i < N//2:
ans1+=S[i]
else:
ans2+=S[i]
if ans1==ans2 and flag==0:
print('yes')
if ans1 != ans2 or flag ==1:
print('No')
# print(ans1,ans2,flag)
|
N = int(input())
S = input()
flag = 0
if len(S)%2 != 0:
flag = 1
ans1 = ''
ans2 = ''
for i in range(N):
if i < N//2:
ans1+=S[i]
else:
ans2+=S[i]
if ans1==ans2 and flag==0:
print('Yes')
if ans1 != ans2 or flag ==1:
print('No')
# print(ans1,ans2,flag)
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 664,027
| 664,028
|
u225627575
|
python
|
p02860
|
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')
|
[
"assignment.variable.change",
"identifier.change"
] | 664,031
| 664,032
|
u696543571
|
python
|
p02860
|
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")
|
[
"call.add",
"call.arguments.change"
] | 664,037
| 664,038
|
u664373116
|
python
|
p02860
|
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')
|
[
"expression.operation.binary.remove"
] | 664,043
| 664,044
|
u627530854
|
python
|
p02860
|
n = int(input())
s = input()
flag = True
if n % 2 == 1:
flag = True
for i in range(0,n // 2):
if s[i] != s[int(i + (n // 2))]:
flag = False
break
if flag:
print("Yes")
else:
print("No")
|
n = int(input())
s = input()
flag = True
if n % 2 == 1:
flag = False
for i in range(0,n // 2):
if s[i] != s[int(i + (n // 2))]:
flag = False
break
if flag:
print("Yes")
else:
print("No")
|
[
"misc.opposites",
"assignment.value.change"
] | 664,085
| 664,086
|
u187995923
|
python
|
p02860
|
import sys
N = int(input())
S = input()
l = len(S)
if l % 2 != 0:
print('No')
sys.exit(0)
h = l // 2
print(h)
if S[:h] == S[h:]:
print('Yes')
sys.exit(0)
print('No')
|
import sys
N = int(input())
S = input()
l = len(S)
if l % 2 != 0:
print('No')
sys.exit(0)
h = l // 2
if S[:h] == S[h:]:
print('Yes')
sys.exit(0)
print('No')
|
[
"call.remove"
] | 664,099
| 664,100
|
u471828790
|
python
|
p02860
|
n = int(input())
s = input()
if n%2 != 0:
print('No')
if s[0:n//2] == s[n//2:]:
print('Yes')
else:
print('No')
|
n = int(input())
s = input()
if n%2 != 0:
print('No')
elif s[0:n//2] == s[n//2:]:
print('Yes')
else:
print('No')
|
[
"control_flow.branch.if.replace.remove",
"control_flow.branch.else_if.replace.add"
] | 664,107
| 664,108
|
u912115033
|
python
|
p02860
|
n = int(input())
s = input()
if n % 2 == 1:
print("No")
else:
t = n // 2
if s[1:t] == s[t:n]:
print("Yes")
else:
print("No")
|
n = int(input())
s = input()
if n % 2 == 1:
print("No")
else:
t = n // 2
if s[0:t] == s[t:n]:
print("Yes")
else:
print("No")
|
[
"literal.number.integer.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 664,131
| 664,132
|
u821989875
|
python
|
p02860
|
N = int(input())
S = input()
ans = "No"
if N % 2 == 0:
x = N//2
if s[:x] == s[x:]:
ans = "Yes"
print(ans)
|
N = int(input())
S = input()
ans = "No"
if N % 2 == 0:
x = N//2
if S[:x] == S[x:]:
ans = "Yes"
print(ans)
|
[
"identifier.change",
"control_flow.branch.if.condition.change"
] | 664,175
| 664,176
|
u158778550
|
python
|
p02860
|
n = int(input())
s = input()
if n % 2 == 0 and s[:n / 2] == s[n / 2:]:
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")
|
[
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 664,181
| 664,182
|
u440072236
|
python
|
p02860
|
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")
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 664,201
| 664,202
|
u608579392
|
python
|
p02860
|
N = int(input())
S = str(input())
if N % 2 == 1:
print("No")
#int(M) = N/2
if S[:int(N/2)] == S[int(N/2):N]:
print("Yes")
else:
print("No")
|
N = int(input())
S = str(input())
if N % 2 == 1:
print("No")
#int(M) = N/2
else:
if S[:int(N/2)] == S[int(N/2):N]:
print("Yes")
else:
print("No")
|
[] | 664,216
| 664,217
|
u575101291
|
python
|
p02860
|
N=int(input())
S=input()
if S[:(N//2)]==S:
print("Yes")
else:
print("No")
|
N=int(input())
S=input()
if S[:(N//2)]*2==S:
print("Yes")
else:
print("No")
|
[
"control_flow.branch.if.condition.change"
] | 664,220
| 664,221
|
u740047492
|
python
|
p02860
|
import numpy as np
N = int(input())
S = list(input())
if len(S) % 2 == 1:
print('NO')
else:
array = np.array(S).reshape(2, int(N/2))
array1 = array[0]
array2 = array[1]
# Trueが1、Falseが0
C = np.sum(array1 == array2)
if C == int(N/2):
print('YES')
else:
print('NO')
|
import numpy as np
N = int(input())
S = list(input())
if len(S) % 2 == 1:
print('No')
else:
array = np.array(S).reshape(2, int(N/2))
array1 = array[0]
array2 = array[1]
# Trueが1、Falseが0
C = np.sum(array1 == array2)
if C == int(N/2):
print('Yes')
else:
print('No')
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 664,223
| 664,224
|
u997935265
|
python
|
p02860
|
a = int(input())
b = input()
if len(b) % 2 == 0:
if b[0:int(a / 2)] == b[int(a / 2):a]:
print("Yes")
else:
pass
else:
print("No")
|
a = int(input())
b = input()
if len(b) % 2 == 0:
if b[0:int(a / 2)] == b[int(a / 2):a]:
print("Yes")
else:
print("No")
else:
print("No")
|
[
"call.arguments.add"
] | 664,238
| 664,239
|
u242576923
|
python
|
p02860
|
##B
n = int(input())
s = str(input())
n1 = int(n/2)
if s == s[0:n1]+s[n1:n] and n % 2 == 0:
print("Yes")
else:
print("No")
|
##B
n = int(input())
s = str(input())
n1 = int(n/2)
if s == s[0:n1]+s[0:n1] and n % 2 == 0:
print("Yes")
else:
print("No")
|
[
"identifier.replace.remove",
"literal.replace.add",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"identifier.change"
] | 664,246
| 664,247
|
u799978560
|
python
|
p02860
|
N = int(input())
S = input()
if(S[:int(N / 2)] == S[int(N / 2):]):
print("YES")
else:
print("NO")
|
N = int(input())
S = input()
if(S[:int(N / 2)] == S[int(N / 2):]):
print("Yes")
else:
print("No")
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 664,255
| 664,256
|
u471499397
|
python
|
p02860
|
n = int(input())
s = list(str(input()))
if n == 1:
print('No')
exit()
for i in range(int(n/2)):
print(i)
if s[i] != s[int(n/2+i)] or n%2:
print('No')
exit()
print('Yes')
|
n = int(input())
s = list(str(input()))
if n == 1:
print('No')
exit()
for i in range(int(n/2)):
if s[i] != s[int(n/2+i)] or n%2:
print('No')
exit()
print('Yes')
|
[
"call.remove"
] | 664,266
| 664,267
|
u142385693
|
python
|
p02860
|
n = int(input())
s = input()
if n % 2 == 1:
print("No")
else:
if s[:(n//2)] == x[(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")
|
[
"identifier.change",
"control_flow.branch.if.condition.change"
] | 664,270
| 664,271
|
u343150957
|
python
|
p02860
|
n = int(input())
string = int(input())
s1 = ""
s2 = ""
if(n % 2 == 0):
for i, st in enumerate(string):
if i < n/2:
s1 = s1 + st
else:
s2 = s2 + st
if s1 == s2:
print("Yes")
else:
print("No")
else:
print("No")
|
n = int(input())
string = str(input())
s1 = ""
s2 = ""
if(n % 2 == 0):
for i, st in enumerate(string):
if i < n/2:
s1 = s1 + st
else:
s2 = s2 + st
if s1 == s2:
print("Yes")
else:
print("No")
else:
print("No")
|
[
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 664,274
| 664,275
|
u290865759
|
python
|
p02860
|
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")
|
[
"call.add"
] | 664,285
| 664,286
|
u686461495
|
python
|
p02860
|
n=int(input())
s=list(input())
c=0
if n%2 != 0:
print('No')
exit()
else:
for i in range(n/2):
if s[i]!=s[i+n/2]:
c+=1
if c==0:
print('Yes')
else:
print('No')
|
n=int(input())
s=list(input())
c=0
if n%2 != 0:
print('No')
exit()
else:
for i in range(n//2):
if s[i]!=s[i+n//2]:
c+=1
if c==0:
print('Yes')
else:
print('No')
|
[
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 664,287
| 664,288
|
u100800700
|
python
|
p02860
|
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")
|
[
"call.remove"
] | 664,295
| 664,296
|
u628415934
|
python
|
p02860
|
n=int(input())
s=input()
if n%2!=2:
print('No')
exit()
x=int(n/2)
print('Yes') if s[:x]==s[x:] else print ('No')
|
n=int(input())
s=input()
if n%2!=0:
print('No')
exit()
x=int(n/2)
print('Yes') if s[:x]==s[x:] else print ('No')
|
[
"literal.number.integer.change",
"control_flow.branch.if.condition.change"
] | 664,297
| 664,298
|
u966408025
|
python
|
p02860
|
if __name__=='__main__':
N = int(input())
S = input()
ans = 'No'
if N % 2 == 0:
if S[0:N/2]==S[N/2:]: ans='Yes'
print(ans)
|
if __name__=='__main__':
N = int(input())
S = input()
ans = 'No'
if N % 2 == 0:
if S[0:int(N/2)]==S[int(N/2):]: ans='Yes'
print(ans)
|
[
"control_flow.branch.if.condition.change",
"call.add"
] | 664,309
| 664,310
|
u295656477
|
python
|
p02860
|
n=int(input())
s=str(input())
if n%2==1:
print("No")
else:
s1=s[0:int(n/2):1]
s2=s[int(n/2)+1:n:1]
if s1==s2:
print("Yes")
else:
print("No")
|
n=int(input())
s=str(input())
if n%2==1:
print("No")
else:
s1=s[0:int(n/2):1]
s2=s[int(n/2):n:1]
if s1==s2:
print("Yes")
else:
print("No")
|
[
"expression.operation.binary.remove"
] | 664,346
| 664,347
|
u117078923
|
python
|
p02860
|
s = input()
n = len(s)
if n%2 ==1 :
print("No")
else :
t = s[0:n//2]
if t == s[n//2:] :
print("Yes")
else :
print("No")
|
n = input()
s = input()
n = len(s)
if n%2 ==1 :
print("No")
else :
t = s[0:n//2]
if t == s[n//2:] :
print("Yes")
else :
print("No")
|
[
"assignment.add"
] | 664,363
| 664,364
|
u164875166
|
python
|
p02860
|
import sys
from math import factorial
from fractions import Fraction
import heapq, bisect
import math
import itertools
sys.setrecursionlimit(10 ** 5 + 10)
INF = 10**15 +5
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
n = INT()
s = input()
if n %2 == 0:
print('No')
else:
flag = True
for i in range(n):
if s[i] != s[n//2 + i]:
flag = False
if flag:
print('Yes')
else:
print('No')
|
import sys
from math import factorial
from fractions import Fraction
import heapq, bisect
import math
import itertools
sys.setrecursionlimit(10 ** 5 + 10)
INF = 10**15 +5
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
n = INT()
s = input()
if n%2 == 1:
print('No')
else:
flag = True
for i in range(n//2):
if s[i] != s[n//2 + i]:
flag = False
if flag:
print('Yes')
else:
print('No')
|
[
"literal.number.integer.change",
"control_flow.branch.if.condition.change"
] | 664,369
| 664,370
|
u540799318
|
python
|
p02860
|
from math import factorial
from fractions import Fraction
import heapq, bisect
import math
import itertools
sys.setrecursionlimit(10 ** 5 + 10)
INF = 10**15 +5
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
n = INT()
s = input()
if n %2 == 0:
print('No')
else:
flag = True
for i in range(n):
if s[i] != s[n//2 + i]:
flag = False
if flag:
print('Yes')
else:
print('No')
|
import sys
from math import factorial
from fractions import Fraction
import heapq, bisect
import math
import itertools
sys.setrecursionlimit(10 ** 5 + 10)
INF = 10**15 +5
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
n = INT()
s = input()
if n%2 == 1:
print('No')
else:
flag = True
for i in range(n//2):
if s[i] != s[n//2 + i]:
flag = False
if flag:
print('Yes')
else:
print('No')
|
[
"literal.number.integer.change",
"control_flow.branch.if.condition.change"
] | 664,371
| 664,370
|
u540799318
|
python
|
p02860
|
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')
|
[
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 664,388
| 664,389
|
u691855776
|
python
|
p02860
|
def main():
n = int(input())
s = input()
if n % 2 == 1:
print("No")
return
if s[:len(s)/2] == s[len(s)/2:]:
print("Yes")
else:
print("No")
if __name__ == '__main__':
main()
|
def main():
n = int(input())
s = input()
if n % 2 == 1:
print("No")
return
if s[:len(s)//2] == s[len(s)//2:]:
print("Yes")
else:
print("No")
if __name__ == '__main__':
main()
|
[
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 664,448
| 664,449
|
u368970787
|
python
|
p02860
|
import sys
n=int(input())
s=input()
if n%2!=0:
print("No")
sys.exit()
for i in range(n//2):
if s[i]!=s[n//2+1]:
print("No")
sys.exit()
print("Yes")
|
import sys
n=int(input())
s=input()
if n%2!=0:
print("No")
sys.exit()
for i in range(n//2):
if s[i]!=s[n//2+i]:
print("No")
sys.exit()
print("Yes")
|
[
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 664,457
| 664,458
|
u367866606
|
python
|
p02860
|
n = int(input())
s = list(input())
i = 0
Answer = "No"
if n%2 == 0:
while i < n/2 :
if s[i] == s[int((n/2))+i]:
Answer = "Yes"
i += 1
else:
break
print(Answer)
|
n = int(input())
s = list(input())
i = 0
Answer = "No"
if n%2 == 0:
while i < n/2 :
if s[i] == s[int((n/2))+i]:
Answer = "Yes"
i += 1
else:
Answer = "No"
break
print(Answer)
|
[
"assignment.add"
] | 664,463
| 664,464
|
u225845681
|
python
|
p02860
|
def judge(N,str):
a = list(str)
b = []
c = []
if N%2 == 0:
for k in range(int(N/2)):
b.append(a[k])
c.append(a[k+int(N/2)])
if a == b + c:
print("yes")
else:
print("No")
else:
print("No")
N = int(input())
S = input()
judge(N,S)
|
def judge(N,str):
a = list(str)
b = []
c = []
if N%2 == 0:
for k in range(int(N/2)):
b.append(a[k])
c.append(a[k+int(N/2)])
if b == c:
print("Yes")
else:
print("No")
else:
print("No")
N = int(input())
S = input()
judge(N,S)
|
[
"control_flow.branch.if.condition.change",
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 664,471
| 664,472
|
u590647174
|
python
|
p02860
|
def judge(N,str):
a = list(str)
b = []
c = []
if N%2 == 0:
for k in range(int(N/2)):
b.append(a[k])
c.append(a[k+int(N/2)])
if b == c:
print("yes")
else:
print("No")
else:
print("No")
N = int(input())
S = input()
judge(N,S)
|
def judge(N,str):
a = list(str)
b = []
c = []
if N%2 == 0:
for k in range(int(N/2)):
b.append(a[k])
c.append(a[k+int(N/2)])
if b == c:
print("Yes")
else:
print("No")
else:
print("No")
N = int(input())
S = input()
judge(N,S)
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 664,473
| 664,472
|
u590647174
|
python
|
p02860
|
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])
|
[] | 664,480
| 664,481
|
u670180528
|
python
|
p02860
|
n = int(input())
s = input()
flag = 0
if n%2 == 0:
m = n/2
for i in range(m):
if s[i] != s[m+i]:
flag = 1
if flag == 1:
print("No")
else:
print("Yes")
else:
print("No")
|
n = int(input())
s = input()
flag = 0
if n%2 == 0:
m = int(n/2)
for i in range(m):
if s[i] != s[m+i]:
flag = 1
if flag == 1:
print("No")
else:
print("Yes")
else:
print("No")
|
[
"call.add",
"call.arguments.change"
] | 664,486
| 664,487
|
u884077550
|
python
|
p02860
|
import sys
input = sys.stdin.readline
N = int(input())
S = input().split()
if N%2==0:
s1 = S[:(N//2)]
if S == s1 + s1:
print('Yes')
else:
print('No')
else:
print('No')
|
import sys
input = sys.stdin.readline
N = int(input())
S = input().rstrip()
if N%2==0:
s1 = S[:(N//2)]
if S == s1 + s1:
print('Yes')
else:
print('No')
else:
print('No')
|
[
"assignment.value.change",
"identifier.change"
] | 664,494
| 664,495
|
u381572531
|
python
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.