Pagini recente » Cod sursa (job #899783) | Cod sursa (job #2623708) | Cod sursa (job #2047382) | Cod sursa (job #1417527) | Cod sursa (job #872629)
Cod sursa(job #872629)
#include<fstream>
#include<algorithm>
using namespace std;
int a[101][101][101],i,j,k,n;
int main()
{
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
f >> n;
for (i=1;i<=n;i++)
for (j=1;j<=n;j++)
f >> a[i][j][0];
for (k=1;k<=n;k++)
for (i=1;i<=n;i++)
for (j=1;j<=n;j++)
if (i!=j)
a[i][j][k]=min(a[i][j][k-1],a[i][k][k-1]+a[k][j][k-1]);
for (i=1;i<=n;i++)
{
for (j=1;j<=n;j++)
g << a[i][j][n] << ' ';
g << "\n";
}
return 0;
}