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:
a,b,c=map(int,input().split())
if b>=c:
  print("delicious")
elif a+b >=c:
  print("safe")
else:
  print("dangerous")

Submission status: Accepted

Solution code:
x,a,b = map(int, input().split())
if b-a < 1:
    print("delicious")
elif b-a < x + 1:
    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 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<=0:
    ans="delicious"
elif b-a<=x:
    ans="safe"
else:ans="dangerous"
print(ans)

Submission status: Accepted

Solution code:
x,a,b = map(int,input().split())
print('delicious'if a >= b else'safe'if -a+b<= x else'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 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 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 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 + 1 <= B - A:
    print("dangerous")
else:
    print("safe")

Submission status: Accepted

Solution code:
X,A,B=map(int,input().split())
if A-B>=0:
    print("delicious")
elif X>=B-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 = (int(i) for i in input().split())
if a < b:
  if b-a > x:
    print ('dangerous')
  else:
    print ('safe')
else:
  print ('delicious')

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 = list(map(int, input().split(' ')))
if B - A > X:
    print('dangerous')
elif B - A > 0:
    print('safe')
else:
    print('delicious')

Submission status: Accepted

Solution code:
x,a,b=[int(i) for i in 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<=0:
    print("delicious")
    exit()
elif b-a<=x:
    print("safe")
else:
    print("dangerous")

Submission status: Accepted

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

x,a,b = list(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:
a, b, c = list(map(int, input().split()))

if (c<=b):
    print("delicious")
elif (c>b):
    if (c-b)<=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 b <= a:
    print('delicious')
elif b-a <= x:
    print('safe')
else:
    print('dangerous')

Submission status: Accepted

Solution code:
import sys
import math
import itertools
import collections
import heapq
import re
import numpy as np

rr = lambda: sys.stdin.readline().rstrip()
rs = lambda: sys.stdin.readline().split()
ri = lambda: int(sys.stdin.readline())
rm = lambda: map(int, sys.stdin.readline().split())
rl = lambda: list(map(int, sys.stdin.readline().split()))
inf = float('inf')
mod = 10**9 + 7

a, b, c = rm()
if b >= c:
  print('delicious')
elif c-b > a:
  print('dangerous')
else:
  print('safe')

Submission status: Accepted

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

Submission status: Accepted

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

over = B - A

if over <= 0:
    print('delicious')
elif over <= 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:
  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 "dangerous" if b>x+a else "safe")

Submission status: Accepted

Solution code:
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
def s(): return input()
def i(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 9)
INF = 10**9
mod = 10**9+7

X,A,B = I()
if X >= 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 >= 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 x+a >= b:
  print('safe')
else:
  print('dangerous')

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
x, a, b = (int(i) for i in 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:
  print('delicious')
elif b -a <= x:
  print('safe')
else:
  print('dangerous')

Submission status: Accepted

Solution code:
input = input()
s_input = input.split()
x = int(s_input[0])
a = int(s_input[1])
b = int(s_input[2])

kigenchouka = b - a

if kigenchouka > x:
    print("dangerous")
else:
    if kigenchouka <= 0:
        print("delicious")
    else:
        print("safe")

Submission status: Accepted

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

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")
elif x < b-a:
    print("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 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:
  print("delicious")
elif B<=X+A:
  print("safe")
else:
  print("dangerous")

Submission status: Accepted

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

if a-b>=0:
  print('delicious')
elif a-b<0 and x +(a-b)>=0:
  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())
 
print('delicious'if b<=a else 'safe' if a<b and b-a<=x else 'dangerous')

Submission status: Accepted

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

Submission status: Accepted

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

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:
import sys
X,A,B = map(int,input().split())
if X < 0 or A < 0 or B < 0 or X > 10 ** 9 or A > 10 ** 9 or B > 10 ** 9:
    sys.exit()

if B - A < X + 1 and B - X > 0:
    print("safe")
if B - A < X + 1 and B - X < 0:
    print("delicious")
if B - A >= X + 1:
    print("dangerous")

Submission status: Accepted

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

a = A * (-1)

if (a+B < X+1) and (A < B):
    print("safe")

elif (A >= B):
    print("delicious")

elif (a+B >= X+1):
    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:
from fractions import gcd
from collections import Counter, deque, defaultdict
from heapq import heappush, heappop, heappushpop, heapify, heapreplace, merge
from bisect import bisect_left, bisect_right, bisect, insort_left, insort_right, insort
from itertools import accumulate, product, permutations, combinations

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

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

# x日まで過ぎてもOK
# a日前に買ってくる
# b日後に食べた

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

Submission status: Accepted

Solution code:
def actual(X, A, B):
    is_unexpired = (A - B)

    if is_unexpired >= 0:
        return 'delicious'

    elapsed_after_expiration_day = (B - A)
    if elapsed_after_expiration_day <= X:
        return 'safe'

    return 'dangerous'

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print('delicious'if B <= A else 'safe' if A<B and 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 = 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:
    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 <= 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 b <= a:
  print('delicious')
elif a < b <= a+x:
  print('safe')
else:
  print('dangerous')

Submission status: Accepted

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

if A >= B:
    print("delicious")
elif eat >= 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 (b<=(a+x)):
    print("safe")
else:
    print("dangerous")

Submission status: Accepted

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

    ans = str()
    if a >= b:
        ans = "delicious"
    elif a+x >= b:
        ans = "safe"
    elif a+x < b:
        ans = "dangerous"
    print(ans)
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:
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 X<B-A:
  print("dangerous")
elif B-A<=0:
  print("delicious")
else:
  print("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())
if X<B-A:
  print("dangerous")
elif B-A<=0:
  print("delicious")
else:
  print("safe")

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())
L = A + X
if A >= B:
  print("delicious")
elif B <= L:
  print("safe")
else:
  print("dangerous")

Submission status: Accepted

Solution code:
X, A, B = map(int,input().split())
L = A + X
if A >= B:
  print("delicious")
elif B <= L:
  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:
  print('delicious')
elif b <= a + x:
  print('safe')
else:
  print('dangerous')

Submission status: Accepted

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

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 >= 0:
    print('delicious')
elif a-b+x >= 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:
x,a,b = list(map(int,input().strip().split()))

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

Submission status: Accepted

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

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

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 and b >= 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(X >= (B-A)):
    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 + 1 > 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 < 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")
else:
  if(b-a >x):
    print("dangerous")
  else:
    print("safe")

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 X-B+A < 0:
    print('dangerous')
elif B <= A:
    print('delicious')
else:
    print('safe')

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:
def main():
    z = 0
    x,a,b = map(int,input().split())
    if a >= b:
        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 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 (A-B)<0 and (X-B+A)>=0:
  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 b-a>x:
    print('dangerous')
elif b-a<=0:
    print('delicious')
else:
    print('safe')

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

if a - b >= 0:
    print('delicious')
elif a + x - b >= 0:
    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 b <= a:
    print('delicious')
elif b-a <= x:
    print('safe') 
else:
    print('dangerous')

Submission status: Accepted

Solution code:
level = 0
x, a, b = map(int, input().split())
level -= a
level += b
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<=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())
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())
t=a-b
if t>=0:
    print('delicious')
else:
    if abs(t)<=x:
        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 -A+B <= X:
  print("safe")
else:
  print("dangerous")

Submission status: Accepted

Solution code:
def resolve():
    X, A, B = map(int, input().split())
    print("delicious" if A>=B else "dangerous" if A+X<B else "safe")
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:
x,a,b=map(int,input().split())
if b-a<=0 and b-a<x:
	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<=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<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 x-(b-a)>=0:
    print("safe")
else:
    print("dangerous")

Submission status: Accepted

Solution code:
x,a,b=map(int,input().split())
if (b-a)<=0:
    print("delicious")
else:
    if (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 X >= (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 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>0 and X>=B-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:
import sys
import math
 
sys.setrecursionlimit(10 ** 8)
input = sys.stdin.readline
 
def main():
  x,a,b = map(int, input().split())
  
  if b-a <= 0:
    print("delicious")
  elif b-a >0 and b-a <= x:
    print("safe")
  else:
    print("dangerous")
    
if __name__ == '__main__':
    main()

Submission status: Accepted

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

if Expired<=0:
    print('delicious')
elif 0<Expired<=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 x+a<b:
  print('dangerous')
elif a+x>=b and a<b:
  print('safe')
else:
  print('delicious')

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 >= 0:
    print("delicious") 
    exit()
if 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:
n = list(map(int, input().split()))
if n[1] - n[2] >= 0:
  print('delicious')
elif n[2] - n[1] <= n[0]:
  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 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 + x >= b and 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:
x,a,b=map(int,input().split())
j=b-a
if j<=0:
    print('delicious')
elif j<=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:
  print("delicious")
else:
  if B-A <= X:
    print("safe")
  else:
    print("dangerous")

Submission status: Accepted

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

import sys
# import time
# import math
# import numpy as np
# import scipy.sparse.csgraph as cs            # csgraph_from_dense(ndarray, null_value=inf), bellman_ford(G, return_predecessors=True), dijkstra, floyd_warshall
# import random                                # random, uniform, randint, randrange, shuffle, sample
# import string                                # ascii_lowercase, ascii_uppercase, ascii_letters, digits, hexdigits
# import re                                    # re.compile(pattern) => ptn obj; p.search(s), p.match(s), p.finditer(s) => match obj; p.sub(after, s)
# from bisect import bisect_left, bisect_right # bisect_left(a, x, lo=0, hi=len(a)) returns i such that all(val<x for val in a[lo:i]) and all(val>-=x for val in a[i:hi]).
# from collections import deque                # deque class. deque(L): dq.append(x), dq.appendleft(x), dq.pop(), dq.popleft(), dq.rotate()
# from collections import defaultdict          # subclass of dict. defaultdict(facroty)
# from collections import Counter              # subclass of dict. Counter(iter): c.elements(), c.most_common(n), c.subtract(iter)
# from datetime import date, datetime          # date.today(), date(year,month,day) => date obj; datetime.now(), datetime(year,month,day,hour,second,microsecond) => datetime obj; subtraction => timedelta obj
# from datetime.datetime import strptime       # strptime('2019/01/01 10:05:20', '%Y/%m/%d/ %H:%M:%S') returns datetime obj
# from datetime import timedelta               # td.days, td.seconds, td.microseconds, td.total_seconds(). abs function is also available.
# from copy import copy, deepcopy              # use deepcopy to copy multi-dimentional matrix without reference
# from functools import reduce                 # reduce(f, iter[, init])
# from functools import lru_cache              # @lrucache ...arguments of functions should be able to be keys of dict (e.g. list is not allowed)
# from heapq import heapify, heappush, heappop # built-in list. heapify(L) changes list in-place to min-heap in O(n), heappush(heapL, x) and heappop(heapL) in O(lgn).
# from heapq import nlargest, nsmallest        # nlargest(n, iter[, key]) returns k-largest-list in O(n+klgn).
# from itertools import count, cycle, repeat   # count(start[,step]), cycle(iter), repeat(elm[,n])
# from itertools import groupby                # [(k, list(g)) for k, g in groupby('000112')] returns [('0',['0','0','0']), ('1',['1','1']), ('2',['2'])]
# from itertools import starmap                # starmap(pow, [[2,5], [3,2]]) returns [32, 9]
# from itertools import product, permutations  # product(iter, repeat=n), permutations(iter[,r])
# from itertools import combinations, combinations_with_replacement
# from itertools import accumulate             # accumulate(iter[, f])
# from operator import itemgetter              # itemgetter(1), itemgetter('key')
# from fractions import gcd                    # for Python 3.4 (previous contest @AtCoder)



def main():
    mod = 1000000007                # 10^9+7
    inf = float('inf')              # sys.float_info.max = 1.79...e+308
    # inf = 2 ** 64 - 1             # (for fast JIT compile in PyPy) 1.84...e+19
    sys.setrecursionlimit(10**6)    # 1000 -> 1000000
    def input(): return sys.stdin.readline().rstrip()
    def ii():    return int(input())
    def mi():    return map(int, input().split())
    def mi_0():  return map(lambda x: int(x)-1, input().split())
    def lmi():   return list(map(int, input().split()))
    def lmi_0(): return list(map(lambda x: int(x)-1, input().split()))
    def li():    return list(input())
    
    
    x, a, b = mi()
    if b <= a:
        print('delicious')
    elif b <= a + x:
        print('safe')
    else:
        print('dangerous')


if __name__ == "__main__":
    main()

Submission status: Accepted

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

x, a, b = map(int, readline().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 >= 0:
    print('delicious')
elif b - a <= x:
    print('safe')
else:
    print('dangerous')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x, a, b = list(map(int, input().split()))
if b <= a:
    print('delicious')
elif a < b <= x + a:
    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:
import sys
x,a,b = map(int,input().split())

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