Pagini recente » Cod sursa (job #2977540) | Cod sursa (job #2107935) | Cod sursa (job #1233427) | Cod sursa (job #935334) | Cod sursa (job #1060094)
#include <cstdio>
#include <algorithm>
#define Nmax 105
#define INF 0x3f3f3f3f / 2
using namespace std;
int C[Nmax][Nmax], N;
void Citire()
{
scanf("%d", &N);
for (int i = 1; i <= N; ++i)
for (int j = 1; j <= N; ++j)
{
scanf("%d", &C[i][j]);
if (!C[i][j])
C[i][j] = INF;
}
}
void Rezolvare()
{
for (int k = 1; k <= N; ++k)
{
for (int i = 1; i <= N; ++i)
{
for (int j = 1; j <= N; ++j)
{
if (i != j && j != k)
C[i][j] = min(C[i][j], C[i][k] + C[k][j]);
}
}
}
}
void Afisare()
{
for (int i = 1; i <= N; ++i)
{
for (int j = 1; j <= N; ++j)
if (C[i][j] == INF)
printf("0 ");
else
printf("%d ", C[i][j]);
printf("\n");
}
}
int main()
{
freopen("royfloyd.in", "r", stdin);
freopen("royfloyd.out", "w", stdout);
Citire();
Rezolvare();
Afisare();
return 0;
}