OJ Board

No it doesn't. Explain me the Floyd-Warshall algorithm
I don't know anything about O(n^3) or O(n^2) etc...

Don't be mad.
The point of writing solutions for problems is having fun and educating yourself. I don't know where the bug is - I am still trying to solve problem no. 104

Hy.
Please explain me, how does Floyd-Warshall algorithm work and how can I use it to solve the Arbitrage problem.

yeah. I am using DevCpp. It's a cool IDE, but I hate it's debugger, it's buggy

I think something is wrong:

Sample Input

3
1.2 .89
.88 5.1
1.1 0.15
4
3.1 0.0023 0.35
0.21 0.00353 8.13
200 180.559 10.339
2.11 0.089 0.06111
2
2.0
0.45

Sample Output

1 2 1
1 2 4 1
no arbitrage sequence exists

In the 2th input:

The table:
| 1 | 2 | 3 | 4 ...

Hy again.
Thank you for your test input.
My program was accepted in 0:00.20 sec and the amount of memory was 64 kbytes(I think, but still 64).

I have a problem
Input:
5
move 1 onto 0
move 2 onto 0
move 3 onto 0
move 0 over 4

Is the output like that:

0:
1:
2:
3:
4: 0 ?

And does moving to initial position mean the same as move "the box that has to be moved" to "the value of the box" e.g:
0: 1 2
1:
2:
3:
4:

move 0 over 4:
0:
1:
2:
3:
4: 0

Ok, here's the deal.
I rewrote my code and It got Accepted.

"Your C++ program has solved Ok the problem 103 (Stacking Boxes)
in 0.436 seconds using as much as 392 kbytes of virtual memory.
Congratulations!"

My code:

What does that DP abbreviation mean and how does that algorithm work.

Now if I understood the problem correctly, I have to rearrange the measurments of 1 box so that it will fit into a bigger box, which measurements are bigger than the box, whose measurements I changed.

As I can see, you sort the ...

Thank you for your answer.
I'll try to figure out a way to read from input with scanf. cin is slower than scanf.

Hy.
I just can't understand what's wrong.
I was writing a solution for problem 103.
I compiled the program and it seems to read the input wrongly.

I have a problem with my solution.
Here's what my program does:
1. reads the input and stores it into an array
2. It will put the numbers increasingly in the same array:
if the input is
--- /*start of input*/
1 6
1 8 3 2 10 20
--- /*end of input*/

So:
1 2 3 8 10 20

then it will compare all the ...