Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Time Limit Exceeded):
import copy
N,M=map(int,input().split())
linked=[set() for i in range(N)]
for i in range(M):
  s,t=map(int,input().split())
  linked[s-1].add(t-1)
def dp(link):
  dp=[0]*N
  for i in range(N-1):
    k=N-2-i
    size=len(link[k])
    if size==0:
      continue
    p=1/size
    v=0
    for t in link[k]:
      v=v+p*(dp[t]+1)
    dp[k]=v
  return dp
all_dp=dp(linked)
ans=all_dp[0]
for i in range(N-1):
  if len(linked[i])<2:
    continue
  cut=0
  v=0
  for t in linked[i]:
    if v<all_dp[t]:
      cut=t
      v=all_dp[t]
  s=linked[i].copy()
  s.remove(cut)
  link=copy.deepcopy(linked)
  link[i]=s
  d=dp(link)
  ans=min(ans,d[0])
print(ans)

Fixed submission:
import copy
N,M=map(int,input().split())
linked=[set() for i in range(N)]
for i in range(M):
  s,t=map(int,input().split())
  linked[s-1].add(t-1)
def dp(link):
  dp=[0]*N
  for i in range(N-1):
    k=N-2-i
    size=len(link[k])
    if size==0:
      continue
    p=1/size
    v=0
    for t in link[k]:
      v=v+p*(dp[t]+1)
    dp[k]=v
  return dp
all_dp=dp(linked)
ans=all_dp[0]
for i in range(N-1):
  if len(linked[i])<2:
    continue
  cut=0
  v=0
  for t in linked[i]:
    if v<all_dp[t]:
      cut=t
      v=all_dp[t]
  linked[i].remove(cut)
  d=dp(linked)
  ans=min(ans,d[0])
  linked[i].add(cut)
print(ans)
Buggy python submission (verdict: Time Limit Exceeded):
import numpy as np
N,K,Q=map(int,input().split())
l=np.ones(N)*K
for i in range(Q):
    a=int(input())-1
    one=np.ones(N)
    one[a]=0
    l=l-one
for i in range(N):
    if l[i]>0:
        print('Yes')
    else:
        print('No')

Fixed submission:
N,K,Q=map(int,input().split())
l=[0]*N
for i in range(Q):
    a=int(input())-1
    l[a]=l[a]+1
for i in range(N):
    if Q-l[i]<K:
        print('Yes')
    else:
        print('No')
Buggy python submission (verdict: Runtime Error):
n=int(input)

a=list()
for i in range(n):

    a.append(list(map(int,input().strip().split())))
a=list(set(a))
ans=0
for i in range(len(a)):
    for j in range(i+1,len(a)):
        ans=max(ans,abs(a[i][0]-a[j][0])+abs(a[j][1],a[i][1]))

print(ans)

Fixed submission:
s=int(input())
a=[0]*2001
x=(10**9)+7
if s<3:
    print(0)
    exit()

    
else:

    for i in range(3,6):
        a[i]=1

    for i in range(6,2001):
        a[i]=(sum(a[3:i-2])+1)%(x)

print(a[s])
Buggy python submission (verdict: Runtime Error):
a=input()
flag=False
ans=0
hold=0
for i in range(3):
    if a[i]=='R' and not flag:
        ans=1
        flag=not flag
        hold=max(hold,ans)

    elif a[i]=='R' and flag:
        ans+=1
        hold=max(hold,ans)

    else:
        ans=0
        flag=False


return(hold)


Fixed submission:
a=input()
flag=False
ans=0
hold=0
for i in range(3):
    if a[i]=='R' and not flag:
        ans=1
        flag=not flag
        hold=max(hold,ans)

    elif a[i]=='R' and flag:
        ans+=1
        hold=max(hold,ans)

    else:
        ans=0
        flag=False


print(hold)

Buggy python submission (verdict: Runtime Error):
s=input()
ans=0
flag=False
for i in a:
  if i=='R' and not flag:
    ans=1
    hold=ans
    
  if i=='R' and flag:
    ans+=1
    hold=ans
    
  else:
    ans=0
    flag=False
    
  return hold
    

Fixed submission:
a=input()
flag=False
ans=0
hold=0
for i in range(3):
    if a[i]=='R' and not flag:
        ans=1
        flag=not flag
        hold=max(hold,ans)

    elif a[i]=='R' and flag:
        ans+=1
        hold=max(hold,ans)

    else:
        ans=0
        flag=False


print(hold)
Buggy python submission (verdict: Runtime Error):
print(int(not int(input()))

Fixed submission:
print(int(not int(input())))
Buggy python submission (verdict: Runtime Error):
a = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
C = input()
print(a[a.index(C)+1])

Fixed submission:
a = "abcdefghijklmnopqrstuvwxyz"
C = input()
print(a[a.index(C)+1])
Buggy python submission (verdict: Runtime Error):
X, K, D = map(int, input().split())

abs_num = abs(X)
counter = 0
d_p = D

while (X > d_p):
  d_p += D
  counter += 1

if (counter <= K):
  point = d_p % X
  print(min(abs(point-D), point))
else:
  d_p = D * counter
  print(X - d_p)

Fixed submission:
X, K, D = map(int, input().split())

X = abs(X)

K_main = X // D
K_sub = K - K_main

if (K_sub < 0):
  print(abs(X - D * K))
else:
  answer = abs(X - D * K_main)
  if (K_sub % 2 == 0):
    print(answer)
  else:
    print(abs(answer -D))

Buggy python submission (verdict: Time Limit Exceeded):
X, K, D = map(int, input().split())

counter = 0

while (counter < K):
  if (X > 0):
    X = X - D
  else:
    X = X + D
  counter += 1

print(abs(X))


Fixed submission:
X, K, D = map(int, input().split())

X = abs(X)

K_main = X // D
K_sub = K - K_main

if (K_sub < 0):
  print(abs(X - D * K))
else:
  answer = abs(X - D * K_main)
  if (K_sub % 2 == 0):
    print(answer)
  else:
    print(abs(answer -D))
Buggy python submission (verdict: Runtime Error):
N, K = map(int, input().split())
S = list(input())
s_l = S[K].lower()
S[K] = s_l
print("".join(S))

Fixed submission:
N, K = map(int, input().split())
S = list(input())
s_l = S[K-1].lower()
S[K-1] = s_l
print("".join(S))

Buggy python submission (verdict: Runtime Error):
N, K = map(int, input().split())
S = list(input())

print(S)
s_l = S[K].lower()
S[K] = s_l
print("".join(S))

Fixed submission:
N, K = map(int, input().split())
S = list(input())
s_l = S[K-1].lower()
S[K-1] = s_l
print("".join(S))
Buggy python submission (verdict: Runtime Error):
a, b, c = int(input())

if (a + b + c) == 17:
  print("YES")
else:
  print("NO")



Fixed submission:
a, b, c = (int(x) for x in input().split())

if (a + b + c) == 17:
  print("YES")
else:
  print("NO")

Buggy python submission (verdict: Runtime Error):
a, b, c = int(input())

if (a + b + c) == 19:
  print("YES")
else:
  print("NO")

Fixed submission:
a, b, c = (int(x) for x in input().split())

if (a + b + c) == 17:
  print("YES")
else:
  print("NO")
Buggy python submission (verdict: Time Limit Exceeded):
s=input()
s=s.split()
n,m=int(s[0]),int(s[1])
x=[int(i) for i in input().split()]
y=[int(i) for i in input().split()]
mod =10**9 + 7
xrange=0
for i in range(n):
    for j in range(i+1,n):
        xrange=xrange+(x[j]-x[i])
yrange=0
for i in range(m):
    for j in range(i+1,m):
        yrange=yrange+(y[j]-y[i])
ans=(xrange*yrange)%mod
print(ans)



Fixed submission:
s=input()
s=s.split()
n,m=int(s[0]),int(s[1])
x=[int(i) for i in input().split()]
y=[int(i) for i in input().split()]
mod =10**9 + 7
xrange=0
for i in range(n):
    xrange-=x[i]*(n-i*2-1)
yrange=0
for i in range(m):
    yrange-=(m-i*2-1)*y[i];
ans=(xrange*yrange)%mod
print(ans)
Buggy python submission (verdict: Runtime Error):
X = int(input())
check =[]
check2=[]
for i in range(1,33):
    for s in range(2,11):
        check.append(pow(i,s))


for i in check:
    if i<X:
        check2.append(i)

print(max(check2))


Fixed submission:
X = int(input())
check =[]
check2=[]
for i in range(1,33):
    for s in range(2,11):
        check.append(pow(i,s))

#print(check)
for i in check:
    if i<=X:
        check2.append(i)
print(max(check2))

Buggy python submission (verdict: Runtime Error):
X = int(input())
check =[]
check2=[]
for i in range(1,33):
    for s in range(2,11):
        check.append(pow(i,s))
print(check)

for i in check:
    if i<X:
        check2.append(i)

print(max(check2))


Fixed submission:
X = int(input())
check =[]
check2=[]
for i in range(1,33):
    for s in range(2,11):
        check.append(pow(i,s))

#print(check)
for i in check:
    if i<=X:
        check2.append(i)
print(max(check2))
Buggy python submission (verdict: Runtime Error):
a = int(input())
b= int(input())
x = a*b
if x%2==0:
    print("Even")
else:
    print("Odd")

    

Fixed submission:
a,b = map(int,input().split())
if (a*b)%2==0:
    print("Even")
else:
    print("Odd")

Buggy python submission (verdict: Runtime Error):
a = input()
b= input()
x = a*b
def odd_even():
    if x%2==0:
        return "Even"
    else:
        return"Odd"
 
odd_even(x)


Fixed submission:
a,b = map(int,input().split())
if (a*b)%2==0:
    print("Even")
else:
    print("Odd")

Buggy python submission (verdict: Runtime Error):
a = input()
b= input()
x = a*b

if x%2==0:
    print("Even")
else:
    print("Odd")



Fixed submission:
a,b = map(int,input().split())
if (a*b)%2==0:
    print("Even")
else:
    print("Odd")

Buggy python submission (verdict: Runtime Error):
a = input()
b= input()
x = a*b

if x%2==0:
    print("Odd")
else:
    print("even")


Fixed submission:
a,b = map(int,input().split())
if (a*b)%2==0:
    print("Even")
else:
    print("Odd")

Buggy python submission (verdict: Runtime Error):
a = input()
b= input()
x = a*b
def odd_even():
    if x%2==0:
        return "Odd"
    else:
        return"Even"

odd_even(x)


Fixed submission:
a,b = map(int,input().split())
if (a*b)%2==0:
    print("Even")
else:
    print("Odd")

Buggy python submission (verdict: Runtime Error):
x = a*b
def odd_even():
    if x%2==0:
        return "Odd"
    else:
        return"Even"

odd_even(x)


Fixed submission:
a,b = map(int,input().split())
if (a*b)%2==0:
    print("Even")
else:
    print("Odd")

Buggy python submission (verdict: Runtime Error):
x = a*b
if x%2==0:
    print("Odd")
else:
    print("Even")


Fixed submission:
a,b = map(int,input().split())
if (a*b)%2==0:
    print("Even")
else:
    print("Odd")
Buggy python submission (verdict: Runtime Error):
x = str(input())
a =int(x[0])
b=int(x[1]9
c=int(x[2])


print(a+b+c)


Fixed submission:
x = str(input())
a =int(x[0])
b=int(x[1])
c=int(x[2])


print(a+b+c)

Buggy python submission (verdict: Runtime Error):
a,b,c = map(int,input().split())

print(a+b+c)

Fixed submission:
x = str(input())
a =int(x[0])
b=int(x[1])
c=int(x[2])


print(a+b+c)

Buggy python submission (verdict: Runtime Error):
s1,s2,s3 = map(int,input().split())

check = s1+s2+s3
print(check)

Fixed submission:
x = str(input())
a =int(x[0])
b=int(x[1])
c=int(x[2])


print(a+b+c)

Buggy python submission (verdict: Runtime Error):
s1,s2,s3 = map(int,input().split())

check = s1+s2+s3
if print(check)

Fixed submission:
x = str(input())
a =int(x[0])
b=int(x[1])
c=int(x[2])


print(a+b+c)
Buggy python submission (verdict: Runtime Error):
N  = int(input())
x = map(int,input().split())
count=0
check = 0
NEW_x=[]

def roop(N,x):
    global check
    global NEW_x
    for i in x:
        if i%2==0:
            check +=1
            s = i//2
            NEW_x.append(s)


        else:
            NEW_x.append(s)

roop(N,x)

while True:
  
    x = NEW_x
    NEW_x = []
    if check ==N:
        check=0
        count+=1
        roop(N,x)
    else:
        break

print(count)



Fixed submission:
N  = int(input())
x = map(int,input().split())
count=0
check = 0
NEW_x=[]

def roop(N,x):
    global check
    global NEW_x
    for i in x:
        s = i//2
        if i%2==0:
            check +=1
            
            NEW_x.append(s)


        else:
            NEW_x.append(s)

roop(N,x)

while True:
  
    x = NEW_x
    NEW_x = []
    if check ==N:
        check=0
        count+=1
        roop(N,x)
    else:
        break

print(count)
Buggy python submission (verdict: Runtime Error):
A,V = [int(x) for x in input().split()]
B,W = [int(x) for x in input().split()]
T = int(input())
D = abs(A-B)
S = V-W
T1 = float(D/S)
if S>0 and T1 <= T:
    print('Yes')
else:
    print('No')

Fixed submission:
AV = [int(x) for x in input().split()]
BW = [int(x) for x in input().split()]
A = AV[0]
V = AV[1]
B = BW[0]
W = BW[1]
T = int(input())
T = float(T)
D = abs(A-B)
S = V-W
if S>0:
    T1 = float(D/S)
    if T1<=T:
        print('YES')
    else:
        print('NO')
else:
    print('NO')
Buggy python submission (verdict: Time Limit Exceeded):
import math as mt
N = int(input())
A = [int(x) for x in input().split()]
a = 1
for i in range(N):
    a *= A[i]
if a > 1000000000000000000:
    print(-1)
else:
    print(a)
    

Fixed submission:
N = int(input())
A = [int(x) for x in input().split()]
a = 1
if 0 in A:
    a = 0
else:
    for i in range(N):
        a *= A[i]

        if a > 1000000000000000000:
            a = -1
            break
print(a)
Buggy python submission (verdict: Runtime Error):
def factorization(n):
    arr = []
    temp = n
    for i in range(2, int(-(-n**0.5//1))+1):
        if temp%i==0:
            cnt=0
            while temp%i==0:
                cnt+=1
                temp //= i
            arr.append([i, cnt])

    if temp!=1:
        arr.append([temp, 1])

    if arr==[]:
        arr.append([n, 1])

    return arr

a = int(input())
b = factorization(a)
countation = 0
for i in range(len(b)):
    t = b[i][1]
    k = 1
    n = 1
    while t >= n:
        countation += 1
        k = k + 1
        n = k*(k+1)/2
if a != 1
    print(countation)
else:
    print(0)

Fixed submission:
def factorization(n):
    arr = []
    temp = n
    for i in range(2, int(-(-n**0.5//1))+1):
        if temp%i==0:
            cnt=0
            while temp%i==0:
                cnt+=1
                temp //= i
            arr.append([i, cnt])

    if temp!=1:
        arr.append([temp, 1])

    if arr==[]:
        arr.append([n, 1])

    return arr

a = int(input())
b = factorization(a)
countation = 0
for i in range(len(b)):
    t = b[i][1]
    k = 1
    n = 1
    while t >= n:
        countation += 1
        k = k + 1
        n = k*(k+1)/2
if a != 1:
    print(countation)
else:
    print(0)
Buggy python submission (verdict: Runtime Error):
S = list(input())
T = list(input())
a = 0
for i in range(0,s):
    if S[i] != T[i]:
        a = 1
if a == 0:
    print('Yes')
else:
    print('No')

Fixed submission:
S = list(input())
T = list(input())
a = 0
s = len(S)
for i in range(0,s):
    if S[i] != T[i]:
        a = 1
if a == 0:
    print('Yes')
else:
    print('No')
Buggy python submission (verdict: Runtime Error):
N = input()
n =[int(x) for x in N]
A = n[0]
B = n[1]
C = n[2]
K = n[3]
if A>=K:
    print(K)
elif K <= A+B:
    print(A)
else:
    print(2*A+B-K)

Fixed submission:
N = input()
n =[int(x) for x in N.split()]
A = n[0]
B = n[1]
C = n[2]
K = n[3]
if A>=K:
    print(K)
elif K <= A+B:
    print(A)
else:
    print(2*A+B-K)
Buggy python submission (verdict: Runtime Error):
K = input().split(" ")
k = [int(n) for n in K]
t =k[0]//k[3]
a = k[2]//k[1]
t1 = k[0]%k[3]
a1 = k[2]%k[1]
if t > a:
    print('Yes')
elif t == a and a1 /= 0:
    print('Yes')
elif t == a and t1 /= 0:
    print('No')
else:
    print('No')


Fixed submission:
K = input().split(" ")
k = [int(n) for n in K]
t =k[0]//k[3]
a = k[2]//k[1]
t1 = k[0]%k[3]
a1 = k[2]%k[1]
if t1 != 0:
    t = t+1
if a1 != 0:
    a = a+1
if t>=a:
    print('Yes')
else:
    print('No')
Buggy python submission (verdict: Runtime Error):
import math as mt
K = input().split(" ")
A = int(K[0])
B = int(K[1])
a = float(A*12.5)
t = float((A+1)*12.5)
t1 = mt.ceil(t)
b = B*10
a1 = mt.ceil(a)
A_data = []
B_data = []
for i in range(b,b+10):
    A_data.append(i)
for i in range(a1,a1+t1):
    B_data.append(i)
A_set = set(A_data)
B_set = set(B_data)
AB_set = A_set & B_set
if AB_set:
    P = min(AB_set)
    print(P)
else:
    print(-1)
    



Fixed submission:
S = input()
if S == "AAA" or S =="BBB":
    print('No')
else:
    print('Yes')
Buggy python submission (verdict: Runtime Error):
import numpy as np
x = input()
y = input()
z = input()
xa = x.split(" ")
ya = y.split(" ")
za = z.split(" ")
A = np.array([xa,ya,za])
N = int(input())
b =[]
C = np.array([["Nomark", "Nomark", "Nomark"],["Nomark", "Nomark", "Nomark"],["Nomark", "Nomark", "Nomark"]])
for i in range(1,N+1):
    b.append(input())
for m in range(0,3):
    for n in range(0,3):
        if A[m, n] in b:
            C[m,n] = "Maru"
tate = str(np.count_nonzero(C == 'Maru', axis=0))

yoko = str(np.count_nonzero(C == 'Maru', axis=1))

if "3" in tate or "3" in yoko:
    print('Yes')
elif C[0,0] == "Maru" and C[1,1] == "Maru" and C[2,2] == "Maru":
    print("Yes")
elif C[0,2] == "Maru" and C[1,1] == "Maru" and C[2,0] == "Maru":
    print("Yes")
else:
    print("No")

Fixed submission:
a = int(input())
if a%2 == 0:
    b = a/2
else:
    b=(a+1)/2
print(int(b))
Buggy python submission (verdict: Runtime Error):
H =input()
A =input()
h = int(H)
a = int(A)
if h % a == 0:
    n = h // a
else:
    n = h // a +1
print(n)

Fixed submission:
H,A =input().split()
h = int(H)
a = int(A)
if h % a == 0:
    n = h // a
else:
    n = h // a +1
print(n)

Buggy python submission (verdict: Runtime Error):
H=input()
A=input()
h = int(H)
a = int(A)
if mod(h,a) == 0:
    n = h // A
else:
    n = h // a +1
print(n)

Fixed submission:
H,A =input().split()
h = int(H)
a = int(A)
if h % a == 0:
    n = h // a
else:
    n = h // a +1
print(n)

Buggy python submission (verdict: Runtime Error):
H=input()
A=input()
h = int(H)
a = int(A)
if mod(H,A) == 0:
    n = H // A
else:
    n = H // A +1
print(n)

Fixed submission:
H,A =input().split()
h = int(H)
a = int(A)
if h % a == 0:
    n = h // a
else:
    n = h // a +1
print(n)

Buggy python submission (verdict: Runtime Error):
h=input()
a=input()
H = int(h)
A= int(a)
n = H // A + 1
print(n)

Fixed submission:
H,A =input().split()
h = int(H)
a = int(A)
if h % a == 0:
    n = h // a
else:
    n = h // a +1
print(n)

Buggy python submission (verdict: Runtime Error):
H=input()
A=input()
h = int(H)
a= int(A)
n :int= h // a + 1
print(n)

Fixed submission:
H,A =input().split()
h = int(H)
a = int(A)
if h % a == 0:
    n = h // a
else:
    n = h // a +1
print(n)

Buggy python submission (verdict: Runtime Error):
h=input()
a=input()
H = int(h)
A= int(a)
n :int= H // A + 1
print(n)

Fixed submission:
H,A =input().split()
h = int(H)
a = int(A)
if h % a == 0:
    n = h // a
else:
    n = h // a +1
print(n)

Buggy python submission (verdict: Runtime Error):
H=input()
A=input()
n=H//A+1
print(n)

Fixed submission:
H,A =input().split()
h = int(H)
a = int(A)
if h % a == 0:
    n = h // a
else:
    n = h // a +1
print(n)
Buggy python submission (verdict: Runtime Error):
N = input()
if N % 2 == 0:
    print(N/2-1)
else:
    print((N-1)/2)
   

Fixed submission:
N = int(input())
if N%2 == 0:
    print(int(N/2-1))
else:
    print(int((N-1)/2))

Buggy python submission (verdict: Runtime Error):
N = 1
N = input()
if N % 2 == 0:
    print(N/2-1)
else:
    print((N-1)/2)
   

Fixed submission:
N = int(input())
if N%2 == 0:
    print(int(N/2-1))
else:
    print(int((N-1)/2))

Buggy python submission (verdict: Runtime Error):
N = input()
if N%2 = 0:
    print(N/2-1)
else:
    print((N-1)/2)
   

Fixed submission:
N = int(input())
if N%2 == 0:
    print(int(N/2-1))
else:
    print(int((N-1)/2))

Buggy python submission (verdict: Runtime Error):
int N
if N%2 = 0:
    print(N/2-1)
else:
    print((N-1)/2)
   

Fixed submission:
N = int(input())
if N%2 == 0:
    print(int(N/2-1))
else:
    print(int((N-1)/2))
Buggy python submission (verdict: Runtime Error):
a,b = input()
A = int(a)
B = int(b)
c=A*B
if c%2 == 0:
  print("Even")
else:
  print("Odd")


Fixed submission:
a,b = input().split()
A = int(a)
B = int(b)
c=A*B
if c%2 == 0:
  print("Even")
else:
  print("Odd")

Buggy python submission (verdict: Runtime Error):
a,b = input()
A = int(a)
B = int(b)
c=a*b
if c%2 == 0:
  print("Even")
else:
  print("Odd")

Fixed submission:
a,b = input().split()
A = int(a)
B = int(b)
c=A*B
if c%2 == 0:
  print("Even")
else:
  print("Odd")
Buggy python submission (verdict: Runtime Error):
print(!int(input()))

Fixed submission:
print(int(not int(input())))

Buggy python submission (verdict: Runtime Error):
a,b,c,d = map(int,input().split())
print(max([a*b,b*c,a*d,b*d]))

Fixed submission:
x = int(input())
if x == 1:
  print(0)
else :
  print(1)
Buggy python submission (verdict: Runtime Error):
L=int(input())
R=int(input())
d=int(input())
count=int(0)
for i in range(L,R):
    if i%d==0:
        count+=1
print(count)

Fixed submission:
L,R,d = map(int,input().split())
count=int(0)
for i in range(L,R+1):
    if i%d==0:
        count+=1
print(count)

Buggy python submission (verdict: Runtime Error):
L=int(input())
R=int(input())
d=int(input())
count=int(0)
for i in range(L,R):
    if i%d==0:
        count+=1
print count

Fixed submission:
L,R,d = map(int,input().split())
count=int(0)
for i in range(L,R+1):
    if i%d==0:
        count+=1
print(count)
Buggy python submission (verdict: Runtime Error):
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()

Fixed submission:
#172B
def B():
    s = input()
    t = input()
    count = 0
    for i in range(len(s)):
        if s[i] != t[i]:
            count += 1
    print(count)
B()

Buggy python submission (verdict: Runtime Error):
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()

Fixed submission:
#172B
def B():
    s = input()
    t = input()
    count = 0
    for i in range(len(s)):
        if s[i] != t[i]:
            count += 1
    print(count)
B()

Buggy python submission (verdict: Runtime Error):
#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()

Fixed submission:
#172B
def B():
    s = input()
    t = input()
    count = 0
    for i in range(len(s)):
        if s[i] != t[i]:
            count += 1
    print(count)
B()
Buggy python submission (verdict: Runtime Error):
D,T,S=map(int,input().split())
if T*S>D:
  print(Yes)
else:
  print(No)

Fixed submission:
D,T,S=map(int,input().split())
if T*S>=D:
  print("Yes")
else:
  print("No")

Buggy python submission (verdict: Runtime Error):
D,T,S=map(int,input().split())
if D<T*S:
  print(Yes)
else:
  print(No)

Fixed submission:
D,T,S=map(int,input().split())
if T*S>=D:
  print("Yes")
else:
  print("No")

Buggy python submission (verdict: Runtime Error):
D,T,S=map(int,input().split())
if D<S*T
 print(Yes)
else
 print(No)

Fixed submission:
D,T,S=map(int,input().split())
if T*S>=D:
  print("Yes")
else:
  print("No")

Buggy python submission (verdict: Runtime Error):
D,T,S map(int,input().split())
if D<S*T
 print(Yes)
else
 print(No)

Fixed submission:
D,T,S=map(int,input().split())
if T*S>=D:
  print("Yes")
else:
  print("No")
Buggy python submission (verdict: Runtime Error):
N,X,T=map(int,input().split)
if N//X<N/X<N//x+1:
  print((N//X+1)*T) 
else:
  print(N/X*T)

Fixed submission:
N,X,T=map(int,input().split())
if N//X<N/X<N//X+1:
  print((N//X+1)*T) 
else:
  print(N//X*T)
Buggy python submission (verdict: Runtime Error):
N=int(input())
S=str(N)
A=len(S)
M=0
for i in range(N):
  M=M+int(S[i])
if M%9==0:  
  print("Yes")
else:
  print("No")

Fixed submission:
N=int(input())
if N%9==0:
  print("Yes")
else:
  print("No")

Buggy python submission (verdict: Runtime Error):
N=int(input())
S=str(N)
A=len(S)
M=0
for i in range(N):
  M=M+int(S[i])
if M%9==0:  
  print("Yes")
else:
  print("No")
  

Fixed submission:
N=int(input())
if N%9==0:
  print("Yes")
else:
  print("No")

Buggy python submission (verdict: Runtime Error):
N=int(input())
M=int(input())
S=str(N)
A=len(S)
int(S[i])
for i in range(A):
　　M=M+S[i]
if M%9==0:
  print("Yes")
else:
  print("No")

Fixed submission:
N=int(input())
if N%9==0:
  print("Yes")
else:
  print("No")

Buggy python submission (verdict: Runtime Error):
N=int(input())
S=str(N)
A=len(S)
int(S[i])
for i in range(A):
M=M+S[i] 
if M%9==0:
  print("Yes")
else:
  print("No")

Fixed submission:
N=int(input())
if N%9==0:
  print("Yes")
else:
  print("No")
Buggy python submission (verdict: Runtime Error):
A,B=input().split()
B=list(B)
N=B[0]+B[2]+B[3]
N=int(N)
C=int(A*N/100)
print(C)

Fixed submission:
A,B=input().split()
A=int(A)
B=list(B)
N=B[0]+B[2]+B[3]
N=int(N)
C=int(A*N//100)
print(C)

Buggy python submission (verdict: Runtime Error):
A,B=input().split()
B=list(B)
N=B[1]+B[2]+B[3]
N=int(N)
C=int(A*N/100)
print(C)

Fixed submission:
A,B=input().split()
A=int(A)
B=list(B)
N=B[0]+B[2]+B[3]
N=int(N)
C=int(A*N//100)
print(C)

Buggy python submission (verdict: Runtime Error):
A=int(input())
B=float(input())
C=int(A*B)
print=C

Fixed submission:
A,B=input().split()
A=int(A)
B=list(B)
N=B[0]+B[2]+B[3]
N=int(N)
C=int(A*N//100)
print(C)