Pagini recente » Cod sursa (job #1563536) | Cod sursa (job #1788176) | Cod sursa (job #2185960) | Cod sursa (job #1005281) | Cod sursa (job #1452369)
#include <cstdio>
using namespace std;
const int Nmax = 110;
int n , i , j;
int mat[Nmax][Nmax];
void roy_floyd()
{
for (int k = 1; k <= n; ++k)
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= n; ++j)
if (i != j && mat[i][k] && mat[k][j] && (mat[i][j] > mat[i][k] + mat[k][j] || !mat[i][j]))
mat[i][j] = mat[i][k] + mat[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", &mat[i][j]);
roy_floyd();
for (i = 1; i <= n; printf("\n"), ++i)
for (j = 1; j <= n; ++j)
printf("%d ", mat[i][j]);
return 0;
}