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).
Search found 9 matches
Search found 9 matches • Page 1 of 1
- Wed Jul 31, 2002 8:00 am
- Forum: Volume 5 (500-599)
- Topic: 583 - Prime Factors
- Replies: 171
- Views: 38470
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[...
- Mon Jul 15, 2002 1:11 pm
- Forum: Volume 101 (10100-10199)
- Topic: 10194 - Football (aka Soccer)
- Replies: 119
- Views: 40235
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...