label stringlengths 1 2 | index stringlengths 1 5 | code stringlengths 87 8.24k |
|---|---|---|
64 | 31500 | int main()
{
struct point
{
int x,y,z;
};
struct point p[10];
struct distance
{
struct point p1;
struct point p2;
float dis;
};
struct distance d[45];
struct distance temp;
int i,n,j,k;
float pf;
scanf("%d",&n);
k=0;
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;... |
64 | 31501 | struct Line
{
int n1;
int n2;
double dis;
};
int main()
{
double distance(double a[3],double b[3]);
struct Line l[55];
double num[10][3],td;
int n,i,j,k,p,q,t,num1[10][3];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%lf%lf%lf",&num[i][0],&num[i][1],&num[i][2]);
}
k=0;
for(i=0;i<n-1;i++)
{
for(j=i+1;j<n;... |
64 | 31502 | struct distance
{
double length;
int start;
int end;
};
main()
{
int n;
scanf("%d",&n);
int point[10][4];
int i,j;
struct distance dist[45];
for (i=0;i<n;i++)
scanf("%d %d %d",&point[i][1],&point[i][2],&point[i][3]);
int k=0;
for (i=0;i<n-1;i++)... |
64 | 31503 | struct dian
{
int z[6];
double d;
};
double ju(int x[3],int y[3])
{
double d;
d=sqrt((x[0]-y[0])*(x[0]-y[0])+(x[1]-y[1])*(x[1]-y[1])+(x[2]-y[2])*(x[2]-y[2]));
return d;
}
int main()
{
int n,i,j,a[20][3],x=0;
struct dian num[50];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%... |
64 | 31504 | //
// main.cpp
// ????
//
// Created by ???? on 13-11-6.
// Copyright (c) 2013? ????. All rights reserved.
//
int main()
{
int a[11][4];
int k=1;
float b[100][3];
//input
int n;
cin>>n;
for(int i=1;i<=n;i++)
{
cin>>a[i][1]>>a[i][2]>>a[i][3];
}
//end of input
//the distence into b
for(int ... |
64 | 31505 | int main()
{
struct jl
{int a1;int b1;int c1;int a2;int b2;int c2;float d;}hz[100],t;
int n,i,j,a[10],b[10],c[10],k=0;
double w;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d%d%d",&a[i],&b[i],&c[i]);
for(i=0;i<n-1;i++)
{
for(j=i+1;j<n;j++)
{
w=sqrt((a[i]-a[j])*(a[i]-a[j])+(b[i]-b[j])*(b[i]-b[j])+(c[i]-c[j... |
64 | 31506 | /*
* julipaixu.cpp
* ??:??????????n??????
* Created on: 2012-11-7
* Author: ???
*/
int main()
{
int n,i=0,j=0,k=0; //????,n??????
double t1,d; //????????
int t2,t3; //????????
cin>>n; //??n
int point[3][n], num[2][n*(n-1)/2];//??????point,num??????????
double distan... |
64 | 31507 |
int main(){
int n,i,j,k=0,Nline,dx,dy,dz;
scanf("%d",&n); //??????
struct Dot{
int x,y,z;
} dots[n]; //????,????????
Nline=n*(n-1)/2; //??????(????????)
for(i=0;i<n;i++)
{
scanf("%d %d %d",&dots[i].x,&dots[i].y,&dots[i].z); //??????
}
struct Line{
int x1,y1,z1;
int x2,y2,z2;
float dist;
}... |
64 | 31508 | struct dot{
int x;
int y;
int z;
}dots[10];
struct dist{
int d1;
int d2;
float dis;
}dists[45];
int cmp(const void *p1,const void *p2)
{
struct dist l1,l2;
l1=*(struct dist *)p1;
l2=*(struct dist *)p2;
if(l1.dis>l2.dis)
{
return -1;
}else if(l1.dis<l2.dis)
{
return 1;
}else{
if(l1.d1!=l2.d1)
{
... |
64 | 31509 | struct zuhe {
int a[3];
int b[3];
double m;
};
int main()
{ struct zuhe z[50];
struct zuhe b;
int l,i,j,n,m,k=0;
int s[100][4];
scanf("%d",&n);
for(i=0;i<n;i++){
for(j=0;j<3;j++)
scanf("%d",&s[i][j]);
}
for(i=0;i<n-1;i++){
for(j=i+1;j<n;j++){
for(l=0;l<3;l++){
z[k].a[l]=s[i][... |
64 | 31510 |
const double EPS=1e-6;
int main()
{
int a[10][3],c[50],n,z=0;
cin>>n;
for(int i=0;i<50;++i)
{c[i]=i;}
for(int i=0;i<n;++i)
{cin>>a[i][0]>>a[i][1]>>a[i][2];}
struct MyStruct
{
double d;
int x;
int y;
}b[50];
for(int i=0;i<n;++i)
for(int j=i+1;j<n;++j)
{
b[z].d =floor((100*sqrt( (a[i][0]-a[j][0])*(a[i][0]-a[j]... |
64 | 31511 | int main(){
int a[10][3],n;
scanf("%d",&n);
for(int i=0;i<n;i++)
{
for(int j=0;j<3;j++)
{
scanf("%d",&a[i][j]);
}
}
struct{
int x1,x2,y1,y2,z1,z2;
double d;
}dis[45],mid;
int m=0;
for(int k=0;k<n-1;k++)
{
for(int l=k+1;l<n;l++)
{
dis[m].x1=a[k][0];
dis[m].x2=a[l][0];
dis[m].y1=a[k][1]... |
64 | 31512 |
int main()
{
int n,i,j,k,p,l;
double x[10],y[10],z[10],m;
double d[100],c[100];
int a[100],b[100];
scanf("%d",&n);
for(i=0;i<=n-1;++i)
{
scanf("%lf%lf%lf",&x[i],&y[i],&z[i]);
}
k=0;
for(i=0;i<=n-2;++i)
{
for(j=i+1;j<=n-1;++j)
{
d[k]=sqrt((x[i]-x[j])*(x[i]-x[j])+... |
64 | 31513 | int main()
{
struct point
{
int x;
int y;
int z;
}Point[10];
int n,i,j,k=0,f[45],b[45],temp;
double d[45],num;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d%d%d",&Point[i].x,&Point[i].y,&Point[i].z);
}
for(i=0;i<n;i++)
{
for(j=i+1;j<n;j++)
{
d[k]=sqrt((Point[i].x-Point[j].x)*(Point[i].x-Point[j... |
64 | 31514 | int main()
{
int x[100][30],i,j,k=0,m,n,p;
double s[1000],a;
scanf("%d",&n);
m=n*(n-1)/2;
for(i=0;i<n;i++){
for(j=0;j<3;j++){
scanf("%d",&x[i][j]);
}
}
for(i=0;i<n;i++){
for(j=i+1;j<n;j++){
s[k]=sqrt((pow(x[i][0]-x[j][0],2)+pow(x[i][1]-x[j][1],... |
64 | 31515 | int main(){
struct dian{
int x,y,z;
}dians[45];
struct suoyou{
struct dian qian;
struct dian hou;
double ji;
}suoyous[45],e;
int n;
scanf("%d",&n);
int i;
for(i=0;i<n;i++){
scanf("%d%d%d",&dians[i].x,&dians[i].y,&dians[i].z);
}
int k,l=0;
for(i=0;i<n;i++){
for(k=i+1;k<n;k++){
suoyous[l].qian=d... |
64 | 31516 | float f(int a,int b,int c,int d,int e,int f);
int main()
{
int x[11],y[11],z[11],i,j,n,num=0;
scanf("%d",&n);
//scanf("%d %d %d",&x[0],&y[0],&z[0]);
for(i=0;i<n;i++)
scanf("%d %d %d",&x[i],&y[i],&z[i]);
struct POINT
{
int point1x;
int point1y;
int point1z;
... |
64 | 31517 | //
// main.cpp
// ????
//
// Created by ? ?? on 12-12-11.
// Copyright (c) 2012? ? ??. All rights reserved.
//
int main()
{
double b[99999][6];
double c[99999];
double a[1000][3];
int n;
cin >> n;
int i, j, k = 0, m;
for (i = 0; i < n; i++)
{
for (j = 0; j < 3; j++)
... |
64 | 31518 | struct point1
{
int x;
int y;
int z;
} point[10];
struct comb1
{
struct point1 po1;
struct point1 po2;
double distant;
} comb[50],t;
int abs(int a)
{
if(a>=0) return a;
else return(-a);
}
double dis(struct point1 a,struct point1 b)
{
int p,q,r;
double ans;
p=(a.x-b.x)*(a.x-b.x);
q=(a.y-b.y)... |
64 | 31519 | int main (){
int n,i,j,k,h,l;
scanf("%d",&n);
k=0;
int a[11];
int b[11];
int c[11];
int f[100];
int e[100];
double d[10000];
for(i=0;i<n;i++){
scanf("%d%d%d",&(a[i]),&(b[i]),&(c[i]));
}
k=1;
d[0]=0;
for(j=0;j<n;j++){
for(i=j+1;i<n;i++){
d[k]=sqrt((a[j]-a[i])*(a[j]-a[i])+(b[j]-b[i])*(b[j]-b[i])+(c[j]-c[i])*(c[j]-c[... |
64 | 31520 | //************************
//???????
//?????
//???2011-12-14
//************************
int main()
{
int x[10], y[10], z[10], n, i, j;
struct distance
{
int x1; //??
int y1;
int z1;
int x2;
int y2;
int z2;
double c; //??
}dis[46];
cin >> n;
cout << fixed;
for(i = 0;i < n;i++)
... |
64 | 31521 | //**********************************************************
//* ?????1.cpp *
//* ??????1200012906 *
//* ???2012?12?10? *
//* ????????? *
//***************************************... |
64 | 31522 | int main()
{
int b,c,d,h,i,j,k,l,m,n,o,s;
struct{
int x,y,z;
}point[10];
struct{
struct{
int p1,p2,p3;
}p[50];
struct{
int q1,q2,q3;
}q[50];
double r;
}dis[50];
double g;
scanf("%d",&n);
for(int a=0;a<n;a++)
{
scanf("%d%d%d",&(point[a].x),&(point[a].y),&(point[a].z));
}
s=n*(n-1)/2;
o=0;... |
64 | 31523 | int main()
{
int spot[11][3],i,j,n,count=0,x,y,z;
float dis[4951][3],k;
cin >>n;
for (i=1;i<=n;i++)
for (j=0;j<3;j++)
cin >>spot[i][j];//????
for (i=1;i<n;i++)
for (j=i+1;j<=n;j++)
{
count++;
x=spot[i][0]-spot[j][0];
y=spot[i]... |
64 | 31524 | struct space
{
float b;
int x;
int y;
}
juli[100],cache;
int main()
{
int a[10][3];
int i,j,k=0;
int n;
scanf("%d",&n);
scanf("%d %d %d",&a[0][0],&a[0][1],&a[0][2]);
for(i=1;i<n;i++)
{
scanf(" %d %d %d",&a[i][0],&a[i][1],&a[i][2]);
}
for(i=0,j=0;;)
{
juli[k].x=i;juli[k].y=j;
juli[k].b=sqrt((a[i][0]-a... |
64 | 31525 | main()
{
int x[10],y[10],z[10],a1[50],b1[50],c1[50],a2[50],b2[50],c2[50],n,i,j,k,m;
float d[50],q;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&x[i]);
scanf("%d",&y[i]);
scanf("%d",&z[i]);
}
k=0;
for(i=0;i<n;i++)
{
for(j=i+1;j<n;j++)
{
... |
64 | 31526 | int main(){
int a[10][3];
int x,y,z,i,j,k,n,f=0;
scanf("%d",&n);
double tmp,result[45][3];
for(i=0;i<n;i++){
scanf("%d%d%d",&x,&y,&z);
a[i][0]=x;a[i][1]=y;a[i][2]=z;
}
for(i=0;i<n;i++){
for(j=i+1;j<n;j++){
result[f][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));
res... |
64 | 31527 | /*
* 3.cpp
*
* Created on: 2012-11-3
* Author: AK
*/
int main(){
double a[50][3]; //???????????????????
double distance;
int x[10],y[10],z[10]; //?????????
int n,x1,y1,z1,i,j,k=0; //?????????
cin>>n;
for(i=0;i<n;i++){ ... |
64 | 31528 |
int main()
{
int n,i=0,j=0,e=0,m=-1,q=-1;
double a[100],b[100],c[100],t,g,f,r,v,s,o;
double d[100],p[100]={0},w[100]={0},k[100]={0},z[100]={0},l[100]={0},u[100]={0};
cin>>n;
for(i=0;i<n;i++)
cin>>a[i]>>b[i]>>c[i];
for(i=0;i<n*(n-1)/2;i++)
d[i]=0;
e=0;
for(i=0;i<n-1;i++)
for(j=i+1;j<n;j++)
{d[e]=sq... |
64 | 31529 | int main(){
int x[10],y[10],z[10],n,i,j,c,maxi,maxj;
float s[10][10],max;
max=0.0f;
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++){
s[i][j]=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]));
}
}
for(c=0;c<(n*(... |
64 | 31530 | int main(){
int n;
int x[10],y[10],z[10], q=0,a[100],b[100],c[100],d[100],e[100],f[100];
float t,m[100];
scanf("%d",&n);
for(int h=0;h<n;h++){
scanf("%d%d%d",&x[h],&y[h],&z[h]);
}
for(int i=0;i<n;i++){
for(int u=i+1;u<n;u++){
m[q] =(float)sqrt((x[i]-x[u])*(x[i]-x[u])+(y[i]-y[u])*(y[i]-y[u])+(z[i]-z[u])*(z[i]-z[u... |
64 | 31531 | int main(){
int x[10],y[10],z[10];
int n,i;
scanf("%d",&n);
int max,k=0;
max=n*(n-1)/2;
int MAX[45*45],MAX2[45*45];
int c;
double di[45][45],sz[45]={0.00};
for(i=0;i<n;i++){
scanf("%d%d%d",&x[i],&y[i],&z[i]);
}
for(i=0;i<n-1;i++){
for(k=1;k+i<n;k++){
di[i][i+k]=sqrt((x[i]-x[i+k])*(x[i]-x[i+k])+(y[i]-y[i+k])*(y[i]-y[... |
64 | 31532 | int main()
{
int n,i,k,j=0,m,f,g;
scanf("%d",&n);
int s[10][3],b[50][3],d[50][3];
double c[50],r,e;
for(i=0;i<n;i++){
for(k=0;k<3;k++){
scanf("%d",&s[i][k]);
}
}
for(i=0;i<n;i++){
for(k=i+1;k<n;k++){
r=sqrt((s[i][0]-s[k][0])*(s[i][0]-s[k][0])+(s[i][1]-s[k][1])*(s[i][1]-s[k][1])+(s[i][2]-s[k][2])*(s[i... |
64 | 31533 | 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(int 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... |
64 | 31534 | /*
* jiegou_4.cpp
* ???????
* Created on: 2011-1-2
* Author: Wang Ju
*/
struct distance //?????distance
{
double a[3]; //??1
double b[3]; //??2
double distance; //???????
};
int factorial(int i) //????facortial,??i?????????
{
return (i*(i+1))/2;
}
double ope... |
64 | 31535 | main()
{
int a[10],b[10],c[10];
int i,j,k,n,t;
float w;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d %d %d",&a[i],&b[i],&c[i]);
struct px
{
float d;
int p,q,r;
int x,y,z;
};
struct px m[45];
k=0;
for(i=0;i<n;i++)
{
for(j=i+1;j<n;j++)
{
m[k].d=sqrt((a[i]-a[j])*(a[i]-a[j])+(b[i]-b[j]... |
64 | 31536 | int main(){
int N;
cin>>N;
int a[10][3];
int b[100][2];
int S=0;
float d[100];
for (int i=0;i<N;i++)cin>>a[i][0]>>a[i][1]>>a[i][2];
for (int i=0;i<N;i++){
for (int j=i;j<N;j++){
if (i==j)continue;
b[S][0]=i;b[S][1]=j;
d[S]=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... |
64 | 31537 | /*
* Distance sorting.cpp
*
* Created on: 2013-11-6
* Author: ???
*/
int main()
{ int a[10],b[10],c[10];
float d[100],p,x[100][3],y[100][3];
int i,j,n,k,m=0,s,t;
cin>>n;
for(i=0;i<n;i++)
cin>>a[i]>>b[i]>>c[i];
for(i=0;i<n-1;i++)
{
for(j=i+1;j<n;j++)
{
x[m][... |
64 | 31538 | //********************************
//*?????(14-4) ???? **
//*?????? 1300012887 **
//*???2013.12.11 **
//********************************
int main()
{
int n, i, j, k = 0;
cin >> n; //????
struct dian //?????dian
{
int x;
int y;
int z;
} a[12]; //???????a
for (i = 0; i < n; i++)
cin >> a[i].x >> a[... |
64 | 31539 | int main()
{
struct pointlong
{
int a1;
int b1;
int c1;
int a2;
int b2;
int c2;
double sl;
};
struct pointlong point[10000];
int x[11]={0};
int y[11]={0};
int z[11]={0};
double a[11][11]={0};
double c[1000]={0};
int i,j,n,k,p,sum,w,f;
float m;
double temp;
k=0;
w=0;
scanf("%d",&n);
for(i=0;... |
64 | 31540 | double h(int x1,int y1,int z1,int x2,int y2,int z2)
{
double s;
int x,y,z;
x=x1-x2;
y=y1-y2;
z=z1-z2;
s=sqrt(x*x+y*y+z*z);
return s;
}
int main()
{
int n,a[10],b[10],c[10];
int i,k,j;
struct shizi{
int x1;int x2;
int y1;int y2;
int z1;int z2;
double l;
} s[50],tmp;
scanf("%d",&n);
for(i=0;i<n;i++)
{
s... |
64 | 31541 | int main()
{
double f(int a[],int b[]);
int n,a[10][3],count=0,i,j,k,d[45][2],num=0;
int g(int i,int j,int k,int d[][2],double b[],int n);
double t,b[45];
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-1;i++)
for(j=i+1;j<n;j++)
{b[count]=f(a[i],a[j]);
count+... |
64 | 31542 |
typedef struct point
{
int x,y,z;
}Point;
double Distance(Point p1, Point p2)
{
double dist=0;
dist = sqrtf((p1.x-p2.x)*(p1.x-p2.x) + (p1.y-p2.y)*(p1.y-p2.y) + (p1.z-p2.z)*(p1.z-p2.z)+0.0 );
return dist;
}
int main(int argc, char* argv[])
{
int n, i, j, k=0, numtotal, maxpj=0, maxpi=0;
double ** ppdDist, dMax... |
64 | 31543 | int main(){
int a[10][4],m[45][4],n[45][4],i=0,j=0,k=0,p,q,w;
double b[10][10],c[45];
scanf("%d",&w);
for(i=0;i<w;i++){
scanf("%d%d%d",&a[i][1],&a[i][2],&a[i][3]);
}
for(i=0;i<w;i++){
for(j=i+1;j<w;j++){
b[i][j]=(double)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... |
64 | 31544 |
int main()
{
struct info1
{
int a[3];
}
point[N];
struct info2
{
int f[3],l[3];
double result;
}
dist[N*(N-1)/2];
int n,i,j,k=0,p;
double tmpdist;
int tmppoint;
scanf("%d",&n);
for (i=0;i<n;i++)
{
scanf("%d %d %d",&point[i].a[0],&point[i].a[1],&point[i].a[2]);
}
for (i=0;i<n;i++)
{
for (j=i+... |
64 | 31545 | //????
int main()
{
int n,a[10],b[10],c[10],s=0,x[100],y[100],ht;
double d[100],max;
cin>>n;
for(int i=0;i<n;i++)
{
cin>>a[i]>>b[i]>>c[i];//?????
}
for(int i=0;i<n;i++)
{
for(int j=i+1;j<n;j++)
{
d[s]=sqrt((a[i]*1.0-a[j])*(a[i]-a[j])+(b[i]-b[j])*(b[i]-b[j])+(c[i]-c[j])*(c[i]-c[j]));
x[s]=... |
64 | 31546 | int main()
{
int n,b,c,i,j,k,e,g;
scanf("%d",&n);
int sa[11],sb[11],sc[11];
for(i=0;i<n;i++)
{
scanf("%d%d%d",&sa[i],&sb[i],&sc[i]);
}
int s[51],y[51],z[51];
double l[51],f;
i=0;
for(j=0;j<n-1;j++)
{
for(k=j+1;k<n;k++)
{
s[i]=(sa[j]-sa[k])*(sa[j]-sa[k])+(sb[j]-sb[k])*(sb[j]-... |
64 | 31547 | int main(){
int n,a[100][100],i,j,k,p,l,m=0,x,c[100][100],d[100][100],e2,e3,o,w=0;
double b[100],e1;
scanf("%d",&n);
for(i=0;i<n;i++){
for(j=0;j<3;j++){
scanf("%d",&a[i][j]);
}
}
for(p=1;p<=n;p++){
for(k=p-1;k<n-1;k++){
for(j=0;j<3;j++){
x=a[p-1][j]-a[k+1][j];
... |
64 | 31548 | int main(){
int a[10],b[10],c[10],e,f,g,l,m=0,o[50],p[50],q[50],r[50],s[50],t[50],u,v,w,x,y,z;
double d[50],n;
char h='(',i=')',j='-',k='=';
scanf("%d",&e);
for(f=0;f<e;f++){
scanf("%d%d%d",&a[f],&b[f],&c[f]);
}
for(f=0;f<(e-1);f++){
for(g=f+1;g<e;g++){
l=(a[f]-a[g])*(a[f]-a[g])+(b[f]-b[g])*(b[f]-b[g])+(c... |
64 | 31549 |
int main(){
int n=0,x[11],y[11],z[11],a[51][3];
double d[50];
scanf("%d\n",&n);
for(int i=1;i<=n;i++)
scanf("%d %d %d ",&x[i],&y[i],&z[i]);
int cnt=0;
for(int i=1;i<=n;i++)
for(int j=i+1;j<=n;j++){
int c=++cnt;
d[c]=sqrt(sqr(x[i]-... |
64 | 31550 | struct POINT {
int x;
int y;
int z;
};
struct DIST {
int a;
int b;
double dis;
};
int main()
{
int n,i,j,k,t;
double td;
struct POINT point[20];
struct DIST dists[200];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d%d%d",&point[i].x,&point[i].y,&point[i].z);
}
k=0;
for(i=0;i<n;i++)
{
for(j=i+1;j<... |
64 | 31551 | //********************************
//*??????? **
//*?????? 1200012839 **
//*???2012.12.10 **
//********************************
int main()
{
int n, k = 0;
cin >> n;
struct point
{
int x;
int y;
int z;
}point[n];
struct distance
{
... |
64 | 31552 | int main()
{
int n;
scanf("%d",&n);
int point[11][3];
for(int i=0;i<n;i++)
{
for(int j=0;j<3;j++)
{
scanf("%d",&point[i][j]);
}
}
double distance[15][15]={0};
double s;
for(int i=0;i<n;i++)
{
for(int k=1;i+k<n;k++)
{
... |
64 | 31553 | struct
{
int x;
int y;
int z;
} dot[10];
struct
{
int f1;
int f2;
double dis;
} d[55], t;
int main()
{
int n, i, j, c = 0, x1, y1, z1;
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++)
{
for (j = i + 1; j < n; j++)
{
x1 = (dot[i].x - dot[j].x) * (... |
64 | 31554 | int main()
{
typedef struct _Point
{
int x,y,z;
} Point;
typedef struct _Distance
{
int first, second;
float dist;
} Distance;
Point point[10];
int n;
scanf("%d", &n);
int i,j,total = n*(n-1)>>1;
n--;
for(i=0; i<=n; i++)
scanf("%d%d%d", &point[i].x, &point[i].y, &point[i].z);
Distance * pDistance =... |
64 | 31555 |
int main(){
int n,i,j,k,l;
int x[20],y[20],z[20];
struct
{
int x1,y1,z1;
int x2,y2,z2;
double dis;
}
out[50],h;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d%d%d",&x[i],&y[i],&z[i]);
}
k=0;
for(i=0;i<n;i++)
{
for(j=i+1;j<n;j++)
{
out[k].x1=x[i];
out[k].y1=y[i];
out[k].z1=z[i];
out[k... |
64 | 31556 | struct
{
float a;
int f,g;
}s[50],temp;
void main()
{
int n,i,j,x[10],y[10],z[10];
scanf("%d",&n);
for(i=0;i<n;i++)scanf("%d%d%d",&x[i],&y[i],&z[i]);
int t=0;
for(i=0;i<n-1;i++)
for(j=i+1;j<n;j++)
{
s[t].a=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]));
s[t].f=i;
s[t].... |
64 | 31557 | struct dis{
int p1[3];
int p2[3];
double d;
};
void main()
{
int a[10][3],i,j,k,r,n;
struct dis dt[45],t;
scanf("%d",&n);
for (i=0;i<n;i++)
{
for (j=0;j<3;j++)
{
scanf("%d",&a[i][j]);
}
}
for (i=0,r=0;i<n;i++)
{
for (j=i+1;j<n;j++)
{
for (dt[r].d=0,k=0;k<3;k++)
{
dt[r].p1[k]=a[i][k];
... |
64 | 31558 | double sqrt(double x);
int main(){
int n;
int sz[10][3];
int f=0;
double jl[100];
int zbx[100],zby[100];
scanf("%d",&n);
for(int s=0;s<n;s++){
for(int c=0;c<3;c++){
scanf("%d",&sz[s][c]);
}
}
for(int r=0;r<n;r++){
for(int t=r+1;t<n;t++){
jl[f]=sqrt(((sz[r][0]-s... |
64 | 31559 | struct point{
int a[3];
int b[3];
double distant;
}p[45],change;
void swap(struct point p[],int k);
void main()
{
int i,j,k=0,n;
int x[10],y[10],z[10];
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].a[0]=x[j];
p[k].a[1]=y[j];
p[k].a[2... |
64 | 31560 | int main() {
int n,a[1000][3],i,j,x,e;
double jl[1000][1000],m,k;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d%d%d",&a[i][0],&a[i][1],&a[i][2]);
}
k=0;
for(i=0;i<n-1;i++){
for(j=i+1;j<n;j++){
m=(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]);
j... |
64 | 31561 | struct District
{
int x;
int y;
int z;
}dis[11];//????
struct Distance
{
int a;
int b;
double c;
}d[91],temp;//?????????
int main()
{
int n,k=1;
cin>>n;
for(int i=1;i<=n;i++)
{
cin>>dis[i].x>>dis[i].y>>dis[i].z;
}
for(int i=1;i<n;i++)
{
for(int j=i+1;j<=n;j++)
{
d[k].a=i;
d[k].b=j;
... |
64 | 31562 | double a[10000],g[10000];
void mppx(double a[],int n);
int main()
{
int n,i,j,k,l,v,w;
double d,e,f;
struct b{
double x,y,z;
}c[1000];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%lf%lf%lf",&(c[i].x),&(c[i].y),&(c[i].z));
}
j=0;
k=1;
for(i=0;i<(n-1)*n/2;i++){
d=(c[j].x-c[k].x)*(c[j].x-c[k].x);
e=(c[j]... |
64 | 31563 | int main()
{
int n,i,e,j=1,k;
int x[10];
int y[10];
int z[10];
double a[45],m;
int b[45];
int c[45];
scanf("%d",&n);
for(i=1;i<=n;i++){
scanf("%d %d %d",&(x[i]),&(y[i]),&(z[i]));
}
for(i=1;i<=n-1;i++){
for(k=i+1;k<=n;k++){
a[j]=sqrt((x[i]-x[k])*(x[i]-x[k])+(y[i... |
64 | 31564 | int main()
{
int n,i,m,x[100],y[100],z[100],r[100],t[100],a,b,k,c,d,p;
double q[100],e;
m=0;
scanf("%d", &n);
for(i=0;i<n;i++){
scanf("%d%d%d", &x[i], &y[i], &z[i]);}
for(k=0;k<n;k++){
for(i=k+1;i<n;i++){
q[m]=sqrt(1.0*(x[i]-x[k])*(x[i]-x[k])+1.0*(y[i]-y[k])*(y[i]-y[k])+1.0*(z[i]-z[k])*(z[i]-z[k]));
r[m... |
64 | 31565 | int main() {
int n;
int a[10][3];
int i,j;
int b[100][2];
double s[100];
scanf("%d", &n);
for(i=0;i<n;i++) {
scanf("%d%d%d",&(a[i][0]), &(a[i][1]), &(a[i][2]));
}
int k=0;
for(i=0;i<n-1;i++) {
for(j=i+1;j<n;j++) {
s[k] = 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[k... |
64 | 31566 | int main()
{
int n,i,j,k;
int x,y;
int a[10][3];
double b[45][3],temp;
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,k=0;i<n;i++)
for(j=i+1;j<n;j++){
b[k][0]=i;
b[k][1]=j;
b[k][2]=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... |
64 | 31567 | int main(){
int n;
scanf("%d",&n);
int i,j=0,x[100],y[100],z[100],nlx[100],nly[100],nlz[100],nfx[100],nfy[100],nfz[100];
for(i=0;i<n;i++){
scanf("%d %d %d",&x[i],&y[i],&z[i]);
}
double d,jl[45];
for(i=0;i<n-1;i++){
for(int k=i+1;k<n;k++){
d=1.0*(x[i]-x[k])*(x[i]-x[k])+1.0*(y[i]-y[k])*(y[i]-y[k])+1.0*(z[i]-z[k])*(z[i... |
64 | 31568 | main()
{
struct B
{int a;int b;int c;int d;int e;int f;float g;}B[45];
int n,A[10][3],i,j,p=0,q=0;
float c[45];
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(j=i+1;j<n;j++)
{
B[p].a=A[i][0];
B[p].b=A[i][1];
B[p].c=A[i][2];
B[p].d=A[j][0];
B[p]... |
64 | 31569 |
int main()
{
int n,i,j,k;
double x,y,z;
int a[10][3]={0};;
double b[45]={0};
int c[45]={0},d[45]={0};
cin>> n;
for(i=0;i<n;i++)
{
cin>> a[i][0] >> a[i][1] >> a[i][2];
}
k=0;
for(i=0;i<n;i++)
{
for(j=i+1;j<n;j++)
{
x=y=z=0;
x=(a[i][0]-a[j][0])*(a[i][0]-a[j][0]);
y=(a[i][1]-a[j][1])*(a[i][1]-a... |
64 | 31570 | int main()
{
int n,l=0,a[101],i,j,b[101],c[101],f[50],g[50],x;
double e[50],y;
for(i=0;i<50;i++){e[i]=0;}
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d %d %d",&a[i],&b[i],&c[i]);
}
for(j=0;j<n-1;j++)
{
for(i=j+1;i<n;i++)
{
e[l]=sqrt((a[j]-a[i])*(a[j]-a[i])+(b[j]-b[i])*(b[j]-b[i])+(c[j]-c[i])*(c[j]-c[i]... |
64 | 31571 | int main()
{
int n,j,q;
scanf("%d",&n);
struct zb {
int x,y,z;
} zb[1000];
for(q=0;q<n;q++){
scanf("%d%d%d",&(zb[q].x),&(zb[q].y),&(zb[q].z));
}
int i=0;
struct jl {
int x1,x2,y1,y2,z1,z2;
double s;
} jl[1000];
for(q=0;q<n-1;q++){
for(j=q+1;j<n;j++){
jl[i].x1=zb[q].x;
jl[i].x2=zb[j].x;
jl[i... |
64 | 31572 | struct distance
{
double d;
int dx;
int dy;
}dis[100] = {0}, t;
struct point
{
int x;
int y;
int z;
}poi[10] = {0};
void input(int);
void calculate(int);
void arrange(int);
void output(int);
int main()
{
int n;
cin >> n;
input(n);
calculate(n);
arrange(n);
output(n);
return 0;
}
void input(int n)
{
int i... |
64 | 31573 | int main(){
int n,i,p,j,e,k,u;
double s[50];
int x[10],y[10],z[10];
struct result{
int x1,y1,z1,x2,y2,z2;
double s;
}a[50],t;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d%d%d",&x[i],&y[i],&z[i]);
}
p=(n*(n-1))/2;
for(i=0;i<n;i++){
for(j=i+1;j<n;j++){
... |
64 | 31574 | int main(){
int n,m,j,e,x[101],y[101],z[101],a[20000],b[20000];
int s[10000];
int t=0;
double c[10000];
scanf("%d\n",&n);
for(int i=0;i<n;i++){
scanf("%d%d%d",&x[i],&y[i],&z[i]);}
for(int i=0;i<n;i++){
for(j=i+1;j<n;j++){
s[t]=(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[t]=i;b[t]=j;t++;
... |
64 | 31575 | int main() {
int n,i,h,k,m;
scanf("%d",&n);
double dj[30];
struct dian {
double x,y,z;
} d[10];
struct jl {
double x1,y1,z1,x2,y2,z2;
double c;
} cd[46];
for(i=0;i<3*n;i++){
scanf("%lf",&(dj[i]));}
for(i=0;i<n;i++){
d[i].x=dj[3*i];
d[i]... |
64 | 31576 | int main(){
int n,y;
scanf("%d\n",&n);
int x[n][3];
double jl[10][10],o;
for(int i=0;i<n;i++){
scanf("%d%d%d",&x[i][0],&x[i][1],&x[i][2]);
}
for(int i=0;i<n-1;i++){
for(int k=i+1;k<n;k++){
jl[i][k]=0;
}
}
for(int i=0;i<n-1;i++){
for(int k=i... |
64 | 31577 | double jl(int ma,int mb,int mc,int md,int me,int mf);
int main(){
int a[max],b[max];
int i,k,n,j,h;
double t,s[max];
struct dian{
int x,y,z;
}d[max];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d%d%d",&(d[i].x),&(d[i].y),&(d[i].z));
}
for(k=0,j=0;j<n;j++){
for(i=j+1;i<n;i++,k++){
s[k]=jl(d[i].x,d[i].... |
64 | 31578 | int main()
{
int n,i,j,a[10000],b[10000],m,x[100],y[100],z[100];
float dis[10000],t;
cin>>n;
for (i=1; i<=n; i++)
cin>>x[i]>>y[i]>>z[i];
int cnt=0;
for (i=1; i<=n; i++)
for (j=i+1; j<=n; j++)
{
dis[cnt]=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[cnt]=i;
b[cnt]=j;
cnt=cnt... |
64 | 31579 | int main(){
int n;
scanf("%d",&n);
int *x=(int*)malloc(sizeof(int)*n);
int *y=(int*)malloc(sizeof(int)*n);
int *z=(int*)malloc(sizeof(int)*n);
int i,j;
for(i=0;i<n;i++){
scanf("%d%d%d",&x[i],&y[i],&z[i]);
}
double *d=(double*)malloc(sizeof(double)*((n-1)*n/2));
int *number1=(int*)mal... |
64 | 31580 | int main()
{
int n,i,t,j,m,k;
float a[10],b[10],c[10];
float d[10][10];
int e[10][10];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%f %f %f",&a[i],&b[i],&c[i]);
for(i=0;i<n-1;i++)
{
for(j=i+1;j<n;j++)
{
d[i][j]=sqrt((a[i]-a[j])*(a[i]-a[j])+(b[i]-b[j])*(b[i]-b[j])+(c[i]-c[j])*(c[i]-c[j]));
e[i][j]=1;
... |
64 | 31581 | int main(){
int n,m,i,a,b,*sz,*jd,*wd;
double *d,c;
scanf("%d",&n);
m=0;
for(i=0;i<n;i++){
m+=n-1-i;
}
sz=(int*)malloc(sizeof(int)*3*n);
d=(double*)malloc(sizeof(double)*m);
jd=(int*)malloc(sizeof(int)*m);
wd=(int*)malloc(sizeof(int)*m);
for(i=0;i<3*n;i++){
scanf("%d",&sz[i]);
}
i=0;
for(... |
64 | 31582 | int main(){
int n,i,m,j,k,w,p;
int sz[1000][3],num[10000][2];
double d[1000],q;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d %d %d",&sz[i][0] ,&sz[i][1] ,&sz[i][2]);
}
m=n*(n-1)/2;
k=0;
for(i=0;i<n-1;i++){
for(j=i+1;j<n;j++){
d[k]=sqrt((double)((sz[i][0]-sz[j][0])*(sz[i][0]-sz[j][0])+(sz[i][1]-sz[j][1])*(sz[... |
64 | 31583 | typedef struct _DISTANCE{
float distance;
int pointa[3];
int pointb[3];
} DISTANCE;
int main() {
int n,i,j,k=0,b,m,point[10][3];
cin>>n;
for(i=0;i<n;i++){
for(j=0;j<3;j++){
cin>>point[i][j];
}
}
... |
64 | 31584 | void dx(int x, int y);
void ds(double x, double y);
int main()
{
int n,i,j,q,p,l,k;
scanf("%d",&n);
p=0.5*n*(n-1);
int x[n],y[n],z[n];
double o;
double jl[p];
int xx[p],yy[p],zz[p],xa[p],ya[p],za[p];
q=0;
for(i=0;i<n;i++)
{scanf("%d%d%d",&x[i],&y[i],&z[i]);}
for(i=0;i<n;i++)
... |
64 | 31585 | int main()
{
int n,m,i,j,k=0;
int q,w;
int a[10000][4],c[10000],d[10000];
double b[10000],e;
scanf("%d",&n);
m=n*(n-1)/2;
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-1;i++)
{
for(j=i+1;j<n;j++)
{
b[k]=sqrt((a[i][0]-a[j][0])*(a[i][0]-a[j][0])... |
64 | 31586 | int main()
{
double n,x[100],y[100],z[100],c[100],l[100][100],e;
int a[1000],b[1000],i,j,m,p,q;
scanf("%lf",&n);
m=0;
for(i=0;i<n;i++)
{
scanf("%lf%lf%lf",&x[i],&y[i],&z[i]);
}
for(i=0;i<n;i++)
{
for(j=(i+1);j<n;j++)
{
l[i][j]=sqrt((x[i]-x[j])*(x... |
64 | 31587 | 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);
... |
64 | 31588 | int main()
{
int x[20] = {0}, y[20] = {0}, z[20] = {0}, n, flag1[200], flag2[200], i, j, k = 1, p;
double distance[200], t;
cin >> n;
for (i = 1; i <= n; i++)
{
cin >> x[i] >> y[i] >> z[i];
}
for (i = 1; i <= n; i++)
{
for (j = i + 1; j <= n; j++, k++)
{
distance[k] = sqrt(pow(x[i] - x[j], 2.0) + pow(y... |
64 | 31589 | int main(){
int n,i,j,c,d,s[10][3],k,f;
double a[10][10],e;
scanf("%d",&n);
for(i=0;i<n;i++){
for(j=0;j<3;j++){
scanf("%d",&s[i][j]);
}}
for(i=0;i<n-1;i++){
for(j=i+1;j<n;j++){
a[i][j]=sqrt(pow(s[i][0]-s[j][0],2)+pow(s[i][2]-s[j][2],2)+pow(s[i][1]-s[j][1],2));
}}
e=0;f=(n*n-n)/2;
for(k=1;k<=f;k++){
... |
64 | 31590 | int main(){
int a[10][3],dian[50][2],n,i,j,k=0,m;
double d[50],temp;
cin >> n;
for(i=0;i<n;i++){
cin >> a[i][0] >> a[i][1] >> a[i][2];}
for(i=0;i<n-1;i++){
for(j=i+1;j<n;j++){
d[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]));
dian[k][0... |
64 | 31591 | struct loc
{
int x;
int y;
int z;
};
int main()
{
struct loc a[10];
double len[10][10],max;
int n,i,j,k,no1,no2;
memset(len,0,sizeof(len));
scanf("%d",&n);
for (i=0;i<n;i++)
scanf("%d%d%d",&a[i].x,&a[i].y,&a[i].z);
for (i=0;i<n-1;i++)
for (j=i+1;j<n;j++)
len[i][j]=sqrt((a[i].x-a[j].x)*(a[i].x-a[j].x)+(... |
64 | 31592 |
int main()
{
int n;
struct dian
{
float a;
int x;
int y;
}a[45];
struct dian t;
int d[10][3];
int i,j,k=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d%d%d",&d[i][0],&d[i][1],&d[i][2]);
}
for(i=1;i<n;i++)
{
for(j=0;j<i;j++)
{
a[k].a=sqrt((d[i][0]-d[j][0])*(d[i][0]-d[j][0])+(d[i][1]-d[j][1])... |
64 | 31593 | int main()
{
int sz1[10][3],n,i=0,m;
double d[100],e;
scanf("%d", &n);
m=n*(n-1)/2;
for (int row=0; row<n; row++){
for (int col=0; col<3; col++){
scanf("%d", &sz1[row][col]);
}
}
for (int row1=0; row1<n; row1++){
for (int row2=row1+1; row2<n; row2++){
d[i]=sq... |
64 | 31594 |
int main() {
int n;
scanf("%d",&n);
struct coordinate{int x;int y;int z;int io;}pt[n];
int i;
for(i=0;i<n;i=i+1)
{
scanf("%d %d %d",&(pt[i].x),&(pt[i].y),&(pt[i].z));
pt[i].io=i;
}
int j;
int m;
m=n*(n-1)/2;//?????
struct distance{struct coor... |
64 | 31595 | int dist(int x1,int y1,int z1,int x2,int y2,int z2)
{
return (x1-x2)*(x1-x2)+(y1-y2)*(y1-y2)+(z1-z2)*(z1-z2);
}
int main()
{
int x[10],y[10],z[10],d[100],i,j,n,m,k,a1[100],b1[100],c1[100],a2[100],b2[100],c2[100];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d%d%d",&x[i],&y[i],&z[i]);
}
k=0;
for(i=0;i<n-1;i++)
... |
64 | 31596 | void main()
{
struct point
{
int x;
int y;
int z;
}P[10];
struct triple
{
struct point A;
struct point B;
double d;
}pair[50],tmp;
int n,i,j,k,c[31];
scanf("%d",&n);
for(i=1;i<=3*n;i++)
scanf("%d",&c[i]);
for(i=0;i<n;i++)
{
(P[i]).x=c[3*i+1];
(P[i]).... |
64 | 31597 |
int main(){
int n,nn;
int a[101],b[101],c[101],x[46][3],y[46][3],xx[46],yy[46],px,py,pz;
double jl[46],m;
scanf("%d",&n);
for(int i=0;i<n;i++){
scanf("%d %d %d",&a[i],&b[i],&c[i]);
}
int d=0;
for(int w=0;w<n;w++){
for(int j=w+1;j<n;j++){
jl[d]=sqrt(1.0*(a[w]-... |
64 | 31598 | struct point
{
int x;
int y;
int z;
}; //?????????
struct point dian[101];
double distance(struct point dian[],int i,int j){
int x=dian[i].x-dian[j].x;
int y=dian[i].y-dian[j].y;
int z=dian[i].z-dian[j].z;
double dis=(double)(x*x+y*y+z*z);
return sqrt(dis);
}
int main()
{
int n,i,j;
int t=0,k=0;
double a... |
64 | 31599 | int main(){
int n,i,j,k=0,z;
int a[10][3];
scanf("%d",&n);
for(i=0;i<n;i++){
if(i==0){
scanf("%d %d %d",&a[0][0],&a[0][1],&a[0][2]);
}
else{
scanf(" %d %d %d",&a[i][0],&a[i][1],&... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.