najbliza tacka elegancija

#include <stdio.h>
#include <math.h>
#define MAX 30


struct tacka {
    float x;
    float y;
};

float mod(struct tacka a) { return sqrt(pow(a.x, 2)+pow(a.y, 2)); }

int cmp(struct tacka a, struct tacka b) {
    if(mod(a) < mod(b))
        return 1;
    else
        return 0;
}

int input(struct tacka niz[])
{   int i=0;

    FILE *fin=fopen("nesto.txt", "r");


        while ((fscanf(fin, "%f, %f", &niz[i].x, &niz[i].y))!=EOF){
        i++;}
        return i;

}

void output(struct tacka niz[], int n)
{
    struct tacka min;
    min.x = niz[0].x;
    min.y = niz[0].y;
    int i;
    for(i = 1; i < n ; i++) {
        if(cmp(niz[i], min))
        {
            min.x = niz[i].x;
            min.y = niz[i].y;
        }

    }
    FILE *pf = fopen("ispis.txt", "w");

    fprintf(pf, "Tacka najbliza koordinatnom pocetku je: %.2f, %.2f\n", min.x, min.y);
    fclose(pf);
    printf("Tacka najbliza koordinatnom pocetku je: %.2f, %.2f\n", min.x, min.y);
}

int main()
{
    struct tacka niz[MAX];
    int n;
    n = input(niz);
    output(niz, n);


    return 0;
}