Cod sursa(job #1091286)

Utilizator Tuddy18Tolciu Tudor Tuddy18 Data 25 ianuarie 2014 15:59:20
Problema Cele mai apropiate puncte din plan Scor 20
Compilator cpp Status done
Runda Arhiva educationala Marime 0.8 kb
#include <stdio.h>
#include <fstream>
#include <math.h>
using namespace std;
ifstream fin("cmap.in");
ofstream fout("cmap.out");
//FILE * fin, *fout;
long long x[100000],y[100000];
int n;
double minim=1e10;
int main()
{
    //fin = fopen("cmap.in","rt");
    //fout = fopen("cmap.out","wt");
    fin>>n;
    //fscanf(fin,"%d",&n);
    for(int i=1;i<=n;i++)
    {

        fin>>x[i]>>y[i];
        //int bufx,bufy;
        //fscanf(fin,"%d%d",&bufx,&bufy);
        //x[i] = bufx, y[i] = bufy;
    }
    for(int i=1;i<=n;i++)
    for(int j=i+1;j<=n;j++)
    {
        long long a=(x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j]);
        if(sqrt(a)<minim)
            minim=sqrt(a);
    }
    fout.precision(20);
    fout<<minim<<endl;
    //fprintf(fout,"%fl",minim);
    return 0;
}