Pagini recente » Cod sursa (job #593915) | Cod sursa (job #1021351) | Cod sursa (job #641280) | Cod sursa (job #2584820) | Cod sursa (job #1769955)
#include <iostream>
#include <cstdio>
#include <math.h>
#include <algorithm>
using namespace std;
int n;
pair <int,int> v[100000];
double y[100000];
double kalcul(int a,int b)
{
double y;
y = (double)sqrt( ( v[a].first - v[b].first ) * ( v[a].first - v[b].first ) +
( v[a].second - v[b].second ) * ( v[a].second - v[b].second ) );
return y;
}
int main()
{
FILE *f=fopen("cmap.in","r");
FILE *g=fopen("cmap.out","w");
fscanf(f,"%d",&n);
for(int i=1;i<=n;i++)
{
fscanf(f,"%d%d",&v[i].first,&v[i].second);
}
sort(v,v+n);
if(n>10) n=10;
int k=0;
for(int i=1;i<=n;i++)
{ for(int j=1;j<=n;j++)
y[++k]=kalcul(i,j);
}
sort(y,y+k);
for(int i=0;i<=n;i++)
{
if(y[i]!=0) { fprintf(g,"%f",y[i]); return 0;}
}
return 0;
}