Pagini recente » Cod sursa (job #1144459) | juniori_2011_1 | Rating Robert Galan (mi2din2007) | Cod sursa (job #2858566) | Cod sursa (job #3177095)
#include <bits/stdc++.h>
using namespace std;
int n, m;
int dist[101][101];
void royfloyd() {
for (int k = 1; k <= n; ++k) {
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= n; ++j) {
if (i != j && dist[i][k] && dist[k][j] && (dist[i][k] + dist[k][j] < dist[i][j] || dist[i][j] == 0)) {
dist[i][j] = dist[i][k] + dist[k][j];
}
}
}
}
}
int main() {
ifstream cin("royfloyd.in");
ofstream cout("royfloyd.out");
cin >> n >> m;
for (int i = 1; i <= m; ++i) {
int x, y, c;
cin >> x >> y >> c;
dist[x][y] = c;
}
royfloyd();
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= n; ++j) {
if (dist[i][j] == 0 && i != j) {
cout << -1;
} else {
cout << dist[i][j];
}
cout << " ";
}
cout << "\n";
}
}