Pagini recente » Cod sursa (job #2154980) | Cod sursa (job #2960609) | Cod sursa (job #2338495) | Cod sursa (job #2099438) | Cod sursa (job #872640)
Cod sursa(job #872640)
#include<fstream>
#include<algorithm>
using namespace std;
int a[101][101],b[101][101],i,j,k,n;
int main()
{
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
f >> n;
for (i=1;i<=n;i++)
for (j=1;j<=n;j++)
{
f >> a[i][j];
if ((a[i][j]==0) && (i!=j))
a[i][j]=1 << 20;
}
for (k=1;k<=n;k++)
{
for (i=1;i<=n;i++)
for (j=1;j<=n;j++)
b[i][j]=min(a[i][j],a[i][k]+a[k][j]);
for (i=1;i<=n;i++)
for (j=1;j<=n;j++)
a[i][j]=b[i][j];
}
for (i=1;i<=n;i++)
{
for (j=1;j<=n;j++)
g << a[i][j] << ' ';
g << "\n";
}
return 0;
}