Pagini recente » Cod sursa (job #820036) | Cod sursa (job #2693851) | Cod sursa (job #280616) | Cod sursa (job #2520390) | Cod sursa (job #1676730)
#include <fstream>
#define nMax 103
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n;
int a[nMax][nMax];
void read()
{
fin>>n;
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
fin>>a[i][j];
}
void solve()
{
for(int k=1;k<=n;k++)
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
if(a[i][k] && a[k][j] && (a[i][j]>a[i][k]+a[k][j] || !a[i][j]) && i!=j)
a[i][j]=a[i][k]+a[k][j];
}
void write()
{
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
fout<<a[i][j]<<" ";
fout<<'\n';
}
}
int main()
{
read();
solve();
write();
return 0;
}