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: Wrong Answer

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

i = 0
for _ in str1:
  if _ not in str2:
    i += 1
print(i)

Submission status: Wrong Answer

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: Wrong Answer

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: Wrong Answer

Solution code:
S = list(input())
T = list(input())
cnt = 0
for t in range(0,int(len(S))-1):
  if S[t] != T[t]:
    cnt += 1
print(cnt)

Submission status: Wrong Answer

Solution code:
first_string = "abcde"
second_string = "abcfd"
count = 0

for x, y in zip(first_string, range(len(first_string))):
    if(second_string[y] != x):
        count += 1
print(count)

Submission status: Wrong Answer

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: Wrong Answer

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

Submission status: Wrong Answer

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

x = len(s)

num = 0
for i in range(0, x):
    if s[i] == t[i]:
        num += 1

print(num)

Submission status: Wrong Answer

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

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

print(u)

Submission status: Wrong Answer

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

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

print(u)

Submission status: Wrong Answer

Solution code:
S=list(input())
T=list(input())
b=0
print(S)
print(T)

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

print(b)

Submission status: Wrong Answer

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: Wrong Answer

Solution code:
S=input()
T=input()
L=[[0]*26 for _ in range(2)]
for s in S:
  L[0][ord(s)-ord('a')]+=1
for t in T:
  L[1][ord(t)-ord('a')]+=1
ans=0
for i in range(26):
  ans+=abs(L[0][i]-L[1][i])
ans=ans//2
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
Answer = input()
input_retu = input()
count = 0
for i in range(len(Answer)):
    if Answer[i] == input_retu[i]:
        continue
    else:
        count += 1

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

calc = 0

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

print(calc)

Submission status: Wrong Answer

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

print(S)
print(T)

calc = 0

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

print(calc)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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: Wrong Answer

Solution code:
S=input()
T=input()
a=S.split()
b=T.split()
l=[]
for i in range(len(a)):
	if a[i]!=b[i]:
		l.append(1)
print(len(l))

Submission status: Wrong Answer

Solution code:
S=input()
T=input()
a=S.split()
b=T.split()
l=[]
for i in range(len(a)):
  if a[i]!=b[i]:
    l.append(1)
print(len(l))

Submission status: Wrong Answer

Solution code:
S = input()
T = input()
S_T_ = set(S)^set(T)
print(len(S_T_))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# B Minor Change
S = list(input())
T = list(input())
l=len(S)
ct = 0
print(l)
for i in range(l):
    if S[i] != T[i]:
        ct += 1
print(ct)

Submission status: Wrong Answer

Solution code:
# B Minor Change
S = list(input())
T = list(input())
l=len(S)
ct = 0
print(l)
for i in range(l):
    if S[i] != T[i]:
        ct += 1
print(ct)

Submission status: Wrong Answer

Solution code:
import sys

s1 = str(input())
s2 = str(input())
ans = 0

for i in range(len(s1)):
    if s1[i] == s2[i]:
        ans += 1

print(ans)

Submission status: Wrong Answer

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

S = list(s)
T = list(t)

N = len(s) - 1
i = 0

while N != i:
    if S[i] != T[i]:
        S[i] = T[i]
    i += 1

print(i + 1)

Submission status: Wrong Answer

Solution code:
fv = [[0 for i in range(2)] for j in range (26)]
for i in range (2):
    for c in input():
        fv[ord(c)-ord('a')][i] += 1
ans = 0
for i in range(26):
    ans += fv[i][0]-fv[i][1] if fv[i][0] > fv[i][1] else 0
print(ans)

Submission status: Wrong Answer

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: Wrong Answer

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

for i in range(len(S)):
	print(S[i])

Submission status: Wrong Answer

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

length = int(len(S))
difference = 0

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

if difference%2 == 0:
    change = int(difference/2)
if difference%2 != 0:
    change = int((difference+1)/2)
    
print(str(change))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import re
S = input()
T = input()
result=0
if(len(S)!=len(T)):
    pass
elif(re.fullmatch(r'[a-z]{1,20000}', S) and re.fullmatch(r'[a-z]{1,20000}', T)):
    for i in range(len(S)):
        if S[i]!=T[i]:
            result+=1
    print(result)

Submission status: Wrong Answer

Solution code:
import re
s = input()
t = input()
result=0
if(len(s)!=len(t)):
    pass
elif(re.fullmatch(r'[a-z]{1,20000}', s) and re.fullmatch(r'[a-z]{1,20000}', t)):
    for i in range(len(s)):
        if s[i]!=t[i]:
            result+=1
    print(result)

Submission status: Wrong Answer

Solution code:
import re
s = input()
t = input()
result=0
if(re.fullmatch(r'[a-z]{1-20000}', s) and re.fullmatch(r'[a-z]{1-20000}', t)):
    for i, j in s, t:
        if i==j:
            result+=1
    print(result)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
print(sum(map(lambda x, y: 1 if x!=y else 0,input().split(), input().split())))

Submission status: Wrong Answer

Solution code:
#https://atcoder.jp/contests/abc172/tasks/abc172_b
a= []
b= []

a= input("Press a : ")

d= len(a)

b= input("Press b : ")

e= 0
for i in range(0, d):
    if a[i]==b[i]:
        pass
    else:
        e= e+1

print(e)

Submission status: Wrong Answer

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: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
#https://atcoder.jp/contests/abc172/tasks/abc172_b

'''
<考え>
sとtを一文字ずつ比較し、異なる文字の数を出力
(s,tの長さが等しいと条件にある)
'''


#入力
s = str(input())
t = str(input())

#変数
count = 0

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

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

#出力
print(count)

Submission status: Wrong Answer

Solution code:
#https://atcoder.jp/contests/abc172/tasks/abc172_b

'''
<考え>
sとtを一文字ずつ比較し、異なる文字の数を出力
(s,tの長さが等しいと条件にある)
'''


#入力
s = str(input())
t = str(input())

#変数
count = 0

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

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

#出力
print(count)

Submission status: Wrong Answer

Solution code:
s = list(input())
t = list(input())
i = 0
cnt = 0
while (i < len(s)):
    if s != t:
       cnt += 1
    i += 1
print(cnt)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

count = 0
i = 0
while i < len(S):
    print("len" + str(len(S)))
    print("S[i]:" + S[i])

    if S[i] != T[i]:
        count+=1
    i+=1

print(count)

Submission status: Wrong Answer

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

Sum = 0

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

Submission status: Wrong Answer

Solution code:
A=input()
B=input()

ans=0
for a,b in zip(A,B):
    if a==b:
        ans+=1
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
s1 = input()
s2 = input()

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

Submission status: Wrong Answer

Solution code:
import sys
sys.setrecursionlimit(2147483647)
input=sys.stdin.readline

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

if __name__=='__main__':
  main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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: Wrong Answer

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

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

print(num)

Submission status: Wrong Answer

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: Wrong Answer

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: Wrong Answer

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: Wrong Answer

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

Submission status: Wrong Answer

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: Wrong Answer

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: Wrong Answer

Solution code:
s=list(input())
t=list(input())
for i, _s in enumerate(s):
    if s == t:
        break
    else:
        if _s != t[i]:
            s[i] = t[i]
        else:
            continue

print(i)

Submission status: Wrong Answer

Solution code:
import string
letters = string.ascii_lowercase
s = input()
t = input()
s_dict={}
t_dict={}
for x in letters:
    s_dict.update({x:s.count(x)})
    t_dict.update({x:t.count(x)})
ans = 0
for x in letters:
    if t_dict[x] > s_dict[x]:
        ans += t_dict[x]-s_dict[x]
print(ans)

Submission status: Wrong Answer

Solution code:
def main():
    S = list(map(str, input().split()))
    T = list(map(str, input().split()))
    
    count = 0
    for i,s in enumerate(S):
        if s != T[i]:
            count +=1
    
    print(count)

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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: Wrong Answer

Solution code:
s = input()
t = input()
def count_diff(s,t) :
    lst_s = list(s)
    lst_t = list(t)
    len_s = len(lst_s)
    ng = 0
    for i in range(len_s) :
        if lst_s[i] != lst_t[i] :
            ng += 1
        print(ng)

count_diff(s,t)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

for i in range(len(S1)):
    if(S1[i]!=T1[i]):
        S1[i]=T1[i]
    
print(i)

Submission status: Wrong Answer

Solution code:
s=input()
t=input()
a=[0]*26
for i in range(len(s)):
    a[ord(s[i])-97]+=1
for i in range(len(t)):
    a[ord(t[i])-97]-=1
ans=0
for i in range(26):
    ans+=abs(a[i])

print(ans//2)

Submission status: Wrong Answer

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: Wrong Answer

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

Submission status: Wrong Answer

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: Wrong Answer

Solution code:
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: Wrong Answer

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

Submission status: Wrong Answer

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

a = 0

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
s = input()
t = input()
if len(s) < 1 or len(s) > 2*(10**5) or len(t) < 1 or len(t) > 2*(10**5):
    exit()
elif not len(s) == len(t):
    exit()
elif s.isdigit() or t.isdigit():
    exit()
else:
    u = zip(s,t)
    d = dict(u)

    counter = 0
    for i,j in d.items(): 
        if i == j:
            continue
        else: 
            counter += 1

    print(counter)

Submission status: Wrong Answer

Solution code:
a=[input() for i in range(2)]
P=a[0]
S=a[1]
count=0
for t in range(0,len(P)-1):
  if P[t] != S[t]:
    count=count+1
print(count)

Submission status: Wrong Answer

Solution code:
s = [input() for i in range(2)]
S = s[0]
T = s[1]
print(S)
print(T)


def count_diff2(s, t):
    cnt = 0
    for c1,c2 in zip(s, t):
        if c1 != c2:
            cnt += 1
    return cnt

print(count_diff2(S, T))

Submission status: Wrong Answer

Solution code:
a=[input() for i in range(2)]
P=a[0]
S=a[1]
count=0
for t in range(0,len(P)-1):
  if P[t] == S[t]:
    count=count+1
print(count)

Submission status: Wrong Answer

Solution code:
a=[input() for i in range(2)]
P=a[0]
S=a[1]
count=0
for t in range(0,len(P)-1):
  if P[t] is S[t]:
    count=count+1
#    else:
#      count=count
print(int(count))

Submission status: Wrong Answer

Solution code:
S = input()
T = input()
# print(list(S))
# print(list(T))
# result = list(set(list(S)) - set(list(T)))
# print(result)
result = list(filter(lambda x: x not in list(S), list(T)))
# print(result)
print(len(result))

Submission status: Wrong Answer

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

s = list(S[:])
t = list(T[:])

j=0

for i in range(len(S)):
    if s[i] == t[i]:
        j = j+0
    else:
        index = t.index(s[i])
        t[i],t[index] = t[index],t[i]
        j = j+1

print(j)
print(s,t)

Submission status: Wrong Answer

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

s.split()
t.split()

ans = 0

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

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

print(ans)

Submission status: Wrong Answer

Solution code:
x=input()
y=input()
m = 0 
for i in range(len(x)-1):
    if x[i] != y[i]:
        Y = y.replace(y[i], x[i]) 
        m+=1
        
print(m)

Submission status: Wrong Answer

Solution code:
import timeit

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

S = a[0]
T = a[1]

def count_diff2(S,T):
    cnt = 0
    for c1,c2 in zip(S, T):
        if c1 != c2:
            cnt += 1
    return cnt

print(timeit.timeit(lambda: count_diff2(S,T)))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
input_str1 = input()
input_str2 = input()
sum([input_str1[i]!=input_str2[i] for i in range(len(input_str1))])

Submission status: Wrong Answer

Solution code:
S = input()
T = input()
nun = 0
num = len(S)
if S != T:
    for i in range(0,num):
        if S[i] != T[i]:
            S.replace(S[i],T[i])
            nun += 1
        else:
            print(str(nun))
else:
    print("0")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

def count_diff2(S,T):
    cnt = 0
    for c1,c2 in zip(S, T):
        if c1 != c2:
            cnt += 1
    return cnt

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:

c = 0
s = str(input())
t = str(input())
# str(input())
d = {}
if s==t:
	print(0)
elif sorted(s) == sorted(t):
	print(len(s))
else:
	for i in s:
		if i not in d:
			d[i] = 1
		else:
			d[i] +=1

	for i in d:
		if i in t:
			d[i]-=1
	for i in d:
		if d[i]>=1:
			c+=1
	print(c)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

S = list(s)
T = list(t)

def list_difference(list1, list2):
    result = list1.copy()
    for value in list2:
        if value in result:
            result.remove(value)

    return result

result = list_difference(S, T)

print(len(result))

Submission status: Wrong Answer

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

print(len(list(set(s) - set(t))))

Submission status: Wrong Answer

Solution code:
S=input()
T=input()
if S==T:
      print('0')
elif S!=T:
    STand = set(S) & set(T)
    STlist = list(STand )
    print(len(STlist))

Submission status: Wrong Answer

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: Wrong Answer

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

d = {}
if s==t:
	print(0)
elif sorted(s) == sorted(t):
	print(len(s))
else:
	for i in s:
		if i not in d:
			d[i] = 1
		else:
			d[i] +=1

	for i in d:
		if i in t:
			d[i]-=1
		else:
			c+=d[i]
	print(c)

Submission status: Wrong Answer

Solution code:
S= list(map(str, input().split()))
T= list(map(str, input().split()))

STand = set(S) & set(T)
STlist = list(STand )
print(len(STlist))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

for i,con in enumerate(b):
  if i == a[i]:
    break
  else:
    count+=1
    
print(count)

Submission status: Wrong Answer

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

# print(st)
# print(ts)
print(j)

Submission status: Wrong Answer

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

for i,con in enumerate(b):
  if i == a[i]:
    break
  else:
    count+=1
print(count)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
s1 = input().split()
strS = s1[0]
s2 = input().split()
strT = s2[0]

#strS = 'cupofcoffee'
#strT = 'cupofhottea'

#strS = 'abcde'
#strT = 'bcdea'

#strS = 'apple'
#strT = 'apple'

charStrSList = list(strS)
charStrTList = list(strT)

intCnt = 0
idx = 0
for sChar in charStrSList:
    if (sChar != charStrTList[idx]) :
        intCnt += 1
        print(sChar)
        print(charStrTList[idx])
        print(intCnt) 
    idx += 1

print(intCnt)

Submission status: Wrong Answer

Solution code:
def minchange(s,t):
  m=len(s)
  n=len(t)
  if n!=m:
    return -1
  cnt=[0]*256
  for i in range(n):
    cnt[ord(t[i])]+=1
  for i in range(n):
    cnt[ord(s[i])]-=1
  for i in range(256):
    if cnt[i]:
      return -1
  res=0
  i=n-1
  j=n-1
  while i>=0:
    while i>=0 and s[i]!=t[i]:
      i-=1
      res+=1
    if i>=0:
      i-=1
      j-=1
  return res
s=input()
t=input()
print(str(minchange(s,t)))

Submission status: Wrong Answer

Solution code:

c = 0
s = str(input())
t = str(input())

d = {}
if sorted(s) == sorted(t):
	print(len(s))
else:
	for i in s:
		if i not in d:
			d[i] = 1
		else:
			d[i] +=1

	for i in d:
		if i in t:
			d[i]-=1
		else:
			c+=d[i]
	print(c)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def MinorChange():

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

    data = []

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

    print(len(list(set(data))))

if __name__ == '__main__':
    MinorChange()

Submission status: Wrong Answer

Solution code:
# coding: utf-8

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

st_converter = lambda s,t : s == t

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

print(str_match_cnt)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
def MinorChange():

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

    data = []

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

    print(len(list(set(data))))

if __name__ == '__main__':
    MinorChange()

Submission status: Wrong Answer

Solution code:
def MinorChange():

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

    data = []

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

    print(list(set(data)))

if __name__ == '__main__':
    MinorChange()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

l=len(s)
a=0
for i in range(l-1):
    if s[i]==t[i]:
        pass
    else:
        a+=1

print(a)

Submission status: Wrong Answer

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

ans = 0
i = 0
while i < len(s):
	if s[i] == t[i]:
		ans += 1
	i += 1

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
S = input()
T = input()
count = 0
if S == T:
    print(count)
    exit(0)

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

Submission status: Wrong Answer

Solution code:
print("1")

Submission status: Wrong Answer

Solution code:
print(1)

Submission status: Wrong Answer

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

count = 0

for i in range(c):
    if d[i] == e[i]:
        count += 1
        
print(count)

Submission status: Wrong Answer

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

#print(s, t)

a = [x for x in s]
b = [x for x in t]

count = 0

for i in range(len(a)):
  if a[i] == a[i]:
    count += 1
print(count)

Submission status: Wrong Answer

Solution code:
S=input()
T=input()
count=list(range(0,len(S)))
print(count)

c=0

for i in count:
    if S[i] != T[i]:
        c+=1
    else:
        continue
print(c)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
s=input()
t=input()
a=t.count(s)
b=len(t)-a
print(b)

Submission status: Wrong Answer

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: Wrong Answer

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

Submission status: Wrong Answer

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: Wrong Answer

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

for i in a:
    if b[c] == i:
        d = d+1
        c=c+1
    else:
        c=c+1

print(d)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

ABC172_B()

Submission status: Wrong Answer

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

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

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

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

ret = 0

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

Submission status: Wrong Answer

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

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

print(min(ans,len(s)-ans))

Submission status: Wrong Answer

Solution code:
S = list(input())
T = list(input())
ans = 0
for i in range(len(S)):
    if S[i] in T:
        T.remove(S[i])
print(len(T))

Submission status: Wrong Answer

Solution code:
a=input().split(" ")
b=input().split(" ")
c=len(a)
d=0
e=0
for i in range(int(c)):
    if a[i]==b[i]:
        d=d+1
    else:
        e=e+1

print(e)

Submission status: Wrong Answer

Solution code:
first_str = input().split()
anwser_str = input().split()
cnt = 0
for i in range(len(first_str)):
    if first_str[i] != anwser_str[i]:
        first_str[i] = anwser_str[i]
        cnt += 1

print(cnt)