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:
from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_cache
import sys
sys.setrecursionlimit(10000)
INF = float("inf")
YES, Yes, yes, NO, No, no = "YES", "Yes", "yes", "NO", "No", "no"
dy4, dx4 = [0, 1, 0, -1], [1, 0, -1, 0]
dy8, dx8 = [0, -1, 0, 1, 1, -1, -1, 1], [1, 0, -1, 0, 1, 1, -1, -1]


def inside(y, x, H, W):
    return 0 <= y < H and 0 <= x < W


def ceil(a, b):
    return (a + b - 1) // b


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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x,a,b = (int(_) for _ in input().split())

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

Submission status: Accepted

Solution code:
import sys
import math
import collections
import itertools
import array
import inspect

# Set max recursion limit
sys.setrecursionlimit(1000000)


# Debug output
def chkprint(*args):
    names = {
        id(v): k
        for k, v in inspect.currentframe().f_back.f_locals.items()
    }
    print(', '.join(
        names.get(id(arg), '???') + ' = ' + repr(arg) for arg in args))


# Binary converter
def to_bin(x):
    return bin(x)[2:]


def li_input():
    return [int(_) for _ in input().split()]


def gcd(n, m):
    if n % m == 0:
        return m
    else:
        return gcd(m, n % m)


def gcd_list(L):
    v = L[0]

    for i in range(1, len(L)):
        v = gcd(v, L[i])

    return v


def lcm(n, m):
    return (n * m) // gcd(n, m)


def lcm_list(L):
    v = L[0]

    for i in range(1, len(L)):
        v = lcm(v, L[i])

    return v


# Width First Search (+ Distance)
def wfs_d(D, N, K):
    """
    D: 隣接行列(距離付き)
    N: ノード数
    K: 始点ノード
    """

    dfk = [-1] * (N + 1)
    dfk[K] = 0

    cps = [(K, 0)]
    r = [False] * (N + 1)
    r[K] = True
    while len(cps) != 0:
        n_cps = []
        for cp, cd in cps:
            for i, dfcp in enumerate(D[cp]):
                if dfcp != -1 and not r[i]:
                    dfk[i] = cd + dfcp
                    n_cps.append((i, cd + dfcp))
                    r[i] = True

        cps = n_cps[:]

    return dfk


# Depth First Search (+Distance)
def dfs_d(v, pre, dist):
    """
    v:  現在のノード
    pre: １つ前のノード
    dist: 現在の距離

    以下は別途用意する
    D: 隣接リスト(行列ではない)
    D_dfs_d: dfs_d関数で用いる，始点ノードから見た距離リスト
    """

    global D
    global D_dfs_d

    D_dfs_d[v] = dist

    for next_v, d in D[v]:
        if next_v != pre:
            dfs_d(next_v, v, dist + d)

    return


def sigma(N):
    ans = 0
    for i in range(1, N + 1):
        ans += i
    return ans


class Combination:
    def __init__(self, n, mod):

        g1 = [1, 1]
        g2 = [1, 1]
        inverse = [0, 1]
        for i in range(2, n + 1):
            g1.append((g1[-1] * i) % mod)
            inverse.append((-inverse[mod % i] * (mod // i)) % mod)
            g2.append((g2[-1] * inverse[-1]) % mod)
        self.MOD = mod
        self.N = n
        self.g1 = g1
        self.g2 = g2
        self.inverse = inverse

    def __call__(self, n, r):
        if (r < 0 or r > n):
            return 0
        r = min(r, n - r)
        return self.g1[n] * self.g2[r] * self.g2[n - r] % self.MOD


# --------------------------------------------

dp = None


def main():
    x, a, b = li_input()

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


main()

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#65a
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 = 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())
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:
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-*-

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

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import defaultdict
import sys,heapq,bisect,math,itertools,string
sys.setrecursionlimit(10**8)
INF = float('inf')
mod = 10**9+7
AtoZ = [chr(i) for i in range(65,65+26)]
atoz = [chr(i) for i in range(97,97+26)]

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

Submission status: Accepted

Solution code:
sell,before,eat = map(int,input().split())

if before >= eat:
    print("delicious")
elif before + sell >= eat:
    print("safe")

else:
    print("dangerous")

Submission status: Accepted

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

print(ans)

Submission status: Accepted

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

# 賞味期限前に食べた
if B - A <= 0:
    re = 'delicious'
elif B - A <= X:
    re = 'safe'
else:
    re = 'dangerous'

print(re)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#coding:utf-8
n=[int(i) for i in input().split()]
if(n[1]>=n[2]):
  print("delicious")
elif(n[2]<=n[1]+n[0]):
  print("safe")
else:
  print("dangerous")

Submission status: Accepted

Solution code:
x, a, b = (int(y) for y in raw_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 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")
elif b-a > x:
    print("dangerous")

Submission status: Accepted

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

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())
if a>=b:
  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())

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

Submission status: Accepted

Solution code:
# input
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().split()))


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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x,a,b=map(int,raw_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 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 x < 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 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());print(["dangerous","safe","delicious"][bool(X >= B - A)+bool(B <= A)])

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys

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

if b - a <= 0:
  print("delicious")
  sys.exit()

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

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().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')
elif b-a>x:print('dangerous')
else: print('safe')

Submission status: Accepted

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

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())
ans = ['safe', 'delicious', 'dangerous']
print(ans[b<=a or -(b>a+x)])

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:
# -*- coding: utf-8 -*-

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

if x < (b-a):
    print("dangerous")
elif b<a or 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 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())
a = -a

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

Submission status: Accepted

Solution code:
x, a, b = map(int, input().split())
print(["delicious", "safe", "dangerous"][sorted([a, a+x, b]).index(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:
inx,ina,inb = map(int,input().split())
if ina >= inb:
  print("delicious")
elif ina+inx >= inb:
  print("safe")
else:
  print("dangerous")

Submission status: Accepted

Solution code:
N = list(map(int,input().split()))

if N[2]<=N[1]:
    print("delicious")
elif N[2]>N[0]+N[1]:
    print("dangerous")
else:
    print("safe")

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

Submission status: Accepted

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

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

Submission status: Accepted

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

s = A-B

if s >= 0:
    print("delicious")
elif s < 0:
    if abs(s) <= X:
        print("safe")
    else:
        print("dangerous")

Submission status: Accepted

Solution code:
import math
import sys

def getinputdata():

    # 配列初期化
    array_result = []
    
    data = input()

    
    array_result.append(data.split(" "))

    flg = 1

    try:


        while flg:

            data = input()

            array_temp = []

            if(data != ""):
                
                array_result.append(data.split(" "))

                flg = 1

            else:

                flg = 0
    finally:


        return array_result





arr_data = getinputdata()

#kigen
x = int(arr_data[0][0])

#buy
a = int(arr_data[0][1])

#eat
b = int(arr_data[0][2])


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

Submission status: Accepted

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

L = 0 - A + B
if L <= 0:
    print('delicious')
elif L <= 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:
# -*- coding: utf-8 -*-

# AtCoder Beginner Contest
# Problem A

if __name__ == '__main__':
    x, a, b = list(map(int, input().split()))

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
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,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")
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 a-b+x>=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 = (int(i) for i in input().split())
print('delicious' if a-b>=0 else 'safe' if x >= b-a else 'dangerous')

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
X,A,B = [int(i) for i in input().split()]
if B-A<=0:
  print('delicious')
elif 0<B-A<=X:
  print('safe')
else:
  print('dangerous')

Submission status: Accepted

Solution code:
k = map(int, raw_input().split())
if (k[2] < k[0]):
    print "delicious"
    exit()
if (k[2]-k[1] <= k[0]):
    print "safe"
else:
    print "dangerous"

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:

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

    if(eat_day <= 0):
        print("delicious")
    elif(eat_day <= X):
        print("safe")
    elif(eat_day > X):
        print("dangerous")

if __name__ == '__main__':
    main()

Submission status: Accepted

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

d=c-b
if d<=0:
    print('delicious')    
elif a<d:
    print('dangerous')
elif a>=d:
    print('safe')

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = list(map(int,input().split()))
m = n[2] - n[1]
if n[2] <= n[1]:
  print("delicious")
elif m <= n[0]:
  print("safe")
else:
  print("dangerous")

Submission status: Accepted

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


solve()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
list = [int(i) for i in input().split()]

if list[1] >= list[2]:
    print("delicious")
elif list[1]+list[0] >= list[2]:
    print("safe")
else:
    print("dangerous")

Submission status: Accepted

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

X, A, B = map(int, raw_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 = list(map(int, input().split()))
C = B - A

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

Submission status: Accepted

Solution code:
# A
x, a, b = map(int, raw_input().split())
if b <= a:
    print 'delicious'
    exit()
if b <= a + x:
    print 'safe'
if b > a + x:
    print 'dangerous'

Submission status: Accepted

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

Submission status: Accepted

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