Cod sursa(job #2165073)

Utilizator SofeiAndreiSofei Andrei SofeiAndrei Data 13 martie 2018 11:06:04
Problema Cele mai apropiate puncte din plan Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.61 kb
#include <iostream>
#include <fstream>
#include <climits>
#include <cmath>
#include <iomanip>
using namespace std;
ifstream f("cmap.in");
ofstream g("cmap.out");
int i,j,n;
float Min,N;
float x[100001],y[100001];
int main ()
{
    f>>n;
    for(i=1;i<=n;i++){
        f>>x[i]>>y[i];
    }
    Min=INT_MAX;
    for(i=1;i<n;i++){
        for(j=i+1;j<=n;j++){
            if((x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j])<Min){
                Min=(x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j]);
            }
        }
    }
    N=sqrt(Min);
    g<<fixed<<setprecision(6)<<N;
    return 0;
}