Cod sursa(job #1041979)

Utilizator AllxCucuCucu Alexandru AllxCucu Data 26 noiembrie 2013 13:49:05
Problema Cele mai apropiate puncte din plan Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.66 kb
#include <iostream>
#include <cmath>
#include <iomanip>
using namespace std;
int write(float p)
{
    char q='s';
    while(q!='q')
    {
                   std::cout << std::setprecision(8) << p << '\n';
                   cin>>q;
                   }
                   return 0;
                   }
int main()
{
int v[1001][2],n,i,j;
float s,p;
cin>>n;
for(i=1; i<=n; i++) 
cin>>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;
}
write(p);

return 0;
}