套汇问题 Floyd

问题：套汇。

思路：Floyd

代码：

 #include <cstdio>
 #include <cstdlib>
 #include <ctime>

 #define N 10

 int currencyArbitrage (double rates[][N]);

 int main (int argc, char **argv)
 {
     double R[N][N];
     srand(time(NULL));
     for (int i = ; i < N; i++)
     {
         for (int j = ; j < N; j++)
         {
             R[i][j] = ((rand() % N) + ) * 1.0 / N;
         }
     }
     R[][] = ;
     R[][] = 0.9;
     R[][] = 1.2;

     printf("%d\n",currencyArbitrage(R));
     return ;
 }

 int currencyArbitrage (double rates[][N])
 {
     for (int k = ; k < N; k++)
         for (int i = ; i < N; i++)
             for (int j = ; j < N; j++)
             {
                 double tmp = rates[i][k] * rates[k][j];
                 rates[i][j] = (tmp > rates[i][j]) ? tmp : rates[i][j];
                 if ((i != j) && (rates[i][j] * rates[j][i] > ))
                 {
                     return ;
                 }
             }
     return ;
 }

时间复杂度：O(N^3)