Interesting Geometry problem

Правка en1, от wannared, 2017-08-30 00:47:50

Given a Point P(x, y) find two points S1 and S2 such that S1, S2 lies on line joining origin and P and d(P, S1) = d(p, S2) = r, i.e two points that are at distance r from P.

How to get S1, S2 using minimum number of characters in C++ (CodeGolf). Codes snippets are welcome ..

Thanks in advance

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en1 Английский wannared 2017-08-30 00:47:50 345 Initial revision (published)