Pagini recente » Cod sursa (job #2895011) | Cod sursa (job #190298) | Cod sursa (job #3282407) | Cod sursa (job #2730346) | Cod sursa (job #3244786)
#include <bits/stdc++.h>
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
int n;
int main() {
in >> n;
vector<vector<int>> dp(n, vector<int>(n, 0));
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++) {
in >> dp[i][j];
}
for (int k = 0; k < n; k++)
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++)
if (i != j)
dp[i][j] = min(dp[i][j], dp[i][k] + dp[k][j]);
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
out << dp[i][j] << ' ';
}
out << '\n';
}
return 0;
}