Search is not available for this dataset
name
stringlengths 2
112
| description
stringlengths 29
13k
| source
int64 1
7
| difficulty
int64 0
25
| solution
stringlengths 7
983k
| language
stringclasses 4
values |
|---|---|---|---|---|---|
p03075 AtCoder Beginner Contest 123 - Five Antennas | 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.
Examples
Input
1
2
4
8
9
15
Output
Yay!
Input
15
18
26
35
36
18
Output
:( | 6 | 0 | import java.util.Scanner;
public class Main {
static Scanner sc = new Scanner(System.in);
public static void main(String[] args) {
int a = sc.nextInt();
int b = sc.nextInt();
int c = sc.nextInt();
int d = sc.nextInt();
int e = sc.nextInt();
int k = sc.nextInt();
if (e-a > k) {
System.out.println(":(");
} else {
System.out.println("Yay!");
}
}
}
| JAVA |
p03075 AtCoder Beginner Contest 123 - Five Antennas | 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.
Examples
Input
1
2
4
8
9
15
Output
Yay!
Input
15
18
26
35
36
18
Output
:( | 6 | 0 | import java.util.*;
public class Main{
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
int a = sc.nextInt();
int b = sc.nextInt();
int c = sc.nextInt();
int d = sc.nextInt();
int e = sc.nextInt();
int k = sc.nextInt();
if(e-a <= k)System.out.println("Yay!");
else System.out.println(":(");
}
}
| JAVA |
p03075 AtCoder Beginner Contest 123 - Five Antennas | 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.
Examples
Input
1
2
4
8
9
15
Output
Yay!
Input
15
18
26
35
36
18
Output
:( | 6 | 0 | import java.util.Scanner;
class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int min = sc.nextInt();
int max = min;
for (int i = 0; i < 4; i++) {
int num = sc.nextInt();
if (num < min) {
min = num;
} else {
if (num > max) {
max = num;
}
}
}
int dif = max - min;
if (dif > sc.nextInt()) {
System.out.println(":(");
} else {
System.out.println("Yay!");
}
sc.close();
}
} | JAVA |
p03075 AtCoder Beginner Contest 123 - Five Antennas | 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.
Examples
Input
1
2
4
8
9
15
Output
Yay!
Input
15
18
26
35
36
18
Output
:( | 6 | 0 | a,*b,e,k = (int(input()) for _ in range(6))
print("Yay!" if e - a <= k else ":(" ) | PYTHON3 |
p03075 AtCoder Beginner Contest 123 - Five Antennas | 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.
Examples
Input
1
2
4
8
9
15
Output
Yay!
Input
15
18
26
35
36
18
Output
:( | 6 | 0 | x = [int(input()) for i in range(6)]
if x[4]-x[0]>x[5]: print(":(")
else: print("Yay!") | PYTHON3 |
p03075 AtCoder Beginner Contest 123 - Five Antennas | 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.
Examples
Input
1
2
4
8
9
15
Output
Yay!
Input
15
18
26
35
36
18
Output
:( | 6 | 0 | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
const int MOD = 1e9+7;
int main(){
int a,b,c,d,e,k; cin>>a>>b>>c>>d>>e>>k;
cout <<(e-a>k?":(":"Yay!")<<endl;
} | CPP |
p03075 AtCoder Beginner Contest 123 - Five Antennas | 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.
Examples
Input
1
2
4
8
9
15
Output
Yay!
Input
15
18
26
35
36
18
Output
:( | 6 | 0 | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int s[] = new int[6];
for(int i = 0; i < 6; i++) {
s[i] = sc.nextInt();
}
if(s[4]-s[0] > s[5]) {
System.out.println(":(");
} else {
System.out.println("Yay!");
}
}
} | JAVA |
p03075 AtCoder Beginner Contest 123 - Five Antennas | 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.
Examples
Input
1
2
4
8
9
15
Output
Yay!
Input
15
18
26
35
36
18
Output
:( | 6 | 0 |
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner sc = new Scanner(System.in);
int a[] = new int[5];
for(int i = 0; i < 5; i++){
a[i] = sc.nextInt();
}
int k = sc.nextInt();
for(int i = 0; i < 5; i++){
for(int j = i + 1; j < 5; j++){
if(a[j] - a[i] > k){
System.out.println(":(");
return;
}
}
}
System.out.println("Yay!");
}
}
| JAVA |
p03075 AtCoder Beginner Contest 123 - Five Antennas | 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.
Examples
Input
1
2
4
8
9
15
Output
Yay!
Input
15
18
26
35
36
18
Output
:( | 6 | 0 | I = [int(input()) for i in range(6)]
print('Yay!' if I[-2] - I[0] <= I[-1] else ':(')
| PYTHON3 |
p03075 AtCoder Beginner Contest 123 - Five Antennas | 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.
Examples
Input
1
2
4
8
9
15
Output
Yay!
Input
15
18
26
35
36
18
Output
:( | 6 | 0 | n=[int(input()) for _ in range(6)];print([':(','Yay!'][n[4]-n[0]<=n[5]]) | PYTHON3 |
p03075 AtCoder Beginner Contest 123 - Five Antennas | 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.
Examples
Input
1
2
4
8
9
15
Output
Yay!
Input
15
18
26
35
36
18
Output
:( | 6 | 0 | a,b,c,d,e,k = [int(input()) for x in range(6)]
if e - a > k:
print(":(")
else:
print("Yay!") | PYTHON3 |
p03075 AtCoder Beginner Contest 123 - Five Antennas | 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.
Examples
Input
1
2
4
8
9
15
Output
Yay!
Input
15
18
26
35
36
18
Output
:( | 6 | 0 | d = [int(input()) for i in range(6)]
print("Yay!" if d[4]-d[0] <= d[5] else ":(") | PYTHON3 |
p03075 AtCoder Beginner Contest 123 - Five Antennas | 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.
Examples
Input
1
2
4
8
9
15
Output
Yay!
Input
15
18
26
35
36
18
Output
:( | 6 | 0 | import java.util.*;
class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int[] a = new int[5];
int k;
for (int i = 0; i < 5; i++) {
a[i] = sc.nextInt();
}
k = sc.nextInt();
if (a[4] - a[0] > k) {
System.out.println(":(");
}
else {
System.out.println("Yay!");
}
}
}
| JAVA |
p03075 AtCoder Beginner Contest 123 - Five Antennas | 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.
Examples
Input
1
2
4
8
9
15
Output
Yay!
Input
15
18
26
35
36
18
Output
:( | 6 | 0 | import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int a = sc.nextInt();
int e = sc.nextInt();
int s = sc.nextInt();
int d = sc.nextInt();
int f = sc.nextInt();
int k = sc.nextInt();
sc.close();
System.out.println(f-a>k ? ":(" : "Yay!");
}
} | JAVA |
p03075 AtCoder Beginner Contest 123 - Five Antennas | 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.
Examples
Input
1
2
4
8
9
15
Output
Yay!
Input
15
18
26
35
36
18
Output
:( | 6 | 0 | import java.util.Scanner;
public class Main {
void run() {
int min = Integer.MAX_VALUE, max = Integer.MIN_VALUE;
Scanner scan = new Scanner(System.in);
for (int i = 0; i < 5; i++) {
int n = scan.nextInt();
max = Math.max(max, n);
min = Math.min(min, n);
}
int k = scan.nextInt();
System.out.println((k >= (max - min) ? "Yay!" : ":("));
}
public static void main(String[] args) {
new Main().run();
}
}
| JAVA |
p03075 AtCoder Beginner Contest 123 - Five Antennas | 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.
Examples
Input
1
2
4
8
9
15
Output
Yay!
Input
15
18
26
35
36
18
Output
:( | 6 | 0 | #include <iostream>
int main() {
using namespace std;
int a, b, c, d, e;
int k;
cin >> a >> b >> c >> d >> e >> k;
cout << ((e - a) > k ? ":(" : "Yay!") << endl;
} | CPP |
p03075 AtCoder Beginner Contest 123 - Five Antennas | 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.
Examples
Input
1
2
4
8
9
15
Output
Yay!
Input
15
18
26
35
36
18
Output
:( | 6 | 0 | a,b,c,d,e,k=(int(input())for _ in range(6))
print('Y:a(y !'[e-a>k::2]) | PYTHON3 |
p03075 AtCoder Beginner Contest 123 - Five Antennas | 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.
Examples
Input
1
2
4
8
9
15
Output
Yay!
Input
15
18
26
35
36
18
Output
:( | 6 | 0 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
if (e-a<=k) cout << "Yay!";
else cout << ":(";
return 0;
} | CPP |
p03075 AtCoder Beginner Contest 123 - Five Antennas | 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.
Examples
Input
1
2
4
8
9
15
Output
Yay!
Input
15
18
26
35
36
18
Output
:( | 6 | 0 | #include <iostream>
using namespace std;
signed main() {
int a, b, c; cin >> a >> b >> b >> b >> b >> c;
cout << (b - c <= a ? "Yay!\n" : ":(\n");
} | CPP |
p03075 AtCoder Beginner Contest 123 - Five Antennas | 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.
Examples
Input
1
2
4
8
9
15
Output
Yay!
Input
15
18
26
35
36
18
Output
:( | 6 | 0 | data = [int(input()) for i in range(6)]
print('Yay!' if data[-2] - data[0] <= data[-1] else ':(') | PYTHON3 |
p03075 AtCoder Beginner Contest 123 - Five Antennas | 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.
Examples
Input
1
2
4
8
9
15
Output
Yay!
Input
15
18
26
35
36
18
Output
:( | 6 | 0 | ans = [int(input()) for _ in range(6)]
print(':(' if abs(ans[0]-ans[4]) > ans[-1] else 'Yay!') | PYTHON3 |
p03075 AtCoder Beginner Contest 123 - Five Antennas | 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.
Examples
Input
1
2
4
8
9
15
Output
Yay!
Input
15
18
26
35
36
18
Output
:( | 6 | 0 | import java.util.Scanner;
public class Main {
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
int a = sc.nextInt();
int b = sc.nextInt();
int c = sc.nextInt();
int d = sc.nextInt();
int e = sc.nextInt();
int k = sc.nextInt();
if (e - a > k) {
System.out.println(":(");
} else {
System.out.println("Yay!");
}
}
} | JAVA |
p03075 AtCoder Beginner Contest 123 - Five Antennas | 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.
Examples
Input
1
2
4
8
9
15
Output
Yay!
Input
15
18
26
35
36
18
Output
:( | 6 | 0 | import java.util.*;
class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int a=sc.nextInt();
int b=sc.nextInt();
int c=sc.nextInt();
int d=sc.nextInt();
int e=sc.nextInt();
int k=sc.nextInt();
if(e-a<=k){
System.out.print("Yay!");
}else{
System.out.print(":(");
}
}
} | JAVA |
p03075 AtCoder Beginner Contest 123 - Five Antennas | 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.
Examples
Input
1
2
4
8
9
15
Output
Yay!
Input
15
18
26
35
36
18
Output
:( | 6 | 0 | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int a = sc.nextInt();
int B = sc.nextInt();
int C = sc.nextInt();
int D = sc.nextInt();
int e = sc.nextInt();
int k = sc.nextInt();
System.out.println(k>=e-a ? "Yay!" : ":(");
}
} | JAVA |
p03075 AtCoder Beginner Contest 123 - Five Antennas | 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.
Examples
Input
1
2
4
8
9
15
Output
Yay!
Input
15
18
26
35
36
18
Output
:( | 6 | 0 | n=[int(input()) for _ in range(6)];print([':(','Yay!'][max(n[:5])-min(n[:5])<=n[5]]) | PYTHON3 |
p03075 AtCoder Beginner Contest 123 - Five Antennas | 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.
Examples
Input
1
2
4
8
9
15
Output
Yay!
Input
15
18
26
35
36
18
Output
:( | 6 | 0 | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int a = scan.nextInt();
int b = scan.nextInt();
int c = scan.nextInt();
int d = scan.nextInt();
int e = scan.nextInt();
int k = scan.nextInt();
if (e-a<=k) System.out.println("Yay!");
else System.out.println(":(");
}
} | JAVA |
p03075 AtCoder Beginner Contest 123 - Five Antennas | 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.
Examples
Input
1
2
4
8
9
15
Output
Yay!
Input
15
18
26
35
36
18
Output
:( | 6 | 0 | A = [int(input()) for _ in range(6)]
print([":(", "Yay!"][A[4]-A[0] <= A[5]]) | PYTHON3 |
p03075 AtCoder Beginner Contest 123 - Five Antennas | 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.
Examples
Input
1
2
4
8
9
15
Output
Yay!
Input
15
18
26
35
36
18
Output
:( | 6 | 0 | #include <iostream>
using namespace std;
int main(){
int a,b,c,d,e,k; cin>>a>>b>>c>>d>>e>>k;
printf(e-a-k>0 ? ":(\n" : "Yay!\n");
} | CPP |
p03075 AtCoder Beginner Contest 123 - Five Antennas | 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.
Examples
Input
1
2
4
8
9
15
Output
Yay!
Input
15
18
26
35
36
18
Output
:( | 6 | 0 | a = input()
b = input()
c = input()
d = input()
e = input()
f = input()
x = e - a
if f < x:
print ":("
else:
print "Yay!" | PYTHON |
p03075 AtCoder Beginner Contest 123 - Five Antennas | 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.
Examples
Input
1
2
4
8
9
15
Output
Yay!
Input
15
18
26
35
36
18
Output
:( | 6 | 0 | import java.util.ArrayList;
import java.util.Scanner;
public class Main {
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
int n = 5;
int na[] = new int[n];
for (int i = 0; i < n; i++)
{
na[i] = sc.nextInt();
}
int k = sc.nextInt();
if (na[4] - na[0] > k)
{
System.out.println(":(");
}
else
{
System.out.println("Yay!");
}
}
} | JAVA |
p03075 AtCoder Beginner Contest 123 - Five Antennas | 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.
Examples
Input
1
2
4
8
9
15
Output
Yay!
Input
15
18
26
35
36
18
Output
:( | 6 | 0 | #include <bits/stdc++.h>
using namespace std;
int main(){
int a, b, c, d, e, k; cin >> a >> b >> c >> d >> e >> k;
if(e-a <= k) cout << "Yay!";
else cout << ":(";
} | CPP |
p03075 AtCoder Beginner Contest 123 - Five Antennas | 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.
Examples
Input
1
2
4
8
9
15
Output
Yay!
Input
15
18
26
35
36
18
Output
:( | 6 | 0 | a=list(map(int,open(0)));print(["Yay!",":("][max(a[:5])-min(a[:5])>a[5]]) | PYTHON3 |
p03075 AtCoder Beginner Contest 123 - Five Antennas | 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.
Examples
Input
1
2
4
8
9
15
Output
Yay!
Input
15
18
26
35
36
18
Output
:( | 6 | 0 | #include<iostream>
using namespace std;
int main(){
int A,B,C,D,E;
cin>>A>>B>>C>>D>>E;
int k;
cin>>k;
if(E-A<=k)cout<<"Yay!"<<endl;
else cout<<":("<<endl;
}
| CPP |
p03075 AtCoder Beginner Contest 123 - Five Antennas | 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.
Examples
Input
1
2
4
8
9
15
Output
Yay!
Input
15
18
26
35
36
18
Output
:( | 6 | 0 | s=[int(input()) for _ in range(6)]
print(':(') if s[4]-s[0]>s[5] else print('Yay!')
| PYTHON3 |
p03075 AtCoder Beginner Contest 123 - Five Antennas | 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.
Examples
Input
1
2
4
8
9
15
Output
Yay!
Input
15
18
26
35
36
18
Output
:( | 6 | 0 | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int[] a = new int[6];
for (int i = 0; i < 6; i++) {
a[i] = sc.nextInt();
}
boolean s = true;
for (int i = 0; i < 6; i++) {
for (int j = i; j < 6; j++) {
if (a[5] < Math.abs(a[i] - a[j])) {
s = false;
break;
}
}
}
System.out.println((s) ? "Yay!" : ":(");
}
}
| JAVA |
p03075 AtCoder Beginner Contest 123 - Five Antennas | 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.
Examples
Input
1
2
4
8
9
15
Output
Yay!
Input
15
18
26
35
36
18
Output
:( | 6 | 0 | da=[int(input()) for i in range(6)]
if da[4]-da[0]<=da[5]:
print('Yay!')
else:
print(':(') | PYTHON3 |
p03075 AtCoder Beginner Contest 123 - Five Antennas | 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.
Examples
Input
1
2
4
8
9
15
Output
Yay!
Input
15
18
26
35
36
18
Output
:( | 6 | 0 | import java.util.Scanner;
class Main {
private static Scanner sc = new Scanner(System.in);
public static void main(String[] args) {
int a = sc.nextInt();
int b = sc.nextInt();
int c = sc.nextInt();
int d = sc.nextInt();
int e = sc.nextInt();
String result = (e-a <= sc.nextInt()) ? "Yay!" : ":(";
System.out.println(result);
}
} | JAVA |
p03075 AtCoder Beginner Contest 123 - Five Antennas | 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.
Examples
Input
1
2
4
8
9
15
Output
Yay!
Input
15
18
26
35
36
18
Output
:( | 6 | 0 | ais = [int(raw_input()) for _ in range(5)]
k = int(raw_input())
print ':(' if ais[0] + k < ais[-1] else 'Yay!' | PYTHON |
p03075 AtCoder Beginner Contest 123 - Five Antennas | 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.
Examples
Input
1
2
4
8
9
15
Output
Yay!
Input
15
18
26
35
36
18
Output
:( | 6 | 0 | import java.util.Scanner;
public class Main {
public static final String OK = "Yay!";
public static final String NO = ":(";
public static void main(final String[] args) {
Scanner sc = new Scanner(System.in);
int a = sc.nextInt();
int b = sc.nextInt();
int c = sc.nextInt();
int d = sc.nextInt();
int e = sc.nextInt();
int k = sc.nextInt();
sc.close();
if(e - a > k) System.out.println(NO);
else System.out.println(OK);
}
} | JAVA |
p03075 AtCoder Beginner Contest 123 - Five Antennas | 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.
Examples
Input
1
2
4
8
9
15
Output
Yay!
Input
15
18
26
35
36
18
Output
:( | 6 | 0 | a = [int(input()) for i in range(6)]
print('Yay!' if a[4]-a[0] <= a[5] else ":(") | PYTHON3 |
p03075 AtCoder Beginner Contest 123 - Five Antennas | 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.
Examples
Input
1
2
4
8
9
15
Output
Yay!
Input
15
18
26
35
36
18
Output
:( | 6 | 0 | import java.util.*;
public class Main {
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
int a[] = new int[5];
for (int i = 0; i < 5; i++) {
a[i] = sc.nextInt();
}
int k = sc.nextInt();
int judge = 1;
for (int i = 0; i < 4; i++) {
for (int j = i+1; j < 5; j++) {
if (a[j] - a[i] > k) {
judge--;
}
}
}
if (judge == 1) {
System.out.println("Yay!");
} else {
System.out.println(":(");
}
}
} | JAVA |
p03075 AtCoder Beginner Contest 123 - Five Antennas | 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.
Examples
Input
1
2
4
8
9
15
Output
Yay!
Input
15
18
26
35
36
18
Output
:( | 6 | 0 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A,B,C,D,E,k;
cin>>A>>B>>C>>D>>E>>k;
if(E-A >k){
cout<<":("<<endl;
}
else{
cout<<"Yay!"<<endl;
}
}
| CPP |
p03075 AtCoder Beginner Contest 123 - Five Antennas | 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.
Examples
Input
1
2
4
8
9
15
Output
Yay!
Input
15
18
26
35
36
18
Output
:( | 6 | 0 | a = [int(input()) for i in range(6)]
if a[4]-a[0]<=a[5]:
print("Yay!")
else:
print(":(") | PYTHON3 |
p03075 AtCoder Beginner Contest 123 - Five Antennas | 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.
Examples
Input
1
2
4
8
9
15
Output
Yay!
Input
15
18
26
35
36
18
Output
:( | 6 | 0 | a=[int(input()) for i in range(5)]
k=int(input())
print(':(' if max(a)-min(a)>k else 'Yay!') | PYTHON3 |
p03075 AtCoder Beginner Contest 123 - Five Antennas | 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.
Examples
Input
1
2
4
8
9
15
Output
Yay!
Input
15
18
26
35
36
18
Output
:( | 6 | 0 | ls = [int(input()) for i in range(6)]
if ls[4]-ls[0] <= ls[5]:
print("Yay!")
else:
print(":(") | PYTHON3 |
p03075 AtCoder Beginner Contest 123 - Five Antennas | 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.
Examples
Input
1
2
4
8
9
15
Output
Yay!
Input
15
18
26
35
36
18
Output
:( | 6 | 0 | #import<iostream>
int main(){int a,b,c,d,e,k;std::cin>>a>>b>>c>>d>>e>>k;std::cout<<(e-a>k?":(":"Yay!");} | CPP |
p03075 AtCoder Beginner Contest 123 - Five Antennas | 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.
Examples
Input
1
2
4
8
9
15
Output
Yay!
Input
15
18
26
35
36
18
Output
:( | 6 | 0 | #include <bits/stdc++.h>
using namespace std;
signed main(){
int a,b,c,d,e,t;
cin>>a>>b>>c>>d>>e>>t;
if(e-a<=t)
cout<<"Yay!"<<endl;
else
cout<<":("<<endl;
return(0);
}
| CPP |
p03075 AtCoder Beginner Contest 123 - Five Antennas | 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.
Examples
Input
1
2
4
8
9
15
Output
Yay!
Input
15
18
26
35
36
18
Output
:( | 6 | 0 | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
byte a = scanner.nextByte();
scanner.nextByte();
scanner.nextByte();
scanner.nextByte();
byte e = scanner.nextByte();
byte k = scanner.nextByte();
if (e-a>k) System.out.println(":(");
else System.out.println("Yay!");
}
} | JAVA |
p03075 AtCoder Beginner Contest 123 - Five Antennas | 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.
Examples
Input
1
2
4
8
9
15
Output
Yay!
Input
15
18
26
35
36
18
Output
:( | 6 | 0 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a,b,c,d,e,k;
cin>>a>>b>>c>>d>>e>>k;
cout<<(e-a<=k?"Yay!":":(");
}
| CPP |
p03075 AtCoder Beginner Contest 123 - Five Antennas | 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.
Examples
Input
1
2
4
8
9
15
Output
Yay!
Input
15
18
26
35
36
18
Output
:( | 6 | 0 | # TODO A - Five Antennas
# https://atcoder.jp/contests/abc123/tasks/abc123_a
a = input()
b = input()
c = input()
d = input()
e = input()
k = input()
print 'Yay!' if (e-a) <= k else ':(' | PYTHON |
p03075 AtCoder Beginner Contest 123 - Five Antennas | 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.
Examples
Input
1
2
4
8
9
15
Output
Yay!
Input
15
18
26
35
36
18
Output
:( | 6 | 0 | import java.util.*;
class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
System.out.println(-sc.nextInt()+(sc.nextInt()+sc.nextInt()+sc.nextInt())*0+sc.nextInt()>sc.nextInt()?":(":"Yay!");
}
} | JAVA |
p03075 AtCoder Beginner Contest 123 - Five Antennas | 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.
Examples
Input
1
2
4
8
9
15
Output
Yay!
Input
15
18
26
35
36
18
Output
:( | 6 | 0 | l=list(int(input()) for _ in range(5))
print("Yay!" if max(l)-min(l)<=int(input()) else ":(")
| PYTHON3 |
p03075 AtCoder Beginner Contest 123 - Five Antennas | 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.
Examples
Input
1
2
4
8
9
15
Output
Yay!
Input
15
18
26
35
36
18
Output
:( | 6 | 0 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e, k; cin >> a >> b >> c >> d >> e >> k;
cout << (((e - a) > k) ? ":(" : "Yay!") << endl;
} | CPP |
p03075 AtCoder Beginner Contest 123 - Five Antennas | 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.
Examples
Input
1
2
4
8
9
15
Output
Yay!
Input
15
18
26
35
36
18
Output
:( | 6 | 0 | import java.util.*;
class Main{
public static void main(String[] args){
Scanner sc=new Scanner(System.in);
int a=sc.nextInt();sc.nextInt();sc.nextInt();sc.nextInt();
System.out.println(sc.nextInt()-a>sc.nextInt()?":(":"Yay!");
}
}
| JAVA |
p03075 AtCoder Beginner Contest 123 - Five Antennas | 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.
Examples
Input
1
2
4
8
9
15
Output
Yay!
Input
15
18
26
35
36
18
Output
:( | 6 | 0 | import java.util.Scanner;
public class Main{
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
int max = 0;
int min = 124;
for(int i = 0; i < 5; i++){
int antena = sc.nextInt();
if(antena > max){
max = antena;
}
if(antena < min){
min = antena;
}
}
int k = sc.nextInt();
if(max - min <= k){
System.out.println("Yay!");
}else{
System.out.println(":(");
}
}
} | JAVA |
p03075 AtCoder Beginner Contest 123 - Five Antennas | 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.
Examples
Input
1
2
4
8
9
15
Output
Yay!
Input
15
18
26
35
36
18
Output
:( | 6 | 0 | l = [int(input()) for _ in range(5)]
k = int(input())
print("Yay!" if max(l)-min(l)<=k else ":(") | PYTHON3 |
p03075 AtCoder Beginner Contest 123 - Five Antennas | 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.
Examples
Input
1
2
4
8
9
15
Output
Yay!
Input
15
18
26
35
36
18
Output
:( | 6 | 0 | #include<bits/stdc++.h>
using namespace std;
int main(void){
int x[5];
for(int i=0;i<5;i++)
cin>>x[i];
int k;cin>>k;
sort(x,x+5);
cout<<((x[4]-x[0])>k?":(":"Yay!")<<endl;
return 0;}
| CPP |
p03075 AtCoder Beginner Contest 123 - Five Antennas | 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.
Examples
Input
1
2
4
8
9
15
Output
Yay!
Input
15
18
26
35
36
18
Output
:( | 6 | 0 | #include <bits/stdc++.h>
using namespace std;
int main(){
int a,b,c,d,e,k;
int s[55];
cin>>a>>b>>c>>d>>e>>k;
if(e-a<=k)cout<<"Yay!";
else cout<<":(";
} | CPP |
p03075 AtCoder Beginner Contest 123 - Five Antennas | 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.
Examples
Input
1
2
4
8
9
15
Output
Yay!
Input
15
18
26
35
36
18
Output
:( | 6 | 0 | #include <cstdio>
int main() {
int a, b, c, d, e, k;
scanf("%d%d%d%d%d%d", &a, &b, &c, &d, &e, &k);
if(e - a > k) printf(":(\n");
else printf("Yay!\n");
return 0;
} | CPP |
p03075 AtCoder Beginner Contest 123 - Five Antennas | 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.
Examples
Input
1
2
4
8
9
15
Output
Yay!
Input
15
18
26
35
36
18
Output
:( | 6 | 0 | #include<iostream>
int main(){
int a,b,c,d,e,k;
std::cin >> a >> b >> c >> d >> e >> k;
if(e-a <= k)std::cout<<"Yay!";
else std::cout<<":(";
} | CPP |
p03075 AtCoder Beginner Contest 123 - Five Antennas | 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.
Examples
Input
1
2
4
8
9
15
Output
Yay!
Input
15
18
26
35
36
18
Output
:( | 6 | 0 | import java.util.*;
import java.io.*;
class Main {
void solve () {
int a = in.nextInt(), b = in.nextInt(), c = in.nextInt(), d = in.nextInt(), e = in.nextInt();
int k = in.nextInt();
out.println(e-a<=k ? "Yay!" : ":(");
}
public static Scanner in = new Scanner(System.in);
public static PrintWriter out = new PrintWriter(System.out);
public static void main(String[] args) {
new Main().solve();
out.flush();
}
} | JAVA |
p03075 AtCoder Beginner Contest 123 - Five Antennas | 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.
Examples
Input
1
2
4
8
9
15
Output
Yay!
Input
15
18
26
35
36
18
Output
:( | 6 | 0 | a,b,c,d,e,k=[int(input()) for i in range(6)]
m=e-a
if m<=k:
print("Yay!")
else:
print(":(") | PYTHON3 |
p03075 AtCoder Beginner Contest 123 - Five Antennas | 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.
Examples
Input
1
2
4
8
9
15
Output
Yay!
Input
15
18
26
35
36
18
Output
:( | 6 | 0 |
import java.io.*;
import java.text.*;
import java.util.*;
public class Main {
static Scanner sc = new Scanner(System.in);
public static void main(String[] args) {
int array[]= new int[5];
String msg = "Yay!";
for (int i = 0; i < 5; i++) {
array[i] =sc.nextInt();
}
int tag = sc.nextInt();
Arrays.sort(array);
if (array[4] - array[0] > tag) {
msg = ":(";
}
System.out.println(msg);
}
} | JAVA |
p03075 AtCoder Beginner Contest 123 - Five Antennas | 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.
Examples
Input
1
2
4
8
9
15
Output
Yay!
Input
15
18
26
35
36
18
Output
:( | 6 | 0 |
lst = list(int(input()) for _ in range(6))
print("Yay!" if lst[4] - lst[0] <= lst[5] else ":(") | PYTHON3 |
p03075 AtCoder Beginner Contest 123 - Five Antennas | 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.
Examples
Input
1
2
4
8
9
15
Output
Yay!
Input
15
18
26
35
36
18
Output
:( | 6 | 0 | dists = [int(raw_input()) for i in range(6)]
print "Yay!" if dists[4] - dists[0] <= dists[5] else ":(" | PYTHON |
p03075 AtCoder Beginner Contest 123 - Five Antennas | 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.
Examples
Input
1
2
4
8
9
15
Output
Yay!
Input
15
18
26
35
36
18
Output
:( | 6 | 0 | a, b, c, d, e, k = list(int(input()) for _ in range(6))
print(':(' if (e - a) > k else 'Yay!') | PYTHON3 |
p03075 AtCoder Beginner Contest 123 - Five Antennas | 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.
Examples
Input
1
2
4
8
9
15
Output
Yay!
Input
15
18
26
35
36
18
Output
:( | 6 | 0 | a=list(int(input()) for _ in range(5))
k=int(input())
print(":(" if a[4]-a[0]>k else "Yay!") | PYTHON3 |
p03075 AtCoder Beginner Contest 123 - Five Antennas | 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.
Examples
Input
1
2
4
8
9
15
Output
Yay!
Input
15
18
26
35
36
18
Output
:( | 6 | 0 | a,*_,e,k=eval('int(input()),'*6);print('Y:a(y !'[e-a>k::2]) | PYTHON3 |
p03075 AtCoder Beginner Contest 123 - Five Antennas | 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.
Examples
Input
1
2
4
8
9
15
Output
Yay!
Input
15
18
26
35
36
18
Output
:( | 6 | 0 | import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int[] A = new int[5];
for (int i = 0; i < 5; i++) {
A[i] = sc.nextInt();
}
int k = sc.nextInt();
int max = A[4] - A[0];
if (max <= k) System.out.println("Yay!");
else System.out.println(":(");
sc.close();
}
} | JAVA |
p03075 AtCoder Beginner Contest 123 - Five Antennas | 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.
Examples
Input
1
2
4
8
9
15
Output
Yay!
Input
15
18
26
35
36
18
Output
:( | 6 | 0 | import java.util.Scanner;
public class Main{
public static void main(String[]args){
Scanner sc=new Scanner(System.in);
int a[]=new int[5];
for(int s=0;s<5;s++){
a[s]=sc.nextInt();
}
int count=0;
int k=sc.nextInt();
for(int s=0;s<4;s++){
for(int l=s+1;l<5;l++){
if(a[l]-a[s]>k){
count++;
}
}
}
if(count>0){
System.out.println(":(");
}else{
System.out.println("Yay!");
}
}
} | JAVA |
p03075 AtCoder Beginner Contest 123 - Five Antennas | 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.
Examples
Input
1
2
4
8
9
15
Output
Yay!
Input
15
18
26
35
36
18
Output
:( | 6 | 0 | l=[int(input()) for i in range(6)]
if l[4]-l[0] <=l[5]:
print('Yay!')
else:
print(':(') | PYTHON3 |
p03075 AtCoder Beginner Contest 123 - Five Antennas | 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.
Examples
Input
1
2
4
8
9
15
Output
Yay!
Input
15
18
26
35
36
18
Output
:( | 6 | 0 | #include <iostream>
using namespace std;
int main(){
int a,b,c,d,e,k;
cin >> a >> b >> c >> d >> e >> k;
if((e-a)>k)
cout << ":(";
else
cout << "Yay!";
} | CPP |
p03075 AtCoder Beginner Contest 123 - Five Antennas | 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.
Examples
Input
1
2
4
8
9
15
Output
Yay!
Input
15
18
26
35
36
18
Output
:( | 6 | 0 | A=[input() for i in range(6)]
if int(A[4])-int(A[0])>int(A[5]):
print(":(")
else:
print("Yay!") | PYTHON3 |
p03075 AtCoder Beginner Contest 123 - Five Antennas | 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.
Examples
Input
1
2
4
8
9
15
Output
Yay!
Input
15
18
26
35
36
18
Output
:( | 6 | 0 | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int a = scan.nextInt();
int b = scan.nextInt();
int c = scan.nextInt();
int d = scan.nextInt();
int e = scan.nextInt();
int k = scan.nextInt();
if (e - a > k || d - a > k || c - a > k || b - a > k) {
System.out.println(":(");
return;
}
System.out.println("Yay!");
}
}
| JAVA |
p03075 AtCoder Beginner Contest 123 - Five Antennas | 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.
Examples
Input
1
2
4
8
9
15
Output
Yay!
Input
15
18
26
35
36
18
Output
:( | 6 | 0 | import java.util.*;
class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int minNum = sc.nextInt();
sc.nextInt();
sc.nextInt();
sc.nextInt();
int maxNum = sc.nextInt();
int limit = sc.nextInt();
String ans;
if(maxNum - minNum > limit){
ans = ":(";
}else{
ans = "Yay!";
}
System.out.println(ans);
}
} | JAVA |
p03075 AtCoder Beginner Contest 123 - Five Antennas | 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.
Examples
Input
1
2
4
8
9
15
Output
Yay!
Input
15
18
26
35
36
18
Output
:( | 6 | 0 | #include <iostream>
int main(){
int a, b, c, d, e;
std::cin >> a >> b >> c >> d >> e;
int k;
std::cin >> k;
std::cout << (e - a <= k ? "Yay!" : ":(") << std::endl;
return 0;
}
| CPP |
p03075 AtCoder Beginner Contest 123 - Five Antennas | 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.
Examples
Input
1
2
4
8
9
15
Output
Yay!
Input
15
18
26
35
36
18
Output
:( | 6 | 0 | #include<iostream>
using namespace std;
int main(){
int a,b,c,d,e;
int k;
cin>>a>>b>>c>>d>>e;
cin>>k;
if(e-a<=k) cout<<"Yay!"<<endl;
else cout<<":("<<endl;
}
| CPP |
p03075 AtCoder Beginner Contest 123 - Five Antennas | 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.
Examples
Input
1
2
4
8
9
15
Output
Yay!
Input
15
18
26
35
36
18
Output
:( | 6 | 0 | import java.util.Scanner;
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int[] a = new int[5];
for (int i = 0; i < 5; i++) {
a[i] = sc.nextInt();
}
int k = sc.nextInt();
System.out.println((a[4]-a[0]<=k)?"Yay!":":(");
sc.close();
}
} | JAVA |
p03075 AtCoder Beginner Contest 123 - Five Antennas | 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.
Examples
Input
1
2
4
8
9
15
Output
Yay!
Input
15
18
26
35
36
18
Output
:( | 6 | 0 | #include <bits/stdc++.h>
using namespace std;
int main()
{
int a,b,c,d,e,k;
cin>>a>>b>>c>>d>>e>>k;
if((e-a)<= k)
cout<<"Yay!";
else
cout<<":(";
return 0;
} | CPP |
p03075 AtCoder Beginner Contest 123 - Five Antennas | 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.
Examples
Input
1
2
4
8
9
15
Output
Yay!
Input
15
18
26
35
36
18
Output
:( | 6 | 0 | # input
listA = []
while True:
try:
listA.append(int(raw_input()))
except:
break;
a = listA[0]
b = listA[1]
c = listA[2]
d = listA[3]
e = listA[4]
k = listA[5]
if (b-a <= k) and (c-a <= k) and (d-a <= k) and (e-a <= k) \
and (c-b <= k) and (d-b <= k) and (e-b <= k) \
and (e-c <= k) and (d-c <= k) \
and (e-d <= k):
print 'Yay!'
else:
print ':('
| PYTHON |
p03075 AtCoder Beginner Contest 123 - Five Antennas | 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.
Examples
Input
1
2
4
8
9
15
Output
Yay!
Input
15
18
26
35
36
18
Output
:( | 6 | 0 | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int a = scanner.nextInt();
int b = scanner.nextInt();
int c = scanner.nextInt();
int d = scanner.nextInt();
int e = scanner.nextInt();
int k = scanner.nextInt();
if(e - a > k) {
System.out.println(":(");
} else {
System.out.println("Yay!");
}
scanner.close();
}
} | JAVA |
p03075 AtCoder Beginner Contest 123 - Five Antennas | 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.
Examples
Input
1
2
4
8
9
15
Output
Yay!
Input
15
18
26
35
36
18
Output
:( | 6 | 0 | #include <iostream>
using namespace std;int main(){int a,b,c, d, e, k;cin >> a >> b >> c >> d >> e >> k;cout <<((e-a <= k)?"Yay!":":(") << endl;} | CPP |
p03075 AtCoder Beginner Contest 123 - Five Antennas | 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.
Examples
Input
1
2
4
8
9
15
Output
Yay!
Input
15
18
26
35
36
18
Output
:( | 6 | 0 |
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int[] array = new int[6];
for(int i =0; i < array.length; i++)
array[i] = sc.nextInt();
for(int i = 0; i < 5; i++) {
for(int j = i+1; j < 5; j++) {
if(array[j] - array[i] > array[array.length-1]) {
System.out.println(":(");
return;
}
}
}
System.out.println("Yay!");
}
} | JAVA |
p03075 AtCoder Beginner Contest 123 - Five Antennas | 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.
Examples
Input
1
2
4
8
9
15
Output
Yay!
Input
15
18
26
35
36
18
Output
:( | 6 | 0 | a,b,c,d,e,k = map(int,[input() for i in range(6)])
if (e-a)>k:print(":(")
else:print("Yay!") | PYTHON3 |
p03075 AtCoder Beginner Contest 123 - Five Antennas | 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.
Examples
Input
1
2
4
8
9
15
Output
Yay!
Input
15
18
26
35
36
18
Output
:( | 6 | 0 | #include <iostream>
using namespace std;
int main() {
int a,e,k;
cin>>a>>e>>e>>e>>e>>k;
cout<<(e-a>k?":(":"Yay!")<<endl;
}
| CPP |
p03075 AtCoder Beginner Contest 123 - Five Antennas | 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.
Examples
Input
1
2
4
8
9
15
Output
Yay!
Input
15
18
26
35
36
18
Output
:( | 6 | 0 | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int INF = 1<<30;
int main(){
int a, b, c, k;cin>>a>>c>>c>>c>>b>>k;
cout<<(b-a<=k?"Yay!":":(")<<endl;
} | CPP |
p03075 AtCoder Beginner Contest 123 - Five Antennas | 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.
Examples
Input
1
2
4
8
9
15
Output
Yay!
Input
15
18
26
35
36
18
Output
:( | 6 | 0 | #include <iostream>
int main(void){
int a,b,c,d,e,k;
std::cin >> a >> b >> c >> d >> e >> k;
if(e - a <= k) std::cout << "Yay!";
else std::cout << ":(";
return 0;
}
| CPP |
p03075 AtCoder Beginner Contest 123 - Five Antennas | 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.
Examples
Input
1
2
4
8
9
15
Output
Yay!
Input
15
18
26
35
36
18
Output
:( | 6 | 0 | import java.util.*;
public class Main{
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
int current = sc.nextInt();
int mini = current,maxi = current,distance = 0;
do{
int res = Math.max(Math.abs(current - mini), Math.abs(current - maxi));
if(res > distance){distance = res;}
current = sc.nextInt();
}while(sc.hasNext());
if(distance > current){System.out.println(":(");}
else{System.out.println("Yay!");}
}
} | JAVA |
p03075 AtCoder Beginner Contest 123 - Five Antennas | 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.
Examples
Input
1
2
4
8
9
15
Output
Yay!
Input
15
18
26
35
36
18
Output
:( | 6 | 0 | import java.util.*;
public class Main{
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
int[] x = new int[6];
for(int i=0; i<6; i++){
x[i] = sc.nextInt();
}
if(x[4]-x[0]<=x[5]){
System.out.println("Yay!");
}else{
System.out.println(":(");
}
}
} | JAVA |
p03075 AtCoder Beginner Contest 123 - Five Antennas | 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.
Examples
Input
1
2
4
8
9
15
Output
Yay!
Input
15
18
26
35
36
18
Output
:( | 6 | 0 | a=[0,0,0,0,0,0]
for i in range(6):
a[i]=int(input())
print('Yay!' if (a[4]-a[0])<=a[5] else ':(') | PYTHON3 |
p03075 AtCoder Beginner Contest 123 - Five Antennas | 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.
Examples
Input
1
2
4
8
9
15
Output
Yay!
Input
15
18
26
35
36
18
Output
:( | 6 | 0 | import sys
A = list()
for i in xrange(5):
A.append(int(raw_input()))
k = int(raw_input())
flag = False
for i in xrange(4):
for j in range(i+1, 5, 1):
if A[j] - A[i] > k:
flag = True
if flag: print ':('
else: print 'Yay!'
| PYTHON |
p03075 AtCoder Beginner Contest 123 - Five Antennas | 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.
Examples
Input
1
2
4
8
9
15
Output
Yay!
Input
15
18
26
35
36
18
Output
:( | 6 | 0 | import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner s = new Scanner(System.in);
int min = s.nextInt();
s.nextInt();
s.nextInt();
s.nextInt();
int max = s.nextInt();
int k = s.nextInt();
System.out.println(max - min <= k ? "Yay!" : ":(");
}
}
| JAVA |
p03075 AtCoder Beginner Contest 123 - Five Antennas | 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.
Examples
Input
1
2
4
8
9
15
Output
Yay!
Input
15
18
26
35
36
18
Output
:( | 6 | 0 | a,b,c,d,e,f=map(int,open(0).readlines())
print(":("if e-a>f else"Yay!") | PYTHON3 |
p03075 AtCoder Beginner Contest 123 - Five Antennas | 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.
Examples
Input
1
2
4
8
9
15
Output
Yay!
Input
15
18
26
35
36
18
Output
:( | 6 | 0 | l=[int(input())for _ in range(6)];print(":("if l[4]-l[0]>l[5]else"Yay!") | PYTHON3 |
p03075 AtCoder Beginner Contest 123 - Five Antennas | 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.
Examples
Input
1
2
4
8
9
15
Output
Yay!
Input
15
18
26
35
36
18
Output
:( | 6 | 0 | A = [int(input()) for _ in range(5)]
K = int(input())
print('Yay!' if A[4] - A[0] <= K else ':(')
| PYTHON3 |
p03075 AtCoder Beginner Contest 123 - Five Antennas | 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.
Examples
Input
1
2
4
8
9
15
Output
Yay!
Input
15
18
26
35
36
18
Output
:( | 6 | 0 | a = input()
b = input()
c = input()
d = input()
e = input()
k = input()
if e - a <= k:
print "Yay!"
else:
print ":("
| PYTHON |
p03075 AtCoder Beginner Contest 123 - Five Antennas | 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.
Examples
Input
1
2
4
8
9
15
Output
Yay!
Input
15
18
26
35
36
18
Output
:( | 6 | 0 | #include <bits/stdc++.h>
using namespace std;
int main()
{
int a[5], k;
for(auto&& i : a)
{
cin >> i;
}
cin >> k;
cout << (a[4] - a[0] <= k ? "Yay!" : ":(") << "\n";
}
| CPP |
p03075 AtCoder Beginner Contest 123 - Five Antennas | 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.
Examples
Input
1
2
4
8
9
15
Output
Yay!
Input
15
18
26
35
36
18
Output
:( | 6 | 0 | #include<iostream>
using namespace std;
int main(){
int a[4],b,c,d,e,k;
for(int i=0;i<5;i++)cin>>a[i];
cin>>k;
if(a[4]-a[0]<=k)cout<<"Yay!"<<endl;
else cout<<":("<<endl;
} | CPP |
p03075 AtCoder Beginner Contest 123 - Five Antennas | 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.
Examples
Input
1
2
4
8
9
15
Output
Yay!
Input
15
18
26
35
36
18
Output
:( | 6 | 0 | #include <iostream>
using namespace std;
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
cout << (e - a <= k ? "Yay!" : ":(") << '\n';
} | CPP |
p03075 AtCoder Beginner Contest 123 - Five Antennas | 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.
Examples
Input
1
2
4
8
9
15
Output
Yay!
Input
15
18
26
35
36
18
Output
:( | 6 | 0 | #include<bits/stdc++.h>
using namespace std;int main(){int a,b,k;cin >> a ;for(int i=0;i<4;i++)cin>>b;cin>>k;if(b-a<=k)cout<<"Yay!"<<endl;else cout<<":("<<endl;} | CPP |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.