Pagini recente » Cod sursa (job #529673) | Cod sursa (job #2524395) | Cod sursa (job #3163537) | Cod sursa (job #1631935) | Cod sursa (job #2573962)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
const int MAXN = 105, INF = 0x3f3f3f3f;
int mat[MAXN][MAXN], dp[MAXN][MAXN], n;
void read()
{
fin >> n;
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= n; ++j) {
fin >> mat[i][j];
if (i != j && mat[i][j] == 0)
dp[i][j] = INF;
else
dp[i][j] = mat[i][j];
}
}
void solve()
{
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)
dp[i][j] = min(dp[i][j], dp[i][k] + dp[k][j]);
}
void print()
{
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= n; ++j)
if (dp[i][j] != INF)
fout << dp[i][j] << " \n"[j == n];
else
fout << '0' << " \n"[j == n];
}
int main()
{
read();
solve();
print();
return 0;
}