Cod sursa(job #2091016)

Utilizator VarticeanNicolae Varticean Varticean Data 18 decembrie 2017 23:59:27
Problema Floyd-Warshall/Roy-Floyd Scor 50
Compilator cpp Status done
Runda Arhiva educationala Marime 0.6 kb
#include <bits/stdc++.h>
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
int A[105][105], n;
int main()
{
     in >> n;
     for( int i=1; i<=n; i++)
          for(int j=1; j<=n; j++)
            in >> A[i][j];


     for(int k=1; k<=n; k++)
          for(int i=1; i<=n; i++)
          for( int j=1; j<=n; j++)
     if( A[i][k] && A[k][j] && i != j) A[i][j] = min(A[i][j], A[i][k] + A[k][j]);


     for(int i=1; i<=n; i++)
     {
          for(int j=1; j<=n; j++)
              out << A[i][j] << ' ';
          out << '\n';
     }


    return 0;
}