uva 10245 The Closest Pair Problem_枚举

#include <iostream>
#include<cstdio>
#include<cmath>
using namespace std;
#define N 10010
struct node{
double x,y;
}p
;
int main(int argc, char** argv) {
int n,i,j;
double mdist,tmp;
while(scanf("%d",&n)&&n){
for(i=0;i<n;i++){
scanf("%lf%lf",&p[i].x,&p[i].y);
}
mdist=0xfffffff;
for(i=0;i<n;i++){
for(j=i+1;j<n;j++){
tmp=(p[i].x-p[j].x)*(p[i].x-p[j].x)+(p[i].y-p[j].y)*(p[i].y-p[j].y);
mdist=min(mdist,tmp);
}
}
mdist=sqrt(mdist);
if(mdist>=10000)
printf("INFINITY\n");
else
printf("%.4lf\n",mdist);

}
return 0;
}