Pagini recente » Cod sursa (job #368666) | Cod sursa (job #1441747) | Cod sursa (job #2208425) | Cod sursa (job #3264095) | Cod sursa (job #3286991)
#include <bits/stdc++.h>
using namespace std;
const int MAX = 105, inf = 0x3F3F3F3F;
int dp[MAX][MAX];
int main()
{
ifstream cin("royfloyd.in");
ofstream cout("royfloyd.out");
int n;
cin >> n;
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= n; ++j)
{
cin >> dp[i][j];
if (i != j && dp[i][j] == 0)
dp[i][j] = inf;
}
for (int k = 1; k <= n; ++k)
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= n; ++j)
dp[i][j] = min(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)
cout << "0 ";
else
cout << dp[i][j] << " ";
cout << "\n";
}
return 0;
}