Cod sursa(job #435847)

Utilizator MciprianMMciprianM MciprianM Data 7 aprilie 2010 22:01:59
Problema Cele mai apropiate puncte din plan Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.49 kb
#include<fstream>
#include<cmath>
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;
	ifstream f("cmap.in");
	f>>n;
	for(i=0;i<n;i++)
		f>>x[i]>>y[i];
	f.close();
	dm=2000000000;
	for(i=0;i<n;i++)
		for(j=i+1;j<n;j++){
			d=dist(i,j);
			if(d<dm)	dm=d;
		}
	ofstream g("cmap.out");
	g<<dm<<'\n';
	g.close();
	return 0;
}