Cod sursa(job #1332203)
Utilizator | Pogonaru Mihai misu007 | Data | 1 februarie 2015 20:04:08 |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.66 kb |
#include <cstdio>
using namespace std;
int n,d[101][101];
int main()
{
freopen("royfloyd.in","r",stdin);
freopen("royfloyd.out","w",stdout);
int i,j,k;
scanf("%d",&n);
for(i=1;i<=n;++i)
for(j=1;j<=n;++j)
{
scanf("%d",&d[i][j]);
}
for(k=1;k<=n;++k)
{
for(i=1;i<=n;++i)
{
for(j=1;j<=n;++j)
{
if(((d[i][j]>d[i][k]+d[k][j])||!d[i][j])&&i!=j&&d[i][k]&&d[k][j]) d[i][j]=d[i][k]+d[k][j];
}
}
}
for(i=1;i<=n;++i)
{
for(j=1;j<=n;++j) printf("%d ",d[i][j]);
printf("\n");
}
return 0;
}