UVa OJ Board

I solved this problem using Dijkstra and Differentiation.....

After a quick overview i found a bug to your problem. you take the input N and R and instead of taking R roads you are taking N roads of information. However if you correct this i think you will get tle....... In the warshall() function u used a loop for( double x = 0.00; x <= v[z][l]; x += eps ) wh...

Any idea how to solve this problem??
Thanks in advance.

hi nayimsust, i checked your code.just use memset or initialize ur mat[][] variable before your while loop and u will be ok.
And try to do simple codes.

hi everyone,i am getting run time error a lot in this prob. could anyone check my code to tell the cause of wa. //code here #include<stdio.h> #include<stdlib.h> #define inf 100000 int fire[1005][1005],min; char input[1005][1005]; int row,col,que[1000005][3],r[]={0,0,-1,1},c[]={-1,1,0,0}; void BFS(in...

hi everyone, i m getting wa in this problem many times.can anyone give me some critical input outputs.Thnx in advance.

hi,could anyone give some input,for that my prog goes wrong.Thnx in advance. #include<stdio.h> #include<string.h> int main() { int n,i,j,total,used[30][30],flag,num=1,max,len; char input[30][30]; while(scanf("%d",&n)==1) { for(i=0,max=0;i<n;i++) { scanf("%s",input ); len=strlen(input ); if(len>max) ...

i m getting wa wa wa! could anyone check and tell my errors. here is my code- #include<stdio.h> #include<string.h> #include<ctype.h> int main() { int value[258],ascii[258],frq[130],i,j,k,tmp,start=0,len; char input[1000]; while(gets(input)!=NULL) { if(start) printf("\n"); start=1; for(i=0;i<258;i++)...

hi MRH thanks for ur help.

hi,i m getting wa in this input.i dont understand my fault.could anybody check my prog. #include<stdio.h> int main() { int a[13],n,total[14],k=1,i; bool flag[13]; while(scanf("%d",&n)==1) { if(n<0) break; total[1]=n; for(i=1;i<13;i++) { scanf("%d",&a ); total[i+1]=total +a ; flag =false; } for(i=1;i...