|
|
back to boardHow to solve this problem with an O(n^2) algo Posted by mj256 31 Jul 2007 17:56 Re: How to solve this problem with an O(n^2) algo Well actually, if you know the O(n^2*logn) algorithm is simple -- using hash function which tells you for A,B and C of the line equation how many rabbits are before and just add. |
|
|
