## Search found 9 matches

Mon May 05, 2003 12:09 am
Forum: Algorithms
Topic: bridge in O(E) time?
Replies: 10
Views: 4018

### bridge in O(E)

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).
Tue Apr 29, 2003 7:39 pm
Forum: Algorithms
Topic: bridge in O(E) time?
Replies: 10
Views: 4018

### bridge in O(E) time?

Can anyone tell me how can i find the bridge(s) of a graph G in O(E) time.
Thu Aug 01, 2002 1:44 pm
Forum: Volume 5 (500-599)
Topic: 583 - Prime Factors
Replies: 171
Views: 37266
unfortunately ur code gives sqrt: Domain error
Wed Jul 31, 2002 8:00 am
Forum: Volume 5 (500-599)
Topic: 583 - Prime Factors
Replies: 171
Views: 37266
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[...
Fri Jul 26, 2002 4:44 pm
Forum: Volume 5 (500-599)
Topic: 583 - Prime Factors
Replies: 171
Views: 37266
i had done that. i checked upto sqrt of that number. but it is giiving time limit exceed. thats why i m confused.
Wed Jul 24, 2002 8:52 pm
Forum: Volume 5 (500-599)
Topic: 530 - Binomial Showdown
Replies: 137
Views: 33656

### 530

can anyone tell me why 520 is giving me run time error......
regards,
Wed Jul 24, 2002 8:51 pm
Forum: Volume 5 (500-599)
Topic: 583 - Prime Factors
Replies: 171
Views: 37266

### 583

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,
Wed Jul 24, 2002 8:47 pm
Forum: Volume 5 (500-599)
Topic: 530 - Binomial Showdown
Replies: 137
Views: 33656

### 530

can anyone tell me why my 530 is giving runtime error
regards,