Problem: 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.

Submission attempts (in order):
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)

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

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)

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)

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)

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)

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

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)

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

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)

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

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

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)

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

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)

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

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


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

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)

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

Verdicts: Runtime Error

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Wrong Answer

Wrong Answer

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Wrong Answer

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Accepted