Pagini recente » Cod sursa (job #2516482) | Cod sursa (job #1479893) | Cod sursa (job #2274379) | Cod sursa (job #1825346) | Cod sursa (job #2039551)
#include <fstream>
#define MAX 105
#define INF 1000000
using namespace std;
ifstream fi("royfloyd.in");
ofstream fo("royfloyd.out");
int n,D[MAX][MAX];
int main()
{
fi>>n;
for (int i=1; i<=n; i++)
for (int j=1; j<=n; j++)
fi>>D[i][j];
for (int k=1; k<=n; k++)
for (int i=1; i<=n; i++)
for (int j=1; j<=n; j++)
if (D[i][k] && D[k][j] && (!D[i][j] ||
D[i][k]+D[k][j]<D[i][j]) && i!=j)
D[i][j]=D[i][k]+D[k][j];
for (int i=1; i<=n; i++)
{
for (int j=1; j<=n; j++)
fo<<D[i][j]<<" ";
fo<<"\n";
}
return 0;
}