Cod sursa(job #2394775)

Utilizator lucianistratiIstrati Lucian lucianistrati Data 1 aprilie 2019 22:05:14
Problema Cele mai apropiate puncte din plan Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.83 kb
#include <iostream>
#include <fstream>
#include <bits/stdc++.h>
#include <map>
using namespace std;
vector <pair<int,int>> v;
double dist(pair <int,int> a,pair<int,int> b)
{
    int p1x=a.first;
    int p1y=a.second;
    int p2x=b.first;
    int p2y=b.second;
    return sqrt((double)((long long)((long long)p1x-p2x)*(p1x-p2x)+(long long)((long long)p1y-p2y)*(p1y-p2y)));
}
int main()
{

    ifstream fin("cmap.in");
    ofstream fout("cmap.out");
    int n,i,j,a,b;
    double f;
    double min=999999999;
    fin>>n;
    for(i=1;i<=n;i++)
    {
        fin>>a>>b;
        v.push_back(make_pair(a,b));
    }
    for(i=0;i<=n-2;i++)
    {for(j=i+1;j<=n-1;j++)

       f=dist(v[i],v[j]);
       if(f<min)
       {
           min=f;
       }
    }
    fout<<min;
    fin.close();
    fout.close();
    return 0;
}