qyliang/CodeNanoFix huggingface dataset:
Buggy code:
import sys, re
from math import ceil, floor, sqrt, pi, factorial, gcd
from copy import deepcopy
from collections import Counter, deque
from heapq import heapify, heappop, heappush
from itertools import accumulate, product, combinations, combinations_with_replacement
from bisect import bisect, bisect_left, bisect_right
from functools import reduce
from decimal import Decimal, getcontext
# input = sys.stdin.readline 
def i_input(): return int(input())
def i_map(): return map(int, input().split())
def i_list(): return list(i_map())
def i_row(N): return [i_input() for _ in range(N)]
def i_row_list(N): return [i_list() for _ in range(N)]
def s_input(): return input()
def s_map(): return input().split()
def s_list(): return list(s_map())
def s_row(N): return [s_input for _ in range(N)]
def s_row_str(N): return [s_list() for _ in range(N)]
def s_row_list(N): return [list(s_input()) for _ in range(N)]
def lcm(a, b): return a * b // gcd(a, b)
sys.setrecursionlimit(10 ** 6)
INF = float('inf')
MOD = 10 ** 9 + 7
num_list = []
str_list = []

def main():
    a, b = i_map()

    print('H' if a == b else 'D')

if __name__ == '__main__':
    main()


Fixed code:
import sys, re
from math import ceil, floor, sqrt, pi, factorial, gcd
from copy import deepcopy
from collections import Counter, deque
from heapq import heapify, heappop, heappush
from itertools import accumulate, product, combinations, combinations_with_replacement
from bisect import bisect, bisect_left, bisect_right
from functools import reduce
from decimal import Decimal, getcontext
# input = sys.stdin.readline 
def i_input(): return int(input())
def i_map(): return map(int, input().split())
def i_list(): return list(i_map())
def i_row(N): return [i_input() for _ in range(N)]
def i_row_list(N): return [i_list() for _ in range(N)]
def s_input(): return input()
def s_map(): return input().split()
def s_list(): return list(s_map())
def s_row(N): return [s_input for _ in range(N)]
def s_row_str(N): return [s_list() for _ in range(N)]
def s_row_list(N): return [list(s_input()) for _ in range(N)]
def lcm(a, b): return a * b // gcd(a, b)
sys.setrecursionlimit(10 ** 6)
INF = float('inf')
MOD = 10 ** 9 + 7
num_list = []
str_list = []

def main():
    a, b = s_map()

    print('H' if a == b else 'D')

if __name__ == '__main__':
    main()
Buggy code:
a,b=map(str,input().split());print('DH'[a==b::2]

Fixed code:
a,b=map(str,input().split());print('DH'[a==b::2])
Buggy code:
a, b = input().split()

if a = 'H':
  if b = 'H':
    print('H')
  else:
    print('D')
else:
  if b = 'H':
    print('D')
  else:
    print('H')
    
  

Fixed code:
a,b = input().split()
if a == b== 'H' or a==b=='D':
  print('H')
else:
  print('D')
Buggy code:
a, b = input().split()

if a == b:
 print('H')
else:
 print('D')s

Fixed code:
a, b = input().split()

if a == b:
 print('H')
else:
 print('D')
Buggy code:
a,b=map(input().split())
if(a =='H' and b=='H') or (a =='D' and b=='D'):
    print('H')
else:
    print('D')

Fixed code:
a,b=input().split()
if(a =='H' and b=='H') or (a =='D' and b=='D'):
    print('H')
else:
    print('D')
Buggy code:
a,b = input().split()

if a=='H':
    if b=='H':
        print('H')
    else:
        print('D')
else:
    if b==H:
        print('D')
    else:
        print('H')

Fixed code:
a,b=input().split()
if a=='H':
    if b=='H':
        print('H')
    else:
        print('D')
else:
    if b=='H':
        print('D')
    else:
        print('H')
Buggy code:
a,_,b=input().split()
print("DH"[a==b])

Fixed code:
a,b=input().split()
print("DH"[a==b])
Buggy code:
a,b = input().split()
if a == b:
	print("H"):
else:
	print("D")
	

Fixed code:
a,b=input().split()
print("H") if a==b else print("D")
Buggy code:
a, b = input(),split()
if a == b:
    print("H")
else:
    print("D")


Fixed code:
a,b = input().split()
if a == b:
     print('H')
else:
     print('D')
Buggy code:
a, b = input().split()

if a == 'H'
  if b == 'H':
  	print('H')
  else:
    print('D')

else:
  if b == 'H':
    print('D')
  else:
    print('H')
 

Fixed code:
a, b = input().split()

print('H' if a == b else 'D')
Buggy code:
a, b = map(input().split())
print ("H" if a == "H" and b == "H" else "H" if a == "D" and b == "D" else "D")

Fixed code:
a, b = input().split()
print ("H" if a == "H" and b == "H" else "H" if a == "D" and b == "D" else "D")
Buggy code:
a, t = input().split()
print("H" if a == "H" and b =="H" or a == "D" and b == "D" else "D")

Fixed code:
a,b=input().split()
print('H' if a=='H' and b=='H' or a=='D' and b=='D' else 'D')
Buggy code:
x, y = input.split()
if x == y:
  print("H")
else:
  print("D")

Fixed code:
x, y = input().split()
if x == y:
  print("H")
else:
  print("D")
Buggy code:
a,b=input().split()
if a=='H':
  print('b')
else:
  if b=='H':
    print('D')
  else:
    print('H')

Fixed code:
a, b = input().split()
if a == 'H':
    print('H' if b == 'H' else 'D')
else:
    print('D' if b == 'H' else 'H')
Buggy code:
a,b=map(int,input().split())
x= (a=="H")
y=(b=="H")
if :x and y or not x and not y
  print("H")
else:
  print("D")

Fixed code:
a,b=input().split()
x= (a=="H")
y=(b=="H")
if x and y or not x and not y:
  print("H")
else:
  print("D")
Buggy code:
a, b = map(str, input.split())
if a == b:
    print('H')
else:
    print('D')

Fixed code:
a,b = map(str,input().split())
print('H') if a == b else print('D')
Buggy code:
a, b = input().split()
if a == b: print 'H'
else: print 'D'

Fixed code:
a, b = input().split()
print("H") if a==b else print("D")
Buggy code:
a,b = map(str,input().split())

if s == b:
  print("H")
else:
  print("D")

Fixed code:
a, b = map(str, input().split())
if a == "H":
    if b == "H":
        print("H")
    else:
        print("D")
else:
    if b == "H":
        print("D")
    else:
        print("H")
Buggy code:
if len(input().split())==2:
  print("D")
else:
  print("H")

Fixed code:
if len(set(input().split()))==2:
  print("D")
else:
  print("H")
Buggy code:
a,b=input().split()
if a=="H":
  f=True
else:
  f=False
if f:
  print("H" if b=="H" else "D")
else:
  print("H" if b=="D" else "D"

Fixed code:
a,b=input().split()
if a=="H":
  f=True
else:
  f=False
if f:
  print("H" if b=="H" else "D")
else:
  print("H" if b=="D" else "D")
Buggy code:
a, b=map(str, input().split())
if a is "H"
    if b is "H"
        print("H")
    else:
        print("D")
else:
    if b is "H"
        print("D")
    else:
        print("H")


Fixed code:
a, b=map(str, input().split())
if a is 'H':
    if b is 'H':
        print('H')
    else:
        print('D')
else:
    if b is 'H':
        print('D')
    else:
        print('H')
Buggy code:
a,b=input().split()
if a == b == "H":
    print("H")
else:
    print("D")

Fixed code:
a,b=input().split()
if a =="H":
    if b=="H":
        print("H")
    else:
        print("D")
else:
    if b=="H":
        print("D")
    else:
        print("H")
Buggy code:
a,b=input().split()
if a=="H":
    if a=="H":
        print("H")
    else:
        print("D")
else:
    if a=="H":
        print("D")
    else:
        print("H")

Fixed code:
a,b = input().split()

if a == b:
    print("H")
else:print("D")
Buggy code:
a.b=input().split()
if a=="H" and b=="H":
	print("H")
elif a=="H" and b=="D":
	print("D")
elif a=="D" and b=="D":
	print("H")
else:
	print("D")

Fixed code:
a,b=input().split()
if a=="H" and b=="H":
	print("H")
elif a=="H" and b=="D":
	print("D")
elif a=="D" and b=="D":
	print("H")
else:
	print("D")
Buggy code:
a,b=map(input().split())
if (a=="H" and b=="H") or (a=="D" and b=="D"):
    print("H")
else:
    print("D")

Fixed code:
a,b=input().split()
if (a=="H" and b=="H") or (a=="D" and b=="D"):
    print("H")
else:
    print("D")
Buggy code:
a,b = input().split()
if a == b:
print("H")
else:
print("D")

Fixed code:
a, b = input().split()
if a == "H":
    if b =="H":
        print("H")
    else:
        print("D")
else:
    if b == "H":
        print("D")
    else:
        print("H")
Buggy code:
x=input().split().replace(' ','')
print('H' if x=='HH' or x=='DD' else 'D')

Fixed code:
x=input().replace(' ','')
print('H' if x=='HH' or x=='DD' else 'D')
Buggy code:
a,b=map(str,input().split())
if (a=="H" and b=="H") and (a=="H" and b=="H"):
    print("H")
else:
    print("D")

Fixed code:
a,b=map(str,input().split())
if (a=="H" and b=="H") or (a=="D" and b=="D"):
    print("H")
else:
    print("D")
Buggy code:
a,b=input().split()
if a!=b:
  print("D")
elif a=="D" and b=="D":
  print("D")
else:
  print("H")


Fixed code:
a, b = input().split()

if a == 'H' and b == 'H':
  print('H')
elif a == 'D' and b == 'D':
  print('H')
else:
  print('D')
Buggy code:
a,b=map(str,input().split())
if a and b == 'H' or a and b == 'D':
  print('H')
else:
  print('D')


Fixed code:
a, b = map(str, input().split())
if (a == "H" and b == "H") or (a == "D" and b == "D"):
  print("H")
else:
  print("D")
Buggy code:
a, b = input().split()

if a == 'H':
    print(b)
else:
    if b == 'H':
        print('D')
    else:
        print('D\H')        


Fixed code:
a,b = input().split()
if a == "H":
    if b == "H":
        print("H")
    else:
        print("D")
else:
    if b == "H":
        print("D")
    else:
        print("H")
Buggy code:
def solve():
    a, b = list(map(int, input().split(" ")))
    
    if a == b:
        print("H")
    else:
        print("D")


solve()

Fixed code:
def solve():
    a, b = list(map(str, input().split(" ")))

    if a == b:
        print("H")
    else:
        print("D")


solve()
Buggy code:
a,b = input().split()
print("H" if a ==  b == "H" else "D")


Fixed code:
a,b = input().split()
print("H" if a ==  b else "D")
Buggy code:
a,b = input().split()
if a = "H":
  print(b)
elif b = "H":
  print("D")
else:
  print("H")

Fixed code:
a, b = input().split()

if a=='H':
	if b=='H':
		print('H')
	else:
		print('D')
else:
	if b=='H':
		print('D')
	else:
		print('H')
Buggy code:
A, B = [s == "H" for s in input().split()]

print(["D", "H"][A ^ B])

Fixed code:
A, B = [s == "H" for s in input().split()]

print(["H", "D"][A ^ B])
Buggy code:
a, b = map(str, input().split())
if a = 'H':
  print(b)
else:
  if b = 'H':
    print('D')
  else:
    print('H')

Fixed code:
a,b=map(str,input().split())
if a=='H':
    if b=='H':
        ans = 'H'
    else:
        ans = 'D'
else:
    if b=='H':
        ans = 'D'
    else:
        ans = 'H'
print(ans)
Buggy code:
a,b = map(input().split())
print("H" if a==b=="H" or a==b=="D" else "D")

Fixed code:
a,b = input().split()
print("H" if a==b=="H" or a==b=="D" else "D")
Buggy code:
a, b = list(input().split(' '))

if a=='D' and b=='D':
  print('H')
elif a=='H':
  print('H')
elif a=='D':
  print('H')
     

Fixed code:
a, b = list(input().split(' '))

if a=='D' and b=='D':
  print('H')
elif a=='H'and b=='H':
  print('H')
elif a=='D'and b=='H':
  print('D')
else:
  print('D')
Buggy code:
a,t = input().split()

if a == "H":
  print(b)
else:
  if b == "D":
    print("H")
  else:
    print("D")

Fixed code:
a,b=input().split()
if a=="H" :
    if b=="H":
        print("H")
    else :
        print("D")
else :
    if b=="H":
        print("D")
    else :
        print("H")
Buggy code:
a, b = input().split()

if a=H and b=H:print(H)
elif a=D and b=D:print(H)
else:print(D)

Fixed code:
a,b = input().split()
if a == "H" and b == "H":
    print("H")
elif a == "D" and b == "D":
    print("H")
else:
    print("D")
Buggy code:
# -*- coding: utf-8 -*-
import sys
import copy
import collections
from bisect import bisect_left
from bisect import bisect_right
from collections import defaultdict
from heapq import heappop, heappush, heapify
import math
import itertools
import random
 
# NO, PAY-PAY
#import numpy as np
#import statistics
#from statistics import mean, median,variance,stdev
 
INF = float('inf')
def inputInt(): return int(input())
def inputMap(): return map(int, input().split())
def inputList(): return list(map(int, input().split()))
 
def main():
    a,b = inputMap()
    
    if a == "H":
        if b == "H":
            print("H")
        else:
            print("D")
    else:
        if b == "H":
            print("D")
        else:
            print("H")
    
    
if __name__ == "__main__":
	main()


Fixed code:
# -*- coding: utf-8 -*-
import sys
import copy
import collections
from bisect import bisect_left
from bisect import bisect_right
from collections import defaultdict
from heapq import heappop, heappush, heapify
import math
import itertools
import random
 
# NO, PAY-PAY
#import numpy as np
#import statistics
#from statistics import mean, median,variance,stdev
 
INF = float('inf')
def inputInt(): return int(input())
def inputMap(): return map(int, input().split())
def inputList(): return list(map(int, input().split()))
 
def main():
    a,b = map(str, input().split())
    
    if a == "H":
        if b == "H":
            print("H")
        else:
            print("D")
    else:
        if b == "H":
            print("D")
        else:
            print("H")
    
    
if __name__ == "__main__":
	main()
Buggy code:
a, b = input.split()

if (a=="H"and b=="H")or(a=="D" and b=="D"):
    print("H")
else:
    print("D")

Fixed code:
a, b = input().split()

if (a=="H"and b=="H")or(a=="D" and b=="D"):
    print("H")
else:
    print("D")
Buggy code:
a, b = map(int, input().split())

if a == 'H' and b == 'H':
    print('H')
elif a == 'H' and b == 'D':
    print('D')
elif a == 'D' and b == 'H':
    print('D')
else:
    print('H')

Fixed code:
a, b = map(str, input().split())
if a == 'H' and b == 'H':
  print('H')
elif a == 'D' and b == 'D':
  print('H')
else:
  print('D')
Buggy code:
a, b = list(map(str, input().split()))
if a == b : print(a)
else : print("D")

Fixed code:
a, b = list(map(str, input().split()))
if a == b : print("H")
else : print("D")
Buggy code:
a, b = input.split()
print("H" if a == b else D"")

Fixed code:
a,b = input().split()
print("H") if a==b else print("D")
Buggy code:
a,b=input(),split()
print('HD'[a!=b])

Fixed code:
a,b=input().split()
print('HD'[a!=b])
Buggy code:
a,b=input().split()

if a == "H":
  print("H")
else if a == "D" and b == "H":
  print("D")
else:
  print("H")

Fixed code:
a, b = input().split(" ")
if (a == "H" and b == "H") or (a == "D" and b == "D"):
  print("H")
else:
  print("D")
Buggy code:
a,b = input().split()
if a == b == H:
    print("H")
if a == H and b == D:
    print("D")
if a == D and b == H:
    print("D")
else:
    print("H")
    

Fixed code:
a,b = input().split()
if (a=="H" and b=="H") or (a=="D" and b=="D"):
    print("H")
else:
    print("D")
Buggy code:
#ABC056.A
a,b = input().split()
if a == b:
    print('H')
else:
    prind('D')

Fixed code:
#ABC056.A
a,b = input().split()
if a == b:
    print('H')
else:
    print('D')
Buggy code:
a,b = input().split()
print(a,b)
if a == "H":
  print(b)
elif b == "H":
  print("D")
else:
  print("H")

Fixed code:
a,b = input().split()
if a == 'H':
    if b == 'H':
        print('H')
    else:
        print('D')
else:
    if b == 'H':
        print('D')
    else:
        print('H')
Buggy code:
a,b = input().split()

if a == 'D':
    if b == 'H':
        print('H')
    else:
        print('D')
else:
    if b == 'H':
        print('D')
    else:
        print('H')

Fixed code:
a, b = input().split()
print('H' if a == b else 'D')
Buggy code:
a,b=map(str,input().split())
if a=="H" and b="H" or a=="D" and b="D":
  print("H")
else:
  print("D")

Fixed code:
a,b = map(str,input().split())
if a == 'D' and b == 'D':
    print('H')
elif a == 'H' and b == 'H':
    print('H')
else:
    print('D')
Buggy code:
a,b = input().split()
if a == D and b == D:
    print('H')
elif a == H and b == H:
    print('H')
else:
    print('D')

Fixed code:
a, b = input().split()

if a =="D" and b =="D":
  print("H")
elif a =="H" and b =="H":
  print("H")
else:
  print("D")
Buggy code:
a, b = input().split()
print("H" if a == 'H' and b == 'H' else 'D')

Fixed code:
a, b = input().split(" ")
print("H" if (a == b) else "D")
Buggy code:
# -*- coding: utf-8 -*-
a,b = map(str,input().split())
if (a = "H" and b = "H")or(a = "D" and b = "D"):
  print("H")
else:
  print("D")

Fixed code:
# -*- coding: utf-8 -*-
a,b = map(str,input().split())
if (a == "H" and b == "H")or(a =="D" and b == "D"):
  print("H")
else:
  print("D")
Buggy code:
a, b = input().split()
if a = 'H' and b ='H':
    print('H')
elif a = 'H' and b ='D':
    print('D')
elif a = 'D' and b = 'H':
    print('D')
elif a = 'D' and b = 'D':
    print('H')

Fixed code:
a,b = input().split()
if a=='H' and b=='H':
    print('H')
elif a=='D' and b=='D':
    print('H')
else:
    print('D')
Buggy code:
a,b = input.split()
print('H') if a == b else print('D')

Fixed code:
a,b = input().split()
print('H') if a == b else print('D')
Buggy code:
a,b = map(str,input().split(' '))
if a == 'H':
  print(b)
elif a == 'D' and b == 'H':
  print('D')
else
:print('H')


Fixed code:
a,b = map(str, input().split())

if a == ("H") and b == ("H"):
    print("H")
elif a == ("D") and b == ("D"):
    print("H")
else:
    print("D")
Buggy code:
a, b = list(map(str, input().split()))
if a == 'H':
    print(b)
else:
    print('H' if b=="D" else "H")

Fixed code:
a,b=map(str,input().split())
if a==b:
  print("H")
else:
  print("D")
Buggy code:
a, b = input().split()
if (a==b=='H') or (a=='D' and b =='H'):
    print('H')
else:
    print('D')

Fixed code:
a, b = input().split()
if (a==b=='H') or (a=='D' and b =='D'):
    print('H')
else:
    print('D')
Buggy code:
a,b = input().split()

if a == 'H'
    if b == 'H':
        print('H')
    else:
        print('D')
else:
    if b == 'H':
        print('D')
    else:
        print('H')

Fixed code:
a, b =input().split()
if a==b:
  print("H")
else:
  print("D")
Buggy code:
str = input().split(' ')
a = str[0]
b = str[1]

res = 'H'
if a != b:
  res = 'D'
else:
  res = 'H'

Fixed code:
str = input().split(' ')
a = str[0]
b = str[1]

res = 'H'
if a != b:
  res = 'D'
else:
  res = 'H'

print(res)
Buggy code:
a,b=input().split()
if a='H' and b='H':
    print('H')
elif a='H' and b='D':
    print('D')
elif a='D' and b='H':
    print('D')
else:
    print('H')

Fixed code:
a,b = input().split()

if a==b=="H" :
    print("H")
elif a==b=="D":
    print("H")
else:
    print("D")
Buggy code:
x, y = input().split()

if(x != y):
  print("H")
else:
  print("D")

Fixed code:

x, y = input().split()

if(x != y):
  print("D")
else:
  print("H")
Buggy code:
# -*- coding: utf-8 -*

if input() == 'H H' or 'D D':
    print('H')
else:
    print('D')

Fixed code:
# -*- coding: utf-8 -*
a = input()
if a == 'H H' or a == 'D D':
    print('H')
else:
    print('D')
Buggy code:
a,b=input().split()

print("H" if a==b else"D)

Fixed code:
a, b = input().split()

if b == 'H':
    if a == 'H':
        print("H")
    else:
        print("D")
else:
    if a == 'H':
        print("D")
    else:
        print("H")
Buggy code:
a,b=input().split()
if a==b=="H" and a==b=="D":
  print("H")
else:
  print("D")

Fixed code:
a,b= input().split()
if a == b:
    print('H')
else:
    print('D')
Buggy code:
a, b = input().split()
print("H" if a == b else "D")aa

Fixed code:
a,b= input().split()
print('H' if a == b else 'D')
Buggy code:
print("HD"[len(set(input().split()))])

Fixed code:
print("$HD"[len(set(input().split()))])
Buggy code:
w, a, b = [int(i) for i in input().split()]
ans = b - (a+w)
print(ans if ans > 0 else 0)

Fixed code:
w, a, b = [int(i) for i in input().split()]
if a - b <= 0:
    ans = b - (a+w)
else:
    ans = a - (b+w)

print(ans if ans > 0 else 0)
Buggy code:
w,a,b=map(int,input().split())
if a+w<b:
    print(b-a-w)
else:
  if a<=b+w and a+w>=b:
    print(0)
else:
    print(a-b-w)

Fixed code:
w, a, b = map(int, input().split())

if b > a + w:
  print(b - (a + w))
elif b + w < a:
  print(a - (b + w))
else:
  print(0)
Buggy code:
w,a,b=map(int,input().split())
if abs(a-b)<=w:
    print(abs(a-b)-w)
else:
    print(0)
    

Fixed code:
w,a,b=map(int,input().split())
if a<b:
    print(b-a-w if b-a-w>0 else 0)
else:
    print(a-b-w if a-b-w>0 else 0)
Buggy code:
w,a,b=map(int,input().split())
if a<=b+w or b<=a+w:
    print(0)
else:
    print(abs(a+w-b))

Fixed code:
w,a,b=map(int,input().split())
print(0 if abs(a-b)<=w else(b-a-w if a+w<=b else a-b-w))
Buggy code:
W, a, b = map(int, input().split())

if a+W < b:
    print(a+W-b)
elif b+W < a:
    print(a-b-W)
else:
    print(0)

Fixed code:
w,a,b=map(int,input().split())
if a+w<b:
    print(b-(a+w))
elif b+w<a:
    print(a-(b+w))
else:
    print(0)
Buggy code:
w, a, b = map(int, input().split())

if w >= abs(a-b):
    print(0)
elif a > b:
    print(b+w-a)
elif b > a:
    print(a+w-b)

Fixed code:
w, a, b = map(int, input().split())

if w >= abs(a-b):
    print(0)
else:
    if a > b:
        print(a-(b+w))
    else:
        print(b-(a+w))
Buggy code:
w,a,b = map(int,input().split())

if b+w < a:
    print(a-b-w)
elif a<=b+w and a+w<=b:
    print(0)
else:
    print(b-a-w)

Fixed code:
w,a,b = map(int,input().split())

if b+w < a:
    print(a-b-w)
elif a<=b+w and a+w>=b:
    print(0)
else:
    print(b-a-w)
Buggy code:
W,a,b=map(int,input().split())

if a+W<b:
  print(b-(W+a)):
else:
  print(0)

Fixed code:
W, a, b = map(int,input().split())
if b > (a+W):
    print(b-(a+W))
elif (b+W) < a:
    print(a-(b+W))
else:
    print(0)
Buggy code:
W, a, b = map(int,input().split())
if b > a+W:
    print(b-(a+W))
elif b <= a+W and b+W >= a:
    print(0)
else:
    print(b+W-a)

Fixed code:
W, a, b = map(int,input().split())
if b > a+W:
    print(abs(b-(a+W)))
elif b <= a+W and b+W >= a:
    print(0)
else:
    print(abs(b+W-a))
Buggy code:
w,a,b=map(int,input().split())
if w+a >= b:
    print('0')

else:
    if b<=a:
        print(a-b)
    else:
        print(b-a-w)

Fixed code:
w, a, b = map(int, input().split())
if b > a + w:
    print(b - a - w)
elif b + w < a:
    print(a - b - w)
else:
    print(0)
Buggy code:
w,a,b=map(int,input().split())
if a >= b:
        print(a-b)
elif a+w>=b:
    print('0')
else:
    print(b-a-w)

Fixed code:
w,a,b=map(int,input().split())
if b-a-w>=0: print(b-a-w)
elif a-b-w>=0: print(a-b-w)
else: print(0)
Buggy code:
W, a, b = map(int, input().split())
tmp = b-a-W
if tmp <= 0:
  print(0)
else:
  print(tmp)

Fixed code:
W, a, b = map(int, input().split())
if abs(a - b) < W:
    print(0)
else:
    print(abs(a - b) - W)
Buggy code:
W, a, b = map(int, input().split())

if a+W <= b:
  tmp = b-a-W
  if tmp <= 0:
    print(0)
  else:
    print(tmp)
elif a > b+W:
  tmp = a-W-b
  if tmp <= 0:
    print(0)
  else:
    print(tmp)




Fixed code:
W, a, b = map(int,input().split())
if a+W <= b:
    print(b-(a+W))
elif b+W <= a:
    print(a-(b+W))
else:
    print(0)
Buggy code:
w,a,b = map(int,input().split())
c = b - a
if c - w >= 0:
    print(c - w)
else:
    print(0)

Fixed code:
w,a,b = map(int,input().split())
if b - a - w >= 0:
    print(b - a - w)
elif a - b - w>=0:
    print(a - b - w)
else:
    print(0)
Buggy code:
w, a, b = map(int, input().split())

if a + w < b:
  ans = b - (a + w)
elif a > b + w:
  ans = a - (b + w)
else:
  ans = 0

Fixed code:
w,a,b = map(int,input().split())
if b > a+w:
    print(b - (a+w))
elif b+w < a:
    print(a - (b+w))
else:
    print(0)
Buggy code:
w,a,b = map(int,input().split())
if abs(a-b) >= w:
    print(0)
else:
    print(abs(a-b)-w)

Fixed code:
w, a, b = map(int, input().split())

if a < b:
    print(b - a - w if b - a - w > 0 else 0)
else:
    print(a - b - w if a - b - w > 0 else 0)
Buggy code:
W, a, b = map(int, input().split())
if W + a >= b:
    print(0)
else:
    print(b-W-a)


Fixed code:
W, a, b = map(int, input().split())
if a < b:
    if W + a >= b:
        print(0)
    else:
        print(b-W-a)
else:
    if W + b >= a:
        print(0)
    else:
        print(a-W-b)
Buggy code:
w, a, b = map(int, input().split())
d = [b+w-a, b-w-a][a<b]
print([0,d][d>0])


Fixed code:
w, a, b = map(int, input().split())
d = [a-w-b, b-w-a][a<b]
print([0,d][d>0])
Buggy code:
w, a, b = map(int, input().split())
if a < b < a + w or a - w < b < a:
    print(0)
elif not a < b < a + w:
    print(b - a - w)
else:
    print(a - b - w)

Fixed code:
w, a, b = map(int, input().split())
if a <= b <= a + w or a - w <= b < a:
    print(0)
elif a + w < b:
    print(b - a - w)
else:
    print(a - b - w)
Buggy code:
w,a,b=map(int,input().split())
print(max(a,b)-(min(a,b)+w))

Fixed code:
w,a,b=map(int,input().split())
print(max(max(a,b)-(min(a,b)+w),0))
Buggy code:
n,a,b=map(int,input().split())
if b+w<a:print(a-b-w)
else:print(max(0,b-a-w))

Fixed code:
w,a,b=map(int,input().split())
if b+w<a:print(a-b-w)
else:print(max(0,b-a-w))