Cod sursa(job #1366164)

Utilizator morandy13Marian Andreea morandy13 Data 28 februarie 2015 20:20:10
Problema Cele mai apropiate puncte din plan Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.46 kb
#include<iostream.h>
#include<fstream.h>
#include<math.h>
ifstream fin ("cmap.in");
ofstream fout ("cmap.out");
struct coordonate 
{
	int x,y;
}v[101];
int i,j,n;
float min ,d;
int main ()
{
	fin>>n;
	float min=0;
	for(i=1;i<=n;i++)
		fin>>v[i].x>>v[i].y;
	for(i=1;i<n;i++)
	{
		for(j=i+1;j<=n;j++)
			d= sqrt( (v[i].x - v[j].x)*(v[i].x - v[j].x)+(v[i].y-v[j].y)*(v[i].y-v[j].y) );
			if( d  < min )
				min=d;
	}
	fout << min;
	return 0;
}