Cod sursa(job #2480251)
| Utilizator | Data | 25 octombrie 2019 09:39:30 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.64 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n,m,i,j,k,a[105][105];
int main()
{
fin>>n;
for(i=1; i<=n; i++)
for(j=1; j<=n; j++)
fin>>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] and a[k][j] and i!=j and (a[i][j]>a[i][k]+a[k][j] or a[i][j]==0))
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';
}
}
