Cod sursa(job #2358868)
| Utilizator | Data | 28 februarie 2019 13:45:34 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int main ()
{
int n,a[102][102];
fin>>n;
for (int i=1;i<=n;i++)
for (int j=1;j<=n;j++)
fin>>a[i][j];
int i, j, k;
for (k = 1; k <= n; k++)
for (i = 1; i <= n; i++)
for (j = 1; j <= n; j++)
if (a[i][k] && a[k][j] && (a[i][j] > a[i][k] + a[k][j] || !a[i][j]) && i != j)
a[i][j] = a[i][k] + a[k][j];
for (i=1;i<=n;i++)
{
for (j=1;j<=n;j++)
fout<<a[i][j]<<" ";
fout<<"\n";
}
}
