Pagini recente » Cod sursa (job #2519298) | Cod sursa (job #3151957) | Rezultatele filtrării | Cod sursa (job #505271) | Cod sursa (job #1096663)
#include<fstream>
using namespace std;
int i,j,k,n,a[105][105];
int main(void) {
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
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 (i!=j&&a[i][k]!=0&&a[k][j]!=0&&(a[i][k]+a[k][j]<a[i][j]||a[i][j]==0) ) a[i][j]=a[i][k]+a[k][j];
for (i=1; i<=n; ++i, fout<<"\n")
for (j=1; j<=n; ++j) fout<<a[i][j]<<" ";
return(0);
}