Pagini recente » Cod sursa (job #394646) | Cod sursa (job #1491557) | Cod sursa (job #2395710) | Cod sursa (job #276342) | Cod sursa (job #558673)
Cod sursa(job #558673)
#include <stdio.h>
const int maxval = 0x3f3f3f3f;
int n;
long matrice[110][110];
long minimum(long a, long b)
{
if (a < b) return a;
else return b;
}
void getInput()
{
scanf("%d", &n);
for (int i = 1; i <= n; ++i)
{
for (int j = 1; j <= n; ++j)
{
scanf("%d", &matrice[i][j]);
if ((matrice[i][j] == 0) && (i!=j))
matrice[i][j] = maxval;
}
}
}
void FLOYROYD()
{
for (int k = 1; k <= n; ++k)
for (int i = 1; i <=n; ++i)
for (int j = 1; j<=n; ++j)
matrice[i][j] = minimum(matrice[i][j], matrice[i][k] + matrice[k][j]);
}
void showOutput()
{
for (int i = 1; i<=n; ++i)
{
for (int j = 1; j<=n; ++j)
{
if (matrice[i][j] != maxval)
printf("%ld ", matrice[i][j]);
else
printf("%d ", 0);
}
printf("\n");
}
}
int main()
{
freopen("royfloyd.in", "r", stdin);
freopen("royfloyd.out", "w", stdout);
getInput();
FLOYROYD();
showOutput();
return 0;
}