What I wanted to say was, that constant was based on your N. You wont be using the same 100 iteration for high={10}^{1000}. The doubt I had is, that, this K (where K is no. of iterations) must be \ge logN. Hence I feel its theoretically wrong to call it O(1). Am I right? Or am I missing something? 
Yes, that was exactly my point! 
Seems Ok. Will update it in a while.
Thanks

was expecting this⌠PS: I have tried many solutions for this one⌠one of them luckily workedâŚ
|PC x PQ'| / |PQ'| == r
You are comparing float here!
To be pedantic, itâs not only dependent on t_\text{max} either. Itâs more like O(\log(t_\text{max}/\epsilon)).
Yes my two solutions giving different outputs passed.
Find the fastest codes with 100 points in submissions⌠Youâll get your desired solutions 
i.e. sort them according to run time and select âACâ
The test data is wrong. It is clearly mentioned that the point Q is not visible at time = 0 from P.
Thanks for pointing out. Updated info.
I donât think test data is wrongâŚ
because distance from line PQ to center is 1.5756771943166707 , you can find out and correct me if i am wrong 
5 start again
@birjesh_1998
Hi @adzo261, I have followed a similar approach but getting WA. Can you show me your correct submission?
@zymbio, I saw your solution and it is totally correct. It will TLE just because python is slow. Try submitting in âpypyâ or using the number of iterations as 75 (finding the exact number of iterations has been added as link in the editorial)
sure! will also go through the link
thanks !!
What? I think I edited that section out for correction xD. Where is it left now? 
PS: Great blog you found 