Cod sursa(job #946998)
#include <cstdlib>
#include <fstream>
using namespace std;
const int NMAX = 111;
const int oo = 1 << 29;
int dp[NMAX][NMAX];
int main()
{
int N, i, j, k;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
in >> N;
for(i = 1; i <= N; ++i)
{
for(j = 1; j <= N; ++j)
{
in >> dp[i][j];
dp[i][j] = 0 == dp[i][j] ? oo : dp[i][j];
}
}
for(k = 1; k <= N; ++k)
{
for(i = 1; i <= N; ++i)
{
if(k != i)
{
for(j = 1; j <= N; ++j)
{
if(k != j && i != j && dp[i][j] > dp[i][k] + dp[k][j])
{
dp[i][j] = dp[i][k] + dp[k][j];
}
}
}
}
}
for(i = 1; i <= N; ++i)
{
for(j = 1; j <= N; ++j)
{
out << (oo == dp[i][j] ? 0 : dp[i][j]) << ' ';
}
out << '\n';
}
return EXIT_SUCCESS;
}