Pagini recente » Cod sursa (job #552553) | Cod sursa (job #391396) | Cod sursa (job #3142684) | Cod sursa (job #691981) | Cod sursa (job #1060073)
#include <cstdio>
#include <algorithm>
#define Nmax 105
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]);
}
void Rezolvare()
{
for (int i = 1; i <= N; ++i)
{
for (int j = 1; j <= N; ++j)
{
for (int k = 1; k <= N; ++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)
printf("%d ", C[i][j]);
printf("\n");
}
}
int main()
{
freopen("royfloyd.in", "r", stdin);
freopen("royfloyd.out", "w", stdout);
Citire();
Rezolvare();
Afisare();
return 0;
}