Pagini recente » Cod sursa (job #2278309) | Borderou de evaluare (job #663670) | Cod sursa (job #613789) | Cod sursa (job #1974261) | Cod sursa (job #830369)
Cod sursa(job #830369)
#include <algorithm>
#include <cmath>
#include <fstream>
#include <iostream>
#include <vector>
#include <iomanip>
using namespace std;
ifstream in("cmap.in");
ofstream out("cmap.out");
int n;
vector <pair<int,int > > v;
double min(double x,double y){
if(x<y)
return x;
return y;
}
int main(){
int i,x,y;
in>>n;
for(i=1;i<=n;++i){
in>>x>>y;
v.push_back(make_pair(x,y));
}
sort(v.begin(),v.end());
double result= 1000000000,aux;
int j;
for(i=0;i<n;++i){
for(j=i+1;j<n&&j<=i+7;++j){
aux=sqrt(double(pow((double)(v[i].first-v[j].first),double(2)))+double(pow((double)(v[i].second-v[j].second),double(2))));
result=min(result,aux);
}
}
out<<fixed<<setprecision(6)<<result;
return 0;
}
}