Cod sursa(job #1769469)

Utilizator Mihaibv13Mihai Stoian Mihaibv13 Data 2 octombrie 2016 16:18:23
Problema Cele mai apropiate puncte din plan Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.79 kb
#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 = 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);

     }


     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=1;i<=k;i++)
{
    if(y[i]!=0) {  printf("%f",y[i]);  return 0; }
}


    return 0;
}