OJ Board

Hi,

all test cases passed (same results as fpavetic), even checked all possible cases like yoshiro aoki, but still wrong answer.

language used is c. anybody has an idea?!

Thanks a lot, Jan!

It DID help. And special thanks for the fast response!!!

Care to share your knowledge?

The format specifier for a LONG variable is %ld, isn't it?
Why does %d work instead?

Needless to say, my results were ok, otherwise the verdict would have been a WRONG ANSWER (:().

What can be the reason for a presentation error in the solution of problem 694??!!

There are no blank lines (according to the description), there's no multiple input/output.

I think I've already tried all possible combinations, including a leading space.

Any idea anybody?

anybody cares to verify the following input/output? ___________ | o . o | | oo . | | oo . o| | oo . o | | oo . oo| | oo .o | | oo .o o| | oo .oo | | oo .ooo| | ooo. | | ooo. o| | o . o| | o . o | | o . oo| | o .o | | o .o o| | o .oo | | o .ooo| | o o. | | o o. o| | o o. o | | o o. oo| | o o.o | | o ...

Try this one:

Yes, sorry. I didn't check the posted output properly. All characters should be centered as in roticv's output. Both outputs are identical ( I removed the additional empty lines) but it's still P.E.?!?! |---|---|---|---|---| | ? | X | 0 | 0 | X | |---|---|---|---|---| | ? | X | 0 | 0 | X | |---|---|...

This problem really IS easy to solve - no tricks, no negative indices.

Just try to solve the examples by hand and that's about it. The description is all one needs.

There could be a problem with taking the input and formatting the output of course.

Thanks for the reply, mf, but I'm afraid that doesn't answer my question(s). There are two critical parts of my program, that is two parts where an invalid memory reference could occur: 1) reading the input and increasing the city-counter 2) reading the city-numbers between cargo is transported Just...

Well, I'm not too sure whether to post this question here or under the Programming Languages C thread but here it is anyway: My program 523 received an Runtime Error (invalid memory reference). Consequently I inserted too assert-calls to check whether the buffer was big enough and the maximum number...

double works fine also.

Try with a greater value for max.

My program defined max = 1000001

Could somebody please verify the following I/O? 4 zzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzz A a:0 Z a:0 zzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzz A z:100 Z z:100 <- empty line (no be...

I'm pretty sure that

cost[j]=sqrt(pow((A.x-A[j].x),2) + pow((A.y-A[j].y),2))

leads to a "Time Length Exceeded" message.

Quantris,

as far as I remember that's problem 187 you're describing (I've solved that already).

Any ideas as to 186?

What's the difference between problems 186, 423, 567 and 627?

I solved the last three but continuously get a WA for 186.

Any ideas?