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

Fu Dong Binary Search also works! [4] // Problem 1153. Supercomputer 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?
Dmitry 'Diman_YES' Kovalioff Chord method, tangent method or something like that (-) [1] // Problem 1153. Supercomputer 4 Jun 2005 19:45
Yes, and I remember sgu has the same problem only this way work...
r1d1 Re: Binary Search also works! // Problem 1153. Supercomputer 19 Sep 2009 22:45
Use the big basis, for example 1000000000
tiancaihb Re: Binary Search also works! // Problem 1153. Supercomputer 21 Sep 2009 19:55
Java BigInteger BS worked in 0.078ms! Fantastic!