All submissions for this problem are available.
Honey and Bunny are two brothers who make and play ridiculous games when they're bored.
Bunny came up with a new game, where he tosses 2 DVDs on a graph sheet! How Jobless?
He then gives Honey the radius and X, Y coordinates of the centers of DVDs, depending on where they landed.
Bunny has to then calculate whether the DVDs are just touching each other (tangential) or if they are on top of each other or not.
The first line of the input denotes the number of test cases 'T'.
The next two lines of the input are for the first and second DVDs respectively.
Each line consists of 3 numbers separated by spaces, denoting the 'X', 'Y' coordinates and Radius 'R' of the DVD.
Such two lined inputs will be given for T test cases.
tangential , overlapping or not overlapping
- 1 = T = 10
- 1 = N = 1000000
Input: 3 10 10 3 10 6 1 8 8 3 8 4 2 7 5 2 4 9 2 Output: tangential overlapping not overlapping
|Time Limit:||1 sec|
|Source Limit:||50000 Bytes|
|Languages:||C, CPP14, JAVA, PYTH, PYTH 3.6, PYPY, CS2, PAS fpc, PAS gpc, RUBY, PHP, GO, NODEJS, HASK, rust, SCALA, swift, D, PERL, FORT, WSPC, ADA, CAML, ICK, BF, ASM, CLPS, PRLG, ICON, SCM qobi, PIKE, ST, NICE, LUA, BASH, LISP sbcl, LISP clisp, SCM guile, ERL, TCL, kotlin, TEXT, SCM chicken, FS|
Fetching successful submissions