Problem:


Score : 200 points

Problem Statement

Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so.

Operation: Choose one character of S and replace it with a different character.

Constraints

S and T have lengths between 1 and 2\times 10^5 (inclusive).

S and T consists of lowercase English letters.

S and T have equal lengths.

Input

Input is given from Standard Input in the following format:

S
T

Output

Print the answer.

Sample Input 1

cupofcoffee
cupofhottea

Sample Output 1

4

We can achieve the objective in four operations, such as the following:

First, replace the sixth character c with h.

Second, replace the eighth character f with t.

Third, replace the ninth character f with t.

Fourth, replace the eleventh character e with a.

Sample Input 2

abcde
bcdea

Sample Output 2

5

Sample Input 3

apple
apple

Sample Output 3

0

No operations may be needed to achieve the objective.



Sample input:
cupofcoffee
cupofhottea


Sample output:
4

Submission status: Accepted

Solution code:
s = input()
t = input()

counter = 0
for i in range(len(s)):

    if t[i] != s[i]:
        #t[i] = s[i]
        #t = t.replace(t[i], s[i])
        counter += 1

print(counter)

Submission status: Accepted

Solution code:
s = list(input())
t = list(input())
ans = 0
for i in range(len(s)):
  if s[i] != t[i]:
    ans += 1

print(ans)

Submission status: Accepted

Solution code:
s = input()
t = input()

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

print(count)

Submission status: Accepted

Solution code:
S = input()
T = input()
 
l= len(S)
n_same = 0
for i in range(l):
    if S[i] == T[i]:
        n_same += 1
ans = len(S) - n_same
print(int(ans))

Submission status: Accepted

Solution code:
S=input()
T=input()
count=0
for i in range(len(S)):
    if S[i]!=T[i]:count+=1

print(count)

Submission status: Accepted

Solution code:
s = input()
t = input()
ans = 0
for a, b in zip(s, t):
    if a != b:
        ans += 1
print(ans)

Submission status: Accepted

Solution code:
s = input()
t = input()

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

print(counter)

Submission status: Accepted

Solution code:
from sys import stdin

a = stdin.readline().rstrip()
b = stdin.readline().rstrip()

cnt = 0
for c1,c2 in zip(a, b):
  if c1 != c2:
    cnt += 1

print(cnt)

Submission status: Accepted

Solution code:
S = str(input())
T = str(input())

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

Submission status: Accepted

Solution code:
s=input()
t=input()
ka=0
for i in range(len(s)):
    if s[i]!=t[i]:
        ka=ka+1
    else:
        c=0
print(ka)

Submission status: Accepted

Solution code:
A = input()
B = input()
count_of_replace = 0
for i in range(len(A)):
  if not A[i] == B[i]:
    count_of_replace += 1
print(count_of_replace)

Submission status: Accepted

Solution code:
data=input()
mirror=input()
count=0
if data==mirror:
    print(0)
else:
    for i in range(len(data)):
        if data[i]!=mirror[i]:
            count=count+1

    print(count)

Submission status: Accepted

Solution code:
def main():
    S = input().rstrip()
    T = input().rstrip()
    
    c = 0
    for s, t in zip(S, T):
        if(s != t):
            c += 1
    print(c)
    
if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
strings = [input() for i in range(2)]

num = 0
for i in range(len(strings[0])):
  if strings[0][i] != strings[1][i]:
    num += 1
    
print(num)

Submission status: Accepted

Solution code:
s = [i for i in input()]
t = [j for j in input()]
x = 0
for i in range(0, len(s)):
    if s[i] != t[i]:
        x += 1
print(x)

Submission status: Accepted

Solution code:
s = list(input())
t = list(input())

n = sum(1 for a, b in zip(s, t) if a != b)
print(n)

Submission status: Accepted

Solution code:
S = str(input())
T = str(input())
a = 0
b = len(T)

if  (1 <=  len(S) <= 2*10**5) and (1 <= len(T) <= 2*10**5) and len(S) == len(T):
    for i in range(b):
        if S[i] != T[i]:
            a += 1
print(a)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

S = input().strip()
T = input().strip()
#-----

cnt = 0

for i,char in enumerate(S):
    if char != T[i]:
        cnt += 1

print(cnt)

Submission status: Accepted

Solution code:
s = list(input())
t = list(input())
Ans = 0
for i in range (len(s)):
    if s[i] != t[i]:
        Ans = Ans + 1
print(Ans)

Submission status: Accepted

Solution code:
s = list(input())
t = list(input())
count = 0
for i in range(len(s)):
    if s[i] == t[i]:
        continue
    else:
        count += 1
print(count)

Submission status: Accepted

Solution code:
S = input()
T = input()

if S == T:
  print(0)
else:
  ans = 0

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

Submission status: Accepted

Solution code:
S = input()
T = input()

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

Submission status: Accepted

Solution code:
s=input()
t=input()
ans=0

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

Submission status: Accepted

Solution code:
S = input()
T = input()
c = 0
for i in range(len(S)):
    if S[i] != T[i]:
        c += 1
print(c)

Submission status: Accepted

Solution code:
s = input()
t = input()
sz = len(s)
change_count = 0
for i in range(sz):
  if s[i]!=t[i]:	change_count+=1
print(change_count)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()
t = input()
k = 0
for i in range(0, len(s)):
  if s[i] != t[i]:
    k += 1
    
print(k)

Submission status: Accepted

Solution code:
s = input()
t = input()
print(sum(1 for a, b in zip(s, t) if a != b))

Submission status: Accepted

Solution code:
s=input()
t=input()
ans=0

for n in range(len(s)):
  if s[n]==t[n]:
    ans+=0
  else:
    ans+=1

print(ans)

Submission status: Accepted

Solution code:
s = input()
t = input()
cnt = 0
for i in range(len(s)):
    if not s[i]==t[i]:
        cnt += 1
print(cnt)

Submission status: Accepted

Solution code:
s = input()
t = input()
result = 0
con1 = len(s) >= 1 and len(s) <= 200000
con2 = len(t) >= 1 and len(t) <= 200000
if con1 == True and con2 == True and len(s) == len(t):
    for i in range (0, len(s)):
        if s[i] != t[i]:
            result = result + 1
        else:
            continue
    print(result)
else:
    print()

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
S=input()
T=input()
c=0
for i in range(len(S)):
    if S[i] != T[i]:
        c+=1
print(c)

Submission status: Accepted

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

print(cnt)

Submission status: Accepted

Solution code:
def A(x):
  return x + x**2 + x**3


def B(s, t):
  ans = 0
  for i in range(len(s)):
    if s[i] != t[i]:
      ans += 1
  return ans


def C(N):
  pass


def main():
  s = input()
  t = input()
  print(B(s, t))
  # letter = input()
  # A(letter)
  # for x in ['A', 'Z', 'a', 'z']:
  #   A(x)


if __name__ == '__main__':
  main()

Submission status: Accepted

Solution code:
S=input()
T=input()
c=0
for i in range(len(S)):
	if S[i]!=T[i]:c+=1
print(c)

Submission status: Accepted

Solution code:
str1=str(input())

str2=str(input())

count=0

for i in range(0,len(str1)):
  if str1[i]!=str2[i]:
    count+=1
    
    
print(count)

Submission status: Accepted

Solution code:
x = input()
y = input()
xx = list(x)
yy = list(y)
s = 0
for nn in range(len(xx)):
     if xx[nn] != yy[nn]:
         s += 1
print(s)

Submission status: Accepted

Solution code:
s=list(input())
t=list(input())

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

Submission status: Accepted

Solution code:
s=input()
t=input()

l=len(s)

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

print(ans)

Submission status: Accepted

Solution code:
S = input()
T = input()
a = 0

for i, word in enumerate(S):
    if word == T[i]:
        pass
    else:
        a += 1
print(a)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()
T = input()

ans = 0
if len(S) > 0:
  for i in range(len(S)):
    if not S[i] == T[i]:
      ans += 1   
print(ans)

Submission status: Accepted

Solution code:
start = input()
target = input()


cnt = 0
for i in range(len(start)):
    if start[i] != target[i]:
        cnt += 1


print(cnt)

Submission status: Accepted

Solution code:
S = input()
T = input()

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

Submission status: Accepted

Solution code:
s = input()
t = input()

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

Submission status: Accepted

Solution code:
S = input()
T = input()
n=0
for s, t in zip(S, T):
    if s!=t:
        n+=1
print(n)

Submission status: Accepted

Solution code:
S = input()
T = input()

ret = 0

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

Submission status: Accepted

Solution code:
S = input()
T = input()
L = len(S)
S_split = list(S)
T_split = list(T)
count = 0
for i in range(L):
    if S_split[i] !=T_split[i]:
        count += 1

print(count)

Submission status: Accepted

Solution code:
a = str(input())
b = str(input())

i = 0
for j in range(len(a)):
    if a[j] != b[j]:
        i += 1

print(i)

Submission status: Accepted

Solution code:
mod = 1000000007
eps = 10**-9


def main():
    import sys
    input = sys.stdin.readline

    S = input().rstrip('\n')
    T = input().rstrip('\n')
    ans = 0
    for s, t in zip(S, T):
        if s != t:
            ans += 1
    print(ans)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
s=input()
t=input()

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

print(x)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = input()
m = input()

n = list(n)
m = list(m)
count = 0
for i in range(len(n)):
    if n[i] != m[i]:
        count+=1

print(count)

Submission status: Accepted

Solution code:
s=input()
t=input()
n=len(s)
cnt=0
for i in range(n):
    if not(s[i]==t[i]):
        cnt+=1        
    else:
        cnt=cnt 
print(cnt)

Submission status: Accepted

Solution code:
S_list = list(input())
T_list = list(input())
cnt = 0



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

print(cnt)

Submission status: Accepted

Solution code:
s = str(input())
t = str(input())
count=0
for i in range(len(s)):
  if s[i] != t[i]:
    count+=1
print(count)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Sat Jun 27 21:02:04 2020

@author: naoki
"""

S = input()
T = input()

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

Submission status: Accepted

Solution code:
S = input()
T = input()
i = 0
c = 0
X = len(S)
while i < X:
    if T[i] != S[i]:
        c += 1
    i += 1
print(c)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=input()
t=input()
c=0
for i in range(0,len(s)):
    if s[i]==t[i]:
        c+=0
    else:
        c+=1
print(c)

Submission status: Accepted

Solution code:
a = list(input())
b = list(input())
total = 0
for i in range(len(a)):
  if a[i] != b[i]:
    total += 1

print(total)

Submission status: Accepted

Solution code:
s=input()
s1=input()
c=0;
for i in range(len(s1)):
  if(s1[i]!=s[i]):
    c+=1;
print(c)

Submission status: Accepted

Solution code:
S = input()
T = input()
L = len(S)
a = [0]*L
for i in range(L):
    if S[i] != T[i]:
        a[i] = 1
print(sum(a))

Submission status: Accepted

Solution code:
S=input()
T=input()
v=0
for i in range(len(S)):
    if S[i]!=T[i]:
        v+=1
    else:
        pass
print(v)

Submission status: Accepted

Solution code:
S= input()
T = input()

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

print(ans)

Submission status: Accepted

Solution code:
s=input()
t=input()
x=0
for i in range(len(s)):
    if s[i]!=t[i]:
        x+=1
print(x)

Submission status: Accepted

Solution code:
S = input()
T = input()

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

Submission status: Accepted

Solution code:
S = str(input())
T = str(input())

ans = 0

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

print(ans)

Submission status: Accepted

Solution code:

a = input()
b = input()

ans = 0
for i, v in enumerate(a):
    if a[i] != b[i]:
        ans += 1
print(ans)

Submission status: Accepted

Solution code:
S = input()
T = input()
kaisu = 0
for i,c in enumerate(S):
    if c!=T[i]:
        kaisu += 1
print(kaisu)

Submission status: Accepted

Solution code:
s = input()
t = input()

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

Submission status: Accepted

Solution code:
S, T = [list(input()) for i in range(2)]
ans = 0
for s, t in zip(S, T):
    if s != t:
        ans += 1
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()
T = input()
c = 0
for i,s in  enumerate(S):
    if s != T[i]:
        c += 1
print(c)

Submission status: Accepted

Solution code:
S=input()
T=input()
N=len(S)
s=list(S)
t=list(T)
count=0

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

Submission status: Accepted

Solution code:

def calculate(S, T):
	count = 0
	for i in range(len(S)):
		if S[i] != T[i]:
			count += 1
	return count
			

S = input()
T = input()

S = list(S)
T = list(T)

print(calculate(S, T))

Submission status: Accepted

Solution code:
s = input();
t = input();
c = 0;
for i in range(len(s)):
  if(s[i]!=t[i]):
    c+=1;
print(c);

Submission status: Accepted

Solution code:
S = str(input())
T = str(input())

cnt = 0
if S == T:
    print(cnt)
    exit()

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

Submission status: Accepted

Solution code:
s=input()
t=input()
k=0
for i in range(len(s)):
     if s[i]!=t[i]:
         k=k+1
print(k)

Submission status: Accepted

Solution code:
s1 = input()
s2 = input()
count = 0
for i in range(len(s1)):
    if s1[i] != s2[i]:
        count += 1
print(count)

Submission status: Accepted

Solution code:
s = str(input())
t = str(input())
count = 0
for i in range(len(s)):
    if s[i] != t[i]:
        count += 1
        
print(count)

Submission status: Accepted

Solution code:
def change(s,t):
  n = len(s)
  count=0
  for i in range(n):
    if s[i]!=t[i]:
      count+=1
      
  return count	

s = input()
t = input()
print(change(s,t))

Submission status: Accepted

Solution code:
S = input()
T = input()
count = 0
for i in range(len(S)):
    if T[i] != S[i]:
        count += 1
    else:
        pass
print(count)

Submission status: Accepted

Solution code:
import sys

a = sys.stdin.readline().strip()
b = sys.stdin.readline().strip()

# assert len(a) == len(b)
ans = sum(1 for c, d in zip(a, b) if c != d)
print(ans)

Submission status: Accepted

Solution code:
"""
AtCoder :: Beginner Contest 172 :: B :: Minor Change
https://atcoder.jp/contests/abc172/tasks/abc172_b
"""
import sys


def solve(S, T):
    """Solve puzzle."""
    return sum(s != t for s, t in zip(S,T))


def main():
    """Main program."""
    S = sys.stdin.readline().strip()
    T = sys.stdin.readline().strip()
    print(solve(S, T))


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
S = input()
T = input()
count = 0
for (s, t) in zip(S, T):
    if(s != t):
        count += 1
print(count)

Submission status: Accepted

Solution code:
S = input()
T = input()
f = 0

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

print(f)

Submission status: Accepted

Solution code:
S = [str(x) for x in list(input())]
T = [str(x) for x in list(input())]
num = 0
for i in range(len(S)):
  if(S[i] != T[i]):
    num += 1
print(num)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()
T = input()
ans = 0
slen = len(S)

for i in range(int(slen)):
    if S[i] == T[i]:
        pass
    else:
        ans += 1
  
print(ans)

Submission status: Accepted

Solution code:
S = input()
T = input()

count = 0
for i in range(len(S)):
    if S[i] != T[i]:
        count += 1

print(count)

Submission status: Accepted

Solution code:
def main():
    s = input()
    t = input()
    count = 0
    for i in range(len(s)):
        if s[i] != t[i]:
            count += 1
    print(count)


main()

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

s = list(str(input()))
t = list(str(input()))

cnt = 0

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

print(cnt)

Submission status: Accepted

Solution code:
import sys 
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
S = readline().decode().rstrip()
T = readline().decode().rstrip()
count = 0
for i in range(len(S)):
    if S[i] != T[i]:
        count+=1
print(count)

Submission status: Accepted

Solution code:
S=list(map(str,input()))
T=list(map(str,input()))
cnt=0
for i in range(len(S)):
  #print(S[i],T[i])
  if S[i]!=T[i]:
    cnt=cnt+1
print(cnt)

Submission status: Accepted

Solution code:
S = input()
T = input()
count = 0
for i in range(len(S)):
  if S[i]!=T[i]:
    count += 1
print(count)

Submission status: Accepted

Solution code:
def resolve():
    s = list(input())
    t = list(input())
    count = 0
    for i in range(len(s)):
        if s[i] != t[i]:
            count = count+1
    print(count)
resolve()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = [input() for l in range(0,2)]

a1 = a[0]
a2 = a[1]

s = 0
for i in range(0,len(a1)):
    if a1[i] != a2[i]:
        s = s+1
print(s)

Submission status: Accepted

Solution code:
s = input()
t = input()
cnt = 0
for i in range(len(s)):
  if s[i] == t[i]:
    continue
  else:
    cnt += 1
print(cnt)

Submission status: Accepted

Solution code:
a = list(input())
b = list(input())

count = 0
change = 0

for i in range(len(a)):
    if a[count] == b[count]:
        count += 1
    else:
        change += 1
        count += 1
    
print(change)

Submission status: Accepted

Solution code:
s = str(input())
t = str(input())
ans = 0
for i in range(len(s)):

    if s[i] != t[i]:
        ans += 1


print(ans)

Submission status: Accepted

Solution code:
s = list(input())
t = list(input())
cnt = 0
for i, char in enumerate(s):
    if char != t[i]:
        cnt += 1
print(cnt)

Submission status: Accepted

Solution code:
S=list(map(str,input()))
T=list(map(str,input()))
ans=0
for i in range(len(S)):
    if S[i]!=T[i]:
        ans+=1
print(ans)

Submission status: Accepted

Solution code:
a= input()
b= input()
result=0

for i in range(len(a)):
    if a[i]!=b[i]:
        result=result+1

print(result)

Submission status: Accepted

Solution code:
# import sys
# sys.setrecursionlimit(10 ** 6)
# import bisect
# from collections import deque
# from decorator import stop_watch
#
#
# @stop_watch
def solve(S, T):
    ans = 0
    for i in range(len(S)):
        if S[i] != T[i]:
            ans += 1
    print(ans)


if __name__ == '__main__':
    S = input()
    T = input()
    # N = int(input())
    # N, M = map(int, input().split())
    # As = [int(i) for i in input().split()]
    # Bs = [int(i) for i in input().split()]
    solve(S, T)

Submission status: Accepted

Solution code:
S=input()
T=input()
cc=0
for i in range(len(S)):
    cc+=int(S[i]!=T[i])

print(cc)

Submission status: Accepted

Solution code:
S = input()
T = input()
c = 0

for i in range(len(S)):
  if S[i] != T[i]:
    c += 1
else:
  print(c)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import numpy as np

s, t = map(list, open(0).read().split())
print(np.sum(~(np.array(s) == np.array(t))))

Submission status: Accepted

Solution code:
S = input()
T = input()
count = 0
for i in range(0,len(S)):
    if S[i] == T[i] :
        continue
    else :
        count += 1
print(count)

Submission status: Accepted

Solution code:
import logging

logging.basicConfig(level=logging.INFO)
logging.info('info')


def main():
    S = input()
    T = input()
    logging.info("hello")

    counter = 0

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

    print(counter)

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
s = input()
t = input()
count = 0
for k in range(len(s)):
  if s[k] != t[k]:
    count += 1
    
print(count)

Submission status: Accepted

Solution code:
s = input()
t = input()
r = 0
for i in range(len(s)):
    if s[i] != t[i]:
        r += 1
print(r)

Submission status: Accepted

Solution code:
s = input()
t = input()

count = 0

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

print(count)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import numpy as np
S = input()
T = input()

a = [1 if S[i]!=T[i] else 0 for i in range(len(S))]
print(np.sum(a))

Submission status: Accepted

Solution code:
s=input()
t=input()
n=0
for i in range(len(t)):
  if s[i]!=t[i]:
    n+=1
print(n)

Submission status: Accepted

Solution code:
S = input()
T = input()

cnt = 0
for i in range(len(S)):
    if S[i] != T[i]:
        cnt += 1

print(cnt)

Submission status: Accepted

Solution code:
s = input()
t = input()

count = 0

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

print(count)

Submission status: Accepted

Solution code:
S = str(input())
T = str(input())

postion = 0
ansewr = 0

for i in S:
    if i != T[postion]:
        ansewr += 1
        
    postion += 1

print(ansewr)

Submission status: Accepted

Solution code:
ans = 0
for (s_i,t_i) in zip(input(),input()):
	if s_i != t_i:
		ans += 1
print(ans)

Submission status: Accepted

Solution code:
import difflib

a = input()
b = input()

count = 0
for i in range(len(a)):
    if a[i]!=b[i]:
        count += 1

print(count)

Submission status: Accepted

Solution code:
s = input()
t = input()
cnt = 0
for ss, ts in zip(s,t):
    if ss != ts:
        cnt += 1
print(cnt)

Submission status: Accepted

Solution code:
S = list(input())
T = list(input())
result = 0
for i in range(len(S)):
    if S[i] != T[i]:
        result += 1
    else:
        pass
print(result)

Submission status: Accepted

Solution code:
s = str(input())
t = str(input())

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

Submission status: Accepted

Solution code:
s = input()
t = input()

ans = 0
for (i,j) in zip(s,t):
  if i != j:
    ans += 1
print(ans)

Submission status: Accepted

Solution code:
S = str(input())
T = str(input())

cnt = 0
for i in range(len(S)):
    if S[i] != T[i]:
        cnt += 1
        
print(cnt)

Submission status: Accepted

Solution code:
s = str(input())
t = str(input())
count = 0
for i in range(len(s)):
    if s[i] != t[i]:
        count += 1
print(count)

Submission status: Accepted

Solution code:
s = input()
t = input()
cnt=0
for p,q in zip(s,t):
    if p != q:
        cnt+=1
print(cnt)

Submission status: Accepted

Solution code:
s=input()
t=input()
a=[0]*91
ans=0
b=[0]*91
for i in range(0,len(s)):
    if s[i]!=t[i]:
        ans+=1
print(ans)

Submission status: Accepted

Solution code:
S=list(input())
T=list(input())
n=len(S)
ans=0
for i in range(n):
  if S[i]!=T[i]:
    ans+=1
print(ans)

Submission status: Accepted

Solution code:
s=list(input())
t=list(input())

c=0

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

print(c)

Submission status: Accepted

Solution code:
s = str(input())
t = str(input())

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


print(ans)

Submission status: Accepted

Solution code:
s = input()
t = input()
ans = 0

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

print(ans)

Submission status: Accepted

Solution code:
S=str(input())
T=str(input())
       
ans = 0

for i in range(len(S)):
  if S[i]==T[i]:
    pass
  else:
    ans+=1
    
print(ans)

Submission status: Accepted

Solution code:

s = input()
t = input()
ct = 0

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

Submission status: Accepted

Solution code:

s = input()
t = input()

cnt = 0

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

print(cnt)

Submission status: Accepted

Solution code:
s=input()
t=input()
m=0
for i in range(len(s)):
    if s[i] != t[i]:
        m=m+1
print(m)

Submission status: Accepted

Solution code:
s = input()
t = input()

ans = 0

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()
T = input()
count = 0
for (s,t) in zip(S,T):
    if s != t:
        # t = s
        count += 1

print(count)

Submission status: Accepted

Solution code:
S=list(input())
T=list(input())
ans=0

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

print(ans)

Submission status: Accepted

Solution code:
S=input()
T=input()
N=len(S)
ans=0

for n in range(N):
    if S[n]!=T[n]:
        ans+=1

print(ans)

Submission status: Accepted

Solution code:
str1 = input()
str2 = input()
cnt = 0

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

print(cnt)

Submission status: Accepted

Solution code:
str1 = input()
str2 = input()

ans = 0
for i, j in zip(str1, str2):
  if i != j:
    ans += 1
    
print(ans)

Submission status: Accepted

Solution code:
s = input().rstrip()
t = input().rstrip()

ans = 0

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

print(ans)

Submission status: Accepted

Solution code:
s = input()
t = input()

ans = 0
for i, c in enumerate(s):
    if c != t[i]:
        ans += 1

print(ans)

Submission status: Accepted

Solution code:
S = list(input())
T = list(input())
count = 0
for i in range(len(S)):
    if S[i] != T[i]:
        S[i] = T[i]
        count += 1
print(count)

Submission status: Accepted

Solution code:
s = input()
t = input()
cnt = 0
for si, ti in zip(s,t):
    if si != ti:
        cnt += 1
print(cnt)

Submission status: Accepted

Solution code:
s  = input()
t = input()
count = 0
for i in range(len(s)):
    if s[i] != t[i]:
        count += 1
print(count)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#dt = {} for i in x: dt[i] = dt.get(i,0)+1
import sys;input = sys.stdin.readline
inp,ip = lambda :int(input()),lambda :[int(w) for w in input().split()]

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

Submission status: Accepted

Solution code:
S = input()
T = input()

N = len(S)

count = 0
for i in range(N):
  if S[i] != T[i]:
    count = count + 1
  else:
    None
    
print(count)

Submission status: Accepted

Solution code:
s=input()
t=input()

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

print(count)

Submission status: Accepted

Solution code:
S=input()
T=input()

n=len(S)
for i in range(n):
  if S[i]==T[i]:
    n-=1
print(n)

Submission status: Accepted

Solution code:
#-*-coding:utf-8-*-

import sys

def main():
    s = input()
    t = input()
    counter=0

    for a,b in zip(s,t):
        if a!=b:
            counter+=1
    print(counter)

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
S = input()
T = input()
count = 0
for i in range(len(S)):
  if S[i] != T[i]:
    count += 1
print(count)

Submission status: Accepted

Solution code:
s = input()
t = input()
ans = 0

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

Submission status: Accepted

Solution code:
def main():
    S = str(input())
    T = str(input())
    cnt = 0
    for i in range(len(S)):
        if S[i] != T[i]:
            cnt += 1
    print(cnt)
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
S = str(input())
T = str(input())

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

Submission status: Accepted

Solution code:
s = input()
t = input()
s = list(s)
t = list(t)

count = 0
for a1, a2 in zip(s,t):
    if a1 != a2:
        count += 1

print(count)

Submission status: Accepted

Solution code:
def replacing(S,T):
  count=0
  for i in range(len(S)):
    if S[i]!=T[i]:
      count+=1
  return count
S=input()
T=input()
print(replacing(S,T))

Submission status: Accepted

Solution code:
S = input()
T = input()

diff = 0
for i in range(len(S)):
    diff += (S[i] != T[i])

print(diff)

Submission status: Accepted

Solution code:
s = input()
t = input()
n = len(s)
count = 0

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

print(count)

Submission status: Accepted

Solution code:
S=raw_input()
T=raw_input()
res=0
for i in xrange(len(S)):
  if T[i]!=S[i]:
    res+=1
print res

Submission status: Accepted

Solution code:
s = input()
t = input()
count=0
for i in range(len(s)):
    if s[i]!=t[i]:
        count+=1
        
print(count)

Submission status: Accepted

Solution code:
import sys,copy,bisect,itertools,heapq,math
from heapq import heappop,heappush,heapify
from collections import Counter,defaultdict

s = list(input())
t = list(input())
c = 0
for i in range(len(s)):
    if s[i] != t[i]:
        c+=1

print(c)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S=input()
T=input()
cnt=0
for s,t in zip(S,T):
    if s!=t:
        cnt+=1
print(cnt)

Submission status: Accepted

Solution code:
def edit_distance(S, T):

    NS = len(S)
    NT = len(T)

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

    return ans

S = input().rstrip()
T = input().rstrip()

print(edit_distance(S, T))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()
t = input()
ans = 0
if s == t:
	print(0)
else:
	for index,ss in enumerate(s):
		if t[index] != ss:
			ans += 1
	print(ans)