Pls, explain me why i'm wrong
Let T is answer.
t in [0,T]: x(t)=vx*t, y(t)=vy*t-g*t^2/2
t > T: x(t) = x(T) + (vx+ux)(t-T) = (vx+ux)t - ux*T
       y(t) = y(T) + (vy - g*T + uy)*(t-T)-g * (t-T)^2/2 = (-g/2)*t^2 + (vy+uy)*t-y*T

t1, t2: x(t1)=L, x(t2)=L+l
t1 = (L+ux*T)/(vx+ux)
t2 = (L+l+ux*T)/(vx+ux)
tv: y'(tv)=0, tv = (vy+uy)/g

Then i use conditions:
0<T<L/vx, T<2*vy/g
h<y(t1)<h+d, h<y(t2)<h+d
if tv in (T-eps, T+eps) then y(tv)<h+d

My algo:
find all candidates from conditions and then check that candidate is good

My code:
[code deleted]


Edited by moderator 27.07.2023 17:23

"Nod can throw a stone with an ABSOLUTE initial speed (ux, uy)."