Pagini recente » Cod sursa (job #2102946) | Cod sursa (job #3003946) | Cod sursa (job #672836) | Cod sursa (job #5498) | Cod sursa (job #2484192)
#include <fstream>
#include <cstring>
using namespace std;
ifstream cin ("royfloyd.in");
ofstream cout ("royfloyd.out");
void royfloyd(int a[][101],int n)
{
for(int k=1;k<=n;++k)
for(int i=1;i<=n;++i)
if(i == k )continue;
else
for(int j=1;j<=n;++j)
if(j == i || j == k)continue;
else
a[i][j] min(a[i][j] , a[i][k] + a[k][j]) ;
}
int main()
{
int a[101][101],n;
cin >> n;
for(int i=1;i<=n;++i)
for(int j=1;j<=n;++j)a[i][j] = INT_MAX;
for(int i=1;i<=n;++i)
for(int j=1;j<=n;++j)cin >> a[i][j];
royfloyd(a,n);
for(int i=1;i<=n;++i)
{
for(int j=1;j<=n;++j)
if(a[i][j] != INT_MAX)cout << a[i][j] << ' ';
else cout << "0 ";
cout<<'\n';
}
}