Pagini recente » Cod sursa (job #2666033) | Cod sursa (job #1671747) | Cod sursa (job #564467) | Cod sursa (job #2926182) | Cod sursa (job #2691505)
#include <iostream>
#include <fstream>
#include <iomanip>
#include <list>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n,m;
int d[10001][10001],w[10001][10001];
int inf = 100001;
void initializare()
{
for(int i = 1; i <=n ; i++)
for(int j = 1; j <=n; j++)
{
d[i][j] = w[i][j];
}
}
int main()
{
fin >> n;
for(int i = 1; i<= n; i++)
for(int j = 1; j<=n; j++)
{
int c;
fin >> c;
if(c == 0 && i!=j)
w[i][j] = inf;
else
w[i][j] = c;
}
initializare();
for(int k = 1; k <=n; k++)
for(int i = 1; i<=n; i++)
for(int j = 1; j <=n; j++)
{
if(d[i][j] > d[i][k] + d[k][j])
{
d[i][j] = d[i][k] + d[k][j];
}
}
for(int i = 1; i <=n; i++)
{
for(int j = 1; j<=n; j++)
if(d[i][j] == inf)
fout<<0<<" ";
else
fout<<d[i][j]<<" ";
fout<<"\n";
}
return 0;
}