Search found 7 matches
- Sat Apr 17, 2004 10:07 am
- Forum: Volume 6 (600-699)
- Topic: 601 - The PATH
- Replies: 20
- Views: 9804
- Sat Apr 17, 2004 9:37 am
- Forum: Volume 6 (600-699)
- Topic: 677 - All Walks of length "n" from the first node
- Replies: 17
- Views: 9864
- Sat Apr 17, 2004 7:36 am
- Forum: Volume 101 (10100-10199)
- Topic: 10171 - Meeting Prof. Miguel...
- Replies: 68
- Views: 32604
i'm a bit confused about printing the lexographical order of possible places. consider this test case: 2 Y B A B 2 M B B A 5 A B Would the output should be: 2 B A -> B is printed first because the minimum energy is 2, or: 2 A B -> print the minimum energy, afterwards all the possible places in lexog...
- Fri Apr 16, 2004 4:04 pm
- Forum: Algorithms
- Topic: Bright Answer Required!! Please Help....
- Replies: 5
- Views: 1956
- Wed Apr 14, 2004 12:36 am
- Forum: Algorithms
- Topic: Bright Answer Required!! Please Help....
- Replies: 5
- Views: 1956
- Tue Apr 13, 2004 12:38 pm
- Forum: Algorithms
- Topic: Bright Answer Required!! Please Help....
- Replies: 5
- Views: 1956
Bright Answer Required!! Please Help....
How to 'EASILY' and 'EFFECTIVELY' determine in backtracking/dfs, if we had repeat the same pattern/configuration. Do we have to check it only at certain depth?? and how to store the repeated pattern??? and how can we make sure if we encounter this same pattern, e.g at level depth N, it would not pre...
- Fri Apr 02, 2004 11:46 am
- Forum: Volume 101 (10100-10199)
- Topic: 10193 - All You Need Is Love
- Replies: 23
- Views: 12709
still active this topic??
just find if exist a gcd(a,b) between the 2 numbers. convert it 2 decimal first. easy ain't it?