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 9
values |
|---|---|---|---|---|---|---|---|
p02859 | def main(k):
return print(k^2)
if __name__=="__main__":
i=int(input())
main(i) | def main(i):
return print(i**2)
if __name__=="__main__":
i=int(input())
main(i) | [
"identifier.change"
] | 661,553 | 661,554 | u243815850 | python |
p02859 | def main(i):
return print(i^2)
if __name__ == "__main__":
i=int(input()) | def main(i):
return print(i**2)
if __name__=="__main__":
i=int(input())
main(i) | [
"call.arguments.change",
"function.return_value.change",
"expression.operation.binary.change",
"io.output.change",
"call.add"
] | 661,555 | 661,554 | u243815850 | python |
p02859 | # -*- coding:utf-8 -*-
def solve():
r = input()
print(r*r)
if __name__ == "__main__":
solve()
| # -*- coding:utf-8 -*-
def solve():
r = int(input())
print(r*r)
if __name__ == "__main__":
solve()
| [
"call.add",
"call.arguments.change"
] | 661,566 | 661,567 | u687044304 | python |
p02859 | input = input()
print(input * input) |
x = int(input())
print(x * x) | [
"assignment.variable.change",
"identifier.change",
"call.add",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 661,579 | 661,580 | u333537444 | python |
p02859 | import numpy as np
r = int(input())
c = np.pi*(1**2)
c2 = np.pi*(r**2)
print(int(c2/c)) | import numpy as np
r = int(input())
c = int(np.pi)*(1**2)
c2 = int(np.pi)*(r**2)
print(int(c2/c)) | [
"call.add",
"call.arguments.change"
] | 661,591 | 661,592 | u002824787 | python |
p02859 | import math
r = int(input())
p = 1*1*math.pi
rp = r*r*math.pi
ret = rp / p
print(math.floor(ret))
| import math
r = int(input())
p = 1*1*math.pi
rp = r*r*math.pi
ret = rp / p
print(math.ceil(ret))
| [
"misc.opposites",
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 661,638 | 661,639 | u932370518 | python |
p02859 | import math
val = int(input())
print("%d" % val * val) | val = int(input())
print(val*val) | [
"expression.operation.binary.remove"
] | 661,657 | 661,658 | u664031692 | python |
p02859 | import math
r = int(input())
print(math.floor(math.pow(r,2) * math.pi / (1 * math.pi))) | import math
r = int(input())
print(math.ceil((math.pow(r,2) * math.pi) / (1 * math.pi))) | [
"misc.opposites",
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 661,676 | 661,677 | u311907103 | python |
p02859 | m=int(input())
print(m ** m) | m=int(input())
print(m * m) | [
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 661,685 | 661,686 | u088277062 | python |
p02859 | m=input()
print(m*m) | m=int(input())
print(m * m) | [
"call.add",
"call.arguments.change"
] | 661,688 | 661,686 | u088277062 | python |
p02859 | r = int(input())
print(int(r^2)) | r = int(input())
print(int(r**2)) | [
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 661,704 | 661,705 | u721425712 | python |
p02859 | def circle(r):
return r**2
str = input()
print(circle(str)) | def circle(r):
return r**2
str = int(input())
print(circle(str)) | [
"call.add",
"call.arguments.change"
] | 661,713 | 661,714 | u590647174 | python |
p02859 | def circle(r):
return r**2
str = input()
circle(str) | def circle(r):
return r**2
str = int(input())
print(circle(str)) | [
"call.add",
"call.arguments.change"
] | 661,715 | 661,714 | u590647174 | python |
p02859 | # -*- coding: utf-8 -*-
import sys
import math
debug = False
def log(text):
if debug:
print(text)
def parse_input(lines_as_string = None):
global debug
lines = []
if lines_as_string is None:
debug = False
# for line in sys.stdin:
# lines.append(line)
lines.append(input())
else:
debug = True
lines = [e for e in lines_as_string.split("\n")][1:-1]
r = int(lines[0])
return r
def solve(r):
return r*r
def main():
# 出力
result = solve(*parse_input())
if isinstance(result, list):
for r in result:
print("%s" % r, sep='')
else:
print("%s" % result, sep='')
if __name__ == '__main__':
main()
| # -*- coding: utf-8 -*-
import sys
import math
debug = False
def log(text):
if debug:
print(text)
def parse_input(lines_as_string = None):
global debug
lines = []
if lines_as_string is None:
debug = False
# for line in sys.stdin:
# lines.append(line)
lines.append(input())
else:
debug = True
lines = [e for e in lines_as_string.split("\n")][1:-1]
r = int(lines[0])
return (r, )
def solve(r):
return r*r
def main():
# 出力
result = solve(*parse_input())
if isinstance(result, list):
for r in result:
print("%s" % r, sep='')
else:
print("%s" % result, sep='')
if __name__ == '__main__':
main()
| [
"function.return_value.change"
] | 661,724 | 661,725 | u000557170 | python |
p02859 | r = int(input)
print("{}".format(r**2)) | r = int(input())
print("{}".format(int(r**2))) | [
"call.add",
"call.arguments.change"
] | 661,732 | 661,733 | u290865759 | python |
p02859 | r = int(input())
cir = 4 * r ** 2
print(cir) | r = int(input())
cir = r * r
print(cir) | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 661,734 | 661,735 | u062314674 | python |
p02859 | def A():
return int(input())**2
A() | def A():
print(int(input())**2)
A() | [
"function.return_value.change",
"call.arguments.change"
] | 661,754 | 661,755 | u151285327 | python |
p02859 | r = int(input())
x = r * 2
print(x)
| r = int(input())
x = r ** 2
print(x) | [
"assignment.value.change",
"expression.operation.binary.change"
] | 661,764 | 661,765 | u374517193 | python |
p02859 | i=int(intput())
print(i*i)
| i=int(input())
print(i*i)
| [
"assignment.value.change",
"identifier.change",
"call.function.change",
"call.arguments.change"
] | 661,786 | 661,787 | u414275860 | python |
p02859 | a=int(input())
a=a+2
print(a) | a=int(input())
a=a**2
print(a) | [
"assignment.value.change",
"expression.operation.binary.change"
] | 661,790 | 661,791 | u688055251 | python |
p02859 | a=int(input())
print(a)
| a=int(input())
print(a*a)
| [
"expression.operation.binary.add"
] | 661,800 | 661,801 | u574053975 | python |
p02851 | #01:15
n,k = map(int,input().split())
a = list(map(int,input().split()))
for i in range(n):
a[i] -= 1
a[i] %= k
b = [0]
for i in range(n):
b.append((b[-1]+a[i]) % k)
ans = 0
now = {0:1}
for i in range(1,n+1):
tmp = b[i]
if tmp in now:
ans += now[tmp]
now[tmp] += 1
else:
now[tmp] = 1
if i - k + 1 >= 0:
now[b[i-k+1]] -= 1
print(ans) | #01:15
n,k = map(int,input().split())
a = list(map(int,input().split()))
for i in range(n):
a[i] -= 1
a[i] %= k
b = [0]
for i in range(n):
b.append((b[-1]+a[i]) % k)
ans = 0
now = {}
for i in range(n+1):
tmp = b[i]
if tmp in now:
ans += now[tmp]
now[tmp] += 1
else:
now[tmp] = 1
if i - k + 1 >= 0:
now[b[i-k+1]] -= 1
print(ans) | [
"call.arguments.change"
] | 661,900 | 661,901 | u111365362 | python |
p02851 | #解説解答
n,k = map(int,input().split())
a = list(map(int,input().split()))
for i in range(n):
a[i] -= 1
a[i] %= k
#print(a)
b = [0]
for i in range(n):
b.append((b[-1]+a[i])%k)
#print(b)
ans = 0
now = {0:1}
for i in range(1,n+1):
if b[i] in now:
ans += now[b[i]]
now[b[i]] += 1
else:
now[b[i]] = 1
if i - k + 1 >= 0:
now[b[i-k+1]] -= 1
#print(now,i,ans)
print(ans) | #解説解答
n,k = map(int,input().split())
a = list(map(int,input().split()))
for i in range(n):
a[i] -= 1
a[i] %= k
#print(a)
b = [0]
for i in range(n):
b.append((b[-1]+a[i])%k)
#print(b)
ans = 0
now = {}
for i in range(n+1):
if b[i] in now:
ans += now[b[i]]
now[b[i]] += 1
else:
now[b[i]] = 1
if i - k + 1 >= 0:
now[b[i-k+1]] -= 1
#print(now,i,ans)
print(ans) | [
"call.arguments.change"
] | 661,902 | 661,903 | u111365362 | python |
p02851 | import sys
import math
import heapq
import bisect
sys.setrecursionlimit(10**7)
INTMAX = 9223372036854775807
INTMIN = -9223372036854775808
DVSR = 1000000007
def POW(x, y): return pow(x, y, DVSR)
def INV(x, m=DVSR): return pow(x, m - 2, m)
def DIV(x, y, m=DVSR): return (x * INV(y, m)) % m
def LI(): return [int(x) for x in input().split()]
def LF(): return [float(x) for x in input().split()]
def LS(): return input().split()
def II(): return int(input())
def FLIST(n):
res = [1]
for i in range(1, n+1): res.append(res[i-1]*i%DVSR)
return res
def gcd(x, y):
if x < y: x, y = y, x
div = x % y
while div != 0:
x, y = y, div
div = x % y
return y
# j - i == S[j] - S[i] # MOD K
# S[i] - i == S[j] - j
N,K=LI()
As=LI()
Cum=[0]*(N+1)
for i in range(N):
Cum[i+1] = Cum[i] + As[i]
REM2IDX = {}
for i in range(1,N+1):
rem = (Cum[i] - i) % K
if not rem in REM2IDX: REM2IDX[rem] = []
REM2IDX[rem].append(i)
res = 0
for i in range(0,N+1):
rem = (Cum[i] - i) % K
cnt = len(REM2IDX[rem])
l = bisect.bisect_right(REM2IDX[rem], i)
r = bisect.bisect_right(REM2IDX[rem], i+K-1)
res += (r-l)
print(res)
| import sys
import math
import heapq
import bisect
sys.setrecursionlimit(10**7)
INTMAX = 9223372036854775807
INTMIN = -9223372036854775808
DVSR = 1000000007
def POW(x, y): return pow(x, y, DVSR)
def INV(x, m=DVSR): return pow(x, m - 2, m)
def DIV(x, y, m=DVSR): return (x * INV(y, m)) % m
def LI(): return [int(x) for x in input().split()]
def LF(): return [float(x) for x in input().split()]
def LS(): return input().split()
def II(): return int(input())
def FLIST(n):
res = [1]
for i in range(1, n+1): res.append(res[i-1]*i%DVSR)
return res
def gcd(x, y):
if x < y: x, y = y, x
div = x % y
while div != 0:
x, y = y, div
div = x % y
return y
# j - i == S[j] - S[i] # MOD K
# S[i] - i == S[j] - j
N,K=LI()
As=LI()
Cum=[0]*(N+1)
for i in range(N):
Cum[i+1] = Cum[i] + As[i]
REM2IDX = {}
for i in range(0,N+1):
rem = (Cum[i] - i) % K
if not rem in REM2IDX: REM2IDX[rem] = []
REM2IDX[rem].append(i)
res = 0
for i in range(0,N+1):
rem = (Cum[i] - i) % K
cnt = len(REM2IDX[rem])
l = bisect.bisect_right(REM2IDX[rem], i)
r = bisect.bisect_right(REM2IDX[rem], i+K-1)
res += (r-l)
print(res)
| [
"literal.number.integer.change",
"call.arguments.change",
"control_flow.loop.range.bounds.lower.change"
] | 661,924 | 661,925 | u895515293 | python |
p02851 | import sys
import math
import heapq
import bisect
sys.setrecursionlimit(10**7)
INTMAX = 9223372036854775807
INTMIN = -9223372036854775808
DVSR = 1000000007
def POW(x, y): return pow(x, y, DVSR)
def INV(x, m=DVSR): return pow(x, m - 2, m)
def DIV(x, y, m=DVSR): return (x * INV(y, m)) % m
def LI(): return [int(x) for x in input().split()]
def LF(): return [float(x) for x in input().split()]
def LS(): return input().split()
def II(): return int(input())
def FLIST(n):
res = [1]
for i in range(1, n+1): res.append(res[i-1]*i%DVSR)
return res
def gcd(x, y):
if x < y: x, y = y, x
div = x % y
while div != 0:
x, y = y, div
div = x % y
return y
# j - i == S[j] - S[i] # MOD K
# S[i] - i == S[j] - j
N,K=LI()
As=LI()
Cum=[0]*(N+1)
for i in range(N):
Cum[i+1] = Cum[i] + As[i]
REM2IDX = {}
for i in range(1,N+1):
rem = (Cum[i] - i) % K
if not rem in REM2IDX: REM2IDX[rem] = []
REM2IDX[rem].append(i)
res = 0
for i in range(0,N+1):
rem = (Cum[i] - i) % K
cnt = len(REM2IDX[rem])
l = bisect.bisect_right(REM2IDX[rem], i)
r = bisect.bisect_right(REM2IDX[rem], i+K-1)
res += (r-l)
print(res) | import sys
import math
import heapq
import bisect
sys.setrecursionlimit(10**7)
INTMAX = 9223372036854775807
INTMIN = -9223372036854775808
DVSR = 1000000007
def POW(x, y): return pow(x, y, DVSR)
def INV(x, m=DVSR): return pow(x, m - 2, m)
def DIV(x, y, m=DVSR): return (x * INV(y, m)) % m
def LI(): return [int(x) for x in input().split()]
def LF(): return [float(x) for x in input().split()]
def LS(): return input().split()
def II(): return int(input())
def FLIST(n):
res = [1]
for i in range(1, n+1): res.append(res[i-1]*i%DVSR)
return res
def gcd(x, y):
if x < y: x, y = y, x
div = x % y
while div != 0:
x, y = y, div
div = x % y
return y
# j - i == S[j] - S[i] # MOD K
# S[i] - i == S[j] - j
N,K=LI()
As=LI()
Cum=[0]*(N+1)
for i in range(N):
Cum[i+1] = Cum[i] + As[i]
REM2IDX = {}
for i in range(0,N+1):
rem = (Cum[i] - i) % K
if not rem in REM2IDX: REM2IDX[rem] = []
REM2IDX[rem].append(i)
res = 0
for i in range(0,N+1):
rem = (Cum[i] - i) % K
cnt = len(REM2IDX[rem])
l = bisect.bisect_right(REM2IDX[rem], i)
r = bisect.bisect_right(REM2IDX[rem], i+K-1)
res += (r-l)
print(res)
| [
"literal.number.integer.change",
"call.arguments.change",
"control_flow.loop.range.bounds.lower.change"
] | 661,926 | 661,925 | u895515293 | python |
p02851 | from collections import defaultdict as d
from itertools import accumulate as ac
n,k=map(int,input().split())
a=[0]+list(ac(list(map(int,input().split()))))
b=d(int)
c=0
for i in range(n+1):
p=(a[i]-i)%k
c+=b[p]
b[p]+=1
if i-k>=0:
b[(a[i-k]-i+k)%k]-=1
print(c) | from collections import defaultdict as d
from itertools import accumulate as ac
n,k=map(int,input().split())
a=[0]+list(ac(list(map(int,input().split()))))
b=d(int)
c=0
for i in range(n+1):
p=(a[i]-i)%k
c+=b[p]
b[p]+=1
if i-k+1>=0:
b[(a[i-k+1]-i+k-1)%k]-=1
print(c) | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 661,955 | 661,956 | u619819312 | python |
p02859 | N = int(input())
print(N*2) | N = int(input())
print(N**2) | [
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 661,979 | 661,980 | u580073714 | python |
p02859 | r = int(input())
print(r ** r)
| r = int(input())
print(r ** 2)
| [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 661,983 | 661,984 | u652583512 | python |
p02860 | N = int(input())
S = input()
n = N // 2
T = S[:n - 1]
if S == T + T:
print("Yes")
else:
print("No")
| N = int(input())
S = input()
n = N // 2
T = S[:n]
if S == T + T:
print("Yes")
else:
print("No") | [
"expression.operation.binary.remove"
] | 661,995 | 661,996 | u442869553 | python |
p02860 | n = int(input())
s = input()
if n % 2 == 0 and s[:n//2] == s[s//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') | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 662,000 | 662,001 | u162612857 | python |
p02860 | n = int(input())
s = input()
flag = 1
if n % 2:
print('No')
else:
for i in range(n):
if s[i] != s[n/2 + i]:
flag = 0
if flag:
print('Yes')
else:
print('No') | n = int(input())
s = input()
flag = 1
if n % 2:
print('No')
else:
for i in range(n//2):
if s[i] != s[n//2 + i]:
flag = 0
if flag:
print('Yes')
else:
print('No') | [
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 662,011 | 662,012 | u347600233 | python |
p02860 | n = int(input())
s = input()
if n%2==1:
print("NO")
else:
s1 = ""
s2 = ""
for i in range(0, n//2):
s1+=s[i]
s2+=s[n//2 + i]
if(s1 == s2):
print("YES")
else:
print("NO")
| n = int(input())
s = input()
if n%2==1:
print("No")
else:
s1 = ""
s2 = ""
for i in range(0, n//2):
s1+=s[i]
s2+=s[n//2 + i]
if(s1 == s2):
print("Yes")
else:
print("No")
| [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 662,017 | 662,018 | u029912106 | python |
p02860 | import sys
N = int(input())
s = input()
if N%2 ==1:
print('No')
sys.exit()
if s[:N//2] == s[N//2+1:]:
print('Yes')
else:
print('No') | import sys
N = int(input())
s = input()
if N%2 ==1:
print('No')
sys.exit()
if s[:N//2] == s[N//2:]:
print('Yes')
else:
print('No') | [
"expression.operation.binary.remove"
] | 662,038 | 662,039 | u026155812 | python |
p02860 | import sys
N = int(input())
s = input()
if N%2 ==1:
print('No')
sys.exit()
if s[:N//2] == s[N//2+1:]:
print('Yes')
else:
print('No')
| import sys
N = int(input())
s = input()
if N%2 ==1:
print('No')
sys.exit()
if s[:N//2] == s[N//2:]:
print('Yes')
else:
print('No') | [
"expression.operation.binary.remove"
] | 662,040 | 662,039 | u026155812 | python |
p02860 | N = int(input())
S = input()
if S[:int(N/2):] == S[int(N/2)+1::]:
print("Yes")
else:
print("No") | N = int(input())
S = input()
if S[:int(N/2):] == S[int(N/2)::]:
print("Yes")
else:
print("No") | [
"expression.operation.binary.remove"
] | 662,042 | 662,043 | u273242084 | python |
p02860 | n = int(input())
t = input()
if n % 2 != 0:
print('No')
else:
print('Yes' if t[:n//2] + t[n//2:] == t else 'No')
| n = int(input())
t = input()
if n % 2 != 0:
print('No')
else:
print('Yes' if t[:n//2] == t[n//2:] else 'No')
| [
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 662,060 | 662,061 | u938486382 | python |
p02860 | n = int(input())
t = input()
if n % 2 != 0:
print('No')
else:
print('Yes' if t[:n//2] + t[n//2:] else 'No') | n = int(input())
t = input()
if n % 2 != 0:
print('No')
else:
print('Yes' if t[:n//2] == t[n//2:] else 'No')
| [
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 662,062 | 662,061 | u938486382 | python |
p02860 | N=int(input())
S=input()
if N%2==0 and all(a==b for a,b in zip(S,S[N:])):
print("Yes")
else:
print("No")
| N = int(input())
S=input()
if N%2==0 and all(a==b for a,b in zip(S,S[N//2:])):
print("Yes")
else:
print("No")
| [
"control_flow.branch.if.condition.change"
] | 662,065 | 662,066 | u375616706 | python |
p02860 | N=int(input())
S=input()
if N%2==0 and all(a==b for a,v in zip(S,S[N:])):
print("Yes")
else:
print("No")
| N = int(input())
S=input()
if N%2==0 and all(a==b for a,b in zip(S,S[N//2:])):
print("Yes")
else:
print("No")
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 662,067 | 662,066 | u375616706 | python |
p02860 | n = int(input())
s = input()
if n % 2 != 0:
print("Yes")
else:
T = s[0:n//2+1]
if T + T == s:
print("Yes")
else:
print("No") | n = int(input())
s = input()
if n % 2 != 0:
print("No")
else:
T = s[0:n//2]
if T + T == s:
print("Yes")
else:
print("No") | [
"literal.string.change",
"call.arguments.change",
"io.output.change",
"expression.operation.binary.remove"
] | 662,083 | 662,082 | u757274384 | python |
p02860 | n=int(input())
s=list(input())
Len=len(s)/2
if len(s)%2==1:
print('No')
else:
for i in range(Len):
if s[i]!=s[i+Len]:
print('No')
break
print('Yes') | n=int(input())
s=list(input())
Len=int(len(s)/2)
if len(s)%2==1:
print('No')
else:
for i in range(Len):
if s[i]!=s[i+Len]:
print('No')
exit()
print('Yes')
| [
"call.add",
"call.arguments.change",
"control_flow.break.remove",
"control_flow.exit.add"
] | 662,093 | 662,094 | u090406054 | python |
p02860 | 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')
| [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 662,095 | 662,096 | u685244071 | python |
p02860 | 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] == S[N // 2:]:
print('Yes')
else:
print('No')
| [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 662,095 | 662,098 | u685244071 | python |
p02860 | n=int(input())
a=input()
if n%2==0 and a[:n//2]==a[n//2:]:
print("Yes")
else:
print("NO") | n=int(input())
a=input()
if n%2==0 and a[:n//2]==a[n//2:]:
print("Yes")
else:
print("No") | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 662,107 | 662,108 | u156383602 | python |
p02860 | N=int(input())
S=input()
if S[:N//2-1]==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.operation.binary.remove"
] | 662,111 | 662,112 | u963944915 | python |
p02860 | N=int(input())
S=input()
if S[0:N//2-1]==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") | [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 662,113 | 662,112 | u963944915 | python |
p02860 | a = int(input())
b = input()
if a%2 == 0:
print("Yes" if b[:(a/2)] == b[(a/2):] else "No")
else:
print("No") | a = int(input())
b = input()
if a%2 == 0:
print("Yes" if b[:int(a/2)] == b[int(a/2):] else "No")
else:
print("No") | [
"call.add",
"type_conversion.to_integer.change",
"type_conversion.to_number.change",
"call.arguments.change"
] | 662,122 | 662,123 | u842028864 | python |
p02860 | a = int(input())
b = input()
if a%2 == 0:
print("Yes" if a[:(a/2)] == a[(a/2):] else "No")
else:
print("No") | a = int(input())
b = input()
if a%2 == 0:
print("Yes" if b[:int(a/2)] == b[int(a/2):] else "No")
else:
print("No") | [
"identifier.change",
"call.arguments.change",
"io.output.change",
"call.add",
"type_conversion.to_integer.change",
"type_conversion.to_number.change"
] | 662,124 | 662,123 | u842028864 | python |
p02860 | a = int(input())
b = input()
if a%2 == 0:
print("Yes" if a[:(a/2-1)] == a[(a/2):] else "No")
else:
print("No") | a = int(input())
b = input()
if a%2 == 0:
print("Yes" if b[:int(a/2)] == b[int(a/2):] else "No")
else:
print("No") | [
"identifier.change",
"call.arguments.change",
"io.output.change",
"call.add",
"type_conversion.to_integer.change",
"type_conversion.to_number.change",
"expression.operation.binary.remove"
] | 662,125 | 662,123 | u842028864 | python |
p02860 | n = int(input())
s = input()
mid = int(n/2)
if n == 1:
print("No")
elif s[:mid] == s[:mid]:
print('Yes')
else:
print("No") | n = int(input())
s = input()
mid = int(n/2)
if n == 1:
print("No")
elif s[:mid] == s[mid:]:
print('Yes')
else:
print("No") | [
"control_flow.branch.if.condition.change"
] | 662,126 | 662,127 | u501451051 | python |
p02860 | n = int(input())
s = input()
if n % 2:
pirnt("No")
exit()
half = s[0:n // 2]
print("Yes" if s == half + half else "No")
| n = int(input())
s = input()
if n % 2:
print("No")
exit()
half = s[0:n // 2]
print("Yes" if s == half + half else "No") | [
"identifier.change",
"call.function.change"
] | 662,136 | 662,137 | u973321061 | python |
p02860 | n = int(input())
s = input()
if n % 2:
pirnt("No")
exit()
half = s[0:n // 2]
print("Yes" if s == half + half else "No") | n = int(input())
s = input()
if n % 2:
print("No")
exit()
half = s[0:n // 2]
print("Yes" if s == half + half else "No") | [
"identifier.change",
"call.function.change"
] | 662,138 | 662,137 | u973321061 | python |
p02860 | n=int(input())
s=input()
if n % 2:
pirnt("No")
exit()
half=s[0:n//2]
print("Yes" if s==half+half else "No") | n = int(input())
s = input()
if n % 2:
print("No")
exit()
half = s[0:n // 2]
print("Yes" if s == half + half else "No") | [
"identifier.change",
"call.function.change"
] | 662,139 | 662,137 | u973321061 | python |
p02860 | import sys
def main():
N = int(input())
S = input()
if N % 2 == 1:
print("No")
sys.exit()
n = N / 2
yesno = "Yes" if S[:n] == S[n:] else "No"
print(yesno)
if __name__ == "__main__":
main()
| def main():
N = int(input())
S = input()
if N % 2 == 1:
print("No")
quit()
n = N // 2
yesno = "Yes" if S[:n] == S[n:] else "No"
print(yesno)
if __name__ == "__main__":
main()
| [
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 662,148 | 662,149 | u322763702 | python |
p02860 | def main():
N = int(input())
S = input()
if N % 2 == 1:
print("No")
quit()
n = N / 2
yesno = "Yes" if S[:n] == S[n:] else "No"
print(yesno)
if __name__ == "__main__":
main()
| def main():
N = int(input())
S = input()
if N % 2 == 1:
print("No")
quit()
n = N // 2
yesno = "Yes" if S[:n] == S[n:] else "No"
print(yesno)
if __name__ == "__main__":
main()
| [
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 662,150 | 662,149 | u322763702 | python |
p02860 |
N=int(input())
S=input()
if S[:N//2]==S[N//2+1:] and N%2==0:
print("Yes")
else:
print("No")
|
N=int(input())
S=input()
if S[:N//2]==S[N//2:] and N%2==0:
print("Yes")
else:
print("No")
| [
"expression.operation.binary.remove"
] | 662,153 | 662,154 | u235376569 | python |
p02860 | # input
N = int(input())
S = input()
# check
if N < 2 or N % 2 != 0:
print("No")
if N == 2:
right = S[0]
left = S[1]
else:
c = N // 2
right = S[0:c]
left = S[c:]
if right == left:
print("Yes")
else:
print("No") | # input
N = int(input())
S = input()
# check
if N < 2 or N % 2 != 0:
print("No")
else:
if N == 2:
right = S[0]
left = S[1]
else:
c = N // 2
right = S[0:c]
left = S[c:]
if right == left:
print("Yes")
else:
print("No") | [] | 662,161 | 662,162 | u284363684 | python |
p02860 | # input
N = int(input())
S = input()
# check
if N < 2 or N % 2 != 0:
print("No")
if N == 2:
right = S[0]
left = S[1]
else:
c = N // 2
right = S[0:c - 1]
left = S[c:]
if right == left:
print("Yes")
else:
print("No") | # input
N = int(input())
S = input()
# check
if N < 2 or N % 2 != 0:
print("No")
else:
if N == 2:
right = S[0]
left = S[1]
else:
c = N // 2
right = S[0:c]
left = S[c:]
if right == left:
print("Yes")
else:
print("No") | [
"expression.operation.binary.remove"
] | 662,163 | 662,162 | u284363684 | python |
p02860 | n=int(input())
s=input()
if n%2!=0:
print("No")
else:
if s[:n//2+1]==s[n//2:]:
print("Yes")
else:
print("No") | n=int(input())
s=input()
if n%2!=0:
print("No")
else:
if s[:n//2]==s[n//2:]:
print("Yes")
else:
print("No") | [
"expression.operation.binary.remove"
] | 662,168 | 662,169 | u886902015 | python |
p02860 | n = int(input())
s = input()
if n % 2 == 1:
print("No")
if s[0:n//2] == 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] == s[n//2:]:
print("Yes")
else:
print("No")
| [] | 662,176 | 662,177 | u086702156 | python |
p02860 | n = int(input())
s = input()
if n % 2 == 1:
print("No")
if s[0:s/2] == s[s/2:]:
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:]:
print("Yes")
else:
print("No")
| [] | 662,178 | 662,177 | u086702156 | python |
p02860 | n = int(input())
s = input()
if n % 2 == 1:
print("No")
if s[0:n/2] == 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] == s[n//2:]:
print("Yes")
else:
print("No")
| [
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 662,179 | 662,177 | u086702156 | python |
p02860 | n = int(input())
s = input()
if n % 2 == 1:
print("No")
elif s[:n/2] == s[n/2:] :
print("Yes")
else:
print("No") | n = int(input())
s = input()
if n % 2 == 1:
print("No")
elif 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"
] | 662,188 | 662,189 | u904331908 | python |
p02860 | N = int(input())
S = input()
if N % 2 > 0 or S != S[:int(N/2)] + S[:int(N/2)]:
exit("No")
exit("Yes") | N = int(input())
S = input()
if N % 2 > 0 or S != S[:int(N/2)] + S[:int(N/2)]:
print("No")
else:
print("Yes")
| [
"identifier.change",
"call.function.change",
"io.output.change",
"call.add"
] | 662,190 | 662,191 | u044262241 | python |
p02860 | #a,b,c = map(int,input().split())
a = int(input())
b = input()
c = b[:a//2]
d = b[a//2:a]
print("No" if c == d else "Yes")
| #a,b,c = map(int,input().split())
a = int(input())
b = input()
c = b[:a//2]
d = b[a//2:a]
print("Yes" if c == d else "No") | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 662,193 | 662,194 | u344959959 | python |
p02860 | #a,b,c = map(int,input().split())
a = int(input())
b = input()
c = s[:a//2]
d = s[a//2:a]
print("No" if c == d else "Yes")
| #a,b,c = map(int,input().split())
a = int(input())
b = input()
c = b[:a//2]
d = b[a//2:a]
print("Yes" if c == d else "No") | [
"assignment.value.change",
"identifier.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 662,195 | 662,194 | u344959959 | python |
p02860 | 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[:n//2]==a[n//2:]:
print("Yes")
else:
print("No") | [
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 662,199 | 662,200 | u620846115 | python |
p02860 | n = int(input())
s = input()
if n % 2 == 1:
print('No')
exit(0)
n = n // 2
a = s[:n]
if a.count(s) == 2:
print('Yes')
else:
print('No') | n = int(input())
s = input()
if n % 2 == 1:
print('No')
exit(0)
n = n // 2
a = s[:n]
if s.count(a) == 2:
print('Yes')
else:
print('No') | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 662,203 | 662,204 | u357751375 | python |
p02860 | N = int(input())
S = list(input())
if N % 2 != 0:
print('No')
for i in range(N//2):
if S[i] == S[i + (N//2)]:
continue
else:
print('No')
exit()
print('Yes') | N = int(input())
S = list(input())
if N % 2 != 0:
print('No')
exit()
for i in range(N//2):
if S[i] == S[i + (N//2)]:
continue
else:
print('No')
exit()
print('Yes') | [
"call.add"
] | 662,207 | 662,208 | u498531348 | python |
p02860 | n=int(input())
s=input()
if(n%2==1):
print('No')
exit()
else:
if s[0:n//2]==s[(n//2)+1:n]:
print('Yes')
else:
print("No")
| n=int(input())
s=input()
if(n%2==1):
print('No')
exit()
else:
if s[0:n//2]==s[(n//2):n]:
print('Yes')
else:
print("No")
| [
"expression.operation.binary.remove"
] | 662,213 | 662,214 | u289105044 | python |
p02860 | n=int(input())
s=input()
if(n%2==1):
print('No')
exit()
else:
if s[0:n//2]==s[(n//2)+1:n]:
print('Yes')
else:
print("No")
| n=int(input())
s=input()
if(n%2==1):
print('No')
exit()
else:
if s[0:n//2]==s[(n//2):n]:
print('Yes')
else:
print("No")
| [
"expression.operation.binary.remove"
] | 662,215 | 662,214 | u289105044 | python |
p02860 | n=int(input())
s=input()
if(n%2==1):
print('No')
else:
if s[0:n//2]==s[(n//2)+1:n]:
print('Yes')
else:
print("No")
| n=int(input())
s=input()
if(n%2==1):
print('No')
exit()
else:
if s[0:n//2]==s[(n//2):n]:
print('Yes')
else:
print("No")
| [
"call.add",
"expression.operation.binary.remove"
] | 662,216 | 662,214 | u289105044 | python |
p02860 | n = int(input())
s = input()
if n % 2 == 1:
print('No')
exit()
else:
if s[:n // 2] == s[n // 2 + 1:]:
print('Yes')
else:
print('No') | n = int(input())
s = input()
if n % 2 == 1:
print('No')
exit()
else:
if s[:n//2] == s[n//2:]:
print('Yes')
else:
print('No') | [
"expression.operation.binary.remove"
] | 662,222 | 662,223 | u363421241 | python |
p02860 | n = int(input())
s = input()
if n % 2 == 1:
print('No')
else:
if s[:n//2] == s[n//2+1:]:
print('Yes')
else:
print('No')
| n = int(input())
s = input()
if n % 2 == 1:
print('No')
exit()
else:
if s[:n//2] == s[n//2:]:
print('Yes')
else:
print('No') | [
"call.add",
"expression.operation.binary.remove"
] | 662,224 | 662,223 | u363421241 | python |
p02860 | r = int(input())
s = input()
if r%2 == 1:
print("No")
m = str(s[0:r//2])
if m*2 == s:print('Yes')
else:print('No') | r = int(input())
s = input()
if r%2 == 1:
print("No")
exit()
m = str(s[0:r//2])
if m*2 == s:print('Yes')
else:print('No') | [
"call.add"
] | 662,229 | 662,230 | u773440446 | python |
p02860 | n = str(input())
if len(n) % 2 == 1:
print('No')
else:
a = n[0 : len(n)//2]
b = n[len(n)//2 : len(n)]
if a == b:
print('Yes')
else:
print('No') | nn = input()
n = str(input())
if len(n) % 2 == 1:
print('No')
else:
a = n[0 : len(n)//2]
b = n[len(n)//2 : len(n)]
if a == b:
print('Yes')
else:
print('No') | [
"assignment.add"
] | 662,231 | 662,232 | u029568245 | python |
p02860 | N=int(input())
S=input()
if N%2!=0:
print('No')
for i in range(int(N/2)):
if S[i]!=S[int(N/2)+i]:
print('No')
exit()
print('Yes') | N=int(input())
S=input()
if N%2!=0:
print('No')
exit()
for i in range(int(N/2)):
if S[i]!=S[int(N/2)+i]:
print('No')
exit()
print('Yes') | [
"call.add"
] | 662,234 | 662,235 | u827261928 | python |
p02860 |
N = int(input())
S = input()
if(print (S[:(N//2)]) == print (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")
| [
"control_flow.branch.if.condition.change",
"call.remove"
] | 662,242 | 662,243 | u907865484 | python |
p02860 | 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")
| [
"expression.operation.binary.remove"
] | 662,252 | 662,253 | u617953889 | python |
p02860 | N=int(input())
S=input()
if N%2==1:
print('No')
exit()
n=N//2
for i in range(n):
if S[i]!=S[n+i]:
print('No')
else:
print('Yes')
| N=int(input())
S=input()
if N%2==1:
print('No')
exit()
n=N//2
for i in range(n):
if S[i]!=S[n+i]:
print('No')
break
else:
print('Yes')
| [
"control_flow.break.add"
] | 662,254 | 662,255 | u752774573 | python |
p02860 | s = input()
if len(s) % 2 != 0:
print('No')
else:
s1 = s[:len(s)//2]
s2 = s[len(s)//2:]
if s1 == s2:
print('Yes')
else:
print('No') | i = input()
s = input()
if len(s) % 2 != 0:
print('No')
else:
s1 = s[:len(s)//2]
s2 = s[len(s)//2:]
if s1 == s2:
print('Yes')
else:
print('No') | [
"assignment.add"
] | 662,280 | 662,281 | u763177133 | python |
p02860 | N = int(input())
S = str(input())
if N % 2 == 0:
NN = int(N/2)
for i in range(0, NN):
if S[i] != S[i+NN]:
print('No')
else:
print('Yes')
else:
print('No') | N = int(input())
S = str(input())
if N % 2 == 0:
NN = int(N/2)
for i in range(0, NN):
if S[i] != S[i+NN]:
print('No')
break
else:
print('Yes')
else:
print('No') | [
"control_flow.break.add"
] | 662,302 | 662,303 | u967822229 | python |
p02860 | N = int(input())
S = str(input())
if N % 2 == 0:
NN = N/2
for i in range(0, NN):
if S[i] != S[i+NN]:
print('No')
else:
print('Yes')
else:
print('No') | N = int(input())
S = str(input())
if N % 2 == 0:
NN = int(N/2)
for i in range(0, NN):
if S[i] != S[i+NN]:
print('No')
break
else:
print('Yes')
else:
print('No') | [
"call.add",
"call.arguments.change",
"control_flow.break.add"
] | 662,304 | 662,303 | u967822229 | python |
p02860 | N = int(input())
str = input()
if len(str) % 2 != 0:
print("No")
elif str[:int(len(str)/2)] != str[int(len(str)/2) + 1:]:
print("No")
else:
print("Yes") | N = int(input())
str = input()
if len(str) % 2 != 0:
print("No")
elif str[:int(len(str)/2)] != str[int(len(str)/2):]:
print("No")
else:
print("Yes") | [
"expression.operation.binary.remove"
] | 662,305 | 662,306 | u739843002 | python |
p02860 | N = int(input())
S = input()
if N%2==1:
print('No')
else:
for i in range (N//2):
if S[i]!=S[N//2+i]:
print('No')
exit()
print('Yes')
| N = int(input())
S = input()
if N%2==1:
print('No')
exit()
else:
for i in range (N//2):
if S[i]!=S[N//2+i]:
print('No')
exit()
print('Yes')
| [
"call.add"
] | 662,311 | 662,312 | u779293207 | python |
p02860 | N = int(input())
s = input()
if N%2 != 0:
print('No')
else:
x = N//2
if s[1:x] == s[x+1:N]:
print('Yes')
else:
print('No') | N = int(input())
s = input()
if N%2 != 0:
print('No')
else:
x = N//2
if s[0:x] == s[x:]:
print('Yes')
else:
print('No') | [
"literal.number.integer.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 662,348 | 662,349 | u067273593 | python |
p02860 | N = int(input())
S = input()
is_even = N % 2 == 0
S1 = S[0:int(len(S) / 2)]
S2 = S[int(len(S) / 2):]
answer = True if is_even and S1 == S2 else False
print(answer)
| N = int(input())
S = input()
is_even = N % 2 == 0
S1 = S[0:int(len(S) / 2)]
S2 = S[int(len(S) / 2):]
answer = 'Yes' if is_even and S1 == S2 else 'No'
print(answer)
| [
"assignment.value.change"
] | 662,354 | 662,355 | u017624958 | python |
p02860 | n = int(input())
s = input()
if n%2 == 1:
print("No")
exit
slise = (n/2)
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") | [
"call.add"
] | 662,356 | 662,357 | u586822112 | python |
p02860 | n=int(input())
s=input()
if n%2==0:
if s[0:n//2]==s[n//2:-1]:
print("Yes")
else:
print("No")
else:
print("No") | n=int(input())
s=input()
if n%2==0:
if s[0:n//2]==s[n//2:]:
print("Yes")
else:
print("No")
else:
print("No") | [] | 662,363 | 662,364 | u907446975 | python |
p02860 | n = int(input())
s = input()
sss = len(s) // 2
if sss == 1:
print("No")
else:
a = s[:int(len(s)/2)]
if a*2 == s:
print("Yes")
else:
print("NO") | n = int(input())
s = input()
sss = len(s) % 2
if sss == 1:
print("No")
else:
a = s[:int(len(s)/2)]
if a*2 == s:
print("Yes")
else:
print("No") | [
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change",
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 662,376 | 662,377 | u573234244 | python |
p02860 | n = int(input())
s = input()
sss = len(s) // 2
if sss == 1:
print("No")
else:
a = s[:int(len(s)/2)]
if a*2 == s:
print("Yes")
else:
print("NO") | n = int(input())
s = input()
sss = len(s) % 2
if sss == 1:
print("No")
else:
a = s[:int(len(s)/2)]
if a*2 == s:
print("Yes")
else:
print("No") | [
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change",
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 662,378 | 662,377 | u573234244 | python |
p02860 | 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')
| [] | 662,379 | 662,380 | u617037231 | python |
p02860 | N = int(input())
S = list(input())
if N // 2 == 1:
print('No')
elif S[0:N//2] == S[N//2:-1]:
print('Yes')
else:
print('No')
| N = int(input())
S = list(input())
if N % 2 == 1:
print('No')
elif S[:N//2] == S[N//2:]:
print('Yes')
else:
print('No')
| [
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 662,381 | 662,382 | u526094365 | python |
p02860 | x=int(input())
t=int(x/2)
y=str(input())
if x%2!=0:
print("No")
exit()
for i in range(x):
if y[i]!=y[i+x]:
print("No")
exit()
print("Yes") | x=int(input())
t=int(x/2)
y=str(input())
if x%2!=0:
print("No")
exit()
for i in range(t):
if y[i]!=y[i+t]:
print("No")
exit()
print("Yes") | [
"identifier.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 662,390 | 662,391 | u049725710 | python |
p02860 | 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()
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') | [] | 662,408 | 662,409 | u699944218 | python |
p02860 | n = int(input())
s = input()
if n % 2 != 0:
print("No")
elif s[0:(n/2)] == s[(n/2):n]:
print("Yes")
else:
print("No") | n = int(input())
s = input()
if n % 2 != 0:
print("No")
elif s[0:(n//2)] == s[(n//2):n]:
print("Yes")
else:
print("No") | [
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 662,428 | 662,429 | u230900948 | python |
p02860 | N=int(input())
S=input()
if N%2==0:
if S[:N/2]==S[N/2:]:
print("Yes")
exit()
print("No") | N=int(input())
S=input()
if N%2==0:
if S[:int(N/2)]==S[int(N/2):]:
print("Yes")
exit()
print("No") | [
"control_flow.branch.if.condition.change",
"call.add"
] | 662,445 | 662,446 | u998262711 | python |
p02860 | n = int(input())
s = input()
if print(s[0:n//2]) == print(s[n//2:]):
print('Yes')
else:
print('No')
| n = int(input())
s = input()
if s[0:n//2] == s[n//2:]:
print('Yes')
else:
print('No')
| [
"call.remove",
"control_flow.branch.if.condition.change"
] | 662,453 | 662,454 | u804733539 | python |
p02860 | s = [input() for i in range(2)]
N = int(s[0])
S = s[1]
if N % 2 > 0:
print('No')
hN = N // 2
if S[:hN] == S[hN:N -1]:
print('Yes')
else:
print('No')
| s = [input() for i in range(2)]
N = int(s[0])
S = s[1]
if N % 2 > 0:
print('No')
else:
hN = N // 2
if S[:hN] == S[hN:N]:
print('Yes')
else:
print('No')
| [
"expression.operation.binary.remove"
] | 662,481 | 662,482 | u898271416 | python |
p02860 | N = int(input())
S = input()
ans = "No"
if N%2 == 0:
if S[:N//2-1] * 2 == S:
ans = "Yes"
print(ans) | N = int(input())
S = input()
ans = "No"
if N%2 == 0:
if S[:N//2] * 2 == S:
ans = "Yes"
print(ans) | [
"expression.operation.binary.remove"
] | 662,486 | 662,487 | u985963315 | python |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.