Pagini recente » Cod sursa (job #1700650) | Cod sursa (job #145) | Cod sursa (job #1870) | Cod sursa (job #3214799) | Cod sursa (job #3001043)
#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)
if (G[i][k] && G[k][j] && i != j && (!G[i][j] || G[i][j] > G[i][k] + G[k][j]))
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;
}