Pagini recente » Cod sursa (job #2533962) | Cod sursa (job #515579) | Cod sursa (job #317910) | Cod sursa (job #2390362) | Cod sursa (job #2231659)
#include <fstream>
#define MAX_N 105
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n;
int ponderi[MAX_N][MAX_N] = { 0 };
void RoyFloyd()
{
for (int k = 1; k <= n; k++)
{
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= n; j++)
{
if (i != j && i != k && ponderi[i][k] && ponderi[k][j])
{
int sum = ponderi[i][k] + ponderi[k][j];
if (ponderi[i][j] == 0)
{
ponderi[i][j] = sum;
}
if (ponderi[i][k] + ponderi[k][j] < ponderi[i][j])
{
ponderi[i][j] = sum;
}
}
}
}
}
}
int main(void)
{
fin >> n;
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= n; j++)
{
fin >> ponderi[i][j];
}
}
RoyFloyd();
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= n; j++)
{
fout << ponderi[i][j] << " ";
}
fout << endl;
}
fin.close();
fout.close();
return 0;
}