Mai intai trebuie sa te autentifici.
Cod sursa(job #1021544)
Utilizator | Data | 3 noiembrie 2013 22:52:25 | |
---|---|---|---|
Problema | Cele mai apropiate puncte din plan | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include <fstream>
#include <cmath>
using namespace std;
ifstream f("cmap.in");
ofstream g("cmap.out");
int main()
{
int v[1001][2],n,i,j;
float s,p;
f>>n;
for(i=1; i<=n; i++) f>>v[i][0]>>v[i][1];
p=sqrt((v[1][0]-v[2][0])*(v[1][0]-v[2][0])+(v[1][1]-v[2][1])*(v[1][1]-v[2][1]));
for(i=1; i<n; i++)
for(j=i+1; j<=n; j++)
{
s=sqrt((v[i][0]-v[j][0])*(v[i][0]-v[j][0])+(v[i][1]-v[j][1])*(v[i][1]-v[j][1]));
if(p>s) p=s;
}
g<<p<<'\n';
return 0;
}