Pagini recente » Cod sursa (job #1876929) | Cod sursa (job #916924) | Cod sursa (job #794690) | Cod sursa (job #2467888) | Cod sursa (job #2389899)
#include <fstream>
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
int d[1000][1000], INF=999999;
int main()
{
int n, i, j;
in>>n;
for (i=1; i<=n; i++)
{
for (j=1; j<=n; j++)
{
in>>d[i][j];
if (i!=j && d[i][j] == 0)
d[i][j] = INF;
}
}
for (int k=1; k<=n; k++)
for (i=1; i<=n; i++)
for (j=1; j<=n; j++)
{
if (d[i][k] + d[k][j] < d[i][j])
d[i][j] = d[i][k] + d[k][j];
}
for (i=1; i<=n; i++)
{
for (j=1; j<=n; j++)
{
if (d[i][j] == INF || i==j)
out<<"0"<<" ";
else out<<d[i][j]<<" ";
}
out<<"\n";
}
return 0;
}