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 |
|---|---|---|---|---|---|---|---|
p02730 | S = input()
N = len(S)
isPal = lambda s: s == s[::-1]
print("Yes" if isPal(S[:(N-1)//2]) and isPal(S[(N+1)//2:]) else "No")
| S = input()
N = len(S)
isPal = lambda s: s == s[::-1]
print("Yes" if isPal(S) and isPal(S[:(N-1)//2]) and isPal(S[(N+1)//2:]) else "No")
| [] | 507,363 | 507,364 | u570944601 | python |
p02730 | S = input()
N = len(S)
isPal = lambda s: s == s[::-1]
print("Yes" if isPal(S[:(N-1)//2]) and isPal(S[(N-1)//2:]) else "No") | S = input()
N = len(S)
isPal = lambda s: s == s[::-1]
print("Yes" if isPal(S) and isPal(S[:(N-1)//2]) and isPal(S[(N+1)//2:]) else "No")
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 507,365 | 507,364 | u570944601 | python |
p02730 | import math
def jds(strin):
js = 0
newSt = strin[::-1]
if strin == newSt:
js +=1
return js
a = input()
jud = 0
leee = len(a)
if leee % 2 == 0:
b = a[:math.ceil((len(a) - 1) / 2)]
c = a[math.floor((len(a) + 1) / 2):]
else:
b = a[:int((len(a) - 1) / 2)]
c = a[int((len(a) + 2) ... | import math
def jds(strin):
js = 0
newSt = strin[::-1]
if strin == newSt:
js +=1
return js
a = input()
jud = 0
leee = len(a)
if leee % 2 == 0:
b = a[:math.ceil((len(a) - 1) / 2)]
c = a[math.floor((len(a) + 1) / 2):]
else:
b = a[:int((len(a) - 1) / 2)]
c = a[int((len(a) + 2) ... | [
"call.remove"
] | 507,366 | 507,367 | u938051273 | python |
p02730 | S = input()
N = len(S)
if S == S[::-1] and S[:(N-1)//2] == S[:(N-1)//2:-1] and S[(N+1)//2:] == S[(N+1)//2::-1] :
print('Yes')
else:
print('No')
| S = input()
N = len(S)
if S == S[::-1] and S[:(N-1)//2] == S[(N-3)//2::-1] and S[(N+1)//2:] == S[:(N-1)//2:-1] :
print('Yes')
else:
print('No')
| [
"control_flow.branch.if.condition.change",
"literal.number.integer.change",
"variable_access.subscript.index.change",
"misc.opposites",
"expression.operator.arithmetic.change"
] | 507,380 | 507,381 | u758973277 | python |
p02730 | def palind(LIST, N):
for i in range(N):
if LIST[i] != LIST[-1-i]:
return False
return True
S = list(input())
n = len(S)
flag = palind(S, n)
front = S[:((n+1)//2-1)]
rear = S[((n+3)//2-1):]
n = len(front)
flag = palind(front, n)
flag = palind(rear, n)
if flag == True:
print('Yes')
else... | def palind(LIST, N):
for i in range(N):
if LIST[i] != LIST[-1-i]:
return False
return True
S = list(input())
n = len(S)
flag = palind(S, n)
front = S[:((n+1)//2-1)]
rear = S[((n+3)//2-1):]
n = len(front)
flag = flag and palind(front, n) and palind(rear, n)
if flag == True:
print('Yes'... | [
"assignment.value.change"
] | 507,389 | 507,390 | u707808519 | python |
p02730 | s=input()
n=len(s)
a=s[:(n-1)//2]
b=s[(n+1)//2:]
if(a==a[::-1] and b==b[::-1]): print("Yes")
else: print("No")
| s=input()
n=len(s)
a=s[:(n-1)//2]
b=s[(n+1)//2:]
if(a==a[::-1] and a==b): print("Yes")
else: print("No")
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 507,401 | 507,402 | u422104747 | python |
p02730 | s = input()
n = len(s)
def ok(string):
N = len(string)
for i in range(N//2):
if string[i] != string[-i-1]:return False
return True
if ok(s[:n//2]) and ok(s[n//2+1:]):print('Yes')
else:print('No') | s = input()
n = len(s)
def ok(string):
N = len(string)
for i in range(N//2):
if string[i] != string[-i-1]:return False
return True
if ok(s[:n//2]) and ok(s[n//2+1:]) and ok(s):print('Yes')
else:print('No') | [
"control_flow.branch.if.condition.change"
] | 507,416 | 507,417 | u818349438 | python |
p02730 | st=input()
def iskaibun(s):
if(s==""):
return 1;
else:
if(s[0]==s[-1]):
return iskaibun(s[1:-1])
else:
return 0
l = len(st)
q = (l-1)//2
st1 = st[0:q]
st2 = st[q+1:]
if(st1 == st2[:-1] and iskaibun(st1)==1 and iskaibun(st2)==1):
print("Yes")
else:
print("No") | st=input()
def iskaibun(s):
if(s==""):
return 1;
else:
if(s[0]==s[-1]):
return iskaibun(s[1:-1])
else:
return 0
l = len(st)
q = (l-1)//2
st1 = st[0:q]
st2 = st[q+1:]
if(st1 == st2[::-1] and iskaibun(st1)==1 and iskaibun(st2)==1):
print("Yes")
else:
print("No") | [
"control_flow.branch.if.condition.change"
] | 507,418 | 507,419 | u013281968 | python |
p02730 | st=input()
def iskaibun(s):
print(s)
if(s==""):
return 1;
else:
if(s[0]==s[-1]):
return iskaibun(s[1:-1])
else:
return 0
l = len(st)
q = (l-1)//2
st1 = st[0:q]
st2 = st[q+1:]
if(st1 == st2[::-1] and iskaibun(st1)==1 and iskaibun(st2)==1):
print("Yes")
else:
print(... | st=input()
def iskaibun(s):
if(s==""):
return 1;
else:
if(s[0]==s[-1]):
return iskaibun(s[1:-1])
else:
return 0
l = len(st)
q = (l-1)//2
st1 = st[0:q]
st2 = st[q+1:]
if(st1 == st2[::-1] and iskaibun(st1)==1 and iskaibun(st2)==1):
print("Yes")
else:
print("No") | [
"call.remove"
] | 507,420 | 507,419 | u013281968 | python |
p02730 | st=input()
def iskaibun(s):
print(s)
if(s==""):
return 1;
else:
if(s[0]==s[-1]):
return iskaibun(s[1:-1])
else:
return 0
l = len(st)
q = (l-1)//2
st1 = st[0:q]
st2 = st[q+1:]
if(st1 == st2[:-1] and iskaibun(st1)==1 and iskaibun(st2)==1):
print("Yes")
else:
print("N... | st=input()
def iskaibun(s):
if(s==""):
return 1;
else:
if(s[0]==s[-1]):
return iskaibun(s[1:-1])
else:
return 0
l = len(st)
q = (l-1)//2
st1 = st[0:q]
st2 = st[q+1:]
if(st1 == st2[::-1] and iskaibun(st1)==1 and iskaibun(st2)==1):
print("Yes")
else:
print("No") | [
"call.remove",
"control_flow.branch.if.condition.change"
] | 507,421 | 507,419 | u013281968 | python |
p02730 | st=input()
def iskaibun(s):
print(s)
if(s==""):
return 1;
else:
if(s[0]==s[-1]):
return iskaibun(s[1:-1])
else:
return 0
l = len(st)
q = (l-1)//2
st1 = st[0:q]
st2 = st[q+1:]
if(st1 == st2[-1] and iskaibun(st1)==1 and iskaibun(st2)==1):
print("Yes")
else:
print("No... | st=input()
def iskaibun(s):
if(s==""):
return 1;
else:
if(s[0]==s[-1]):
return iskaibun(s[1:-1])
else:
return 0
l = len(st)
q = (l-1)//2
st1 = st[0:q]
st2 = st[q+1:]
if(st1 == st2[::-1] and iskaibun(st1)==1 and iskaibun(st2)==1):
print("Yes")
else:
print("No") | [
"call.remove",
"control_flow.branch.if.condition.change"
] | 507,422 | 507,419 | u013281968 | python |
p02730 | s = input()
n = len(s)
l = (n - 1)
r = (n + 3)
if s == s[::-1] and s[0:l] == s[0:l][::-1] and s[r-1:n] == s[r-1:n][::-1]:
print('Yes')
else:
print('No') | # 入力
s = input()
n = len(s)
l = (n - 1) // 2
r = (n + 3) // 2
if s == s[::-1] and s[0:l] == s[0:l][::-1] and s[r-1:n] == s[r-1:n][::-1]:
print('Yes')
else:
print('No') | [
"assignment.change"
] | 507,431 | 507,432 | u648144864 | python |
p02730 | s = input()
s = [c for c in s]
left = s[:len(s)//2]
right = s[len(s)//2+1:]
def check(s):
left = []
right = []
while len(s)>1:
left.append(s.pop(0))
right.append(s.pop())
if left==right:
return True
else:
return False
if check(left)==True and check(right)==T... | s = input()
s = [c for c in s]
left = s[:len(s)//2]
right = s[len(s)//2+1:]
def check(s):
left = []
right = []
while len(s)>1:
left.append(s.pop(0))
right.append(s.pop())
if left==right:
return True
else:
return False
if check(left)==True and check(right)==True ... | [
"control_flow.branch.if.condition.change",
"call.arguments.add"
] | 507,435 | 507,434 | u896726004 | python |
p02730 | s = input()
if len(s) / 2 == 0:
print("No")
exit()
def check(i):
if len(i) % 2 != 0:
i2 = i[len(i) // 2 + 1:len(i)]
else:
i2 = i[len(i) // 2:len(i)]
if i[0:len(i) // 2] == i2[::-1] or len(i2) == 1:
return(True)
return(False)
s2 = s[0:(len(s) - 1) // 2]
s3 = s[(len(s) - ... | s = input()
if len(s) / 2 == 0:
print("No")
exit()
def check(i):
if len(i) % 2 != 0:
i2 = i[len(i) // 2 + 1:len(i)]
else:
i2 = i[len(i) // 2:len(i)]
if i[0:len(i) // 2] == i2[::-1] or len(i) == 1:
return(True)
return(False)
s2 = s[0:(len(s) - 1) // 2]
s3 = s[(len(s) - 1... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 507,441 | 507,442 | u763291354 | python |
p02730 | def judge(s):
for i in range(len(s)//2):
if s[i]!=s[-(i+1)]:
return False
else:
return True
s=input()
if judge(s)==False:
print('No')
else:
if judge(s[:(len(s)-1)//2])==False:
print('No')
else:
if judge(s[(len(s)+3)//2:])==False:
print('No')
else:
print('Yes') | def judge(s):
for i in range(len(s)//2):
if s[i]!=s[-(i+1)]:
return False
else:
return True
s=input()
if judge(s)==False:
print('No')
else:
if judge(s[:(len(s)-1)//2])==False:
print('No')
else:
if judge(s[(len(s)+3)//2-1:])==False:
print('No')
else:
print('Yes') | [
"control_flow.branch.if.condition.change"
] | 507,446 | 507,447 | u163320134 | python |
p02730 | S = input()
N = len(S)
K = (N-1)//2
if S == S[::-1] and S[0:K] == S[0:K:-1]:
print ('Yes')
else:
print ('No') | S = input()
N = len(S)
K = (N-3)//2
if S == S[::-1] and S[0:K] == S[K:0:-1]:
print ('Yes')
else:
print ('No') | [
"literal.number.integer.change",
"assignment.value.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 507,448 | 507,449 | u209313313 | python |
p02730 | S = input()
N = len(S)
K = (N-3)//2
if S == S[::-1] and S[0:K] == S[0:K:-1]:
print ('Yes')
else:
print ('No') | S = input()
N = len(S)
K = (N-3)//2
if S == S[::-1] and S[0:K] == S[K:0:-1]:
print ('Yes')
else:
print ('No') | [
"control_flow.branch.if.condition.change"
] | 507,450 | 507,449 | u209313313 | python |
p02730 | s = input()
def check(s):
if(s==s[::-1]):
return True
else:
return False
n = len(s)
if(check(s[:(n-1)//2])):
if(check(s[((n+3)//2)-1:])):
if(check(2)):
print('Yes')
else:
print('No')
else:
print('No')
else:
print('No') | s = input()
def check(s):
if(s==s[::-1]):
return True
else:
return False
n = len(s)
if(check(s[:(n-1)//2])):
if(check(s[((n+3)//2)-1:])):
if(check(s)):
print('Yes')
else:
print('No')
else:
print('No')
else:
print('No') | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 507,453 | 507,454 | u425236751 | python |
p02730 | s = input()
def check(s):
if(s==s[::-1]):
return True
else:
return False
n = len(s)
if(check(s[:(n-1)//2])):
if(check(s[((n+3)//2)-1:])):
if(check(2)):
print('Yes')
else:
print('No')
else:
print('No')
else:
print('No') | s = input()
def check(s):
if(s==s[::-1]):
return True
else:
return False
n = len(s)
if(check(s[:(n-1)//2])):
if(check(s[((n+3)//2)-1:])):
if(check(s)):
print('Yes')
else:
print('No')
else:
print('No')
else:
print('No') | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 507,455 | 507,454 | u425236751 | python |
p02730 | S = input()
N = len(S)
def kaibun(s,n):
for i in range(n//2):
if(s[i]!=s[n-i-1]):
return false
return true
if(kaibun(S,N) & kaibun(S[0:(N+1)//2-1],N//2) & kaibun(S[N:(N+3)//2-2:-1],N//2)):
print("Yes")
else:
print("No") | S = input()
N = len(S)
def kaibun(s,n):
for i in range(n//2):
if(s[i]!=s[n-i-1]):
return False
return True
if(kaibun(S,N) & kaibun(S[0:(N+1)//2-1],N//2) & kaibun(S[N:(N+3)//2-2:-1],N//2)):
print("Yes")
else:
print("No") | [
"function.return_value.change",
"control_flow.return.add"
] | 507,456 | 507,457 | u528887718 | python |
p02730 | #!usr/bin/env python3
from collections import defaultdict, deque
from heapq import heappush, heappop
from itertools import permutations, accumulate
import sys
import math
import bisect
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS():return [list(x) for ... | #!usr/bin/env python3
from collections import defaultdict, deque
from heapq import heappush, heappop
from itertools import permutations, accumulate
import sys
import math
import bisect
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS():return [list(x) for ... | [
"control_flow.branch.if.condition.change"
] | 507,466 | 507,467 | u585482323 | python |
p02730 | sel='B'
#A
if sel=='A':
N,M=map(int,input().split())
ans=0
ans+=M*(M-1)//2
ans+=N*(N-1)//2
print(ans)
#B
if sel=='B':
def ispal(s):
for i in range(len(s)//2+1):
if s[i]!=s[-(i+1)]:
return False
return True
S=input()
if ispal(S) and ispal(S[:(... | sel='B'
#A
if sel=='A':
N,M=map(int,input().split())
ans=0
ans+=M*(M-1)//2
ans+=N*(N-1)//2
print(ans)
#B
if sel=='B':
def ispal(s):
for i in range(len(s)//2+1):
if s[i]!=s[-(i+1)]:
return False
return True
S=input()
N=len(S)
if ispal(S) a... | [
"assignment.add"
] | 507,468 | 507,469 | u202570162 | python |
p02730 | def check(s: str):
return s == s[::-1]
s = input()
if check(s) and check(s[:(n-1)//2]):
print("Yes")
else:
print("No")
| def check(s: str):
return s == s[::-1]
s = input()
n = len(s)
if check(s) and check(s[:(n-1)//2]):
print("Yes")
else:
print("No")
| [
"assignment.add"
] | 507,474 | 507,475 | u652081898 | python |
p02730 | S = str(input())
N = int(len(S))
x = int((N-1)/2)
y = int((N+3)/2)
a = str(S[:x])
b = str(S[y:N])
reverse_S = ''.join(list(reversed(S)))
reverse_a = ''.join(list(reversed(a)))
reverse_b = ''.join(list(reversed(b)))
if str(S) == str(reverse_S) and str(a) == str(reverse_a) and str(b) == str(reverse_b):
print('Yes')... | S = str(input())
N = int(len(S))
x = int((N-1)/2)
y = int((N+3)/2)
a = str(S[:x])
b = str(S[y:N-1])
reverse_S = ''.join(list(reversed(S)))
reverse_a = ''.join(list(reversed(a)))
reverse_b = ''.join(list(reversed(b)))
if str(S) == str(reverse_S) and str(a) == str(reverse_a) and str(b) == str(reverse_b):
print('Yes... | [
"assignment.change"
] | 507,505 | 507,506 | u039934639 | python |
p02730 | #!/usr/bin/env python
# -*- coding: utf-8 -*-
#
# FileName: B
# CreatedDate: 2020-03-22 20:59:36 +0900
# LastModified: 2020-03-22 21:36:47 +0900
#
import os
import sys
def main():
S = input()
N = len(S)
S_b = S[:(N-1)//2]
S_a = S[(N+1)//2:]
for i in range((N+1)//2-1):
if S[i]!=S[-(i+1)... | #!/usr/bin/env python
# -*- coding: utf-8 -*-
#
# FileName: B
# CreatedDate: 2020-03-22 20:59:36 +0900
# LastModified: 2020-03-22 22:25:25 +0900
#
import os
import sys
def main():
S = input()
N = len(S)
S_b = S[:(N-1)//2]
S_a = S[(N+1)//2:]
for i in range((N+1)//2-1):
if S[i]!=S[-(i+1)... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 507,534 | 507,535 | u326552320 | python |
p02730 | #!/usr/bin/env python
# -*- coding: utf-8 -*-
#
# FileName: B
# CreatedDate: 2020-03-22 20:59:36 +0900
# LastModified: 2020-03-22 21:24:32 +0900
#
import os
import sys
def main():
S = input()
N = len(S)
S_b = S[:(N-1)//2]
S_a = S[(N+3)//2:]
for i in range((N+1)//2-1):
if S[i]!=S[-(i+1)... | #!/usr/bin/env python
# -*- coding: utf-8 -*-
#
# FileName: B
# CreatedDate: 2020-03-22 20:59:36 +0900
# LastModified: 2020-03-22 22:25:25 +0900
#
import os
import sys
def main():
S = input()
N = len(S)
S_b = S[:(N-1)//2]
S_a = S[(N+1)//2:]
for i in range((N+1)//2-1):
if S[i]!=S[-(i+1)... | [
"literal.number.integer.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 507,536 | 507,535 | u326552320 | python |
p02730 | wholeString = input()
firstSub = wholeString[0:int((len(wholeString)-1)/2)]
secondSub = wholeString[int(((len(wholeString)+3)/2)-1):]
if len(wholeString) % 2 == 0 or len(wholeString) < 3 or len(wholeString) > 99:
print("No")
if firstSub == firstSub[::-1] and secondSub == secondSub[::-1] and wholString == wholeString... | wholeString = input()
firstSub = wholeString[0:int((len(wholeString)-1)/2)]
secondSub = wholeString[int(((len(wholeString)+3)/2)-1):]
if len(wholeString) % 2 == 0 or len(wholeString) < 3 or len(wholeString) > 99:
print("No")
if firstSub == firstSub[::-1] and secondSub == secondSub[::-1] and wholeString == wholeStrin... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 507,537 | 507,538 | u660899380 | python |
p02730 | S=input()
sum="Yes"
kai=len(S)
unk=(int(kai)-1)/2
unk1=(int(kai)+3)/2
A=S[0:int(unk)]
B=S[int(unk1):int(kai)]
for i in range(kai//2):
if S[i]!=S[-i-1]:
sum="No"
for i in range(len(A)):
if A[i]!=A[-i-1]:
sum="No"
for i in range(len(B)):
if B[i]!=B[-i-1]:
sum="No"
print(sum) | S=input()
sum="Yes"
kai=len(S)
unk=(int(kai)-1)/2
unk1=(int(kai)+3)/2
A=S[0:int(unk)]
B=S[int(unk1-1):int(kai)]
#print(B)
for i in range(kai//2):
if S[i]!=S[-i-1]:
sum="No"
for i in range(len(A)):
if A[i]!=A[-i-1]:
sum="No"
for i in range(len(B)):
if B[i]!=B[-i-1]:
sum="No"
print(sum) | [
"assignment.change"
] | 507,546 | 507,547 | u833436666 | python |
p02730 | def palindrome(string): return 1 if string==string[::-1] else 0
kaibun=input()
N=len(kaibun)
A=kaibun[0:int((N-1)/2)]
B=kaibun[int((N+3)/2-1):int(N)]
if palindrome(A) & palindrome(B):
print('Yes')
else:
print('No') | def palindrome(string): return 1 if string==string[::-1] else 0
kaibun=input()
N=len(kaibun)
A=kaibun[0:int((N-1)/2)]
B=kaibun[int((N+3)/2-1):int(N)]
if palindrome(kaibun) & palindrome(A) & palindrome(B):
print('Yes')
else:
print('No') | [
"control_flow.branch.if.condition.change"
] | 507,558 | 507,559 | u157876329 | python |
p02730 | def palindrome(string): return 1 if string==string[::-1] else 0
kaibun=input()
N=len(kaibun)
A=kaibun[0:int((N-1)/2)]
B=kaibun[int((N+3)/2-1):int(N)]
if N>=5 & palindrome(A) & palindrome(B):
print('Yes')
else:
print('No') | def palindrome(string): return 1 if string==string[::-1] else 0
kaibun=input()
N=len(kaibun)
A=kaibun[0:int((N-1)/2)]
B=kaibun[int((N+3)/2-1):int(N)]
if palindrome(kaibun) & palindrome(A) & palindrome(B):
print('Yes')
else:
print('No') | [
"control_flow.branch.if.condition.change"
] | 507,560 | 507,559 | u157876329 | python |
p02730 | S = str(input())
N = len(S)
A = S[0:((N-1)//2)]
B = S[(N+3)//2-1:N]
if S == S[::-1] and A == A[::-1] and B == B[::-1]:
print('Yes')
else:
print('no')
#C | S = str(input())
N = len(S)
A = S[0:((N-1)//2)]
B = S[(N+3)//2-1:N]
if S == S[::-1] and A == A[::-1] and B == B[::-1]:
print('Yes')
else:
print('No')
| [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 507,562 | 507,563 | u057668615 | python |
p02730 | s=input()
a=1
for i in range(len(s)):
if(s[i]!=s[-i-1]):
a=0
break
for i in range((len(s)-1)//2):
if(s[i]!=s[(len(s)-3)//2]):
a=0
break
if(a==1):
print("Yes")
else:
print("No") | s=input()
a=1
for i in range(len(s)):
if(s[i]!=s[-i-1]):
a=0
break
for i in range((len(s)-1)//2):
if(s[i]!=s[(len(s)-3)//2-i]):
a=0
break
if(a==1):
print("Yes")
else:
print("No") | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 507,564 | 507,565 | u289036437 | python |
p02730 | s = input()
a=1
for i in range(len(s)):
if(s[i]!=s[-i-1]):
a=0
break
for i in range((len(s)-1)//2):
if(s[i]!=s[(len()-3)//2]):
a=0
if(a==1):
print("Yes")
else:
print("No") | s=input()
a=1
for i in range(len(s)):
if(s[i]!=s[-i-1]):
a=0
break
for i in range((len(s)-1)//2):
if(s[i]!=s[(len(s)-3)//2-i]):
a=0
break
if(a==1):
print("Yes")
else:
print("No") | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"control_flow.break.add"
] | 507,566 | 507,565 | u289036437 | python |
p02730 | S = input()
N = len(S)
str_num = -1
reverse_S = ''
#条件1（Sが回文であるか）
for i in range(-1,-(N+1),-1):
reverse_S = reverse_S + S[i]
if S == reverse_S:
condition1 = 'YES'
else:
condition1 = 'NO'
#条件2
S2 = ''
N2 = int((N-1)/2)
for i in range(N2):
S2 = S2 + S[i]
reverse_S2 = ''
for i in range(-1,-(N2+1),-1):
reve... | S = input()
N = len(S)
str_num = -1
reverse_S = ''
#条件1（Sが回文であるか）
for i in range(-1,-(N+1),-1):
reverse_S = reverse_S + S[i]
if S == reverse_S:
condition1 = 'YES'
else:
condition1 = 'NO'
#条件2
S2 = ''
N2 = int((N-1)/2)
for i in range(N2):
S2 = S2 + S[i]
reverse_S2 = ''
for i in range(-1,-(N2+1),-1):
reve... | [
"control_flow.branch.if.condition.change"
] | 507,567 | 507,568 | u516494592 | python |
p02730 | s = input()
def is_palindrome(s):
return s == s[::-1]
s_len = len(s)
if is_palindrome(s):
if is_palindrome(s[:(s_len-1)//2]):
if is_palindrome(s[(s_len+3)//2-1:]):
print("Yes")
else:
print("No")
| s = input()
def is_palindrome(s):
return s == s[::-1]
s_len = len(s)
if is_palindrome(s) and is_palindrome(s[:(s_len-1)//2]) and is_palindrome(s[(s_len+3)//2-1:]):
print("Yes")
else:
print("No")
| [] | 507,581 | 507,582 | u221149873 | python |
p02730 | ans = "Yes"
s = input()
if s != s[::-1]: # スライスというやつ
ans = "No"
n = len(s) // 2
if s[:n] != s[0:n:-1]:
ans = "No"
print(ans) | ans = "Yes"
s = input()
if s != s[::-1]: # スライスというやつ 全体が回文かどうか
ans = "No"
n = len(s) // 2
if s[:n] != s[n-1::-1]: # 全体が回文は保証されているので片方だけ判定
ans = "No"
print(ans) | [
"control_flow.branch.if.condition.change"
] | 507,592 | 507,593 | u874644572 | python |
p02730 | ans = "Yes"
s = input()
if s != s[::-1]: # スライスというやつ
ans = "No"
n = len(s) // 2
if s[:n] != s[:n:-1]:
ans = "No"
print(ans) | ans = "Yes"
s = input()
if s != s[::-1]: # スライスというやつ 全体が回文かどうか
ans = "No"
n = len(s) // 2
if s[:n] != s[n-1::-1]: # 全体が回文は保証されているので片方だけ判定
ans = "No"
print(ans) | [
"control_flow.branch.if.condition.change"
] | 507,594 | 507,593 | u874644572 | python |
p02730 | text = str(input())
n = len(text)
target = (n-1)//2
print(target)
bef = text[:target]
aft = text[target+1:]
if bef == aft:
print("Yes")
else:
print("No") | text = str(input())
n = len(text)
target = (n-1)//2
bef = text[:target]
aft = text[target+1:]
if bef == aft:
print("Yes")
else:
print("No") | [
"call.remove"
] | 507,603 | 507,604 | u334314337 | python |
p02730 | text = str(input())
n = len(text)
target = (n-1)//2
bef = text[:target]
aft = text[target+1:]
if bef == aft[::-1]:
print("Yes")
else:
print("No") | text = str(input())
n = len(text)
target = (n-1)//2
bef = text[:target]
aft = text[target+1:]
if bef == aft:
print("Yes")
else:
print("No") | [] | 507,605 | 507,604 | u334314337 | python |
p02730 | import math
s = input()
list = list(s)
num = math.floor(len(s)/2)
count = 0
if len(s) == 3:
if list[0] == list[2]:
print("Yes")
else:
print("No")
else:
for i in range(num):
if list[i] == list[len(s) - 1 - i]:
count += 1
else:
print("No")
... | import math
s = input()
list = list(s)
num = math.floor(len(s)/2)
count = 0
if len(s) == 3:
if list[0] == list[2]:
print("Yes")
else:
print("No")
else:
for i in range(num):
if list[i] == list[num+1+i]:
count += 1
else:
print("No")
... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"misc.opposites",
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 507,620 | 507,621 | u753542444 | python |
p02730 | s = input()
n = len(s)
s1 = s[0:len(s)//2]
s2 = s[len(s)//2+1:len(s)]
def reverse(s):
return s[::-1]
def isPalindrome(s):
rev = reverse(s)
if (s == rev):
return True
return False
if isPalindrome(s):
if n % 2 == 0:
print("No")
elif isPalindrome(s1) and isPalindrome(s2):
... | s = input()
n = len(s)
s1 = s[0:len(s)//2]
s2 = s[len(s)//2+1:len(s)]
def reverse(s):
return s[::-1]
def isPalindrome(s):
rev = reverse(s)
if (s == rev):
return True
return False
if isPalindrome(s):
if n % 2 == 0:
print("No")
elif isPalindrome(s1) and isPalindrome(s2):
... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 507,630 | 507,631 | u139282395 | python |
p02730 | s = input()
n = len(s)
s1 = s[0:len(s)//2]
s2 = s[len(s)//2+1:len(s)]
def reverse(s):
return s[::-1]
def isPalindrome(s):
rev = reverse(s)
if (s == rev):
return True
return False
if isPalindrome(s):
if n % 2 == 0:
print("No")
elif isPalindrome(s1) and isPalindrome(s2):
... | s = input()
n = len(s)
s1 = s[0:len(s)//2]
s2 = s[len(s)//2+1:len(s)]
def reverse(s):
return s[::-1]
def isPalindrome(s):
rev = reverse(s)
if (s == rev):
return True
return False
if isPalindrome(s):
if n % 2 == 0:
print("No")
elif isPalindrome(s1) and isPalindrome(s2):
... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 507,632 | 507,631 | u139282395 | python |
p02730 | s = input()
n = len(s)
s1 = s[0:len(s)//2]
s2 = s[len(s)//2+1:len(s)]
def reverse(s):
return s[::-1]
def isPalindrome(s):
rev = reverse(s)
if (s == rev):
return True
return False
if isPalindrome(s):
if n % 2 == 0:
print("No")
elif isPalindrome(s1) and isPalindrome(s2):
... | s = input()
n = len(s)
s1 = s[0:len(s)//2]
s2 = s[len(s)//2+1:len(s)]
def reverse(s):
return s[::-1]
def isPalindrome(s):
rev = reverse(s)
if (s == rev):
return True
return False
if isPalindrome(s):
if n % 2 == 0:
print("No")
elif isPalindrome(s1) and isPalindrome(s2):
... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 507,633 | 507,631 | u139282395 | python |
p02730 | s = input()
n = len(s)
s1 = s[0:len(s)//2]
s2 = s[len(s)//2+1:len(s)]
def reverse(s):
return s[::-1]
def isPalindrome(s):
rev = reverse(s)
if (s == rev):
return True
return False
if isPalindrome(s):
if n % 2 == 0:
print("No")
elif isPalindrome(s1) and isPalindrome(s2):
... | s = input()
n = len(s)
s1 = s[0:len(s)//2]
s2 = s[len(s)//2+1:len(s)]
def reverse(s):
return s[::-1]
def isPalindrome(s):
rev = reverse(s)
if (s == rev):
return True
return False
if isPalindrome(s):
if n % 2 == 0:
print("No")
elif isPalindrome(s1) and isPalindrome(s2):
... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 507,634 | 507,631 | u139282395 | python |
p02730 | # This file is a "Hello, world!" in Python language by CPython for wandbox.
import sys
s = input()
if s != s[::-1]:
print("No")
sys.exit()
index = (int)(len(s) - 1) // 2
s1 = s[0:index]
if s1 != s1[::-1]:
print("No1")
sys.exit()
index1 = (len(s)+3) // 2
s2 = s[index1:-1]
if s2 != s2[::-1]:
print("N... | # This file is a "Hello, world!" in Python language by CPython for wandbox.
import sys
s = input()
if s != s[::-1]:
print("No")
sys.exit()
index = (int)(len(s) - 1) // 2
s1 = s[0:index]
if s1 != s1[::-1]:
print("No")
sys.exit()
index1 = (len(s)+3) // 2
s2 = s[index1:-1]
if s2 != s2[::-1]:
print("No... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 507,651 | 507,652 | u538405269 | python |
p02730 | s = str(input())
s_l = []
for i in range(len(s)):
s_l.append(s[i])
n = len(s) - 1
m = n // 2 - 1
Tsuyoi = True
i = 0
while i <= m // 2:
if s_l[i] != s_l[m - i]:
Tsuyoi = False
break
if s_l[m + i + 2] != s_l[n - i]:
Tsuyoi = False
break
if s_l[i] != s_l[n-i]:
t... | s = str(input())
s_l = []
for i in range(len(s)):
s_l.append(s[i])
n = len(s) - 1
m = n // 2 - 1
Tsuyoi = True
i = 0
while i <= m // 2:
if s_l[i] != s_l[m - i]:
Tsuyoi = False
break
if s_l[m + i + 2] != s_l[n - i]:
Tsuyoi = False
break
if s_l[i] != s_l[n-i]:
T... | [
"assignment.variable.change",
"identifier.change"
] | 507,655 | 507,656 | u955125992 | python |
p02730 | import sys
S=str(input())
N=len(S)
N1=int((N-1)/2)
N2=int((N+3)/2-1)
S1=list(S[:N1])
S2=list(S[N2:])
S3=list(reversed(S1))
S4=list(reversed(S2))
Sr=list(reversed(S))
if S==Sr:
if S1==S3:
if S2==S4:
print("Yes")
sys.exit()
print("No") | import sys
S=list(str(input()))
N=len(S)
N1=int((N-1)/2)
N2=int((N+3)/2-1)
S1=list(S[:N1])
S2=list(S[N2:])
S3=list(reversed(S1))
S4=list(reversed(S2))
Sr=list(reversed(S))
if S==Sr:
if S1==S3:
if S2==S4:
print("Yes")
sys.exit()
print("No")
| [
"call.add",
"call.arguments.change"
] | 507,661 | 507,660 | u111652094 | python |
p02730 | S=input()
ans=1
for i in range((len(S)-1)//2):
if S[i]==S[len(S)-1-i]:
ans*=1
else:
ans*=2
for j in range((len(S)-1)//2):
if S[j]==S[(len(S)-1)//2-j-1]:
ans*=1
else:
ans*=3
if ans==1:
print("Yes")
else:
print("NO") | S=input()
ans=1
for i in range((len(S)-1)//2):
if S[i]==S[len(S)-1-i]:
ans*=1
else:
ans*=2
for j in range((len(S)-1)//2):
if S[j]==S[(len(S)-1)//2-j-1]:
ans*=1
else:
ans*=3
if ans==1:
print("Yes")
else:
print("No") | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 507,666 | 507,667 | u419963262 | python |
p02730 | S = input()
L = list(S)
N = len(L)
revS = list(reversed(L))
preS = L[:int((N - 1) / 2)]
revPreS = list(reversed(preS))
backS = L[int((N + 3) / 2):]
revBackS = list(reversed(backS))
if L != revS:
print("No")
elif preS != revPreS:
print("No")
elif backS != revBackS:
print("No")
else:
print("Yes")
| S = input()
L = list(S)
N = len(L)
revS = list(reversed(L))
preS = L[:int((N - 1) / 2)]
revPreS = list(reversed(preS))
backS = L[int((N + 2) / 2):]
revBackS = list(reversed(backS))
if L != revS:
print("No")
elif preS != revPreS:
print("No")
elif backS != revBackS:
print("No")
else:
print("Yes")
| [
"literal.number.integer.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 507,670 | 507,671 | u261700262 | python |
p02730 | # coding: utf-8
import sys
import math
import collections
import itertools
from inspect import currentframe
INF = 10 ** 10
MOD = 10 ** 9 + 7
def input() : return sys.stdin.readline().strip()
def gcd(x, y) : return y if x % y == 0 else gcd(y, x % y)
def lcm(x, y) : return (x * y) // gcd(x, y)
def I() : return int(input... | # coding: utf-8
import sys
import math
import collections
import itertools
from inspect import currentframe
INF = 10 ** 10
MOD = 10 ** 9 + 7
def input() : return sys.stdin.readline().strip()
def gcd(x, y) : return y if x % y == 0 else gcd(y, x % y)
def lcm(x, y) : return (x * y) // gcd(x, y)
def I() : return int(input... | [] | 507,674 | 507,675 | u309801920 | python |
p02730 | # -*- coding: utf-8 -*-
import sys
S = input()
S_list = list(S)
tmp = S_list.copy()
N = len(S)
if N % 2 == 0:
print("No")
sys.exit()
else: #奇数個
S_list.reverse()
if S_list == tmp:
tmp_2 = int((len(tmp)-1) / 2)
tmp_2_list = tmp[:tmp_2]
t2=tmp_2_list.copy()
tmp_3 = int((len(tmp)+3) / 2)
tm... | # -*- coding: utf-8 -*-
import sys
S = input()
S_list = list(S)
tmp = S_list.copy()
N = len(S)
if N % 2 == 0:
print("No")
sys.exit()
else: #奇数個
S_list.reverse()
if S_list == tmp:
tmp_2 = int((len(tmp)-1) / 2)
tmp_2_list = tmp[:tmp_2]
t2=tmp_2_list.copy()
tmp_3 = int((len(tmp)+3) / 2)
tm... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 507,676 | 507,677 | u321096814 | python |
p02730 | # --*-coding:utf-8-*--
def f(s):
for i in range(len(s)//2):
if s[i] != s[-i-1]:
return False
return True
S = input()
N = len(S)
print('Yes' if f(S[:N//2]) and f(S[N//2+1:]) else 'No')
| # --*-coding:utf-8-*--
def f(s):
for i in range(len(s)//2):
if s[i] != s[-i-1]:
return False
return True
S = input()
N = len(S)
print('Yes' if f(S) and f(S[:N//2]) and f(S[N//2+1:]) else 'No')
| [] | 507,684 | 507,685 | u729417323 | python |
p02730 | s = [str(i) for i in input()]
n = len(s)
sa = s[0:(n-1)//2]
sb = s[(n+1)//2:n]
def palindrome(string):
for i in range(len(string)//2):
if string[i] != string[-i-1]:
return False
return True
if palindrome(sa) and palindrome(sb):
print("Yes")
else:
print("No") | s = [str(i) for i in input()]
n = len(s)
sa = s[0:(n-1)//2]
sb = s[(n+1)//2:n]
def palindrome(string):
for i in range(len(string)//2):
if string[i] != string[-i-1]:
return False
return True
if palindrome(s) and palindrome(sa) and palindrome(sb):
print("Yes")
else:
print("No")
| [
"control_flow.branch.if.condition.change"
] | 507,688 | 507,689 | u970082363 | python |
p02730 | def check(s):
l = len(s)
c = 1
if l != 1:
if l % 2 == 1:
l -= 1
for i in range(int(l/2)):
if s[i] != s[0-1-i]:
c = 0
return c
if __name__ == '__main__':
S = input()
LEN = len(S)
l = int((LEN-1)/2)
r = l+1
s1 = S[0:l]
s2 = S[r:LEN]
c = check(s1) * check(s2)
if c == 1:
print('Yes')
el... | def check(s):
l = len(s)
c = 1
if l != 1:
if l % 2 == 1:
l -= 1
for i in range(int(l/2)):
if s[i] != s[0-1-i]:
c = 0
return c
if __name__ == '__main__':
S = input()
LEN = len(S)
l = int((LEN-1)/2)
r = l+1
s1 = S[0:l]
s2 = S[r:LEN]
c = check(s1) * check(s2) * check(S)
if c == 1:
print... | [
"assignment.change"
] | 507,698 | 507,699 | u053699292 | python |
p02730 | # n,m = map(int, input().split())
s = input()
l = len(s)
f = int((l-1)/2)
b = int((l+3)/2) - 1
# print(f,b)
if s != s[::-1] or s[:f] != s[:f:-1] or s[b:] != s[b:][::-1]:
# print(s[::-1])
print("No")
# if :
# print(s[:f:-1])
# print("No")
# if :
# print(b,":",s[b:][::-1])
# print("No")
print("Yes")
| # n,m = map(int, input().split())
s = input()
l = len(s)
f = int((l-1)/2)
b = int((l+3)/2) - 1
# print(f,b)
if s != s[::-1] or s[:f] != s[:f:-1] or s[b:] != s[b:][::-1]:
# print(s[::-1])
print("No")
else:
print("Yes")
# if :
# print(s[:f:-1])
# print("No")
# if :
# print(b,":",s[b:][::-1])
# print(... | [] | 507,736 | 507,737 | u078307399 | python |
p02730 | S=str(input())
N=len(S)
p=0
a=0
c=0
for i in range(int((N-1)/2)):
if S[i]==S[-i-1]:
p+=1
if p==(N-1)/2:
for i in range(int((N-1)/4)):
T=S[:int((N-1)/2)]
if T[i]==T[-i-1]:
a+=1
if a==int((N-1)/4):
for y in range(int((N-(N+3)/2)/2)):
F=S[... | S=str(input())
N=len(S)
p=0
a=0
c=0
for i in range(int((N-1)/2)):
if S[i]==S[-i-1]:
p+=1
if p==(N-1)/2:
for i in range(int((N-1)/4)):
T=S[:int((N-1)/2)]
if T[i]==T[-i-1]:
a+=1
if a==int((N-1)/4):
for y in range(int((N-(N+3)/2)/2)):
F=S[int(... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 507,738 | 507,739 | u048166300 | python |
p02730 | s = input()
n = len(s)
def is_kai(s):
for i in range(int((len(s)-1)/2)):
if s[i] != s[-i-1]:
return False
return True
if is_kai(s) and is_kai(s[:int((n-1)/2)]):
print('Yes')
else:
print('No') | s = input()
n = len(s)
def is_kai(s):
for i in range(int((len(s))/2)):
if s[i] != s[-i-1]:
return False
return True
if is_kai(s) and is_kai(s[:int((n-1)/2)]):
print('Yes')
else:
print('No') | [
"expression.operation.binary.remove"
] | 507,740 | 507,741 | u595952233 | python |
p02730 | s = input()
n = len(s)
def is_kai(s):
for i in range(int(len(s)/2)):
if s[i] != s[-i-1]:
return False
return True
if is_kai(s) and is_kai(s[:int((n-1)/2)]):
print('Yes')
else:
print('No') | s = input()
n = len(s)
def is_kai(s):
for i in range(int((len(s))/2)):
if s[i] != s[-i-1]:
return False
return True
if is_kai(s) and is_kai(s[:int((n-1)/2)]):
print('Yes')
else:
print('No') | [
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 507,742 | 507,741 | u595952233 | python |
p02730 | def isKaibun(s):
for a, b in zip(s, reversed(s)):
if a != b:
return False
return True
S = list(input())
N = len(S)
if isKaibun(S[:(N-1)//2]) and isKaibun(S[(N+1)//2:]):
print("Yes")
else:
print("No")
| def isKaibun(s):
for a, b in zip(s, reversed(s)):
if a != b:
return False
return True
S = list(input())
N = len(S)
if isKaibun(S) and isKaibun(S[:(N-1)//2]) and isKaibun(S[(N+1)//2:]):
print("Yes")
else:
print("No")
| [
"control_flow.branch.if.condition.change"
] | 507,749 | 507,750 | u978178314 | python |
p02730 | def isKaibun(s):
for a, b in zip(s, reversed(s)):
if a != b:
return False
return True
S = list(input())
N = len(S)
if isKaibun(S[:(N-1)//2]) and isKaibun(S[(N+3)//2:]):
print("Yes")
else:
print("No")
| def isKaibun(s):
for a, b in zip(s, reversed(s)):
if a != b:
return False
return True
S = list(input())
N = len(S)
if isKaibun(S) and isKaibun(S[:(N-1)//2]) and isKaibun(S[(N+1)//2:]):
print("Yes")
else:
print("No")
| [
"control_flow.branch.if.condition.change",
"literal.number.integer.change",
"variable_access.subscript.index.change"
] | 507,752 | 507,750 | u978178314 | python |
p02730 | S=list(input())
res='Yes'
N=len(S)
def ispalindrome(s):
h = len(s) // 2
if (len(s)==2) & (h==1):
if s[0]==s[1]:
return 1
else: return 0
else:
for a, b in zip(s[:h], reversed(s[h+1:])):
if a != b: return 0
return 1
if ispalindrome(S)==0:
res=... | S=list(input())
res='Yes'
N=len(S)
def ispalindrome(s):
h = len(s) // 2
if (len(s)==2) & (h==1):
if s[0]==s[1]:
return 1
else: return 0
else:
for a, b in zip(s[:h], reversed(s[h+1:])):
if a != b: return 0
return 1
if ispalindrome(S)==0:
res=... | [
"literal.number.integer.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 507,753 | 507,754 | u830592648 | python |
p02730 | s = input()
n = len(s)
num = int((n-1)/2)-1
for i in range(num):
if s[i] != s[n-1-i]:
print("No")
exit()
num = int(num /2 -1)
for i in range(num):
if s[i] != s[n-1-i]:
print("No")
exit()
num = int(len(s) * 0.5 - 1.5)
index = int((n + 3) /2 )
for i in range(num):
if s[index+i] != s[n-1-i]:
... | s = input()
n = len(s)
num = int((n-1)/2)-1
for i in range(num):
if s[i] != s[n-1-i]:
print("No")
exit()
num = int(num /2 -1)
for i in range(num):
if s[i] != s[n-1-i]:
print("No")
exit()
num = int(len(s) * 0.5 - 1.5)
index = int((n + 3) /2 -1 )
for i in range(num):
if s[index+i] != s[n-1-i]:... | [
"assignment.change"
] | 507,801 | 507,802 | u878212264 | python |
p02730 | s = input()
n = len(s)
num = int((n-1)/2)-1
for i in range(num):
if s[i] != s[n-1-i]:
print("No")
exit()
num = int(num /2 -1)
for i in range(num):
if s[i] != s[n-1-i]:
print("No")
exit()
num = len(s) * 0.5 - 1.5
index = int((n + 3) /2 )
for i in range(num):
if s[index+i] != s[n-1-i]:
pri... | s = input()
n = len(s)
num = int((n-1)/2)-1
for i in range(num):
if s[i] != s[n-1-i]:
print("No")
exit()
num = int(num /2 -1)
for i in range(num):
if s[i] != s[n-1-i]:
print("No")
exit()
num = int(len(s) * 0.5 - 1.5)
index = int((n + 3) /2 -1 )
for i in range(num):
if s[index+i] != s[n-1-i]:... | [
"call.add",
"call.arguments.change"
] | 507,803 | 507,802 | u878212264 | python |
p02730 | S=(input())
N = len(S)
one = S[0:((N-1)//2)]
two = S[(N+3)//2-1:N]
def check_kai(text):
left = len(text)//2
for i in range(left):
if text[i] != text[len(text)-1-i]:
print('No')
exit(0)
check_kai(one)
check_kai(two)
print('Yes') | S=(input())
N = len(S)
one = S[0:((N-1)//2)]
two = S[(N+3)//2-1:N]
def check_kai(text):
left = len(text)//2
for i in range(left):
if text[i] != text[len(text)-1-i]:
print('No')
exit(0)
check_kai(S)
check_kai(one)
check_kai(two)
print('Yes') | [
"call.add"
] | 507,804 | 507,805 | u069868485 | python |
p02730 | stra = input()
def hantei(s):
for i in range(int(len(s) / 2)):
print(i)
if (s[i] != s[len(s) - 1 - i]):
# print("A")
return False
if (int((len(s) + 3) / 2) - 1 + i < len(s) and s[(int((len(s) + 3) / 2)) - 1 + i] != s[len(s) - 1 - i]):
# print("B")
... | stra = input()
def hantei(s):
for i in range(int(len(s) / 2)):
if (s[i] != s[len(s) - 1 - i]):
# print("A")
return False
if (int((len(s) + 3) / 2) - 1 + i < len(s) and s[(int((len(s) + 3) / 2)) - 1 + i] != s[len(s) - 1 - i]):
# print("B")
return Fal... | [
"call.remove"
] | 507,806 | 507,807 | u284434653 | python |
p02730 | stra = input()
def hantei(s):
for i in range(int(len(s) / 2)):
if (s[i] != s[len(s) - 1 - i]):
return False
if (int((len(s) + 3) / 2) + i < len(s) and s[int((len(s) + 3) / 2) + i] != s[len(s) - 1 - i]):
return False
for i in range(int(len(s) / 4)):
if (s[i] !=... | stra = input()
def hantei(s):
for i in range(int(len(s) / 2)):
if (s[i] != s[len(s) - 1 - i]):
# print("A")
return False
if (int((len(s) + 3) / 2) - 1 + i < len(s) and s[(int((len(s) + 3) / 2)) - 1 + i] != s[len(s) - 1 - i]):
# print("B")
return Fal... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 507,808 | 507,807 | u284434653 | python |
p02730 | s= input()
z=len(s)//2
flag=0
sd=s[0:z-1]
if len(s)==3:
if s[0]==s[2]:
flag=1
else:
if sd==s[z+1:len(s)-1]:
if sd==sd[::-1]:
flag=1
if flag==1:
print("Yes")
else:
print("No") | s= input()
z=len(s)//2
flag=0
sd=s[0:z]
if len(s)==3:
if s[0]==s[2]:
flag=1
else:
if sd==s[z+1:len(s)]:
if sd==sd[::-1]:
flag=1
if flag==1:
print("Yes")
else:
print("No") | [
"expression.operation.binary.remove"
] | 507,813 | 507,814 | u185405877 | python |
p02730 | """
"""
def int_as_array(num): return list(map(int, [y for y in str(num)]))
def array_as_int(arr): return int(''.join(map(str, arr)))
def read_int(): return int(input())
def read_array(): return list(map(int, input().split(' ')))
def array_to_string(arr, sep=' '): return sep.join(map(str, arr))
def matrix_t... | """
"""
def int_as_array(num): return list(map(int, [y for y in str(num)]))
def array_as_int(arr): return int(''.join(map(str, arr)))
def read_int(): return int(input())
def read_array(): return list(map(int, input().split(' ')))
def array_to_string(arr, sep=' '): return sep.join(map(str, arr))
def matrix_t... | [
"literal.number.integer.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 507,823 | 507,824 | u004271495 | python |
p02730 | def main():
S = input()
len_s = len(S)
flag = False
if S == S[::-1]:
if S[len_s // 2] == S[len_s // 2:-1:-1]:
if S[len_s // 2:] == S[-1:len_s // 2:-1]:
flag = True
if flag:
print('Yes')
else:
print('No')
if __name__ == '__main__':
main() | def main():
S = input()
len_s = len(S)
flag = False
if S == S[::-1]:
if S[0:len_s // 2] == S[len_s // 2 - 1::-1]:
if S[len_s // 2 + 1:] == S[-1:len_s // 2:-1]:
flag = True
# print(S[0:len_s // 2], S[len_s // 2 - 1::-1])
# print(S[len_s // 2 + 1:], S[-1:len_s /... | [
"control_flow.branch.if.condition.change"
] | 507,829 | 507,830 | u472197237 | python |
p02730 | def parindrome(s):
print(s)
if s[::] == s[::-1]:
return True
return False
def string_parindrome(s):
if parindrome(s):
N = len(s)
if parindrome(s[:((N-1)//2):]) and parindrome(s[((N+3)//2)-1::]):
return "Yes"
return "No"
S = input()
print(string_parindrome(S... | def parindrome(s):
if s[::] == s[::-1]:
return True
return False
def string_parindrome(s):
if parindrome(s):
N = len(s)
if parindrome(s[:((N-1)//2):]) and parindrome(s[((N+3)//2)-1::]):
return "Yes"
return "No"
S = input()
print(string_parindrome(S))
| [
"call.remove"
] | 507,834 | 507,835 | u498202416 | python |
p02730 | def isPalin(s):
return s[::-1]==s
s=input()
n=len(s)
n1,n2=(n-1)//2,(n+3)//2
a,b=s[:n1],s[n2-1:]
#print(a,b)
if isPalin(a) and isPalin(b) and len(s)%2!=0:
print("Yes")
else:
print("No") | def isPalin(s):
return s[::-1]==s
s=input()
n=len(s)
n1,n2=(n-1)//2,(n+3)//2
a,b=s[:n1],s[n2-1:]
#print(a,b)
if isPalin(a) and isPalin(b) and len(s)%2!=0 and isPalin(s):
print("Yes")
else:
print("No") | [
"control_flow.branch.if.condition.change"
] | 507,836 | 507,837 | u501278784 | python |
p02730 | def kaibun(s):
N = len(s)
flag = True
for i in range(N // 2):
if s[i] != s[N - i - 1]:
flag = False
return flag
string = input()
N = len(string)
if kaibun(string) and kaibun(string[:(N - 3) // 2]) and kaibun(string[(N + 1) // 2:N - 1]):
print('Yes')
else:
print('No')
| def kaibun(s):
N = len(s)
flag = True
for i in range(N // 2):
if s[i] != s[N - i - 1]:
flag = False
return flag
string = input()
N = len(string)
if kaibun(string) and kaibun(string[:(N - 1) // 2]) and kaibun(string[(N + 1) // 2:N]):
print('Yes')
else:
print('No')
| [
"literal.number.integer.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 507,847 | 507,848 | u837340160 | python |
p02730 | S = input()
N = len(S)
flag = True
for i in range(int(len(S)/2)):
if S[i]!=S[-1-i]:
flag = False
breakat
if flag==True:
right = int((N-1) / 2)
subS = S[0:right]
for i in range(int(len(subS)/2)):
if subS[i]!=subS[-1-i]:
flag = False
break
if flag==True:
left = int((N+3) / 2)
subS ... | S = input()
N = len(S)
flag = True
for i in range(int(len(S)/2)):
if S[i]!=S[-1-i]:
flag = False
break
if flag==True:
right = int((N-1) / 2)
subS = S[0:right]
for i in range(int(len(subS)/2)):
if subS[i]!=subS[-1-i]:
flag = False
break
if flag==True:
left = int((N+3) / 2)
subS = ... | [
"control_flow.break.add"
] | 507,853 | 507,854 | u171077406 | python |
p02730 | s=input()
n=len(s)+1
a=s[0:int((n-1)/2)]
b=s[int((n+3)/2)-1:n-1]
print(a,b)
if a==b:
print('Yes')
else:
print('No') | s=input()
n=len(s)+1
a=s[0:int((n-1)/2)]
b=s[int((n+3)/2)-1:n-1]
if a==b:
print('Yes')
else:
print('No') | [
"call.remove"
] | 507,861 | 507,862 | u395894569 | python |
p02730 | s=list(input())
N=len(s)
if N==3:
if s[0]==s[2]:
print("Yes")
else:
print("No")
else:
tmp=s[0:int((N-1)/2)+1]
tmp_rev=tmp[::-1]
tmp2=s[int((N+3)/2)-1:]
tmp2_rev=tmp2[::-1]
if tmp==tmp_rev and tmp2==tmp2_rev and s==s[::-1]:
print("Yes")
else:
print("No") | s=list(input())
N=len(s)
if N==3:
if s[0]==s[2]:
print("Yes")
else:
print("No")
else:
tmp=s[0:int((N-1)/2)]
tmp_rev=tmp[::-1]
tmp2=s[int((N+3)/2)-1:]
tmp2_rev=tmp2[::-1]
if tmp==tmp_rev and tmp2==tmp2_rev and s==s[::-1]:
print("Yes")
else:
print("No") | [
"expression.operation.binary.remove"
] | 507,865 | 507,866 | u314837274 | python |
p02730 | import sys
input = sys.stdin.readline
S = input()
Sr=''.join(list(reversed(S)))
N=len(S)
S1=S[:int((N-1)/2)]
S1r=''.join(list(reversed(S1)))
S2=S[int((N+3)/2)-1:]
S2r=''.join(list(reversed(S2)))
if S==Sr and S1 ==S1r and S2==S2r:
print('Yes')
else:
print('No') | import sys
input = sys.stdin.readline
S = input().strip()
Sr=''.join(list(reversed(S)))
N=len(S)
S1=S[:int((N-1)/2)]
S1r=''.join(list(reversed(S1)))
S2=S[int((N+3)/2)-1:]
S2r=''.join(list(reversed(S2)))
if S==Sr and S1 ==S1r and S2==S2r:
print('Yes')
else:
print('No') | [
"call.add"
] | 507,867 | 507,868 | u680190333 | python |
p02730 | S = input()
N = len(S)
kai = []
kai2 = []
kai3 = []
rev = []
rev2 = []
rev3 = []
for i in range(N):
kai.append(S[i])
for i in range(0, int((N - 1) / 2)):
kai2.append(S[i])
for i in range(int((N + 3) / 2) - 1, N):
kai3.append(S[i])
kai.reverse
kai2.reverse
kai3.reverse
for i in range(N):
rev.append(S[i])
f... | S = input()
N = len(S)
kai = []
kai2 = []
kai3 = []
rev = []
rev2 = []
rev3 = []
for i in range(N):
kai.append(S[i])
for i in range(0, int((N - 1) / 2)):
kai2.append(S[i])
for i in range(int((N + 3) / 2) - 1, N):
kai3.append(S[i])
kai.reverse()
kai2.reverse()
kai3.reverse()
for i in range(N):
rev.append(S[... | [
"call.add"
] | 507,875 | 507,876 | u692687119 | python |
p02730 | def main():
S = input()
N = len(S)
if check(S[:(N-1)//2]) and check(S[(N+3)//2-1:]):
print("Yes")
else:
print("No")
def check(s):
for i in range(len(s) // 2):
c1 = s[i]
c2 = s[-(i+1)]
if c1 != c2:
return False
return True
main()
| def main():
S = input()
N = len(S)
if check(S) and check(S[:(N-1)//2]) and check(S[(N+3)//2-1:]):
print("Yes")
else:
print("No")
def check(s):
#print(s)
for i in range(len(s) // 2):
c1 = s[i]
c2 = s[-(i+1)]
if c1 != c2:
return False
retu... | [
"control_flow.branch.if.condition.change"
] | 507,877 | 507,878 | u006883624 | python |
p02730 | def pal(string):
return True if string==string[::-1] else False
S = input()
if palindrome(S) and palindrome(S[0:int((len(S)-1)/2)]) and palindrome(S[int((len(S)+3)/2)-1:]):
print('Yes')
else:
print('No') | def pal(string):
return True if string==string[::-1] else False
S = input()
if pal(S) and pal(S[0:int((len(S)-1)/2)]) and pal(S[int((len(S)+3)/2)-1:]):
print('Yes')
else:
print('No') | [
"identifier.change",
"call.function.change",
"control_flow.branch.if.condition.change"
] | 507,886 | 507,887 | u572425901 | python |
p02730 | def palindrome(string): return 1 if string == string[::-1] else 0
s = input()
N = len(s)
# print(s[0:(N - 1) // 2])
# print(s[(N + 3) // 2 - 1:N])
if palindrome(s[0:(N - 1) // 2]) and palindrome(s[(N + 3) // 2 - 1:N]):
print("Yes")
else:
print("No")
| def palindrome(string): return 1 if string == string[::-1] else 0
s = input()
N = len(s)
# print(s[0:(N - 1) // 2])
# print(s[(N + 3) // 2 - 1:N])
if palindrome(s[0:(N - 1) // 2]) and palindrome(s[(N + 3) // 2 - 1:N]) and palindrome(s):
print("Yes")
else:
print("No")
| [
"control_flow.branch.if.condition.change"
] | 507,890 | 507,891 | u118211443 | python |
p02730 | import copy
S = list(input())
N = len(S)
ReS = copy.copy(S)
o = 1
for i in S:
ReS[N-o] = i
o += 1
if S == reversed(S):
print("Yes")
if S == ReS:
if S[0:int((N-1)/2)] == ReS[int((N+1)/2): N]:
if S[int(N+1/2): N] == ReS[0:int((N-1)/2)]:
print("Yes")
else:
print("No"... | import copy
S = list(input())
N = len(S)
ReS = copy.copy(S)
o = 1
for i in S:
ReS[N-o] = i
o += 1
if S == reversed(S):
print("Yes")
if S == ReS:
if S[0:int((N-1)/2)] == ReS[int((N+1)/2): N]:
if S[int((N+1)/2): N] == ReS[0:int((N-1)/2)]:
print("Yes")
else:
print("N... | [
"control_flow.branch.if.condition.change"
] | 507,896 | 507,897 | u559250296 | python |
p02730 | # coding: utf-8
def check(string):
if (string[::-1] == string):
return True
return False
string = input()
mid = int((len(string)-1)/2)
if check(string[:mid]) and check(string[mid+1:]):
print("Yes")
else:
print("No") | # coding: utf-8
def check(string):
if (string[::-1] == string):
return True
return False
string = input()
mid = int((len(string)-1)/2)
if check(string) and check(string[:mid]) and check(string[mid+1:]):
print("Yes")
else:
print("No") | [
"control_flow.branch.if.condition.change"
] | 507,905 | 507,906 | u777777129 | python |
p02730 | s = input()
n = len(s)
def f(s):
n = len(s)
if n % 2 == 0:
return list(s[:n // 2]) == list(reversed(s[n // 2:]))
else:
return list(s[:n // 2]) == list(reversed(s[n // 2 + 1:]))
if f(s) and f(s[:(n - 1)//2]) and f(s[(n + 3) // 2:]):
print('Yes')
else:
print('No')
| s = input()
n = len(s)
def f(s):
n = len(s)
if n % 2 == 0:
return list(s[:n // 2]) == list(reversed(s[n // 2:]))
else:
return list(s[:n // 2]) == list(reversed(s[n // 2 + 1:]))
if f(s) and f(s[:(n - 1)//2]) and f(s[(n + 3) // 2 - 1:]):
print('Yes')
else:
print('No')
| [
"control_flow.branch.if.condition.change"
] | 507,937 | 507,938 | u556672233 | python |
p02730 | s = list(input())
n = len(s)
flag = 1
c = int((n - 1) / 2)
for i in range(c):
if s[i] != s[n - 1 - i]:
flag = 0
break
if flag:
c2 = int(c / 2)
for i in range(c2):
if s[i] != s[c2 - 1 - i]:
flag = 0
break
if flag:
print('Yes')
else :
print('No') | s = list(input())
n = len(s)
flag = 1
c = int((n - 1) / 2)
for i in range(c):
if s[i] != s[n - 1 - i]:
flag = 0
break
if flag:
c2 = int(c / 2)
for i in range(c2):
if s[i] != s[c - 1 - i]:
flag = 0
break
if flag:
print('Yes')
else :
print('No') | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 507,957 | 507,958 | u277953073 | python |
p02730 | S = input()
end = len(S)
half = int(end/2)
for i in range(0,half):
if S[i] is not S[half-1-i]:
print("NO")
exit()
S1 = S[0:half]
S2 = S[half+1:end]
if S1 == S2:
print("YES")
else:
print("NO") | S = input()
end = len(S)
half = int(end/2)
for i in range(0,half):
if S[i] is not S[half-1-i]:
print("No")
exit()
S1 = S[0:half]
S2 = S[half+1:end]
if S1 == S2:
print("Yes")
else:
print("No") | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 507,965 | 507,966 | u787131053 | python |
p02730 | import math
import sys
s = input()
if s==s[::-1]:
n = len(s)
right = int((n-1)/2)
print(right)
tmp = s[:right]
if tmp == tmp[::-1]:
left = int((n+3)/2)
tmp2 = s[left-1:]
if tmp2 == tmp2[::-1]:
print('Yes')
sys.exit()
print('No')
| import math
import sys
s = input()
if s==s[::-1]:
n = len(s)
right = int((n-1)/2)
tmp = s[:right]
if tmp == tmp[::-1]:
left = int((n+3)/2)
tmp2 = s[left-1:]
if tmp2 == tmp2[::-1]:
print('Yes')
sys.exit()
print('No')
| [
"call.remove"
] | 507,980 | 507,981 | u309834353 | python |
p02730 | S = input()
def is_kaibun(s):
for i in range(len(s) // 2):
if s[i] != s[-i-1]:
print('No')
N = len(S)
is_kaibun(S)
is_kaibun(S[:(N-1)//2])
is_kaibun(S[(N+3)//2-1:])
print('Yes')
| S = input()
def is_kaibun(s):
for i in range(len(s) // 2):
if s[i] != s[-i-1]:
print('No')
exit()
N = len(S)
is_kaibun(S)
is_kaibun(S[:(N-1)//2])
is_kaibun(S[(N+3)//2-1:])
print('Yes')
| [
"call.add"
] | 507,994 | 507,995 | u866124363 | python |
p02730 | s = list(input())
t = s[::-1]
n = len(s)
if s != t:
print ('No')
exit()
if n == 3:
print('Yes')
exit()
d = s[:int((n-1)/2)+1]
e = d[::-1]
r = s[int((n+3)/2-1):]
q = r[::-1]
#print(r,q)
if d != e:
print('No')
exit()
if r != q:
print ('No')
exit()
print('Yes') | s = list(input())
t = s[::-1]
n = len(s)
if s != t:
print ('No')
exit()
if n == 3:
print('Yes')
exit()
d = s[:int((n-1)/2)]
e = d[::-1]
#print(d,e)
r = s[int((n+3)/2-1):]
q = r[::-1]
#print(r,q)
if d != e:
print('No')
exit()
if r != q:
print ('No')
exit()
print('Yes') | [
"expression.operation.binary.remove"
] | 507,998 | 507,999 | u075595666 | python |
p02730 | s=input()
n=len(s)
s1=s[:n//2]
s2=s[n//2+1:]
test =True
if(s!=s[::-1]):
test=False
if (s1!=s1[::-1]):
test=False
if(s2!=s2[::-1]):
test=False
if(test==True):
print("YES")
else:
print("NO") | s=input()
n=len(s)
s1=s[:n//2]
s2=s[n//2+1:]
test =True
if(s!=s[::-1]):
test=False
if (s1!=s1[::-1]):
test=False
if(s2!=s2[::-1]):
test=False
if(test==True):
print("Yes")
else:
print("No") | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 508,012 | 508,013 | u620282458 | python |
p02730 | s = input()
def palind(word):
l = len(word)
i=0
j=l-1
while i <= j:
if word[i] != word[j]:
return False
i += 1
j -= 1
return True
n = len(s)
if palind(s) and palind(s[:(((n-1)//2))]) and palind(s[(((n+3)//2)-1):]):
print("YES")
else:
print("NO") | s = input()
def palind(word):
l = len(word)
i=0
j=l-1
while i <= j:
if word[i] != word[j]:
return False
i += 1
j -= 1
return True
n = len(s)
if palind(s) and palind(s[:(((n-1)//2))]) and palind(s[(((n+3)//2)-1):]):
print("Yes")
else:
print("No") | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 508,040 | 508,041 | u371435984 | python |
p02730 | s = input()
n = len(s)
firsthalf = s[:(n - 1)//2]
secondhalf = s[(n + 3)//2 - 1:]
#
# print(firsthalf)
# print(secondhalf)
revfirst = firsthalf[::-1]
revsecond = secondhalf[::-1]
revitself = s[::1]
#
# print(revfirst)
# print(revsecond)
if s == revitself and firsthalf == revfirst and secondhalf == revsecond:
pr... | s = input()
n = len(s)
firsthalf = s[:(n - 1)//2]
secondhalf = s[(n + 3)//2 - 1:]
#
# print(firsthalf)
# print(secondhalf)
revfirst = firsthalf[::-1]
revsecond = secondhalf[::-1]
revitself = s[::-1]
#
# print(revfirst)
# print(revsecond)
if s == revitself and firsthalf == revfirst and secondhalf == revsecond:
p... | [
"expression.operation.unary.add"
] | 508,048 | 508,049 | u768496010 | python |
p02730 | from bisect import *
from collections import *
from itertools import *
import functools
import sys
import math
from decimal import *
from copy import *
from heapq import *
from fractions import *
getcontext().prec = 30
MAX = sys.maxsize
MAXN = 50010
MOD = 10**9+7
spf = [i for i in range(MAXN)]
spf[0]=spf[1] = -1
def si... | from bisect import *
from collections import *
from itertools import *
import functools
import sys
import math
from decimal import *
from copy import *
from heapq import *
from fractions import *
getcontext().prec = 30
MAX = sys.maxsize
MAXN = 50010
MOD = 10**9+7
spf = [i for i in range(MAXN)]
spf[0]=spf[1] = -1
def si... | [
"assignment.change"
] | 508,056 | 508,057 | u638801031 | python |
p02730 | def ispalindrome(str): return 1 if str == str[::-1] else 0
a = input()
l = len(a)
left = a[0:(l-1)//2]
right = a[(l-1)//2+1:]
if ispalindrome(left) and ispalindrome(right):
print("Yes")
else:
print("No")
| def ispalindrome(str): return 1 if str == str[::-1] else 0
a = input()
l = len(a)
left = a[0:(l-1)//2]
right = a[(l-1)//2+1:]
if ispalindrome(left) and ispalindrome(right) and ispalindrome(a):
print("Yes")
else:
print("No")
| [
"control_flow.branch.if.condition.change"
] | 508,066 | 508,067 | u452512115 | python |
p02730 | def check(st):
flag = True
n = len(st)
for i in range(int(n/2)):
if st[i] != st[n-1-i]:
flag = False
return flag
s=input()
n=len(s)
one = s[0:int((n-1)/2)]
two = s[int(((n+3)/2)) - 1:n]
if check(one) and check(two):
print("Yes")
else:
print("No") | def check(st):
flag = True
n = len(st)
for i in range(int(n/2)):
if st[i] != st[n-1-i]:
flag = False
return flag
s=input()
n=len(s)
one = s[0:int((n-1)/2)]
two = s[int(((n+3)/2)) - 1:n]
if check(one) and check(two) and check(s):
print("Yes")
else:
print("No") | [
"control_flow.branch.if.condition.change"
] | 508,072 | 508,073 | u810625173 | python |
p02730 | s = input()
def is_kaibun(s):
for i in range(len(s)//2):
if s[i] != s[-i-1]:
return False
return True
n = len(s)
s1 = s[:(n-1)/2]
s2 = s[(n+1)/2:]
if is_kaibun(s) & is_kaibun(s1) & is_kaibun(s2):
print('Yes')
else:
print('No')
| s = input()
def is_kaibun(s):
for i in range(len(s)//2):
if s[i] != s[-i-1]:
return False
return True
n = len(s)
s1 = s[:(n-1)//2]
s2 = s[(n+1)//2:]
if is_kaibun(s) & is_kaibun(s1) & is_kaibun(s2):
print('Yes')
else:
print('No')
| [
"expression.operator.arithmetic.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 508,082 | 508,083 | u858464419 | python |
p02730 | def main():
S = list(input())
N = len(S)
kaibun_check(S)
S1 = S[0:(N-1)//2 + 1]
kaibun_check(S1)
S2 = S[(N+3)//2 + 1: -1]
kaibun_check(S2)
print('Yes')
def kaibun_check(L):
L_ = list(L.__reversed__())
for s, s_ in zip(L, L_):
if s != s_:
print('No')
... | def main():
S = list(input())
N = len(S)
kaibun_check(S)
S1 = S[0:(N-1)//2]
kaibun_check(S1)
S2 = S[(N+3)//2:-1]
kaibun_check(S2)
print('Yes')
def kaibun_check(L):
L_ = list(L.__reversed__())
for s, s_ in zip(L, L_):
if s != s_:
print('No')
e... | [
"expression.operation.binary.remove"
] | 508,095 | 508,093 | u239917977 | python |
p02730 | import math
def check_kai(arr):
len_a = len(arr)
check_len = int(math.ceil(len_a/2))
lef = arr[0:check_len]
arr.reverse()
rig = arr[0:check_len]
if lef == rig:
return True
else:
return False
input = list(input())
N = len(input)
if check_kai(input) and check_kai(input[0:(i... | import math
def check_kai(arr):
len_a = len(arr)
check_len = int(math.ceil(len_a/2))
lef = arr[0:check_len]
arr.reverse()
rig = arr[0:check_len]
if lef == rig:
return True
else:
return False
input = list(input())
N = len(input)
if check_kai(input) and check_kai(input[0:(i... | [
"literal.number.integer.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 508,099 | 508,100 | u612895604 | python |
p02730 | import math
def check_kai(arr):
len_a = len(arr)
check_len = int(math.ceil(len_a/2))
lef = arr[0:check_len]
arr.reverse()
rig = arr[0:check_len]
if lef == rig:
return True
else:
return False
input = list(input())
N = len(input)
if check_kai(input) and check_kai(input[0:(i... | import math
def check_kai(arr):
len_a = len(arr)
check_len = int(math.ceil(len_a/2))
lef = arr[0:check_len]
arr.reverse()
rig = arr[0:check_len]
if lef == rig:
return True
else:
return False
input = list(input())
N = len(input)
if check_kai(input) and check_kai(input[0:(i... | [
"expression.operation.binary.remove",
"literal.number.integer.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 508,101 | 508,100 | u612895604 | python |
p02730 | S = list(input())
len_s = len(S)
print(len_s)
right = S[0:(len_s-1)//2]
left = S[(len_s+3)//2-1:]
if S != list(reversed(S)):
print("No")
elif right != list(reversed(right)):
print("No")
elif left != list(reversed(left)):
print("No")
else:
print("Yes")
| S = list(input())
len_s = len(S)
right = S[0:(len_s-1)//2]
left = S[(len_s+3)//2-1:]
if S != list(reversed(S)):
print("No")
elif right != list(reversed(right)):
print("No")
elif left != list(reversed(left)):
print("No")
else:
print("Yes")
| [
"call.remove"
] | 508,104 | 508,105 | u219417113 | python |
p02730 | s=input()
n=len(s)
n1=((n-1)//2)
n2=(n+3)//2
s1=s[0:n1]
s2=s[n2-1:]
if s==s[::-1] and s1==s1[::-1] and s2==s2[::-1]:
print('yes')
else:
print('no') | s=input()
n=len(s)
n1=((n-1)//2)
n2=(n+3)//2
s1=s[0:n1]
s2=s[n2-1:]
if s==s[::-1] and s1==s1[::-1] and s2==s2[::-1]:
print('Yes')
else:
print('No') | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 508,106 | 508,107 | u251024383 | python |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.