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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# B Minor Change
S = list(input())
T = list(input())
l =len(S)
ct = 0
for i in range(l):
    if S[i] != T[i]:
        ct += 1
print(ct)

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:
#! python3
# coding:utf-8
 
def main():
    s = list(input())
    t = list(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:
num = 0
S = input()
T = input()
for s, t in zip(S, T):
  if s != t:
    num += 1
print(num)

Submission status: Accepted

Solution code:

S = input()
T = input()
cont = 0

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

print(cont)

Submission status: Accepted

Solution code:
S, T = [list(input()) for _ in range(2)]
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()
cnt = 0
for c1, c2 in zip(s, t):
    if c1 != c2:
        cnt += 1
    else:
        pass
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 += 0
  else:
    count += 1
print(count)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

s1 = str(input())
s2 = str(input())
ans = 0

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

print(ans)

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:
x=input()
y=input()
lst1=[]
lst1=list(x)
lst2=[]
lst2=list(y)
b=0
ans=0
while(b<len(x)):
    if(not lst1[b]==lst2[b]):
        ans=ans+1
    b+=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()
n = len(S)
ans = 0
for i in range(n):
    if S[i] != T[i]:
        ans +=1
print(ans)

Submission status: Accepted

Solution code:
import math
def facts(n):
    ans = []
    for  i in range(1, int(math.sqrt(n)+1)):
        if(n%i==0):
            ans.append(i)
            ans.append(n//i)
    ans = sorted(list(dict.fromkeys(ans)))
    if(ans[-1]==n):
        ans = ans[:-1]
    return ans

s1 = str(input())
s2 =str(input())
d1, d2 = 0,0
for i in range(len(s1)):
    if(s1[i] != s2[i]):
        d1+=1
print(d1)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
s = [input() for i in range(2)]
count=0
for item1, item2 in zip(s[0], s[1]):
    if (item1 != item2):
        count +=1
        
print(count)

Submission status: Accepted

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

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

print(cnt)

Submission status: Accepted

Solution code:
import sys
import numpy as np

def S(): return sys.stdin.readline().rstrip().split(' ')
def Ss(): return list(S())
def I(): return _I(Ss())
def Is(): return list(I())
def _I(ss): return map(int, ss) if len(ss) > 1 else int(ss[0])

s = S()[0]
t = S()[0]

ans = 0
for i, j in zip([c for c in s], [c for c in t]):
  if i != j:
    ans += 1
print(ans)

Submission status: Accepted

Solution code:
s = input()
t = input()
count = 0
for a, b in zip(s, t):
  if a!=b:
    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()
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
n = 0
while n < len(S):
    if S[n] != T[n]:
        count += 1
    n += 1
print(count)

Submission status: Accepted

Solution code:
def solve(s1, s2):
    n = len(s1)
    c = 0
    for i in range(n):
        c += s1[i] != s2[i]
    return c


def main(istr, ostr):
    s1 = istr.readline().strip()
    s2 = istr.readline().strip()
    result = solve(s1, s2)
    print(result, file=ostr)


if __name__ == "__main__":
    import sys

    main(sys.stdin, sys.stdout)

Submission status: Accepted

Solution code:
s=list(input())
t=list(input())
s_length=len(s)
t_length=len(t)
#print(s[3])
#print(t[3])

count=0
for i in range(s_length):
    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(len(s)-c)

Submission status: Accepted

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

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

print(change)

Submission status: Accepted

Solution code:
string1 = input()
string2 = input()

count = 0

for i in range(len(string1)):
    if string1[i] != string2[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 s, t in zip(S, T):
    if s != t:
        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()

cnt = 0

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

print(cnt)

Submission status: Accepted

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

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

print(changes)

Submission status: Accepted

Solution code:
# coding: utf-8
# submission # - User: herp_sy
# https://atcoder.jp/contests/
#
# lang: Python3 (3.8.2)

import math
import statistics
import numpy as np
import queue
import itertools
import functools 

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
# 引数が一つだけのやつ
# n = int(input())
# 引数が複数あるやつ（全部数字）
# target = [int(x) for x in input().split()]

# 引数が複数あるやつ（そうじゃないの）
# target = [int(x) for x in input().split()]

# 最初の行で複数行を受け取って処理するやつ
target_1 = list(input())
target_2 = list(input())

# 初期

result = 0
# 判定
for idx in range(len(target_1)):
    if target_1[idx] != target_2[idx]:
        result += 1

print(result)

Submission status: Accepted

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

count=0

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

Submission status: Accepted

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

result = 0
for i, j in zip(S, T):
  if i != j:
    result += 1
    
print(result)

Submission status: Accepted

Solution code:
s, t = open(0).read().split()
ans = 0
for ch_s, ch_t in zip(s, t):
    if ch_s != ch_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=str(input())
t=str(input())

n=len(s)
count=0

for i in range(n):
    if s[i]==t[i]:
        count+=1
    else:
        continue

print(n-count)

Submission status: Accepted

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


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

Submission status: Accepted

Solution code:
S = input()
T = input()
count = 0
for i,char in enumerate(S):
    if char != T[i]:
        count += 1

print(count)

Submission status: Accepted

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

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

print(count)

Submission status: Accepted

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

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


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

Submission status: Accepted

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

Submission status: Accepted

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

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

N = len(s) - 1
i = 0
counter = 0

while N + 1 != i:
    if S[i] != T[i]:
        S[i] = T[i]
        counter += 1
    i += 1

print(counter)

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

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


if __name__ == "__main__":
    resolve()

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

Submission status: Accepted

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

# B - Minor Change /
# 実行時間制限: 2 sec / メモリ制限: 1024 MB
# 配点 : 200点

# 問題文
# 文字列 S, T が与えられます。次の操作を繰り返して S を Tに変更するとき、操作回数の最小値を求めてください。

# 操作：Sの 1

# 文字を選んで別の文字に書き換える

# 制約
#     S, T は長さ 1 以上 2×10^5以下
#     S, Tは英小文字のみからなる
#     Sと Tの長さは等しい

# 入力
# 入力は以下の形式で標準入力から与えられる。

# S
# T

# 出力
# 答えを出力せよ。

# 入力例 1
# cupofcoffee
# cupofhottea

# 出力例 1
# 4

# 例えば、次のような 4回の操作で達成できます。
#     1回目：6文字目の c を h に書き換える
#     2回目：8文字目の f を t に書き換える
#     3回目：9文字目の f を t に書き換える
#     4回目：11文字目の e を a に書き換える

# 入力例 2
# abcde
# bcdea

# 出力例 2
# 5

# 入力例 3
# apple
# apple

# 出力例 3
# 0

# 1度も操作をしなくてもよいこともあります。


def calculation(lines):
    S = lines[0]
    T = lines[1]
    n_diff = 0
    for i in range(len(S)):
        if S[i] != T[i]:
            n_diff += 1
    return [n_diff]


# 引数を取得
def get_input_lines(lines_count):
    lines = list()
    for _ in range(lines_count):
        lines.append(input())
    return lines


# テストデータ
def get_testdata(pattern):
    if pattern == 1:
        lines_input = ['cupofcoffee', 'cupofhottea']
        lines_export = [4]
    if pattern == 2:
        lines_input = ['abcde', 'bcdea']
        lines_export = [5]
    if pattern == 3:
        lines_input = ['apple', 'apple']
        lines_export = [0]
    return lines_input, lines_export


# 動作モード判別
def get_mode():
    import sys
    args = sys.argv
    if len(args) == 1:
        mode = 0
    else:
        mode = int(args[1])
    return mode


# 主処理
def main():
    mode = get_mode()
    if mode == 0:
        lines_input = get_input_lines(2)
    else:
        lines_input, lines_export = get_testdata(mode)

    lines_result = calculation(lines_input)

    for line_result in lines_result:
        print(line_result)

    # if mode > 0:
    #     print(f'lines_input=[{lines_input}]')
    #     print(f'lines_export=[{lines_export}]')
    #     print(f'lines_result=[{lines_result}]')
    #     if lines_result == lines_export:
    #         print('OK')
    #     else:
    #         print('NG')


# 起動処理
if __name__ == '__main__':
    main()

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_cache
import sys
sys.setrecursionlimit(10000)
INF = float("inf")
YES, Yes, yes, NO, No, no = "YES", "Yes", "yes", "NO", "No", "no"
dy4, dx4 = [0, 1, 0, -1], [1, 0, -1, 0]
dy8, dx8 = [0, -1, 0, 1, 1, -1, -1, 1], [1, 0, -1, 0, 1, 1, -1, -1]


def inside(y, x, H, W):
    return 0 <= y < H and 0 <= x < W


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


def sum_of_arithmetic_progression(s, d, n):
    return n * (2 * s + (n - 1) * d) // 2


def gcd(a, b):
    if b == 0:
        return a
    return gcd(b, a % b)


def lcm(a, b):
    g = gcd(a, b)
    return a / g * b


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

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


def main():
    solve()


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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

if not ( 1 <= len(S) <= 2*10**5 ): sys.exit()
if not ( len(S) == len(T) ): sys.exit()
if not ( S.islower() and T.islower() ): sys.exit()

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

Submission status: Accepted

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

def main():

    S = input()
    T = input()

    n = len(S)

    ans = 0

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

    print(ans)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
# import numpy as np
if __name__ == "__main__":
    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:
#n = int(input())
#a, b = map(int, input().split())
#l = list(map(int, input().split()))
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()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print(counter)

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:
import math
import sys
from collections import Counter
readline = sys.stdin.readline


def main():
    s = readline().rstrip()
    t = readline().rstrip()
    cnt = 0
    for k in range(len(s)):
        cnt += 1 if s[k] != t[k] else 0
    print(cnt)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# Generated by https://github.com/kyuridenamida/atcoder-tools
from typing import *
import itertools
import math
import sys

INF = float('inf')


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


def main():

    sys.setrecursionlimit(10 ** 6)

    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    S = next(tokens)  # type: str
    T = next(tokens)  # type: str
    print(solve(S, T))


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

print(sum([c1 != c2 for c1, c2 in zip(S, T)]))

Submission status: Accepted

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

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

Submission status: Accepted

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

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

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

print(ans)

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

Submission status: Accepted

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

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

print(count)

Submission status: Accepted

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

length = int(len(S))
difference = 0

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

   
print(str(difference))

Submission status: Accepted

Solution code:
s = input()
t = input()
if s == t:
    print(0)
else:
    ans = 0
    for i, letter in enumerate(s):
        if letter != 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:
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:
#!/usr/bin/env python
# -*- coding: utf-8 -*-

S = input()
T = input()
result = 0

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

print(result)

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

print(sum(s[i] != t[i] for i in range(len(s))))

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
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:
from sys import stdin
import sys

a = stdin.readline().rstrip()
b = stdin.readline().rstrip()

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

print (count)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# Minor Change

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())
l = len(S)
ans = 0

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

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import re
S = input()
T = input()
result=0
if(len(S)!=len(T)):
    pass
elif(re.fullmatch(r'[a-z]{1,200000}', S) and re.fullmatch(r'[a-z]{1,200000}', T)):
    for i in range(len(S)):
        if S[i]!=T[i]:
            result+=1
    print(result)

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

Submission status: Accepted

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

def main():
    s = str(input())
    t = str(input())
    print(operation(s,t))

if __name__ == '__main__':
    main()

Submission status: Accepted

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

def main():
    s = str(input())
    t = str(input())
    print(occur_change(s,t))

if __name__ == '__main__':
    main()

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

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
def main():
    S = input()
    T = input()
    count = 0
    for i in range(len(S)):
        if S[i] != T[i]:
            count+=1
    print(count)


if __name__  == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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


if __name__  == '__main__':
    main()

Submission status: Accepted

Solution code:
s = input()
t = input()
s_line = list(s)
t_line = list(t)
count=0
for a,b in zip(s_line,t_line):
	if a!=b: count +=1
print(count)

Submission status: Accepted

Solution code:
s=input()
t=input()
s_lst = list(s)
t_lst = list(t)
count = 0
for a,b in zip(s_lst, t_lst):
  if a!=b: 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:
def b172(slist, tlist):

    ans = 0

    for s, t in zip(slist, tlist):
        if s != t:
            ans += 1

    return ans

def main():
    slist = list(str(input()))
    tlist = list(str(input()))
    print(b172(slist, tlist))

if __name__ == '__main__':
    main()

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:
"""test programm for Q-B 20200719 """
# test programm for B


def __main__():
    str1 = str(input())
    str2 = str(input())
    list_str1 = list(str1)
    list_str2 = list(str2)

    if len(list_str1) < 1 or 2*10**5 < len(list_str1):
        raise ValueError
    elif str1.isalpha() == False or str1.islower() == False:
        raise ValueError
    elif str2.isalpha() == False or str2.islower() == False:
        raise ValueError
    elif len(str1) != len(str2):
        raise ValueError

    cnt = 0
    for n in range(len(list_str1)):
        if list_str1[n] != list_str2[n]:
            cnt += 1
        else:
            continue

    print(cnt)


if __name__ == "__main__":
    __main__()

Submission status: Accepted

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

Submission status: Accepted

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

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

print(cnt)

Submission status: Accepted

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