Cod sursa(job #2200809)
Utilizator | Data | 2 mai 2018 18:10:41 | |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.56 kb |
#include <iostream>
#include <fstream>
using namespace std;
fstream f("royfloyd.in");
ofstream g("royfloyd.out");
int n,i,j,k,a[101][101];
int main()
{
f>>n;
for(i=1;i<=n;++i)
for(j=1;j<=n;++j)
f>>a[i][j];
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)
g<<a[i][j]<<" ";
g<<endl;
}
return 0;
}