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:
"""
    こんにちは。これはクシャルです
    
    Author : thekushalghosh (クシャル)
    Team   : CodeDiggers
 
    I prefer Python language over the C++ language :p :D
        
    Visit my website : thekushalghosh.github.io
"""
import sys,math,cmath,time
start_time = time.time()
##########################################################################
################# ---- THE ACTUAL CODE STARTS BELOW ---- #################

def solve():
    s = insr()
    t = insr()
    c = 0
    for i in range(len(s)):
        if s[i] != t[i]:
            c = c + 1
    print(c)
            
################## ---- THE ACTUAL CODE ENDS ABOVE ---- ##################
##########################################################################
 
def main():
    global tt
    if not ONLINE_JUDGE:
        sys.stdin = open("input.txt","r")
        sys.stdout = open("output.txt","w")
    t = 1
    for tt in range(t):
        solve()
    if not ONLINE_JUDGE:
        print("Time Elapsed :",time.time() - start_time,"seconds")
        sys.stdout.close()
    
#---------------------- USER DEFINED INPUT FUNCTIONS ----------------------#
def inp():
    return(int(input()))
def inlt():
    return(list(map(int,input().split())))
def insr():
    return(input().strip())
def invr():
    return(map(int,input().split()))
 
#------------------ USER DEFINED PROGRAMMING FUNCTIONS ------------------#
def counter(a):
    q = [0] * max(a)
    for i in range(len(a)):
        q[a[i] - 1] = q[a[i] - 1],1
    return(q)
 
def string_counter(a):
    q = [0] * 26
    for i in range(len(a)):
        q[ord(a[i]) - 97] = q[ord(a[i]) - 97],1
    return(q)

def factors(n):
    q = []
    for i in range(1,int(n ** 0.5) + 1):
        if n % i == 0: q.append(i); q.append(n // i)
    return(list(sorted(list(set(q)))))

def prime_factors(n):
    q = []
    while n % 2 == 0: q.append(2); n = n // 2
    for i in range(3,int(n ** 0.5) + 1,2):
        while n % i == 0: q.append(i); n = n // i
    if n > 2: q.append(n)
    return(list(sorted(q)))

#-----------------------------------------------------------------------#
        
ONLINE_JUDGE = __debug__
if ONLINE_JUDGE:
    input = sys.stdin.readline
main()

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#B - Minor Change
S =input()
T = input()
cnt =0
for i in range(len(S)):
    if S[i] == T[i]:
        pass
    else:
        cnt += 1
print(cnt)

Submission status: Accepted

Solution code:
s = list(input())
t = list(input())
ans = 0
for num,i in enumerate(s):
    if i != t[num]:
        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
print(ans)

Submission status: Accepted

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

N = len(S1)
count = 0
for i in range(N):
    if S1[i] != S2[i]:
        count += 1
print(count)

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print(cnt)

Submission status: Accepted

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin, stdout
import heapq
import cProfile
from collections import Counter, defaultdict, deque
from functools import reduce
import math
from bisect import bisect,bisect_right,bisect_left

def get_int():
    return int(stdin.readline().strip())


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


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

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

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

print(c)

Submission status: Accepted

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

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

Submission status: Accepted

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

print(ans)

Submission status: Accepted

Solution code:
s=list(input())
t=list(input())
print(sum([x!=y for x,y in zip(s,t)]))

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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


cnt=0

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
from sys import stdin
s = stdin.readline().rstrip()
t = stdin.readline().rstrip()
answer = 0
for i in range(len(s)):
    if s[i] != t[i]:
        answer += 1
print(answer)

Submission status: Accepted

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

from pprint import pprint
from collections import deque, defaultdict
import itertools
import math
import sys

sys.setrecursionlimit(10 ** 6)
INF = float('inf')


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

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

print(res)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def INT():
    return int(input())

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

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

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

Submission status: Accepted

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

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

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

print(answer)

Submission status: Accepted

Solution code:
S = list(str(input()))
T = list(str(input()))
# = map(int, input().split())
# = list(map(int, input().split()))
# = [int(input()) for i in range(N)]
# = [list(map(int, input().split())) for i in range(N)]
count = 0

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

print(count)

Submission status: Accepted

Solution code:
import sys
from collections import deque
import copy
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()

length = len(s)
ans = 0
for a in range(length):
    if s[a] != t[a]:
        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:
#n, m, q = map(int, input().split())
#List = list(map(int, input().split()))
#req = [list(map(int, input().split())) for _ in range(q)]
#t = t[:-1]
#print(ans[j], end = "") 改行無しで出力
#[0]*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:
def main():
    import sys
    sys.setrecursionlimit(10**9)
    input = sys.stdin.readline

    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 = list(input()) #１文字ずつ
T = list(input()) #１文字ずつ
N = len(S)

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

Submission status: Accepted

Solution code:
if __name__ == '__main__':
    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:
#n = int(input())
#a,b = map(int,input().split())
#a_L = list(map(int,input().split()))

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 cs, ct in zip(s, t):
  if cs != ct:
    count += 1
print(count)

Submission status: Accepted

Solution code:
from collections import deque
import math

def Next(): return input()
def NextInt(): return int(Next())
def NextInts(): return map(int,input().split())
def Nexts(): return map(str,input().split())
def NextIntList(): return list(map(int,input().split()))
def RowInts(n): return [input() 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:
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:
#!usr/bin/env pypy3
from collections import defaultdict, deque
from heapq import heappush, heappop
from itertools import permutations, accumulate
import sys
import math
import bisect
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS():return [list(x) for x in sys.stdin.readline().split()]
def S():
    res = list(sys.stdin.readline())
    if res[-1] == "\n":
        return res[:-1]
    return res
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)]

sys.setrecursionlimit(1000000)

def main():
    S = input()
    T = input()
    ans = 0
    for (s, t) in zip(S, T):
        ans += 0 if s == t else 1
    print(ans) 

main()

Submission status: Accepted

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

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

    ret = 0

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# import sys
# readline = sys.stdin.readline
# generator = (readline().strip() for _ in range(N))

# N, M = map(int, input().split())
# As = list(map(int, input().split()))
# queries = (input() for _ in range(N))


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

    count = 0

    for i, s in enumerate(S):
        t = T[i]

        if s != t:
            count += 1
    return count


def main():
    print(solve())


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]): continue
  ans += 1

print(ans)

Submission status: Accepted

Solution code:
import math  # noqa: F401
from typing import Dict, List, Optional, Tuple, Union  # noqa: F401


def main(S: str, T: str):
    ans = 0
    for s, t in zip(list(S), list(T)):
        if s != t:
            ans += 1
    print(ans)


if __name__ == "__main__":
    S = input()
    T = input()
    main(S, T)

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:
# -*- coding: utf-8 -*-
S = list(input())
T = list(input())

print(sum([S[i] != T[i] for i in range(len(S))]))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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
input = lambda: sys.stdin.readline().rstrip()

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

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

    print(ans)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
def main():
    S = input()
    T = input()
    answer = len(S)

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

    print(answer)


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

if __name__ == '__main__':
    print(main())

Submission status: Accepted

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

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:
#: Author - Soumya Saurav
import sys,io,os,time
from collections import defaultdict
from collections import OrderedDict
from collections import deque
from itertools import combinations
from itertools import permutations
import bisect,math,heapq
alphabet = "abcdefghijklmnopqrstuvwxyz"

input = sys.stdin.readline

########################################

ans = 0
s = input()
t = input()
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
def main():
    S = list(input().rstrip())
    T = list(input().rstrip())
    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=list(input())
T=list(input())
cnt=0
for i in range(len(S)):
  if S[i]!=T[i]:
    cnt+=1
print(cnt)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

print(count)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def getN():
    return int(input())
def getNM():
    return map(int, input().split())
def getList():
    return list(map(int, input().split()))

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:
import sys

sys.setrecursionlimit(10 ** 8)
ini = lambda: int(sys.stdin.readline())
inm = lambda: map(int, sys.stdin.readline().split())
inl = lambda: list(inm())
ins = lambda: sys.stdin.readline().rstrip()
debug = lambda *a, **kw: print("\033[33m", *a, "\033[0m", **dict(file=sys.stderr, **kw))

s = ins()
t = ins()


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


print(solve())

Submission status: Accepted

Solution code:
s = input()
t = input()
ans = sum([1 for i, j in enumerate(s) if j!=t[i]])
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

cnt = 0

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

print(cnt)

Submission status: Accepted

Solution code:
S = input()
T = input()
# a = [int(_) for _ in input().split()]
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 i,j in zip(S, T):
    if i != j:
        ans += 1

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

if __name__ == "__main__":
    S = input()
    T = input()
    solve()

Submission status: Accepted

Solution code:
# coding: utf-8
import sys
# from operator import itemgetter
sysread = sys.stdin.readline
read = sys.stdin.read
sys.setrecursionlimit(10 ** 7)
#from heapq import heappop, heappush
#from collections import OrderedDict, defaultdict
#import math
#from itertools import product, accumulate, combinations, product
#import bisect# lower_bound etc
#import numpy as np
#from copy import deepcopy
#from collections import deque
#import numba

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

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

if __name__ == "__main__":
    run()

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

Submission status: Accepted

Solution code:
import sys

def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(N=None): return list(MAP()) if N is None else [INT() for i in range(N)]
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10 ** 9)
INF = 10 ** 19
MOD = 10 ** 9 + 7
EPS = 10 ** -10

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines

def main():
    S = readline().strip()
    T = readline().strip()

    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:
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:
#!/usr/bin/env python3
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, T = input(), input()
ans = 0
for s, t in zip(S, T):
    if s != t:
        ans += 1
print(ans)

Submission status: Accepted

Solution code:
from sys import stdin
import sys

S = input()
T = input()
cnt = 0
for i, v in enumerate(S):
    if T[i] != v:
        cnt += 1
print(cnt)

Submission status: Accepted

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

Submission status: Accepted

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

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:
def main():
    import sys
    input = sys.stdin.readline
    s = input().strip()
    t = input().strip()
    ans = 0
    for ss, tt in zip(s, t):
        if ss != tt:
            ans += 1
    print(ans)

if __name__ == '__main__':
    main()

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

Solution code:
import sys
import math

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

Submission status: Accepted

Solution code:
from fractions import gcd
from collections import Counter, deque, defaultdict
from heapq import heappush, heappop, heappushpop, heapify, heapreplace, merge
from bisect import bisect_left, bisect_right, bisect, insort_left, insort_right, insort
from itertools import accumulate, product, permutations, combinations

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

    res = 0

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
S = input()
T = input()
s = list(S)
t = list(T)
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 T[i] != S[i]:
        ans += 1
print(ans)

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:
import sys
def input(): return sys.stdin.readline().strip()
def mapint(): return map(int, input().split())
sys.setrecursionlimit(10**9)

S = str(input())
T = str(input())
leng = len(S)
ans = 0
for i in range(leng):
    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()
ans = 0
for s, t in zip(S, T):
    if s != t:
        ans += 1
print(ans)

Submission status: Accepted

Solution code:


s=input()
t=input()

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

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

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

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