Pagini recente » Cod sursa (job #780231) | Cod sursa (job #1209233) | Cod sursa (job #2436530) | Cod sursa (job #18604) | Cod sursa (job #256162)
Cod sursa(job #256162)
#include <iostream>
using namespace std;
#define nmax 100
#define INFI 999999999
int N, A[nmax][nmax];
int main ()
{
freopen ("royfloyd.in", "r", stdin);
freopen ("royfloyd.out", "w", stdout);
cin>>N;
for (int i=0; i<N; ++i)
for (int j=0; j<N; ++j)
{
cin>>A[i][j];
if (A[i][j]==0) A[i][j]=INFI;
}
for (int k=0; k<N; ++k)
for (int i=0; i<N; ++i)
for (int j=0; j<N; ++j)
if (A[i][k]+A[k][j]<A[i][j])
A[i][j]=A[i][k]+A[k][j];
for (int i=0; i<N; ++i)
{
for (int j=0; j<N; ++j)
if (A[i][j]==INFI || i==j) cout<<"0 ";
else cout << A[i][j]<<' ';
cout<<'\n';
}
return 0;
}