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

r = 0

for idx, ss in enumerate(s):
    if (ss != t[idx]):
        r = r + 1

print(r)

Submission status: Accepted

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

i = 0
count = 0

while i < len(S):
    if S[i] is not T[i]:
        count = count + 1
    i = i + 1

print(count)

Submission status: Accepted

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

Submission status: Accepted

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

if __name__ == "__main__":
    s = input()
    t = input()
    print(count(s,t))

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

print(len(list(filter(lambda i : S[i] != T[i], range(len(S))))))

Submission status: Accepted

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

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

x = 0
i = 0
while i < len(S):
    if S[i] != T[i]:
        x += 1
    i+=1

print(x)

Submission status: Accepted

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

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

print(cnt)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
S = input()
T = input()
A = [char for char in S]
B = [char for char in T]
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()

count = 0

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

print(count)

Submission status: Accepted

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

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

print(count)

Submission status: Accepted

Solution code:


def resolve():
    import sys
    input = sys.stdin.readline
    s = input().rstrip()
    t = input().rstrip()

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

    print(result)

if __name__ == "__main__":
    resolve()

Submission status: Accepted

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


if __name__=="__main__":
  main()

Submission status: Accepted

Solution code:
def resolve():
    ans = 0

    s = input()
    t = input()
    l = len(s)

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

    print(ans)


if __name__ == "__main__":
    resolve()

Submission status: Accepted

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

Sum = 0

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

Submission status: Accepted

Solution code:
# 2020/07/03
# AtCoder Beginner Contest 172 - B

# Input
s = input()
t = input()

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

# Output
print(cnt)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
from collections import defaultdict
readline = sys.stdin.buffer.readline
# sys.setrecursionlimit(10**8)


def geta(fn=lambda s: s.decode()):
    return map(fn, readline().split())


def gete(fn=lambda s: s.decode()):
    return fn(readline().rstrip())


def main():
    s, t = gete(), gete()

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

    print(ans)


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
if __name__ == "__main__":
    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:
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:
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 = 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()

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

print(o)

Submission status: Accepted

Solution code:
# vim: fileencoding=utf-8


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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
aaa=input()
bbb=input()
ll=len(aaa)
x=0
for i in range(ll):
    aa=aaa[i]
    bb=bbb[i]
    
    if aa!=bb:
        x+=1

print(x)

Submission status: Accepted

Solution code:
A = list(map(str,input()))
B = list(map(str,input()))
count = 0
for i in range(len(A)):
    if A[i]!=B[i]:
        count+=1

print(count)

Submission status: Accepted

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

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 count_diff(q,a):
    lst_q = list(q)
    lst_a = list(a)
    len_q = len(lst_q)
    ng = 0
    for i in range(len_q):
        if lst_q[i] != lst_a[i]:
            ng += 1
    print(ng)

q =input()
a =input()

count_diff(q,a)

Submission status: Accepted

Solution code:
s=input()
t=input()
ans=0
n=len(s)
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 += 0
    else:
        ans += 1
print(ans)

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:
a = str(input())
b = str(input())
c = 0
for i in range(len(a)):
  if a[i] == b[i]:
    c += 0
  else:
    c += 1
print(c)

Submission status: Accepted

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

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

Submission status: Accepted

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

x = list(filter(lambda i:s[i] != t[i], range(len(s)) ))

print(len(x))

Submission status: Accepted

Solution code:
import math

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:
a = input()
b = input()

l = list(a)
m = list(b)
# print(l, m)
k = 0
for i in range(len(l)):
    if (l[i] != m[i]):
        k += 1

print(k)

Submission status: Accepted

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

count = 0

for i, s in enumerate(S):
    if s == T[i]:
        pass
    else:
        count += 1

print(count)

Submission status: Accepted

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

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:
word1 = list(input())
word2 = list(input())
i = 0
for p, q in zip(word1, word2):
	if p!=q:
		i+=1
print(i)

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

Submission status: Accepted

Solution code:
s_string = input()
t_string = input()

num = 0

for s_char, t_char in zip(s_string, t_string):
    if s_char != t_char:
        num = num + 1

print(num)

Submission status: Accepted

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

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

Submission status: Accepted

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

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

print(count)

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(2147483647)
input=sys.stdin.readline

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

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

print(ans)

Submission status: Accepted

Solution code:
a=input()
b=input()
ans=0
for i in range(len(a)):
  if a[i]==b[i]:
    ans+=0
  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:
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
if s == t:
    print(ans)
else:
    for i in range(len(s)):
        if s[i] != t[i]:
            ans += 1
    print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

S_list = list(S)
T_list = list(T)

for i in range(len(S_list)):
    if S_list[i] != T_list[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()

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

out = 0
for i in range(len(s)):
    out += int(not s[i] == t[i])
print(out)

Submission status: Accepted

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

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

diff = 0

for t in range(len(T)):
  if T[t] is not S[t]:
    diff += 1

print(diff)

Submission status: Accepted

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

Submission status: Accepted

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

print(sum(np.array(list(S)) != np.array(list(T))))

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 = input()
T = input()
print(sum(1 for c1, c2 in zip(S, T) if c1 != c2))

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, T = (input() for _ 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 = input()
T = input()

count = 0

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


print(count)

Submission status: Accepted

Solution code:
# https://atcoder.jp/contests/abc172/tasks/abc172_b


def compare(S, T):
    s = t = 0
    changes = 0

    while s < len(S):
        if S[s] != T[t]:
            changes += 1
        s += 1
        t += 1

    return changes


S = input()
T = input()
print(compare(S, T))

Submission status: Accepted

Solution code:
ans = 0
x = input()
y = input()

for i in range(len(x)):
    if x == y:
        break
    else:
        if x[i] != y[i]:
            ans += 1
print(ans)

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:
from math import *
def main():
    
    s = input()
    t = input()
    ans=0
    for c in range(len(s)):
        if s[c] != t[c]:
            ans += 1
    print(ans)
main()

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
    else:
        pass
print(c)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
def input(): return sys.stdin.readline().strip()

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

Submission status: Accepted

Solution code:
def resolve():
    s=input()
    t=input()
    cnt=0
    for x,y in zip(s,t):
        if x!=y:
            cnt+=1
    print(cnt)
resolve()

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)):
    ans += (S[i] != T[i])
print(ans)

Submission status: Accepted

Solution code:
StrS = str(input())
StrT = str(input())
counter = 0

for x in range(len(StrS)):
	if StrS[x] == StrT[x]:
		counter = counter + 1
        
print(len(StrS)-counter)

Submission status: Accepted

Solution code:
S=input()
T=input()
d=int(len(S))
count = 0

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

Submission status: Accepted

Solution code:
s,t=map(str,open(0).read().split());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()
n = len(s)

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

if a == b:
  print(0)
  exit(0)

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

Submission status: Accepted

Solution code:
from collections import deque
from heapq import heapify,heappop,heappush,heappushpop
from copy import copy,deepcopy
from itertools import product,permutations,combinations,combinations_with_replacement
from collections import defaultdict,Counter
from bisect import bisect_left,bisect_right
from math import gcd,ceil,floor,factorial
# from fractions import gcd
from functools import reduce
from pprint import pprint
from statistics import mean,median,mode

INF = float("inf")

def mycol(data,col):
    return [ row[col] for row in data ]

def mysort(data,col,reverse_flag):
    data.sort(key=lambda x:x[col],reverse=reverse_flag)
    return data

def mymax(data):
    M = -1*float("inf")
    for i in range(len(data)):
        m = max(data[i])
        M = max(M,m)
    return M

def mymin(data):
    m = float("inf")
    for i in range(len(data)):
        M = min(data[i])
        m = min(m,M)
    return m

def mycount(ls,x):
    # lsはソート済みであること
    l = bisect_left(ls,x)
    r = bisect_right(ls,x)
    return (r-l)

def myoutput(ls,space=True):
    if space:
        if len(ls)==0:
            print(" ")
        elif type(ls[0])==str:
            print(" ".join(ls))
        elif type(ls[0])==int:
            print(" ".join(map(str,ls)))
        else:
            print("Output Error")
    else:
        if len(ls)==0:
            print("")
        elif type(ls[0])==str:
            print("".join(ls))
        elif type(ls[0])==int:
            print("".join(map(str,ls)))
        else:
            print("Output Error")

def I():
    return int(input())

def MI():
    return map(int,input().split())

def RI():
    return list(map(int,input().split()))

def CI(n):
    return [ int(input()) for _ in range(n) ]

def LI(n):
    return [ list(map(int,input().split())) for _ in range(n) ]

def S():
    return input()

def MS():
    return input().split()

def RS():
    return list(input().split())

def CS(n):
    return [ input() for _ in range(n) ]

def LS(n):
    return [ list(input().split()) for _ in range(n) ]

# ddict = defaultdict(lambda: 0)
# ddict = defaultdict(lambda: 1)
# ddict = defaultdict(lambda: int())
# ddict = defaultdict(lambda: list())
# ddict = defaultdict(lambda: float())

s = S()
t = S()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print(counts)

Submission status: Accepted

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

Submission status: Accepted

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

cnt = 0

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

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:
    pass
  
i+=1

print(len(S) - C)

Submission status: Accepted

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

Submission status: Accepted

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

c = 0

for p in range(0,n):
    if (S[p] != T[p]):
        c = c + 1 

print(c)

Submission status: Accepted

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

s = input()
t = input()

count = 0
length = len(s)

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

print(count)

Submission status: Accepted

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

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

print(num)

Submission status: Accepted

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

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

i = 0

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

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

for i in range(0, len(s)):
  if s[i] != t[i] :
    sum += 1
  #print(s[i]+':'+t[i]+'='+str(sum))
print(sum)

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

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

print(a)

Submission status: Accepted

Solution code:
s1 = input()
s2 = input()
t = 0

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

Submission status: Accepted

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

Submission status: Accepted

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

diff =0

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

print(diff)

Submission status: Accepted

Solution code:
s = input().strip()
t = input().strip()
ans = 0
for i, _ in enumerate(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=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()
print(sum([s!=t for s, t in zip(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:
def solve(s, t):
    return len(list(filter(lambda x: x[0]!=x[1], zip(s, t))))

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

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

Submission status: Accepted

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

ans = sum([S[i] != T[i] for i in range(len(S))])
print(ans)

Submission status: Accepted

Solution code:
import collections as cc
import itertools as it
I=lambda:list(map(int,input().split()))
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 = 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 = str(input())
T = str(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, t, c = input(), input(), 0
for i in range(len(s)):
  if s[i] != t[i]: c += 1
print(c)

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

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

Submission status: Accepted

Solution code:
input1 = input()
input2 = input()

def match(x, y):
    i = 0
    if x is y:
        i = 1
    return i

result_list = list(map(match, input1, input2))
print(result_list.count(0))

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

Submission status: Accepted

Solution code:
S=input()
T=input()
print(sum([S[i]!=T[i] for i in range(len(S))]))

Submission status: Accepted

Solution code:

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

Submission status: Accepted

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

print(cnt)

Submission status: Accepted

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

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

i = 0
j = 0

while j < len(S):
    if S[j] == T[j]:
        i = i
        j += 1
    else:
        i += 1
        j += 1

print(i)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import re
import sys
S = input()
T = input()
w = 0
if not re.match(r'^[a-z]+$', S) or not re.match(r'^[a-z]+$', T) or len(S) != len(T) or (10 ** 5 * 2) < len(S):
  sys.exit()
if S != T:
  i = 0
  for l in S:
    if l != T[i]:
      w = w + 1
    i = i + 1
print(w)

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:
firstString = input()
secondString = input()
diff = 0
for i in range(len(firstString)):
    if firstString[i] != secondString[i]:
        diff += 1
print(diff)

Submission status: Accepted

Solution code:

a = list(input())
b = list(input())
ans = 0
for _ in range(len(a)):
    x = a.pop()
    y = b.pop()
    if x != y:
        ans += 1
print(ans)

Submission status: Accepted

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

op = 0

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

print(op)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

if sys.subversion[0] == "PyPy":
    import io, atexit

    sys.stdout = io.BytesIO()
    atexit.register(lambda: sys.__stdout__.write(sys.stdout.getvalue()))

    sys.stdin = io.BytesIO(sys.stdin.read())
    input = lambda: sys.stdin.readline().rstrip()
RS = raw_input
RA = lambda x=int: map(x, RS().split())
RN = lambda x=int: x(RS())


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

    return





s = RS()
t = RS()
solve()

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

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

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

Submission status: Accepted

Solution code:
#n=int(input())
#a,b=map(int,input().split())
#l=list(map(int,input().split()))
#l=[list(map(int,input().split())) for i in range(n)]
s=list(input())
t=list(input())
count=0
for si, vi in zip(s,t):
    if si!=vi:
        count+=1
print(count)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

print(check)

Submission status: Accepted

Solution code:
s = input()
t = input()
answer = 0
for ws, wt in zip(s, t):
    if ws != wt:
        answer += 1
print(answer)

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)