Pagini recente » Cod sursa (job #1232838) | Cod sursa (job #1659609) | Cod sursa (job #2467821) | Cod sursa (job #2489954) | Cod sursa (job #2796320)
#include <iostream>
#include <fstream>
#define UNTIE ios::sync_with_stdio(0), fin.tie(0);
#define oo 2e9
using namespace std;
/**
Se ia fiecare nod intermediar pentru a afla drumul minim
*/
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int distmin[105][105], n;
int main()
{
UNTIE
int i, j, k;
fin >> n;
for(i = 1; i <= n; i++)
for(j = 1; j <= n; j++)
{
fin >> distmin[i][j];
if(i != j && distmin[i][j] == 0)
distmin[i][j] = oo;
}
for(k = 1; k <= n; k++)
for(i = 1; i <= n; i++)
for(j = 1; j <= n; j++)
if(i != j)
distmin[i][j] = min(distmin[i][j], distmin[i][k] + distmin[k][j]);
for(i = 1; i <= n; i++)
for(j = 1; j <= n; j++)
if(distmin[i][j] == oo)
distmin[i][j] = 0;
for(i = 1; i <= n; i++)
{
for(j = 1; j <= n; j++)
fout << distmin[i][j] << " ";
fout << "\n";
}
return 0;
}