Pagini recente » Cod sursa (job #655801) | Cod sursa (job #325910) | Cod sursa (job #606701) | Cod sursa (job #1076832) | Cod sursa (job #2109799)
#include <fstream>
using namespace std;
int n,a[101][101],d[101][101];
int main()
{
int N=99999;
ifstream fin("royfloyd.in");
ofstream cout("royfloyd.out");
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)
d[i][j]=N;
else
d[i][j]=a[i][j];
}
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]);
for(int i=1; i<=n; i++)
{
for(int j=1; j<=n; j++)
if(d[i][j]==N)
cout<<0<<" ";
else
cout<<d[i][j]<<" ";
cout<<'\n';
}
return 0;
}