OJ Board

Read the problem statement and input carefully..........@ Each integers in the input is 32 bit signed integer!!!!!!!!!!!!

You have defined MAX only 100009............when executing arraya[p]++ or arrayb[p]++ it occurs array overflow for those cases where the value of p is more than 100009 ...

If there is only one rally point in the given map and also itself a farthest point then what will be the correct result.....
suppose for
1
6 5
6 1 1
6 2 1
6 3 1
6 4 1
6 5 1

what will be the output ???and plz give me some sample input output.........

#include<stdio.h>

long A[1100][1100],B[1100][1100],check[1100];
long node;
void init(void)
{
long i,j;

for(i=0;i<node;i++)
{
check =0;
for(j=0;j<node;j++)
{
if(i==j)
{
A [j]=0;
B [j]=0;
}
else
{
A [j]=10000000;
B [j]=10000000;
}
}
}
return;
}

void warshall(void)
{
long k,i,j ...

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

#define MAX 100010
#define LEN 20

struct List
{
char s[LEN+1];
char t[LEN+1];
}list[MAX];

long M;
char map[10005][100],temp[10000],buf[10000],str[10000];
double mat[10005][10]={0};

int sort_function( const void *a, const void *b ...