Cod sursa(job #2087521)
Utilizator | Data | 13 decembrie 2017 19:31:07 | |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.62 kb |
#include <cstdio>
#include <algorithm>
using namespace std;
int n,i,j,k,a[101][101];
int main()
{
freopen("royfloyd.in","r",stdin);
freopen("royfloyd.out","w",stdout);
scanf("%d\n",&n);
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
{
scanf("%d",&a[i][j]);
if(!a[i][j] && i!=j)
a[i][j]=100000001;
}
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++,printf("\n"))
for(j=1;j<=n;j++)
printf("%d ",a[i][j]);
return 0;
}