## Search found 7 matches

Sat Apr 17, 2004 10:07 am
Forum: Volume 6 (600-699)
Topic: 601 - The PATH
Replies: 20
Views: 8372
do u use dfs, bfs? or other algorithm? posting the code might help ^.^ hehheheh
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: 8188
it's funny 2 find out that ur program is completely perfect (even no problem with the -9999), the only reason why it's WA is ur using the wrong bracket. replace the bracket: "{}" with "()" and done...

next time, use glasses. u maybe need 1. =) hehhehe..
Sat Apr 17, 2004 7:36 am
Forum: Volume 101 (10100-10199)
Topic: 10171 - Meeting Prof. Miguel...
Replies: 68
Views: 24624
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
Replies: 5
Views: 1516
thx dude, that kinda explain things clearer 2 me.

but for the array MAXVALUE, should i create array sized [MAXDEPTH]
[-32000 to 32000] isn't is quite big stuf?
Wed Apr 14, 2004 12:36 am
Forum: Algorithms
Replies: 5
Views: 1516
i know this 1 is a stupid question, but enlight me =P "how to memorize the recursion result at level N into array and effectively prune when encountering repeated recursion" somehow i'm still not sure bout the data representation for storing the result.... :roll: and effectively checking it if it's ...
Tue Apr 13, 2004 12:38 pm
Forum: Algorithms
Replies: 5
Views: 1516