Pagini recente » Cod sursa (job #2438436) | Cod sursa (job #2059354) | Cod sursa (job #1102327) | Cod sursa (job #1422768) | Cod sursa (job #1741044)
#include <bits/stdc++.h>
#define Nmax 102
#define INF 2000000
FILE *fin = freopen("royfloyd.in", "r", stdin);
FILE *fout = freopen("royfloyd.out", "w", stdout);
using namespace std;
int n, dp[Nmax][Nmax];
void read()
{
int d;
scanf("%d", &n);
for(int i = 1; i <= n; ++ i)
for(int j = 1; j <= n; ++ j)
{
scanf("%d", &dp[i][j]);
if(i != j && dp[i][j] == 0) dp[i][j] = INF;
}
}
void solve()
{
int i, j, k;
for(k = 1; k <= n; ++ k)
for(i = 1; i <= n; ++ i)
for(j = 1; j <= n; ++ j)
if(dp[i][j] > dp[i][k] + dp[k][j])
dp[i][j] = dp[i][k] + dp[k][j];
}
void write()
{
for(int i = 1; i <= n; ++ i)
{
for(int j = 1; j <= n; ++ j)
if(dp[i][j] == INF)
printf("0 ");
else printf("%d ", dp[i][j]);
printf("\n");
}
}
int main()
{
read();
solve();
write();
return 0;
}