Pagini recente » Cod sursa (job #1315668) | Cod sursa (job #1108179) | Cod sursa (job #2371868) | Cod sursa (job #2374298) | Cod sursa (job #1165406)
#include <cstdio>
using namespace std;
const int N=105;
int G[N][N];
int main()
{
freopen("royfloyd.in", "r", stdin);
freopen("royfloyd.out", "w", stdout);
int n, i, j, k;
scanf("%d", &n);
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
{
scanf("%d", &G[i][j]);
}
}
for(k=1;k<=n;k++)
{
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
{
if(i==j) continue;
if(G[i][k]&&G[k][j]&&(G[i][k]+G[k][j]<G[i][j]||!G[i][j])) G[i][j]=G[i][k]+G[k][j];
}
}
}
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
{
printf("%d ", G[i][j]);
}
printf("\n");
}
}