Pagini recente » Cod sursa (job #2507837) | Cod sursa (job #3235058) | Cod sursa (job #665323) | Cod sursa (job #271523) | Cod sursa (job #1341942)
#include <fstream>
using namespace std;
int main()
{
int N, i, j;
ifstream f("royfloyd.in");
f >> N;
int a[N + 1][N + 1];
for (i = 1; i <= N; i++)
for (j = 1; j <= N; j++)
f >> a[i][j];
f.close();
int k;
for (k = 1; k <= N; k++)
for (i = 1; i <= N; i++)
for (j = 1; j <= N; j++)
if (i != j && a[i][k] && a[k][j] && (a[i][k] + a[k][j] < a[i][j] || !a[i][j]))
a[i][j] = a[i][k] + a[k][j];
ofstream g("royfloyd.out");
for (i = 1; i <= N; i++)
{
for (j = 1; j <= N; j++)
g << a[i][j] << " ";
g << '\n';
}
g.close();
return 0;
}