Pagini recente » Cod sursa (job #1916423) | Borderou de evaluare (job #949997) | Cod sursa (job #234903) | Cod sursa (job #2568711) | Cod sursa (job #3271500)
#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>> graph(n + 1, vector<int>(n + 1, 0));
for(int i = 1; i <= n; i++) {
for(int j = 1; j <= n; j++) {
fin >> graph[i][j];
}
}
for(int k = 1; k <= n; k++) {
for(int i = 1; i <= n; i++) {
for(int j = 1; j <= n; j++) {
if(graph[i][j] > graph[i][k] + graph[k][j]) {
graph[i][j] = graph[i][k] + graph[k][j];
}
}
}
}
for(int i = 1; i <= n; i++) {
for(int j = 1; j <= n; j++) {
fout << graph[i][j] << ' ';
}
fout << endl;
}
return 0;
}