Cod sursa(job #1919229)
| Utilizator | Data | 9 martie 2017 18:23:30 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.6 kb |
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n,i,j,k,rf[110][110];
int main()
{
fin >> n;
for (i=1; i<=n; i++)
for (j=1; j<=n; j++)
fin >> rf[i][j];
for (k=1; k<=n; k++)
for (i=1; i<=n; i++)
for (j=1; j<=n; j++)
if (i!=j&&rf[i][k]&&rf[k][j]&&(rf[i][k]+rf[k][j]<rf[i][j]||rf[i][j]==0))
rf[i][j]=rf[i][k]+rf[k][j];
for (i=1; i<=n; i++)
{
for (j=1; j<=n; j++)
fout << rf[i][j] << ' ';
fout << '\n';
}
}
