Pagini recente » Cod sursa (job #725912) | Cod sursa (job #2625648) | Cod sursa (job #737039) | Cod sursa (job #1152171) | Cod sursa (job #2697068)
#include <fstream>
using namespace std;
ifstream f("royfloyd.in"); ofstream g("royfloyd.out");
int n, inf=1000000000, a[102][102];
int main()
{ f>>n;
for(int i=1; i<=n; ++i)
for(int j=1; j<=n; ++j)
{ f>>a[i][j];
if(i!=j && a[i][j]==0) a[i][j]=inf;
}
for(int k=1; k<=n; ++k)
for(int i=1; i<=n; ++i)
for(int j=1; j<=n; ++j)
if(i!=j && a[i][j]>a[i][k]+a[k][j]) a[i][j]=a[i][k]+a[k][j];
for(int i=1; i<=n; ++i)
for(int j=1; j<=n; ++j)
if(a[i][j]==inf) a[i][j]=0;
for(int i=1; i<=n; ++i)
{ for(int j=1; j<=n; ++j) g<<a[i][j]<<' ';
g<<'\n';
}
return 0;
}