Pagini recente » Cod sursa (job #603002) | Cod sursa (job #2322826) | Cod sursa (job #394265) | Cod sursa (job #709264) | Cod sursa (job #2978977)
#include <fstream>
#include <climits>
using namespace std;
const int NMAX = 105;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int c[NMAX][NMAX];
const int inf = INT_MAX/2;
int main()
{
int n,i,j,k;
fin >> n;
for(i=1;i<=n;++i)
for(j=1;j<=n;++j)
fin >> c[i][j];
for(i=1;i<=n;++i)
for(j=1;j<=n;++j)
if(i!=j && c[i][j] == 0)c[i][j] = inf;
for(k=1;k<=n;++k)
for(i=1;i<=n;++i)
for(j=1;j<=n;++j)
c[i][j] = min(c[i][j],c[i][k]+c[k][j]);
for(i=1;i<=n;++i){
for(j=1;j<=n;++j)
{
if(c[i][j] == inf)fout << 0 << " ";
else fout << c[i][j] << " ";
}
fout << "\n";
}
fin.close();
fout.close();
return 0;
}