Pagini recente » Cei mai frumosi! | Istoria paginii runda/simulare-40-4 | Statistici Sbaroi Ionut-Alexandru (Ii7MoOdYxG4me) | Monitorul de evaluare | Cod sursa (job #1160147)
#include <fstream>
#define Nmax 101
#define INF 1<<30
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n,a[Nmax][Nmax];
void Roy_Floyd()
{
for(int k=1;k<=n;++k)
{
for(int i=1;i<=n;++i)
{
for(int j=1;j<=n;++j)
{
if((a[i][j] > a[i][k] + a[k][j] || !a[i][j]) && i!=j && a[i][k] && a[k][j])a[i][j] = a[i][k] + a[k][j];
}
}
}
}
int main()
{
fin>>n;
for(int i=1;i<=n;++i)
{
for(int j=1;j<=n;++j)
{
fin>>a[i][j];
//if(a[i][j]==0&&i!=j)a[i][j] = INF;
}
}
Roy_Floyd();
for(int i=1;i<=n;++i)
{
for(int j=1;j<=n;++j)
{
if(a[i][j] == INF)fout<<"0 ";
else fout<<a[i][j]<<" ";
}
fout<<'\n';
}
return 0;
}