Pagini recente » Cod sursa (job #3202610) | Cod sursa (job #2089134) | Cod sursa (job #458724) | Cod sursa (job #2378383) | Cod sursa (job #1614321)
#include <fstream>
#define NMAX 510
#define INF 999999999
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
void roy_floyd();
int C[NMAX][NMAX];
int n, m, i, j, k, x, y, c, nod, maxi;
int poz, minu;
int main()
{
fin >> n;
for(i = 1; i <= n; ++i)
for(j = 1; j <= n; ++j)
if(i != j)
C[i][j] = INF;
for(j = 1; j <= n; ++j)
for(i = 1; i <= n; ++i)
{
fin >> C[j][i];
}
//fin >> nod;
roy_floyd();
for(i = 1; i <= n; ++i)
{
for(j = 1; j <= n; ++j)
if(C[i][j] != INF)
fout << C[i][j] << ' ';
else
fout << "0 ";
fout << '\n';
}
return 0;
}
void roy_floyd()
{
int i, j, k;
for(i = 1; i <= n; ++i)
for(j = 1; j <= n; ++j)
for(k = 1; k <= n; ++k)
if(C[j][i] != INF && C[i][k] != INF)
if(C[j][k] > C[j][i]+C[i][k])
C[j][k] = C[j][i]+C[i][k];
}