Pagini recente » Cod sursa (job #3298983) | Cod sursa (job #2560020) | Cod sursa (job #794932) | Cod sursa (job #1276758) | Cod sursa (job #2366931)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("royfloyd.in"); ofstream g("royfloyd.out");
int n; int a[105][105];
void RoyFloyd() {
int i,j,k;
for(k = 1; k <= n; ++k) {
for(i = 1; i <= n; ++i) {
for(j = 1; j <= n; ++j) {
if(a[i][k] && a[k][j] && i != j && (a[i][k] + a[k][j] < a[i][j] || !a[i][j])) {
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];
}
}
RoyFloyd();
for(i = 1; i <= n; ++i) {
for(j = 1; j <= n; ++j) {
g<<a[i][j]<<' ';
}
g<<'\n';
}
return 0;
}