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 :(.

Solution in C (GCC 5.4.1) (judge verdict: Accepted)

#include<stdio.h>

int distanceMeasurement(int x, int y);

int main( void ){
  int a,b,c,d,e,k;
  int distance[11];
  int i;
  int flag;
  const int true=1;
  const int false=0;

  scanf("%d", &a);
  scanf("%d", &b);
  scanf("%d", &c);
  scanf("%d", &d);
  scanf("%d", &e);
  scanf("%d", &k);

  flag = true;
  distance[0] = distanceMeasurement(a, b);
  distance[1] = distanceMeasurement(a, c);
  distance[2] = distanceMeasurement(a, d);
  distance[3] = distanceMeasurement(a, e);
  distance[4] = distanceMeasurement(b, c);
  distance[5] = distanceMeasurement(b, d);
  distance[6] = distanceMeasurement(b, e);
  distance[7] = distanceMeasurement(c, d);
  distance[8] = distanceMeasurement(c, e);
  distance[9] = distanceMeasurement(d, e);

  for(i=0;i<10;i++){
    if(distance[i]>k){
      flag = false;
    }
  }
  if(flag==false){
    printf(":(\n");
  }else{
    printf("Yay!\n");
  }
  return 0;
}

int distanceMeasurement(int x, int y){
  int r = 0;

  r = y - x;
  return r;
}