蛮力法求最近对

//蛮力法 --最近对问题
#include<stdio.h>
#include<stdlib.h>
#define random(x) (rand()%x)
typedef struct node//定义点的结构
{
   int x;
   int y;
}node;
typedef struct nlist//定义点的一个集合链表存储
{
    struct node data;
    struct nlist *next;
}nlist;
typedef struct close//用于保留最近的两点
{
    node a;
    node b;
    double space;
}close;
//生成节点
nlist *creatnode(int m)
{

    nlist *head,*p,*q;
    head=(nlist*)malloc(sizeof(nlist));
    head->next=NULL;
    p=head;
    q=p;