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 |
|---|---|---|---|---|---|---|---|
p02856
|
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def main():
mod=10**9+7
M=I()
dig=0
S=0
for i in range(M):
d,c=MI()
dig+=c
S+=d*c
print(dig-1+(S)//10)
main()
|
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def main():
mod=10**9+7
M=I()
dig=0
S=0
for i in range(M):
d,c=MI()
dig+=c
S+=d*c
print(dig-1+(S-1)//9)
main()
|
[
"literal.number.integer.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 662,659
| 662,658
|
u498487134
|
python
|
p02856
|
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def main():
mod=10**9+7
M=I()
dig=0
S=0
for i in range(M):
d,c=MI()
dig+=d
S+=d*c
print(dig-1+(S)//10)
main()
|
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def main():
mod=10**9+7
M=I()
dig=0
S=0
for i in range(M):
d,c=MI()
dig+=c
S+=d*c
print(dig-1+(S-1)//9)
main()
|
[
"identifier.change",
"literal.number.integer.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 662,660
| 662,658
|
u498487134
|
python
|
p02856
|
M=int(input())
dig=0
sum=0
for i in range(M):
d,c=map(int,input().split())
dig+=c
sum+=d*c
print(dig-1+sum//9)
|
M=int(input())
dig=0
sum=0
for i in range(M):
d,c=map(int,input().split())
dig+=c
sum+=d*c
print(dig-1+(sum-1)//9)
|
[
"call.arguments.change"
] | 662,661
| 662,662
|
u498487134
|
python
|
p02856
|
M=int(input())
dig=0
sum=0
for i in range(M):
d,c=map(int,input().split())
dig+=c
sum+=d*c
print(dig-1+sum//10)
|
M=int(input())
dig=0
sum=0
for i in range(M):
d,c=map(int,input().split())
dig+=c
sum+=d*c
print(dig-1+(sum-1)//9)
|
[
"call.arguments.change",
"literal.number.integer.change",
"expression.operation.binary.change",
"io.output.change"
] | 662,663
| 662,662
|
u498487134
|
python
|
p02856
|
M = int(input())
DC = [tuple(map(int, input().split())) for _ in range(M)]
D = 0
C = 0
for d, c in DC:
D += d
C += c
ans = C - 1
ans += (D - 1) // 9
print(ans)
|
M = int(input())
DC = [tuple(map(int, input().split())) for _ in range(M)]
D = 0
C = 0
for d, c in DC:
D += d * c
C += c
ans = C - 1
ans += (D - 1) // 9
print(ans)
|
[
"expression.operation.binary.add"
] | 662,664
| 662,665
|
u392319141
|
python
|
p02856
|
M = int(input())
X = [list(map(int, input().split())) for _ in range(M)]
d = sum(c for _, c in X)
s = sum(d for d, _ in X)
print(d - 1 + (s - 1) // 9)
|
M = int(input())
X = [list(map(int, input().split())) for _ in range(M)]
d = sum(c for _, c in X)
s = sum(d * c for d, c in X)
print(d - 1 + (s - 1) // 9)
|
[
"assignment.value.change",
"identifier.change"
] | 662,677
| 662,678
|
u057109575
|
python
|
p02856
|
m=int(input())
a,b=0,0
for i in range(m):
d,c=[int(j) for j in input().split()]
a+=d
b+=c
print(b-1+(a-1)//9)
|
m=int(input())
a,b=0,0
for i in range(m):
d,c=[int(j) for j in input().split()]
a+=d*c
b+=c
print(b-1+(a-1)//9)
|
[
"expression.operation.binary.add"
] | 662,700
| 662,701
|
u350248178
|
python
|
p02856
|
digit = 0
s = 0
M = int(input())
for _ in range(M):
d, c = map(int, input().split())
digit += c
s += d * c
x = digit - 1
y = s // 9 + (s % 9 == 0)
print(x + y)
|
digit = 0
s = 0
M = int(input())
for _ in range(M):
d, c = map(int, input().split())
digit += c
s += d * c
x = digit - 1
y = s // 9 - (s % 9 == 0)
print(x + y)
|
[
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 662,706
| 662,707
|
u144913062
|
python
|
p02856
|
import sys
input = sys.stdin.readline
m=int(input())
DC=[]
for i in range(m):
DC.append(tuple(map(int,input().split())))
tot=0
for d,c in DC:
tot+=c*(9+d)
print(tot//9-1)
|
import sys
input = sys.stdin.readline
m=int(input())
DC=[]
for i in range(m):
DC.append(tuple(map(int,input().split())))
tot=0
for d,c in DC:
tot+=c*(9+d)
print((tot-1)//9-1)
|
[
"call.arguments.change"
] | 662,720
| 662,721
|
u969190727
|
python
|
p02856
|
import sys
input = sys.stdin.readline
m = int(input())
ans = 0
sum_num = 0
c_sum = 0
for i in range(m):
d,c = map(int, input().split())
sum_num += d*c
c_sum += c
#εθ¨γ«ε―Ύγγ¦γ9ζΈγγθ‘ηΊγδ½εεΊζ₯γγ
print(c_sum-1 + (sum_num//9))
|
import sys
input = sys.stdin.readline
m = int(input())
ans = 0
sum_num = 0
c_sum = 0
for i in range(m):
d,c = map(int, input().split())
sum_num += d*c
c_sum += c
#εθ¨γ«ε―Ύγγ¦γ9ζΈγγθ‘ηΊγδ½εεΊζ₯γγ
print(c_sum-1 + ((sum_num-1)//9))
|
[
"call.arguments.change"
] | 662,737
| 662,738
|
u691896522
|
python
|
p02856
|
n = int(input())
s = 0
cot = 0
for _ in range(n):
a,b=list( map(int, input().split(" ")))
s += a* b
cot += b
cot -= (1 )
cot += s//10
print(cot)
|
n = int(input())
s = 0
cot = 0
for _ in range(n):
a,b=list( map(int, input().split(" ")))
s += a* b
cot += b
cot -= (1 )
cot += (s -1)//9
print(cot)
|
[
"literal.number.integer.change",
"expression.operation.binary.change"
] | 662,739
| 662,740
|
u865741247
|
python
|
p02856
|
import sys
input = sys.stdin.buffer.readline
def main():
N = int(input())
s,keta = 0,0
for _ in range(N):
a,b = map(int,input().split())
s += a*b
keta += b
print(s//9+(keta-1))
if __name__ == "__main__":
main()
|
import sys
input = sys.stdin.buffer.readline
def main():
N = int(input())
s,keta = 0,0
for _ in range(N):
a,b = map(int,input().split())
s += a*b
keta += b
print((s-1)//9+keta-1)
if __name__ == "__main__":
main()
|
[
"call.arguments.change"
] | 662,741
| 662,742
|
u648212584
|
python
|
p02856
|
m = int(input())
d, s = 0, 0
for _ in range(m):
a, b = map(int, input().split())
s += a
d += b
print(d-1 + (s-1)//9)
|
m = int(input())
d, s = 0, 0
for _ in range(m):
a, b = map(int, input().split())
s += a*b
d += b
print(d-1 + (s-1)//9)
|
[
"expression.operation.binary.add"
] | 662,746
| 662,747
|
u754022296
|
python
|
p02856
|
m=int(input())
a=0
b=0
for i in range(m):
d,c=map(int,input().split())
a=a+d*c
b=b+c
print(a//9+b-1)
|
m=int(input())
a=0
b=0
for i in range(m):
d,c=map(int,input().split())
a=a+d*c
b=b+c
print((a-1)//9+b-1)
|
[
"call.arguments.change"
] | 662,750
| 662,751
|
u968846084
|
python
|
p02856
|
x=0;y=0
for _ in range(int(input())):
d,c=map(int,input().split())
x+=d*c
y+=c
print(y-2+x//9)
|
x=y=-1
for _ in range(int(input())):
d,c=map(int,input().split())
x+=d*c
y+=c
print(y+x//9)
|
[
"assignment.value.change",
"expression.operation.unary.add",
"expression.operation.binary.remove"
] | 662,752
| 662,753
|
u539517139
|
python
|
p02856
|
x=0;y=0
for _ in range(int(input())):
d,c=map(int,input().split())
x+=d*c
y+=c
print(y-2+x//9)
|
x=0;y=0
for _ in range(int(input())):
d,c=map(int,input().split())
x+=d*c
y+=c
print(y-1+(x-1)//9)
|
[
"literal.number.integer.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 662,752
| 662,754
|
u539517139
|
python
|
p02856
|
m = int(input())
csum = 0
dsum = 0
for i in range(m):
d,c = (int(x) for x in input().split())
csum += c
dsum += d*c
print(csum-1 + dsum // 9)
|
m = int(input())
csum = 0
dsum = 0
for i in range(m):
d,c = (int(x) for x in input().split())
csum += c
dsum += d*c
print(csum-1 + (dsum-1) // 9)
|
[
"call.arguments.change"
] | 662,782
| 662,783
|
u899645116
|
python
|
p02856
|
m = int(input())
csum = 0
dsum = 0
for i in range(m):
d,c = (int(x) for x in input().split())
csum += c
dsum += d*c
print(c-1 + dsum // 9)
|
m = int(input())
csum = 0
dsum = 0
for i in range(m):
d,c = (int(x) for x in input().split())
csum += c
dsum += d*c
print(csum-1 + (dsum-1) // 9)
|
[
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 662,784
| 662,783
|
u899645116
|
python
|
p02856
|
#!/usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
import sys, random, itertools, math
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt
def LI(): return list(map(int, input().split()))
def LF(): return list(map(float, input().split()))
def LI_(): return list(map(lambda x: int(x)-1, input().split()))
def II(): return int(input())
def IF(): return float(input())
def LS(): return list(map(list, input().split()))
def S(): return list(input().rstrip())
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = 1e10
#solve
def solve():
m = II()
Digit = 0
Sum = 0
for _ in range(m):
d, c = LI()
Digit += c
Sum += d * c
print(Digit + Sum // 9 - 1)
return
#main
if __name__ == '__main__':
solve()
|
#!/usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
import sys, random, itertools, math
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt
def LI(): return list(map(int, input().split()))
def LF(): return list(map(float, input().split()))
def LI_(): return list(map(lambda x: int(x)-1, input().split()))
def II(): return int(input())
def IF(): return float(input())
def LS(): return list(map(list, input().split()))
def S(): return list(input().rstrip())
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = 1e10
#solve
def solve():
m = II()
Digit = 0
Sum = 0
for _ in range(m):
d, c = LI()
Digit += c
Sum += d * c
print(Digit + (Sum - 1) // 9 - 1)
return
#main
if __name__ == '__main__':
solve()
|
[
"call.arguments.change"
] | 662,814
| 662,815
|
u423585790
|
python
|
p02856
|
#!/usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
import sys, random, itertools, math
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt
def LI(): return list(map(int, input().split()))
def LF(): return list(map(float, input().split()))
def LI_(): return list(map(lambda x: int(x)-1, input().split()))
def II(): return int(input())
def IF(): return float(input())
def LS(): return list(map(list, input().split()))
def S(): return list(input().rstrip())
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = 1e10
#solve
def solve():
m = II()
Digit = 0
Sum = 0
for _ in range(m):
d, c = LI()
Digit += c
Sum += d * c
print(Digit + Sum // 9)
return
#main
if __name__ == '__main__':
solve()
|
#!/usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
import sys, random, itertools, math
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt
def LI(): return list(map(int, input().split()))
def LF(): return list(map(float, input().split()))
def LI_(): return list(map(lambda x: int(x)-1, input().split()))
def II(): return int(input())
def IF(): return float(input())
def LS(): return list(map(list, input().split()))
def S(): return list(input().rstrip())
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = 1e10
#solve
def solve():
m = II()
Digit = 0
Sum = 0
for _ in range(m):
d, c = LI()
Digit += c
Sum += d * c
print(Digit + (Sum - 1) // 9 - 1)
return
#main
if __name__ == '__main__':
solve()
|
[
"call.arguments.change"
] | 662,816
| 662,815
|
u423585790
|
python
|
p02856
|
M = int(input())
d_sum = 0
c_sum = 0
for i in range(M):
d, c = [int(_) for _ in input().split()]
d_sum += d
c_sum += c
print(c_sum - 1 + (d_sum - 1) // 9)
|
M = int(input())
d_sum = 0
c_sum = 0
for i in range(M):
d, c = [int(_) for _ in input().split()]
d_sum += d * c
c_sum += c
print(c_sum - 1 + (d_sum - 1) // 9)
|
[
"expression.operation.binary.add"
] | 662,835
| 662,836
|
u788717734
|
python
|
p02856
|
m=int(input())
d=[]
c=[]
z=0
for i in range(m):
a,b=map(int,input().split())
d.append(a)
c.append(b)
z+=a*b
ans=0
print(sum(d)-1+z//9)
exit()
def ika(x,y):
ret=0
z=x*y
ret+=y-1
while z>9:
s=list(str(z))
ret+=len(s)-1
i5=0
for i in range(len(s)):
s[i]=int(s[i])
g=0
while g<len(s)-1:
if s[g]+s[g+1]>=10:
#ret+=1
g+=2
else:
g+=1
z=sum(s)
ret+=(z-10)//10
return [ret,z]
ka=[]
for i in range(m):
f=ika(d[i],c[i])
ans+=f[0]
ka.append(f[1])
print(ans+ika(sum(ka),1)[0]+len(ka)-1)
|
m=int(input())
d=[]
c=[]
z=0
for i in range(m):
a,b=map(int,input().split())
d.append(a)
c.append(b)
z+=a*b
ans=0
print(sum(c)-1+(z-1)//9)
exit()
def ika(x,y):
ret=0
z=x*y
ret+=y-1
while z>9:
s=list(str(z))
ret+=len(s)-1
i5=0
for i in range(len(s)):
s[i]=int(s[i])
g=0
while g<len(s)-1:
if s[g]+s[g+1]>=10:
#ret+=1
g+=2
else:
g+=1
z=sum(s)
ret+=(z-10)//10
return [ret,z]
ka=[]
for i in range(m):
f=ika(d[i],c[i])
ans+=f[0]
ka.append(f[1])
print(ans+ika(sum(ka),1)[0]+len(ka)-1)
|
[
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 662,842
| 662,841
|
u223904637
|
python
|
p02856
|
M=int(input())
#Get the number that needs to be handled
num=''
D,C=[],[]
for _ in range(M):
D1,C1=map(int, input().split())
D.append(D1)
C.append(C1)
S = sum(d * c for d, c in zip(D, C))
print (sum(C)-1+S//9)
|
M=int(input())
#Get the number that needs to be handled
num=''
D,C=[],[]
for _ in range(M):
D1,C1=map(int, input().split())
D.append(D1)
C.append(C1)
S = sum(d * c for d, c in zip(D, C))
print (sum(C)-1+(S-1)//9)
|
[
"call.arguments.change"
] | 662,849
| 662,850
|
u807315165
|
python
|
p02856
|
M = int(input())
D, S = 0, 0
for _ in range(M):
d, c = map(int, input().split())
D += c
S += d
print(D - 1 + (S - 1) // 9)
|
M = int(input())
D, S = 0, 0
for _ in range(M):
d, c = map(int, input().split())
D += c
S += d * c
print(D - 1 + (S - 1) // 9)
|
[
"expression.operation.binary.add"
] | 662,866
| 662,867
|
u782098901
|
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')
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')
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change",
"control_flow.branch.if.condition.change"
] | 662,907
| 662,908
|
u932868243
|
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')
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')
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change",
"control_flow.branch.if.condition.change"
] | 662,909
| 662,908
|
u932868243
|
python
|
p02860
|
n=int(input())
s=input()
m=0
if n%2==0:
for i in range(n//2):
if s[i]==s[i+n//2]:
m+=1
print("Yes" if m==(n//2) else "No")
|
n=int(input())
s=input()
m=0
if n%2==0:
for i in range(n//2):
if s[i]==s[i+n//2]:
m+=1
print("Yes" if m==(n/2) else "No")
|
[
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 662,913
| 662,914
|
u806976856
|
python
|
p02860
|
r = int(input())
s = input()
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')
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 662,917
| 662,916
|
u588276267
|
python
|
p02860
|
def main():
N = int(input())
S = input()
if (N % 2 == 1):
print('No')
else:
mid = N // 2
print('Yes' if (S[:mid-1] == S[mid:]) else 'No')
return 0
if __name__ == '__main__':
main()
|
def main():
N = int(input())
S = input()
if (N % 2 == 1):
print('No')
else:
mid = N // 2
print('Yes' if (S[:mid] == S[mid:]) else 'No')
return 0
if __name__ == '__main__':
main()
|
[
"expression.operation.binary.remove"
] | 662,918
| 662,919
|
u529722835
|
python
|
p02860
|
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")
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 662,924
| 662,925
|
u581337384
|
python
|
p02860
|
N = input()
S = input()
print("Yes" if S[0:(N//2)]==S[(N//2):N] else "No")
|
N = int(input())
S = input()
print("Yes" if S[:(N//2)] == S[(N//2):N] else "No")
|
[
"call.add",
"call.arguments.change"
] | 662,932
| 662,933
|
u165268875
|
python
|
p02860
|
N = int(inoput())
S = input()
print('Yes' if S[N//2:] == S[:N//2] else 'No')
|
N = int(input())
S = input()
print('Yes' if S[N//2:] == S[:N//2] else 'No')
|
[
"assignment.value.change",
"identifier.change",
"call.function.change",
"call.arguments.change"
] | 662,934
| 662,935
|
u857673087
|
python
|
p02860
|
n = int(input())
s=input()
if n%2==0 and 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")
|
[
"expression.operation.binary.remove"
] | 662,947
| 662,948
|
u297651868
|
python
|
p02860
|
n = int(input())
m = input()
if m[:n//2] == m[n//2:]:
print("yes")
else:
print("No")
|
n = int(input())
m = input()
if m[:n//2] == m[n//2:]:
print("Yes")
else:
print("No")
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 662,951
| 662,952
|
u363080243
|
python
|
p02860
|
n = int(input())
m = str(input())
if m[:n//2] == m[n//2:]:
print("yes")
else:
print("No")
|
n = int(input())
m = input()
if m[:n//2] == m[n//2:]:
print("Yes")
else:
print("No")
|
[
"call.remove",
"call.arguments.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 662,953
| 662,952
|
u363080243
|
python
|
p02860
|
S = input()
if len(S) %2:
print("No")
else:
N=len(S)
if S[:N//2] == S[N//2:]:
print("Yes")
else:
print("No")
|
N = input()
S = input()
if len(S) %2:
print("No")
else:
N=len(S)
if S[:N//2] == S[N//2:]:
print("Yes")
else:
print("No")
|
[
"assignment.add"
] | 662,958
| 662,959
|
u493130708
|
python
|
p02860
|
n=int(input())
s=list(str(input()))
if n%2==1:
print("No")
else:
for i in range(int(n/2)):
if s[i]!=s[i+int(n/2)]:
print("No")
print("Yes")
|
import sys
n=int(input())
s=list(str(input()))
if n%2==1:
print("No")
else:
for i in range(int(n/2)):
if s[i]!=s[i+int(n/2)]:
print("No")
exit()
print("Yes")
|
[
"call.add"
] | 662,960
| 662,961
|
u870178975
|
python
|
p02860
|
N=int(input())
S=input()
ans="Yes"
if N%2!=0:
ans="No"
for i in range(N//2):
if(S[i]!=S[i+(N//2)]):
ans="No"
exit()
print(ans)
|
N=int(input())
S=input()
ans="Yes"
if N%2!=0:
ans="No"
for i in range(N//2):
if(S[i]!=S[i+(N//2)]):
ans="No"
print(ans)
|
[
"call.remove"
] | 662,985
| 662,986
|
u150155436
|
python
|
p02860
|
import sys
n = int(sys.stdin.readline())
s = sys.stdin.readline().strip()
if not n % 2:
if s[0:n/2] == s[n/2:]:
print('Yes')
else:
print('No')
else:
print('No')
|
import sys
n = int(sys.stdin.readline())
s = sys.stdin.readline().strip()
if not n % 2:
if s[0:n//2] == s[n//2:]:
print('Yes')
else:
print('No')
else:
print('No')
|
[
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 662,990
| 662,991
|
u823885866
|
python
|
p02860
|
def resolve():
n=int(input())
s=input()
if n%2!=0 and s[:n//2]==s[n//2:]:
print('Yes')
else:
print('No')
resolve()
|
def resolve():
n=int(input())
s=input()
if n%2==0 and s[:n//2]==s[n//2:]:
print('Yes')
else:
print('No')
resolve()
|
[
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 663,009
| 663,010
|
u057964173
|
python
|
p02860
|
N = int(input())
S = input()
if N%2 != 0:
print("No")
elif S[0:int(N/2)-1] == S[int(N/2)+1:]:
print("Yes")
else:
print("No")
|
N = int(input())
S = input()
if N%2 != 0:
print("No")
elif S[:int(N/2)] == S[int(N/2):]:
print("Yes")
else:
print("No")
|
[
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 663,021
| 663,022
|
u550535134
|
python
|
p02860
|
import math
N = int(input())
S = str(input())
if N == 1:
print('No')
exit()
if N%2 == 1:
print('No')
exit()
n = (N/2)
j = True
for i in range(n):
if S[i] != S[i + n]:
j = False
if j:
print('Yes')
else:
print('No')
|
import math
N = int(input())
S = str(input())
if N == 1:
print('No')
exit()
if N%2 == 1:
print('No')
exit()
n = (N//2)
j = True
for i in range(n):
if S[i] != S[i + n]:
j = False
if j:
print('Yes')
else:
print('No')
|
[
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 663,023
| 663,024
|
u961945062
|
python
|
p02860
|
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')
|
[
"call.remove"
] | 663,027
| 663,028
|
u681323954
|
python
|
p02860
|
n = int(input())
s = input()
if n % 2 == 1:
print("No")
elif s[:(int)(n/2-1)] == s[(int)(n/2):]:
print("Yes")
else:
print("No")
|
n = int(input())
s = input()
if n % 2 == 1:
print("No")
elif s[:(int)(n/2)] == s[(int)(n/2):]:
print("Yes")
else:
print("No")
|
[
"expression.operation.binary.remove"
] | 663,043
| 663,044
|
u860966226
|
python
|
p02860
|
n=int(input())
s=input()
import sys
a=0
sys.exit()
if n==1:
print('No')
sys.exit()
if n%2!=0:
print('No')
sys.exit()
else:
for i in range(n//2):
if s[i]==s[i+(n//2)]:
pass
else:
a=1
break
if a==0:
print('Yes')
else:
print('No')
|
n=int(input())
s=input()
import sys
a=0
if n==1:
print('No')
sys.exit()
if n%2!=0:
print('No')
sys.exit()
else:
for i in range(n//2):
if s[i]==s[i+(n//2)]:
pass
else:
a=1
break
if a==0:
print('Yes')
else:
print('No')
|
[
"call.remove"
] | 663,051
| 663,052
|
u223555291
|
python
|
p02860
|
N = int(input())
S = input()
if N%2 == 0:
T = S[0:N/2]
if T+T == S:
print("Yes")
else:
print("No")
else:
print("No")
|
N = int(input())
S = input()
if N%2 == 0:
T = S[0:int(N/2)]
if T+T == S:
print("Yes")
else:
print("No")
else:
print("No")
|
[
"call.add",
"call.arguments.change"
] | 663,071
| 663,072
|
u216728327
|
python
|
p02860
|
N = int(input())
S = input()
if N//2 == 0:
T = S[0:N/2]
if T+T == S:
print("Yes")
else:
print("No")
else:
print("No")
|
N = int(input())
S = input()
if N%2 == 0:
T = S[0:int(N/2)]
if T+T == S:
print("Yes")
else:
print("No")
else:
print("No")
|
[
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change",
"call.add",
"call.arguments.change"
] | 663,073
| 663,072
|
u216728327
|
python
|
p02860
|
N = int(input())
S = input()
if N%2!=0:
print("No")
else:
if S[:N//2]*2 == S:print("Ok")
else : print("No")
|
N = int(input())
S = input()
if N%2!=0:
print("No")
else:
if S[:N//2]*2 == S:print("Yes")
else : print("No")
|
[
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 663,076
| 663,077
|
u245641078
|
python
|
p02860
|
N = int(input())
A = str(input())
if (N % 2 == 0):
if (A[:N/2] == A[N/2:]):
print("Yes")
else:
print("No")
else:
print("No")
|
N = int(input())
A = str(input())
if (N % 2 == 0):
if (A[:N//2] == A[N//2:]):
print("Yes")
else:
print("No")
else:
print("No")
|
[
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 663,085
| 663,086
|
u127836650
|
python
|
p02860
|
N = int(input())
A = str(input())
if (N % 2 == 0):
if (A[:N/2-1] == A[N/2:]):
print("Yes")
else:
print("No")
else:
print("No")
|
N = int(input())
A = str(input())
if (N % 2 == 0):
if (A[:N//2] == A[N//2:]):
print("Yes")
else:
print("No")
else:
print("No")
|
[
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 663,087
| 663,086
|
u127836650
|
python
|
p02860
|
n = int(input())
s = input()
if n%2==1:
print('No')
exit(0)
if s[:n//2] == s[:-n//2]:
print('Yes')
else:
print('No')
|
n = int(input())
s = input()
if n%2==1:
print('No')
exit(0)
if s[:n//2] == s[-n//2:]:
print('Yes')
else:
print('No')
|
[
"control_flow.branch.if.condition.change"
] | 663,090
| 663,091
|
u595952233
|
python
|
p02860
|
N=int(input())
S=input()
if N%2==1:
print("No")
if 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")
|
[
"control_flow.branch.if.replace.remove",
"control_flow.branch.else_if.replace.add"
] | 663,096
| 663,097
|
u409403493
|
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")
|
[
"control_flow.branch.if.condition.change"
] | 663,098
| 663,099
|
u296150111
|
python
|
p02860
|
length = int(input())
S = input()
if length % 2 != 0:
print("No")
else:
if S[:length//2] != S[length//2]:
print("No")
else:
print("Yes")
|
length = int(input())
S = input()
if length % 2 != 0:
print("No")
else:
if S[:length//2] != S[length//2:]:
print("No")
else:
print("Yes")
|
[
"control_flow.branch.if.condition.change"
] | 663,126
| 663,127
|
u979126665
|
python
|
p02860
|
i=input()
S=input()
if S[:len(S)//2] != S[len(S)//2] or len(S)%2 !=0:
print("No")
else:
print("Yes")
|
i=input()
S=input()
if S[:len(S)//2] != S[len(S)//2:] or len(S)%2 !=0:
print("No")
else:
print("Yes")
|
[
"control_flow.branch.if.condition.change"
] | 663,130
| 663,131
|
u890209418
|
python
|
p02860
|
n = int(input())
s = input()
print('yes' if s[:n//2] == s[n//2:] else 'no')
|
n = int(input())
s = input()
print('Yes' if s[:n//2] == s[n//2:] else 'No')
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 663,151
| 663,152
|
u895536501
|
python
|
p02860
|
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')
|
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')
|
[
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 663,156
| 663,157
|
u692054751
|
python
|
p02860
|
S = input()
index = len(S) // 2
if len(S) % 2 != 0:
print('No')
elif S[:index] != S[index:]:
print('No')
else:
print('Yes')
|
N = input()
S = input()
index = len(S) // 2
if len(S) % 2 != 0:
print('No')
elif S[:index] != S[index:]:
print('No')
else:
print('Yes')
|
[
"assignment.add"
] | 663,158
| 663,159
|
u692054751
|
python
|
p02860
|
N = int(input())
S = input()
if N % 2 == 1:
print("No")
exit()
if S[0:N/2] == S[N/2:]:
print("Yes")
else:
print("No")
|
N = int(input())
S = input()
if N % 2 == 1:
print("No")
exit()
if S[0:int(N/2)] == S[int(N/2):]:
print("Yes")
else:
print("No")
|
[
"control_flow.branch.if.condition.change",
"call.add"
] | 663,174
| 663,175
|
u096100666
|
python
|
p02860
|
n=input()
s=input()
a=[]
b=[]
for i in range(len(s)//2):
a.append(s[i])
for i in range(len(s)//2,len(s)):
b.append(s[i])
print(a,b)
if a==b:
print("Yes")
else:
print("No")
|
n=input()
s=input()
a=[]
b=[]
for i in range(len(s)//2):
a.append(s[i])
for i in range(len(s)//2,len(s)):
b.append(s[i])
if a==b:
print("Yes")
else:
print("No")
|
[
"call.remove"
] | 663,189
| 663,190
|
u310381103
|
python
|
p02860
|
n=input()
s=input()
a=[]
b=[]
for i in range(len(s)//2):
a.append(s[i])
for i in range(len(s)//2,):
b.append(s[i])
if a==b:
print("Yes")
else:
print("No")
|
n=input()
s=input()
a=[]
b=[]
for i in range(len(s)//2):
a.append(s[i])
for i in range(len(s)//2,len(s)):
b.append(s[i])
if a==b:
print("Yes")
else:
print("No")
|
[
"call.add"
] | 663,191
| 663,190
|
u310381103
|
python
|
p02860
|
N = int(input())
S = list(input())
if len(S)%2 == 1:
print('NO')
exit()
if len(S)%2 == 0:
for i in range(len(S)//2):
if S[i] != S[i+len(S)//2]:
print('NO')
exit()
print('YES')
|
N = int(input())
S = list(input())
if len(S)%2 == 1:
print('No')
exit()
if len(S)%2 == 0:
for i in range(len(S)//2):
if S[i] != S[i+len(S)//2]:
print('No')
exit()
print('Yes')
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 663,197
| 663,198
|
u082550248
|
python
|
p02860
|
n = int(input())
s = input()
le = len(s)
if le %2 != 0:
print("No")
exit()
st1 = s[:le//2]
st2 = s[le//2:]
if st1 == st2:
print("yes")
else:
print("No")
exit()
|
n = int(input())
s = input()
le = len(s)
if le %2 != 0:
print("No")
exit()
st1 = s[:le//2]
st2 = s[le//2:]
if st1 == st2:
print("Yes")
else:
print("No")
exit()
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 663,206
| 663,207
|
u883203948
|
python
|
p02860
|
n = int(input())
s = input()
a = []
b = []
count = 1
for i in s:
if count > (n/2):
a.append(i)
else:
b.append(i)
count += 1
print(a)
if a == b:
print("Yes")
else:
print("No")
|
n = int(input())
s = input()
a = []
b = []
count = 1
for i in s:
if count > (n/2):
a.append(i)
else:
b.append(i)
count += 1
if a == b:
print("Yes")
else:
print("No")
|
[
"call.remove"
] | 663,208
| 663,209
|
u138781768
|
python
|
p02860
|
n = int(input())
s = input()
a = []
b = []
count = 0
for i in s:
if count > (n//2) + 1:
a.append(i)
else:
b.append(i)
count += 1
if a == b:
print("Yes")
else:
print("No")
|
n = int(input())
s = input()
a = []
b = []
count = 1
for i in s:
if count > (n/2):
a.append(i)
else:
b.append(i)
count += 1
if a == b:
print("Yes")
else:
print("No")
|
[
"literal.number.integer.change",
"assignment.value.change",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 663,210
| 663,209
|
u138781768
|
python
|
p02860
|
n = int(input())
s = input()
a = []
b = []
count = 0
for i in s:
if count > (n//2):
a.append(i)
else:
b.append(i)
count += 1
if a == b:
print("Yes")
else:
print("No")
|
n = int(input())
s = input()
a = []
b = []
count = 1
for i in s:
if count > (n/2):
a.append(i)
else:
b.append(i)
count += 1
if a == b:
print("Yes")
else:
print("No")
|
[
"literal.number.integer.change",
"assignment.value.change",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 663,211
| 663,209
|
u138781768
|
python
|
p02860
|
N=int(input())
S=input()
if N%2==1:
print("No")
if S[:N//2]==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")
|
[] | 663,212
| 663,213
|
u236592202
|
python
|
p02860
|
N=int(input())
S=input()
if N%2!=0:
print("No")
if S[:N//2]==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")
|
[] | 663,214
| 663,213
|
u236592202
|
python
|
p02860
|
n = int(input())
s = input()
s_length = len(s)
if s[: s_length // 2] == s[s_length // 2]:
print('Yes')
else:
print('No')
|
n = int(input())
s = input()
s_length = len(s)
if s[: s_length // 2] == s[s_length // 2:]:
print('Yes')
else:
print('No')
|
[
"control_flow.branch.if.condition.change"
] | 663,223
| 663,224
|
u251075661
|
python
|
p02860
|
n = int(input())
s = int(input())
s_length = len(s)
if s[: s_length // 2] == s[s_length // 2]:
print('Yes')
else:
print('No')
|
n = int(input())
s = input()
s_length = len(s)
if s[: s_length // 2] == s[s_length // 2:]:
print('Yes')
else:
print('No')
|
[
"call.remove",
"call.arguments.change",
"control_flow.branch.if.condition.change"
] | 663,225
| 663,224
|
u251075661
|
python
|
p02860
|
import sys
input = sys.stdin.readline
def main():
n_half = int(input()) // 2
s = input().strip('\n')
if n_half > 0 and s[0:n_half] == s[:-n_half]:
print('Yes')
else:
print('No')
if __name__ == '__main__':
main()
|
import sys
input = sys.stdin.readline
def main():
n_half = int(input()) // 2
s = input().strip('\n')
if n_half > 0 and s[0:n_half] == s[n_half:]:
print('Yes')
else:
print('No')
if __name__ == '__main__':
main()
|
[
"control_flow.branch.if.condition.change"
] | 663,240
| 663,241
|
u250583425
|
python
|
p02860
|
N = int(input())
S = input()
if N % 2 != 0 or S[:len(S) // 2] != S[len(S) // 2:]:
print('NO')
else:
print('YES')
|
N = int(input())
S = input()
if N % 2 != 0 or S[:len(S) // 2] != S[len(S) // 2:]:
print('No')
else:
print('Yes')
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 663,261
| 663,262
|
u381959472
|
python
|
p02860
|
n = int(input())
s = input()
print("YNoes"[s[0:int(n/2)] != s[int(n/2):n]::2])
|
n = int(input())
s = input()
print("YNeos"[s[0:int(n/2)] != s[int(n/2):n]::2])
|
[
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 663,271
| 663,272
|
u891934544
|
python
|
p02860
|
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')
|
[
"call.remove"
] | 663,279
| 663,280
|
u625729943
|
python
|
p02860
|
n = int(input())
p = int(n/2)
c = input()
if(n % 2 is 0):
if(c[:p] == c[p:]):
print("Yes")
exit
print("No")
|
n = int(input())
p = int(n/2)
c = input()
if(n % 2 is 0 and c[:p] == c[p:]):
print("Yes")
else:
print("No")
|
[
"control_flow.branch.if.condition.change"
] | 663,296
| 663,297
|
u089230684
|
python
|
p02860
|
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')
|
[
"call.remove"
] | 663,298
| 663,299
|
u617440820
|
python
|
p02860
|
# coding: utf-8
n = int(input())
s = input()
if n % 2:
print('No')
else:
if s[0:(n/2)] == s[(n/2):n]:
print('Yes')
else:
print('No')
|
# coding: utf-8
n = int(input())
s = input()
if n % 2:
print('No')
else:
if s[0:int(n/2)] == s[int(n/2):n]:
print('Yes')
else:
print('No')
|
[
"call.add",
"control_flow.branch.if.condition.change"
] | 663,304
| 663,305
|
u505834829
|
python
|
p02860
|
N=int(input())
S =input()
if N%2==0:
T=S[0:N//2]
if T==S[N//2:]:
print("Yes")
else:
print("NO")
else:
print("NO")
|
N=int(input())
S =input()
if N%2==0:
T=S[0:N//2]
if T==S[N//2:]:
print("Yes")
else:
print("No")
else:
print("No")
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 663,352
| 663,353
|
u498487134
|
python
|
p02860
|
n = int(input())//2
s = input()
print('yes' if s[:n] == s[n:] else 'no')
|
n = int(input())//2
s = input()
print('Yes' if s[:n] == s[n:] else 'No')
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 663,360
| 663,361
|
u781021311
|
python
|
p02860
|
n = int(input())
s=input()
if n%2!=0:
print('NO')
else:
if s[:int(n/2)] == s[int(n/2):]:
print('YES')
else:
print('NO')
|
n = int(input())
s=input()
if n%2!=0:
print('No')
else:
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"
] | 663,364
| 663,365
|
u278792700
|
python
|
p02860
|
N=input()
S=list(input())
if N%2!=0:
print('No')
else:
if S[:N/2]==S[N/2:]:
print('Yes')
else:
print('No')
|
N=int(input())
S=list(input())
if N%2!=0:
print('No')
else:
if S[:N//2]==S[N//2:]:
print('Yes')
else:
print('No')
|
[
"call.add",
"call.arguments.change",
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 663,387
| 663,388
|
u842964692
|
python
|
p02860
|
N = int(input())
S = input()
s1 = list()
s2 = list()
if N % 2 == 1:
print("No")
else:
for i in range(N//2):
s1.append(S[i])
for i in range(N//2+1,N):
s2.append(S[i])
if s1 == s2:
print("Yes")
else:
print("No")
|
N = int(input())
S = input()
s1 = list()
s2 = list()
if N % 2 == 1:
print("No")
else:
for i in range(N//2):
s1.append(S[i])
for i in range(N//2,N):
s2.append(S[i])
if s1 == s2:
print("Yes")
else:
print("No")
|
[
"expression.operation.binary.remove"
] | 663,400
| 663,401
|
u434872492
|
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")
|
[
"control_flow.branch.if.condition.change"
] | 663,404
| 663,405
|
u972892985
|
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"
] | 663,458
| 663,459
|
u242798309
|
python
|
p02860
|
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')
|
[
"assignment.add"
] | 663,468
| 663,469
|
u640319601
|
python
|
p02860
|
n=int(input())
t=input()
T=list(t)
num=n/2
if T[0:num]==T[num:6]:
print("Yes")
else:
print("No")
|
n=int(input())
t=input()
T=list(t)
num=round(n/2)
if T[0:num]==T[num:n]:
print("Yes")
else:
print("No")
|
[
"call.add",
"call.arguments.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 663,472
| 663,471
|
u503294750
|
python
|
p02860
|
# coding: utf-8
N=int(input())
S=input()
if S[:N/2]==S[N/2:]: print("Yes")
else: print("No")
|
# coding: utf-8
N=int(input())
S=input()
if S[:int(N/2)]==S[int(N/2):]: print("Yes")
else: print("No")
|
[
"control_flow.branch.if.condition.change",
"call.add"
] | 663,478
| 663,479
|
u216136179
|
python
|
p02860
|
n = int(input())
s = input()
if len(s)%2 != 0: print("No")
else:
c = n//2
t = s[:c]
print(t)
if 2*t ==s:
print("Yes")
else: print("No")
|
n = int(input())
s = input()
if len(s)%2 != 0: print("No")
else:
c = n//2
t = s[:c]
if 2*t ==s:
print("Yes")
else: print("No")
|
[
"call.remove"
] | 663,480
| 663,481
|
u181195295
|
python
|
p02860
|
n = int(input())
s = input()
if len(s)%2 != 0: print("No")
else:
c = n//2+1
t = s[:c]
if 2*t ==s:
print("Yes")
else: print("No")
|
n = int(input())
s = input()
if len(s)%2 != 0: print("No")
else:
c = n//2
t = s[:c]
if 2*t ==s:
print("Yes")
else: print("No")
|
[
"expression.operation.binary.remove"
] | 663,482
| 663,481
|
u181195295
|
python
|
p02860
|
import sys
n=int(input())
s = list(input())
ans = 0
if n % 2 != 0:
print("No")
sys.exit()
for i in range(n//2 - 1):
if s[i] != s[i+n//2+1]:
ans = 1
if ans == 0:
print("Yes")
else:
print("No")
|
import sys
n=int(input())
s = list(input())
ans = 0
if n % 2 != 0:
print("No")
sys.exit()
for i in range(n//2 ):
if s[i] != s[i+n//2]:
ans = 1
if ans == 0:
print("Yes")
else:
print("No")
|
[
"expression.operation.binary.remove",
"control_flow.loop.for.condition.change"
] | 663,494
| 663,495
|
u738898077
|
python
|
p02860
|
N = int(input())
S = str(input())
if S[0:N * 0.5] * 2 == S:
print("Yes")
else:
print("No")
|
N = int(input())
S = str(input())
if S[0:N//2] * 2 == S:
print("Yes")
else:
print("No")
|
[] | 663,499
| 663,500
|
u546686251
|
python
|
p02860
|
N = int(input())
S = str(input())
if S[0:N/2] * 2 == S:
print("Yes")
else:
print("No")
|
N = int(input())
S = str(input())
if S[0:N//2] * 2 == S:
print("Yes")
else:
print("No")
|
[
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 663,501
| 663,500
|
u546686251
|
python
|
p02860
|
N = int(input())
S = input()
if len(S) % 2 != 0:
print("No")
else:
if S[:(len(S) / 2)] == S[(len(S) / 2) :]:
print("Yes")
else:
print("No")
|
N = int(input())
S = input()
if len(S) % 2 != 0:
print("No")
else:
if S[:(len(S) // 2)] == S[(len(S) // 2) :]:
print("Yes")
else:
print("No")
|
[
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 663,514
| 663,515
|
u241190159
|
python
|
p02860
|
N = int(input())
S = input()
if N % 2 == 1:
print('No')
N = int(N / 2)
s = S[:N]
if s + s == S:
print('Yes')
else:
print('No')
|
N = int(input())
S = input()
if N % 2 == 1:
print('No')
exit()
N = int(N / 2)
s = S[:N]
if s + s == S:
print('Yes')
else:
print('No')
|
[
"call.add"
] | 663,526
| 663,527
|
u399779657
|
python
|
p02860
|
N = int(input())
S = int(input())
if N % 2 != 0:
print("No")
else:
arr = list(S)
s_len = len(arr) // 2
if arr[s_len:] == arr[:s_len]:
print("Yes")
else:
print("No")
|
N = int(input())
S = input()
if N % 2 != 0:
print("No")
else:
arr = list(S)
s_len = len(arr) // 2
if arr[s_len:] == arr[:s_len]:
print("Yes")
else:
print("No")
|
[
"call.remove",
"call.arguments.change"
] | 663,528
| 663,529
|
u105302073
|
python
|
p02860
|
N=int(input())
S=input()
ans=0
if N%2==0:
for i in range(N/2):
if S[i]==S[i+(N/2)]:
ans+=1
if ans==N/2:
print('Yes')
else:
print('No')
|
N=int(input())
S=input()
ans=0
if N%2==0:
for i in range(N//2):
if S[i]==S[i+(N//2)]:
ans+=1
if ans==N/2:
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"
] | 663,532
| 663,533
|
u735175408
|
python
|
p02860
|
N=int(input())
S=input()
ans=0
if N%2==0:
for i in range(N/2):
if S[i]==S[i+N/2]:
ans+=1
if ans==N/2:
print('Yes')
else:
print('No')
|
N=int(input())
S=input()
ans=0
if N%2==0:
for i in range(N//2):
if S[i]==S[i+(N//2)]:
ans+=1
if ans==N/2:
print('Yes')
else:
print('No')
|
[
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change",
"control_flow.branch.if.condition.change",
"variable_access.subscript.index.change"
] | 663,534
| 663,533
|
u735175408
|
python
|
p02860
|
N = int(input(""))
S = input("")
if N % 2 != 0:
print("NO")
else:
center = N // 2
for i in range(0,center):
if S[i] != S[i+center]:
print("No")
break
if i == center-1:
print("Yes")
|
N = int(input(""))
S = input("")
if N % 2 != 0:
print("No")
else:
center = N // 2
for i in range(0,center):
if S[i] != S[i+center]:
print("No")
break
if i == center-1:
print("Yes")
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 663,535
| 663,536
|
u026962893
|
python
|
p02860
|
# -*- coding:utf-8 -*-
#ε
₯ε
n = int(input())
s = input()
if n == 1:
flag = 0
else:
for i in range(n):
if (s[:i] == s[i:]):
print("YES")
flag = 1
exit()
else:
flag = 0
if flag == 0 :
print("NO")
|
# -*- coding:utf-8 -*-
#ε
₯ε
n = int(input())
s = input()
if n == 1:
flag = 0
else:
for i in range(n):
if (s[:i] == s[i:]):
print("Yes")
flag = 1
exit()
else:
flag = 0
if flag == 0 :
print("No")
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 663,539
| 663,540
|
u319609701
|
python
|
p02860
|
n = int(input())
st = input()
if len(st) == 1:
print("No")
elif n % 2 == 0:
print("No")
else:
first = st[n//2:]
last = st[:n//2]
if first == last:
print("Yes")
else:
print("No")
|
n = int(input())
st = input()
if len(st) == 1:
print("No")
elif n % 2 != 0:
print("No")
else:
first = st[n//2:]
last = st[:n//2]
if first == last:
print("Yes")
else:
print("No")
|
[
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 663,545
| 663,546
|
u223191054
|
python
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.