Pagini recente » Cod sursa (job #2964157) | Cod sursa (job #1443450) | Cod sursa (job #2702048) | Cod sursa (job #2593755) | Cod sursa (job #1837740)
#include <cstdio>
using namespace std;
const int inf = (1 << 29) / 2;
int n;
int mat[105][105];
void citire()
{
scanf("%d", &n);
for(int i = 0; i < n; i++)
{
for(int j = 0; j < n; j++)
{
scanf("%d", &mat[i][j]);
if(mat[i][j] == 0)
{
mat[i][j] = inf;
}
}
}
}
void solve()
{
for(int k = 0; k < n; k++)
{
for(int i = 0; i < n; i++)
{
for(int j = 0; j < n; j++)
{
if(k != i && k != j)
{
if(mat[i][j] > mat[i][k] + mat[k][j])
{
mat[i][j] = mat[i][k] + mat[k][j];
}
}
}
}
}
for(int i = 0; i < n; i++)
{
for(int j = 0; j < n; j++)
{
if(mat[i][j] == inf)
{
mat[i][j] = 0;
}
if(i == j)
{
mat[i][j] = 0;
}
printf("%d ", mat[i][j]);
}
printf("\n");
}
}
int main()
{
freopen("royfloyd.in", "r", stdin);
freopen("royfloyd.out", "w", stdout);
citire();
solve();
return 0;
}