Cod sursa(job #2451832)
Utilizator | Data | 28 august 2019 13:04:47 | |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | repost | Marime | 0.61 kb |
#include <fstream>
using namespace std;
ifstream in ("royfloyd.in");
ofstream out ("royfloyd.out");
int M[101][101];
int main ()
{
int n;
in>>n;
for (int i=1;i<=n;++i)
for (int j=1;j<=n;++j)
in>>M[i][j];
for (int k=1;k<=n;++k)
for (int i=1;i<=n;++i)
for (int j=1;j<=n;++j)
if ( M[i][k] && M[k][j] && ( !M[i][j] || M[i][j]>M[i][k]+M[k][j] ) && i!=j)
M[i][j]=M[i][k]+M[k][j];
for (int i=1;i<=n;++i)
{
for (int j=1;j<=n;++j)
out<<M[i][j]<<' ';
out<<'\n';
}
return 0;
}