OJ Board

i think u have made the problem more critical than it is

simply initialize the cost matrix like this

//cost[][] is of double type
for(i=0;i<n;i++)
for(j=0;j<n;j++)
cost[j]=sqrt(pow((A.x-A[j].x),2) + pow((A.y-A[j].y),2))

your FW seems nice

:evil: WA in 00.000 sec after 15th submission :evil:

Have i code simply nothing? it generates WA in zero sec.
Would anyone plz help...?

here is my C code:

/*identifying concurrent events*/

#include <stdio.h>
#include <string.h>
#include <memory.h>

#define size 120

char events[size][10];
int ...