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

x=0

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


print(x)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

ls = list(s)
lt = list(t)

ans = 0
j = 0
while True:
  rep_cnt = 0
  for i in range(j, len(ls)):
    j += 1
    if ls[i] != lt[i]:
      ls[i] = lt[i]
      rep_cnt += 1
      break
  if rep_cnt > 0:
    ans += rep_cnt
  else:
    break

print(str(ans))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#入力S
S = input()

#入力T
T = input()
ran_T = range(len(T))
#print(len(T))
#print(range(len(T)))
count = 0

for a, b in zip(S, T):
    if a != b:
        count += 1

print(count)

Submission status: Accepted

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

s_str = list(S)
t_str = list(T)

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

print (count)

Submission status: Accepted

Solution code:
import math
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:
import bisect
import copy
import heapq
import sys
import itertools
import math
import queue
from functools import lru_cache
input = sys.stdin.readline
sys.setrecursionlimit(1000000)
mod = 10 ** 9 + 7 

def read_values(): return map(int, input().split())
def read_index(): return map(lambda x: int(x) - 1, input().split())
def read_list(): return list(read_values())
def read_lists(N): return [read_list() for n in range(N)]


class V:
    def __init__(self, f, v=None):
        self.f = f
        self.v = v
 
    def __str__(self):
        return str(self.v)
 
    def ud(self, n):
        if n is None:
            return

        if self.v is None:
            self.v = n
            return
        self.v = self.f(self.v, n) 


def main():
    S = input().strip()
    T = input().strip()
    
    res = 0
    for s, t in zip(S, T):
        if s != t:
            res += 1

    print(res)


if __name__ == "__main__":
    main()

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
if __name__ == "__main__":
    a = str(input())
    b = str(input())
    count = 0
    for i in range(0,a.__len__()):
        if a[i] != b[i]:
            count += 1
    print(count)

Submission status: Accepted

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

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:
import numpy as np


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


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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print(a)

Submission status: Accepted

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

i = 0
cnt = 0
for c in S:
	if c != T[i]:
		cnt = cnt + 1
	i = i + 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]:
    pass
  else:
    a += 1

print(a)

Submission status: Accepted

Solution code:
S = input()
T = input()
length =len(S)
S = "".join(S)
T = "".join(T)
listS=list(S)
listT=list(T)
num = len(T)
res = 0
for i in range(length):
    if (listS[num-1] != listT[num-1]):
        res +=1
    num -=1
print(res)

Submission status: Accepted

Solution code:
import re

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:
print(sum(c!=d for c,d in zip(input(),input())))

Submission status: Accepted

Solution code:
def main():
    s = input()
    t = input()
    ans = 0
    for x,y in zip(s,t):
        if not x==y: ans += 1
    print(ans)

main()

Submission status: Accepted

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

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

print(count)

Submission status: Accepted

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

Submission status: Accepted

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

a_chars = list(a)
b_chars = list(b)

a_char_len = len(a)
k = 0
count = 0
for i in range(a_char_len):
    if(a_chars[i] != b_chars[i]):
        count = count + 1
        k = k + 1

print(count)

Submission status: Accepted

Solution code:
s=[i for i in input()]
t=[i for i in 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()

cnt = 0

i=0

while(i<len(a)):
    if(a[i]!=b[i]):
      cnt+=1
    i+=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:
#!/usr/bin/env python3

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

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

print(replaces)

Submission status: Accepted

Solution code:
S = list(input())
T = list(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:
def main():
    import sys
    read = sys.stdin.buffer.read
    readline = sys.stdin.buffer.readline
    readlines = sys.stdin.buffer.readlines
    sys.setrecursionlimit(10 ** 7)

    s = readline().rstrip().decode()
    t = readline().rstrip().decode()
    cnt = 0
    for ss, tt in zip(s, t):
        if ss != tt:
            cnt += 1
    print(cnt)


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

ans=0

l=len(s)

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


print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

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

print(cnt)

Submission status: Accepted

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

s=list(S)
t=list(T)
ans=0

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

print(ans)

Submission status: Accepted

Solution code:
a=input()
b=input()
ali=list(a)
bli=list(b)
c=0
for ai,bi in zip(ali,bli):
  if ai != bi:
    c+=1
print(c)

Submission status: Accepted

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

n = 0

for a in range(len(S)) :

    if not S[a] == T[a] :
        n += 1

print(n)

Submission status: Accepted

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

Submission status: Accepted

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

ans = 0
i = 0
while i < len(s):
	if s[i] != t[i]:
		ans += 1
	i += 1

print(ans)

Submission status: Accepted

Solution code:
import sys

a = []

grid = []
for i in range(2):
    a.append(input().strip())

S = a[0]
T = a[1]

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

print(count)

Submission status: Accepted

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

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

result = len(S) - counter

print(result)

Submission status: Accepted

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

ans = 0

for a, b in zip(S, T):
    if a != b:
        ans += 1

print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

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

print(len([1 for (a, b) in zip(S, T) if a != b]))

Submission status: Accepted

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

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

lst_s=list(s)
lst_t=list(t)
len_s=len(lst_s)
ng=0
for i in range(len_s):
  if lst_s[i]!=lst_t[i]:
    ng+=1
print(ng)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


print(int(count))

Submission status: Accepted

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

num = 0

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

print(num)

Submission status: Accepted

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

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

Submission status: Accepted

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


ans = 0

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

def resolve():
  S = list(input())
  T = list(input())
  count = 0

  for i in range(len(S)):
    if S[i] != T[i]:
      count += 1
      # temp = S[i]
      # for j, s in enumerate(S[i:]):
      #   if s == S[i]:
      #     print(S)
      #     S[i] = s
      #     S[i+j] = temp
      #     count += 1
  print(count)

if __name__ == "__main__":
  resolve()

Submission status: Accepted

Solution code:
s = input()
t = input()
unmatch = []

for  i, str in enumerate(zip(s,t)):
  if str[0] != str[1]:
    unmatch.append(str[0])
  
print(len(unmatch))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()	
t =input()	
def count_diff(a,b):
    """
    コードを単純化
    """
    cnt = 0
    for c1,c2 in zip(a, b):
        if c1 != c2:
            cnt += 1
    return cnt

print(count_diff(s,t))

Submission status: Accepted

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

ans = 0

if s == t:
    print(0)
else:
    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()
c = len(a)
d = list(a)
e = list(b)

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

Submission status: Accepted

Solution code:
a = input().rstrip()
b = input().rstrip()
c = 0

array1 = []
array2 = []

for i in range(len(a)):
    array1.append(a[i])


for j in range(len(b)):
    array2.append(b[j])


for z in range(len(a)):
    if a[z] == b[z]:
        c = c
    else:
        c = c +1

print(c)

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

def count_diff2(q, a):
    return sum(
        c1 != c2 for c1, c2 in zip(q, a)
    )

print(count_diff2(q,a))

Submission status: Accepted

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

print(ans)

Submission status: Accepted

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

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

length = len(S_list)
count = 0

for i in range(length):
    if S_list[i] != T_list[i]:
        count += 1
    else:
        count +=0

print(count)

Submission status: Accepted

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



s = input()
t = input()

s = list(s)
t = list(t)

ans = 0

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

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=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:
A1 = input()
A2 = input()
N = len(A1)
B = 0
for i in range(N):
  if A1[i] != A2[i]:
    B += 1
ans = B // 1
print(ans)

Submission status: Accepted

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

for i, alpha in enumerate(s):
        if t[i] == alpha:
                continue
        elif t[i] != alpha:
                ans += 1
                

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin
s = stdin.readline().rstrip()
t = stdin.readline().rstrip()
count = 0
for i in range(0, len(s)):
  if s[i] != t[i]:
    count += 1
print(count)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
line1=list(input())
line2=list(input())

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

Submission status: Accepted

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

c = 0

for i, e in enumerate(list(s)):
    if e != t[i]:
        c += 1

print(c)

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

Submission status: Accepted

Solution code:
# 操作回数の最小値

S = input() #ここで標準入力
T = input() #ここで標準入力

length = len(S)
count = 0

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

print(count)

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
def main():
    S = input().rstrip()
    T = input().rstrip()
    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:
a = input()
b = input()
c = 0

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
str_s = input()
str_t = input()
x = 0
count = 0

while(count <= len(str_s) - 1):
    if(str_s[count] != str_t[count]):
        x += 1
        count += 1
    else:
        count += 1

print(x)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a=input()
b=input()
ans=0
for i in range(len(b)):
    if b[i] == a[i]:
        continue
    else: 
        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 = 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 = str(input())
T = str(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()
S = len(s)
S_List = list(s)
T_List = list(t)
cnt = 0

for i in range(S):
    if not S_List[i] == T_List[i]:
        cnt = cnt +1
print(cnt)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
str1 = input() 
str2 = input() 
count = 0
for num in range(len(str1)):
    if str1[num] != str2[num]:
      count = count + 1
print(count)

Submission status: Accepted

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

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

print(cnt)

Submission status: Accepted

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

bos = len(S)
count = 0

for i in range(bos):
    if S[i] == T[i]:
        continue
    else:
        count+=1
        continue
    break
print(count)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()
t = input()
if s == t:
  print(0)
else:
  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:
# coding: utf-8
# 日本語を入力できるようにするために上記一文が必要


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

T = list(input())

x = len(S)

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

print(y)

Submission status: Accepted

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

count = 0

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

print(count)

Submission status: Accepted

Solution code:
def minorChange(s, t):
    changes = abs(len(s) - len(t))
    i = 0
    while i < len(s) and i < len(t):
        if s[i] != t[i]:
            changes += 1
        i += 1
    return changes

def start():
    S = input()
    T = input()
    changes = minorChange(S, T)
    print(changes, end="")

start()

Submission status: Accepted

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

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

print(c)

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
mozis=list(input())
mozit=list(input())
N=len(mozis)
answer=0
kaisuu=0
while kaisuu<N:
  if mozis[kaisuu] is mozit[kaisuu]:
    kaisuu+=1
  else:
    answer+=1
    kaisuu+=1

print(answer)

Submission status: Accepted

Solution code:
S = str(input())
T = str(input())
L = len(S)
s = list(S)
t = list(T)
A = 0

for i in range(L):
  if s[i] == t[i]:
    A = A
  else:
    A = A + 1

print(A)

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

print(output)

Submission status: Accepted

Solution code:
from sys import stdin
s = stdin.readline().rstrip()
t = stdin.readline().rstrip()

#print(s, t)

a = [x for x in s]
b = [x for x in t]

count = 0

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

Submission status: Accepted

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

Submission status: Accepted

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

if s == t:
    print(0)
    exit()

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()
t = input()
#print(s)
#print(t)
n = 0
for i in range(0,len(s)):
  #print('i=',i)
  if s[i] == t[i]:
    n = n + 0
  else:
    n = n + 1
print(n)

Submission status: Accepted

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

list_len = int(len(s))
ans = 0

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

print(ans)

Submission status: Accepted

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

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

print(count)

Submission status: Accepted

Solution code:
def main():
  S = str(input())
  T = str(input())
  count = 0
  for s, t in zip(S, T):
    #print(s, t)
    if s != t:
      count += 1
  print(count)

main()

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
S = str(input())
T = str(input())
#print(S[1])
cont = 0

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

count = 0
for idx in range(len(S)):
  if(S[idx] != T[idx]):
    #print("{0}と{1}で差分あり".format(S[idx], T[idx]))
    count += 1
    
print(count)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s1 = input()
s2 = input()
print(sum([ch1!=ch2 for ch1,ch2 in zip(s1,s2)]))

Submission status: Accepted

Solution code:
def prepare(s,t):
  list_s = list(s)
  list_t = list(t)
  num = len(list_s)
  x = 0
  for i in range(num):
    if list_s[i] != list_t[i]:
      x += 1
  print(x)
s = str(input())
t = str(input())
prepare(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:
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(str(input()))
t = list(str(input()))
result = 0
for i in range(len(s)):
    if(s[i] != t[i]):
        s[i] = t[i]
        result += 1
    else:
        s[i] = s[i]

print(result)

Submission status: Accepted

Solution code:
#!/usr/bin/env python
import sys
import re
from collections import deque, defaultdict
from itertools import combinations, combinations_with_replacement
import bisect
from math import factorial, sqrt, log, ceil, floor
sys.setrecursionlimit(1000000)


def main():
    #N, M = map(int, input().split())
    #N, K = map(int, input().split())
    #ps = list(map(int, input().split()))

    S = input().strip()
    T = input().strip()

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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
a = input()
b = input()
u=zip(a,b)
x=[]
for i,j in u: 
    if i==j:
        x.append("") 
    else: 
        x.append("*")
print (x.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()
result=0
for i in range(len(s)):
    if s[i]!=t[i]:
        result+=1
if s==t:
    print(0)
else:
    print(result)

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10**6)
input=sys.stdin.readline

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

print(sum(map(lambda x:int(x[0] != x[1]), zip(s, t))))