ENG  RUSTimus Online Judge
Online Judge
Problems
Authors
Online contests
About Online Judge
Frequently asked questions
Site news
Webboard
Links
Problem set
Submit solution
Judge status
Guide
Register
Update your info
Authors ranklist
Current contest
Scheduled contests
Past contests
Rules
back to board

Discussion of Problem 1153. Supercomputer

Binary Search also works!
Posted by Fu Dong 4 Jun 2005 17:02
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 (-)
Posted by Dmitry 'Diman_YES' Kovalioff 4 Jun 2005 19:45
Re: Chord method, tangent method or something like that (-)
Posted by Yu Yuanming 7 Jun 2005 07:31
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!
Posted by tiancaihb 21 Sep 2009 19:55
Java BigInteger BS worked in 0.078ms! Fantastic!