Pagini recente » Cod sursa (job #2575594) | Cod sursa (job #570484) | Cod sursa (job #2690441) | Cod sursa (job #2177775) | Cod sursa (job #2638258)
#include <fstream>
using namespace std;
ifstream cin("royfloyd.in");
ofstream cout("royfloyd.out");
const int NMAX = 100;
const int INF = 1e9;
int N;
int d[NMAX + 2][NMAX + 2];
int main()
{
cin >> N;
for(int i = 1; i <= N; i++)
for(int j = 1; j <= N; j++)
d[i][j] = INF;
for(int i = 1; i <= N; i++)
for(int j = 1; j <= N; j++)
{
cin >> d[i][j];
if(d[i][j] == 0)
d[i][j] = INF;
}
for(int k = 1; k <= N; k++)
for(int j = 1; j <= N; j++)
if(j != k && d[j][k] != INF)
for(int p = 1; p <= N; p++)
if(j != p && k != p && d[k][p] != INF)
d[j][p] = min(d[j][p], d[j][k] + d[k][p]);
for(int i = 1; i <= N; i++)
{
for(int j = 1; j <= N; j++)
if(d[i][j] >= INF)
cout << 0 << ' ';
else
cout << d[i][j] << ' ';
cout << '\n';
}
return 0;
}