Cod sursa(job #1366203)

Utilizator morandy13Marian Andreea morandy13 Data 28 februarie 2015 20:41:41
Problema Cele mai apropiate puncte din plan Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.5 kb
#include<iostream>
#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,d1,d2;
float min ,d;
int main ()
{
	fin>>n;
	float min=100000;
	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++)
		{
			d1= (v[j].x-v[i].x ) * (v[j].x-v[i].x );
		d2=(v[j].y-v[i].y ) * (v[j].y-v[i].y );
			d= sqrt( d1+d2 );
		}
			if( d  < min )
				min=d;
	}
	fout << min;
	return 0;
}