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

    return sum(1 if s != t else 0 for s, t in zip(S, T))

print(main())
#print('Yes' if main() else 'No')
#print('YES' if main() else 'NO')

Submission status: Accepted

Solution code:
# じょえチャンネルおもしろいよ～～～
# https://www.youtube.com/channel/UCRXsI3FL_kvaVL9zoolBfbQ

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
S = list(input())
T = list(input())
cnt = 0
for s,t in S,T:
  if s != t:
    cnt++
print(cnt)

Submission status: Runtime Error

Solution code:
S = list(input().split(''))
T = list(input().split(''))
cnt = 0
for s,t in S,T:
  if s != t:
    cnt++
print(cnt)

Submission status: Runtime Error

Solution code:
#include <iostream>
#include <string>
using namespace std;

int main(){
  int score = 0;
  string S1;
  string S2;
  cin >> S1, S2;
  for (int i = 0; i < S1.length(); i++){
    if (S1[i] != S2[i]) score++;
  }
  cout << score;
  return 0;

}

Submission status: Runtime Error

Solution code:
#include <iostream>
#include <string>
using namespace std;

int main(){
  int score = 0;
  string S1;
  string S2;
  cin >> S1, S2;
  for (int i = 0; i < S1.length(); i++){
    if (S1[i] != S2[i]) score++;
    
  cout << score;
  return 0;
}

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:
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:
def solve(string):
    s, t = string.split()
    return str(len(s) - sum(_s == _t for _s, _t in zip(s, t))                                                               pass


if __name__ == '__main__':
    import sys
    print(solve(sys.stdin.read().strip()))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
s=string(input())
t=string(input())
int count =0
for i in range(1000):
	if(s[i]!=t[i]):
 		 count++
print(count)

Submission status: Runtime Error

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

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

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

print(cnt)

Submission status: Runtime Error

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
    else:
      path

print(u)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

print(str(c))

Submission status: Runtime Error

Solution code:
def distance(x, y):
    return (x ** 2 + y ** 2) ** (1 / 2)


def main():
    n, d = map(int, input().split())
    xy_lst = [list(map(int, input().split())) for _ in range(n)]
    count = 0

    for i in range(n):
        x = xy_lst[i][0]
        y = xy_lst[i][1]
        if distance(x, y) <= d:
            count += 1

    print(count)


if __name__ == '__main__':
    main()

Submission status: Runtime Error

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

print(sum(s != t for s, t zip(S, T)))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
S=input()
T=input()
print(sum(x!=y for x,y in zip(S,T))

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
s = input()
a = [str(c) for c in s]
t = input()
b = [str(c) for c in s]

c = 0

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

print(n-c)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

print(count)

Submission status: Runtime Error

Solution code:
import sys
import os
f = open('input.txt', 'r')
sys.stdin = f
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: Runtime Error

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

sl = list(s)
tl = list(t)

count = 0

for (a, b) in zip(sl, tl):
  if a!=b:
    count++
    
print(count)

Submission status: Runtime Error

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

sl = list(s)
tl = list(t)

count = 0

for a, b in sl, tl:
  if a!=b:
    count++
    
print(count)

Submission status: Runtime Error

Solution code:
S = input()
T = input()
print(sum(s != t for s, t in zip(S, T))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

for i in s.size():
  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(S)+1):
    if S[i]!=T[i]:
        count +=1
    print(T[i])
print(count)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
L = map(str, input().split())

s = L[0]
S = list(s)
t = L[1]
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: Runtime Error

Solution code:
L = map(str, input().split())

s = L[0]
S = list(s)
t = L[1]
T = list(t)

N = len[S]
i = 1

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

Submission status: Runtime Error

Solution code:
L = map(str, input().split())

s = L[0]
S = list(s)
t = L[1]
T = list(t)

N = len[S]
i = 1

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

Submission status: Runtime Error

Solution code:
L = map(str, input())

s = L[0]
S = list(s)
t = L[1]
T = list(t)

N = len[S]
i = 1

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

Submission status: Runtime Error

Solution code:
rows = int(input())
L = [input() for i in range(rows)]

s = L[0]
S = list(s)
t = L[1]
T = list(t)

N = len[S]
i = 1

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

Submission status: Runtime Error

Solution code:
L = list(input().split())

s = L[0]
S = list(s)
t = L[1]
T = list(t)

N = len[S]
i = 1

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

Submission status: Runtime Error

Solution code:
s = input()
S = list(S)
T = list(input())
N = len(s)
i = 1

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

count = 0
for i in range(0, len(a)):
    if a[i] != b[i];
        count+=1
      
print(count)

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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 = difference/2
if differenc%2 != 0:
    change = (difference+1)/2
    
print(str(change))

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
#include <iostream>
using namespace std;

 int main(){
　string S, T;
　 cin >> S >> T;
　 int N = S.size(), ans = 0;
　 for(int i = 0; i < N; ++i){
　　 if(S[i] != T[i]) ++ans;
 　}
　 cout << ans << endl;
 }

Submission status: Runtime Error

Solution code:
S, T = input(), input()
2 print(len(list(filter(lambda i: S[i] != T[i], range(len(S))))))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

differnce=0

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

print(difference)

Submission status: Runtime Error

Solution code:

a=input()
b=input()
i=0
good=0
while(i<len(a)):
    if(a[i]!=b[i]):
        good+=1
	i+=1
print(good)

Submission status: Runtime Error

Solution code:

MB_TLE = 0
MB_WA = 0
MB_RE = o
MB_AC = 0
n=int(input())
for i in range (n):
    ch = input ()
    if (ch =="TLE")
     MB_TLE += 1
      if (ch =="WA")
     MB_WA += 1
    if (ch =="RE")
     MB_RE += 1
      if (ch =="AC")
     MB_AC += 1
print('TLE x',MB_TLE)
print('WA x',MB_WA)
print('RE x',MB_RE)
print('AC x',MB_AC)

Submission status: Runtime Error

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

Submission status: Runtime Error

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


if __name__  == '__main__':
    main()

Submission status: Runtime Error

Solution code:
def b172(slist, tlist):

    ans = 0

    for s, t in slist, tlist:
        if s != t:
            ans += 1

    return ans

def main():
    slist = list(str(input()))
    tlist = list(str(input()))
    print(b172(slist, tlist))

if __name__ == '__main__':
    main()

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
A = input()

A = A.splitlines()

change_num = 0

Num = len(A[0])

S = list(A[0])
T = list(A[1])

for i in range(Num):
    if S[i] is not T[i]:
        change_num += 1

print(change_num)

Submission status: Runtime Error

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

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

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

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

print(ans)

Submission status: Runtime Error

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

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

j =0
for i in S:
  if i != T[j]:
    count +=1
  j+=1

print(count)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

print(count)

Submission status: Runtime Error

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

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

print(S)
print(T)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
#172B
def B()
  S = input()
  T = input()
  count=0
  for i in range(length(S)):
    if S[i]!=T[i]:
    count = count+1
print(count)
B()

Submission status: Runtime Error

Solution code:
S = input()
T = input()
sum = 0
for i in range(len(S)):
  if S[i-1] <> T[i-1]:
    sum = sum + 1
print(sum)

Submission status: Runtime Error

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

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

print(count)

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

print(counter)

Submission status: Runtime Error

Solution code:
S = input()
T = input()
ans = 0
for i, ch in enumerate(S):
  if ch != T[i]:
    ans += 1
return ans

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import sys
S = input[0]
T = input[1]
leng　= len(S)
int N = 0

for i in leng:
  if S.charAt(i) == T.charAt(j):
    N = N + 1

print (N)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
S = input()
T = input()
cnt = 0
for x,y in  S,T:
	if x!=y:
		cnt += 1

print(cnt)

Submission status: Runtime Error

Solution code:
S = input()
T = input()
T = map(int,imput().split())
cnt = 0
for x,y in  S,T:
	if x!=y:
		cnt += 1

print(cnt)

Submission status: Runtime Error

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

sum = 0

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

print(count)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
word1=list(input())
word2=list(input2())
i = 0
for i, j in word1, word2 :
  if i!=J:
    i++
print(i)

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

def main():
  S = int(input())
  T = int(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: Runtime Error

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

print(c)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
#include<stdio.h>
#include<math.h>
int count;
int main(){
  char S[200005],T[200005];
  scanf("%c",S);
  scanf("%c",T);
  for (int i=0;S[i]!='\0';i++){
    if (S[i]!=T[i])
    count++;
  }
  printf("%d\n",count);
}

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
input1 = input()
input2 = input()

def match(x, y):
    i = 0
    if x is y:
        i = 1
    return i

result_list = map(match, input1, input2)
print(result_list.count(0))

Submission status: Runtime Error

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

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

i = 0
j = 0

while j < len(S):
  if S[j] = T[j]:
    i = i
    j += 1
  else:
    i += 1
    j += 1
    
print(i)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
s=input()
t=input()
cnt=0
for char in range(0,s.length):
  if s[char]!=t[char]:
    cnt=cnt+1

print(cnt)

Submission status: Runtime Error

Solution code:
import sys
readline= sys.stdin.buffer.readline

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

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

print(k)

Submission status: Runtime Error

Solution code:
ソースコード 

Copy
Copy
S=input()
T=input()
k=0
i=0

while i==len(S)
	if S[i]==T[i]:
  	else:
      k+=1
    i+=1
    end

Submission status: Runtime Error

Solution code:
S=input()
T=input()
k=0
i=0
while S!=T	
	if S[i]==T[i]:
  	else:
      k+=1
    i+=1

print(k)

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
S, T= map(int, input().split())
2 A = list(map(int, input().split()))
3 B = list(map(int, input().split()))

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

print(n)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
S = list(input ())
T = list(input ())
a = len(S)
change_time = 0

for i in a:
  if (S[i] ==T[i])
  continue
  
  else:
  S[i] =T[i]
  change_time += 1
  
  
print(change_time)

Submission status: Runtime Error

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

Solution code:
s=input()
t=input()
o=0
for x,y in s,t:
  if x != y:
    o+=1
print(o)

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

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

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

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

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

print(count)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
[s,t]=input().split();

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

Submission status: Runtime Error

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

Solution code:
print(sum([s != t for s, t in zip(input().split())]))

Submission status: Runtime Error

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

for i in range(len(s)):
  if s[i] is not t[i]:
    i++

print(i)

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
s=input()
t=input()
print(sum([1 for index,char in enumerate(s) if p[index]!=char]))

Submission status: Runtime Error

Solution code:
S,T = map(input().split())
print(sum[x!=y for x,y in zip(S,T)])

Submission status: Runtime Error

Solution code:
s=list(map(int,input().split()))
t=list(map(int,input().split()))
r=s-t
a=r.count(0)
print(len(r)-a)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

count = 0

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

Submission status: Runtime Error

Solution code:
k=list(input())
m=list(input())
ams=0
for i in (len(k)):
  if(k[i]!=m[i]):
    ams+=1
print(ams)