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 |
|---|---|---|---|---|---|---|---|
p02729 | N,M = map(int,input())
ans = (N-1)*N/2
ans =ans + (M-1)*M/2
print(ans) | N,M = map(int,input().split())
ans = (N-1)*N//2
ans =ans + (M-1)*M//2
print(ans) | [
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 505,401 | 505,402 | u546573715 | python |
p02729 | #abc159 a
n,m=map(int,input().split())
ans=n*(n-1)/2+(m-1)/2
print(ans)
| #abc159 a
n,m=map(int,input().split())
ans=n*(n-1)/2+m*(m-1)/2
print(int(ans)) | [
"call.add",
"call.arguments.change"
] | 505,426 | 505,425 | u723583932 | python |
p02729 | N, M = map(int,input().split())
return(int(N*(N-1)//2 + M*(M-1)//2))
| N, M = map( int, input().split() )
print(int(N * (N-1)//2 + M * (M-1)//2))
| [
"function.return_value.change"
] | 505,441 | 505,442 | u412139296 | python |
p02729 | N, M = map(int,input().split())
print(int(N(N-1)//2 + M(M-1)//2))
| N, M = map( int, input().split() )
print(int(N * (N-1)//2 + M * (M-1)//2))
| [
"call.arguments.change"
] | 505,443 | 505,442 | u412139296 | python |
p02729 | N,M = map(int,input().split())
return(int(N*(N-1)//2 + M*(M-1)//2)) | N, M = map( int, input().split() )
print(int(N * (N-1)//2 + M * (M-1)//2))
| [
"function.return_value.change"
] | 505,445 | 505,442 | u412139296 | python |
p02729 | n,m = map(int, input().split())
print(int(((n+m)*(n+m-1)-n*m)/2))
| n,m = map(int, input().split())
print(int(((n+m)*(n+m-1)/2-n*m)))
| [
"expression.operation.binary.remove"
] | 505,446 | 505,447 | u417589709 | python |
p02729 | n,m = map(int, input().split())
print(int((n+m)*(n+m-1)-n*m))
| n,m = map(int, input().split())
print(int(((n+m)*(n+m-1)/2-n*m)))
| [
"call.arguments.change"
] | 505,448 | 505,447 | u417589709 | python |
p02729 | n,m = map(int, input().split())
print(int((n+m)*(n+m-1))-n*m) | n,m = map(int, input().split())
print(int(((n+m)*(n+m-1)/2-n*m)))
| [
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change",
"call.arguments.add"
] | 505,449 | 505,447 | u417589709 | python |
p02729 | N, M = map(int,input().split())
X = N*(N+1)/2 + M*(M+1)/2
print(X) | N, M = map(int,input().split())
X = int(N*(N-1)/2 + M*(M-1)/2)
print(X) | [
"call.add",
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change",
"call.arguments.change"
] | 505,496 | 505,495 | u487044452 | python |
p02729 | a,b=map(int,input().split())
print(a*(a-1)//2+b(b-1)//2) | a,b=map(int,input().split())
print(a*(a-1)//2+b*(b-1)//2)
| [
"call.arguments.change"
] | 505,499 | 505,500 | u350248178 | python |
p02729 | n,m=map(int,input().split())
print(n(n-1)/2+m(m-1)/2) | n,m=map(int,input().split())
print(n*(n-1)//2+m*(m-1)//2) | [
"call.arguments.change",
"expression.operator.arithmetic.change",
"expression.operation.binary.change",
"io.output.change"
] | 505,511 | 505,509 | u471539833 | python |
p02729 | n.m=map(int,input().split())
print(n(n-1)/2+m(m-1)/2) | n,m=map(int,input().split())
print(n*(n-1)//2+m*(m-1)//2) | [
"misc.typo",
"assignment.variable.change",
"call.arguments.change",
"expression.operator.arithmetic.change",
"expression.operation.binary.change",
"io.output.change"
] | 505,512 | 505,509 | u471539833 | python |
p02729 | a = list(map(int, input().split()))
print(int(a[0]*(a[0]-1)+a[1]*(a[1]-1))) | a = list(map(int, input().split()))
print(int((a[0]*(a[0]-1)+a[1]*(a[1]-1))/2)) | [
"call.arguments.change"
] | 505,515 | 505,516 | u215334265 | python |
p02729 | A=input()
L=A.split()
N=int(L[0])
M=int(L[1])
x=1
for n in range(1,N+1):
x*=n
x /= 2
y=1
for m in range(1,M+1):
y*=m
y /= 2
print(int(x+y)) | A=input()
L=A.split()
N=int(L[0])
M=int(L[1])
x=1
for n in range(N-1,N+1):
x*=n
x /= 2
y=1
for m in range(M-1,M+1):
y*=m
y /= 2
print(int(x+y)) | [
"control_flow.loop.range.bounds.lower.change",
"expression.operation.binary.add"
] | 505,614 | 505,615 | u205303316 | python |
p02729 | a,=b=map(int,input().split())
print(a*(a-1)/2+b*(b-1)/2) | a,b=map(int,input().split())
print (a*(a-1)//2+b*(b-1)//2)
| [
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 505,670 | 505,669 | u433172603 | python |
p02729 | import math
n, m = map(int, input().split())
ans = n*(n-1)//2 + m(m-1)//2
print(ans)
| import math
n, m = map(int, input().split())
ans = n*(n-1)//2 + m*(m-1)//2
print(ans)
| [] | 505,752 | 505,753 | u280552586 | python |
p02729 | if __name__ == '__main__':
n , m = map(int, input().split())
print(((n * n - 1) / 2 )+ ((m * m - 1)/2)) | if __name__ == '__main__':
n , m = map(int, input().split())
print( ((n * (n - 1)) // 2 ) + ((m * (m - 1))//2))
| [
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 505,754 | 505,755 | u236823931 | python |
p02729 | from sys import stdin,setrecursionlimit
n,m = map(int,stdin.readline().rstrip().split())
print(n*(n-1)+m*(m-1)) | from sys import stdin,setrecursionlimit
n,m = map(int,stdin.readline().rstrip().split())
print(n*(n-1)//2+m*(m-1)//2) | [
"expression.operation.binary.add"
] | 505,759 | 505,760 | u987164499 | python |
p02729 | m,n=map(int,input().split())
print(m*(m-1)+n*(n-1)) | m,n=map(int,input().split())
print(m*(m-1)//2+n*(n-1)//2) | [
"expression.operation.binary.add"
] | 505,820 | 505,819 | u289036437 | python |
p02729 | n, m = map(lambda i: int(i), input().split())
if n == 1 and m ==1:
print(0)
print(int(n*(n-1)/2 + m*(m-1)/2)) | n, m = map(lambda i: int(i), input().split())
if n == 1 and m ==1:
print(0)
else:
print(int(n*(n-1)/2 + m*(m-1)/2)) | [] | 505,842 | 505,843 | u439333295 | python |
p02729 | N,M = map(int,input().split())
if (N == 0 or N == 1) and (M == 0 or M == 1):
print(0)
if (N == 0 or N == 1) and M != 0 and M != 1:
print(M*(M-1)//2)
if N != 0 and N != 1 and (M == 0 or M == 1):
print(N*(N-1)//2)
else:
print(N*(N-1)//2 + M*(M-1)//2) | N,M = map(int,input().split())
if (N == 0 or N == 1) and (M == 0 or M == 1):
print(0)
elif (N == 0 or N == 1) and M != 0 and M != 1:
print(M*(M-1)//2)
elif N != 0 and N != 1 and (M == 0 or M == 1):
print(N*(N-1)//2)
else:
print(N*(N-1)//2 + M*(M-1)//2) | [
"control_flow.branch.if.replace.remove",
"control_flow.branch.else_if.replace.add"
] | 506,047 | 506,048 | u623953567 | python |
p02729 | def solve():
a, b = list(map(int, input().split()))
if a == 0 and b == 0:
print(0)
return
if a == 0:
ans = b * (b - 1) // 2
print(ans)
if b == 0:
ans = a * (a - 1) // 2
print(ans)
ans = a * (a - 1) // 2
ans += b * (b - 1) // 2
p... | def solve():
a, b = list(map(int, input().split()))
if a == 0 and b == 0:
print(0)
return
if a == 0:
ans = b * (b - 1) // 2
print(ans)
return
if b == 0:
ans = a * (a - 1) // 2
print(ans)
return
ans = a * (a - 1) // 2
... | [
"control_flow.return.add"
] | 506,055 | 506,056 | u646818123 | python |
p02729 | a = list(map(int, input().split()))
if a[0]<=1:
n=0
else:
n=a[0]*(a[0]-1)/2
if a[1]<=1:
m=0
else:
m=a[1]*(a[1]-1)/2
print(n+m) | a = list(map(int, input().split()))
if a[0]==1:
n=0
else:
n=a[0]*(a[0]-1)/2
if a[1]==1:
m=0
else:
m=a[1]*(a[1]-1)/2
print(int(n+m)) | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"call.add",
"call.arguments.change"
] | 506,057 | 506,058 | u193927973 | python |
p02729 | N, M = map(int, input().split())
ans = N * (N + 1) / 2 + M * (M + 1) / 2
print(int(ans)) | N, M = map(int, input().split())
ans = N * (N - 1) / 2 + M * (M - 1) / 2
print(int(ans)) | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 506,119 | 506,120 | u663438907 | python |
p02729 | N, M = map(int, input().split())
ans = N*(N-1)/2 + M(M-1)/2
print(ans) | N, M = map(int, input().split())
ans = N*(N-1)/2 + M*(M-1)/2
print(int(ans)) | [
"call.add",
"call.arguments.change"
] | 506,147 | 506,148 | u971096161 | python |
p02729 | n, m =map(int,input().split())
ans=n*(n-1)+m*(m-1)
print(ans) | n, m =map(int,input().split())
ans=n*(n-1)//2+m*(m-1)//2
print(ans) | [
"assignment.change"
] | 506,163 | 506,164 | u994521204 | python |
p02730 | w = input()
l = len(w)
flag = True
for i in range((l - 1)/2):
if w[i] != w[l - i - 1]:
flag = False
break
mid = (l - 1)/2
mid_mid = mid // 2
for i in range(mid_mid + 1):
if w[i] != w[mid - i - 1] or not flag:
flag = False
break
if w[i + mid + 1] != w[l - i - 1]:
flag = False
break
if flag:... | w = input()
l = len(w)
flag = True
for i in range((l - 1)//2):
if w[i] != w[l - i - 1]:
flag = False
break
mid = (l - 1) // 2
mid_mid = mid // 2
for i in range(mid_mid + 1):
if w[i] != w[mid - i - 1] or not flag:
flag = False
break
if w[i + mid + 1] != w[l - i - 1]:
flag = False
break
if f... | [
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change",
"assignment.value.change"
] | 506,176 | 506,177 | u179376941 | python |
p02730 | S=input()
N=len(S)
SH=S[:(N-1)//2]
ST=S[(N+3)//2-1:]
p=False
if SH==SH[::-1] and ST==ST[::-1]:
p=True
print("Yes" if p else "No") | S=input()
N=len(S)
SH=S[:(N-1)//2]
ST=S[(N+3)//2-1:]
p=False
if SH==SH[::-1] and SH==ST:
p=True
print("Yes" if p else "No") | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 506,182 | 506,183 | u054825571 | python |
p02730 | def is_p(s):
return s == s[::-1]
s = input()
n = len(s)
l, r = (n - 1)//2, l + 1
print('Yes' if is_p(s) and is_p(s[:l]) and is_p(s[r:]) else 'No') | def is_p(s):
return s == s[::-1]
s = input()
n = len(s)
l = (n - 1)//2
r = l + 1
print('Yes' if is_p(s) and is_p(s[:l]) and is_p(s[r:]) else 'No') | [
"assignment.variable.change"
] | 506,189 | 506,190 | u347600233 | python |
p02730 | a=int(input())
c=len(a)
b=a[:(c-1)//2]
d=a[(c+3)//2:]
if a==a[::-1] and b==b[::-1] and d==d[::-1]:
print("Yes")
else:
print("No") | a=input()
c=len(a)
b=a[:(c-1)//2]
d=a[(c+3)//2-1:]
if a==a[::-1] and b==b[::-1] and d==d[::-1]:
print("Yes")
else:
print("No") | [
"call.remove",
"call.arguments.change"
] | 506,191 | 506,192 | u000037600 | python |
p02730 | from sys import stdin,stdout
import bisect
import math
def st():
return list(stdin.readline().strip())
def inp():
return int(stdin.readline())
def li():
return list(map(int,stdin.readline().split()))
def mp():
return map(int,stdin.readline().split())
def pr(n):
stdout.write(str(n)+"\n")
def... | from sys import stdin,stdout
import bisect
import math
def st():
return list(stdin.readline().strip())
def inp():
return int(stdin.readline())
def li():
return list(map(int,stdin.readline().split()))
def mp():
return map(int,stdin.readline().split())
def pr(n):
stdout.write(str(n)+"\n")
def... | [
"assignment.change"
] | 506,205 | 506,206 | u259190728 | python |
p02730 | S=input()
T=S[:(len(S)-1)//2-1]
U=S[(len(S)+3)//2-1:]
if S==S[::-1]:
if T==T[::-1]:
if U==U[::-1]:
print('Yes')
else:print('No')
else:print('No')
else:print('No') | S=input()
T=S[:(len(S)-1)//2]
U=S[(len(S)+3)//2-1:]
if S==S[::-1]:
if T==T[::-1]:
if U==U[::-1]:
print('Yes')
else:print('No')
else:print('No')
else:print('No') | [
"expression.operation.binary.remove"
] | 506,211 | 506,212 | u729119068 | python |
p02730 | S = input()
N = len(S)
def isp(s):
n = len(s)
for i in range(n // 2 - 1):
if s[i] != s[n - 1 - i]:
return False
return True
if isp(S) and isp(S[0:(N - 1) // 2]):
print("Yes")
else:
print("No") | S = input()
N = len(S)
def isp(s):
n = len(s)
for i in range(n // 2):
if s[i] != s[n - 1 - i]:
return False
return True
if isp(S) and isp(S[0:(N - 1) // 2]):
print("Yes")
else:
print("No") | [
"expression.operation.binary.remove"
] | 506,213 | 506,214 | u849756457 | python |
p02730 | S = input()
N = len(S)
def isp(s):
n = len(s)
for i in range(n // 2 - 1):
if s[i] != s[n - 1 - i]:
return False
return True
if isp(S) and isp(S[0:(N - 1) / 3]):
print("Yes")
else:
print("No") | S = input()
N = len(S)
def isp(s):
n = len(s)
for i in range(n // 2):
if s[i] != s[n - 1 - i]:
return False
return True
if isp(S) and isp(S[0:(N - 1) // 2]):
print("Yes")
else:
print("No") | [
"expression.operation.binary.remove"
] | 506,215 | 506,214 | u849756457 | python |
p02730 | s = input()
n = len(s)
t = s[:(n-1)//2]
u = s[(n+3)//2:]
if (s == s[::-1]
and t == t[::-1]
and u == u[::-1]):
print('Yes')
else:
print('No')
| s = input()
n = len(s)
t = s[:(n-1)//2]
u = s[(n+3)//2-1:]
if (s == s[::-1]
and t == t[::-1]
and u == u[::-1]):
print('Yes')
else:
print('No')
| [
"assignment.change"
] | 506,216 | 506,217 | u091307273 | python |
p02730 | S=str(input())
N=len(S)
if S!=S[::-1]:#Sと反転したSが不一致
print('No')
else:
S1=S[0:(N-1)//2]#Sが1文字目～(N-1)/2番目の場合
S2=S[(N+3)//2:N]#Sが(N+3)/2～N番目の場合
if S1==S1[::-1] and S2==S2[::-1]:
print('Yes')
else:
print('No') | S=str(input())
N=len(S)
if S!=S[::-1]:#Sと反転したSが不一致
print('No')
else:
S1=S[0:(N-1)//2]#Sが1文字目～(N-1)/2番目の場合
S2=S[(N+1)//2:N]#Sが(N+3)/2～N番目の場合
if 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"
] | 506,224 | 506,225 | u799428010 | python |
p02730 | S=str(input())
N=len(S)
if S!=S[::-1]:#Sと反転したSが不一致
print('No')
else:
S1=S[:(N-1)/2]#Sが1文字目～(N-1)/2番目の場合
S2=S[(N+3)/2:]#Sが(N+3)/2～N番目の場合
if S1==S1[::-1] and S2==S2[::-1]:
print('Yes')
else:
print('No') | S=str(input())
N=len(S)
if S!=S[::-1]:#Sと反転したSが不一致
print('No')
else:
S1=S[0:(N-1)//2]#Sが1文字目～(N-1)/2番目の場合
S2=S[(N+1)//2:N]#Sが(N+3)/2～N番目の場合
if 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"
] | 506,226 | 506,225 | u799428010 | python |
p02730 | def palindrome(S):
for i in range(len(S)//2):
# print(S[i],S[-(i+1)])
if S[i] != S[-(i+1)]:
return 0
return 1
ans = "No"
S = input()
S1 = S[:(len(S)-1)//2]
S2 = S[(len(S)+3)//2:]
if palindrome(S) == 1:
if palindrome(S1) == 1:
if palindrome(S2) == 1:
ans == "Yes"
print(ans) | def palindrome(S):
for i in range(len(S)//2):
# print(S[i],S[-(i+1)])
if S[i] != S[-(i+1)]:
return 0
return 1
ans = "No"
S = input()
S1 = S[:(len(S)-1)//2]
S2 = S[(len(S)+1)//2:]
#print(palindrome(S))
#print(palindrome(S1))
#print(palindrome(S2))
if palindrome(S) == 1:
if palindrome(S1) == 1:
if... | [
"literal.number.integer.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 506,227 | 506,228 | u967484343 | python |
p02730 | def palindrome(S):
for i in range(len(S)//2):
# print(S[i],S[-(i+1)])
if S[i] != S[-(i+1)]:
return 0
return 1
ans = "No"
S = input()
S1 = S[:(len(S)-1)//2]
S1 = S[(len(S)+3)//2:]
if palindrome(S) == 1:
if palindrome(S1) == 1:
if palindrome(S2) == 1:
ans == "Yes"
print(ans) | def palindrome(S):
for i in range(len(S)//2):
# print(S[i],S[-(i+1)])
if S[i] != S[-(i+1)]:
return 0
return 1
ans = "No"
S = input()
S1 = S[:(len(S)-1)//2]
S2 = S[(len(S)+1)//2:]
#print(palindrome(S))
#print(palindrome(S1))
#print(palindrome(S2))
if palindrome(S) == 1:
if palindrome(S1) == 1:
if... | [
"assignment.variable.change",
"identifier.change",
"literal.number.integer.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 506,229 | 506,228 | u967484343 | python |
p02730 | s = input()
t = s[::-1]
n = len(s)
a = s[:(N - 1) // 2]
b = t[:(n + 3) // 2]
if s == t and a == a[::-1] and b == b[::-1]:
print('Yes')
else:
print('No') | s = input()
t = s[::-1]
n = len(s)
a = s[:(n - 1) // 2]
b = t[:(n - 1) // 2]
if s == t and a == a[::-1] and b == b[::-1]:
print('Yes')
else:
print('No') | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 506,232 | 506,233 | u671889550 | python |
p02730 | s = input()
t = s[::-1]
n = len(S)
a = s[:(N - 1) // 2]
b = t[:(n + 3) // 2]
if s == t and a == a[::-1] and b == b[::-1]:
print('Yes')
else:
print('No') | s = input()
t = s[::-1]
n = len(s)
a = s[:(n - 1) // 2]
b = t[:(n - 1) // 2]
if s == t and a == a[::-1] and b == b[::-1]:
print('Yes')
else:
print('No') | [
"misc.typo",
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 506,234 | 506,233 | u671889550 | python |
p02730 | import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
def s(): return input()
def k(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def X(): return list(input())
def L(): return list(i... | import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
def s(): return input()
def k(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def X(): return list(input())
def L(): return list(i... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 506,235 | 506,236 | u750651325 | python |
p02730 | S = input()
N = len(S)
a = S[:N // 2]
b = S[N // 2 + 1:]
print('Yes' if a==a[::-1] and b==b[::-1] else 'No')
| S = input()
N = len(S)
a = S[:N // 2]
b = S[N // 2 + 1:]
print('Yes' if a == a[::-1] == b == b[::-1] else 'No')
| [
"call.arguments.change",
"io.output.change"
] | 506,239 | 506,240 | u844789719 | python |
p02730 | S = input()
array = list(S)
N = len(array)
a = (N-2)//2
b = (N+2)//2
if array[0:a] == array[b:N-1]:
print('Yes')
else:
print('No') | S = input()
array = list(S)
N = len(array)
a = (N-2)//2
b = (N+2)//2
if array[0:a+1] == array[b:N]:
print('Yes')
else:
print('No') | [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 506,269 | 506,270 | u768636516 | python |
p02730 | def resolve():
s = input()
if s == s[::1]:
s_1 = s[:len(s)//2]
s_2 = s[(len(s)+1)//2:]
if (s_1 == s_1[::-1]) and (s_2 == s_2[::-1]):
print('Yes')
else:
print('No')
else:
print('No')
resolve() | def resolve():
s = input()
if s == s[::-1]:
s_1 = s[:len(s)//2]
s_2 = s[(len(s)+1)//2:]
if (s_1 == s_1[::-1]) and (s_2 == s_2[::-1]):
print('Yes')
else:
print('No')
else:
print('No')
resolve() | [
"expression.operation.unary.add",
"control_flow.branch.if.condition.change"
] | 506,272 | 506,273 | u405733072 | python |
p02730 | def resolve():
s = input()
if s == s[::1]:
s_1 = s[:len(s)//2]
s_2 = s[(len(s)+1)//2:]
if s_1 == s_1[::-1] and s_2 == s_2[::-1]:
print('Yes')
else:
print('No')
else:
print('No')
resolve() | def resolve():
s = input()
if s == s[::-1]:
s_1 = s[:len(s)//2]
s_2 = s[(len(s)+1)//2:]
if (s_1 == s_1[::-1]) and (s_2 == s_2[::-1]):
print('Yes')
else:
print('No')
else:
print('No')
resolve() | [
"expression.operation.unary.add",
"control_flow.branch.if.condition.change"
] | 506,274 | 506,273 | u405733072 | python |
p02730 | S = input()
flag = 0
for i in range(0,len(S)//2):
if S[i] == S[-1-i]:
continue
else:
flag = 1
print("No")
break
if flag == 0:
S = S[:((len(S)-1)//2)]
print(S)
for i in range(0,len(S)//2):
if S[i] == S[-1-i]:
continue
else:
flag ... | S = input()
flag = 0
for i in range(0,len(S)//2):
if S[i] == S[-1-i]:
continue
else:
flag = 1
print("No")
break
if flag == 0:
S = S[:((len(S)-1)//2)]
for i in range(0,len(S)//2):
if S[i] == S[-1-i]:
continue
else:
flag = 1
... | [
"call.remove"
] | 506,278 | 506,279 | u208133431 | python |
p02730 | kaibunkai = input()
n = len(kaibunkai)
zenhan = kaibunkai[:(n-1)//2]
kouhan = kaibunkai[(n+3)//2-1:]
print(zenhan,kouhan)
def kaibun_desuka(bun):
s = len(bun)
for x in range(s//2):
if bun[x] != bun[-x-1]:
return False
return True
if kaibun_desuka(kaibunkai) and kaibun_desuka(zenhan) and kaibun_desuka... | kaibunkai = input()
n = len(kaibunkai)
zenhan = kaibunkai[:(n-1)//2]
kouhan = kaibunkai[(n+3)//2-1:]
def kaibun_desuka(bun):
s = len(bun)
for x in range(s//2):
if bun[x] != bun[-x-1]:
return False
return True
if kaibun_desuka(kaibunkai) and kaibun_desuka(zenhan) and kaibun_desuka(kouhan):
print("Ye... | [
"call.remove"
] | 506,300 | 506,301 | u904331908 | python |
p02730 | import math
s = list(input())
n = len(s)
s1 = s[ : n-1 // 2]
s2 = s[n+3 // 2 - 1 : n]
flag = 1
for i in range(len(s) // 2):
if s[i] != s[- i - 1]:
flag = 0
for i in range(len(s1) // 2):
if s1[i] != s1[- i - 1]:
flag = 0
for i in range(len(s2) // 2):
if s2[i] != s2[- i - 1]:
flag =... | import math
s = list(input())
n = len(s)
s1 = s[ : (n-1) // 2]
s2 = s[(n+3) // 2 - 1 : n]
flag = 1
for i in range(len(s) // 2):
if s[i] != s[- i - 1]:
flag = 0
for i in range(len(s1) // 2):
if s1[i] != s1[- i - 1]:
flag = 0
for i in range(len(s2) // 2):
if s2[i] != s2[- i - 1]:
fl... | [] | 506,305 | 506,306 | u491462774 | python |
p02730 | s = input()
for i in [s, s[:len(s)], s[len(s)+1:]]:
if i != i[::-1]:
print("No")
break
else:
print("Yes") | s = input()
for i in [s, s[:len(s)//2], s[len(s)//2+1:]]:
if i != i[::-1]:
print("No")
break
else:
print("Yes") | [
"expression.operation.binary.add"
] | 506,318 | 506,319 | u468972478 | python |
p02730 | def check(a):
for i in range(int(len(a)/2)):
if a[i]!=a[-(i+1)]:
return False
return True
S=input()
if kaibun(S):
a=S[0:int(len(S)/2)]
b=S[int(len(S)/2)+1:len(S)]
if kaibun(a) and kaibun(b):
print('Yes')
else:
print('No')
else:
print('No') | def check(a):
for i in range(int(len(a)/2)):
if a[i]!=a[-(i+1)]:
return False
return True
S=input()
if check(S):
a=S[0:int(len(S)/2)]
b=S[int(len(S)/2)+1:len(S)]
if check(a) and check(b):
print('Yes')
else:
print('No')
else:
print('No') | [
"identifier.change",
"call.function.change",
"control_flow.branch.if.condition.change"
] | 506,336 | 506,337 | u159144188 | python |
p02730 | S = input()
S_list = list(S)
N = len(S_list)
no_flag = 0
for i in range(N//2):
if S_list[i] != S_list[N-i-1]:
no_flag = 1
for i in range(int((N-1)/2)//2 -1):
if S_list[i] != S_list[(N-1)/2-i-1]:
no_flag = 1
for i in range((N-3)//2-1):
if S_list[(N+3)//2+i-1] != S_list[N-1-i]:
no_... | S = input()
S_list = list(S)
N = len(S_list)
#print(N)
no_flag = 0
for i in range(N//2):
if S_list[i] != S_list[N-i-1]:
no_flag = 1
for i in range(int((N-1)/2)//2):
#print(S_list[i], S_list[(N-1)//2-i-1])
if S_list[i] != S_list[(N-1)//2-i-1]:
no_flag = 1
for i in range((N-3)//2):
#pr... | [
"expression.operation.binary.remove",
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 506,340 | 506,341 | u355853184 | python |
p02730 | S=input()
N=len(S)
r_S=S[::-1]
c1=int((N-1)/2)
c2=int((N+3)/2)
S1=S[:c1]
r_S1=S1[::-1]
S2=S[(c2-1):]
r_S2=S2[::-1]
#kaibun hantei
if S1==r_S1 and S1==r_S1 and S2==r_S2:
print("Yes")
else:
print("No") | S=input()
N=len(S)
r_S=S[::-1]
c1=int((N-1)/2)
c2=int((N+3)/2)
S1=S[:c1]
r_S1=S1[::-1]
S2=S[(c2-1):]
r_S2=S2[::-1]
#kaibun hantei
if S==r_S and S1==r_S1 and S2==r_S2:
print("Yes")
else:
print("No") | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 506,347 | 506,348 | u982471399 | python |
p02730 | def resolve():
def is_rotatable(S):
print(S)
for i in range(len(S)//2):
if S[i] != S[-1-i]:
return False
return True
S = input()
N = len(S)
if is_rotatable(S) and is_rotatable(S[:N//2]) and is_rotatable(S[(N//2)+1:]):
print("Yes")
else:
... | def resolve():
def is_rotatable(S):
for i in range(len(S)//2):
if S[i] != S[-1-i]:
return False
return True
S = input()
N = len(S)
if is_rotatable(S) and is_rotatable(S[:N//2]) and is_rotatable(S[(N//2)+1:]):
print("Yes")
else:
print("No")
... | [
"call.remove"
] | 506,349 | 506,350 | u106797249 | python |
p02730 | S = input()
flag = 0
for i in range(0, len(S), 1):
if S[i] != S[len(S)-1-i]:
flag = 1
for i in range(0, (len(S) + 1) //2, 1):
if S[i] != S[len(S)//2-1-i]:
flag = 1
if flag == 0:
print("Yes")
else:
print("No") | S = input()
flag = 0
for i in range(0, len(S), 1):
if S[i] != S[len(S)-1-i]:
flag = 1
for i in range(0, len(S)//2, 1):
if S[i] != S[len(S)//2-1-i]:
flag = 1
if flag == 0:
print("Yes")
else:
print("No") | [
"call.arguments.change",
"expression.operation.binary.remove"
] | 506,351 | 506,352 | u063346608 | python |
p02730 | S = input()
N = len(S)
if S == S[::-1]:
if S[:(n-1)//2] == S [(n+1)//2:]:
print("Yes")
else:
print("No")
else:
print("No") | S = input()
N = len(S)
if S == S[::-1]:
if S[:(N-1)//2] == S [(N+1)//2:]:
print("Yes")
else:
print("No")
else:
print("No") | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 506,356 | 506,357 | u218838821 | python |
p02730 | n=len(s)
x=n//2
a=s[0:x]
b=s[x+1:]
if a==b:print('Yes')
else:print('No') | s=input()
n=len(s)
x=n//2
a=s[0:x]
b=s[x+1:]
if a==b:print('Yes')
else:print('No') | [
"assignment.add"
] | 506,367 | 506,368 | u217303170 | python |
p02730 | def is_kaibun(st):
f = True
for x,y in zip(st, st[::-1]):
if x != y:
f = False
break
return f
S = input()
ans = False
if is_kaibun(S):
if is_kaibun(S[:(len(S)-1)/2+1]):
ans = is_kaibun(S[(len(S)+3)/2+1])
if ans:
print('Yes')
else:
print('No')
| def is_kaibun(st):
f = True
for x,y in zip(st, st[::-1]):
if x != y:
f = False
break
return f
S = input()
ans = False
if is_kaibun(S):
if is_kaibun(S[:(len(S)-1)//2]):
ans = is_kaibun(S[(len(S)+3)//2-1:])
if ans:
print('Yes')
else:
print('No') | [
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change",
"misc.opposites"
] | 506,369 | 506,370 | u377834804 | python |
p02730 | s = input()
n = len(s)
a = s[0:(n-1)//2]
b = s[(n+3)//2:n]
if s ==s[::-1] and 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+3)//2-1:n]
if s == s[::-1] and a == a[::-1] and b == b[::-1]:
print("Yes")
else:
print("No") | [
"assignment.change"
] | 506,371 | 506,372 | u175590965 | python |
p02730 | s = input()
n = len(s)
a = s[0:(n-1)//2]
b = s[(n+3)//2:n]
if s ==s[::-1] and 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+3)//2-1:n]
if s ==s[::-1] and a == a[::-1] and b == b[::-1] :
print("Yes")
else:
print("No") | [
"assignment.change"
] | 506,371 | 506,373 | u175590965 | python |
p02730 | s = str(input())
mid = (len(s) + 1)//2
def palin(st):
return st == st[::-1]
print('Yes' if palin(s[0:mid-1]) and palin(s[mid:]) else 'No') | s = str(input())
mid = (len(s) + 1)//2
def palin(st):
return st == st[::-1]
print('Yes' if palin(s[0:mid-1]) and palin(s[mid:]) and palin(s) else 'No') | [] | 506,378 | 506,379 | u206133536 | python |
p02730 | s=input()
n=len(s)
sa=s[:(n-1)//2]
sb=s[(n+1)//2:]
sar=""
sbr=""
for i in range(len(sa)):
sar+=sa[len(sa)-i-1]
sbr+=sb[len(sa)-i-1]
if sar==sa and sbr==sb:
print("Yes")
exit()
print("No") | s=input()
n=len(s)
sa=s[:(n-1)//2]
sb=s[(n+1)//2:]
sar=""
sbr=""
for i in range(len(sa)):
sar+=sa[len(sa)-i-1]
sbr+=sb[len(sa)-i-1]
if sar==sa and sbr==sb and sa==sb:
print("Yes")
exit()
print("No") | [
"control_flow.branch.if.condition.change"
] | 506,382 | 506,383 | u414920281 | python |
p02730 | S = input()
S1 = S[:int((len(s)-1)/2)]
S2 = S[int((len(s)+3)/2)-1:]
print('Yes' if S == S[::-1] and S1 == S1[::-1] and S2 == S2[::-1] else 'No') | S = input()
S1 = S[:int((len(S)-1)/2)]
S2 = S[int((len(S)+3)/2)-1:]
print('Yes' if S == S[::-1] and S1 == S1[::-1] and S2 == S2[::-1] else 'No') | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 506,384 | 506,385 | u864276028 | python |
p02730 | s = input()
n = len(s)
sa = s[:(n - 1) // 2]
sb = s[(n + 1) // 2:]
if s == s[::-1] and a == a[::-1] and b == b[::-1]:
print("Yes")
else:
print("No")
| s = input()
n = len(s)
sa = s[:(n - 1) // 2]
sb = s[(n + 1) // 2:]
if s == s[::-1] and sa == sa[::-1] and sb == sb[::-1]:
print("Yes")
else:
print("No")
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 506,409 | 506,410 | u911612592 | python |
p02730 | s = input()
n = len(s)
sa = s[:(n-1) // 2]
sb = s[(n + 1) // 2:]
if s == s[::-1] and a == a[::-1] and b == b[::-1]:
print("Yes")
else:
print("No") | s = input()
n = len(s)
sa = s[:(n - 1) // 2]
sb = s[(n + 1) // 2:]
if s == s[::-1] and sa == sa[::-1] and sb == sb[::-1]:
print("Yes")
else:
print("No")
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 506,411 | 506,410 | u911612592 | python |
p02730 | s = list(input())
l = len(s)
j = -1
for i in range(l // 2):
if s[i] != s[j]:
print('No')
exit(0)
j -= 1
h = (l + 3) // 2 - 1
j = h // 2
for h in range(l):
if s[h] != s[j]:
print('No')
exit(0)
j -= 1
print('Yes') | s = list(input())
l = len(s) # l = 29
j = l - 1 # j = 28
for i in range(l // 2):
if s[i] != s[j]:
print('No')
exit(0)
j -= 1
h = (l + 3) // 2 - 1 # h = 15
j = h - 2
for h in range(l // 2):
if s[h] != s[j]:
print('No')
exit(0)
j -= 1
print('Yes') | [
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 506,422 | 506,423 | u357751375 | python |
p02730 | S = input()
N = len(S)
left = S[:(N - 1) // 2 + 1]
right = S[((N + 3) // 2) - 1:]
if left == left[::-1] and right == right[::-1] and S == S[::-1]:
print('Yes')
else:
print('No')
| S = input()
N = len(S)
left = S[:(N - 1) // 2]
right = S[((N + 3) // 2) - 1:]
if left == left[::-1] and right == right[::-1] and S == S[::-1]:
print('Yes')
else:
print('No')
| [
"expression.operation.binary.remove"
] | 506,436 | 506,437 | u688587139 | python |
p02730 | def is_palindrome(s):
if len(s) > 1:
i = 0
n = len(s)-1
while s[i] == s[n]:
i += 1
n -= 1
if i >= n:
break
else:
return False
return True
else:
return True
s = input()
n = len(s)
if is_palindrome(s)... | def is_palindrome(s):
if len(s) > 1:
i = 0
n = len(s)-1
while s[i] == s[n]:
i += 1
n -= 1
if i >= n:
break
else:
return False
return True
else:
return True
s = input()
n = len(s)
if is_palindrome(s)... | [
"expression.operation.binary.remove"
] | 506,448 | 506,449 | u878654696 | python |
p02730 | def is_palindrome(s):
if len(s) > 2:
i = 0
n = len(s)-1
while s[i] == s[n]:
i += 1
n -= 1
if i >= n:
break
else:
return False
return True
else:
return True
s = input()
n = len(s)
if is_palindrome(s)... | def is_palindrome(s):
if len(s) > 1:
i = 0
n = len(s)-1
while s[i] == s[n]:
i += 1
n -= 1
if i >= n:
break
else:
return False
return True
else:
return True
s = input()
n = len(s)
if is_palindrome(s)... | [
"literal.number.integer.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 506,450 | 506,449 | u878654696 | python |
p02730 | c=a[0:int((len(a)-1)/2)]
b=''.join(list(reversed(a)))
d=a[int((len(a)+3)/2)-1:]
if a!=b:
print("No")
elif c!=d:
print("No")
else:
print("Yes") | a=input()
#b=reversed(a)
c=a[0:int((len(a)-1)/2)]
b=''.join(list(reversed(a)))
d=a[int((len(a)+3)/2)-1:]
if a!=b:
print("No")
elif c!=d:
print("No")
else:
print("Yes") | [
"assignment.add"
] | 506,464 | 506,465 | u351480677 | python |
p02730 | s = input()
n = len(s)//2
print('Yes' if s[:n]==s[n+1:][::-1] else 'No') | s = input()
n = len(s)//2
print('Yes' if s[:n]==s[n+1:] else 'No') | [] | 506,474 | 506,475 | u531599639 | python |
p02730 | S = input()
N = len(S)
SF_num = int((N-1)/2)
SF = S[:SF_num]
SF_rev = SF[::-1]
SB_num = int((N+3)/2)
SB = S[SB_num-1:]
SB_rev = SB[::-1]
if SF == SB_rev:
if SF == SF_rev:
if SB == SB_rev:
print("Yes")
else:
print("No") | S = input()
N = len(S)
SF_num = int((N-1)/2)
SF = S[:SF_num]
SF_rev = SF[::-1]
SB_num = int((N+3)/2)
SB = S[SB_num-1:]
SB_rev = SB[::-1]
if SF == SB_rev and SF == SF_rev and SB == SB_rev:
print("Yes")
else:
print("No") | [] | 506,478 | 506,479 | u465652095 | python |
p02730 | s = input()
flag = 1
def check(s):
return s == s[::-1]
if not check(s):
flag = 0
if not check(s[:len(s)//2]):
ans = 0
if flag:
print("Yes")
else:
print("No") | s = input()
flag = True
def check(s):
return s == s[::-1]
if not check(s):
flag = False
if not check(s[:len(s)//2]):
flag = False
if flag:
print("Yes")
else:
print("No") | [
"assignment.value.change",
"assignment.variable.change",
"identifier.change"
] | 506,484 | 506,485 | u501451051 | python |
p02730 | import math
s = str(input())
m = (len(s) - 1) / 2
c = True
for i in range(math.floor(m / 2)):
if s[i] != s[int(m-1-i)]:
c = False
for i in range(math.floor(m / 2)):
if s[int(m+1+i)] != s[int(len(s)-1-i)]:
c = False
for i in range(math.floor(m)):
if s[i] != s[int(math.floor(len(s)-i))]:
... | import math
s = str(input())
m = (len(s) - 1) / 2
c = True
for i in range(math.floor(m / 2)):
if s[i] != s[int(m-1-i)]:
c = False
for i in range(math.floor(m / 2)):
if s[int(m+1+i)] != s[int(len(s)-1-i)]:
c = False
for i in range(math.floor(m)):
if s[i] != s[int(math.floor(len(s)-1-i))]:
... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 506,491 | 506,492 | u931394483 | python |
p02730 | import math
s = str(input())
m = (len(s) - 1) / 2
c = True
for i in range(math.floor(m / 2)):
if s[i] != s[int(m-1-i)]:
c = False
for i in range(math.floor(m / 2)):
if s[int(m+1+i)] != s[int(len(s)-1-i)]:
c = False
for i in range(math.floor(m)):
if s[i] != s[int(math.floor(len(s)-1))]:
... | import math
s = str(input())
m = (len(s) - 1) / 2
c = True
for i in range(math.floor(m / 2)):
if s[i] != s[int(m-1-i)]:
c = False
for i in range(math.floor(m / 2)):
if s[int(m+1+i)] != s[int(len(s)-1-i)]:
c = False
for i in range(math.floor(m)):
if s[i] != s[int(math.floor(len(s)-1-i))]:
... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 506,493 | 506,492 | u931394483 | python |
p02730 | # -*- coding: <encoding name> -*-
s = input()
s_former = s[:(len(s) - 1) / 2]
s_latter = s[(len(s) + 3) / 2 - 1:]
print('Yes' if s == s[::-1] and s_former == s_former[::-1] and s_latter == s_latter[::-1] else 'No')
| # -*- coding: <encoding name> -*-
s = input()
s_former = s[:(len(s) - 1) // 2]
s_latter = s[(len(s) + 3) // 2 - 1:]
print('Yes' if s == s[::-1] and s_former == s_former[::-1] and s_latter == s_latter[::-1] else 'No')
| [
"expression.operator.arithmetic.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 506,510 | 506,509 | u730710086 | python |
p02730 | # -*- coding: <encoding name> -*-
s = input()
s_former = s[:(len(s) - 1) / 2 + 1]
s_latter = s[(len(s) + 3) / 2 + 1:]
print('Yes' if s == s[::-1] and s_former == s_former[::-1] and s_latter == s_latter[::-1] else 'No')
| # -*- coding: <encoding name> -*-
s = input()
s_former = s[:(len(s) - 1) // 2]
s_latter = s[(len(s) + 3) // 2 - 1:]
print('Yes' if s == s[::-1] and s_former == s_former[::-1] and s_latter == s_latter[::-1] else 'No')
| [
"expression.operator.arithmetic.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"expression.operation.binary.remove",
"misc.opposites"
] | 506,511 | 506,509 | u730710086 | python |
p02730 | st=input()
n=len(st)
if(n%2==0):
print("No")
exit(0)
if(st==st[::-1]):
s1=""
for i in range((n-1)//2+1):
s1+=st[i]
s2=""
for i in range((n+3)//2,n):
s2+=st[i]
if(s1==s1[::-1] and s2==s2[::-1]):
print("Yes")
else:
print("No")
else:
print("No") | st=input()
n=len(st)
if(n%2==0):
print("No")
exit(0)
if(st==st[::-1]):
s1=""
for i in range((n-1)//2):
s1+=st[i]
s2=""
for i in range((n+3)//2-1,n):
s2+=st[i]
if(s1==s1[::-1] and s2==s2[::-1]):
print("Yes")
else:
print("No")
else:
print("No") | [
"expression.operation.binary.remove"
] | 506,512 | 506,513 | u884339744 | python |
p02730 | #B
def isReverse(s):
p1 = 0
p2 = len(s) - 1
flag = True
while p1 >= p2:
if s[p1] != s[p2]:
flag = False
p1 += 1
p2 += -1
return flag
if __name__ == "__main__":
s = input()
s1 = s[:int((len(s) - 1) / 2)]
s2 = s[int((len(s) + 1) / 2):]
if isReverse(s... | def isReverse(s):
p1 = 0
p2 = len(s) - 1
flag = True
while p1 <= p2:
if s[p1] != s[p2]:
flag = False
p1 += 1
p2 += -1
return flag
if __name__ == "__main__":
s = input()
s1 = s[:int((len(s) - 1) / 2)]
s2 = s[int((len(s) + 1) / 2):]
# print(s, s1, s2... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 506,525 | 506,526 | u019075898 | python |
p02730 | s = input()
length = len(s)
def solve(word, length):
first = (length-1) // 2
last = (length+3) // 2
if isPalindrome(s[:first]) and isPalindrome(s[last-1:]):
print("Yes")
else:
print("No")
def isPalindrome(word):
palindrome = True
size = len(word)
start = 0
end = size ... | s = input()
length = len(s)
def solve(word, length):
first = (length-1) // 2
last = (length+3) // 2
if isPalindrome(word) and isPalindrome(s[:first]) and isPalindrome(s[last-1:]):
print("Yes")
else:
print("No")
def isPalindrome(word):
palindrome = True
size = len(word)
... | [
"control_flow.branch.if.condition.change",
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 506,527 | 506,528 | u432253045 | python |
p02730 | import numpy as np
S = np.array([i for i in input()])
S_rev = S[::-1]
N = len(S)
ans = 'No'
if all(S == S_rev):
temp_S = S[:(N-1)//2+1]
temp_S_rev = temp_S[::-1]
if all(temp_S == temp_S_rev):
temp_S = S[(N+3)//2:]
temp_S_rev = temp_S[::-1]
if all(temp_S == temp_S_rev):
ans = 'Yes'
pri... | import numpy as np
S = np.array([i for i in input()])
S_rev = S[::-1]
N = len(S)
ans = 'No'
if all(S == S_rev):
temp_S = S[:(N-1)//2]
temp_S_rev = temp_S[::-1]
if all(temp_S == temp_S_rev):
temp_S = S[(N+3)//2-1:]
temp_S_rev = temp_S[::-1]
if all(temp_S == temp_S_rev):
ans = 'Yes'
pri... | [
"expression.operation.binary.remove"
] | 506,533 | 506,534 | u075303794 | python |
p02730 | S = input()
N = len(S)
def check(c):
if len(c) == 0:
return False
if list(c) == list(reversed(c)):
return True
return False
result = "No"
if check(S[:int((N-1)/2)]):
if check(S[int((N+3)/2)-1:]):
result = "Yes"
print(result)
| S = input()
N = len(S)
def check(c):
if len(c) == 0:
return False
if list(c) == list(reversed(c)):
return True
return False
result = "No"
if check(S):
if check(S[:int((N-1)/2)]):
if check(S[int((N+3)/2)-1:]):
result = "Yes"
print(result) | [
"control_flow.branch.if.add"
] | 506,539 | 506,540 | u022215787 | python |
p02730 | s=input().strip(); n=len(S)
print("Yes" if s==s[::-1] and s[:(n-1)//2]==s[:(n-1)//2][::-1] and s[(n+3)//2-1:]==s[(n+3)//2-1:][::-1] else "No") | s=input().strip(); n=len(s)
print("Yes" if s==s[::-1] and s[:(n-1)//2]==s[:(n-1)//2][::-1] and s[(n+3)//2-1:]==s[(n+3)//2-1:][::-1] else "No") | [
"misc.typo",
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 506,549 | 506,550 | u112247039 | python |
p02730 | S = input()
left = S[0:(len(S)-1)//2]
right = S[(len(S)+3)//2 - 1: len(S)]
def kaibun(s):
for i in range(len(s)//2):
if s[i] != s[len(s)-i-1]:
return False
return True
if kaibun(left) and kaibun(right):
print('Yes')
else:
print('No')
| S = input()
left = S[0:(len(S)-1)//2]
right = S[(len(S)+3)//2 - 1: len(S)]
def kaibun(s):
for i in range(len(s)//2):
if s[i] != s[len(s)-i-1]:
return False
return True
if kaibun(S) and kaibun(left) and kaibun(right):
print('Yes')
else:
print('No') | [
"control_flow.branch.if.condition.change"
] | 506,551 | 506,552 | u391589398 | python |
p02730 | import math
S = input()
N = len(S)
flag = True
leftS = S[0:math.floor((N - 1)/2)]
rightS = S[math.floor((N + 3)/2) - 1:N]
def isPalindrome(str):
N =len(str)
flag = True
for i in range(0,math.floor(N/2)):
if str[i] != str[(N-1) - i]:
flag = False
break
return flag
flag ... | import math
S = input()
N = len(S)
flag = True
leftS = S[0:math.floor((N - 1)/2)]
rightS = S[math.floor((N + 3)/2) - 1:N]
def isPalindrome(str):
N =len(str)
flag = True
for i in range(0,math.floor(N/2)):
if str[i] != str[(N-1) - i]:
flag = False
break
return flag
flag ... | [
"control_flow.branch.if.add"
] | 506,553 | 506,554 | u671060652 | python |
p02730 | def strongPalindrome(S):
S2 = S[0:(len(S)-1)//2]
S3 = S[(len(S)+3)//2:]
return "Yes" if S == S[::-1] and S2 == S2[::-1] and S3 == S3[::-1] else "No"
S = input()
print(strongPalindrome(S)) | def strongPalindrome(S):
S2 = S[0:(len(S)-1)//2]
S3 = S[(len(S)+3-1)//2:]
return "Yes" if S == S[::-1] and S2 == S2[::-1] and S3 == S3[::-1] else "No"
S = input()
print(strongPalindrome(S)) | [
"assignment.change"
] | 506,555 | 506,556 | u680144812 | python |
p02730 | def strongPalindrome(S):
S2 = S[0:(len(S)-1)//2]
S3 = S[0:(len(S)+3)//2]
return "Yes" if S == S[::-1] and S2 == S2[::-1] and S3 == S3[::-1] else "No"
S = input()
print(strongPalindrome(S)) | def strongPalindrome(S):
S2 = S[0:(len(S)-1)//2]
S3 = S[(len(S)+3-1)//2:]
return "Yes" if S == S[::-1] and S2 == S2[::-1] and S3 == S3[::-1] else "No"
S = input()
print(strongPalindrome(S)) | [
"assignment.change"
] | 506,557 | 506,556 | u680144812 | python |
p02730 | s = input()
n = len(s)
sf = s[0:(n-1)//2]
sr = s[::-1][0:(n-1)//2]
print('YNeos'[not[s == s[::-1] and sf == sf[::-1] and sr == sr[::-1]]::2]) | s = input()
n = len(s)
sf = s[0:(n-1)//2]
sr = s[::-1][0:(n-1)//2]
print('YNeos'[not(s == s[::-1] and sf == sf[::-1] and sr == sr[::-1])::2]) | [
"variable_access.subscript.index.change",
"call.arguments.change",
"io.output.change"
] | 506,560 | 506,561 | u395202850 | python |
p02730 | s=input()
c=list(reversed(s))
n=len(s)
t=list(s[:int((n-1)/2)])
a=list(reversed(t))
u=list(s[int((n+3)/2)-1:])
b=list(reversed(u))
#print(b)
if t==a and u==b and s==c:
print("Yes")
else:
print("No")
| s=list(input())
c=list(reversed(s))
n=len(s)
t=list(s[:int((n-1)/2)])
a=list(reversed(t))
u=list(s[int((n+3)/2)-1:])
b=list(reversed(u))
#print(b)
if t==a and u==b and s==c:
print("Yes")
else:
print("No")
| [
"call.add",
"call.arguments.change"
] | 506,573 | 506,574 | u437351386 | python |
p02730 | s = input()
if s != s[::-1]:
print("No")
exit()
x = s[:((len(s)-1)//2)]
if x != x[::-1]:
print("No")
exit()
y = s[((len(s)+3)//2-1):]
print(y)
if y != y[::-1]:
print("No")
exit()
print("Yes") | s = input()
if s != s[::-1]:
print("No")
exit()
x = s[:((len(s)-1)//2)]
if x != x[::-1]:
print("No")
exit()
y = s[((len(s)+3)//2-1):]
if y != y[::-1]:
print("No")
exit()
print("Yes") | [
"call.remove"
] | 506,581 | 506,582 | u188827677 | python |
p02730 | #! env/bin/local python3
# -*- coding:utf-8 -*-
s = input()
ls = len(s)
def is_kaibun(s):
rs = s[::-1]
print(s, rs)
if s == rs:
return True
else:
return False
flag = False
if is_kaibun(s):
if is_kaibun(s[:(ls-1)//2]):
if is_kaibun(s[(ls+3)//2-1: ls]):
flag = ... | #! env/bin/local python3
# -*- coding:utf-8 -*-
s = input()
ls = len(s)
def is_kaibun(s):
rs = s[::-1]
if s == rs:
return True
else:
return False
flag = False
if is_kaibun(s):
if is_kaibun(s[:(ls-1)//2]):
if is_kaibun(s[(ls+3)//2-1: ls]):
flag = True
print('Yes'... | [
"call.remove"
] | 506,583 | 506,584 | u018771977 | python |
p02730 | #! env/bin/local python3
# -*- coding:utf-8 -*-
s = input()
ls = len(s)
def is_kaibun(s):
rs = s[::-1]
if s == rs:
return True
else:
return False
flag = False
if is_kaibun(s):
if is_kaibun(s[:(ls-1)//2]):
if is_kaibun(s[(ls+3)//2: ls]):
flag = True
print('Yes' i... | #! env/bin/local python3
# -*- coding:utf-8 -*-
s = input()
ls = len(s)
def is_kaibun(s):
rs = s[::-1]
if s == rs:
return True
else:
return False
flag = False
if is_kaibun(s):
if is_kaibun(s[:(ls-1)//2]):
if is_kaibun(s[(ls+3)//2-1: ls]):
flag = True
print('Yes'... | [
"control_flow.branch.if.condition.change"
] | 506,585 | 506,584 | u018771977 | python |
p02730 | S = input()
N = len(S)
P = 0
for i in range (N-1//2):
if S[i] == S[N-1-i]:
for k in range(N-1//2):
if S[k] == S[((N-1)//2)-k] and S[((N+1)//2)+k] == S[N-1-k]:
P = P
else:
P += 1
else:
P += 1
if P == 0:
print('Yes')
else:
pr... | S = input()
N = len(S)
P = 0
for i in range ((N-1)//2):
if S[i] == S[N-1-i]:
for k in range((N-1)//2):
if S[k] == S[((N-3)//2)-k] and S[((N+1)//2)+k] == S[N-1-k]:
P = P
else:
P += 1
else:
P += 1
if P == 0:
print('Yes')
else:
print(... | [
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 506,593 | 506,594 | u165436807 | python |
p02730 | import sys
input = sys.stdin.readline
S = str(input())
N = len(S)-1
N1 = (N-1)/2
N2 = (N+3)/2
s1 = S[:N]
s2 = S[:N1]
s3 = S[N2-1:N]
flag = True
for ss in [s1, s2, s3]:
ss_l = len(ss)
for i in range(ss_l):
if ss[i] != ss[ss_l-i-1]:
flag = False
break
if not flag:
b... | import sys
input = sys.stdin.readline
S = str(input())
N = len(S)-1
N1 = int((N-1)/2)
N2 = int((N+3)/2)
s1 = S[:N]
s2 = S[:N1]
s3 = S[N2-1:N]
flag = True
for ss in [s1, s2, s3]:
ss_l = len(ss)
for i in range(ss_l):
if ss[i] != ss[ss_l-i-1]:
flag = False
break
if not flag:... | [
"call.add",
"call.arguments.change"
] | 506,595 | 506,596 | u294211484 | python |
p02730 | import sys
input = sys.stdin.readline
S = str(input())
N = len(S)-1
N1 = (N-1)/2
N2 = (N+3)/2
s1 = S[:N]
s2 = S[:N1]
s3 = S[N2-1:N]
flag = True
for ss in [s1, s2, s3]:
ss_l = len(ss)
for i in range(ss_l):
if ss[i] != ss[ss_l-i-1]:
flag = False
break
if not flag:
... | import sys
input = sys.stdin.readline
S = str(input())
N = len(S)-1
N1 = int((N-1)/2)
N2 = int((N+3)/2)
s1 = S[:N]
s2 = S[:N1]
s3 = S[N2-1:N]
flag = True
for ss in [s1, s2, s3]:
ss_l = len(ss)
for i in range(ss_l):
if ss[i] != ss[ss_l-i-1]:
flag = False
break
if not flag:... | [
"call.add",
"call.arguments.change"
] | 506,597 | 506,596 | u294211484 | python |
p02730 | s=input()
n=len(s)
s1=s[0:(n-1)/2]
s2=s[(n+1)/2:n]
if s==s[::-1] and s1==s1[::-1] and s2==s2[::-1]:
print("Yes")
else:
print("No") | s=input()
n=len(s)
s1=s[0:(n-1)//2]
s2=s[(n+1)//2:n]
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"
] | 506,605 | 506,606 | u153259685 | python |
p02730 | s=input()
n=len(s)
s1=s[0:(n-3)/2]
s2=s[(n+1)/2:n-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[0:(n-1)//2]
s2=s[(n+1)//2:n]
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",
"expression.operator.arithmetic.change",
"expression.operation.binary.remove"
] | 506,607 | 506,606 | u153259685 | python |
p02730 | def palindrome(word):
if len(word) <= 1:
return True
if word[0] != word[-1]:
return False
return palindrome(word[1:-1])
word = input()
n = len(word) // 2
issuper = palindrome(word[:n]) and palindrome(word[n+1:])
print("Yes" if issuper else "No") | def palindrome(word):
if len(word) <= 1:
return True
if word[0] != word[-1]:
return False
return palindrome(word[1:-1])
word = input()
n = len(word) // 2
issuper = palindrome(word[:n]) and palindrome(word[n+1:]) and palindrome(word)
print("Yes" if issuper else "No") | [] | 506,612 | 506,613 | u831835224 | python |
p02730 | def palindrome(word):
if len(word) <= 1:
return True
if word[0] != word[-1]:
return False
return palindrome(word[1:-1])
word = input()
n = len(word) // 2
issuper = palindrome(word[:n]) and palindrome(word[n+1:])
print("Yes" if isupper else "No") | def palindrome(word):
if len(word) <= 1:
return True
if word[0] != word[-1]:
return False
return palindrome(word[1:-1])
word = input()
n = len(word) // 2
issuper = palindrome(word[:n]) and palindrome(word[n+1:]) and palindrome(word)
print("Yes" if issuper else "No") | [
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 506,614 | 506,613 | u831835224 | python |
p02730 | s = input()
def kai(l):
n = len(l)
output = 'Yes'
for i in range(n%2):
if l[i] != l[n-i-1]:
output = 'No'
return output
ans = kai(s)
if ans == 'Yes':
ans = kai(s[:len(s)%2])
if ans == 'Yes':
ans = kai(s[len(s)%2+1:])
print(ans) | s = input()
def kai(l):
n = len(l)
output = 'Yes'
for i in range(n//2):
if l[i] != l[n-i-1]:
output = 'No'
return output
ans = kai(s)
if ans == 'Yes':
ans = kai(s[:len(s)//2])
if ans == 'Yes':
ans = kai(s[len(s)//2+1:])
print(ans) | [
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change",
"assignment.value.change",
"variable_access.subscript.index.change"
] | 506,615 | 506,616 | u619398783 | python |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.