Cod sursa(job #2400969)
| Utilizator | Data | 9 aprilie 2019 12:26:19 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 90 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.65 kb |
#include <cstdio>
using namespace std;
int n,k,j,i,c[105][105];
void royfloyd()
{
for (k=1;k<=n;k++)
for (i=1;i<=n;i++)
for(j=1;j<=n;j++)
if ((c[i][j]>c[i][k]+c[k][j] || c[i][j]==0) && i!=j)
c[i][j]=c[i][k]+c[k][j];
}
int main()
{
freopen ("royfloyd.in", "r", stdin);
freopen ("royfloyd.out", "w", stdout);
scanf ("%d", &n);
for (i=1; i<=n; i++)
for (j=1; j<=n; j++)
scanf ("%d", &c[i][j]);
royfloyd();
for (i=1;i<=n;i++)
{
for (j=1;j<=n;j++)
printf("%d ", c[i][j]);
printf ("\n");
}
return 0;
}
