Crisis of infinite universes
All submissions for this problem are available.
There is a crisis of infinite universes again in the DC world!! But,The justice league went into a black hole and now need your help.They need to speed travel again and again to survive the black hole.
They can teleport through a certain distance by entering 4 points in the ATOM's special jet only if the 4 points are co-planar.Your mission is to create them a program which takes in the x,y and z coordinates of 4 points and determines whether the points are coplanar or not.
The first line of the input contains an integer T denoting the number of test cases. Each test case consists of four lines. Each line contains three integers, denoting x,y,z coordinates of a point.
For each test case, output Yes if the points are coplanar and No if the points are not coplanar.
- 1 ≤ T ≤ 10^6
- 1 ≤ X,Y,Z ≤ 100
1 9 2 0 7 3 0 9 5 0 2 3 0Output:
The points are co-planar thus the output is Yes.
|Time Limit:||0.02 sec|
|Source Limit:||50000 Bytes|
|Languages:||C, CPP14, JAVA, PYTH, PYTH 3.5, PYPY, 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, SCM chicken, CLOJ, FS|
Fetching successful submissions
If you are still having problems, see a sample solution here.