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 |
|---|---|---|---|---|---|---|---|
p02835
|
A = map(int, input().split())
if sum(A) > 22:
print("bust")
else:
print("win")
|
A = map(int, input().split())
if sum(A) >= 22:
print("bust")
else:
print("win")
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 640,088
| 640,089
|
u055687574
|
python
|
p02835
|
l_in = list(map(int, input().split()))
if sum(l_in) < 21:
print('win')
else:
print('bust')
|
l_in = list(map(int, input().split()))
if sum(l_in) <= 21:
print('win')
else:
print('bust')
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 640,094
| 640,095
|
u152891327
|
python
|
p02835
|
a, b, c = map(int, input.split())
if a + b + c <= 21:
print('win')
else:
print('bust')
|
a, b, c = map(int, input().split())
if a + b + c <= 21:
print('win')
else:
print('bust')
|
[
"call.add"
] | 640,098
| 640,099
|
u634046173
|
python
|
p02835
|
x=list(map(int, input().split()))
if x[2]+x[1]+x[0]>21:
print('bust')
else:
print('Win')
|
x=list(map(int, input().split()))
if x[2]+x[1]+x[0]>21:
print('bust')
else:
print('win')
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 640,100
| 640,101
|
u578501242
|
python
|
p02835
|
def main():
a, b, c = map(int, input().split())
sum = a+b+c
print(sum)
if (sum <= 21):
print("win")
elif(sum >= 22):
print("bust")
if __name__ == "__main__":
main()
|
def main():
a, b, c = map(int, input().split())
sum = a+b+c
if (sum <= 21):
print("win")
elif(sum >= 22):
print("bust")
if __name__ == "__main__":
main()
|
[
"call.remove"
] | 640,105
| 640,106
|
u715036868
|
python
|
p02835
|
A = list(map(int,input.split()))
if sum(A) <= 21:
print("win")
else:
print("bust")
|
A = list(map(int,input().split()))
if sum(A) <= 21:
print("win")
else:
print("bust")
|
[
"call.add"
] | 640,110
| 640,111
|
u774985302
|
python
|
p02835
|
a, b, c=(int(x) for x in input().split())
print('bust'if a+b+c >=21 else'win')
|
a, b, c=(int(x) for x in input().split())
print('bust'if a+b+c >=22 else'win')
|
[
"literal.number.integer.change",
"call.arguments.change",
"io.output.change"
] | 640,118
| 640,119
|
u500673386
|
python
|
p02835
|
A1, A2, A3 = map(int, input.split())
if A1 + A2 + A3 >= 22:
print("bust")
else:
print("win")
|
A1, A2, A3 = map(int, input().split())
if A1 + A2 + A3 >= 22:
print("bust")
else:
print("win")
|
[
"call.add"
] | 640,120
| 640,121
|
u001463970
|
python
|
p02835
|
if sum(list(map(int, input()))) > 21:
print('bust')
else:
print('win')
|
if sum(list(map(int, input().split()))) > 21:
print('bust')
else:
print('win')
|
[
"control_flow.branch.if.condition.change",
"call.add"
] | 640,122
| 640,123
|
u626337957
|
python
|
p02835
|
# coding: utf-8
# Your code here!
# coding: utf-8
from math import gcd
from functools import reduce
import sys
sys.setrecursionlimit(200000000)
from inspect import currentframe
# my functions here!
#標準エラー出力
def printargs2err(*args):
names = {id(v):k for k,v in currentframe().f_back.f_locals.items()}
print(', '.join(names.get(id(arg),'???')+' : '+repr(arg) for arg in args),file=sys.stderr)
def printglobals():
for (symbol, value) in globals().items():
print('symbol="%s"、value=%s' % (symbol, value),file=sys.stderr)
def printlocals():
for (symbol, value) in locals().items():
print('symbol="%s"、value=%s' % (symbol, value),file=sys.stderr)
#入力（後でいじる）
def pin(type=int):
return map(type,input().split())
#input
from collections import Counter
def resolve():
print(["win","bust"][ sum(pin())>21])
#print([["NA","YYMM"],["MMYY","AMBIGUOUS"]][cMMYY][cYYMM])
#if __name__=="__main__":resolve()
"""
#printデバッグ消した？
#前の問題の結果見てないのに次の問題に行くの？
"""
"""
お前カッコ閉じるの忘れてるだろ
"""
import sys
from io import StringIO
import unittest
class TestClass(unittest.TestCase):
def assertIO(self, input, output):
stdout, stdin = sys.stdout, sys.stdin
sys.stdout, sys.stdin = StringIO(), StringIO(input)
resolve()
sys.stdout.seek(0)
out = sys.stdout.read()[:-1]
sys.stdout, sys.stdin = stdout, stdin
self.assertEqual(out, output)
def test_入力例_1(self):
input = """5 7 9"""
output = """win"""
self.assertIO(input, output)
def test_入力例_2(self):
input = """13 7 2"""
output = """bust"""
self.assertIO(input, output)
if __name__ == "__main__":
unittest.main()
|
# coding: utf-8
# Your code here!
# coding: utf-8
from math import gcd
from functools import reduce
import sys
sys.setrecursionlimit(200000000)
from inspect import currentframe
# my functions here!
#標準エラー出力
def printargs2err(*args):
names = {id(v):k for k,v in currentframe().f_back.f_locals.items()}
print(', '.join(names.get(id(arg),'???')+' : '+repr(arg) for arg in args),file=sys.stderr)
def printglobals():
for (symbol, value) in globals().items():
print('symbol="%s"、value=%s' % (symbol, value),file=sys.stderr)
def printlocals():
for (symbol, value) in locals().items():
print('symbol="%s"、value=%s' % (symbol, value),file=sys.stderr)
#入力（後でいじる）
def pin(type=int):
return map(type,input().split())
#input
from collections import Counter
def resolve():
print(["win","bust"][ sum(pin())>21])
#print([["NA","YYMM"],["MMYY","AMBIGUOUS"]][cMMYY][cYYMM])
#if __name__=="__main__":resolve()
"""
#printデバッグ消した？
#前の問題の結果見てないのに次の問題に行くの？
"""
"""
お前カッコ閉じるの忘れてるだろ
"""
import sys
from io import StringIO
import unittest
class TestClass(unittest.TestCase):
def assertIO(self, input, output):
stdout, stdin = sys.stdout, sys.stdin
sys.stdout, sys.stdin = StringIO(), StringIO(input)
resolve()
sys.stdout.seek(0)
out = sys.stdout.read()[:-1]
sys.stdout, sys.stdin = stdout, stdin
self.assertEqual(out, output)
def test_入力例_1(self):
input = """5 7 9"""
output = """win"""
self.assertIO(input, output)
def test_入力例_2(self):
input = """13 7 2"""
output = """bust"""
self.assertIO(input, output)
if __name__=="__main__":resolve()
|
[] | 640,134
| 640,135
|
u857428111
|
python
|
p02835
|
A = list(map(int, input().split()))
if sum(A) >= 22:
print("win")
else:
print("bust")
|
A = list(map(int, input().split()))
if sum(A) < 22:
print("win")
else:
print("bust")
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 640,136
| 640,137
|
u328755070
|
python
|
p02836
|
#文字列の入力
S = input()
#listを一文字ずつのlistに
S_list = list(S)
ans = 0
#偶数文字の場合
if(len(S_list)%2==0):
#文字数/2回for文
for i in range(int(len(S_list)/2)-1):
#i文字目と後ろからi文字目が一緒なら何もしない
if(S_list[i]==S_list[len(S_list)-i-1]):
ans = ans + 0
#一緒じゃ無い場合
else:
ans = ans + 1
else:
for i in range(int(len(S_list)/2)):
#print(i,len(S_list)-i-1)
if(S_list[i]==S_list[len(S_list)-i-1]):
ans = ans + 0
else:
ans = ans + 1
print(ans)
|
#文字列の入力
S = input()
#listを一文字ずつのlistに
S_list = list(S)
ans = 0
#偶数文字の場合
if(len(S_list)%2==0):
#文字数/2回for文
for i in range(int(len(S_list)/2)):
#i文字目と後ろからi文字目が一緒なら何もしない
#print(i,len(S_list)-i-1)
if(S_list[i]==S_list[len(S_list)-i-1]):
ans = ans + 0
#一緒じゃ無い場合
else:
ans = ans + 1
else:
for i in range(int(len(S_list)/2)):
#print(i,len(S_list)-i-1)
if(S_list[i]==S_list[len(S_list)-i-1]):
ans = ans + 0
else:
ans = ans + 1
print(ans)
|
[
"expression.operation.binary.remove"
] | 640,151
| 640,152
|
u964521959
|
python
|
p02836
|
palindrome = list(input())
half = len(palindrome) // 2
lst = set()
for i in range(half):
if palindrome[i] != palindrome[len(palindrome) - i - 1]:
lst.add(palindrome[i])
print(len(lst))
|
palindrome = list(input())
half = len(palindrome) // 2
lst = list()
for i in range(half):
if palindrome[i] != palindrome[len(palindrome) - i - 1]:
lst.append(palindrome[i])
print(len(lst))
|
[
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 640,155
| 640,156
|
u024450350
|
python
|
p02836
|
S = input()
cnt = 0
for i in range(S // 2):
if S[i] != S[len(S) - 1 - i]:
cnt +=0
print(cnt)
|
S = input()
cnt = 0
for i in range(len(S) // 2):
if S[i] != S[len(S) - 1 - i]:
cnt += 1
print(cnt)
|
[
"call.add",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change",
"literal.number.integer.change"
] | 640,159
| 640,160
|
u634046173
|
python
|
p02836
|
S = input()
S = [i for i in S]
N = len(S)
cnt = 0
for i in range(N):
if S[i]!=S[N-i-1]:
S[N-i-1]=S[i]
cnt+=1
|
S = input()
S = [i for i in S]
N = len(S)
cnt = 0
for i in range(N):
if S[i]!=S[N-i-1]:
S[N-i-1]=S[i]
cnt+=1
print(cnt)
|
[
"call.add"
] | 640,163
| 640,164
|
u450147945
|
python
|
p02836
|
def main(s):
isEven = int(len(s)%2)
ran = (len(s)-1)/2 if isEven else (len(s)/2)
count = 0
for i in range(ran):
if s[i] != s[-(i+1)]:
count += 1
return count
s = input()
print(main(s))
|
def main(s):
isEven = int(len(s)%2)
ran = int((len(s)-1)/2 if isEven else (len(s)/2))
count = 0
for i in range(ran):
if s[i] != s[-(i+1)]:
count += 1
return count
s = input()
print(main(s))
|
[
"call.add",
"call.arguments.change"
] | 640,170
| 640,171
|
u358957649
|
python
|
p02836
|
S = input()
result = 0
for i in range(int(len(S) / 2)):
if S[i] != S[-i]:
result += 1
print(result)
|
S = input()
result = 0
for i in range(int(len(S) / 2)):
if S[i] != S[-(i+1)]:
result += 1
print(result)
|
[
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 640,184
| 640,185
|
u439338890
|
python
|
p02836
|
S = list(input())
A = reversed(S)
LEN=len(S)
ans=0
if LEN%2==0:
for i in range(LEN//2):
if S[i]!=A[i]:
ans+=1
else:
for i in range((LEN-1)//2):
if S[i]!=A[i]:
ans+=1
print(ans)
|
S = list(input())
A = list(reversed(S))
LEN=len(S)
ans=0
if LEN%2==0:
for i in range(LEN//2):
if S[i]!=A[i]:
ans+=1
else:
for i in range((LEN-1)//2):
if S[i]!=A[i]:
ans+=1
print(ans)
|
[
"call.add",
"call.arguments.change"
] | 640,188
| 640,189
|
u189479417
|
python
|
p02836
|
s = input()
t = s[::-1]
print(s,t)
count = 0
for i in range(len(s)):
if s[i] != t[i]:
count += 1
print(int(count/2))
|
s = input()
t = s[::-1]
count = 0
for i in range(len(s)):
if s[i] != t[i]:
count += 1
print(int(count/2))
|
[
"call.remove"
] | 640,190
| 640,191
|
u804733539
|
python
|
p02836
|
s=input()
count=0
for i in range(0,len(s)//2):
if s[i]!=s[len(s)-1-i]:
count=count+1
|
s=input()
count=0
for i in range(0,len(s)//2):
if s[i]!=s[len(s)-1-i]:
count=count+1
print(count)
|
[
"call.add"
] | 640,194
| 640,195
|
u239653493
|
python
|
p02836
|
s=input()
s_len=len(s)
ans=0
for i in range(s_len//2):
if ans[i]!=ans[s_len-1-i]:
ans+=1
print(ans)
|
s=input()
s_len=len(s)
ans=0
for i in range(s_len//2):
if s[i]!=s[s_len-1-i]:
ans+=1
print(ans)
|
[
"identifier.change",
"control_flow.branch.if.condition.change"
] | 640,204
| 640,205
|
u217627525
|
python
|
p02836
|
S = input()
cnt = 0
for i in range(len(S) // 2):
if S[i] != S[-i]:
cnt += 1
print(cnt)
|
S = input()
cnt = 0
for i in range(len(S) // 2):
if S[i] != S[-(i+1)]:
cnt += 1
print(cnt)
|
[
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 640,215
| 640,216
|
u872538555
|
python
|
p02836
|
st = input()
ans = 0
for i in range(len(st)//2):
if st[i] != st[-i]:
ans += 1
print(ans)
|
st = input()
ans = 0
for i in range(len(st)//2):
if st[i] != st[-i-1]:
ans += 1
print(ans)
|
[
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 640,223
| 640,224
|
u667084803
|
python
|
p02836
|
s = input()
l = len(s)
cnt = 0
for i in range(math.ceil(l/2)):
if s[i] != s[l-i-1]:
cnt += 1
print(cnt)
|
import math
s = input()
l = len(s)
cnt = 0
for i in range(math.ceil(l/2)):
if s[i] != s[l-i-1]:
cnt += 1
print(cnt)
|
[] | 640,233
| 640,234
|
u589578850
|
python
|
p02836
|
s=input()
score=0
for i in range(0,int(len(s)/2+1)):
if s[i]!=s[len(s)-1-i]:
score+=1
print(score)
|
s=input()
score=0
for i in range(0,int(len(s)/2)):
if s[i]!=s[len(s)-1-i]:
score+=1
print(score)
|
[
"expression.operation.binary.remove"
] | 640,241
| 640,242
|
u441225672
|
python
|
p02836
|
s=input()
score=0
for i in range(0,len(s)/2+1):
if s[i]!=s[len(s)-i]:
score+=1
print(score)
|
s=input()
score=0
for i in range(0,int(len(s)/2)):
if s[i]!=s[len(s)-1-i]:
score+=1
print(score)
|
[
"call.add",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 640,243
| 640,242
|
u441225672
|
python
|
p02836
|
s = input()
l = len(s)
h = l // 2
lis1 = []
lis2 = []
for i in range(0, h + 1):
lis1.append(s[i])
lis2.append(s[-(i + 1)])
count = 0
for a, b in zip(lis1, lis2):
if a != b:
count += 1
print(count)
|
s = input()
l = len(s)
h = l // 2
lis1 = []
lis2 = []
for i in range(0, h):
lis1.append(s[i])
lis2.append(s[-(i + 1)])
count = 0
for a, b in zip(lis1, lis2):
if a != b:
count += 1
print(count)
|
[
"expression.operation.binary.remove"
] | 640,253
| 640,254
|
u138781768
|
python
|
p02836
|
s = input()
l = len(s)
h = l // 2
lis1 = []
lis2 = []
for i in range(0, l + 1):
lis1.append(s[i])
lis2.append(s[-(i + 1)])
count = 0
for a, b in zip(lis1, lis2):
if a != b:
count += 1
print(count)
|
s = input()
l = len(s)
h = l // 2
lis1 = []
lis2 = []
for i in range(0, h):
lis1.append(s[i])
lis2.append(s[-(i + 1)])
count = 0
for a, b in zip(lis1, lis2):
if a != b:
count += 1
print(count)
|
[
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.remove"
] | 640,255
| 640,254
|
u138781768
|
python
|
p02836
|
s = input()
l = len(s)
ret = 0
for i in range(l): ret += (s[l] != s[-l-1])
print(ret//2)
|
s = input()
l = len(s)
ret = 0
for i in range(l):
ret += (s[i] != s[-i-1])
print(ret//2)
|
[
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 640,262
| 640,263
|
u743272507
|
python
|
p02836
|
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from math import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7
S = input()
count = 0
if len(S)%2==0:
a = int(len(S)/2-1)
for i in range(a+1):
if S[a+1+i] != S[a-i]:
count += 1
else:
a = int(len(S)//2)
for i in range(a+1):
if S[a+1+i] != S[a-1-i]:
count += 1
print(count)
|
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from math import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7
S = input()
count = 0
if len(S)%2==0:
a = int(len(S)/2-1)
for i in range(a+1):
if S[a+1+i] != S[a-i]:
count += 1
else:
a = int(len(S)//2)
for i in range(a):
if S[a+1+i] != S[a-1-i]:
count += 1
print(count)
|
[
"expression.operation.binary.remove"
] | 640,264
| 640,265
|
u829735607
|
python
|
p02836
|
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from math import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7
S = input()
count = 0
if len(S)%2==0:
a = int(len(S)/2-1)
for i in range(a):
if S[a+1+i] != S[a-i]:
count += 1
else:
a = int(len(S)//2)
for i in range(a):
if S[a+1+i] != S[a-1-i]:
count += 1
print(count)
|
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from math import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7
S = input()
count = 0
if len(S)%2==0:
a = int(len(S)/2-1)
for i in range(a+1):
if S[a+1+i] != S[a-i]:
count += 1
else:
a = int(len(S)//2)
for i in range(a):
if S[a+1+i] != S[a-1-i]:
count += 1
print(count)
|
[
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 640,266
| 640,265
|
u829735607
|
python
|
p02836
|
S = input()
s = list(S)
ss = list(reversed(S))
ans = 0
for i in range(len(S)):
if s[i] != ss[i]:
ans += 1
print(ans)
|
S = input()
s = list(S)
ss = list(reversed(S))
ans = 0
for i in range(len(S)//2):
if s[i] != ss[i]:
ans += 1
print(ans)
|
[
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 640,271
| 640,272
|
u501265339
|
python
|
p02836
|
S = input()
s = list(S)
ss = list(reversed(S))
ans = 0
for i in range(len(S)):
if s[i] == ss[i]:
ans += 1
print(ans)
|
S = input()
s = list(S)
ss = list(reversed(S))
ans = 0
for i in range(len(S)//2):
if s[i] != ss[i]:
ans += 1
print(ans)
|
[
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 640,273
| 640,272
|
u501265339
|
python
|
p02836
|
s=input()
print(sum(a!=b for a,b in zip(s,s[::-1])))
|
s=str(input())
print(sum(a<b for a,b in zip(s,s[::-1])))
|
[
"call.add",
"call.arguments.change",
"expression.operator.compare.change",
"io.output.change"
] | 640,290
| 640,288
|
u127499732
|
python
|
p02836
|
S = input()
T = ""
L = len(S)
for i in range(L):
T += S[L-i-1]
print(T)
ans = 0
for i in range((L+1)//2):
if S[i] != T[i]:
ans += 1
print(ans)
|
S = input()
T = ""
L = len(S)
for i in range(L):
T += S[L-i-1]
ans = 0
for i in range((L+1)//2):
if S[i] != T[i]:
ans += 1
print(ans)
|
[
"call.remove"
] | 640,293
| 640,294
|
u269235541
|
python
|
p02836
|
s = input()
len_s = len(s)
c = 0
for _ in range(int(len_s/2)):
if(s[_] == s[-_]):
c+=1
print(c)
|
s = input()
len_s = len(s)
c = 0
for _ in range(int(len_s/2)):
if(s[_] != s[len_s-1-_]):
c+=1
print(c)
|
[
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 640,300
| 640,301
|
u813452457
|
python
|
p02836
|
S = input()
print(len([True for s in range(len(S)//2) if S[i] != S[-1-i]]))
|
S = input()
print(len([True for i in range(len(S)//2) if S[i] != S[-1-i]]))
|
[
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 640,302
| 640,303
|
u735008991
|
python
|
p02836
|
a=input()
b=a
c=b[::-1]
d=0
for i in range(len(a)):
if a[i]!=c[i]:
d+=1
else:
pass
print(d)
|
a=input()
b=a
c=b[::-1]
d=0
for i in range(len(a)//2):
if a[i]!=c[i]:
d+=1
else:
pass
print(d)
|
[
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 640,304
| 640,305
|
u223555291
|
python
|
p02836
|
a=input()
b=a
c=b[::-1]
d=0
for i in range(len(a)):
if a[i]!=b[i]:
d+=1
else:
pass
print(d)
|
a=input()
b=a
c=b[::-1]
d=0
for i in range(len(a)//2):
if a[i]!=c[i]:
d+=1
else:
pass
print(d)
|
[
"identifier.change",
"control_flow.branch.if.condition.change"
] | 640,306
| 640,305
|
u223555291
|
python
|
p02836
|
import math
s = input()
left = s[:len(s) // 2]
right = s[-math.floor(len(s) / 2):]
ct = 0
for i in range(len(left)):
if left[i] != right[i]: ct += 1
print(ct)
|
import math
s = input()
left = s[:len(s) // 2]
right = s[-math.floor(len(s) / 2):][::-1]
ct = 0
for i in range(len(left)):
if left[i] != right[i]: ct += 1
print(ct)
|
[] | 640,309
| 640,310
|
u979038517
|
python
|
p02836
|
s = int(input())
n = len(s)
ans = 0
for i in range(n//2):
if s[i] != s[n-i-1]:
ans += 1
print(ans)
|
s = input()
n = len(s)
ans = 0
for i in range(n//2):
if s[i] != s[n-i-1]:
ans += 1
print(ans)
|
[
"call.remove",
"call.arguments.change"
] | 640,330
| 640,331
|
u145600939
|
python
|
p02836
|
s = input()
ans = 0
for i in range(len(s)//2+1):
if s[i]!=s[-i-1]: ans+=1
print(ans)
|
s = input()
ans = 0
for i in range(len(s)//2):
if s[i]!=s[-i-1]: ans+=1
print(ans)
|
[
"expression.operation.binary.remove"
] | 640,332
| 640,333
|
u729707098
|
python
|
p02836
|
S=input()
L=len(S)
cnt=0
for i in range(L):
if L[i] is not L[L-1-i]:
cnt +=1
print(cnt)
|
S=input()
L=len(S)
cnt=0
for i in range(L//2):
if S[i] is not S[L-1-i]:
cnt +=1
print(cnt)
|
[
"identifier.change",
"control_flow.branch.if.condition.change"
] | 640,340
| 640,341
|
u337626942
|
python
|
p02836
|
s = list(input())
count = 0
for i,letter in enumerate(s):
if s[i] != s[len(s) - 1 - i]:
count += 1
print(count)
|
s = list(input())
count = 0
for i,letter in enumerate(s):
if s[i] != s[len(s) - 1 - i]:
count += 1
print(int(count/2))
|
[
"call.add",
"call.arguments.change"
] | 640,342
| 640,343
|
u644568755
|
python
|
p02836
|
S = int(input())
ans = 0
for i in range(len(S)):
if S[i] != S[::-1][i]:
ans += 1
print(ans)
|
S = input()
ans = 0
for i in range(len(S)):
if S[i] != S[::-1][i]:
ans += 1
print(ans // 2)
|
[
"call.remove",
"call.arguments.change"
] | 640,352
| 640,353
|
u198062737
|
python
|
p02836
|
s = list(input())
s_len = len(s)
ans = 0
if s_len % 2 == 0:
for i, j in zip(s[0 : (s_len // 2 )], reversed(s[(s_len // 2) : s_len + 1])):
if i != j:
ans += 1
else:
for i, j in zip(s[0 : (s_len // 2 )], reversed(s[(s_len // 2 + 3) : s_len])):
if i != j:
ans += 1
print(ans)
|
s = list(input())
s_len = len(s)
ans = 0
if s_len % 2 == 0:
for i, j in zip(s[0 : (s_len // 2 )], reversed(s[(s_len // 2) : s_len + 1])):
if i != j:
ans += 1
else:
for i, j in zip(s[0 : (s_len // 2 )], reversed(s[(s_len // 2 + 1) : s_len])):
if i != j:
ans += 1
print(ans)
|
[
"literal.number.integer.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 640,360
| 640,361
|
u068142202
|
python
|
p02836
|
S = list(input())
cnt = 0
if len(S)%2 == 0:
for i in range(0,int(len(S)/2+1)):
if S[i] != S[-1-i]:
cnt +=1
else:
for i in range(0,int(len(S)/2)):
if S[i] != S[-1-i]:
cnt +=1
print(cnt)
|
S = list(input())
cnt = 0
if len(S)%2 == 0:
for i in range(0,int(len(S)/2)):
if S[i] != S[-1-i]:
cnt +=1
else:
for i in range(0,int(len(S)/2)):
if S[i] != S[-1-i]:
cnt +=1
print(cnt)
|
[
"expression.operation.binary.remove"
] | 640,366
| 640,367
|
u796708718
|
python
|
p02836
|
S = input()
S_inv = S[::-1]
out = 0
for i in range(len(S)):
if S[i] != S_inv[i]:
out = out + 1
print(out)
|
S = input()
S_inv = S[::-1]
out = 0
for i in range(len(S)):
if S[i] != S_inv[i]:
out = out + 1
out = out // 2
#if out % 2 == 1:
# out == out // 2 + 1
#else:
# out == out // 2
print(out)
|
[
"assignment.add"
] | 640,374
| 640,375
|
u267029978
|
python
|
p02836
|
a=input()
n=len(a)
count=0
for i in range(n):
if a[i]!=a[n+1-i]:
a[i]=a[n+1-i]
count+=1
print(count)
|
a=list(input())
n=len(a)
count=0
for i in range(n):
if a[i]!=a[n-1-i]:
a[i]=a[n-1-i]
count+=1
print(count)
|
[
"call.add",
"call.arguments.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 640,376
| 640,377
|
u530883476
|
python
|
p02836
|
s = list(open(0).read())
len_rev = len(s) // 2
cnt = 0
for i in range(len_rev):
if s[i] != s[-i-1]:
cnt += 1
print(cnt)
|
s = list(input())
len_rev = len(s) // 2
cnt = 0
for i in range(len_rev):
if s[i] != s[-i-1]:
cnt += 1
print(cnt)
|
[
"assignment.value.change",
"identifier.change",
"call.function.change",
"call.arguments.change"
] | 640,385
| 640,386
|
u133347536
|
python
|
p02836
|
# -*- coding: utf-8 -*-
#############
# Libraries #
#############
import sys
input = sys.stdin.readline
import math
from collections import deque
from math import gcd
from functools import lru_cache
#############
# Constants #
#############
MOD = 10**9 +7
INF = float('inf')
#############
# Functions #
#############
######INPUT######
def inputI(): return int(input().strip())
def inputS(): return input().strip()
def inputIL(): return list(map(int,input().split()))
def inputSL(): return list(map(str,input().split()))
def inputILs(n): return list(int(input()) for _ in range(n))
def inputSLs(n): return list(input().strip() for _ in range(n))
def inputILL(n): return [list(map(int, input().split())) for _ in range(n)]
def inputSLL(n): return [list(map(str, input().split())) for _ in range(n)]
#####Inverse#####
def inv(n): return pow(n, MOD-2, MOD)
######Combination######
kaijo_memo = []
def kaijo(n):
if(len(kaijo_memo) > n):
return kaijo_memo[n]
if(len(kaijo_memo) == 0):
kaijo_memo.append(1)
while(len(kaijo_memo) <= n):
kaijo_memo.append(kaijo_memo[-1] * len(kaijo_memo) % MOD)
return kaijo_memo[n]
gyaku_kaijo_memo = []
def gyaku_kaijo(n):
if(len(gyaku_kaijo_memo) > n):
return gyaku_kaijo_memo[n]
if(len(gyaku_kaijo_memo) == 0):
gyaku_kaijo_memo.append(1)
while(len(gyaku_kaijo_memo) <= n):
gyaku_kaijo_memo.append(gyaku_kaijo_memo[-1] * pow(len(gyaku_kaijo_memo),MOD-2,MOD) % MOD)
return gyaku_kaijo_memo[n]
def nCr(n,r):
if(n == r):
return 1
if(n < r or r < 0):
return 0
ret = 1
ret = ret * kaijo(n) % MOD
ret = ret * gyaku_kaijo(r) % MOD
ret = ret * gyaku_kaijo(n-r) % MOD
return ret
######Factorization######
def factorization(n):
arr = []
temp = n
for i in range(2, int(-(-n**0.5//1))+1):
if temp%i==0:
cnt=0
while temp%i==0:
cnt+=1
temp //= i
arr.append([i, cnt])
if temp!=1:
arr.append([temp, 1])
if arr==[]:
arr.append([n, 1])
return arr
#####LCM#####
def lcm(a, b):
return a * b // gcd (a, b)
#############
# Main Code #
#############
s = inputS()
s = list(s)
s_ = s[::-1]
count = 0
for i in range(len(s)):
if s[i] == s_[i]:
count += 1
print(count//2)
|
# -*- coding: utf-8 -*-
#############
# Libraries #
#############
import sys
input = sys.stdin.readline
import math
from collections import deque
from math import gcd
from functools import lru_cache
#############
# Constants #
#############
MOD = 10**9 +7
INF = float('inf')
#############
# Functions #
#############
######INPUT######
def inputI(): return int(input().strip())
def inputS(): return input().strip()
def inputIL(): return list(map(int,input().split()))
def inputSL(): return list(map(str,input().split()))
def inputILs(n): return list(int(input()) for _ in range(n))
def inputSLs(n): return list(input().strip() for _ in range(n))
def inputILL(n): return [list(map(int, input().split())) for _ in range(n)]
def inputSLL(n): return [list(map(str, input().split())) for _ in range(n)]
#####Inverse#####
def inv(n): return pow(n, MOD-2, MOD)
######Combination######
kaijo_memo = []
def kaijo(n):
if(len(kaijo_memo) > n):
return kaijo_memo[n]
if(len(kaijo_memo) == 0):
kaijo_memo.append(1)
while(len(kaijo_memo) <= n):
kaijo_memo.append(kaijo_memo[-1] * len(kaijo_memo) % MOD)
return kaijo_memo[n]
gyaku_kaijo_memo = []
def gyaku_kaijo(n):
if(len(gyaku_kaijo_memo) > n):
return gyaku_kaijo_memo[n]
if(len(gyaku_kaijo_memo) == 0):
gyaku_kaijo_memo.append(1)
while(len(gyaku_kaijo_memo) <= n):
gyaku_kaijo_memo.append(gyaku_kaijo_memo[-1] * pow(len(gyaku_kaijo_memo),MOD-2,MOD) % MOD)
return gyaku_kaijo_memo[n]
def nCr(n,r):
if(n == r):
return 1
if(n < r or r < 0):
return 0
ret = 1
ret = ret * kaijo(n) % MOD
ret = ret * gyaku_kaijo(r) % MOD
ret = ret * gyaku_kaijo(n-r) % MOD
return ret
######Factorization######
def factorization(n):
arr = []
temp = n
for i in range(2, int(-(-n**0.5//1))+1):
if temp%i==0:
cnt=0
while temp%i==0:
cnt+=1
temp //= i
arr.append([i, cnt])
if temp!=1:
arr.append([temp, 1])
if arr==[]:
arr.append([n, 1])
return arr
#####LCM#####
def lcm(a, b):
return a * b // gcd (a, b)
#############
# Main Code #
#############
s = inputS()
s = list(s)
s_ = s[::-1]
count = 0
for i in range(len(s)):
if s[i] != s_[i]:
count += 1
print(count//2)
|
[
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 640,387
| 640,388
|
u493130708
|
python
|
p02836
|
s = input()
count = 0
for i in range(len(s)//2):
if s[i] != s[-1]:
count += 1
return count
|
s = input()
count = 0
for i in range(len(s)//2):
if s[i] != s[-1-i]:
count += 1
print(count)
|
[
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"function.return_value.change",
"call.arguments.change"
] | 640,423
| 640,424
|
u605518908
|
python
|
p02836
|
S = input()
len = len(S)
ans = 0
for i in range(len//2):
if S[i] != S[len-i-2]:
ans = ans + 1
print(ans)
|
S = input()
l = len(S)
ans = 0
for i in range(l//2):
if S[i] != S[l-i-1]:
ans = ans + 1
print(ans)
|
[
"assignment.variable.change",
"identifier.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",
"literal.number.integer.change"
] | 640,436
| 640,437
|
u853477575
|
python
|
p02836
|
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from math import gcd
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def S_MAP(): return map(str, input().split())
def LIST(): return list(map(int, input().split()))
def S_LIST(): return list(map(str, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7
# 最小公倍数
def gcd(a, b):
if a < b:
a, b = b, a
while a % b != 0:
a, b = b, a % b
return b
# 最大公約数
def lcm(a, b):
y = a*b / gcd(a, b)
return int(y)
def primes_for(n):
is_prime = [True] * (n + 1)
is_prime[0] = False
is_prime[1] = False
for i in range(2, n + 1):
for j in range(i * 2, n + 1, i):
is_prime[j] = False
return [i for i in range(n + 1) if is_prime[i]]
# O(√A)
def isPrime(n):
if n < 2:
# 2未満は素数でない
return False
if n == 2:
# 2は素数
return True
for p in range(2, n):
if n % p == 0:
# nまでの数で割り切れたら素数ではない
return False
# nまでの数で割り切れなかったら素数
return True
# 回文 S[::-1]
S = input()
R = S[::-1]
count = 0
print(R)
for i in range(len(S)):
if S[i] != R[i]:
count += 1
print(count//2)
|
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from math import gcd
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def S_MAP(): return map(str, input().split())
def LIST(): return list(map(int, input().split()))
def S_LIST(): return list(map(str, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7
# 最小公倍数
def gcd(a, b):
if a < b:
a, b = b, a
while a % b != 0:
a, b = b, a % b
return b
# 最大公約数
def lcm(a, b):
y = a*b / gcd(a, b)
return int(y)
def primes_for(n):
is_prime = [True] * (n + 1)
is_prime[0] = False
is_prime[1] = False
for i in range(2, n + 1):
for j in range(i * 2, n + 1, i):
is_prime[j] = False
return [i for i in range(n + 1) if is_prime[i]]
# O(√A)
def isPrime(n):
if n < 2:
# 2未満は素数でない
return False
if n == 2:
# 2は素数
return True
for p in range(2, n):
if n % p == 0:
# nまでの数で割り切れたら素数ではない
return False
# nまでの数で割り切れなかったら素数
return True
# 回文 S[::-1]
S = input()
R = S[::-1]
count = 0
# print(R)
for i in range(len(S)):
if S[i] != R[i]:
count += 1
print(count//2)
|
[
"call.remove"
] | 640,457
| 640,458
|
u083960235
|
python
|
p02836
|
s = input()
cnt = 0
for i in range((n+1)//2):
if s[i] != s[n-i-1]:
cnt += 1
print(cnt)
|
s = input()
cnt = 0
for i in range((len(s)+1)//2):
if s[i] != s[-i-1]:
cnt += 1
print(cnt)
|
[
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change",
"call.arguments.add",
"control_flow.branch.if.condition.change"
] | 640,474
| 640,475
|
u114801897
|
python
|
p02836
|
kaibun = input()
i=0
count = 0
while i+1<=len(kaibun)/2:
if kaibun[i]!=kaibunn[-i-1]:
count+=1
i+=1
print(count)
|
kaibun = input()
i=0
count = 0
while i+1<=len(kaibun)/2:
#print( kaibun[i],kaibun[-i-1])
if kaibun[i]!=kaibun[-i-1]:
count+=1
i+=1
print(count)
|
[
"identifier.change",
"control_flow.branch.if.condition.change"
] | 640,476
| 640,477
|
u808757777
|
python
|
p02836
|
S = str(input())
s = list(S)
g= []
m = len(s)//2
ans = 0
for i in range(m):
if(s[i]==s[lens-1-i]):
None
else:
ans+= 1
print(ans)
|
S = str(input())
s = list(S)
g= []
m = len(s)//2
ans = 0
for i in range(m):
if(s[i]==s[len(s)-1-i]):
None
else:
ans+= 1
print(ans)
|
[
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"call.arguments.add"
] | 640,493
| 640,494
|
u655048024
|
python
|
p02836
|
n = input()
number = len(n)
change = 0
for i in range(number//2):
if n[i] != n[number - i]:
change += 1
print(change)
|
n = input()
number = len(n)
change = 0
for i in range(number//2):
if n[i] != n[number - i -1]:
change += 1
print(change)
|
[
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 640,495
| 640,496
|
u963468276
|
python
|
p02836
|
n = input()
c = 0
for i in range(len(n)//2):
if n[i] != n[-i]:
c += 1
print(c)
|
n = input()
c = 0
for i in range(len(n)//2):
if n[i] != n[-i-1]:
c += 1
print(c)
|
[
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 640,505
| 640,506
|
u843612833
|
python
|
p02836
|
a = input()
cnt = 0
for i in range(len(a)):
if a[i]!=a[len(a)-i-1]:
cnt+=1
print(cnt)
|
a = input()
cnt = 0
for i in range(len(a)//2):
if a[i] != a[len(a) - i - 1]:
cnt += 1
print(cnt)
|
[
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 640,507
| 640,508
|
u780143117
|
python
|
p02836
|
s=input()
ans=0
for i in range(len(s)//2):
if s[i]==(s[len(s)-i-1]):
ans+=1
print(ans)
|
s=input()
ans=0
for i in range(len(s)//2):
if s[i]!=(s[len(s)-i-1]):
ans+=1
print(ans)
|
[
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 640,513
| 640,514
|
u060569392
|
python
|
p02836
|
s = str(input())
x = len(s)
tmp = 0
if x%2 == 0:
for i in range((x-1)//2):
if s[i] != s[x-i-1]:
tmp += 1
else:
for i in range(x//2):
if s[i] != s[x-i-1]:
tmp += 1
print(tmp)
|
s = str(input())
x = len(s)
tmp = 0
if x%2 != 0:
for i in range((x-1)//2):
if s[i] != s[x-i-1]:
tmp += 1
else:
for i in range(x//2):
if s[i] != s[x-i-1]:
tmp += 1
print(tmp)
|
[
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 640,524
| 640,525
|
u506587641
|
python
|
p02836
|
s = input();print([1 for i in range(len(s)//2) if s[i]!=s[-i-1]])
|
s = input();print(sum(1 for i in range(len(s)//2) if s[i]!=s[-i-1]))
|
[
"call.arguments.change",
"io.output.change"
] | 640,534
| 640,535
|
u064027771
|
python
|
p02836
|
str = input()
n = len(str)
a = str[:n//2]
b = str[n//2+1:][::-1]
count = 0
for i in range(0,n//2):
if a[i]!=b[i]:
count+=1
print(count)
|
str = input()
n = len(str)
a = str[:n//2]
b = str[n//2+n%2:][::-1]
count = 0
for i in range(0,n//2):
if a[i]!=b[i]:
count+=1
print(count)
|
[
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 640,540
| 640,541
|
u791788195
|
python
|
p02836
|
S = list(str(input()))
n = int(len(S) / 2)
result = 0
for i in range(n):
if S[i-1] != S[-i]:
result += 1
print(result)
|
S = list(str(input()))
n = int(len(S) / 2)
result = 0
for i in range(n):
if S[i] != S[-i-1]:
result += 1
print(result)
|
[
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change",
"misc.off_by_one"
] | 640,555
| 640,556
|
u485566817
|
python
|
p02836
|
s = input()
sr = s[::-1]
cnt = 0
for i in range(0, len(s)):
if s[i] != sr[i]:
cnt += 1
else:
pass
print(cnt)
|
s = input()
sr = s[::-1]
cnt = 0
for i in range(0, len(s)//2):
if s[i] != sr[i]:
cnt += 1
else:
pass
print(cnt)
|
[
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 640,557
| 640,558
|
u456117140
|
python
|
p02836
|
s = input()
count = 0
len_s = len(s)
for a,b in zip(s[:len_s//2], s[:len_s//2:-1]):
if a != b:
count += 1
print(count)
|
s = input()
count = 0
len_s = len(s)
for a,b in zip(s[:len_s//2+1], s[:len_s//2-1:-1]):
if a != b:
count += 1
print(count)
|
[
"expression.operation.binary.add"
] | 640,559
| 640,560
|
u502776708
|
python
|
p02836
|
word=input()
word_rev=word[::-1]
cnt=0
for i in range(len(word)):
if word[i]!=word_rev[i]:
cnt+=1
print(cnt)
|
word=input()
word_rev=word[::-1]
cnt=0
for i in range(len(word)):
if word[i]!=word_rev[i]:
cnt+=1
print(int(cnt/2))
|
[
"call.add",
"call.arguments.change"
] | 640,569
| 640,570
|
u365435888
|
python
|
p02836
|
from math import modf
word=input()
word=list(set(word))
n=len(word)/2
decimal,integer=modf(n)
integer=int(integer)
count=0
for i in range(integer):
if word[i]!=word[-i-1]:
word[-i-1]=word[i]
count+=1
print(count)
|
from math import modf
word=input()
word=list(word)
n=len(word)/2
decimal,integer=modf(n)
integer=int(integer)
count=0
for i in range(integer):
if word[i]!=word[-i-1]:
word[-i-1]=word[i]
count+=1
print(count)
|
[
"call.remove",
"call.arguments.change"
] | 640,583
| 640,584
|
u843909647
|
python
|
p02836
|
s = input()
count = 0
for i in range(len(s) // 2):
if s[i] != s[-i]:
count += 1
print(count)
|
s = input()
count = 0
for i in range(len(s) // 2):
if s[i] != s[-i-1]:
count += 1
print(count)
|
[
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 640,585
| 640,586
|
u958154834
|
python
|
p02836
|
S = input()
n = 0
for i in range(len(S)//2):
if S[i] != S[i-1]:
n+=1
print(n)
|
S = input()
n = 0
for i in range(len(S)//2):
if S[i] != S[-i-1]:
n+=1
print(n)
|
[
"expression.operation.unary.add",
"control_flow.branch.if.condition.change"
] | 640,591
| 640,592
|
u158703648
|
python
|
p02836
|
s = input("")
print(s)
i = 0
length = len(s)
# print(type(len))
# print(len)
count = 0
for i in range (0, length):
if s[i] != s[length - i - 1]:
count += 1
print(int(count / 2))
|
s = input("")
i = 0
length = len(s)
# print(type(len))
# print(len)
count = 0
for i in range (0, length):
if s[i] != s[length - i - 1]:
count += 1
print(int(count / 2))
|
[
"call.remove"
] | 640,612
| 640,613
|
u109314200
|
python
|
p02836
|
string = input()
count = 0
for i in range(int(len(string)/2)):
if string[i] == string[-i]:
count += 1
print(count)
|
string = input()
count = 0
for i in range(int(len(string)/2)):
if string[i] != string[-(i+1)]:
count += 1
print(count)
|
[
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 640,628
| 640,629
|
u486576551
|
python
|
p02836
|
# -*- coding: utf-8 -*-
s = input()
s_list = list(s)
s_len = len(s_list)
hag = 0
for i in range(s_len//2):
if s_list[i] != s_list[(s_len-1)-i]:
s_list[s_len-i] = s_list[i]
hag += 1
print(hag)
|
# -*- coding: utf-8 -*-
s = input()
s_list = list(s)
s_len = len(s_list)
hag = 0
for i in range(s_len//2):
if s_list[i] != s_list[(s_len-1)-i]:
s_list[(s_len-1)-i] = s_list[i]
hag += 1
print(hag)
|
[] | 640,639
| 640,640
|
u977141657
|
python
|
p02836
|
s = input()
l = len(s)
sen = l // 2
c = 0
for i in range(sen):
s1 = s[i]
s2 = s[l-i]
if s1 != s2:
c += 1
print(c)
|
s = input()
l = len(s)
sen = l // 2
c = 0
for i in range(sen):
s1 = s[i]
s2 = s[l-i-1]
if s1 != s2:
c += 1
print(c)
|
[
"assignment.change"
] | 640,660
| 640,661
|
u260509802
|
python
|
p02836
|
a = list(input())
n = len(a)
ans = 0
for i in range(int(n/2)):
if a[i] != a[-i]:
ans += 1
print(ans)
|
a = list(input())
n = len(a)
ans = 0
for i in range(int(n/2)):
if a[i] != a[n-1-i]:
ans += 1
print(ans)
|
[
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 640,670
| 640,671
|
u628633224
|
python
|
p02836
|
r=0
s=input()
for n in len(s):
if s[n]!=s[-n]:
r+=1
print(r/2)
|
r = 0
s = input()
for n in range(len(s)):
if s[n] != s[-n-1]:
r += 1
print(r//2)
|
[
"call.add",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"expression.operator.arithmetic.change",
"expression.operation.binary.change",
"io.output.change"
] | 640,674
| 640,673
|
u723792785
|
python
|
p02836
|
s = input()
n = len(str)
ans = 0
for i in range(int(n/2)):
if s[i] != s[n-i-1]:
ans += 1
print(ans)
|
s = input()
n = len(s)
ans = 0
for i in range(int(n/2)):
if s[i] != s[n-i-1]:
ans += 1
print(ans)
|
[
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 640,681
| 640,682
|
u598755311
|
python
|
p02836
|
S = input()
count=0
if len(S)%2==0:
for i,s in enumerate(S):
if S[len(S)-i-1]!=s:
count+=1
if i>=len(S)//2:
break
else:
for i,s in enumerate(S):
if S[len(S)-i-1]!=s:
count+=1
if i==len(S)//2:
break
print(count)
|
S = input()
count=0
if len(S)%2==0:
for i,s in enumerate(S):
if S[len(S)-i-1]!=s:
count+=1
if i>=len(S)//2-1:
break
else:
for i,s in enumerate(S):
if S[len(S)-i-1]!=s:
count+=1
if i==len(S)//2:
break
print(count)
|
[
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 640,683
| 640,684
|
u415196833
|
python
|
p02836
|
S = input()
count=0
if len(S)%2==0:
for i,s in inumerate(S):
if S[len(S)-i-1]!=s:
count+=1
if i>=len(S)//2:
break
else:
for i,s in inumerate(S):
if S[len(S)-i-1]!=s:
count+=1
if i==len(S)//2:
break
print(count)
|
S = input()
count=0
if len(S)%2==0:
for i,s in enumerate(S):
if S[len(S)-i-1]!=s:
count+=1
if i>=len(S)//2-1:
break
else:
for i,s in enumerate(S):
if S[len(S)-i-1]!=s:
count+=1
if i==len(S)//2:
break
print(count)
|
[
"identifier.change",
"call.function.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 640,685
| 640,684
|
u415196833
|
python
|
p02836
|
#lang:reverse.py
result = 0
str = input()
#文字数
str_length = len(str)
rev_str = str[::-1]
count = 0
if str_length % 2 == 1:
count = (str_length -1)/2
else:
count = str_length / 2
for i in range(count):
if str[i] != rev_str[i] :
result = result + 1
print(result)
|
#lang:reverse.py
result = 0
str = input()
#文字数
str_length = len(str)
rev_str = str[::-1]
count = 0
if str_length % 2 == 1:
count = (str_length -1)/2
else:
count = str_length / 2
for i in range(int(count)):
if str[i] != rev_str[i] :
result = result + 1
print(result)
|
[
"call.add",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 640,686
| 640,687
|
u579699847
|
python
|
p02836
|
import sys
import math
def resolve():
S=input().rstrip()
c=0
for i in range((len(S)/2)):
if(S[i]!=S[-i-1]):
c+=1
print(c)
from io import StringIO
import unittest
class TestClass(unittest.TestCase):
def assertIO(self, input, output):
stdout, stdin = sys.stdout, sys.stdin
sys.stdout, sys.stdin = StringIO(), StringIO(input)
resolve()
sys.stdout.seek(0)
out = sys.stdout.read()[:-1]
sys.stdout, sys.stdin = stdout, stdin
self.assertEqual(out, output)
def test_入力例_1(self):
input = """redcoder"""
output = """1"""
self.assertIO(input, output)
def test_入力例_2(self):
input = """vvvvvv"""
output = """0"""
self.assertIO(input, output)
def test_入力例_3(self):
input = """abcdabc"""
output = """2"""
self.assertIO(input, output)
if __name__ == "__main__":
#unittest.main()
resolve()
|
import sys
import math
def resolve():
S=input().rstrip()
c=0
for i in range((len(S)//2)):
if(S[i]!=S[-i-1]):
c+=1
print(c)
from io import StringIO
import unittest
class TestClass(unittest.TestCase):
def assertIO(self, input, output):
stdout, stdin = sys.stdout, sys.stdin
sys.stdout, sys.stdin = StringIO(), StringIO(input)
resolve()
sys.stdout.seek(0)
out = sys.stdout.read()[:-1]
sys.stdout, sys.stdin = stdout, stdin
self.assertEqual(out, output)
def test_入力例_1(self):
input = """redcoder"""
output = """1"""
self.assertIO(input, output)
def test_入力例_2(self):
input = """vvvvvv"""
output = """0"""
self.assertIO(input, output)
def test_入力例_3(self):
input = """abcdabc"""
output = """2"""
self.assertIO(input, output)
if __name__ == "__main__":
#unittest.main()
resolve()
|
[
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change"
] | 640,690
| 640,691
|
u141429472
|
python
|
p02836
|
s = input()
l = len(s)
c = 0
for i in range(l//2):
if s[i] == s[l-i-1]:
c+=1
print(c)
|
s = input()
l = len(s)
c = 0
for i in range(l//2):
if s[i] != s[l-i-1]:
c+=1
print(c)
|
[
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 640,706
| 640,707
|
u332066938
|
python
|
p02836
|
S=input()
S=list(S)
count=0
for i in range(len(S)//2):
if S[i]!=S[-(i+1)]:
count = cunt+1
print(count)
|
S=input()
S=list(S)
count=0
for i in range(len(S)//2):
if S[i]!=S[-(i+1)]:
count = count+1
print(count)
|
[
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 640,708
| 640,709
|
u247291356
|
python
|
p02836
|
S=input()
num=0
for i in range(len(S)//2):
if S[i]!=S[-i]:
num+=1
print(num)
|
S=input()
num=0
for i in range(len(S)//2):
if S[i]!=S[-(i+1)]:
num+=1
print(num)
|
[
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 640,724
| 640,725
|
u782616557
|
python
|
p02836
|
S=input()[:-1]
ans=0
for f,r in zip(S,reversed(S)):
if f==r:
continue
else:
ans+=1
print(ans//2)
|
S=input()
ans=0
for f,r in zip(S,reversed(S)):
if f==r:
continue
else:
ans+=1
print(ans//2)
|
[] | 640,726
| 640,727
|
u375616706
|
python
|
p02836
|
S = input()
c = 0
for n in range(len(S)//1):
if(S[n] != S[-n-1]):
c = c + 1
print(c)
|
S = input()
c = 0
for n in range(len(S)//2):
if(S[n] != S[-n-1]):
c = c + 1
print(c)
|
[
"literal.number.integer.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change"
] | 640,739
| 640,740
|
u546157297
|
python
|
p02836
|
S = input()
c = 0
for n in range(len(S)//2):
if(S[n] != S[-n]):
c = c + 1
print(c)
|
S = input()
c = 0
for n in range(len(S)//2):
if(S[n] != S[-n-1]):
c = c + 1
print(c)
|
[
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 640,741
| 640,740
|
u546157297
|
python
|
p02836
|
str = input()
count = 0
for i in range(len(str)):
if str[i] != str[len(str)-1-1]:
count += 1
print(count/2)
|
str = input()
count = 0
for i in range(len(str)):
if str[i] != str[len(str)-1-i]:
count += 1
print(int(count/2))
|
[
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"call.add",
"call.arguments.change"
] | 640,744
| 640,745
|
u870114934
|
python
|
p02836
|
str = input
count = 0
for i in range(len(str)):
if str[i] != str[len(str)-1-1]:
count += 1
print(count/2)
|
str = input()
count = 0
for i in range(len(str)):
if str[i] != str[len(str)-1-i]:
count += 1
print(int(count/2))
|
[
"call.add",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"call.arguments.change"
] | 640,746
| 640,745
|
u870114934
|
python
|
p02836
|
S = input().strip()
l=int(len(S))
count=0
for i in range(l):
if S[i] !=S[l-i-1]:
count = count+1
print(count)
|
S = input().strip()
l=int(len(S))
count=0
for i in range(l//2):
if S[i] !=S[l-i-1]:
count = count+1
print(count)
|
[
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 640,757
| 640,758
|
u799635973
|
python
|
p02836
|
bun = inputs[0]
nub = list(reversed(bun))
n = int(len(bun) / 2)
i = hug = 0
while i < n:
if bun[i] != nub[i]:
hug += 1
i += 1
print(hug)
|
bun = input()
nub = list(reversed(bun))
n = int(len(bun) / 2)
i = hug = 0
while i < n:
if bun[i] != nub[i]:
hug += 1
i += 1
print(hug)
|
[] | 640,761
| 640,762
|
u781262926
|
python
|
p02836
|
bun = input()
nub = reversed(S)
n = int(len(S) / 2)
i = hug = 0
while i < n:
if bun[i] != nub[i]:
hug += 1
i += 1
print(hug)
|
bun = input()
nub = list(reversed(bun))
n = int(len(bun) / 2)
i = hug = 0
while i < n:
if bun[i] != nub[i]:
hug += 1
i += 1
print(hug)
|
[
"call.add",
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 640,763
| 640,762
|
u781262926
|
python
|
p02836
|
def read():
S = input().strip()
print(S,)
return S,
def solve(S):
harf = len(S) // 2
count = 0
for i in range(harf):
if S[i] != S[len(S) - 1 - i]:
count += 1
return count
if __name__ == '__main__':
inputs = read()
print("%d" % solve(*inputs))
|
def read():
S = input().strip()
return S,
def solve(S):
harf = len(S) // 2
count = 0
for i in range(harf):
if S[i] != S[len(S) - 1 - i]:
count += 1
return count
if __name__ == '__main__':
inputs = read()
print("%d" % solve(*inputs))
|
[
"call.remove"
] | 640,766
| 640,767
|
u826331398
|
python
|
p02836
|
S = input().split()
p=len(S)
t=0
for n in range(p):
if S[n]!=S[p-n-1]:
t+=1
print(int(t/2))
|
S = list(input())
p=len(S)
t=0
for n in range(p):
if S[n]!=S[p-n-1]:
t+=1
print(int(t/2))
|
[
"call.add",
"call.remove"
] | 640,768
| 640,769
|
u357230322
|
python
|
p02836
|
S = input().split()
p=len(S)
t=0
for n in range(p):
if S[n]!=S[p-n-1]:
t+=1
print(int(t/2))
|
S = input()
p=len(S)
t=0
for n in range(p):
if S[n]!=S[p-n-1]:
t+=1
print(int(t/2))
|
[
"call.remove"
] | 640,768
| 640,770
|
u357230322
|
python
|
p02836
|
S = input()
Slist = []
for i in range(len(S)):
Slist.append(S[i])
count = 0
for i in range(len(S)//2):
if Slist[i] != Slist[-i]:
count +=1
print(count)
|
S = input()
Slist = []
for i in range(len(S)):
Slist.append(S[i])
count = 0
##print(len(S))
for i in range(len(S)//2):
##print(Slist[i],Slist[-i-1])
if Slist[i] != Slist[len(S)-1-i]:
count +=1
print(count)
|
[
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 640,775
| 640,776
|
u902453631
|
python
|
p02836
|
S=input()
n=0
if len(S)%2==0:
for i in range (0,int(len(S))/2):
if S[i]!=S[-i-1]:
n+=1
else:
for i in range (0,int(((len(S))+1)/2)):
if S[i]!=S[-i-1]:
n+=1
print(n)
|
S=input()
n=0
if len(S)%2==0:
for i in range (0,int((len(S))/2)):
if S[i]!=S[-i-1]:
n+=1
else:
for i in range (0,int(((len(S))+1)/2)):
if S[i]!=S[-i-1]:
n+=1
print(n)
|
[
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 640,785
| 640,786
|
u070246438
|
python
|
p02836
|
S = str(input())
Slist = list(S)
newlist = list(reversed(Slist))
ans = 0
for i in range((len(S)//2)):
if Slist[i] == newlist[i]:
ans += 1
print(ans)
|
S = str(input())
Slist = list(S)
newlist = list(reversed(Slist))
ans = 0
for i in range((len(S)//2)):
if Slist[i] != newlist[i]:
ans += 1
print(ans)
|
[
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 640,789
| 640,788
|
u810348111
|
python
|
p02836
|
S = str(input())
Slist = list(S)
newlist = list(reversed(Slist))
ans = 0
for i in range((len(S)//2)):
if Slist[i] == newlist[i]:
a += 1
print(ans)
|
S = str(input())
Slist = list(S)
newlist = list(reversed(Slist))
ans = 0
for i in range((len(S)//2)):
if Slist[i] != newlist[i]:
ans += 1
print(ans)
|
[
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"identifier.change"
] | 640,790
| 640,788
|
u810348111
|
python
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.