Pagini recente » Cod sursa (job #2461965) | Cod sursa (job #2329779) | Cod sursa (job #379496) | Cod sursa (job #2599857) | Cod sursa (job #558658)
Cod sursa(job #558658)
#include <stdio.h>
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]);
}
}
}
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)
{
printf("%d ", matrice[i][j]);
}
printf("\n");
}
}
int main()
{
freopen("royfloyd.in", "r", stdin);
freopen("royfloyd.out", "w", stdout);
getInput();
FLOYROYD();
showOutput();
return 0;
}