#include<iostream>
#include<stdlib.h>
#include<time.h>
using namespace std;
struct p{
int x,y;
}point[10];
void pon(){
double mind=1000;
double dis=0;
int m=0,n=0;
for(int i=0;i<10;i++)
for(int j=i+1;j<10;j++){
dis=(point[i].x-point[j].x)*(point[i].x-point[j].x)+(point[i].y-point[j].y)*(point[i].y-point[j].y);
if(dis<mind){
mind=dis;m=i;n=j;}
}
cout<<"最近对: "<<point[m].x<<","<<point[m].y<<" "<<point[n].x<<","<<point[n].y<<endl;
}
void main(){
srand(time(NULL));
for(int i=0;i<10;i++){
point[i].x=rand()%20;
point[i].y=rand()%20;
}
cout<<"坐标点:"<<endl;
for(i=0;i<10;i++){
cout<<point[i].x<<" "<<point[i].y<<endl;
}
pon();
}
最近对------蛮力法
猜你喜欢
转载自blog.csdn.net/wanwu_fusu/article/details/82818486
今日推荐
周排行