Cod sursa(job #1414710)
Utilizator | Data | 2 aprilie 2015 22:06:05 | |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.59 kb |
#include<fstream>
#define N 103
#define inf 1000000000
using namespace std;
ifstream cin("royfloyd.in");
ofstream cout("royfloyd.out");
int n,i,j,k,a[N][N];
int main()
{
cin >> n;
for (i=1;i<=n;i++)
for (j=1;j<=n;j++){
cin>>a[i][j];
if (a[i][j]==0 && i!=j) a[i][j]=inf;
}
for (k=1;k<=n;k++)
for (i=1;i<=n;i++)
for (j=1;j<=n;j++)
a[i][j]=min(a[i][j],a[i][k]+a[k][j]);
for (i=1;i<=n;i++)
{
for (j=1;j<=n;j++) cout<<(a[i][j]>=inf ? 0 : a[i][j]) << ' ';
cout<<'\n';
}
return 0;
}