Обсуждение @ 1153. Суперкомпьютер @ Timus Online Judge

Binary Search also works!

Послано Fu Dong 4 июн 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 (-)

Послано Dmitry 'Diman_YES' Kovalioff 4 июн 2005 19:45

Re: Chord method, tangent method or something like that (-)

Послано Yu Yuanming 7 июн 2005 07:31

Yes, and I remember sgu has the same problem only this way work...

Re: Binary Search also works!

Послано r1d1 19 сен 2009 22:45

Use the big basis, for example 1000000000

Re: Binary Search also works!

Послано tiancaihb 21 сен 2009 19:55

Java BigInteger BS worked in 0.078ms! Fantastic!

Обсуждение задачи 1153. Суперкомпьютер