## Search found 47 matches

Mon Jul 01, 2002 4:31 pm
Forum: Volume 1 (100-199)
Topic: 168 - Theseus and the Minotaur
Replies: 64
Views: 8175
!!!!! This would again be a case of invalid data. Actually, continuing that thought, it might look something more like this: A:B:C:D; And I'm assuming that we are interpreting this as, there is a pathway from A to B, and a pathway from C to D, but no pathway from B to C. Or would A:B:C; mean that th...
Mon Jul 01, 2002 12:36 pm
Forum: Volume 1 (100-199)
Topic: 168 - Theseus and the Minotaur
Replies: 64
Views: 8175
OK, while we're waiting to hear anything back from the problemset people about this, I keep hoping that the data is OK, but I haven't quite hit on the right idea. The meat of my program focuses on the theory that if Theseus and the Minotaur ever find themselves in two caverns that they have already ...
Mon Jun 24, 2002 7:35 pm
Forum: Volume 1 (100-199)
Topic: 103 - Stacking Boxes
Replies: 200
Views: 22055
Does anyone have any suggestions on tricky cases to try?
Mon Jun 24, 2002 4:45 pm
Forum: Volume 2 (200-299)
Topic: 291 - The House Of Santa Claus
Replies: 19
Views: 7087

### Problem 291: Problem description wrong

Although its fairly easy to determine valid answers on this problem, and the output specified provides the expected output format, it is also clear from the diagram that every single one of the output cases listed in the output is invalid using the diagram shown in the description.
Mon Jun 24, 2002 1:02 pm
Forum: Volume 1 (100-199)
Topic: 138 - Street Numbers
Replies: 93
Views: 7901
If you're not looking for record times, brute force can win the day, despite my previous postings. But, understand that if using integer variables, you will not be able to keep running totals. My brute force solution ran (accepted) in just over 2 seconds, with some simple modifications. Good luck. D...
Sun Jun 23, 2002 9:10 pm
Forum: Volume 1 (100-199)
Topic: 168 - Theseus and the Minotaur
Replies: 64
Views: 8175
Judge, please review the conversation about this problem on the Volume I board. There appear to be both description flaws and possible data issues with this problem. Please review this problem.
Sun Jun 23, 2002 9:08 pm
Forum: Volume 1 (100-199)
Topic: 168 - Theseus and the Minotaur
Replies: 64
Views: 8175
Very much, someone needs to look into this problem description. I've come to the conclusion that if Theseus and the Minotaur EVER in ANY of the inputs start out in separate caverns that are not connected by a two-way hallway, the program description does not provide enough information. The starting ...
Sun Jun 23, 2002 2:37 pm
Forum: Volume 1 (100-199)
Topic: 168 - Theseus and the Minotaur
Replies: 64
Views: 8175

### 168 Problem description wrong

For problem 168, it has become clear, both from my own testing, and through other contributors, that the description of the problem cannot be correct. As part of the problem description, it is clearly stated that no input line can be greater than 255 bytes. Evidently when new test cases were added, ...
Sun Jun 23, 2002 2:33 pm
Forum: Volume 1 (100-199)
Topic: 138 - Street Numbers
Replies: 93
Views: 7901
As stated, I went with the brute force method: #include <iostream.h> #include <iomanip.h> int main() { unsigned long LowTot = 10, House = 5, High = 7, HighTot = 13, Printouts = 0; while (Printouts < 10) { while (HighTot < LowTot) { High ++; HighTot += High; } if (HighTot == LowTot) { cout << setw(10...
Sun Jun 23, 2002 2:16 pm
Forum: Volume 1 (100-199)
Topic: 168 - Theseus and the Minotaur
Replies: 64
Views: 8175
Sorry about that one. The input for the second test was:

A:BC;B:A;C:D;D:A. A B 19[/img]
Sun Jun 23, 2002 2:07 pm
Forum: Volume 1 (100-199)
Topic: 168 - Theseus and the Minotaur
Replies: 64
Views: 8175
I got around the issue above by using vectors. See my code above. (I know the Includes didn't copy correctly. The two includes are <iostream.h> and <vector>. The end result, in the case above, is that in room A, the monster would try the rooms in this order: BCDE. I have hand computed a couple examp...
Sat Jun 22, 2002 5:36 pm
Forum: Other words
Topic: Suggestion: Make Source Code retrievable
Replies: 3
Views: 2382
An alternative, possibly easier to implement, would be to have the judge return a copy of the source code whenever a program is re-judged and determined to receive a different judgment -- whether the judgment is better or worse. Of course when the re-judgment does not changes the outcome, nothing wo...
Sat Jun 22, 2002 2:15 pm
Forum: Volume 1 (100-199)
Topic: 138 - Street Numbers
Replies: 93
Views: 7901
Yes, the brute force solution sounds great! But it doesn't execute well. Problem -- variables can't be made large enough. I was using unsigned long integers and didn't get the same solution as above, because the sums computed blew out the long integers! Some kind of formula is required here.
Fri Jun 21, 2002 9:40 pm
Forum: Volume 1 (100-199)
Topic: 168 - Theseus and the Minotaur
Replies: 64
Views: 8175
OK, I have confirmed that the problem is wrong, that 255 is NOT the maximum limit for a single line. It is less than 1000. k can be greater than 9, but I'm using the assumption that it can fit within a long variable. I have some ideas on where to go next. I don't want to say too much, but picture th...
Fri Jun 21, 2002 7:26 pm
Forum: Volume 1 (100-199)
Topic: 168 - Theseus and the Minotaur
Replies: 64
Views: 8175
OK, I had a few epiphanies about this problem. 1) (see my code above) Nothing dictates that the drop number be less than 10. Need to allow for any size of number for k! 2) In fact, k could be zero. The program doesn't tell us how to handle this, but I would assume that this meant that Theseus would ...