Cod sursa(job #1739116)
| Utilizator | Data | 8 august 2016 17:18:58 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.63 kb |
#include <fstream>
using namespace std;
int a[101][101];
int n;
ifstream fin ("royfloyd.in");
ofstream fout ("royfloyd.out");
int main()
{
fin>>n;
int i, j;
for(i=1; i<=n; i++)
for(j=1; j<=n; j++)
fin>>a[i][j];
int 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';
}
return 0;
}
