Pagini recente » Cod sursa (job #1956036) | Cod sursa (job #2476947) | Cod sursa (job #2987068) | Cod sursa (job #2746114) | Cod sursa (job #1533372)
#include <fstream>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int n,i,j,k,dist[101][101];
int main()
{
f>>n;
for (i=1;i<=n;i++)
for (j=1;j<=n;j++)
f>>dist[i][j];
for (k=1; k<=n;k++)
for (i=1;i<=n;i++)
for (j=1;j<=n;j++)
if (i!=k and j!=k and i!=j and dist[i][j] > dist[i][k] + dist[k][j])
dist[i][j] = dist[i][k] + dist[k][j];
for (i=1;i<=n;i++)
{
for (j=1;j<=n;j++)
g<<dist[i][j]<<" ";
g<<"\n";
}
return 0;
}