Pagini recente » Cod sursa (job #2326092) | Cod sursa (job #934688) | Cod sursa (job #1097537) | Cod sursa (job #1234021) | Cod sursa (job #2812166)
#include <fstream>
#include <climits>
using namespace std;
ifstream cin("royfloyd") ;
ofstream cout("royfloyd") ;
long long n, m[109][109], c[109][109], d[109][109] ;
int main()
{
cin >> n ;
for(int f = 1 ; f <= n ; f ++)
for(int e = 1 ; e <= n ; e ++)
{
cin >> c[f][e] ;
if(f != e && c[f][e] == 0)
c[f][e] = INT_MAX / 2 ;
}
for(int k = 1 ; k <= n ; k ++)
for(int f = 1 ; f <= n ; f ++)
for(int e = 1 ; e <= n ; e ++)
if(c[f][k] + c[k][e] < c[f][e])
{
c[f][e] = c[f][k] + c[k][e] ;
d[f][e] = d[f][k] ;
}
for(int f = 1 ; f <= n ; f ++)
{
for(int e = 1 ; e <= n ; e ++)
cout << c[f][e] << " " ;
cout << '\n' ;
}
return 0;
}