Pagini recente » Istoria paginii runda/laborator25mai/clasament | Cod sursa (job #2815722) | Cod sursa (job #2691805) | Cod sursa (job #528509) | Cod sursa (job #2691501)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
const int nmax = 105;
int n, d[nmax][nmax];
int main()
{
int i, j, k;
fin>>n;
for(i = 1; i <= n; ++i)
{
for(j = 1; j <= n; ++j)
fin>>d[i][j];
}
for(k = 1; k <= n; ++k)
{
for(i = 1; i <= n; ++i)
{
for(j = 1; j <= n; ++j)
{
if(i != j && d[i][k] && d[k][j] && (d[i][j] > d[i][k] + d[k][j] || !d[i][j]))
d[i][j] = d[i][k] + d[k][j];
}
}
}
for(i = 1; i <= n; ++i)
{
for(j = 1; j <= n; ++j)
fout<<d[i][j]<<' ';
fout<<'\n';
}
return 0;
}