Problem:


Score : 200 points

Problem Statement

Given are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so.

Operation: Choose one character of S and replace it with a different character.

Constraints

S and T have lengths between 1 and 2\times 10^5 (inclusive).

S and T consists of lowercase English letters.

S and T have equal lengths.

Input

Input is given from Standard Input in the following format:

S
T

Output

Print the answer.

Sample Input 1

cupofcoffee
cupofhottea

Sample Output 1

4

We can achieve the objective in four operations, such as the following:

First, replace the sixth character c with h.

Second, replace the eighth character f with t.

Third, replace the ninth character f with t.

Fourth, replace the eleventh character e with a.

Sample Input 2

abcde
bcdea

Sample Output 2

5

Sample Input 3

apple
apple

Sample Output 3

0

No operations may be needed to achieve the objective.



Sample input:
cupofcoffee
cupofhottea


Sample output:
4

Submission status: Accepted

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

Submission status: Accepted

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

i=0
ans=0

while i<len(s):

    if s[i]!=t[i]:
        ans+=1

    i+=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:
# -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, product, permutations
from operator import add, mul, sub


import sys
# sys.setrecursionlimit(10**6)
# buff_readline = sys.stdin.buffer.readline
buff_readline = sys.stdin.readline
readline = sys.stdin.readline

INF = 2**62-1


def read_int():
    return int(buff_readline())


def read_int_n():
    return list(map(int, buff_readline().split()))


def read_float():
    return float(buff_readline())


def read_float_n():
    return list(map(float, buff_readline().split()))


def read_str():
    return readline().strip()


def read_str_n():
    return readline().strip().split()

def error_print(*args):
    print(*args, file=sys.stderr)


def mt(f):
    import time

    def wrap(*args, **kwargs):
        s = time.time()
        ret = f(*args, **kwargs)
        e = time.time()

        error_print(e - s, 'sec')
        return ret

    return wrap


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

    return ans


def main():
    S = read_str()
    T = read_str()
    print(slv(S, T))


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys
def input():
    return sys.stdin.readline().rstrip('\n')
    

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

S = input()
T = input()
print(calc(S, T))

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

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

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

print(count)

Submission status: Accepted

Solution code:
# Problem B - Minor Change

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

# initialization
count = 0
s_len = len(S)

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

# output
print(count)

Submission status: Accepted

Solution code:
import sys

def resolve():
    lines = sys.stdin.readlines()

    s = lines[0].strip()
    t = lines[1].strip()

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

    print(c)

resolve()

Submission status: Accepted

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

Submission status: Accepted

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


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

print(ans)

Submission status: Accepted

Solution code:
s = list(input()) #str
t = list(input()) #str
#print(s,t)

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

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

Submission status: Accepted

Solution code:
import sys
import math as mt
#input=sys.stdin.buffer.readline  
t=1
#t=int(input())
for _ in range(t):
    #n=int(input())
    #a,b,c=map(int,input().split())
    #l=list(map(int,input().split()))
    ans=0
    s1=input()
    s2=input()
    for i in range(len(s1)):
        if s1[i]!=s2[i]:
            ans+=1
    print(ans)

Submission status: Accepted

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

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:
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:
s1=list(str(input()))
s2=list(str(input()))
val=0
for i in range(len(s1)):
    if(s1[i]!=s2[i]):
        val+=1
print(val)

Submission status: Accepted

Solution code:

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

print(a)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)

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

Submission status: Accepted

Solution code:
'''
.append(要素) リストに要素を追加
.extend(リスト) リストを連結する
.insert(場所,要素) 指定した場所に要素追加
del 配列名[場所]
-1で末尾で末尾から一つ前

sort()
sorted(reverse=true)

配列の初期化
配列名=[a]*n+[b]*m

Decimal()
'''

from sys import stdin
from itertools import accumulate, dropwhile, takewhile, groupby
import bisect
import copy
import math
from functools import reduce
from operator import mul
from collections import Counter
import itertools
import fractions
import sys

a = stdin.readline().rstrip()
b = stdin.readline().rstrip()
count = 0
res = 0
for el in a:
    if b[count] != el:
        res += 1
    count += 1
print(res)

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

Submission status: Accepted

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

print([S[i] != T[i] for i in range(len(S))].count(True))

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

Solution code:
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:
# 
import sys

from sys import stdin
input = lambda: stdin.readline().rstrip()


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

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

print(ans)

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
s = input()
t = input()
cnt = 0
for i in range(len(s)):
    if s[i] != t[i]:
        cnt += 1
print(cnt)

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
S = input()
T = input()
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 a1, a2 in zip(s, t):
    if a1 != a2:
        c += 1

print(c)

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


def solve(S: str, T: str):
    count = 0
    for s, t in zip(S, T):
        if s != t:
            count += 1
    print(count)
    return


# Generated by 1.1.7.1 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    S = next(tokens)  # type: str
    T = next(tokens)  # type: str
    solve(S, T)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:

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

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

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


print(cnt)

Submission status: Accepted

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

print(ans)

Submission status: Accepted

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

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

print(count)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

T = input()
counter = 0
l = len(S)
for i in range(l):
    if not S[i]==T[i]:
        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:
S = list(input())
T = list(input())
cnt = 0

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    s = input().strip()
    t = input().strip()
    cnt = 0
    for (a,b) in zip(list(s), list(t)):
        if a!=b:
            cnt += 1

    print(cnt)

main()

Submission status: Accepted

Solution code:
s=input()
t=input()
cnt=0
for ss,tt in zip(s,t):
  if ss!=tt:
    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:
s = input()
t = input()
ans = 0
for a, b in zip(s, t):
    if not a == b:
        ans += 1
print(ans)

Submission status: Accepted

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

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

    cnt = 0

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

    print(cnt)

if __name__ == "__main__":
    solve()

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
s = input()
t = input()
ans = 0
for i in range(len(t)):
    if s[i] != t[i]:
        ans += 1
print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

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

count = 0

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

print(count)

Submission status: Accepted

Solution code:
S = input()
T = input()
A = []
B = []
N = len(S)
for s in range(len(S)):
    A.append(S[s])
for t in range(len(T)):
    B.append(T[t])
cnt = 0
for n in range(N):
    if A[n] != B[n]:
        cnt += 1
print(cnt)

Submission status: Accepted

Solution code:
def main():
    S = str(input())
    T = str(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:
import sys
def rs(): return sys.stdin.readline().rstrip()
def ri(): return int(rs())
def rs_(): return [_ for _ in rs().split()]
def ri_(): return [int(_) for _ in rs().split()]

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

Submission status: Accepted

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

Submission status: Accepted

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

ret = sum(d[0] != d[1] for d in zip(S,T))
print(ret)

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

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())
print(sum([s!=t for s,t in zip(S,T)]))

Submission status: Accepted

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

n = len(S)
r = 0

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

Submission status: Accepted

Solution code:
# coding:utf-8

import sys
import math
import time
#import numpy as np
import collections
from collections import deque
from collections import Counter
import queue
import copy
import bisect
import heapq
import itertools


#sys.setrecursionlimit(10**7)
#N, Q = map(int, input().split())
#G = [list(input()) for i in range(H)]
#INF = V * 10001
#A = [int(i) for i in input().split()]
#AB = [list(map(int, input().split())) for _ in range(K)]


S = str(input())
T = str(input())
ans = 0

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

print(ans)

Submission status: Accepted

Solution code:
# coding: utf-8

import math
import re
import numpy as np
import copy

#読み込む
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:
import sys

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

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10**9)

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

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

    print(ans)
    return


if __name__ == "__main__":
    main()
    sys.exit(0)

Submission status: Accepted

Solution code:
from copy import deepcopy
import math
import string
import collections
from collections import Counter
from collections import deque
from decimal import Decimal
import sys
import fractions
from operator import itemgetter
import itertools
import copy


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


def nCr(n, r):
    return math.factorial(n)//(math.factorial(n-r)*math.factorial(r))


def has_duplicates2(seq):
    seen = []
    for item in seq:
        if not(item in seen):
            seen.append(item)
    return len(seq) != len(seen)


def divisor(n):
    divisor = []
    for i in range(1, n+1):
        if n % i == 0:
            divisor.append(i)
    return divisor


def gcd(a, b):
    while(b != 0):
        a, b = b, a % b
    return a


# coordinates
dx = [-1, -1, -1, 0, 0, 1, 1, 1]
dy = [-1, 0, 1, -1, 1, -1, 0, 1]
s = input()
t = input()
if s == t:
    print(0)
    exit()
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)
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()

length = len(s)

ans = length
for i in range(length):
  if(s[i] == t[i]): 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)
    return

if __name__=='__main__':
    main()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import re
import sys
from bisect import bisect, bisect_left, insort, insort_left
from collections import Counter, defaultdict, deque
from copy import deepcopy
from decimal import Decimal
from itertools import (
    accumulate, combinations, combinations_with_replacement, groupby,
    permutations, product)
from math import (acos, asin, atan, ceil, cos, degrees, factorial, gcd, hypot,
                  log2, pi, radians, sin, sqrt, tan)
from operator import itemgetter, mul
from string import ascii_lowercase, ascii_uppercase, digits


def inp():
    return(int(input()))


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


def instr():
    s = input()
    return(list(s[:len(s)]))


def invr():
    return(map(int, input().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 = input()
t = input()

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:

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


q2()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=input()
t=input()
ans=0
for i,_ in enumerate(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:
import sys
input = lambda: sys.stdin.readline().rstrip()

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

ans = 0

st_len = len(s)

for i in range(st_len):
    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()

count = 0

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

print(count)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
"""
~~ Author : Bhaskar
~~ Dated : 10~06~2020
"""

import sys
from bisect import *
from math import floor,sqrt,ceil,factorial as F,gcd,pi
from itertools import chain,combinations,permutations,accumulate
from collections import Counter,defaultdict,OrderedDict,deque
from array import array
INT_MAX = sys.maxsize
INT_MIN = -(sys.maxsize)-1
mod = 1000000007
ch = "abcdefghijklmnopqrstuvwxyz"
lcm = lambda a,b : (a*b)//gcd(a,b)
setbit = lambda x : bin(x)[2:].count("1")
input = lambda : sys.stdin.readline()

def solve():
    s = sys.stdin.readline().replace("\n", "")
    t = sys.stdin.readline().replace("\n", "")
    ans = 0
    for i in range(len(s)):
        if s[i] != t[i]:
            ans += 1
    print(ans)
    


if __name__ == "__main__":
    try:
        sys.stdin = open('input.txt','r')
        sys.stdout = open('output.txt','w')
    except:
       pass
    solve()

Submission status: Accepted

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

Submission status: Accepted

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

s, = map(str, input().split())
t, = map(str, input().split())

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