hud1007 Quoit Design

 #include<algorithm>
 #include<iostream>
 #include<cstdlib>
 #include<cstring>
 #include<cstdio>
 #include<string>
 #include<cmath>
 #include<ctime>
 #include<queue>
 #include<stack>
 #include<map>
 #include<set>
 #define rre(i,r,l) for(int i=(r);i>=(l);i--)
 #define re(i,l,r) for(int i=(l);i<=(r);i++)
 #define Clear(a,b) memset(a,b,sizeof(a))
 #define inout(x) printf("%d",(x))
 #define douin(x) scanf("%lf",&x)
 #define strin(x) scanf("%s",(x))
 #define LLin(x) scanf("%lld",&x)
 #define op operator
 #define CSC main
 typedef unsigned long long ULL;
 typedef const int cint;
 typedef long long LL;
 using namespace std;
 double f(const long double &a){return a*a;}
 const double inf=;
 void inin(int &ret)
 {
     ret=;int f=;char ch=getchar();
     while(ch<''||ch>''){if(ch=='-')f=;ch=getchar();}
     while(ch>=''&&ch<='')ret*=,ret+=ch-'',ch=getchar();
     ret=f?-ret:ret;
 }
 struct xl
 {
     double x,y;
     void in(){douin(x),douin(y);}
     xl(double x=,double y=):x(x),y(y){}
     bool op < (const xl &rhs)const {return x==rhs.x?y<rhs.y:x<rhs.x;}
 };
 xl di[];
 int wocao[];
 int n,top;
 bool com(const int &a,const int &b)
 {
     return di[a].y<di[b].y;
 }
 double dis(const xl &a,const xl &b)
 {
     return sqrt(f(a.x-b.x)+f(a.y-b.y));
 }
 double mindis(int l,int r)
 {
     double ret=inf;
     if(l==r)return ret;
     if(r-l+<=)
     {
         re(i,l,r)re(j,i+,r)
             ret=min(ret,dis(di[i],di[j]));
         return ret;
     }
     int mid=(l+r)>>;
     ret=min(mindis(l,mid),mindis(mid+,r));
     top=;
     re(i,l,r)
     {
         double temp=abs(di[mid].x-di[i].x);
         if(temp<=ret)wocao[++top]=i;
     }
     sort(wocao+,wocao+top+,com);
     re(i,,top)
         re(j,i+,top)
         {
             if(di[wocao[j]].y-di[wocao[i]].y>=ret)break;
             ret=min(ret,dis(di[wocao[i]],di[wocao[j]]));
         }
     top=;
     return ret;
 }
 int main()
 {
     while(~scanf("%d",&n)&&n)
     {
         re(i,,n)di[i].in();
         sort(di+,di+n+);
         printf("%.2f\n",mindis(,n)/);
     }
      return ;
 }