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:
strs = input()
strt = input()
lss = list(strs)
lst = list(strt)

k = 0
for i in range(len(lss)):
  if lss[i] != lst[i]:
    k = k + 1
print(k)

Submission status: Accepted

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

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())
le = len(a)
su = 0
for i, _ in enumerate(a):
 if not _ == b[i]:
     su +=1
print(su)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
str1=input()
str2=input()

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

Submission status: Accepted

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

print(sum([int(i!=j) for i,j in zip(S,T)]))

Submission status: Accepted

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

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

print(count)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

S = input()
T = input()

n=0

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

print(n)

Submission status: Accepted

Solution code:
m = list(input())
n = list(input())
re = 0

for i in range(len(m)):
    if(m[i] != n[i]):
        re += 1

print(re)

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

Submission status: Accepted

Solution code:

list = [input(),input()]
#print (list)
#print (list[0][-1])

mojiretu = list[0]
nagasa = len(mojiretu) #nagasaで文字列の長さを取得
#print(mojiretu)
#print(nagasa)

#print("forのテスト")

counter = 0
for hantei in range(nagasa):
  if list[0][hantei] == list[1][hantei]:
    pass
    #print("OK",hantei) #1文字目判定
  else:
    #print("NG",hantei)
    counter = counter + 1
  
print(counter)

Submission status: Accepted

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

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 main():
    S = input()
    T = input()
    ans = 0

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

def main_2(): 
    ans = main()
    print(ans)

main_2()

Submission status: Accepted

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

Submission status: Accepted

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

# s = 'cupofcoffee'
# t = 'cupofhottea'

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

Submission status: Accepted

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

N = len(S)
c = 0
for i in range(N):
  if T[i] != S[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:
def minchange(s,t):
  m=len(s)
  n=len(t)
  if n!=m:
    return -1
  cnt=[0]*256
  for i in range(n):
    cnt[ord(t[i])]+=1
  for i in range(n):
    cnt[ord(s[i])]-=1
  res=0
  i=n-1
  j=n-1
  while i>=0:
    while i>=0 and s[i]!=t[i]:
      i-=1
      res+=1
    if i>=0:
      i-=1
      j-=1
  return res
s=input()
t=input()
print(str(minchange(s,t)))

Submission status: Accepted

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

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

print(ii)

Submission status: Accepted

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

Submission status: Accepted

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

x = zip(S, T)
same = []
diff = []
for i, j in x:
    if i == j:
        same.append(i)
    else:
        diff.append(j)


print(len(diff))

Submission status: Accepted

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

Submission status: Accepted

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

L = len(S)

counter = 0

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


print(counter)

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

print(cnt)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A = str(input())
B = str(input())
l = len(A)
C = 0
for i in range(0, l):
    if A[i] != B[i]:
        C =C + 1
print(C)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
S = list(input())
T = list(input())
total = 0
for num in range(len(S)):
    if S[num] != T[num]:
        total += 1
print(total)

Submission status: Accepted

Solution code:
#Minor Change
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:
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()
n = 0
for i in range(len(S)):
    if not S[i] == T[i]:
        n = n+1
print(n)

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

n = len(a)

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

print(cnt)

Submission status: Accepted

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

print(c)

Submission status: Accepted

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

Submission status: Accepted

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

c = 0

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

print(c)

Submission status: Accepted

Solution code:
from sys import stdin
#, setrecursionlimit, stdout
#setrecursionlimit(1000000)
#from collections import deque
#from math import sqrt, floor, ceil, log, log2, log10, pi, gcd, sin, cos, asin
#from heapq import heapify, heappop, heappush, heappushpop, heapreplace
def ii(): return int(stdin.readline())
def fi(): return float(stdin.readline())
def mi(): return map(int, stdin.readline().split())
def fmi(): return map(float, stdin.readline().split())
def li(): return list(mi())
def si(): return stdin.readline().rstrip()
def lsi(): return list(si())
#mod=1000000007
res=['NET', 'DA']
############# CODE STARTS HERE #############


test_case=1
while test_case:
    test_case-=1


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

Submission status: Accepted

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

A=len(S)

a=1
b=0
for a in range(A):
    if S[a]!=T[a]:
        b=b+1

print(b)

Submission status: Accepted

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

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:
#import functools

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

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

cnt = 0


for n in range(len(S_list)):
    if S_list[n] != T_list[n]:
        cnt += 1

print(cnt)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
'''
    Auther: ghoshashis545 Ashis Ghosh
    College: jalpaiguri Govt Enggineering College

'''
from os import path
import sys
from functools import cmp_to_key as ctk
from collections import deque,defaultdict as dd 
from bisect import bisect,bisect_left,bisect_right,insort,insort_left,insort_right
from itertools import permutations
from datetime import datetime
from math import ceil,sqrt,log,gcd
def ii():return int(input())
def si():return input()
def mi():return map(int,input().split())
def li():return list(mi())
abc='abcdefghijklmnopqrstuvwxyz'
mod=1000000007
#mod=998244353
inf = float("inf")
vow=['a','e','i','o','u']
dx,dy=[-1,1,0,0],[0,0,1,-1]

def bo(i):
    return ord(i)-ord('a')



def solve():
    
    # for _ in range(ii()):

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










        
if __name__ =="__main__":

    if path.exists('input.txt'):
        sys.stdin=open('input.txt', 'r')
        sys.stdout=open('output.txt','w')
    else:
        input=sys.stdin.readline
    solve()

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

Submission status: Accepted

Solution code:
S = list(input())
T = list(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()
 
res = sum(0 if s == t else 1 for s, t in zip(S,T))
print(res)

Submission status: Accepted

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

N = len(S)
LS = list(S)
LT = list(T)
cnt = 0

for i in range(N):
    if LS[i] != LT[i]:
        cnt += 1

print(cnt)

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

  print(count)

Submission status: Accepted

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

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

Submission status: Accepted

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

count = 0
i=0

while a!=b:
    if a[i] != b[i]:
        count+=1
    i+=1
    if i >= len(a):
        break

print(count)

Submission status: Accepted

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

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

	print(count)
main ()

Submission status: Accepted

Solution code:
def MinorChange():

    str1 = str(input())
    str2 = str(input())

    data = []

    for num in range(len(str1)):
        if str1[num] != str2[num]:
            data.append(str2[num])

    print(len(data))

if __name__ == '__main__':
    MinorChange()

Submission status: Accepted

Solution code:
S = input()
T = input()
 
print(len([x for x in map(set, zip(S, T)) if len(x) == 2]))

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:
#!/usr/bin/env python3
# N,M = map(int,sys.stdin.readline().split())
# a = tuple(map(int,sys.stdin.readline().split())) # single line with multi param
# a = tuple(int(sys.stdin.readline()) for _ in range(N)) # multi line with single param
# a = tuple(tuple(map(int,sys.stdin.readline().rstrip().split())) for _ in range(N)) # multi line with multi param
# s = sys.stdin.readline().rstrip()
# N = int(sys.stdin.readline())
# INF = float("inf")
import sys

s = sys.stdin.readline().rstrip()
t = sys.stdin.readline().rstrip()
n = len(s)

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

print(ret)

Submission status: Accepted

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


#sys.setrecursionlimit(10**9)
#from functools import lru_cache

def RD(): return sys.stdin.read()
def II(): return int(input())
def MI(): return map(int,input().split())
def MF(): return map(float,input().split())
def LI(): return list(map(int,input().split()))
def LF(): return list(map(float,input().split()))
def TI(): return tuple(map(int,input().split()))
# rstrip().decode()

#import numpy as np

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

	ans=0

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

	print(ans)





if __name__ == "__main__":
	main()

Submission status: Accepted

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

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

print(count)

Submission status: Accepted

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

print(sum)

Submission status: Accepted

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

Submission status: Accepted

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

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

cnt = 0

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

print(cnt)

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

count = 0
if S != T:
  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]:
        t[i].replace(t[i], s[i])
        cnt += 1

print(cnt)

Submission status: Accepted

Solution code:
# coding: utf-8

str_s = input()
str_t = input()
str_len = len(str_s)
str_match_cnt = 0

st_converter = lambda s,t : s == t

for i in range(str_len):
    if not st_converter(str_s[i], str_t[i]):
        str_match_cnt += 1

print(str_match_cnt)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

n=len(ss)
x=0
for i in range(0,n):
  if ss[i] !=tt[i]:
    x=x+1
print(x)

Submission status: Accepted

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

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

print(count)

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

A=len(S)
turns=0

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

Submission status: Accepted

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

Submission status: Accepted

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

import sys
from typing import Any, Callable, Deque, Dict, List, Mapping, Optional, Sequence, Set, Tuple, TypeVar, Union
# import time
# import math
# import numpy as np
# import scipy.sparse.csgraph as cs            # csgraph_from_dense(ndarray, null_value=inf), bellman_ford(G, return_predecessors=True), dijkstra, floyd_warshall
# import random                                # random, uniform, randint, randrange, shuffle, sample
# import string                                # ascii_lowercase, ascii_uppercase, ascii_letters, digits, hexdigits
# import re                                    # re.compile(pattern) => ptn obj; p.search(s), p.match(s), p.finditer(s) => match obj; p.sub(after, s)
# from bisect import bisect_left, bisect_right # bisect_left(a, x, lo=0, hi=len(a)) returns i such that all(val<x for val in a[lo:i]) and all(val>-=x for val in a[i:hi]).
# from collections import deque                # deque class. deque(L): dq.append(x), dq.appendleft(x), dq.pop(), dq.popleft(), dq.rotate()
# from collections import defaultdict          # subclass of dict. defaultdict(facroty)
# from collections import Counter              # subclass of dict. Counter(iter): c.elements(), c.most_common(n), c.subtract(iter)
# from datetime import date, datetime          # date.today(), date(year,month,day) => date obj; datetime.now(), datetime(year,month,day,hour,second,microsecond) => datetime obj; subtraction => timedelta obj
# from datetime.datetime import strptime       # strptime('2019/01/01 10:05:20', '%Y/%m/%d/ %H:%M:%S') returns datetime obj
# from datetime import timedelta               # td.days, td.seconds, td.microseconds, td.total_seconds(). abs function is also available.
# from copy import copy, deepcopy              # use deepcopy to copy multi-dimentional matrix without reference
# from functools import reduce                 # reduce(f, iter[, init])
# from functools import lru_cache              # @lrucache ...arguments of functions should be able to be keys of dict (e.g. list is not allowed)
# from heapq import heapify, heappush, heappop # built-in list. heapify(L) changes list in-place to min-heap in O(n), heappush(heapL, x) and heappop(heapL) in O(lgn).
# from heapq import nlargest, nsmallest        # nlargest(n, iter[, key]) returns k-largest-list in O(n+klgn).
# from itertools import count, cycle, repeat   # count(start[,step]), cycle(iter), repeat(elm[,n])
# from itertools import groupby                # [(k, list(g)) for k, g in groupby('000112')] returns [('0',['0','0','0']), ('1',['1','1']), ('2',['2'])]
# from itertools import starmap                # starmap(pow, [[2,5], [3,2]]) returns [32, 9]
# from itertools import product, permutations  # product(iter, repeat=n), permutations(iter[,r])
# from itertools import combinations, combinations_with_replacement
# from itertools import accumulate             # accumulate(iter[, f])
# from operator import itemgetter              # itemgetter(1), itemgetter('key')
# from fractions import Fraction               # Fraction(a, b) => a / b ∈ Q. note: Fraction(0.1) do not returns Fraciton(1, 10). Fraction('0.1') returns Fraction(1, 10)



def main():
    mod = 1000000007                # 10^9+7
    inf = float('inf')              # sys.float_info.max = 1.79e+308
    # inf = 2 ** 63 - 1             # (for fast JIT compile in PyPy) 9.22e+18
    sys.setrecursionlimit(10**6)    # 1000 -> 1000000
    def input(): return sys.stdin.readline().rstrip()
    def ii():    return int(input())
    def isp():   return input().split()
    def mi():    return map(int, input().split())
    def mi_0():  return map(lambda x: int(x)-1, input().split())
    def lmi():   return list(map(int, input().split()))
    def lmi_0(): return list(map(lambda x: int(x)-1, input().split()))
    def li():    return list(input())
    
    
    s = input()
    t = input()
    n = len(s)
    cnt = 0
    for i in range(n):
        if s[i] != t[i]:
            cnt += 1
    print(cnt)

if __name__ == "__main__":
    main()

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

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

a = 0
for c1, c2 in zip(s, t):
    if c1 != c2:
        a += 1
print(a)

Submission status: Accepted

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

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

print(diff)

Submission status: Accepted

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

Submission status: Accepted

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

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

answer=0
i=0
while i<len(a):
 if a[i]!=b[i]:
  answer = answer+ 1
 i =i+1

print(answer)

Submission status: Accepted

Solution code:
import sys
readline = sys.stdin.buffer.readline
def even(n): return 1 if n%2==0 else 0

s = readline().rstrip().decode('utf-8')
t = readline().rstrip().decode('utf-8')
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())

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:
a = (input())
# スペース区切りの整数の入力
b = (input())
count=-1
count1=0
count2=len(a)
for str in a:
    count+=1
    if str==b[count]:
        count1+=1
print(count2-count1)

Submission status: Accepted

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

length = len(S)
ans = 0

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

print(ans)

Submission status: Accepted

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

for i in range(0,l):
  if s[i] != t[i]:
    count=count+1
  else:
    pass

print(count)

Submission status: Accepted

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

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

print(count)

Submission status: Accepted

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

Len = len(S)
count = 0

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

print(count)

Submission status: Accepted

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

Submission status: Accepted

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

ans=0
num=0
for t in T:
    if t!=S[num]:
        ans+=1
        num+=1
    else:
        num+=1
        continue
print(ans)

Submission status: Accepted

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

for index, s in enumerate(S):
    if(T[index] != s): cnt += 1 
    
print(cnt)

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:
import sys
input = sys.stdin.readline
#-------------------------------------

s = list(input())
t = list(input())
# print(s,t)

count = 0
for i,v in enumerate(t):
     # print(i,v,s[i])
     if s[i] != v:
          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 = list(input())
t = list(input())


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

print(time)

Submission status: Accepted

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

count = 0

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

print(count)

Submission status: Accepted

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

sl = len(s)

count = 0

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

print(count)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
# 整数の入力
s = list(input())
t = list(input())

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

# 出力
print("{}".format(c))

Submission status: Accepted

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

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

print(counter)

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

Submission status: Accepted

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

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:
a = input()
b = input()
c = 0
for j in range(0,len(a),1):
  if a[j]!=b[j]:
    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:
N = input()
S = input()
lista = list(N)
listb = list(S)
cnt = 0

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

print(cnt)

Submission status: Accepted

Solution code:
a = input()
b = input()
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 = list(input())
T = list(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:
s1 = input()
s2 = input()

count = 0
for a,b in zip(s1,s2):
  if a != b:
    count += 1
    
print(count)

Submission status: Accepted

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

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

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

print(count)

Submission status: Accepted

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

print(count)

Submission status: Accepted

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

list_S = list(S)
list_T = list(T)

counter = 0
l = int(len(list_S))

for x in range(l):
    if list_S[x] == list_T[x]:
        continue

    else:
        counter = counter + 1

print(counter)

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:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
s = input()
t = input()

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

Submission status: Accepted

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