Pagini recente » Cod sursa (job #751412) | Cod sursa (job #1269437) | Cod sursa (job #1362613) | Cod sursa (job #2180960) | Cod sursa (job #1920165)
#include <fstream>
#include<climits>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n,i,j,a[101][101],k;
int main()
{fin>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
{fin>>a[i][j];if(a[i][j]==0) a[i][j]=INT_MAX/2;
}
for(k=1;k<=n;k++)
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if(i!=j)
a[i][j]=min(a[i][j],a[i][k]+a[k][j]);
for(i=1;i<=n;i++)
{for(j=1;j<=n;j++)
if(a[i][j]==INT_MAX/2) fout<<"0"<<' '; else
fout<<a[i][j]<<' '; fout<<'\n';}
return 0;
}