This is an interactive problem.
The jury has an image of a straight line segment with endpoints ( X _ 1 , Y _ 1 ) (X\_1, Y\_1) ( X _1 , Y _1 ) and ( X _ 2 , Y _ 2 ) (X\_2, Y\_2) ( X _2 , Y _2 ) . The coordinates satisfy the following constraints:
X\_1, Y\_1, X\_2, Y\_2 \in \left\[-10\\,000; 10\\,000\right] .
The length of the segment is at least 100 100 100 .
Your task is to produce the same image.
You are allowed to create several images of the same kind: images of a straight line segment with endpoints ( x _ 1 , y _ 1 ) (x\_1, y\_1) ( x _1 , y _1 ) and ( x _ 2 , y _ 2 ) (x\_2, y\_2) ( x _2 , y _2 ) . After you created an image, you will get the similarity (s i m \mathrm{sim} sim ) of your image and jury's by the following formulas:
d s t ( a _ 1 , b _ 1 , a _ 2 , b _ 2 ) = ( a _ 1 − a _ 2 ) 2 + ( b _ 1 − b _ 2 ) 2 ; \mathrm{dst}(a\_1, b\_1, a\_2, b\_2) = \sqrt{(a\_1 - a\_2)^2 + (b\_1 - b\_2)^2}\text{;} dst ( a _1 , b _1 , a _2 , b _2 ) = ( a _1 − a _2 ) 2 + ( b _1 − b _2 ) 2 ; s = min ( d s t ( x _ 1 , y _ 1 , X _ 1 , Y _ 1 ) + d s t ( x _ 2 , y _ 2 , X _ 2 , Y _ 2 ) , d s t ( x _ 1 , y _ 1 , X _ 2 , Y _ 2 ) + d s t ( x _ 2 , y _ 2 , X _ 1 , Y _ 1 ) ) ; s = \min\left(\mathrm{dst}(x\_1, y\_1, X\_1, Y\_1) + \mathrm{dst}(x\_2, y\_2, X\_2, Y\_2), \mathrm{dst}(x\_1, y\_1, X\_2, Y\_2) + \mathrm{dst}(x\_2, y\_2, X\_1, Y\_1)\right)\text{;} s = min ( dst ( x _1 , y _1 , X _1 , Y _1 ) + dst ( x _2 , y _2 , X _2 , Y _2 ) , dst ( x _1 , y _1 , X _2 , Y _2 ) + dst ( x _2 , y _2 , X _1 , Y _1 ) ) ; s i m = max ( 0 , 40 , 000 − s 40 , 000 ) . \mathrm{sim} = \max\left(0, \frac{40\\,000 - s}{40\\,000}\right)\text{.} sim = max ( 0 , 40 , 000 40 , 000 − s ) .
The goal is to make an image with 100 100\\% 100 similarity using no more than 25 , 000 25\\,000 25 , 000 tries.