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:
import sys
sys.setrecursionlimit(1 << 25)
read = sys.stdin.readline
ra = range
enu = enumerate


def exit(*argv, **kwarg):
    print(*argv, **kwarg)
    sys.exit()


def mina(*argv, sub=1): return list(map(lambda x: x - sub, argv))
# 受け渡されたすべての要素からsubだけ引く.リストを*をつけて展開しておくこと


def a_int(): return int(read())


def ints(): return list(map(int, read().split()))


def read_col(H):
    '''H is number of rows
    A列、B列が与えられるようなとき
    ex1)A,B=read_col(H)    ex2) A,=read_col(H) #一列の場合'''
    ret = []
    for _ in range(H):
        ret.append(list(map(int, read().split())))
    return tuple(map(list, zip(*ret)))


def read_tuple(H):
    '''H is number of rows'''
    ret = []
    for _ in range(H):
        ret.append(tuple(map(int, read().split())))
    return ret


def read_matrix(H):
    '''H is number of rows'''
    ret = []
    for _ in range(H):
        ret.append(list(map(int, read().split())))
    return ret
    # return [list(map(int, read().split())) for _ in range(H)] # 内包表記はpypyでは遅いため


MOD = 10**9 + 7
INF = 2**31  # 2147483648 > 10**9
# default import
from collections import defaultdict, Counter, deque
from operator import itemgetter, xor, add
from itertools import product, permutations, combinations
from bisect import bisect_left, bisect_right  # , insort_left, insort_right
from functools import reduce
from math import gcd


def lcm(a, b):
    # 最小公倍数
    g = gcd(a, b)
    return a // g * b


S = read()[:-1]
T = read()[:-1]
ans = 0
for s, t in zip(S, T):
    ans += s != t

print(ans)

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

Submission status: Accepted

Solution code:
x = input()
y = input()

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

Submission status: Accepted

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

replace = 0

for idx, st in enumerate(S):
  if st != T[idx]:
    replace += 1

print(replace)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
count=0
S=str(input())
T=str(input())
if 1<=len(S)<=2*(10**5) and 1<=len(T)<=2*(10**5):
    if len(S)==len(T) and (str.islower(S) and str.islower(T)):
         for i in range(len(S)):
                if S[i]==T[i]:
                    count=count+0
                else:
                    count=count+1
    else:
        print("wrong")
print(count)

Submission status: Accepted

Solution code:
S=input()
T=input()
num = 0
for i in range(len(T)):
  if not S[i] == 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(len(s)-cnt)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# atcoder 
# Türkler var mı?
# Herkese memnün oldum
import sys

iimr = lambda: map(int, sys.stdin.readline().rstrip().split())
readline = sys.stdin.readline
sys.setrecursionlimit(10 ** 8)


def 関数(s,t):
    tlen = len(t)
    fois = 0

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

    return fois

def çözmek():
    S = sys.stdin.readline().rstrip()
    T = sys.stdin.readline().rstrip()

    res = []
    res.append(関数(S, T))
    print(*res, sep="\n")

if __name__ == "__main__":
    çözmek()

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()
a = [str(a)for a in a]
b = input()
b = [str(b)for b in b]

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

print(count)

Submission status: Accepted

Solution code:
def main():
    S = input()
    T = input()
    answer = solve(S, T)
    print(answer)


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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

num = 0

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

print(num)

Submission status: Accepted

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

s = list(S[:])
t = list(T[:])

j=0

for i in range(len(S)):
    if s[i] == t[i]:
        j = j+0
    else:
        t[i]=s[i]
        j=j+1

print(j)

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("{}".format(ret))

Submission status: Accepted

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


cnt = 0
j = len(S)


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

Submission status: Accepted

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


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

Submission status: Accepted

Solution code:
s = input()
t = input()
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:
def calculate(s,t):
    count = 0
    j = 0
    for i in s:
        if i != t[j]:
            count += 1
        j += 1
    return count
    
s = input()
t = input()
print(calculate(s,t))

Submission status: Accepted

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

c = 0
for sc, tc, in zip(s, t) :
    if sc != tc:
        c +=1
print(c)

Submission status: Accepted

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

Submission status: Accepted

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

s.split()
t.split()

ans = 0

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

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())
length =len(S)
listS=list(S)
listT=list(T)
num = len(T)
res = 0
for i in range(length):
    if (listS[num-1] != listT[num-1]):
        res +=1
    num -=1
print(res)

Submission status: Accepted

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


def solve(S: str, T: str):
    count = 0
    for i in range(len(S)):
        if S[i] != T[i]: count += 1
    print(count)
    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:
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import bisect
import random
from itertools import permutations, accumulate, combinations, product
import sys
import string
from bisect import bisect_left, bisect_right
from math import factorial, ceil, floor, gcd, sqrt
from operator import mul
from functools import reduce
from operator import mul
from pprint import pprint



sys.setrecursionlimit(2147483647)
INF = 10 ** 20
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def I(): return int(sys.stdin.buffer.readline())
def LS(): return sys.stdin.buffer.readline().rstrip().decode('utf-8').split()
def S(): return sys.stdin.buffer.readline().rstrip().decode('utf-8')
def IR(n): return [I() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
def LSR(n): return [LS() for i in range(n)]
def SRL(n): return [list(S()) for i in range(n)]
def MSRL(n): return [[int(j) for j in list(S())] for i in range(n)]
mod = 1000000007


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

print(ret)

Submission status: Accepted

Solution code:
s = input()
t = input()
i = 0
num = 0

for c in s:
  if c != t[i]:
    num += 1
  i += 1

print(num)

Submission status: Accepted

Solution code:
list_S0 = input()
list_S1 = input()

n = 0
for i in range(len(list_S0)):
	if list_S0[i] != list_S1[i]:
  		n += 1
print(n)

Submission status: Accepted

Solution code:
import timeit

a = [input() for i in range(2)]

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

def count_diff2(S,T):
    cnt = 0
    for c1,c2 in zip(S, T):
        if c1 != c2:
            cnt += 1
    return cnt

print(count_diff2(S,T))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input=sys.stdin.readline
sys.setrecursionlimit(10 ** 8)
from itertools import accumulate
from itertools import permutations
from itertools import combinations
from collections import defaultdict
from collections import Counter
import fractions
import math
from collections import deque
from bisect import bisect_left
from bisect import bisect_right
from bisect import insort_left
import itertools
from heapq import heapify
from heapq import heappop
from heapq import heappush
import heapq
from copy import deepcopy
from decimal import Decimal
alf = list("abcdefghijklmnopqrstuvwxyz")
ALF = list("ABCDEFGHIJKLMNOPQRSTUVWXYZ")
#import numpy as np
INF = float("inf")
#d = defaultdict(int)
#d = defaultdict(list)
S = list(input())[:-1]
T = list(input())[:-1]
N = len(S)
ans = N
for i in range(N):
    if S[i] == T[i]:
        ans -= 1
print(ans)

Submission status: Accepted

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


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

  
print(count_diff2(S,T))

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
alist = list(str(input()))
blist = list(str(input()))

ret = 0

for num in range(0, len(alist)):
    if (alist[num] != blist[num]):
        ret += 1

print(ret)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# B - Minor Change
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:
s = input().strip()
t = input().strip()
r = 0
for c, u in zip(s, t):
    if c != u:
        r += 1
print(r)

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

Submission status: Accepted

Solution code:
def main():
  s1 =input()
  s2 =input()
    
  cnt = 0
      
  if s1 == s2:
    print('0')
  else:
    for c1,c2 in zip(s1, s2):
      if c1 != c2:
        cnt += 1
                  
    print(cnt)
                  
if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

length = len(a)
n = 0
for i in range(length):
    if a[i] is not b[i]:
        n += 1

print(n)

Submission status: Accepted

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


i = 0
n = 0
for i in range(0, len(s_list)):
  if s_list[i] != t_list[i]:
    i += 1
    n += 1
  else:
    i += 1
  
print(int(n))

Submission status: Accepted

Solution code:
if __name__ == "__main__":
    s = list(input())
    t = list(input())

    count = 0

    for i, _ in enumerate(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
  else:
    pass
print(count)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    from builtins import int, map, list, print, len
    import sys
    sys.setrecursionlimit(10 ** 6)

    input = (lambda: (sys.stdin.readline()).rstrip())
    input_list = (lambda: input().split())
    input_number = (lambda: int(input()))
    input_number_list = (lambda: list(map(int, input_list())))

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

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

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

Submission status: Accepted

Solution code:
s1=list(input())
s2=list(input())

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

Submission status: Accepted

Solution code:
s = list(input())
t = list(input())
k = []
for i in range(len(s)):
    k.append(s[i] == t[i])
print(len(s)-sum(k))

Submission status: Accepted

Solution code:
def count_diff(q,a):
    lst_q = list(q)
    lst_a = list(a)
    len_q = len(lst_q)
    ng = 0
    for i in range(len_q):
        if lst_q[i] != lst_a[i]:
            ng += 1
    print(ng)

q = input()
a = input()


count_diff(q,a)

Submission status: Accepted

Solution code:
str = [input() for i in range(2)]
S,T = list(str[0]),list(str[1])
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()
cnt = 0
for i, v in enumerate(zip(S,T)):
  if v[0] == v[1]:
    continue
  else:
    cnt += 1
print(cnt)

Submission status: Accepted

Solution code:
import sys
def input():return sys.stdin.readline()[:-1]
def N(): return int(input())
def NM():return map(int,input().split())
def L():return list(NM())
def LN(n):return [N() for i in range(n)]
def LL(n):return [L() for i in range(n)]
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:
q=input()
a=input()
lst_q = list(q)
lst_a = list(a)
len_q = len(lst_q)
ng = 0
for i in range(len_q):
    if lst_q[i] != lst_a[i]:
        ng += 1
print(ng)

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

Submission status: Accepted

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

Submission status: Accepted

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

def count_diff(S,T):
    cnt = 0
    for c1,c2 in zip(S, T):
        if c1 != c2:
            cnt += 1
    return cnt
print(count_diff(S,T))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


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

Submission status: Accepted

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

Snak = list(S)
Tnak = list(T)
for i in range(len(S)):
  if Snak[i] != Tnak[i]:
    C += 1
print(C)

Submission status: Accepted

Solution code:
s1 = input().split()
strS = s1[0]
s2 = input().split()
strT = s2[0]

charStrSList = list(strS)
charStrTList = list(strT)
diffStrList = []

idxA = 0
for sChar in charStrSList:
    if (sChar != charStrTList[idxA]) :
        diffStrList.append(sChar)
    idxA += 1

print(len(diffStrList))

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

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

print(count)

Submission status: Accepted

Solution code:
def main():
    s = input()
    t = input()
    ans = sum(map(lambda x: x[0]!=x[1], zip(s, t)))
    print(ans)
 
 
if __name__ == '__main__':
    import sys
    sys.setrecursionlimit(10000)
    main()

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

Solution code:
import sys
import math

s = list(input())

t = list(input())


if s[0]==0 or t[0]==0:
    sys.exit(0)

i = 0
cnt = 0
while i<len(s):
    if i == 2*(pow(10,5)):
        sys.exit(0)
    if s[i]!=t[i]:
        cnt += 1
    i += 1

print(cnt)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import  math
import fractions
from collections import defaultdict
stdin = sys.stdin
     
ns = lambda: stdin.readline().rstrip()
ni = lambda: int(stdin.readline().rstrip())
nm = lambda: map(int, stdin.readline().split())
nl = lambda: list(map(int, stdin.readline().split()))

S=list(ns())
T=list(ns())
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 a,b in zip(S,T):
  if(a!=b):
    count+=1
    
print(count)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

a = 0

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

print(a)

Submission status: Accepted

Solution code:
S = str(input())
T = str(input())
nagasa = len(S)
j = 0
i = 0
while i<nagasa:
    if (S[i]!=T[i]):
        j=j+1
    i=i+1
print(j)

Submission status: Accepted

Solution code:
s = str(input())
t = str(input())
lists = list(s)
listt = list(t)
cnt = 0
for index in range(len(lists)):
    if lists[index] == listt[index] :
        cnt += 1
print(len(lists)-cnt)

Submission status: Accepted

Solution code:
n=input()
m=input()
count =0
i=0
while i < len(n):

  if n[i] != m[i]:
    count +=1
  
  i +=1

print(count)

Submission status: Accepted

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

Submission status: Accepted

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

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

print(count)

Submission status: Accepted

Solution code:
a, b = [input() for i in range(2)]

count = 0
out = 0
if a == b:
  print("0")
else:
  c = list(a)
  d = list(b)
  for i in c:
    if i == d[count]:
      pass
    else:
      out = out + 1
    count = count + 1
  print(str(out))

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

def count_diff(a,b):

    cnt = 0
    for c1,c2 in zip(a, b):
        if c1 != c2:
            cnt += 1
    return cnt
    
print(count_diff(S, T))

Submission status: Accepted

Solution code:
S = list(map(str,input()))
T = list(map(str,input()))

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

print(count_diff(S,T))

Submission status: Accepted

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

Submission status: Accepted

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

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

print(add)

Submission status: Accepted

Solution code:
s = input()
t = input()
st = list(s)
ts = list(t)
j = 0
for i in range(len(st)):
    if(st[i] == ts[i]):
        j = j
    elif(st[i] != ts[i]):
        ts[i] = st[i]
        j = j + 1

# print(st)
# print(ts)
print(j)

Submission status: Accepted

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

ans = 0
l=len(S)

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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()

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = str(input())
T = str(input())
N = 0
Count = []
for i in range(len(S)):
    if S[N] != T[N]:
        Count.append(1)
    N += 1
print(len(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:
a=list(input())
b=list(input())
#AandB=set(a) & set(b)
ans=0
for i in range(len(a)):
  if(a[i]!=b[i]):
    ans=ans+1
#ans=len(a)-len(AandB)
print(ans)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
# テキストの入力
S = input()
T = input()

#　文字数取得
mojisuu=len(S)
Ans=0

# 文字数分ループを回して1文字ずつ比較
for i in range(mojisuu):
  if S[i] != T[i]:
    Ans += 1

print(Ans)

Submission status: Accepted

Solution code:
S = str(input())
T = str(input())
N = 0
Count = []
for i in range(len(S)):
    if S[N] != T[N]:
        Count.append(1)
    else:
        pass
    N += 1
print(len(Count))

Submission status: Accepted

Solution code:
a = [input() for i in range(2)]

mm = list(a[0])
nn = list(a[1])
count = 0

for (m, n) in zip(mm, nn):
	if m != n: 
  		count += 1
        
print(count)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
S1 = list(input())
S2 = list(input())

count = 0
for s1,s2 in zip(S1,S2):
  if s1 != s2:
    count+=1

print(count)

Submission status: Accepted

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

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

Submission status: Accepted

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

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

print(ct)

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

Submission status: Accepted

Solution code:
s = input()
t = input()
result = len([a for a,b in zip(s,t) if a != b])
print(result)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import sys
input = sys.stdin.readline
s = str(input())
t = str(input())
st = [1 if s_!=t_ else 0 for s_,t_ in zip(s,t)]
print(sum(st))

Submission status: Accepted

Solution code:
c1 = input()
c2 = input()
print(sum([1 for i in range(len(c1)) if c1[i] != c2[i] ]))

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:
a = input().strip()
b = input().strip()

count = 0

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

Submission status: Accepted

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

x=[]
for i,j in u: 
    if i==j:
        continue 
    else: 
        x.append(j)

print(len(x))

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
s = input()
t = input()
ans = 0
if s == t:
    print(0)
else:
    for i in range(len(s)):
        if s[i] == t[i]:
            continue
        else:
            ans += 1
    print(ans)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()
s = list(S)
T = input()
t = list(T)
s1=s[0]
t1=t[0]
count = 0
j=0
for i in S:
  if(s[j]!=t[j]):
    count=count+1
  j=j+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=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:
a = list(input())
b = list(input())
count = 0

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

Submission status: Accepted

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