#include #include #define NUM 100 double dist(double *, double *); void main(void) { int i, j; double p[NUM][2]; // NUM個の点の配列 double min = 1.0e100; // 暫定的最小値 (初期値はきわめて大きな数) for (i = 0; i < NUM; i++) scanf("%lf %lf", &p[i][0], &p[i][1]); // (空欄) // printf("Shortest distance = %lf\n", min); } double dist(double p0[], double p1[]) { return(sqrt((p0[0] - p1[0]) * (p0[0] - p1[0]) + (p0[1] - p1[1]) * (p0[1] - p1[1]))); }