Cod sursa(job #474919)
Utilizator | UPB-Oprea-Cosmin-Dumitru batista | Data | 5 august 2010 15:45:46 |
---|---|---|---|
Problema | Cele mai apropiate puncte din plan | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include<cstdio>
#include<cmath>
#include<algorithm>
using namespace std;
int main()
{long a[1000],b[1000],i,n,k=0,j;float c[1000000],d=0;
freopen("cmap.in","r",stdin);freopen("cmap.out","w",stdout);
scanf("%ld",&n);
for(i=0;i<n;i++)
scanf("%ld %ld",&a[i],&b[i]);
for(i=0;i<n-1;i++)
for(j=i+1;j<n;j++)
{c[k]=sqrtl((a[i]-a[j])*(a[i]-a[j])+(b[i]-b[j])*(b[i]-b[j]));k++;}
d=(float)*min_element(c,c+(k-1));
printf("%.*f",6,d);
return 0;}