label stringlengths 1 2 | index stringlengths 1 5 | code stringlengths 87 8.24k |
|---|---|---|
64 | 31900 | //********************************
//*??????? **
//*?????? 1300012713 **
//*???2013.12.14 **
//********************************
int main()
{
int n, b = 0,a[15][3];
struct distance
{
double ds;
int a1;
int a2;
}d[50];
cin >> n;
for(int i = 1; i <= n; i++)
cin >> a[i][0] >> a[i][1] >> a[i][2];
for(int j... |
64 | 31901 | int read();
void calculate();
void sort();
double sqr(double p);
int print();
int x[100],y[100],z[100],n;
double a[100][100];
int main()
{
read();
calculate();
print();
return 0;
}
int read()
{
int i;
scanf("%d",&n);
for (i=1;i<=n;i++)
scanf ("%d%d%d",&x[i],&y[i],&z[i]);
return 0... |
64 | 31902 |
struct A
{
int x1,y1,z1;
}a[10];
double juli(int a,int b,int c,int d,int e,int f)
{
double m;
m=(double)(a-d)*(a-d)+(b-e)*(b-e)+(c-f)*(c-f);
m=sqrt(m);
return m;
}
int cmp(const void * a, const void * b)
{
return((*(double*)a-*(double*)b>0)?1:-1);
}
int main()
{
int n,i,j,k,l=0,flag;
double b[50];
while... |
64 | 31903 | int main()
{
int i,n,j=1,x[11],y[11],z[11],a,b,k;
double d[50],t;
cin>>n;
for(i=1;i<=n;i++)
cin>>x[i]>>y[i]>>z[i];
for(i=1;i<n;i++)
for(k=i+1;k<=n;k++)
{
d[j]=sqrt(pow(x[i]-x[k],2.0)+pow(y[i]-y[k],2.0)+pow(z[i]-z[k],2.0));
j++;
}
for(j=1;j<=(n*(n-1)/2-1);j++)
for(i=1;i<=(n*(n-1)/2-j);i++)
if (d[i]<... |
64 | 31904 |
int main()
{
struct point
{
int NO;//????
double x;double y;double z;//????
double d[10];//??????
}points[10];
//??????? ? ???
struct data
{
int num;
int fromx;int fromy;int fromz;
int tox;int toy;int toz;
double dd;
}result[45+5],temp;
//... |
64 | 31905 | struct dist
{
int x;
int y;
int z;
};
main()
{
struct dist a[11];
int n;
scanf("%d",&n);
int i,j,k;
for(i=0;i<n;i++)
{
scanf("%d %d %d",&a[i].x,&a[i].y,&a[i].z);
}
float d[10][10];
for(i=1;i<=n-1;i++)
{
for(j=0;j<i;j++)
{... |
64 | 31906 | int main(){
int n;
int x[1000],y[1000],z[1000],a[100],b[100] ;
double s[1000],c[1000];
scanf("%d",&n);
for(int i=0;i<n;i++){
scanf("%d%d%d",&x[i],&y[i],&z[i]);}
int t=0;
for(int i=0;i<n;i++){
for(int k=i+1;k<n;k++){
s[t]=(x[i]-x[k])*(x[i]-x[k])+(y[i]-y[k])*(y[i]-y[k])+(z[i]-z[k])*(z[i]-z[k]);
a[t]=i;
b[t]=k;
t++;}}
dou... |
64 | 31907 |
int main()
{
int dian[10][3],n,j,i,k;
int diandui[1000][6];
double d[1000];
scanf("%d",&n);
for(j=0;j<n;j++)
{
for(i=0;i<3;i++)
{
scanf("%d",&dian[j][i]);
}
}
int p=0;
for(j=1;j<n;j++)
{
for(k=0;k<j;k++)
{
int x;
x=(dian[j][0]-dian[k][0])*(dian[j][0]-dian[k][0])+(dian[j][1]-dian[k][1])*(di... |
64 | 31908 | /**
* @file C12Q4.cpp
* @author ???
* @date 2013-12-14
* @description
* ??????:????
*/
typedef struct node
{
int x,y,z;
}node;
typedef struct distance
{
node*pn1,*pn2;
double v;
}dis;
int main()
{
int n;
node ns[MAX];
dis ds[MAX*MAX];
cin >> n;
for(int i = 0 ; i < n ; i++)
{
cin >> ns[i].x >> ns[i].... |
64 | 31909 | int main ()
{int n;
scanf ("%d",&n);
struct dot
{
int x,y,z;
double len[9];
}
dots[10];
for (int i1=0;i1<n;i1++)
{
scanf("%d%d%d",&dots[i1].x,&dots[i1].y,&dots[i1].z);
}
for (int i2=0;i2<n-1;i2++)
{
for (int i3=n-i2-2;i3>=0;i3--)
{
dots[i2].len[n-i2-2-i3]=(dots[i2].x-dots[n-i3-1].x)*(dots[i2].x-dot... |
64 | 31910 | int main(){
int n,i,x[100],y[100],z[100],k,t;
double s[1000],e;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d%d%d",&x[i],&y[i],&z[i]);
}
t=0;
for(k=0;k<n;k++){
for(i=k+1;i<n;i++){
s[t]=sqrt(1.0*((x[k]-x[i])*(x[k]-x[i])+(y[k]-y[i])*(y[k]-y[i])+(z[k]-z[i])*(z[k]-z[i])));
t++;
}
}
for(i=1;i<=n*(n-1)/2;i++){
for(t=0;t<n*... |
64 | 31911 | int main(){
int a[10][3],m,i,j,n,d[45][6],w;
double b[45],q;
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-1;i++){
for(j=i+1;j<n;j++){
b[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[... |
64 | 31912 | struct d
{
int q[2]; //q ????????
float dis;
};
int main()
{
int n,i,j,k=0,t2[2];
struct d dist[100];
float a[10][3],t1; //?????????a?
scanf("%d",&n);
for(i=0;i<n;i++)
for(j=0;j<3;j++)
scanf("%f",&a[i][j]);
for(i=0;i<n;i++)
for(j=i+1;j<n;j++)
{
... |
64 | 31913 |
double juli(int a,int b,int c,int d,int e,int f)
{
int x,y,z;
double sum;
x=d-a;
y=e-b;
z=f-c;
sum=x*x+y*y+z*z;
sum=sqrt(sum);
return sum;
}
int main()
{
int n,i,j;
int sz[10][3];
double distance[45][9];
scanf("%d",&n);
for(i=0;i<n;i++)
{
for(j=0;j<3;j++)... |
64 | 31914 | int p[100][3]; //????????n?????
struct Distance
{
int p1,p2; //????p1?p2???
double d;
};
int main()
{
int n;
cin>>n;
int i,j,k;
for(i=0;i<n;i++)
for(j=0;j<3;j++)
cin>>p[i][j];
struct Distance a[100*100+10],temp;
int m=0; //????m
for(i=0;i<n;i++)
for(j... |
64 | 31915 |
int main()
{
struct point
{
int x;
int y;
int z;
}p[10];
struct distance
{
int x1,x2;
int y1,y2;
int z1,z2;
double d;
}d[46],t;
int n,i,j,k=0,m;
cin>>n;
for(i=0;i<n;i++)
{
cin>>p[i].x>>p[i].y>>p[i].z;
}
for(i=0;i<n-1;i++)
for(j=i+1;j<n;j++)
{
d[k].x1=p[i].x;
d[k].x2=p[j].x;
d[... |
64 | 31916 |
double distance(int b1[],int b2[]);
int main()
{
int n,i,j,r=0,p,k=0;
int a[30],b[10][3];
double d[100][3],temp;
scanf("%d",&n);
for(i=0;i<3*n;i++)
scanf("%d",&a[i]);
for(i=0;i<n;i++)
{
b[i][0]=a[3*i];
b[i][1]=a[3*i+1];
b[i][2]=a[3*i+2];
}
for(i=0;i<n;i++)
for(j=i+1;j<n;j++)
{
d[k][0]=di... |
64 | 31917 | int main()
{
int n,a[10][3],i,j,k;
double b[10][10];
cin>>n;
for(i=0;i<=n-1;i++)
for(j=0;j<=2;j++)
cin>>a[i][j];
for(i=0;i<=n-1;i++)
for(j=i+1;j<=n-1;j++)
b[i][j]=sqrt(pow((double)(a[i][0]-a[j][0]),2)+pow((double)(a[i][1]-a[j][1]),2)+pow((double)(a[i][2]-a[j][2]),2));
for(k=1;k<=n*(n-1)/2;k++)
... |
64 | 31918 | int main()
{
int n,i,j,k;
float x[20],y[20],z[20],d[20][20]={0};
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%f%f%f",&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]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j])+(z[i]-z[j])*(z[i]-z[j]));
}
}
double count=0;
hell:;
do... |
64 | 31919 | //******************************************
//*???????.cpp **
//*??: ?? 1100012808 **
//*???2011.12.07 **
//******************************************
double d[45];
int n;
void maopaopaixu(double d[])
{
int i, j;
double t;
for (i = 0; i < n * (n - 1) / 2; i... |
64 | 31920 | int main(){
int n,a,l=0,c,d;
scanf("%d",&n);
a=n*(n-1)/2;
int x[n],y[n],z[n],q[a],p[a];
double s[a],b;
for(int i=0;i<n;i++){
scanf("%d%d%d",&x[i],&y[i],&z[i]);
}
for(int i=0;i<n-1;i++){
for(int k=i+1;k<n;k++){
s[l]=sqrt((x[i]-x[k])*(x[i]-x[k])+(y[i]-y[k])*... |
64 | 31921 | int main()
{
int n,i,j,a[15],b[15],c[15];
double d[15][15],z[150],q[150];
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;j<n;j++){
d[i][j]=sqrt((a[i]-a[j])*(a[i]-a[j])+
(b[i]-b[j])*(b[i]-b[j])+
(c... |
64 | 31922 | double distance(int b1[],int b2[])
{
int X,Y,Z;
double D;
X=(b1[0]-b2[0])*(b1[0]-b2[0]);
Y=(b1[1]-b2[1])*(b1[1]-b2[1]);
Z=(b1[2]-b2[2])*(b1[2]-b2[2]);
D=sqrt(X+Y+Z);
return D;
}
int main()
{
int n,i,j,r=0,p,k=0;
int a[30],b[10][3];
double d[100][3],temp;
scanf("%d",&n);
for(i=0;i<3*n;i++)
scanf("%d",&a[i]... |
64 | 31923 |
double distance(double q,double w,double e,double r,double t,double y);
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);
for(i=0;i<n;i++){
scanf("%lf%lf%lf",&s[i].j,&s[i].k,&s[i].l);
... |
64 | 31924 | int main(){
int n,a[30],b[45],c[45],p=0,e,q,g,i,t,k,s,x,h,j,v;
double dis[45],mid;
scanf("%d",&n);
for(i=0;i<(3*n);i++){
scanf("%d",&a[i]);
}
for(t=0;t<n;t++){
for(k=t+1;k<n;k++){
b[p]=t;c[p]=k;
e=(a[3*t]-a[3*k])*(a[3*t]-a[3*k])+(a[3*t+1]-a[3*k+1])*(a[3*t+1]-a[3*k+1])+(a[3*t+2]-a[3*k+2... |
64 | 31925 | int main()
{
int n,i,j,k;//??????
int x[10],y[10],z[10];//?????????
float d[90]={0},temp=0;//?????????0
cin>>n;
for(i=0;i<=n-1;++i)
cin>>x[i]>>y[i]>>z[i];//????
for(i=0;i<=n-2;++i)
{
for(j=i+1;j<=n-1;++j)
{
d[10*i+j]=sqrt((double)((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 | 31926 | int main(){
int i,j,k,m,n,a,b;
int sz[200] [4];
scanf("%d",&n);
double r[200][200],o[100000],e;
for(i=0;i<n;i++){
scanf("%d %d %d",&sz[i] [1],&sz[i] [2],&sz[i] [3]);
}
for(i=0;i<n;i++){
for(j=0;j<n;j++){
r[i][j]=sqrt((double)(((sz[i][1])-(sz[j][1]))*((sz[i][1])-(sz[j][1]))+((sz[i][2])-(sz[j][2]))*((sz[i... |
64 | 31927 | int main()
{
int n,i,j,d=1,t,x[12],y[12],z[12];
float g;
struct juli
{
int a;
int b;
float jl;
}l[100];
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(j=i+1;j<=n;j++)
{
l[d].jl=sqrt(((x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j])+(z[i]-z[... |
64 | 31928 | int main()
{
struct point
{
int x;
int y;
int z;
}p[10]; //?????
struct distant
{
float d;
struct point p1;
struct point p2;
}dis[45],temp; //????
int n,i,j,k;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d%d%d",&p[i].x,&p[i].y,&p... |
64 | 31929 | int main(){
int n,m,i,j,r;
int a[10],b[10],c[10],f[100],g[100],h[100],x[100],y[100],z[100];
double d[100];
scanf("%d",&n);
m=0;
for(i=0;i<n;i++){
scanf("%d%d%d",&a[i],&b[i],&c[i]);}
for(i=n-2;i>=0;i--){
for(j=n-1;j>i;j--){
d[m]=(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[m]=sqrt(d[m]);
f[... |
64 | 31930 | //************************
//*??????? **
//*?????? **
//*???1200012957 **
//*???2012-12-13 **
//************************
struct point // ???????????????
{
int x;
int y;
int z;
} p[10]; // ?????
struct distance // ???????????????????????????????
{
int f;
int b;
double s;
} a[45];
int main ()
{
int n, i, j, k =... |
64 | 31931 | /*
* julipaixu.cpp
*????????n??????10??,??n?????????,???? [ ????] ???????????????????
* Created on: 2013-11-1
* Author: 13141
*
????????????????n??????????????????(??????)?????????0?100????????????????
*
?????n????????n*(n-1)/2???????????
(x1,y1,z1)-(x2,y2,z2)=??
???????????2??
*/
int main()
{
int n;
ci... |
64 | 31932 | struct distant
{
int x1;
int x2;
float dis;
};
float dist(int x[],int y[])
{
float d;
d=(x[0]-y[0])*(x[0]-y[0])+(x[1]-y[1])*(x[1]-y[1])+(x[2]-y[2])*(x[2]-y[2]);
d=sqrt(d);
return d;
}
int main()
{
int n;
int x[10][3];
struct distant d[50],temp;
scanf("%d",&n)... |
64 | 31933 | //Pat.X
int main()
{
int n; //????
int i,j,k,p; //??????
int x,y,z; //?????
int m; //????????
scanf("%d",&n);
m=n*(n-1)/2; //????????
double c[m],t,t0; //??????????????????
int a[n][3]; //?????????
double b[n][n]; //???????????????????????????
for(i=0;i<n;i++) //????
{
scan... |
64 | 31934 | int main()
{
struct Distance
{
int p1[3];
int p2[3];
double length;
}d[50],temp;
int n,i,j,k=0;
cin>>n;
int point[10][3];
double result;
for(i=0;i<n;i++)
cin>>point[i][0]>>point[i][1]>>point[i][2];
for(i=0;i<n-1;i++)
for(j=i+1;j<n;j++)
{
d[k].p1[0]=point[i][0]; d[k].p1[1]=point[i][1]; d[k].p1[2... |
64 | 31935 | int main()
{
int n,a[10],b[10],c[10],num1,num2,m[50],l[50];
double d[50],temp,distance;
int i,j,k=0;
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++)
{
distance=sqrt(pow((a[i]-a[j]),2)+pow((b[i]-b[j]),2)+pow((c[i]-c[j]),2));
d[k]=distance;
... |
64 | 31936 | int main()
{
int i,j,k,n,t,a[150],b[150],x[11],y[11],z[11];
double r,c[150];
cin>>n;
for (i=1;i<=n;i++)
cin>>x[i]>>y[i]>>z[i];
t=0;
for (i=1;i<=n-1;i++)
for (j=i+1;j<=n;j++)
{
t++;
a[t]=i;b[t]=j;
c[t]=sqrt(
(x[i]-x[j])*(x[i]-x[j])
+(y[i]-y[j])*(y[i]-y[j])
... |
64 | 31937 | int main ()
{
int n=0,p=0,s=0,m=0; //n?????p????????s??????????m??????????
cin>>n;
double t=0; //t???????????????????double?
int a[10][3],b[45][6],d[45]; //a????????b?????????????d???b?????
double c[45]; //c????????
for (int i=0;i<n;i++) //????????
for (int j=0;j<3;j++)
cin>>a[i][j];
for ... |
64 | 31938 | int main()
{
int n,i,j,e,c=0,a[10],b[10],d[10];
double s[100],t;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d%d%d",&a[i],&b[i],&d[i]);
for(i=0;i<n;i++){
for(j=i+1;j<n;j++){
s[c]=sqrt(1.0*(a[i]-a[j])*(a[i]-a[j])+1.0*(b[i]-b[j])*(b[i]-b[j])+1.0*(d[i]-d[j])*(d[i]-d[j]));
c++;
}
}
for(e=1;e<=n*(n-1)/2;e++){
for(c=0... |
64 | 31939 | int main()
{
int geshu;
cin>>geshu;
int i,j,xh;
double a[11][4]={0};
double b[11][11]={0};
for(i=1;i<=geshu;i++)cin>>a[i][1]>>a[i][2]>>a[i][3];
for(i=1;i<geshu;i++)
{
for(j=i+1;j<=geshu;j++)
{
double m;
m=(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... |
64 | 31940 | double num[46][8];
struct node
{
int a,b,c;
int arr[11];
};
struct node arr[11];
int main()
{
int i,n,j,m;
struct node arr[11];
while(scanf("%d",&n)!=EOF)
{
memset(num,0,sizeof(num));
memset(arr,0,sizeof(arr));
for(i=0;i<n;i++)
scanf("%d %d %d",&arr[i].a,&arr[i].b,&arr[i].c);
int h=0,k=0;
for... |
64 | 31941 | void swap(int *a,int *b)
{
int temp;
temp=*a;
*a=*b;
*b=temp;
}
void main()
{
int a[10][3],n,i,j,k=0,b[50][10],N;
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[k][0]=a[i][0];
b[k][1]=a[i][1];
b[k][2]=a[i][2];
b[k][... |
64 | 31942 | int main(){
int n,i,k,a,w,e;
scanf("%d\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]);
}
double r,s,m[n*(n-1)/2],j;
int p[n*(n-1)/2],q[n*(n-1)/2];
a=0;
for(i=0;i<n;i++){
for(k=i+1;k<n;k++){
r=sqrt((x[i]-x[k])*(x[i]-x[k])... |
64 | 31943 | int main(){
int n,i,j,k,LEN;
int a[30];
double b[135],e;
scanf("%d",&n);
for(i=0;i<=3*n-1;i++){
scanf("%d",&a[i]);
}
k=0;
for(i=0;i<=3*n-4;i=i+3){
for(j=i+3;j<=3*n-1;j=j+3){
b[k]=sqrt((a[i]-a[j])*(a[i]-a[j])+(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[k+1]=i;
b[k+2]=j;
... |
64 | 31944 | struct dian{
float x;
float y;
float z;
};
struct diandui{
struct dian a;
struct dian b;
float dis;
};
void main(){
int n,i,j,t=0;
struct dian d[10];
struct diandui dui[50],temp;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%f%f%f",&d[i].x,&d[i].y,&d[i].z);
}
for(i=0;i<n;i++){
for(j=i+1;j<n;... |
64 | 31945 |
struct DIS
{
int fir;
int sec;
double d;
};
int main()
{
struct DIS dis[50];
const double eps=1e-6;
int x[11];
int y[11];
int z[11];
int n,i,j,k=1;
struct DIS temp;
cin>>n;
for(i=1;i<=n;i++)
{
cin>>x[i]>>y[i]>>z[i];
}
for(i=1;i<=n-1;i++)
{
for(j=i+1;j<=n;j++)
... |
64 | 31946 | int main()
{
int n,i,j,x1=0,x2=0,q=0,w1,w2,w3,w4,w5,w6,t,k,m=1,p=1,l=0,g;
scanf("%d",&n);
int a[10][3],c[1000],d[1000],e[1000],c1[1000],d1[1000],e1[1000],c2[1000]={0};
float b[1000]={0};
float x,y;
for(int i1=0;i1<=n-1;i1++)
{
scanf("%d %d %d",&a[i1][0],&a[i1][1],&a[i1][2]);
}
for(x1=0;x1<=n-2;x1++)
{
for... |
64 | 31947 | int main(){
int n,i,j,k,m,q;
j=0;
scanf("%d",&n);
int a[10],b[10],c[10],f[50],g[50],h[50],l[50],o[50],p[50];
double d[50];
double e;
for(i=0;i<n;i++){
scanf("%d %d %d",&a[i],&b[i],&c[i]);
}
for(i=0;i<n;i++){
for(m=i+1;m<n;m++){
e=(a[i]-a[m])*... |
64 | 31948 | //********************************************************
//* ???:1.cpp *
//* ?????? 1200012948 *
//* ????: 2012 12 09 *
//* ????:???? *
//********************************************... |
64 | 31949 | int main ()
{
int n,a[4][10],p; //??
float dis[100][3];
float fuzhu;
cin >>n; //??
for (int i=0;i<n;i++)
{
for (int j=1;j<=3;j++)
{
cin >>a[j][i];
}
}
p=0;
for (int i=0;i<n;i++) //??
{
for (... |
64 | 31950 |
int main()
{
int n, i, j, k, m = 0;
double taoyan[100];
struct ss
{
int x;
int y;
int z;
double jl[10];
}zz[10];
cin >> n;
for(int i = 0; i < n; ++i)
cin >> zz[i].x >> zz[i].y >> zz[i].z;
for(i = 0; i < n - 1; i++)
for(j = i + 1; j < n; j+... |
64 | 31951 | void main()
{
int m,n,i,j,k,a,c,t,u;
int tt[100][3];
int pp[10000][6];
float xx[10000],b;
scanf("%d",&m);
for(i=0;i<m;i++)
{
for(u=0;u<3;u++)
{
scanf("%d",&tt[i][u]);
}
}
n=m*(m-1)/2;
t=n;
for(a=0,j=0;j<m-1;j++)
{
for(k=j+1;k<m;k++,a++)
{
xx[a]=sqrt((tt[j][0]-tt[k][0])*(tt[j][0]-t... |
64 | 31952 |
typedef struct
{
int x;
int y;
int z;
} point3D; //?????????
typedef struct
{
int firstPointIndex; //???????
int lastPointIndex; //???????
float distance;//?????
} result; //???? ??????
float getDistance(point3D p1, point3D p2)
{
int temp;
temp = (p1.x - p2.x) * (p1.x - p2.x) +
(p1.y - p2.y) * (p1.y -... |
64 | 31953 | int zuob[12][3]; //???
int vis[12][12];
int main()
{
// freopen("1.in","r",stdin);
// freopen("1.out","w",stdout);
double distance[12][12];
memset(vis,sizeof(vis),0);
int n;int ii,jj;
cin >> n;
for(int i=0;i<n;i++)
cin >> zuob[i][0] >> zuob[i][1] >> zuob[i][2];
for(int i=0;i<n-1;i... |
64 | 31954 |
int main()
{
int n , c ;
cin >> n ; //???
int x[n] , y[n] , z[n] ;
c = n * ( n - 1 ) / 2 ; //????
int a[c] , b[c] ; // ????????????????????
double l[c] ; //????
for( int i = 0 ; i < n ; i ++ ) //??
{
cin >> x[i] >> y[i] >> z[i] ;
}
c = -1 ;
for( int i = 0 ; i < n - 1 ; i ++ )... |
64 | 31955 | //============================================================================
// Name : 3.cpp
// Author :
// Version :
// Copyright : Your copyright notice
// Description : Hello World in C++, Ansi-style
//============================================================================
int main() {
i... |
64 | 31956 | /* ????????.cpp
* ???1200012826 ??
* ??? 2012?12?14?
*/
struct point
{
int x, y, z;
} p[10];
struct distance
{
int a,b;
double dis;
} d[45], tr;
int main()
{
int n, i, j, k=0;
cin >> n;
for(i=0; i<n; i++)
{
cin >> p[i].x >> p[i].y >> p[i].z;
}
for(i=0; i<n-1; i++)
for(j=i+1; j<n; j++)
{
d[k].dis=... |
64 | 31957 |
struct point
{
int x;
int y;
int z;
} p[100];
struct line
{
int p1;
int p2;
double len;
} l[1000], t;
int main()
{
int n, i, j, d[1000], c = 0;
double temp;
cin >> n;
for (i = 0; i < n; i++)
{
cin >> p[i].x >> p[i].y >> p[i].z;
}
for (i = 0; i < n; i++)
... |
64 | 31958 | int main()
{
int n,i,j,k=0,x[10],y[10],z[10],a[90],b[90];//n:??,i,j,k=0,?????x[10],y[10],z[10]????x?y?z??,a[90],b[90]?????????
double l[90],p;//l[90]:???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++)
{
l[k]=sqrt((x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-... |
64 | 31959 |
struct point{
int x;
int y;
int z;
};
struct distanceBetweenPoints{
int pointIndex1;
int pointIndex2;
double distace;
};
double distance(struct point p1, struct point p2){
double d =0.0;
d = sqrt((p1.x - p2.x)*(p1.x - p2.x) + (p1.y - p2.y)*(p1.y - p2.y) + (p1.z - p2.z)*(p1.z - p2.z));... |
64 | 31960 | struct point
{
int x[2];
int y[2];
int z[2];
float s;
}p[100],q;
float distant (int x1,int y1, int z1,int x2,int y2,int z2)
{
float m,e;
e=(x1-x2)*(x1-x2)+(y1-y2)*(y1-y2)+(z1-z2)*(z1-z2);
m=sqrt(e);
return (m);
}
int main ()
{
int n,x[11]={0},y[11]={0},z[11]={0},i,j=0,s[100]={0},k,t=1;
scanf("%d",&n);
for(i... |
64 | 31961 | int main (){
int n;
cin>>n;
int x[10],y[10],z[10];
int i,j;
for(i=0;i<=n-1;i++)
cin>>x[i]>>y[i]>>z[i];//??i???????
float d[45];//??
int s[45],e[45];//????????
int t=0;//??d???
for(i=0;i<=n-2;i++)
for(j=i+1;j<=n-1;j++)//???????????????????????????????????????????????????????????
{
d[t]=sqrt((x[i]-x[j])... |
64 | 31962 | /**
*@ file 1000012834_005homework.cpp
*@ author ???
*@ date 2010-12-15
*@ description
* ???????????
*/
struct position // ??????????????????
{
double distance[1000];
int x;
int y;
int z;
}pos[1000]; // ?????????????pos
struct str // ???????????????????
{
int point1;
int point2;
double d... |
64 | 31963 | /*??????
????????n??????10??,??n?????????,
???????????????????????????
????
????????????????n??????????????????(??????)?
????????0?100????????????????
????
?????n????????n*(n-1)/2???????????
(x1,y1,z1)-(x2,y2,z2)=??
???????????2?? */
int main()
{
int n;cin>>n;
int x[n+1],y[n+1],z[n+1];float dst[n*n]; int sma[n*n], la... |
64 | 31964 | struct point{
int x;
int y;
int z;
};
int main(){
int n,i,j,k=0,c;
double R[1000];
double t;
struct point A[10],B[100],C[100];
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++){
B[k].x=... |
64 | 31965 | int x[11],y[11],z[11],cnt,n,dist[105];
int getdist(int i,int j){
return (x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j])+(z[i]-z[j])*(z[i]-z[j]);
}
int main(){
cin>>n;
for(int i=1;i<=n;i++)
cin>>x[i]>>y[i]>>z[i];
for(int i=1;i<n;i++)
for(int j=i+1;j<=n;j++)
dist[++cnt]=getdist(i,j... |
64 | 31966 | int main(){
int n,sf;
scanf("%d",&n);
int k=0;
int x[10],y[10],z[10],a[200],b[200];
double s[200];
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(int j=i+1;j<n;j++){
sf=(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[k]=sqrt(sf);
a[k]=i;
... |
64 | 31967 | int r(int k,int n)
{
int i;
for(i=n-1;k>i;i--)
k-=i;
return(n-i-1);
}
int p(int k,int n)
{
int i;
for(i=n-1;k>i;i--)
k-=i;
return(n-i+k-1);
}
void main()
{
int n,i,j,k=0,q[50],t,g,h;
float y[50];
struct point{int a;
int b;
int c;
}x[12];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d%d%d",&x[i].a,&x[i].... |
64 | 31968 | int main(){
int n,i,j,dx,dy,dz,o=0;
scanf("%d",&n);
int x[10],y[10],z[10];
double ji[100];
for(i=0;i<n;i++){
scanf("%d%d%d",&(x[i]),&(y[i]),&(z[i]));
}struct pp{
int xi[2],yi[2],zi[2];
double jl;
}pp[100],e;
for(i=0;i<n;i++){
for(j=i+1;j<n;j++){
dx=x[j]-x[i];
dy=y[j]-y[i];
dz=z[j]-z[i];
pp[o].xi[0]=... |
64 | 31969 | //**********************
//* ??? ???? *
//* 1200012878 ??? *
//* 12?15? *
//**********************
struct dian
{
int a;
int b;
int c;
} p[10]; // ??????????
struct len
{
int s;
int m;
double dis;
} q[45]; // ?????????????
int main()
{
int n, count = -1, i, j, k, temp1, temp2;
double temp3;
cin >>... |
64 | 31970 |
int main()
{
int n,b,c;
scanf("%d",&n);
int i,j,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],k,y[51],z[51];
double l[51];
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]-s... |
64 | 31971 |
int main() {
int n, j, i, k = 0, m;
float p = 0, a[100] = { 0 };
int x[10], y[10], z[10];
float s[10][10] = { 0 };
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++) {
a[k++] = s[i][j] = (x[i] - x[j]) * (x[i] - x[j]) + (y[i] - y[j])
... |
64 | 31972 | int main(){
int n,a[10],b[10],c[10],i;
double d[10][10],e[45];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d%d%d",&a[i],&b[i],&c[i]);
}
int k,t=0;
for(i=0;i<n;i++){
for(k=i+1;k<n;k++){
d[i][k]=sqrt((a[i]-a[k])*(a[i]-a[k])+(b[i]-b[k])*(b[i]-b[k])+(c[i]-c[k])*(c[i]-c[k]));
e[t]=d[i][k];
t++;
}
}
for... |
64 | 31973 | struct pl
{
float s[3];
};
struct pl p[10];
struct place
{
struct pl y;
struct pl x;
float p;
};
struct place q[45];
struct place qx;
int main()
{
int n,m,i,j,k=0,l,r,v;
scanf("%d",&n);
m=n*(n-1)/2;
for(i=0;i<=n-1;i++)
{
scanf("%f %f %f",&p[i].s[0],&p[i].s[1],&p[i].s[2]);
}
for(i=0;i<=n-1;i++)
{
for(j=i... |
64 | 31974 | int main()
{
int n;
cin>>n;
float x[n],y[n],z[n],a[(n-1)*n/2],va;
for(int i=0;i<n;i++)
{
cin>>x[i]>>y[i]>>z[i];
}
for(int i=0,k=0;i<n-1;i++)
{
for(int j=i+1;j<n;j++)
{
a[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=k+1;
}
}
for(int i=0;i<(n-1)*n/2-1;i++)
{... |
64 | 31975 | int main()
{
float point[10][3],lon[100],tem1;
int n,i,j,sum=0,x[100],y[100],tem;
cin>>n;
for(i=0;i<n;i++)
cin>>point[i][0]>>point[i][1]>>point[i][2];
for(i=0;i<n;i++)
for(j=i+1;j<n;j++)
{
lon[sum]=sqrt((point[i][0]-point[j][0])*(point[i][0]-point[j][0])+(point[i][1]-point[j][1])... |
64 | 31976 | int x[10],y[10],z[10],k=0,d[100]={0},e[100]={0},i,j,k,n;
double c[100]={0},temp;
int main()
{
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++)
{
c[k]=sqrt( pow(x[i]-x[j],2)+ pow(y[i]-y[j],2)+pow(z... |
64 | 31977 | int main()
{
int sz1[100],sz2[100],sz3[100],n,i,j,k=0,r,a[100],b[100];
double q[10][10],p[10][10],temp,m[72];
scanf("%d",&n);
for(i=0;i<=n-1;i++)
{
scanf("%d%d%d",&sz1[i],&sz2[i],&sz3[i]);
}
for(i=0;i<=n-1;i++)
{
for(j=i+1;j<=n-1;j++)
{
q[i][j]=1.0*((sz1[i]-sz1[j])*(sz1[i]-sz1[j])+(sz2... |
64 | 31978 | int main()
{
int n,j=0,b;
int a[15][3];
double s[10000];
int x[10000][2];
double p;
cin>>n;
for(int i=0;i<n;i++)
{
cin>>a[i][0]>>a[i][1]>>a[i][2];
}
for(int k=0;k<n-1;k++)
{
for(int m=k+1;m<n;m++)
{
s[j]=sqrt((a[k][0]-a[m][0])*(a[k][0]-a[m][0])+(a[k][1]-a[m][1])*(a[k][1]-a[m][1])+(a[k][2]-a[m][2])*(... |
64 | 31979 | struct distance
{
int sp1x;
int sp1y;
int sp1z;
int sp2x;
int sp2y;
int sp2z;
double dis;
} dis[999999],temp;
int main()
{
int n,spot[9999][3]={0},t=0;
cin>>n;
for (int i=0;i<n;i++)
cin>>spot[i][0]>>spot[i][1]>>spot[i][2];
for (int i=0;i<n-1;i++)
for (int j=i+1;j<n;j++)
{
dis[t].sp1x=spot[i][0];
... |
64 | 31980 | struct point
{int x;
int y;
int z;
}p[10];
void distance(int n)
{int i,j,k=0;
double t,d[10][10]={0},D[45]={0};
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... |
64 | 31981 | int main()
{
typedef struct {
int a[3];
int b[3];
float dis;
} juli;
int n,m=0,i,j,k,x,y;
scanf("%d",&n);
int c[10][3];
for(i=0;i<n;i++)
scanf("%d %d %d",&c[i][0],&c[i][1],&c[i][2]);
juli d[50];
juli temp;
for(i=0;i<n-1;i++)
{for(j=i+1;j<n;j++)
{
x=0;
... |
64 | 31982 | int main()
{
int n,x[20],y[20],z[20]={0},ju[200],xx[200],yy[200],zz[200]={0},xxx[200],yyy[200],zzz[200]={0};
int i,j,k=0,m;
double l[200];
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++)
{
ju[k]=(x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j])+... |
64 | 31983 | int main()
{
int n,i,j,a[80],b[80],k=0,m,code1,code2;
double S[80],t;
struct S
{
double x;
double y;
double z;
}point[13];
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=i+1;j<n;j++)//????Cn2
{
S[k]=sqrt((point[i].x-point[j].x)*(point[i].x-point[j].x)+(poi... |
64 | 31984 | int main()
{
int n, l = 0;
struct point
{
int x;
int y;
int z;
}a[10];
struct distance
{
int m[3];
int n[3];
double dis;
}temp,b[100];
cin>>n;
for(int i=0;i<n;i++)
{
cin>>a[i].x>>a[i].y>>a[i].z;
}
for(int i=0;i<n-1;i++)
{
for(int j=i+1;j<n;j++)
{
b[l].m[0] = a[i].x;
b[l].m[1] = a[i]... |
64 | 31985 | int fang(int x,int y)
{
float z;
z=(x-y)*(x-y);
return(z);
}
struct dian
{
int c;
int d;
float e;
}jl[100],tem;
void main()
{
struct dian ji[100];
struct dian tem;
int fang(int x,int y);
int a[10][3],n,i,j,k=0;
for(i=0;i<100;i++){
jl[i].... |
64 | 31986 |
int main()
{
int p[10][3],d2[10][10];
float d[10][10];
int i,j,k=0,n,N;
scanf("%d",&n);
for(i=0;i<n;i++)
for(j=0;j<3;j++)
scanf("%d",&p[i][j]);
for(i=0;i<n-1;i++)
for(j=i+1;j<n;j++)
{
d2[i][j]=(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]... |
64 | 31987 | double juli(double m, double n, double l);
double juli(double m, double n, double l){
double t;
t= m*m+n*n+l*l;
t=sqrt(t);
return t;
}
int main(){
int n,i,j,m;
scanf("%d",&n);
double x[11];
double y[11];
double z[11];
double k[56];
double jiawei1[56];
double jiawei2[... |
64 | 31988 |
int main() {
int n,m=0,a=0;
float l=0;
float D[50];
int X[11],Y[11],Z[11],p[50],q[50];
cin>>n;
for(int i=0;i<n;i++)
{cin>>X[i];
cin>>Y[i];
cin>>Z[i];//?x,y,z??????
}
for(int i=0;i<n;i++)
for(int 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]));//??... |
64 | 31989 | int main()
{
float a[100][9],b[20][4],max=0;//1-3???????4-5??????7???
int n,i,j,k=1;
cin>>n;
for (i=1;i<=n;i++)
{for(j=1;j<=3;j++){
cin>>b[i][j];
}}
for (i=1;i<=n-1;i++)
{for (j=i+1;j<=n;j++)
{a[k][1]=b[i][1];
a[k][2]=b[i][2];
a[k][3... |
64 | 31990 | /*
* Name:distance.cpp
*
* Created on: 2012-11-05
* Author: ??
* Function?????
*/
int main()
{
int n, i, j, count, temp=0;
float sum;
cin >> n;
count=n*(n-1)/2;
int point[3][n];
float distance[count];
float distance_temp;
int ptp[2][count], ptp_temp;
for (i=0;i<n;i++){
for (j=0;j<3;j++){
cin >... |
64 | 31991 |
typedef struct point{
int x, y, z;
} P;
typedef struct len{
double real;
P *a, *b;
} L;
P points[10];
L len[1000];
int lencount=0;
int cmp(const void *a, const void *b){
double k;
L *aa=(L*)a, *bb=(L*)b;
if((k=aa->real - bb->real)) return k<0;
return aa->a - bb->a;
}
int main()
{
int... |
64 | 31992 | int main ()
{
struct distance
{
int point1[3];
int point2[3];
double dis;
};
struct distance d[100],middle;
int i,j,k,n,point[100][3];
cin >> n;
for (i=0;i<n;i++)
{
for (j=0;j<3;j++)
{
cin >> point[i][j];
}
}
j=0;
k=1;
for (i=0;i<n*(n-1)/2;i++)
{
... |
64 | 31993 | //????????
struct point{
int x;
int y;
int z;
}input[10]={0};
struct point u;
struct point v;
struct total{
struct point u;
struct point v;
double result;
}output[45]={0};
//???????????
double distance(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)))... |
64 | 31994 |
typedef struct point {
int x,y,z;
}POINT;
typedef struct disdence {
POINT a,b;
double dst;
}PD;
double Squ(double num) {
return num * num;
}
double Distance(POINT a,POINT b) {
return sqrt(Squ(a.x - b.x) + Squ(a.y - b.y) + Squ(a.z - b.z));
}
int main() {
POINT pt[10];
PD tmp,dst[45];
... |
64 | 31995 | int main()
{
struct address
{
int x;
int y;
int z;
}point[10];
int n,i,j,k;
double d[45],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=i+1;j<n;j++)
d[(2*n-1-i)*i/2+j-i-1]=sqrt((point[i].x-point[j].x)*(point[i].x-point[j].x)+(point[i].y-point[j].... |
64 | 31996 | int main(){
int i,a[1000][3],n,e,j,k=0,h;
double m[3000][3],r,p,q;
scanf("%d",&n);
h=n*(n-1)/2;
for(i=0;i<n;i++)
{
scanf("%d%d%d",&a[i][0],&a[i][1],&a[i][2]);
}
for(i=0;i<n;i++)
{
for(j=i+1;j<n;j++)
{
m[k][0]=i;
m[k][1]=j;
m[k][2]=sqrt((double) ((a[i][0]-a[j][0])*(a[i][0]-a[j][0])+(a[i][1]... |
64 | 31997 | int main(){
int i,j,n,k,l,r;
int x[10],y[10],z[10];
double s[100]={0.0},e;
scanf("%d\n",&n);
for(i=0;i<n;i++){
scanf("%d %d %d",&x[i],&y[i],&z[i]);
}
l=0;
for(i=0;i<n-1;i++){
for(k=i+1;k<n;k++){
r=(x[i]-x[k])*(x[i]-x[k])+(y[i]-y[k])*(y[i]-y[k])+(z[i]-z[k])*(z[i]-z[k]);
s... |
64 | 31998 | int row(int a,int n)
{
int i=n-1;
while(a>i)
{
a-=i;
i-=1;
}
return(n-1-i);
}
int col(int a,int n)
{
int i=n-1;
while(a>i)
{
a-=i;
i-=1;
}return(n-1-i+a);
}
int main()
{
struct spot
{int x;
int y;
int z;
}a[11];
int n,i,j,l=0,c[55],temp,h,g;
double b[55];
scanf("%d",&n);
for(i=0;i<55;i++)
c[... |
64 | 31999 | //***************************
//*???????? *
//*? ???? 1100062709 *
//*? ??2011.12.11 *
//***************************
int main()
{
int n, i, j, k = 0;
cin >> n; //????
int num = n * (n - 1) / 2; //?????????
int a[10][3]; //????????
int *p2 = *a; //????????p2?????????
for ... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.