Pagini recente » Cod sursa (job #2130978) | Cod sursa (job #1432269) | Cod sursa (job #2330601) | Cod sursa (job #3279219) | Cod sursa (job #1364127)
#include <cstdio>
#define INF 0x3f3f3f3f
using namespace std;
int DP[105][105];
int N;
void Read()
{
scanf("%d",&N);
int crt;
for(int i = 1; i <= N; ++i)
for(int j = 1; j <= N; ++j)
{
scanf("%d",&crt);
if(crt)
DP[i][j] = crt;
else
DP[i][j] = INF;
}
}
void Solve()
{
for(int k = 1; k <= N; ++k) /// alegem nodul de optimizare
for(int i = 1; i <= N; ++i)
if(i != k)
for(int j = 1; j <= N; ++j)
if(i != j && j != k)
if(DP[i][j] > DP[i][k] + DP[k][j])
DP[i][j] = DP[i][k] + DP[k][j];
for(int i = 1; i <= N; ++i)
{
for(int j = 1; j <= N; ++j)
if(DP[i][j] != INF)
printf("%d ",DP[i][j]);
else
printf("0 ");
printf("\n");
}
}
int main()
{
freopen("royfloyd.in","r",stdin);
freopen("royfloyd.out","w",stdout);
Read();
Solve();
return 0;
}