label stringlengths 1 2 | index stringlengths 1 5 | code stringlengths 87 8.24k |
|---|---|---|
64 | 31800 | int main()
{
double s[10][3],a[100],b[100]; //?s????n?????
double l[100];
int n;
int i,j,k=0,g=0,c,d;
double t;
cin>>n;
for(i=0;i<n;i++)
for(j=0;j<3;j++)
cin>>s[i][j];
for(i=0;i<n-1;i++)
{
for(g=i+1;g<n;g++)
{
l[k]=sqrt((s[i][0]-s[g][0])*(s[i][0]-s[g][0])+(s[i][1]-s[g][1])*(s[i][1]-s[g][1])... |
64 | 31801 | int main()
{
int n=0,k=0,j=0,count=0;//?????????
float x[10],y[10],z[10],d[45];//???????
int name[45][3];//??????????
cin>>n;
for(k=0;k<n;k++)//????
{
cin>>x[k]>>y[k]>>z[k];
}
for(k=0;k<n-1;k++)//????
{
for(j=k+1;j<n;j++)
{
d[count]=sqrt((x[k]-x[j])*(x[k]-x[j])+(y[k]-y[j])*(y[k]-y[j])+(z[k]-z[j])*(z[k... |
64 | 31802 | int main(){
int n,i,j,k,t,m,pair;
double e;
double sz[10][3],num[45][7];
scanf("%d",&n);
pair=n*(n-1)/2;
for(i=0;i<n;i++){
for(j=0;j<3;j++){
scanf("%lf",&sz[i][j]);
}
}
m=0;
for(i=0;i<n-1;i++){
for(j=i+1;j<n;j++){
for(k=0;k<3;k++){
num[m][k]=sz[i][k];
}
for(t=3;t<6;t++){
num[m][t]=... |
64 | 31803 |
struct dist
{
int i;
int j;
float d;
}d[45];//??i?j?????
struct node
{
int x;
int y;
int z;
}a[10];//????????
void main()
{
int n,i,j,count=0;
struct dist temp;//????????
scanf("%d",&n);
for(i=0;i<45;i++) d[i].d=0.0;//????
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... |
64 | 31804 | int main(){
int a[10][3];
int n;
int i,j,k;
double ans[100];
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){
ans[i*n+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));
//cout<<ans[... |
64 | 31805 | float sqr(float x)
{
float ans;
ans=x*x;return(ans);
}
float work(float a[3],float b[3])
{
float ans;
ans=sqrt(sqr(a[0]-b[0])+sqr(a[1]-b[1])+sqr(a[2]-b[2]));
return(ans);
}
int main()
{
int n,i,j,x,num;
int a[101][3]={0};
float dis[101]={0},d[11][3],x1;
scanf("%d",&... |
64 | 31806 | 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... |
64 | 31807 | int main()
{
int n,i,j,t,q,s;//n??????i,j??????t??????????q,s?????????????
cin>>n;//??n
t=n*(n-1)/2;//??t
int x[n+1],y[n+1],z[n+1],a[t+1],b[t+1];//???????a[n+1],b[n+1]??????????????
float dis[t+1],p;//???p?????
for(i=1;i<=n;i++)//?????????
{
cin>>x[i]>>y[i]>>z[i];
}
for(i=1;i<=n-1;i++)//?????????????????????... |
64 | 31808 | /*
* fuck.cpp
*
* Created on: 2011-12-16
* Author: guan hong wei
*/
struct locations//????,????
{
int x;
int y;
int z;
}locations[100];
struct distances//?????????
{
int i;
int j;
double distance;
}distances[100];
struct distances m;
int main()
{
int n,i,j,t=0;
cin>>n;//?????
for(i=0;i<n;i++)
{
cin>>location... |
64 | 31809 | int main()
{
int i,j,k,l,n,m,a[10],b[10],c[10],z[50],x[50],v[50],s[50],d[50],f[50],q,w,r,t,o,u;
double y[50],jl[50],e;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d%d%d",&a[i],&b[i],&c[i]);
}
m=n*(n-1)/2;
k=0;
for(i=0;i<n;i++)
{
for(j=i+1;j<n;j++)
{
y[k]=1.0*((a[j]-a[i])*(a[j]-a[i])+(b[j]-b[i])*(b[j]-... |
64 | 31810 | /**
* @file 1.cpp
* @author ???
* @date 2011-12?07
* @description
* ??????:????
*/
int main()
{
int n, d[101][3];
int i, j, k, m1, m2;
int (*p)[3];
p = d;
double l[10][10], max = 0;
cin >> n;
for (i = 0; i < n; i++)
{
cin >>*(*(p + i)) >> *(*(p + i) + 1) >> *(*(p + i) + 2); // ??i??????
}
for (i = 0; i < n... |
64 | 31811 | int main()
{
int M;
M=N*(N-1)/2;
int x[N],y[N],z[N],d[M],a[M],b[M],p=0,i,j,n,k,m;
double c;
scanf("%d",&n);
printf("\n");
for(i=0;i<n;i++)
scanf("%d%d%d",&x[i],&y[i],&z[i]);
printf("\n");
for(i=0;i<n;i++)
for(j=i+1;j<n;j++)
{
d[p]=(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[p]=i;
b[p]=j;
... |
64 | 31812 | typedef struct Point
{
int x;
int y;
int z;
}Point;
double Distance(Point *p1,Point *p2)
{
int x=(p1->x)-(p2->x);
int y=(p1->y)-(p2->y);
int z=(p1->z)-(p2->z);
double temp=(double)(x*x+y*y+z*z);
return sqrt(temp);
}
void Input(Point *p[],int n)
{
int i;
for(i=0;i<n;i++)
{
p[i]=(Point *)malloc(sizeof(Point));
scanf("%... |
64 | 31813 | struct
{
int x,y,z;
}a[12];
struct
{
int x1,x2,y1,y2,z1,z2;
double l;
}dis[120],t;
void sort(int a)
{
for (int i=0; i<a; i++)
for (int j=0; j<a-1-i; j++)
{
if (dis[j].l < dis[j+1].l)
{
t= dis[j];
dis[j] = dis[j+1];
dis[j+1... |
64 | 31814 | void main()
{
int i,j,k,b,c,n;
double s[100][100],max,a[100][3];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%lf %lf %lf",&a[i][0],&a[i][1],&a[i][2]);
for(i=0;i<n;i++)
for(j=i+1;j<n;j++)
s[i][j]=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])));
... |
64 | 31815 | int main(){
int n,i,s,j,b;
b=0;
int x[11],y[11],z[11],a[46],c[46];
double d[46];
double t,f;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d %d %d",&x[i],&y[i],&z[i]);
}
s=n*(n-1)/2;
for(i=0;i<n;i++){
for(j=i+1;j<n;j++){
f=(x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j])+(z[i]-z[j])*(z[... |
64 | 31816 | int main ()
{
int a[10][3] = {0}; //????????
int n = 0; //??n??????
cin >> n;
int i = 0, j = 0, k = 0; //????????
for ( i = 0; i < n; i ++ ) //??????
for ( j = 0; j < 3; j ++ )
cin >> a[i][j];
double distance[100] = {0}; //???????????
double dis = 0; //?????
for ( i = 0; i < n; i ++ ) ... |
64 | 31817 |
int main(){
int n,x[10],y[10],z[10],xx1[50],yy1[50],zz1[50],xx2[50],yy2[50],zz2[50],i,t,k=0,e;
double j[10][10],jj[50],f;
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(t=0;t<n;t++){
j[i][t]=sqrt((x[i]-x[t])*(x[i]-x[t])+(y[i]-y[t])*(y[i]-y[t])+(z[i]-z[t])*(z[i]-z[t]));
}
}... |
64 | 31818 | int main()
{
int n;
float distance[150];
int k=1;
int i=1,j=1,t=1;
double temp;
struct point
{
int x,y,z;
}
stu1[12];
struct ttt
{
int x1,y1,z1;
int x2,y2,z2;
}
stu2[150];
scanf("%d",&n);
for(i=1;i<=n;i++)
scanf("%d %... |
64 | 31819 | struct point{
int x;
int y;
int z;
};
struct diskumi{
struct point po1;
struct point po2;
double dist;
};
int main()
{
int n;
int xa[15],ya[15],za[15];
struct diskumi dis[45];
int baka;
double cir;
int i,j,k=0;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d %d %d",&xa[i],&ya[i],&za[i]);
for(i=0;i<n;i++)
{... |
64 | 31820 | int main(){
int n,a,m,js=0,p=0,q,e;
scanf("%d\n",&n);
int x[n-1],y[n-1],z[n-1];
double jg[100],o;
for(int i=0;i<100;i++){
jg[i]=-1;
}
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++){
a=10*i+... |
64 | 31821 | int main()
{
float point[10][3],distant[45],t;
int n,i,j,k=0,p,d[45][2];
cin>>n;
for(i=0;i<n;i++)
for(j=0;j<3;j++)
cin>>point[i][j]; //i???????j?????????
for(i=0;i<n;i++)
for(j=i+1;j<n;j++,k++){//distant????????????d??????????????
distant[k]=sqrt(pow((point[i][0]-point[j][0]),2)+pow((point[i][1]-point... |
64 | 31822 |
typedef struct Point
{
int x,y,z;
}Point;
typedef struct Distance
{
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 *)b).... |
64 | 31823 | int main()
{
int n,i,j,k,r,c;
float a[10][3],b[11][11],sum,max;
cin>>n;
for(i=0;i<n;i++)
{
for(j=0;j<3;j++)
cin>>a[i][j];
}
for(i=0;i<n-1;i++)
{
for(k=i+1;k<n;k++)
{
sum=0;
for(j=0;j<3;j++)
{
sum=sum+(a[i][j]-a[k][j])*(a[i][j]-a[k][j]);... |
64 | 31824 | double cal(int a[3],int b[3])
{
int i=0,sum=0;
for(;i<3;i++)
sum+=(a[i]-b[i])*(a[i]-b[i]);
return sqrt(sum);
}
int change(double a[7],double b[7])
{
double temp;
int i;
for(i=0;i<7;i++)
{
temp=a[i];
a[i]=b[i];
b[i]=temp;
}
return 0;
}
void main()
{
int i,j,n,a[10][3],k1=0,k2;
double b[60][7];
scanf(... |
64 | 31825 | int main(){
int n,i,j,k=0,p,q;
double t;
scanf("%d",&n);
double x[200];
double y[200];
double z[200];
double jl[200][200];
double jljl[200];
double dhi[200];
double dhj[200];
for(i=0;i<n;i++){
scanf("%lf",&(x[i]));
scanf("%lf",&(y[i]));
scanf("%lf",&(z[i]));
}
for(i=0;i<n;i++){
for(j=i+1;j<n;j++){
... |
64 | 31826 | int main()
{
int n;
int i,j,k=0;
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);
}
struct distant
{
struct point p1,p2;
double r;
}d[45],t;
for(i=0;i<n;i++)
{
for(j=i+1;j<n;j++,k++)
{
d[k].p1=p[i];
d[k].p2=p[j];
... |
64 | 31827 | int main(){
int i,j,m=0,n,x[10],y[10],z[10],a,b,c,e,f,g,x1[55],y1[55],z1[55],x2[55],y2[55],z2[55];
double jl[55],d;
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++){
jl[m]=sqrt(pow(x[i]-x[j],2)+pow(y[i]-y[j],2)+pow(z[i]-z[j],2));
x1[m]=x[i];x2[m]=x[j];... |
64 | 31828 | int main()
{
int n,i,j,m=0,k,s,t;
cin >> n;
double d[101][101];
struct point
{
int x;
int y;
int z;
}p[11];
for (i=0;i<=n-1;i++)
{
cin >> p[i].x >> p[i].y >> p[i].z;
}
for (i=0;i<n;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].... |
64 | 31829 | struct distants
{double d;
int x;
int y;
}b[45],mid;
int main()
{int n,i,j,num=0;
int a[10][3];
struct distants b[45],mid;
scanf("%d",&n);
if(n<=10){
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[num].d=sqrt((double)((a[i][0]-a[j][0])*(a[i][0]-a[j][0])... |
64 | 31830 | int main()
{
int n;
double x[11], y[11], z[11], s[11][11];
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++)
{
s[i][j] = (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[i][j] = sqrt(s[i][j])... |
64 | 31831 | int main(){
int x[10],y[10],z[10],n,num=0;//????x,y,z?num?????
double a[10][10],b[45];//???????????????????????????????????????
cin>>n;
for(int i=0;i<n;i++){
cin>>x[i]>>y[i]>>z[i];
}//????????
for(int i=0;i<n;i++){
for(int j=i+1;j<n;j++){
a[i][j]=sqrt((x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j])+... |
64 | 31832 | //**************************
//*?????(14-4) ???? **
//*?????? 1200012888 **
//*???2013.12.11**
//**************************
struct //????????? Point ?? x y z ??
{
int x;
int y;
int z;
}Point[10]; //????? Point
struct dis //????????? dis ?? ????d???????Point????????
{
int pos_1;
int pos_2;
double ... |
64 | 31833 | int main()
{
int n,i,j,k;
int x[10],y[10],z[10];
double t;
double d[45];
cin>>n;
for(i=0;i<n;i++)
cin>>x[i]>>y[i]>>z[i];
for(i=0;i<n-1;i++)
{
for(j=i+1;j<n;j++)
d[(j-i)+(n-1+n-i)*i/2-1]=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])));
}
for(i=0;i<n*(n-1)/2-1;i++)... |
64 | 31834 | int main()
{
int n,i,j=0,k,r,g,o,l;
int x[100],y[100],z[100];
int q[100],w[100];
double s[450],e;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d%d%d",&x[i],&y[i],&z[i]);
}
for(k=0;k<n-1;k++){
for(i=k+1;i<n;i++){
s[j]=1.0*pow((x[k]-x[i]),2)+pow((y[k]-y[i]),2)+pow((z[k]-z[i]),2);
s[j]=sqrt(s[j]);
q[j]=k... |
64 | 31835 | 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 | 31836 |
int main()
{
int spot[100][3],n,i,j,k=0;
struct D
{
int s[2][3];
double d;
} D[1000],tem;
scanf("%d",&n);
for (i=0;i<n;i++)
scanf("%d%d%d",&spot[i][0],&spot[i][1],&spot[i][2]);
for (i=0;i<n-1;i++)
{
... |
64 | 31837 | //******************************************************
//* ? ? ? ?? ? ? ? *
//* ? ? ?? ? ? *
//* ? ? ? ??2010 ? 12 ? 15 ? *
//* ? ? ?1000010185 *
//******************************************************
... |
64 | 31838 | int main()
{
int n, i, j, k = 0;
cin >> n;
int num = n * (n - 1) / 2;
int a[10][3];
for ( i = 0; i < n; i++)
for ( j = 0; j < 3; j++)
cin >> a[i][j];
double b[10][10];
double c[45];
for ( i = 0; i < n - 1; i++)
for ( j = i + 1; j < n; j++)
{
double len1, len2, len3;
len1 = pow(a[i][0] - a[j][0... |
64 | 31839 | main()
{
int i,j,p=0,n,b[10][3];
struct qwe
{
int a[3];
int b[3];
int jl;
}t[45],e;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d%d%d",*(b+i),*(b+i)+1,*(b+i)+2);
for(i=0;i<n-1;i++)
{
for(j=i+1;j<n;j++)
{
t[p].a[0]=b[i][0];
t[p].a[1]=b[i][1];
t[p].a[2]=b[i][2];
t[p].b[0]=b[j][0];
t[p].b[1... |
64 | 31840 | struct point{
int a,b,c;
}x[10];
int d(int k,int n)
{
int i;
for(i=n-1;k>i;i--)
k-=i;
return(n-i-1);
}
int f(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[46],t;
float y[46];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d %d %d",&x[i].a,&x[i].b,&x[i].c);
... |
64 | 31841 | /*
*????04.cpp
*??????
*?????2011-12-15
*???????????n??????10??,??n?????????,???????????????????????????
*/
int main()
{
int n; //?????????
cin>>n;
struct zb //?????????????
{
int x;
int y;
int z;
}dian[n];
for(int i=0;i<n;i++) //????
cin>>dian[i].x>>dian[i].y>>dian[i].z;
double distance[... |
64 | 31842 | int main(){
int i,j,l,k=0,n;
cin >> n;
double x[11],y[11],z[11],dis[11][11],temp[50],ins;
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++){
dis[i][j]=(x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j])+(z[i]-z[j])*(z[i]-z[j]); //?i???j????????
temp[k]=dis[i][j]; //????????... |
64 | 31843 | int main()
{
int x[10],y[10],z[10];
int n,i,j,p,m,h;
double k,l[10][10];
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++)
{
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]);
l[i][j]=sqrt(k);
}
for(h=1;h<=n*(n-1)/2;h++)
{
double max=0... |
64 | 31844 | //*******************************
//*??????? **
//*?????? 1300012965 **
//*???20131211 **
//*******************************
struct zb
{
int x;
int y;
int z;
}a[11];//??????
int main()
{
double l[100] = {0.0};
int i, j, k, n, co = 0, q[100] = {0}, temp, x1, y1, co1 = 0;
double l... |
64 | 31845 | int main()
{
int n,i=0,j=0,k=0;;
double x[10],y[10],z[10],d[100],t,s,c[10][10]={0};
cin>>n;
for(int i=0;i<n;i++)
{
cin>>x[i]>>y[i]>>z[i];
}
for(int i=0;i<n;i++)
{
for(int j=i+1;j<n;j++)
{
d[k]=sqrt((x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j])+(z[i]-z[j])*(z[i]-z[j]));
k++;
}
}
for(int k=0;k<(... |
64 | 31846 | int main()
{
int n,i,j,i1,j1,k;
double x[11],y[11],z[11],r[10][11];//?i????j??????r[i][j],?i??????(x[i],y[i],z[i])
cin>>n;//?n??
for(i=1;i<=n;i++)
cin>>x[i]>>y[i]>>z[i];//????
for(i=1;i<n;i++){
for(j=1;j<=n;j++)
r[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]));
}//?????... |
64 | 31847 | int main()
{
int n,i,j,k=0,d,e,x[100],y[100],z[100];
double m,a[100][100]={-1},b[500]={-1},c[500];
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++){
a[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]));
b[k]=a[i... |
64 | 31848 | int main()
{
int a[1000][3],n,m,l=1,i,j;
double b[3000][3],q,w,e;
scanf("%d",&n);
m=n*(n-1)/2;
for( i=1;i<=n;i++){
for(j=1;j<=3;j++){
scanf("%d",&a[i][j]);
}}
for(i=1;i<=n;i++){
for( j=i+1;j<=n;j++){
b[l][1]=i;
b[l][2]=j;
... |
64 | 31849 | struct zz
{
float key;
int num1,num2;
}a[1005]={0,0,0},va;
int main()
{
int n;
cin>>n;
float x[n+5],y[n+5],z[n+5];
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].key=sqrt( (x[i... |
64 | 31850 | struct suanshi{
int a[3],b[3];
int no;
float x;
}dian[45];
int cmp(const void *a,const void *b){
struct suanshi *aa=(struct suanshi *)a;
struct suanshi *bb=(struct suanshi *)b;
if((aa->x)<(bb->x))return 1;
if((aa->x)>(bb->x))return -1;
else return (aa->no)-(bb->no);
}
void main(){
int point[11][3];
int n,i,j,... |
64 | 31851 | int main()
{
int n;
cin>>n;
int x[n],y[n],z[n],p,q;
float d[n][n-1],t;
float a[n*(n-1)/2];
int k=0;
int b[n*(n-1)/2],c[n*(n-1)/2];
for(int i=0;i<n;i++)
cin>>x[i]>>y[i]>>z[i];
for(int i=0;i<n;i++)
for(int 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])*... |
64 | 31852 | int main()
{
int n,m,i,j,x,y,t=0;
cin>>n;
int a[10],b[10],c[10],e[100];
double d[100];
for(i=0;i<n;i++)
cin>>a[i]>>b[i]>>c[i];
for(i=0;i<n;i++)
for(j=i+1;j<n;j++)
{e[t]=10*i+j;
d[e[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]));
t++;
}
for(i=1;i<t;i++)
for(j=0;j<t... |
64 | 31853 | int main(){
int n,i,j,N,k,t;
int a[11][4],b[50][7];
double d[50],e;
scanf("%d",&n);
N=n*(n-1)/2;
for(i=1;i<=n;i++){
for(j=1;j<=3;j++){
scanf("%d",&a[i][j]);
}
}
t=1;
for(i=1;i<n;i++){
for(j=i+1;j<=n;j++){ ... |
64 | 31854 | struct coordinate
{
int x;
int y;
int z;
} point[10];
int main()
{
double dis[10][10]={0}, d[100]={0}, temp=0;
int i, j, n, k1=0, k2=0, k;
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... |
64 | 31855 | int main()
{
int i,k,m,n,h,d,g;
int a[10],b[10],c[10],p[50],q[50];
double s[50],max;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%d%d%d",&a[i],&b[i],&c[i]);
}
for(i=1,m=0;i<n;i++)
{
for(k=i+1;k<=n;k++)
{
m++;
s[m]=sqrt((a[i]-a[k])*(a[i]-... |
64 | 31856 | float juli(float x1,float y1,float z1,float x2,float y2,float z2)
{
return sqrt((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2)+(z1-z2)*(z1-z2));
}
int main()
{
int n,u=0;
int i,j,t;
float x[10],y[10],z[10],d[50],m;
int a[50],b[50];
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++... |
64 | 31857 | int main()
{
int n,i,j,k=0,l;
double B[10][10],a,C[91]={0},A[10][3];
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++)
{
B[i][j]=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... |
64 | 31858 | int main()
{
int i,n,k,p=0,f;
int c[100],d[100];
int a[100][50];
double b[200],q,e;
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++)
{
... |
64 | 31859 | struct point
{
int x;
int y;
int z;
}po[10];
struct distance
{
double dist;
int x1;
int y1;
int z1;
int x2;
int y2;
int z2;
};
int main()
{
int n,i,j,k=0;
struct distance dis[50],temp;
cin>>n;
for(i=0;i<n;i++)
{
cin>>po[i].x>>po[i].y>>po[i].z;
}
for(i=0;i<n-1;i++)
for(j=i+1;j<n;j++)
{
dis[k].d... |
64 | 31860 | int main(){
int a[10][3];
int n;
int i,j,k;
//double ans[100];
double ans[10][10];
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){
ans[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... |
64 | 31861 | double juli(int a,int b,int c,int d,int e,int f)
{
double t;
t=sqrt((a-d)*(a-d)+(b-e)*(b-e)+(c-f)*(c-f));
return t;
}
int main()
{
int a[11],b[11],c[11],e[50],f[50],temp1;
double d[50],temp;
int n,i,j,t=0;
scanf("%d",&n);
for(i=0;i<=n-1;i++)
{
scanf("%d%d%d",&a[i],&b[i],&c[i]);
}
for(j=0;j<=n-2;j++)
{
f... |
64 | 31862 | 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];
float d[45];
int s[45],e[45];
int t=0;
for(i=0;i<=n-2;i++)
for(j=i+1;j<=n-1;j++)
{
d[t]=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]=i,e[t]=j... |
64 | 31863 | int main(){
int i,x,n,g,l,p,a,b,c;
double e;
double dst[45];
int xz[10];int yz[10];int zz[10];
int dx[45];int dy[45];int dz[45];
int sx[45];int sy[45];int sz[45];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d %d %d ",&(xz[i]),&(yz[i]),&(zz[i]));
}
g=0;
for(i=0;i<n-1;i++){
for(x=i+1;x<n;x++){
a=((xz[i... |
64 | 31864 | int main(){
int x[10],y[10],z[10];
double l[10][10];
double d[100];
double m;
int i,j,k,n;
int s=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=i+1;j<n;j++){
l[i][j]=sqrt((x[i]-x[j])*(x[i]-x[j])+(y[i]... |
64 | 31865 | /**
* @file homework.cpp
* @author ???
* @date 2011-12-06
* @description
* ??????: ??????
*/
struct juli
{
int a;
int b;
double dis;
}x[45],t;
int main()
{
int n,m=0;
int i,j,k,p=0,l,s,r;
int a[10][3]={0};
cin>>n;
for(i=0;i<n;i++)
{
cin>>a[i][0]>>a[i][1]>>a[i][2];
}
m=n*n/2-n/2;
for(j=0;j<n-1;j++)
{
... |
64 | 31866 | int main()
{
double cd[1000],s;
struct zuobiao{int x,y,z;}zuobiao[100];
struct jl{int q,w,e,r,t,u;}jl[1000];
int i,j,n,k,a,b,c,d,f,g;
scanf("%d",&n);
k=0;
for(i=0;i<n;i++)
scanf("%d%d%d",&(zuobiao[i].x),&(zuobiao[i].y),&(zuobiao[i].z));
for(i=0;i<n;i++)
{
for(j=i+1;j<n;j++)
{
cd[k]=sqr... |
64 | 31867 | struct twopoint{
float a1[3],a2[3],c;
}b[45];
float a[10][3];
int select(float b[],int n){
int i,j,c;
for(i=0;i<n;i++){ c=0;
for(j=0;j<3;j++)
if(b[j]==a[i][j]) c++;
if(c==3) return(i);
}
}
void selectsort(struct twopoint b[],int n,int m){
int i,j,k,i1,j1;
float d[4];
struct twopoint temp;
for(i=0;i<n;i... |
64 | 31868 |
int main(){
int n,x[20],y[20],z[20];
float dis[20][20],a[400];
int k=0;
cin>>n;
for(int i=0;i<n;i++)
cin>>x[i]>>y[i]>>z[i];
for(int i=0;i<n;i++)
for(int j=i+1;j<n;j++)
{
a[k]=dis[i][j]=sqrt((float)((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++;
}
... |
64 | 31869 |
struct point
{
int x;
int y;
int z;
} p[100];
struct line
{
int p1;
int p2;
double len;
} l[1000];
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 | 31870 | typedef struct Point
{
int x;
int y;
int z;
}Point;
double Distance(Point *p1,Point *p2)
{
int x=(p1->x)-(p2->x);
int y=(p1->y)-(p2->y);
int z=(p1->z)-(p2->z);
double temp=(double)(x*x+y*y+z*z);
return sqrt(temp);
}
void Input(Point *p[],int n)
{
int i;
for(i=0;i<n;i++)
{
p[i]=(Point *)malloc(sizeof(Point));
scanf("... |
64 | 31871 | int main()
{
int n,i,s,j;
struct point
{
int a,b,c;
}p[10];
struct distance
{
double d;
int x1,x2,y1,y2,z1,z2;
}dis[45],temp;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d%d%d",&p[i].a,&p[i].b,&p[i].c);
i=0;
j=1;
for(s=0;s<n*(n-1)/2;s++)
{
dis[s].x1=p[i].a;
dis[s].x2=p[j].a;
dis[s].y1=p[i].b;
... |
64 | 31872 | int main(){
int n, xz[100], yz[100], zz[100], xx[100], yy[100];
double jl[100];
double j[100];
int c=0;
int t, m, l;
scanf("%d\n",&n);
for(int i=0;i<n;i++){
scanf("%d %d %d",&xz[i], &yz[i], &zz[i]);
}
for(int a=0;a<n;a++){
for(int b=a+1;b<n;b++){
jl[c]=(zz... |
64 | 31873 | int point[MAX][3];
double d;
struct {
int x1,x2,y1,y2,z1,z2;
double d;
}dis[DIS],mid;
int n,m=0,i,j;
int main()
{
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d%d%d",&point[i][0],&point[i][1],&point[i][2]);
}
for(i=0;i<n-1;i++)
{
for(j=i+1;j<n;j++)
{
dis... |
64 | 31874 |
void main()
{
int i,j,k,n;
int point[10][3];
double dis[10][10];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d %d %d",&point[i][0],&point[i][1],&point[i][2]);
// for(i=0;i<n;i++)
// printf("%d %d %d\n",point[i][0],point[i][1],point[i][2]);
for(i=0;i<n-1;i++)
for(j=i+1;j<n;j++)
dis[i][j]=(point[i][0]-point[... |
64 | 31875 |
struct POINT{
int x, y, z;
};
struct DISTANCE{
int pointx, pointy;
double dis;
};
int cmp(const void* e1, const void* e2){
struct DISTANCE* elem1 = (struct DISTANCE*)e1;
struct DISTANCE* elem2 = (struct DISTANCE*)e2;
if(elem1->dis == elem2->dis)
return (elem1->pointx) - (elem2->pointx);
if(elem1->dis > elem... |
64 | 31876 | int main()
{
int n,i,k,j,sum=0,l=0;
double di[100],e;
struct i{
int x,y,z;
}a[100],b[100],g,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++)
{
di[l]=sqrt((a[i].x-a[j].x)*(a[i].x-a[j].x)+(a[i].y... |
64 | 31877 | int main()
{
int a,c,k,i,m,j,n,x[101],y[101],z[101],xs[101],ys[101],zs[101],xz[101],yz[101],zz[101];
double b,l[10][10],ls[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;i++){
for(j=i+1;j<n;j++){
l[i][j]=sqrt((x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j])+(z[i]-z[... |
64 | 31878 | int main(){
int shu[10][3],i,j,n,a;
double d[1000],e;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d %d %d",&shu[i][0],&shu[i][1],&shu[i][2]);
}
for(i=0;i<n;i++){
for(j=i+1;j<n;j++){
d[10*i+j]=0;
}
}
for(i=0;i<n;i++){
for(j=i+1;j<n;j++){
a=(shu[i][0]-shu[j][0])*(shu[i][0]-shu[j][... |
64 | 31879 | /*
* justexp.cpp
*
* Created on: 2011-11-18
* Author: dell
*/
int main()
{
int n,m,i,j,k,l;
cin>>n;
m=n*(n-1)/2;
int point[n][3];
for(i=0;i<n;i++)
cin>>point[i][0]>>point[i][1]>>point[i][2];
struct data
{
int point1[3];
int point2[3];
float len;
int mark1;
int mark2;
}distance[m],temp;
f... |
64 | 31880 |
struct zuobiao
{
int x ;
int y ;
int z ;
}s[10] ; //??xyz??????
double d[100] , temp ; //d??????????
int qian[100] , hou[100] , temp1 ; //qian hou ?????????????????????
int i , j , k = 0 ;
void dis(int , int) ;
void paixu() ;
int main()
{
int n ;
cin >> n ;
for (i = 0 ; i < n ; i++)
cin >> s[i].x... |
64 | 31881 |
struct point
{
int x;
int y;
int z;
};
struct dist
{
struct point *p1;
struct point *p2;
double l;
};
void sort(struct dist a[], int n)
{
int i,j;
struct dist t;
for(i=0;i<n-1;i++)
for(j=n;j>i;j--)
if(a[j].l>a[j-1].l)
{
t=a[j];a[j]=a[j-1];a[j-1]=t;
}
}
void main()
{
struct point p[10];
str... |
64 | 31882 | int main()
{
int n,i,j=0,k=0,len,sum=0;
double di[100],l;
struct i{
int x,y,z;
}a[100],b[100],c[100],e;
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++)
{
di[k]=sqrt(1.0*(a[i].x-a[j].x)*(a[i].x-a[j].x)+1.0*(a[i].y-a[j].y)*(a... |
64 | 31883 | int main()
{
struct position
{int x1;
int x2;
int x3;
}pos[10];
struct distance
{int x;
int y;
float distan;
}dis[60],temp;//x??????y??????distan???
int n,i,j,k;
cin>>n;
for(i=0;i<n;i++)
{cin>>pos[i].x1;
cin>>pos[i].x2;
cin>>pos[i].x3;
... |
64 | 31884 | int main()
struct d{
int x;
int y;
int z;};
{
struct d s[10];
int n,i,j,k=0,d;
int x,y,z,b[45],c[45];
double a[45],temp;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d %d %d",&s[i].x,&s[i].y,&s[i].z);
for(i=0;i<n;i++)
for(j=i+1;j<n;j++)
{ x=s[i].x-s[j].x;
y=s[i].y-s[j].y;
z=s[i].z-s[j].z;
a... |
64 | 31885 | int main(){
int n,i,j;
scanf("%d",&n);
struct point
{
int x;
int y;
int z;
}
point[10];
for(i=0;i<n;i++){
scanf("%d%d%d",&point[i].x,&point[i].y,&point[i].z);
}
struct len
{
double s;
struct point p1,p2;
}
len[45];
int k=0;
for(j=0;j<n-1;j++){
for(i=j+1;i<n;i++){
len[k].s=sqrt((point[j].x-point[i].x)*(poin... |
64 | 31886 | int main(){
int pointnum,groupnum,i,j,k;
int point[10][3]={0};
cin>>pointnum;
groupnum=pointnum*(pointnum-1)/2;
for(i=0;i<pointnum;i++)
for(j=0;j<3;j++)
cin>>point[i][j];
int group[45][6]={0};
double result[45];
for(i=0;i<45;i++)
result[i]=0;
for(i=k=0;i<pointnum-1;i++)
for(j=i+1;j<pointnum;j++)
{
... |
64 | 31887 | 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];
for(i=0;i<45;i++)
dis[... |
64 | 31888 | struct point{
int a;
int b;
int c;
}p[10];
struct dis{
double d;
int i;
int j;
}di[60],x;
int main()
{int k,m,q,n,y;
double z;
scanf("%d",&n);
for(k=0;k<n;k++)
scanf("%d%d%d",&p[k].a,&p[k].b,&p[k].c);
k=0;
for(m=0;m<n;m++)
{q=m+1;
for(;q<n;q++)
{z=((double)p[q].a-(double)p[m].a)*((double)p[q].a-(double)p[m].a)+... |
64 | 31889 | 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 | 31890 | struct equal{
int i1,j1,k1;
int i2,j2,k2;
double distance;
};
void bubblesort(struct equal d[],int n);
struct node{
int i,j,k;
};
int main(){
int n,i;
scanf("%d",&n);
struct node aa[n];
for( i=0;i<n;i++)
{scanf("%d%d%d",&(aa[i].i),&(aa[i].j),&(aa[i].k));
}
struct equal equal1[1000];
int a,b,c,g,p=0... |
64 | 31891 | int main()
{
int syz[10][3];
int i,j,n,d,y,k,r=0;
double result,sy[45];
scanf("%d",&n);
for(i=0;i<n;i++)
{
for(j=0;j<3;j++)
{
scanf("%d",&syz[i][j]);
}
}
for(i=0;i<n-1;i++)
{
for(k=i+1;k<n;k++)
{
result=sqrt(1.0*(syz[k][0]-syz[i][0])*(syz[k][0]-syz[i][0])+1.0*(syz[k][1]-s... |
64 | 31892 | int main()
{
int n,i,j,k,p=0,q,r,e;
cin>>n;
float s,m1,m2,m3,m4,m5,m6,f,g;
float l[50];//??
float x[10];
float y[10];
float z[10];//??
float a1[50][2];
float a2[50][2];
float a3[50][2];
float b1[50][2];
float b2[50][2];
float b3[50][2];//????????
for(i=0;i<n;i++)
cin>>x[i]>>y[i]>>z[i];//??
for(j=0;j<n-... |
64 | 31893 | int main()
{
int n, i, j;
int location[11][3];
int (*p)[3];
cin >> n;
for ( i = 1; i <= n; i++ )
{
for ( j = 0; j < 3; j++ )
{
cin >> location[i][j];
}
}
struct team
{
int a1;
int a2;
double distance;
} zu[45], ... |
64 | 31894 | int main()
{
int a[11][3],i,j,n,k,c[46],d[46],f;
double b[46],t;
cin>>n;
for(i=1;i<=n;i++)
{
cin>>a[i][0]>>a[i][1]>>a[i][2];
}
k=1;
for(i=1;i<n;i++)
for(j=i+1;j<=n;j++)
{
b[k]=sqrt( (a[i][0]-a[j][0])*(a[i][0]-a[j][0])+(a[i][1]-a[j][1... |
64 | 31895 |
float ju(int *p,int *q){
float s=0;
int i=0;
for(i=0;i<3;i++){
s=(*(p)-*(q)) * (*(p)-*(q))+s;
p++,q++;}
return s=sqrt(s);}
int main()
{
struct s{
int i;
int j;
float l;
}
s[100],t;
int n,a[11][3]={0},i,j,p=0,k;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d%d%d",&a[i][0],&a[i][1],&a[i][2]);
}
for(i... |
64 | 31896 | int main()
{
int n,i,j,r,k=0,a[10][3],c[45],d[45];
double b[45];
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;i++)
{
for(j=i+1;j<n;j++)
{
b[k]=sqrt((a[i][1]-a[j][1])*(a[i][1]-a[j][1])+(a[i][2]-a[j][2])*(a[i][2]-a[j][2])+(a[i][0]-a[j][0])*(a[i][0]-a[j][0]));
... |
64 | 31897 | int a[1000];
int b[1000];
int c[1000];
float sum[1000];
float dis[1000];
int x[1000];
int y[1000];
int main(){
int n=0,d=0,i=0,r=0,l=0,f=0,k=0;
float e=0;
for(i=0;i<n;i++){
sum[i]=0;
dis[i]=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++){
... |
64 | 31898 | int main( ){
int i,n,k,t,q=0;
int x[10],y[10],z[10],a[50],b[50];
double s[50],ss[50],j;
scanf("%d\n",&n);
for(i=0;i<n;i++){
scanf("%d %d %d ",&(x[i]),&(y[i]),&(z[i]));
}
for(t=0;t<n-1;t++){
for(i=t+1;i<n;i++){
s[q]=1.0*(x[t]-x[i])*(x[t]-x[i])+1.0*(y[t]-y[i])*(y[t]-y[i])+1.0*(z[t]... |
64 | 31899 | void main()
{
int n,a[10][3],i,j,x[100][2],k=0,s;
double d[100],t;
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]=sqrt((double)((a[i][0]-a[j][0])*(a[i][0]-a[j][0])+(a[i][1]-a[j][1])*(a[i][1]-a[j][1])+(a[i][2]-a[j][2])*(a[i][2]-a[j]... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.