Search found 145 matches

by WR
Tue Jan 16, 2007 9:21 pm
Forum: Volume 104 (10400-10499)
Topic: 10427 - Naughty Sleepy Boys
Replies: 35
Views: 21201

wa 10427

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?!
by WR
Wed Jan 10, 2007 11:34 pm
Forum: Volume 6 (600-699)
Topic: 694 - The Collatz Sequence
Replies: 46
Views: 15922

694 P.E.

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 (:().
by WR
Wed Jan 10, 2007 12:54 pm
Forum: Volume 6 (600-699)
Topic: 694 - The Collatz Sequence
Replies: 46
Views: 15922

P.E. problem 694

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?
by WR
Sat Nov 25, 2006 12:47 pm
Forum: Volume 108 (10800-10899)
Topic: 10878 - Decode the tape
Replies: 23
Views: 16025

10878 decode the tape

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 ...
by WR
Thu Dec 15, 2005 3:51 pm
Forum: Volume 102 (10200-10299)
Topic: 10279 - Mine Sweeper
Replies: 102
Views: 28340

Try this one:

Code: Select all

1
.
x
by WR
Wed Nov 23, 2005 11:00 am
Forum: Volume 105 (10500-10599)
Topic: 10500 - Robot maps
Replies: 45
Views: 13580

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 | |---|---|...
by WR
Fri Sep 30, 2005 8:03 am
Forum: Volume 3 (300-399)
Topic: 394 - Mapmaker
Replies: 22
Views: 6402

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.
by WR
Wed Jun 01, 2005 7:41 am
Forum: Volume 5 (500-599)
Topic: 523 - Minimum Transport Cost
Replies: 44
Views: 9768

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...
by WR
Tue May 31, 2005 12:51 pm
Forum: Volume 5 (500-599)
Topic: 523 - Minimum Transport Cost
Replies: 44
Views: 9768

523 - from RTE to WA

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...
by WR
Tue May 31, 2005 7:54 am
Forum: Volume 103 (10300-10399)
Topic: 10338 - Mischievous Children
Replies: 56
Views: 20277

double works fine also.
by WR
Mon May 30, 2005 10:01 am
Forum: Volume 103 (10300-10399)
Topic: 10340 - All in All
Replies: 129
Views: 31834

Try with a greater value for max.

My program defined max = 1000001
by WR
Wed May 25, 2005 10:46 am
Forum: Volume 103 (10300-10399)
Topic: 10390 - Bean Counting
Replies: 3
Views: 1705

10390 - bean counting

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...
by WR
Wed May 18, 2005 11:21 am
Forum: Volume 5 (500-599)
Topic: 534 - Frogger
Replies: 41
Views: 17741

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.
by WR
Tue May 17, 2005 7:52 am
Forum: Volume 1 (100-199)
Topic: 187 - Transaction Processing
Replies: 18
Views: 4633

Quantris,

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

Any ideas as to 186?
by WR
Thu May 12, 2005 2:12 pm
Forum: Volume 1 (100-199)
Topic: 186 - Trip Routing
Replies: 15
Views: 4483

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?

Go to advanced search