Cod sursa(job #1447841)

Utilizator infoprof6Mironescu Valeriu infoprof6 Data 5 iunie 2015 16:23:26
Problema Cele mai apropiate puncte din plan Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.69 kb
#include<fstream>
#include<math.h>
#define nmax 100002
using namespace std;

struct point{int x,y;} v[nmax];

double dist(point p1, point p2)
{return (double)((long long)((long long)p1.x-p2.x)*(p1.x-p2.x)+(long long)((long long)p1.y-p2.y)*(p1.y-p2.y));}

int main()
{   int n,i,j,ci,cj;  double d, min=1000000000.0;
    ifstream f("cmap.in");
    ofstream g("cmap.out");
    f>>n;
    for(i=1;i<=n;i++)
        f>>v[i].x>>v[i].y;
    for(i=1;i<n;i++)
        for(j=i+1;j<=n;j++)
          { d=dist(v[i],v[j]);
            if(d<min) {ci=i; cj=j; min=d;}
          }
    g<<sqrt(min);
//  printf("%lf\n(%d %d) (%d %d)",dist(v[ci],v[cj]),v[ci].x,v[ci].y,v[cj].x,v[cj].y);
    return 0;
}