Pagini recente » Cod sursa (job #2842973) | Cod sursa (job #2679154) | Cod sursa (job #1642362) | Cod sursa (job #2377528) | Cod sursa (job #2382228)
#include <fstream>
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
int n, a[101][101];
void citire()
{
in >> n;
for (int i = 1; i <= n; ++i)
{
for (int j = 1; j <= n; ++j)
in >> a[i][j];
}
}
void royFloyd()
{
for (int k = 1; k <= n; ++k)
{
for (int i = 1; i <= n; ++i)
{
for (int j = 1; j <= n; ++j)
{
if (a[i][k] && a[k][j] && (a[i][j] > a[i][k] + a[k][j] || !a[i][j]) && i != j)
a[i][j] = a[i][k] + a[k][j];
}
}
}
}
int main()
{
citire();
royFloyd();
for (int i = 1; i <= n; ++i)
{
for (int j = 1; j <= n; ++j)
out << a[i][j] << " ";
out << '\n';
}
return 0;
}