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

Submission status: Accepted

Solution code:
import math
import queue
import bisect
import heapq
import time
import itertools

mod = int(1e9+7)

def swap(a,b):
    return (b,a)

def gcd(a,b): #最大公約数
    if (a<b):
        a,b = swap(a,b)
    if (b==0):
        return a
    else:
        return gcd(b,a%b)

def lcm(a,b): #最小公倍数
    return a/gcd(a,b)*b

def divisors(a): # 約数列挙
    divisors = []
    for i in range(1,int(a**0.5)+1):
        if a%i==0:
            divisors.append(i)
            if i!=a//i:
                divisors.append(a//i)
    return divisors

def is_prime(a): #素数判定
    if a<2:
        return False
    elif a==2:
        return True
    elif a%2==0:
        return False
    sqrt_num = int(a**0.5)
    for i in range(3,sqrt_num+1,2):
        if a%i==0:
            return False
    return True

def prime_num(a): #素数列挙
    pn = [2]
    for i in range(3,int(a**0.5),2):
        prime = True
        for j in pn:
            if i%j==0:
                prime = False
                break
        if prime:
            pn.append(i)
    return pn

def prime_fact(a): #素因数分解
    sqrt = math.sqrt(a)
    res = []
    i = 2
    if is_prime(a):
        res.append(a)
    else:
        while a!=1:
            while a%i==0:
                res.append(i)
                a //= i
            i += 1
    return res

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

if __name__=='__main__':
    main()

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

Submission status: Accepted

Solution code:
import sys

x, a, b = map(int, sys.stdin.readline().split())

def main():
    best = -b + a
    if best >= 0:
        return 'delicious'
    elif best >= -x:
        return 'safe'
    else:
        return 'dangerous'

if __name__ == '__main__':
    ans = main()
    print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys

stdin = sys.stdin

ri = lambda: int(rs())
rl = lambda: list(map(int, stdin.readline().split()))
rs = lambda: stdin.readline().rstrip()  # ignore trailing spaces

X, A, B = rl()
print('delicious' if A >= B else 'safe' if X >= B - A else 'dangerous')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys, math, itertools, heapq, collections, bisect, string
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
inf = float('inf')
mod = 10**9+7
ans = 0 ;count = 0 ;pro = 1

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

if d <= 0:
  ans = 'delicious'
elif d <= x:
  ans = 'safe'
else:
  ans = 'dangerous'
print(ans)

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('dangerous')
else:
    print('safe')

Submission status: Accepted

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

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

sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]

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

Submission status: Accepted

Solution code:
import sys


def solve():
    readline = sys.stdin.buffer.readline
    mod = 10 ** 9 + 7
    x, a, b = list(map(int, readline().split()))
    if b - a <= 0:
        print("delicious")
    elif 0 < b - a <= x:
        print("safe")
    else:
        print("dangerous")


if __name__ == '__main__':
    solve()

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

if T <= 0: print("delicious")
elif T <= X: print("safe")
else: print("dangerous")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import numpy as np
import scipy as sp

def main():
    # parse
    X, A, B = parse(get_stdin())
    # compute
    result = compute(X, A, B)
    # show result
    print(result)

def compute(X, A, B):
    if 0 >= B-A:
        return "delicious"
    elif X >= B-A:
        return "safe"
    else:
        return "dangerous"

def get_stdin():
    return input()

def split_stdin(stdin_val, delimiter = ' '):
    return [x for x in stdin_val.split(delimiter) if x != '']

def parse(stdin_vars):
    vars = split_stdin(stdin_vars)
    return int(vars[0]), int(vars[1]), int(vars[2])

if __name__ == "__main__":
    main()

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

Submission status: Accepted

Solution code:
#ABC065 A - Expired
si = lambda: input()
ni = lambda: int(input())
nm = lambda: map(int, input().split())
nl = lambda: list(map(int, input().split()))
x,a,b = nm()
e = -a+b
ans = ''
if e<=0:
    ans = 'delicious'
elif e<=x:
    ans = 'safe'
else:
    ans = 'dangerous'

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys


def solve():
    readline = sys.stdin.buffer.readline
    mod = 10 ** 9 + 7
    x, a, b = list(map(int, readline().split()))
    if b - a <= 0:
        print("delicious")
    elif b - a < x + 1:
        print("safe")
    else:
        print("dangerous")


if __name__ == '__main__':
    solve()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# ABC065a
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)

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

Submission status: Accepted

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

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

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:
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:
#
# 　　  ⋀_⋀　 
#　　  (･ω･)  
# .／ Ｕ ∽ Ｕ＼
#  │＊　合　＊│
#  │＊　格　＊│ 
#  │＊　祈　＊│ 
#  │＊　願　＊│ 
#  │＊　　　＊│ 
#      ￣
#
import sys
sys.setrecursionlimit(10**6)
input=sys.stdin.readline
from math import floor,ceil,sqrt,factorial,log #log2ないｙｐ
from heapq import heappop, heappush, heappushpop
from collections import Counter,defaultdict,deque
from itertools import accumulate,permutations,combinations,product,combinations_with_replacement
from bisect import bisect_left,bisect_right
from copy import deepcopy
inf=float('inf')
mod = 10**9+7
def pprint(*A): 
    for a in A:     print(*a,sep='\n')
def INT_(n): return int(n)-1
def MI(): return map(int,input().split())
def MF(): return map(float, input().split())
def MI_(): return map(INT_,input().split())
def LI(): return list(MI())
def LI_(): return [int(x) - 1 for x in input().split()]
def LF(): return list(MF())
def LIN(n:int): return [I() for _ in range(n)]
def LLIN(n: int): return [LI() for _ in range(n)]
def LLIN_(n: int): return [LI_() for _ in range(n)]
def LLI(): return [list(map(int, l.split() )) for l in input()]
def I(): return int(input())
def F(): return float(input())
def ST(): return input().replace('\n', '')
def main():
    X,A,B = MI()
    C=B-A
    if C<=0:
        print("delicious")
    elif C<=X:
        print("safe")
    else:
        print("dangerous")
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
from sys import stdin

x,a,b = [int(x) for x in stdin.readline().rstrip().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())
passed = a-b
ans = ''
if passed >= 0:
  print('delicious')
elif passed*-1 <= 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 >= abs(a-b):
  print("safe")
elif x < abs(a-b):
  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 = [int(i) for i in 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 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 a+x>=b:
    print('safe')
else:
    print('dangerous')

Submission status: Accepted

Solution code:
X,A,B = map(int,input().split())
if A+X+1<=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 > 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+a>=b:
  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
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd

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

Submission status: Accepted

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

k = -a+b

if 0 >= k:
	print('delicious')
elif 0 < k <= x :
	print('safe')
else:
	print('dangerous')

Submission status: Accepted

Solution code:
def examA():
    X, A, B = LI()
    if (B-A)<=0:
        ans = "delicious"
    elif (B-A)<=X:
        ans = "safe"
    else:
        ans = "dangerous"
    print(ans)


import sys
import copy
import bisect
import heapq
from collections import Counter,defaultdict,deque
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
def LS(): return sys.stdin.readline().split()
def S(): return sys.stdin.readline().strip()
mod = 10**9 + 7
inf = float('inf')

examA()

Submission status: Accepted

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

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('delicious' if a>=b else 'safe' if a+x>=b else '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:
    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:
data = input().split(" ")
for i in range(3):
	data[i] = int(data[i])
a = data[0] + data[1] - data[2]
if data[2] <= data[1]:
	print("delicious")
elif 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 <=x+a:
  print('safe')
else:
  print('dangerous')

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# A - Expired?
x, a, b = [int(s) for s in 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 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:
# -*- coding: utf-8 -*-
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:
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 + 1 <= B:
  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:
    print('delicious')
else:
    print('safe')

Submission status: Accepted

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

#賞味期限を X+1日以上過ぎた食品を食べると、お腹を壊します。
#賞味期限を過ぎずに食べると、おいしく感じます。そうでない場合、おいしく感じません。

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

Submission status: Accepted

Solution code:
X,A,B = (int(x) for x in input().split())

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


def solve():
    input = sys.stdin.readline
    mod = 10 ** 9 + 7
    x, a, b = list(map(int, input().rstrip('\n').split()))
    if b - a <= 0:
        print("delicious")
    elif b - a <= x:
        print("safe")
    else:
        print("dangerous")


if __name__ == '__main__':
    solve()

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

Submission status: Accepted

Solution code:
#n = int(input())
#n,k = map(int,input().split())
#x = list(map(int,input().split()))

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


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

Submission status: Accepted

Solution code:
X,A,B = map(int,input().split())
if X < abs(A-B):
    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 >= 0 else 'safe' if B-A <= X else 'dangerous')

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#2019/10/15
X,A,B = map(int, open(0).read().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 "safe" if b<=a+x else "dangerous")

Submission status: Accepted

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