OJ Board

How about a link to this forum / electronic board on the new site?

OK -- posting my code is not my favorite option, but I'm at a loss for what is happening here. I run this on my Ubuntu Linux box with gcc / g++ 4.2 and everything works fine. I submit it to the judge, and he tells me Runtime Error. Admittedly -- C++ is not my primary programming language, so if ...

Waah! I was wrong. I just reread the problem. According to their "Algorithm", the smallest disk should alwasy move from A to B to C back to A. So, for an even number of disks, the disks will all end up on peg C. For an odd number of disks, the disks will all end up on peg B.

That violates the ...

Couple hints:
On the old Online Judge site, there is a link entitled "Methods to Solve" that gives some helpful advice on many problems. One thing it points out is that this is best solved with bit manipulation. Which makes sense.

Think on this: the smallest ring moves every other turn. If there ...

Yup! That was my problem. Hmm. That should have happened in Unit Test too. Oh, well. I'm accepted now. Thanks!

Ok, this worked on my Debian Linux box, using the 3.3 GNU compilers, but Judge is giving me a runtime error:

Your program has died with signal 8 (SIGFPE). Meaning:

Floating point exception

Before crash, it ran during 0.000 seconds.

[cpp]
// Problem solved. Code removed from board.
[/cpp ...

This is probably not the best algorithm -- but it should work.

Create a 20001 integerarray. Set all values to 0 initially.

As you read in each triplet, add 10000 to the starting and ending coordinates in the triple. This takes care of any cases where buildings are specified with negative start or ...

See my response in this other post:
http://acm.uva.es/board/viewtopic.php?t=1406

Here's a general idea of this problem:

1) The order of the dimensions isn't important, so feel free to sort the dimensions of the box as you read it in. Since the dimensionality doesn't exceed 10, insert sorting is an easy to use method.

2) I sorted my boxes also, based on the first dimension ...

I apologize. I misinterpreted your earlier message. Thank you for pointing that out to me. I'm assuming then that
a) They corrected the data and
b) Did a rejudgment without communictating with us.
(Normally when a rejudgment occurs and it changes the result of a submission, we receive email ...

So, documented bad problem description = my laziness? No, that doesn't seem right. Documented bad input data = my laziness? Hmm, that doesn't seem right either.

OK, here's the kicker -- I see some people have actually been accepted recently. Anyone want to share any secrets on what assumptions need to be made? Maybe what corrections need to be made to the problem description?

This is why we have Search functionality on this board. Before submitting a new thread, its always a good idea to see if someone has covered your problem before. If they have, see if your question about the problem has already been raised. Whether or not it has, questions about the same problem ...

Never mind. Got it figured out. Basically, I need to make sure not to count the guy that got killed when I'm looking for his replacement.

David

Um... Because it didn't show up in the search. Is there something wrong with the search for this forum?