label
stringlengths 1
2
| index
stringlengths 1
5
| code
stringlengths 87
8.24k
|
|---|---|---|
64 | 31600 | int main(){
int a1[100],a2[100],a3[100],n,z[100],i,j,k=0,a[100],b[100];
double o,m,x[100],y[100];
scanf("%d\n",&n);
for(i=0;i<n;i++){
scanf("%d%d%d",&a1[i],&a2[i],&a3[i]);
}
for(i=0;i<n;i++){
for(j=i+1;j<n;j++){
x[k]=(a1[i]-a1[j])*(a1[i]-a1[j])+(a2[i]-a2[j])*(a2[i]-a2[j])+(a3[i]-a3[j])*(a3[i]-a3[j]);
y[k]=sqrt(x[k]);
a[k]=i;
b[k]=j;
k=k+1;
}
}
for(i=1;i<=k;i++){
for(j=0;j<k-i;j++){
if(y[j]<y[j+1]){
m=y[j];
y[j]=y[j+1];
y[j+1]=m;
m=a[j];
a[j]=a[j+1];
a[j+1]=m;
m=b[j];
b[j]=b[j+1];
b[j+1]=m;
}
}
}
for(i=0;i<k;i++){
printf("(%d,%d,%d)-(%d,%d,%d)=%.2lf\n",a1[a[i]],a2[a[i]],a3[a[i]],a1[b[i]],a2[b[i]],a3[b[i]],y[i]);
}
}
|
64 | 31601 | /*
* 80.cpp
* ??????
* Created on: 2011-12-14
* ???????????n??????10??,??n?????????,???????????????????????????
*/
int main()
{
int n,i,k,j,p,t=0;
double q;
cin>>n;
struct zb
{
int x;
int y;
int z;
}aa[n];
for(i=0;i<n;i++)
{
cin>>aa[i].x>>aa[i].y>>aa[i].z;
}
double s[n][n];
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
{
s[i][j]=0.0;
}
}
for(i=0;i<n-1;i++)
{
for(j=i+1;j<n;j++)
{
s[i][j]=(sqrt)((aa[i].x-aa[j].x)*(aa[i].x-aa[j].x)+(aa[i].y-aa[j].y)*(aa[i].y-aa[j].y)+(aa[i].z-aa[j].z)*(aa[i].z-aa[j].z));
}
}
k=(n-1)*(n-1);
double ss[k];
for(i=0;i<k;i++)
{
ss[i]=0.0;
}
for(i=0;i<n-1;i++)
{
for(j=1;j<n;j++)
{
ss[t]=s[i][j];
t=t+1;
}
}
for(i=0;i<k;i++)
{
for(j=0;j<k-i-1;j++)
{
if(ss[j]<ss[j+1])
{
q=ss[j+1];
ss[j+1]=ss[j];
ss[j]=q;
}
}
}
p=n*(n-1)/2;
int a=0;
for(t=0;t<p;t++)
{
for(i=0;i<n-1;i++)
{
for(j=1;j<n;j++)
{
if(ss[t]==s[i][j])
{
cout<<"("<<aa[i].x<<","<<aa[i].y<<","<<aa[i].z<<")"<<"-"<<"("<<aa[j].x<<","<<aa[j].y<<","<<aa[j].z<<")"<<"=";
cout<<fixed<<setprecision(2)<<s[i][j]<<endl;
s[i][j]=-1.0;
a=1;
}
}
}
}
return 0;
}
|
64 | 31602 | //* * * * * * * * * * * * * * * * * * * * * * * *
//*???????? *
//*????????.cpp *
//*????? 1000012839 *
//*???2010.12.18 *
//* * * * * * * * * * * * * * * * * * * * * * * *
struct Dot
{
int dot1[3]; // ????????
int dot2[3]; // ????????
double distance; // ???????
} s[45], temp;
int main()
{
int dot[10][3]; // ??????
int n; // ?????
int i, j, k; // ?????
cin >> n;
for (i = 0; i < n; i++)
cin >> dot[i][0] >> dot[i][1] >> dot[i][2];
k = 0;
for (i = 0; i < n - 1; i++)
{
for (j = i + 1; j < n; j++)
{
s[k].dot1[0] = dot[i][0];
s[k].dot1[1] = dot[i][1];
s[k].dot1[2] = dot[i][2];
s[k].dot2[0] = dot[j][0];
s[k].dot2[1] = dot[j][1];
s[k].dot2[2] = dot[j][2];
s[k].distance = sqrt(pow(dot[i][0] - dot[j][0],2) + pow(dot[i][1] - dot[j][1],2) + pow(dot[i][2] - dot[j][2],2));
k++; // ??????????????
}
}
for (i = 0; i < k - 1; i++) // ??k?n*(n-1)/2?
{
for (j = 0; j < k - i; j++)
{
if (s[j].distance < s[j + 1].distance)
{
temp = s[j];
s[j] = s[j + 1];
s[j + 1] = temp; // ??????
}
}
}
for (i = 0; i < k; i++)
cout << '(' << s[i].dot1[0] << ',' << s[i].dot1[1] << ',' << s[i].dot1[2] << ")-(" << s[i].dot2[0]
<< ',' << s[i].dot2[1] << ',' << s[i].dot2[2] << ")=" << fixed << setprecision(2) << s[i].distance << endl;
return 0;
}
|
64 | 31603 | int n,x,y,z;
int p;
struct point
{
int x,y,z;
}
points[10];
struct print
{
double l;
struct point p1,p2;
}
prints[45];
void scan();
void count();
void sort();
void print();
int main(){
scan();
count();
sort();
print();
return 0;
}
void scan(){
scanf("%d",&n);
for(int i=0;i<n;i++){
scanf("%d%d%d",&x,&y,&z);
points[i].x=x;
points[i].y=y;
points[i].z=z;
}
}
void count(){
int x1,y1,z1,x2,y2,z2;
p=0;
for(int i=0;i<n-1;i++){
for(int j=i+1;j<n;j++){
x1=points[i].x;
y1=points[i].y;
z1=points[i].z;
x2=points[j].x;
y2=points[j].y;
z2=points[j].z;
prints[p].l=sqrt((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2)+(z1-z2)*(z1-z2));
prints[p].p1=points[i];
prints[p].p2=points[j];
p++;
}
}
}
void sort(){
struct print temp;
for(int k=1;k<=p;k++){
for(int i=0;i<p-k;i++){
if(prints[i].l<prints[i+1].l){
temp=prints[i+1];
prints[i+1]=prints[i];
prints[i]=temp;
}
}
}
}
void print(){
int x1,y1,z1,x2,y2,z2;
double l;
for(int i=0;i<p;i++){
x1=prints[i].p1.x;
y1=prints[i].p1.y;
z1=prints[i].p1.z;
x2=prints[i].p2.x;
y2=prints[i].p2.y;
z2=prints[i].p2.z;
l=prints[i].l;
printf("(%d,%d,%d)-(%d,%d,%d)=%.2lf\n",x1,y1,z1,x2,y2,z2,l);
}
}
|
64 | 31604 | /*
* structure_4.cpp
*
* Created on: 2010-12-29
* Author: ???
* ??? ????
*/
int main(){
int n,i,j,num;
cin>>n;
struct point{ //??????
int x;
int y;
int z;
} p[100];
for(i=0;i<n;i++) //????????
cin>>p[i].x>>p[i].y>>p[i].z;
struct distance{ //??????????
double dis;
int i;
int j;
} d[5000],temp;
for(i=0,num=0;i<n-1;i++) //?????
for(j=i+1;j<n;j++,num++){
d[num].dis=sqrt(pow(p[i].x-p[j].x,2.0)+pow(p[i].y-p[j].y,2.0)+pow(p[i].z-p[j].z,2.0));
d[num].i=i;
d[num].j=j;
}
for(i=0;i<num-1;i++) //?????
for(j=0;j<num-i-1;j++){
if(d[j].dis<d[j+1].dis){
temp=d[j];
d[j]=d[j+1];
d[j+1]=temp;
}
}
for(i=0;i<num;i++) //????
cout<<'('<<p[d[i].i].x<<','<<p[d[i].i].y<<','<<p[d[i].i].z<<")-("<<p[d[i].j].x<<','<<p[d[i].j].y<<','<<p[d[i].j].z<<")="<<fixed<<setprecision(2)<<d[i].dis<<endl;
return 0;
}
|
64 | 31605 | /*
* distance.cpp
*
* Created on: 2013-11-1
* Author: ???1300012996
*/
int main(){
int n;cin>>n;int a[n][3];//???????????
for(int i=0;i<n;i++)
for(int j=0;j<3;j++){
cin>>a[i][j];
}
int m=n*(n-1)/2;
double d[m],t;//??????????
int p=0,num[m][2],tt,ttt;
for(int ii=0;ii<n;ii++)
for(int jj=ii+1;jj<n;jj++){
d[p]=sqrt((a[ii][0]-a[jj][0])*(a[ii][0]-a[jj][0])+
(a[ii][1]-a[jj][1])*(a[ii][1]-a[jj][1])+
(a[ii][2]-a[jj][2])*(a[ii][2]-a[jj][2]));
num[p][0]=ii;num[p][1]=jj;//??????????????????
p++;
}
for(int iii=1;iii<m;iii++)
for(int jjj=0;jjj<m-iii;jjj++){
if(d[jjj]<d[jjj+1]){//??????????????????????????????
t=d[jjj];d[jjj]=d[jjj+1];d[jjj+1]=t;
tt=num[jjj][0];num[jjj][0]=num[jjj+1][0];num[jjj+1][0]=tt;
ttt=num[jjj][1];num[jjj][1]=num[jjj+1][1];num[jjj+1][1]=ttt;
}
}
int iij,jji;
for(int ij=0;ij<m;ij++){//?????
iij=num[ij][0];jji=num[ij][1];
cout<<"("<<a[iij][0]<<","
<<a[iij][1]<<","
<<a[iij][2]<<")-("
<<a[jji][0]<<","
<<a[jji][1]<<","
<<a[jji][2]<<")="
<<fixed<<setprecision(2)<<d[ij]<<endl;
}
return 0;
}
|
64 | 31606 | int main()
{
int n,i,j,t,g,f,m,k;
int a[10],b[10],c[10],z[50][6];
double s[50],e;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d%d%d",&(a[i]),&(b[i]),&(c[i]));
}
t=0;
for(i=0;i<n;i++)
{
for(j=i+1;j<n;j++)
{
s[t]=sqrt((a[i]-a[j])*(a[i]-a[j])+(b[i]-b[j])*(b[i]-b[j])+(c[j]-c[i])*(c[j]-c[i]));
z[t][0]=a[i];z[t][1]=b[i];z[t][2]=c[i];z[t][3]=a[j];z[t][4]=b[j];z[t][5]=c[j];
t++;
}
}
e=0;k=0;
for(i=1;i<=t;i++)
{
for(j=0;j<t-i;j++)
{
if(s[j]<s[j+1])
{
e=s[j+1];
s[j+1]=s[j];
s[j]=e;
for(m=0;m<6;m++)
{
k=z[j+1][m];
z[j+1][m]=z[j][m];
z[j][m]=k;
}
}
}
}
for(g=0;g<t;g++)
{
printf("(%d,%d,%d)-(%d,%d,%d)=%.2lf\n",z[g][0],z[g][1],z[g][2],z[g][3],z[g][4],z[g][5],s[g]);
}
return 0;
} |
64 | 31607 | /**
* @file 1000012800_3.cpp
* @author ??
* @date 2010-12-15
* @description
* ??????:??????
*/
int main()
{
int n, dot[100][3], count = -1;
double counter[5000][3], tmp;
cin >> n;
for (int i = 0; i < n; i++)
cin >> dot[i][0] >> dot[i][1] >> dot[i][2];
for (int i = 0; i < n - 1; i++)
for (int j = i + 1; j < n; j++)
{
count++;
counter[count][0] = sqrt((double)((dot[i][0] - dot[j][0]) * (dot[i][0] - dot[j][0]) +
(dot[i][1] - dot[j][1]) * (dot[i][1] - dot[j][1]) +
(dot[i][2] - dot[j][2]) * (dot[i][2] - dot[j][2])));
counter[count][1] = i;
counter[count][2] = j;
}
for (int i = 0; i < count; i++)
for (int j = count; j > i; j--)
{
if (counter[j][0] > counter[j - 1][0])
{
for (int k = 0; k < 3; k++)
{
tmp = counter[j][k];
counter[j][k] = counter[j - 1][k];
counter[j - 1][k] = tmp;
}
}
}
for (int i = 0; i <= count; i++)
{
cout << "(" << dot[(int)counter[i][1]][0] << "," <<
dot[(int)counter[i][1]][1] << "," <<dot[(int)counter[i][1]][2] <<
")-("<< dot[(int)counter[i][2]][0] << "," << dot[(int)counter[i][2]][1] <<
"," << dot[(int)counter[i][2]][2] << ")=" << setprecision(2) << fixed << counter[i][0] << endl;
}
return 0;
}
|
64 | 31608 | /*
* pl.cpp
*
* Created on: 2013-11-2
* Author: lenovo
*/
const int maxN=105;
int x[maxN],y[maxN],z[maxN],dis[maxN][maxN],d[maxN*maxN]={0};
int n;
int calc(int a,int b)
{
return (x[a]-x[b])*(x[a]-x[b])+(y[a]-y[b])*((y[a]-y[b]))+(z[a]-z[b])*(z[a]-z[b]);
}
int main()
{
int i,j;
cin>>n;
for(i=1;i<=n;i++){
cin>>x[i]>>y[i]>>z[i];
dis[i][i]=0;
for(j=1;j<i;j++){
dis[i][j]=dis[j][i]=calc(i,j);
d[++d[0]]=dis[i][j];
}
}
sort(d+1,d+d[0]+1);
d[d[0]+1]=-1;
for(int k=d[0];k;k--)
if(d[k]!=d[k+1]){
for(i=1;i<n;i++)
for(j=i+1;j<=n;j++)
if(dis[i][j]==d[k])
printf("(%d,%d,%d)-(%d,%d,%d)=%.2f\n",x[i],y[i],z[i],x[j],y[j],z[j],sqrt(dis[i][j]));
}
return 0;
}
|
64 | 31609 | double distance(double q,double w,double e,double r,double t,double y)
{
double u;
u=sqrt((q-r)*(q-r)+(w-t)*(w-t)+(e-y)*(e-y));
return u;
}
int main(){
int a,b,e,f,g,h,n,i;
double d[10][10],c;
struct z
{
double j;
double k;
double l;
}
s[10];
scanf("%d\n",&n);
for(i=0;i<n-1;i++){
scanf("%lf%lf%lf ",&s[i].j,&s[i].k,&s[i].l);
}
scanf("%lf%lf%lf",&s[n-1].j,&s[n-1].k,&s[n-1].l);
for(a=0;a<n-1;a++){
for(b=a+1;b<n;b++){
d[a][b]=distance(s[a].j,s[a].k,s[a].l,s[b].j,s[b].k,s[b].l);
}
}
for(e=n*(n-1)/2;e>0;e--){
for(a=0,c=0;a<n-1;a++){
for(b=a+1;b<n;b++){
if(c<d[a][b]){
c=d[a][b];
f=a;
g=b;
}
}
}
d[f][g]=0;
printf("(%.0lf,%.0lf,%.0lf)-(%.0lf,%.0lf,%.0lf)=%.2lf\n",s[f].j,s[f].k,s[f].l,s[g].j,s[g].k,s[g].l,c);
}
return 0;
}
|
64 | 31610 | int main()
{int n,i=0,j,p,q;
int a[10][3];
double b[50],k,m;
scanf("%d",&n);
for(i=0;i<n;i++)
{
for(j=0;j<3;j++)
{scanf("%d",&a[i][j]);}
}
i=0;
for(p=0;p<n-1;p++)
{ for(q=p+1;q<n;q++)
{b[i]=1.0*sqrt((a[p][0]-a[q][0])*(a[p][0]-a[q][0])+(a[p][1]-a[q][1])*(a[p][1]-a[q][1])+(a[p][2]-a[q][2])*(a[p][2]-a[q][2]));
i++;}
}
int index = i;
for(j=index-1;j>0;j--)
{
for(i=0;i<j;i++)
{if(b[i]>b[i+1])
{k=b[i];
b[i]=b[i+1];
b[i+1]=k;
}
}
}
b[n*(n-1)/2]=-1;
for(i=n*(n-1)/2;i>=0;i--)
{if(b[i]!=b[i+1])
{
for(p=0;p<n;p++)
{ for(q=p+1;q<n;q++)
{m=1.0*sqrt((a[p][0]-a[q][0])*(a[p][0]-a[q][0])+(a[p][1]-a[q][1])*(a[p][1]-a[q][1])+(a[p][2]-a[q][2])*(a[p][2]-a[q][2]));
if(m==b[i])
{printf("(%d,%d,%d)-(%d,%d,%d)=%.2lf\n",a[p][0],a[p][1],a[p][2],a[q][0],a[q][1],a[q][2],m);}
}
}
}
}
return 0;
}
|
64 | 31611 | // ???? ?? 1000062708
int main()
{
struct num
{
int x;
int y;
int z;
}a[10];
int i, j, k, n, xx, yy;
double b[10][10], m = 0;
cin >> n;
for(i = 0;i < n;i++)
cin >> a[i].x >> a[i].y >> a[i].z;
for(i = 0;i < n;i++)
for(j = i + 1;j < n;j++)
b[i][j] = sqrt((double)(a[i].x - a[j].x) * (a[i].x - a[j].x) + (double)(a[i].y - a[j].y) * (a[i].y - a[j].y) + (double)(a[i].z - a[j].z) * (a[i].z - a[j].z));
for(k = 0;k < n * (n - 1) / 2;k++)
{
m = 0;
for(i = 0;i < n;i++)
for(j = i + 1;j < n;j++)
{
if(b[i][j] > m)
{
xx = i;
yy = j;
m = b[i][j];
}
}
cout << "(" << a[xx].x << "," << a[xx].y << "," << a[xx].z << ")-(" << a[yy].x << ","
<< a[yy].y << "," << a[yy].z << ")=" << fixed << setprecision(2) << m << endl;
b[xx][yy] = 0;
}
return 0;
}
|
64 | 31612 | int main(){
int n;
scanf("%d",&n);
int x[100]={0};
int y[100]={0};
int z[100]={0};
double d[4500]={0};
int i,j,t,p=0;
for(i=0;i<n;i++){
scanf("%d%d%d",&x[i],&y[i],&z[i]);
}
int k=0;
for(i=0;i<n-1;i++){
for(j=i+1;j<n;j++){
d[k]=sqrt((x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j])+(z[i]-z[j])*(z[i]-z[j]));
k++;
}
}
for(i=0;i<k-1;i++){
for(j=i+1;j<k;j++){
if(d[i]<d[j]){
double tmp;
tmp=d[i];
d[i]=d[j];
d[j]=tmp;
}
}
}
double a[4500]={0};
for(i=0;d[i]!=0;i++){
if(d[i]==d[i+1]){continue;}
else if(d[i]!=d[i+1]){a[p]=d[i];p++;}
}
for(i=0;i<p;i++){
if(a[i]==0){break;}
for(j=0;j<n;j++){
for(t=j+1;t<n;t++){
if(sqrt((x[t]-x[j])*(x[t]-x[j])+(y[t]-y[j])*(y[t]-y[j])+(z[t]-z[j])*(z[t]-z[j]))==a[i]){
printf("(%d,%d,%d)-(%d,%d,%d)=%.2lf\n",x[j],y[j],z[j],x[t],y[t],z[t],a[i]);
}
}
}
}
return 0;
}
|
64 | 31613 | int main(){
int x[100],y[100],z[100],n,i,j,k=0,xx[100],yy[100],zz[100],xxx[100],yyy[100],zzz[100];
double juli[1000];
scanf("%d",&n);
for (i=1;i<=n;i++){
scanf("%d %d %d",&x[i],&y[i],&z[i]);
}
for (i=1;i<n;i++){
for (j=i+1;j<=n;j++){
k++;
juli[k]=sqrt((x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j])+(z[i]-z[j])*(z[i]-z[j]));
xx[k]=x[i];
yy[k]=y[i];
zz[k]=z[i];
xxx[k]=x[j];
yyy[k]=y[j];
zzz[k]=z[j];
}
}
int a;
double b;
for(i=1;i<=k;i++){
for(j=1;j<=k-i;j++)
if (juli[j+1]>juli[j]){
b=juli[j];
juli[j]=juli[j+1];
juli[j+1]=b;
a=xx[j];
xx[j]=xx[j+1];
xx[j+1]=a;
a=yy[j];
yy[j]=yy[j+1];
yy[j+1]=a;
a=zz[j];
zz[j]=zz[j+1];
zz[j+1]=a;
a=xxx[j];
xxx[j]=xxx[j+1];
xxx[j+1]=a;
a=yyy[j];
yyy[j]=yyy[j+1];
yyy[j+1]=a;
a=zzz[j];
zzz[j]=zzz[j+1];
zzz[j+1]=a;
}
}
for(i=1;i<=k;i++){
printf("(%d,%d,%d)-(%d,%d,%d)=%.2lf\n",xx[i],yy[i],zz[i],xxx[i],yyy[i],zzz[i],juli[i]);
}
return 0;
}
|
64 | 31614 | int main(){
int n,i,j,g,k,a[50],b[50],x[10],y[10],z[10],w,q;
double s[50],e;
k=-1;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d %d %d",&x[i],&y[i],&z[i]);
}
for(i=0;i<n-1;i++){
for(j=i+1;j<n;j++){
k++;
s[k]= sqrt(pow((x[i]-x[j]),2)+pow((y[i]-y[j]),2)
+pow((z[i]-z[j]),2));
a[k]=i;
b[k]=j;
}
}
for(i=1;i<=n*(n-1)/2;i++){
for(k=0;k<n*(n-1)/2-i;k++){
if(s[k]<s[k+1]){
e=s[k];
s[k]=s[k+1];
s[k+1]=e;
g=a[k];
a[k]=a[k+1];
a[k+1]=g;
g=b[k];
b[k]=b[k+1];
b[k+1]=g;
}
}
}
for(k=0;k<n*(n-1)/2;k++){
q=a[k];
w=b[k];
printf("(%d,%d,%d)-(%d,%d,%d)=%.2lf\n",x[q],y[q],z[q],x[w],y[w],z[w],s[k]);
}
return 0;
}
|
64 | 31615 | int main()
{
struct sanD
{
int x;
int y;
int z;
}room[10];
int n, i, j;
double dis[100];
double temp;
int x1[100], x2[100], y1[100], y2[100], z1[100], z2[100];
int k = 1;
cin >> n;
for(i = 0; i < n; i++)
cin >> room[i].x >> room[i].y >> room[i].z;
for(i = 0; i < n; i++)
for(j = i + 1; j < n; j++)
{
x1[k] = room[i].x;
y1[k] = room[i].y;
z1[k] = room[i].z;
x2[k] = room[j].x;
y2[k] = room[j].y;
z2[k] = room[j].z;
dis[k] = sqrt((x1[k] - x2[k]) * (x1[k] - x2[k]) + (y1[k] - y2[k]) * (y1[k] - y2[k]) + (z1[k] - z2[k]) * (z1[k] - z2[k]));
k++;
}
for(i = 1; i <= n * (n - 1) / 2; i++)
{
for(j = n * (n - 1) / 2; j >= 1 + i ; j--)
{
if(dis[j] > dis[j - 1])
{
temp = dis[j - 1];
dis[j - 1] = dis[j];
dis[j] = temp;
temp = x1[j - 1];
x1[j - 1] = x1[j];
x1[j] = temp;
temp = x2[j - 1];
x2[j - 1] = x2[j];
x2[j] = temp;
temp = y1[j - 1];
y1[j - 1] = y1[j];
y1[j] = temp;
temp = y2[j - 1];
y2[j - 1] = y2[j];
y2[j] = temp;
temp = z1[j - 1];
z1[j - 1] = z1[j];
z1[j] = temp;
temp = z2[j - 1];
z2[j - 1] = z2[j];
z2[j] = temp;
}
}
}
for(i = 1; i <= n * (n - 1) / 2; i++)
cout << "(" << x1[i] << "," << y1[i] << "," << z1[i] << ")-(" << x2[i] << "," << y2[i] << "," << z2[i] << ")=" << fixed << setprecision(2) << dis[i] << endl;
return 0;
}
|
64 | 31616 | int main()
{
int n,m=0,p,q,d;
double c,e;
scanf("%d",&n);
int sz[30];
int a[45],b[45];
for(int i=0;i<3*n;i++){
scanf("%d",&sz[i]);
}
double jl[45];
for(int i=0;i<n-1;i++){
for(int j=i+1;j<n;j++){
c=pow(1.0*(sz[3*j]-sz[3*i]),2.0)+pow(1.0*(sz[3*j+1]-sz[3*i+1]),2.0)+pow(1.0*(sz[3*j+2]-sz[3*i+2]),2.0);
jl[m]=sqrt(c);
a[m]=i;
b[m]=j;
m++;
}
}
for(p=1;p<n*(n-1)/2;p++){
for(q=0;q<n*(n-1)/2-p;q++){
if(jl[q]<jl[q+1]){
e=jl[q];
jl[q]=jl[q+1];
jl[q+1]=e;
d=a[q];
a[q]=a[q+1];
a[q+1]=d;
d=b[q];
b[q]=b[q+1];
b[q+1]=d;
}
}
}
for(p=0;p<n*(n-1)/2;p++){
printf("(%d,%d,%d)-(%d,%d,%d)=%.2lf\n",sz[3*a[p]],sz[3*a[p]+1],sz[3*a[p]+2],sz[3*b[p]],sz[3*b[p]+1],sz[3*b[p]+2],jl[p]);
}
return 0;
} |
64 | 31617 | int main()
{
int a[10][3],i,j,k,n,t=0,b[45],c[45],q,m;
float d[45],p,s;
scanf("%d",&n);
for(i=0;i<n;i++)
{
for(j=0;j<3;j++)
scanf("%d",&a[i][j]);
}
for(i=0;i<n;i++)
{
for(k=i+1;k<n;k++)
{
s=(a[i][0]-a[k][0])*(a[i][0]-a[k][0])+(a[i][1]-a[k][1])*(a[i][1]-a[k][1])+(a[i][2]-a[k][2])*(a[i][2]-a[k][2]);
d[t]=sqrt(s);
b[t]=i;c[t]=k;
t++;
}
}
for(i=t-1;i>0;i--)
{
for(j=t-1;j>t-i-1;j--)
{
if(d[j]>d[j-1])
{
p=d[j];
d[j]=d[j-1];
d[j-1]=p;
q=b[j];
b[j]=b[j-1];
b[j-1]=q;
q=c[j];
c[j]=c[j-1];
c[j-1]=q;
}
else;
}
}
for(m=0;m<t;m++)
printf("(%d,%d,%d)-(%d,%d,%d)=%.2f\n",a[b[m]][0],a[b[m]][1],a[b[m]][2],a[c[m]][0],a[c[m]][1],a[c[m]][2],d[m]);
return 0;
} |
64 | 31618 | typedef struct Point
{
int x;
int y;
int z;
}Point; //?????????
double Distance(Point *p1,Point *p2)
{
int x=(p1->x)-(p2->x);
int y=(p1->y)-(p2->y);
int z=(p1->z)-(p2->z);
double temp=(double)(x*x+y*y+z*z);
return sqrt(temp);
} //???????
void Input(Point *p[],int n)
{
int i;
for(i=0;i<n;i++)
{
p[i]=(Point *)malloc(sizeof(Point));
cin>>p[i]->x>>p[i]->y>>p[i]->z;
}
} //??n?????
void Output(Point *p1,Point *p2)
{
printf("(%d,%d,%d)-(%d,%d,%d)=%.2f\n\n",p1->x,p1->y,p1->z,p2->x,p2->y,p2->z,Distance(p1,p2));
}
int main()
{
int n,i,j;
cin>>n;
Point *p[15];
Input(p,n);
double a[60];
int k=0;
for(i=0;i<n;i++)
{
for(j=i+1;j<n;j++)
{
int t=0;
while(t<k+1 &&(a[t]-Distance(p[i],p[j])>0.00001||Distance(p[i],p[j])-a[t]>0.00001))
{
t++;
}
if(t==k+1)
{
a[k]=Distance(p[i],p[j]);
k++;
}
}
} //??????????????a?
int count=k; //??a????
for(i=0;i<count;i++)
{
for(j=i+1;j<count;j++)
{
if(a[i]<a[j])
{
double temp=a[i];
a[i]=a[j];
a[j]=temp;
}
}
} //??a[]??
k=0;
while(k<count)
{
for(i=0;i<n;i++)
{
for(j=i+1;j<n;j++)
{
if(a[k]>Distance(p[i],p[j]))
{
if(a[k]-Distance(p[i],p[j])<0.000001)
Output(p[i],p[j]);
}
else
{
if(Distance(p[i],p[j])-a[k]<0.000001)
Output(p[i],p[j]);
}
}
}
k++;
} //?????????????????????????
return 0;
} |
64 | 31619 |
struct Point
{
int x1;
int x2;
int x3;
}point1,point2,p[11];
struct Dis
{
struct Point point1;
struct Point point2;
float d;
}dis[46],tmp;
int main()
{
int n,i,j,m,k;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%d%d%d",&p[i].x1,&p[i].x2,&p[i].x3);
}
for(k=0,m=n-1;m>0;m--)
{
for(i=1;i<=m;i++)
{
dis[k+i].point1=p[n-m];
dis[k+i].point2=p[n-m+i];
dis[k+i].d=sqrt((dis[k+i].point1.x1-dis[k+i].point2.x1)*(dis[k+i].point1.x1-dis[k+i].point2.x1)+(dis[k+i].point1.x2-dis[k+i].point2.x2)*(dis[k+i].point1.x2-dis[k+i].point2.x2)+(dis[k+i].point1.x3-dis[k+i].point2.x3)*(dis[k+i].point1.x3-dis[k+i].point2.x3));
}
k=k+m;
}
for(i=1;i<(n*(n-1)/2);i++)
{
for(j=1;j<=(n*(n-1)/2-i);j++)
{
if(dis[j].d<dis[j+1].d)
{
tmp=dis[j];
dis[j]=dis[j+1];
dis[j+1]=tmp;
}
}
}
for(i=1;i<=n*(n-1)/2;i++)
{
printf("(%d,%d,%d)-(%d,%d,%d)=%.2f\n",dis[i].point1.x1,dis[i].point1.x2,dis[i].point1.x3,dis[i].point2.x1,dis[i].point2.x2,dis[i].point2.x3,dis[i].d);
}
return 0;
}
|
64 | 31620 | struct zuobiao
{
int x;
int y;
int z;
};
struct zuhe
{
struct zuobiao dian1;
struct zuobiao dian2;
double s;
};
double juli(int x3,int y3,int z3,int x4,int y4,int z4)
{
double d;
d=(x4-x3)*(x4-x3)+(y4-y3)*(y4-y3)+(z4-z3)*(z4-z3);
d=sqrt(d);
return d;
}
int main()
{
struct zuobiao dian[20];
struct zuhe zu[100];
struct zuhe c;
int n,m,i,j,k=0;
double l;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d%d%d",&dian[i].x,&dian[i].y,&dian[i].z);
}
m=n*(n-1)/2;
for(i=0;i<m;i++)
{
for(j=i+1;j<n;j++)
{
l=juli(dian[i].x,dian[i].y,dian[i].z,dian[j].x,dian[j].y,dian[j].z);
zu[k].dian1=dian[i];
zu[k].dian2=dian[j];
zu[k].s=l;
k++;
}
}
for(i=1;i<m;i++)
{
for(j=0;j<m-1;j++)
{
if(zu[j].s<zu[j+1].s)
{
c=zu[j];
zu[j]=zu[j+1];
zu[j+1]=c;
}
}
}
for(i=0;i<m;i++)
{
printf("(%d,%d,%d)-(%d,%d,%d)=%.2lf\n",zu[i].dian1.x,zu[i].dian1.y,zu[i].dian1.z,zu[i].dian2.x,zu[i].dian2.y,zu[i].dian2.z,zu[i].s);
}
}
|
64 | 31621 | int x[20], y[20], z[20],p[1100];
int main() {
int i, n, j, plen;
for (plen = 0, scanf("%d", &n), i = n - 1; i >= 0; i--) {
scanf("%d%d%d", &x[i], &y[i], &z[i]);
for (j = n - 1; j > i; j--, plen++)
p[plen] = ((x[i] - x[j]) * (x[i] - x[j]) + (y[i] - y[j]) * (y[i] - y[j])+ (z[i] - z[j]) * (z[i] - z[j])) * 1000
+ i * 20 + j;
}
for (i=0;i<plen;i++){
for (j=i+1;j<plen;j++)
if (p[i]<p[j]){
n=p[i];
p[i]=p[j];
p[j]=n;
}
printf("(%d,%d,%d)-(%d,%d,%d)=%.2lf\n", x[p[i]%20],y[p[i]%20],z[p[i]%20], x[(p[i]%1000)/20],y[(p[i]%1000)/20],z[(p[i]%1000)/20],sqrt(p[i]/1000));
}
}
|
64 | 31622 | /*
* 1.cpp
*
* Created on: 2012-10-8
* Author: Lixurong
*/
int runnian( int a );
int main()
{
int n, k;//????
cin >> n;//????
k = n*(n-1)/2;//????
double a[n][3];//????
double b[k][3];//????
for( int i=0; i<n; i++ )//????
{
cin >> a[i][0] >> a[i][1] >> a[i][2];
}
int p=0;
for( int i=0; i<n-1; i++ )//??????
{
for( int j=i+1; j<n; j++ )
{
b[p][1]=i;
b[p][2]=j;
b[p][0]=sqrt(pow((a[i][0]-a[j][0]),2)+pow((a[i][1]-a[j][1]),2)+pow((a[i][2]-a[j][2]),2));
p++;
}
}
for( int i=0; i<k-1; i++ )//????
{
for( int j=0;j<k-1; j++ )
{
if( b[j][0]<b[j+1][0] )
{
double h=b[j][0];
b[j][0]=b[j+1][0];
b[j+1][0]=h;
int s=(int)b[j][1];
b[j][1]=b[j+1][1];
b[j+1][1]=s;
int e=(int)b[j][2];
b[j][2]=b[j+1][2];
b[j+1][2]=e;
}
}
}
for( int i=0; i<k; i++ )//????
{
cout << "(" << fixed << setprecision(0) << a[(int)b[i][1]][0] << "," << a[(int)b[i][1]][1] << "," << a[(int)b[i][1]][2]
<< ")-(" << a[(int)b[i][2]][0] << "," << a[(int)b[i][2]][1] << "," << a[(int)b[i][2]][2]
<< ")=" << fixed << setprecision(2) << b[i][0];
if( i!=k-1 )
cout << endl;
}
return 0;
}
|
64 | 31623 | struct dis
{
int from[4];
int to[4];
double d;
}dis[6000]; //???????
int main()
{
int n,p[11][4],i,j,t=0;
cin>>n;
for (i=1;i<=n;i++)
for (j=1;j<=3;j++)
cin>>p[i][j]; //??????????????
for (i=1;i<=n-1;i++)
for (j=i+1;j<=n;j++)
{
t++;
dis[t].from[1]=p[i][1];
dis[t].from[2]=p[i][2];
dis[t].from[3]=p[i][3];
dis[t].to[1]=p[j][1];
dis[t].to[2]=p[j][2];
dis[t].to[3]=p[j][3]; //??????????
dis[t].d=sqrt(pow(p[i][1]-p[j][1],2.0)+pow(p[i][2]-p[j][2],2.0)+pow(p[i][3]-p[j][3],2.0));//??????????????????
}
for (i=1;i<=t-1;i++)
for (j=1;j<=t-i;j++)
{
if (dis[j].d<dis[j+1].d)
{
dis[0]=dis[j];
dis[j]=dis[j+1];
dis[j+1]=dis[0];
} //????????
}
for (i=1;i<=t;i++)
{
cout<<"("<<dis[i].from[1]<<","<<dis[i].from[2]<<","<<dis[i].from[3]<<")"<<"-";
cout<<"("<<dis[i].to[1]<<","<<dis[i].to[2]<<","<<dis[i].to[3]<<")"<<"=";
cout<<fixed<<setprecision(2)<<dis[i].d<<endl; //?????????
}
return 0;
}
|
64 | 31624 | int main(){
int n,i,j,h;
double temp;
double x[30],y[45][7];
scanf("%d",&n);
for(i=0;i<3*n;i++){
scanf("%lf",&(x[i]));
}
h=0;
for(i=0;i<n-1;i++){
for(j=i;j<n-1;j++){
y[h][0]=x[3*i];
y[h][1]=x[3*i+1];
y[h][2]=x[3*i+2];
h++;
}
}
h=0;
for(i=0;i<n-1;i++){
for(j=i+1;j<n;j++){
y[h][3]=x[3*j];
y[h][4]=x[3*j+1];
y[h][5]=x[3*j+2];
y[h][6]=sqrt((y[h][0]-y[h][3])*(y[h][0]-y[h][3])+(y[h][1]-y[h][4])*(y[h][1]-y[h][4])+(y[h][2]-y[h][5])*(y[h][2]-y[h][5]));
h++;
}
}
for(i=0;i<(n*(n-1)/2)-1;i++){
for(j=0;j<(n*(n-1)/2)-1;j++){
if(y[j][6]<y[j+1][6]){
for(h=0;h<7;h++){
temp=y[j][h];
y[j][h]=y[j+1][h];
y[j+1][h]=temp;
}
}
}
}
for(i=0;i<(n*(n-1)/2);i++){
printf("(%.0lf,%.0lf,%.0lf)-(%.0lf,%.0lf,%.0lf)=%.2lf\n",y[i][0],y[i][1],y[i][2],y[i][3],y[i][4],y[i][5],y[i][6]);
}
return 0;
} |
64 | 31625 | int main()
{
int n;
scanf("%d",&n);
int i,j,k;
double sz[100],e;
struct q{
int x,y,z;
}a[100],b[100],c[100],m;
for(i=0;i<n;i++)
{
scanf("%d%d%d",&a[i].x,&a[i].y,&a[i].z);
}
int l=0;
for(i=0;i<n;i++)
{
for(j=i+1;j<n;j++)
{
sz[l]=sqrt((a[i].x-a[j].x)*(a[i].x-a[j].x)+(a[i].y-a[j].y)*(a[i].y-a[j].y)+(a[i].z-a[j].z)*(a[i].z-a[j].z));
b[l]=a[i];
c[l]=a[j];
l++;
}
}
for(k=1;k<=l;k++)
{
for(i=0;i<l-k;i++)
{
if(sz[i]<sz[i+1])
{
e=sz[i];
sz[i]=sz[i+1];
sz[i+1]=e;
m=b[i];
b[i]=b[i+1];
b[i+1]=m;
m=c[i];
c[i]=c[i+1];
c[i+1]=m;
}
}
}
for(i=0;i<l;i++)
{
printf("(%d,%d,%d)-(%d,%d,%d)=%.2lf\n",b[i].x,b[i].y,b[i].z,c[i].x,c[i].y,c[i].z,sz[i]);
}
return 0;
}
|
64 | 31626 | /*???? ??*/
struct distance
{
int x1,y1,z1,x2,y2,z2;
double s;
}d[45],temp;
int main()
{
int n,i,j,k,a[10][3];
cin>>n;
for(i=0;i<n;i++){
for(j=0;j<3;j++)
cin>>a[i][j];}
k=0;
while(k<n*(n-1)/2){
for(i=0;i<n;i++){
for(j=i+1;j<n;j++){
d[k].x1=a[i][0];
d[k].y1=a[i][1];
d[k].z1=a[i][2];
d[k].x2=a[j][0];
d[k].y2=a[j][1];
d[k].z2=a[j][2];
d[k].s =sqrt((d[k].x1-d[k].x2)*(d[k].x1-d[k].x2)
+(d[k].y1-d[k].y2)*(d[k].y1-d[k].y2)
+(d[k].z1-d[k].z2)*(d[k].z1-d[k].z2));
k++;}}}
for(i=0;i<n*(n-1)/2;i++){
for(j=0;j<n*(n-1)/2-1;j++){
if(d[j].s<d[j+1].s)
{temp=d[j];d[j]=d[j+1];d[j+1]=temp;}}}
for(i=0;i<n*(n-1)/2;i++)
cout<<"("<<d[i].x1<<","<<d[i].y1<<","<<d[i].z1
<<")-("<<d[i].x2<<","<<d[i].y2<<","<<d[i].z2<<")="
<<fixed<<setprecision(2)<<d[i].s<<endl;
return 0;
}
|
64 | 31627 | int main(){
int x[1000],y[1000],z[1000],n,i,m,j,u[1000],v[1000],c,d;
double s[100],b;
b=0;
c=0;
d=0;
m=0;
scanf("%d",&n);
for( i=0;i<n;i++)
scanf("%d%d%d",&x[i],&y[i],&z[i]);
for(i=0;i<n;i++){
for(j=n-1;j>i;j--){
b=(x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j])+(z[i]-z[j])*(z[i]-z[j]);
s[m]= sqrt(b);
u[m]=i;
v[m]=j;
m++;
}
}
for(i=0;i<n*(n-1)/2;i++){
if(n==2)
break;
for(j=0;j<n*(n-1)/2;j++){
if(s[j]<s[j+1]){
b=s[j];
s[j]=s[j+1];
s[j+1]=b;
c=u[j];
u[j]=u[j+1];
u[j+1]=c;
d=v[j];
v[j]=v[j+1];
v[j+1]=d;
}
}
}
for(i=0;i<n*(n-1)/2;i++){
if(n==2)
break;
if(s[i]==s[i+1]){
if(u[i]>u[i+1]){
c=u[i];
u[i]=u[i+1];
u[i+1]=c;
d=v[i];
v[i]=v[i+1];
v[i+1]=d;
}
if(u[i]==u[i+1]){
if(v[i]>v[i+1]){
c=u[i];
u[i]=u[i+1];
u[i+1]=c;
d=v[i];
v[i]=v[i+1];
v[i+1]=d;
}
}
}
}
for(i=0;i<n*(n-1)/2;i++){
if(n==2)
printf("(%d,%d,%d)-(%d,%d,%d)=%.2lf\n",x[u[0]],y[u[0]],z[u[0]],x[v[0]],y[v[0]],z[v[0]],s[0]);
else{
printf("(%d,%d,%d)-(%d,%d,%d)=%.2lf\n",x[u[i]],y[u[i]],z[u[i]],x[v[i]],y[v[i]],z[v[i]],s[i]);
}
}
return 0;
}
|
64 | 31628 | int main()
{
int a[10][3],m,i,j,k=0,dis[100][2],b[100],temp,x,y,z;
double distance[100]={0};
scanf("%d",&m);
for(i=0;i<m;i++)
{
for(j=0;j<3;j++)
{
scanf("%d",&a[i][j]);
}
}
for(i=0;i<m;i++)
{
for(j=i+1;j<m;j++)
{
x=a[i][0]-a[j][0];
y=a[i][1]-a[j][1];
z=a[i][2]-a[j][2];
temp=pow(x,2)+pow(y,2)+pow(z,2);
distance[k]=sqrt(temp);
b[k]=k;
dis[k][0]=i;
dis[k][1]=j;
k++;
}
}
for(i=0;i<k;i++)
{
for(j=i+1;j<k;j++)
{
if(distance[b[i]]<distance[b[j]])
{
temp=b[i];
b[i]=b[j];
b[j]=temp;
}
else if(distance[b[i]]==distance[b[j]])
{
if(dis[b[i]][0]>dis[b[j]][0])
{
temp=b[i];
b[i]=b[j];
b[j]=temp;
}
else if(dis[b[i]][0]==dis[b[j]][0]&&dis[b[i]][1]>dis[b[j]][1])
{
temp=b[i];
b[i]=b[j];
b[j]=temp;
}
}
}
}
for(i=0;i<k;i++)
{
printf("(%d,%d,%d)-(%d,%d,%d)=%.2lf\n",a[dis[b[i]][0]][0],a[dis[b[i]][0]][1],a[dis[b[i]][0]][2],a[dis[b[i]][1]][0],a[dis[b[i]][1]][1],a[dis[b[i]][1]][2],distance[b[i]]);
}
return 0;
} |
64 | 31629 |
double juli(int i1, int i2, int i3, int i4, int i5, int i6);
int main()
{
int n, i, j, k, q = 0, m;
double temp;
int a[100], b[100], c[100], f[100], g[100];
double e[100];
scanf("%d", &n);
for(i = 0; i < n; i++)
{
scanf("%d%d%d", &a[i], &b[i], &c[i]);
}
for(i = 0; i < n; i++)
{
for(j = i+1; j < n; j++)
{
e[q] = juli(a[i], b[i], c[i], a[j], b[j], c[j]);
f[q] = i;
g[q] = j;
q++;
}
}
m = n*(n-1)/2;
for(k = 1; k <= m; k++)
{
for(i = 0; i < m-k; i++)
{
if(e[i] < e[i+1])
{
temp = e[i+1];
e[i+1] = e[i];
e[i] = temp;
temp = f[i+1];
f[i+1] = f[i];
f[i] = temp;
temp = g[i+1];
g[i+1] = g[i];
g[i] = temp;
}
}
}
for(i = 0; i < m; i++)
printf("(%d,%d,%d)-(%d,%d,%d)=%.2lf\n",a[f[i]], b[f[i]], c[f[i]], a[g[i]], b[g[i]], c[g[i]], e[i]);
return 0;
}
double juli(int i1, int i2, int i3, int i4, int i5, int i6)
{
double s;
s = sqrt((i4-i1)*(i4-i1) + (i5-i2)*(i5-i2) + (i6-i3)*(i6-i3));
return s;
}
|
64 | 31630 | int main() //?????
{
double a[11][4],b[46][7]; //????:a[i][k]?i????j????b[][]???????
double c[46],p; //c[]??????????????p
int i,j,k=0,n; //????n,????i,j,k
cin>>n;
for(i=1;i<=n;i++) //??????
{
for(j=1;j<=3;j++)
{
cin>>a[i][j];
}
}
for(i=1;i<=n-1;i++) //?????????????
{
for(j=i+1;j<=n;j++)
{
k++;
c[k]=sqrt((a[i][1]-a[j][1])*(a[i][1]-a[j][1])+(a[i][2]-a[j][2])*(a[i][2]-a[j][2])+(a[i][3]-a[j][3])*(a[i][3]-a[j][3]));
b[k][1]=a[i][1];
b[k][2]=a[i][2];
b[k][3]=a[i][3];
b[k][4]=a[j][1];
b[k][5]=a[j][2];
b[k][6]=a[j][3];
}
}
for(i=1;i<=k-1;i++) //?????????????????
{
for(j=1;j<=k-i;j++)
{
if(c[j]<c[j+1])
{
p=c[j];
c[j]=c[j+1];
c[j+1]=p;
p=b[j][1];
b[j][1]=b[j+1][1];
b[j+1][1]=p;
p=b[j][2];
b[j][2]=b[j+1][2];
b[j+1][2]=p;
p=b[j][3];
b[j][3]=b[j+1][3];
b[j+1][3]=p;
p=b[j][4];
b[j][4]=b[j+1][4];
b[j+1][4]=p;
p=b[j][5];
b[j][5]=b[j+1][5];
b[j+1][5]=p;
p=b[j][6];
b[j][6]=b[j+1][6];
b[j+1][6]=p;
}
}
}
for(i=1;i<=k;i++) //????????????????????
printf("(%d,%d,%d)-(%d,%d,%d)=%.2f\n",(int)b[i][1],(int)b[i][2],(int)b[i][3],(int)b[i][4],(int)b[i][5],(int)b[i][6],c[i]);
return 0;
}
|
64 | 31631 | int main()
{
int n,i,j,k=0;
double d[10][10]={0},D[45]={0},t;
struct point
{int x;
int y;
int z;
}p[10];
scanf("%d",&n);
for(i=0;i<n;i++)
{scanf("%d%d%d",&p[i].x,&p[i].y,&p[i].z);}
for(i=0;i<n-1;i++)
{for(j=i+1;j<n;j++)
{d[i][j]=sqrt((p[i].x-p[j].x)*(p[i].x-p[j].x)+(p[i].y-p[j].y)*(p[i].y-p[j].y)+(p[i].z-p[j].z)*(p[i].z-p[j].z));
D[k]=d[i][j];
k++;}}
for(i=0;i<n*(n-1)/2-1;i++)
{for(j=0;j<n*(n-1)/2-i-1;j++)
{if(D[j]<D[j+1])
{t=D[j];
D[j]=D[j+1];
D[j+1]=t;}}}
for(k=0;k<n*(n-1)/2;k++)
{if(D[k]==D[k+1])
continue;
else
{for(i=0;i<n-1;i++)
{for(j=i+1;j<n;j++)
if(d[i][j]==D[k])
{printf("(%d,%d,%d)-(%d,%d,%d)=%.2f\n",p[i].x,p[i].y,p[i].z,p[j].x,p[j].y,p[j].z,d[i][j]);}}}}
return 0;
} |
64 | 31632 | int n, t = 1;
struct dian
{
int x;
int y;
int z;
}a[11], *p = &a[1];
struct ju
{
int p1;
int p2;
double d;
}b[100], temp;
void fsort(int k)
{
int i;
for(i = k + 1; i <= t; i++)
{
if(b[k].d < b[i].d)
{
temp = b[k];
b[k] = b[i];
b[i] = temp;
}
}
}
int main()
{
int i, j;
cin >> n;
cout << fixed << setprecision(2);
for(i = 1; i <= n; i++)
{
cin >> p->x >> p->y >> p->z;
p++;
}
for(i = 1; i <= n - 1; i++)
{
for(j = i + 1; j <= n; j++)
{
b[t].p1 = i;
b[t].p2 = j;
b[t].d = pow(pow(a[i].x - a[j].x, 2.0) + pow(a[i].y - a[j].y, 2.0) + pow(a[i].z - a[j].z, 2.0), 0.5);
t++;
}
}
t--;
for(i = 1; i < t; i++)
{
fsort(i);
}
for(i = 1; i < t; i++)
{
if(b[i].d == b[i + 1].d)
{
if(b[i].p1 > b[i + 1].p1)
{
temp = b[i + 1];
b[i + 1] = b[i];
b[i] = temp;
}
else
{
if(b[i].p1 == b[i + 1].p1 && b[i].p2 > b[i + 1].p2)
{
temp = b[i + 1];
b[i + 1] = b[i];
b[i] = temp;
}
}
}
}
for(i = 1; i <= t; i++)
{
cout << "(" << a[b[i].p1].x << "," << a[b[i].p1].y << "," << a[b[i].p1].z << ")" << "-" << "(" << a[b[i].p2].x << "," << a[b[i].p2].y << "," << a[b[i].p2].z << ")" << "=" << b[i].d << endl;
}
return 0;
}
|
64 | 31633 | const int N=10;
int n,m,x[N],y[N],z[N];
int p1[N*N/2],p2[N*N/2];
int main()
{
cin>>n;
for (int i=0;i<n;i++)
cin>>x[i]>>y[i]>>z[i];
m=0;
for (int i=0;i<n;i++)
for (int j=i+1;j<n;j++)
{
p1[m]=i;
p2[m++]=j;
}
for (int i=0;i<m;i++)
for (int j=0;j<m-1;j++)
{
//int &c1=p1[j],&c2=p2[j],&d1=p1[j+1],&d2=p2[j+1];
int c1=p1[j],c2=p2[j],d1=p1[j+1],d2=p2[j+1];
if ((x[c1]-x[c2])*(x[c1]-x[c2])+(y[c1]-y[c2])*(y[c1]-y[c2])+(z[c1]-z[c2])*(z[c1]-z[c2])<
(x[d1]-x[d2])*(x[d1]-x[d2])+(y[d1]-y[d2])*(y[d1]-y[d2])+(z[d1]-z[d2])*(z[d1]-z[d2]))
{
/*int temp;
temp=c1;
c1=d1;
d1=temp;
temp=c2;
c2=d2;
d2=temp;*/
int temp;
temp=p1[j];
p1[j]=p1[j+1];
p1[j+1]=temp;
temp=p2[j];
p2[j]=p2[j+1];
p2[j+1]=temp;
}
}
for (int i=0;i<m;i++)
{
int c1=p1[i],c2=p2[i];
printf("(%d,%d,%d)-(%d,%d,%d)=%.2lf\n",x[c1],y[c1],z[c1],x[c2],y[c2],z[c2],sqrt(((double)x[c1]-(double)x[c2])*((double)x[c1]-(double)x[c2])+((double)y[c1]-(double)y[c2])*((double)y[c1]-(double)y[c2])+((double)z[c1]-(double)z[c2])*((double)z[c1]-(double)z[c2])));
}
return 0;
} |
64 | 31634 |
int main() {
int X[120], Y[120], Z[120], I[1020], J[1020];
double R2[1020], mid;
int n;
int i, x, y, z, a, b, pai, mi;
cin >> n;
for (i = 1; i <= n; i++) {
cin >> x >> y >> z;
X[i] = x;
Y[i] = y;
Z[i] = z;
}
int r = 1;
for (a = 1; a <= n; a++) {
for (b = 2; b <= n; b++) {
if (b <= a) {
continue;
}
I[r] = a;
J[r] = b;
R2[r] = (X[a] - X[b]) * (X[a] - X[b]) + (Y[a] - Y[b]) * (Y[a]
- Y[b]) + (Z[a] - Z[b]) * (Z[a] - Z[b]);
r++;
}
}
pai = n * (n - 1) / 2 + 1;
while (pai--) {
for (i = 1; i < r - 1; i++) {
if (R2[i] < R2[i + 1]) {
mid = R2[i];
R2[i] = R2[i + 1];
R2[i + 1] = mid;
mi = J[i];
J[i] = J[i + 1];
J[i + 1] = mi;
mi = I[i];
I[i] = I[i + 1];
I[i + 1] = mi;
}
}
}
for (i = 1; i <= n * (n - 1) / 2; i++) {
R2[i] = sqrt(R2[i]);
cout << "(" << X[I[i]] << "," << Y[I[i]] << "," << Z[I[i]] << ")-("
<< X[J[i]] << "," << Y[J[i]] << "," << Z[J[i]] << ")=" << fixed
<< setprecision(2) << R2[i] << endl;
}
return 0;
} |
64 | 31635 | int main(){
int n,i,j,k,f;
k=0;
int x[10];
int y[10];
int z[10];
int m[50][6];
double r[50];
double e;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d %d %d",&x[i],&y[i],&z[i]);
}
for(i=0;i<n-1;i++){
for(j=n-1;j>i;j--){
r[k]=sqrt(1.0*((x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j])+(z[i]-z[j])*(z[i]-z[j])));
m[k][0]=x[i];
m[k][1]=y[i];
m[k][2]=z[i];
m[k][3]=x[j];
m[k][4]=y[j];
m[k][5]=z[j];
k++;
}
}
for(i=1;i<=n*(n-1)/2;i++){
for(j=0;j<n*(n-1)/2-i;j++){
if(r[j]>=r[j+1]){
e=r[j+1];
r[j+1]=r[j];
r[j]=e;
f=m[j+1][0];
m[j+1][0]=m[j][0];
m[j][0]=f;
f=m[j+1][1];
m[j+1][1]=m[j][1];
m[j][1]=f;
f=m[j+1][2];
m[j+1][2]=m[j][2];
m[j][2]=f;
f=m[j+1][3];
m[j+1][3]=m[j][3];
m[j][3]=f;
f=m[j+1][4];
m[j+1][4]=m[j][4];
m[j][4]=f;
f=m[j+1][5];
m[j+1][5]=m[j][5];
m[j][5]=f;
}
}
}
for(i=n*(n-1)/2-1;i>=0;i--){
printf("(%d,%d,%d)-(%d,%d,%d)=%.2lf\n",m[i][0],m[i][1],m[i][2],m[i][3],m[i][4],m[i][5],r[i]);
}
return 0;
} |
64 | 31636 |
int main()
{
struct distance
{
int num;
int x[4];
int y[4];
double d;
}a[N*(N-1)/2],t;
double dis(int x[3],int y[3]);
int p[N][3];
int n,i,j,r,k;
scanf("%d",&n);
for(i=0;i<n;i++)
{
for(j=0;j<3;j++)
{
scanf("%d",&p[i][j]);
}
}
for(i=0,r=0;i<n-1;i++)
{
for(j=i+1;j<n;j++)
{
a[r].d=dis(p[i],p[j]);
//printf("%.2lf\n",a[r].d);
for(k=0;k<3;k++)
{
a[r].x[k]=p[i][k];
a[r].y[k]=p[j][k];
}
a[r].x[3]=i;
a[r].y[3]=j;
r++;
}
}
n=r;
for(i=0;i<n-1;i++)
{
for(j=0;j<n-i-1;j++)
{
if(a[j].d<a[j+1].d)
{
t=a[j];
a[j]=a[j+1];
a[j+1]=t;
}
else if(a[j].d==a[j+1].d)
{
if(a[j].x[3]>a[j+1].x[3])
{
t=a[j];
a[j]=a[j+1];
a[j+1]=t;
}
}
}
}
for(i=0;i<n;i++)
{
printf("(%d,%d,%d)-(%d,%d,%d)=",a[i].x[0],a[i].x[1],a[i].x[2],a[i].y[0],a[i].y[1],a[i].y[2]);
printf("%.2lf\n",a[i].d);
}
return 0;
}
double dis(int x[3],int y[3])
{
double z=0;
int i;
for(i=0;i<3;i++)
{
z=z+1.0*(y[i]-x[i])*(y[i]-x[i]);
}
z=sqrt(z);
return z;
} |
64 | 31637 | void main()
{
int n,i,j,k,y,z;
int a[10],b[10],c[10],p[45],q[45];
float m[45],x,t;
scanf("%d",&n);
for (i=0;i<n;i++)
scanf("%d%d%d",&a[i],&b[i],&c[i]);
k=0;
for (i=0;i<n-1;i++)
{
for (j=i+1;j<n;j++)
{
x=(a[i]-a[j])*(a[i]-a[j])+(b[i]-b[j])*(b[i]-b[j])+(c[i]-c[j])*(c[i]-c[j]);
p[k]=i;
q[k]=j;
m[k]=sqrt(x);
k++;
}
}
for (i=k-1;i>=0;i--)
{
for (j=k-1;j>=k-i-1;j--)
{
if (m[j+1]>m[j])
{
t=m[j];
m[j]=m[j+1];
m[j+1]=t;
y=p[j];
p[j]=p[j+1];
p[j+1]=y;
z=q[j];
q[j]=q[j+1];
q[j+1]=z;
}
}
}
for (i=0;i<k;i++)
{
y=p[i];
z=q[i];
printf("(%d,%d,%d)-(%d,%d,%d)=%.2f\n",a[y],b[y],c[y],a[z],b[z],c[z],m[i]);
}
}
|
64 | 31638 | int main()
{
int n,i,j,a[80],b[80],k=0,m,code1,code2;
double x[13],y[13],z[13],S[80],t;
cin>>n;
for(i=0;i<n;i++)
cin>>x[i]>>y[i]>>z[i];
for(i=0;i<n-1;i++)
for(j=i+1;j<n;j++)//????Cn2
{
S[k]=sqrt((x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j])+(z[i]-z[j])*(z[i]-z[j]));//???
a[k]=i;b[k]=j;
k++;//
}
for(i=0;i<k;i++)
for(j=k-1;j>i;j--)//?????
if(S[j]>S[j-1])
{
t=S[j];
S[j]=S[j-1];
S[j-1]=t;//????
m=a[j];
a[j]=a[j-1];
a[j-1]=m;//???????
m=b[j];
b[j]=b[j-1];
b[j-1]=m;//???????
}
for(i=0;i<k;i++)
{
code1=a[i];code2=b[i];
cout<<"("<<(int)x[code1]<<","<<(int)y[code1]<<","<<(int)z[code1]<<")-("<<(int)x[code2]<<","<<(int)y[code2]<<","<<(int)z[code2]<<")=";
cout<<fixed<<setprecision(2);
cout<<S[i]<<endl;
}
return 0;
} |
64 | 31639 | int main()
{
int x[10],X1[45],X2[45],xjl[45];
int y[10],Y1[45],Y2[45],yjl[45];
int z[10],Z1[45],Z2[45],zjl[45];
int he[45];
double juli[45];
int n, i;
scanf("%d", &n);
for(i=0;i<n;i++){
scanf("%d%d%d",&(x[i]),&(y[i]),&(z[i]));
}
int m,f=0;
for(m=0 ; m < n-1 ; m++){
for(i = m+1; i < n ; i++){
xjl[f]=(x[m]-x[i])*(x[m]-x[i]);
yjl[f]=(y[m]-y[i])*(y[m]-y[i]);
zjl[f]=(z[m]-z[i])*(z[m]-z[i]);
X1[f]=x[m];
X2[f]=x[i];
Y1[f]=y[m];
Y2[f]=y[i];
Z1[f]=z[m];
Z2[f]=z[i];
f++;
}
}
for(m=0 ; m < f ; m++){
he[m]=xjl[m]+yjl[m]+zjl[m];
}
for(m=0 ; m < f ; m++){
juli[m]=sqrt(he[m]);
}
double e;
int h;
for(m=1 ; m < f ; m++){
for(i = 0; i < f - m; i++){
if(juli[i] < juli[i+1]){
e = juli[i+1];
juli[i+1] = juli[i];
juli[i] = e;
h = X1[i+1];
X1[i+1] = X1[i];
X1[i] = h;
h = X2[i+1];
X2[i+1] = X2[i];
X2[i] = h;
h = Y1[i+1];
Y1[i+1] = Y1[i];
Y1[i] = h;
h = Y2[i+1];
Y2[i+1] = Y2[i];
Y2[i] = h;
h = Z1[i+1];
Z1[i+1] = Z1[i];
Z1[i] = h;
h = Z2[i+1];
Z2[i+1] = Z2[i];
Z2[i] = h;
}
}
}
for(m=0;m<f;m++){
printf("(%d,%d,%d)-(%d,%d,%d)=%.2lf\n",X1[m],Y1[m],Z1[m],X2[m],Y2[m],Z2[m],juli[m]);
}
return 0;
}
|
64 | 31640 | struct node
{
int x,y,z;
}p[10];
struct d
{
double d;
int p1,p2;
}dis[45];
int n,t=0;
double dist(int x,int y)
{
int dx=p[x].x-p[y].x,dy=p[x].y-p[y].y,dz=p[x].z-p[y].z;
return sqrt(1.0*dx*dx+1.0*dy*dy+1.0*dz*dz);
}
void swap(int i,int j)
{
struct d tmp=dis[i];
dis[i]=dis[j];
dis[j]=tmp;
}
void init()
{
int i,j;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d%d%d",&p[i].x,&p[i].y,&p[i].z);
}
for(i=0;i<n;i++)
{
for(j=i+1;j<n;j++)
{
dis[t].p1=i;dis[t].p2=j;
dis[t].d=dist(i,j);
t++;
}
}
}
void solve()
{
int i,j;
for(i=0;i<t;i++)
{
for(j=0;j<t-i-1;j++)
{
if(dis[j].d<dis[j+1].d)
{
swap(j,j+1);
}
}
}
}
void print()
{
int i;
for(i=0;i<t;i++)
{
printf("(%d,%d,%d)-(%d,%d,%d)=%.2lf\n",p[dis[i].p1].x,p[dis[i].p1].y,p[dis[i].p1].z,
p[dis[i].p2].x,p[dis[i].p2].y,p[dis[i].p2].z,dis[i].d);
}
}
int main()
{
init();
solve();
print();
return 0;
}
|
64 | 31641 | int main(){
int n,i,j,k,t;
int x[101],y[101],z[101],a[46],b[46];
double d[46],t1;
scanf("%d",&n);
for (i=1;i<=n;i++)
scanf("%d%d%d",&x[i],&y[i],&z[i]);
k=0;
for (i=1;i<=n-1;i++)
for (j=i+1;j<=n;j++){
k=k+1;
d[k]=sqrt(1.0*(x[i]-x[j])*(x[i]-x[j])+1.0*(y[i]-y[j])*(y[i]-y[j])+1.0*(z[i]-z[j])*(z[i]-z[j]));
a[k]=i;
b[k]=j;
}
for (i=1;i<=k;i++)
for (j=1;j<=k-i;j++)
if (d[j]<d[j+1])
{
t1=d[j];
d[j]=d[j+1];
d[j+1]=t1;
t=a[j];
a[j]=a[j+1];
a[j+1]=t;
t=b[j];
b[j]=b[j+1];
b[j+1]=t;
}
for (i=1;i<=k;i++)
printf("(%d,%d,%d)-(%d,%d,%d)=%.2lf\n",x[a[i]],y[a[i]],z[a[i]],x[b[i]],y[b[i]],z[b[i]],d[i]);
return 0;
} |
64 | 31642 | int main()
{
int k,i,n,t,o,p,q=0;
int x[100],y[100],z[100],one[100],two[100];
double e,sz[100];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d%d%d",&x[i],&y[i],&z[i]);
}
for(i=0;i<n-1;i++)
{
for(p=i+1;p<n;p++)
{
sz[q]=sqrt((x[i]-x[p])*(x[i]-x[p])+(y[i]-y[p])*(y[i]-y[p])+(z[i]-z[p])*(z[i]-z[p]));
one[q]=i;two[q]=p;
q++;
}
}
for(k=1;k<q+1;k++)
{
for(i=0;i<q-k;i++)
{
if(sz[i]<sz[i+1])
{
e=sz[i+1];t=one[i+1];o=two[i+1];
sz[i+1]=sz[i];one[i+1]=one[i];two[i+1]=two[i];
sz[i]=e;one[i]=t;two[i]=o;
}
}
}
for(i=0;i<q;i++)
{
printf("(%d,%d,%d)-(%d,%d,%d)=%.2lf\n",x[(one[i])],y[(one[i])],z[(one[i])],x[(two[i])],y[(two[i])],z[(two[i])],sz[i]);
}
return 0;
} |
64 | 31643 | int main()
{
int x[10],y[10],z[10],x1[45],y1[45],z1[45],x2[45],y2[45],z2[45],n,m,i,j,k,l,h;
double s[45],e;
scanf("%d",&n);
m=n*(n-1)/2;
for(i=0;i<n;i++)
scanf("%d %d %d",&x[i],&y[i],&z[i]);
l=0;
for(j=0;j<n-1;j++){
for(k=j+1;k<n;k++){
x1[l]=x[j];y1[l]=y[j];z1[l]=z[j];
x2[l]=x[k];y2[l]=y[k];z2[l]=z[k];
s[l]=sqrt((x[j]-x[k])*(x[j]-x[k])+(y[j]-y[k])*(y[j]-y[k])+(z[j]-z[k])*(z[j]-z[k]));
l++;
}
}
for(j=1;j<=m;j++){
for(k=0;k<m-j;k++){
if(s[k]<s[k+1]){
e=s[k];s[k]=s[k+1];s[k+1]=e;
h=x1[k];x1[k]=x1[k+1];x1[k+1]=h;
h=y1[k];y1[k]=y1[k+1];y1[k+1]=h;
h=z1[k];z1[k]=z1[k+1];z1[k+1]=h;
h=x2[k];x2[k]=x2[k+1];x2[k+1]=h;
h=y2[k];y2[k]=y2[k+1];y2[k+1]=h;
h=z2[k];z2[k]=z2[k+1];z2[k+1]=h;
}
}
}
for(i=0;i<m;i++)
printf("(%d,%d,%d)-(%d,%d,%d)=%.2lf\n",x1[i],y1[i],z1[i],x2[i],y2[i],z2[i],s[i]);
return 0;
} |
64 | 31644 | struct zuobiao
{
int x,y,z;
}zuo[10];
struct dis
{
int left[3],right[3];
float d;
}di[100],e;
int main()
{
int l,n,ld,i,j;
scanf("%d",&n);
l=n*(n-1)/2;
ld=0;
for(i=0;i<n;i++)
scanf("%d%d%d",&zuo[i].x,&zuo[i].y,&zuo[i].z);
for(i=0;i<n-1;i++)
for(j=i+1;j<n;j++)
{
di[ld++].d=sqrt(pow(zuo[i].x-zuo[j].x,2)+pow(zuo[i].y-zuo[j].y,2)+pow(zuo[i].z-zuo[j].z,2));
di[ld-1].left[0]=zuo[i].x;
di[ld-1].left[1]=zuo[i].y;
di[ld-1].left[2]=zuo[i].z;
di[ld-1].right[0]=zuo[j].x;
di[ld-1].right[1]=zuo[j].y;
di[ld-1].right[2]=zuo[j].z;
}
for(i=1;i<l;i++)
for(j=0;j<l-i;j++)
if(di[j].d<di[j+1].d)
{
e=di[j];
di[j]=di[j+1];
di[j+1]=e;
}
for(i=0;i<l;i++)
printf("(%d,%d,%d)-(%d,%d,%d)=%.2f\n",di[i].left[0],di[i].left[1],di[i].left[2],di[i].right[0],di[i].right[1],di[i].right[2],di[i].d);
return 0;
}
|
64 | 31645 |
int main(){ int n,i,j,t,t2,t3;
double t1;
int zb[10][3];
double d[60];
int flag[60][2];
scanf("%d",&n);
for(i=0;i<n;i++){
for(j=0;j<3;j++){
scanf("%d",&zb[i][j]);
}
}
t=0;
for(i=0;i<n;i++){
for(j=i+1;j<n;j++){
d[t]=sqrt(1.0*((zb[i][0]-zb[j][0])*(zb[i][0]-zb[j][0])+(zb[i][1]-zb[j][1])*(zb[i][1]-zb[j][1])+(zb[i][2]-zb[j][2])*(zb[i][2]-zb[j][2])));
flag[t][0]=i;
flag[t][1]=j;
t++;
}
}
for(j=0;j<t-1;j++){
for(i=0;i<t-j-1;i++){
if(d[i]<d[i+1]){
t1=d[i];
d[i]=d[i+1];
d[i+1]=t1;
t2=flag[i][0];
flag[i][0]=flag[i+1][0];
flag[i+1][0]=t2;
t3=flag[i][1];
flag[i][1]=flag[i+1][1];
flag[i+1][1]=t3;
}
}
}
for(i=0;i<t;i++){
printf("(%d,%d,%d)",zb[flag[i][0]][0],zb[flag[i][0]][1],zb[flag[i][0]][2]);
printf("-");
printf("(%d,%d,%d)",zb[flag[i][1]][0],zb[flag[i][1]][1],zb[flag[i][1]][2]);
printf("=%.2f",d[i]);
printf("\n");
}
return 0;
}
|
64 | 31646 | double distance(int xa,int ya,int za,int xb,int yb,int zb);
double distance(int xa,int ya,int za,int xb,int yb,int zb){
int sum;
double dis;
sum=(xb-xa)*(xb-xa)+(yb-ya)*(yb-ya)+(zb-za)*(zb-za);
dis=sqrt(sum);
return dis;
}
int main(){
int n,i,t,j,b=0,w=0,te;
double td;
scanf("%d",&n);
struct point{
int x,y,z;
}point[10];
for(i=0;i<n;i++)
scanf("%d %d %d",&point[i].x,&point[i].y,&point[i].z);
struct{
int p,q;
double dist;
}temp[45];
for(i=0;i<45;i++)
temp[i].dist=-1;
for(i=0;i<n;i++)
for(j=0;j<i;j++){
temp[w].p=i;
temp[w].q=j;
temp[w].dist=distance(point[i].x,point[i].y,point[i].z,point[j].x,point[j].y,point[j].z);
w=w+1;
}
for(i=0;i<45;i++)
for(w=0;w<44;w++)
if(temp[w].dist<temp[w+1].dist)
{
te=temp[w+1].p;
temp[w+1].p=temp[w].p;
temp[w].p=te;
te=temp[w+1].q;
temp[w+1].q=temp[w].q;
temp[w].q=te;
td=temp[w+1].dist;
temp[w+1].dist=temp[w].dist;
temp[w].dist=td;
}
for(w=0;w<45;w++){
if(temp[w].p>temp[w].q){
te=temp[w].q;
temp[w].q=temp[w].p;
temp[w].p=te;
}
if(temp[w].dist!=-1)
{
printf("(%d,%d,%d)-",point[temp[w].p].x,point[temp[w].p].y,point[temp[w].p].z);
printf("(%d,%d,%d)=",point[temp[w].q].x,point[temp[w].q].y,point[temp[w].q].z);
printf("%.2lf\n",temp[w].dist);
}
}
return 0;
}
|
64 | 31647 | main()
{
int a,b,c,n,m,l,p,q;
double k;
int x[10][3];
double y[10][10];
double z[10][10];
scanf("%d",&n);
for(a=0;a<=9;a++)
{
for(b=0;b<=9;b++)
y[a][b]=-1;
}
for(a=0;a<=n-1;a++)
{
for(b=0;b<=2;b++)
scanf("%d",&x[a][b]);
}
for(a=0;a<=n-1;a++)
{
for(b=a+1;b<=n-1;b++)
y[a][b]=sqrt((x[a][0]-x[b][0])*(x[a][0]-x[b][0])+(x[a][1]-x[b][1])*(x[a][1]-x[b][1])+(x[a][2]-x[b][2])*(x[a][2]-x[b][2]));
}
for(a=0;a<=9;a++)
{
for(b=0;b<=9;b++)
z[a][b]=y[a][b];
}
for(a=1;a<=(((n*n)/2)-(n/2));a++)
{
k=-1;
m=-1;
l=-1;
for(b=0;b<=n-1;b++)
{
for(c=0;c<=n-1;c++)
{
if(y[b][c]>k)
{
m=b;
l=c;
k=y[b][c];
}
else;
}
}
y[m][l]=-1;
printf("(%d,%d,%d)-(%d,%d,%d)=%.2lf\n",x[m][0],x[m][1],x[m][2],x[l][0],x[l][1],x[l][2],z[m][l]);
}
} |
64 | 31648 | void main()
{
int n,m,a[11][3],i,j,k,l;
double b[46][3],s,t;
scanf("%d",&n);
m=n*(n-1)/2;
for(i=0;i<n;i++)
{
scanf("%d %d %d",&a[i][0],&a[i][1],&a[i][2]);
}
i=0;
for(j=0;j<n-1;j++)
{
for(k=j+1;k<=n-1;k++)
{
s=sqrt((a[j][0]-a[k][0])*(a[j][0]-a[k][0])+(a[j][1]-a[k][1])*(a[j][1]-a[k][1])+(a[j][2]-a[k][2])*(a[j][2]-a[k][2]));
b[i][0]=j;
b[i][1]=k;
b[i][2]=s;
i++;
}
}
for(i=m-1;i>0;i--)
{
for(j=0;j<i;j++)
{
if(b[j][2]<b[j+1][2])
{
for(l=0;l<=2;l++)
{
t=b[j+1][l];
b[j+1][l]=b[j][l];
b[j][l]=t;
}
}
else if(fabs(b[j][2]-b[j+1][2])<1e-6&&b[j][0]>b[j+1][0])
{
for(l=0;l<=2;l++)
{
t=b[j+1][l];
b[j+1][l]=b[j][l];
b[j][l]=t;
}
}
else if(fabs(b[j][2]-b[j+1][2])<1e-6&&b[j][0]==b[j+1][0]&&b[j][1]>b[j+1][1])
{
for(l=0;l<=2;l++)
{
t=b[j+1][l];
b[j+1][l]=b[j][l];
b[j][l]=t;
}
}
}
}
for(i=0;i<m;i++)
{
printf("(%d,%d,%d)-(%d,%d,%d)=%.2f\n",a[(int)b[i][0]][0],a[(int)b[i][0]][1],a[(int)b[i][0]][2],a[(int)b[i][1]][0],a[(int)b[i][1]][1],a[(int)b[i][1]][2],b[i][2]);
}
} |
64 | 31649 |
int sq(int a,int b)
{ int r;
r=(a-b)*(a-b);
return(r);
}
float dis(int a[3],int b[3])
{ int i;
float s=0;
for(i=0;i<3;i++)
s+=sq(a[i],b[i]);
s=sqrt(s);
return(s);
}
void main()
{ int n,i,a[10][3],t=0,k,j,p;
float s[50][3],r;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d%d%d",&a[i][0],&a[i][1],&a[i][2]);
for(i=0;i<n-1;i++)
for(j=i+1;j<n;j++)
{ s[t][0]=i;
s[t][1]=j;
s[t][2]=dis(a[i],a[j]);
t++;
}
for(j=1;j<=t-1;j++)
for(i=0;i<t-j;i++)
if(s[i][2]<s[i+1][2])
for(p=0;p<3;p++)
{ r=s[i][p];s[i][p]=s[i+1][p];s[i+1][p]=r; }
for(i=0;i<t;i++)
{ j=s[i][0];
k=s[i][1];
printf("(%d,%d,%d)-(%d,%d,%d)=%.2f\n",a[j][0],a[j][1],a[j][2],a[k][0],a[k][1],a[k][2],s[i][2]);
}
} |
64 | 31650 |
int main(int argc, char* argv[])
{
int n;
scanf("%d",&n);
int x[10],y[10],z[10];
int i,j;
for(i=0;i<n;i++){
scanf("%d%d%d",&x[i],&y[i],&z[i]);
}
float l[46];
int p1[46];
int p2[46];
int zz=0;
for(i=0;i<n-1;i++){
for(j=i+1;j<n;j++){
l[zz]=sqrt((x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j])+(z[i]-z[j])*(z[i]-z[j]));
p1[zz]=i;
p2[zz]=j;
zz++;
}
}
float lamp2;
int lamp;
for(i=0;i<zz;i++){
for(j=i+1;j<zz;j++){
if(l[j]>l[i]){
lamp2=l[j];
l[j]=l[i];
l[i]=lamp2;
lamp=p1[j];
p1[j]=p1[i];
p1[i]=lamp;
lamp=p2[j];
p2[j]=p2[i];
p2[i]=lamp;
}
if(l[j]==l[i]){
if(p1[i]>p1[j]||(p1[i]==p1[j]&&p2[i]>p2[j])){
lamp2=l[j];
l[j]=l[i];
l[i]=lamp2;
lamp=p1[j];
p1[j]=p1[i];
p1[i]=lamp;
lamp=p2[j];
p2[j]=p2[i];
p2[i]=lamp;
}}
}
printf("(%d,%d,%d)-(%d,%d,%d)=%.2f\n",x[p1[i]],y[p1[i]],z[p1[i]],x[p2[i]],y[p2[i]],z[p2[i]],l[i]);
}
return 0;
}
|
64 | 31651 | int main(){
int n,c=0;
double j[100],k;
scanf("%d",&n);
int x[100],y[100],z[100],x1[100],y1[100],z1[100],x2[100],y2[100],z2[100];
for(int b=0;b<n;b++){
scanf("%d%d%d",&x[b],&y[b],&z[b]);
}
for(int p=0;p<n;p++){
for( int l=p+1;l<n;l++){
k=((x[p]-x[l])*(x[p]-x[l])+(y[p]-y[l])*(y[p]-y[l])+(z[p]-z[l])*(z[p]-z[l]))*1.0;
j[c]=sqrt(k);
x1[c]=x[p];y1[c]=y[p];z1[c]=z[p];
x2[c]=x[l];y2[c]=y[l];z2[c]=z[l];
c++;
}
}
for(int a=1;a<=n*(n-1)/2;a++){
double e;
for(int i=0;i<n*(n-1)/2-a;i++){
if(j[i]<j[i+1]){
e=j[i+1];
j[i+1]=j[i];
j[i]=e;
int f;
f=x1[i+1];
x1[i+1]=x1[i];
x1[i]=f;
f=y1[i+1];
y1[i+1]=y1[i];
y1[i]=f;
f=z1[i+1];
z1[i+1]=z1[i];
z1[i]=f;
f=x2[i+1];
x2[i+1]=x2[i];
x2[i]=f;
f=y2[i+1];
y2[i+1]=y2[i];
y2[i]=f;
f=z2[i+1];
z2[i+1]=z2[i];
z2[i]=f;
}
}
}
for(int i=0;i<n*(n-1)/2;i++){
printf("(%d,%d,%d)-(%d,%d,%d)=%.2lf\n",x1[i],y1[i],z1[i],x2[i],y2[i],z2[i],j[i]);
}
return 0;
}
|
64 | 31652 | /*
* ????????.cpp
* Created on: 2011-1-1
* Author: ???
*/
struct {
int abs;
int ver;
int ord;
} coor[10]; //??????
double fdis(int a, int b, int c, int d, int e, int f) { //??????
int m;
double n;
m = (a - d) * (a - d) + (b - e) * (b - e) + (c - f) * (c - f);
n = sqrt((double) m);
return n;
}
int main() {
int n, i, j, k = 0, q, flag1[45], flag2[45], s, t;
double dis[45], tempt;
cin >> n;
for (i = 0; i < n; i++) {
cin >> coor[i].abs >> coor[i].ver >> coor[i].ord;
} //????
for (i = 0; i < n - 1; i++) {
for (j = i + 1; j < n; j++) {
dis[k] = fdis(coor[i].abs, coor[i].ver, coor[i].ord, coor[j].abs,
coor[j].ver, coor[j].ord);
flag1[k] = i;
flag2[k] = j;
k++;
}
}
for (k = 0; k < n * (n - 1) / 2; k++) {
for (q = 0; q < n * (n - 1) / 2 - k - 1; q++) {
if (dis[q] - dis[q + 1] < -1e-6) {
s = flag1[q];
flag1[q] = flag1[q + 1];
flag1[q + 1] = s;
t = flag2[q];
flag2[q] = flag2[q + 1];
flag2[q + 1] = t;
tempt = dis[q];
dis[q] = dis[q + 1];
dis[q + 1] = tempt; //??
}
}
}
for (k = 0; k < n * (n - 1) / 2; k++) {
cout << "(" << coor[flag1[k]].abs << "," << coor[flag1[k]].ver << ","
<< coor[flag1[k]].ord << ")-(" << coor[flag2[k]].abs << ","
<< coor[flag2[k]].ver << "," << coor[flag2[k]].ord << ")"
<< "=" << fixed << setprecision(2) << dis[k] << endl;
} //??
return 0;
}
|
64 | 31653 | int main()
{
int n,a[11][4],b[60][7],t[7];
double c[60],t0;
int i,j,l = 0;
cin >> n;
for(i = 1;i <= n;i++)
{
for(j = 1;j <= 3;j++)
cin >> a[i][j];
}
for(i = 1;i <= n - 1;i++)
{
for(j = i + 1;j <= n;j++)
{
l++;
b[l][1] = a[i][1];
b[l][2] = a[i][2];
b[l][3] = a[i][3];
b[l][4] = a[j][1];
b[l][5] = a[j][2];
b[l][6] = a[j][3];
c[l] = sqrt((a[i][1] - a[j][1]) * (a[i][1] - a[j][1]) +
(a[i][2] - a[j][2]) * (a[i][2] - a[j][2]) +
(a[i][3] - a[j][3]) * (a[i][3] - a[j][3]));
}
}
for(j = 1;j <= n * (n - 1) / 2 - 1;j++)
{
for(l = n * (n - 1) / 2 - 1;l >= j;l--)
{
if(c[l] < c[l + 1])
{
for(i = 1;i <= 6;i++)
{
t[i] = b[l][i];
b[l][i] = b[l + 1][i];
b[l + 1][i] = t[i];
}
t0 = c[l];
c[l] = c[l + 1];
c[l + 1] = t0;
}
}
}
for(l = 1;l <= n * (n - 1) / 2;l++)
{
cout << "(" << b[l][1] << ","
<< b[l][2] << ","
<< b[l][3] << ")"
<< "-" << "(" << b[l][4] << ","
<< b[l][5] << ","
<< b[l][6] << ")"
<< "=" << fixed << setprecision(2) << c[l] << endl;
}
return 0;
}
|
64 | 31654 | int main()
{
int n=0;
cin>>n;
double an[100][3];
int i=0,j=0;
for(i=0;i<n;i++)
for(j=0;j<3;j++)
cin>>an[i][j];
struct
{
int i;
int j;
double dis;
}stu[1000],t;
int k=0,m=0,p=0;
for(m=0;m<n;m++)
{
for(p=m+1;p<n;p++)
{
stu[k].i=m;
stu[k].j=p;
double mm=(an[m][0]-an[p][0])*(an[m][0]-an[p][0])+(an[m][1]-an[p][1])*(an[m][1]-an[p][1])+(an[m][2]-an[p][2])*(an[m][2]-an[p][2]);
stu[k].dis=sqrt(mm);
k++;
}
}
for(int q=0;q<k;q++)
for(int qq=q+1;qq<k;qq++)
{
if((stu[q].dis<stu[qq].dis)||(stu[q].dis==stu[qq].dis)&&((stu[q].i>stu[qq].i)||(stu[q].i==stu[qq].i)&&(stu[q].j>stu[qq].j)))
{
t=stu[qq];
stu[qq]=stu[q];
stu[q]=t;
}
}
for(int r=0;r<k;r++)
cout<<fixed << setprecision(0)<<"("<<an[stu[r].i][0]<<","<<an[stu[r].i][1]<<","<<an[stu[r].i][2]<<")-("<<an[stu[r].j][0]<<","<<an[stu[r].j][1]<<","<<an[stu[r].j][2]<<")="<<fixed << setprecision(2)<<stu[r].dis<<endl;
return 0;
}
|
64 | 31655 | int main(){
int x[10],y[10],z[10],weizhi[200],t,n,i,j,k,a,b;
double juli[200],m,pingfanghe[200];
scanf("%d",&n);
k=0;
for(i=0;i<n;i++)
scanf("%d%d%d",&x[i],&y[i],&z[i]);
for(i=0;i<n;i++){
for(j=i+1;j<n;j++){
pingfanghe[k]=(x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j])+(z[i]-z[j])*(z[i]-z[j]);
juli[k]=sqrt(pingfanghe[k]);
weizhi[k]=i*10+j;
k++;
}
}
k--;
for(i=k;i>0;i--){
for(j=0;j<i;j++){
if(juli[j]<juli[j+1]){
m=juli[j];
juli[j]=juli[j+1];
juli[j+1]=m;
t=weizhi[j];
weizhi[j]=weizhi[j+1];
weizhi[j+1]=t;
}
}
}
for(i=0;i<=k;i++){
a=weizhi[i]/10;
b=weizhi[i]%10;
printf("(%d,%d,%d)-(%d,%d,%d)=%.2lf\n",x[a],y[a],z[a],x[b],y[b],z[b],juli[i]);
}
return 0;
}
|
64 | 31656 |
int main()
{
int i, j, k, l = 0, num;
double temp = 0;
int pos[100][3];
double distance[9900] = {0};
int latter[9900], former[9900];
cin >> num;
for (i = 0; i < num; i++)
{
for(j = 0; j < 3; j++)
{
cin >> pos[i][j];
}
}
for (i = 0; i < num; i++)
{
for (j = i + 1; j < num; j++)
{
for (k = 0; k < 3; k++)
{
former[l] = i;
latter[l] = j;
distance[l] += (pos[i][k] - pos[j][k]) * (pos[i][k] - pos[j][k]);
}
distance[l] = sqrt (distance[l]);
l++;
}
}
l = (num - 1) * num / 2;
for (i = 0; i < l - 1; i++)
{
for (j = 0; j < l - i - 1; j++)
{
if (distance[j] < distance[j + 1])
{
temp = distance[j];
distance[j] = distance[j + 1];
distance[j + 1] = temp;
temp = latter[j];
latter[j] = latter[j + 1];
latter[j + 1] = temp;
temp = former[j];
former[j] = former[j + 1];
former[j + 1] = temp;
}
}
}
for (i = 0; i < l; i++)
{
cout << "(" << pos[former[i]][0] << "," << pos[former[i]][1]
<< "," << pos[former[i]][2] <<")-(" << pos[latter[i]][0]
<< "," << pos[latter[i]][1] << "," << pos[latter[i]][2]
<<")=" << fixed << setprecision(2) << distance[i] << endl;
}
return 0;
}
|
64 | 31657 | //********************
//**??????? **
//**????? **
//**???2013.12.15**
//**????4.cpp **
//********************
int main()
{
int n, i, j, cnt= 0, p[10][3];
double sum;
struct distance // ??????????????
{
int x1;
int y1;
int z1;
int x2;
int y2;
int z2;
double dist;
}group[45], temp;
cin >> n;
for (i = 0; i < n; i++)
cin >> p[i][0] >> p[i][1] >> p[i][2]; // ??????
for (i = 0; i < n - 1; i++)
for (j = 1; j < n - i; j++)
{
group[cnt].x1 = p[i][0];
group[cnt].y1 = p[i][1];
group[cnt].z1 = p[i][2];
group[cnt].x2 = p[i + j][0];
group[cnt].y2 = p[i + j][1];
group[cnt].z2 = p[i + j][2];
sum = (p[i][0] - p[i + j][0]) * (p[i][0] - p[i + j][0]) +
(p[i][1] - p[i + j][1]) * (p[i][1] - p[i + j][1]) +
(p[i][2] - p[i + j][2]) * (p[i][2] - p[i + j][2]);
group[cnt].dist = sqrt(sum); // ????????????????????
cnt++;
}
for (i = 0; i < n * (n - 1) / 2 - 1; i++)
for (j = 0; j < n * (n - 1) / 2 - 1 - i; j++)
if (group[j].dist < group[j + 1].dist) // ???????????????
{
temp = group[j];
group[j] = group[j + 1];
group[j + 1] = temp;
}
for (i = 0; i < n * (n - 1) / 2; i++)
{
cout << '(' << group[i].x1 << ',' << group[i].y1 << ',' << group[i].z1 << ')' << '-'
<< '(' << group[i].x2 << ',' << group[i].y2 << ',' << group[i].z2 << ')' << '=';
printf("%.2f", group[i].dist); // ??????????????
cout << endl;
}
return 0;
}
|
64 | 31658 | void main()
{
struct distance
{
float a[2], b[2], c[2];
float d;
}dis[55];
int n, i, j, k=0, r[55], t;
float x[11], y[11], z[11];
scanf("%d", &n);
for(i=0; i<n; i++)
scanf("%f%f%f", &x[i], &y[i], &z[i]);
for(i=0; i<n-1; i++)
for(j=i+1; j<n; j++)
{
dis[k].d=(x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j])+(z[i]-z[j])*(z[i]-z[j]);
dis[k].a[0]=x[i]; dis[k].a[1]=x[j];
dis[k].b[0]=y[i]; dis[k].b[1]=y[j];
dis[k].c[0]=z[i]; dis[k].c[1]=z[j];
r[k]=k;
k++;
}
for(i=0; i<k-1; i++)
for(j=0; j<k-1-i; j++)
if(dis[r[j]].d<dis[r[j+1]].d)
{
t=r[j];
r[j]=r[j+1];
r[j+1]=t;
}
for(i=0; i<k; i++)
printf("(%d,%d,%d)-(%d,%d,%d)=%.2f\n", (int)dis[r[i]].a[0], (int)dis[r[i]].b[0], (int)dis[r[i]].c[0], (int)dis[r[i]].a[1], (int)dis[r[i]].b[1], (int)dis[r[i]].c[1], sqrt(dis[r[i]].d));
} |
64 | 31659 | struct point{ //?????point?????
int x;
int y;
int z;
}pt[50];
struct data{ //?????data????????
int num;
struct point a; //?1
struct point b; //?2
double distance; //??
}dt[10000],temp;
int main(){
int n,i,j; //????n????i?j
cin>>n;
for(i=0;i<n;i++) //???????
{
cin>>pt[i].x;
cin>>pt[i].y;
cin>>pt[i].z;
}
int t=0; //??dt??
for(i=0;i<n;i++)
for(j=i+1;j<n;j++)
{
dt[t].num=t;
dt[t].a=pt[i];
dt[t].b=pt[j];
dt[t].distance=sqrt((pt[i].x-pt[j].x)*(pt[i].x-pt[j].x)+(pt[i].y-pt[j].y)*(pt[i].y-pt[j].y)+(pt[i].z-pt[j].z)*(pt[i].z-pt[j].z)); //????
t++;
}
int k; //??dt??
k=t;
for(i=0;i<k;i++) //??
for(j=i+1;j<k;j++)
{
if(dt[i].distance<dt[j].distance||(dt[i].distance==dt[j].distance&&dt[i].num>dt[j].num))
{
temp=dt[i];
dt[i]=dt[j];
dt[j]=temp;
}
}
for(i=0;i<k;i++) //??
{
cout<<"("<<dt[i].a.x<<","<<dt[i].a.y<<","<<dt[i].a.z<<")-("<<dt[i].b.x<<","<<dt[i].b.y<<","<<dt[i].b.z<<")=";
printf("%.2lf\n",dt[i].distance);
}
return 0;
}
|
64 | 31660 | int main()
{
int a[10][3] = {0} ; //a[10][3]??????????
double b[45] = {0}; // b[45]????????????
int biaoji[45][2] = {0} ; //biaoji[45][2]???????????????
int n = 0 , i = 0 , j = 0 , k = 0 ; //n??????i,j,k?????
cin >> n ; //??????
for ( i = 0 ; i < n ; i++ ) //????????????
for ( j = 0 ; j < 3 ; j++ )
cin >> a[i][j] ;
for (i = 0 ; i < n ; i++ ) //?????????????????
{
for(j = i+1 ; j <n; j++ )
{
b[k]= sqrt( (double) ( a[i][0] - a[j][0] ) * ( a[i][0] - a[j][0] ) + ( a[i][1] - a[j][1] ) * ( a[i][1] - a[j][1]) + ( a[i][2] - a[j][2] ) * ( a[i][2] - a[j][2] ) ) ; //????
biaoji[k][0] = i ; //?????????
biaoji[k][1] = j ; //??????????????i,j???????????????????????
k++ ;
}
}
for ( i = 0 ; i < n * ( n - 1 ) / 2 ; i++ ) //??????????????????????????????
{ //???????????????????????????????????????????????????
for( j = 0 ; j < n * ( n - 1 ) / 2 - i - 1 ; j++ )
{
if ( b[j+1] - b[j] > 1e-4 ) //????double?????????????????b[j]<b[j+1]????????????????????????
{
double temp ; //?????
temp = b[j] ;
b[j] = b[j+1] ;
b[j+1] = temp ;
int tempx ;
tempx = biaoji[j][0] ; //??????????
biaoji[j][0] = biaoji[j+1][0] ;
biaoji[j+1][0] = tempx ;
tempx = biaoji[j][1] ; //??????????
biaoji[j][1] = biaoji[j+1][1] ;
biaoji[j+1][1] = tempx ;
}
}
}
for( i = 0 ; i < n * ( n - 1 ) / 2 ; i++) //??
cout << "(" << a[biaoji[i][0]][0] << "," << a[biaoji[i][0]][1] << "," << a[biaoji[i][0]][2] << ")-(" << a[biaoji[i][1]][0] << "," << a[biaoji[i][1]][1] << "," << a[biaoji[i][1]][2] << ")=" << fixed << setprecision(2) << b[i] << endl ;
return 0;
}
|
64 | 31661 | struct num1
{
int a;
int b;
int c;
} num1[100];
struct num
{
int x1;
int x2;
int x3;
int x11;
int x12;
int x13;
int l1;
int l2;
float sum;
}num[5010],k;
int main()
{ int t = 0,n,i,j,sum;
scanf("%d",&n);
for( i = 1; i <= n ;i ++)
scanf("%d %d %d",&num1[i].a,&num1[i].b,&num1[i].c);
for( i = 1; i <= n;i ++)
{
for( j = i+1; j <= n ;j++ )
{
num[t].x1 = num1[i].a;
num[t].x2 = num1[i].b;
num[t].x3 = num1[i].c;
num[t].x11 = num1[j].a;
num[t].x12 = num1[j].b;
num[t].x13 = num1[j].c;
num[t].sum = (num[t].x1-num[t].x11)*(num[t].x1-num[t].x11)+(num[t].x2-num[t].x12)*(num[t].x2-num[t].x12)+(num[t].x3-num[t].x13)*(num[t].x3-num[t].x13);
num[t].l1 = i;
num[t].l2 = j;
t ++ ;
}
}
for( i = 0;i <t ;i++ )
{for ( j = i ;j <t;j++ )
{ if(num[i].sum<num[j].sum)
{ k = num[i];
num[i] = num[j];
num[j] = k;
}
}
}
for( i = 0;i <t ;i++ )
{for ( j = i ;j <t;j++ )
{ if((num[i].sum==num[j].sum)&&((num[i].l1>num[j].l1)||((num[i].l1==num[j].l1)&&(num[i].l2>num[j].l2))))
{ k = num[i];
num[i] = num[j];
num[j] = k;
}
}
}
for( i = 0 ;i < t ;i++ )
{ printf("(%d,%d,%d)-(%d,%d,%d)=%.2f\n",num[i].x1,num[i].x2,num[i].x3,num[i].x11,num[i].x12,num[i].x13,sqrt(num[i].sum));}
}
|
64 | 31662 | /*
* ds.cpp
*
* Created on: 2011-12-9
* Author: admin
*/
struct place{
int x;
int y;
int z;
};
struct distance{
int i1;
int i2;
double dis;
};
int main(){
int i,j,k,n;
struct place a[11];
struct distance d[100],temp;
cin>>n;
for (i=1;i<=n;i++){
cin>>a[i].x>>a[i].y>>a[i].z;
}
k=1;
for (i=1;i<=n-1;i++){
for (j=i+1;j<=n;j++){
d[k].i1=i;
d[k].i2=j;
d[k].dis=sqrt((a[i].x-a[j].x)*(a[i].x-a[j].x)+
(a[i].y-a[j].y)*(a[i].y-a[j].y)+
(a[i].z-a[j].z)*(a[i].z-a[j].z));
k++;
}
}
for (i=k-1;i>=1;i--){
for (j=1;j<=i-1;j++){
if (d[j].dis<d[j+1].dis){
temp=d[j];
d[j]=d[j+1];
d[j+1]=temp;
}
}
}
for (i=1;i<=k-1;i++){
cout<<'('<<a[d[i].i1].x<<','<<a[d[i].i1].y<<','<<a[d[i].i1].z<<')'<<'-'<<
'('<<a[d[i].i2].x<<','<<a[d[i].i2].y<<','<<a[d[i].i2].z<<')'<<'='<<
fixed<<setprecision(2)<<d[i].dis;
if (i!=k-1)cout<<endl;
}
return 0;
}
|
64 | 31663 | void main()
{
int n,a[10][3],b[45][2],i,j,k=0,t;
float c[45],s;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i][0]);
scanf("%d",&a[i][1]);
scanf("%d",&a[i][2]);
}
for(i=0;i<n;i++)
for(j=i+1;j<n;j++)
{
b[k][0]=i;
b[k][1]=j;
c[k]=sqrt((a[i][0]-a[j][0])*(a[i][0]-a[j][0])+(a[i][1]-a[j][1])*(a[i][1]-a[j][1])+(a[i][2]-a[j][2])*(a[i][2]-a[j][2]));
k++;
}
for(j=0;j<k-1;j++)
for(i=0;i<k-1-j;i++)
{
if(c[i]<c[i+1])
{
s=c[i];
c[i]=c[i+1];
c[i+1]=s;
t=b[i][0];
b[i][0]=b[i+1][0];
b[i+1][0]=t;
t=b[i][1];
b[i][1]=b[i+1][1];
b[i+1][1]=t;
}
}
for(i=0;i<k;i++) printf("(%d,%d,%d)-(%d,%d,%d)=%.2f\n",a[b[i][0]][0],a[b[i][0]][1],a[b[i][0]][2],a[b[i][1]][0],a[b[i][1]][1],a[b[i][1]][2],c[i]);
}
|
64 | 31664 | int main(){
int n;
int p[10][3],b[100],e[100];
int i,j,l;
int x;
double y;
double d[100];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d %d %d ",&p[i][0],&p[i][1],&p[i][2]);
}
l=0;
while(l<n*(n-1)/2){
for(i=0;i<n-1;i++){
for(j=i+1;j<n;j++){
d[l]=sqrt(1.0*((p[i][0]-p[j][0])*(p[i][0]-p[j][0])+(p[i][1]-p[j][1])*(p[i][1]-p[j][1])+(p[i][2]-p[j][2])*(p[i][2]-p[j][2])));
b[l]=i;
e[l]=j;
l++;
}
}
}
for(i=0;i<n*(n-1)/2-1;i++){
for(l=0;l<n*(n-1)/2-i;l++){
if(d[l]<d[l+1]){
y=d[l];
d[l]=d[l+1];
d[l+1]=y;
x=b[l];
b[l]=b[l+1];
b[l+1]=x;
x=e[l];
e[l]=e[l+1];
e[l+1]=x;
}
}
}
for(l=0;l<n*(n-1)/2;l++){
i=b[l];
j=e[l];
printf("(%d,%d,%d)-(%d,%d,%d)=%.2lf\n",p[(i)][0],(p[(i)][1]),(p[(i)][2]),(p[(j)][0]),(p[(j)][1]),(p[(j)][2]),d[l]);
}
return 0;
} |
64 | 31665 | /*
* 4.cpp
*
* Created on: 2011-1-1
* Author: Administrator
*/
double f(int x1,int y1,int z1,int x2,int y2,int z2){
double d2=(x1-x2)*(x1-x2)+(y1-y2)*(y1-y2)+(z1-z2)*(z1-z2);
return sqrt(d2);
}//?????
int main(){
int x[10],y[10],z[10];//??????
double d[10][10];//????
int n;
cin>>n;
for(int i=0;i<n;i++)
cin>>x[i]>>y[i]>>z[i];
for(int i=0;i<n;i++)
for(int j=0;j<i;j++){
d[i][j]=f(x[i],y[i],z[i],x[j],y[j],z[j]);
}//??????
for(int k=0;k<n*(n-1)/2;k++ ){
int a=0,b=0;
double D=0;
for(int i=0;i<n;i++)
for(int j=0;j<i;j++){
if(d[i][j]>D){
D=d[i][j];
a=i;
b=j;
}
}//????????????
cout<<"("<<x[b]<<","<<y[b]<<","<<z[b]<<")-("<<x[a]<<","<<y[a]<<","<<z[a]<<")=";
cout<<fixed<<setprecision(2)<<D<<endl;//??
d[a][b]=-1;//?????????????
}
return 0;
}
|
64 | 31666 |
struct point{
int x;
int y;
int z;};
struct dis{
float distance;
struct point d1;
struct point d2;};
int main()
{
void bubble(struct dis b[100],int len);
float fun(struct point pt1,struct point pt2);
int n,m,num,i,up,w;
struct dis a[100]={0,0,0};
struct point pt[10]={0,0,0};
scanf("%d",&num);
for(i=0;i<num;i++)
{
scanf("%d%d%d",&pt[i].x,&pt[i].y,&pt[i].z);
}
//printf("%d%d%d",pt[1].x,pt[2].x,pt[3].x);
w=num*(num-1)/2;
for(i=0;i<w;)
{
for(n=0;n<num-1;n++)
{
for(m=n+1;m<num;m++)
{
a[i].distance=fun(pt[n],pt[m]);
a[i].d1.x=pt[n].x;
//printf("%d",a[i].d1.x);
a[i].d1.y=pt[n].y;
a[i].d1.z=pt[n].z;
a[i].d2.x=pt[m].x;
a[i].d2.y=pt[m].y;
a[i].d2.z=pt[m].z;
i++;
}
}
}
up=i;
//printf("%d",up);
//printf("%d%d",a[1].d1.x,a[1].d1.y);
bubble(a,up);
for(i=0;i<up;i++)
{
printf("(%d,%d,%d)-(%d,%d,%d)=%3.2f\n",a[i].d1.x,a[i].d1.y,a[i].d1.z,a[i].d2.x,a[i].d2.y,a[i].d2.z,a[i].distance);
}
return 0;
}
float fun(struct point p1,struct point p2)
{
float result,mid;
mid=(p1.x-p2.x)*(p1.x-p2.x)+(p1.y-p2.y)*(p1.y-p2.y)+(p1.z-p2.z)*(p1.z-p2.z);
result=sqrt(mid);
return(result);
}
void bubble(struct dis b[100],int len)
{
int i,pass;
struct dis temp;//temp????????????
for(pass=1;pass<len;pass++)
{
for(i=0;i<len-pass;i++)
{
if(b[i].distance<b[i+1].distance)
{temp=b[i];b[i]=b[i+1];b[i+1]=temp;}
}
}
}
|
64 | 31667 | int main()
{
int x[10],y[10],z[10];
int i,j=1,n,p,q,k=0,m;
double d[10][10],max;
scanf("%d\n",&n);
for(i=0;i<n;i++)
scanf("%d%d%d",&x[i],&y[i],&z[i]);
i=0;
if(n==2)
{
p=i;q=j;
max=sqrt(1.0*(x[i]-x[j])*(x[i]-x[j])+1.0*(y[i]-y[j])*(y[i]-y[j])+1.0*(z[i]-z[j])*(z[i]-z[j]));
printf("(%d,%d,%d)-(%d,%d,%d)=%.2lf\n",x[p],y[p],z[p],x[q],y[q],z[q],max);
return 0;
}
for(i=0;i<n;i++)
{
for(j=i+1;j<n;j++)
{
d[i][j]=sqrt(1.0*(x[i]-x[j])*(x[i]-x[j])+1.0*(y[i]-y[j])*(y[i]-y[j])+1.0*(z[i]-z[j])*(z[i]-z[j]));
}
}
max=d[0][1];
m=n*(n-1)/2;
while(k<m)
{
for(i=0;i<n;i++)
{
for(j=i+1;j<n;j++)
{
if(max<d[i][j])
{
max=d[i][j];
p=i;
q=j;
}
}
}
printf("(%d,%d,%d)-(%d,%d,%d)=%.2lf\n",x[p],y[p],z[p],x[q],y[q],z[q],max);
d[p][q]=0.0;
k++;
max=0;
}
return 0;
}
|
64 | 31668 | int main()
{
int n, i, j, k, c[10][3], temp = 0,count = 0;
cin >> n;
struct
{
int a[3];
int b[3];
int flag1;
int flag2;
double distance;
}dian[46] = {0};
for (i = 0; i < n; i++)
for (j = 0; j < 3; j++)
cin >> c[i][j];
for (i = 0; i < n; i++)
for (j = i + 1; j < n; j++)
{
temp = 0;
for (k = 0; k < 3; k++)
{
dian[count].a[k] = c[i][k];
dian[count].b[k] = c[j][k];
dian[count].flag1 = i;
dian[count].flag2 = j;
temp = temp + (c[i][k] - c[j][k]) * (c[i][k] - c[j][k]);
}
dian[count].distance = sqrt(temp);
count++;
}
for (i = count - 1; i >= 0; i--)
for (j = count - 1; j >= 0; j--)
if ((dian[i].distance > dian[j].distance && i > j) || ((dian[i].distance == dian[j].distance) && ((dian[i].flag1 < dian[j].flag1 && i > j) || (dian[i].flag1 == dian[j].flag1 && dian[i].flag2 < dian[j].flag2 && i > j))))
{
dian[45] = dian[i];
dian[i] = dian[j];
dian[j] = dian[45];
}
for (i = 0; i < count; i++)
cout << "(" << dian[i].a[0] << "," << dian[i].a[1] << "," << dian[i].a[2] << ")" << "-" << "(" << dian[i].b[0] << "," << dian[i].b[1] << "," << dian[i].b[2] << ")" << "=" << fixed << setprecision(2) << dian[i].distance << endl;
return 0;
} |
64 | 31669 | int main(){
int n,c,a,b,i,o,p;
double e;
scanf("%d",&n);
double jl[n][n];
int x[n],y[n],z[n];
for(i=0;i<n;i++){
scanf("%d%d%d",&x[i],&y[i],&z[i]);
}
for(a=0;a<n;a++){
b=a+1;
while(b<n){
c=(x[a]-x[b])*(x[a]-x[b])+(y[a]-y[b])*(y[a]-y[b])+(z[a]-z[b])*(z[a]-z[b]);
jl[a][b]=sqrt(c);
b++;
}
}
e=0;
for(i=0;i!=-1;i++){
for(a=0;a<n;a++){
b=a+1;
while(b<n){
if(e<jl[a][b]){
e=jl[a][b];
o=a;
p=b;
}
b++;
}
}
if(e==0){
break;
}
else{
printf("(%d,%d,%d)-(%d,%d,%d)=%.2lf\n",x[o],y[o],z[o],x[p],y[p],z[p],e);
jl[o][p]=0;
e=0;
}
}
return 0;
}
|
64 | 31670 | double s[10][10];
int c[2];
int min(int n)
{int i,j;
double m=-1;
for (i=0;i<n-1;i++)
for (j=i+1;j<n;j++)
if (s[i][j]>m) {c[0]=i;c[1]=j;m=s[i][j];}
}
int main()
{int n,i,j,ll;
scanf("%d",&n);
int x[n],y[n],z[n];
for (i=0;i<n;i++)
scanf ("%d %d %d",&x[i],&y[i],&z[i]);
for (i=0;i<n-1;i++)
for (j=i+1;j<n;j++)
{s[i][j]=1.0*(x[i]-x[j])*(x[i]-x[j])+1.0*(y[i]-y[j])*(y[i]-y[j])+1.0*(z[i]-z[j])*(z[i]-z[j]);
s[i][j]=sqrt(s[i][j]);
}
for (i=0;i<(n-1)*n/2;i++)
{min(n);
printf ("(%d,%d,%d)-(%d,%d,%d)=%.2lf\n",x[c[0]],y[c[0]],z[c[0]],x[c[1]],y[c[1]],z[c[1]],s[c[0]][c[1]]);
s[c[0]][c[1]]=-1;
}
return 0;
}
|
64 | 31671 | int main(){
int n,b=0,i;
scanf("%d",&n);
int x[10],y[10],z[10],k;
double len[10][10],num[100],s;
for(i=0;i<n;i++){
scanf("%d %d %d",&x[i],&y[i],&z[i]);
}
for(i=0;i<n;i++){
for(k=i+1;k<n;k++){
len[i][k]=sqrt((x[i]-x[k])*(x[i]-x[k])+(y[i]-y[k])*(y[i]-y[k])+(z[i]-z[k])*(z[i]-z[k]));
num[b]=len[i][k];
b++;
}
}
for(k=1;k<=b;k++){
for(i=0;i<(b-k);i++){
if(num[i]>num[i+1]){
s=num[i+1];
num[i+1]=num[i];
num[i]=s;
}
}
}
for(b;b>=0;b--){
for(i=0;i<n;i++){
for(k=i+1;k<n;k++){
if(num[b]==len[i][k]){
printf("(%d,%d,%d)-(%d,%d,%d)=%.2lf\n",x[i],y[i],z[i],x[k],y[k],z[k],len[i][k]);
break;
}
}
if(num[b]==len[i][k]){
len[i][k]=10000000;
break;
}
}
}
return 0;
} |
64 | 31672 | int main(){
int n;
int N=1000;
scanf("%d",&n);
int a[n];int b[n];int c[n];int d[n];int e[n];int f[n];int h[N];int q[N];int j[N];int v[N];int l[N];int o[N];
double g[N];
for(int i=1;i<=n;i++){
scanf("%d %d %d",&a[i-1],&b[i-1],&c[i-1]);
d[i-1]=a[i-1];e[i-1]=b[i-1];f[i-1]=c[i-1];
}
int x=0;
for(int i=1;i<n;i++){
double p;
int s;
for(int t=i+1;t<=n;t++){
s=((a[i-1]-d[t-1])*(a[i-1]-d[t-1]))*1.0+((b[i-1]-e[t-1])*(b[i-1]-e[t-1]))*1.0+((c[i-1]-f[t-1])*(c[i-1]-f[t-1]))*1.0;
p=sqrt(s)*1.0;
g[x]=p;h[x]=a[i-1];q[x]=b[i-1];j[x]=c[i-1];v[x]=d[t-1];l[x]=e[t-1];o[x]=f[t-1];
x++;
}
}
for(int k=1;k<=x;k++){
for(int m=1;m<=(x-k);m++){
if(g[m-1]<g[m]){double y;y=g[m-1];g[m-1]=g[m];g[m]=y;
int s;s=h[m-1];h[m-1]=h[m];h[m]=s;
s=q[m-1];q[m-1]=q[m];q[m]=s;
s=j[m-1];j[m-1]=j[m];j[m]=s;
s=v[m-1];v[m-1]=v[m];v[m]=s;
s=l[m-1];l[m-1]=l[m];l[m]=s;
s=o[m-1];o[m-1]=o[m];o[m]=s;
}
}
}
for(int z=1;z<=x;z++){
printf("(%d,%d,%d)-(%d,%d,%d)=%.2lf\n",h[z-1],q[z-1],j[z-1],v[z-1],l[z-1],o[z-1],g[z-1]);
}
return 0;
}
|
64 | 31673 | // ?????? ???1000010500
// ????
// 2010-12-20
struct point // ?????
{
int x,y,z;
}dot[10];
int main()
{
int n,i,j,k,p,q;
double distance[10][10],t,max,min = 200;
cin >> n;
for (i = 0;i < n;i++) // ????
cin >> dot[i].x >> dot[i].y >> dot[i].z;
for (i = 0;i < n - 1;i++) // ???i??j???
for (j = i + 1;j < n;j++)
{
distance[i][j] = sqrt((dot[i].x - dot[j].x) * (dot[i].x - dot[j].x)
+ (dot[i].y - dot[j].y) * (dot[i].y - dot[j].y)
+ (dot[i].z - dot[j].z) * (dot[i].z - dot[j].z));
// ??????????
min = (distance[i][j] < min) ? distance[i][j] : min;
}
for (k = 0;k < n * (n - 1) / 2;k++) // ?????????
{
max = min;
for (i = n - 2;i >= 0;i--)
for (j = n - 1;j >= i + 1;j--)
{
if (max <= distance[i][j])
{
max = distance[i][j];
p = i;
q = j;
}
}
cout << "(" << dot[p].x << "," << dot[p].y << "," << dot[p].z << ")-("
<< dot[q].x << "," << dot[q].y << "," << dot[q].z << ")="
<< fixed << setprecision(2)<< distance[p][q] << endl;
distance[p][q] = 0;
}
return 0;
}
|
64 | 31674 | int main()
{
float a[32]={0},c[12][12]={0};//???????????i?????j????????
int i,j,m=0,n=0;
cin>>n;
for(i=1;i<=3*n;i++)
cin>>a[i];
for(i=1;i<n;i++)
{
for(j=i+1;j<=n;j++)
{
c[i][j]=sqrt((a[i*3-1]-a[j*3-1])*(a[i*3-1]-a[j*3-1])+(a[i*3-2]-a[j*3-2])*(a[i*3-2]-a[j*3-2])+(a[i*3]-a[j*3])*(a[i*3]-a[j*3]));//????
}
}
int e,f,z=0,y,g;
y=n*(n-1)/2;//????????
for(g=y;g>=1;g--)//???????????
{
for(i=1;i<n;i++)
{
for(j=i+1;j<=n;j++)
{
z=0;
for(e=1;e<n;e++)
{
for(f=e+1;f<=n;f++)
{
if(c[i][j]>=c[e][f])//????
z=z+1;
}
}
if(z==g)
{
cout<<"("<<a[i*3-2]<<","<<a[i*3-1]<<","<<a[i*3]<<")-("<<a[j*3-2]<<","<<a[j*3-1]<<","<<a[j*3]<<")=";
printf("%0.2f", c[i][j]);
cout<<endl;
}
}
}
}
return 0;
}
|
64 | 31675 | int main() //?????
{
int n; //????
cin>>n; //????
double a[20][4]={0}; //????a???n????
double dis[50]; //?????????????????
int u[50],v[50],l = 1; //????u,v??????????
for(int i = 1 ; i <= n ; i++) //??n??????
{
for(int j = 1 ; j <= 3 ; j++)
{
cin>>a[i][j];
}
}
for(int i = 1 ; i < n ; i++) //??????????????????dis,?????u,v???????????
{
for(int j = i+1 ; j <= n ; j++)
{
dis[l]=sqrt((a[i][1]-a[j][1])*(a[i][1]-a[j][1])+(a[i][2]-a[j][2])*(a[i][2]-a[j][2])+(a[i][3]-a[j][3])*(a[i][3]-a[j][3]))*1.00;
u[l]=i;
v[l]=j;
l++;
}
}
int m=0; //????????dis?????????????u,v?????
int q=0;
double p=0;
for(int i = 1 ; i <= l-2 ; i++)
{
for(int j = 1 ; j < l-1 ; j++)
{
if(dis[j]<dis[j+1])
{
p=dis[j];
dis[j]=dis[j+1];
dis[j+1]=p;
m=u[j];
u[j]=u[j+1];
u[j+1]=m;
q=v[j];
v[j]=v[j+1];
v[j+1]=q;
}
}
}
for(int i = 1 ; i <= l-1 ; i++) //??????
{
cout<<"("<<a[u[i]][1]<<","<<a[u[i]][2]<<","<<a[u[i]][3]<<")-("<<a[v[i]][1]<<","<<a[v[i]][2]<<","<<a[v[i]][3]<<")"<<"=";
printf("%.2f\n",dis[i]);
}
return 0; //???????????????????
}
|
64 | 31676 | unsigned int com[45][2];
float dis[45];
void swap(int i,int j)
{
unsigned int t_1[2];
float t_2;
t_2=dis[i];
dis[i]=dis[j];
dis[j]=t_2;
t_1[0]=com[i][0];
com[i][0]=com[j][0];
com[j][0]=t_1[0];
t_1[1]=com[i][1];
com[i][1]=com[j][1];
com[j][1]=t_1[1];
}
int main(void)
{
int i,j,n,s=0,coord[10][3];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d %d %d ",&coord[i][0],&coord[i][1],&coord[i][2]);
for(i=0;i<n;i++)
for(j=i+1;j<n;j++)
{
com[s][0]=i;
com[s][1]=j;
dis[s]=sqrt(pow(coord[i][0]-coord[j][0],2)+pow(coord[i][1]-coord[j][1],2)+pow(coord[i][2]-coord[j][2],2));
s++;
}
for(i=s;i>0;i--)
for(j=0;j<i-1;j++)
if(dis[j]<dis[j+1])
swap(j,j+1);
for(i=0;i<s;i++)
printf("(%d,%d,%d)-(%d,%d,%d)=%.2f\n",coord[com[i][0]][0],coord[com[i][0]][1],coord[com[i][0]][2],coord[com[i][1]][0],coord[com[i][1]][1],coord[com[i][1]][2],dis[i]);
fclose(stdin);
return 0;
} |
64 | 31677 | //**********************************************************
//* ?????1.cpp *
//* ??????1200012906 *
//* ???2012?12?10? *
//* ????????? *
//**********************************************************
struct
{
int id;
int x1;
int y1;
int z1;
int x2;
int y2;
int z2;
double distance;
}date[55], t;
int main()
{
int n, x[10], y[10], z[10], i, j, k = 0;
cin >> n;
for(i = 0; i < n; i++)
cin >> x[i] >> y[i] >> z[i];
for(i = 0; i < n - 1; i++)
for(j = i + 1; j < n; j++)
{
date[k].id = k;
date[k].x1 = x[i];
date[k].y1 = y[i];
date[k].z1 = z[i];
date[k].x2 = x[j];
date[k].y2 = y[j];
date[k].z2 = z[j];
date[k].distance = pow(x[i] - x[j], 2.0) + pow(y[i] - y[j], 2.0) + pow(z[i] - z[j], 2.0);
k++; //k???????????
}
for(i = k - 2; i >= 0; i--)
for(j = k - 1; j >= i + 1; j--)
{
if (date[i].distance < date[j].distance || date[i].distance == date[j].distance && date[j].id < date[i].id)
{ //???????????????
t = date[i];
date[i] = date[j];
date[j] = t;
}
}
for(i = 0; i < k; i++)
{
cout << "(" << date[i].x1 << "," << date[i].y1 << "," << date[i].z1 << ")-(";
cout << date[i].x2 << "," << date[i].y2 << "," << date[i].z2 << ")=";
cout << fixed << setprecision(2) << sqrt(date[i].distance) << endl;
}
return 0;
} |
64 | 31678 |
int main()
{
int n,i,j,k;
int a[11][3];
float d[10][10]={0},h=0.0;
float max=0.0;
cin>>n;
for (i=0;i<n;i++)
cin>>a[i][0]>>a[i][1]>>a[i][2];
for (i=0;i<n;i++)
for (j=i+1;j<n;j++)
{
h=(a[i][0]-a[j][0])*(a[i][0]-a[j][0])+(a[i][1]-a[j][1])*(a[i][1]-a[j][1])+(a[i][2]-a[j][2])*(a[i][2]-a[j][2]);
d[i][j]=sqrt(h);
}
for (k=0;k<n*(n-1)/2;k++)
{
for (i=0;i<n;i++)
for (j=i+1;j<n;j++)
if (d[i][j]>max)
max=d[i][j];
for (i=0;i<n;i++)
for (j=i+1;j<n;j++)
if (d[i][j]==max)
{
cout<<"("<<a[i][0]<<","<<a[i][1]<<","<<a[i][2]<<")-("
<<a[j][0]<<","<<a[j][1]<<","<<a[j][2]<<")="
<<fixed<<setprecision(2)<<d[i][j]<<endl;
d[i][j]=-1;
}
max=0.0;
}
return 0;
} |
64 | 31679 |
int main(){
int m,n,i,k,s=0,p,q;
double c[45];
double e;
double d[10][3];
scanf("%d",&n);
for(m=0;m<n;m++){
for(i=0;i<3;i++){
scanf("%lf",&(d[m][i]));
}
}
for(m=0;m<n;m++){
for(k=m+1;k<n;k++){
c[s]=sqrt((d[m][0]-d[k][0])*(d[m][0]-d[k][0])+(d[m][1]-d[k][1])*(d[m][1]-d[k][1])+(d[m][2]-d[k][2])*(d[m][2]-d[k][2]));
s=s+1;
}}
for(p=1;p<=s;p++){
for(i=0;i<s-p;i++){
if(c[i]>c[i+1]){
e=c[i+1];
c[i+1]=c[i];
c[i]=e;
}
}}
for(q=s-1;q>=0;q--){
for(m=0;m<n;m++){
for(k=m+1;k<n;k++){
if(sqrt((d[m][0]-d[k][0])*(d[m][0]-d[k][0])+(d[m][1]-d[k][1])*(d[m][1]-d[k][1])+(d[m][2]-d[k][2])*(d[m][2]-d[k][2]))==c[q]){
printf("(%.0lf,%.0lf,%.0lf)-(%.0lf,%.0lf,%.0lf)=%.2lf\n", d[m][0], d[m][1], d[m][2], d[k][0],d[k][1], d[k][2],c[q]);
}
}
}
for(p=q;p>0;p=p-1){
if(c[p]==c[p-1]){
q=q-1;
}
else break;
}
}
return 0;
}
|
64 | 31680 | void main()
{
char *p;
int a[12][3], n,i,j,t=1;
double b[50][3],temp;
p="%d%d%d";
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf(p,&a[i][0],&a[i][1],&a[i][2]);
}
for(i=1;i<=n-1;i++)
for(j=i+1;j<=n;j++)
{
b[t][0]=sqrt(pow(a[i][0]-a[j][0],2)+pow(a[i][1]-a[j][1],2)+pow(a[i][2]-a[j][2],2));
b[t][1]=i;
b[t][2]=j;
t++;
}
for(i=1;i<t-1;i++)
for(j=1;j<t-i;j++)
{
if(b[j][0]<b[j+1][0])
{
temp=b[j+1][0];
b[j+1][0]=b[j][0];
b[j][0]=temp;
temp=b[j+1][1];
b[j+1][1]=b[j][1];
b[j][1]=temp;
temp=b[j+1][2];
b[j+1][2]=b[j][2];
b[j][2]=temp;
}
}
for(i=1;i<t;i++)
printf("(%d,%d,%d)-(%d,%d,%d)=%.2f\n",a[(int)(b[i][1])][0],a[(int)(b[i][1])][1],a[(int)(b[i][1])][2],a[(int)(b[i][2])][0],a[(int)(b[i][2])][1],a[(int)(b[i][2])][2],b[i][0]);
} |
64 | 31681 | int main() {
int n;
cin >> n;
int point[10][3] = {0}; // to store the position of the points
float distance[45][3] = {0}; // to store the distances
for(int i = 0; i < n; i++)
for(int j = 0; j < 3; j++)
cin >> point[i][j];
int count = 0; // to calculate the number of the distances
for(int i = 0; i < n - 1; i++)
for(int j = i + 1; j < n; j++) { // to calculate the distances and store the name of the points
distance[count][0] = i;
distance[count][1] = j;
distance[count][2] = sqrt((float)(point[i][0] - point[j][0])*(point[i][0] - point[j][0]) + (point[i][1] - point[j][1])*(point[i][1] - point[j][1]) +(point[i][2] - point[j][2])*(point[i][2] - point[j][2]));
count++;
}
float temp = 0;
for(int i = 0; i < count - 1; i++) // bubble sort
for(int j = i + 1; j < count ; j++) {
if(distance[i][2] < distance[j][2]) {
temp = distance[i][0];
distance[i][0] = distance[j][0];
distance[j][0] = temp;
temp = distance[i][1];
distance[i][1] = distance[j][1];
distance[j][1] = temp;
temp = distance[i][2];
distance[i][2] = distance[j][2];
distance[j][2] = temp;
}
else if(distance[i][2] == distance[j][2]) {
if(distance[i][0] > distance[j][0]) {
temp = distance[i][0];
distance[i][0] = distance[j][0];
distance[j][0] = temp;
temp = distance[i][1];
distance[i][1] = distance[j][1];
distance[j][1] = temp;
temp = distance[i][2];
distance[i][2] = distance[j][2];
distance[j][2] = temp;
}
if(distance[i][1] > distance[j][1]) {
temp = distance[i][0];
distance[i][0] = distance[j][0];
distance[j][0] = temp;
temp = distance[i][1];
distance[i][1] = distance[j][1];
distance[j][1] = temp;
temp = distance[i][2];
distance[i][2] = distance[j][2];
distance[j][2] = temp;
}
}
}
for(int i = 0; i < count; i++) {
printf("(%d,%d,%d)-(%d,%d,%d)=%.2f\n", point[(int)distance[i][0]][0],point[(int)distance[i][0]][1],point[(int)distance[i][0]][2],point[(int)distance[i][1]][0],point[(int)distance[i][1]][1],point[(int)distance[i][1]][2],distance[i][2]);
}
return 0;
} |
64 | 31682 | double juli(int a,int b,int c,int d,int e,int f);
int main(){
int x[10],y[10],z[10];
int x1[1000],y1[1000],z1[1000],x2[1000],y2[1000],z2[1000];
int n,p=0;
double ju[1000];
scanf("%d",&n);
for(int i=0;i<n;i++){
scanf("%d",&x[i]);
scanf("%d",&y[i]);
scanf("%d",&z[i]);
}
for(int a=0;a<100;a++){
for(int b=a+1;b<n;b++){
ju[p]=juli(x[a],y[a],z[a],x[b],y[b],z[b]);
x1[p]=x[a];
y1[p]=y[a];
z1[p]=z[a];
x2[p]=x[b];
y2[p]=y[b];
z2[p]=z[b];
p++;
}
}
for(int k=1;k<=p-1;k++){
double e;
int o;
for(int i=0;i<=p-1-k;i++){
if(ju[i]<ju[i+1]){
e=ju[i+1];
ju[i+1]=ju[i];
ju[i]=e;
o=x1[i+1];
x1[i+1]=x1[i];
x1[i]=o;
o=y1[i+1];
y1[i+1]=y1[i];
y1[i]=o;
o=z1[i+1];
z1[i+1]=z1[i];
z1[i]=o;
o=x2[i+1];
x2[i+1]=x2[i];
x2[i]=o;
o=y2[i+1];
y2[i+1]=y2[i];
y2[i]=o;
o=z2[i+1];
z2[i+1]=z2[i];
z2[i]=o;
}
}
}
for(int q=0;q<p;q++){
printf("(%d,%d,%d)-(%d,%d,%d)=%.2lf\n",x1[q],y1[q],z1[q],x2[q],y2[q],z2[q],ju[q]);
}
return 0;
}
double juli(int a,int b,int c,int d,int e,int f){
double result;
double l,m,n;
l=1.0*(d-a)*(d-a);
m=1.0*(e-b)*(e-b);
n=1.0*(f-c)*(f-c);
result=sqrt(l+m+n);
return result;
}
|
64 | 31683 | void main()
{
int num,r,s,t,q2,a[200],b[200];
double x[20],y[20],z[20],result[200],q1;
scanf("%d",&num);
for(r=0;r<num;r++) scanf("%lf%lf%lf",&x[r],&y[r],&z[r]);
for(r=0,t=0;r<num-1;r++){
for(s=r+1;s<num;s++){
result[t]=sqrt((x[r]-x[s])*(x[r]-x[s])+(y[r]-y[s])*(y[r]-y[s])+(z[r]-z[s])*(z[r]-z[s]));
a[t]=r;b[t]=s;
t++;
}
}
for(r=0;r<num*(num-1)/2-1;r++){
for(s=num*(num-1)/2-1;s>r;s--){
if(result[s-1]<result[s]){q1=result[s-1];result[s-1]=result[s];result[s]=q1;
q2=a[s-1];a[s-1]=a[s];a[s]=q2;q2=b[s-1];b[s-1]=b[s];b[s]=q2;}
}
}
for(r=0;r<num*(num-1)/2;r++)
printf("(%.0f,%.0f,%.0f)-(%.0f,%.0f,%.0f)=%.2f\n",x[a[r]],y[a[r]],z[a[r]],x[b[r]],y[b[r]],z[b[r]],result[r]);
} |
64 | 31684 | int main(){
int x[10],y[10],z[10],n,i,j,k=0;
struct{
double d;
int nu1,nu2;
}p[50],zh;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d%d%d",&x[i],&y[i],&z[i]);
}
for(j=0;j<n-1;j++){
for(i=j+1;i<n;i++){
p[k].d=sqrt((x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j])+(z[i]-z[j])*(z[i]-z[j]));
p[k].nu1=j;
p[k].nu2=i;
k++;
}
}
for(i=0;i<k-1;i++){
for(j=0;j<k-1-i;j++){
if(p[j].d>p[j+1].d){
zh=p[j+1];
p[j+1]=p[j];
p[j]=zh;
}
else if(p[j].d==p[j+1].d){
if(p[j].nu1<p[j+1].nu1){
zh=p[j+1];
p[j+1]=p[j];
p[j]=zh;
}
else if((p[j].nu1==p[j+1].nu1)&&(p[j].nu2<p[j+1].nu2)){
zh=p[j+1];
p[j+1]=p[j];
p[j]=zh;
}
}
}
}
for(i=k-1;i>=0;i--){
printf("(%d,%d,%d)-(%d,%d,%d)=%.2lf\n",x[p[i].nu1],y[p[i].nu1],z[p[i].nu1],x[p[i].nu2],y[p[i].nu2],z[p[i].nu2],p[i].d);
}
return 0;
} |
64 | 31685 | int point[MAX][3];
double d;
struct {
int x1,x2,y1,y2,z1,z2;
double d;
}dis[DISTANCE],mid;
int n,m=0,i,j;
int main(){
scanf("%d",&n);
for(i=0;i<=n-1;i++){
scanf("%d%d%d",&point[i][0],&point[i][1],&point[i][2]);
}
for(i=0;i<=n-2;i++){
for(j=i+1;j<=n-1;j++){
dis[m].x1=point[i][0];
dis[m].x2=point[j][0];
dis[m].y1=point[i][1];
dis[m].y2=point[j][1];
dis[m].z1=point[i][2];
dis[m].z2=point[j][2];
dis[m].d=sqrt((dis[m].x1-dis[m].x2)*(dis[m].x1-dis[m].x2)+(dis[m].y1-dis[m].y2)*(dis[m].y1-dis[m].y2)+(dis[m].z1-dis[m].z2)*(dis[m].z1-dis[m].z2));
m++;
}
}
for(i=0;i<=m-1;i++){
for(j=0;j<m-1;j++){
if(dis[j].d<dis[j+1].d){
mid=dis[j];
dis[j]=dis[j+1];
dis[j+1]=mid;
}
}
}
for(i=0;i<=m-1;i++){
printf("(%d,%d,%d)-(%d,%d,%d)=%.2lf\n",dis[i].x1,dis[i].y1,dis[i].z1,dis[i].x2,dis[i].y2,dis[i].z2,dis[i].d);
}
return 0;
} |
64 | 31686 | int main()
{
int n,i,k,m,p,t,zong;
double ju;
int a[100],b[100],c[100],xe[100],f[100],g[100],h[100],l[100],he[100];
double juli[100];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d%d%d",&a[i],&b[i],&c[i]);
}
k=0;
int x;
for(m=0;m<n;m++){
for(p=m+1;p<n;p++){
x=(a[m]-a[p])*(a[m]-a[p])+(b[m]-b[p])*(b[m]-b[p])+(c[m]-c[p])*(c[m]-c[p]) ;
juli[k]=sqrt(x);
xe[k]=a[m];
f[k]=b[m];
g[k]=c[m];
h[k]=a[p];
l[k]=b[p];
he[k]=c[p];
k++;
}
}
zong=n*(n-1)/2;
for(i=0;i<zong;i++){
for(k=0;k<zong-i-1;k++){
if(juli[k]<juli[k+1]){
ju=juli[k];
juli[k]=juli[k+1];
juli[k+1]=ju;
t=xe[k];
xe[k]=xe[k+1];
xe[k+1]=t;
t=f[k];
f[k]=f[k+1];
f[k+1]=t;
t=g[k];
g[k]=g[k+1];
g[k+1]=t;
t=he[k];
he[k]=he[k+1];
he[k+1]=t;
t=h[k];
h[k]=h[k+1];
h[k+1]=t;
t=l[k];
l[k]=l[k+1];
l[k+1]=t;
}
}
}
for(i=0;i<zong;i++){
printf("(%d,%d,%d)-(%d,%d,%d)=%.2lf\n",xe[i],f[i],g[i],h[i],l[i],he[i],juli[i]);
}
return 0;
}
|
64 | 31687 |
struct position
{
int x;
int y;
int z;
}pos[10];
int main()
{
int n, finish[10][10] = {0}, cnt = 0;
float d[10][10] = {0}, square = 0, max = 0;
cin >> n;
for (int i = 0; i < n; i++)
cin >> pos[i].x >> pos[i].y >> pos[i].z;
for (int i = 0; i < n - 1; i++)
{
for (int j = i + 1; j < n; j++)
{
square = (pos[i].x - pos[j].x) * (pos[i].x - pos[j].x) + (pos[i].y - pos[j].y) * (pos[i].y - pos[j].y) +
(pos[i].z - pos[j].z) * (pos[i].z - pos[j].z);
d[i][j] = sqrt(square);
}
}
for (int k = 0; k < n * (n - 1) / 2; k++, max = 0)
{
for (int i = 0; i < n; i++)
{
for (int j = 0; j < n; j++)
{
if (max < d[i][j] && finish[i][j] == 0)
max = d[i][j];
}
}
for (int p = 0; p < n; p++)
{
for (int q = 0; q < n; q++)
{
if (max == d[p][q])
{
finish[p][q] = 1;
cnt++;
cout << "(" << pos[p].x << ',' << pos[p].y << ',' << pos[p].z << ")-(" << pos[q].x << ',' << pos[q].y << ',' << pos[q].z << ")=" << fixed << setprecision(2) << d[p][q] << endl;
}
}
}
if (cnt == n * (n - 1) / 2)
break;
}
return 0;
}
|
64 | 31688 | int main(){
int i,a,b,c=1,p,q,n,M[46],N[46],e;
double x[11],y[11],z[11],l[46],d;
scanf("%d ",&n);
for(i=1;i<=n;i++){
scanf("%lf %lf %lf",&x[i],&y[i],&z[i]);
}
for(a=1;a<n;a++){
for(b=a+1;b<=n;b++){
l[c]=sqrt((x[a]-x[b])*(x[a]-x[b])+(y[a]-y[b])*(y[a]-y[b])+(z[a]-z[b])*(z[a]-z[b]));
M[c]=a;
N[c]=b;
c++;
}
}
for(p=1;p<(n*(n-1))/2;p++){
for(q=p+1;q<=(n*(n-1));q++){
if(l[p]<l[q]){
for(i=q;i>p;i--){
d=l[i];
l[i]=l[i-1];
l[i-1]=d;
e=M[i];
M[i]=M[i-1];
M[i-1]=e;
e=N[i];
N[i]=N[i-1];
N[i-1]=e;
}
}
}
}
for(i=1;i<=n*(n-1)/2;i++){
printf("(%.0lf,%.0lf,%.0lf)-(%.0lf,%.0lf,%.0lf)=%.2lf\n",x[M[i]],y[M[i]],z[M[i]],x[N[i]],y[N[i]],z[N[i]],l[i]);
}
return 0;
}
|
64 | 31689 | /*************************
??cpp4
????
???
2013/12/12
**************************/
int main()
{
int n, i, j, k;
cin >> n;
struct point
{
int x;
int y;
int z;
} a[12];
for (i=1; i<=n; i++)
cin >> a[i].x >> a[i].y >> a[i].z;
struct distance
{
int x1;
int y1;
int z1;
int x2;
int y2;
int z2;
double l;
} b[60], temp;
k=1;
for (i=1; i <= n-1 ; i++)
{
for (j=i+1; j <= n; j++)
{
b[k].x1 = a[i].x;
b[k].y1 = a[i].y;
b[k].z1 = a[i].z;
b[k].x2 = a[j].x;
b[k].y2 = a[j].y;
b[k].z2 = a[j].z;
b[k].l = sqrt ( pow ((double)(a[i].x)- (double)(a[j].x) , 2.0) + pow ((double)(a[i].y)- (double)(a[j].y) , 2.0) + pow ((double)(a[i].z)- (double)(a[j].z) , 2.0));
k++;
}
}
for (i=1; i<= n*(n-1)/2; i++)
{
for (j=1; j<=n*(n-1)/2-1 ; j++)
{
if (b[j].l < b[j+1].l)
{
temp = b[j];
b[j] = b[j+1];
b[j+1] = temp;
}
}
}
for (i=1; i<=n * (n-1) /2; i++)
{
cout << "(" << b[i].x1 << "," << b[i].y1 << "," << b[i].z1 << ")-";
cout << "(" << b[i].x2 << "," << b[i].y2 << "," << b[i].z2 << ")=" ;
cout << fixed;
cout<< setprecision(2) << b[i].l << endl;
}
return 0;
}
|
64 | 31690 |
int main()
{
int i, j, k = 0, x[10], y[10], z[10];
int n;
struct distance
{
int x1;
int y1;
int z1;
int x2;
int y2;
int z2;
double d;
}dis[100], t;
cin >> n;
for (i = 0; i < n; i++)
{
cin >> x[i];
cin >> y[i];
cin >> z[i];
}
for (i = 0; i < n - 1; i++)
{
for (j = i + 1; j < n; j++)
{
dis[k].x1 = x[i];
dis[k].y1 = y[i];
dis[k].z1 = z[i];
dis[k].x2 = x[j];
dis[k].y2 = y[j];
dis[k].z2 = z[j];
dis[k].d = sqrt((x[i] - x[j]) * (x[i] - x[j]) + (y[i] - y[j]) * (y[i] - y[j]) + (z[i] - z[j]) * (z[i] - z[j]));
k++;
}
}
for (i = 0; i < k - 1; i++)
{
for (j = 0; j < k - 1 - i; j++)
{
if (dis[j].d < dis[j + 1].d)
{
t = dis[j];
dis[j] = dis[j + 1];
dis[j + 1] = t;
}
}
}
for (i = 0; i < k; i++)
{
cout << "(" << dis[i].x1 << ","
<< dis[i].y1 << ","
<< dis[i].z1 << ")-("
<< dis[i].x2 << ","
<< dis[i].y2 << ","
<< dis[i].z2 << ")="
<< fixed << setprecision(2) << dis[i].d << endl;
}
return 0;
}
|
64 | 31691 | int main()
{
int n,i,j,count,il,jl;
int a[10][3];
double m;
double b[45];
int c[45][2];
scanf("%d",&n);
count=0;
for(i=0;i<n;i++)
{
scanf("%d %d %d",&a[i][0],&a[i][1],&a[i][2]);
} //????
for(i=0;i<n-1;i++)
{
for(j=i+1;j<n;j++) //????????
{
m=sqrt((a[i][0]-a[j][0])*(a[i][0]-a[j][0])+(a[i][1]-a[j][1])*(a[i][1]-a[j][1])+(a[i][2]-a[j][2])*(a[i][2]-a[j][2]));
b[count]=m;
c[count][0]=i;
c[count][1]=j;
count=count+1;
}
}
for(i=0;i<(n-1)*n/2;i++)
{
for(j=0;j<(n-1)*n/2-1;j++)
{
if(b[j]<b[j+1])
{
m=b[j+1];
b[j+1]=b[j];
b[j]=m;
il=c[j+1][0];
c[j+1][0]=c[j][0];
c[j][0]=il;
jl=c[j+1][1];
c[j+1][1]=c[j][1];
c[j][1]=jl;
}
if(b[j]==b[j+1])
{
m=b[j+1];
b[j+1]=b[j];
b[j]=m;
il=c[j+1][0];
c[j+1][0]=c[j][0];
c[j][0]=il;
jl=c[j+1][1];
c[j+1][1]=c[j][1];
c[j][1]=jl;
}
}
}
for(i=0;i<(n-1)*n/2;i++)
{
for(j=0;j<(n-1)*n/2-1;j++)
{
if(b[j]==b[j+1])
{
if(c[j][0]>c[j+1][0]||(c[j][0]==c[j+1][0]&&c[j][1]>c[j+1][1]))
{
m=b[j+1];
b[j+1]=b[j];
b[j]=m;
il=c[j+1][0];
c[j+1][0]=c[j][0];
c[j][0]=il;
jl=c[j+1][1];
c[j+1][1]=c[j][1];
c[j][1]=jl;
}
}
}
}
for(i=0;i<n*(n-1)/2;i++)
{
il=c[i][0];
jl=c[i][1];
printf("(%d,%d,%d)-(%d,%d,%d)=%.2lf\n",a[il][0],a[il][1],a[il][2],a[jl][0],a[jl][1],a[jl][2],b[i]);
}
return 0;
} |
64 | 31692 | double swap(double*x,double*y);
int main()
{
int p,n,i,j;
double q,x[11],y[11],z[11],px,py,pz,x1[46],y1[46],z1[46],x2[46],y2[46],z2[46];
double l[46]={0};
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%lf%lf%lf",&x[i],&y[i],&z[i]);
}
p=0;
for(i=0;i<n;i++)
{
for(j=i+1;j<n;j++)
{
x1[p]=x[i];y1[p]=y[i];z1[p]=z[i];x2[p]=x[j];y2[p]=y[j];z2[p]=z[j];
px=x[i]-x[j];py=y[i]-y[j];pz=z[i]-z[j];q=pow(px,2)+pow(py,2)+pow(pz,2);
l[p]=pow(q,0.5);p++;
}
}
p--;
for(i=p;i>=0;i--)
{
for(j=0;j<p;j++)
{
if(l[j]<l[j+1])
{
swap(&l[j],&l[j+1]);
swap(&x1[j],&x1[j+1]);swap(&y1[j],&y1[j+1]);swap(&z1[j],&z1[j+1]);
swap(&x2[j],&x2[j+1]);swap(&y2[j],&y2[j+1]);swap(&z2[j],&z2[j+1]);
}
}
}
for(i=0;i<=p;i++)
{
printf("(%g,%g,%g)-(%g,%g,%g)=%.2lf\n",x1[i],y1[i],z1[i],x2[i],y2[i],z2[i],l[i]);
}
return 0;
}
double swap(double*x,double*y)
{
double t;
t=*x;*x=*y;*y=t;
return 0;
}
|
64 | 31693 | int main(){
int n;
struct point{
int x,y,z,i;
}points[10];
struct jieguo{
struct point pointqian;
struct point pointhou;
double juliss;
}e,jieguos[45];
scanf("%d",&n);
int i=0;
for(i=0;i<n;i++){
scanf("%d%d%d",&points[i].x,&points[i].y,&points[i].z);
}
int m=0,k=0;
i=0;
for(m=0;m<n;m++){
for(k=m+1;k<n;k++){
jieguos[i].pointqian=points[m];
jieguos[i].pointhou=points[k];
jieguos[i].juliss=sqrt((jieguos[i].pointqian.x-jieguos[i].pointhou.x)*(jieguos[i].pointqian.x-jieguos[i].pointhou.x)+(jieguos[i].pointqian.y-jieguos[i].pointhou.y)*(jieguos[i].pointqian.y-jieguos[i].pointhou.y)+(jieguos[i].pointqian.z-jieguos[i].pointhou.z)*(jieguos[i].pointqian.z-jieguos[i].pointhou.z));
i++;
}
}
for(k=1;k<(n*(n-1)/2);k++){
for(i=0;i<(n*(n-1)/2)-k;i++){
if(jieguos[i].juliss<jieguos[i+1].juliss){
e=jieguos[i+1];
jieguos[i+1]=jieguos[i];
jieguos[i]=e;
}
}
}
for(i=0;i<(n*(n-1)/2);i++){
printf("(%d,%d,%d)-(%d,%d,%d)=%.2lf\n",jieguos[i].pointqian.x,jieguos[i].pointqian.y,jieguos[i].pointqian.z,jieguos[i].pointhou.x,jieguos[i].pointhou.y,jieguos[i].pointhou.z,jieguos[i].juliss);
}
return 0;
} |
64 | 31694 | int main(){
int n;
scanf("%d",&n);
int d[n][3];
for(int i=0;i<n;i++){
for(int j=0;j<3;j++){
scanf("%d",&d[i][j]);
}
}
int c=n*(n-1)/2;
double len[c];
for(int i=0;i<c;i++){
len[i]=0;
}
int b=0;
int o[c], p[c], q[c], r[c], s[c], t[c];
for(int i=0;i<(n-1);i++){
for(int j=i+1;j<n;j++){
double tmp=0;
tmp=1.0*sqrt((d[i][0]-d[j][0])*(d[i][0]-d[j][0])+(d[i][1]-d[j][1])*(d[i][1]-d[j][1])+(d[i][2]-d[j][2])*(d[i][2]-d[j][2]));
len[b]=tmp;
o[b]=d[i][0];
p[b]=d[i][1];
q[b]=d[i][2];
r[b]=d[j][0];
s[b]=d[j][1];
t[b]=d[j][2];
b=b+1;
}
}
for(int i=0;i<c;i++){
for(int j=c-1;j>i;j--){
if (len[j]>len[j-1]){
double tmp=0;
tmp=len[j-1];
len[j-1]=len[j];
len[j]=tmp;
int y=0;
y=o[j-1];
o[j-1]=o[j];
o[j]=y;
y=0;
y=p[j-1];
p[j-1]=p[j];
p[j]=y;
y=0;
y=q[j-1];
q[j-1]=q[j];
q[j]=y;
y=0;
y=r[j-1];
r[j-1]=r[j];
r[j]=y;
y=0;
y=s[j-1];
s[j-1]=s[j];
s[j]=y;
y=0;
y=t[j-1];
t[j-1]=t[j];
t[j]=y;
}
}
}
for(int i=0;i<c;i++){
printf("(%d,%d,%d)-(%d,%d,%d)=%.2lf\n",o[i], p[i], q[i], r[i], s[i], t[i], len[i]);
}
return 0;
}
|
64 | 31695 | struct dir{
int dot1[3];
int dot2[3];
float dis;
} dir[50];
struct dir temp;
int num[30];
int dot[50][3];
int n,i,j,p=0,a,b;
int main()
{
scanf("%d",&n);
for(i=1;i<=3*n;i++)
{
scanf("%d",&num[i]);
if(i%3!=0)
{
a=i/3;
b=i%3-1;
dot[a][b]=num[i];
}
else dot[i/3-1][2]=num[i];
}
for(i=0;i<n;i++)
{
for(j=i+1;j<n;j++)
{
dir[p].dot1[0]=dot[i][0];dir[p].dot1[1]=dot[i][1];dir[p].dot1[2]=dot[i][2];
dir[p].dot2[0]=dot[j][0];dir[p].dot2[1]=dot[j][1];dir[p].dot2[2]=dot[j][2];
dir[p].dis=sqrt((dot[i][0]-dot[j][0])*(dot[i][0]-dot[j][0])+(dot[i][1]-dot[j][1])*(dot[i][1]-dot[j][1])+(dot[i][2]-dot[j][2])*(dot[i][2]-dot[j][2]));
p++;
}
}
for(i=1;i<p;i++)
{
for(j=0;j<p-i;j++)
{
if(dir[j].dis<dir[j+1].dis)
{
temp=dir[j];
dir[j]=dir[j+1];
dir[j+1]=temp;
}
}
}
for(i=0;i<p;i++)
{
printf("(%d,%d,%d)-(%d,%d,%d)=%.2f\n",dir[i].dot1[0],dir[i].dot1[1],dir[i].dot1[2],dir[i].dot2[0],dir[i].dot2[1],dir[i].dot2[2],dir[i].dis);
}
return 0;
}
|
64 | 31696 | struct dot
{
int x;
int y;
int z;
}point[10];
int main()
{
int n,i,j,k,l,t=0,s=0;
float a[10][10]={0},tem,b[50]={0};
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d%d%d",&point[i].x,&point[i].y,&point[i].z);
s=s+i;
}
for(i=0;i<n-1;i++)
for(j=i+1;j<n;j++)
{
a[i][j]=sqrt((point[i].x-point[j].x)*(point[i].x-point[j].x)+(point[i].y-point[j].y)*(point[i].y-point[j].y)+(point[i].z-point[j].z)*(point[i].z-point[j].z));
b[t]=a[i][j];
t++;
}
for(i=0;i<s-1;i++)
for(j=0;j<s-i-1;j++)
{
if(b[j]<b[j+1])
{
tem=b[j];
b[j]=b[j+1];
b[j+1]=tem;
}
}
for(k=0;k<s;k++)
{
if(b[k]==b[k-1])
continue;
else
{
for(i=0;i<n-1;i++)
for(j=i+1;j<n;j++)
{
if(a[i][j]==b[k])
printf("(%d,%d,%d)-(%d,%d,%d)=%.2f\n",point[i].x,point[i].y,point[i].z,point[j].x,point[j].y,point[j].z,b[k]);
}
}
}
return 0;
}
|
64 | 31697 | int main(){
int k[10][3],t;
int n,i,j,a,b,g[100];
double h[100],e;
scanf("%d",&n);
for(i=0;i<100;i++){
g[i]=i;
}
for(i=0;i<100;i++){
h[i]=-1;
}
for(i=0;i<n;i++){
for(j=0;j<3;j++){
scanf("%d",&k[i][j]);
}
}
for(i=0;i<n-1;i++){
for(j=i+1;j<n;j++){
h[i*n+j]=1.0*sqrt((k[i][0]-k[j][0])*(k[i][0]-k[j][0])+(k[i][1]-k[j][1])*(k[i][1]-k[j][1])+(k[i][2]-k[j][2])*(k[i][2]-k[j][2]));
}
}
for(i=0;i<100;i++){
for(j=99;j>i;j--){
if(h[j-1]<h[j]){
t=g[j];
g[j]=g[j-1];
g[j-1]=t;
e=h[j];
h[j]=h[j-1];
h[j-1]=e;
}
}
}
for(i=0;i<100;i++){
if(h[i]!=-1){
a=g[i]/n;
b=g[i]%n;
printf("(%d,%d,%d)-(%d,%d,%d)=%.2lf\n",k[a][0],k[a][1],k[a][2],k[b][0],k[b][1],k[b][2],h[i]);
}
}
return 0;
} |
64 | 31698 | /*
* juli.cpp
*??: ?????????
* Created on: 2012-11-9
* Author: ??
*/
int main() {
int n, i, j, k = 0, x[10], y[10], z[10], start[45], end[45];//??n???????????
double dis[45];//????
cin >> n;
for (i = 0; i < n; i++)
cin >> x[i] >> y[i] >> z[i];//??
for (i = 0; i < n - 1; i++)
for (j = i + 1; j < n; j++) {
start[k] = i;
end[k] = j;
dis[k] = sqrt((x[i] - x[j]) * (x[i] - x[j]) + (y[i] - y[j]) * (y[i]
- y[j]) + (z[i] - z[j]) * (z[i] - z[j]));
k++;//???????????????????????
}
for (i = 0; i < k - 1; i++)
for (j = 0; j < k - i - 1; j++) {
if (dis[j] < dis[j + 1]) {
swap(dis[j], dis[j + 1]);
swap(start[j], start[j + 1]);
swap(end[j], end[j + 1]);//????
}
}
for (i = 0; i < k; i++)
printf("(%d,%d,%d)-(%d,%d,%d)=%.2f\n", x[start[i]], y[start[i]],
z[start[i]], x[end[i]], y[end[i]], z[end[i]], dis[i]);//?????
return 0;
}
|
64 | 31699 | int main()
{
int n, i, j, k = 0, t, x[10], y[10], z[10];
double dis[10][9] = {0}, dist[50] = {0}, a;
cin>>n;
for (i = 0; i < n; i++)
{
cin>>x[i]>>y[i]>>z[i];
}
for (i = 0; i < n - 1; i++)
{
for (j = i + 1; j < n; j++)
{
dis[i][j-i-1] = sqrt((x[i] - x[j]) * (x[i] - x[j]) +
(y[i] - y[j]) * (y[i] - y[j]) + (z[i] - z[j]) * (z[i] - z[j]));
dist[k++] = dis[i][j-i-1];
}
}
for (k = 0; k < n * (n - 1) / 2; k++)
{
for (t = 0; t < n * (n - 1) / 2 - k - 1; t++)
{
if (dist[t] < dist[t + 1])
{
a = dist[t];
dist[t] = dist[t + 1];
dist[t + 1] = a;
}
}
}
for (k = 0; k < n * (n - 1) / 2; k++)
{
if (k >= 1 && dist[k] == dist[k - 1])
continue;
for (i = 0; i < n - 1; i++)
{
for (j = i + 1; j < n; j++)
{
if (dis[i][j-i-1] == dist[k])
{
cout<<'('<<x[i]<<','<<y[i]<<','<<z[i]<<')'<<'-'<<'('<<x[j]<<','<<y[j]<<','<<z[j]<<')'
<<'='<<fixed<<setprecision(2)<<dist[k]<<endl;
}
}
}
}
return 0;
}
|