Pagini recente » Cod sursa (job #1884513) | Cod sursa (job #3272942) | Cod sursa (job #1838806) | Cod sursa (job #2833872) | Cod sursa (job #2137583)
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int min(int, int);
int n;
int dp[105][105];
int main()
{
int i, j, k;
fin >> n;
for (i = 1; i <= n; i++)
for (j = 1; j <= n; j++)
fin >> dp[i][j];
for (k = 1; k <= n; k++)
for (i = 1; i <= n; i++)
for (j = 1; j <= n; j++)
{
if (dp[i][k] && dp[k][j])
dp[i][j] = min(dp[i][j], dp[i][k] + dp[k][j]);
if (!dp[i][j] && i != j)
dp[i][j] = dp[i][k] + dp[k][j];
}
for (i = 1; i <= n; i++)
{
for (j = 1; j <= n; j++)
fout << dp[i][j] << ' ';
fout << '\n';
}
return 0;
}
int min(int a, int b)
{
return a < b ? a : b;
}