Pagini recente » Cod sursa (job #880063) | Cod sursa (job #1019879) | Cod sursa (job #1757560) | Cod sursa (job #1236440) | Cod sursa (job #836964)
Cod sursa(job #836964)
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int i,j,n,k,m[101][101];
int main()
{fin>>n;
for(i=1;i<=n;++i)
for(j=1;j<=n;++j)
fin>>m[i][j];
for(k=1;k<=n;++k)
for(i=1;i<=n;++i)
for(j=1;j<=n;++j)
if((m[i][j]>m[i][k]+m[k][j]||m[i][j]==0)&&(i!=j)&&(i!=k)&&(j!=k))
{m[i][j]=m[i][k]+m[k][j];
}
for(i=1;i<=n;++i)
{
for(j=1;j<=n;++j)
fout<<m[i][j]<<" ";
fout<<'\n';
}
return 0;
}