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:
s1=input()
s2=input()

print(sum([a1!=a2 for a1,a2 in zip(s1,s2)]))

Submission status: Accepted

Solution code:
import sys

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

S, T = read().split()

x = sum(s != t for s, t in zip(S, T))
print(x)

Submission status: Accepted

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

print(k)

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 collections
# c = collections.Counter()
#import itertools as it
#import math
#import numpy as np
#import sys 
#sys.exit()
 
s = input()
t = input()
 
#k = int(input())
#a, b  = map(int, input().split())
'''
#  = list(map(int, input().split()))
'''
'''
n = input()
a = [int(input()) for i in range(n)]
'''
'''
n,m = map(int, input().split())
a = [list(map(int, input().split())) for _ in range(m)]
'''

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

Submission status: Accepted

Solution code:
S=input()
T=input()
count=list(range(0,len(S)))
c=0

for i in count:
    if S[i] != T[i]:
        c+=1
    else:
        continue
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
    i+=1
print(count)

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

print(p)

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()
i=0
count=0

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline

S = input()
T = input()

SL = list(S)
TL = list(T)

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

print(diffcnt)

Submission status: Accepted

Solution code:
a=str(input())
b=str(input())
count =0
for c1,c2 in zip(a, b):
   if c1 != c2:
    count += 1

print(str(count))

Submission status: Accepted

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

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

Submission status: Accepted

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

l=len(slist)
res=0

for i in range(0,l):
  if(slist[i]!=tlist[i]):
    res+=1

print(res)

Submission status: Accepted

Solution code:
def main():

	nbOperation = 0

	sentenceS = list(input())
	sentenceToT = input()

	for i in range(len(sentenceS)):
		if sentenceS[i] != sentenceToT[i]:
			
			sentenceS[i] = sentenceToT[i]
			nbOperation += 1
			

	print(nbOperation)

main()

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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


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

Submission status: Accepted

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

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

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()
a = 0
for i in range (0, len(S)):
    if S[i] == T[i]:
        a = a
    else:
        a = a + 1
print (a)

Submission status: Accepted

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

num = 0
for i, s in enumerate(a, 0):
    if b[i : i + 1] != s:
        num += 1

print(num)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
string = input()
string2 = input()
count = 0

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()
T = input()
count = 0
 
for idx in range(len(S)):
     
    if S[idx] != T[idx]:
        count = 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]:
        s[i] == t[i]
        count += 1

print(count)

Submission status: Accepted

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

for a, b in enumerate(s):
    if t[a] != b:
        c += 1
        
print(c)

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:
first_str = list(input())
anwser_str = list(input())
cnt = 0
for i in range(len(first_str)):
    if first_str[i] != anwser_str[i]:
        first_str[i] = anwser_str[i]
        cnt += 1
print(cnt)

Submission status: Accepted

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

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

    '''
ababcvcvv
ababababf
    '''

ABC172_B()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#Minor Change
s = list(input())
t = list(input())

count = 0

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

print(count)

Submission status: Accepted

Solution code:
# coding:utf-8
s = list(input())
t = list(input())

if s == t:
    print(0)
else:
    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(T)):
    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 = list(input())
T = list(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()

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

Submission status: Accepted

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

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

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

print( count)

Submission status: Accepted

Solution code:
import sys
data = sys.stdin


conversion_data = []
for l in data:
    conversion_data.append(l.split())
    
S = list(conversion_data[0][0])
T = list(conversion_data[1][0])

cnt = 0
min = 0
for i in S:
  if i != T[cnt]:
    min += 1
  cnt += 1
  

print(min)

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

Submission status: Accepted

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

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:
#!python3

# input
S = input()
T = input()


def main():
    ans = sum([1 for s, t in zip(S, T) if s != t])
    print(ans)


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import numpy as np

s = input()
t = input()

li_s = np.array(list(s))
li_t = np.array(list(t))

diff = li_s != li_t
res = np.sum(diff)

print(res)

Submission status: Accepted

Solution code:
a = input()
b = input()
c = 0
d = 0

for i in a:
    if b[c] != i:
        d = d+1
        c=c+1
    else:
        c=c+1

print(d)

Submission status: Accepted

Solution code:

line1 = input()
line2 = input()

count = 0

line3 = list(line1)
line4 = list(line2)

len_line3 = len(line3)

for i in range(len_line3):
  if line3[i] != line4[i]:
    count = count + 1

print(count)

Submission status: Accepted

Solution code:
s = []
t = []
s = input()
t = input()
u = 0

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

print(u)

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

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

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

print(a)

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

Submission status: Accepted

Solution code:
s=list(input())
t=list(input())
ans=len(s)
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
a, b = np.array(list(input())), np.array(list(input()))

print(sum(a!=b))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()
T = input()
index=[n for n in range(len(S)) if S[n]!=T[n]]
print(len(index))

Submission status: Accepted

Solution code:
from sys import stdin
import sys

s = stdin.readline().rstrip()
t = stdin.readline().rstrip()

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

Submission status: Accepted

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

Submission status: Accepted

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

def solve():
    if (s == t):
        print(0)
        return

    s_len = len(s)

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

    print(cnt)

solve()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin,stdout
s=input()
t=input()
print(sum([1 for ch,ch1 in zip(s,t) if ch!=ch1]))

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

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 = list(S)
T = list(T)


count = 0
for i,j in zip(S, T):
    if i != j:
        count += 1

print(count)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
# 整数の入力

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

    count = 0

    for i, ch in enumerate(list(t)):
        if ch != s[i]:
            count = count + 1
    
    print(count)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
S = list(str(input()))
T = list(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, T = list(str(input()).lower()), list(str(input()).lower())
res = 0
for i in range(0, len(S)):
    if S[i] != T[i]:
        res += 1
print(res)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    A = input()
    B = input()

    countor = 0

    for a, b in zip(A, B):
        if(a != b):
            countor = countor + 1

    print(countor)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
str_list = [input() for _ in range(2)]

count=0

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

print(count)

Submission status: Accepted

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

Submission status: Accepted

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

n = len(s)

count=0

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

Submission status: Accepted

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

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

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() for i in range(2)] 
a = s[0]
b = s[1]

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

Submission status: Accepted

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

Submission status: Accepted

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

print(con)

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

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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

print(str(dist))

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

Submission status: Accepted

Solution code:
S=input()
T=input()
count=0
if len(S) == len(T):
    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:
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():
  a=input()
  b=input()
  cnt=0
  for i in range(len(a)):
    if a[i]!=b[i]:
      cnt+=1
  return cnt

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

Submission status: Accepted

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

#diff=sum([1 for i in range(len(T)) if S[i]!=T[i]])
#print(diff)

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

Submission status: Accepted

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

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

l=0
for i in range(len(x)):
	if x[i]!=y[i]:
		l+=1
print(l)

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
s=input()
t=input()
count=0
if(s==t):
  print("0")
else:
  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())
result = 0

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


print(result)

Submission status: Accepted

Solution code:
inlist = [input() for i in range(2)]
stra = inlist[0]
strb = inlist[1]

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

print(count)

Submission status: Accepted

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

ans = 0

for s, t in zip(S, T):
    if s != t:
        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]):
        count += 1
    else:
        pass
    
print(count)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

print(len(s) - cnt)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

a = 0

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

print(a)

Submission status: Accepted

Solution code:
# x = list(map(int, input().split()))   :  int の リスト入力
# x, y = map(int, input().split())      :  それぞれの変数に　int 入力
# z = set(map(int, input().split()))    :
# t = int(input())                      :   

s = str(input())
t = str(input())
ans=0
l = len(s)
for i in (range(l)):
    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 = x + 1

print(x)

Submission status: Accepted

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

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

exit()

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:
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:
a1=input()
a=list(a1)
b1=input()
b=list(b1)
c=len(a)
d=0
e=0
for i in range(int(c)):
    if a[i]==b[i]:
        d=d+1
    else:
        e=e+1

print(e)

Submission status: Accepted

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

count = 0
for item in zip(s,t):
    if item[0] != item[1]:
        count += 1
print(count)

Submission status: Accepted

Solution code:
import sys

def I(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def main():
    s = input()
    t = 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 = input()
T = input()

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

Submission status: Accepted

Solution code:
import sys

def L(): return sys.stdin.readline().rstrip()
def I(): return int(sys.stdin.readline().rstrip())
def LI():return list(map(int,sys.stdin.readline().rstrip().split()))
def LS():return list(sys.stdin.readline().rstrip().split())

import collections

def solver(S,T):

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



def main():
    S = L()
    T = L()

    solver(S,T)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s,t=input(),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())
num = 0
for i in range(len(S)):
    if S[i] != T[i]:
        num += 1
print(num)

Submission status: Accepted

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

false = 0

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

Submission status: Accepted

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

count = 0

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

Submission status: Accepted

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

Submission status: Accepted

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

if S==T:
    print(0)
else:
    count=0
    for i1,s1 in enumerate(S):
        if T[i1]!=s1:
            count+=1
    print(count)

Submission status: Accepted

Solution code:
s, t = [input() for i in range(2)]
count = 0
for i in range(len(s)):
    if s[i] == t[i]:
        pass
    else:
        count = count + 1
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]:
    continue
  else:
    count+=1

print(count)

Submission status: Accepted

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

Submission status: Accepted

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

ans = 0

for i, s in enumerate(S):
    if s != 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]:
        count = count + 1
print(count)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
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=list(input())
t=list(input())

ans=0
b=len(s)

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

print(ans)

Submission status: Accepted

Solution code:
S = input()

T = input()
j = 0

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

print(j)

Submission status: Accepted

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

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 s_word, t_word in zip(S,T):
  if s_word != t_word:
    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 +=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:
import math

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

s = input()
t = input()
ans = solve(s,t)
print(ans)

Submission status: Accepted

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

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

print(count)

Submission status: Accepted

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

ans = 0

if S == T:
    ans = 0
else:
    for i, j in zip(S, T):
        if i != j:
            ans += 1

print(ans)

Submission status: Accepted

Solution code:
s = list(input())
t = list(input())
ans = 0
for i, e in enumerate(s):
    if e != 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 not s[i]==t[i]:
    ans+=1
print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import numpy as np
s = [input() for i in range(2)]
a=np.array(list(s[0]))
b=np.array(list(s[1]))

print(np.sum(a != b))

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

print(count)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S=input()
T=input()
print(len([ 1 for s,t in zip(list(S),list(T)) if s!=t ]))

Submission status: Accepted

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

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

print(count)