Problem:


Score : 100 points

Problem Statement

Takahashi has a strong stomach. He never gets a stomachache from eating something whose "best-by" date is at most X days earlier.
He gets a stomachache if the "best-by" date of the food is X+1 or more days earlier, though.

Other than that, he finds the food delicious if he eats it not later than the "best-by" date. Otherwise, he does not find it delicious.

Takahashi bought some food A days before the "best-by" date, and ate it B days after he bought it.

Write a program that outputs delicious if he found it delicious, safe if he did not found it delicious but did not get a stomachache either, and dangerous if he got a stomachache.

Constraints

1 ≤ X,A,B ≤ 10^9

Input

Input is given from Standard Input in the following format:

X A B

Output

Print delicious if Takahashi found the food delicious; print safe if he neither found it delicious nor got a stomachache; print dangerous if he got a stomachache.

Sample Input 1

4 3 6

Sample Output 1

safe

He ate the food three days after the "best-by" date. It was not delicious or harmful for him.

Sample Input 2

6 5 1

Sample Output 2

delicious

He ate the food by the "best-by" date. It was delicious for him.

Sample Input 3

3 7 12

Sample Output 3

dangerous

He ate the food five days after the "best-by" date. It was harmful for him.



Sample input:
4 3 6


Sample output:
safe

Submission status: Accepted

Solution code:
X, A, B = map(int, input().split())
print("delicious" if B <= A else "safe" if B <= (A + X) else "dangerous")

Submission status: Accepted

Solution code:
def main():
  num = list(map(int,input().split()))
  if num[2]<=num[1]:
    print('delicious')
  elif num[0] >= num[2]-num[1]:
    print('safe')
  else:
    print('dangerous')
      
main()

Submission status: Accepted

Solution code:
import sys

sys.setrecursionlimit(10 ** 7)
f_inf = float('inf')
mod = 10 ** 9 + 7


def resolve():
    x, a, b = map(int, input().split())
    late = a - b
    if late >= 0:
        print("delicious")
    else:
        if x + late >= 0:
            print("safe")
        else:
            print("dangerous")


if __name__ == '__main__':
    resolve()

Submission status: Accepted

Solution code:
x, a, b = map(int, input().split())

if a - b >= 0:
    print('delicious')
elif x + a - b >= 0:
    print('safe')
else:
    print('dangerous')

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import sys
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
input=lambda: sys.stdin.readline().rstrip()
YesNo=lambda b: bool([print('Yes')] if b else print('No'))
YESNO=lambda b: bool([print('YES')] if b else print('NO'))
int1=lambda x:int(x)-1

def main():
    x,a,b=map(int,input().split())
    if b<=a:
        print('delicious')
    elif b<=a+x:
        print('safe')
    else:
        print('dangerous')

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
X,A,B =map(int,input().split())
if A-B>=0:
    print('delicious')
elif A-B<0 and B-A <= X:
    print('safe')
else:
    print('dangerous')

Submission status: Accepted

Solution code:
X, A, B = map(int, input().split())
if A >= B:
    print('delicious')
elif A + X >= B:
    print('safe')
else:
    print('dangerous')

Submission status: Accepted

Solution code:
X, A, B = map(int, input().split())
d = B-A
if d <= 0:
    print("delicious")
elif d <= X:
    print("safe")
else:
    print("dangerous")

Submission status: Accepted

Solution code:
x,a,b = map(int, input().split())
if a >= b :
  print("delicious")
elif a+x >= b:
  print("safe")
else:
  print("dangerous")

Submission status: Accepted

Solution code:
x, a, b = map(int, input().split())
if (b-a) <= 0:
    print('delicious')
elif (b-a) <= x:
    print('safe')
else:
    print('dangerous')

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Thu May 14 12:58:06 2020

@author: shinba
"""

x,a,b = map(int,input().split())

if b <= a:
    print("delicious")
elif b-a <= x:
    print("safe")
else:
    print("dangerous")

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
X, A, B = map(int, input().split())

state = "safe"
if A >= B:
    state = "delicious"
elif A+X < B:
    state = "dangerous"
    
print(state)

Submission status: Accepted

Solution code:
X,A,B=map(int,input().split())
if (A>=B):
    print ("delicious")
elif (A+X>=B):
    print ("safe")
else:
    print ("dangerous")

Submission status: Accepted

Solution code:
import sys
import math
import bisect

def main():
    x, a, b = map(int, input().split())
    if -a + b <= 0:
        print('delicious')
    elif -a + b <= x:
        print('safe')
    else:
        print('dangerous')

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
x, a, b = map(int, input().split())
if a >= b:
    print('delicious')
elif b - a  >= x+1: 
    print('dangerous')
else:
    print('safe')

Submission status: Accepted

Solution code:
X, A, B = map(int, input().split())
expired = B - A
print("delicious" if expired <= 0 else "safe" if expired <= X else "dangerous")

Submission status: Accepted

Solution code:
X,A,B = map(int,input().split())	
if A-B>=0:
    print("delicious")
elif B-A<=X:
    print("safe")
elif B-A>X:
    print("dangerous")

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

#############
# Libraries #
#############

import sys
input = sys.stdin.readline

import math
from collections import deque
from fractions import gcd
from functools import lru_cache


#############
# Constants #
#############

MOD = 10**9+7
INF = float('inf')

#############
# Functions #
#############

######INPUT######
def inputI(): return int(input().strip())
def inputS(): return input().strip()
def inputIL(): return list(map(int,input().split()))
def inputSL(): return list(map(str,input().split()))
def inputILs(n): return list(int(input()) for _ in range(n))
def inputSLs(n): return list(input().strip() for _ in range(n))
def inputILL(n): return [list(map(int, input().split())) for _ in range(n)]
def inputSLL(n): return [list(map(str, input().split())) for _ in range(n)]

#####Inverse#####
def inv(n): return pow(n, MOD-2, MOD)

######Combination######
kaijo_memo = []
def kaijo(n):
  if(len(kaijo_memo) > n):
    return kaijo_memo[n]
  if(len(kaijo_memo) == 0):
    kaijo_memo.append(1)
  while(len(kaijo_memo) <= n):
    kaijo_memo.append(kaijo_memo[-1] * len(kaijo_memo) % MOD)
  return kaijo_memo[n]

gyaku_kaijo_memo = []
def gyaku_kaijo(n):
  if(len(gyaku_kaijo_memo) > n):
    return gyaku_kaijo_memo[n]
  if(len(gyaku_kaijo_memo) == 0):
    gyaku_kaijo_memo.append(1)
  while(len(gyaku_kaijo_memo) <= n):
    gyaku_kaijo_memo.append(gyaku_kaijo_memo[-1] * pow(len(gyaku_kaijo_memo),MOD-2,MOD) % MOD)
  return gyaku_kaijo_memo[n]

def nCr(n,r):
  if(n == r):
    return 1
  if(n < r or r < 0):
    return 0
  ret = 1
  ret = ret * kaijo(n) % MOD
  ret = ret * gyaku_kaijo(r) % MOD
  ret = ret * gyaku_kaijo(n-r) % MOD
  return ret

######Factorization######
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

#####LCM#####
def lcm(a, b):
    return a * b // gcd (a, b)

#############
# Main Code #
#############

X,A,B = inputIL()

if B<=A:
  print("delicious")
elif B<=A+X:
  print("safe")
else:
  print("dangerous")

Submission status: Accepted

Solution code:
x, a, b = map(int, input().split())
print("delicious" if b <= a else ("safe" if b <= (a + x) else "dangerous"))

Submission status: Accepted

Solution code:
x, a, b = map(int, input().split())
if a >= b:
    print("delicious")
elif b <= x + a:
    print("safe")
else:
    print("dangerous")

Submission status: Accepted

Solution code:
x,a,b=map(int,input().split())
if b-a<=0:
  print("delicious")
elif b-a<=x:
  print("safe")
else:
  print("dangerous")

Submission status: Accepted

Solution code:
x, a, b = map(int, input().split())

if a >= b:
    print("delicious")
elif a + x >= b:
    print("safe")
else:
    print("dangerous")

Submission status: Accepted

Solution code:
x, a, b = map(int, input().split())

if a - b >= 0:
    ans = "delicious"
elif a + x - b >= 0:
    ans = "safe"
else:
    ans ="dangerous"

print(ans)

Submission status: Accepted

Solution code:
def main():
    x, a, b = map(int, input().split())
    if b <= a:
        ans = 'delicious'
    else:
        if b <= (x+a):
            ans = 'safe'
        else:
            ans = 'dangerous'
    print(ans)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
X,A,B = map(int,input().split())

if A >= B:
    print('delicious')
elif X >= B-A:
    print('safe')
else:
    print('dangerous')

Submission status: Accepted

Solution code:
x, a, b = map(int, input().split())
ans = 'dangerous'
if b-a <= 0:
    ans = 'delicious'
elif (b-a) <= x:
    ans = 'safe'
print(ans)

Submission status: Accepted

Solution code:
X, A, B = map(int, input().split())

if - A + B <= 0:
    print('delicious')
elif - A + B <= X:
    print('safe')
else:
    print('dangerous')

Submission status: Accepted

Solution code:
x,a,b=map(int,input().split())
print("delicious"if a>=b else "safe" if b-a<=x else "dangerous")

Submission status: Accepted

Solution code:
x,a,b=map(int,input().split())


if a>=b:
  print('delicious')
elif b-a<=x:
  print('safe')
else :
  print('dangerous')

Submission status: Accepted

Solution code:
x,a,b=map(int,input().split())

if a-b >=0:
    print("delicious")
else:
    if a+x >= b:
        print("safe")
    else:
        print("dangerous")

Submission status: Accepted

Solution code:
X,A,B = map(int,input().split())

if B <= A:
    print("delicious")
elif (B-A) <= X:
    print("safe")
else:
    print("dangerous")

Submission status: Accepted

Solution code:
import sys

input = sys.stdin.readline


def main():
    X, A, B = map(int, input().split())

    if B <= A:
        ans = "delicious"
    elif B <= A + X:
        ans = "safe"
    else:
        ans = "dangerous"

    print(ans)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
X,A,B = map(int,input().split())
if A-B >= 0:
	  print("delicious")
elif X+A-B >= 0:
	  print("safe")
else:
    print("dangerous")

Submission status: Accepted

Solution code:
x, a, b = map(int, input().split())

expire = b - a
if expire <= 0:
    print('delicious')
elif expire <= x:
    print('safe')
else:
    print('dangerous')

Submission status: Accepted

Solution code:
# region header
import sys
import math
from bisect import bisect_left, bisect_right, insort_left, insort_right
from collections import defaultdict, deque, Counter
from copy import deepcopy
from fractions import gcd
from functools import lru_cache, reduce
from heapq import heappop, heappush
from itertools import accumulate, groupby, product, permutations, combinations, combinations_with_replacement
from math import ceil, floor, factorial, log, sqrt, sin, cos
from operator import itemgetter
from string import ascii_lowercase, ascii_uppercase, digits
sys.setrecursionlimit(10**7)
rs = lambda: sys.stdin.readline().rstrip()
ri = lambda: int(rs())
rf = lambda: float(rs())
rs_ = lambda: [_ for _ in rs().split()]
ri_ = lambda: [int(_) for _ in rs().split()]
rf_ = lambda: [float(_) for _ in rs().split()]
INF = float('inf')
MOD = 10 ** 9 + 7
# endregion
X, A, B = ri_()
print('delicious' if B - A <= 0 else 'safe' if B - A <= X else 'dangerous')

Submission status: Accepted

Solution code:
X,A,B=map(int,input().split())
if B<=A:
	print("delicious")
elif B-A>X:
	print("dangerous")
else:
	print("safe")

Submission status: Accepted

Solution code:
x,a,b = tuple(map(int,input().split()))
 
if a-b>=0 :
  print("delicious")
elif b-a<=x:
  print("safe")
else:
  print("dangerous")

Submission status: Accepted

Solution code:
X, A, B = map(int,input().split())
if B <= A:
    print("delicious")
elif B <= A+X:
    print("safe")
else:
    print("dangerous")

Submission status: Accepted

Solution code:
x, a, b = map(int, input().split())
if -a+b <= 0:
    print('delicious')
elif 0 < -a+b <= x:
    print('safe')
else:
    print('dangerous')

Submission status: Accepted

Solution code:
x,a,b = map(int,input().split())
A= 1
syoumikigen = A + a
B = A + b
safe = syoumikigen + x
out = safe + 1
if B <= syoumikigen:
    print("delicious")
elif syoumikigen < B <= safe:
    print("safe")
else:
    print("dangerous")

Submission status: Accepted

Solution code:
from statistics import median
#import collections
#aa = collections.Counter(a) # list to list || .most_common(2)で最大の2個とりだせるお a[0][0]
from fractions import gcd
from itertools import combinations # (string,3) 3回
from collections import deque
from collections import defaultdict
import bisect
#
#    d = m - k[i] - k[j]
#    if kk[bisect.bisect_right(kk,d) - 1] == d:
#
#
#
# pythonで無理なときは、pypyでやると正解するかも！！
#
#

import sys
sys.setrecursionlimit(10000000)
mod = 10**9 + 7

def readInts():
  return list(map(int,input().split()))

def main():
    x,a,b = readInts()
    # X+1だとだめです
    if b <= a:
        print('delicious')
    elif a < b <= a + x:
        print('safe')
    else:
        print('dangerous')

if __name__ == '__main__':
  main()

Submission status: Accepted

Solution code:
X, A, B = map(int, input().split())

if A - B >= 0:
    print('delicious')
elif A - B >= -X:
    print('safe')
else:
    print('dangerous')

Submission status: Accepted

Solution code:
X, A, B = map(int, input().split())

if B<=A:
    print('delicious')
elif B-A>=X+1:
    print('dangerous')
else:
    print('safe')

Submission status: Accepted

Solution code:
x,a,b=map(int,input().split())

if(b<=a):
    print('delicious')
elif(a<b and b<=a+x):
    print('safe')
else:
    print('dangerous')

Submission status: Accepted

Solution code:
x,a,b = map(int, input().split())
l = [x, -a, (b-a)]
if b-a <= 0: print("delicious")
elif b - a <= x and b-a > 0: print("safe")
else: print("dangerous")

Submission status: Accepted

Solution code:
X,A,B=map(int, input().split())

if A>=B:
    print("delicious")
elif B-A<=X:
    print("safe")
else:
    print("dangerous")

Submission status: Accepted

Solution code:
import sys
def input(): return sys.stdin.readline().strip()

def resolve():
    x,a,b=map(int, input().split())
    if (b-a)>=x+1:
        print('dangerous')
    elif (b-a)<=0:
        print('delicious')
    else:
        print('safe')
resolve()

Submission status: Accepted

Solution code:
from collections import deque
from heapq import heapify,heappop,heappush,heappushpop
from copy import copy,deepcopy
from itertools import product,permutations,combinations,combinations_with_replacement
from collections import defaultdict,Counter
from bisect import bisect_left,bisect_right
# from math import gcd,ceil,floor,factorial
# from fractions import gcd
from functools import reduce
from pprint import pprint

INF = float("inf")

def myinput():
    return map(int,input().split())

def mylistinput(n):
    return [ list(myinput()) for _ in range(n) ]

def mycol(data,col):
    return [ row[col] for row in data ]

def mysort(data,col,reverse_flag):
    data.sort(key=lambda x:x[col],reverse=reverse_flag)
    return data

def mymax(data):
    M = -1*float("inf")
    for i in range(len(data)):
        m = max(data[i])
        M = max(M,m)
    return M

def mymin(data):
    m = float("inf")
    for i in range(len(data)):
        M = min(data[i])
        m = min(m,M)
    return m

def mycount(ls,x):
    # lsはソート済みであること
    l = bisect_left(ls,x)
    r = bisect_right(ls,x)
    return (r-l)

def myoutput(ls,space=True):
    if space:
        if len(ls)==0:
            print(" ")
        elif type(ls[0])==str:
            print(" ".join(ls))
        elif type(ls[0])==int:
            print(" ".join(map(str,ls)))
        else:
            print("Output Error")
    else:
        if len(ls)==0:
            print("")
        elif type(ls[0])==str:
            print("".join(ls))
        elif type(ls[0])==int:
            print("".join(map(str,ls)))
        else:
            print("Output Error")

x,a,b = myinput()

if b<=a:
    print("delicious")
    exit()
elif b<=(a+x):
    print("safe")
    exit()
else:
    print("dangerous")
    exit()

Submission status: Accepted

Solution code:
x,a,b = map(int,input().split())
if a >= b:
    print("delicious")
elif a + x < b:
    print("dangerous")
else:
    print("safe")

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10 ** 5 + 10)
def input(): return sys.stdin.readline().strip()

def resolve():
    def main():
        x,a,b=map(int,input().split())
        if a>=b: return 'delicious'
        elif b-a<=x: return 'safe'
        else: return 'dangerous'
    print(main())

    
resolve()

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque
from collections import defaultdict
from itertools import combinations, permutations, accumulate, groupby, product
from bisect import bisect_left,bisect_right
from heapq import heapify, heappop, heappush
from math import floor, ceil
from operator import itemgetter
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def LI2(): return [int(input()) for i in range(n)]
def MXI(): return [[LI()]for i in range(n)]
def printns(x): print('\n'.join(x))
def printni(x): print('\n'.join(list(map(str,x))))
inf = 10**17
mod = 10**9 + 7
#s=input().rstrip()

x,a,b=MI()
if b-a<=0:
    print("delicious")
elif b-a<=x:
    print("safe")
else:
    print("dangerous")

Submission status: Accepted

Solution code:
x,a,b=map(int,input().split())
if b-a>x:print("dangerous")
elif b-a<=0:print("delicious")
else:print("safe")

Submission status: Accepted

Solution code:
def main():
    x, a, b = (int(i) for i in input().split())
    day = -a+b
    if day <= 0:
        print("delicious")
    elif day <= x:
        print("safe")
    else:
        print("dangerous")


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
X,A,B=map(int,input().split())
if B-A > X: print('dangerous')
else: print('delicious' if A>=B else 'safe')

Submission status: Accepted

Solution code:
X, A, B = map(int, input().split())
if B <= A:
    print("delicious")
elif B <= A + X:
    print("safe")
else:
    print("dangerous")

Submission status: Accepted

Solution code:
x,a,b = map(int,input().split())
dum = b-a
if dum >= x+1:
    print("dangerous")
elif dum > 0:
    print("safe")
else:
    print("delicious")

Submission status: Accepted

Solution code:
def ABC_65_A():
    X,A,B = map(int, input().split())
    
    if A >= B:
        print('delicious')
    elif A+X >= B:
        print('safe')
    else:
        print('dangerous')

if __name__ == '__main__':

    ABC_65_A()

Submission status: Accepted

Solution code:
X,A,B = list(map(int,input().split()))
if A >= B:
    print("delicious")
elif B-A <= X:
    print("safe")
else:
    print("dangerous")

Submission status: Accepted

Solution code:
X, A, B = list(map(int,input().split()))
if A >= B:
    print('delicious')
elif B-A<=X:
    print('safe')
else:
    print('dangerous')

Submission status: Accepted

Solution code:
X, A, B = map(int, input().split())

print('delicious' if A >= B else ('safe' if (A + X) >= B else 'dangerous'))

Submission status: Accepted

Solution code:
def main():
    x,a,b = (int(x) for x in input().split())
    if b <= a: print('delicious')
    elif b-a <= x: print('safe')
    else: print('dangerous')

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
x,a,b = map(int,input().split())
print("delicious" if a>=b else "safe" if b-a<=x else "dangerous")

Submission status: Accepted

Solution code:
X, A, B = list(map(int,input().split()))
print('delicious' if -A+B <= 0 else 'safe' if B-A <= X else 'dangerous')

Submission status: Accepted

Solution code:
x, a, b = map(int, input().split())
if -a+b<=0:print("delicious")
elif -a+b<=x:print("safe")
else:print("dangerous")

Submission status: Accepted

Solution code:
x, a, b = map(int, input().split())

if a >= b:
    print("delicious")
elif x+a >= b:
    print("safe")
else:
    print("dangerous")

Submission status: Accepted

Solution code:
x, a, b = list(map(int, input().split()))

if a - b >= 0:
    print("delicious")
elif x + 1 <= b - a:
    print("dangerous")
else:
    print("safe")

Submission status: Accepted

Solution code:
x, a, b = map(int, input().split())
if a >= b:
  print("delicious")
elif a < b <= a+x:
  print("safe")
else:
  print("dangerous")

Submission status: Accepted

Solution code:
x,a,b = map(int,input().split())
if b-a<=0:
    print('delicious')
elif 0<b-a<=x:
    print('safe')
else:
    print('dangerous')

Submission status: Accepted

Solution code:
x, a, b = map(int, input().split())
if b - a <= 0:
  print('delicious')
elif b - a <= x:
  print('safe')
else:
  print('dangerous')

Submission status: Accepted

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, log2
from itertools import accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7
 
X, A, B = MAP()

if B <= A:
	print("delicious")
elif B <= A+X:
	print("safe")
else:
	print("dangerous")

Submission status: Accepted

Solution code:
x,a,b=map(int,input().split())
if a>=b:
    print('delicious')
elif x>=b-a:
    print('safe')
else:
    print('dangerous')

Submission status: Accepted

Solution code:
x, a, b = map(int, input().split())
if abs(a-b) > x:
    print('dangerous')
elif a-b >= 0:
    print('delicious')
else:
    print('safe')

Submission status: Accepted

Solution code:
x,a,b=map(int,input().split())
print("delicious" if a>=b else "safe" if x>= b-a else "dangerous")

Submission status: Accepted

Solution code:
x,a,b = map(int,input().split())
if a>=b:
    print('delicious')
elif b>(a+x):
    print('dangerous')
else:
    print('safe')

Submission status: Accepted

Solution code:

def main():
    t = list(map(int, input().split()))
    ans = ''
    if t[1] >= t[2]:
        ans = 'delicious'
    elif t[0] >= t[2] - t[1]:
        ans = 'safe'
    if t[0] < t[2] - t[1]:
        ans = 'dangerous'
    print(ans)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
x, a, b = map(int, input().split())
if a - b >= 0:
    print('delicious')
elif a+x-b >= 0:
    print('safe')
else:
    print('dangerous')

Submission status: Accepted

Solution code:
import sys
import itertools
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop
import math
import collections


x,a,b = map(int,input().split())
if a >= b:
    print("delicious")
elif x + a >= b:
    print("safe")
else:
    print("dangerous")

Submission status: Accepted

Solution code:
x,a,b=map(int,input().split())
if a>=b:
    print("delicious")
elif x+a>=b:
    print("safe")
else:
    print("dangerous")

Submission status: Accepted

Solution code:
x,a,b = map(int, input().split())
if a >= b:
  print('delicious')
elif a + x >= b:
  print('safe')
else:
  print('dangerous')

Submission status: Accepted

Solution code:
X,A,B=map(int,input().split())
if B<=A:
  print("delicious")
elif B-A<=X:
  print("safe")
else:
  print("dangerous")

Submission status: Accepted

Solution code:
x,a,b=map(int,input().split())
if b-a<=x:
    if b-a<=0:
        print('delicious')
    else:
        print('safe')
else:
    print('dangerous')

Submission status: Accepted

Solution code:
#!/usr/bin/env python3

X, A, B = map(int, input().split())

if B <= A:
    print("delicious")
elif B - A <= X:
    print("safe")
else:
    print("dangerous")

Submission status: Accepted

Solution code:
x,a,b=map(int, input().split())
ans = 0 - a
ans += b
if ans > x:
    print('dangerous')
elif ans <= 0:
    print('delicious')
else:
    print('safe')

Submission status: Accepted

Solution code:
x, a, b = map(int, input().split())

syomikigengo = b - a

if syomikigengo > x:
    print("dangerous")
elif syomikigengo > 0:
    print("safe")
else:
    print("delicious")

Submission status: Accepted

Solution code:
X, A, B = map(int, input().split())

if A >= B:
    print('delicious')
elif A + X >= B:
    print('safe')
else:
    print('dangerous')

Submission status: Accepted

Solution code:
x,a,b=map(int,input().split())
if a>=b:
    print("delicious")
elif a+x>=b:
    print("safe")
else:
    print("dangerous")

Submission status: Accepted

Solution code:
x,a,b=map(int,input().split())
if a>=b:
  print("delicious")
elif x+a>=b:
  print("safe")
else:
  print("dangerous")

Submission status: Accepted

Solution code:
x, a, b = map(int, input().split())
c = -a + b
if c <= 0:
    print("delicious")
elif c <= x:
    print("safe")
else:
    print("dangerous")

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
if b>=c:
  print('delicious')
elif a>=c-b:
  print('safe')
else:
  print('dangerous')

Submission status: Accepted

Solution code:
X, A, B = map(int, input().split())

if A >= B:
  print('delicious')
elif B <= A + X:
  print('safe')
else:
  print('dangerous')

Submission status: Accepted

Solution code:
x,a,b=map(int,input().split())
if a>=b:
  print('delicious')
elif a<b and a+x>=b:
  print('safe')
else:
  print('dangerous')

Submission status: Accepted

Solution code:
x, a, b = map(int, input().split())
if b <= a:
  print("delicious")
elif b <= a+x:
  print("safe")
else:
  print("dangerous")

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
if b-c>=0:
    print("delicious")
elif a+b-c>=0:
    print("safe")
else:
    print("dangerous")

Submission status: Accepted

Solution code:
x,a,b = map(int, input().split())
print('delicious' if b <= a else 'safe' if a<b<=a+x else 'dangerous')

Submission status: Accepted

Solution code:
x,a,b=map(int,input().split())
if b<=a:
  print('delicious')
elif b<=a+x:
  print('safe')
else:
  print('dangerous')

Submission status: Accepted

Solution code:
X,A,B=(int(n) for n in input().split())
if A>=B:
    print("delicious")
elif (A<B) and (B-A<=X):
    print("safe")
else:
    print("dangerous")

Submission status: Accepted

Solution code:
X,A,B = map(int, input().split())

if A >= B:
    print("delicious")
elif B-A <= X:
    print("safe")
else:
    print("dangerous")

Submission status: Accepted

Solution code:
x, a, b = map(int, input().split())

if (-a + b) <= 0:
    print('delicious')
elif 0 < (-a + b) <= x:
    print('safe')
else:
    print('dangerous')

Submission status: Accepted

Solution code:
x,a,b=map(int,input().split())
if a>=b:
  print("delicious")
elif b-a<=x:
  print("safe")
else:
  print("dangerous")

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque
from collections import defaultdict
from itertools import combinations, permutations, accumulate, groupby, product
from bisect import bisect_left,bisect_right
from heapq import heapify, heappop, heappush
from math import floor, ceil
from operator import itemgetter
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def LI2(): return [int(input()) for i in range(n)]
def MXI(): return [[LI()]for i in range(n)]
inf = 10**17
mod = 10**9 + 7

x,a,b=MI()
if b<=a:
    print("delicious")
elif b-a<=x:
    print("safe")
else:
    print("dangerous")

Submission status: Accepted

Solution code:
x,a,b=map(int,input().split())
print("delicious" if a-b>=0 else "safe" if b-a<=x else "dangerous")

Submission status: Accepted

Solution code:
x,a,b = map(int, input().split())
if b-a <= 0:
  print("delicious")
elif b-a <= x:
  print("safe")
else:
  print("dangerous")

Submission status: Accepted

Solution code:
def resolve():
	x, a, b = map(int, input().split())
	if b - a > x:
		print('dangerous')
	elif a >= b:
		print('delicious')
	else:
		print('safe')
resolve()

Submission status: Accepted

Solution code:
x, a, b = map(int, input().split())
if a >= b:
    print('delicious')
elif b - a <= x:
    print('safe')
else:
    print('dangerous')

Submission status: Accepted

Solution code:
x,a,b=map(int, input().split())
if a >= b:
  print('delicious')
elif b-a <=x:
  print('safe')
else:
  print('dangerous')

Submission status: Accepted

Solution code:
X,A,B = map (int,input().split())
if B <= A:
  print("delicious")
elif B <= A+X:
  print("safe")
else:
  print("dangerous")

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
if b-c>=0:
    print("delicious")
elif c-b<=a:
    print("safe")
else:
    print("dangerous")

Submission status: Accepted

Solution code:
x,a,b=map(int,input().split())
if b<=a:
    print("delicious")
elif (x+a)>=b:
    print("safe")
else:
    print("dangerous")

Submission status: Accepted

Solution code:

def resolve():
    X, A, B = list(map(int, input().split()))
    if B <= A:
        print("delicious")
    elif B <= A+X:
        print("safe")
    else:
        print("dangerous")


if '__main__' == __name__:
    resolve()

Submission status: Accepted

Solution code:
X, A, B = map(int, input().split())

if B - A <= 0:
  print('delicious')
elif B - A <= X:
  print('safe')
else:
  print('dangerous')

Submission status: Accepted

Solution code:
# =map(int,input().split())
x,a,b=map(int,input().split())
if a<b<=a+x:
    print('safe')
elif b<=a:
    print('delicious')
else:
    print('dangerous')

Submission status: Accepted

Solution code:
x,a,b=map(int,input().split())
if b-a>x : print("dangerous") ; exit()
elif 0<b-a<=x : print("safe") ; exit()
else:
  print("delicious")

Submission status: Accepted

Solution code:
x,a,b= list(map(int, input().split()))
if a>=b:
    print('delicious')
else:
    n=b-a
    if n<=x:
        print('safe')
    else:
        print('dangerous')

Submission status: Accepted

Solution code:
x, a, b = map(int,input().split())
if b-a <= x and b-a <= 0:
  print('delicious')
elif b-a <= x:
  print('safe')
else:
  print('dangerous')

Submission status: Accepted

Solution code:
x,a,b = map(int, input().split())

if a-b>=0:
    print('delicious')
    quit()
elif a+x-b>=0:
    print('safe')
    quit()
else:
    print('dangerous')

Submission status: Accepted

Solution code:
x, a, b = map(int, input().split())
if b<=a:
    print("delicious")
elif b <= a+ x:
    print("safe")
else:
    print("dangerous")

Submission status: Accepted

Solution code:
X,A,B=list(map(int, input().split()))
if A>=B:
    print('delicious')
elif X+A>=B:
    print('safe')
else:
    print('dangerous')

Submission status: Accepted

Solution code:
x,a,b = map(int, input().split())
if b > a+x:
  print('dangerous')
elif b > a:
  print('safe')
else:
  print('delicious')

Submission status: Accepted

Solution code:
x, a, b = map(int, input().split())
e = b - a
if e <= 0:
    print('delicious')
elif e <= x:
    print('safe')
else:
    print('dangerous')

Submission status: Accepted

Solution code:
x,a,b=[int(i) for i in input().split()]
if a>=b:
  print('delicious')
elif a+x<b:
  print('dangerous')
else:
  print('safe')