Pagini recente » Cod sursa (job #3353466) | Cod sursa (job #2232804) | Cod sursa (job #2069633) | Borderou de evaluare (job #1513763) | Cod sursa (job #3322579)
#include <fstream>
using namespace std;
ifstream cin("royfloyd.in");
ofstream cout("royfloyd.out");
short int n,a[101][101];
void roy_floyd()
{
short int i,j,k;
for(k=1;k<=n;k++)
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if (a[i][k] && a[k][j] && (a[i][j] > a[i][k] + a[k][j] || a[i][j]==0) && i != j)
a[i][j] = a[i][k] + a[k][j];
}
int main()
{
cin>>n;
for(short int i=1;i<=n;i++)
for(short int j=1;j<=n;j++)
cin>>a[i][j];
roy_floyd();
for(short int i=1;i<=n;i++)
{
for(short int j=1;j<=n;j++)
cout<<a[i][j]<<" ";
cout<<'\n';
}
return 0;
}