OJ Board

it is a problem of probability of statistics.so think it from statistics view

it is a problem of probability of statistics.so think it from statistics view

:roll:
hello i got time limit exit in solving that problem and the answer of the judge is as follows


Your program has used more time (10.020 seconds) than the maximum
allowed for this problem by this judge (10 seconds).
[/quote]

:o
can anyone help me how can i make the problem effiently ...

:roll:

hello i got time limit exit in that problem.can anyone help me how can i make the problem efficient.

:o
i add my source code here.i first use all pair shortest path algorithm and use recursion to cut all shortest path of boss then use single pair shortest path algorithm to find out the ...

By testing different angles, and doing some calculations on the topright circle, you can find for each angle how big the polygon must be. Once you get the formulas correct (some sin & cos & tan or something ), a binary search of the angle will work.

:roll:

still i don't understand how i use ...