Pagini recente » Cod sursa (job #990875) | Cod sursa (job #2982409) | Cod sursa (job #433255) | Cod sursa (job #2818702) | Cod sursa (job #2570017)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
const int dim = 105;
const int INF = 1e9;
int n,dp[dim][dim];
int main()
{
in >> n;
for (int i=1; i<=n; i++)
{
for (int j=1; j<=n; j++)
{
in >> dp[i][j];
if (i != j && dp[i][j] == 0)
{
dp[i][j] = INF;
}
}
}
for (int k=1; k<=n; k++)
{
for (int i=1; i<=n; i++)
{
for (int j=1; j<=n; j++)
{
dp[i][j] = min(dp[i][j], dp[i][k] + dp[k][j]);
}
}
}
for (int i=1; i<=n; i++)
{
for (int j=1; j<=n; j++)
{
if (i != j && dp[i][j] == INF)
{
dp[i][j] = 0;
}
out << dp[i][j] << " ";
}
out << "\n";
}
return 0;
}