Pagini recente » Cod sursa (job #2033918) | Cod sursa (job #2933008) | Cod sursa (job #657537) | Cod sursa (job #452625) | Cod sursa (job #521230)
Cod sursa(job #521230)
#include<fstream>
const int INF=100000000;
using namespace std;
long long n, c[105][105], d[105][105];
void floyd()
{
long long k,i,j;
memcpy(d,c,sizeof(c));
for(k=1;k<=n;k++)
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if(d[i][j]>d[i][k]+d[k][j])
d[i][j]=d[i][k]+d[k][j];
}
int main()
{
int i,j;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
f>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++) {f>>c[i][j];if(i!=j&&c[i][j]==0) c[i][j]=INF;}
floyd();
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
if(d[i][j]==INF) g<<0<<" ";else g<<d[i][j]<<" ";
g<<endl;
}
return 0;
}