Pagini recente » Cod sursa (job #2952795) | Cod sursa (job #672472) | Cod sursa (job #1786628) | Cod sursa (job #1870157) | Cod sursa (job #1817144)
#include<iostream>
#include<fstream>
#define oo 1<<29
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int D[105][105],N;
void Read()
{
fin>>N;
for(int i =1;i<=N;++i)
for(int j=1;j<=N;++j)
{
int x;
fin>>x;
if(!x && i != j)
D[i][j]=oo;
else
D[i][j]=x;
}
}
void Solve()
{
for(int k=1;k<= N;++k)
for(int i=1;i<=N;++i)
for(int j =1;j<= N;++j)
D[i][j]=min(D[i][j],D[i][k]+D[k][j]);
}
void Print()
{
for(int i=1;i<=N;++i)
{
for(int j=1;j<=N;++j)
{
if(D[i][j]==oo)
fout<<"0 ";
else
fout<<D[i][j]<<" ";
}
fout<<"\n";
}
}
int main()
{
Read();
Solve();
Print();
return 0;
}