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

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

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 = 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:

def main():
    s = input()
    t = input()
    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()
ans = 0

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

Submission status: Accepted

Solution code:
import math
import sys
import os
from operator import mul

sys.setrecursionlimit(10**7)

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

if os.getenv("LOCAL"):
    inputFile = basename_without_ext = os.path.splitext(os.path.basename(__file__))[0]+'.txt'
    sys.stdin = open(inputFile, "r")
INF = float("inf")

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

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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

for si, ti in zip(s, t):
    if si != ti:
        ans += 1

print(ans)

Submission status: Accepted

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

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

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:
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:
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:
ls1 = input()
ls2 = input()

num = len(ls1)

ans = 0

for i in range(num):
    if ls1[i] != ls2[i]:
        ans += 1

print(ans)

Submission status: Accepted

Solution code:
if __name__ == "__main__":
    S = input()
    T = input()
    ans = 0

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

    print(ans)

Submission status: Accepted

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

x = len(s)
count = 0

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

print(count)

Submission status: Accepted

Solution code:
n_s = list(input().rstrip())
n_t = list(input().rstrip())
cnt = 0
for i in range(len(n_s)):
    if n_s[i] != n_t[i]:
        cnt += 1
print(cnt)

Submission status: Accepted

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

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

print(count)

Submission status: Accepted

Solution code:
s=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)):
    ans += S[i] != T[i]

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

word = list(s)
answer = list(t)

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

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == '__main__':
    main()

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

print(c)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
def solver(S,T):
    counter = 0
    for i in range(len(S)):
        Si = S[i]
        Ti = T[i]
        if Si != Ti:
            counter += 1
    return counter

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

Submission status: Accepted

Solution code:
s=input()
n=input()
a=len(s)
ans=0
for m in range(a):
  if s[m]!=n[m]:
    ans=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:
def main():
    s = input()
    t = input()
    length = len(s)
    ans = 0

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

    print(ans)


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

Submission status: Accepted

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

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

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

print(cnt)

Submission status: Accepted

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

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

print(count)

Submission status: Accepted

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

Submission status: Accepted

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

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

print(result)

Submission status: Accepted

Solution code:
# list関数を使う
# list関数のリスト内包表記
s, t = (list(a for a in input()) for b in range(0, 2))
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()
l=len(S)
j=0
for i in range(l): 
    if S[i]!=T[i]:
        j=j+1
print(j)

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

Submission status: Accepted

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

i = 0
cn = 0
N = 200000



while i < L:
    if S[i] != T[i]:
        i = i + 1
        cn = cn + 1
    else:
        i = i + 1

print(cn)

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:
# coding: UTF-8
import sys
import numpy as np

# f = open("input.txt", "r")
# sys.stdin = f

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

print(ans)

Submission status: Accepted

Solution code:
a=list(input())
b=list(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 s1,t1 in zip(s,t):
    c+=s1!=t1
print(c)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(r)

Submission status: Accepted

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

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

print(cnt)

Submission status: Accepted

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

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

print(cnt)

Submission status: Accepted

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

count = 0

zip(S, T)

for x, y in zip(S, T):
    if x != y:
        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 = sum(s!=t for s, t in zip(S, T))
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


def solve(S: str, T: str):
    answer = sum([s != t for s, t in zip(S, T)])
    return answer


def main():
    tokens = chain(*(line.split() for line in sys.stdin))
    S = next(tokens)  # type: str
    T = next(tokens)  # type: str
    answer = solve(S, T)
    print(answer)


if __name__ == "__main__":
    main()

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

x = len(s)

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

print(num)

Submission status: Accepted

Solution code:
#coding: utf-8

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

Submission status: Accepted

Solution code:
def solve():
    S = input()
    T = input()
    ptr = 0
    length = len(S)
    ans = 0
    while ptr < length:
        if S[ptr] != T[ptr]:
            ans += 1
        ptr += 1
    print(ans)

if __name__ == "__main__":
    solve()

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:
s = input()
t = input()
u = 0

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

Submission status: Accepted

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

c = len(a)

d = 0

for i in range(c):
  if a[i] == b[i]:
    d = d
  else:
    d = d + 1
    
print(d)

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

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

Submission status: Accepted

Solution code:
print(sum([si!=ti for si,ti in zip(*(input(),input()))]))

Submission status: Accepted

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


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

print(b)

Submission status: Accepted

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

Submission status: Accepted

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

cnt = 0

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

print(cnt)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# ABC B-Minor Change
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:
S=list(input())
T=list(input())
ans=0
for i in range(len(S)):
    if S[i]!=T[i]:
        ans+=1
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=list(map(str,input()))
t=list(map(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()
N = len(S)

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

Submission status: Accepted

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

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

count=0
ans=0
for s in S:
  t=T[count]
  #print('t = %s, s = %s'%(t,s))
  if(t!=s):
    ans+=1
  count+=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()
result = 0
for i, s in enumerate(S):
    if T[i]!=s:
        result += 1
print(result)

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:
#B - Minor Change
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()
s_list = []
t_list = []
for i in s:
    s_list.append(i)
for i in t:
    t_list.append(i)
operation = [i for i in range(len(s_list)) if s_list[i] != t_list[i]]
print(len(operation))

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)
ans = 0

for i in range(n):

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

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:
p = str(input())
q = str(input())

count = 0

for i in range(len(p)):
  if p[i] != q[i]:
    count = count + 1
    
print(count)

Submission status: Accepted

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

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

print(counter)

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

Submission status: Accepted

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

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

print(cnt)

Submission status: Accepted

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

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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().rstrip()
T = input().rstrip()
count = 0

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
print(sum(s!=t for s,t in zip(*open(0))))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

N = len(S)

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

import sys
input = sys.stdin.readline



def inps():
    return str(input())


s = inps().rsplit()[0]
t = inps().rsplit()[0]
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 s,t in zip(S,T):
    ans+=(s!=t)
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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:
import sys
read = sys.stdin.read
readlines = sys.stdin.readlines
def main():
    s = input()
    t = input()
    r = 0
    for se, te in zip(s, t):
        r += se != te
    print(r)


if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

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

print(cnt)

Submission status: Accepted

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

result = [x != y for x, y in zip(s, t)]
print(sum(result))

Submission status: Accepted

Solution code:
S = input()
list_S = list(S)
T = input()
list_T = list(T)
count = 0
for i in range(len(list_S)):
    if S[i] != T[i]:
        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()
r=input()
n=len(s)
c=0
for i in range(n):
    if(s[i]!=r[i]):
        c=c+1
print(c)

Submission status: Accepted

Solution code:
S, T = [input() for _ in range(2)]
print(sum(s != t for s, t in zip(S, T)))

Submission status: Accepted

Solution code:
S, T = [input() for _ in range(2)]
cnt = 0
for i, c in enumerate(S):
    if c != T[i]:
        cnt += 1

print(cnt)

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

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

Submission status: Accepted

Solution code:
import sys

s = sys.stdin.readline().replace('\n','')
t = sys.stdin.readline().replace('\n','')
res = 0
for i in range(len(s)):
    if s[i] != t[i]: res += 1

print(res)

Submission status: Accepted

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

n = 0

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

print(n)
exit()

Submission status: Accepted

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

Submission status: Accepted

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

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

print(cnt)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
S,T=read().rstrip().decode().split()
print(sum(s!=t for s,t in zip(S,T)))

Submission status: Accepted

Solution code:
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
S,T=read().rstrip().decode().split()
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()
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)
c = 0
for i in range(0,n):
  if s[i] != t[i]:
    c += 1
print(c)

Submission status: Accepted

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

same = 0

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

Submission status: Accepted

Solution code:
# Minor Change
S = input()
T = input()
ans = 0
for e in zip(S,T):
    ans += [0,1][e[0]!=e[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]:
    continue
  ans += 1

print(ans)

Submission status: Accepted

Solution code:
"""B - Minor Change"""

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()
list_s = []
list_t = []
counter = 0
for i in range(0, len(S)):
  list_s.append(S[i])
  list_t.append(T[i])
  if S[i] != T[i]:
    list_s[i] = list_t[i]
    counter += 1
print(counter)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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:
#import sys
#import numpy as np
import math
#from fractions import Fraction
import itertools
from collections import deque
from collections import Counter
import heapq
#from fractions  import gcd
#input=sys.stdin.readline
import bisect
s=input()
t=input()
n=len(s)
ans=0
for i in range(n):
    if s[i]!=t[i]:
        ans+=1
print(ans)

Submission status: Accepted

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