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 = list(input())
T = list(input())
 
l = len(S)
count = 0
for i in range(l):
    if S[i] != T[i]:
        count += 1
 
print(count)

Submission status: Accepted

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

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

print(count)

Submission status: Accepted

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

cnt=0

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

print(cnt)

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をtに変更
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()
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 x in range(len(s)):
    if s[x]!=t[x]:
        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()
counter = 0
for i in range(len(S)):
    if S[i] != T[i]:
        counter += 1
print(counter)

Submission status: Accepted

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

for i, c in enumerate(S):
  if (c != T[i]):
    count += 1
print(count)

Submission status: Accepted

Solution code:
S, T = [input() for _ in range(2)]
count = 0
for i, j in zip(S, T):
    count += i != j
print(count)

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:
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:
#B - Minor Change
S = str(input())
T = str(input())
i = 0
j = 0
k = len(S)
for j in range(k):
    if S[j] != T[j]:
        i += 1
# 出力
print(i)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()
g = input()
m = 0
n = len(s)
if s == g:
    m = 0
else:
    for i in range(n):
        if s[i] == g[i]:
            continue
        else:
            m += 1

print(m)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

ans = abs(len(s) - len(t))
count = min(len(s), len(t))

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

Submission status: Accepted

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

Submission status: Accepted

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

ans = 0
for i, sv in enumerate(s):
    if sv != 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()

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

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

cnt=0
i=0

while i<len(s):
  if s[i]!=t[i]:
    cnt=cnt+1
  i=i+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=list(input())
T=list(input())
total = 0
for i in range(len(S)):
    if S[i] == T[i]:
        continue
    else:
        total += 1
print(str(total))

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()
print(sum([1 for i in range(len(S)) if S[i] != T[i]]))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()
t = input()
res = 0
for i, j in zip(s, t):
    if i != j:
        res += 1
print(res)

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 = str(input())
t = str(input())
l = len(s)
cnt = 0

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

print(cnt)

Submission status: Accepted

Solution code:
S = input()
T = input()
if S == T:
  print(0)
  exit(0)
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()
S_list=list(S)
T_list=list(T)
N=len(S_list)
count=0
for i in range(N):
    if S_list[i]!=T_list[i]:
        count=count+1
print(count)

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:
#ABC172-B
S = str(input())
T = str(input())
L = int(len(T))
for i in range(L):
  if S[i] == T[i]:
    L -= 1
print(L)

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)
ans=0
for i in range(l):
  if s[i]==t[i]:
    ans+=1
print(l-ans)

Submission status: Accepted

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

i = 0
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)
SUM=0
for i in range(n):
    if S[i]!=T[i]:
        SUM+=1
print(SUM)

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 = input()
t = input()

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

Submission status: Accepted

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

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()
a=0
for x,y in zip(s, t):
  if x != y:
    a+=1
print(a)

Submission status: Accepted

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

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

print(counter)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def Qb():
    s, t = open(0).read().splitlines()
    r = sum([s != t for s, t in zip(s, t)])
    print(r)



if __name__ == '__main__':
    Qb()

Submission status: Accepted

Solution code:
A_word = str(input().rstrip())
B_word=  str(input().rstrip())

counter=0
for i in range(len(A_word)):
    if A_word[i]!=B_word[i]:
        counter+=1
print(counter)

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 = list(input())
t = list(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:
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:
a = list(input())
b = list(input())
count = 0

for i in range(len(a)):
  if not a[i] == b[i]:
    b[i] = a[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)    

if __name__ == "__main__":
    main()

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

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 c, d in zip(s, t):
  if c != d:
    ans += 1
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 += 1
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S=input()
T=input()
print(sum(x!=y for x,y in zip(S,T)))

Submission status: Accepted

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

    l = len(S)
    cnt = 0

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

    print(cnt)


if __name__ == "__main__":
    main()

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(len(S)-count)

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=list(input())
t=list(input())
ans=0
for i in range(len(s)):
  if s[i]==t[i]:
    continue
  else:
    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:
    count += 1
    
print(count)

Submission status: Accepted

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

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

Submission status: Accepted

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

count = 0

for i,w in enumerate(S):
  if S[i] != T[i]: count += 1
print(count)

Submission status: Accepted

Solution code:
s = input()
a = [str(c) for c in s]
t = input()
b = [str(c) for c in t]

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

print(n-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:
S = input()
T = input()
ans = 0
for i in range(len(S)):
  if(S[i] != T[i]):
    ans += 1
print(str(ans))

Submission status: Accepted

Solution code:
s = input()
S1 = list(s)
T = list(input())

cnt =0
for i in range(len(s)):
    if S1[i] != T[i]:
        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 = 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 = input()
t = input()
print(sum([1 for a,b in zip(list(s), list(t)) if a != b]))

Submission status: Accepted

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

stringlen = len(S)
cnt = 0

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

print(cnt)

Submission status: Accepted

Solution code:
N=list(input())
M=list(input())
ans=0
number=len(N)
for i in range(number):
    if N[i]==M[i]:
        ans+=1
print(number-ans)

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
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())
flag = 0
for i in range(len(s)):
    if s[i]  != t[i]:
        flag += 1

print(flag)

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())
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 = cnt
	else:
		cnt += 1
print(cnt)

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 = list(input().strip())
T = list(input().strip())

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

# S_r = ''.join(list(reversed(S)))
cont = 0

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

print(len(s)-cont)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()
t = input()
o = []
for i in range(len(s)):
  if s[i] != t[i]:
    o.append(s[i])
print(len(o))

Submission status: Accepted

Solution code:
s = input()
t = input()
print(sum(True for x, y in zip(s, t) if x != y))

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 = count + 1

print(count)

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 solve():
  ans = 0
  S = input()
  T = input()
  for i in range(len(S)):
    if S[i]!=T[i]:
      ans += 1
  return ans
print(solve())

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a=input()
b=input()
k,i=0,0
while i<len(a) :
  if a[i]!=b[i] :
    k+=1
  i+=1
print(k)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
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()

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()
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()
result=0
for i in range(len(s)):
    result+=(s[i]!=t[i])
print(result)

Submission status: Accepted

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

    cnt = 0
    for a, b in zip(S, T):
        cnt += a != b
    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:
# Code for B - Minor Change
# Use input() to fetch data from STDIN

s: str = input()
t: str = input()
ans: int = 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,w in enumerate(s):
    if w != t[i]:
        count += 1

print(count)

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(t)):
  if s[i] == t[i]:
    continue
  else:
    count += 1
print(count)

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()
d = input()

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

Submission status: Accepted

Solution code:
s=list(input())
t=list(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 = list(input())
T = list(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()
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()
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()

sl = list(s)
tl = list(t)

count = 0

for (a, b) in zip(sl, tl):
  if a!=b:
    count+=1
    
print(count)

Submission status: Accepted

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