Cod sursa(job #1017937)

Utilizator leontinLeontin leontin Data 28 octombrie 2013 17:31:18
Problema Cele mai apropiate puncte din plan Scor 20
Compilator cpp Status done
Runda Arhiva educationala Marime 0.79 kb
#include <iostream>
#include <fstream>
#include <math.h>
#include <iomanip>
 
using namespace std;
 
ifstream f("cmap.in");
ofstream g("cmap.out");
int main()
{
	 double uraaa;
    long n,i,j,a[10000],b[10000];
  
    
    f>>n;
    double multum=-1;
    for(i=0;i<n;i++)
        f>>a[i]>>b[i];
    for(i=0;i<n;i++)
        for(j=0;j<n;j++){
            if(i!=j){
                uraaa=sqrt(pow((a[i]-a[j]),2.0)+pow((b[i]-b[j]),2.0));
                if(multum==-1)
                    multum=uraaa;
                if(uraaa<multum)
                    multum=uraaa;
            }
        }
    long nr=(long)multum;
    long cifre=0;
    while(nr>0){
        cifre++;
        nr/=10;
    }
    g<<setprecision(cifre+6)<<multum;
	f.close();
	g.close();
    return 0;
}