Pagini recente » Cod sursa (job #2464759) | Cod sursa (job #3169475) | Cod sursa (job #1481647) | Cod sursa (job #801007) | Cod sursa (job #3001028)
#include <fstream>
using namespace std;
ifstream cin("royfloyd.in");
ofstream cout("royfloyd.out");
const int dim = 101;
int G[dim][dim];
int main()
{
int n;
cin >> n;
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= n; ++j)
cin >> G[i][j];
for (int k = 1; k <= n; ++k)
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= n; ++j)
G[i][j] = min(G[i][j], G[i][k] + G[k][j]);
for (int i = 1; i <= n; ++i, cout << '\n')
for (int j = 1; j <= n; ++j)
cout << G[i][j] << ' ';
return 0;
}