Problem:


﻿Score: 100 points

Problem Statement

In AtCoder city, there are five antennas standing in a straight line. They are called Antenna A, B, C, D and E from west to east, and their coordinates are a, b, c, d and e, respectively.

Two antennas can communicate directly if the distance between them is k or less, and they cannot if the distance is greater than k.

Determine if there exists a pair of antennas that cannot communicate directly.

Here, assume that the distance between two antennas at coordinates p and q (p < q) is q - p.  

Constraints

a, b, c, d, e and k are integers between 0 and 123 (inclusive).

a < b < c < d < e

Input

Input is given from Standard Input in the following format:

a
b
c
d
e
k

Output

Print :( if there exists a pair of antennas that cannot communicate directly, and print Yay! if there is no such pair.

Sample Input 1

1
2
4
8
9
15

Sample Output 1

Yay!

In this case, there is no pair of antennas that cannot communicate directly, because:

the distance between A and B is 2 - 1 = 1

the distance between A and C is 4 - 1 = 3

the distance between A and D is 8 - 1 = 7

the distance between A and E is 9 - 1 = 8

the distance between B and C is 4 - 2 = 2

the distance between B and D is 8 - 2 = 6

the distance between B and E is 9 - 2 = 7

the distance between C and D is 8 - 4 = 4

the distance between C and E is 9 - 4 = 5

the distance between D and E is 9 - 8 = 1

and none of them is greater than 15. Thus, the correct output is Yay!.

Sample Input 2

15
18
26
35
36
18

Sample Output 2

:(

In this case, the distance between antennas A and D is 35 - 15 = 20 and exceeds 18, so they cannot communicate directly.
Thus, the correct output is :(.



Sample input:
1
2
4
8
9
15


Sample output:
Yay!

Submission status: Wrong Answer

Solution code:
a=int(input())
b=int(input())
c=int(input())
d=int(input())
e=int(input())
k=int(input())
if k+e>=a:
    print("Yay!")
else:
    print(":(")

Submission status: Wrong Answer

Solution code:
antenna = []
for i in range(5):
  antenna.append(int(input()))
K = int(input())

d = True
for i in range(5):
  for j in range(i,5):
    if antenna[j]-antenna[i] > K:
      print(':(')
      d = False
      break
if d:
  print('Yay!')

Submission status: Wrong Answer

Solution code:
A = [int(input()) for _ in range(6)]
m = min(A[1:])
print(4+(A[0]+m-1)//m)

Submission status: Wrong Answer

Solution code:
cord = []
for i in range(5):
    data = int(input())
    cord.append(data)
k = int(input())

dist = []
for i in range(5 - 1):
    for j in range(1, 5 - i):
        dist_tmp = cord[i] + cord[i + j]
        dist.append(dist_tmp)

ans = [x for x in dist if x <= k]
if len(ans) == 0:
    print(':(')
else:
    print('Yay!')

Submission status: Wrong Answer

Solution code:
a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())
k = int(input())

dist = e-a
if dist < k:
    print('Yay!')
else:
    print(':(')

Submission status: Wrong Answer

Solution code:
antena = []
for _ in range(5):
    antena.append(int(input()))
    
k = int(input())

if k >= antena[-1]-antena[1]:
    print("Yay!")
else:
    print(":(")

Submission status: Wrong Answer

Solution code:
#A-Five Antennas(ABC123)
X=[int(input()) for i in range(5)]
K=int(input())
print(X)
X.sort()
if (X[4]-X[0])<=K:
    print("Yay!")
else:
    print(":(")

Submission status: Wrong Answer

Solution code:
import sys
L=[0 for i in range(5)]
for i in range(5):
  L[i]=int(input())
  
k=int(input())

for i in range(4):
  for j in range(i+1,4):
    if L[j]-L[i]>k:
      print(':(')
      sys.exit()
  
    if i==2 and j==3:
      print('Yay!')

Submission status: Wrong Answer

Solution code:
import math

inputList=[]
for i in range(6):
    inputNum = input()
    inputList.append(inputNum)
# inputa = input().split()

# inputb = input()

# a = int(inputa[0])
# b = int(inputa[1])
# c = int(inputa[2])

# inputList = list(inputb)
#
# inputList[b-1] = inputList[b-1].lower()
#
# ans = "".join(inputList)



# inputList.sort()
#
# list = [a+b, b+c ,c+a]
#
# ans = min(list)
# print(ans)



flg = 1

if int(inputList[4])-int(inputList[0]) >= int(inputList[5]):
    flg = 0

if flg == 0:
    print(":(")
else:
    print("Yay!")

Submission status: Wrong Answer

Solution code:
a, b, c, d, e, k = [int(input()) for _ in range(6)]
n = [a, b, c, d, e]
if max(n) - min(n) < k:
    print('Yay!')
else:
    print(':(')

Submission status: Wrong Answer

Solution code:
n = [int(input()) for _ in range(6)]
if (max(n[0:5]) - min(n[0:5])) < n[5]:
    print('Yay!')
else:
    print(':(')

Submission status: Wrong Answer

Solution code:
n = [int(input()) for _ in range(6)]
if max(n[0:5]) - min(n[0:5]) < n[5]:
    print('Yay!')
else:
    print(':(')

Submission status: Wrong Answer

Solution code:
n = [int(input()) for _ in range(6)]

if max(n[0:4]) - min(n[0:4]) < n[5]:
    print('Yay!')
else:
    print(':(')

Submission status: Wrong Answer

Solution code:
a=[]
for i in range(5):
	a.append(int(input()))

k = int(input())

if max(a)-min(a) < 15:
	print('Yay!')
else:
	print(':(')

Submission status: Wrong Answer

Solution code:
a=[]
for i in range(5):
	a.append(int(input()))

k = int(input())

if max(a)-min(a) <= 15:
	print('Yay!')
else:
	print(':(')

Submission status: Wrong Answer

Solution code:
a = int(input())
e = int(input())
k = int(input())

max = e-a
if max > k:
  print(":(")
else:
  print("Yay!")

Submission status: Wrong Answer

Solution code:
a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())
k = int(input())

if e-d > k:
  print(':(')
elif d-c > k:
  print(':(')
elif c-b > k:
  print(':(')
elif b-a > k:
  print(':(')
else:
  print('Yay!')

Submission status: Wrong Answer

Solution code:
l=[]
for _ in range(5):
  l.append(int(input()))
N=int(input())

m='Yay!'
for i in range(4):
  for j in range(4):
    if abs(l[i]-l[j])>N:
      m=':('
    
print(m)

Submission status: Wrong Answer

Solution code:
l=[]
for _ in range(5):
  l.append(int(input()))
N=int(input())

m='Yay!'
for i in range(4):
  if abs(l[i]-l[i+1])>N:
    m=':('
    
print(m)

Submission status: Wrong Answer

Solution code:
a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())
k = int(input())

L = []
cnt = 0

ab = abs(a-b)
ac = abs(a-c)
ad = abs(a-d)
ae = abs(a-e)
bc = abs(b-c)
bd = abs(b-d)
be = abs(b-e)
cd = abs(c-d)
ce = abs(c-e)
de = abs(d-e)

L.append(ab)
L.append(ac)
L.append(ad)
L.append(ae)
L.append(bc)
L.append(bd)
L.append(be)
L.append(cd)
L.append(ce)
L.append(de)

print(L)

for l in L:
    if l > k:
        print(':(')
        break
    else:
        cnt += 1
        if cnt == 5:
            print('Yay!')

Submission status: Wrong Answer

Solution code:
a=int(input())
b=int(input())
c=int(input())
d=int(input())
e=int(input())
k=int(input())

if min(b-a,c-b,d-c,e-d) > k:
  print(':(')
else:
  print('Yay!')

Submission status: Wrong Answer

Solution code:
a=int(input())
b=int(input())
c=int(input())
d=int(input())
e=int(input())
k=int(input())

if min(b-a,c-b,d-c,e-d) > k:
  print(':(')
else:
  print('yay!')

Submission status: Wrong Answer

Solution code:
a=list(map(int,[input() for i in range(5)]))
k=int(input())
for i in range(4):
  if (a[i+1]-a[i]) > k:
    b=":("
    print(b)
    exit()
  else:
    b="Yay!"
print(b)

Submission status: Wrong Answer

Solution code:
a=list(map(int,[input() for i in range(5)]))
k=int(input())
print(a)
for i in range(4):
  if (a[i+1]-a[i]) > k:
    b=":("
    print(b)
    exit()
  else:
    b="Yay!"
print(b)

Submission status: Wrong Answer

Solution code:
a=list(map(int,[input() for i in range(5)]))
k=int(input())
for i in range(4):
  if abs(a[i+1]-a[i]) > k:
    b=":("
    print(b)
    exit()
  else:
    b="Yay!"
print(b)

Submission status: Wrong Answer

Solution code:
a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())
k = int(input())

# print(a)
# print(b)
# print(c)
# print(d)
# print(e)
# print(k)

# print(e - a)

if e - a < 15:
    print('Yay!')
else:
    print(':(')

Submission status: Wrong Answer

Solution code:
a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())
k = int(input())

# print(a)
# print(b)
# print(c)
# print(d)
# print(e)
# print(k)

# print(e - a)

if e - a <= 15:
    print('Yay!')
else:
    print(':(')

Submission status: Wrong Answer

Solution code:
a = int(input())
b= int(input())
c= int(input())
d= int(input())
e= int(input())
k= int(input())

if abs(a-b)>k or abs(b-c)>k or abs(c-d)>k or abs(d-e)>k:
  print(':(')
else:
  print('Yay!')

Submission status: Wrong Answer

Solution code:
import sys
from collections import deque, defaultdict
import copy
import bisect
#input=sys.stdin.readline
#sys.setrecursionlimit(10 ** 9)
import math
import heapq

#N, K = list(map(int, input().split()))

N = int(input())

x = []
for i in range(5):
	x.append(int(input()))

bottle = min(x)
times = math.ceil(N/bottle)
print(times + 4)

Submission status: Wrong Answer

Solution code:
a = [int(input()) for i in range(5)]
k = int(input())
l = max(a) - min(a)
if l >= k:
    print(":(")
else:
    print("Yay!")

Submission status: Wrong Answer

Solution code:
a = [int(input()) for i in range(5)]
k = int(input())
l = max(a) - min(a)
if l >= k:
    print(":(")
else:
    print("Yey!")

Submission status: Wrong Answer

Solution code:
a = [int(input()) for i in range(5)]
k = int(input())
l =[a[i+1]-a[i] for i in range(4)]
if any(i for i in l) > k:
    print(":(")
else:
    print("Yey!")

Submission status: Wrong Answer

Solution code:
a,b,c,d,e = [int(input()) for i in range(5)]
k = int(input())
if e-a > k:
  print("Yay!")
else:
  print(":(")

Submission status: Wrong Answer

Solution code:
a,b,c,d,e = [int(input()) for i in range(5)]
k = int(input())
if a-e > k:
  print("Yay!")
else:
  print(":(")

Submission status: Wrong Answer

Solution code:
a,b,c,d,e = [int(input()) for i in range(5)]
k = int(input())
if a-e > k:
  print("Yay!")
else:
  print(":)")

Submission status: Wrong Answer

Solution code:
grid = [0] * 6

result = 'Yay!'

for i in range(len(grid)):
  grid[i] = int( input() )

  
for i in range(len(grid)-2):
  for j in range(i+1,len(grid)-1):
    #print( "{:d}, {:d},".format(grid[i], grid[j]))
    if grid[j] - grid[i] >= grid[len(grid)-1]:
      result = ':('
      break

print( result )
#print( grid )

Submission status: Wrong Answer

Solution code:
antenna = [int(input()) for i in range(5)]
k = int(input())
judge = ''
i,j = 1,1
for i in range(5):
  for j in range(i+1,5):
    if antenna[i]**2 + antenna[j]**2 > k**2:
      judge = ':('
      break

if judge==':(':
  print(':(')
else:
  print('Yay!')

Submission status: Wrong Answer

Solution code:
antenna = [int(input()) for i in range(5)]
k = int(input())
judge = ''
i,j = 1,1
for j in range(i+1,5):
  if antenna[i]**2 + antenna[j]**2 > k**2:
    judge = ':('
    break
  i+=1

if judge==':(':
  print(':(')
else:
  print('Yay!')

Submission status: Wrong Answer

Solution code:
a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())
k = int(input())

if e - a > k:
    print("Yay!")
else:
    print(":(")

Submission status: Wrong Answer

Solution code:
A = [input() for i in range(6)]
X = [int() for i in A]
a, b, c, d, e, k = X
B = [a-b, a-c, a-d, a-e,b-c,b-d,b-e,c-d,c-e,d-e]
for i in range(10):
    if abs(B[i]) > k:
        print(":(")
        break
else:
    print("Yay!")

Submission status: Wrong Answer

Solution code:
l = []
for i in range(5):
    l.append(int(input()))
k = int(input())
flg = True

for i in range(5):
    print("i: "+str(i))
    for j in range(i, 5):
        print("j: "+str(j))
        if l[j] - l[i] >k:
            flg = False
            break
if flg==True:
    print("Yay!")
else:
    print(":(")

"""
0 1234
1 234
2 34
3 4
"""

Submission status: Wrong Answer

Solution code:
l = []
for i in range(5):
    l.append(int(input()))
k = int(input())
flg = True

for i in range(4):
    for j in range(i, 4):
        if l[j] - l[i] >k:
            flg = False
            break
if flg==True:
    print("Yay!")
else:
    print(":(")

"""
0 1234
1 234
2 34
3 4
"""

Submission status: Wrong Answer

Solution code:
l = []
for i in range(5):
    l.append(int(input()))
k = int(input())
flg = True

for i in range(4):
    for j in range(4 - i):
        if l[i+j] - l[i] >k:
            flg = False
            break
if flg==True:
    print("Yay!")
else:
    print(":(")

Submission status: Wrong Answer

Solution code:
a=int(input())
input()
input()
input()
e=int(input())
k=int(input())
if e - a < k:
    print("Yay!")
else:
    print(":(")

Submission status: Wrong Answer

Solution code:
a,b,c,d,e,k = [int(input()) for i in range(6)]
print("Yay!" if e-a<k else ":(")

Submission status: Wrong Answer

Solution code:
N = [int(input()) for i in range(6)] 
count = 0
for i in range(5):
  for j in range(5):
    if abs(N[i]-N[j]) >= N[5]:
      count += 1

if count == 0:
  print("Yay!")
else:
  print(":(")

Submission status: Wrong Answer

Solution code:
import math

T = list(map(int, (input() for _ in range(5))))
T2 = [math.ceil(t / 10) * 10 for t in T]
m = max(t2 - t for t, t2 in zip(T, T2))
print(sum(T2) - m)

Submission status: Wrong Answer

Solution code:
antenna = []
for i in range(5):
  antenna.append(int(input()))
k = int(input())
if k > max(antenna) - min(antenna):
  print("Yay!")
else:
  print(":(")

Submission status: Wrong Answer

Solution code:
antenna = []
for i in range(5):
  antenna.append(int(input()))
k = int(input())
if k < max(antenna) - min(antenna):
  print("Yay!")
else:
  print(":(")

Submission status: Wrong Answer

Solution code:
n=[int(input()) for _ in range(5)]
k=int(input())
ans=0
for i in range(len(n)):
  for j in range(len(n)):
    if abs(n[i]-n[j]) >= k:
      ans+=1

if ans==0:
  print('Yay!')
else:
  print(':(')

Submission status: Wrong Answer

Solution code:

A = [0, 0, 0, 0, 0]
A[0] = int(input())
A[1] = int(input())
A[2] = int(input())
A[3] = int(input())
A[4] = int(input())
k = int(input())

flg = 0

for i in range(0, 4, 1):
    if flg == 1:
        break

    for j in range(i+1, 5, 1):
        print(A[j] - A[i])
        if k < (A[j] - A[i]):
            flg = 1
            print(A[j] - A[i])
            print(":(")
            break

if flg == 0:
    print("Yay!")

Submission status: Wrong Answer

Solution code:

A = [0, 0, 0, 0, 0]
A[0] = int(input())
A[1] = int(input())
A[2] = int(input())
A[3] = int(input())
A[4] = int(input())
k = int(input())

flg = 0

for i in range(0, 4, 1):
    for j in range(i+1, 5, 1):
        print(A[j] - A[i])
        if k < (A[j] - A[i]):
            flg = 1
            print(A[j] - A[i])
            print(":(")
            break
#    if flg == 1:
#        break

if flg == 0:
    print("Yay!")

Submission status: Wrong Answer

Solution code:

A = [0, 0, 0, 0, 0]
A[0] = int(input())
A[1] = int(input())
A[2] = int(input())
A[3] = int(input())
A[4] = int(input())
k = int(input())

flg = 0

for i in range(0, 4, 1):
    for j in range(i+1, 5, 1):
        print(A[j] - A[i])
        if k < (A[j] - A[i]):
            flg = 1
            print(A[j] - A[i])
            print(":(")
            break
    if flg == 1:
        break

if flg == 0:
    print("Yay!")

Submission status: Wrong Answer

Solution code:

A = [0, 0, 0, 0, 0]
A[0] = int(input())
A[1] = int(input())
A[2] = int(input())
A[3] = int(input())
A[4] = int(input())
k = int(input())

flg = 0

for i in range(0, 4, 1):
    for j in range(i+1, 5, 1):
        if k < (A[j] - A[i]):
            flg = 1
            print(A[j] - A[i])
            print(":(")
            break

if flg == 0:
    print("Yay!")

Submission status: Wrong Answer

Solution code:

A = [0, 0, 0, 0, 0]
A[0] = int(input())
A[1] = int(input())
A[2] = int(input())
A[3] = int(input())
A[4] = int(input())
k = int(input())

flg = 0

for i in range(4):
    for j in range(i+1, 5, 1):
        if k < (A[j] - A[i]):
            flg = 1
            print(":(")
            break

if flg == 0:
    print("Yay!")

Submission status: Wrong Answer

Solution code:

A = [0, 0, 0, 0, 0]
A[0] = int(input())
A[1] = int(input())
A[2] = int(input())
A[3] = int(input())
A[4] = int(input())
k = int(input())

flg = 0

for i in range(4):
    if k < (A[i+1] - A[i]):
        flg = 1
        print(":(")
        break
if flg == 0:
    print("Yay!")

Submission status: Wrong Answer

Solution code:
a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())
k = int(input())
r = [b-a,c-b,d-c,e-d]
count = 0
for rr in r:
  if rr > k:
    count += 1
print(count)

Submission status: Wrong Answer

Solution code:
a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())
k = int(input())
if e - a <= k:
  print('Yey')
else:
  print(':)')

Submission status: Wrong Answer

Solution code:
import math
N = int(input())
neck = int(input())
for i in range(4):
  neck = min(neck, int(input()))
res = math.ceil(N/neck)
print(res + 4)

Submission status: Wrong Answer

Solution code:
antennas = []

for antenna in range(5):
    antennas.append(antenna)

k = int(input())
    
if ((antennas[4] - antennas[0]) <= k):
    print("Yay!")
else:
    print(":(")

Submission status: Wrong Answer

Solution code:
n = []
for i in range(5):
    n.append(int(input()))
k = int(input())
if max(n) - min(n) < k:
    print("Yay!")
else:
    print(":()")

Submission status: Wrong Answer

Solution code:
a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())
k = int(input())
if e - a < k:
    print(":(")
    exit()
if d - a < k:
    print(":(")
    exit()
if c - a < k:
    print(":(")
    exit()
if b - a < k:
    print(":(")
    exit()

print("Yay!")

Submission status: Wrong Answer

Solution code:
li = [int(input()) for _ in range(5)]
k = int(input())

if k >=  li[-1] - li[0]:
    print("yay!")
else:
    print(":(")

Submission status: Wrong Answer

Solution code:
li = [int(input()) for _ in range(5)]
k = int(input())

if k >  li[-1] - li[0]:
    print("yay!")
else:
    print(":(")

Submission status: Wrong Answer

Solution code:
tmp = []
flg=0
for i in range(5):
  tmp.append(int(input()))
k = int(input())

for i in range(len(tmp)-1):
  for j in range(i,len(tmp)-1):
    if abs(tmp[i]-tmp[j]) > k:
      flg = 1
      print(':(')
      break
  if flg==1: break
if flg==0: print('Yay!')

Submission status: Wrong Answer

Solution code:
tmp = []
flg=0
for i in range(5):
  tmp.append(int(input()))
k = int(input())
for i in range(len(tmp)-1):
  for j in range(len(tmp)-i-1):
    if abs(tmp[i]-tmp[i+j]) > k:
      print(':(')
      flg = 1
      break
  if flg==1: break
if flg==0: print('Yay!')

Submission status: Wrong Answer

Solution code:
tmp = []
flg=0
for i in range(5):
  tmp.append(int(input()))
k = int(input())
for i in range(len(tmp)-1):
  if abs(tmp[i]-tmp[i+1]) > k:
    print(':(')
    flg = 1
    break
if flg==0: print('Yay!')

Submission status: Wrong Answer

Solution code:
tmp = []
flg=0
for i in range(5):
  tmp.append(int(input()))
for i in range(len(tmp)-1):
  if abs(tmp[i]-tmp[i+1]) > 18:
    print(':(')
    flg = 1
    break
if flg==0: print('Yay!')

Submission status: Wrong Answer

Solution code:
tmp = []
flg=0
for i in range(5):
  tmp.append(int(input()))
for i in range(len(tmp)):
  for j in range(len(tmp)-i):
    if abs(tmp[i]-tmp[j]) > 18:
      print(':(')
      flg = 1
      break
  if flg==1: break
if flg==0: print('Yay!')

Submission status: Wrong Answer

Solution code:
a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())
k = int(input())

if e - a < k:
	print(":(")
else:
	print("Yay!")

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())
k = int(input())
"""
AB = b - a
AC = c - a
AD = d - a
AE = e - a
BC = c - b
BD = d - b
BE = e - b
CD = d - c
CE = e - c
DE = e - d
if AB <= k and AC <= k and AD <= k and AE <= k and BC <= k and BD <= k and BE <= k and CD <= k and CE <= k and DE <= k:
    print("Yay!")
else:
    print(":(s")
"""
if e - a >= k:
    print(":(")
else:
    print("Yay!")

Submission status: Wrong Answer

Solution code:
a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())
k = int(input())

diff = e-a

if k >= diff:
    print("Yey!")
else:
    print(":(")

Submission status: Wrong Answer

Solution code:
a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())
k = int(input())

diff = max([a,b,c,d,e]) - min([a,b,c,d,e])

if k >= diff:
    print("Yey!")
else:
    print(":(")

Submission status: Wrong Answer

Solution code:
a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())
k = int(input())

flag = 0

lists = [a-b,a-c,a-d,a-e,b-c,b-d,b-e,c-d,c-e,d-e]

for i in lists:
    if k < abs(i):
        flag = 1

if flag == 0:
    print("Yey!")
else:
    print(":(")

Submission status: Wrong Answer

Solution code:
a,b,c,d,e,k=[int(input()) for _ in range(6)]
if a-e>k:
    print(':(')
else:
    print('Yay!')

Submission status: Wrong Answer

Solution code:
a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())
k = int(input())

if e - a <= k:
    print("Yay")
else:
    print(":(")

Submission status: Wrong Answer

Solution code:
a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())
k = int(input())

ans = 0
if e - a <= k:
    ans = 0
else:
    ans = 1

if ans == 0:
    print("Yay")
else:
    print(":(")

Submission status: Wrong Answer

Solution code:
from itertools import combinations as comb

z_list = []
for i in range(5):
    z = int(input())
    z_list.append(z)
k = int(input())

z_comb_list = list(comb(z_list, 2))

flag = True
for comb in z_comb_list:
    if abs(comb[0] - comb[1]) > k:
        print(":)")
        flag = False
        break

if flag:
    print("Yay!")

Submission status: Wrong Answer

Solution code:
antena = []
for _ in range(5):
    antena.append(int(input()))
k = int(input())
path = []
for i in range(1,5):
    p = antena[i]-antena[i-1]
    if p <= k:
        path.append(p)
if len(path)!=4:
    print(":(")
else:
    print("Yay!")

Submission status: Wrong Answer

Solution code:
antena = []
for _ in range(5):
    antena.append(int(input()))
k = int(input())
path = []
for i in range(1,5):
    p = antena[i]-antena[i-1]
    if p <= k:
        path.append(p)
if len(path)!=5:
    print(":(")
else:
    print("Yay!")

Submission status: Wrong Answer

Solution code:
def resolve():
	a=int(input())
	b=int(input())
	c=int(input())
	d=int(input())
	e=int(input())
	k=int(input())
	if e-a<=k:
		print('Yay!')
	else:
		print(':(')

Submission status: Wrong Answer

Solution code:
def main():
    antenna = []
    for i in range(5):
        antenna.append(int(raw_input()))
    k = int(raw_input())
    if (antenna[-1] - antenna[0]) < k:
        print("Yay!")
    else:
        print(":(")



if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
def main():
    antenna = []
    for i in range(5):
        antenna.append(int(raw_input()))
    k = int(raw_input())
    if (antenna[-1] - antenna[0]) < k:
        print("yes")
    else:
        print("no")



if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
l = [int(input()) for i in range(5)]
k = int(input())
            
if max(l) - min(l) < k:
    print('Yay!')
else:
    print(':(')

Submission status: Wrong Answer

Solution code:
li = [int(input()) for _ in range(5)]
k = int(input())

for i in range(4):
    if li[i+1] - li[i] <= k:
        pass
    else:
        print(":(")
        exit()

print("Yay!")

Submission status: Wrong Answer

Solution code:
alllist = []
for i in range(6):
    num = int(input())
    if i == 5:
        k = num
    else:
        alllist.append(num)

diflist = []
for i in range(4):
    diflist.append(alllist[i+1]-alllist[i])

for i in diflist:
    if i > k:
        print(":(")
        break
else:
    print("Yay!")

Submission status: Wrong Answer

Solution code:
def main():
    input_data = [int(input()) for i in range(5)]
    k = int(input())
    count = 0

    input_data.sort()

    temp = input_data[0] - input_data[4]
    if temp > k :
        print(":(")
    else:
        print('Yay!')

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
def main():
    input_data = [int(input()) for i in range(5)]
    k = int(input())
    count = 0

    input_data.sort()

    for i in input_data:
        temp = i - input_data[4]
        if temp > k :
            print(":(")
            break
        else :
            count = count +  1

    if count == 5:
        print('Yay!')

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
def main():
    input_data = [int(input()) for i in range(5)]
    k = int(input())

    input_data.sort()

    for i in input_data:
        temp = i - input_data[4]
        if temp > k :
            print(":(")
            break
        print('Yay!')

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
l = [int(input()) for i in range(6)]
if l[4] - l[0] <= 15:
    print('Yay!')
else:
    print(':(')

Submission status: Wrong Answer

Solution code:
A = int(input())
B = int(input())
C = int(input())
D = int(input())
E = int(input())
K = int(input())
a = abs(A-B)
b = abs(A-C)
c = abs(A-D)
d = abs(A-E)
e = abs(B-C)
f = abs(B-D)
g = abs(B-E)
h = abs(C-D)
i = abs(C-E)
j = abs(D-E)
if a<K and b<K and c<K and d<K and e<K and f<K and g<K and h<K and i<K and j<K:
  print("Yay!")
else:
  print(":(")

Submission status: Wrong Answer

Solution code:
a = [int(input()) for i in range(6)]
if max(a[:5])-min(a[:5])<a[5]:
  print('Yay!')
else:
  print(':(')

Submission status: Wrong Answer

Solution code:
lists = [0,0,0,0,0,0]
for i in lists:
        i = input()


if lists[4]-lists[0]<=lists[5]:
        print("Yay!")
else:
        print(":(")

Submission status: Wrong Answer

Solution code:
a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())
k = int(input())

if e - a <= k:
  print(":(")
else:
  print("Yay!")

Submission status: Wrong Answer

Solution code:
a=int(input())
b=int(input())
c=int(input())
d=int(input())
e=int(input())
k=int(input())

if a-e < k:
  print("Yay!")
else:
  print(":(")

Submission status: Wrong Answer

Solution code:
a=int(input())
b=int(input())
c=int(input())
d=int(input())
e=int(input())
k=int(input())

if a-e <= k:
  print("Yay!")
else:
  print(":(")

Submission status: Wrong Answer

Solution code:
a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())
k = int(input())

if(e-a > k):
  print("Yay!")
else:
  print(":(")

Submission status: Wrong Answer

Solution code:
l = [int(input()) for _ in range(5)]
k = int(input())

for i in range(3):
    for j in range(i+1,4):
        if (l[j] - l[i]) > k:
            print(":(")
            exit()

print("Yay!")

Submission status: Wrong Answer

Solution code:
l = [int(input()) for _ in range(5)]
k = int(input())

for i in range(4):
    for j in range(i+1,4):
        c = l[j] - l[i]
        if c > k:
            print(":(")
            exit()

print("Yay!")

Submission status: Wrong Answer

Solution code:
l = [int(input()) for _ in range(5)]
k = int(input())

for i in range(4):
    for j in range(i,4):
        c = l[j] - l[i]
        if c > k:
            print(":(")
            exit()

print("Yay!")

Submission status: Wrong Answer

Solution code:
l = [int(input()) for _ in range(5)]
k = int(input())

for i in range(4):
    for j in range(i,4):
        c = l[i + 1] - l[j]
        if c > k:
            print(":(")
            exit()

print("Yay!")

Submission status: Wrong Answer

Solution code:
l = [int(input()) for _ in range(5)]
k = int(input())

c = []
for i in range(0,len(l)-1):
    for j in range(0,len(l)-1):
        c.append(l[i] - l[j])

for i in c:
    if i > k:
        ans = ":("
        break
    else:
        ans = "Yay!"

print(ans)

Submission status: Wrong Answer

Solution code:
l = [int(input()) for _ in range(5)]
k = int(input())

for i in range(0,4):
    for j in range(i,4):
        if abs(l[j] - l [i]) > k:
            ans = ":("
            break
        else:
            ans = "Yay!"
    if ans == ":(":
        break

print(ans)

Submission status: Wrong Answer

Solution code:
a = int(input())
for i in range(4):
    e = int(input())
if e-a <= int(input()):
    print('YaY!')
else:
    print(':(')

Submission status: Wrong Answer

Solution code:
# List = [list(map(int, input().split()))]
# List = [int(input(i)) for i in range(6)]
List = list(int(input()) for i in range(5))
K = int(input())
# print(List)

for j in range(len(List) - 1):
    if(List[j+1] - List[j] < K):
        print("Yay!")
        break
    else:
        print(":(")

Submission status: Wrong Answer

Solution code:
# List = [list(map(int, input().split()))]
# List = [int(input(i)) for i in range(6)]
List = list(int(input()) for i in range(5))
K = int(input())
# print(List)

for j in range(len(List) - 1):
    if(List[j+1] - List[j] < K):
        print("Yay!")
        break
    else:
        print("(:")

Submission status: Wrong Answer

Solution code:
a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())
k = int(input())
ant = [a, b, c, d, e]
t = 0
for i in range(0,4):
    for j in range(i+1,4):
        if ant[j]-ant[i] > k:
            t += 1
        else:
            t += 0

if t>= 1:
    print(":(")
else:
    print("Yay!")

Submission status: Wrong Answer

Solution code:
a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())
k = int(input())
ant = [a, b, c, d, e]
t = 0
for i in range(0,3):
    for j in range(i+1,4):
        if ant[j]-ant[i] > k:
            t += 1
        else:
            t += 0

if t>= 1:
    print(":(")
else:
    print("Yay!")

Submission status: Wrong Answer

Solution code:
l = [int(input()) for _ in range(5)]
print('Yay!' if max(l) - min(l) < int(input()) else ':(')

Submission status: Wrong Answer

Solution code:
a = int(input())
b = input()
c = input()
d = input()
e = int(input())
k = int(input())
if e - a <= k:
    print("Yey!")
else:
    print(":(")

Submission status: Wrong Answer

Solution code:
a=int(input())
b=int(input())
c=int(input())
d=int(input())
e=int(input())
k=int(input())

if max(e-d,d-c,c-b,b-a)>k:
    print(":(")
else:
    print("Yay!")

Submission status: Wrong Answer

Solution code:
x = [int(input()) for _ in range(5)]
k = int(input())
for n in x:
    for v in x:
        if abs(n - v) > k:
            print(':(')
            exit()
print('Yey!')

Submission status: Wrong Answer

Solution code:
x = [int(input()) for _ in range(5)]
k = int(input())
for n in x:
    for v in x:
        if n - v > k:
            print(':(')
            exit()
print('Yey!')

Submission status: Wrong Answer

Solution code:
x = [int(input()) for _ in range(5)]
k = int(input())
l = []
for n in x:
    l.append([n - v for v in x])
print(':(' if max(max(l)) > k else 'Yey!')

Submission status: Wrong Answer

Solution code:
x = [int(input()) for _ in range(5)]
k = int(input())
print(':(' if x[4] - x[0] > k else 'Yey!')

Submission status: Wrong Answer

Solution code:
a, b, c, d, e, k = int(input()), int(input()), int(input()), int(input()), int(input()), int(input())
if e-a<k:
  print("Yay!")
else:
  print(":(")

Submission status: Wrong Answer

Solution code:
a, b, c, d, e, k = int(input()), int(input()), int(input()), int(input()), int(input()), int(input())
if abs(a-b)<k and abs(a-c)<k and abs(a-d)<k and abs(a-e)<k and abs(b-c)<k and abs(b-d)<k and abs(b-e)<k and abs(c-d)<k and abs(c-e)<k and abs(d-e)<k:
  print("Yay!")
else:
  print(":(")