Problem:


Score : 200 points

Problem Statement

Takahashi loves palindromes. Non-palindromic strings are unacceptable to him. Each time he hugs a string, he can change one of its characters to any character of his choice.

Given is a string S. Find the minimum number of hugs needed to make S palindromic.

Constraints

S is a string consisting of lowercase English letters.

The length of S is between 1 and 100 (inclusive).

Input

Input is given from Standard Input in the following format:

S

Output

Print the minimum number of hugs needed to make S palindromic.

Sample Input 1

redcoder

Sample Output 1

1

For example, we can change the fourth character to o and get a palindrome redooder.

Sample Input 2

vvvvvv

Sample Output 2

0

We might need no hugs at all.

Sample Input 3

abcdabc

Sample Output 3

2



Sample input:
redcoder


Sample output:
1

Submission status: Wrong Answer

Solution code:
S = input()
mojisu = len(S)
hug_a = 0
hug_b = 0
if mojisu % 2 == 0:
    for i in range(mojisu // 2):
        if S[i] != S[mojisu - (i+1)]:
            hug_a = hug_a + 1
            if hug_a == 0:
                print(0)
            else:
                print(hug_a)
    if mojisu % 2 == 1:
        for j in range((mojisu-1) // 2):
            if S[j] != S[mojisu - (j+1)]:
                hug_b = hug_b + 1
                if hug_b == 0:
                    print(0)
                else:
                    print(hug_b)

Submission status: Wrong Answer

Solution code:
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)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
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))

Submission status: Wrong Answer

Solution code:
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))

Submission status: Wrong Answer

Solution code:
s = input()

length = len(s)
left = s[:len(s)//2][::-1]
if length%2 == 0:
    right = s[len(s)//2:]
else:
    right = s[:len(s)//2+1:]

ans = 0

for idx, l in enumerate(left):
    if l != right[idx]:
        ans += 1

print(ans)

Submission status: Wrong Answer

Solution code:
s=input()
count=0
for i in range(0,len(s)//2):
    if s[i]!=s[len(s)-1-i]:
        count=count+1

Submission status: Wrong Answer

Solution code:
import sys
import math
input = sys.stdin.readline
MOD = 10**9 + 7
INF = float('INF')

def main():
    s = input()
    ans = 0

    for i in range(math.ceil(len(s)/2)):
        if s[i] != s[-(i+1)]:
            ans += 1

    print(ans)

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
import sys
input = sys.stdin.readline
MOD = 10**9 + 7
INF = float('INF')

def main():
    s = input()
    ans = 0

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

    print(ans)

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
import sys
input = sys.stdin.readline
MOD = 10**9 + 7
INF = float('INF')

def main():
    s = input()
    ans = 0

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

    print(ans)

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
s = input()
sl = len(s)
count = 0
for i in range(sl//2 + 1):
  if s[i] != s[sl - i - 1]:
    count += 1
if count != 0 and sl % 2 == 0:
  count -= 1
print(count)

Submission status: Wrong Answer

Solution code:
s=input()
l=len(s)
a=s[:l//2]
b=s[(l+1)//2:]
cnt=0
for i in range(l//2):
  if a[i]==b[(l//2)-1-i]:
    cnt+=1
print(cnt)

Submission status: Wrong Answer

Solution code:
S = input()
cnt = 0
for i in range(len(S) // 2):
  if S[i] != S[-i]:
    cnt += 1

print(cnt)

Submission status: Wrong Answer

Solution code:
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))

Submission status: Wrong Answer

Solution code:
S = input()
count = 0

leng = len(S)

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

Submission status: Wrong Answer

Solution code:
N = input()
count = 0
X = len(N) -1
for i in range(int(X/2)):
  if N[i] != N[-1]:
    count += 1
print(count)

Submission status: Wrong Answer

Solution code:
st = input()

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

Submission status: Wrong Answer

Solution code:
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))

Submission status: Wrong Answer

Solution code:
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)

Submission status: Wrong Answer

Solution code:
S = input()
T = S[::-1]
a = 0

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

print(a)

Submission status: Wrong Answer

Solution code:
# -*- coding:utf-8 -*-
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)

Submission status: Wrong Answer

Solution code:
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)

Submission status: Wrong Answer

Solution code:
S=input()
SR=S[::-1]
ans=0

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

print(ans-1)

Submission status: Wrong Answer

Solution code:
S=input()
SR=S[::-1]
ans=0

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

print(ans)

Submission status: Wrong Answer

Solution code:
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)

Submission status: Wrong Answer

Solution code:
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)

Submission status: Wrong Answer

Solution code:
s = list(input())

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

print(count)

Submission status: Wrong Answer

Solution code:
s = input()
rs = reversed(s)

acc = sum([c == rc for c, rc in zip(s, rs)])

print(acc // 2)

Submission status: Wrong Answer

Solution code:
S = input()
if len(S) == 1:
    print(0)
    exit()
if len(S) == 2:
    if S[0] != S[1]:
        print(1)
    else:
        print(0)
    exit()

if len(S) % 2 == 0:
    mae = S[:(len(S) - 1)//2+1][::-1]
    ato = S[(len(S) - 1)//2+1:]
    ans = 0
    for i in range((len(S)-1)//2):
        if mae[i] != ato[i]:
            ans += 1
    print(ans)
else:
    mae = S[:(len(S) - 1)//2][::-1]
    ato = S[(len(S) - 1)//2+1:]
    print(mae, ato)
    ans = 0
    for i in range(len(mae)):
        if mae[i] != ato[i]:
            ans += 1
    print(ans)

Submission status: Wrong Answer

Solution code:
S = input()
if len(S) == 1:
    print(0)
    exit()
if len(S) == 2:
    if S[0] != S[1]:
        print(1)
    else:
        print(0)
    exit()

if len(S) % 2 == 0:
    mae = S[:(len(S) - 1)//2+1][::-1]
    ato = S[(len(S) - 1)//2+1:]
    ans = 0
    for i in range((len(S)-1)//2):
        if mae[i] != ato[i]:
            ans += 1
    print(ans)
else:
    mae = S[:(len(S) - 1)//2][::-1]
    ato = S[(len(S) - 1)//2+1:]
    print(mae, ato)
    ans = 0
    for i in range((len(S)-1)//2):
        if mae[i] != ato[i]:
            ans += 1
    print(ans)

Submission status: Wrong Answer

Solution code:
S = input()
if len(S) % 2 == 0:
    mae = S[:(len(S) - 1)//2+1][::-1]
    ato = S[(len(S) - 1)//2+1:]
    ans = 0
    for i in range((len(S)-1)//2):
        if mae[i] != ato[i]:
            ans += 1
    print(ans)
else:
    mae = S[:(len(S) - 1)//2][::-1]
    ato = S[(len(S) - 1)//2+1:]
    ans = 0
    for i in range((len(S)-1)//2):
        if mae[i] != ato[i]:
            ans += 1
    print(ans)

Submission status: Wrong Answer

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

S = input()

if len(S)%2 != 0:
	S = S[0:int(len(S)/2-1)]+S[int(len(S)/2-1)+1:]

a = len(S)//2 - 1
count = 0
for i in range(a+1):
	if S[a+1+i] != S[a-i]:
		count += 1

print(count)

Submission status: Wrong Answer

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

S = input()

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

print(count)

Submission status: Wrong Answer

Solution code:
S=input()
ans=0
for i in range(len(S)//2):
    if S[i]!=S[-i]:
        ans+=1
print(ans)

Submission status: Wrong Answer

Solution code:
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)

Submission status: Wrong Answer

Solution code:
S = input()
l = [i for i in S] 
print(l)

count = 0

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

Submission status: Wrong Answer

Solution code:
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)

Submission status: Wrong Answer

Solution code:
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)

Submission status: Wrong Answer

Solution code:
import numpy as np
S = list('abcdabc')#input())
print(float(np.sum([1 for a, b in zip(S[:int(np.floor(len(S)/2))], list(reversed(S[int(np.ceil(len(S)/2)):]))) if not a == b])))

Submission status: Wrong Answer

Solution code:
import numpy as np
S = list('abcdabc')#input())
print(int(np.sum([1 for a, b in zip(S[:int(np.floor(len(S)/2))], list(reversed(S[int(np.ceil(len(S)/2)):]))) if not a == b])))

Submission status: Wrong Answer

Solution code:
import numpy as np
S = list('vvvvvv')#input())
print(int(np.sum([1 for a, b in zip(S[:int(np.floor(len(S)/2))], list(reversed(S[int(np.ceil(len(S)/2)):]))) if not a == b])))

Submission status: Wrong Answer

Solution code:
import numpy as np
S = list(input())
print(np.sum([1 for a, b in zip(S[:int(np.floor(len(S)/2))], list(reversed(S[int(np.ceil(len(S)/2)):]))) if not a == b]))

Submission status: Wrong Answer

Solution code:

import sys
row = sys.stdin.readline

def read_string(row):
    return row().rstrip()
  
S = read_string(row)
S_rev = S[::-1]
cnt = 0
for i in range(len(S)):
    if S[i] != S_rev[i]:
        cnt +=1
print(cnt//2+len(S)%2)

Submission status: Wrong Answer

Solution code:
s=str(input())
print(sum(a!=b for a,b in zip(s,s[::-1]))/2)

Submission status: Wrong Answer

Solution code:
s=str(input())
print(sum(a!=b for a,b in zip(s,s[::-1])))

Submission status: Wrong Answer

Solution code:
s=input()
print(sum(a!=b for a,b in zip(s,s[::-1])))

Submission status: Wrong Answer

Solution code:
s = input()
rev_s = s[::-1]

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

Submission status: Wrong Answer

Solution code:
S = input()
T = ""
L = len(S)
for i in range(L):
    T += S[L-i-1]
print(T)
ans = 0
for i in range((L+1)//2):
    if S[i] != T[i]:
        ans += 1
print(ans)

Submission status: Wrong Answer

Solution code:
S = input()
T = ""
L = len(S)
for i in range(L):
    T += S[L-i-1]
print(T)
ans = 0
for i in range(L):
    if S[i] != T[i]:
        ans += 1
print(ans//2)

Submission status: Wrong Answer

Solution code:
S = input()
T = ""
L = len(S)
for i in range(L):
    T += S[L-i-1]
print(T)
ans = 0
for i in range(L):
    if S[i] != T[i]:
        ans += 1
print(ans)
print(ans//2)

Submission status: Wrong Answer

Solution code:
s = list(input())
n = len(s)
a = s[:n//2]
b = list(reversed(s[(n+1)//2:]))
ans = 0
for i in range(n//2):
    ans += (a[i] == b[i])
print(ans)

Submission status: Wrong Answer

Solution code:
s = input()

n = len(s)
if n % 2 == 1:
    front = s[:(n//2 - 1)]
    rev = front[::-1]
    end = s[(n//2 - 1):]
else:
    front = s[:(n//2)]
    rev = front[::-1]
    end = s[(n//2):]

res = 0
for i in range(n//2 - 1):
    if rev[i] != end[i]:
        res += 1
print(res)

Submission status: Wrong Answer

Solution code:
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)

Submission status: Wrong Answer

Solution code:
s = input()
len_s = len(s)
c = 0
for _ in range(int(len_s/2)):
  if(s[_] == s[-_]):
    c+=1
print(c)

Submission status: Wrong Answer

Solution code:
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)

Submission status: Wrong Answer

Solution code:
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)

Submission status: Wrong Answer

Solution code:
S = input()

n = len(S)
count = 0

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

Submission status: Wrong Answer

Solution code:
import math

s = input()

left = s[:len(s) // 2]
right = s[-math.floor(len(s) / 2):]

ct = 0
for i in range(len(left)):
    if left[i] != right[i]: ct += 1

print(ct)

Submission status: Wrong Answer

Solution code:
s = input()
i = len(s) // 2
flont = 0
back = -1
miss = 0
for n in range(i):
    if s[flont] != s[back]:
        miss += 1
print(miss)

Submission status: Wrong Answer

Solution code:
import sys
def input():
  return sys.stdin.readline()#[:-1]

def main():
  s = input()
  res = 0
  for i in range(len(s)//2):
    if s[i] != s[-(i+1)]:
      res += 1
  print(res)
    
if __name__ == '__main__':
  main()

Submission status: Wrong Answer

Solution code:
S = input()
string_original = list(S)
string = list(S)
length = len(string)

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

diff = set(string) & set(string_original)
print(len(diff))

Submission status: Wrong Answer

Solution code:
S = input()
l = len(S)-1
if (l % 2 == 0):
    ls = l/2
else: 
    ls = l//2 + 1

n = 0

for x in range(int(ls)):
    if (S[x] != S[l-x]):
        S = S.replace(S[x],S[l-x])
        n +=1

print(n)

Submission status: Wrong Answer

Solution code:
S = input()
len = len(S)
ans = 0
for i in range(len//2):
	if S[i] != S[len-i-2]:
		ans = ans + 1
print(ans)

Submission status: Wrong Answer

Solution code:
S = input()
T = 0
K = len(S)//2 if len(S)%2 == 0 else len(S)//2+1
for i in range(K-1):
  if S[i] != S[K + i]:
    T+=1
print(T)

Submission status: Wrong Answer

Solution code:
S = input()
T = 0
K = len(S) if len(S)%2 == 0 else len(S)+1
for i in range(K//2-1):
  if S[i] != S[K//2 + i]:
    T+=1
print(T)

Submission status: Wrong Answer

Solution code:
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd
 
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def S_MAP(): return map(str, input().split())
def LIST(): return list(map(int, input().split()))
def S_LIST(): return list(map(str, input().split()))
 
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

# 最小公倍数
def gcd(a, b):
	if a < b:
		a, b = b, a
	while a % b != 0:
		a, b = b, a % b
	return b
 
# 最大公約数 
def lcm(a, b):
	y = a*b / gcd(a, b)
	return int(y)

def primes_for(n):
  is_prime = [True] * (n + 1)
  is_prime[0] = False
  is_prime[1] = False
  for i in range(2, n + 1):
      for j in range(i * 2, n + 1, i):
          is_prime[j] = False
  return [i for i in range(n + 1) if is_prime[i]]

# O(√A)
def isPrime(n):
  if n < 2:
    # 2未満は素数でない
    return False
  if n == 2:
    # 2は素数
    return True
  for p in range(2, n):
      if n % p == 0:
        # nまでの数で割り切れたら素数ではない
        return False
  # nまでの数で割り切れなかったら素数
  return True

# 回文 S[::-1]

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

Submission status: Wrong Answer

Solution code:
s = input()
ans = 0
for i in range(len(s)//2):
    if s[i] != s[-i-1]:
        print(s[i])
        ans+=1
print(ans)

Submission status: Wrong Answer

Solution code:
s = list(input())

if len(s)%2!=0:
  s.remove(s[int((len(s)-1)/2)])

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

Submission status: Wrong Answer

Solution code:
k = input()
dismatch = 0
num = len(k)//2 + 1

n = 0
m = len(k)-1
for i in range(num):
  if k[n] != k[m]:
    dismatch += 1
  n += 1
  m -= 1
print(dismatch)

Submission status: Wrong Answer

Solution code:
k = input()
dismatch = 0
num = len(k)//2 + 1

n = 0
m = len(k)-1
for i in range(num):
  if k[n] != k[m]:
    dismatch += 1
  n += 1
  m -= 1
print(dismatch//2)

Submission status: Wrong Answer

Solution code:
S = input()
count = 0
N = int(len(S) / 2)

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

Submission status: Wrong Answer

Solution code:
def main():
  S=input()
  s=0
  N=len(S)
  for i in range(N//2):
    if S[i]!=S[-i-1]:
      S[-i-1]=S[i]
      s+=1
  print(s)

Submission status: Wrong Answer

Solution code:
S = list(input())
n = len(S) // 2

m = -1
s = 0
ans = 0

for i in range(n):
    if S[s] != S[m]:
        ans += 1
        s += 1
        m -= 1
print(ans)

Submission status: Wrong Answer

Solution code:
S = list(input())
m = len(S) -1
n = len(S) // 2

s = 0
ans = 0
while s <= n:
    if S[s] == S[m]:
        s += 1
        m -= 1
    elif S[s] != S[m]:
        ans += 1
        s += 1
        m -= 1
    

print(ans)

Submission status: Wrong Answer

Solution code:
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))

Submission status: Wrong Answer

Solution code:
a=input()
b=len(a)
i=0
j=0
while i <= b//2 :
	if a[i] != a[b-i-1]: 
		j+=1
		i+=1
	else:
		i+=1
print(j)

Submission status: Wrong Answer

Solution code:
S = str(input())
f1 = list(S)
f2 = list(reversed(f1))
c = 0
for a,b in zip(f1, f2):
	if a != b:
		c +=1
print(c)

Submission status: Wrong Answer

Solution code:
S = str(input())
f1 = list(S)
f2 = list(reversed(f1))
c = 0
for a,b in zip(f1, f2):
	if a == b:
		c +=1
print(c)

Submission status: Wrong Answer

Solution code:
a = input()
cnt = 0
for i in range(len(a)):
  if a[i]!=a[len(a)-i-1]:
    cnt+=1
    
print(cnt)

Submission status: Wrong Answer

Solution code:
S = input()
ans = 0
for i in range(len(S)//2):
	if S[i] == S[len(S)-i-1]:
		ans = ans +1
print(ans)

Submission status: Wrong Answer

Solution code:
s=input()
ans=0

for i in range(len(s)//2):
    if s[i]==(s[len(s)-i-1]):
        ans+=1
print(ans)

Submission status: Wrong Answer

Solution code:
s = str(input())
x = len(s)
tmp = 0

if x%2 == 0:
    for i in range((x-1)//2):
        if s[i] != s[x-i-1]:
            tmp += 1

else:
    for i in range(x//2):
        if s[i] != s[x-i-1]:
            tmp += 1

print(tmp)

Submission status: Wrong Answer

Solution code:
s = input();print([1 for i in range(len(s)//2) if s[i]!=s[-i-1]])

Submission status: Wrong Answer

Solution code:
S = input()
N = len(S)
 
ans = 0
for i in range(N // 2):
  if S[i] != S[-i]:
    ans += 1
print(ans)

Submission status: Wrong Answer

Solution code:
S = input()
N = len(S)
 
ans = 0
for i in range(N // 2):
  if S[i] != S[i*(-1)]:
    ans += 1
print(ans)

Submission status: Wrong Answer

Solution code:
a = input()
 
count = 0
 
for i in range(len(a)//2):
    if a[i] == a[-i-1]:
        count += 1
 
print(count)

Submission status: Wrong Answer

Solution code:
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)

Submission status: Wrong Answer

Solution code:
s = input()

s_ = list(reversed(s))

a = ''

x = 0

for i in s:
    for i_ in s_:
        if i != i_:
            a += i
            x += 1
        break
        

print(x)

Submission status: Wrong Answer

Solution code:
s = input()

s_ = list(reversed(s))

x = 0

for i in s:
    for i_ in s_:
        if i != i_:
            x += 1
        break
        

print(x)

Submission status: Wrong Answer

Solution code:
S = input()

ans = 0
for i in range(len(S)//2):
  print(S[i], S[i*2])
  if S[i] == S[-i]:
    ans += 1
print(ans)

Submission status: Wrong Answer

Solution code:
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)

Submission status: Wrong Answer

Solution code:
a = [input().split()]
t=0
for i in range(int(len(a)/2)):
  if(a[i]==a[-(i+1)]):
     t += 1

print(t)

Submission status: Wrong Answer

Solution code:
s = list(input())
if len(s) % 2 == 0:
  a = int(len(s)/2)
  s1 = s[:a]
  s1.reverse()
  s2 = s[a:]
  print(s1)
  c = 0
  for i,j in zip(s1,s2):
    if i != j:
      c += 1
  print(c)
else:
  a = len(s)//2
  s1 = s[:a]
  s1.reverse()
  s2 = s[a+1:]
  c = 0
  for i,j in zip(s1,s2):
    if i != j:
      c += 1
  print(c)

Submission status: Wrong Answer

Solution code:
s = list(input())
if len(s) % 2 == 0:
  a = int(len(s)/2)
  s1 = s[:a]
  s2 = s[a:]
  c = 0
  for i,j in zip(s1,s2):
    if i != j:
      c += 1
  print(c)
else:
  a = len(s)//2
  s1 = s[:a]
  s2 = s[a+1:]
  c = 0
  for i,j in zip(s1,s2):
    if i != j:
      c += 1
  print(c)

Submission status: Wrong Answer

Solution code:
def main():
    l = {}
    lR = {}
    l = input()
    lR = l[::-1]
    givenLen = len(l)

    if l == lR:
        return 0

    temp = {}
    temp[0] = 0
    for i, e in enumerate(l):
        temp[i+1] = e
    l = dict(temp)
    temp = {}
    temp[0] = 0
    for i, e in enumerate(lR):
        temp[i+1] = e
    lR = dict(temp)

    LCStable = [[0 for _ in range(givenLen+1)]]*(givenLen+1)

    for i in l:
        for j in lR:
            if i == 0 or j == 0:
                LCStable[i][j] = 0
            elif l[i] == lR[j]:
                LCStable[i][j] = LCStable[i-1][j-1]+1
            else:
                LCStable[i][j] = max(LCStable[i][j-1], LCStable[i-1][j])
    return givenLen-LCStable[-1][-1]


# if __name__ == '__main__':
#     print(main())

print(main())

Submission status: Wrong Answer

Solution code:
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)

Submission status: Wrong Answer

Solution code:
s = input()
count = 0
len_s = len(s)

for a,b in zip(s[:len_s//2], s[:len_s//2:-1]):
  if a != b:
    count += 1

print(count)

Submission status: Wrong Answer

Solution code:
word=input()
word_rev=word[::-1]
cnt=0

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

Submission status: Wrong Answer

Solution code:
from math import modf
word=input()
word=list(set(word))
n=len(word)/2
decimal,integer=modf(n)
integer=int(integer)
count=0
for i in range(integer):
  if word[i]!=word[-i-1]:
    word[-i-1]=word[i]
    count+=1
print(count)

Submission status: Wrong Answer

Solution code:
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)

Submission status: Wrong Answer

Solution code:
s = input()

count = 0

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

Submission status: Wrong Answer

Solution code:
# B - Palindrome-philia

x = list(input())
cnt = 0
print(len(x))
for i in range(len(x) // 2):
    if x[i] != x[len(x) - i -1]:
        cnt += 1
print(cnt)

Submission status: Wrong Answer

Solution code:
S = input()
n = 0
for i in range(len(S)//2):
    if S[i] != S[i-1]:
        n+=1
print(n)

Submission status: Wrong Answer

Solution code:
s = list(input())
length = len(s)
ans = 0
print(s)
for i in range(len(s)//2):
    if s[i] != s[-i-1]:
        ans += 1

print(ans)

Submission status: Wrong Answer

Solution code:
s = list(map(str,input().split()))
length = len(s)
ans = 0
for i in range(len(s)//2):
    if s[i] == s[-i-1]:
        ans += 1

print(ans)

Submission status: Wrong Answer

Solution code:
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)

Submission status: Wrong Answer

Solution code:
s = input("")
print(s)
i = 0
length = len(s)
# print(type(len))
# print(len)
count = 0
for i in range (0, length):
    if s[i] != s[length - i - 1]:
        count += 1

print(int(count / 2))

Submission status: Wrong Answer

Solution code:
string = input()
count = 0
for i in range(int(len(string)/2)):
  if string[i] == string[-i]:
    count += 1
print(count)

Submission status: Wrong Answer

Solution code:
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)

Submission status: Wrong Answer

Solution code:
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)

Submission status: Wrong Answer

Solution code:
s = input()
result = 0
reverseString = s[::-1]
for i in range(len(s)):
    if s[i] != reverseString[i]:
        result += 1
print(result / 2)

Submission status: Wrong Answer

Solution code:
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)

Submission status: Wrong Answer

Solution code:
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)

Submission status: Wrong Answer

Solution code:
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))

Submission status: Wrong Answer

Solution code:
S = input()
lis = list(S)
lis_rev = list(S)
lis_rev.reverse()
cnt = 0
for i in range(len(lis) // 2 + 1):
    if lis[i] != lis_rev[i]:
        cnt += 1
print(cnt)

Submission status: Wrong Answer

Solution code:
s = input()
sol = 0
for i in range(len(s) // 2):
  if s[i] != s[-i]: sol += 1
print(sol)

Submission status: Wrong Answer

Solution code:
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)

Submission status: Wrong Answer

Solution code:
a = list(input())
n = len(a)

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

Submission status: Wrong Answer

Solution code:
r = 0
s = input()
for n in range(len(s)):
  if s[n] != s[-n-1]:
    r += 1
print(r/2)

Submission status: Wrong Answer

Solution code:
r = 0
s = input()
for n in range(len(s)):
  if s[n] != s[(-1)*(n+1)]:
    r += 1
print(r/2)

Submission status: Wrong Answer

Solution code:
S = input()
count=0
if len(S)%2==0:
  for i,s in enumerate(S):
    if S[len(S)-i-1]!=s:
      count+=1
    if i>=len(S)//2:
      break
else:
  for i,s in enumerate(S):
    if S[len(S)-i-1]!=s:
      count+=1
    if i==len(S)//2:
      break
print(count)

Submission status: Wrong Answer

Solution code:
while True:
    s=input("")
    s=str.lower(s)
    if 1<=len(s)<=100:
        break

count=0

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

print(count)

Submission status: Wrong Answer

Solution code:
s = input()
l = len(s)
c = 0

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

print(c)

Submission status: Wrong Answer

Solution code:
S = str(input())
s = [i for i in range(int(len(S) / 2)) if S[i] != S[-i]]
print(len(s))

Submission status: Wrong Answer

Solution code:
s = input()
count = 0

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

Submission status: Wrong Answer

Solution code:
s = input()
count = 0

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

Submission status: Wrong Answer

Solution code:
a=input()
n=len(a)
li=list(a)
b=0
for k in range(0,n//2-1):
    if not li[k]==li[n-1-k]:
        b=b+1

print(b)

Submission status: Wrong Answer

Solution code:
ch = input()
chlen = len(ch)
num = 0

if(chlen%2 == 0 ):
  tyousei = 1
else:
  tyousei = 0

for i in range(int(chlen/2)+tyousei):
  if(ch[i-1] != ch[-i]):
    num+=1
print(num)

Submission status: Wrong Answer

Solution code:
ch = input()
chlen = len(ch)
num = 0

if(chlen%2 == 0 ):
  tyousei = 1
else:
  tyousei = 0

for i in range(int(chlen/2)+tyousei):
  if(ch[i-1] != ch[-i]):
    print(ch[i-1],ch[-i])
    num+=1
print(num)

Submission status: Wrong Answer

Solution code:
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)

Submission status: Wrong Answer

Solution code:
s=input()
a=0
s_t = s[:int(len(s)/2)], s[int(len(s)/2):]
a += int(s_t[0][:1] != s_t[1][-1:])
for i in range(1, len(s_t[0])):
    a += int(s_t[0][i:i+1] != s_t[1][-(i+1):-i])
print(a)

Submission status: Wrong Answer

Solution code:
s=list(input())

l = len(s)//2

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

print(cnt)