OJ Board

i need your hint or send me your .exe file .

I guess you shouldn't execute any program someone you don't know sends you...

Don't write a newline after the last test case.

yiuyuho, I totally agree with you. However, in my first submission I produced output "1" for input "1 1" and got WA, then changed it to "Boring!" and it was accepted.

So k must be > 1, but the description isn't very accurate.

I couldn't even compile your program. First, you must change main() return type to int, and finish main with "return 0;"

After making this change it compiled, but it immediately crashed with Segmentation Fault. That means it didn't even produce output and that you have some invalid memory ...

char final[4000];
...
for (i=4000;final[i]==0;i--){


final will be final[4000] in the first iteration, which may be the cause of RE. Either make i=3999 or increase final[] size to 4001.

Same thing here:

for (i=4000;cal[N][i]==0;i--){


When you declare something like, "int array[100 ...

I solved this problem with an array sized 5000*1100 and judge reported 64k memory. I believe the memory the judge reports is dynamic memory, not static.

Think of this input:

5000
5000
5000
...

It's clear it's better to memorize the outputs than to calculate them every time.

Problem says no line will be greater than 132 chars, so it can have at most 132 chars, so you must have space for 132 chars plus the ending '\0'.

Try to increase your buf size.

Hi again! I've already solved this one, but my first atempt was Wrong Answer.

Let me draw the table of the sample input:

XXXX
X_BX
XB_X
XXXX


The X are walls B are bumpers.
The problem says that 1 <= x <= m and 1 <= y <= n. But the limit positions are walls. That means (3,4) isn't a valid ...

try this input:
6
0.0 0.0 0.0 0.0 0.0
0.0 0.0 0.1 0.0 0.0
0.0 0.0 1.0 0.0 0.0
0.0 5.0 0.0 0.0 0.0
0.0 0.0 0.0 0.0 9.0
0.0 0.0 0.0 0.0 1.0
output should be 5 6 5
but your program gives 5 6 1
which is wrong, because you have to end in the same place as you started.

Actually, you have a silly ...

Hi! table was a misspelling, I intended to write "best". So it's:

for (steps = 2; steps <= n; steps++)
for k...
for i..
for j..
tmp = best[i][k][steps-1] * best[k][j][1]
if (tmp > best[i][j][steps]) {
best[i][j][steps] = tmp;
path[i][j][steps] = k;
}

Sorry for the confusion! Notice ...

Floyd-Warshall finds all the mininum paths between every vertex and all the other vertexes. However, in this problem you not only have to find the shortest path, it also has to make a profit of more than 1%.

Simple F-W goes like this:

// initialization
for (i = 0; i < n; i++) {
for (j = 0; j ...

Well, I'll assume you understand what the problem asks. You have to find the shortest sequence that yelds a profit (not the one with the greatest profit!). If there is more then one sequence with the same length, any of those is valid.

Now, you can't just try with brute force (trying all ...

I've been trying to solve this problem for sooo long and finally got AC so today is a memorable day for me :)

So here are some clues for those who haven't solved it yet.

1) There are some posts talking about floating point errors, but I didn't check for any in my solution. I use a simple test ...

I've already come across several problems which are not precise on the output format, and since I try very hard to keep my total submissions at a minimum, it's very annoying to spend around 10 or more submissions to figure out why I'm getting PE!!

Some problems I just haven't figured how should ...

Some compilation errors...

First, don't use <iostream.h>, instead use
#include <iostream>
using namespace std;

Second, the main function must return an int; always return from main with
return 0;

And there's a warning about unused variable "char temp".

Your program failed for this input ...