Pagini recente » Cod sursa (job #640672) | Cod sursa (job #2637927) | Cod sursa (job #2636608) | Cod sursa (job #2315267) | Cod sursa (job #2691499)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
const int nmax = 105;
int n, a[nmax][nmax], d[nmax][nmax];
int main()
{
int i, j, k;
fin>>n;
for(i = 1; i <= n; ++i)
{
for(j = 1; j <= n; ++j)
{
if(i != j)
d[i][j] = 100005;
}
}
for(i = 1; i <= n; ++i)
{
for(j = 1; j <= n; ++j)
{
fin>>a[i][j];
d[i][j] = a[i][j];
}
}
for(k = 1; k <= n; ++k)
{
for(i = 1; i <= n; ++i)
{
for(j = 1; j <= n; ++j)
{
if(d[i][j] > d[i][k] + d[k][j])
d[i][j] = d[i][k] + d[k][j];
}
}
}
for(i = 1; i <= n; ++i)
{
for(j = 1; j <= n; ++j)
fout<<d[i][j]<<' ';
fout<<'\n';
}
return 0;
}