Who can solve this problem ?

Revision ru5, by dnazirzhanov05, 2020-10-09 15:04:58

Who can solve this problem ?

Closest Point of Approach

Two spaceships start flying each on its own straight way at different speeds from different locations. You are to determine when

they will be as close to each other as possible. For example, if the first spaceship starts from point (0,0,0) with speed vector

(1,0,0) and the second spaceship starts from (4,2,0) with speed vector (-1,0,0) then after 2 seconds they will be at points

(2,0,0) and (2,2,0) — this is the closest point of their approach.

Tags c++, xc++

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
ru6 Russian dnazirzhanov05 2020-10-09 16:13:11 35
ru5 Russian dnazirzhanov05 2020-10-09 15:04:58 77
ru4 Russian dnazirzhanov05 2020-10-09 14:56:34 499
ru3 Russian dnazirzhanov05 2020-10-09 14:53:17 2 Мелкая правка: 'Wha can solve' -> 'Who can solve'
ru2 Russian dnazirzhanov05 2020-10-09 14:52:56 79
ru1 Russian dnazirzhanov05 2020-10-09 14:44:36 210 Первая редакция (опубликовано)