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

Submission status: Accepted

Solution code:
'''
Created on 2020/06/27

@author: harurun
'''
S=input()
T=input()
t=0
for x in range(len(S)):
    if S[x]==T[x]:
        pass
    else:
        t += 1
print(t)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()
T = input()
a = 0
for v, k in zip(S, T):
    if v != k:
        a += 1
print(a)

Submission status: Accepted

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

Submission status: Accepted

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

cnt = 0
idx = 0

for i in s:
    if i != t[idx]:
        cnt += 1
    idx += 1

print(cnt)

Submission status: Accepted

Solution code:
import math
from collections import Counter

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

print(ct)

Submission status: Accepted

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

str_len = len(t)

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

print(cnt)

Submission status: Accepted

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

total = 0

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

print(total)

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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

ans = sum(1 for si, ti in zip(s, t) if si != ti)
print(ans)

Submission status: Accepted

Solution code:
#!/usr/bin/env python
# -*- coding: utf-8 -*-

import sys


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


def resolve():
    s = input().rstrip()
    t = input().rstrip()

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

print(cnt)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

s = input()
t = input()

count = 0

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

print(count)

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

S = sys.stdin.readline().strip()
T = sys.stdin.readline().strip()

ls = len(S)

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

print(ans)

Submission status: Accepted

Solution code:
import numpy as np
import math
import scipy as sp
import queue
import collections

MOD = 10 ** 9 + 7
INF = 10 ** 9

def main(kwargs):
    S = kwargs["S"]
    T = kwargs["T"]
    res = 0

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

    return res

if __name__ == "__main__":
    kwargs = {}

    cin = input().split()
    kwargs["S"] = cin[0]

    cin = input().split()
    kwargs["T"] = cin[0]

    cout = main(kwargs)
    print(cout)

Submission status: Accepted

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

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

print(cnt)

Submission status: Accepted

Solution code:
# import sys
# import math #sqrt,gcd,pi
# import decimal
# import queue # queue
# import bisect
# import heapq # priolity-queue
# import time
# from itertools import product,permutations,\
#     combinations,combinations_with_replacement
# 重複あり順列、順列、組み合わせ、重複あり組み合わせ
# import collections # deque
# from operator import itemgetter,mul
# from fractions import Fraction
# from functools import reduce

mod = int(1e9+7)
# mod = 998244353
INF = 1<<50

def readInt():
    return list(map(int,input().split()))

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

if __name__=='__main__':
    main()

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().strip() ;
T =  input().strip() ;
x = 0 ;

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

Submission status: Accepted

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

count = 0
for i, s in enumerate(S):
    if T[i] != s:
        count += 1

print(count)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
s = input()
t = input()

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

print(ans)

Submission status: Accepted

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

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

print(cnt)

Submission status: Accepted

Solution code:
# itne me hi thakk gaye?
from collections import defaultdict
s = input().strip()
t = input().strip()
a = 0
for i in range(len(s)):
    a += (s[i] != t[i])
print(a)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python
import os
import operator
from collections import defaultdict
import sys
from io import BytesIO, IOBase
import bisect

# def power(x, p):
#     res = 1
#     while p:
#         if p & 1:
#             res = res * x % 1000000007
#         x = x * x % 1000000007
#         p >>= 1
#     return res;

def main():
    # for _ in range(int(input())):
    #     n=int(input())
    #     n,k=map(int,input().split())
    #     arr=[int(k) for k in input().split()]
    #n=int(input())
    # n,k=map(int,input().split())
    # arr=[int(k) for k in input().split()]
    s=input()
    t=input()
    ans=0
    for i in range(len(s)):
        if s[i]!=t[i]:
            ans+=1
    print(ans)





















BUFSIZE = 8192

class FastIO(IOBase):
    newlines = 0

    def __init__(self, file):
        self._fd = file.fileno()
        self.buffer = BytesIO()
        self.writable = "x" in file.mode or "r" not in file.mode
        self.write = self.buffer.write if self.writable else None

    def read(self):
        while True:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            if not b:
                break
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines = 0
        return self.buffer.read()

    def readline(self):
        while self.newlines == 0:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            self.newlines = b.count(b"\n") + (not b)
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines -= 1
        return self.buffer.readline()

    def flush(self):
        if self.writable:
            os.write(self._fd, self.buffer.getvalue())
            self.buffer.truncate(0), self.buffer.seek(0)


class IOWrapper(IOBase):
    def __init__(self, file):
        self.buffer = FastIO(file)
        self.flush = self.buffer.flush
        self.writable = self.buffer.writable
        self.write = lambda s: self.buffer.write(s.encode("ascii"))
        self.read = lambda: self.buffer.read().decode("ascii")
        self.readline = lambda: self.buffer.readline().decode("ascii")


sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")

if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

    print(ans)

resolve()

Submission status: Accepted

Solution code:
#172B

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def hamming_dist(str1,str2):
    count = 0
    if len(str1) > len(str2):
        str_data1 = str1[:]
        str_data2 = str2[:]
    elif len(str1) < len(str2):
        str_data1 = str2[:]
        str_data2 = str1[:]
    else:
        str_data1 = str1[:]
        str_data2 = str2[:]
    for i in range(len(str_data2)):
        if str_data1[i] != str_data2[i]:
            count += 1
    for i in range(len(str_data1)-len(str_data2)):
        count += 1

    return count
p = input()
q = input()
print(hamming_dist(p, q))

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

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

Submission status: Accepted

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

Submission status: Accepted

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

a = len(s)
ans = 0

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

print(ans)

Submission status: Accepted

Solution code:
import os
import sys
from collections import defaultdict, Counter
from itertools import product, permutations,combinations, accumulate
from operator import itemgetter
from bisect import bisect_left,bisect
from heapq import heappop,heappush,heapify
from math import ceil, floor, sqrt
from copy import deepcopy

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

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

Submission status: Accepted

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

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

print(cnt)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = str(input())
T = str(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:
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 collections
import sys
import copy
import re


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


def main():
    S1 = S()
    T = S()

    cnt = 0

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

    print(cnt)


if __name__ == '__main__':
    main()

Submission status: Accepted

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

  print(count)

if __name__ == "__main__":
    main()

Submission status: Accepted

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

input = sys.stdin.readline


def S():
    return input().rstrip()


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


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


s = S()
t = S()
n = len(s)

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

print(c)

Submission status: Accepted

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

Submission status: Accepted

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

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

print(len(S)-x)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
input = sys.stdin.readline
s=list(input()) 
n=list(input())
ans = 0
for i in range(len(s)):
    if s[i]!=n[i]:
        ans+=1
print(ans)

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()
t = input()
l = int(len(s))
c = 0

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:

#!/usr/bin/python
# -*- coding: utf-8 -*-

import numpy as np

def int_mtx(N):
    x = []
    for _ in range(N):
        x.append(list(map(int,input().split())))
    return np.array(x)

S = input()
T = input()

ans = 0

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

cnt = 0

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

print(cnt)

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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

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

print(r)

Submission status: Accepted

Solution code:
#Problem B
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 = str(input())
T = str(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:
s = input()
t = input()

ans = 0

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

print(ans)

Submission status: Accepted

Solution code:
ni = lambda: int(input())
nm = lambda: map(int, input().split())
nl = lambda: list(map(int, input().split()))

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

Submission status: Accepted

Solution code:
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
# from fractions import gcd
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from functools import reduce
from bisect import bisect_left, insort_left
from heapq import heapify, heappush, heappop

INPUT = lambda: sys.stdin.readline().rstrip()
INT = lambda: int(INPUT())
MAP = lambda: map(int, INPUT().split())
S_MAP = lambda: map(str, INPUT().split())
LIST = lambda: list(map(int, INPUT().split()))
S_LIST = lambda: list(map(str, INPUT().split()))
ZIP = lambda: zip(*(MAP() for _ in range(n)))

sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7


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

    print(cnt)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-

s = input()
t = input()
c = 0

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

print(c)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

n = len(s)

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

print (str(r))

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()))
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()
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())
num = len(S)
cnt = 0
for i in range (num):
    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:
import sys

def read_int():
    l = sys.stdin.readline().rstrip('\n').split(' ')
    return int(l[0])

def read_int_list():
    l = sys.stdin.readline().rstrip('\n').split(' ')                                                  
    return [int(i) for i in l]


S = sys.stdin.readline()                                                                              
T = sys.stdin.readline()                                                                              

ans = 0

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

Submission status: Accepted

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


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

Submission status: Accepted

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

c = 0

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

print(c)

Submission status: Accepted

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

    ans = 0

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

    print(ans)


resolve()

Submission status: Accepted

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


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

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

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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

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

print(count)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import math
import numpy as np
import functools
import operator
import collections
import itertools

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

Submission status: Accepted

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

ans=0

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

print(ans)

Submission status: Accepted

Solution code:
x=input().strip()
y=input().strip()
co=0
for i in range(len(x)):
    #print(i)
    if(x[i]!=y[i]):
        co+=1
print(co)

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

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

print(n-counter)

Submission status: Accepted

Solution code:
s = list(input())
f = list(input())
count = 0
for i in range(len(s)):
    if s[i] != f[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:
#!python3.8
# -*- coding: utf-8 -*-
# abc172/abc172_b
import sys

s2nn = lambda s: [int(c) for c in s.split(' ')]
ss2nn = lambda ss: [int(s) for s in list(ss)]
ss2nnn = lambda ss: [s2nn(s) for s in list(ss)]
i2s = lambda: sys.stdin.readline().rstrip()
i2n = lambda: int(i2s())
i2nn = lambda: s2nn(i2s())
ii2ss = lambda n: [i2s() for _ in range(n)]
ii2nn = lambda n: ss2nn(ii2ss(n))
ii2nnn = lambda n: ss2nnn(ii2ss(n))

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

main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import numpy as np
#from numba import njit

#(N, K) = map(int, input().split())
#A = np.array(list(map(int, input().split())))
S = input()
T = input()

#@njit


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


print(count)

Submission status: Accepted

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

Submission status: Accepted

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

df = 0

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

print(df)

Submission status: Accepted

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

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

print(cnt)

Submission status: Accepted

Solution code:
s = input()
t = input()
ans = 0
for a,b in zip(s,t):
    ans += (a != b)
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

s=input().rstrip()
t=input().rstrip()

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
from collections import Counter

S = input()
T = input()

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys
import math
import heapq
from collections import defaultdict, deque
input = sys.stdin.readline
def r():
    return int(input())
def rm():
    return map(int,input().split())
def rl():
    return list(map(int,input().split()))

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

print(count)