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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(cnt)

Submission status: Accepted

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

Submission status: Accepted

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

print(j)

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:
S = input()
T = input()
len_S = len(S)
ans = 0
for i in range(0,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()

Num = len(S)

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

change_num = 0

for i in range(Num):
    if S[i] is not T[i]:
        change_num += 1

print(change_num)

Submission status: Accepted

Solution code:

S = input()
T = input()

N = len(S)

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

ans = 0

for k in range(N):
    if S[k] != T[k]:
        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:
INT = lambda: int(input())
INTM = lambda: map(int,input().split())
STRM = lambda: map(str,input().split())
STR = lambda: str(input())
LIST = lambda: list(map(int,input().split()))
LISTS = lambda: list(map(str,input().split()))
def do(): 
    s=STR()
    t=STR()
    ct=0
    for i in range(len(s)):
        if s[i]!=t[i]:
            ct+=1
    print(ct)


if __name__ == '__main__':
    do()

Submission status: Accepted

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

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

print(num)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
word_1 = [i for i in map(str,input())]
count =0
word_2 = [i for i in map(str,input())]
for key,item in enumerate(word_1):
    if not item == word_2[key]:
      count += 1
print(count)

Submission status: Accepted

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

print(cnt)

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:
def minor_change():
    # 入力
    S = input()
    T = input()
    # 比較処理
    char_count = len(S)
    replace_count = 0
    for i in range(char_count):
        if S[i] != T[i]:
            replace_count += 1
    return replace_count

result = minor_change()
print(result)

Submission status: Accepted

Solution code:
print(len(list(filter(lambda x: x[0] != x[1], zip(input(), input())))))

Submission status: Accepted

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

panjang = len(s)
ans = 0

for i in range (panjang):
    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())

count = 0

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

print(count)

Submission status: Accepted

Solution code:
one = input()
two = input()
letter_one = list(one)
letter_two = list(two)

#print(len(letter_one))
ans = 0
for i in range(len(letter_one)):
    if letter_one[i] == letter_two[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:
ans = 0
for s, t in zip(input(), input()):
    if s != t : 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:
ans=0
for i,j in zip(input(),input()):
    if i!=j: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()
n=input()
ans=0
for i in range(len(n)):
  if s[i]!=n[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()
i = 0
count = 0
for s in S:
    if s != T[i]:
        count = count + 1
    i = i + 1
print(count)

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

counter = 0
for index, character in enumerate(s):
    if t[index] != character:
        counter += 1
print(counter)

Submission status: Accepted

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

Submission status: Accepted

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

time = []

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

Len = (len(S))
listt = list(range(Len))

for ss in listt:
      if S[ss] ==T[ss]:
            None
      else:
            time.append(ss)

print(len(time))

Submission status: Accepted

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

res = 0

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

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 = list(input())
t = list(input())
cnt = 0
for (s1,t1) in zip(s,t):
  if s1 != t1:
    cnt += 1
print(cnt)

Submission status: Accepted

Solution code:
import sys


def input(): return sys.stdin.readline().strip()


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()
S_chars = list(S)
T_chars = list(T)
i = 0
count = 0


for roop in S_chars:
    if not S_chars[i] == T_chars[i]:
        count += 1
    i += 1
print(count)

Submission status: Accepted

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

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 = 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()
U = S + T[::-1]
count = 0
for i in range(int(len(U)/2)):
  if U[i] != U[-(i+1)]:
    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]:
    count += 1

print(count)

Submission status: Accepted

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

a = 0
b = len(s) 

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

print(a)

Submission status: Accepted

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

def solve(a,b):
    ans = 0
    for s,t in zip(S,T):
        if s != t:
            ans += 1
    return ans

print(solve(S,T))

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

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

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

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

print(x)

Submission status: Accepted

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
#pythonの標準入力はちょっとややこしいので
#https://qiita.com/kyuna/items/8ee8916c2f4e36321a1c
#この辺を参考にするとよいかも

s = input()
t = input()

#あとは同じ
ans = 0

#len(s)はsの長さを表す
for i in range(len(s)):
    if (s[i] != t[i]):
        #pythonでは++は使えない
        ans = ans + 1
print(ans)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys


def solve(S: str, T: str):
    cnt = 0
    for s, t in zip(S, T):
        if s!=t:
            cnt += 1
    return cnt


# Generated by 1.1.7.1 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    S = next(tokens)  # type: str
    T = next(tokens)  # type: str
    print(solve(S, T))

if __name__ == '__main__':
    main()

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

Submission status: Accepted

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

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

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:
#https://atcoder.jp/contests/abc172/tasks/abc172_b
a= []
b= []

a= input(" ")

d= len(a)

b= input(" ")

e= 0
for i in range(0, d):
    if a[i]==b[i]:
        pass
    else:
        e= e+1
print(e)

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

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

Submission status: Accepted

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

count = 0

for (elm_s, elm_t) in zip(s, t):
    if (elm_s != elm_t):
        count+=1

print(count)

Submission status: Accepted

Solution code:
x = str(input())
y = str(input())
cnt = 0
for i,j in zip(x,y):
	if i!=j:
		cnt+=1
print(cnt)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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:
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()
c = 0
for s, t in zip(S, T):
    if s != t:
        c += 1

print(c)

Submission status: Accepted

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

# print(a[0])
# print(a[1])
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()
ans=0
for ss,tt in zip(s,t):
    if ss==tt:
        ans+=1
print(len(s)-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:
S = input()
T = input()

count = 0
for num in range (len(S)):
	if S[num] != T[num]:
		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()
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()

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

Submission status: Accepted

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

Submission status: Accepted

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

ans = len(s)
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(0, 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 = 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()
change = 0

for x, y in zip(S, T):
    if x != y:
        change += 1

print(change)

Submission status: Accepted

Solution code:
S=input()
T=input()
ans=0
for i in range(0,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 = 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:
#B
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:
from math import floor,ceil,sqrt,factorial,log
from collections import Counter, deque
from functools import reduce
import numpy as np
import itertools
def S(): return input()
def I(): return int(input())
def MS(): return map(str,input().split())
def MI(): return map(int,input().split())
def FLI(): return [int(i) for i in input().split()]
def LS(): return list(MS())
def LI(): return list(MI())
def LLS(): return [list(map(str, l.split() )) for l in input()]
def LLI(): return [list(map(int, l.split() )) for l in input()]
def LLSN(n: int): return [LS() for _ in range(n)]
def LLIN(n: int): return [LI() for _ in range(n)]

s = S()
t = S()

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

print(cnt)

Submission status: Accepted

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

count=0
for x in range(len(m)):
  if(n[x]!=m[x]):
    count=count+1;
    
print(count)

Submission status: Accepted

Solution code:
count = 0
def main():
  global count
  s = input()
  t = input()
  for i in zip(s,t):
    if i[0] != i[1]:
      count += 1
  print(count)    
  
  
  
  
if __name__ == '__main__':
  main()

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,j) in zip(s,t):
  if i != j:
    count+=1
print(count)

Submission status: Accepted

Solution code:
a = input()
b = input()
c = 0
for x,y in zip(a,b):
    if x != y:
        c += 1
print(c)

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:
s = input()
t = input()
cnt = 0
for (i,j) in zip(s,t):
  if i!=j: cnt +=1 
print(cnt)

Submission status: Accepted

Solution code:
import sys
readline = sys.stdin.readline
sys.setrecursionlimit(10**8)
mod = 10**9+7
#mod = 998244353
INF = 10**18
eps = 10**-7

S = readline().rstrip()
T = readline().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()
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()
result = 0

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10 ** 9)
# input = sys.stdin.readline    ####
def int1(x): return int(x) - 1
def II(): return int(input())
def MI(): return map(int, input().split())
def MI1(): return map(int1, input().split())
def LI(): return list(map(int, input().split()))
def LI1(): return list(map(int1, input().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def MS(): return input().split()
def LS(): return list(input())
def LLS(rows_number): return [LS() for _ in range(rows_number)]
def printlist(lst, k=' '): print(k.join(list(map(str, lst))))
INF = float('inf')
# from math import ceil, floor, log2
# from collections import deque
# from itertools import combinations as comb, combinations_with_replacement as comb_w, accumulate, product, permutations
# from heapq import heapify, heappop, heappush
# import numpy as np    # cumsum
# from bisect import bisect_left, bisect_right

def solve():
    S = LS()
    T = LS()

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

    print(ans)
if __name__ == '__main__':
    solve()

Submission status: Accepted

Solution code:
inword = input()
outword = input()
answer = 0

for i in range(len(inword)):
    if inword[i] != outword[i]:
        answer += 1

print(answer)

Submission status: Accepted

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

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:
import sys
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def I(): return int(sys.stdin.buffer.readline())
def LS(): return sys.stdin.buffer.readline().rstrip().decode('utf-8').split()
def S(): return sys.stdin.buffer.readline().rstrip().decode('utf-8')
def IR(n): return [I() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
def LSR(n): return [LS() for i in range(n)]
def SRL(n): return [list(S()) for i in range(n)]
def MSRL(n): return [[int(j) for j in list(S())] for i in range(n)]
mod = 10 ** 9 + 7

S, T = SR(2)

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

Submission status: Accepted

Solution code:
import itertools
import math
import fractions
import functools
import copy
from collections import deque
from functools import reduce
from decimal import Decimal


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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
ans = 0
for s, t in zip(input(), input()):
    if s != t:
        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 = 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()
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:
input1 = input()
input2 = input()
diff = 0;
for i in range (len(input1)):
  if input1[i] != input2[i]:
    diff = diff + 1
print(diff)

Submission status: Accepted

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

Submission status: Accepted

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

    print(contador)


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

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
j =0
for i in S:
  if i != T[j]:
    count +=1
  j+=1

print(count)

Submission status: Accepted

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

count=0
j=0

for i in s:
    if i!=t[j]:
        count+=1
    j+=1

print(count)

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:
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,copy,functools
import time,random,resource

sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**10
mod = 10**9+7
dd = [(-1,0),(0,1),(1,0),(0,-1)]
ddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]

def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(): return [list(map(int, l.split())) for l in sys.stdin.readlines()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
def pf(s): return print(s, flush=True)
def pe(s): return print(str(s), file=sys.stderr)
def JA(a, sep): return sep.join(map(str, a))
def JAA(a, s, t): return s.join(t.join(map(str, b)) for b in a)


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

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

    return r


print(main())

Submission status: Accepted

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

print(len([1 for a in zip(s, t) if a[0] != a[1]]))

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