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: Runtime Error

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

Submission status: Runtime Error

Solution code:
ソースコード 

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

print(sum)

Submission status: Runtime Error

Solution code:
S = input()
t = input()
cnt = 0

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

print(cnt)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
print(sum([1 if s, t else 0 for s, t in zip(input(), input())]))

Submission status: Runtime Error

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: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
    S = Coffee
    T = Office
    def minOps(S, T): 
        m = len(S) 
        n = len(T) 
      
         
        if n != m: 
            return -1
      
        count = [0] * 256
      
        for i in xrange(n):        
            count[ord(T[i])] += 1
        for i in xrange(n):       
            count[ord([Si])] -= 1
        for i in xrange(256):    
            if count[i]: 
                return -1
      
        
        res = 0
        i = n-1
        j = n-1    
        while i >= 0: 
          
           
            while i>= 0 and A[i] != B[j]: 
                i -= 1
                res += 1
      
       
            if i >= 0: 
                i -= 1
                j -= 1
      
        return res 
      
     
    print ("Minimum number of operations required is " + str(minOps(S,T)))

Submission status: Runtime Error

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

Submission status: Runtime Error

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++
print(count)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
S = input()
T = input()
s = []
t = []
i = 0
for i in range(len(S)):
    s.append(ord(S[i]))
    i += 1
i = 0
for i in range(len(T)):
    t.append(ord(T[i]))
    i += 1
    
s = np.array(s)
t = np.array(t)
print(len(S) - np.count_nonzero(s == t))

Submission status: Runtime Error

Solution code:
a = input()
b = input()
for i in list(range(len(a))):
    
    for j in list(range(len(b))):
    

     if a[i]=b[j]

Submission status: Runtime Error

Solution code:
second=input()
first=splitlines(second)
P=string(first[0])
S=string(first[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: Runtime Error

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

Submission status: Runtime Error

Solution code:
second=input()
first=splitlines(second)
P=string(first[0])
S=string(first[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: Runtime Error

Solution code:
s = input()
t = input()
n = 0
for i in s:
  for j in t:
    if i != j:
      i = j
      n += 1
return n

Submission status: Runtime Error

Solution code:
second=input()
first=splitlines(second)
P=first[0]
S=first[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: Runtime Error

Solution code:
second=input()
first=splitlines(second)
P=first[0]
S=first[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: Runtime Error

Solution code:
second=input()
first=splitlines(second)
P=first[0]
S=first[1]
count=0
for t in range(0,len(P)-1):
  if P[t]=S[t]:count=count+1
    else count=count
print(int(count))

Submission status: Runtime Error

Solution code:
second=input()
first=split(second)
P=string(first[0])
S=string(first[1])
count=0
for t in range(0,len(P)-1):
  if P[t]=S[t]:count=count+1
    else count=count
print(int(count))

Submission status: Runtime Error

Solution code:
second=input()
first=spit(second)
P=string(first[0])
S=string(first[1])
count=0
for t in range(0,len(P)-1):
  if P[t]=S[t]:count=count+1
    else count=count
print(int(count))

Submission status: Runtime Error

Solution code:
second=input()
first=spitlines(second)
P=first[0]
S=first[1]
count=0
for t in range(0,len(P)-1):
  if P[t]=S[t]:count=count+1
    else count=count
print(count)

Submission status: Runtime Error

Solution code:
second=input()
first=strings.spitlines(second)
P=first[0]
S=first[1]
count=0
for t in range(0,len(P)-1):
  if P[t]=S[t]:count=count+1
    else count=count
print(count)

Submission status: Runtime Error

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

int t = 0

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

Submission status: Runtime Error

Solution code:
second=input()
first=strings.spitlines(second)
P=first[0]
S=first[1]
count=0
for t in range(len(P)-1):
  if P[t]=S[t]:count=count+1
    else count=count
print(count)

Submission status: Runtime Error

Solution code:
a= int(input())
print(a+a**2+a**3)

Submission status: Runtime Error

Solution code:
second=input()
first=strings.spitlines(second)
P=first[0]
S=first[1]
count=0
for t in range(len(P)-1):
  if P=0:count=count+1
    else count=count
print(count)

Submission status: Runtime Error

Solution code:
S = Coffee
T = Office
def minOps(S, T): 
    m = len(S) 
    n = len(T) 
  
     
    if n != m: 
        return -1
  
    count = [0] * 256
  
    for i in xrange(n):        
        count[ord(T[i])] += 1
    for i in xrange(n):       
        count[ord([Si])] -= 1
    for i in xrange(256):    
        if count[i]: 
            return -1
  
    
    res = 0
    i = n-1
    j = n-1    
    while i >= 0: 
      
       
        while i>= 0 and A[i] != B[j]: 
            i -= 1
            res += 1
  
   
        if i >= 0: 
            i -= 1
            j -= 1
  
    return res 
  

print ("Minimum number of operations required is " + str(minOps(S,T)))

Submission status: Runtime Error

Solution code:
first=input()
P=first[0]
S=first[1]
count=0
for t in range(len(P)-1):
  if P eq 0:count=count+1
    else count=count
print(count)

Submission status: Runtime Error

Solution code:
def calculate(s,t):
  count = 0
  for i in t:
    if i != s[j]:
      count += 1
    j += 1
  return count  


s = raw_input()
t = raw_input()
print(calculate(s,t))

Submission status: Runtime Error

Solution code:
first=strings.spitlines(input())
P=first[0]
S=first[1]
count=0
for t in range(len(P)-1):
  if P eq 0:count=count+1
    else count=count
print(count)

Submission status: Runtime Error

Solution code:
first=strings.spitlines(input())
P=first[0]
S=first[1]
count=0
for t in range(len(P)-1):
  if P=0:count=count+1
    else count=count
print(count)

Submission status: Runtime Error

Solution code:
s = input()
t = input()
n = len(s)
s.split()
t.split()
ans = 0
for i in range(n):
    if s[i] != t[i]:
        s[i] = t[i]
    else:
        pass
print(ans)

Submission status: Runtime Error

Solution code:
s=list(input())
t=list(input())
for m in range(len(m)):
    if m >= 2*10**5:
        break
    elif s != t:
        print(s[m])

Submission status: Runtime Error

Solution code:
def changer(S, T)
  b = len(S)
  d = len(T)
  if b != d
  return -1
  count = [0] * 256
  for i in xrange(d):
    count[ord(B[i])] += 1
  for i in xrange(d):
    count[ord(A[i])] -= 1
  for i in xrange(256):  
    if count[i]:
      return -1
  res = 0
  i = n-1
  j = n-1
  while i>= 0:
      
      
      while i>= 0 and A[i] != B[j]:
          i -= 1
          res += 1 
      if i >= 0
          i -= 1
          j -= 1
  return res
print(changer)

Submission status: Runtime Error

Solution code:
IN=input()
[P,S]=splitlines(IN)
count=0
for t in range(len(P)-1):
  if P[t] = S[t]:
    count=count+1
  else:
    count=count
print(int(count))

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
s,t = map(list, input().split())
k = []
for i in range(len(s)):
    k.append(s[i] == t[i])
print(len(s)-sum(k))

Submission status: Runtime Error

Solution code:
s = input()
t = input()
cnt = 0
while s  != t:
        if  s[cnt] !=  t[cnt]:
                t = t[:cnt] + s[cnt] + t[cnt + 2:]
                cnt += 1
                
print(cnt)

Submission status: Runtime Error

Solution code:
S = input()
T = input()
cnt = 0
for i, v in enumerate(zip(S,T)):
  if v[0] == v[1]:
    continue
  else:
    S[i] = v[1]
    cnt += 1
print(cnt)

Submission status: Runtime Error

Solution code:
S = input()
T = input()
cnt = 0
for i, v in zip(S,T):
  if v[0] == v[1]:
    continue
  else:
    S[i] = v[1]
    cnt += 1
print(cnt)

Submission status: Runtime Error

Solution code:
s,t = map(list, input().split())
k = []
for i in range(len(s)):
    k.append(s[i] !=t[i])
print(sum(k))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
s,t = map(input().split())
c=0

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

print(c)

Submission status: Runtime Error

Solution code:
s,t = map(input())
c=0

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

print(c)

Submission status: Runtime Error

Solution code:
s = input()
t = input()
result = len([_ for a,b in zip(s,t) if a != b])
print(result)

Submission status: Runtime Error

Solution code:
S=str(input())
T=str(input()
if S==T:
      print('0')

Submission status: Runtime Error

Solution code:
s = input()
t = input()
result = len([e for a,b in zip(s,t) if a != b])
print(result)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
m=input()
n=input()
count=0;
for i in range(len(m))
    if m!=n :
         count+=1
print(count)

Submission status: Runtime Error

Solution code:
s,t = map(inut())
c=0

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

print(c)

Submission status: Runtime Error

Solution code:
s  = input()
t = input()
result = len([e for a,b in zip(s,t) if a != b])
print(result)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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=int(input())
print(str(minchange(s,t))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
def Change(self)
    change_object.replace(t, s)
    
t = office 
s = coffee
change_object()

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

for i in range(200001):
  if s[i] != t[i]:
    s.replace('s[i]','t[i]')
    ans += 1
    if i+1 == len(s):
      break
    
print(ans)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a = list(input().split())
s = a[0]
t = a[1]

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

print(time)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
s = input()

s[6]="r"

print(s)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a = list(input())
b = list(input())
n = 0
for c, d in zip(a, b):
  if c != d:
    count += 1

Submission status: Runtime Error

Solution code:
s,t = input().sprit()
i=int(input())
a=0
if s[i]=t[i]:
    a=a+1
else:
    a=a+0
print(a)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
S = input()
T = input()
replaces = 0
for ch in range(S):
    if S[ch] == T[ch]:
        replaces += 1

print(replaces)

Submission status: Runtime Error

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

count = 0

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
S = input()
T = input()
replaces = 0
for ch in range(S):
    if S[ch] == T[ch]:
    replaces += 1

print(replaces)

Submission status: Runtime Error

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

n = 1

for a in range len(S)

if S[a] = T[a] :
    n += 1

return n

Submission status: Runtime Error

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

print(count)

Submission status: Runtime Error

Solution code:
S = input()
T = input()
replaces = 0
for ch in range(S):
  if S[ch] == T[ch]:
    replaces += 1

print(replaces)

Submission status: Runtime Error

Solution code:
try:
  s = input()
  t = input()
  count = 0
  for i in range(len(s)):
  if not s[i] == t[i]:
    count += 1
  print(count)
except EOFError:
  print('EOFError')

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
s, t = input().split()
x = zip(s, t)
y = []
for i, j in x:
    if i == j:
        y.append('')
    else:
        y.append('@')
print(y.count('@'))

Submission status: Runtime Error

Solution code:
S = abcdefg

S[2]="g"
S[6]="z"

print(S)

Submission status: Runtime Error

Solution code:
S = input().split()
S = list(S)
T = input.split()
T = list(T)
for i in S:
  if(S[i]!=T[i]):
    count++;

print(count)

Submission status: Runtime Error

Solution code:
s,t = map(str, input().split())
count = 0

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

print( count)

Submission status: Runtime Error

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

Submission status: Runtime Error

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: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
#dt = {} for i in x: dt[i] = dt.get(i,0)+1
import sys;input = sys.stdin.readline
inp,ip = lambda :int(input()),lambda :[int(w) for w in input().split()]

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
s = input()
t = input()
ans=0,cnt=0
for check in s:
    if t[cnt] == check:
        cnt+=1
    else:
        ans+=1
        cnt+=1
print(ans)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
S=raw_input()
T=raw_input()
cS = [0]*26
cT=[0]*26
for i in S:
  cs[ord(i)-97]+=1
for i in S:
  cT[ord(i)-97]+=1
res=0
for i in xrange(26):
  res+=cT[i]-cS[i]
print res

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N,K=map(int,input().split())
p=list(map(int,input().split()))
p.sort()
res=0
for x in p[:K]:
	res+=x

print(res)

Submission status: Runtime Error

Solution code:
S=raw_input()
T=raw_input()
cS = [0]*26
cT=[0]*26
for i in S:
  cs[ord(i)-97]+=1
for i in S:
  cT[ord(i)-97]+=1
res=0
for i in xrange(26):
  res+=ct[i]-cs[i]
print res

Submission status: Runtime Error

Solution code:
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[])
{
    string s, t;

    cin >> s;
    cin >> t;
    long counter = 0;
    for (long i = 0; i < s.size(); i++)
    {
        if (s[i] != t[i])
        {
            counter++;
        }
    }
    cout << counter << endl;

    return 0;
}

Submission status: Runtime Error

Solution code:
#関数リスト
import sys
input = sys.stdin.readline

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


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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
# coding: UTF-8

S = input()
T = input()

res = set()
for ss, tt in zip(S, T):
    if ss != tt:
        set[ss] = 1

print(len(res))

Submission status: Runtime Error

Solution code:
s = input()
t - input()
def hamming_dist(str1,str2):
    ans = 0
    a,b = len(str1),len(str2)
    if a > b:
        ans = a - b
        length = b
    elif a < b:
        ans = b - a
        length = a
    else:
        length = a
    for i in range(length):
        if str1[i] != str2[i]:
            ans += 1
    return ans
print(hamming_dist(s,t))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef pair<int,int> P;

//マクロ
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=(ll)(n)-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=(a);i<=(b);i++)
#define FORD(i,a,b) for(ll i=(a);i>=(b);i--)
#define ALL(x) (x).begin(),(x).end() //sortなどの引数を省略したい
#define SIZE(x) ((ll)(x).size()) //sizeをsize_tからllに直しておく
#define MAX(x) *max_element(ALL(x))
#define INF 1000000000000 //10^12
#define MOD 10000007 //10^9+7
#define PB push_back
#define MP make_pair
#define F first
#define S second

int main(int argc, char const *argv[]) {
  string s,t; cin >> s >> t;
  int ans = 0;
  REP(i,SIZE(s)) {
    if (s[i] == t[i]) continue;
    else ans++;
  }

  cout << ans <<endl;

  return 0;
}

Submission status: Runtime Error

Solution code:
s  = input()
t = input()
result = len([a,b for a,b in zip(s,t) if a != b])
print(result)

Submission status: Runtime Error

Solution code:
a=int(input())
print(a+a*a+a*a*a)

Submission status: Runtime Error

Solution code:
a=int(input())

print(a+a**2+a**3)

Submission status: Runtime Error

Solution code:
#include<bits/stdc++.h>
using namespace std;
#define fastIO ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define int long long int
#define fi first
#define se second
#define pub push_back
#define pi pair<int,int>
#define all(v) (v).begin(), (v).end()
#define rep(i, l, r) for(int i=(int)(l);i<(int)(r);i++)
#define repd(i, l, r) for (int i=(int)(l);i>=(int)(r);i--)
#define clrg(i, l, r) for(int i=(int)(l);i<(int)(r);i++)vis[i]=0,v[i].clear();
int power(int x, unsigned int y){int res = 1;while (y > 0){ if (y & 1){res = res*x;} y = y>>1;x = x*x;}return res;}
int powermod(int x, unsigned int y, int p){int res = 1;x = x % p;while (y > 0){if (y & 1){res = (res*x) % p;}y = y>>1; x = (x*x) % p;}return res;}
#define print2d(mat,n,m){for(int i=0;i<(int)(n);i++){for(int j=0;j<(m);j++){cout<<mat[i][j]<<" ";}cout<< endl;}}
#define clr(a,x) memset(a,x,sizeof(a))
#define rr(v) for(auto &val:v)
#define print(v) for (const auto itr : v){cout<<itr<<' ';}cout<<"\n";
#define ln length()
#define sz size()
#define mod 1000000007
#define elif else if
int32_t main(){
   string s,t;
   cin>>s>>t;
   int c=0;
   rep(i,0,s.ln){
	   is(s[i]!=t[i])c++;
   }
   cout<<c<<"\n";
   return 0;
}

Submission status: Runtime Error

Solution code:
from sys import stdin,stdout
LI=lambda:list(map(int,input().split()))
MAP=lambda:map(int,input().split())
IN=lambda:int(input())
S=lambda:input()
import math
def p(a):print(" ".join(list(map(str,a))))
from collections import Counter

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

Submission status: Runtime Error

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

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

print(cnt)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

print(count)

Submission status: Runtime Error

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

Submission status: Runtime Error

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