Pagini recente » Borderou de evaluare (job #571005) | Cod sursa (job #471800) | Borderou de evaluare (job #2708090) | Cod sursa (job #1646855) | Cod sursa (job #2128820)
#include <fstream>
#define oo 100000
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int a[101][101], n;
void wfl()
{
for (int k = 1; k <= n; k++)
{
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= n; j++)
{
if (i != j)
if (a[i][k] && a[k][j])
a[i][j] = min(a[i][j], a[i][k] + a[k][j]);
}
}
}
}
int main()
{
fin >> n;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
{
fin >> a[i][j];
if (a[i][j] == 0) a[i][j] = oo;
}
wfl();
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= n; j++)
{
if (a[i][j] != oo)
fout << a[i][j] << ' ';
else
fout << 0 << ' ';
}
fout << '\n';
}
return 0;
}