Pagini recente » Cod sursa (job #2987037) | Cod sursa (job #2987031) | Cod sursa (job #2979558) | Cod sursa (job #2708036) | Cod sursa (job #1782993)
#include <iostream>
#include <cstdio>
using namespace std;
int n, c[105][105], d[105][105];
void citire()
{
scanf("%d", &n);
for(int i=1; i<=n; ++i)
for(int j=1; j<=n; ++j)
{
scanf("%d", &c[i][j]);
if(i!=j && c[i][j]==0)
c[i][j]=1005;
}
}
void createMatriceDrumMinim()
{
for(int k=1; k<=n; ++k)
{
for(int i=1; i<=n; ++i)
{
for(int j=1; j<=n; ++j)
{
if(i!=k || j!=k)
c[i][j]=min(c[i][j], c[i][k]+c[k][j]);
}
}
}
}
void afisare()
{
for(int i=1; i<=n; ++i)
{
for(int j=1; j<=n; ++j)
printf("%d ", c[i][j]);
printf("\n");
}
}
int main()
{
freopen("royfloyd.in", "r", stdin);
freopen("royfloyd.out", "w", stdout);
citire();
createMatriceDrumMinim();
afisare();
return 0;
}