Pagini recente » Cod sursa (job #1970884) | Borderou de evaluare (job #2893295) | Cod sursa (job #3274118) | Borderou de evaluare (job #2623218) | Cod sursa (job #1970886)
#include <fstream>
#include <algorithm>
#include <vector>
using namespace std;
const int NMAX = 107;
ifstream cin("royfloyd.in");
ofstream cout("royfloyd.out");
int n;
int dp[NMAX][NMAX];
int main() {
cin >> n;
for(int i = 1; i <= n; ++i) {
for(int j = 1; j <= n; ++j) {
cin >> dp[i][j];
}
}
for(int k = 1; k <= n; ++k) {
for(int i = 1; i <= n; ++i) {
for(int j = 1; j <= n; ++j) {
if(i != j && i != k && j != k && dp[i][k] != 0 && dp[k][j] != 0 && (dp[i][j] > dp[i][k] + dp[k][j] || dp[i][j] == 0)) {
dp[i][j] = dp[i][k] + dp[k][j];
}
}
}
}
for(int i = 1; i <= n; ++i) {
for(int j = 1; j <= n; ++j) {
cout << dp[i][j] << " ";
}
cout << "\n";
}
return 0;
}