Pagini recente » Cod sursa (job #1585465) | Cod sursa (job #1767413) | Cod sursa (job #1108591) | Cod sursa (job #2299192) | Cod sursa (job #2536050)
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
const int NMAX = 100;
const int INF = 1e7;
int N, a[NMAX + 5][NMAX + 5];
int main()
{
fin >> N;
for(int i = 1; i <= N; i++)
for(int j = 1; j <= N; j++)
{
fin >> a[i][j];
if(a[i][j] == 0)
a[i][j] = INF;
}
for(int pivot = 1; pivot <= N; pivot++)
for(int i = 1; i <= N; i++)
for(int j = 1; j <= N; j++)
if(i != j && i != pivot && j != pivot && a[i][pivot] != INF && a[pivot][j] != INF)
a[i][j] = min(a[i][j], a[i][pivot] + a[pivot][j]);
for(int i = 1; i <= N; i++)
{
for(int j = 1; j <= N; j++)
if(a[i][j] == INF) fout << 0 << ' ';
else fout << a[i][j] << ' ';
fout << '\n';
}
return 0;
}