Cod sursa(job #2211050)
Utilizator | Radu Minea raduq | Data | 9 iunie 2018 11:55:55 |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include<iostream>
#include<cstdio>
using namespace std;
int m[101][101], n, i, j, k;
int main()
{
freopen("royfloyd.in","r",stdin);
freopen("royfloyd.out","w",stdout);
cin>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++) cin>>m[i][j];
for(k=1;k<=n;k++)
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if(i!=j && i!=k && j!=k && m[i][j]<m[i][k]+m[k][j]) m[i][j]=m[i][k]+m[k][j];
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++) cout<<m[i][j]<<" ";
cout<<'\n';
}
return 0;
}