Pagini recente » Autentificare | Cod sursa (job #1506050) | Cod sursa (job #1938973) | Cod sursa (job #1878309) | Cod sursa (job #2480386)
#include<fstream>
#define MAX 101
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int a[MAX][MAX],n;
int main()
{
f >> n;
for (int i = 0; i < n; ++i)
{
for (int j = 0; j < n; ++j)
{
f >> a[i][j];
}
}
for (int k = 0; k < n; ++k)
{
for (int i = 0; i < n; ++i)
{
for (int j = 0; 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];
}
}
}
}
for (int i = 0; i < n; ++i)
{
for (int j = 0; j < n; ++j)
{
g << a[i][j] << ' ';
}
g << '\n';
}
}