Pagini recente » Cod sursa (job #419135) | Cod sursa (job #1200808) | Cod sursa (job #265497) | Cod sursa (job #3268790) | Cod sursa (job #2739388)
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int main()
{
int n;
fin >> n;
int** a = new int*[n];
for (int i = 0; i < n; ++i)
a[i] = new int[n];
for (int i = 0; i < n; ++i)
for (int j = 0; j < n; ++j)
fin >> a[i][j];
for (int i = 0; i < n; ++i)
{
for (int j = 0; j < n; ++j)
{
for (int k = 0; k < n; ++k)
{
a[i][j] = min(a[i][j], a[i][k] + a[k][j]);
}
}
}
for (int i = 0; i < n; ++i, fout << '\n')
{
for (int j = 0; j < n; ++j)
{
fout << a[i][j] << ' ';
}
delete a[i];
}
delete[] a;
return 0;
}