OJ Board

My algorithm tests all pair of packages, but it is too slow (I got TL)
I can`t think better algorithm.

help plz.

Thank you :D

I got AC.



I wonder my algorithm has some precision problem, but I don`t know how to avoid that problem.

In my accepted solution, i have used the following function to check if a is a multiple of b :


[cpp]
inline bool IsAMultipleOf( double num, double div )
{
const double l ...

I think my algorithm for this problem is simple and there is no exceptional cases, but I failed to got AC.


My algorithm is :

1. find angles.
2. check whether angles are multiple of (2*Pi/n) (n = 3~200)
(I thought a is multiple of b, if ((a/b) - floor(a/b) < epsilon). )


I wonder my algorithm ...