ZhenlongDai/ACPR huggingface dataset:
Problem: p02773
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n = int(input())

s = [str(input()) for i in range(n)]

from collections import Counter
c = Counter(s)

result = [i for i in c.items() if i[1]==max(c.values())]

for i in range(len(result)):
    print(result[i][0])

Failing test case input:
8
fufbalo
buefola
btffamo
olaffvb
ouafflb
omaffub
buffalo
buofalf

Expected output:
btffamo
buefola
buffalo
buofalf
fufbalo
olaffvb
omaffub
ouafflb


Actual output:
fufbalo
buefola
btffamo
olaffvb
ouafflb
omaffub
buffalo
buofalf


Fixed submission (verdict: Accepted):
n = int(input())
 
s = [str(input()) for i in range(n)]
 
from collections import Counter
c = Counter(s)

max_num = max(c.values())

result = [i[0] for i in c.items() if i[1]==max_num]
result.sort()
 
for i in range(len(result)):
    print(result[i])

Problem: p02773
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N = int(input())
l = []

for _ in range(N):
    s = str(input())
    l.append(s)

import collections
c = collections.Counter(l)
c = c.most_common()
c.sort()
most_count = c[0][1]
for i in range(len(c)):
    if c[i][1] == most_count:
        print(c[i][0])

Failing test case input:
7
beat
vet
beet
bed
vet
bet
beet

Expected output:
beet
vet

Actual output:
beat
bed
bet


Fixed submission (verdict: Accepted):
N = int(input())
l = []

for _ in range(N):
    s = str(input())
    l.append(s)

import collections
c = collections.Counter(l)
c = c.most_common()

most_count = c[0][1]
c.sort()

for i in range(len(c)):
    if c[i][1] == most_count:
        print(c[i][0])

Problem: p02773
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n = int(input())
s = [""] * n
for i in range(n):
    s[i] = input()
s = sorted(s)
t = 1
tmax=1
for i in range(n - 1):
    if s[i] == s[i + 1]:
        t += 1
        tmax=max(tmax,t)
    else:
        t = 1
        tmax = max(tmax, t)
t = 0
if tmax == 1:
    for i in range(n):
        print(s[i])
    exit()
if tmax == n:
    print(s[0])
    exit()
for i in range(n-1):
    if s[i] == s[i + 1]:
        t += 1
        if t == tmax:
            print(s[i+1])
    else:
        t=1


Failing test case input:
8
buffalo
buffalo
buffalo
buffalo
olaffub
buffalo
buffalo
buffalo

Expected output:
buffalo


Actual output:

Fixed submission (verdict: Accepted):
n = int(input())
s = [""] * n
for i in range(n):
    s[i] = input()
s = sorted(s)
t = 1
tmax=1
for i in range(1, n):
    if s[i-1] == s[i]:
        t += 1
        tmax=max(tmax,t)
    else:
        t = 1
        tmax = max(tmax, t)
t = 1
if tmax == 1:
    for i in range(n):
        print(s[i])
    exit()
if tmax == n:
    print(s[0])
    exit()
for i in range(1,n):
    if s[i-1] == s[i]:
        t += 1
    else:
        t=1
    if t == tmax:
        print(s[i])
Problem: p02773
Buggy submission (PyPy3 (2.4.0), verdict: Wrong Answer):
n = int(input())
li = []
lia = []
ans = 0
f = 1
for i in range(n):
    li.append(input())
li.sort()
for i in range(n-1):
    if li[i] == li[i+1]:
        f += 1
        if f == ans:
            lia.append(li[i+1])
        if f > ans:
            lia = []
            ans = f
            lia.append(li[i+1])
    else:
        f = 1
for i in range(len(lia)):
    print(lia[i])

Failing test case input:
7
bass
btbs
ikdk
licj
asta
kcik
khbk

Expected output:
asta
bass
btbs
ikdk
kcik
khbk
licj


Actual output:

Fixed submission (verdict: Accepted):
n = int(input())
li = []
lia = []
ans = 0
f = 1
li.insert(0,"0")
for i in range(n):
    li.append(input())
li.sort()
for i in range(n):
    if li[i] == li[i+1]:
        f += 1
    else:
        f = 1
    if f == ans:
        lia.append(li[i+1])
    if f > ans:
        lia = []
        ans = f
        lia.append(li[i+1])
for i in range(len(lia)):
    print(lia[i])

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


import os
import datetime

def main():

    str_dict = {}
    val_1 = int(input())
    for i in range(val_1):
        val_x = input()

        if not val_x in str_dict:
            str_dict[val_x] = 1
        else:
            num = str_dict.get(val_x)
            str_dict[val_x] = num + 1

    for k, v in sorted(str_dict.items(), key=lambda x: -x[1]):
        print(k)




if __name__ == '__main__':
    main()

Failing test case input:
4
ihsu
uoat
michia
kum

Expected output:
ihsu
kum
michia
uoat


Actual output:
ihsu
uoat
michia
kum


Fixed submission (verdict: Accepted):


import os
import datetime

def main():

    str_dict = {}
    val_1 = int(input())
    for i in range(val_1):
        val_x = input()

        if not val_x in str_dict:
            str_dict[val_x] = 1
        else:
            num = str_dict.get(val_x)
            str_dict[val_x] = num + 1

    max_count = max(str_dict.values())
    max_list = []

    for k, v in sorted(str_dict.items(), key=lambda x: -x[1]):
        if max_count == v:
            max_list.append(k)

    new_list = sorted(max_list)

    for key in new_list:
        print(key)





if __name__ == '__main__':
    main()

Problem: p02773
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
from collections import Counter

n = int(input())
s = [input() for i in range(n)]
ans = []

charctor_count = Counter(s)
max_count = max(charctor_count.values())
for k, v in charctor_count.items():
  if v == max_count:
    ans.insert(0, k)
for out in ans:
  print(out)

Failing test case input:
4
jsgs
tbou
ahmiic
muk

Expected output:
ahmiic
jsgs
muk
tbou


Actual output:
muk
ahmiic
tbou
jsgs


Fixed submission (verdict: Accepted):
from collections import Counter
n = int(input())
s = [input() for _ in range(n)]
ans = []
charctor_count = Counter(s)
max_count = max(charctor_count.values())
for k, v in charctor_count.items():
  if v == max_count:
    ans.append( k)
print("\n".join(sorted(ans)))
Problem: p02773
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N = int(input())
S = [0] * N
for i in range(N):
    S[i]= input()

dic = {}
for i in range(N):
    if (S[i] in dic.keys()) == False:
        dic[S[i]] = 1
    else:
        dic[S[i]] = dic[S[i]] + 1

sortdic = sorted(dic.items())

m = sortdic[len(sortdic)-1][1]
ans = []
for i in range(len(sortdic)):
    if sortdic[i][1] == m:
        ans.append(sortdic[i][0])

ans.sort()
for i in range(len(ans)):
    print(ans[i])



Failing test case input:
8
buffalo
buffalo
buffalo
buffalo
olaffub
buffalo
buffalo
buffalo

Expected output:
buffalo


Actual output:
olaffub


Fixed submission (verdict: Accepted):
N = int(input())
S = [0] * N
for i in range(N):
    S[i]= input()

dic = {}
for i in range(N):
    if (S[i] in dic.keys()) == False:
        dic[S[i]] = 1
    else:
        dic[S[i]] = dic[S[i]] + 1

sortdic = sorted(dic.items(), key = lambda x:x[1])

m = sortdic[len(sortdic)-1][1]
ans = []
for i in range(len(sortdic)):
    if sortdic[i][1] == m:
        ans.append(sortdic[i][0])

ans.sort()
for i in range(len(ans)):
    print(ans[i])

Problem: p02773
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
import collections

n = int(input())
list = []
for x in range(n):
    s = input()
    list.append(s)
c = collections.Counter(list)
mc = c.most_common()
max = mc[0][1]
for val in mc:
    if max == val[1]: print(val[0])
    else: break


Failing test case input:
7
bt`s
btbs
ildk
kicj
btsa
kcjk
khck

Expected output:
bt`s
btbs
btsa
ildk
kcjk
khck
kicj


Actual output:
bt`s
btbs
ildk
kicj
btsa
kcjk
khck


Fixed submission (verdict: Accepted):
import collections

n = int(input())
list = []
for x in range(n):
    s = input()
    list.append(s)
c = collections.Counter(list)
mc = c.most_common()
max = mc[0][1]
anslist = []
for val in mc:
    if max == val[1]: anslist.append(val[0])
    else: break
anslist.sort()
for x in anslist:
    print(x)

Problem: p02773
Buggy submission (PyPy3 (2.4.0), verdict: Wrong Answer):
n = int(input())

words = {}

for i in range(n):
    key = input()
    if key not in words:
        words[key] = 0
    words[key] += 1

ans = sorted(words.items(), key=lambda x:x[1])[::-1]

for i in ans:
    if ans[0][1] == i[1]:
        print(i[0])

Failing test case input:
4
jsgs
sbou
chmiia
muk

Expected output:
chmiia
jsgs
muk
sbou


Actual output:
muk
chmiia
sbou
jsgs


Fixed submission (verdict: Accepted):
n = int(input())

words = {}

for i in range(n):
    key = input()
    if key not in words:
        words[key] = 0
    words[key] += 1

l = []
th = max(words.values())

for i,j in words.items():
    if th == j:
        l.append(i)

l.sort()

print(*l, sep="\n", end="")
Problem: p02773
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N = int(input())
A = [input() for _ in range(N)]
dic = {}

for i in range(N):
  dic[A[i]] = 0
  
for i in range(N):
  dic[A[i]] += 1

k = dic[max(dic)]
dic = sorted(dic.items(), key=lambda x:x[0])
for el in dic:
  if el[1] == k:
    print(el[0])

Failing test case input:
8
buffalo
buffalo
buffalo
buffalo
olaffub
buffalo
buffalo
buffalo

Expected output:
buffalo


Actual output:
olaffub


Fixed submission (verdict: Accepted):
N = int(input())
A = [input() for _ in range(N)]
dic = {}

for i in range(N):
  dic[A[i]] = 0
  
for i in range(N):
  dic[A[i]] += 1

k = max(dic.values())
dic = sorted(dic.items(), key=lambda x:x[0])
for el in dic:
  if el[1] == k:
    print(el[0])

Problem: p02773
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
from collections import Counter

N = int(input())
S = [0]*N
for i in range(N):
  S[i] = input()  
S.sort()
c = Counter(S)
m_num = c.most_common()[0][1]

for s in set(S):
  if c[s] == m_num:
    print(s)

Failing test case input:
7
bfau
veu
bfet
dgb
tev
etc
teeb

Expected output:
bfau
bfet
dgb
etc
teeb
tev
veu


Actual output:
dgb
bfau
etc
veu
bfet
tev
teeb


Fixed submission (verdict: Accepted):
from collections import Counter

N = int(input())
S = [0]*N
for i in range(N):
  S[i] = input()  
S.sort()
c = Counter(S)
m_num = c.most_common()[0][1]

for s in sorted(list(set(S))):
  if c[s] == m_num:
    print(s)

Problem: p02773
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
import collections

n = int(input())
s = [input() for _ in range(n)]
c_sort = collections.Counter(s).most_common()
list_most = [c_sort[i][0] for i in range(len(c_sort)) if c_sort[i][1] == c_sort[0][1]]
for i in list_most:
    print(i)

Failing test case input:
7
beat
veu
bfet
bed
vte
bet
teeb

Expected output:
beat
bed
bet
bfet
teeb
veu
vte


Actual output:
beat
veu
bfet
bed
vte
bet
teeb


Fixed submission (verdict: Accepted):
import collections

n = int(input())
s = [input() for _ in range(n)]
c_sort = collections.Counter(s).most_common()
list_most = [c_sort[i][0] for i in range(len(c_sort)) if c_sort[i][1] == c_sort[0][1]]
for i in sorted(list_most):
    print(i)

Problem: p02773
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n = int(input())

d = {}

for i in range(n):
    s = input()
    d[s] = d.get(s, 0) + 1

m = max(d[i] for i in d)
print(m, d)

for j in sorted(d):
    if d[j] == m:
        print(j)

Failing test case input:
4
ihsu
tbou
miahic
kul

Expected output:
ihsu
kul
miahic
tbou


Actual output:
1 {'ihsu': 1, 'tbou': 1, 'miahic': 1, 'kul': 1}
ihsu
kul
miahic
tbou


Fixed submission (verdict: Accepted):
n = int(input())

d = {}

for i in range(n):
    s = input()
    d[s] = d.get(s, 0) + 1

m = max(d[i] for i in d)

for j in sorted(d):
    if d[j] == m:
        print(j)
Problem: p02773
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
n = int(input())

dic = {}
for _ in range(n):

    s =input()
    if s in dic:
        dic[s] += 1
    else:
        dic[s]=1

maxdic = max(dic.values())

ans = [i for i in dic if dic[i]==maxdic]
print('\n'.join(ans))

Failing test case input:
7
beat
veu
beet
bed
vte
bet
teeb

Expected output:
beat
bed
beet
bet
teeb
veu
vte


Actual output:
beat
veu
beet
bed
vte
bet
teeb


Fixed submission (verdict: Accepted):
n = int(input())

dic = {}
for _ in range(n):

    s =input()
    if s in dic:
        dic[s] += 1
    else:
        dic[s]=1

maxdic = max(dic.values())

ans = [i for i in dic if dic[i]==maxdic]
print('\n'.join(sorted(ans)))

Problem: p02773
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
import collections
n=int(input())
s=[]
for i in range(n):
  S=input()
  s.append(S)
d=collections.Counter(s)
e=list(d.items())
e.sort(key=lambda x:-x[1])
f=list(d.values())
f.sort(reverse=True)
g=list(d.keys())
num=1
for i in range(1,len(f)):
  if f[i]==f[0]:
    num+=1
  else:
    break
lst=[]
for j in range(num):
  lst.append(g[j])
lst.sort()
for j in range(num):
  print(lst[j])
  




Failing test case input:
7
bass
bass
kick
kick
bats
kick
kick

Expected output:
kick


Actual output:
bass


Fixed submission (verdict: Accepted):
import collections
n=int(input())
s=[]
for i in range(n):
  S=input()
  s.append(S)
d=collections.Counter(s)
e=list(d.items())
e.sort(key=lambda x:-x[1])
lst=[]
for i in range(len(e)):
  if e[i][1]==e[0][1]:
    lst.append(e[i][0])
  else:
    break
lst.sort()
for j in range(len(lst)):
  print(lst[j])

Problem: p02773
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n = int(input())
s = []
for i in range(n):
    s.append(input())


numbers = dict()
maxval = 1
for val in s:
    if val in numbers:
        if maxval == numbers[val]:
            maxval = maxval + 1
        numbers[val] += 1
    else:
        numbers[val] = 1

[print(kv[0]) for kv in numbers.items() if kv[1] == maxval]


Failing test case input:
7
btas
btbr
ildk
kicj
atsa
kcjk
khck

Expected output:
atsa
btas
btbr
ildk
kcjk
khck
kicj


Actual output:
btas
btbr
ildk
kicj
atsa
kcjk
khck


Fixed submission (verdict: Accepted):
n = int(input())
s = []
for i in range(n):
    s.append(input())

numbers = dict()
maxval = 1
for val in s:
    if val in numbers:
        if maxval == numbers[val]:
            maxval = maxval + 1
        numbers[val] += 1
    else:
        numbers[val] = 1

ret = [kv[0] for kv in numbers.items() if kv[1] == maxval]
for v in sorted(ret):
    print(v)
Problem: p02773
Buggy submission (PyPy3 (2.4.0), verdict: Wrong Answer):
import collections
n=int(input())
ans=[]
s=["".join(sorted(input())) for _ in range(n)]
c=collections.Counter(s)
m=max(c.values())
for k,v in c.items():
  if v==m:
    ans.append(k)

for i in sorted(k):
  print(i)



Failing test case input:
7
bass
stab
ikdk
kick
asta
kcik
khck

Expected output:
asta
bass
ikdk
kcik
khck
kick
stab


Actual output:
c
h
k
k


Fixed submission (verdict: Accepted):
import collections
n=int(input())
ans=[]
s=["".join(input()) for _ in range(n)]
c=collections.Counter(s)
m=max(c.values())
for k,v in c.items():
  if v==m:
    ans.append(k)

for i in sorted(ans):
  print(i)
Problem: p02836
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
s = input()
reverse_s = s[::-1]
cnt = 0
for i, j in zip(s, reverse_s):
    if i != j:
        cnt += 1
print(cnt)

Failing test case input:
aacbadc

Expected output:
3


Actual output:
6


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

Problem: p02836
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n = input()
n = list(n)
print(n)
m = len(n) 
A = 0
if m % 2 == 0:
    K = int(m/2)
    a = n[0:K]
    n.reverse()
    b = n[0:K]
else:
    K = int((m - 1) / 2)
    a = n[0:K]
    n.reverse()
    b = n[0:K]
for i, value in enumerate(a):
    if value != b[i]:
        A = A + 1

print(A)

Failing test case input:
rddbrdfo

Expected output:
3


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


Fixed submission (verdict: Accepted):
n = input()
n = list(n)
m = len(n) 
A = 0
if m % 2 == 0:
    K = int(m/2)
    a = n[0:K]
    n.reverse()
    b = n[0:K]
else:
    K = int((m - 1) / 2)
    a = n[0:K]
    n.reverse()
    b = n[0:K]
for i, value in enumerate(a):
    if value != b[i]:
        A = A + 1

print(A)

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

Failing test case input:
ywvwsw

Expected output:
3


Actual output:
6


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

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

print(ans)

Failing test case input:
yvwwsw

Expected output:
2


Actual output:
3
2


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

print(ans)

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

n = len(s)
if n % 2 == 0:
    s1 = [x for x in sorted(s[0:(int(n/2))], reverse = False)]
    s2 = [x for x in sorted(s[(int(n/2)):n], reverse = True)]
    num = 0
    for i in range(int(n/2)):
        if s1[i] != s2[i]:
            num += 1
    print(num)
else:
    s1 = [x for x in sorted(s[0:(int((n-1)/2))], reverse = False)]
    s2 = [x for x in sorted(s[(int((n+1)/2)):n], reverse = True)]
    num = 0
    for i in range(int(n/2)):
        if s1[i] != s2[i]:
            num += 1
    print(num)

Failing test case input:
odfarbdr

Expected output:
3


Actual output:
4


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

n = len(s)
if n % 2 == 0:
    s1 = [x for x in s[0:(int(n/2))]]
    s2 = [x for x in s[(int(n/2)):n]]
    
    

    num = 0
    for i in range(int(n/2)):
        
        
        if s1[i] != s2[int(n/2)-i-1]:
            num += 1
    print(num)
else:
    s1 = [x for x in s[0:(int((n-1)/2))]]
    s2 = [x for x in s[(int((n+1)/2)):n]]

    num = 0
    for i in range(int(n/2)):
        if s1[i] != s2[int(n/2)-i-1]:
            num += 1
    print(num)
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:
vtwvwx

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()

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)
   
  
  

Failing test case input:
ofcrbddr

Expected output:
4


Actual output:
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):
string = list(input())
length = len(string)
l = list()
if length % 2 ==0:
    for i in range (int(length/2),length):
        l.append(string[i])
    l.reverse()
else:
    for i in range (int(length/2)+1,length):
        l.append(string[i])
    l.reverse()
print(str(l))
result = 0
for i in range(len(l)):
    if not l[i] == string[i]:
        result = result + 1
print(result)

Failing test case input:
vwvvvv

Expected output:
1


Actual output:
['v', 'v', 'v']
1


Fixed submission (verdict: Accepted):
string = list(input())
length = len(string)
l = list()
if length % 2 ==0:
    for i in range (int(length/2),length):
        l.append(string[i])
    l.reverse()
else:
    for i in range (int(length/2)+1,length):
        l.append(string[i])
    l.reverse()
result = 0
for i in range(len(l)):
    if not l[i] == string[i]:
        result = result + 1
print(result)

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

Failing test case input:
aacc`cc

Expected output:
3


Actual output:
6


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

if len(s) % 2 == 0:
  harf = int(len(s) / 2 - 1);
else:
  harf = int((len(s) - 1) / 2);

count = 0;
for i in range(harf):
    if s[i] != s[:harf:-1][i]:
        count += 1;
    
print(count);

Failing test case input:
odbaqcer

Expected output:
4


Actual output:
3


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

if len(s) % 2 == 0:
  harf = int(len(s) / 2 - 1) + 1;
else:
  harf = int((len(s) - 1) / 2);

count = 0;
for i in range(harf):
    if s[i] != s[::-1][i]:
        count += 1;
    
print(count);

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


Failing test case input:
vvvwwv

Expected output:
2


Actual output:
4


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

Problem: p02836
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
from math import modf
word=input()
word=list(set(word))
n=len(word)/2
decimal,integer=modf(n)
integer=int(integer)
count=0
print(integer)
for i in range(integer):
  if word[i]!=word[-i-1]:
    word[-i-1]=word[i]
    count+=1
print(count)

Failing test case input:
dcb``bd

Expected output:
2


Actual output:
2
2


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

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

if N % 2 == 0:
    m = int(N/2)
    LS = S[:m]
    RS = S[N:m-1:-1]
else:
    m = int((N+1)/2)
    LS = S[:m-1]
    RS = S[N:m-1:-1]

ans = 0
for i in range(m-1):
    if LS == RS:
        pass
    else:
        ans += 1
print(ans)

Failing test case input:
rdebrdeo

Expected output:
4


Actual output:
3


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

if N % 2 == 0:
    m = int(N/2)
    LS = S[:m]
    RS = S[N:m-1:-1]
    ans = 0
    for i in range(m):
        if LS[i] == RS[i]:
            pass
        else:
            ans += 1
else:
    m = int((N+1)/2)
    LS = S[:m-1]
    RS = S[N:m-1:-1]
    ans = 0
    for i in range(m-1):
        if LS[i] == RS[i]:
            pass
        else:
            ans += 1

print(ans)

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-i]:
            count += 1
    print(count)



Failing test case input:
vswyvw

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.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:
vswvwx

Expected output:
3


Actual output:
0


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 (Python (3.4.3), verdict: Wrong Answer):
A = list(input())
import math
print(A)
B = math.ceil(len(A) / 2)
R = 0
print(B)
C = A[0:B]
D = A[-B:]
D = D[::-1]
count = 0
print(C)
print(D)
for i in range(B):
	if C[count] != D[count]:
		R += 1
	count += 1
print(str(R))

Failing test case input:
ecbd`b`

Expected output:
3


Actual output:
['e', 'c', 'b', 'd', '`', 'b', '`']
4
['e', 'c', 'b', 'd']
['`', 'b', '`', 'd']
3


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()
count = 0
for i in range(len(s)):
  a = s[i]
  b = s[::-1][i]
  if a != b:
    count += 1
print(count/2)

Failing test case input:
cb``bcd

Expected output:
3


Actual output:
3.0


Fixed submission (verdict: Accepted):

s = input()
count = 0
for i in range(len(s)):
  a = s[i]
  b = s[::-1][i]
  if a != b:
    count += 1
print(int(count/2))

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

Failing test case input:
odcaqcer

Expected output:
3


Actual output:
o:r
d:e
c:c
a:q
3


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

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

c = 0
for a, b in zip(S, S[-1]):
  if a == b:
    c += 1

print(len(S)-c)

Failing test case input:
vswxwv

Expected output:
2


Actual output:
5


Fixed submission (verdict: Accepted):
S = input()
l = len(S)
c = 0
for a, b in zip(S[:l
  if a != b:
    c += 1
print(c)

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

l = list(s)
t = list(s)

t.reverse()

count = 0
for i in range(len(s)):
  if l[i] != t[i]:
    count += 1
print(count / 2)

Failing test case input:
recraddo

Expected output:
4


Actual output:
4.0


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

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

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

Failing test case input:
uuxxuu

Expected output:
0


Actual output:
uuxxuu
0


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

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


Failing test case input:
aaccacc

Expected output:
3


Actual output:
6


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

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

Failing test case input:
cb``bcd

Expected output:
3


Actual output:
6


Fixed submission (verdict: Accepted):
S = input()
cnt = 0
N = len(S)
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 = list(input())

A = []
for i in S:
    A.append(i)
ans = 0
for i in range(len(S)):
    if S[i] != A[i]:
        ans += 1
print(ans)

Failing test case input:
vwsxwv

Expected output:
1


Actual output:
0


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

A = []
for i in S:
    A.append(i)
ans = 0
S.reverse()
for i in range(len(S)):
    if S[i] != A[i]:
        ans += 1

print(ans

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

count = 0

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

print(count)


Failing test case input:
abcdabc

Expected output:
2

Actual output:
3


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

Problem: p02836
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
x = input()
a = x[::-1]
b = 0
c = 0
d = len(x)

while b >= d:
  if x[b] == a[b]:
    c = c
    b = b + 1
  else:
    c = c + 1
    b = b + 1
c = int(c/2)
print(c)

Failing test case input:
ywwwsv

Expected output:
2


Actual output:
0


Fixed submission (verdict: Accepted):
x = input()
a = x[::-1]
b = 0
c = 0
d = int(len(x))
while b + 1 <= d:
  if x[b] == a[b]:
    c = c
    b = b + 1
  else:
    c = c + 1
    b = b + 1
c = int(c/2)
print(c)

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


Failing test case input:
aacc`cc

Expected output:
3


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

Failing test case input:
dbb``bd

Expected output:
1


Actual output:

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

Problem: p02836
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
S=input()
n=len(S)
q=0
for i in range(n):
    if S[i]!=S[n-i-1]:
        q+=1
print("{}".format(q/2))

Failing test case input:
aacdabc

Expected output:
3


Actual output:
3.0


Fixed submission (verdict: Accepted):
import numpy as np

S=input()
n=len(S)
q=0
for i in range(n):
    if S[i]!=S[n-i-1]:
        q+=1
print("{}".format(q

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


Failing test case input:
db``bbd

Expected output:
1


Actual output:
2


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

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

t = s[::-1]

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


Failing test case input:
rfcqabod

Expected output:
4


Actual output:
8


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):
import math

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

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



Failing test case input:
aacdabc

Expected output:
3


Actual output:
6


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.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-1)):
    if s[point1-i]!=s[point2-i]:
      count += 1
  print(count)


Failing test case input:
wswvwy

Expected output:
3


Actual output:
1


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=str(input())
a=0
for i in range(len(s)):
    print(s[i]+':'+s[len(s)-1-i])
    if s[i]!=s[len(s)-1-i]:
        a+=1
print(int(a/2))

Failing test case input:
dcbd`b`

Expected output:
3


Actual output:
d:`
c:b
b:`
d:d
`:b
b:c
`:d
3


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

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

Failing test case input:
dbb``bd

Expected output:
1


Actual output:
2


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):
S = input()
N = len(S)

count = 0

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

print(count)


Failing test case input:
vxwvwt

Expected output:
3


Actual output:
5


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

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

print(x)

Failing test case input:
yxuwsw

Expected output:
3


Actual output:
y w
x s
u w
3


Fixed submission (verdict: Accepted):
n = input()
x = 0
L = len(n)
for i in range(L):
    if i < L / 2:
        if n[i] != n[(i + 1) * -1]:
            x += 1

print(x)

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


Failing test case input:
rfcqobad

Expected output:
4


Actual output:
4.0


Fixed submission (verdict: Accepted):
S = list(input())
a = 0
SS = S[::-1]
for i in range(len(S)):
    if S[i] != SS[i]:
        a = a+1
print(a
Problem: p02836
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
S=list(input())
count=0
hp=round(len(S)/2)
S1,S2=S[0:hp-1],S[:hp-1:-1]

for i in range(hp-1):
  if S1[i]!=S2[i]:
    count+=1

print(count)

Failing test case input:
vswyvw

Expected output:
3


Actual output:
2


Fixed submission (verdict: Accepted):
import math

S=list(input())
count=0
n,m=math.floor(len(S)/2),math.ceil(len(S)/2)
S1,S2=S[0:n],S[:m-1:-1]

for i in range(n):
  if S1[i]!=S2[i]:
    count+=1

print(count)

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

Failing test case input:
aacbadc

Expected output:
3


Actual output:
['a', 'a', 'c', 'b', 'a', 'd', 'c']
['c', 'd', 'a', 'b', 'c', 'a', 'a']
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):
s = input("")
print(s)
i = 0
length = len(s)


count = 0
for i in range (0, length):
    if s[i] != s[length - i - 1]:
        count += 1

print(int(count / 2))

Failing test case input:
bcba`cc

Expected output:
2


Actual output:
bcba`cc
2


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


count = 0
for i in range (0, length):
    if s[i] != s[length - i - 1]:
        count += 1

print(int(count / 2))

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

Failing test case input:
`bebbca

Expected output:
3


Actual output:
0


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

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



Failing test case input:
vxwvwt

Expected output:
3


Actual output:
3.0


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

Problem: p02836
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
import math
A=list(input())
N=len(A)
x=0
for i in range(0,N):
    if A[i]!=A[N-1-i]:
        x+=1
a=math.ceil(x/2)
print(x)

Failing test case input:
vxwvwt

Expected output:
3


Actual output:
6


Fixed submission (verdict: Accepted):
import math
s=list(input())
N=len(s)
x=0
for i in range(0,N):
    if s[i]!=s[N-1-i]:
        x+=1
x=math.ceil(x/2)
print(x)
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:l]
  ee = list(reversed(e))

  ans = len(set(dd) & set(ee))
  
  print(t-ans)
        
else:  
  t = math.ceil(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:
uuxxuu

Expected output:
0


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):
s = list(input())

count = 0
for i,letter in enumerate(s):
  if s[i] != s[len(s) - 1 - i]:
    count += 1
print(count)

Failing test case input:
cdabcaa

Expected output:
3


Actual output:
6


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

Problem: p02836
Buggy submission (PyPy3 (2.4.0), verdict: Wrong Answer):
import sys
input  = sys.stdin.readline

S=input()
R=list(S)
R.reverse()
R = "".join(R)
l = int(len(S)/2)
rtn=0
for i in range(l):
  if S[i]!=R[i]:
    rtn+=1
print(rtn)

Failing test case input:
db``bbc

Expected output:
2


Actual output:
4


Fixed submission (verdict: Accepted):
import sys
input = sys.stdin.readline
 
S=input().rstrip()
R=list(S)
R.reverse()
R = "".join(R)
l = int(len(S)/2)
rtn=0
for i in range(l):
  if S[i]!=R[i]:
    rtn+=1
print(rtn)

Problem: p02836
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
Y=str(input())
X=[]
X=list(Y) 
print(X)
n=len(X)
m=0
if n%2==0:
    for i in range (0,n):
        if X[i]==X[n-i-1]:
            m=m+1
        else:
            m=m
    a=(n-m)/2
elif n%2==1:
    for i in range(0,n):
        if X[i]==X[n-i-1]:
            m=m+1
        else:
            m=m
    a=(n-m)/2
print(int(a))


Failing test case input:
aaccacc

Expected output:
3


Actual output:
['a', 'a', 'c', 'c', 'a', 'c', 'c']
3


Fixed submission (verdict: Accepted):
Y=str(input())
X=[]
X=list(Y) 

n=len(X)
m=0
if n%2==0:
    for i in range (0,n):
        if X[i]==X[n-i-1]:
            m=m+1
        else:
            m=m
    a=(n-m)/2
elif n%2==1:
    for i in range(0,n):
        if X[i]==X[n-i-1]:
            m=m+1
        else:
            m=m
    a=(n-m)/2
print(int(a))
Problem: p02836
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
S = input().strip()
S1=S[::-1]
count=0
for i in range(len(S)):
    if S[i] != S1[i]:
        count= count+1

print(count)

Failing test case input:
vwvwxv

Expected output:
2


Actual output:
4


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):
s = input()
n = len(s)

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

print(cnt)


Failing test case input:
odfarcdr

Expected output:
3


Actual output:
6


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):
def palin(s):
    p1 = ans = 0
    p2 = len(s) - 1
    while p1 < p2:
        if s[p1] != s[p2]:
            ans += 1
        p1 += 1
        p2 -= 1
    print(ans)

if __name__ == "__main__":
    import sys
    in_str = ''
    for line in sys.stdin:
        in_str += line
    palin(in_str)


Failing test case input:
oedrbedr

Expected output:
4


Actual output:
3


Fixed submission (verdict: Accepted):
def palin(s):
    p1 = ans = 0
    p2 = len(s) - 1
    while p1 < p2:
        if s[p1] != s[p2]:
            ans += 1
        p1 += 1
        p2 -= 1
    print(ans)

if __name__ == "__main__":
    import sys
    in_str = ''
    for line in sys.stdin:
        in_str += line
    palin(in_str.strip())

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

Failing test case input:
`cbbeb`

Expected output:
2


Actual output:
3


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

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

l = len(s)
c = 0
for i in range(l):
    if s[i] != s[l-i-1]:
        c += 1
print(c/2)


Failing test case input:
wvywsw

Expected output:
2


Actual output:
2.0


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

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

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


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 (j/2)



Failing test case input:
rfcqabod

Expected output:
4


Actual output:
4.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):
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:
	print(len(list_before))
	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:
ecbb`b`

Expected output:
3


Actual output:
4
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()
l = len(s)
ans = 0
i = 1
j = 0
if l%2 == 0:
	while(j <= l/2 - 1):
		if s[j] != s[-i]:
			ans += 1
		j+=1
		i+=1
			
print(ans)

Failing test case input:
ecbc`b`

Expected output:
3


Actual output:
0


Fixed submission (verdict: Accepted):
s = input()
l = len(s)
ans = 0
i = 1
j = 0
if l%2 == 0:
	while(i <= l/2):
		if s[j] != s[-i]:
			ans += 1
		j+=1
		i+=1
else:
	max = l/2
	while(j < max):
		if s[j] != s[-i]:
			ans += 1
		j+=1
		i+=1
			
print(ans)

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

Failing test case input:
ecbc`b`

Expected output:
3


Actual output:
2


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

Problem: p02836
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
S = input()
rS = "".join([S[-i] for i in range(1,len(S)+1) ])

c = 0
for i in range(len(S)):
    if S[i] != rS[i]:
        c +=1
        
print(c/2)

Failing test case input:
rddbrfdo

Expected output:
3


Actual output:
3.0


Fixed submission (verdict: Accepted):
S = input()
rS = "".join([S[-i] for i in range(1,len(S)+1) ])

c = 0
for i in range(len(S)):
    if S[i] != rS[i]:
        c +=1
        
print(int(c/2))