Pagini recente » Cod sursa (job #2887557) | Cod sursa (job #2483545) | Cod sursa (job #2549596) | Cod sursa (job #2167676) | Cod sursa (job #2098921)
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n, g[100][100];
int main() {
//INPUT
fin >> n;
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++)
fin >> g[i][j];
//ALGORITHM
for (int k = 0; k < n; k++)
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++)
if (i != j && g[i][k] && g[k][j] && (!g[i][j] || g[i][j] > g[i][k] + g[k][j]))
g[i][j] = g[i][k] + g[k][j];
//OUTPUT
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++)
fout << g[i][j] << " ";
fout << "\n";
}
return 0;
}