Pagini recente » Cod sursa (job #2281881) | Cod sursa (job #3136741) | Cod sursa (job #2891026) | Cod sursa (job #2686120) | Cod sursa (job #3213747)
#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;
using pii = pair<int,int>;
ifstream cin("royfloyd.in");
ofstream cout("royfloyd.out");
const int nmax = 1e2 + 1;
int c[nmax][nmax] , n;
signed main()
{
cin >> n;
for(int i = 1 ; i <= n ; ++i)
for(int j = 1 ; j <= n ; ++j) cin >> c[i][j];
for(int k = 1 ; k <= n ; ++k)
{
for(int i = 1 ; i <= n ; ++i)
{
for(int j = 1 ; j <= n ; ++j)
{
c[i][j] = min(c[i][j],c[i][k] + c[k][j]);
}
}
}
for(int i = 1 ; i <= n ; ++i)
{
for(int j = 1 ; j <= n ; ++j) cout << c[i][j] << ' ';
cout << '\n';
}
return 0;
}