Problem B
Cat And Mouse
Any resemblance to real or fictious cats
and mice in this problem is purely coincidental. Also, no sheep
were harmed in the making of this problem. Promise.
Tom the mouse is standing in the middle of a circle with radius $R$ meters. Jerry the cat is waiting for him on the perimeter of the circle. The circle is made of a substance that is toxic to cats, so Jerry can’t come into the circle. This is all fine and well for Tom, but he’s getting hungry. Can Tom escape from the circle without getting caught? Both Tom and Jerry instantly see it when the other one makes a move, and both of them are able to instantly change course at will.
Tom runs $t$ meters per second. Jerry runs $j$ meters per second. Tom can run $2 \cdot j$ meters per second once he is outside, so he doesn’t need to escape by a lot.
Input
The first line of the input consists of a single integer,
$T$, the number of test
cases.
Each of the following $T$
cases contains 3 integers $R$, $t$, $j$, separated by spaces.
-
$1 \leq T \leq 100$
-
$1 \leq R \leq 1\, 000\, 000$
-
$1 \leq t, j \leq 100\, 000$
Output
For each test case, output a line with the string “YES” if Tom can escape, or “NO” if he can’t.
Sample Input 1 | Sample Output 1 |
---|---|
3 10 1 1 1 1 10 5 1 4 |
YES NO YES |