Pagini recente » Cod sursa (job #1346326) | Cod sursa (job #2296791) | Cod sursa (job #282923) | Cod sursa (job #2067165) | Cod sursa (job #3125786)
#include <bits/stdc++.h>
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
int n,a[101][101],dp[101][101][101];
int inf = 1e9;
int main()
{
in >> n;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
in >> a[i][j];
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
for (int k = 0; k <= n; k++)
dp[i][j][k] = inf;
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= n; j++)
{
if (i == j)
dp[i][j][0] = 0;
else if (a[i][j] > 0)
dp[i][j][0] = a[i][j];
}
}
for (int k = 1; k <= n; k++)
{
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= n; j++)
{
dp[i][j][k] = min(dp[i][j][k - 1],dp[i][k][k - 1] + dp[k][j][k - 1]);
}
}
}
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= n; j++)
{
out << dp[i][j][n] % inf << ' ';
}
out << '\n';
}
return 0;
}