Pagini recente » Borderou de evaluare (job #2821150) | Cod sursa (job #1098316) | Borderou de evaluare (job #1979249) | Borderou de evaluare (job #2377498) | Cod sursa (job #2424488)
#include <fstream>
#include <iostream>
#include <vector>
using namespace std;
int main() {
ifstream cin("royfloyd.in");
ofstream cout("royfloyd.out");
int n; cin >> n;
vector<vector<int>> d(n, vector<int> (n, 0));
for(int i = 0; i < n; i += 1) {
for(int j = 0; j < n; j += 1) {
cin >> d[i][j];
}
}
for(int k = 0; k < n; k += 1)
for(int i = 0; i < n; i += 1)
for(int j = 0; j < n; j += 1) {
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
}
for(int i = 0; i < n; i += 1) {
for(int j = 0; j < n; j += 1) {
cout << d[i][j] << " ";
}
cout << "\n";
}
}