Pagini recente » Cod sursa (job #2297567) | Cod sursa (job #2233115) | Cod sursa (job #2320129) | Cod sursa (job #268217) | Cod sursa (job #2222767)
#include <bits/stdc++.h>
using namespace std;
int N;
int adj[500][500];
const int INF = 0x3f3f3f3f;
int main()
{
freopen("royfloyd.in", "r", stdin);
freopen("royfloyd.out", "w", stdout);
cin >> N;
for (int i = 1; i <= N; ++i)
for (int j = 1; j <= N; ++j) {
cin >> adj[i][j];
if (adj[i][j] == 0)
adj[i][j] = INF;
}
for (int opt = 1; opt <= N; ++opt)
for (int i = 1; i <= N; ++i)
if (opt != i)
for (int j = 1; j <= N; ++j)
if (opt != j && i != j)
adj[i][j] = min(adj[i][j], adj[i][opt] + adj[opt][j]);
for (int i = 1; i <= N; ++i) {
for (int j = 1; j <= N; ++j) {
if (adj[i][j] >= INF)
adj[i][j] = 0;
cout << adj[i][j] << " ";
}
cout << "\n";
}
return 0;
}