Pagini recente » Cod sursa (job #777360) | Cod sursa (job #96592) | Cod sursa (job #1693676) | Istoria paginii utilizator/mililinca | Cod sursa (job #1738262)
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n, a[105][105];
void roy_floyd()
{
int i, j, 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][j] > a[i][k] + a[k][j] || a[i][j] == 0))
a[i][j] = a[i][k] + a[k][j];
}
int main()
{
int i, j;
fin>>n;
for(i=1; i<=n; i++)
for(j= 1; j<=n; j++) fin>>a[i][j];
roy_floyd();
for (i = 1; i <= n; i++)
{
for(j=1; j<=n; j++) fout<<a[i][j]<<" ";
fout<<'\n';
}
return 0;
}