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 1215. Exactness of Projectile Hit

Show all messages Hide all messages

solution Macarie programatorul in actiune 1 Aug 2004 04:17
easy
simple binary search for r... Just a case with the point in target.
how fast is binary search UXMRI: Sergey Baskakov, Raphail Akhmedisheff and Denis Nikonorov 6 Jul 2005 14:20
I did implement a different approach.
It works for 0.001 sec, but consumes 419 K. 126 loc.

http://acm.timus.ru/status.aspx?space=1&pos=851128

Can you tell me, whether binary search is faster or not.
(Anyway, I think it is easier to implement.)
Re: how fast is binary search Macarie 7 Jul 2005 19:50
yes it was very easy to implemet but got almost 0.015 seconds to run...

Edited by author 07.07.2005 19:51
Re: solution Artem Khizha [DNU] 16 May 2010 02:56
Pure math solution is also pretty clear and easy (if you know algebra well).
Re: solution SuperLight 16 May 2010 09:59