Pagini recente » Cod sursa (job #1009837) | Cod sursa (job #692645) | Cod sursa (job #781063) | Cod sursa (job #2893526) | Cod sursa (job #2570092)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
const int N = 103, INF = (1 << 30) - 1;
int mat[N][N], d[N][N], n;
void init()
{
for(int i = 1; i <= n; i++){
for(int j = i + 1; j <= n; j++){
d[i][j] = INF;
}
for(int j = 1; j < i; j++){
d[i][j] = INF;
}
}
}
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] == 0 && i != j){
mat[i][j] = INF;
}
}
}
///init();
for(int k = 1; k <= n; k++){
for(int i = 1; i <= n; i++){
for(int j = 1; j <= n; j++){
if(mat[i][k] + mat[k][j] < mat[i][j]){
mat[i][j] = mat[i][k] + mat[k][j];
///pred[i][j] = pred[k]][j];
}
}
}
}
for(int i = 1; i <= n; i++){
for(int j = 1; j <= n; j++){
if (mat[i][j] == INF && i != j) mat[i][j] = 0;
out << mat[i][j] << " ";
}
out << "\n";
}
return 0;
}