Search found 44 matches
- Mon Oct 08, 2007 7:19 pm
- Forum: Volume 8 (800-899)
- Topic: 829 - Almost Balanced Trees
- Replies: 16
- Views: 9271
-almost well balanced: abs(mindepth(root)-maxdepth(root)) <= 1 -one tree per line -remeber to output -del in case of delete! (that's what got me AC) note to judge, I have received rank 1 on this problem.. even though other's have solved it in 0.000 before me... is this do to memory usage that I am n...
- Sat Jul 14, 2007 11:56 pm
- Forum: Volume 9 (900-999)
- Topic: 902 - Password Search
- Replies: 68
- Views: 33656
I used hashing.. I tried TRIES, they would have been fast if I had been able to use fixed links and not get MLE. Anyway tho, hashing is fast enough.. and if you get the right hashing function (i.e. one of the more sensible obvious ones), you can avoid key errors while using unsigned int's. Also... I...
- Sun Jul 01, 2007 3:10 pm
- Forum: Volume 7 (700-799)
- Topic: 723 - Comment Removal
- Replies: 16
- Views: 10545
My program passes all the test cases here (the good ones anyway) My questions are: - Do we remove all trailing spaces from the end of a line? - If the last line in the file does not end with a \n, should a \n be displayed? - In pascal, this is a valid comment: { *).. not here? - This sounds kinda du...
- Thu Jun 28, 2007 4:28 am
- Forum: C
- Topic: Illegal Instruction (SIGILL)
- Replies: 3
- Views: 5139
- Sun Jun 17, 2007 1:45 am
- Forum: Volume 3 (300-399)
- Topic: 303 - Pipe
- Replies: 5
- Views: 1728
You know... I always find it ironic that almost every time I post for help, I then solve in a few minutes later. (This is one of those times).. I used a value of EPS around 0.0000001, and doubles... and that gave me the AC (giving away too much? I think EPS should have been stated in the problem sta...
- Sun Jun 17, 2007 1:34 am
- Forum: Volume 3 (300-399)
- Topic: 303 - Pipe
- Replies: 5
- Views: 1728
I'm also getting WA... However in my tests, our programs produce the same result, with the exception of this test case: 20 0 .5 10 -.5 20 .5 30 -.5 40 .5 50 -.5 60 .5 70 -.5 80 .5 90 -.5 100 .5 110 -.5 120 .5 130 -.5 140 .5 150 -.5 160 .5 170 -.5 180 .5 190 -.5 The only solution too this, is a horiz...
- Thu Jun 07, 2007 1:57 am
- Forum: Volume 112 (11200-11299)
- Topic: 11214 - Guarding the Chessboard
- Replies: 13
- Views: 5086
- Thu Jun 07, 2007 1:22 am
- Forum: Volume 112 (11200-11299)
- Topic: 11214 - Guarding the Chessboard
- Replies: 13
- Views: 5086
- Thu Jun 07, 2007 1:14 am
- Forum: Volume 112 (11200-11299)
- Topic: 11214 - Guarding the Chessboard
- Replies: 13
- Views: 5086
- Thu Jun 07, 2007 12:58 am
- Forum: Volume 112 (11200-11299)
- Topic: 11214 - Guarding the Chessboard
- Replies: 13
- Views: 5086
- Thu Jun 07, 2007 12:09 am
- Forum: Volume 112 (11200-11299)
- Topic: 11214 - Guarding the Chessboard
- Replies: 13
- Views: 5086
(Oops... last time I was here there wasn't a post, ah well... might as well delete my old one) I'm getting WA.. can someone explain why my algorithm won't work? It is.. minQueens = 0 While boardNotEmpty: PlaceQueenWhichEliminatesLargestNumberOfX's EliminateX'sForThatQueen minQueens ++ Loop. Judging ...
- Sat May 26, 2007 11:21 pm
- Forum: Volume 107 (10700-10799)
- Topic: 10715 - Cat
- Replies: 11
- Views: 7117
- Sun May 13, 2007 12:40 am
- Forum: Volume 4 (400-499)
- Topic: 474 - Heads / Tails Probability
- Replies: 50
- Views: 12264
- Wed Apr 25, 2007 1:13 am
- Forum: Volume 100 (10000-10099)
- Topic: 10023 - Square root
- Replies: 121
- Views: 30526
bigInt... Large base = more speed? (10023)
I recently solved 10023 (sqrt) using a method described in the forms, and my bigInt class used base 10 digits, in a time of about 5 seconds -- It's seems pretty obvious too me, that if I had used a higher base (i.e. base 10^9) -- it would have greatly increased the speed of addition and subtraction,...
- Mon Apr 23, 2007 8:57 pm
- Forum: Algorithms
- Topic: Traveling Salesman Problem .. MST or not?
- Replies: 5
- Views: 3028