Pagini recente » Cod sursa (job #1636261) | Cod sursa (job #2290967) | Cod sursa (job #561321) | Cod sursa (job #240945) | Cod sursa (job #584077)
Cod sursa(job #584077)
#include<fstream>
#include<math.h>
using namespace std;
int n,a[105][105];
int main()
{
int i,j,k;
ifstream fin("royfloyd.in");
fin>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
fin>>a[i][j];
fin.close();
for(k=1;k<=n;k++)
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
{
if(a[i][k]!=0 && a[k][j]!=0 && i!=j)
{
if(a[i][j]==0)
a[i][j]=a[i][k]+a[k][j];
else
a[i][j]=min(a[i][j],a[i][k]+a[k][j]);
}
}
ofstream fout("royfloyd.out");
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
fout<<a[i][j]<<' ';
fout<<"\n";
}
fout.close();
return 0;
}