Cod sursa(job #2646387)
Utilizator | Data | 31 august 2020 22:36:40 | |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.6 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n,mat[110][110],i,j,k;
int main()
{
fin>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
fin>>mat[i][j];
for(k=1;k<=n;k++)
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if(mat[i][k] && mat[k][j] && (mat[i][k]+mat[k][j]<mat[i][j] || mat[i][j]==0) && i!=j)
mat[i][j]=mat[i][k]+mat[k][j];
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
fout<<mat[i][j]<<" ";
fout<<'\n';
}
return 0;
}