Pagini recente » Cod sursa (job #2591859) | Cod sursa (job #774412) | Cod sursa (job #2776326) | Cod sursa (job #39862) | Cod sursa (job #1816994)
#include <cstdio>
#include <algorithm>
using namespace std;
int main()
{
freopen("royfloyd.in", "r", stdin);
freopen("royfloyd.out", "w", stdout);
int n, v[107][107];
scanf("%d", &n);
for(int i = 1; i <= n; ++i)
{
for(int j = 1; j <= n; ++j)
{
scanf("%d", &v[i][j]);
if(v[i][j] == 0)
v[i][j] = 1000000000;
}
}
for(int i = 1; i <= n; ++i)
{
for(int j = 1; j <= n; ++j)
{
for(int k = 1; k <= n; ++k)
{
if(i != j)
v[i][j] = min(v[i][j], v[i][k] + v[k][j]);
}
}
}
for(int i = 1; i <= n; ++i)
{
for(int j = 1; j <= n; ++j)
{
if(v[i][j] == 1000000000)
printf("0 ");
else
printf("%d ", v[i][j]);
}
printf("\n");
}
return 0;
}