OJ Board

Dear Larry,
Sorry for late reply. First of all your statement is not clear to me. I need the bridges of the graph. Not if there any bridge or not. Next, if I apply DFS it is O(V+E), but i have the limitation of O(E).
Naushad

Can anyone tell me how can i find the bridge(s) of a graph G in O(E) time.
Thanks in advance.
Naushad

unfortunately ur code gives sqrt: Domain error

i had tried earlier to do what u have told me. thanx for that. but that code is giving time limit exceed..... have a look... /* @JUDGE_ID: ******* 583 C++ "Naushad's Programming" */ /* "@BEGIN_OF_SOURCE_CODE" */ #include <stdio.h> #include <math.h> const long max = 50000; int prime[max], pr[max], q[...

i had done that. i checked upto sqrt of that number. but it is giiving time limit exceed. thats why i m confused.

can anyone tell me why 520 is giving me run time error......
regards,
naushad:-(

i have tried p583 to solve. but unfortunately it is giving time limit exceed i m confident with my answers. but it takes time. plz help if u can.
regards,
naushad:-)

can anyone tell me why my 530 is giving runtime error
regards,
naushad:-(

my big program :( 10194 giving un time error!! :cry: plz go through my code. and help if u can :o regards, naushad:-) /* @JUDGE_ID: 16916** 10194 C++ "Naushad's Programming" */ /* "@BEGIN_OF_SOURCE_CODE" */ #include<stdio.h> #include<string.h> #include<stdlib.h> #include<ctype.h> int strcmpti(char s...