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... |
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+... |
64 | 31602 | //* * * * * * * * * * * * * * * * * * * * * * * *
//*???????? *
//*????????.cpp *
//*????? 1000012839 *
//*???2010.12.18 *
//* * * * * * * * * * * * * * * * * * * * * * * *
struct Dot
{
int dot1[3]; // ????????
i... |
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++... |
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{ ... |
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+... |
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]... |
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 < ... |
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++){
... |
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",... |
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... |
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) ... |
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... |
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... |
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++){
... |
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++)
... |
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);
j... |
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]);
... |
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);
} ... |
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++)
{... |
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[10... |
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
... |
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; ... |
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[... |
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<... |
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[... |
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[... |
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)... |
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... |
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++)
... |
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;... |
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].... |
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... |
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... |
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) {
conti... |
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])*(... |
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])... |
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[... |
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++;//
}
... |
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... |
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... |
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... |
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[... |
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... |
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)... |
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]-... |
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);
... |
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... |
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[... |
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][... |
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]... |
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])*(... |
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(... |
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];
... |
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[... |
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]);
... |
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;... |
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... |
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]-... |
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++) //??... |
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 ... |
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... |
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<=... |
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[... |
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]... |
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+... |
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;... |
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])*... |
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 (... |
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... |
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... |
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];
... |
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... |
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... |
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]));//????
}... |
64 | 31675 | int main() //?????
{
int n; //????
cin>>n; //????
double a[20][4]={0}; //????a???n????
double dis[50]; ... |
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... |
64 | 31677 | //**********************************************************
//* ?????1.cpp *
//* ??????1200012906 *
//* ???2012?12?10? *
//* ????????? *
//***************************************... |
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]=s... |
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]... |
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... |
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... |
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=... |
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... |
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;
... |
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].... |
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]... |
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 = (... |
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;
... |
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;
d... |
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++)
{... |
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... |
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];z... |
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=... |
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... |
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... |
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]... |
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[... |
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; ... |
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] ... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.