Cod sursa(job #2689573)

Utilizator Xutzu358Ignat Alex Xutzu358 Data 21 decembrie 2020 13:41:46
Problema Cele mai apropiate puncte din plan Scor 20
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.56 kb
#include <bits/stdc++.h>
using namespace std;

ifstream f("cmap.in");
ofstream g("cmap.out");

int n;
pair < long long , long long > v[100005];
long long dmin=LLONG_MAX;

int main()
{
    f >> n;
    for (int i=1;i<=n;i++) {
        f >> v[i].first >> v[i].second;
    }
    for (int i=1;i<n;i++) {
        for (int j=i+1;j<=n;j++) {
            dmin = min(dmin,(v[j].first-v[i].first)*(v[j].first-v[i].first)+(v[j].second-v[i].second)*(v[j].second-v[i].second));
        }
    }
    g << fixed <<  setprecision(6) << sqrt(dmin);
    return 0;
}