[백준] 16431번 : 베시와 데이지 - Python(파이썬)

https://www.acmicpc.net/problem/16431

br,bc=map(int,input().split())
dr,dc=map(int,input().split())
lr,lc=map(int,input().split())
m=min(abs(lr-br),abs(lc-bc))
sum=abs(lr-br)+abs(lc-bc)-m
sum1=abs(lr-dr)+abs(lc-dc)
if sum>sum1: print("daisy")
elif sum<sum1: print("bessie")
else: print("tie")