All submissions for this problem are available.
It's the year of Jetsons(yeah your favourite cartoon series ;). So, we know jetsons live high up in sky on a house supported by a cylindrical bar.
Let's say they have a rectangular shaped house and high flying lights to facilitate the traffic in night of course even air traffic needs night light.
Now since not all people can afford houses that high. most people have houses at lower levels and others at higher level.yeah there are divides even then
So the then government decided to find the inconvience caused due to high houses obstacling the traffic light.Now your task is to find the shadow of the house.Well that didn't sound so good ok you have to find the area of the shadow.
Now if the shadow area is infinite print -1 or if shadow is a line print 0 as its area.
T number of test cases.
for each test cases first two lines each contain the x, y and z coordinates of the diagonal of the house.
the next line contains the x, y and z coordinates of the traffic light.
One line containing the area of shadow cast.
Input: 1 1 1 1 10 1 1 5 5 5 Output: 0.000000
|Time Limit:||1 sec|
|Source Limit:||50000 Bytes|
|Languages:||C, CPP14, JAVA, PYTH, PYTH 3.5, CS2, PAS fpc, PAS gpc, RUBY, PHP, GO, NODEJS, HASK, SCALA, D, PERL, FORT, WSPC, ADA, CAML, ICK, BF, ASM, CLPS, PRLG, ICON, SCM qobi, PIKE, ST, NICE, LUA, BASH, NEM, LISP sbcl, LISP clisp, SCM guile, JS, ERL, TCL, PERL6, TEXT, CLOJ, FS|
Fetching successful submissions
If you are still having problems, see a sample solution here.