Pagini recente » Cod sursa (job #1363942) | Cod sursa (job #609025) | Cod sursa (job #808101) | Cod sursa (job #1651387) | Cod sursa (job #767447)
Cod sursa(job #767447)
#include<iostream>
#include<fstream>
#include<algorithm>
using namespace std;
int n, a[105][105];
const int inf=int (2e8);
int main(void)
{
fstream f,g;
f.open("royfloyd.in",ios::in);
g.open("royfloyd.out",ios::out);
f>>n;
int i,j,k;
for(i=1;i<=n;i++)
for (j=1;j<=n;j++)
{
f>>a[i][j];
if (a[i][j]==0) a[i][j]=inf;
}
for (k=1;k<=n;k++)
for (i=1;i<=n;i++)
for (j=1;j<=n;j++)
if (i!=j && i!=k && j!=k)
a[i][j]=min(a[i][j],a[k][j]+a[i][k]);
for (i=1;i<=n;i++){
for (j=1;j<=n;j++){
if (a[i][j]==inf)
a[i][j]=0;
g<<a[i][j]<<" ";
}
g<<'\n';
}
}