Pagini recente » Cod sursa (job #2832861) | Cod sursa (job #2770001) | Cod sursa (job #608302) | Cod sursa (job #2784715) | Cod sursa (job #3276760)
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
int main()
{
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n;
fin >> n;
vector<vector<int>> D(n +1, vector<int>(n + 1, 0));
vector<vector<int>> W(n + 1, vector<int>(n + 1, 0));
for(int i = 1; i <= n; i++) {
for(int j = 1; j <= n; j++) {
fin >> D[i][j];
}
}
for(int k = 1; k <= n; k++) {
for(int i = 1; i <= n; i++) {
for(int j = 1; j <= n; j++) {
if(D[i][j] > D[i][k] + D[k][j]) {
D[i][j] = D[i][k] + D[k][j];
}
}
}
}
for(int i = 1; i <= n; i++) {
for(int j = 1; j <= n; j++) {
fout << D[i][j] << ' ';
}
fout << endl;
}
return 0;
}