Pagini recente » Cod sursa (job #60782) | Cod sursa (job #2047507) | Cod sursa (job #2756265) | Cod sursa (job #100527) | Cod sursa (job #256155)
Cod sursa(job #256155)
#include <iostream>
using namespace std;
#define nmax 100
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];
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)
cout << A[i][j]<<' ';
cout<<'\n';
}
return 0;
}