Pagini recente » Cod sursa (job #1443753) | Cod sursa (job #502366) | Cod sursa (job #811603) | Cod sursa (job #2697818) | Cod sursa (job #1450111)
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
const int MAX = 101, inf = (1 << 30) - 1;
int dp[MAX][MAX], n, nr;
int main()
{
fin >> n;
for (int i = 1; i <= n ; i++)
for (int j = 1; j <= n; j++){
fin >> nr;
dp[i][j] = (!nr ? inf : nr);
}
for (int k = 1; k <= n; k++)
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
if (i != j && dp[i][k] + dp[k][j] < dp[i][j])
dp[i][j] = dp[i][k] + dp[k][j];
for (int i = 1; i <= n; i++){
for (int j = 1; j <= n; j++)
fout << (dp[i][j] == inf? 0 : dp[i][j]) << ' ';
fout << '\n';
}
return 0;
}