Pagini recente » Cod sursa (job #1978710) | Cod sursa (job #858028) | Cod sursa (job #2778895) | Cod sursa (job #2507599) | Cod sursa (job #2415597)
#include <fstream>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
#define nmax 105
int n, dp[nmax][nmax];
int main()
{
f >> n;
for (int i = 1; i <= n; ++i) for (int j = 1; j <= n; ++j) f >> dp[i][j];
for (int k = 1; k <= n; ++k)
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= n; ++j)
if (i-j) if ((dp[i][j] > dp[i][k] + dp[k][j] || !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) g << dp[i][j] << ' ';
g << '\n';
}
return 0;
}