Pagini recente » Cod sursa (job #1760559) | Cod sursa (job #2481694) | Cod sursa (job #1594779) | Cod sursa (job #1517512) | Cod sursa (job #2615569)
#include <fstream>
#include <climits>
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
long long n, mat[101][101];
void Roy_floyd() {
for(int k = 1; k <= n; ++k)
for(int i = 1; i <= n; ++i)
for(int j = 1; j <= n; ++j)
if(i != j && k != i) {
long long mix = mat[i][k] + mat[k][j];
if(mix < mat[i][j]) {
mat[i][j] = mix;
}
}
}
int main() {
in >> n;
for(int i = 1; i <= n; ++i)
for(int j = 1; j <= n; ++j) {
in >> mat[i][j];
if(!mat[i][j] && i != j)
mat[i][j] = INT_MAX;
}
Roy_floyd();
for(int i = 1; i <= n; ++i, out << '\n')
for(int j = 1; j <= n; ++j)
out << mat[i][j] << ' ';
return 0;
}