Тема: Problem olymp.krsu.edu.kg (Closest Point of Approach)
http://olymp.krsu.edu.kg/GeneralProblem … format=htm
Ya pytalsya reshit s pomochu proizvodnogo.
no ne vyhodit.
vot moi kod
Help plz, Zaranee spasibo
#include <iostream>
#include <cmath>
using namespace std;
int main()
{
int n;
cin>>n;
while (n--) {
double t,x1,x2,x3,x4,y1,y2,y3,y4,z1,z2,z3,z4;
cin>>x1>>y1>>z1>>x2>>y2>>z2>>x3>>y3>>z3>>x4>>y4>>z4;
x2+=x1; y2+=y1;z2+=z1;
x4+=x3; y4+=y3;z4+=z3;
double c1 = (x2-x1)-(x4-x3) , c2=(y2-y1)-(y4-y3) ,c3 = (z2-z1)-(z4-z3);
t =(-2.0*x1*c1 + 2*x3*c1 - 2*y1*c2 + 2*y3*c2 -2.0*z1*c3 + 2*z3*c3 )/ (2*c1*c1 + 2*c2*c2 + 2*c3*c3);
printf("%.3lf\n",t);
}
}