|시간 제한||메모리 제한||제출||정답||맞은 사람||정답 비율|
|1 초||512 MB||3||3||3||100.000%|
Computational geometry is the key to modern programming contests. However, it is always hard to construct a good test case for a geometry problem, like the problem I in EC Final 2019.
In order to manage the key to the test case preparation, you need to find three points A, B, C on a unit sphere such that min(|AB|, |AC|, |BC|) ≥ 1.7 and the distance from the origin point (0, 0, 0) to the plane ABC is no more than 1.5 × 10−19 but greater than 0.
There is no input for this problem.
Output three lines.
Each line contains three integers xi, yi, zi (−106 ≤ xi, yi, zi ≤ 106, x2 + y2 + z2 ≠ 0) representing the point (x/√(x2+y2+z2), y/√(x2+y2+z2), z/√(x2+y2+z2)).
Even while the checker is numerically stable, it is not done in the exact arithmetic. You might get wrong answer if your solution is too close to the constraints. For example, if the distance between A and B is 1.7 + 10−9, it might cause some trouble.
1 2 3 4 5 6 -1000000 -1000000 -1000000
Note that the sample output is incorrect.