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:
"""
    Satwik_Tiwari ;) .
    4th july , 2020  - Saturday
"""

#===============================================================================================
#importing some useful libraries.
from __future__ import division, print_function

from fractions import Fraction
import sys
import os
from io import BytesIO, IOBase


import bisect
from heapq import *
from math import *
from collections import deque
from collections import Counter as counter  # Counter(list)  return a dict with {key: count}
from itertools import combinations as comb # if a = [1,2,3] then print(list(comb(a,2))) -----> [(1, 2), (1, 3), (2, 3)]
from itertools import permutations as permutate
from bisect import bisect_left as bl
#If the element is already present in the list,
# the left most position where element has to be inserted is returned.
from bisect import bisect_right as br
from bisect import bisect
#If the element is already present in the list,
# the right most position where element has to be inserted is returned

#==============================================================================================

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


def print(*args, **kwargs):
    """Prints the values to a stream, or to sys.stdout by default."""
    sep, file = kwargs.pop("sep", " "), kwargs.pop("file", sys.stdout)
    at_start = True
    for x in args:
        if not at_start:
            file.write(sep)
        file.write(str(x))
        at_start = False
    file.write(kwargs.pop("end", "\n"))
    if kwargs.pop("flush", False):
        file.flush()


if sys.version_info[0] < 3:
    sys.stdin, sys.stdout = FastIO(sys.stdin), FastIO(sys.stdout)
else:
    sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)

# inp = lambda: sys.stdin.readline().rstrip("\r\n")

#===============================================================================================
#some shortcuts

mod = 1000000007
def inp(): return sys.stdin.readline().rstrip("\r\n") #for fast input
def out(var): sys.stdout.write(str(var))  #for fast output, always take string
def lis(): return list(map(int, inp().split()))
def stringlis(): return list(map(str, inp().split()))
def sep(): return map(int, inp().split())
def strsep(): return map(str, inp().split())
# def graph(vertex): return [[] for i in range(0,vertex+1)]
def zerolist(n): return [0]*n
def nextline(): out("\n")  #as stdout.write always print sring.
def testcase(t):
    for p in range(t):
        solve()
def printlist(a) :
    for p in range(0,len(a)):
        out(str(a[p]) + ' ')
def lcm(a,b): return (a*b)//gcd(a,b)
def power(a,b):
    ans = 1
    while(b>0):
        if(b%2==1):
            ans*=a
        a*=a
        b//=2
    return ans
def ncr(n,r): return factorial(n)//(factorial(r)*factorial(max(n-r,1)))
def isPrime(n) : # Check Prime Number or not
    if (n <= 1) : return False
    if (n <= 3) : return True
    if (n % 2 == 0 or n % 3 == 0) : return False
    i = 5
    while(i * i <= n) :
        if (n % i == 0 or n % (i + 2) == 0) :
            return False
        i = i + 6
    return True

#===============================================================================================
# code here ;))
def bs(a,l,h,x):
    while(l<h):
        # print(l,h)
        mid = (l+h)//2
        if(a[mid] == x):
            return mid
        if(a[mid] < x):
            l = mid+1
        else:
            h = mid
    return l

def sieve(a): #O(n loglogn) nearly linear
    #all odd mark 1
    for i in range(3,((10**6)+1),2):
        a[i] = 1
    #marking multiples of i form i*i 0. they are nt prime
    for i in range(3,((10**6)+1),2):
        for j in range(i*i,((10**6)+1),i):
            a[j] = 0
    a[2] = 1 #special left case
    return (a)


def bfs(g,st):
    visited = [-1]*(len(g))
    visited[st] = 0
    queue = []
    queue.append(st)
    new = []
    while(len(queue) != 0):
        s = queue.pop()
        new.append(s)
        for i in g[s]:
            if(visited[i] == -1):
                visited[i] = visited[s]+1
                queue.append(i)
    return visited


def dfsusingstack(v,st):
    d = deque([])
    visited = [0]*(len(v))
    d.append(st)
    new = []
    visited[st] = 1
    while(len(d) != 0):
        curr = d.pop()
        new.append(curr)
        for i in v[curr]:
            if(visited[i] == 0):
                visited[i] = 1
                d.append(i)
    return new

# 6
# 1 -1 2 3 -5 0
def solve():
    a = list(inp())
    b = list(inp())
    cnt = 0
    for i in range(0,len(a)):
        if(a[i] == b[i]):
            continue
        else:
            cnt+=1
    print(cnt)


testcase(1)
# testcase(int(inp()))

Submission status: Accepted

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

# words_a = list(a)
# words_b = list(b)
# # リストから共通のものを取り出す。
# matched_list = []
# for a in words_a:
#   for b in words_b:
#     if a!=b:
#       matched_list.append(a)

# print(len(matched_list))

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

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

print(count)

Submission status: Accepted

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

Submission status: Accepted

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

count = 0

for i,j in zip(s,t):
    if i != j:
        i = j
        count += 1
    else:
        continue

print(count)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N=input()
M=input()
count=0
for i in range(len(N)):
    if N[i]!=M[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:
print(sum([not s == t for s, t in zip(input(), input())]))

Submission status: Accepted

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

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
    else:
        continue
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(sum(s != t for s, t in zip(S, T)))

Submission status: Accepted

Solution code:
S = input()
T = input()
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(len(S)):
    count += S[i] != T[i]

print(count)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
inp = [input() for str in range(2)]

out = 0
for i in range(len(inp[0])):
	if inp[0][i] != inp[1][i]:
  		out += 1
        
print(out)

Submission status: Accepted

Solution code:
import sys

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

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

Submission status: Accepted

Solution code:
import sys
import time
import math
st = time.perf_counter()
def inpl():
    return list(map(int, input().split()))
# ------------------------------


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

print(ans)


# ------------------------------
ed = time.perf_counter()
print('time:', ed-st, file=sys.stderr)

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
S = list(i for i in input())
T = list(i for i in input())

counter = 0

while(S != T):
    for i in range(len(S)):
        if S[i] != T[i]:
            S[i] = T[i]
            counter = counter + 1
        else:
            pass

print(counter)

Submission status: Accepted

Solution code:

data = input()
data1 = input()

cnt = 0
for i in range(0, len(data)):
    if data[i] != data1[i]:
        cnt += 1

print(cnt)

Submission status: Accepted

Solution code:
def main():
    S = input().rstrip()
    T = input().rstrip()
    ans = 0
    for s, t in zip(S, T):
        if s != t:
            ans += 1
    print(ans)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
list1 = list(input())
list2 = list(input())

times = 0

for index, alpha in enumerate(list1):
    if list2[index] == alpha:
        pass
    else:
        list1[index] == list2[index]
        times += 1
print(times)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
S, T = [list(input()) for i in range(2)]
t = 0
for i in range(len(S)):
  if S[i] == T[i]:
    continue
  else:
    t += 1
print(t)

Submission status: Accepted

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

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

print(count)

Submission status: Accepted

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

print(len([0 for s, t in zip(S, T) if s != t]))

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

Submission status: Accepted

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

Submission status: Accepted

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

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 not (s[i] == t[i]): count += 1
print(count)

Submission status: Accepted

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

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

print(cnt)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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 = input().strip()
T = input().strip()
 
c = 0
 
for s,t in zip(S,T):
  if s != t:
    c += 1
print(c)

Submission status: Accepted

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

c = 0

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

Submission status: Accepted

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

print(s)

Submission status: Accepted

Solution code:
import sys
input = lambda: sys.stdin.readline().rstrip("\r\n")

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:
#!/usr/bin/env python3
import sys


def II(): return int(sys.stdin.readline())


def MI(): return map(int, sys.stdin.readline().split())


def LI(): return list(map(int, sys.stdin.readline().split()))


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


# oj t -c "pypy3 main.py"
# acc s main.py -- --guess-python-interpreter pypy3
main()

Submission status: Accepted

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

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

print(number)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:

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

Submission status: Accepted

Solution code:
source = input()
target = input()

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

S = ''.join(S)
T = ''.join(T)

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

cnt = 0

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

Submission status: Accepted

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

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

print(cnt)

Submission status: Accepted

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

Submission status: Accepted

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

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

print(count)

Submission status: Accepted

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

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

print(q)

Submission status: Accepted

Solution code:
# Problem B - Minor Change

# input
S = list(input())
T = list(input())

# initialization
str_len = len(S)
count = 0

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

# output
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:
str1 = list(input())
str2 = list(input())
count = 0
for s in range(len(str1)):
  if str1[s] != str2[s]:
    count += 1
print(count)

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

Submission status: Accepted

Solution code:
import sys, bisect, math, itertools, string, queue, copy
# import numpy as np
# import scipy
# from scipy.sparse.csgraph import floyd_warshall
from collections import Counter,defaultdict,deque
from itertools import permutations, combinations, combinations_with_replacement
from heapq import heappop, heappush, heapify
from fractions import gcd
# input = sys.stdin.readline
sys.setrecursionlimit(10**8)
mod = 10**9+7
def inp(): return int(input())
def inpm(): return map(int,input().split())
def inpl(): return list(map(int, input().split()))
def inpls(): return list(input().split())
def inplm(n): return list(int(input()) for _ in range(n))
def inplL(n): return [list(input()) for _ in range(n)]
def inplT(n): return [tuple(input()) for _ in range(n)]
def inpll(n): return [list(map(int, input().split())) for _ in range(n)]
def inplls(n): return sorted([list(map(int, input().split())) for _ in range(n)])

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

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

print(ans)

Submission status: Accepted

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

c=0

for i in range(len(a)):

  if a[i]==b[i]:
    c+=0

  else:
    c+=1

print(c)

Submission status: Accepted

Solution code:
S = list(input())
T = list(input())
ans = 0
#print(type(range(len(S))))

for i in range(len(S)): #→for文で回せるようなiterableなものの例：range,リスト，タプル，集合，辞書，文字列
    #print(S[i])
    #print(T[i])
    if not S[i] == T[i]:
        ans += 1
print(ans)



#print(S)
#print(T)

Submission status: Accepted

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

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

print(count)

Submission status: Accepted

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

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

print(count)

Submission status: Accepted

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

S_l = len(S)
T_l = len(T)
cnt = 0

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

Submission status: Accepted

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

Submission status: Accepted

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

print(counter)

Submission status: Accepted

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

c=0

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

print(c)

Submission status: Accepted

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

sum = 0

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# B - Minor Change
s = input()
t = input()
ans = 0

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

print(ans)

Submission status: Accepted

Solution code:
#入力
s = str(input())
t = str(input())

#変数
count = 0

#必要な値を計算
l = len(s)

#処理
for i in range(l):
    if (s[i] != t[i]):
        count += 1

#出力
print(count)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print(a)

Submission status: Accepted

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

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
l = len(s)

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

print(count)

Submission status: Accepted

Solution code:
ss1 = input()
ss2 = input()

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

print(count)

Submission status: Accepted

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#import 
s=input()
t=input()
#=int(input())
#=map(int,input().split())
#=list(map(int,input().split()))
#=[list(map(int,input().split())) for _ in range()]

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

Submission status: Accepted

Solution code:
import sys
import math
import collections
import decimal
import itertools
from collections import deque
from functools import reduce
import heapq
#a = int(input())
#h, w = map(int, sys.stdin.readline().split())
s = input()
#a = list(map(int, sys.stdin.readline().split()))

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()
n=len(S)
c=0
for i in range(n):
    if S[i]!=T[i]:
        c=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:
a = [input() for i in range(2)]

asize = len(a[0])
count = 0
for i in range(asize):
    if a[0][i] == a[1][i]:
        continue
    else:
        count += 1
        
print(str(count))

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:
x = input()
y = input()

count = 0
for i in range(len(x)):
	if x[i] != y[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:
S = list(str(input()))
T = list(str(input()))

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

Submission status: Accepted

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

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

print(count)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#import numpy as np
import math
import collections
import bisect
from difflib import SequenceMatcher


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

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

Submission status: Accepted

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

list=list(zip(S,T))

c=0
for i in list:
    if i[0]!=i[1]:
        c+=1    
print(c)

Submission status: Accepted

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

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()
T = input()
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 = cnt + 1
    
print(cnt)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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)