Pagini recente » Cod sursa (job #2596065) | Cod sursa (job #136152) | Cod sursa (job #1687443) | Cod sursa (job #1898756) | Cod sursa (job #2295135)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("royfloyd.in"); ofstream g("royfloyd.out");
int n; int a[105][105];
void rf() {
int i,j,k;
for(k = 1 ; k <= n; ++k) {
for(i = 1; i <= n; ++i) {
for(j = 1; j <= n; ++j) {
if ( (i != j) && (a[i][k]) && (a[k][j]) && ( (a[i][k] + a[k][j] < a[i][j]) || (a[i][j] == 0) ) ) {
a[i][j] = a[i][k] + a[k][j];
}
}
}
}
}
int main() {
int i,j;
f>>n;
for(i = 1; i <= n; ++i) {
for(j = 1; j <= n; ++j) {
f>>a[i][j];
}
}
rf();
for(i = 1; i <= n; ++i) {
for(j = 1; j <= n; ++j) {
g<<a[i][j]<<' ';
}
g<<'\n';
}
return 0;
}