OJ Board

Hi all,

As many of the guys here suggested it, I tried to solve the problem using the Floyd algorithm but with no success :( It is intended for finding the minimum paths in graph. If we use it in this case, it's possible to have cycles because we have to multiply numbers lower and higher than 1 ...