Search found 7 matches
Search found 7 matches • Page 1 of 1
- Mon Aug 06, 2007 9:19 am
- Forum: Volume 112 (11200-11299)
- Topic: 11251 - Fractions
- Replies: 4
- Views: 1985
My system is about twice as fast as the UvA judge. In my program where I pick the next digit I tried to both iterate both forward and backward. When I iterate forward it takes me 1654 seconds to compute the answers for all valid inputs. When I iterate backward I can do everything except (B=27,N=24) ...
- Wed Oct 04, 2006 3:24 am
- Forum: Volume 100 (10000-10099)
- Topic: 10058 - Jimmi's Riddles
- Replies: 22
- Views: 6186
Hi, I was wondering if someone might have some good testcases for my code. I was confused by: - the extra words that seem to be in the input (I chose to regard them as wrong rather than ignore them) - the apostroph in the output (I just copied it from the example output, even though it seems to have...
- Sat May 06, 2006 2:22 pm
- Forum: Volume 5 (500-599)
- Topic: 536 - Tree Recovery
- Replies: 19
- Views: 8040
Hi, My 536 passes the example testcase, but a submission results in a wrong answer. Does anybody have a hint or perhaps some nice testcases? The idea behind the code below is this: 1) The root is first element of the pre-order traversal 2) Everything left of the root in the in-order traversal belong...
- Wed Dec 21, 2005 5:38 pm
- Forum: ACM ICPC Archive Board
- Topic: 3300 "Can't be Judged"
- Replies: 1
- Views: 1496
Hi, I just wrote my first program for a problem in the Live Archive (problem 3300 - Snake Pit), but after submitting it said "can't be judged". I found somewhere it means there are no testdata available for this problem. Will they come? And if so, will I need to submit my code again? Kind regards, J...