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

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

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:
## necessary imports
import sys
input = sys.stdin.readline
#from math import ceil, floor, factorial;

# swap_array function
def swaparr(arr, a,b):
    temp = arr[a];
    arr[a] = arr[b];
    arr[b] = temp

## gcd function
def gcd(a,b):
    if b == 0:
        return a
    return gcd(b, a % b);

## nCr function efficient using Binomial Cofficient
def nCr(n, k): 
    if(k > n - k): 
        k = n - k 
    res = 1
    for i in range(k): 
        res = res * (n - i) 
        res = res / (i + 1) 
    return int(res) 

## upper bound function code -- such that e in a[:i] e < x;
def upper_bound(a, x, lo=0):
    hi = len(a)
    while lo < hi:
        mid = (lo+hi)//2
        if a[mid] < x:
            lo = mid+1
        else:
            hi = mid
    return lo

## prime factorization
def primefs(n):
    ## if n == 1    ## calculating primes
    primes = {}
    while(n%2 == 0 and n > 0):
        primes[2] = primes.get(2, 0) + 1
        n = n//2
    for i in range(3, int(n**0.5)+2, 2):
        while(n%i == 0 and n > 0):
            primes[i] = primes.get(i, 0) + 1
            n = n//i
    if n > 2:
        primes[n] = primes.get(n, 0) + 1
    ## prime factoriazation of n is stored in dictionary
    ## primes and can be accesed. O(sqrt n)
    return primes

## MODULAR EXPONENTIATION FUNCTION
def power(x, y, p): 
    res = 1
    x = x % p  
    if (x == 0) : 
        return 0
    while (y > 0) : 
        if ((y & 1) == 1) : 
            res = (res * x) % p 
        y = y >> 1      
        x = (x * x) % p 
    return res 

## DISJOINT SET UNINON FUNCTIONS
def swap(a,b):
    temp = a
    a = b
    b = temp
    return a,b

# find function with path compression included (recursive)
# def find(x, link):
#     if link[x] == x:
#         return x
#     link[x] = find(link[x], link);
#     return link[x];

# find function with path compression (ITERATIVE)
def find(x, link):
    p = x;
    while( p != link[p]):
        p = link[p];
    
    while( x != p):
        nex = link[x];
        link[x] = p;
        x = nex;
    return p;


# the union function which makes union(x,y)
# of two nodes x and y
def union(x, y, link, size):
    x = find(x, link)
    y = find(y, link)
    if size[x] < size[y]:
        x,y = swap(x,y)
    if x != y:
        size[x] += size[y]
        link[y] = x

## returns an array of boolean if primes or not USING SIEVE OF ERATOSTHANES
def sieve(n): 
    prime = [True for i in range(n+1)] 
    p = 2
    while (p * p <= n): 
        if (prime[p] == True): 
            for i in range(p * p, n+1, p):
                prime[i] = False
        p += 1
    return prime

#### PRIME FACTORIZATION IN O(log n) using Sieve ####
MAXN = int(1e7 + 5)
def spf_sieve():
    spf[1] = 1;
    for i in range(2, MAXN):
        spf[i] = i;
    for i in range(4, MAXN, 2):
        spf[i] = 2;
    for i in range(3, ceil(MAXN ** 0.5), 2):
        if spf[i] == i:
            for j in range(i*i, MAXN, i):
                if spf[j] == j:
                    spf[j] = i;
    ## function for storing smallest prime factors (spf) in the array

################## un-comment below 2 lines when using factorization #################
# spf = [0 for i in range(MAXN)]
# spf_sieve() 
def factoriazation(x):
    ret = {};
    while x != 1:
        ret[spf[x]] = ret.get(spf[x], 0) + 1;
        x = x//spf[x]
    return ret
    ## this function is useful for multiple queries only, o/w use
    ## primefs function above. complexity O(log n)

## taking integer array input
def int_array():
    return list(map(int, input().strip().split()))
## taking string array input
def str_array():
    return input().strip().split();

#defining a couple constants
MOD = int(1e9)+7;
CMOD = 998244353;
INF = float('inf'); NINF = -float('inf');

################### ---------------- TEMPLATE ENDS HERE ---------------- ###################

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

num = 0
for ind, s in enumerate(S):
    if  S[ind] != T[ind]:
        num = num + 1
print(num)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
import sys, random, itertools, math
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt
def LI(): return list(map(int, input().split()))
def LF(): return list(map(float, input().split()))
def LI_(): return list(map(lambda x: int(x)-1, input().split()))
def II(): return int(input())
def IF(): return float(input())
def S(): return input().rstrip()
def LS(): return S().split()
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = float("INF")

#solve
def solve():
    s = S()
    t = S()
    ans = 0
    for i, si in enumerate(s):
        ans += si != t[i]
    print(ans)
    return


#main
if __name__ == '__main__':
    solve()

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
s=list(map(str,input()))
t=list(map(str,input()))
a=len(s)
cnt=0
for i in range(a):
  if s[i]==t[i]:
    pass
  else:
    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+=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:
import sys
import math
import collections
import heapq
import queue
import itertools
import functools
import operator
import time

readline = sys.stdin.readline
 
IPS = lambda: readline().rstrip()
IP = lambda: int(readline().rstrip())
MP = lambda: map(int, readline().split())
LS = lambda: list(map(int, readline().split()))

def solve():
    for _ in range(1):
        s = IPS()
        t = IPS()
        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:
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()
change = 0
for i in range(len(S)):
  if S[i] != T[i]:
    change += 1
print(change)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

s = list(input())
t = list(input())

if s == t: print(0), sys.exit()

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

#  zip関数での別解
res = len([1 for i, j in zip(s, t) if i != j])
print(res)

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10**7)
s = list(input())
t = list(input())

if s == t: print(0), sys.exit()

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

Submission status: Accepted

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

# check
res = len([1 for s, t in zip(S, T) if s != t])
print(res)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s1 = input()
s2 = input()
n = len(s1)
ans = sum([1 for i in range(n) if s1[i] != s2[i]])
print(ans)

Submission status: Accepted

Solution code:
ans = 0
for i, j in zip(input(), input()):
  if i != j:
    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 = str(input())
T = str(input())
n = 0

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

Submission status: Accepted

Solution code:
from collections import defaultdict as dd
from collections import deque
import bisect
import heapq

def ri():
    return int(input())

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


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






mode = 's'

if mode == 'T':
    t = ri()
    for i in range(t):
        solve()
else:
    solve()

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
origin = input()
target = input()
res = 0

for x, y in zip(origin, target):
  if x != y:
    res += 1
print(res)

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

Submission status: Accepted

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

Submission status: Accepted

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


main()

Submission status: Accepted

Solution code:
a = list(input())
b = list(input())
x = 0
for i in range(len(a)):
  if a[i] == b[i]:
    continue
  else:
    x += 1

print(x)

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(input())
t=list(input())
l=len(s)
c=[1 if s[i]!=t[i] else 0 for i in range(len(s))]
print(sum(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, T = input(), 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()
lis_s=[]
lis_t=[]

for i in S:
    lis_s.append(i)

for j in T:
    lis_t.append(j)

counter=0
for k in range(len(S)):
    if lis_s[k]==lis_t[k]:
        counter+=1
print(len(S)-counter)

Submission status: Accepted

Solution code:
a1 = input()
a2 = input()
t = 0

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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()
lst = [1 for i, j in zip(S, T) if i != j]
print(sum(lst))

Submission status: Accepted

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

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

print(cnt)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
count = 0

for s, t in zip(input(), input()):
    count += s != t

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:
# -*- coding: utf-8 -*-


def main():
    import sys
    input = sys.stdin.readline

    s = input()
    t = input()
    ans = 0

    for si, ti in zip(s, t):
        if si != ti:
            ans += 1

    print(ans)


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()
print(sum([1 if x[0]!=x[1] else 0 for x in zip(S,T)]))

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

print(y)

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:
"""
// Author : snape_here - Susanta Mukherjee
     
 """
 
from __future__ import division, print_function
 
import os,sys
from io import BytesIO, IOBase
 
if sys.version_info[0] < 3:
    from __builtin__ import xrange as range
    from future_builtins import ascii, filter, hex, map, oct, zip
 
 
def ii(): return int(input())
def fi(): return float(input())
def si(): return input()
def mi(): return map(int,input().split())
def li(): return list(mi())
 
 
def read():
    sys.stdin = open('input.txt', 'r')  
    sys.stdout = open('output.txt', 'w') 

def isPrime(n):
    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

def gcd(x, y):
    while y:
        x, y = y, x % y
    return x

mod=1000000007

from math import *

import bisect

from decimal import *

getcontext().prec = 50

abc="abcdefghijklmnopqrstuvwxyz"

pi=3.141592653589793238

def main():

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


# region fastio
 
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)
 
input = lambda: sys.stdin.readline().rstrip("\r\n")
 
# endregion
 
 
if __name__ == "__main__":
    #read()
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# encoding:utf-8
import copy
import random
import bisect #bisect_left　これで二部探索の大小検索が行える
import fractions #最小公倍数などはこっち
import math
import sys
import collections
from decimal import Decimal # 10進数で考慮できる

mod = 10**9+7
sys.setrecursionlimit(mod) # 再帰回数上限はでdefault1000

d = collections.deque()
def LI(): return list(map(int, sys.stdin.readline().split()))

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,t=input(),input()
slen=len(s)

j=0
count=0
for i in range(slen):
    if s[j]!=t[j]:
        count+=1
    j+=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]:
        continue
    ans+=1
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

n = 0

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

print(n)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin
S = stdin.readline().rstrip()
T = stdin.readline().rstrip()
ans = 0
for s, t in zip(S, T):
    if s != t:
        ans += 1
print(ans)

Submission status: Accepted

Solution code:
S = input().lower()
T = input().lower()
count = 0
if len(S) == len(T):
    for i in range(len(S)):
        if S[i] == T[i]:
            count += 0
        else: 
            count += 1
    print(count)
else:
    print("try again")

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

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

print(answer)

Submission status: Accepted

Solution code:
import sys

def II(): return int(input())
def MI(): return map(int,input().split())
def LI(): return list(map(int,input().split()))
def TI(): return tuple(map(int,input().split()))
def RN(N): return [input().strip() for i in range(N)]


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

    n = len(S)
    ans = 0

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

if __name__ == "__main__":
	main()

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

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

print(j)

Submission status: Accepted

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

Submission status: Accepted

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

    return count

if __name__ == "__main__":
    s = str(input())
    t = str(input())
    print(change(s,t))

Submission status: Accepted

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

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:
a=input()
b=input()
n=len(a)

ans=0

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

Submission status: Accepted

Solution code:
S = list(input())
T = list(input())
i = 0
counter = 0

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

Submission status: Accepted

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

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()
counter=[i for i in range(len(S)) if S[i]==T[i] ]
print(len(S)-len(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(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()

c = 0

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

Submission status: Accepted

Solution code:
a= input()
b= input()
c=0
d=0
e= len(a)

while c<e:
  if b[c]== a[c]:
    c+=1
    d+=1
  else:
    c+=1
    continue
print(e-d)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


def main():
    S = input()
    T = 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()
l = len(S)

for i in range(l):
  if S[i] == T[i]:
    l -= 1
  else:
    pass

print(l)

Submission status: Accepted

Solution code:
from sys import stdin
input = lambda: stdin.readline().rstrip("\r\n")
from collections import defaultdict as vector, deque as que
inin = lambda: int(input())
inar = lambda: list(map(int,input().split()))
from heapq import heappush as hpush,heappop as hpop

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

Submission status: Accepted

Solution code:
from sys import stdin
def main():
    #入力
    readline=stdin.readline
    s=readline().strip()
    t=readline().strip()

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

Submission status: Accepted

Solution code:
#[s,t]=input().split();
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:
s = input()
t = input()
print(sum(i!=j for i, j in zip(s, t)))

Submission status: Accepted

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

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()
c=0
i=0
for al in S:

    if S[i]==T[i]:
        i+=1
    else:
        c+=1
        i+=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()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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 = list(input())
t = list(input())
ans = 0
for i, j in zip(s, t):
  if i != j :
    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 = input()
t = input()
ans = 0
for id in range(len(s)):
    if s[id] != t[id]: 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:
import sys


def input():
    return sys.stdin.readline().strip()


sys.setrecursionlimit(20000000)

MOD = 10 ** 9 + 7
INF = float("inf")


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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
from sys import stdin
input = lambda: stdin.readline().rstrip("\r\n")
from collections import defaultdict as vector
from collections import deque as que
inin = lambda: int(input())
inar = lambda: list(map(int,input().split()))
from heapq import heappush as hpush,heappop as hpop

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

Submission status: Accepted

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

ans = 0

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
print(sum(c1 != c2 for c1, c2 in zip(input(), input())))

Submission status: Accepted

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

l=len(S)

ans=0

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

print(l-ans)

Submission status: Accepted

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

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

print(cmis)

Submission status: Accepted

Solution code:
s = list(map(str,input()))
t = list(map(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 s, t in zip(S, T):
  if s != t:
    count += 1
    
print(count)