Jet Aircraft

Mr. Retain is so clever that he creates a jet aircraft by himself. A jet aircraft is an aircraft propelled by jet engines. Jet aircraft fly much faster than propeller-powered aircrafts and at higher altitudes -- as high as 10,000 to 15,000 meters (about 33,000 to 49,000 ft). At these altitudes, jet engines achieve maximum efficiency over long distances. The engines in propeller powered aircraft achieve their maximum efficiency at much lower altitudes. Jet aircraft can move faster than sound.

Now, Mr. Retain would like to test his jet aircraft. His has chosen some places as destinations. However, Mr. Retain doesn’t want to take risk to go to every place, i.e. he will go to only one place. The probability of a successful flight between two places is only determined by their distance. Assume X₁, Y₁, Z₁ and X₂, Y₂, Z₂ are coordinates of two places, the probability should be calculate by .

Mr. Retain will give you all the coordinates. Your task is to calculate the maximum probability.

 

Input     (Please use standard input, and don’t read or write files.)
The first line contains an integer N, the number of places (1< N <=10000). It is followed by N lines. Each line contains three integers: X, Y, Z which means the coordinates. The last line is where Mr. Retain starts from. |X| , |Y|, |Z| <= 106
Output   (Please use standard output, and don’t read or write files.)
The maximum probability with four decimal points
Sample Input	Sample Output
3 1 0 0 2 2 2 0 0 0	0.7071

#include<stdio.h> #include<stdlib.h> #include<math.h> int main() { int n,i,j; unsigned int x,y,z,ax,ay,az,bx,by,bz; double result; scanf("%d",&n); unsigned int** CoordinateList; CoordinateList=(unsigned int**)malloc(sizeof(unsigned int*)*n); for(i=0;i<n;i++) { CoordinateList[i]=(unsigned int*)malloc(sizeof(unsigned int)*3); getchar(); scanf("%d%d%d",CoordinateList[i],CoordinateList[i]+1,CoordinateList[i]+2); } i--; x=CoordinateList[i-1][0]; y=CoordinateList[i-1][1]; z=CoordinateList[i-1][2]; for(j=i-2;j>=0;j--) { ax=abs(CoordinateList[i][0]-x); ay=abs(CoordinateList[i][1]-y); az=abs(CoordinateList[i][2]-z); bx=abs(CoordinateList[i][0]-CoordinateList[j][0]); by=abs(CoordinateList[i][1]-CoordinateList[j][1]); bz=abs(CoordinateList[i][2]-CoordinateList[j][2]); ax=(ax-bx)*(ax+bx); ay=(ay-by)*(ay+by); az=(az-bz)*(az+bz); ax=ax+ay+az; if((int)ax>0) { x=CoordinateList[j][0]; y=CoordinateList[j][1]; z=CoordinateList[j][2]; } } ax=(CoordinateList[i][0]-x)*(CoordinateList[i][0]-x)+(CoordinateList[i][1]-y)*(CoordinateList[i][1]-y)+(CoordinateList[i][2]-z)*(CoordinateList[i][2]-z)+1; result=1/sqrt(ax); printf("%.4f/n",result); return 0; }