Minimum Distance of Towns

#include <stdio.h>
#include <stdlib.h>
#include <time.h>
#include <math.h>

#define n 10

void find_dist(double a[],int *city,double *min){
	int count=0;
	double temp[5]={0.0};

	srand((unsigned int)time(0));

	for(int i=0;i<n;i++)
	a[i]=(double)(rand()%999);

	for(int k=0;k<n;k+=2){
		for(int j=0;j<n;j+=2)
			if(k!=j){
			temp[count]+=pow((pow(a[k]-a[j],2.0)+pow(a[k+1]-a[j+1],2.0)),0.5);
			}count++;
	}

	for(int j=0;j<5;j++)
		printf("%4.4lf\n",temp[j]);printf("\n\n");

	*min=temp[4];*city=5;
			for(int k=0;k<n/2;k++)
				if(*min>temp[k])
					{*min=temp[k];
			*city=k+1;}
}

int main(){

	int t=0,*city=&t;
	double a[n]={0.0},r=0.0,*min=&r;

	find_dist(a,&t,&r);

	for(int i=0;i<n;i++)
		printf("%3.3lf\n",a[i]);
	printf("the city with the minimum distance is%2d with total distance %3.3lf\n",*city,*min);

	return 0;
}