4337. Effective Gradient

单点时限: 2.0 sec

内存限制: 256 MB

Little W likes rational number PQ very much. He has n points on the plane. You need to tell him the closest gradient to PQ of the lines passing through at least two points.

Suppose a line passes through two points (x0,y0) and (x1,y1). The gradient of it is exactly g=y0y1x0x1. Closest gradient means argmingG|gPQ| as G is the set of gradients of all availible lines.

输入格式

The first lines contain three integers n,P,Q. (5n106,1P,Q105)

In the following n lines, each line contains two integers x,y represent the coordinate of a point. (1x,y109)

输出格式

You should output a rational number P/Q represents the answer.

We ensure that the answer is unique and larger than 0.

You can use 1/0 to represent the gradient of infinity.

样例

Input
6 15698 17433
112412868 636515040
122123982 526131695
58758943 343718480
447544052 640491230
162809501 315494932
870543506 895723090
Output
193409386/235911335

21 人解决,24 人已尝试。

23 份提交通过,共有 64 份提交。

4.3 EMB 奖励。

创建: 3 年,6 月前.

修改: 3 年,6 月前.

最后提交: 1 周前.

来源: N/A

题目标签