Pagini recente » Cod sursa (job #1681528) | Cod sursa (job #2369958) | Solutii Winter Challenge 2008 runda 1 | Cod sursa (job #967587) | Cod sursa (job #1920147)
#include <fstream>
#include<climits>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n,i,j,a[100][100],x,k;
int main()
{fin>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
{fin>>x;a[i][j]=x;if(a[i][j]==0) a[i][j]=INT_MAX;
}
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) a[i][j]=0;
fout<<a[i][j]<<' '; fout<<'\n';
}
return 0;
}