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