Cod sursa(job #1017175)

Utilizator impulseBagu Alexandru impulse Data 27 octombrie 2013 13:47:15
Problema Cele mai apropiate puncte din plan Scor 0
Compilator c Status done
Runda Arhiva educationala Marime 0.68 kb
#include <stdio.h>
#include <math.h>

inline double dist(int x, int y, int x2, int y2)
{
    return sqrt((x2 - x) * (x2 - x) + (y2 - y) * (y2 - y));
}

int main()
{
    int n, *a, *b;
    FILE *fin = fopen("cmap.in", "r");
    fscanf(fin, "%d", &n);
    a = malloc(n * sizeof(int));
    b = malloc(n * sizeof(int));
    int i, j;
    for(i = 0; i < n; i++)
        fscanf(fin, "%d %d", a + i, b + i);
    double mDist = 0x3f3f3f3f3f, cDist;
    for(i = 0; i < n; i++)
        for(j = i + 1; j < n; j++)
            if((cDist = dist(a[i],b[i],a[j],b[j])) < mDist)
                mDist = cDist;
    FILE *fout = fopen("cmap.out", "w");
    fprintf(fout, "%6f", mDist);
}