Pagini recente » Cod sursa (job #2990723) | Cod sursa (job #1244484) | Cod sursa (job #3344074) | Cod sursa (job #797568) | Cod sursa (job #3335872)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n;
int adj[101][101];
int rf[101][101];
const int inf = 999999999;
void citire() {
fin >> n;
for(int i = 1; i <= n; i ++) {
for(int j = 1; j <= n; j ++) {
fin >> adj[i][j];
rf[i][j] = adj[i][j];
if (rf[i][j] == 0 && i != j)
rf[i][j] = inf;
}
}
}
void royfloyd() {
for(int k = 1; k <= n; k ++) {
for(int j = 1; j <= n; j ++) {
for(int i = 1; i <= n; i ++) {
if(rf[i][k] == inf || rf[k][j] == inf)
continue;
if(rf[i][j] > rf[i][k] + rf[k][j]) {
rf[i][j] = rf[i][k] + rf[k][j];
}
}
}
}
for(int i = 1; i <= n; i ++, fout << "\n")
for(int j = 1; j <= n; j ++)
if(rf[i][j] != inf)
fout << rf[i][j] << ' ';
else
fout << "0 ";
}
int main() {
citire();
royfloyd();
return 0;
}