Pagini recente » Cod sursa (job #934456) | Cod sursa (job #2265708) | Cod sursa (job #1987354) | Cod sursa (job #2460863) | Cod sursa (job #2586215)
#include<fstream>
#define inf 2000000000
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int d[101][101];
int n;
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 && d[i][k] != 0 && d[k][j] != 0)
{
if (d[i][j] == 0)
d[i][j] = d[i][k] + d[k][j];
else
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
}
}
int main()
{
f >> n;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
f >> d[i][j];
roy_floyd();
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= n; j++)
g << d[i][j] << ' ';
g << '\n';
}
}