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

limit=B-A

# おしいくないが、お腹壊さない
if A>=B:
    print("delicious")
elif B-A<=X:
    print("safe")
elif B-A>X:
    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:
# -*- coding: utf-8 -*-


#----------
X,A,B = list(map(int, input().rstrip().split()))
#----------
d=-A+B
print( "delicious" if d <= 0 else "safe" if d <= 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<=0:
  print('delicious')
else:
  if b-a<=x:
    print('safe')
  else:
    print('dangerous')

Submission status: Accepted

Solution code:
x, a, b = (int(_) for _ 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(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:
    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 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 + 1 > abs(a - b):
    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:
def I(): return int(input())
def MI(): return map(int, input().split())
def LMI(): return list(map(int, input().split()))

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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:
#ABC065

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

read = sys.stdin.buffer.read
input = sys.stdin.buffer.readline
inputs = sys.stdin.buffer.readlines

# mod=10**9+7
# rstrip().decode('utf-8')
# map(int,input().split())
# import numpy as np

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






	
if __name__ == "__main__":
	main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# AtCoder Beginner Contest 062
# A - Expired?
X, A, B = map(int, input().split())
if B <= 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 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 =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<B and 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<=0): 
  print("delicious")
else:
  print("safe")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
stdin = sys.stdin

ns = lambda: stdin.readline().rstrip()
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))

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

Submission status: Accepted

Solution code:
from fractions import gcd
# from datetime import date, timedelta
# from heapq import *
import heapq
import math
from collections import defaultdict, Counter, deque
from bisect import *
import itertools
import fractions
import sys
sys.setrecursionlimit(10 ** 7)
MOD = 10 ** 9 + 7
# input = sys.stdin.readline


def lcm(a, b):
    return a * b / fractions.gcd(a, b)


def make_divisors(n):
    divisors = []
    for i in range(1, int(n**0.5)+1):
        if n % i == 0:
            divisors.append(i)
            if i != n // i:
                divisors.append(n//i)

    # divisors.sort()
    return divisors


def factorize(n):
    fct = []  # prime factor
    b, e = 2, 0  # base, exponent
    while b * b <= n:
        while n % b == 0:
            n = n // b
            e = e + 1
        if e > 0:
            fct.append((b, e))
        b, e = b + 1, 0
    if n > 1:
        fct.append((n, 1))
    return fct


def is_prime(n):
    if n == 1:
        return False

    for k in range(2, int(math.sqrt(n)) + 1):
        if n % k == 0:
            return False

    return True


def primes(n):
    is_prime = [True] * (n + 1)
    is_prime[0] = False
    is_prime[1] = False
    for i in range(2, int(n**0.5) + 1):
        if not is_prime[i]:
            continue
        for j in range(i * 2, n + 1, i):
            is_prime[j] = False
    return [i for i in range(n + 1) if is_prime[i]]

def modpow(a, n, mod):
    res = 1
    while n > 0:
        if n & 1:
            res = res * a % mod
        a = a * a % mod
        n >>= 1
    return res


def modinv(a, mod):
    return modpow(a, mod - 2, mod)


def cnk(a, b):
    MOD = 10**9+7
    ret = 1
    for i in range(b):
        ret *= (a-i)
        ret %= MOD
        ret = ret * modinv(i+1, MOD) % MOD
    return ret




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


            


    




    


if __name__ == '__main__':
    main()

Submission status: Accepted

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

if b-a<=0:
    print(ans[0])
elif b-a<=x:
    print(ans[1])
elif b-a>x:
    print(ans[2])

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:
# 2020/02/15
# AtCoder Beginner Contest 065 - A

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

# Calc
if a >= b:
    ans = "delicious"
elif a + x >= b:
    ans = "safe"
else:
    ans = "dangerous"

# Output
print(ans)

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:
import sys
input = sys.stdin.readline
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:
#
# 　　  ⋀_⋀　 
#　　  (･ω･)  
# .／ Ｕ ∽ Ｕ＼
#  │＊　合　＊│
#  │＊　格　＊│ 
#  │＊　祈　＊│ 
#  │＊　願　＊│ 
#  │＊　　　＊│ 
#      ￣
#
import sys
sys.setrecursionlimit(10**6)
input=sys.stdin.readline
from math import floor,sqrt,factorial,hypot,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
from fractions import gcd
from random import randint
def ceil(a,b): return (a+b-1)//b
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=A-B
    if A>=B:
        print("delicious")
    elif B-A<=X:
        print("safe")
    else:
        print("dangerous")
    
if __name__ == '__main__':
    main()

Submission status: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

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) <= 0:
    print("delicious")
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:
X,A,B = [int(i) for i in input().split()]
if B <= A:
    print("delicious")
    exit()
else:
    if B - A <=X:
        print("safe")
        exit()
    else:
        print("dangerous")
        exit()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

C = B - A

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

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

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:
#
# 　　  ⋀_⋀　 
#　　  (･ω･)  
# .／ Ｕ ∽ Ｕ＼
#  │＊　合　＊│
#  │＊　格　＊│ 
#  │＊　祈　＊│ 
#  │＊　願　＊│ 
#  │＊　　　＊│ 
#      ￣
#
import sys
sys.setrecursionlimit(10**6)
input=sys.stdin.readline
from math import floor,sqrt,factorial,hypot,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
from fractions import gcd
from random import randint
def ceil(a,b): return (a+b-1)//b
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()
    day = B-A
    if day <= 0:
        print("delicious")
    elif day <= X:
        print("safe")
    else:
        print("dangerous")

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
X, A, B = list(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:
def eatperiod(x , a , b):

    ans = ""

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

    return ans

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
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:
# 入力 : 数字3つ
X, A, B = map(int, input().split())

# 出力　高橋君が食品をおいしく感じた場合 delicious を、
# おいしくは感じなかったがお腹は壊さなかった場合 safe を、
# お腹を壊した場合 dangerous を出力するプログラムを作成してください。

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-


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


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:
    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 0 <= 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('safe')
elif b-a>=x+1:
    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:
"""
author : halo2halo
date : 30, Jan, 2020
"""

import sys
import itertools

# import numpy as np

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

X,A,B = map(int,readline().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 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 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+x >= b:
    print("safe")
else:
    print("dangerous")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
x,a,b = map(int,input().split())
if b <= a: print("delicious")
elif b <= a + x: print("safe")
else: print("dangerous")

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# coding: utf-8
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())

a *= -1

a += b

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
 
import math
import itertools
import sys
import copy
 
# 入力
#A, B, C, D = map(int, input().split())
#L = list(map(int, input().split()))
#S = list(str(input()))
#N = int(input())
#S = str(input())
X, A, B = map(int, input().split())

if A >= B :
  print ("delicious")
  exit()
if A+X >= B :
  print ("safe")
  exit()
print ("dangerous")

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:


import numpy as np
import fractions as fra

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

Submission status: Accepted

Solution code:
status = input().split()
sta_s = [int(s) for s in status]

x, a, b = sta_s

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 0<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 x+a-b < 0:
  print("dangerous")
else:
  if a >= b:
    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 = (int(i) for i in 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= list(map(int, input().split()))

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
X, A, B = [int(x) for x in 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 -a+b <= 0:
    print("delicious")
elif -a+b<=x:
    print("safe")
else:
    print("dangerous")

Submission status: Accepted

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