ZhenlongDai/ACPR huggingface dataset:
Problem: p02836
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
string = str(input())
length = len(string)

t = 0
c = 0

def check(moji1,moji2):
    moji2 = list(moji2)
    moji1 = list(moji1)
    count = 0
    print(moji1+moji2)
    for i in range(t):
        if moji1[i] != moji2[i]:
            count += 1
    return count

if length % 2:
    t = int((length - 1)/2)
    mojimoji = list(string)
    newmoji1 = ""
    newmoji2 = ""
    for a in range(t):
        newmoji1 += mojimoji[a]
        newmoji2 += mojimoji[length-(1+a)]
    c = check(newmoji1,newmoji2)

else:
    t = int(length/2)
    mojimoji = list(string)
    newmoji1 = ""
    newmoji2 = ""
    for a in range(t):
        newmoji1 += mojimoji[a]
        newmoji2 += mojimoji[length-(1+a)]
    c = check(newmoji1,newmoji2)


print(c)

Failing test case input:
dbb``bd

Expected output:
1


Actual output:
['d', 'b', 'b', 'd', 'b', '`']
1


Fixed submission (verdict: Accepted):
string = str(input())
length = len(string)

t = 0
c = 0

def check(moji1,moji2):
    moji2 = list(moji2)
    moji1 = list(moji1)
    count = 0
    for i in range(t):
        if moji1[i] != moji2[i]:
            count += 1
    return count

if length % 2:
    t = int((length - 1)/2)
    mojimoji = list(string)
    newmoji1 = ""
    newmoji2 = ""
    for a in range(t):
        newmoji1 += mojimoji[a]
        newmoji2 += mojimoji[length-(1+a)]
    c = check(newmoji1,newmoji2)

else:
    t = int(length/2)
    mojimoji = list(string)
    newmoji1 = ""
    newmoji2 = ""
    for a in range(t):
        newmoji1 += mojimoji[a]
        newmoji2 += mojimoji[length-(1+a)]
    c = check(newmoji1,newmoji2)


print(c)

Problem: p02836
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
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)
    
  


Failing test case input:
odfrbddr

Expected output:
3


Actual output:
0


Fixed submission (verdict: Accepted):
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)

Problem: p02836
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
s = input()
n_s = s[::-1]
print(sum(s != n_s for i,j in zip(s, n_s)))

Failing test case input:
oddbrcfr

Expected output:
4


Actual output:
8


Fixed submission (verdict: Accepted):
s = str(input())
print(sum(i < j for i,j in zip(s, s[::-1])))

Problem: p02836
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
s = list(input())
l = len(s)

s1 = s[:int(l/2)]
s2 = s[-int(l/2):]
s2.reverse()

print(s1)
print(s2)
dif = 0
for i in range(int(l/2)):
  print(i)
  if s1[i] != s2[i]:
    dif += 1

print(dif)

Failing test case input:
vsvwww

Expected output:
3


Actual output:
['v', 's', 'v']
['w', 'w', 'w']
0
1
2
3


Fixed submission (verdict: Accepted):
s = list(input())
l = len(s)

s1 = s[:int(l/2)]
s2 = s[-int(l/2):]
s2.reverse()

dif = 0
for i in range(int(l/2)):
  if s1[i] != s2[i]:
    dif += 1

print(dif)
Problem: p02836
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
S = str(input())
count = 0
for i in range(0,len(S)) :
  if list(S)[i] != list(reversed(S))[i] :
    count+=1
print(count / 2)

Failing test case input:
ecbc`b`

Expected output:
3


Actual output:
3.0


Fixed submission (verdict: Accepted):
S = str(input())
count = 0
for i in range(0,len(S)) :
  if list(S)[i] != list(reversed(S))[i] :
    count+=1
print(int(count / 2))

Problem: p02836
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
word=input()
word_rev=word[::-1]
cnt=0

for i in range(len(word)):
    
    if word[i]!=word_rev[i]:
        
        cnt+=1
        
print(cnt)

Failing test case input:
wvywsv

Expected output:
3


Actual output:
6


Fixed submission (verdict: Accepted):
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))

Problem: p02836
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
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)


Failing test case input:
vxwvwt

Expected output:
3


Actual output:
4


Fixed submission (verdict: Accepted):
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)

Problem: p02836
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
s = input()
ans = 0
for i in range(len(s)):
  if s[i] != s[-(i+1)]:
    ans += 1
print(ans)

Failing test case input:
dcbd`b`

Expected output:
3


Actual output:
6


Fixed submission (verdict: Accepted):
s = input()
ans = 0
for i in range(len(s)):
  if s[i] != s[-(i+1)]:
    ans += 1
print(ans

Problem: p02836
Buggy submission (PyPy3 (2.4.0), verdict: Wrong Answer):
s = str(input())
ans = 0
j = len(s)-1
for i in range(len(s)):
  if s[i] != s[j]:
    ans += 1
  j -= 1
  
print(ans)

Failing test case input:
aacbacc

Expected output:
3


Actual output:
6


Fixed submission (verdict: Accepted):
s = str(input())
ans = 0
j = len(s)-1
for i in range(len(s)):
  if s[i] != s[j]:
    ans += 1
  j -= 1
  
print(int(ans/2))

Problem: p02836
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
A = list(input())
B = round(len(A) / 2)
if len(A) % 2 != 0:
	A.pop(B - 1)
R = 0
C = A[0:B]
D = A[-B:]
D = D[::-1]
count = 0
for i in range(B - 1):
	if C[count] != D[count]:
		R += 1
	count += 1
print(str(R))

Failing test case input:
rddbrfdo

Expected output:
3


Actual output:
2


Fixed submission (verdict: Accepted):
A = list(input())
import math
B = math.ceil(len(A) / 2)
R = 0
C = A[0:B]
D = A[-B:]
D = D[::-1]
count = 0
for i in range(B):
	if C[count] != D[count]:
		R += 1
	count += 1
print(str(R))

Problem: p02836
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
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))

Failing test case input:
ecbd`b`

Expected output:
3


Actual output:
ecbd`b` `b`dbce
3


Fixed submission (verdict: Accepted):
s = input()
t = s[::-1]
count = 0
for i in range(len(s)):
  if s[i] != t[i]:
    count += 1
print(int(count/2))
Problem: p02836
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
import math

def countHugs(input_string):
  string_arr = [char for char in input_string]
  pointerA = string_arr[0]
  pointerB = string_arr[-1]
  hugs = 0
  for r in range(0, (math.ceil(len(string_arr)/2)) - 1):
    if pointerA != pointerB:
      hugs += 1
    pointerA = string_arr[r]
    pointerB = string_arr[-r]
  print(hugs)

if __name__ == "__main__":
    input_string = input()
    countHugs(input_string)

Failing test case input:
cdabcaa

Expected output:
3


Actual output:
2


Fixed submission (verdict: Accepted):
import math

def countHugs(input_string):
  string_arr = [char for char in input_string]
  hugs = 0
  for r in range(0, (math.ceil(len(string_arr)/2))):
    pointerA = string_arr[r]
    pointerB = string_arr[-(r+1)]
    if pointerA != pointerB:
      hugs += 1
  print(hugs)

if __name__ == "__main__":
    input_string = input()
    countHugs(input_string)

Problem: p02836
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
import sys

s = sys.stdin.read().strip()
c = 0
l = len(s)
print(int(l/2))
for i in range(int(l/2)):
  if s[i] != s[l-i-1]:
    c += 1
print(c)


Failing test case input:
cbb``cc

Expected output:
2


Actual output:
3
2


Fixed submission (verdict: Accepted):
import sys

s = sys.stdin.read().strip()
c = 0
l = len(s)
for i in range(int(l/2)):
  if s[i] != s[l-i-1]:
    c += 1
print(c)

Problem: p02836
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
import math

str = input()
l = len(str)

if l % 2 == 1:  
  t = math.floor(l/2)
  d = str[0:t]
  
  dd = list(d)
  
  e = str[t+1:l]
  

  
  ee = list(reversed(e))
  
  
  ans = len(set(dd) & set(ee))
  print(t-ans)
        
else:  
  t = int(l/2)
  print(t)
  d = str[0:t]
  
  dd = list(d)
  
  e = str[t:l]
  

  
  ee = list(reversed(e))
  
  
  ans = len(set(dd) & set(ee))
  print(t-ans)

Failing test case input:
rdeboder

Expected output:
3


Actual output:
4
1


Fixed submission (verdict: Accepted):
import math

str = input()
ans = 0
l = len(str)

if l % 2 == 1:  
  t = math.floor(l/2)
  d = str[0:t]
  dd = list(d)
  e = str[t+1:l]
  ee = list(reversed(e))
  
  for i in range(t):
    if dd[i] != ee[i]:
      ans += 1
  print(ans)
  
else:  
  t = math.floor(l/2)
  d = str[0:t]
  dd = list(d)
  e = str[t:l]
  ee = list(reversed(e))
  
  for i in range(t):
    if dd[i] != ee[i]:
      ans += 1
  print(ans)

Problem: p02836
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
s = input()
cnt = 0
for i in range(len(s)):
    a0, a1 = s[i], s[-i-1]
    if a0 != a1:
        cnt += 1
print(cnt)
    

Failing test case input:
dcbd`b`

Expected output:
3


Actual output:
6


Fixed submission (verdict: Accepted):
s = input()
cnt = 0
for i in range(len(s)
    a0, a1 = s[i], s[-i-1]
    if a0 != a1:
        cnt += 1
print(cnt)
Problem: p02836
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
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)
                



Failing test case input:
recqabod

Expected output:
4


Actual output:
5


Fixed submission (verdict: Accepted):
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)

Problem: p02836
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a = input()
count = 0



list_before = []
list_after = []
for i in a:
	if count < len(a)/2:
		list_before.append(i)
	else:
		list_after.append(i)
	count += 1

l = int(len(a)/2)
count = 0
if len(list_before) % 2 == 1:
	for i in range(l-1):
		if list_before[i] != list_after[l-1 - i]:
			list_before[i] = list_after[l-1 - i]
			count += 1
else: 
	for i in range(l):
		if list_before[i] != list_after[l-1 - i]:
			list_before[i] = list_after[l-1 - i]
			count += 1
		

print(count)

Failing test case input:
ywuwsw

Expected output:
3


Actual output:
2


Fixed submission (verdict: Accepted):
a = input()
count = 0



list_before = []
list_after = []
for i in a:
	if count < len(a)/2:
		list_before.append(i)
	else:
		list_after.append(i)
	count += 1




l = int(len(a)/2)
count = 0
if len(list_before)-len(list_after) == 1:
	for i in range(l):
		if list_before[i] != list_after[l-1 - i]:
			list_before[i] = list_after[l-1 - i]
			count += 1
else: 
	for i in range(l):
		if list_before[i] != list_after[l-1 - i]:
			list_before[i] = list_after[l-1 - i]
			count += 1
		



print(count)

Problem: p02836
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
s = input()



len = int(len(s)/2)

input = s[:len]
reverse_s =s[::-1]
reverse_s=reverse_s[:len]

cnt = 0

for i in range(len):
    if input[i] != reverse_s[i]:
        cnt +=1

print(input)
print(reverse_s)
print(cnt)

Failing test case input:
rddbrcfo

Expected output:
4


Actual output:
rddb
ofcr
4


Fixed submission (verdict: Accepted):
s = input()



len = int(len(s)/2)

input = s[:len]
reverse_s =s[::-1]
reverse_s=reverse_s[:len]

cnt = 0

for i in range(len):
    if input[i] != reverse_s[i]:
        cnt +=1



print(cnt)

Problem: p02836
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
S=input()
SR=S[::-1]
ans=0

for i in range(len(S)):
    if S[i] != SR[i]:
        ans = ans + 1

print(ans-1)

Failing test case input:
rdbrafdo

Expected output:
3


Actual output:
5


Fixed submission (verdict: Accepted):
S=input()
SR=S[::-1]
ans=0

for i in range(len(S)):

    if S[i] != SR[i]:
        ans = ans + 1
        S = S[:i] + SR[i] + S[i+1:]
        SR=S[::-1]


print(ans)
Problem: p02836
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
S = input()
result = 0
for i in range(int(len(S) / 2)):
    if S[i] != S[-i]:
        result += 1
print(result)

Failing test case input:
recqabod

Expected output:
4


Actual output:
3


Fixed submission (verdict: Accepted):
S = input()
result = 0
for i in range(int(len(S) / 2)):
    if S[i] != S[-(i+1)]:
        result += 1
print(result)

Problem: p02836
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
s = list(input())

if len(s)%2!=0:
  point = int((len(s)-1)/2)
  count = 0
  for i in range(1,int((len(s)-1)/2+1)):
    if s[point-i]!=s[point+i]:
      count += 1
  print(count)
  exit()
elif len(s)%2==0:
  point1 = int(len(s)/2-1)
  point2 = int(len(s)/2)
  count = 0
  for i in range(1,int(len(s)/2)):
    if s[point1-i]!=s[point2+i]:
      count += 1
  print(count)

Failing test case input:
odfrbddr

Expected output:
3


Actual output:
2


Fixed submission (verdict: Accepted):
s = list(input())

if len(s)%2!=0:
  point = int((len(s)-1)/2)
  count = 0
  for i in range(0,int((len(s)-1)/2+1)):
    if s[point-i]!=s[point+i]:
      count += 1
  print(count)
  exit()
elif len(s)%2==0:
  point1 = int(len(s)/2-1)
  point2 = int(len(s)/2)
  count = 0
  for i in range(0,int(len(s)/2)):
    if s[point1-i]!=s[point2+i]:
      count += 1
  print(count)

Problem: p02836
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
S = input()
count = 0

leng = len(S)


        
for i in range(0,int(leng/2)):
    if(S[i] != S[leng-i-1]):
        print(S[i])
        count+=1
    
print("%d"%(count))
    


Failing test case input:
rdebrdeo

Expected output:
4


Actual output:
r
d
e
b
4


Fixed submission (verdict: Accepted):
S = input()
count = 0

leng = len(S)


        
for i in range(0,int(leng/2)):
    if(S[i] != S[leng-i-1]):
        count+=1
    
print("%d"%(count))

Problem: p02836
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
s = list(input())

t = list(reversed(s))

x = 0

for i in range(len(s)):

    if s[i] != t[i]:
        x += 1
        
print(x)

Failing test case input:
vxwvwt

Expected output:
3


Actual output:
6


Fixed submission (verdict: Accepted):
s = list(input())

t = list(reversed(s))

x = 0

for i in range(len(s)):
    if s == list(reversed(s)):
        break

    if s[i] != t[i]:
        s[i] = t[i]
        x += 1
        
print(x)

Problem: p02836
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
S = input()
l = [i for i in S] 
print(l)

count = 0

while len(l) > 1:
    
    
    print(l)
    if l.pop(0) != l.pop(-1):
        count += 1
print(count)

Failing test case input:
`cbbeb`

Expected output:
2


Actual output:
['`', 'c', 'b', 'b', 'e', 'b', '`']
['`', 'c', 'b', 'b', 'e', 'b', '`']
['c', 'b', 'b', 'e', 'b']
['b', 'b', 'e']
2


Fixed submission (verdict: Accepted):
S = input()
l = [i for i in S] 
count = 0

while len(l) > 1:

    if l.pop(0) != l.pop(-1):
        count += 1

print(count)
Problem: p02836
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
s1=[x for x in input()]
s2=s1[::-1]

print(s1)
print(s2)

cnt=0
for i in range(len(s1)):
  if s1[i] != s2[i]:
    cnt+=0.5
print(int(cnt))

Failing test case input:
recraddo

Expected output:
4


Actual output:
['r', 'e', 'c', 'r', 'a', 'd', 'd', 'o']
['o', 'd', 'd', 'a', 'r', 'c', 'e', 'r']
4


Fixed submission (verdict: Accepted):
s1=[x for x in input()]
s2=s1[::-1]
cnt=0
for i in range(len(s1)):
  if s1[i] != s2[i]:
    cnt+=0.5
print(int(cnt))

Problem: p02836
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
S = input()
result = 0
for i in range(int(len(S) / 2)):
    print(i, S[i], S[-(i+1)])
    if S[i] != S[-(i+1)]:
        result += 1
print(result)

Failing test case input:
vswwwv

Expected output:
1


Actual output:
0 v v
1 s w
2 w w
1


Fixed submission (verdict: Accepted):
S = input()
result = 0
for i in range(int(len(S) / 2)):
    if S[i] != S[-(i+1)]:
        result += 1
print(result)

Problem: p02836
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
S = input()
ans=0
L=len(S)
l=int(L/2)
if l%2==1:
    l=l-1
for n in range(l):
    if not(S[n]==S[L-(n+1)]):
        ans+=1
print(ans)


Failing test case input:
aacbadc

Expected output:
3


Actual output:
2


Fixed submission (verdict: Accepted):
S = input()
ans=0
L=len(S)
l=int(L/2)
for n in range(l):
    if not(S[n]==S[L-(n+1)]):
        ans+=1
print(ans)

Problem: p02836
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
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)

Failing test case input:
cb``bcc

Expected output:
2


Actual output:
4


Fixed submission (verdict: Accepted):
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)

Problem: p02836
Buggy submission (PyPy3 (2.4.0), verdict: Wrong Answer):
def solve():
    S = input()
    reversed_S = S[::-1]

    ans = 0
    for ch, rev_ch in zip(S, reversed_S):
        if ch != rev_ch:
            ans += 1
    
    print(ans/2)
        
if __name__ == '__main__':
    solve()

Failing test case input:
vwvwxv

Expected output:
2


Actual output:
2.0


Fixed submission (verdict: Accepted):
import math
def solve():
    S = list(input())

    cnt = 0
    for i in range(math.ceil(len(S)/2)):
        if S[i] != S[-(i+1)]:
            cnt += 1
    
    print(cnt)

if __name__ == '__main__':
    solve()

Problem: p02836
Buggy submission (PyPy3 (7.3.0), verdict: Wrong Answer):
s = list(input())
n = len(s)
res = 0

for i in range(n):
    if s[i] != s[n-1-i]:
        res += 1

print(res)


Failing test case input:
odbaqcer

Expected output:
4


Actual output:
8


Fixed submission (verdict: Accepted):
s = list(input())
n = len(s)
res = 0

for i in range(n
    if s[i] != s[n-1-i]:
        res += 1

print(res)
Problem: p02836
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
S=list(input())
C=len(S)


D=0
for n in range(C):
        if S[n]!=S[C-n-1]:
            D=D+1
print(D/2)

Failing test case input:
cbb``bc

Expected output:
1


Actual output:
1.0


Fixed submission (verdict: Accepted):
S=list(input())
C=len(S)


D=0
for n in range(C):
        if S[n]!=S[C-n-1]:
            D=D+1
print(round(D/2))

Problem: p02836
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
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)

Failing test case input:
vwvwxv

Expected output:
2


Actual output:
1


Fixed submission (verdict: Accepted):
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)

Problem: p02836
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
str = input()
lst = list(str)
count = 0

print(lst)
for i in range(int((len(lst))/2)):
  if lst[i] != lst[-i-1]:
    count += 1
  else:
    pass
print(count)


Failing test case input:
vxwvwu

Expected output:
3


Actual output:
['v', 'x', 'w', 'v', 'w', 'u']
3


Fixed submission (verdict: Accepted):
str = input()
lst = list(str)
count = 0

for i in range(int(len(lst)/2)):
  if lst[i] != lst[-i-1]:
    count += 1
  else:
    pass
print(count)

Problem: p02836
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
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)
    
  


Failing test case input:
oefrbddr

Expected output:
4


Actual output:
8


Fixed submission (verdict: Accepted):
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)

Problem: p02836
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
s = input()
len_s = len(s)
c = 0
for _ in range(int(len_s/2)):
  if(s[_] == s[-_]):
    c+=1
print(c)

Failing test case input:
wswvwy

Expected output:
3


Actual output:
2


Fixed submission (verdict: Accepted):
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)

Problem: p02836
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
import math

if __name__ == "__main__":
    S = input().split()
    count = 0

    for i in range(math.floor(len(S))):
        if S[0+i] != S[-1]:
            count += 1
    print(count)



Failing test case input:
odfarbdr

Expected output:
3


Actual output:
0


Fixed submission (verdict: Accepted):
import math

if __name__ == "__main__":
    S = input()
    count = 0

    for i in range(math.floor(len(S)/2)):
        if S[0+i] != S[-1-i]:
            count += 1
    print(count)
Problem: p02836
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
a = input()
hl = int(len(a)/2)
first = a[:hl]
last = a[:hl:-1]
ans = 0
for fi,la in zip(first,last):
    if fi != la :
        ans += 1
print(ans)

Failing test case input:
vsvwww

Expected output:
3


Actual output:
2


Fixed submission (verdict: Accepted):
a = input()
hl = int(len(a)/2)
first = a[:hl]
last = a[:hl+(len(a)%2-1):-1]
ans = 0


for fi,la in zip(first,last):
    if fi != la :
        ans += 1
print(ans)

Problem: p02836
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
s = input()
revS = s[::-1]
j = 0
for i in range(int(len(s)/2)):
    print("i "+str(i))
    if s[i] != revS[i]:
        j +=1
print(j)



Failing test case input:
wvywsw

Expected output:
2


Actual output:
i 0
i 1
i 2
2


Fixed submission (verdict: Accepted):
s = input()
revS = s[::-1]
j = 0
for i in range(int(len(s)/2)):
    if s[i] != revS[i]:
        j +=1
print(j)

Problem: p02836
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
def actual(s):
    N = len(s)
    count_operation = 0

    for i in range(N):
        head = s[i]
        tail = s[N - 1 - i]

        if head != tail:
            count_operation += 1

    return count_operation / 2

s = input()
print(actual(s))

Failing test case input:
vwsxwv

Expected output:
1


Actual output:
1.0


Fixed submission (verdict: Accepted):
def actual(s):
    N = len(s)
    count_operation = 0

    for i in range(N):
        head = s[i]
        tail = s[N - 1 - i]

        if head != tail:
            count_operation += 1

    return int(count_operation / 2)

s = input()
print(actual(s))

Problem: p02836
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
import sys
S=input()
Skai=list(S)
Skai.reverse()
S=list(S)
num=len(S)
i=0
Slist =[]
Skailist =[]
for j in range (num):
	if S[j]!=Skai[j]:
		i+=1
		Skailist.append(Skai[j])
		Slist.append(S[j])
		Skailist.reverse()
		if Slist==Skailist:
			print(len(Skailist))
			sys.exit()
print(i)
                


Failing test case input:
aaccacc

Expected output:
3


Actual output:
6


Fixed submission (verdict: Accepted):
import sys
S=input()
Skai=list(S)
Skai.reverse()
S=list(S)
num=len(S)
i=0
Slist =[]
Skailist =[]
for j in range (num):
	if S[j]!=Skai[j]:
		i+=1
		Skailist.append(Skai[j])
		Slist.append(S[j])
		if Slist==Skailist:
			print(len(Skailist))
			sys.exit()			
print(int(i/2))

Problem: p02836
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
str=input()
rts=str[int(len(str)/2):]
str=str[:int(len(str)/2)]
if(len(str)!=len(rts)):
  rts=rts[1:]
rts=rts[::-1]
cnt=0
i=0
for e in str:
  if(rts[i]!=e):
    cnt+=1
    i+=1
print(cnt)

Failing test case input:
vvvwwv

Expected output:
2


Actual output:
0


Fixed submission (verdict: Accepted):
str=input()
rts=str[int(len(str)/2):]
str=str[:int(len(str)/2)]
if(len(str)!=len(rts)):
  rts=rts[1:]
rts=rts[::-1]
cnt=0
i=0
for e in str:
  if(rts[i]!=e):
    cnt+=1
  i+=1
print(cnt)
Problem: p02836
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a = list(input())
n = len(a)

ans = 0 
for i in range(int(n/2)):
    if a[i] != a[-i]:
        ans += 1
print(ans)

Failing test case input:
ywuwsw

Expected output:
3


Actual output:
1


Fixed submission (verdict: Accepted):
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)

Problem: p02836
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
S = input()
T = S[::-1]
a = 0

for s,t in zip(S,T):
  if s!=t:
    a+=1

print(a)

Failing test case input:
db``bbd

Expected output:
1


Actual output:
2


Fixed submission (verdict: Accepted):
S = input()
T = S[::-1]
a = 0

for s,t in zip(S,T):
  if s!=t:
    a+=1

print(a

Problem: p02836
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
import math
s=input()
n=math.floor(len(s)/2)
print(n)
count=0
for i in range(n):
    if s[i]!=s[-i-1]:
        count+=1

print(count)

Failing test case input:
recqabdo

Expected output:
4


Actual output:
4
4


Fixed submission (verdict: Accepted):
import math
s=input()
n=math.floor(len(s)/2)
count=0
for i in range(n):
    if s[i]!=s[-i-1]:
        count+=1

print(count)

Problem: p02836
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
import math
a = input()
b = a
d = "".join(list(reversed(b)))
ans = 0
c = math.floor(len(a)/2)
if len(a) % 2 == 0:
    for i in range(c):
        if not b[i] == d[i]:
            ans += 1
else:
    for i in range(c):
        if not b[i] == d[i+c+1]:
            ans += 1

print(ans)

Failing test case input:
`bfbbca

Expected output:
3


Actual output:
2


Fixed submission (verdict: Accepted):
import math
a = input()
b = a
d = "".join(list(reversed(b)))
ans = 0
c = math.floor(len(a)/2)
if len(a) % 2 == 0:
    for i in range(c):
        if not b[i] == d[i]:
            ans += 1
else:
    for i in range(c):
        if not b[i] == d[i]:
            ans += 1

print(ans)

Problem: p02836
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
S = input()
count = 0
N = int(len(S) / 2)

for i in range(N):
  if S[i] != S[-i]:
    count += 1
print(count)

Failing test case input:
bcba`cc

Expected output:
2


Actual output:
1


Fixed submission (verdict: Accepted):
S = input()
N = int(len(S) / 2)
count = 0
for i in range(N):
    if S[i] != S[-i-1]:
        count += 1
print(count)

Problem: p02836
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
s=input()
n=len(s)
les = 0
for i in range(n):
  if s[i] != s[n - i - 1]:
    les += 1
print(les / 2)

Failing test case input:
recqaddo

Expected output:
4


Actual output:
4.0


Fixed submission (verdict: Accepted):
s=input()
n=len(s)
res = 0
for i in range(n):
  if s[i] != s[n - i - 1]:
    res += 1
print(int(res / 2))
Problem: p02836
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
str = input()
lst = list(reversed(str))
count = 0

print(lst)
for i in range(1,int((len(lst))/2)):
  if lst[i] != lst[-i-1]:
    count += 1
  else:
    pass
print(count)



Failing test case input:
rfcqabod

Expected output:
4


Actual output:
['d', 'o', 'b', 'a', 'q', 'c', 'f', 'r']
3


Fixed submission (verdict: Accepted):
str = input()
lst = list(str)
count = 0

for i in range(int(len(lst)/2)):
  if lst[i] != lst[-i-1]:
    count += 1
  else:
    pass
print(count)

Problem: p02836
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
str = input()
count = 0
for i in range(int(len(str)/2)):
  if str[i] !=str[-i + 1]:
    count += 1
 
print(count)

Failing test case input:
ccabcaa

Expected output:
3


Actual output:
0


Fixed submission (verdict: Accepted):
str = input()
count = 0
for i in range(int(len(str)/2)):
  if str[i] !=str[-i - 1]:
    count += 1
 
print(count)

Problem: p02836
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a = input()
count = 0



list_before = []
list_after = []
for i in a:
	if count < len(a)/2:
		list_before.append(i)
	else:
		list_after.append(i)
	count += 1

l = int(len(a)/2)
count = 0
if len(list_before) % 2 == 1:
	for i in range(l-1):
		if list_before[i] != list_after[l-1 - i]:
			count += 1
else: 
	for i in range(l):
		if list_before[i] != list_after[l-1 - i]:
			count += 1
		

print(count)

Failing test case input:
vswyvw

Expected output:
3


Actual output:
2


Fixed submission (verdict: Accepted):
a = input()
count = 0



list_before = []
list_after = []
for i in a:
	if count < len(a)/2:
		list_before.append(i)
	else:
		list_after.append(i)
	count += 1




l = int(len(a)/2)
count = 0
if len(list_before)-len(list_after) == 1:
	for i in range(l):
		if list_before[i] != list_after[l-1 - i]:
			list_before[i] = list_after[l-1 - i]
			count += 1
else: 
	for i in range(l):
		if list_before[i] != list_after[l-1 - i]:
			list_before[i] = list_after[l-1 - i]
			count += 1
		



print(count)

Problem: p02836
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a =list(input())
b =int(int(len(a))/2)

ans =0
n = -1
for i in range(b):
    if a[i] == a[n]:
        n += -1
    else:
        ans += 1
print(ans)

Failing test case input:
oeerbddr

Expected output:
4


Actual output:
3


Fixed submission (verdict: Accepted):
a =list(input())
b =int(int(len(a))/2)

ans =0
n = -1
for i in range(b):
    if a[i] == a[n]:
        n += -1
    else:
        ans += 1
        n += -1
print(ans)
Problem: p02836
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
str = input()
l = len(str)
p = l-1
index = 0
cnt=0
while index < p:

    if str[index] == str[p]:
        index = index + 1
        p = p-1
        if index == p or index + 1 == p:
            if str[index] == str[p]:
                print(cnt)
                exit()
            else:
                cnt+=1
                print(cnt)
                exit()
    else:
        cnt+=1
        index = index + 1
        p = p-1
        if index == p or index + 1 == p:
            print(cnt)
            exit()


Failing test case input:
wyvwsv

Expected output:
3


Actual output:
2


Fixed submission (verdict: Accepted):
str = input()
l = len(str)
p = l-1
index = 0
cnt=0
if l==1:
    print(0)
    exit()
if l==2:
    if str[0]==str[1]:
        print(0)
        exit()
    else:
        print(1)
        exit()
while index < p:

    if str[index] == str[p]:
        index = index + 1
        p = p-1
        if index == p or index + 1 == p:
            if str[index] == str[p]:
                print(cnt)
                exit()
            else:
                cnt+=1
                print(cnt)
                exit()
    else:
        cnt+=1
        index = index + 1
        p = p-1
        if index == p or index + 1 == p:
            if str[index] == str[p]:
                print(cnt)
                exit()
            else:
                cnt+=1
                print(cnt)
                exit()

Problem: p02836
Buggy submission (Python (3.4.3), verdict: Wrong Answer):


S = input()
s_str = list(S)
s_rev = s_str[::-1]
print(s_str)
print(s_rev)

num = len(s_str)

j = 0
for i in range(num):
  if (s_str[i] == s_rev[i]):
    pass
  else:
    j = j + 1

print (j/2)



Failing test case input:
dc``bbc

Expected output:
3


Actual output:
['d', 'c', '`', '`', 'b', 'b', 'c']
['c', 'b', 'b', '`', '`', 'c', 'd']
3.0


Fixed submission (verdict: Accepted):


S = input()
s_str = list(S)
s_rev = s_str[::-1]

num = len(s_str)

j = 0
for i in range(num):
  if (s_str[i] == s_rev[i]):
    pass
  else:
    j = j + 1

print (int(j/2))

Problem: p02836
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
import sys
s = sys.stdin.readline().strip()
i = 0
k = -1
cnt = 0
while i < len(s):
  if s[i] != s[k]:
    cnt += 1
  i += 1
  k -= 1
print(cnt)

Failing test case input:
recraddo

Expected output:
4


Actual output:
8


Fixed submission (verdict: Accepted):
import sys
s = sys.stdin.readline().strip()
i = 0
k = -1
cnt = 0
while i < len(s)/2:
  if s[i] != s[k]:
    cnt += 1
  i += 1
  k -= 1
print(cnt)

Problem: p02836
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
S = input()

m = int(len(S) / 2)

ans = 0
for i in range(0, m + 1):
    if S[i] != S[len(S) - 1 - i]:
        ans += 1

print(ans)

Failing test case input:
vwxwsv

Expected output:
2


Actual output:
3


Fixed submission (verdict: Accepted):
S = input()

if len(S) % 2 == 0:
    m = int(len(S) / 2)
else: 
    m = int(len(S) / 2) + 1

ans = 0
for i in range(0, m):
    if S[i] != S[len(S) - 1 - i]:
        ans += 1

print(ans)
Problem: p02836
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
s = str(input())
s2 = s[::-1]
count = 0
for i in range(len(s)):
    if not (s[i]==s2[i]):
        count +=1

print(count)

Failing test case input:
abcdabc

Expected output:
2

Actual output:
4


Fixed submission (verdict: Accepted):
s = str(input())
s2 = s[::-1]
count = 0
for i in range(len(s)
    if not(s[i]==s2[i]):
        count +=1
print(count)

Problem: p02836
Buggy submission (PyPy3 (2.4.0), verdict: Wrong Answer):
s = str(input)
ans = 0
j = len(s)-1
for i in range(len(s)):
  if s[i] != s[j]:
    ans += 1
  j -= 1
  
print(ans)

Failing test case input:
db``bbd

Expected output:
1


Actual output:
22


Fixed submission (verdict: Accepted):
s = str(input())
ans = 0
j = len(s)-1
for i in range(len(s)):
  if s[i] != s[j]:
    ans += 1
  j -= 1
  
print(int(ans/2))

Problem: p02836
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
str = input()
count = 0

for i in range(len(str)):
  if str[i] != str[len(str)-1-1]:
    count += 1
    
print(count/2)
    


Failing test case input:
oddaqcer

Expected output:
4


Actual output:
3.5


Fixed submission (verdict: Accepted):
str = input()
count = 0

for i in range(len(str)):
  if str[i] != str[len(str)-1-i]:
    count += 1
    
print(int(count/2))

Problem: p02836
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
S = [i for i in input()]
N = len(S)
f_counter = 0
for j in range(N):
    if S[j] != S[N-1-j]:
        f_counter += 1
counter = f_counter / 2
print(counter)

Failing test case input:
db``bbd

Expected output:
1


Actual output:
1.0


Fixed submission (verdict: Accepted):
S = [i for i in input()]
N = len(S)
f_counter = 0
for j in range(N):
    if S[j] != S[N-1-j]:
        f_counter += 1
counter = f_counter / 2
print('{:.0f}'.format(counter))

Problem: p02836
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
S=input()
SR=S[::-1]
ans=0

for i in range(len(S)):
    if S[i] != SR[i]:
        ans = ans + 1

print(ans)

Failing test case input:
rddbrfdo

Expected output:
3


Actual output:
6


Fixed submission (verdict: Accepted):
S=input()
SR=S[::-1]
ans=0

for i in range(len(S)):

    if S[i] != SR[i]:
        ans = ans + 1
        S = S[:i] + SR[i] + S[i+1:]
        SR=S[::-1]


print(ans)
Problem: p02836
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
S = list(input())
N = len(S)

p = 0 
o = 0 
u = N 


if N % 2 == 0:
    for i in range(int(N/2)):
        if S[p] == S[u-1]:
            p += 1
            u -= 1
        else:
            o += 1
else:
    for i in range(int(N/2)-1):
        if S[p] == S[u-1]:
            p += 1
            u -= 1
        else:
            o += 1

print(o)

Failing test case input:
wvvvvv

Expected output:
1


Actual output:
3


Fixed submission (verdict: Accepted):

S = list(input())
N = len(S)

p = 0 
o = 0 
u = N 


if N % 2 == 0:
    
    for i in range(int(N/2)):
        if S[p] == S[u-1]:
            
            p += 1
            u -= 1
        else:
            
            o += 1
            p += 1
            u -= 1
else:
    N -= 1
    
    for i in range(int(N/2)):
        if S[p] == S[u-1]:
            
            p += 1
            u -= 1
        else:
            
            o += 1            
            p += 1
            u -= 1
print(o)

Problem: p02836
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a=list(str(input()))
b=a[::-1]
cnt = 0
lst=[]
for i in range(len(a)):
  if a[i] != b[i] and b[i] not in lst:
    cnt+=1
    lst.append(b[i])
print(cnt)

Failing test case input:
vsvwwx

Expected output:
3


Actual output:
4


Fixed submission (verdict: Accepted):
a=list(str(input()))
b=a[::-1]
cnt = 0
lst=[]
for i in range(len(a)
  if a[i] != b[i]:
    cnt+=1
print(cnt)

Problem: p02836
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
import math
s = input()
t = s[::-1]
print(s,t)
count = 0
for i in range(len(s)):
  if s[i] != t[i]:
    count += 1
print(math.ceil(count/2))

Failing test case input:
oedrbedr

Expected output:
4


Actual output:
oedrbedr rdebrdeo
4


Fixed submission (verdict: Accepted):
s = input()
t = s[::-1]
count = 0
for i in range(len(s)):
  if s[i] != t[i]:
    count += 1
print(int(count/2))

Problem: p02836
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
s = input()
counter = 0
length = len(s)

for i in range(length):
  if s[i] != s[length-1-i]:
    counter += 1
    
print(counter)

Failing test case input:
vvvwwv

Expected output:
2


Actual output:
4


Fixed submission (verdict: Accepted):
s = input()
counter = 0
length = len(s)

for i in range(length
  if s[i] != s[length-1-i]:
    counter += 1
    
print(counter)

Problem: p02836
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
S = input()

half = int(len(S) / 2)
S1 = S[:half]
S2 = S[::-1][:half]

count = 0
for s1, s2 in zip(S1, S2):
    if s1 != s2: count += 1

print(count)
key = 'b'
print({'a': 1, 'b': 2}.get(key))


Failing test case input:
reeocddr

Expected output:
3


Actual output:
3
2


Fixed submission (verdict: Accepted):
S = input()

half = int(len(S) / 2)
S1 = S[:half]
S2 = S[::-1][:half]

count = 0
for s1, s2 in zip(S1, S2):
    if s1 != s2: count += 1

print(count)
Problem: p02836
Buggy submission (Python (3.4.3), verdict: Wrong Answer):

S = input()


S_list = list(S)
ans = 0

if(len(S_list)%2==0):
  
  for i in range(int(len(S_list)/2)-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)):
    
    if(S_list[i]==S_list[len(S_list)-i-1]):
      ans = ans + 0
    else:
      ans = ans + 1
print(ans)

Failing test case input:
rddbrfdo

Expected output:
3


Actual output:
2


Fixed submission (verdict: Accepted):

S = input()


S_list = list(S)
ans = 0

if(len(S_list)%2==0):
  
  for i in range(int(len(S_list)/2)):
    
    
    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)):
    
    if(S_list[i]==S_list[len(S_list)-i-1]):
      ans = ans + 0
    else:
      ans = ans + 1
print(ans)

Problem: p02836
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
s = input()

ans = 0
for i in range(len(s)):
  if s[i] != s[-i-1]:
    ans += 1

print(ans)

Failing test case input:
dbb``bd

Expected output:
1


Actual output:
2


Fixed submission (verdict: Accepted):
s = input()

ans = 0
for i in range(len(s)
  if s[i] != s[-i-1]:
    ans += 1

print(ans)

Problem: p02836
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a = input()
cnt = 0
for i in range(len(a)):
  if a[i]!=a[len(a)-i-1]:
    cnt+=1
    
print(cnt)

Failing test case input:
vwxwsv

Expected output:
2


Actual output:
4


Fixed submission (verdict: Accepted):
a = input()
cnt = 0
for i in range(len(a)
    if a[i] != a[len(a) - i - 1]:
        cnt += 1

print(cnt)

Problem: p02836
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
s=input()
t=s[::-1]
num=0
for i in range(len(s)):
    if s[i]!=t[i]:
        num+=1
print(num)


Failing test case input:
odcaqcer

Expected output:
3


Actual output:
6


Fixed submission (verdict: Accepted):
s=input()
t=s[::-1]
num=0
for i in range(len(s)):
    if s[i]!=t[i]:
        num+=1
print(num

Problem: p02836
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
r = 0
s = input()
for n in range(len(s)):
  if s[n] != s[(-1)*(n+1)]:
    r += 1
print(r/2)

Failing test case input:
ywuwsw

Expected output:
3


Actual output:
3.0


Fixed submission (verdict: Accepted):
r = 0
s = input()
for n in range(len(s)):
  if s[n] != s[-n-1]:
    r += 1
print(r

Problem: p02836
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
s = input()
count = 0
for i in range(len(s)):
    if s[i] != s[len(s)-i-1]:
        count +=1
print(count/2)


Failing test case input:
aacbacc

Expected output:
3


Actual output:
3.0


Fixed submission (verdict: Accepted):
s = input()
count = 0
for i in range(len(s)):
    if s[i] != s[len(s)-i-1]:
        count +=1
print(int(count/2))
Problem: p02836
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a = input()
count = 0



list_before = []
list_after = []
for i in a:
	if count < len(a)/2:
		list_before.append(i)
	else:
		list_after.append(i)
	count += 1

l = int(len(a)/2)
count = 0
if len(list_before)-len(list_after) == 1:
	for i in range(l-1):
		if list_before[i] != list_after[l-1 - i]:
			
			count += 1
else: 
	for i in range(l):
		if list_before[i] != list_after[l-1 - i]:
			
			count += 1
		

print(count)


Failing test case input:
dbb``bd

Expected output:
1


Actual output:
0


Fixed submission (verdict: Accepted):
a = input()
count = 0



list_before = []
list_after = []
for i in a:
	if count < len(a)/2:
		list_before.append(i)
	else:
		list_after.append(i)
	count += 1




l = int(len(a)/2)
count = 0
if len(list_before)-len(list_after) == 1:
	for i in range(l):
		if list_before[i] != list_after[l-1 - i]:
			list_before[i] = list_after[l-1 - i]
			count += 1
else: 
	for i in range(l):
		if list_before[i] != list_after[l-1 - i]:
			list_before[i] = list_after[l-1 - i]
			count += 1
		



print(count)

Problem: p02836
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
s=input()
t=s[::-1]
cnt=0
for i in range(len(t)):
    if s[i]!=t[i]: cnt+=1
print(cnt)

Failing test case input:
`bfbbca

Expected output:
3


Actual output:
6


Fixed submission (verdict: Accepted):
s=input()
t=s[::-1]
cnt=0
for i in range(len(t)
    if s[i]!=t[i]: cnt+=1
print(cnt)

Problem: p02836
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
s=input()

l=[]

for i in s:
  l.append(i)
new_l = l[::-1]
print(new_l)

count=0
for a,b in zip(l,new_l):
  if a != b:
    count+=1
print(count)
   
  
  

Failing test case input:
oedrbedr

Expected output:
4


Actual output:
['r', 'd', 'e', 'b', 'r', 'd', 'e', 'o']
8


Fixed submission (verdict: Accepted):
s=input()

l=[]

for i in s:
  l.append(i)
new_l = l[::-1]

count=0
for a,b in zip(l,new_l):
  if a != b:
    count+=1
print(count

Problem: p02836
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
s = input()
l = int(len(s))
print(l)
t = l/2
print(t)
t = int(t)
f = s[:t]
r = s[t:]
r = r[::-1]
f = list(f)
r = list(r)
print(f)
print(r)
c = 0
for i in range(t):
    if f[i] != r[i]:
        c +=1
    else:
        pass
print(c)

Failing test case input:
yxvwsw

Expected output:
3


Actual output:
6
3.0
['y', 'x', 'v']
['w', 's', 'w']
3


Fixed submission (verdict: Accepted):
s = input()
l = int(len(s))

t = l/2

t = int(t)
f = s[:t]
r = s[t:]
r = r[::-1]
f = list(f)
r = list(r)

c = 0
for i in range(t):
    if f[i] != r[i]:
        c +=1
    else:
        pass
print(c)

Problem: p02836
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
S = str(input())
s = [i for i in range(int(len(S) / 2)) if S[i] != S[-i]]
print(len(s))

Failing test case input:
cdabcaa

Expected output:
3


Actual output:
1


Fixed submission (verdict: Accepted):
S = str(input())
s = [i for i in range(int(len(S) / 2)) if S[i] != S[-i - 1]]
print(len(s))
Problem: p02836
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
import math
N = list(input())

def is_even(num):
    if num % 2 == 0:
        return True
    else:
        return False

change_num = math.floor(len(N) / 2)
ans = 0
count = 1
for i in N[:change_num]:
    if N[-count] != i:
        ans += 1    
    
print(ans)

Failing test case input:
rdbrafdo

Expected output:
3


Actual output:
4


Fixed submission (verdict: Accepted):
import math
N = list(input())

def is_even(num):
    if num % 2 == 0:
        return True
    else:
        return False

change_num = math.floor(len(N) / 2)
ans = 0
count = 1
for i in N[:change_num]:
    if N[-count] != i:
        ans += 1
    count += 1
    
print(ans)

Problem: p02836
Buggy submission (PyPy3 (2.4.0), verdict: Wrong Answer):
s = input()
a = []
b = []
cnt = 0
if len(s)%2 == 0:
    a = list(s[:int(len(s)/2)])
    b = list(s[int(len(s)/2):])
else:
    a = list(s[:int((len(s)-1)/2)])
    b = list(s[int((len(s)+1)/2):])
for i in range(len(a)):
    b.reverse()
    if a[i] != b[i]:
        cnt += 1
print(cnt)
    

Failing test case input:
rdebrdeo

Expected output:
4


Actual output:
3


Fixed submission (verdict: Accepted):
s = input()
a = []
b = []
cnt = 0
if len(s)%2 == 0:
    a = list(s[:int(len(s)/2)])
    b = list(s[int(len(s)/2):])
else:
    a = list(s[:int((len(s)-1)/2)])
    b = list(s[int((len(s)+1)/2):])
b.reverse()
for i in range(len(a)):
    if a[i] != b[i]:
        cnt += 1

print(cnt)

Problem: p02836
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
S = [i for i in input()]
S_len = len(S)
ans = 0
if (S_len % 2 == 0):
    a = S[0:int(S_len / 2)]
    b = S[int(S_len / 2):S_len][::-1]
    print(a,b)
    for i,j in zip(a,b):
        if not i == j:
            ans += 1
        else:
            continue
else:
    a = S[0:int(S_len / 2)]
    b = S[int(S_len / 2) + 1:S_len][::-1]
    print(a,b)
    for i,j in zip(a,b):
        if not i == j:
            ans += 1
        else:
            continue
print(ans)

Failing test case input:
recqabod

Expected output:
4


Actual output:
['r', 'e', 'c', 'q'] ['d', 'o', 'b', 'a']
4


Fixed submission (verdict: Accepted):
S = [i for i in input()]
S_len = len(S)
ans = 0
if (S_len % 2 == 0):
    a = S[0:int(S_len / 2)]
    b = S[int(S_len / 2):S_len][::-1]
    for i,j in zip(a,b):
        if not i == j:
            ans += 1
        else:
            continue
else:
    a = S[0:int(S_len / 2)]
    b = S[int(S_len / 2) + 1:S_len][::-1]
    for i,j in zip(a,b):
        if not i == j:
            ans += 1
        else:
            continue
print(ans)

Problem: p02836
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
s = input()
r = s[::-1]
print(s, r)
cnt = 0
for i in range(len(s)):
    if s[i] != r[i]:
        cnt += 1
print(int(cnt / 2))

Failing test case input:
oddaqcer

Expected output:
4


Actual output:
oddaqcer recqaddo
4


Fixed submission (verdict: Accepted):
s = input()
n = len(s)
cnt = 0
for i in range(n 
    if s[i] != s[n - 1 - i]:
        cnt += 1
print(cnt)
Problem: p02836
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
s = input()
s2 = list(reversed(s))

ans = 0

for i in range(len(s)):
  if s[i] != s2[i]:
    ans += 1
    if (len(s) % 2 == 0 and i == int(len(s) / 2)):
      ans -= 1

print(ans)


Failing test case input:
vwvvvv

Expected output:
1


Actual output:
2


Fixed submission (verdict: Accepted):
s = input()
s2 = list(reversed(s))

ans = 0

for i in range(len(s)):
  if s[i] != s2[i]:
    ans += 1

print(int(ans / 2))

Problem: p02836
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
S = input()
cnt = 0
for i in range(len(S)):
    if S[i]!=S[len(S)-1-i]:
        cnt += 1
print(cnt)

Failing test case input:
wvywsw

Expected output:
2


Actual output:
4


Fixed submission (verdict: Accepted):
S = input()
cnt = 0
for i in range(len(S)):
    if S[i]!=S[len(S)-1-i]:
        cnt += 1
print(cnt

Problem: p02836
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
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)

Failing test case input:
aacc`cc

Expected output:
3


Actual output:
6


Fixed submission (verdict: Accepted):
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)

Problem: p02836
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
import math

str = input()
l = len(str)

if l % 2 == 1:  
  t = math.floor(l/2)
  d = str[0:t]
  
  dd = list(d)
  
  e = str[t+1:l]
  

  
  ee = list(reversed(e))
  
  
  ans = len(set(dd) & set(ee))
  print(t-ans)
        
else:  
  t = int(l/2)
  
  d = str[0:t]
  
  dd = list(d)
  
  e = str[t:l]
  

  
  ee = list(reversed(e))
  
  
  ans = len(set(dd) & set(ee))
  print(t-ans)

Failing test case input:
vswvwx

Expected output:
3


Actual output:
1


Fixed submission (verdict: Accepted):
import math

str = input()
ans = 0
l = len(str)

if l % 2 == 1:  
  t = math.floor(l/2)
  d = str[0:t]
  dd = list(d)
  e = str[t+1:l]
  ee = list(reversed(e))
  
  for i in range(t):
    if dd[i] != ee[i]:
      ans += 1
  print(ans)
  
else:  
  t = math.floor(l/2)
  d = str[0:t]
  dd = list(d)
  e = str[t:l]
  ee = list(reversed(e))
  
  for i in range(t):
    if dd[i] != ee[i]:
      ans += 1
  print(ans)

Problem: p02836
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
r = 0
s = input()
for n in range(len(s)):
  if s[n] != s[-n-1]:
    r += 1
print(r/2)

Failing test case input:
rddbrdfo

Expected output:
3


Actual output:
3.0


Fixed submission (verdict: Accepted):
r = 0
s = input()
for n in range(len(s)):
  if s[n] != s[-n-1]:
    r += 1
print(r

Problem: p02836
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
s = input()
result = 0
reverseString = s[::-1]
print(reverseString)
for i in range(len(s)):
    if s[i] != reverseString[i]:
        result += 1
print(result / 2)


Failing test case input:
rfbraddo

Expected output:
4


Actual output:
oddarbfr
4.0


Fixed submission (verdict: Accepted):
s = input()
result = 0
reverseString = s[::-1]
for i in range(len(s)):
    if s[i] != reverseString[i]:
        result += 1
print(int(result / 2))