Pagini recente » Cod sursa (job #1874005) | Monitorul de evaluare | Cod sursa (job #1100425) | Cod sursa (job #1981176) | Cod sursa (job #1726667)
#include <fstream>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int i,j,k,n,a[101][101];
int main()
{
f>>n;
for(i=1;i<=n;i++) for(j=1;j<=n;j++) f>>a[i][j];
for(k=1;k<=n;k++)
{
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
{
if(i==j) continue;
if(!(a[i][k]&&a[k][j])) continue;
if(a[i][j]==0) a[i][j]=a[i][k]+a[k][j];
else if(a[i][k]+a[k][j]<a[i][j]) a[i][j]=a[i][k]+a[k][j];
}
}
}
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++) g<<a[i][j]<<' ';
g<<'\n';
}
return 0;
}