Pagini recente » Cod sursa (job #1840116) | Cod sursa (job #69667) | Cod sursa (job #170626) | Cod sursa (job #2373443) | Cod sursa (job #1243004)
#include <fstream>
using namespace std ;
const int NMAX = 105 ;
ifstream cin("royfloyd.in") ;
ofstream cout("royfloyd.out") ;
int A[NMAX][NMAX], N;
inline void Floyd()
{
for(int k = 1 ; k <= N ; ++ k)
for(int i = 1 ; i <= N ; ++ i)
for(int j = 1 ; j <= N ; ++ j)
if(A[i][k] && A[k][j] && (A[i][j] > A[i][k] + A[k][j] || !A[i][j]) && i != j)
A[i][j] = A[i][k] + A[k][j] ;
}
inline void OUT()
{
for(int i = 1 ; i <= N ; ++ i)
{for(int j = 1 ; j <= N ; ++ j)
cout << A[i][j] << ' ' ;
cout << '\n' ;
}
}
int main()
{
cin >> N ;
for(int i = 1 ; i <= N ; ++ i)
for(int j = 1 ; j <= N ; ++ j)
cin >> A[i][j] ;
Floyd() ;
OUT() ;
cin.close() ;
cout.close() ;
return 0 ;
}