label stringlengths 1 2 | index stringlengths 1 5 | code stringlengths 87 8.24k |
|---|---|---|
64 | 31700 | int main(){
int zb[100][3],a,n,j,k,i;
double b,jl[100],t;
scanf("%d",&n);
for( i=0;i<n;i++){
for(k=0;k<3;k++){
scanf("%d",&zb[i][k]);
}
}
for(i=0;i<n;i++){
for(j=i+1;j<n;j++){
jl[10*i+j]=0;
}
}
for(i=0;i<n;i++){
for(j=i+1;j<n;j++){
a=((zb[i][0]-zb[j][0])*(zb[i][0]-zb[j][0]))+((zb[i][1]-zb[j][1])*(zb[i]... |
64 | 31701 | int main(){
int n,c,a,b,i,o,p,k;
double e;
scanf("%d",&n);
double jl[n][n];
int x[n],y[n],z[n];
k=n*(n-1)/2;
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){
jl[a][b]=sqrt((x[a]-x[b])*(x[a]-x[b])+(y[a]-y[b... |
64 | 31702 | struct point
{
double x;
double y;
double z;
};
struct points
{
double x1;
double y1;
double z1;
double x2;
double y2;
double z2;
double len;
};
double length(struct point a,struct point b)
{
return sqrt((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y)+(a.z-b.z)*(a.z-b.z));
}
void main()
{
int m,n,i,j,k;
stru... |
64 | 31703 | struct distance
{
int p1[3];
int p2[3];
float dis;
}d[50],t;
int main()
{
int n;
cin>>n;
int a[10][3];
for(int i=0;i<n;i++)
for(int j=0;j<3;j++)
cin>>a[i][j];
int p=0;
for(int i=0;i<n;i++)
for(int j=i+1;j<n;j++)
{d[p].p1[0]=a[i][0];
d[p].p1[1]=a[i][1];
d[p].p1[2]=a[i][2];
d[p].p2[0]... |
64 | 31704 | //***********************************************************************
//???????
//???????
//??????
//***********************************************************************
int main() //???
{
double s[45], l; //??double????????
... |
64 | 31705 | int main(){
int n,y;
scanf("%d\n",&n);
int x[1000][3];
double jl[100][100],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]=sqrt((x[i][0]-x[k][0])*(x[i][0]-x[k][0])+(x[i][1]-x[k][1])*(x... |
64 | 31706 |
struct point { int x;
int y;
int z; };
double dis(struct point b,struct point c);
int main()
{
int n,a,i=0,j=0,k;
struct point str[10];
struct thr{
float d;
int e;
int f; };
struct thr temp={0};
struct thr str1[10000]={0};
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d%d%d",&str[i].x,&str[i].y,&s... |
64 | 31707 | int main(){
int n,i,j,k,b,c;
int x[10],y[10],z[10];
double m[10][10],max=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-1;i++){
for(j=0;j<n;j++){
m[i][j]=sqrt((x[i]-x[j])*(x[i]-x[j])+... |
64 | 31708 | int point[10][3]={{0}};
float dis[10][10]={{0}};
float far[45]={0};
void bubblesort(int k)
{
for (int i=0;i<=k-1;i++)
{
for (int j=k;j>i;j--)
{
float tmp;
if (far[j]>far[j-1])
{
tmp=far[j];
far[j]=far[j-1];
far[j-1]=tmp;
}
}
}
}
int main()
{
int n;
cin>>n;
for (int i=0;i<=n-1;i++)
... |
64 | 31709 | //**************************
//*???????? *
//*??????1000012797?*
//*?????2010?12? *
//**************************
int main()
{
int i=0,j,n,count=0;
double a[10]={0},b[10]={0},c[10]={0}; //????a,b,c??????????????????
cin>>n; //????
for(i=0;i<n;i++)
{
cin>>a[i]>... |
64 | 31710 | /*
*12-1
*??? 1200012851
*2012.12.11
*????
**/
double dis(int x, int y, int z)
{
double s;
s = sqrt(x * x + y * y + z * z);
return s;
}
int main()
{
int x[10], y[10], z[10];
struct distance
{
double d;
int yi;
int er;
}d12[45], temp;
int n, i, j, k = 0;
cin >> n;
for (i = 0; i < n; i++)
{
cin >> x... |
64 | 31711 | int main (){
int n,i,j,a[10][3],b[100][3],c[100][3],k=0,e[100];
double d[100],l[100],x=0,m[100];
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++)
{
d[k]=sqrt(1.0*((a[i][0]-a[j][0])*(a[i][0]-a[j][0])+(a[i][1]-a[j][1])*(a[i][1]... |
64 | 31712 | struct d
{
int x;
int y;
int z;
};
struct p
{
struct d s1,s2;
float res;
};
float f(struct d s1,struct d s2)
{
double sum=0;
sum=(s1.x-s2.x)*(s1.x-s2.x)+(s1.y-s2.y)*(s1.y-s2.y)+(s1.z-s2.z)*(s1.z-s2.z);
return(sqrt(sum));
}
void change(struct p pri[300],int n)
{
int i,j;
struct p temp;
for(i=0;i<n-1;i++)
{
... |
64 | 31713 | int main(){
int n;
scanf("%d",&n);
int x[100],y[100],z[100];
double a[100][100],b[100];
int i,j;
for (i=0;i<n;i++){
scanf("%d%d%d",&x[i],&y[i],&z[i]);
}
int q;
q=0;
for (j=0;j<n-1;j++){
for(i=j+1;i<n;i++){
a[j][i]=sqrt((x[j]-x[i])*(x[j]-x[i])+(y[j]-y[i])*(y[j]-y[i])+(z[j]-z[i])*(z[j]-z[i]));
b[q]=a[... |
64 | 31714 | int main(){
int x[10];
int y[10];
int z[10];
double c[10][10];
double w[100];
int k[50][4],l[50][4];
int i,n,q,o,j,d=0,a,b;
double m;
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(q=i+1;q<n;q++){
m=1.0*(x[i]-x[q])*(x[i]-x[q])+1.0*(y[i]-y[q])*(y[i... |
64 | 31715 |
int main()
{
int n; //??n
cin>>n; //??n
float a[100],b[100],c[100],s[100],t; //??????a,b,c,???????????t
int i,l,m,p=0,j,k,q,x,d[100],e[100]; //???????????d,e
for(i=0;i<n;i++)
{
cin>>a[i]>>b[i]>>c[i]; //????
}
for(l=0;l<n-1;l++)
{
... |
64 | 31716 | struct location
{
int x;
int y;
int z;
} point[10], t;
struct dis
{
int point1;
int point2;
double s;
int num;
} len[45], temp;
int main()
{
int n, i, j,count = 0, p;
double t;
cin >> n;
for (i = 0; i < n; i++)
{
cin >> point[i].x >> point[i].y
>> point[i].z;
}
for (i = 0; i < n - 1; i++)
for (j =... |
64 | 31717 | struct point
{
int x[3];
}pt[10];
struct str
{
struct point po[2];
float distance;
}dis[50], temp;
void main()
{
int n, i, j, num;
scanf("%d",&n);
for(i=0; i<n; i++)
{
for(j=0; j<=2; j++)
scanf("%d",&pt[i].x[j]);
}
//??????
for(i=0; i<50; i++)
dis[i].distance=0.0;
for(i=0, num=0; i<n-1; i++)//????
{
... |
64 | 31718 | //********************************
//*????***********************
//*??? 1300012920**************
//********************************
int main()
{
int n , i , j;
int x , y , z;
int cnt = 0;
//???????"zuobiao"????????
struct
{
int x;
int y;
int z;
}zuobiao[10];
struct
{
int x1;
int y1;
int z1;
in... |
64 | 31719 | void main()
{int i,j,k=1,n,sa[100][3],b=0;
double s[100]={0},point[10][3],a,c;
scanf("%d",&n);
for (i=0;i<n;i++)
{scanf("%lf%lf%lf", &point[i][0],&point[i][1],&point[i][2]);}
for (i=0;i<n-1;i++)
{for (j=i+1;j<n;j++,k++)
{c=(point[i][0]-point[j][0])*(point[i][0]-point[j][0])+(point[i][1]-point[j][1])*... |
64 | 31720 | int main()
{
int x[10],y[10],z[10],i,j,n,m=1,l;
double d[46],p;
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++)
{
d[m]=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]));
m=m+1;
}
for(i=1;i<m;i++)
{
for(j=1;j<=m-i;j++)
{
... |
64 | 31721 | int main()
{
int i,j,n,k=0,w;
int x[10],y[10],z[10];
float d[45],dis[10][10],p=0,q=0,m=0,o=0;
cin>>n;
for(i=0;i<n;i++)
{
cin>>x[i]>>y[i]>>z[i];
}
for(j=0;j<n-1;j++)
{
for(i=j+1;i<n;i++)
{
o=(x[j]-x[i])*(x[j]-x[i]);
p=(y[j]-y[i])*(y[j]-y[i]);
q=(z[j]-z[i])*(z[j]-z[i]);
d[k]=sqrt(o+p+q);
k++;
}
}
for(w=1;w<n*(n-1)/2;w++)... |
64 | 31722 |
int main(int argc, char *argv[])
{
int n;
int a[10][3],z[100][6];
float d[100],t;
int i,j,l;
scanf("%d",&n);
for(i=0;i<n;i++)
{
for(j=0;j<3;j++)
{
scanf("%d",&a[i][j]);
}
}
int k=0;
for(i=0;i<n-1;i++)
{
for(j=i+1;j<n;j++)
{
t=(a[i][0]-a[j][0])*(a[i][0]-a[j][0])+(a[... |
64 | 31723 | //????
int main()
{
double a[11],b[11],c[11];
int n,i,j,k,p,q;
double max,dis[10][11];
cin>>n;
for (i=1;i<=n;i++)//??
{
cin>>a[i]>>b[i]>>c[i];
}
for (i=1;i<n;i++)//??
{
for (j=i+1;j<=n;j++)
{
dis[i][j]=(double)pow((double)pow(a[i]-a[j],2)+(double)pow(b[i]-b[j],2)+(double)pow(c[i]-c[j],2),0.5);
if (... |
64 | 31724 | int n[100][3];
int main()
{
int m,i,j,t,y[100][2]={0},l=0;
double k[30][30]={0},max=0,x[30][30]={0};
cin>>m;
for(i=0;i<m;i++)
{
for(j=0;j<3;j++)
cin>>n[i][j];
}
for(i=0;i<m;i++)
{
for(j=m-1;j>i;j--)
{
for(t=0;t<3;t++)
{
k[i][j]+=(n[i][t]-n[j][t])*(n[i][t]-n[j][t]);
}
k[i][j]=sqrt(k[i][j... |
64 | 31725 | /*
*???? distanceorder.cpp
*??????
*????: 2012-11-10
*???????????????
*/
int main() {
int n, i, j, l, k = 0, b;//i,j,l?????
cin >> n;
int x[10] = { 0 }, y[10] = { 0 }, z[10] = { 0 }; // ??n?????
int piont[6][100];// ?????????
float a;//a?????
float dis[100] = { 0 };
for (i = 0; i < n; i++)
cin >> x[i] >> ... |
64 | 31726 |
int main(){
int n,i,j,x,e,k;
int sz[10][3]={0};
double l[45][3];
double t;
int d;
scanf("%d",&n);
for(i=0;i<n;i++){
for(j=0;j<3;j++){
scanf("%d",&(sz[i][j]));
}
}
for(x=0,i=0;i<n-1;i++){
for(e=i+1;e<n;e++,x++){
l[x][0]=sqrt(pow(sz[i][0]*1.0-sz[e][0]*1.0,2)+
pow(sz[i][1]*1.0-sz... |
64 | 31727 | int main(){
int u=0,i,k,t,n,j,s,g,a[1000],b[1000],c[1000],e[1000],f[1000];
double d[1000],m;
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,t=j+1;t<n;t++){
d[u]=sqrt(pow(a[i]-a[t],2)+pow(b[i]-b[t],2)+pow(c[i]-c[t],2));
e[u]=i;
f[u]=t;
... |
64 | 31728 | struct dian
{
int a;
int b;
int c;
}zb[11];
int main()
{
int q,n,i,j,s=1,k1[50],k2[50],h1;
double k[50]={0},h;
cin>>n;
for(i=1;i<=n;i++)
{
cin>>zb[i].a>>zb[i].b>>zb[i].c;
}
for(i=1;i<=n-1;i++)
{
for(j=i+1;j<=n;j++)
{
k[s]=sqrt((zb[i].a-zb[j].a)*(zb[i].a-zb[j].a)+(zb[i].b-zb[j].b)*(zb[i].b-zb[... |
64 | 31729 |
int main()
{
int n; cin>>n;
int a[20][3];
double ss[200];
int s[200][7];
for (int i=0;i<n;i++)
{
for (int j=0;j<3;j++)
cin>>a[i][j];
}
int x,y,z,count=0;
for (int i=0;i<n;i++)
for (int j=i+1;j<n;j++)
{
x=a[i][0]-a[j][0];
... |
64 | 31730 | int main(){
int n,l=0,x[101],y[101],z[101],a[101],b[101],i;
double m[101];
scanf("%d\n",&n);
for(i=0;i<n;i++){
scanf("%d %d %d",&x[i],&y[i],&z[i]);
}
for(int k=0;k<n-1;k++){
for(i=k+1;i<n;i++){
m[l]=sqrt(1.0*(x[k]-x[i])*(x[k]-x[i])+1.0*(y[k]-y[i])*(y[k]-y[i])+1.0*(z[k]-z[i])*(z[k]-z[i]));
a[l]=k... |
64 | 31731 | int main(){
int i,j,k,m,n,x;
double e;
scanf("%d",&n);
int sz[10][3];
for(i=0;i<n;i++){
for(j=0;j<3;j++){
scanf("%d",&sz[i][j]);
}
}
double s[50];
m=0;
double zong;
int a[50][3];
int b[50][3];
for(j=0;j<(n-1);j++){
for(i=j+1;i<=n-1;i++... |
64 | 31732 | int main()
{
int n;
scanf("%d",&n);
double x[150],y[150],z[150];
int i;
for(i=1;i<=n;i++)
{
scanf("%lf",&x[i]);
scanf("%lf",&y[i]);
scanf("%lf",&z[i]);
}
int j,h;
h=1;
double sum;
double s1[150][150],s2[150][150];
double a[10000];
for(i=1;i<n;i++)
{
for(j=i+1;j<=n;j++)
{
sum=(x[i]-x[j])*(x[i]... |
64 | 31733 | int main()
{
struct
{
float first; float second;float distance;
}b[100],temp;
float a[11][3];
int p,q,n,k=0,i,j;
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].first=i;
b[k].second=j;
b[k].distance=sqrt(fabs(pow((a[i][0]-a[j][0])... |
64 | 31734 | int main()
{
int i,n,j,k=0;
struct zuobiao
{
int x;
int y;
int z;
} a[10];
struct juli
{
double d;
struct zuobiao a1;
struct zuobiao b1;
} b[100],tem;
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;i++)
{
for(j=i+1;j<n;j++)
{
... |
64 | 31735 | struct node {
int x,y,z;
}p[10];
struct edge{
int node1,node2;
double dis;
}t[100];
double dist(int a,int b)
{
return sqrt((p[a].x-p[b].x)*(p[a].x-p[b].x)+(p[a].y-p[b].y)*(p[a].y-p[b].y)+(p[a].z-p[b].z)*(p[a].z-p[b].z));
}
int judge(int x,int y)
{
if (t[x].node1<t[y].node1 || (t[x].node... |
64 | 31736 | int main(){
int n,x[100],y[100],z[100],i,j,k,a[100],b[100],c[100],d[100],e[100],f[100],m,o;
double dis[1000],p;
scanf("%d",&n);
m=(n-1)*n/2;
for(i=1;i<=n;i++){
scanf("%d%d%d",&x[i],&y[i],&z[i]);
}
for(i=1,k=1;i<=n-1;i++){
for(j=i+1;j<=n;j++){
a[k]=x[i];
b[k]=y[i];
c[k]=z[i];
d[k]=x[j];
e[k]=y[... |
64 | 31737 | double julishi(int a,int b,int c,int x,int y,int z);
int main(){
int n,dzb,i,j,k,m,N;
scanf("%d",&n);
int x[1000],y[1000],z[1000];
N=3*n;
for(i=0;i<N;i++){
scanf("%d%d%d",&(x[i]),&(y[i]),&(z[i]));
}
m=n*(n-1)/2;
double jl[10000];
int ax[10000],ay[10000],az[10000];
int bx[10000],by[10000],bz[10000];
k=1;
for(i=0;i<n-1;... |
64 | 31738 | int main() {
int x[10];
int y[10];
int z[10];
int a,b,c,n,i,r,j,p=0,k;
double jl[45];
double d;
scanf("%d",&n);
k=n*(n-1)/2;
for(i=0;i<n;i++){
scanf("%d",&x[i]);
scanf("%d",&y[i]);
scanf("%d",&z[i]);
}
for(i=0;i<n;i++){
for(j=i+1;j<n;j++){
a=x[i]-x[j];
b=y[i]-y[j];
c=z[i]-z[j];
jl[p]=sqrt... |
64 | 31739 |
void main()
{
float max,s[11][11],z[11][3];
int i,j,n,x,y,k;
scanf("%d",&n);
memset(s,0,sizeof(s));
memset(z,0,sizeof(z));
for (i=1;i<=n;i++)
{
scanf("%f%f%f",&z[i][0],&z[i][1],&z[i][2]);
for (j=1;j<i;j++)
{
s[j][i]=sqrt((z[i][0]-z[j][0])*(z[i][0]-z[j][0])+(z[i][1]-z[j][1])*(z[i][1]-z[j][1])+(z[i][2]-z... |
64 | 31740 | struct point{
double x;
double y;
double z;
};
struct range{
double a[3];
double b[3];
double x;
};
int main(){
struct point points[10];
struct range ranges[200];
int n;
cin>>n;
for(int i=0;i<n;i++)
cin>>points[i].x>>points[i].y>>points[i].z;
int k=0;
for(int i=0;i<n;i++)
for(int j=i+1;j<n;j++){
ranges[k... |
64 | 31741 | struct distance
{
int point1;
int point2;
double dis;
} a[200], t;
int main()
{
int x[20] = {0}, y[20] = {0}, z[20] = {0}, n, i, j, k = 1;
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++)
{
a[k].dis = sqrt(pow(x[i] - x[j]... |
64 | 31742 | struct point
{
double x;
double y;
double z;
};
struct dianju
{
double d;
struct point p1;
struct point p2;
};
void main()
{
double julijisuan(struct point p1,struct point p2);
int n,i,j,k;
struct point p[m];
struct dianju D[m*(m-1)/2];
struct dianju a;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%lf%lf%... |
64 | 31743 | int main(){
int m,n,i,h=1,l=0,k,j,x[11],y[11],z[11],N;
double s[50],p,d[50],t;
scanf("%d",&n);
N=(((n-1)*n)/2); /*???N?*/
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++){ /*???????????????*/ s[l]=sqrt((x[i]-x[k])*(x[i]-x[k])+(y[i]-y[k])*(y[i]-y[k])+(z[i]-z[k]... |
64 | 31744 | //***********************************
//** ???Dec 11, 2013 - ???? **
//** ?????? 1300012719 **
//** ???2013.12.14 **
//***********************************
int main()
{
int i, j, k = 0, n; //k???n????????
struct p //???p????????
{
int x;
int y;
... |
64 | 31745 | typedef struct
{
int x,y,z;
} Point;
typedef struct
{
double len;
int pt1,pt2;
} Distance;
double CalDis(Point pt1,Point pt2)
{
return sqrt((double)(pt1.x-pt2.x)*(pt1.x-pt2.x)+(pt1.y-pt2.y)*(pt1.y-pt2.y)+(pt1.z-pt2.z)*(pt1.z-pt2.z));
}
int cmp( const void *a ,const void *b)
{
if((*(Distance *)a).len != (*(Distance... |
64 | 31746 | int main()
{
int n,i,j,count=1;
double x[20],y[20],z[20],t;
cin>>n;
for(i=1;i<=n;i++)
{
cin>>x[i]>>y[i]>>z[i];//?xyz??
}
struct position//?????????????
{
double x;double a;
double y;double b;
double z;double c;
double d;
}p[100];
for(i=1;i<=n;i++)
{
for(j=i+1;j<=n;j++)
{
p[count].x=x[i];p... |
64 | 31747 | float dis(int a[3],int b[3])
{
float d=0;
for (int i=0;i<3;i++)
d+=(a[i]-b[i])*(a[i]-b[i]);
d=pow(d,0.5);
return d;
}
int main()
{
int n,x=0,y;
scanf("%d",&n);
int a[n][3];
y=n*(n-1)/2;
float b[y][3],m[3];
for (int i=0;i<n;i++)
for (int j=0;j<3;j++)
scanf("%d",&a[i][j]);
for (int i=0;i<n-1;i++)
for (int... |
64 | 31748 |
int main(){
int n,i,k,s,m;
int zb[10][3];
double d[45][7],e;
scanf("%d",&n);
for(i=0;i<n;i++){
for(s=0;s<3;s++){
scanf("%d",&(zb[i][s]));
}
}
... |
64 | 31749 | void main()
{
int i,j,k=0,p,n,c[100][3],d[100][6],temp;
double t[100],temp2;
scanf("%d",&n);
for(i=0;i<n;i++)
{
for(j=0;j<3;j++)
scanf("%d",*(c+i)+j);
}
for(i=0;i<n-1;i++)
{
for(j=i+1;j<n;j++)
{
d[k][0]=c[i][0];
d[k][1]=c[i][1];
d[k][2]=c[i][2];
d[k][3]=c[j][0];
d[k][4]=c[j][1];
d[k][... |
64 | 31750 |
int t[2000];
double id(int a,int b,int c)
{
return sqrt(a*a+b*b+c*c);
}
int main()
{
int i,j,n,m,s=0,x[20],y[20],z[20],q[200],w[200];
double d[200];
scanf("%d",&m);
for(i=0;i<m;i++)
{ scanf("%d%d%d",&x[i],&y[i],&z[i]);
}
n=m*(m-1)/2;
for(i=0;i<m-1;i++)
for(j=i+1;j<m;j++)
{
d[s]=id(x... |
64 | 31751 | /*
* 1.cpp
*
* Created on: 2010-12-29
* Author: 10033
*/
int main(){//????
int n,i,j;
int a[10],b[10],c[10];//??
struct zuobiao{//???????????
int x[2];
int y[2];
int z[2];
float length;
}number[100],t;
cin>>n;
for(i=0;i<n;i++)//??
cin>>a[i]>>b[i]>>c[i];
for(i=0;i<n;i++)//????zuobiao???
f... |
64 | 31752 | int main()
{
int i,j,k,l,m,n,num,tempi;
int x[10],y[10],z[10];
float d[100];
float tempd;
int dp1[100],dp2[100];
//scan the numbers
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d%d%d",&x[i],&y[i],&z[i]);
}
num=-1;
for(i=0;i<n-1;i++)
for(j=i+1;j<n;j++)
... |
64 | 31753 | int main()
{
int n,i,j,k,p=0,x[11][3],y[100][3],z[100][3];
double d1[45]={0},d[45];
cin>>n;
for(i=0;i<n;i++)
for(j=0;j<3;j++)
{
cin>>x[i][j];
}
for(i=0;i<n-1;i++)
{
for(j=i+1;j<n;j++)
{
for(k=0;k<3;k++)
{
d1[p]=d1[p]+((double)x[i][k]-(double)x[j][k])*((double)x[i][k]-(double)x[j][... |
64 | 31754 | /*
* shuzu.2.3.cpp
*
* Created on: 2012-11-19
* Author: wangrunhui
*/
int main()
{
int n,a[10][3],i,j,k ,ai[100],ak[100],l = 0,tempi,tempk;//a?????i,j,k,l???????ai?ak??????????
double d[100],tempd;//d????
cin >> n;
for ( i = 0; i < n; i ++)//?a??
{
for ( j = 0; j < 3; j ++)
cin >> a[i][j];
}
fo... |
64 | 31755 | void main(){
int n,a[30],b[45][6],btemp[45][6],i,j,k,T;
double d,c[45],temp;
scanf("%d",&n);
T=n*(n-1)/2;
for(i=0;i<3*n;i++){
scanf("%d",&a[i]);
}
j=0;
for(i=0;i<n-1;i++){
for(k=1;k<=(n-1)-i;k++){
d=sqrt((a[3*i]-a[3*i+3*k])*(a[3*i]-a[3*i+3*k])+(a[3*i+1]-a[3*i+3*k+1])*(a[3*i+1]-a[3*i+3*k+1])+(a[3*i+... |
64 | 31756 |
int main()
{
int n,i,j,r,t;
float x[10],y[10],z[10],d[10][10]={-1},max;
cin>>n;
for (i=0;i<n;i++)
cin>>x[i]>>y[i]>>z[i];
for (i=0;i<n;i++)
for (j=i+1;j<n;j++)
d[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 (int k=0;k<(n*(n-1)/2);k++)
{
max=0;
for (i... |
64 | 31757 | int main(){
int n,a[11],b[11],c[11],i,j,s,q,maxi=0,maxj=1;
double d[90][90];
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++){
s=(a[i]-a[j])*(a[i]-a[j])+(b[i]-b[j])*(b[i]-b[j])+(c[i]-c[j])*(c[i]-c[j]);
d[i][j]=sqrt(1.0*s);
}
}
for(q=0;q<n*... |
64 | 31758 | void main()
{
int n,i,m,j,k=0;
double d,b[100][7]={0},a[10][3]={0},temp[7];
char c[10][3];
scanf("%d",&n);
for(i=0;i<n;i++)
{
for(j=0;j<3;j++)
{
scanf("%lf",&a[i][j]);
scanf("%c",&c[i][j]);
}
}
for(i=0;i<n;i++)
{
for(j=i+1;j<n;j++)
{
d=sqrt(... |
64 | 31759 | int main()
{
int n,i,j,k=0;
int x[10],y[10],z[10];
struct Distance
{
int a,b;
double d;
}dis[50],t;
scanf("%d",&n);
for(i=0;i<=n-1;i++)
scanf("%d %d %d",&x[i],&y[i],&z[i]);
for(i=0;i<=n-1;i++)
for(j=1+i;j<=n-1;j++)
{
if(i==j)
continue;
dis[k].d=sqrt((double)((x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j... |
64 | 31760 | int main()
{
int n,a[10],b[10],c[10],i,j,k,m,h=0;
double d[ROW][COL],e[100],w,f;
scanf("%d",&n);
for(i=0;i<n;i++){
if(i==0){
scanf("%d %d %d",&a[i],&b[i],&c[i]);
}else{
scanf(" %d %d %d",&a[i],&b[i],&c[i]);
}
}
for(i=0;i<n;i++){
for(j=i+1;j<n;j++){
w=1.0*((a[i]-a[j])*(a[i]-a[j])+(b[i]-b[j])*(b[i]... |
64 | 31761 | int main()
{
struct
{
double x;
double y;
double z;
}point[15];
struct stru
{
int p,q;
double distance;
}dis[50],temp;
int n,i,j;
cin>>n;
for(i=0;i<n;i++)
cin>>point[i].x>>point[i].y>>point[i].z;
int k=0;
for(i=0;i<n-1;i++)
for(j=i+1;j<n;j++)
{
dis[k].p=i;dis[k].q=j;
double a,b,c;... |
64 | 31762 | int main()
{
int n, i, j, k, l, m, a, b;
int x[12] = {0};
int y[12] = {0};
int z[12] = {0};
double d[12][12] = {0};
double max;
int pm[12][12] = {0};
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++)
{
d[i][j] = sqrt((x[i] -... |
64 | 31763 | struct DOT
{
int x,y,z;
}dot[10],temp;
int main()
{
int i,n,j,t,p,q;
double d[10][10]={0},max;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d%d%d",&dot[i].x,&dot[i].y,&dot[i].z);
}//printf("%d %d %d\n",dot[0].x,dot[0].y,dot[0].z);
for(i=0;i<n-1;i++){
... |
64 | 31764 | struct dis
{
int place_p1;
int p1[3];
int place_p2;
int p2[3];
float distance;
}p[45];
void main()
{
void exchange(struct dis *pa,struct dis *pb);
int n,i,j,point[10][3],count=0;
struct dis *po=p;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d%d%d",&point[i][0],&point[i][1],&point[i][2]);
fo... |
64 | 31765 | //**********************************
//**** ?????? *****
//**** 1200012718 *****
//** ??????? **
//**********************************
int main()
{
int n;
cin>>n; //????n
int x[11]={0},y[11]={0},z[11]={0}; //??????xyz?????????????
double x1[11]={0},y1[11]={0},z1[11]={0}... |
64 | 31766 | //****************************************
//*???? **
//*??? 1100012927 **
//*2011.11.29 **
//****************************************
int main()
{
int n, i, j, k, z = 0;
double dis[50][7], zb[10][3], temp;
double (*p)[7];
p = dis;
cin >> n;
for (i = 0; i ... |
64 | 31767 | int main(){
int i,j,k,m,n;
double e;
scanf("%d",&n);
int sz[10][3];
for(i=0;i<n;i++){
for(j=0;j<3;j++){
scanf("%d",&sz[i][j]);
}
}
double s[50];
m=0;
double zong;
int a[50][3];
int b[50][3];
for(j=0;j<(n-1);j++){
for(i=j+1;i<=n-1;i++){... |
64 | 31768 | int main()
{
struct distance
{
int x;
int y;
double l;
};
struct distance d[100];
int n,i,k,mount,tx,ty,j;
int a[11][4];
double s[11][11];
double t,tl;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%d%d%d",&a[i][1],&a[i][2],&a[i][3]);
}
k=1;
for(i=1;i<n;i++)
{
for(j=i+1;j<=n;j++)
{
t=(double)... |
64 | 31769 | int main ()
{
int n;
int a[10][3];
double d[45][3];
int i=0;
double change;
cin>>n;
for (int t=0;t<n;++t)
cin>>a[t][0]>>a[t][1]>>a[t][2];
for (int t1=0;t1<n;++t1)
for (int t2=t1+1;t2<n;++t2)
{
d[i][0]=t1;
d[i][1]=t2;
d[i][2]=sqrt( (a[t1][0]-a[t2][0])*(a[t1][0]-a[t2][0]) +
(a[t1][1... |
64 | 31770 | int main()
{
int x[11],y[11],z[11],g=0,e1,e2;
double d[11][11],m;
int max[45][2];
int i,j,k,n,e,a,s;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&x[i]);
scanf("%d",&y[i]);
scanf("%d",&z[i]);
}
for(i=0;i<n;i++){
for(j=0;j<n;j++){
d[i][j]=0;... |
64 | 31771 | int main()
{
int n,m=0;
int i=0,j=0;
int a=0,b=0;
double i1=0;
int i2=0,i3=0,i4=0,i5=0;
double x[10],y[10],z[10],distance[100];
int p[100],q[100],p1[100],q1[100];
cin>>n;
for(m=0;m<n;m++)
cin>>x[m]>>y[m]>>z[m];
for(i=0;i<100;i++)
{
p[i]=0;
q[i]=0;
}
for(i=0;i<n-1;i++)
{
for(j=i+1;j<n;j++)
{
... |
64 | 31772 | int main()
{
int a[110][3],n,k,i,j,s=0,flag[1000][2],temp2;
float b[110],temp1;
double m=0;
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++)
{
m=0;
for(j=0;j<3;j++)
m+=(a[k][j]-a[i][j])... |
64 | 31773 | int main(){
int n,m,t,i,j,x[15],y[15],z[15];
double s[150],k;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d%d%d",&x[i],&y[i],&z[i]);
}
t=0;
for(i=0;i<n-1;i++){
for(j=i+1;j<n;j++){
s[t]=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])));
t++;
}
}
for(i=1;i<=t-1;i++){... |
64 | 31774 | int main()
{
int n,a[10],b[10],c[10],i,j,x,m=0;
double sun[10][10],s[50],k;
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++){
sun[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]));
}
}
for(... |
64 | 31775 | struct point{
int x;
int y;
int z;
}point[10];
struct jl{
int c;
int d;
float f;
}jl[45];
int main()
{
int n,i,j;
struct jl t;
float juli(struct point a,struct point b);
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-1;i++)
for(j=i+1;j<n;j++){
... |
64 | 31776 | int main(){
int n,h[10],z[10],s[10],a[100],b[100],c[100],d[100],e[100],f[100],i,j,l,m,o,q,r,t,k;
double g[100],p;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d%d%d",&h[i],&z[i],&s[i]);
}
k=0;
for(i=0;i<n;i++){
for(j=i+1;j<n;j++){
g[k]=pow((h[i]-h[j])*(h[i]-h[j])+(z[i]-z[j])*(z[i]-z[j])+(s[i]-s[j])*(s[i]-s[j... |
64 | 31777 | int main()
{
int n,j,t,a,b,r=0,x[10],y[10],z[10];
double e,sz[45][3];
scanf("%d",&n);
for(int i=0;i<n;i++){
scanf("%d%d%d",&x[i],&y[i],&z[i]);
}
for(j=0;j<n-1;j++){
for(t=j+1;t<n;t++){
sz[r][0]=j;
sz[r][1]=t;
sz[r][2]=sqrt((x[j]-x[t])*(x[j]-x[t])+(y[j]-y[t])*(y[j]-y[t])+(z[j]-z[t])*(z[j]-z[t]));
... |
64 | 31778 | int main()
{
int n,x[20],y[20],z[20],i,j,q,w,k;
double dis[20][20]={0},max;
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++)
dis[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 (i=1;i<=((n*(n-1))/2);i++){
max=0;
... |
64 | 31779 | int main(){
int n,i,j,m,k=0,x[10],y[10],z[10],a[50],b[50];
double d[50],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;i++){
for(j=i+1;j<n;j++){
a[k]=i;
b[k]=j;
d[k]=sqrt(1.0*(x[i]-x[j])*(x[i]-x[j])+1.0*(y... |
64 | 31780 |
int main() {
struct dot1 {
int x;
int y;
int z;
} dot[10];
float dis[10][10]={0,0};
float distance;
int row, col, sign=0;
int n, i, j;
scanf("%d", &n);
for (i=0;i<n;i++) {
scanf("%d%d%d", &dot[i].x, &dot[i].y, &dot[i].z);
}
for (i=0;i<n;i++) {
... |
64 | 31781 |
int main(){
int n=0;
cin>>n;
int dis[10][3];
float ans[1000][7];
for(int i=0;i<n;i++){
for(int j=0;j<3;j++){
cin>>dis[i][j];
}
}
int num=0;
for(int i=0;i<n-1;i++){
for(int j=i+1;j<n;j++){
for(int k=0;k<3;k++){
ans[num][k]=dis[i][k];
}
for(int k=0;k<3;k++){
ans[num][k... |
64 | 31782 | int main()
{
int a[100],b[100],x[20],y[20],z[20];
double h[100];
double q;
int i,j,k,n,t,p;
cin >>n;
for (i=1;i<=n;i++)
cin >>x[i]>>y[i]>>z[i];
t=0;
for (i=1;i<n;i++)
for (j=i;j<=n;j++)
if (i!=j)
{ t++;
a[t]=i;
b[t]=j;
... |
64 | 31783 | int main()
{
int n;
scanf("%d",&n);
double x[150],y[150],z[150];
int i;
for(i=1;i<=n;i++)
{
scanf("%lf",&x[i]);
scanf("%lf",&y[i]);
scanf("%lf",&z[i]);
}
int j,h;
h=1;
double sum;
double s1[150][150];
double a[10000];
for(i=1;i<n;i++)
{
for(j=i+1;j<=n;j++)
{
sum=(x[i]-x[j])*(x[i]-x[j])+(y[i]-... |
64 | 31784 | int main(){
int n,i;
scanf("%d",&n);
int sz[30];
for(i=0;i<(3*n);i++){
scanf("%d",&sz[i]);
}
double dd[10][10];
int j,k;
for(i=0;i<n;i++){
for(j=0;j<n;j++){
dd[i][j]=sqrt(1.0*((sz[3*i]-sz[3*j])*(sz[3*i]-sz[3*j])+(sz[3*i+1]-sz[3*j+1])*(sz[3*i+1]-sz[3*j+1])+(sz[3*i+2]-sz[3*j+2])*(sz[3*i+2]-sz[3*j+2])));
... |
64 | 31785 | int a[1001][1001],b[1001][1001],c[1001][1001];
double s[1000001][3];
struct {
double x,y,z;
}point[10001];
double dis(int i,int j)//????
{
return 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[... |
64 | 31786 | int main(){
struct point{
int x,y,z;
}points[10];
double d[45],e,a;
int n,i,j,k=0;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d %d %d",&points[i].x,&points[i].y,&points[i].z);
}
for(i=0;i<n;i++){
for(j=i+1;j<n;j++){
... |
64 | 31787 | /*
*????SortTheDistance.cpp
*?????
*????: 2012-11-13
*?????????????????????????????
*/
int main(){
int x[15], y[15], z[15], left[50], right[50];
int n, i, j, k = 0, gn, temp1;
double dis[50], temp;
cin >> n;
for (i = 0; i < n; i++)
{
cin >> x[i] >> y[i] >> z[i];
}
for (i = 0; i < n; i++)
{
for (j ... |
64 | 31788 | int main()
{
int n,i,j,k=0,l;
double a[102][4],b[102][102],c[2000]={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++)
{
b[i][j]=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[... |
64 | 31789 | int main()
{
int n,a[200],b[200],c[200],i,j,h[200],l[200],t=1,q,z;
double d[200],k;
cin>>n;
for(i=1;i<=n;i++)
{
cin>>a[i]>>b[i]>>c[i];
}
for(i=1;i<=n-1;i++)
{
for(j=i+1;j<=n;j++)
{
d[t]=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]));
h[t]=i;
l[t]=j;
... |
64 | 31790 | double f(int a[3], int b[3]);
int main(){
int n,zb[M][3],dw[N][2],i,k;
double jl[N];
scanf("%d",&n);
for(i=0;i<n;i++){
for(k=0;k<3;k++){
scanf("%d",&zb[i][k]);
}
}
int count=0;
for(i=0;i<n-1;i++){
for(k=i+1;k<n;k++){
jl[count]=f(zb[i],zb[k]);
dw[count][0]=i;
dw[count][1]=k;
count++;
}
}
... |
64 | 31791 | int main()
{
int n,t,i,j,k,x[110],y[110],z[110],a[500],aa[500],b[500],bb[500],c[500],cc[500],l;
double s[110],ty;
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-1;i++)
for(j=i+1;j<n;j++)
{ s[k]=sqrt((x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])... |
64 | 31792 |
float dist(int a,int b,int c,int a1,int b1,int c1);
int toi(int fi,int ni);
int toj(int fj,int nj);
int main()
{
int x[10],y[10],z[10];
int n,i,j,o=1,flag,ansi,ansj;
float d[46];
float max;
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=i+1;j<n;j++)
{
... |
64 | 31793 | void main()
{
int n,i,j,t,l=0;
int x[20],y[20],z[20],d1[100],d2[100];
float d[100],temp;
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++)
{
l++;
d[l]=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]));
d1[l]=i;d2... |
64 | 31794 | int main()
{
struct sanwei
{
int x;
int y;
int z;
}room[10];
int n, i, j;
double dis[100];
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[... |
64 | 31795 | int main()
{
int n,a[10][3],i,j,d[45][2][2],k=0,c,x,y;
double z;
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++)
{
d[k][0][0]=i;
d[k][0][1]=j;
d[k][1][1]=(a[i][0]-a[j][0])*(a[i][0]-a[j][0])
+(a[i][1]-a[j][1])*(a[i][1]-a[... |
64 | 31796 | int main()
{
int n;
cin>>n;
int i,j,k,r,t;
double s;
int x[11],y[11],z[11];
for(i=1;i<=n;i++)
{
cin>>x[i]>>y[i]>>z[i];
}
double w[100];
int p[100],q[100];
i = 1;
int d=n*(n-1)/2;
for(j = 1;j < n;j++)
{
for (k = j+1;k<= n;k++)
{
w[i]=sqrt(pow((x[j]-x[k]),2.0)+pow((y[j]-y[k]),2.0)+pow... |
64 | 31797 | double distance(int x1, int y1, int z1, int x2, int y2, int z2){
double q,s;
q=(x1-x2)*(x1-x2)+(y1-y2)*(y1-y2)+(z1-z2)*(z1-z2);
s=sqrt(q);
return s;
}
int main(){
int n,k,i,j,x[10],y[10],z[10];
double sz[46][7];
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 | 31798 | int main()
{
int i,j,n,x[10],y[10],z[10],xc,yc,zc,k=0,x1s[55],y1s[55],z1s[55],x2s[55],y2s[55],z2s[55];
double e,s[55];
scanf("%d\n",&n);
for(i=0;i<n;i++)
{
scanf("%d",&x[i]);
scanf("%d",&y[i]);
scanf("%d",&z[i]);
}
for(i=0;i<n-1;i++)
for(j=i+1;j<n;j++)
{
xc=x[i]-x[j];
yc=y[i]-y[j];
zc=z[i]-... |
64 | 31799 | void main()
{
int a[101],aa[101],aaa[101];
int b[101],bb[101],bbb[101];
int c[101],cc[101],ccc[101];
int i,j,k=0,n,t;
double d [101];
double t2;
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=0;j<n-i-1;j++)
{
d[k]=sqrt((a[i]-a[j+i+1])*(a[i]-a[... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.