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()
def isPalindrome(a):
i = 0
j = len(a)-1
while(i<j):
if(a[i] != a[j]):
return False
i += 1
j -= 1
return True
n = len(s)
# print(s[:int((n-1)/2)])
# print(s[int((n+3)/2)-1:])
# print(isPalindrome(s[:int((n-1)/2)]))
print("Yes" if isPalindrome(s[:int((n-1)... | s = input()
def isPalindrome(a):
i = 0
j = len(a)-1
while(i<j):
if(a[i] != a[j]):
return False
i += 1
j -= 1
return True
n = len(s)
# print(s[:int((n-1)/2)])
# print(s[int((n+3)/2)-1:])
# print(isPalindrome(s[:int((n-1)/2)]))
print("Yes" if isPalindrome(s) and isPal... | [] | 506,621 | 506,622 | u391285522 | python |
p02730 | def main():
# s = int(input())
s = str(input())
s_1_mae = list(s[:((len(s)-1) // 2)])
s_2 = list(s[((len(s)+3)// 2) -1 :])
if s_1_mae == list(reversed(s_1_mae)) and s_2 == list(reversed(s_2)) and list(s) == reversed(list(s)):
print("Yes")
else:
print("No")
if __name__ == '__main__':
main() | def main():
s = str(input())
s_1_mae = list(s[:((len(s)-1) // 2)])
s_2 = list(s[((len(s)+3)// 2) -1 :])
if s_1_mae == list(reversed(s_1_mae)) and s_2 == list(reversed(s_2)) and list(s) == list(reversed(list(s))):
print("Yes")
else:
print("No")
if __name__ == '__main__':
main() | [
"control_flow.branch.if.condition.change",
"call.add"
] | 506,625 | 506,626 | u879584308 | python |
p02730 | S = input()
judge = True
for i in range(len(S)//2):
if S[i] != S[len(S) - i - 1]:
judge = False
break
if judge:
for i in range(int((len(S)-1)/2)):
if S[i] != S[int((len(S)-1)/2)- 1 - i]:
judge = False
break
elif S[int((N+3)/2)-1 + i] != S[N-1-... | S = input()
N = len(S)
judge = True
for i in range(len(S)//2):
if S[i] != S[len(S) - i - 1]:
judge = False
break
if judge:
for i in range(int((len(S)-1)/2)):
if S[i] != S[int((len(S)-1)/2)- 1 - i]:
judge = False
break
elif S[int((N+3)/2)-1 + i... | [
"assignment.add"
] | 506,627 | 506,628 | u278260569 | python |
p02730 | s = input()
l = len(s)
s1 = s[:int((l-1)/2)]
s3 = s[int((l+1)/2):]
s4 = s3[::-1]
m = s[:int((l-1)/2)]
n = len(m)
m1 = m[:int((n-1)/2)]
m3 = m[int((n+1)/2):]
m4 = m3[::-1]
a = s[int((l+3)/2-1):]
b = len(a)
a1 = a[:int((b-1)/2)]
a3 = a[int((b+1)/2):]
a4 = a3[::-1]
if (s1 in s4) & (m1 in m4) & (a1 in a4):
print("Y... | s = input()
l = len(s)
s1 = s[:int((l-1)/2)]
s3 = s[int((l+1)/2):]
s4 = s3[::-1]
m = s[:int((l-1)/2)]
n = len(m)
m1 = m[:int((n)/2)]
m3 = m[int((n+1)/2):]
m4 = m3[::-1]
a = s[int((l+3)/2-1):]
b = len(a)
a1 = a[:int((b-1)/2)]
a3 = a[int((b+1)/2):]
a4 = a3[::-1]
if (s1 in s4) & (m1 in m4) & (a1 in a4):
print("Yes... | [
"expression.operation.binary.remove"
] | 506,635 | 506,636 | u423193302 | python |
p02730 | s=input()
n=len(s)
x=(n-1)//2
while i<x:
if s[i]!=s[n-1-i] or s[i]!=s[x-1-i]:
print('No')
break
i=i+1
else:
print('Yes') | s=input()
n=len(s)
x=(n-1)//2
i=0
while i<x:
if s[i]!=s[n-1-i] or s[i]!=s[x-1-i]:
print('No')
break
i=i+1
else:
print('Yes') | [
"assignment.add"
] | 506,648 | 506,649 | u692498898 | python |
p02730 | def check(string2):
N = len(string2)
rev = string2[::-1]
for i in range((N//2)+1):
if(rev[i]!=string2[i]):
return False
return True
string = input()
n = len(string)
n-=1
str1 = string[0:int((n)/2)]
# print(str1)
str2 = string[int((n)/2)+1:n+1]
# print(str2)
if check(str1) and check(str2):
print("Yes")
else:... | def check(string2):
N = len(string2)
rev = string2[::-1]
for i in range((N//2)+1):
if(rev[i]!=string2[i]):
return False
return True
string = input()
n = len(string)
n-=1
str1 = string[0:int((n)/2)]
# print(str1)
str2 = string[int((n)/2)+1:n+1]
# print(str2)
if check(str1) and check(str2) and check(string):
... | [
"control_flow.branch.if.condition.change"
] | 506,663 | 506,664 | u691446391 | python |
p02730 | def solve(s):
s = list(s)
n = len(s)
ans = check_palindrome(s) & check_palindrome(s[0:int(((n-1)//2))]) & check_palindrome(s[0:int(((n+3)//2))])
return "Yes" if ans else "No"
def check_palindrome(st):
a = list(st)
b = list(reversed(st))
return a == b
s = str(input())
# n, m = [int(s) for s in input(... | def solve(s):
s = list(s)
n = len(s)
ans = check_palindrome(s) & check_palindrome(s[:int(((n-1)//2))]) & check_palindrome(s[int(((n+3)//2)-1):])
return "Yes" if ans else "No"
def check_palindrome(st):
a = list(st)
b = list(reversed(st))
return a == b
s = str(input())
# n, m = [int(s) for s in input(... | [
"call.arguments.change"
] | 506,667 | 506,668 | u618101737 | python |
p02730 | class atcorder:
S=list(input())
inv=list(reversed(S))
i=0
j=0
if S==inv:
i+=1
N=int((len(S)-1)/2)
for x in range(N-1):
if S[x]==S[N-1-x] and inv[x]==inv[N-1-x]:
pass
else:
j+=1
if j==0 and i==1:
print(... | class atcorder:
S=list(input())
inv=list(reversed(S))
i=0
j=0
if S==inv:
i+=1
N=int((len(S)-1)/2)
for x in range(N-1):
if S[x]==S[N-1-x] and inv[x]==inv[N-1-x]:
pass
else:
j+=1
if j==0 and i==1:
print(... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 506,671 | 506,672 | u172296140 | python |
p02730 | s = input()
n = len(s)
s1 = s[0:(n-1)//2]
s2 = s[(n+1)//2:n]
def check(s):
sr = s[::-1]
if s == sr:
return True
else:
return False
if check(s1) and check(s2):
print('Yes')
else:
print('No') | s = input()
n = len(s)
s1 = s[0:(n-1)//2]
s2 = s[(n+1)//2:n]
def check(s):
sr = s[::-1]
if s == sr:
return True
else:
return False
if check(s) and check(s1) and check(s2):
print('Yes')
else:
print('No') | [
"control_flow.branch.if.condition.change"
] | 506,673 | 506,674 | u006880673 | python |
p02730 | s = list(input())
n = len(s)
if n==n[::-1] and n[0:int((n-1)/2)]==n[0:int((n-1)/2)][::-1] and n[int((n+3)/2-1):n]==n[int((n+3)/2-1):n][::-1]:
print('Yes')
else:
print('No')
| s = list(input())
n = len(s)
if s==s[::-1] and s[0:int((n-1)/2)]==s[0:int((n-1)/2)][::-1] and s[int((n+3)/2-1):n]==s[int((n+3)/2-1):n][::-1]:
print('Yes')
else:
print('No')
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 506,675 | 506,676 | u472696272 | python |
p02730 | s = list(input())
n = len(s)
def kaibun(st):
sta = list()
for k in range(len(st)//2):
sta.append(st[k])
for k in range(len(st)//2):
if st[-(-len(st)//2)+k] != sta.pop():
return False
return True
if kaibun(s) == False:
print('No')
elif kaibun(s[:(n-1)//2]) == No:
print('No')
elif kaibun(s[(n+... | s = list(input())
n = len(s)
def kaibun(st):
sta = list()
for k in range(len(st)//2):
sta.append(st[k])
for k in range(len(st)//2):
if st[-(-len(st)//2)+k] != sta.pop():
return False
return True
if kaibun(s) == False:
print('No')
elif kaibun(s[:(n-1)//2]) == False:
print('No')
elif kaibun(s[... | [
"control_flow.branch.if.condition.change"
] | 506,677 | 506,678 | u819593641 | python |
p02730 | s=input()
n=len(s)
if s[:(n-1)/2-1]==s[:(n-1)/2-1][::-1] and s==s[::-1]:
print('Yes')
else:
print('No') | s=input()
n=len(s)
if s[:(n-1)//2]==s[:(n-1)//2][::-1] and s==s[::-1]:
print('Yes')
else:
print('No') | [
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 506,688 | 506,689 | u932868243 | python |
p02730 | S=list(str(input()))
N=len(S)
S_left=[S[i] for i in range((N-1)//2)]
S_right=[S[i] for i in range((N+2)//2,N)]
def kaibun(X):
count=0
for i in range(len(X)//2):
if S[i]==S[len(X)-1-i]:
count+=1
if count==len(X)//2:
return 1
else:
return 0
print("Yes" if ka... | S=list(str(input()))
N=len(S)
S_left=[S[i] for i in range((N-1)//2)]
S_right=[S[i] for i in range((N+2)//2,N)]
def kaibun(X):
count=0
for i in range(len(X)//2):
if S[i]==S[len(X)-1-i]:
count+=1
if count==len(X)//2:
return 1
else:
return 0
print("Yes" if ka... | [
"expression.operation.binary.add"
] | 506,697 | 506,698 | u847165882 | python |
p02730 | def kaibun(S):
lenS = len(S)
# print()
# print(S)
# print(S[:lenS//2])
# print(S[:(lenS-1)//2:-1])
if S[:lenS//2] == S[:(lenS-1)//2:-1]:
return 1
else:
return 0
S = input()
lenS = len(S)
if kaibun(S[:lenS//2]) and kaibun(S[lenS//2+1:]):
print('Yes')
else:
print('No') | def kaibun(S):
lenS = len(S)
# print()
# print(S)
# print(S[:lenS//2])
# print(S[:(lenS-1)//2:-1])
if S[:lenS//2] == S[:(lenS-1)//2:-1]:
return 1
else:
return 0
S = input()
lenS = len(S)
if kaibun(S) and kaibun(S[:lenS//2]) and kaibun(S[lenS//2+1:]):
print('Yes')
else:
p... | [
"control_flow.branch.if.condition.change"
] | 506,699 | 506,700 | u555767343 | python |
p02730 | S=input()
N=len(S)
a=False
for i in range(N):
if S[i]!=S[N-1-i]:
print("No")
break
else:
a=True
if a==True:
for j in range(int((N-3)/2)+1):
if S[j]!=S[int((N-3)/2)-j]:
a=False
print("No")
break
if a==True:
for k in range(int((N-3)/2)... | S=input()
N=len(S)
a=False
for i in range(N):
if S[i]!=S[N-1-i]:
print("No")
a=False
break
else:
a=True
if a==True:
for j in range(int((N-3)/2)+1):
if S[j]!=S[int((N-3)/2)-j]:
a=False
print("No")
break
if a==True:
for k in... | [
"assignment.add"
] | 506,704 | 506,705 | u172966990 | python |
p02730 | S=input()
N=len(S)
a=False
for i in range(N):
if S[i]!=S[N-1-i]:
print("No")
break
else:
a=True
if a==True:
for j in range(int((N-3)/2)+1):
if S[j]!=S[int((N-3)/2)-j]:
a=False
print("No")
break
if a==True:
for k in range(int((N-3)/2)... | S=input()
N=len(S)
a=True
for i in range(N):
if S[i]!=S[N-1-i]:
print("No")
a=False
break
if a==True:
for j in range(int((N-3)/2)+1):
if S[j]!=S[int((N-3)/2)-j]:
a=False
print("No")
break
if a==True:
for k in range(int((N-3)/2)+1):
... | [
"misc.opposites",
"assignment.value.change",
"control_flow.break.remove",
"control_flow.break.add"
] | 506,704 | 506,706 | u172966990 | python |
p02730 | s = input()
n = len(s)
A = s[0:(n-1)//2]
B = s[(n+1)//2:n]
if A == A[::-1] and B == B[::-1]:
print("Yes")
else:
print("No") | s = input()
n = len(s)
A = s[0:(n-1)//2]
B = s[(n+1)//2:n]
if A == B and A == A[::-1] and B == B[::-1]:
print("Yes")
else:
print("No") | [
"control_flow.branch.if.condition.change"
] | 506,714 | 506,715 | u745687363 | python |
p02730 | S=input()
l=len(S)
S1=S[1:int((l+1)/2)]
S2=S[int((l+3)/2)::]
if S==S[::] and S1==S1[::-1] and S2==S2[::-1]:
print("Yes")
else:
print("No") | S=input()
l=len(S)
S1=S[:int((l-1)/2)]
S2=S[int((l+1)/2)::]
if S==S[::-1] and S1==S1[::-1] and S2==S2[::-1]:
print("Yes")
else:
print("No")
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"literal.number.integer.change",
"control_flow.branch.if.condition.change"
] | 506,716 | 506,717 | u697422981 | python |
p02730 | S=list(input())
n=len(S)
ans='No'
if S==list(reversed(S)):
new=S[0:((n-1)//2)]
if new==list(reversed(new)):
new2=S[((n+3)//2):n+1]
if new2==list(reversed(new2)):
ans='Yes'
print(ans) | S=list(input())
n=len(S)
ans='No'
if S==list(reversed(S)):
new=S[0:((n-1)//2)]
if new==list(reversed(new)):
new2=S[((n+3)//2)-1:]
if new2==list(reversed(new2)):
ans='Yes'
print(ans) | [
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.remove"
] | 506,718 | 506,719 | u229518917 | python |
p02730 | S=list(input())
n=len(S)
ans='No'
if S==list(reversed(S)):
new=S[0:((n-1)//2)]
if new==list(reversed(new)):
new2=S[((n+3)//2):N+1]
if new2==list(reversed(new2)):
ans='Yes'
print(ans) | S=list(input())
n=len(S)
ans='No'
if S==list(reversed(S)):
new=S[0:((n-1)//2)]
if new==list(reversed(new)):
new2=S[((n+3)//2)-1:]
if new2==list(reversed(new2)):
ans='Yes'
print(ans) | [
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.remove"
] | 506,720 | 506,719 | u229518917 | python |
p02730 | string=input()
kaibun=list(string)
n=int(len(kaibun))
if kaibun==list(reversed(kaibun)):
if (list(reversed(kaibun[:int((n-1)/2)]))==kaibun[:int((n-1)/2)]) and (list(reversed(kaibun[int((n+1)/2):]))==kaibun[int((n+1)/2):]):
print("Yes")
else:
print("No")
| string=input()
kaibun=list(string)
n=int(len(kaibun))
if (kaibun==list(reversed(kaibun)))and(list(reversed(kaibun[:int((n-1)/2)]))==kaibun[:int((n-1)/2)]) and (list(reversed(kaibun[int((n+1)/2):]))==kaibun[int((n+1)/2):]):
print("Yes")
else:
print("No")
| [
"control_flow.branch.if.condition.change"
] | 506,721 | 506,722 | u233752869 | python |
p02730 | S = input()
words = []
words.append(S)
words.append(S[:(N-1)//2])
words.append(S[(N+3)//2 - 1:])
ans = all([word == word[::-1] for word in words])
print("Yes" if ans else "No") | S = input()
N = len(S)
words = []
words.append(S)
words.append(S[:(N-1)//2])
words.append(S[(N+3)//2 - 1:])
ans = all([word == word[::-1] for word in words])
print("Yes" if ans else "No") | [
"assignment.add"
] | 506,727 | 506,728 | u548545174 | python |
p02730 | import sys
S = input()
N = len(S)
if S == S[::-1]:
if S[0:(N-1)/2] == S[0:(N-1)/2][::-1]:
if S[((N+3)/2)-1:N] == S[((N+3)/2)-1:N][::-1]:
print("Yes")
sys.exit()
print("No") | import sys
S = input()
N = len(S)
if S == S[::-1]:
if S[0:(N-1)//2] == S[0:(N-1)//2][::-1]:
if S[((N+3)//2)-1:N] == S[((N+3)//2)-1:N][::-1]:
print("Yes")
sys.exit()
print("No") | [
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 506,729 | 506,730 | u548545174 | python |
p02730 | S = input()
N = int(len(S))
S_a = S[:(N-1)//2]
S_b = S[(N+3)//2:]
#print(S)
if S == S[::-1] and S_a == S_a[::-1] and S_b == S_b[::-1]:
print("Yes")
else:
print("No") | S = input()
N = int(len(S))
S_a = S[:(N-1)//2]
S_b = S[(N+1)//2:]
#print(S)
if S == S[::-1] and S_a == S_a[::-1] and S_b == S_b[::-1]:
print("Yes")
else:
print("No") | [
"literal.number.integer.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 506,731 | 506,732 | u574565611 | python |
p02730 | s = input()
t = s[:(len(s)-1)/2]
u = s[(len(s)+3)/2-1:]
if s == s[::-1] and t == t[::-1] and u == u[::-1]:
print("Yes")
else:
print("No")
| s = input()
t = s[:(len(s)-1)//2]
u = s[(len(s)+3)//2-1:]
if s == s[::-1] and t == t[::-1] and u == u[::-1]:
print("Yes")
else:
print("No") | [
"expression.operator.arithmetic.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 506,733 | 506,734 | u830162518 | python |
p02730 | s = input()
l = len(s)
sl = s[:(l-1)//2]
sr = s[((l+3)//2 -1):]
#print(sl)
#print(len(sl)//2)
#print(sr)
#print(len(sr)//2)
def f(s):
l = len(s)
j = False
for i in range(l//2 +1):
if s[i] == s[l-1-i]:
j = True
else :
j = False
return j
if f(s) and f(sl) and f(s... | s = input()
l = len(s)
sl = s[:(l-1)//2]
sr = s[((l+3)//2 -1):]
#print(sl)
#print(len(sl)//2)
#print(sr)
#print(len(sr)//2)
def f(s):
l = len(s)
j = False
for i in range(l//2 +1):
if s[i] == s[l-1-i]:
j = True
else :
j = False
break
return j
if f(s)... | [
"control_flow.break.add"
] | 506,735 | 506,736 | u235027735 | python |
p02730 | s = input()
t = s[:int((len(s)-1)/2)]
u = s[(int(len(s)+3)/2-1):]
if s == s[::-1] and t == t[::-1] and u == u[::-1]:
print("Yes")
else:
print("No") | s = input()
t = s[:int((len(s)-1)/2)]
u = s[(int((len(s)+3)/2)-1):]
if s == s[::-1] and t == t[::-1] and u == u[::-1]:
print("Yes")
else:
print("No") | [
"call.arguments.change"
] | 506,742 | 506,743 | u289162337 | python |
p02730 | S = str(input())
slist = list(S)
N = len(slist)
print(N)
k = int((N-1)/2)
rs = slist[::-1]
front = slist[0:k]
rfront = front[::-1]
if front == rfront and rs == slist:
print("Yes")
else:
print("No")
| S = str(input())
slist = list(S)
N = len(slist)
k = int((N-1)/2)
rs = slist[::-1]
front = slist[0:k]
rfront = front[::-1]
if front == rfront and rs == slist:
print("Yes")
else:
print("No")
| [
"call.remove"
] | 506,744 | 506,745 | u997927785 | python |
p02730 | S = input()
def judge(x):
if "".join(list(reversed(x))) == x:
return True
else:
return False
def solve(x):
if judge(x) and judge(x[0:(len(x)-1)/2]) and judge(x[(len(x)+1)/2:]):
print("Yes")
else:
print("No")
solve(S) | S = input()
def judge(x):
if "".join(list(reversed(x))) == x:
return True
else:
return False
def solve(x):
if judge(x) and judge(x[0:int((len(x)-1)/2)]) and judge(x[int((len(x)+1)/2):]):
print("Yes")
else:
print("No")
solve(S) | [
"control_flow.branch.if.condition.change",
"call.add"
] | 506,752 | 506,753 | u425762225 | python |
p02730 | S = input()
S_rvs = S[::-1]
N = len(S)
left = int((N-1)/2-1)
right = int((N+3)/2-1)
if S == S_rvs and S[:left] == S_rvs[right:] and S[right:] == S_rvs[:left]:
print("Yes")
else:
print("No") | S = input()
S_rvs = S[::-1]
N = len(S)
left = int((N-1)/2)
right = int((N+3)/2-1)
if S == S_rvs and S[:left] == S_rvs[right:] and S[right:] == S_rvs[:left]:
print("Yes")
else:
print("No") | [
"expression.operation.binary.remove"
] | 506,770 | 506,771 | u884323674 | python |
p02730 | moji = list(input())
length = len(moji)
count = 0
m = n = 0
for i in range(int(length/2-1)):
if moji[i] != moji[length-i-1]:
count += 1
k = (length-1)//2-1
for i in range(int((length-1)/2-1)):
if moji[i] != moji[k-n]:
count += 1
n += 1
n = (length+3-1)/2
for n in range(int(length-1)):
... | moji = list(input())
length = len(moji)
count = 0
m = n = 0
for i in range(int(length/2-1)):
if moji[i] != moji[length-i-1]:
count += 1
k = (length-1)//2-1
for i in range(int((length-1)/2-1)):
if moji[i] != moji[k-n]:
count += 1
n += 1
n = (length+3-1)/2
for n in range(int(length-1)):
... | [
"call.arguments.change",
"io.output.change"
] | 506,776 | 506,777 | u725993280 | python |
p02730 | s=input()
n=len(s)
s1=s[(n-1)//2]
flag=0
for i in range(len(s1)//2):
if(s1[i]!=s1[-1-i]):
flag=1
break
s1=s[(n+3)//2-1]
for i in range(len(s1)//2):
if(s1[i]!=s1[-1-i]):
flag=1
break
for i in range(n//2):
if s[i]!=s[-1-i]:
flag=1
break
if flag==1:
print(... | s=input()
n=len(s)
s1=s[:(n-1)//2]
flag=0
for i in range(len(s1)//2):
if(s1[i]!=s1[-1-i]):
flag=1
break
s1=s[(n+3)//2-1:]
for i in range(len(s1)//2):
if(s1[i]!=s1[-1-i]):
flag=1
break
for i in range(n//2):
if s[i]!=s[-1-i]:
flag=1
break
if flag==1:
prin... | [] | 506,799 | 506,800 | u113991073 | python |
p02730 | import sys
s = sys.stdin.readline()
i = 0
l = len(s)
flag = True
while flag and i <= l:
if s[i] != s[l-1]:
flag = False
i += 1
l -= 1
l = len(s)
a = s[0:-(-(l-1)//2)]
i = 0
l = len(a)
while flag and i <= l:
if a[i] != a[l-1]:
flag = False
i += 1
l -= 1
b = s[(len(s) + 3)//2 - 1:]
i = 0
l = len(b)
wh... | import sys
s = sys.stdin.readline().rstrip()
i = 0
l = len(s)
flag = True
while flag and i <= l:
if s[i] != s[l-1]:
flag = False
i += 1
l -= 1
l = len(s)
a = s[0:-(-(l-1)//2)]
i = 0
l = len(a)
while flag and i <= l:
if a[i] != a[l-1]:
flag = False
i += 1
l -= 1
b = s[(len(s) + 3)//2 - 1:]
i = 0
l = ... | [
"call.add"
] | 506,801 | 506,802 | u823885866 | python |
p02730 | S = list(input())
M = len(S) // 2
if S == S[::-1] and S[:M] == S[:M:-1]:
print("Yes")
else:
print("No")
| S = list(input())
M = len(S) // 2
if S == S[::-1] and S[:M] == S[:M][::-1]:
print("Yes")
else:
print("No")
| [
"control_flow.branch.if.condition.change"
] | 506,803 | 506,804 | u456353530 | python |
p02730 | import math
a= input()
length=math.floor(len(a)/2)
def kaibun(p):
length_p=math.floor(len(p)/2)
total_p = 0
for i in range(length_p):
if p[i] is not p[-1*i -1]:
return False
break
else:
total_p += 1
if total_p == length_p:
return True
i... | import math
a= input()
length=math.floor(len(a)/2)
def kaibun(p):
length_p=math.floor(len(p)/2)
total_p = 0
for i in range(length_p):
if p[i] is not p[-1*i -1]:
return False
break
else:
total_p += 1
if total_p == length_p:
return True
i... | [
"expression.operation.binary.remove"
] | 506,837 | 506,838 | u224554402 | python |
p02730 | s = input()
def reverse(text):
return text == ''.join(list(reversed(text)))
N = len(s)
if reverse(s) and reverse(s[:(N-1)/2]) and reverse(s[(N+3)/2 - 1:]):
print('Yes')
else:
print('No') | s = input()
def reverse(text):
return text == ''.join(list(reversed(text)))
N = len(s)
if reverse(s) and reverse(s[:int((N-1)/2)]) and reverse(s[int((N+3)/2) - 1:]):
print('Yes')
else:
print('No') | [
"control_flow.branch.if.condition.change",
"call.add"
] | 506,843 | 506,844 | u554129261 | python |
p02730 |
def f(x):
return x == x[::-1]
S = input()
l1 = (len(S)-1)//2
l2 = (len(S)+3)//2
S1 = S[:l1+1]
S2 = S[l2:]
if f(S) and f(S1) and f(S2):
print("Yes")
else:
print("No")
|
def f(x):
return x == x[::-1]
S = input()
l1 = (len(S)-1)//2
l2 = (len(S)+3)//2
S1 = S[:l1]
S2 = S[l2-1:]
if f(S) and f(S1) and f(S2):
print("Yes")
else:
print("No") | [
"expression.operation.binary.remove"
] | 506,847 | 506,848 | u713914478 | python |
p02730 |
def f(x):
return x == x[::-1]
S = input()
l1 = (len(S)-1)//2
l2 = (len(S)+3)//2
S1 = S[:l1]
S2 = S[l2:]
if f(S) and f(S1) and f(S2):
print("Yes")
else:
print("No") |
def f(x):
return x == x[::-1]
S = input()
l1 = (len(S)-1)//2
l2 = (len(S)+3)//2
S1 = S[:l1]
S2 = S[l2-1:]
if f(S) and f(S1) and f(S2):
print("Yes")
else:
print("No") | [
"assignment.change"
] | 506,850 | 506,848 | u713914478 | python |
p02730 | def f(x):
return x==x[::-1]
S=input()
n=(len(S)-1)/2
S1,S2=S[:n-1],S[n+1:]
if f(S) and f(S1) and f(S2):
print('Yes')
else:
print('No') | def f(x):
return x==x[::-1]
S=input()
n=(len(S)-1)//2
S1,S2=S[:n],S[n+1:]
if f(S) and f(S1) and f(S2):
print('Yes')
else:
print('No') | [
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 506,851 | 506,852 | u798675549 | python |
p02730 | s = input()
n = len(s)
palin = lambda s: s == s[::-1]
f = (n-1)//2
i = (n+3)//2
if palin(s[0:f]) and palin(s[i-1:n]):
print("Yes")
else:
print("No")
| s = input()
n = len(s)
palin = lambda s: s == s[::-1]
f = (n-1)//2
i = (n+3)//2
if palin(s[0:f]) and palin(s[i-1:n]) and palin(s):
print("Yes")
else:
print("No")
| [
"control_flow.branch.if.condition.change"
] | 506,855 | 506,856 | u475756142 | python |
p02730 | def pal(t):
return t == t[::-1];
s = input();
f = pal(s) and pal(s[0:(len(s)//2 - 1):]) and pal(s[(len(s)//2 + 1)::]);
#f = pal(s);
if f == True:
print("Yes");
else:
print("No");
| def pal(t):
return t == t[::-1];
s = input();
f = pal(s) and pal(s[0:len(s)//2:]) and pal(s[(len(s)//2 + 1)::]);
#f = pal(s);
if f == True:
print("Yes");
else:
print("No");
| [
"call.arguments.change"
] | 506,859 | 506,860 | u975652044 | python |
p02730 | get = input()
if get[:int((len(get)-1)/2)] == get[int(((len(get)+3)/2)-1):]:
print('yes')
else:
print('no') |
get = input()
if get[:int((len(get)-1)/2)] == get[int(((len(get)+3)/2)-1):]:
print('Yes')
else:
print('No') | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 506,878 | 506,879 | u669770320 | python |
p02730 | s=input()
n=len(s)
s1=s[:(n-1)//2]
s2=s[(n+1)//2:]
ans='Yes'
for s in [s1,s2]:
for i in range(len(s)):
if s[i]!=s[-1-i]:
ans='No'
break
print(ans) | s=input()
n=len(s)
s1=s[:(n-1)//2]
s2=s[(n+1)//2:]
ans='Yes'
for s in [s,s1,s2]:
for i in range(len(s)):
if s[i]!=s[-1-i]:
ans='No'
break
print(ans) | [] | 506,880 | 506,881 | u514894322 | python |
p02730 | def isPal(s):
return s==s[::-1]
s = str(input())
n = len(s)
if isPal(s[0:(n-1)//2]) and isPal(s[n//2+1:]):
print('Yes')
else:
print('No')
| def isPal(s):
return s==s[::-1]
s = str(input())
n = len(s)
if isPal(s[0:(n-1)//2]) and isPal(s[n//2+1:]) and isPal(s):
print('Yes')
else:
print('No') | [
"control_flow.branch.if.condition.change"
] | 506,888 | 506,889 | u043062362 | python |
p02730 | str1 = input()
n = len(str1)
m = int((n-1)/2)
o = int((n+3)/2)
str2 = str1[:m]
str3 = str1[(o-1):n]
if str1 != str1[::-1]:
print("No")
if str2 != str2[::-1]:
print("No")
if str3 != str3[::-1]:
print("No")
else:
print("Yes") | str1 = input()
n = len(str1)
m = int((n-1)/2)
o = int((n+3)/2)
str2 = str1[:m]
str3 = str1[(o-1):n]
if str1 != str1[::-1]:
print("No")
else:
if str2 != str2[::-1]:
print("No")
else:
if str3 != str3[::-1]:
print("No")
else:
print("Yes") | [] | 506,890 | 506,891 | u065302334 | python |
p02730 | S = list(input())
S_len = len(S)
S_reverse = list(S[::-1])
ans = 'Yes'
# 条件1 Sは回文である
if S == S_reverse:
pass
else:
ans = 'No'
# 条件2
S_2 = S[0:(S_len - 1) // 2]
S_2_reverse = S_2[::-1]
if S_2 == S_2_reverse:
pass
else:
ans = 'No'
# 条件3
S_3 = S[0:(S_len + 3) // 2]
S_3_reverse = S_3[::-1]
if S_3 == S_3... | S = list(input())
S_len = len(S)
S_reverse = list(S[::-1])
ans = 'Yes'
# 条件1 Sは回文である
if S == S_reverse:
pass
else:
ans = 'No'
# 条件2
S_2 = S[0:(S_len - 1) // 2]
S_2_reverse = S_2[::-1]
if S_2 == S_2_reverse:
pass
else:
ans = 'No'
# 条件3
S_3 = S[(S_len + 3) // 2 - 1:]
S_3_reverse = S_3[::-1]
if S_3 == ... | [] | 506,893 | 506,894 | u701318346 | python |
p02730 | a = input()
for i in range(len(a) // 2):
if a[i] != b[-(i+1)]:
print("No")
exit()
b = a[0:(len(a) - 1) // 2]
c = a[(len(a) + 3) // 2 - 1:len(a)]
for i in range(len(b) // 2):
if b[i] != b[-(i+1)]:
print("No")
exit()
for i in range(len(c) // 2):
if c[i] != c[-(i+1)]:
pr... | a = input()
for i in range(len(a) // 2):
if a[i] != a[-(i+1)]:
print("No")
exit()
b = a[0:(len(a) - 1) // 2]
c = a[(len(a) + 3) // 2 - 1:len(a)]
for i in range(len(b) // 2):
if b[i] != b[-(i+1)]:
print("No")
exit()
for i in range(len(c) // 2):
if c[i] != c[-(i+1)]:
pr... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 506,911 | 506,912 | u848647227 | python |
p02730 | S = input()
N = len(S)
ans = 'No'
if S == S[::-1]:
if S[:N//2] == S[N//2::-1]:
ans = 'Yes'
print(ans) | S = input()
N = len(S)
ans = 'No'
if S == S[::-1]:
if S[:N//2] == S[(N//2)-1::-1]:
ans = 'Yes'
print(ans) | [
"control_flow.branch.if.condition.change"
] | 506,913 | 506,914 | u957098479 | python |
p02730 | S = input()
N = len(S)
ans = 'No'
if S == S[::-1]:
if S[:N//2] == S[:N//2:-1]:
ans = 'Yes'
print(ans) | S = input()
N = len(S)
ans = 'No'
if S == S[::-1]:
if S[:N//2] == S[(N//2)-1::-1]:
ans = 'Yes'
print(ans) | [
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 506,915 | 506,914 | u957098479 | python |
p02730 | S = input()
N = len(S)
a = S[0:(N-1)//2]
b = S[(N+3)//2-1:]
def k(a):
for i in ragne(len(a)):
if a[i] != a[len(a)-1-i]:
return False
else:
return True
if k(S) & k(a) & k(b):
print("Yes")
else:
print("No")
| S = input()
N = len(S)
a = S[0:(N-1)//2]
b = S[(N+3)//2-1:]
def k(a):
for i in range(len(a)):
if a[i] != a[len(a)-1-i]:
return False
else:
return True
if k(S) & k(a) & k(b):
print("Yes")
else:
print("No")
| [
"identifier.change",
"call.function.change"
] | 506,920 | 506,921 | u875449556 | python |
p02730 | s = input()
def check(s):
if len(s) == 1 or len(s) == 0:
return True
if s[0]!=s[-1]:
return False
return check(s[1:-1])
mid = len(s)//2
if check(s) and check(s[0:mid]) and check(s[mid:]):
print("Yes")
else:
print("No")
| s = input()
def check(s):
if len(s) == 1 or len(s) == 0:
return True
if s[0]!=s[-1]:
return False
return check(s[1:-1])
mid = len(s)//2
if check(s) and check(s[0:mid]) and check(s[mid+1:]):
print("Yes")
else:
print("No")
| [
"control_flow.branch.if.condition.change"
] | 506,922 | 506,923 | u641393644 | python |
p02730 | def check(a):
i=0
j=len(a)-1
b=True
while(i<=j):
if(a[i]!=a[j]):
return False
i+=1;
j-=1
return b
a=(input())
b=a[:(len(a)-1)//2:]
c=a[(len(a)+3)//2::]
if(check(a)==True and check(b)==True and check(c)==True):
print("Yes")
else:
print("No")
| def check(a):
i=0
j=len(a)-1
b=True
while(i<=j):
if(a[i]!=a[j]):
return False
i+=1;
j-=1
return b
a=(input())
b=a[:(len(a)-1)//2:]
c=a[(len(a)+2)//2::]
#print(a,b,c)
if(check(a)==True and check(b)==True and check(c)==True):
print("Yes")
else:
print("No")... | [
"literal.number.integer.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 506,934 | 506,935 | u277394423 | python |
p02730 | S=input()
ans="Yes"
if all(a==b for a,b in zip(S,reversed(S))):
if all(a==b for a,b in zip(S,reversed(S[:N//2]))):
pass
else:
ans="No"
else:
ans="No"
print(ans)
| S=input()
ans="Yes"
if all(a==b for a,b in zip(S,reversed(S))):
if all(a==b for a,b in zip(S,reversed(S[:len(S)//2]))):
pass
else:
ans="No"
else:
ans="No"
print(ans)
| [
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"call.arguments.add"
] | 506,936 | 506,937 | u375616706 | python |
p02730 | import numpy as np
def judge(s):
l = len(s)
for i in range(int(l/2)):
if(s[i] != s[l-1-i]):
return False
return True
def main():
args = input().rstrip().split(' ')
S = np.array([c for c in args[0]])
l = len(S)
s1 = np.array([S[i] for i in range(0, int(l/2))])
s2 = n... | import numpy as np
def judge(s):
l = len(s)
for i in range(int(l/2)):
if(s[i] != s[l-1-i]):
return False
return True
def main():
args = input().rstrip().split(' ')
S = np.array([c for c in args[0]])
l = len(S)
s1 = np.array([S[i] for i in range(0, int(l/2))])
s2 = n... | [
"control_flow.branch.if.condition.change"
] | 506,946 | 506,947 | u334617936 | python |
p02730 | s=list("akasaka")
N=len(s)
a=int((N-1)/2)
b=int((N+1)/2)
if s[::-1]==s and s[:a]==s[b:]:
print('Yes')
else:
print('No') | s=list(input())
N=len(s)
a=int((N-1)/2)
b=int((N+1)/2)
if s[::-1]==s and s[:a]==s[b:]:
print('Yes')
else:
print('No') | [] | 506,953 | 506,954 | u311113280 | python |
p02730 | def palindrome(x):
reverse = x[::-1]
for i in range(len(x)):
if (x[i] != reverse[i]):
return False
return True
c = input()
l = len(c)
["No","Yes"][palindrome(c) & palindrome(c[:(l-1)//2])& palindrome(c[(l+2)//2:])] | def palindrome(x):
reverse = x[::-1]
for i in range(len(x)):
if (x[i] != reverse[i]):
return False
return True
c = input()
l = len(c)
print(["No","Yes"][palindrome(c) & palindrome(c[:(l-1)//2])& palindrome(c[(l+2)//2:])]) | [
"call.add",
"call.arguments.change"
] | 506,957 | 506,958 | u259268066 | python |
p02730 | s = input()
# 1. Sは回文である。
rs = s[::-1]
q1 = 0
if s == rs:
q1 = 1
# 2. Nを Sの長さとするとき、Sの 1文字目から (N−1)/2
# 文字目まで(両端含む)からなる文字列は回文である。
n = len(s)
h = int((n-1)/2)
s1 = s[:h:]
rs1 = s[::-1]
q2 = 0
if (s1 == rs1):
q2 = 1
# 3. Sの (N+3)/2文字目から N文字目まで
# (両端含む)からなる文字列は回文である。
n = len(s)
h = int((n+2)/2)
s2 = s[h::]
rs2 = ... | s = input()
# 1. Sは回文である。
rs = s[::-1]
q1 = 0
if s == rs:
q1 = 1
# print("q1=",q1)
# 2. Nを Sの長さとするとき、Sの 1文字目から (N−1)/2
# 文字目まで(両端含む)からなる文字列は回文である。
n = len(s)
h = int((n-1)/2)
# print("n,h=",n,h)
s1 = s[:h:]
# print("s1=",s1)
rs1 = s1[::-1]
q2 = 0
if (s1 == rs1):
q2 = 1
# print("q2=",q2)
# 3. Sの (N+3)/2文字目から N文字目... | [
"assignment.value.change",
"identifier.change"
] | 506,959 | 506,960 | u732230060 | python |
p02730 | S = list(str(input()))
inv = list(reversed(S))
n = len(S)
d = int((n-1)/2)
q = int((n+1)/2)
if S != inv:
print('No')
print("1")
else:
if S[:d] == S[q:]:
print('Yes')
else:
print('No') | S = list(str(input()))
inv = list(reversed(S))
n = len(S)
d = int((n-1)/2)
q = int((n+1)/2)
if S != inv:
print('No')
else:
if S[:d] == S[q:]:
print('Yes')
else:
print('No') | [
"call.remove"
] | 506,967 | 506,968 | u081899737 | python |
p02730 | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)
############ ---- Input Functions ---- ############
def in_int():
return (int(input()))
def in_list():
return (list(map(int, input().split())))
def in_str():
s = input()
return (list(s[:len(s) - 1]))
def in_ints():
return (ma... | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)
############ ---- Input Functions ---- ############
def in_int():
return (int(input()))
def in_list():
return (list(map(int, input().split())))
def in_str():
s = input()
return (list(s[:len(s) - 1]))
def in_ints():
return (ma... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 506,969 | 506,970 | u553855746 | python |
p02730 | S = input()
s1 = S[:(N-1)//2]
s2 = S[(N+3)//2-1:]
if S == S[::-1] and s1 == s1[::-1] and s2 == s2[::-1]:
print("Yes")
else:
print("No") | S = input()
N = len(S)
s1 = S[:(N-1)//2]
s2 = S[(N+3)//2-1:]
if S == S[::-1] and s1 == s1[::-1] and s2 == s2[::-1]:
print("Yes")
else:
print("No") | [
"assignment.add"
] | 506,971 | 506,972 | u667084803 | python |
p02730 | S = input()
def Check1(S):
for i in range((len(S) - 1) // 2):
if S[i] != S[len(S) - 1 - i]:
return False
return True
def Check2(S):
S2 = ""
for i in range(0, (len(S) - 1) // 2):
S2 = S2 + S[i]
return Check1(S2)
def Check3(S):
S3 = ""
for i in range((len(S) + 3)... | S = input()
def Check1(S):
for i in range(len(S) // 2):
if S[i] != S[len(S) - 1 - i]:
return False
return True
def Check2(S):
S2 = ""
for i in range(0, (len(S) - 1) // 2):
S2 = S2 + S[i]
return Check1(S2)
def Check3(S):
S3 = ""
for i in range((len(S) + 3) // 2 ... | [
"call.arguments.change",
"expression.operation.binary.remove"
] | 506,978 | 506,979 | u696969901 | python |
p02730 | S=input()
N=len(S)
cnt=0
cnt1=0
cnt2=0
for i in range (N):
if S[i]==S[N-1-i]:
cnt+=1
if cnt==N:
for j in range((N-1)//2):
if S[j]==S[(N-1)//2 -1-j]:
cnt1+=1
if cnt1==(N-1)//2:
for k in range((N-1)//2):
if S[(N+3)//2 -1+k]==S[N-1-k]:
cnt2+=1
... | S=input()
N=len(S)
cnt=0
cnt1=0
cnt2=0
for i in range (N):
if S[i]==S[N-1-i]:
cnt+=1
if cnt==N:
for j in range((N-1)//2):
if S[j]==S[(N-1)//2 -1-j]:
cnt1+=1
if cnt1==(N-1)//2:
for k in range((N-1)//2):
if S[(N+3)//2 -1+k]==S[N-1-k]:
cnt2+=1
... | [
"call.add"
] | 506,988 | 506,989 | u337626942 | python |
p02730 | def is_palindrome(str):
i, j = 0, len(str)-1
while i >= j:
if str[i] != str[j]:
return False
i += 1
j -= 1
return True
s = input()
n = len(s)
if is_palindrome(s) and is_palindrome(s[0:((n-1)//2)]) and is_palindrome(s[(n+3)//2-1:]):
print("Yes")
else:
print("No") | def is_palindrome(str):
i, j = 0, len(str)-1
while i <= j:
if str[i] != str[j]:
return False
i += 1
j -= 1
return True
s = input()
n = len(s)
if is_palindrome(s) and is_palindrome(s[0:((n-1)//2)]) and is_palindrome(s[(n+3)//2-1:]):
print("Yes")
else:
print("No") | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 506,994 | 506,995 | u723711163 | python |
p02730 | s = input()
l = s[:(len(s)-1)//2:]
r = s[(len(s)+1)//2:]
if a == b and a == a[::-1]:
print("Yes")
else:
print("No") | s = input()
a = s[:(len(s)-1)//2:]
b = s[(len(s)+1)//2:]
if a == b and a == a[::-1]:
print("Yes")
else:
print("No") | [
"assignment.variable.change",
"identifier.change"
] | 507,006 | 507,007 | u854992222 | python |
p02730 | s = input()
n = len(s)
a = s[:(n-1)//2]
b = s[(n+3)//2:]
if a == b and a == a[::-1]:
print('Yes')
else:
print('No') | s = input()
n = len(s)
a = s[:(n-1)//2]
b = s[(n+1)//2:]
if a == b and a == a[::-1]:
print('Yes')
else:
print('No') | [
"literal.number.integer.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 507,008 | 507,009 | u250664216 | python |
p02730 | s = input()
n = len(s)
s1 = s[0:(n-1)//2]
s2 = s1[::-1]
s3 = s[(n+3)//2-1:n]
s4 = s3[::-1]
if s1 == s2 and s3 == s4:
print('Yes')
else:
print('No') | s = input()
n = len(s)
s1 = s[0:(n-1)//2]
s2 = s1[::-1]
s3 = s[(n+3)//2-1:n]
s4 = s3[::-1]
if s1 == s2 == s3 == s4:
print('Yes')
else:
print('No') | [
"control_flow.branch.if.condition.change"
] | 507,010 | 507,011 | u044138790 | python |
p02730 | #-String Palindrome
import math
character = input()
re_character = character[::-1]
num = int(len(character))
middle = math.ceil(num/2.0)
print(middle)
#print(character[0:middle-1], re_character[middle:num])
#print(character[0:num], re_character[0:num])
#print (character[middle:num], re_character[0:middle-1])
if (cha... | #-String Palindrome
import math
character = input()
re_character = character[::-1]
num = int(len(character))
middle = math.ceil(num/2.0)
#print(middle)
#print(character[0:middle-1], re_character[middle:num])
#print(character[0:num], re_character[0:num])
#print (character[middle:num], re_character[0:middle-1])
if (ch... | [
"call.remove"
] | 507,026 | 507,027 | u949234226 | python |
p02730 | a = input()
if a == a[::-1]:
b = a[:int((len(a) - 1) / 2)]
c = a[int((len(a) + 3) / 2):]
if b == b[::-1] and c == c[::-1]:
print('Yes')
exit(0)
print('No')
| a = input()
if a == a[::-1]:
b = a[:int((len(a) - 1) / 2)]
c = a[int((len(a) + 3) / 2) - 1:]
if b == b[::-1] and c == c[::-1]:
print('Yes')
exit(0)
print('No')
| [
"assignment.change"
] | 507,030 | 507,031 | u428895738 | python |
p02730 | # -*- coding: utf-8 -*-
"""
Created on Thu Mar 19 11:55:12 2020
@author: 17664
"""
kaibun = input()
joken1 = kaibun[:(len(kaibun)-1)//2]
# print(joken1)
joken2 = kaibun[(len(kaibun)+2)//2:]
# print(joken2)
ans = 'no'
if kaibun == kaibun[::-1] and joken1 == joken1[::-1] and joken2 == joken2[::-1]:
ans = 'yes'
... | # -*- coding: utf-8 -*-
"""
Created on Thu Mar 19 11:55:12 2020
@author: 17664
"""
kaibun = input()
joken1 = kaibun[:(len(kaibun)-1)//2]
# print(joken1)
joken2 = kaibun[(len(kaibun)+2)//2:]
# print(joken2)
ans = 'No'
if kaibun == kaibun[::-1] and joken1 == joken1[::-1] and joken2 == joken2[::-1]:
ans = 'Yes'
... | [
"literal.string.change",
"literal.string.case.change",
"assignment.value.change"
] | 507,043 | 507,044 | u131666536 | python |
p02730 | def checkKaibun(str):
for i in range(int((len(str) - 1) / 2)):
if str[i] != str[-i - 1]:
return False
return True
s = input()
n = len(s)
c2e = int((n - 1) / 2)
c3s = int((n + 3) / 2) - 1
if not checkKaibun(s):
print('No')
elif not checkKaibun(s[0:c2e]):
print('No')
elif not checkKa... | def checkKaibun(str):
for i in range(int(len(str) / 2)):
if str[i] != str[-i - 1]:
return False
return True
s = input()
n = len(s)
c2e = int((n - 1) / 2)
c3s = int((n + 3) / 2) - 1
if not checkKaibun(s):
print('No')
elif not checkKaibun(s[0:c2e]):
print('No')
elif not checkKaibun(s... | [
"call.arguments.change",
"expression.operation.binary.remove"
] | 507,054 | 507,055 | u938227748 | python |
p02730 | S = input()
#initialize
IsKaibun = 'NO'
N = len(S)
def check_kaibun( mojiretu ):
names = len(mojiretu)
IsKaibunLocal = 'YES'
for name in range((names + 1) // 2):
if mojiretu[name] != mojiretu[names - 1 - name]:
IsKaibunLocal = 'NO'
return IsKaibunLocal
#pre check
if N%2 != 1 and... | S = input()
#initialize
IsKaibun = 'No'
N = len(S)
def check_kaibun( mojiretu ):
names = len(mojiretu)
IsKaibunLocal = 'Yes'
for name in range((names + 1) // 2):
if mojiretu[name] != mojiretu[names - 1 - name]:
IsKaibunLocal = 'No'
return IsKaibunLocal
#pre check
if N%2 != 1 and... | [
"literal.string.change",
"literal.string.case.change",
"assignment.value.change",
"control_flow.branch.if.condition.change"
] | 507,058 | 507,059 | u412139296 | python |
p02730 | S = list(input())
N = len(S)
S2 = S[:(N-1)//2+2]
if S == S[::-1] and S2 == S2[::-1]:
print('Yes')
else:
print('No') | S = input()
N = len(S)
S2 = S[:(N-1)//2]
if S == S[::-1] and S2 == S2[::-1]:
print('Yes')
else:
print('No') | [
"call.remove",
"call.arguments.change",
"expression.operation.binary.remove"
] | 507,084 | 507,085 | u279292103 | python |
p02730 | S=input()
N=len(S)
S1=S[:((N+1)/2)]
S2=S[((N+3)/2):]
if S == S[::-1] and S1 == S1[::-1] and S2 == S2[::-1]:
print("Yes")
else:
print("No") | S=input()
N=len(S)
S1=S[:int((N-1)/2)]
S2=S[int((N+1)/2):]
if S == S[::-1] and S1 == S1[::-1] and S2 == S2[::-1]:
print("Yes")
else:
print("No") | [
"call.add",
"type_conversion.to_integer.change",
"type_conversion.to_number.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"literal.number.integer.change"
] | 507,116 | 507,117 | u297089927 | python |
p02730 | def palindrome(str):
n = len(str)
for i in range(n // 2):
if str[i] != str[n - 1 - i]:
return False
return True
str = input()
is_palindrome = palindrome(str)
n = len(str)
if n % 2 == 1:
is_palindrome = palindrome(str[:(n - 1)// 2]) and palindrome(str[(n + 1) // 2:])
print("Yes" if is_palindrome else... | def palindrome(str):
n = len(str)
for i in range(n // 2):
if str[i] != str[n - 1 - i]:
return False
return True
str = input()
is_palindrome = palindrome(str)
n = len(str)
if is_palindrome and n % 2 == 1:
is_palindrome = palindrome(str[:(n - 1)// 2]) and palindrome(str[(n + 1) // 2:])
print("Yes" if ... | [
"control_flow.branch.if.condition.change"
] | 507,122 | 507,123 | u766051499 | python |
p02730 | def palindrome(str):
n = len(str)
for i in range(n // 2):
if str[i] != str[n - 1 - i]:
return False
return True
str = input()
is_palindrome = palindrome(str)
n = len(str)
if n % 2 == 1:
is_palindrome = palindrome(str[:(n - 1) // 2]) and palindrome(str[(n + 3) // 2:])
print("Yes" if is_palindrome els... | def palindrome(str):
n = len(str)
for i in range(n // 2):
if str[i] != str[n - 1 - i]:
return False
return True
str = input()
is_palindrome = palindrome(str)
n = len(str)
if is_palindrome and n % 2 == 1:
is_palindrome = palindrome(str[:(n - 1)// 2]) and palindrome(str[(n + 1) // 2:])
print("Yes" if ... | [
"control_flow.branch.if.condition.change",
"literal.number.integer.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 507,124 | 507,123 | u766051499 | python |
p02730 | def isPalindrome(s):
return s == s[::-1]
s = input()
n = len(s)
res = isPalindrome(s) and isPalindrome(s[:n//2+1]) and isPalindrome(s[n//2+2:])
print("Yes" if res else "No") | def isPalindrome(s):
return s == s[::-1]
s = input()
n = len(s)
res = isPalindrome(s) and isPalindrome(s[:n//2]) and isPalindrome(s[n//2+1:])
print("Yes" if res else "No") | [
"expression.operation.binary.remove",
"literal.number.integer.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 507,125 | 507,126 | u734529045 | python |
p02730 | s = input()
n = len(s)
for i in range(n):
if s[i] != s[-1 - i]:
print("No")
exit()
if s[:(n + 1) // 2] == s[(n + 3) // 2:]:
print("Yes")
else:
print("No")
| s = input()
n = len(s)
for i in range(n):
if s[i] != s[-1 - i]:
print("No")
exit()
if s[:(n - 1) // 2] == s[(n + 1) // 2:]:
print("Yes")
else:
print("No")
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"literal.number.integer.change"
] | 507,143 | 507,144 | u623601489 | python |
p02730 | def judge(s):
inv_str = s[::-1]
# print(inv_str)
if(s == inv_str):
return 0
else:
return 1
x = str(input())
len = len(x)
x1 = x[:int((len-1)/2)]
x2 = x[int((len+3)/2-1):]
if(judge(x1)==0 and judge(x2)==0 and judge(x)):
print("Yes")
else:
print("No")
| def judge(s):
inv_str = s[::-1]
# print(inv_str)
if(s == inv_str):
return 0
else:
return 1
x = str(input())
len = len(x)
x1 = x[:int((len-1)/2)]
x2 = x[int((len+3)/2-1):]
if(judge(x1)==0 and judge(x2)==0 and judge(x)==0):
print("Yes")
else:
print("No") | [
"control_flow.branch.if.condition.change"
] | 507,152 | 507,153 | u636665812 | python |
p02730 | S = input()
T = list(S)
Tlength = len(S)
N = int((len(S)-1)/2)
halfN1=int(N/2)
halfN2=int((Tlength+N)/2)
check=0
#print(T[Tlength-2])
#print(N)
#print(halfN1)
#print(halfN2)
for i in range(0,N):
if T[i]!=T[Tlength-1-i]:
check=1
break
for i in range(0,halfN1):
if T[i]!=T[N-1-i]:
check=1
... | S = input()
T = list(S)
Tlength = len(S)
N = int((len(S)-1)/2)
halfN1=int(N/2)
halfN2=int((Tlength+N)/2)
check=0
#print(T[Tlength-2])
#print(N)
#print(halfN1)
#print(halfN2)
for i in range(0,N):
if T[i]!=T[Tlength-1-i]:
check=1
break
for i in range(0,halfN1):
if T[i]!=T[N-1-i]:
check=1
... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 507,161 | 507,162 | u863964720 | python |
p02730 | S = input()
N = len(S)
T = list(S)
i = 0
chack = 0
while i != int((N-1)/2):
if T[i] != T[N-i-1]:
chack = 1
break
else:
i = i+1
i = 0
while i != int((N-1)/4):
if T[i] != T[int((N-1)/2-i-1)]:
chack = 1
break
else:
i = i+1
i = 0
while i != int((N-1)/4):
... | S = input()
N = len(S)
T = list(S)
i = 0
chack = 0
while i != int((N-1)/2):
if T[i] != T[N-i-1]:
chack = 1
break
else:
i = i+1
i = 0
while i != int((N-1)/4):
if T[i] != T[int((N-1)/2-i-1)]:
chack = 1
break
else:
i = i+1
i = 0
while i != int((N-1)/4):
... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 507,163 | 507,164 | u065040863 | python |
p02730 | S = input()
num = len(S)
S1 = S[:(num-1)//2]
S2 = S[(num+3)//2:]
if S == S[::-1] and S1 == S1[::-1] and S2 == S2[::-1]:
print('Yes')
else:
print('No') | S = input()
num = len(S)
S1 = S[:(num-1)//2]
S2 = S[(num+1)//2:]
if S == S[::-1] and S1 == S1[::-1] and S2 == S2[::-1]:
print('Yes')
else:
print('No')
| [
"literal.number.integer.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 507,169 | 507,170 | u370721525 | python |
p02730 | S = input()
num = len(S)
S1 = S[:(num-1)/2]
S2 = S[(num+3)/2:]
if S == S[::-1] and S1 == S1[::-1] and S2 == S2[::-1]:
print('Yes')
else:
print('No') | S = input()
num = len(S)
S1 = S[:(num-1)//2]
S2 = S[(num+1)//2:]
if S == S[::-1] and S1 == S1[::-1] and S2 == S2[::-1]:
print('Yes')
else:
print('No')
| [
"expression.operator.arithmetic.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"literal.number.integer.change"
] | 507,171 | 507,170 | u370721525 | python |
p02730 | S = list(input())
print(S)
FS = S[:int((len(S) - 1)/ 2)]
BS = S[int((len(S) + 3) / 2) -1:]
r_S = list(reversed(S))
r_FS = list(reversed(FS))
r_BS = list(reversed(BS))
flag = 0
for i in range(len(S)):
# print(r_FS, BS)
if r_S[i] == S[i] and r_FS == FS and r_BS == BS:
flag = 1
continue
else... | S = list(input())
# print(S)
FS = S[:int((len(S) - 1)/ 2)]
BS = S[int((len(S) + 3) / 2) -1:]
r_S = list(reversed(S))
r_FS = list(reversed(FS))
r_BS = list(reversed(BS))
flag = 0
for i in range(len(S)):
# print(r_FS, BS)
if r_S[i] == S[i] and r_FS == FS and r_BS == BS:
flag = 1
continue
el... | [
"call.remove"
] | 507,177 | 507,178 | u766235618 | python |
p02730 | count=0
s=input()
len_s=len(s)
center=int((len_s-1)/2+1)
s_former=s[0:center-1]
s_leter=s[center:]
for a in range(int((len(s)-1)/2-1)):
if(s[a]==s[-1-a]):
pass
else:
count+=1
for a in range(int((len(s_former)-1)/2-1)):
if(s_former[a]==s_former[-1-a]):
pass
else:
count+=1
... | count=0
s=input()
len_s=len(s)
center=int((len_s-1)/2+1)
s_former=s[0:center-1]
s_leter=s[center:]
for a in range(int((len(s)-1)/2-1)):
if(s[a]==s[-1-a]):
pass
else:
count+=1
for a in range(int((len(s_former)+1)/2)):
if(s_former[a]==s_former[-1-a]):
pass
else:
count+=1
fo... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.remove"
] | 507,195 | 507,196 | u737968367 | python |
p02730 | s = str(input())
n = len(s)
A = str(s[:n-1//2])
B = str(s[n+3//2-1:])
if s ==(s[::-1]) and A == (A[::-1]) and B == (B[::-1]):
print("Yes")
else:
print ("No") | s = str(input())
n = len(s)
A = str(s[:(n-1)//2])
B = str(s[(n+3)//2-1:])
if s ==(s[::-1]) and A == (A[::-1]) and B == (B[::-1]):
print("Yes")
else:
print ("No")
| [
"call.arguments.change"
] | 507,204 | 507,205 | u231038326 | python |
p02730 | s = str(input())
n = len(s)
A = str(s[:n-1//2])
B = str(s[n+3//2:])
if s ==(s[::-1]) and A == (A[::-1]) and B == (B[::-1]):
print("Yes")
else:
print ("No")
| s = str(input())
n = len(s)
A = str(s[:(n-1)//2])
B = str(s[(n+3)//2-1:])
if s ==(s[::-1]) and A == (A[::-1]) and B == (B[::-1]):
print("Yes")
else:
print ("No")
| [
"call.arguments.change"
] | 507,207 | 507,205 | u231038326 | python |
p02730 | s=input()
sl=len(s)
if s[:(sl-1)/2]==s[((sl+3)/2)-1:]:
print('Yes')
else :
print('No')
| s=input()
sl=len(s)
if s[:int((sl-1)/2)]==s[int(((sl+3)/2)-1):]:
print('Yes')
else :
print('No')
| [
"control_flow.branch.if.condition.change",
"call.add"
] | 507,221 | 507,222 | u129961029 | python |
p02730 | S = list(input())
def f(s):
n = len(s)//2
for i in range(n):
if s[i] != s[-i - 1]:
return False
return True
N = len(S)
if f(S[:(N - 1) // 2]) and f(S[(N + 3) // 2 - 1:]):
print('Yes')
else:
print('No')
| S = list(input())
def f(s):
n = len(s)//2
for i in range(n):
if s[i] != s[-i - 1]:
return False
return True
N = len(S)
if f(S[:(N - 1) // 2]) and f(S[(N + 3) // 2 - 1:]) and f(S):
print('Yes')
else:
print('No')
| [
"control_flow.branch.if.condition.change"
] | 507,229 | 507,230 | u500297289 | python |
p02730 | S=input()
N=len(S)
S1=S[:(N-1)//2]
S2=S[(N+3)//2:]
if S==S[::-1] and S1==S1[::-1] and S2==S2[::-1]:
print("Yes")
else:
print("No") | S=input()
N=len(S)
S1=S[:(N-1)//2]
S2=S[(N+1)//2:]
if S==S[::-1] and S1==S1[::-1] and S2==S2[::-1]:
print("Yes")
else:
print("No") | [
"literal.number.integer.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 507,237 | 507,238 | u718411265 | python |
p02730 | S = input()
N = len(S)
Sd = S[:(N-1)//2]
Sdd = S[(N+1)//2:N]
print(Sd,Sdd)
if S == S[::-1] and Sd == Sd[::-1] and Sdd == Sdd[::-1]:
print("Yes")
else:
print("No") | S = input()
N = len(S)
Sd = S[:(N-1)//2]
Sdd = S[(N+1)//2:N]
if S == S[::-1] and Sd == Sd[::-1] and Sdd == Sdd[::-1]:
print("Yes")
else:
print("No") | [
"call.remove"
] | 507,242 | 507,243 | u164029270 | python |
p02730 | n = len(s)
sa = s[:(n-1)//2]
sb = s[(n+3)//2-1:n]
if s == s[::-1] and sa == sa[::-1] and sb == sb[::-1]:
print("Yes")
else:
print("No") | s = input()
n = len(s)
sa = s[:(n-1)//2]
sb = s[(n+3)//2-1:n]
if s == s[::-1] and sa == sa[::-1] and sb == sb[::-1]:
print("Yes")
else:
print("No")
| [
"assignment.add"
] | 507,244 | 507,245 | u804339040 | python |
p02730 | n = len(s)
sa = s[:int((n-1)/2)]
sb = s[int((n+3)/2)-1:]
if s == s[::-1] and sa == sa[::-1] and sb == sb[::-1]:
print("Yes")
else:
print("No")
| s = input()
n = len(s)
sa = s[:int((n-1)/2)]
sb = s[int((n+3)/2)-1:]
if s == s[::-1] and sa == sa[::-1] and sb == sb[::-1]:
print("Yes")
else:
print("No")
| [
"assignment.add"
] | 507,246 | 507,247 | u804339040 | python |
p02730 | # coding: utf-8
S = input()
def check(S):
ret = True
for i in range(len(S)//2):
if S[i] != S[-i-1]:
ret = False
return ret
if len(S) == 3:
if S[0] != S[-1]:
print("No")
else:
print("Yes")
exit()
flag = True
if not check(S):
flag = False
if not check(S[:(le... | # coding: utf-8
S = input()
def check(S):
ret = True
for i in range(len(S)//2):
if S[i] != S[-i-1]:
ret = False
return ret
if len(S) == 3:
if S[0] != S[-1]:
print("No")
else:
print("Yes")
exit()
flag = True
if not check(S):
flag = False
if not check(S[:(le... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 507,252 | 507,253 | u580697892 | python |
p02730 | def kaibun(s):
n=len(s)
a=True
if n%2==0:
for i in range(n/2):
if s[i]!=s[n-1-i]:
a=False
else:
for i in range((n-1)/2):
if s[i]!=s[n-1-i]:
a=False
return a
S=input()
N=len(S)
if kaibun(S)==True and kaibun(S[0:(N-1)/2])==True and kaibun(S[(N+3)/2-1:N])==True:
print("Yes")... | def kaibun(s):
n=len(s)
a=True
if n%2==0:
for i in range(n//2):
if s[i]!=s[n-1-i]:
a=False
else:
for i in range((n-1)//2):
if s[i]!=s[n-1-i]:
a=False
return a
S=input()
N=len(S)
if kaibun(S)==True and kaibun(S[0:(N-1)//2])==True and kaibun(S[(N+3)//2-1:N])==True:
print("Y... | [
"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"
] | 507,254 | 507,255 | u953499988 | python |
p02730 | def ispalindrome(s):
print(s)
l=len(s)
for i in range(l//2):
if s[i]!=s[l-i-1]:
return False
return True
s=input()
l=len(s)
if ispalindrome(s) and ispalindrome(s[:l//2]) and ispalindrome(s[(l+1)//2:]):
print("Yes")
else:
print("No")
| def ispalindrome(s):
#print(s)
l=len(s)
for i in range(l//2):
if s[i]!=s[l-i-1]:
return False
return True
s=input()
l=len(s)
if ispalindrome(s) and ispalindrome(s[:l//2]) and ispalindrome(s[(l+1)//2:]):
print("Yes")
else:
print("No")
| [
"call.remove"
] | 507,276 | 507,277 | u261843559 | python |
p02730 | S = input()
N = len(S)
flag1 = (S == S[::-1])
s = S[0:(N - 3)//2]
flag2 = (s == s[::-1])
if flag1 and flag2:
print("Yes")
else:
print("No")
| S = input()
N = len(S)
flag1 = (S == S[::-1])
s = S[0:(N - 1)//2]
flag2 = (s == s[::-1])
if flag1 and flag2:
print("Yes")
else:
print("No")
| [
"literal.number.integer.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 507,282 | 507,283 | u508426820 | python |
p02730 | s = input()
length = len(s)
def palindrome(string):
if s == s[::-1]:
return True
else:
return False
if palindrome(s) and palindrome(s[:(length-1)//2]) and palindrome(s[(length+1)//2:]):
print('Yes')
else:
print('No') | s = input()
length = len(s)
def palindrome(string):
if string == string[::-1]:
return True
else:
return False
if palindrome(s) and palindrome(s[:(length-1)//2]) and palindrome(s[(length+1)//2:]):
print('Yes')
else:
print('No') | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 507,302 | 507,303 | u064963667 | python |
p02730 | s=input()
n=len(s)
count=0
a=(n-1)//2
b=(n+3)//2
for i in range(n//2):
if s[i]!=s[-abs(i+1)]:
count+=1
for i in range(a//2):
c=ord(s[i])
d=ord(s[(a-1-i)])
if c!=d:
count+=1
for i in range((n-b+1)//2):
c=ord(s[n-i])
d=ord(s[b-1+i])
if c!=d:
count+=1
if count!=0:
print('No')
else:
pri... | s=input()
n=len(s)
count=0
a=(n-1)//2
b=(n+3)//2
for i in range(n//2):
if s[i]!=s[-abs(i+1)]:
count+=1
for i in range(a//2):
c=ord(s[i])
d=ord(s[(a-1-i)])
if c!=d:
count+=1
for i in range((n-b+1)//2):
c=ord(s[-(i+1)])
d=ord(s[b-1+i])
if c!=d:
count+=1
if count!=0:
print('No')
else:
... | [
"call.arguments.change"
] | 507,313 | 507,314 | u460386402 | python |
p02730 | S=str(input())
import sys
t=0
lista=[]
for i in range(99):
try:
lista.append(S[i])
t=t+1
except IndexError:
break
u=t//2
v=u//2+1
p=1
for i in range(v):
if S[i]==S[u-i-1] and S[u-i+1]==S[u+i+1] and S[u+i+1]==S[t-1-i]:
p=p*1
else:
print ('No')
sys.exit()
print ('Yes') | S=str(input())
import sys
t=0
lista=[]
for i in range(99):
try:
lista.append(S[i])
t=t+1
except IndexError:
break
u=t//2
v=u//2+1
p=1
for i in range(v):
if S[i]==S[u-i-1] and S[u-i-1]==S[u+i+1] and S[u+i+1]==S[t-1-i]:
p=p*1
else:
print ('No')
sys.exit()
pr... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 507,336 | 507,337 | u685684561 | python |
p02730 | S=input();print("YNeos"[S==S[::-1]and S.endswith(S[:len(S)//2])::2]) | S=input();print("YNeos"[S!=S[::-1]or 1-S.endswith(S[:len(S)//2])::2]) | [
"misc.opposites",
"expression.operator.compare.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"io.output.change"
] | 507,361 | 507,362 | u570944601 | python |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.