Pagini recente » Cod sursa (job #2790551) | Cod sursa (job #111989) | Cod sursa (job #66077) | Cod sursa (job #3210720) | Cod sursa (job #521215)
Cod sursa(job #521215)
#include<fstream>
using namespace std;
long long n, c[105][105], d[105][105];
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][k]&&d[k][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;
}