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

print(ans)

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

cnt = 0
for i, sv in enumerate(s):
    if t[i] != sv:
        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:
import sys
S=sys.stdin.readline().strip()
T=sys.stdin.readline().strip()
ans=0
for x,y in zip(S,T):
    if x!=y:
        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]:
        pass
    else:
        ans+=1

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
  s = str(input())
  t = str(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:
# -*- coding: utf-8 -*-
"""
@author: H_Hoshigi
"""
def main():
    S = input()
    T = input()

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

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(len(S)-count)

Submission status: Accepted

Solution code:
# AtCoder
S = list(input())
T = list(input())
cnt = 0
for k, v in zip(S, T):
    if not k == v:
        cnt += 1

print(cnt)

Submission status: Accepted

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

c=0
b=0
for a in s:
    if a!=t[b]:
        c=c+1
    b=b+1

print(c)

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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

lens = len(S)

cnt=0

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

print(cnt)

Submission status: Accepted

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

ans = 0
for s_i, t_i in zip(s, t):
  if not s_i == t_i:
    ans += 1
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
def resolve():
    import sys
    input = sys.stdin.readline
    # 整数 1 つ
    S = input().strip()
    T = input().strip()

    # 整数複数個
    # a, b = map(int, input().split())
    # 整数 N 個 (改行区切り)
    # N = [int(input()) for i in range(N)]
    # 整数 N 個 (スペース区切り)
    # N = list(map(int, input().split()))
    # 整数 (縦 H 横 W の行列)
    # A = [list(map(int, input().split())) for i in range(H)]

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

    print(cnt)


resolve()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

ans = np.sum(S != T)

print(ans)

Submission status: Accepted

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

ans=0

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

print(ans)

Submission status: Accepted

Solution code:
import sys
import numpy as np
import math
import collections
from collections import deque 
from functools import reduce

# input = sys.stdin.readline

s = input()
t = input()

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

Submission status: Accepted

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

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

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


print(result)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    N1 = str(input())
    N2 = str(input())

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

    print(count)
    
if __name__ == "__main__":
    main()

Submission status: Accepted

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

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

Submission status: Accepted

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

    count = 0
    for x, y in zip(s, t):
        if not x == y:
            count += 1

    print(count)


if 'unittest' not in globals():
    resolve()

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:
def main():
    import sys
    def input():
        return sys.stdin.readline()[:-1]
    S=input()
    T=input()
    a=len(S)
    n=0
    for i in range(a):
        if S[i]!=T[i]:
            n+=1
    print(n)
if __name__ == '__main__':
    main()

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:
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()
def hamming_dist(str1,str2):
    ans = 0
    a,b = len(str1),len(str2)
    if a > b:
        ans = a - b
        length = b
    elif a < b:
        ans = b - a
        length = a
    else:
        length = a
    for i in range(length):
        if str1[i] != str2[i]:
            ans += 1
    return ans
print(hamming_dist(s,t))

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

Submission status: Accepted

Solution code:
from sys import exit
import math
ii = lambda : int(input())
mi = lambda : map(int,input().split())
li = lambda : list(map(int,input().split()))

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

print(cnt)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def readinput():
    s=input()
    t=input()
    return s,t

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

if __name__=='__main__':
    s,t=readinput()
    ans=main(s,t)
    print(ans)

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
S = str(input())
T = str(input())
cnt=0
for sl,tl in zip(S,T):
    if sl != tl:
        cnt +=1
    
print(cnt)

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

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

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

print( sum([i != j for i, j in zip(s,t)]) )

Submission status: Accepted

Solution code:
import copy

def main():
    S = str(input())
    T = str(input())

    c = 0

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

    print(c)

main()

Submission status: Accepted

Solution code:
import sys
import copy
from collections import deque
import collections
stdin = sys.stdin

mod = 10**9+7

ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip()  # ignore trailing spaces

s = ns()
t = ns()

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

print(cnt)

Submission status: Accepted

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

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 = input()
t = input()
n = len(s)
for i in list(range(n)) :
    if s[i] == t[i] :
        n -= 1

print(n)

Submission status: Accepted

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

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

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


if __name__ == '__main__':
    S = list(input())
    T = list(input())
    main(S, T)

Submission status: Accepted

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

if __name__ == '__main__':
  s=input().strip("\n")
  t=input().strip("\n")
  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()
    cnt = 0
    for i in range(len(s)):
        if s[i] != t[i]:
            cnt += 1
    print(cnt)
main()

Submission status: Accepted

Solution code:
s = [s for s in input()]
t = [t for t in input()]

counter = 0

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

Submission status: Accepted

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

print(len(list(filter(lambda x: x[0] != x[1], zip(S, T)))))

Submission status: Accepted

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

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

print(count)

Submission status: Accepted

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

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

print(sum_num)

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().rstrip('\n')
t = input().rstrip('\n')

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

print(ans)

Submission status: Accepted

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


def solve(S: str, T: str):
    a = 0
    for i in range(len(S)):
        a += (S[i]==T[i])*1
    print(len(S)-a)
    return


# 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
    solve(S, T)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

ans = 0
for i in range(len(S)):
    si = S[i]
    ti = T[i]
    if si != ti:
        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:
a = input()
b = input()

ans = 0
for i,aa in enumerate(a):
    if b[i] != aa:
        ans += 1
print(ans)

Submission status: Accepted

Solution code:
import sys
import numpy as np
import math  # gcdもあるよ
from collections import deque
from collections import defaultdict
from copy import deepcopy
from itertools import accumulate #リストを与えると累積和を返す
def input(): return sys.stdin.readline().rstrip()
from functools import lru_cache #メモ化

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

if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s, t = input(), 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
s, t = open(0).read().split()

print(sum(1 for i, j in zip(s, t) if i != j))

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
production = True

import sys, math, collections

def input(input_format = 0, multi = 0):

    if multi > 0: return [input(input_format) for i in range(multi)]
    else:
        next_line = sys.stdin.readline()[:-1]

        if input_format >= 10:
            use_list = False
            input_format = int(str(input_format)[-1])
        else: use_list = True

        if input_format == 0: formatted_input = [next_line]
        elif input_format == 1: formatted_input = list(map(int, next_line.split()))
        elif input_format == 2: formatted_input = list(map(float, next_line.split()))
        elif input_format == 3: formatted_input = list(next_line)
        elif input_format == 4: formatted_input = (lambda x: [x[0], list(map(int, x[1:]))])(next_line.split())
        elif input_format == 5: formatted_input = (lambda x: [x[0], list(map(float, x[1:]))])(next_line.split())
        elif input_format == 6: formatted_input = next_line.split()
        else: formatted_input = [next_line]

        return formatted_input if use_list else formatted_input[0]


def out(output_line, output_format = 0, newline = True):

    formatted_output = ""

    if output_format == 0: formatted_output = str(output_line)
    elif output_format == 1: formatted_output = " ".join(map(str, output_line))
    elif output_format == 2: formatted_output = "\n".join(map(str, output_line))

    print(formatted_output, end = "\n" if newline else "")


def log(*args):
    if not production:
        print("$$$", end = "")
        print(*args)

enum = enumerate

#
#   >>>>>>>>>>>>>>> START OF SOLUTION <<<<<<<<<<<<<<
#


def solve():

    a = input(3)
    b = input(3)

    c = 0

    for i, j in zip(a, b):
        if i != j:
            c += 1

    out(c)

    return


#for i in range(input(11)): solve()
solve()

#
#   >>>>>>>>>>>>>>>> END OF SOLUTION <<<<<<<<<<<<<<<
#

Submission status: Accepted

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

N = len(A)

c = 0
for i in range(N):
  if A[i] != B[i]:
    c += 1

print(c)

Submission status: Accepted

Solution code:
#!/usr/bin/env python

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

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

    print(cnt)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

print(out)

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

ans = 0
for s_i, t_i in zip(s, t):
    if s_i == t_i:
        continue
    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]:
        continue
    else:
        ans+=1
print(ans)

Submission status: Accepted

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

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

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

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

Submission status: Accepted

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

def solve(s,t):
    c = len(s)
    for i in range(len(s)):
        if s[i] == t[i]:
            c -= 1
    return c




def main():
    s = input()
    t = input()
    print(solve(s,t))
    return

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

count = 0

for l in range(len(S)):
    if S[l] != T[l]:
        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:
# -*- coding: utf-8 -*-
s = input()
t = input()
s = list(s)
t = list(t)
cnt = 0
for i in range(len(s)):
    if s[i] != t[i]:
        cnt += 1
print(cnt)

Submission status: Accepted

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

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

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

    print(r)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
mod=10**9+7
import math
import sys
from collections import deque
import heapq
import copy
import itertools
from itertools import permutations
from itertools import combinations
import bisect
def mi() : return map(int,sys.stdin.readline().split())
def ii() : return int(sys.stdin.readline().rstrip())
def i() : return sys.stdin.readline().rstrip()
a=i()
b=i()
c=0
for i in range(len(a)):
  if a[i]!=b[i]:
    c+=1
print(c)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

sys.setrecursionlimit(10 ** 6)
input = sys.stdin.readline
from math import floor, sqrt, factorial, hypot, log  # log2ないｙｐ
from heapq import heappop, heappush, heappushpop
from collections import Counter, defaultdict, deque
from itertools import accumulate, permutations, combinations, product, combinations_with_replacement
from bisect import bisect_left, bisect_right
from copy import deepcopy
from fractions import gcd
from random import randint


def ceil(a, b): return (a + b - 1) // b


inf = float('inf')
mod = 10 ** 9 + 7


def pprint(*A):
    for a in A:     print(*a, sep='\n')


def INT_(n): return int(n) - 1


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


def MF(): return map(float, input().split())


def MI_(): return map(INT_, input().split())


def LI(): return list(MI())


def LI_(): return [int(x) - 1 for x in input().split()]


def LF(): return list(MF())


def LIN(n: int): return [I() for _ in range(n)]


def LLIN(n: int): return [LI() for _ in range(n)]


def LLIN_(n: int): return [LI_() for _ in range(n)]


def LLI(): return [list(map(int, l.split())) for l in input()]


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


def F(): return float(input())


def ST(): return input().replace('\n', '')


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




if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
S=list(input())
T=list(input())
count=0
for (i,s) in enumerate(S):
    if s!=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 = count+1
print(count)

Submission status: Accepted

Solution code:
s = str(input())
l = str(input())
res = 0

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

Submission status: Accepted

Solution code:
S, T = input(), input()
print(len([s for i, s in enumerate(S) if s != T[i]]))

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()
T = input()
print(len([i for i,j in zip(S,T) if i!=j]))

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

Submission status: Accepted

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

print(len(list(filter(lambda xy: xy[0] != xy[1], zip(s, t)))))

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

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

print(ret)

Submission status: Accepted

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

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:
ss = input()
tt = input()
ans = 0

for s, t in zip(ss, tt):
    if s != t:
        ans += 1
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:
s = input()
t = input()

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