for (i = 0; i < N; ++i) {
		if (X[i] == Xb && Y[i] == Yb) {
        	printf("N%u=Nb\n", i + 1);
        	found_same = 1;
        	continue;
		}

        dist[i] = sqrt(pow(X[i] - Xb, 2) + pow(Y[i] - Yb, 2));

		printf("N%u(%d;%d) is %.2lf from Nb(%d;%d)\n", i + 1, X[i], Y[i], dist[i], Xb, Yb);

		if (!found_min || min > dist[i]) {
			found_min = 1;
			min = dist[i];
			min_i = i;
		}