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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
with open(0) as f:
    X, A, B = map(int, f.read().split())
if B-A <= 0:
    ans = 'delicious'
if 0 < B-A <= X:
    ans = 'safe'
if B-A > X:
    ans = 'dangerous'
print(ans)

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

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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


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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
days_of_fine, day_before_expiration, eating_day = map(int, input().split())

if eating_day <= day_before_expiration:
    print('delicious')
elif day_before_expiration < eating_day <= days_of_fine + day_before_expiration:
    print('safe')
else:
    print('dangerous')

Submission status: Accepted

Solution code:
days_of_fine, day_befoe_exparitation, eating_day = map(int, input().split())

if eating_day <= days_of_fine:
    print('delicious')
elif day_befoe_exparitation < eating_day <= days_of_fine + day_befoe_exparitation:
    print('safe')
else:
    print('dangerous')

Submission status: Accepted

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

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

readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)


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

Submission status: Accepted

Solution code:
#n = int(input())
x, a, b = map(int, input().split())
#l = list(map(int,input().split()))
#l = [list(map(int,input().split())) for i in range(n)]

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

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

Submission status: Accepted

Solution code:
#
# abc065 a
#

import sys
from io import StringIO
import unittest


class TestClass(unittest.TestCase):
    def assertIO(self, input, output):
        stdout, stdin = sys.stdout, sys.stdin
        sys.stdout, sys.stdin = StringIO(), StringIO(input)
        resolve()
        sys.stdout.seek(0)
        out = sys.stdout.read()[:-1]
        sys.stdout, sys.stdin = stdout, stdin
        self.assertEqual(out, output)

    def test_入力例_1(self):
        input = """4 3 6"""
        output = """safe"""
        self.assertIO(input, output)

    def test_入力例_2(self):
        input = """6 5 1"""
        output = """delicious"""
        self.assertIO(input, output)

    def test_入力例_3(self):
        input = """3 7 12"""
        output = """dangerous"""
        self.assertIO(input, output)


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

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


if __name__ == "__main__":
    # unittest.main()
    resolve()

Submission status: Accepted

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

X, A, B = LI()


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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

if 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 >= 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:
import sys
input = lambda: sys.stdin.readline().rstrip() 
sys.setrecursionlimit(10**7)
INF = 10**20
def I(): return int(input())
def F(): return float(input())
def S(): return input()
def LI(): return [int(x) for x in input().split()]
def LI_(): return [int(x)-1 for x in input().split()]
def LF(): return [float(x) for x in input().split()]
def LS(): return input().split()

def resolve():
    X, A, B = LI()

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

if __name__ == '__main__':
    resolve()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys


def input():
    return sys.stdin.readline().strip()
# sys.setrecursionlimit(100000)


def main():
    x, a, b = [int(i) for i in input().strip().split()]
    res = a - b
    if res >= 0:
        print("delicious")
    elif abs(res) > x:
        print("dangerous")
    else:
        print("safe")

    return


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
X, A, B = [ int(v) for v in input().split(" ") ]

# A: 3 B: 4 X: 3

result = A - B

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

Submission status: Accepted

Solution code:
x,a,b = map(int, raw_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())
y=b-a
if y > x:
  print('dangerous')
elif 0 < y <=x:
  print('safe')
elif y <= 0:
  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","safe"][a<b],"dangerous"][x+a<b])

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:
import sys

read = sys.stdin.read
readline = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 8)
INF = float('inf')
MOD = 10 ** 9 + 7


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


if __name__ == '__main__':
    main()

Submission status: Accepted

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


if __name__ == "__main__":
    solve()

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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


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:
#k = int(input())
#s = input()
#a, b = map(int, input().split())
#s, t = map(str, input().split())
#l = list(map(int, input().split()))
#l = [list(map(int,input().split())) for i in range(n)]
#a = [list(input()) for _ in range(n)]

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

Submission status: Accepted

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

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

Submission status: Accepted

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

x=B-A

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# # Make IO faster
# import sys
# input = sys.stdin.readline

# # get single (or) multiple str
# X = input()

# # get single int
# N = int(input())
# # get multiple int (e.g., 2)
# X, Y = map(int, input().split())
# # get multiple int (e.g., 2) for N lines
# XY = [list(map(int, input().split())) for _ in range(N)]

# from IPython import embed; embed(); exit();

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

X, A, B = MAP()

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

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:
tmp = input().split(" ")
X = int(tmp[0])
A = int(tmp[1])
B = int(tmp[2])
 
print("delicious") if B <= A 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 <= 0:
    print('delicious')
elif B-A >= X+1:
    print('dangerous')
else:
    print('safe')

Submission status: Accepted

Solution code:
X,A,B = (int(T) for T in input().split())
print(['delicious','safe','dangerous'][(B-A>0)*(1+((X-(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())

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

Submission status: Accepted

Solution code:
import sys

read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007


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

    if B <= A:
        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 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:
def check():
  X, A, B = map(int, input().split())
  if A>=B:
    return 'delicious'
  if B-A>X:
    return 'dangerous'
  return 'safe'
print(check())

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import bisect,collections,copy,heapq,itertools,math,string
import sys
def S(): return sys.stdin.readline().rstrip()
def M(): return map(int,sys.stdin.readline().rstrip().split())
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())
x, a, b = M()
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:
    if b - a <= x:
        print("safe")
    else:
        print("dangerous")
else:
    print("delicious")

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

Submission status: Accepted

Solution code:
import sys, re
from math import ceil, floor, sqrt, pi, factorial, gcd
from copy import deepcopy
from collections import Counter, deque
from heapq import heapify, heappop, heappush
from itertools import accumulate, product, combinations, combinations_with_replacement
from bisect import bisect, bisect_left, bisect_right
from functools import reduce
from decimal import Decimal, getcontext
# input = sys.stdin.readline 
def i_input(): return int(input())
def i_map(): return map(int, input().split())
def i_list(): return list(i_map())
def i_row(N): return [i_input() for _ in range(N)]
def i_row_list(N): return [i_list() for _ in range(N)]
def s_input(): return input()
def s_map(): return input().split()
def s_list(): return list(s_map())
def s_row(N): return [s_input for _ in range(N)]
def s_row_str(N): return [s_list() for _ in range(N)]
def s_row_list(N): return [list(s_input()) for _ in range(N)]
def lcm(a, b): return a * b // gcd(a, b)
sys.setrecursionlimit(10 ** 6)
INF = float('inf')
MOD = 10 ** 9 + 7
num_list = []
str_list = []

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input = lambda : sys.stdin.readline().rstrip()
sys.setrecursionlimit(max(1000, 10**9))
write = lambda x: sys.stdout.write(x+"\n")


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

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

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