清帝之惑之雍正c++代码

#include<iostream>
#include<algorithm>
#include<string>
#include<iomanip>
#include<memory.h>
#include<time.h>
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<stdbool.h>
#include<math.h>
#define min(a,b) ((a)<(b)?(a):(b))
#define max(a,b) ((a)>(b)?(a):(b))
#define abs(a) ((a)>0?(a):(-(a)))
#define lowbit(a) (a&(-a))
#define sqr(a) ((a)*(a))
#define swap(a,b) ((a)^=(b),(b)^=(a),(a)^=(b))
#define eps 1e-8
#define J 10000
#define MAX 0x7f7f7f7f
#define PI 3.1415926535897
#define N 100004
using namespace std;
int n,m,lll,ans,cas;
double b,c;
struct xxx
{
?? ?double x,y;
}a[N];
bool cmp(xxx aa,xxx bb)
{
?? ?if(aa.x!=bb.x)return aa.x<bb.x;
?? ?return aa.y<bb.y;
}
int main()
{
?? ?#ifndef ONLINE_JUDGE
?? ?#endif
?? ?int i,j,k;
?? ?while(~scanf("%d",&n) && n)
?? ?{
?? ??? ?c=1000000000000;
?? ??? ?for(i=1;i<=n;i++)
?? ??? ??? ?scanf("%lf%lf",&a[i].x,&a[i].y);
?? ??? ?sort(a+1,a+1+n,cmp);
?? ??? ?for(i=1;i<=n;i++)
?? ??? ?{
?? ??? ??? ?for(j=i+1;j<=n;j++)
?? ??? ??? ?{
?? ??? ??? ??? ?if(sqr(a[i].x-a[j].x)>c)break;
?? ??? ??? ??? ?b=sqr(a[i].x-a[j].x)+sqr(a[i].y-a[j].y);
?? ??? ??? ??? ?c=min(c,b);
?? ??? ??? ?}
?? ??? ?}
?? ??? ?c=sqrt(c);
?? ??? ?printf("%.3lf\n",c);
?? ?}
?? ?return 0;
}