Cod sursa(job #1091255)

Utilizator Tuddy18Tolciu Tudor Tuddy18 Data 25 ianuarie 2014 15:34:35
Problema Cele mai apropiate puncte din plan Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.57 kb
#include <iostream>
#include <fstream>
#include <math.h>
using namespace std;
ifstream fin("cmap.in");
ofstream fout("cmap.out");
long long x[100000],y[100000];
int n;
long long minim=1000000000;
int main()
{
    fin>>n;
    for(int i=1;i<=n;i++)
    {
        fin>>x[i]>>y[i];
    }
    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(a<minim)
        minim=a;
    }
    fout.precision(14);
    double minimreal = minim;
    fout<<sqrt(minimreal);
    return 0;
}