Pagini recente » Cod sursa (job #2139660) | Cod sursa (job #582920) | Cod sursa (job #877144) | Cod sursa (job #3181630) | Cod sursa (job #2438235)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
const int inf = 0x3f3f3f3f;
int d[105][105];
int main()
{
int n;
fin >> n;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++){
fin >> d[i][j];
if (i != j && d[i][j] == 0)
d[i][j] = inf;
}
for (int k = 1; k <= n; k++)
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
for (int i = 1; i <= n; i++){
for (int j = 1; j <= n; j++){
if (d[i][j] >= inf)
d[i][j] = 0;
fout << d[i][j] << ' ';
}
fout << '\n';
}
return 0;
}