## DMOPC '17 Contest 2 P0 - Secrets

View as PDF

Points: 3
Time limit: 2.0s
Memory limit: 64M

Author:
Problem type
Allowed languages
Ada, Assembly, Awk, Brain****, C, C#, C++, COBOL, CommonLisp, D, Dart, F#, Forth, Fortran, Go, Groovy, Haskell, Intercal, Java, JS, Kotlin, Lisp, Lua, Nim, ObjC, OCaml, Octave, Pascal, Perl, PHP, Pike, Prolog, Python, Racket, Ruby, Rust, Scala, Scheme, Sed, Swift, TCL, Text, Turing, VB, Zig

Two secret agents are exchanging messages over a computer, however, they notice that there is a shady being nearby. Given the coordinates of the two secret agents and , and the shady being, , is the shady being within units of an agent?

#### Input Specification

The first line will consist of two space separated integers, and .
The second line will consist of two space separated integers, and .
The third line will consist of two space separated integers, and .
The fourth and final line of input will consist of a single integer,

#### Output Specification

Yes, if the agent is within units of either agent, and No otherwise.

#### Sample Input

1 10
2 3
3 3
10

#### Sample Output

Yes

#### Explanation for Sample Output

The distance between the second secret agent and the shady being is , which is less than or equal to . The distance between the first secret agent and the shady being is , which is also less than or equal to .