Pagini recente » Cod sursa (job #2689869) | Cod sursa (job #2072946) | Cod sursa (job #1351258) | Cod sursa (job #2885306) | Cod sursa (job #402890)
Cod sursa(job #402890)
#include<fstream>
#define MaxN 105
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int a[MaxN][MaxN],i,j,k,n;
int main()
{ fin>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
fin>>a[i][j];
for(k=1;k<=n;k++)
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if(a[i][k]&&a[k][j]&&(a[i][j]>a[i][k]+a[k][j]||!a[i][j])&&i!=j)
a[i][j]=a[i][k]+a[k][j];
for(i=1;i<=n;i++)
{ for(j=1;j<=n;j++)
fout<<a[i][j]<<' ';
fout<<'\n';
}
}