Pagini recente » Cod sursa (job #36756) | Cod sursa (job #2472093) | Cod sursa (job #1320377) | Cod sursa (job #969212) | Cod sursa (job #521211)
Cod sursa(job #521211)
#include<fstream>
using namespace std;
int n, c[50][50], d[50][50], urm[50][50];
void floyd()
{
int i,j,k;
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][j]>d[i][k]+d[k][j])
d[i][j]=d[i][k]+d[k][j];
else if(i!=j&&!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];
floyd();
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
g<<d[i][j];
g<<endl;
}
return 0;
}