Pagini recente » Cod sursa (job #851298) | Cod sursa (job #488396) | Cod sursa (job #1505246) | Cod sursa (job #1134749) | Cod sursa (job #1557979)
#include <iostream>
#include <cstdio>
using namespace std;
const int dmax = 100;
int A[dmax + 1][dmax + 1];
int N;
void citire()
{
freopen("royfloyd.in", "r", stdin);
freopen("royfloyd.out", "w", stdout);
int i, j;
scanf("%d", &N);
for(i = 1; i <= N; i++)
for(j = 1; j <= N; j++) scanf("%d", &A[i][j]);
}
void roy_floyd()
{
int i,j,k;
for(k = 1; k <= N; k++)
for(i = 1; i <= N; i++)
for(j = 1; j <= N; j++)
if(A[i][k] && A[k][j] && (A[i][j] > A[i][k] + A[k][j] || !A[i][j]) && i != j) A[i][j] = A[i][k] + A[k][j];
}
void afisare()
{
int i, j;
for(i = 1; i <= N; i++)
{
for(j = 1; j <= N; j++) printf("%d ", A[i][j]);
printf("\n");
}
}
int main()
{
citire();
roy_floyd();
afisare();
return 0;
}