Search found 209 matches

by asif_rahman0
Wed Nov 14, 2007 5:16 pm
Forum: Algorithms
Topic: Suffix tree construction
Replies: 13
Views: 4422

Download http://www.emule.com/
emule then search this book. Hope you'll get it.
by asif_rahman0
Fri Nov 02, 2007 3:49 pm
Forum: Volume 113 (11300-11399)
Topic: 11324 - The Largest Clique
Replies: 11
Views: 6314

Thanks, got accepted. :)
by asif_rahman0
Thu Nov 01, 2007 4:07 pm
Forum: Volume 113 (11300-11399)
Topic: 11324 - The Largest Clique
Replies: 11
Views: 6314

OK. More test cases here. Please check this Input/output. Sorry for invalid cases. 10 42 468 35 41 18 17 13 1 41 21 36 6 14 28 8 30 14 15 40 19 10 31 39 28 41 35 34 27 21 30 30 13 30 31 22 5 6 8 26 25 18 40 33 10 34 3 22 26 30 23 12 9 29 40 4 8 30 40 20 23 11 12 15 37 37 35 11 39 29 11 21 34 15 10 1...
by asif_rahman0
Wed Oct 31, 2007 5:52 pm
Forum: Volume 113 (11300-11399)
Topic: 11324 - The Largest Clique
Replies: 11
Views: 6314

11324 - The Largest Clique

Someone please check my Input/Output. Input: 10 30 40 1 2 2 3 3 4 4 5 5 6 6 7 7 8 8 9 9 10 10 11 11 12 12 13 13 14 14 15 15 16 16 17 17 18 18 19 19 20 20 21 21 22 22 23 23 24 24 25 25 26 26 27 27 28 28 29 29 30 11 13 13 19 19 10 3 7 7 8 8 23 23 3 3 30 29 1 21 8 25 19 9 17 1 8 1 2 1 7 2 9 2 5 2 3 3 4...
by asif_rahman0
Sun Jul 15, 2007 5:05 am
Forum: Volume 112 (11200-11299)
Topic: 11240 - Antimonotonicity
Replies: 33
Views: 12102

Hints:
There are only two direction. One is '<' & another is '>'.
Then make a table with memo[N][2]. That's all.
by asif_rahman0
Sun Jun 24, 2007 9:14 pm
Forum: Volume 109 (10900-10999)
Topic: 10912 - Simple Minded Hashing
Replies: 24
Views: 14603

jan_holmes wrote:length is the current length, right ?
ya
....and what is level ? Thx
level means length here, also.
by asif_rahman0
Sun Jun 24, 2007 8:52 pm
Forum: Volume 109 (10900-10999)
Topic: 10912 - Simple Minded Hashing
Replies: 24
Views: 14603

jan_holmes wrote:I still do not understand about the recurrence relation for this problem. Is it 3-d array ?
Yes.

Code: Select all

function(char_index,length/level,sum)
by asif_rahman0
Tue Jun 12, 2007 12:01 pm
Forum: Volume 112 (11200-11299)
Topic: 11228 - Transportation system.
Replies: 30
Views: 12526

Thanks little joey. :) Got accepted! Though my output is different from you. Case #1: 1 425 0 Case #2: 1 551 0 Case #3: 1 598 0 Case #4: 1 0 0 Case #5: 1 338 0 Case #6: 1 628 0 Case #7: 1 0 0 Case #8: 1 650 0 Case #9: 1 686 0 Case #10: 1 423 0 Case #11: 1 438 0 Case #12: 1 637 0 Case #13: 1 588 0 Ca...
by asif_rahman0
Tue Jun 12, 2007 9:36 am
Forum: Volume 112 (11200-11299)
Topic: 11228 - Transportation system.
Replies: 30
Views: 12526

11228 - Transportation system.

Would someone check my I/O? Input: 20 41 131 38 72 69 80 68 65 22 96 67 49 61 51 87 63 24 66 83 80 60 71 52 64 60 90 31 49 99 23 11 94 24 25 15 51 39 13 97 67 76 19 33 12 18 99 35 92 0 74 71 95 33 39 32 39 45 37 71 57 5 95 24 71 8 86 54 51 24 74 70 75 63 33 99 29 94 58 13 52 99 35 57 46 71 189 3 17 ...
by asif_rahman0
Mon May 21, 2007 4:39 pm
Forum: Algorithms
Topic: a problem from spoj
Replies: 1
Views: 1829

This is a DP.

First generate a 2-dimensional table[N][N] for mixture of color A & B.

Then try Matrix-Chain-Multiplication idea for minimizing the smoke.

Recurrence is:

Code: Select all

res=MCM(i,k)+MCM(k,j) +(table[i][k-1]*table[k][j-1]])
by asif_rahman0
Fri May 04, 2007 10:55 pm
Forum: Volume 5 (500-599)
Topic: 580 - Critical Mass
Replies: 4
Views: 3198

You can solve it by Dynamic Programming.
by asif_rahman0
Thu Apr 26, 2007 2:14 pm
Forum: Volume 109 (10900-10999)
Topic: 10977 - Enchanted Forest
Replies: 42
Views: 17214

Hey,
You start row from 1 to r & coloumn from 1 to c.
Then why r u checking less than r & c? :-?
Yours:

Code: Select all

if (i>0 && i<r && j>0 &&j<c) 
Mine(accepted):

Code: Select all

if(i>=1&&j>=1&&i<=r&&j<=c) 
Just only one ERROR.

Please remove your code.
by asif_rahman0
Fri Apr 13, 2007 10:11 pm
Forum: Volume 109 (10900-10999)
Topic: 10977 - Enchanted Forest
Replies: 42
Views: 17214

Look at this part: ...... scanf("%d",&n); for (k=1;k<=n;k++) { scanf("%d %d %d",&p.x,&p.y,&l); int lr,lc; lr = p.x + l; lc = p.y + l; int ii = p.x-l; int jj = p.y-l; for (i=ii;i<=lr;i++) for (j=jj;j<=lc;j++) if(i>=1&&j>=1&&i<=r&&j<=c) if (( (p.x-i)*(p.x-i)+ (p.y-j)*(p.y-j) ) <= (l*l) ) map[i][j] = b...
by asif_rahman0
Fri Apr 06, 2007 10:57 pm
Forum: Volume 2 (200-299)
Topic: 269 - Counting Patterns
Replies: 13
Views: 5557

If (2,-1,0,-1) & (2,0,-1,-1) is valid then why (2,-1,-1,0) not valid?

Can anybody tell me!
:( I dont understand it.

Go to advanced search