OJ Board

Can any one help me by providing some more cases ....

Got RTE several times with my code....can any one help me by detecting the reason ....Here is my code...

#include<iostream>
#include<math.h>
using namespace std;
long n,m,i,j,f,t,p[10000];
double extra;
struct edge
{
long from;
long to;
double dist;
}edg[1000000];

struct node
{
long x;
long ...

Can anyone give me some critical cases for this problem?
can there be input like this: -000001234+ -200001 ?
both numbers will be non negative according to the problem statement...is it?

#include<iostream>
#include<queue>
#include<vector>
#define max 50

using namespace std;

vector <long> edge[max];
char node[max][10];
long color[max],dist[max],n;

long find_pos(char *name)
{
long pos=-1;
for(long i=0;i<=n;i++)
{
if(strcmp(name,node )==0)
{
pos=i;
break;
}
}
if(pos==-1 ...