2639. Ellipse, again and again

单点时限: 2.0 sec

内存限制: 256 MB

输入格式

The first line contains a positive integer n that indicates number of test cases.

And each test case contains a line with four integers. The value of parameters of the ellipse a, b(0<|a|,|b|<=100),and the coordinates x, y of P(|x|<=100,|y|<=100) are given successively.

输出格式

For each test case, output one line. If the given point P lies inside the given ellipse, print “In ellipse” otherwise print the value of ddQF1*QF2 rounded to the nearest integer.

样例

Input
1
1 1 1 1
Output
1

14 人解决,16 人已尝试。

19 份提交通过,共有 74 份提交。

5.0 EMB 奖励。

创建: 16 年前.

修改: 8 年前.

最后提交: 6 天,22 小时前.

来源: 多校联合比赛BNU站

题目标签