|
|
back to boardBinary Search also works! I solved this problem with Binary search, but I used 0.812s. Can anyone who solved this problem with Binary search tell me how to make it faster? Chord method, tangent method or something like that (-) Re: Chord method, tangent method or something like that (-) Yes, and I remember sgu has the same problem only this way work... Re: Binary Search also works! Posted by r1d1 19 Sep 2009 22:45 Use the big basis, for example 1000000000 Re: Binary Search also works! Java BigInteger BS worked in 0.078ms! Fantastic! |
|
|