Cod sursa(job #435857)

Utilizator MciprianMMciprianM MciprianM Data 7 aprilie 2010 22:04:59
Problema Cele mai apropiate puncte din plan Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.55 kb
#include<cmath>
#include<cstdio>
using namespace std;
int n;
int x[100001], y[100001];
double dist(int a, int b){
	double d=(x[a]-x[b])*(x[a]-x[b])+(y[a]-y[b])*(y[a]-y[b]);
	d=sqrt(d);
	return d;
}
int main(){
	int i, j;
	double d, dm;
	FILE *f, *g;
	f=fopen("cmap.in","r");
	g=fopen("cmap.out","w");
	fscanf(f, "%d", &n);
	for(i=0;i<n;i++)
		fscanf(f, "%d%d", &x[i], &y[i]);
	fclose(f);
	dm=2000000000;
	for(i=0;i<n;i++)
		for(j=i+1;j<n;j++){
			d=dist(i,j);
			if(d<dm)	dm=d;
		}
	fprintf(g, "%.7lf\n", dm);
	fclose(g);
	return 0;
}