# UVa 104

## Summary

This problem can be categorized as a Dynamic Programming or Graph Theory problem. Any ${\displaystyle O(N^{4})}$ algorithm will get you an AC.

## Explanation

This problem requires knowledge of graph algorithms and can be solved using modified version of Floyd-Warshall algorithm. Floyd-Warshall algorithm will find all the shortest paths between every node to the others in just ${\displaystyle O(N^{3})}$ time. Remember, finding the shortest path from every node to others won't suffice, as we need to select path with least number of exchanges involved. So, add another dimension to the distance matrix, which will store the optimal path in 'n' no. of steps ( ${\displaystyle 1<=n<=20}$ ).

Modifications to be done to Floyd-Warshall algorithm:

${\displaystyle d(i,j)=max(d(i,k)*d(k,j),d(i,j)){\mbox{ where }}i\neq j}$

## Gotchas

You have to find the shortest sequence that yields a profit and not the one with the greatest profit! If there is more than one sequence with the same length, any of those are valid.

## 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
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

```1 2 1
1 2 4 1
no arbitrage sequence exists
5 6 5
```