|시간 제한||메모리 제한||제출||정답||맞은 사람||정답 비율|
|3 초||128 MB||0||0||0||0.000%|
We call a cuboid regular if:
There is given a set A of points of space, which coordinates are integers from the interval [1,10^6]. We try to find a regular cuboid of maximal volume, which does not contain any of the points from the set A. A point belongs to the cuboid if it belongs to the inside of the cuboid, i.e. it is a point of the cuboid, but not of its wall.
Write a program which:
In the first line of the standard input one non-negative integer n, n ≤ 5,000, is written. It is the number of elements in the set A. In the following n lines of the input there are triples of integers from the interval [1,106], which are coordinates (respectively x, y and z) of points from A. Numbers in each line are separated by single spaces.
In the only line of the standard output there should be three integers separated by single spaces. These are coordinates (respectively x, y and z) of the vertex of the regular cuboid of maximal volume. We require that coordinates are positive.
4 3 3 300000 2 200000 5 90000 3 2000 2 2 1000
1000000 200000 1000