Pagini recente » Cod sursa (job #2925632) | Cod sursa (job #531068) | Cod sursa (job #651350) | Cod sursa (job #651392) | Cod sursa (job #2929958)
#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 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++)
{
if (i == j)
dp[i][j][0] = 0;
else if (a[i][j] != 0)
dp[i][j][0] = a[i][j];
else
dp[i][j][0] = 1e9;
}
}
for (int k = 1; k <= n; k++)
{
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= n; j++)
{
int ant = dp[i][j][k - 1];
int cur = dp[i][k][k - 1] + dp[k][j][k - 1];
dp[i][j][k] = min(ant,cur);
}
}
}
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= n; j++)
{
if (dp[i][j][n] == 1e9)
out << 0 << ' ';
else
out << dp[i][j][n] << ' ';
}
out << '\n';
}
return 0;
}